Lines Matching +full:repeat +full:- +full:element
14 minsize = -maxsize-1
25 'Non-restartable source sequence'
61 for element in it:
62 yield element
82 self.assertRaises(ValueError, combinations, 'abc', -2) # r is negative
97 if indices[i] != i + n - r:
103 indices[j] = indices[j-1] + 1
123 values = [5*x-12 for x in range(n)]
126 …self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of com…
130 self.assertEqual(len(c), r) # r-length combinations
155 self.assertRaises(ValueError, cwr, 'abc', -2) # r is negative
161 # number items returned: (n+r-1)! / r! / (n-1)! when n>0
170 if indices[i] != n - 1:
174 indices[i:] = [indices[i] + 1] * (r - i)
181 for indices in product(range(n), repeat=r):
188 return fact(n+r-1) // fact(r) // fact(n-1)
191 values = [5*x-12 for x in range(n)]
206 self.assertEqual(len(c), r) # r-length combinations
231 self.assertRaises(ValueError, permutations, 'abc', -2) # r is negative
245 cycles = range(n, n-r, -1)
249 cycles[i] -= 1
252 cycles[i] = n - i
255 indices[i], indices[-j] = indices[-j], indices[i]
266 for indices in product(range(n), repeat=r):
271 values = [5*x-12 for x in range(n)]
274 … self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms
278 self.assertEqual(len(p), r) # r-length permutations
304 prod = list(product(s, repeat=r))
311 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r))
312 self.assertEqual(len(perm), 0 if r>n else fact(n) // fact(n-r))
313 self.assertEqual(len(comb), 0 if r>n else fact(n) // fact(r) // fact(n-r))
338 data = chain.from_iterable(repeat(range(6), n))
339 selectors = chain.from_iterable(repeat((0, 1)))
350 self.assertEqual(take(2, zip('abc',count(-1))), [('a', -1), ('b', 0)])
351 self.assertEqual(take(2, zip('abc',count(-3))), [('a', -3), ('b', -2)])
354 self.assertEqual(take(10, count(maxsize-5)), range(maxsize-5, maxsize+5))
355 self.assertEqual(take(10, count(-maxsize-5)), range(-maxsize-5, -maxsize+5))
357 self.assertEqual(take(3, count(3.25-4j)), [3.25-4j, 4.25-4j, 5.25-4j])
368 c = count(-9)
369 self.assertEqual(repr(c), 'count(-9)')
371 self.assertEqual(next(c), -8)
375 for i in (-sys.maxint-5, -sys.maxint+5 ,-10, -1, 0, 10, sys.maxint-5, sys.maxint+5):
382 for value in -3, 3, sys.maxint-5, sys.maxint+5:
393 self.assertEqual(zip('abc',count(step=-1)),
394 [('a', 0), ('b', -1), ('c', -2)])
401 … self.assertEqual(take(20, count(maxsize-15, 3)), take(20, range(maxsize-15, maxsize+100, 3)))
402 … self.assertEqual(take(20, count(-maxsize-15, 3)), take(20, range(-maxsize-15,-maxsize+100, 3)))
406 self.assertEqual(take(3, count(2, 3.25-4j)), [2, 5.25-4j, 8.5-8j])
418 c = count(-9, 0)
419 self.assertEqual(repr(c), 'count(-9, 0)')
421 self.assertEqual(repr(c), 'count(-9, 0)')
422 c = count(-9, -3)
423 self.assertEqual(repr(c), 'count(-9, -3)')
425 self.assertEqual(repr(c), 'count(-12, -3)')
426 self.assertEqual(repr(c), 'count(-12, -3)')
434 for i in (-sys.maxint-5, -sys.maxint+5 ,-10, -1, 0, 10, sys.maxint-5, sys.maxint+5):
435 for j in (-sys.maxint-5, -sys.maxint+5 ,-10, -1, 0, 1, 10, sys.maxint-5, sys.maxint+5):
490 # sort s | uniq -d
493 # sort s | uniq -c
496 # sort s | uniq -c | sort -rn | head -3
529 keyfunc.skip -= 1
592 # target = map(None, *args) <- this raises a py3k warning
638 # this class is similar to itertools.repeat
647 self.t -= 1
687 list(product(*args, **dict(repeat=r))))
692 pools = map(tuple, args) * kwds.get('repeat', 1)
703 if indices[i] == len(pools[i]) - 1:
715 pools = map(tuple, args) * kwds.get('repeat', 1)
736 product(*(['ab']*2**5), repeat=2**25)
744 self.assertEqual(list(repeat(object='a', times=3)), ['a', 'a', 'a'])
745 self.assertEqual(list(repeat(object='a', times=0)), [])
746 self.assertEqual(list(repeat(object='a', times=-1)), [])
747 self.assertEqual(list(repeat(object='a', times=-2)), [])
748 self.assertEqual(zip(xrange(3),repeat('a')),
750 self.assertEqual(list(repeat('a', 3)), ['a', 'a', 'a'])
751 self.assertEqual(take(3, repeat('a')), ['a', 'a', 'a'])
752 self.assertEqual(list(repeat('a', 0)), [])
753 self.assertEqual(list(repeat('a', -3)), [])
754 self.assertRaises(TypeError, repeat)
755 self.assertRaises(TypeError, repeat, None, 3, 4)
756 self.assertRaises(TypeError, repeat, None, 'a')
757 r = repeat(1+0j)
758 self.assertEqual(repr(r), 'repeat((1+0j))')
759 r = repeat(1+0j, 5)
760 self.assertEqual(repr(r), 'repeat((1+0j), 5)')
762 self.assertEqual(repr(r), 'repeat((1+0j), 0)')
765 self.assertEqual(repr(repeat('a', -1)), "repeat('a', 0)")
766 self.assertEqual(repr(repeat('a', -2)), "repeat('a', 0)")
767 self.assertEqual(repr(repeat('a', times=-1)), "repeat('a', 0)")
768 self.assertEqual(repr(repeat('a', times=-2)), "repeat('a', 0)")
837 self.assertRaises(ValueError, islice, xrange(10), -5, 10, 1)
838 self.assertRaises(ValueError, islice, xrange(10), 1, -5, -1)
839 self.assertRaises(ValueError, islice, xrange(10), 1, 10, -1)
939 # test long-lagged and multi-way split
950 self.assertRaises(ValueError, tee, [], -1)
957 # tee pass-through to copyable iterator
979 forward, backward = tee(repeat(None, 20000000))
1004 self.assertRaises(StopIteration, repeat(None, 0).next)
1065 self.assertEqual(list(izip_longest('ABCD', 'xy', fillvalue='-')),
1066 [('A', 'x'), ('B', 'y'), ('C', '-'), ('D', '-')])
1077 self.assertEqual(list(product(range(2), repeat=3)),
1082 self.assertEqual(list(repeat(10, 3)), [10, 10, 10])
1103 for i, element in izip(xrange(start), iterable):
1107 for i, element in enumerate(iterable):
1109 yield element
1113 for i, element in izip(xrange(i + 1, stop), iterable):
1179 # Issue 2246 -- the _grouper iterator was not included in GC
1217 self.makecycle(product([1,2,a,3], repeat=3), a)
1221 self.makecycle(repeat(a), a)
1323 self.assertEqual(list(compress(g(s), repeat(1))), list(g(s)))
1324 self.assertRaises(TypeError, compress, X(s), repeat(1))
1325 self.assertRaises(TypeError, list, compress(N(s), repeat(1)))
1326 self.assertRaises(ZeroDivisionError, list, compress(E(s), repeat(1)))
1451 self.assertEqual(len(repeat(None, 50)), 50)
1452 self.assertRaises(TypeError, len, repeat(None))
1551 for cls in (repeat, izip, ifilter, ifilterfalse, chain, imap,
1575 >>> for cube in imap(operator.pow, xrange(1,4), repeat(3)):
1606 >>> for k, g in groupby(enumerate(data), lambda t:t[0]-t[1]):
1629 ... "Advance the iterator n-steps ahead. If n is None, consume entirely."
1632 ... # feed the entire iterator into a zero-length deque
1653 ... return chain(iterable, repeat(None))
1657 ... return chain(*repeat(iterable, n))
1666 ... "Repeat calls to func with specified arguments."
1669 ... return starmap(func, repeat(args))
1671 ... return starmap(func, repeat(args, times))
1674 ... "s -> (s0,s1), (s1,s2), (s2, s3), ..."
1681 ... "grouper(3, 'ABCDEFG', 'x') --> ABC DEF Gxx"
1686 ... "roundrobin('ABC', 'D', 'EF') --> A D E B F C"
1695 ... pending -= 1
1699 ... "powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)"
1705 ... # unique_everseen('AAAABBBCCDAABBB') --> A B C D
1706 ... # unique_everseen('ABBCcAD', str.lower) --> A B C D
1710 ... for element in iterable:
1711 ... if element not in seen:
1712 ... seen_add(element)
1713 ... yield element
1715 ... for element in iterable:
1716 ... k = key(element)
1719 ... yield element
1722 ... "List unique elements, preserving order. Remember only the element just seen."
1723 ... # unique_justseen('AAAABBBCCDAABBB') --> A B C D A B
1724 ... # unique_justseen('ABBCcAD', str.lower) --> A B C A D