B [p:@sdZddlmZddlmZmZmZmZmZm Z m Z m Z m Z ddl Z ddlmZmZmZddlmZddlmZmZmZmZmZmZdd d d d d ddddddddddddddddddd d!d"d#gZe jfd$dZd%d!ZdAd&dZd'd Z dBd(d Z!dCd)dZ"d*d Z#e$fd+dZ%d,dZ&d-dZ'd.d Z(d/d Z)dDd0dZ*d1dZ+dEd2dZ,d3dZ-d4dZ.d5dZ/dFd6d"Z0dGd7d#Z1dHd8dZ2dId:d Z3d;dZ4dJddZ7d?dZ8d@dZ9dS)KaImported 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 )deque) chain combinationscountcyclegroupbyislicerepeatstarmapteeN) randrangesamplechoice)PY2)filter filterfalsemaprangezip zip_longest accumulate all_equalconsume dotproduct first_trueflattengrouper iter_exceptncyclesnthnth_combinationpadnonepairwise partitionpowersetprependquantify#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobintabulatetailtakeunique_everseenunique_justseenccsRt|}y t|}Wntk r(dSX|Vx|D]}|||}|Vq6WdS)a_ Return an iterator whose items are the accumulated results of a function (specified by the optional *func* argument) that takes two arguments. By default, returns accumulated sums with :func:`operator.add`. >>> list(accumulate([1, 2, 3, 4, 5])) # Running sum [1, 3, 6, 10, 15] >>> list(accumulate([1, 2, 3], func=operator.mul)) # Running product [1, 2, 6] >>> list(accumulate([0, 1, -1, 2, 3, 2], func=max)) # Running maximum [0, 1, 1, 2, 3, 3] This function is available in the ``itertools`` module for Python 3.2 and greater. N)iternext StopIteration)iterablefuncitZtotalelementr98/usr/lib/python3/dist-packages/more_itertools/recipes.pyr4s   cCstt||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)nr5r9r9r:r/Rs 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] )rr)Zfunctionstartr9r9r:r-ascCstt||dS)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] )maxlen)r2r)r<r5r9r9r:r.sscCs,|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)r>)rr3r)iteratorr<r9r9r:r~s cCstt||d|S)zReturns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)r3r)r5r<defaultr9r9r:rs 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)rr3)r5gr9r9r:rs cCstt||S)zkReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumr)r5predr9r9r:r&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 )r5r9r9r:r!s cCsttt||S)z~Returns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterabler tuple)r5r<r9r9r:rscCstttj||S)zkReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )rBroperatormul)Zvec1Zvec2r9r9r:rscCs 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. )rrD)Z listOfListsr9r9r:rs 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 )r6timesargsr9r9r:r+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 r3r)r5abr9r9r:r"s  cCst|g|}t|d|iS)zCollect data into fixed-length chunks or blocks. >>> list(grouper(3, 'ABCDEFG', 'x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] fillvalue)r2r)r<r5rLrIr9r9r:r scgst|}tr tdd|D}ntdd|D}xN|ryx|D] }|Vq@WWq4tk r||d8}tt||}Yq4Xq4WdS)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)r2r3).0r7r9r9r: 9szroundrobin..css|]}t|jVqdS)N)r2__next__)rMr7r9r9r:rN;sN)lenrrr4r) iterablespendingZnextsr3r9r9r:r,+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 rr)rCr5Zt1Zt2r9r9r:r#Es cs,t|tfddttdDS)zYields all possible subsets of the iterable. >>> list(powerset([1,2,3])) [(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)] c3s|]}t|VqdS)N)r)rMr)sr9r:rN_szpowerset..rP)r;rrDrrQ)r5r9)rUr:r$Wsc 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)aj 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. N)setaddappend TypeError)r5keyZseensetZ seenset_addZseenlistZ seenlist_addr8kr9r9r:r0bs0     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'] rP)rr3rF itemgetterr)r5rZr9r9r:r1s 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] Nr9)r6Z exceptionfirstr9r9r:rs FcCstt|||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' )r3r)r5r@rCr9r9r:rscOs,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|qSr9)rE)rMpoolr9r9r: sz"random_product..r rPcss|]}t|VqdS)N)r)rMr^r9r9r:rNsz!random_product..)getrE)rIkwdsZpoolsr9r9r:r*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)rErQr )r5rTr^r9r9r:r)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)Nr9)rMi)r^r9r:rNsz%random_combination..)rErQsortedr r)r5rTr<indicesr9)r^r:r(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 )rMrb)r<r9r:rNsz6random_combination_with_replacement..c3s|]}|VqdS)Nr9)rMrb)r^r9r:rNs)rErQrcr)r5rTrdr9)r<r^r:r'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. rrP)rErQ ValueErrorminr IndexErrorrX) r5rTindexr^r<cr[rbresultr9r9r:r 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)valuer?r9r9r:r%*s )r)N)N)N)N)N)N)N)FN)N):__doc__ collectionsr itertoolsrrrrrrr r r rFZrandomr r rZsixrZ six.movesrrrrrr__all__rWrr/r-r.rrrboolr&r!rrrr+r"rr,r#r$r0r1rrr*r)r(r'r r%r9r9r9r: s| ,    (       (   $