o _a?@sdZddlZddlmZddlmZmZmZmZm Z m Z m Z m Z m Z mZddlZddlmZmZmZgdZddZdDd d Zd d ZdEd dZdEddZddZefddZddZeZddZddZ ddZ!dEddZ"dd Z#zdd!lm$Z%Wn e&ye#Z$Yn wd"d#Z$e#je$_dEd$d%Z'd&d'Z(d(d)Z)d*d+Z*dEd,d-Z+dEd.d/Z,dEd0d1Z-dFd2d3Z.d4d5d6d7Z/dEd8d9Z0d:d;Z1dd?Z3d@dAZ4dBdCZ5dS)GaImported 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 combinationscountcyclegroupbyislicerepeatstarmaptee zip_longest) randrangesamplechoice) all_equalconsumeconvolve dotproduct first_trueflattengrouper iter_exceptncyclesnthnth_combinationpadnonepad_nonepairwise partitionpowersetprependquantify#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobintabulatetailtakeunique_everseenunique_justseencCtt||S)zReturn first *n* items of the iterable as a list. >>> take(3, range(10)) [0, 1, 2] If there are fewer than *n* items in the iterable, all of them are returned. >>> take(10, range(3)) [0, 1, 2] )listrniterabler2K/usr/lib/python3/dist-packages/setuptools/_vendor/more_itertools/recipes.pyr*<s r*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)functionstartr2r2r3r(Lsr(cCstt||dS)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] maxlen)iterrr/r2r2r3r)^sr)cCs.|dur t|dddStt|||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 Nrr7)rnextr)iteratorr0r2r2r3ris rcCstt||d|S)zReturns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)r:r)r1r0defaultr2r2r3rs rcCst|}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)rr:)r1gr2r2r3rs rcCr-)zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumr4)r1predr2r2r3r!sr!cCst|tdS)aReturns the sequence of elements and then returns ``None`` indefinitely. >>> take(5, pad_none(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 r1r2r2r3rs rcCsttt||S)zvReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterabler tuple)r1r0r2r2r3rsrcCstttj||S)zcReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )r>r4operatormul)vec1vec2r2r2r3rsrcCs 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. )rrA) listOfListsr2r2r3rs rcGs&|dur t|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 )functimesargsr2r2r3r&sr&ccs,t|\}}t|dt||EdHdS)zReturns an iterator of paired items, overlapping, from the original >>> take(4, pairwise(count())) [(0, 1), (1, 2), (2, 3), (3, 4)] On Python 3.10 and above, this is an alias for :func:`itertools.pairwise`. N)r r:zip)r1abr2r2r3 _pairwises rN)rccst|EdHdSN)itertools_pairwiser@r2r2r3rsrcCs<t|trtdt||}}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) isinstanceintwarningswarnDeprecationWarningr9r )r1r0rQrJr2r2r3rs  rcgslt|}tdd|D}|r4z |D]}|VqWnty/|d8}tt||}Ynw|sdSdS)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|jVqdSrO)r9__next__).0itr2r2r3 9zroundrobin..N)lenr StopIterationr) iterablespendingnextsr:r2r2r3r',s    r'csFdurtfdd|D}t|\}}dd|Ddd|DfS)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]) If *pred* is None, :func:`bool` is used. >>> iterable = [0, 1, False, True, '', ' '] >>> false_items, true_items = partition(None, iterable) >>> list(false_items), list(true_items) ([0, False, ''], [1, True, ' ']) Nc3s|] }||fVqdSrOr2)rXxr?r2r3rZZzpartition..css|] \}}|s|VqdSrOr2rXcondrbr2r2r3rZ]rdcss|] \}}|r|VqdSrOr2rer2r2r3rZ^rd)boolr )r?r1 evaluationst1t2r2rcr3rCs   rcs,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|VqdSrO)r)rXrsr2r3rZvr[zpowerset..r\)r.rrAranger]r@r2rlr3rbs$rc cst}|j}g}|j}|du}|D]+}|r||n|}z ||vr(|||VWqty=||vr;|||VYqwdS)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) r1keyseenset seenset_addseenlist seenlist_adduse_keyelementkr2r2r3r+ys( r+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'] r\)r4r:rC itemgetterr)r1rsr2r2r3r,s r,ccs4z|dur |V |Vq |yYdSw)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] Nr2)rH exceptionfirstr2r2r3rs  rcCstt|||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' )r:filter)r1r<r?r2r2r3rsrr\)r cGs$dd|D|}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|qSr2rBrXpoolr2r2r3 sz"random_product..css|]}t|VqdSrO)rrr2r2r3rZz!random_product..r)r rJpoolsr2r2r3r%sr%cCs*t|}|dur t|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)rBr]r)r1rkrr2r2r3r$s r$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)``. c3|]}|VqdSrOr2rXirr2r3rZrz%random_combination..)rBr]sortedrrn)r1rkr0indicesr2rr3r#s r#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|]}tVqdSrO)r r)r0r2r3rZrz6random_combination_with_replacement..c3rrOr2rrr2r3rZr)rBr]rrn)r1rkrr2)r0rr3r"s r"c Cst|}t|}|dks||krtd}t|||}td|dD] }|||||}q"|dkr7||7}|dks?||krAtg}|ry||||d|d}}}||krn||8}|||||d}}||ksY||d||sEt|S)aEquivalent 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. >>> nth_combination(range(5), 3, 5) (0, 3, 4) ``ValueError`` will be raised If *r* is negative or greater than the length of *iterable*. ``IndexError`` will be raised if the given *index* is invalid. rr\)rBr] ValueErrorminrn IndexErrorrq) r1rkindexrr0crzrresultr2r2r3r"s, rcCs 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` or :func:`value_chain`. )r)valuer;r2r2r3r Ls r ccsjt|ddd}t|}tdg|d|}t|td|dD]}||tttj ||Vq!dS)aBConvolve the iterable *signal* with the iterable *kernel*. >>> signal = (1, 2, 3, 4, 5) >>> kernel = [3, 2, 1] >>> list(convolve(signal, kernel)) [3, 8, 14, 20, 26, 14, 5] Note: the input arguments are not interchangeable, as the *kernel* is immediately consumed and stored. Nrrr7r\) rBr]rrr rqr>r4rCrD)signalkernelr0windowrbr2r2r3r[s  r)rrO)NN)6__doc__rT collectionsr itertoolsrrrrrrr r r r rCrandomr rr__all__r*r(r)rrrrgr!rrrrrr&rNrrP ImportErrorrr'rrr+r,rrr%r$r#r"rr rr2r2r2r3sV 0 !  (        -  *