ó oÙè[c@s@dZddlmZddlmZmZmZmZmZm Z m Z m Z m Z ddl Z ddlmZmZmZddlmZddlmZmZmZmZmZmZdd d d d d ddddddddddddddddddd d!d"d#gZe jd$„Zd%„Zd&d'„Zd(„Z dd)„Z"dd*„Z#d+„Z$e%d,„Z&d-„Z'd.„Z(d/„Z)d0„Z*dd1„Z+d2„Z,dd3„Z-d4„Z.d5„Z/d6„Z0dd7„Z1dd8„Z2dd9„Z3ddd:„Z4d;„Z5dd<„Z6d=„Z7d>„Z8d?„Z9d@„Z:dS(AsImported 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 iÿÿÿÿ(tdeque( tchaint combinationstcounttcycletgroupbytislicetrepeattstarmaptteeN(t randrangetsampletchoice(tPY2(tfiltert filterfalsetmaptrangetzipt zip_longestt accumulatet all_equaltconsumet dotproductt first_truetflattentgroupert iter_excepttncyclestnthtnth_combinationtpadnonetpairwiset partitiontpowersettprependtquantifyt#random_combination_with_replacementtrandom_combinationtrandom_permutationtrandom_productt repeatfunct roundrobinttabulatettailttaketunique_everseentunique_justseenccs_t|ƒ}yt|ƒ}Wntk r0dSX|Vx"|D]}|||ƒ}|Vq=WdS(s_ 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(titertnextt StopIteration(titerabletfunctitttotaltelement((s5lib/python2.7/site-packages/more_itertools/recipes.pyR4s   cCstt||ƒƒS(s.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. (tlistR(tnR3((s5lib/python2.7/site-packages/more_itertools/recipes.pyR-Rs icCst|t|ƒƒS(s©Return 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(tfunctiontstart((s5lib/python2.7/site-packages/more_itertools/recipes.pyR+ascCstt|d|ƒƒS(sReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] tmaxlen(R0R(R9R3((s5lib/python2.7/site-packages/more_itertools/recipes.pyR,sscCs<|dkrt|ddƒntt|||ƒdƒdS(sXAdvance *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 R<iN(tNoneRR1R(titeratorR9((s5lib/python2.7/site-packages/more_itertools/recipes.pyR~s cCstt||dƒ|ƒS(s™Returns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N(R1RR=(R3R9tdefault((s5lib/python2.7/site-packages/more_itertools/recipes.pyR¦s cCs)t|ƒ}t|tƒo(t|tƒ S(s  Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False (RR1tTruetFalse(R3tg((s5lib/python2.7/site-packages/more_itertools/recipes.pyR³s cCstt||ƒƒS(skReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 (tsumR(R3tpred((s5lib/python2.7/site-packages/more_itertools/recipes.pyR$ÁscCst|tdƒƒS(sÿReturns 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(RRR=(R3((s5lib/python2.7/site-packages/more_itertools/recipes.pyRËs cCstjtt|ƒ|ƒƒS(s~Returns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] (Rt from_iterableRttuple(R3R9((s5lib/python2.7/site-packages/more_itertools/recipes.pyRÙscCstttj||ƒƒS(skReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 (RCRtoperatortmul(tvec1tvec2((s5lib/python2.7/site-packages/more_itertools/recipes.pyRãscCs tj|ƒS(sÜReturn 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. (RRE(t listOfLists((s5lib/python2.7/site-packages/more_itertools/recipes.pyRís cGs5|dkrt|t|ƒƒSt|t||ƒƒS(sGCall *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=RR(R4ttimestargs((s5lib/python2.7/site-packages/more_itertools/recipes.pyR)ùs cCs,t|ƒ\}}t|dƒt||ƒS(sšReturns an iterator of paired items, overlapping, from the original >>> take(4, pairwise(count())) [(0, 1), (1, 2), (2, 3), (3, 4)] N(R R1R=R(R3tatb((s5lib/python2.7/site-packages/more_itertools/recipes.pyR s cCs#t|ƒg|}td||ŒS(s Collect data into fixed-length chunks or blocks. >>> list(grouper(3, 'ABCDEFG', 'x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] t fillvalue(R0R(R9R3RPRM((s5lib/python2.7/site-packages/more_itertools/recipes.pyR scgs¢t|ƒ}tr+td„|Dƒƒ}ntd„|Dƒƒ}xZ|ryx|D]}|ƒVqTWWqDtk r™|d8}tt||ƒƒ}qDXqDWdS(sJYields 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(R0R1(t.0R5((s5lib/python2.7/site-packages/more_itertools/recipes.pys 9scss|]}t|ƒjVqdS(N(R0t__next__(RQR5((s5lib/python2.7/site-packages/more_itertools/recipes.pys ;siN(tlenR RR2R(t iterablestpendingtnextsR1((s5lib/python2.7/site-packages/more_itertools/recipes.pyR*+s     cCs.t|ƒ\}}t||ƒt||ƒfS(s³ 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(RDR3tt1tt2((s5lib/python2.7/site-packages/more_itertools/recipes.pyR!Escs9t|ƒ‰tj‡fd†ttˆƒdƒDƒƒS(sœYields 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(RQtr(ts(s5lib/python2.7/site-packages/more_itertools/recipes.pys ksi(R8RRERRS(R3((RZs5lib/python2.7/site-packages/more_itertools/recipes.pyR"Ws ccs tƒ}|j}g}|j}|dkr•xÖ|D]Z}y"||kr[||ƒ|VnWq4tk r||krŽ||ƒ|VqŽq4Xq4Wnqxn|D]f}||ƒ}y"||krÏ||ƒ|VnWqœtk r||kr||ƒ|VqqœXqœWdS(sj 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(tsettaddtappendR=t TypeError(R3tkeytseensett seenset_addtseenlistt seenlist_addR7tk((s5lib/python2.7/site-packages/more_itertools/recipes.pyR.ns0                   cCs(ttttjdƒt||ƒƒƒS(sñYields 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'] i(RR1RGt itemgetterR(R3R_((s5lib/python2.7/site-packages/more_itertools/recipes.pyR/–s ccsBy*|dk r|ƒVnx |ƒVqWWn|k r=nXdS(sXYields 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] N(R=(R4t exceptiontfirst((s5lib/python2.7/site-packages/more_itertools/recipes.pyR¢s    cCstt||ƒ|ƒS(s 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' (R1R(R3R?RD((s5lib/python2.7/site-packages/more_itertools/recipes.pyR·scOsCg|D]}t|ƒ^q|jddƒ}td„|DƒƒS(sÇDraw 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)``. Ricss|]}t|ƒVqdS(N(R (RQtpool((s5lib/python2.7/site-packages/more_itertools/recipes.pys Üs(RFtget(RMtkwdsRhtpools((s5lib/python2.7/site-packages/more_itertools/recipes.pyR(Ës/cCs=t|ƒ}|dkr$t|ƒn|}tt||ƒƒS(sbReturn 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(RFR=RSR (R3RYRh((s5lib/python2.7/site-packages/more_itertools/recipes.pyR'ßs csMt|ƒ‰tˆƒ}ttt|ƒ|ƒƒ}t‡fd†|DƒƒS(sÿReturn 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(N((RQti(Rh(s5lib/python2.7/site-packages/more_itertools/recipes.pys þs(RFRStsortedR R(R3RYR9tindices((Rhs5lib/python2.7/site-packages/more_itertools/recipes.pyR&ñs  csTt|ƒ‰tˆƒ‰t‡fd†t|ƒDƒƒ}t‡fd†|DƒƒS(sSReturn 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|]}tˆƒVqdS(N(R (RQRl(R9(s5lib/python2.7/site-packages/more_itertools/recipes.pys sc3s|]}ˆ|VqdS(N((RQRl(Rh(s5lib/python2.7/site-packages/more_itertools/recipes.pys s(RFRSRmR(R3RYRn((R9Rhs5lib/python2.7/site-packages/more_itertools/recipes.pyR%s  "c CsPt|ƒ}t|ƒ}|dks0||kr9t‚nd}t|||ƒ}x1td|dƒD]}|||||}qfW|dkrŸ||7}n|dks·||krÀt‚ng}x}|rE||||d|d}}}x7||kr,||8}|||||d}}qöW|j|d|ƒqÉWt|ƒS(s)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. iiiÿÿÿÿ(RFRSt ValueErrortminRt IndexErrorR]( R3RYtindexRhR9tcRdRltresult((s5lib/python2.7/site-packages/more_itertools/recipes.pyRs(       $ !cCst|g|ƒS(sYield *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(tvalueR>((s5lib/python2.7/site-packages/more_itertools/recipes.pyR#6s (;t__doc__t collectionsRt itertoolsRRRRRRRRR RGtrandomR R R tsixR t six.movesRRRRRRt__all__R\RR-R+R,R=RRRtboolR$RRRRR)R RR*R!R"R.R/RRR(R'R&R%RR#(((s5lib/python2.7/site-packages/more_itertools/recipes.pyt s|@ .    (       (      $