@@ -317,11 +317,13 @@ def test_symmetric_difference(self, index):
317
317
(None , None , None ),
318
318
],
319
319
)
320
- def test_corner_union (self , index_flat_unique , fname , sname , expected_name ):
320
+ def test_corner_union (self , index_flat , fname , sname , expected_name ):
321
321
# GH#9943, GH#9862
322
322
# Test unions with various name combinations
323
323
# Do not test MultiIndex or repeats
324
- index = index_flat_unique
324
+ if not index_flat .is_unique :
325
+ pytest .skip ("Randomly generated index_flat was not unique." )
326
+ index = index_flat
325
327
326
328
# Test copy.union(copy)
327
329
first = index .copy ().set_names (fname )
@@ -361,8 +363,10 @@ def test_corner_union(self, index_flat_unique, fname, sname, expected_name):
361
363
(None , None , None ),
362
364
],
363
365
)
364
- def test_union_unequal (self , index_flat_unique , fname , sname , expected_name ):
365
- index = index_flat_unique
366
+ def test_union_unequal (self , index_flat , fname , sname , expected_name ):
367
+ if not index_flat .is_unique :
368
+ pytest .skip ("Randomly generated index_flat was not unique." )
369
+ index = index_flat
366
370
367
371
# test copy.union(subset) - need sort for unicode and string
368
372
first = index .copy ().set_names (fname )
@@ -381,10 +385,12 @@ def test_union_unequal(self, index_flat_unique, fname, sname, expected_name):
381
385
(None , None , None ),
382
386
],
383
387
)
384
- def test_corner_intersect (self , index_flat_unique , fname , sname , expected_name ):
388
+ def test_corner_intersect (self , index_flat , fname , sname , expected_name ):
385
389
# GH#35847
386
390
# Test intersections with various name combinations
387
- index = index_flat_unique
391
+ if not index_flat .is_unique :
392
+ pytest .skip ("Randomly generated index_flat was not unique." )
393
+ index = index_flat
388
394
389
395
# Test copy.intersection(copy)
390
396
first = index .copy ().set_names (fname )
@@ -424,8 +430,10 @@ def test_corner_intersect(self, index_flat_unique, fname, sname, expected_name):
424
430
(None , None , None ),
425
431
],
426
432
)
427
- def test_intersect_unequal (self , index_flat_unique , fname , sname , expected_name ):
428
- index = index_flat_unique
433
+ def test_intersect_unequal (self , index_flat , fname , sname , expected_name ):
434
+ if not index_flat .is_unique :
435
+ pytest .skip ("Randomly generated index_flat was not unique." )
436
+ index = index_flat
429
437
430
438
# test copy.intersection(subset) - need sort for unicode and string
431
439
first = index .copy ().set_names (fname )
0 commit comments