B gX\;@sdZddlZddlmZddlmZmZmZmZm Z m Z m Z m Z m Z mZmZddlZddlmZmZmZdddd d d d d ddddddddddddddddddd gZd!dZdd%dZd&dZefd'dZd(dZd)d Zd*dZ d+d Z!d?d,dZ"d-dZ#d@d.d Z$d/dZ%d0dZ&d1dZ'dAd2dZ(dBd3d Z)dCd4d Z*dDd5d Z+d6dZ,dEd7dZ-d8dZ.d9dZ/d:dZ0d;dZ1dS)FaImported from the recipes section of the itertools documentation. All functions taken from the recipes section of the itertools library docs [1]_. Some backward-compatible usability improvements have been made. .. [1] http://docs.python.org/library/itertools.html#recipes N)deque) chain combinationscountcycle filterfalsegroupbyislicerepeatstarmaptee zip_longest) randrangesamplechoice all_equalconsume dotproduct first_trueflattengrouper iter_exceptncyclesnthnth_combinationpadnonepairwise partitionpowersetprependquantify#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobintabulatetailtakeunique_everseenunique_justseencCstt||S)a.Return first *n* items of the iterable as a list. >>> take(3, range(10)) [0, 1, 2] >>> take(5, range(3)) [0, 1, 2] Effectively a short replacement for ``next`` based iterator consumption when you want more than one item, but less than the whole iterator. )listr )niterabler/5lib/python3.7/site-packages/more_itertools/recipes.pyr);s cCst|t|S)aReturn an iterator over the results of ``func(start)``, ``func(start + 1)``, ``func(start + 2)``... *func* should be a function that accepts one integer argument. If *start* is not specified it defaults to 0. It will be incremented each time the iterator is advanced. >>> square = lambda x: x ** 2 >>> iterator = tabulate(square, -3) >>> take(4, iterator) [9, 4, 1, 0] )mapr)Zfunctionstartr/r/r0r'JscCstt||dS)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] )maxlen)iterr)r-r.r/r/r0r(\scCs,|dkrt|ddntt|||ddS)aXAdvance *iterable* by *n* steps. If *n* is ``None``, consume it entirely. Efficiently exhausts an iterator without returning values. Defaults to consuming the whole iterator, but an optional second argument may be provided to limit consumption. >>> i = (x for x in range(10)) >>> next(i) 0 >>> consume(i, 3) >>> next(i) 4 >>> consume(i) >>> next(i) Traceback (most recent call last): File "", line 1, in StopIteration If the iterator has fewer items remaining than the provided limit, the whole iterator will be consumed. >>> i = (x for x in range(3)) >>> consume(i, 5) >>> next(i) Traceback (most recent call last): File "", line 1, in StopIteration Nr)r3)rnextr )iteratorr-r/r/r0rgs cCstt||d|S)zReturns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)r5r )r.r-defaultr/r/r0rs cCst|}t|dot|d S)z Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False TF)rr5)r.gr/r/r0rs cCstt||S)zkReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumr1)r.predr/r/r0r scCst|tdS)zReturns the sequence of elements and then returns ``None`` indefinitely. >>> take(5, padnone(range(3))) [0, 1, 2, None, None] Useful for emulating the behavior of the built-in :func:`map` function. See also :func:`padded`. N)rr )r.r/r/r0rs cCsttt||S)z~Returns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterabler tuple)r.r-r/r/r0rscCstttj||S)zkReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )r9r1operatormul)Zvec1Zvec2r/r/r0rscCs t|S)zReturn an iterator flattening one level of nesting in a list of lists. >>> list(flatten([[0, 1], [2, 3]])) [0, 1, 2, 3] See also :func:`collapse`, which can flatten multiple levels of nesting. )rr;)Z listOfListsr/r/r0rs cGs&|dkrt|t|St|t||S)aGCall *func* with *args* repeatedly, returning an iterable over the results. If *times* is specified, the iterable will terminate after that many repetitions: >>> from operator import add >>> times = 4 >>> args = 3, 5 >>> list(repeatfunc(add, times, *args)) [8, 8, 8, 8] If *times* is ``None`` the iterable will not terminate: >>> from random import randrange >>> times = None >>> args = 1, 11 >>> take(6, repeatfunc(randrange, times, *args)) # doctest:+SKIP [2, 4, 8, 1, 8, 4] N)r r )functimesargsr/r/r0r%scCs t|\}}t|dt||S)zReturns an iterator of paired items, overlapping, from the original >>> take(4, pairwise(count())) [(0, 1), (1, 2), (2, 3), (3, 4)] N)r r5zip)r.abr/r/r0rs  cCs<t|tr tdt||}}t|g|}t|d|iS)zCollect data into fixed-length chunks or blocks. >>> list(grouper('ABCDEFG', 3, 'x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] z+grouper expects iterable as first parameter fillvalue) isinstanceintwarningswarnDeprecationWarningr4r )r.r-rErAr/r/r0r s  cgsnt|}tdd|D}xN|rhyx|D] }|Vq(WWqtk rd|d8}tt||}YqXqWdS)aJYields an item from each iterable, alternating between them. >>> list(roundrobin('ABC', 'D', 'EF')) ['A', 'D', 'E', 'B', 'F', 'C'] This function produces the same output as :func:`interleave_longest`, but may perform better for some inputs (in particular when the number of iterables is small). css|]}t|jVqdS)N)r4__next__).0itr/r/r0 'szroundrobin..N)lenr StopIterationr ) iterablespendingZnextsr5r/r/r0r&s  cCs t|\}}t||t||fS)a Returns a 2-tuple of iterables derived from the input iterable. The first yields the items that have ``pred(item) == False``. The second yields the items that have ``pred(item) == True``. >>> is_odd = lambda x: x % 2 != 0 >>> iterable = range(10) >>> even_items, odd_items = partition(is_odd, iterable) >>> list(even_items), list(odd_items) ([0, 2, 4, 6, 8], [1, 3, 5, 7, 9]) )r rfilter)r:r.Zt1Zt2r/r/r0r1s cs,t|tfddttdDS)aYields all possible subsets of the iterable. >>> list(powerset([1, 2, 3])) [(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)] :func:`powerset` will operate on iterables that aren't :class:`set` instances, so repeated elements in the input will produce repeated elements in the output. Use :func:`unique_everseen` on the input to avoid generating duplicates: >>> seq = [1, 1, 0] >>> list(powerset(seq)) [(), (1,), (1,), (0,), (1, 1), (1, 0), (1, 0), (1, 1, 0)] >>> from more_itertools import unique_everseen >>> list(powerset(unique_everseen(seq))) [(), (1,), (0,), (1, 0)] c3s|]}t|VqdS)N)r)rLr)sr/r0rNWszpowerset..rO)r,rr;rangerP)r.r/)rVr0rCsc cst}|j}g}|j}|dkrtx|D]J}y||kr@|||VWq$tk rl||krh|||VYq$Xq$Wn\xZ|D]R}||}y||kr|||VWqztk r||kr|||VYqzXqzWdS)a Yield unique elements, preserving order. >>> list(unique_everseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D'] >>> list(unique_everseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'D'] Sequences with a mix of hashable and unhashable items can be used. The function will be slower (i.e., `O(n^2)`) for unhashable items. Remember that ``list`` objects are unhashable - you can use the *key* parameter to transform the list to a tuple (which is hashable) to avoid a slowdown. >>> iterable = ([1, 2], [2, 3], [1, 2]) >>> list(unique_everseen(iterable)) # Slow [[1, 2], [2, 3]] >>> list(unique_everseen(iterable, key=tuple)) # Faster [[1, 2], [2, 3]] Similary, you may want to convert unhashable ``set`` objects with ``key=frozenset``. For ``dict`` objects, ``key=lambda x: frozenset(x.items())`` can be used. N)setaddappend TypeError)r.keyZseensetZ seenset_addZseenlistZ seenlist_addelementkr/r/r0r*Zs0    cCsttttdt||S)zYields elements in order, ignoring serial duplicates >>> list(unique_justseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D', 'A', 'B'] >>> list(unique_justseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'A', 'D'] rO)r1r5r= itemgetterr)r.r\r/r/r0r+s ccs<y"|dk r|Vx |VqWWn|k r6YnXdS)aXYields results from a function repeatedly until an exception is raised. Converts a call-until-exception interface to an iterator interface. Like ``iter(func, sentinel)``, but uses an exception instead of a sentinel to end the loop. >>> l = [0, 1, 2] >>> list(iter_except(l.pop, IndexError)) [2, 1, 0] Nr/)r?Z exceptionfirstr/r/r0rs cCstt|||S)a Returns the first true value in the iterable. If no true value is found, returns *default* If *pred* is not None, returns the first item for which ``pred(item) == True`` . >>> first_true(range(10)) 1 >>> first_true(range(10), pred=lambda x: x > 5) 6 >>> first_true(range(10), default='missing', pred=lambda x: x > 9) 'missing' )r5rT)r.r7r:r/r/r0rscOs,dd|D|dd}tdd|DS)aDraw an item at random from each of the input iterables. >>> random_product('abc', range(4), 'XYZ') # doctest:+SKIP ('c', 3, 'Z') If *repeat* is provided as a keyword argument, that many items will be drawn from each iterable. >>> random_product('abcd', range(4), repeat=2) # doctest:+SKIP ('a', 2, 'd', 3) This equivalent to taking a random selection from ``itertools.product(*args, **kwarg)``. cSsg|] }t|qSr/)r<)rLpoolr/r/r0 sz"random_product..r rOcss|]}t|VqdS)N)r)rLrar/r/r0rNsz!random_product..)getr<)rAkwdsZpoolsr/r/r0r$scCs*t|}|dkrt|n|}tt||S)abReturn a random *r* length permutation of the elements in *iterable*. If *r* is not specified or is ``None``, then *r* defaults to the length of *iterable*. >>> random_permutation(range(5)) # doctest:+SKIP (3, 4, 0, 1, 2) This equivalent to taking a random selection from ``itertools.permutations(iterable, r)``. N)r<rPr)r.rUrar/r/r0r#s cs8t|t}ttt||}tfdd|DS)zReturn a random *r* length subsequence of the elements in *iterable*. >>> random_combination(range(5), 3) # doctest:+SKIP (2, 3, 4) This equivalent to taking a random selection from ``itertools.combinations(iterable, r)``. c3s|]}|VqdS)Nr/)rLi)rar/r0rNsz%random_combination..)r<rPsortedrrW)r.rUr-indicesr/)rar0r"s cs@t|ttfddt|D}tfdd|DS)aSReturn a random *r* length subsequence of elements in *iterable*, allowing individual elements to be repeated. >>> random_combination_with_replacement(range(3), 5) # doctest:+SKIP (0, 0, 1, 2, 2) This equivalent to taking a random selection from ``itertools.combinations_with_replacement(iterable, r)``. c3s|]}tVqdS)N)r)rLre)r-r/r0rNsz6random_combination_with_replacement..c3s|]}|VqdS)Nr/)rLre)rar/r0rN s)r<rPrfrW)r.rUrgr/)r-rar0r!s c Cst|}t|}|dks ||kr$td}t|||}x*td|dD]}|||||}qFW|dkrr||7}|dks||krtg}xj|r||||d|d}}}x.||kr||8}|||||d}}qW||d|qWt|S)a)Equivalent to ``list(combinations(iterable, r))[index]``. The subsequences of *iterable* that are of length *r* can be ordered lexicographically. :func:`nth_combination` computes the subsequence at sort position *index* directly, without computing the previous subsequences. rrO)r<rP ValueErrorminrW IndexErrorrZ) r.rUindexrar-cr^reresultr/r/r0r s(   cCs t|g|S)aYield *value*, followed by the elements in *iterator*. >>> value = '0' >>> iterator = ['1', '2', '3'] >>> list(prepend(value, iterator)) ['0', '1', '2', '3'] To prepend multiple values, see :func:`itertools.chain`. )r)valuer6r/r/r0r0s )r)N)N)N)N)N)N)N)NN)N)2__doc__rH collectionsr itertoolsrrrrrrr r r r r r=Zrandomrrr__all__r)r'r(rrrboolr rrrrr%rrr&rrr*r+rrr$r#r"r!rrr/r/r/r0 sv 4   (       6   $