Lines Matching refs:set
266 if len(set(indices)) == r:
274 self.assertEqual(len(result), len(set(result))) # no repeats
278 self.assertEqual(len(set(c)), r) # no duplicate elements
298 self.assertEqual(len(set(map(id, combinations('abcde', 3)))), 1)
299 self.assertNotEqual(len(set(map(id, list(combinations('abcde', 3))))), 1)
354 self.assertEqual(len(result), len(set(result))) # no repeats
361 self.assertTrue(set(result) >= set(regular_combs)) # rest should be supersets of regular combs
366 self.assertEqual(len(noruns), len(set(noruns))) # no repeats other than consecutive
386 self.assertEqual(len(set(map(id, cwr('abcde', 3)))), 1)
387 self.assertNotEqual(len(set(map(id, list(cwr('abcde', 3))))), 1)
429 if len(set(indices)) == r:
437 self.assertEqual(len(result), len(set(result))) # no repeats
441 self.assertEqual(len(set(p)), r) # no duplicate elements
459 self.assertEqual(len(set(map(id, permutations('abcde', 3)))), 1)
460 self.assertNotEqual(len(set(map(id, list(permutations('abcde', 3))))), 1)
481 self.assertEqual(prod, sorted(set(prod)))
482 self.assertEqual(cwr, sorted(set(cwr)))
483 self.assertEqual(perm, sorted(set(perm)))
484 self.assertEqual(comb, sorted(set(comb)))
488 self.assertEqual(perm, [t for t in prod if len(set(t))==r]) # perm: prods with no dups
490 self.assertEqual(comb, [t for t in cwr if len(set(t))==r]) # comb: cwrs without dups
491 self.assertEqual(comb, list(filter(set(cwr).__contains__, perm))) # comb: perm that is a cwr
492 self.assertEqual(comb, list(filter(set(perm).__contains__, cwr))) # comb: cwr that is a perm
493 self.assertEqual(comb, sorted(set(cwr) & set(perm))) # comb: both a cwr and a perm
793 expectedkeys = set([r[0] for r in s])
794 self.assertEqual(set(keys), expectedkeys)
1130 set('abcdefg'), range(11), tuple(range(13))]
1147 self.assertEqual(len(set(map(id, product('abc', 'def')))), 1)
1148 self.assertNotEqual(len(set(map(id, list(product('abc', 'def'))))), 1)
1577 start.set()
1588 finish.set()