Lines Matching refs:combinations
211 self.assertRaises(TypeError, combinations, 'abc') # missing r argument
212 self.assertRaises(TypeError, combinations, 'abc', 2, 1) # too many arguments
213 self.assertRaises(TypeError, combinations, None) # pool is not iterable
214 self.assertRaises(ValueError, combinations, 'abc', -2) # r is negative
217 self.assertEqual(list(op(combinations('abc', 32))), []) # r > n
219 self.assertEqual(list(op(combinations('ABCD', 2))),
221 testIntermediate = combinations('ABCD', 2)
226 self.assertEqual(list(op(combinations(range(4), 3))),
228 testIntermediate = combinations(range(4), 3)
272 result = list(combinations(values, r))
277 self.assertEqual(len(c), r) # r-length combinations
288 self.pickletest(proto, combinations(values, r)) # test pickling
293 combinations("AA", 2**29)
298 self.assertEqual(len(set(map(id, combinations('abcde', 3)))), 1)
299 self.assertNotEqual(len(set(map(id, list(combinations('abcde', 3))))), 1)
357 regular_combs = list(combinations(values, r)) # compare to combs without replacement
364 self.assertEqual(len(c), r) # r-length combinations
464 # combinations() and combinations_with_replacement().
472 comb = list(combinations(s, r))
1616 # bpo-42536: combinations's tuple-reuse speed trick breaks the GC's
1619 it = combinations([None, []], 1)
1696 self.assertEqual(list(combinations('ABCD', 2)),
1698 self.assertEqual(list(combinations(range(4), 3)),
1832 self.makecycle(combinations([1,2,a,3], 3), a)
2335 check(combinations('abcd', 3), basesize + 3 * self.ssize_t)
2336 check(combinations(range(10), 4), basesize + 4 * self.ssize_t)