ݷekdZddlZddlZddlmZddlmZddlmZm Z ddl m Z m Z m Z mZmZmZmZmZmZmZmZmZddlmZmZmZddlmZgd ZeZ e d ee d Z!e#ed d Z$dZ%dFdZ&dZ'dGdZ(dGdZ)dZ*e+fdZ,dZ-e-Z.dZ/dZ0dZ1dGdZ2dZ3 ddl m4Z5dZ4e3je4_Gdde7Z8dZ9d Z:dHd!Z;d"ZdGd%Z?dGd&Z@dGd'ZAdId(ZBd)d*d+ZCdGd,ZDd-ZEd.ZFd/ZGd0ZHd1ZId2ZJd3ZKd4ZLd5ZMd6ZNdJd7ZOd8ZPd9d d:ZQed;k\r ddZTd?ZUd@ZVdAZWdBZXdCZYdDZZdEZ[y#e"$re Z!YwxYw#e6$re3Z4YwxYw)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 N)deque)Sized)partialreduce) chain combinationscompresscountcyclegroupbyisliceproductrepeatstarmaptee zip_longest) randrangesamplechoice) hexversion)- all_equalbatchedbefore_and_afterconsumeconvolve dotproduct first_truefactorflattengrouper iter_except iter_indexmatmulncyclesnthnth_combinationpadnonepad_nonepairwise partitionpolynomial_evalpolynomial_from_rootspolynomial_derivativepowersetprependquantifyreshape#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobinsievesliding_window subslicessum_of_squarestabulatetailtaketotient transpose triplewiseunique_everseenunique_justseenTstrictsumprodct||SN)r)xys 8/usr/lib/python3/dist-packages/more_itertools/recipes.pyrL]s Aq1Ac,tt||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] )listr niterables rKr>r>`s x# $$rMc,t|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 )functionstarts rKr<r<ps xu &&rMc #Kt|tr,t|tdt ||z dEd{yt t ||Ed{y7$7w)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] rNmaxlen) isinstancerr maxleniterrrPs rKr=r=sS(E"(C3x=1+<$=tDDDhq1222 E2s!7A"AA"A A" A"cR|t|dytt|||dy)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 NrrX)rnextr )iteratorrQs rKrrs)@ y hq! VHa #T*rMc0tt||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 )rRrQdefaults rKr%r%s xD)7 33rMcNt|}t|dxr t|d S)z Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False TF)r r_)rRgs rKrrs( A 4= /a//rMc,tt||S)zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumrT)rRpreds rKr0r0s s4" ##rMc,t|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)rrrRs rKr(r(s 6$< ((rMcRtjtt||S)zvReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterablertuple)rRrQs rKr$r$s    veHoq9 ::rMcJtttj||S)zcReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )rfrToperatormul)vec1vec2s rKrrs s8<<t, --rMc,tj|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. )rrk) listOfListss rKrrs   { ++rMc\|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] )rr)functimesargss rKr6r6s., }tVD\** 4e, --rMcNt|\}}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)] On Python 3.10 and above, this is an alias for :func:`itertools.pairwise`. N)rr_zip)rRabs rK _pairwiser|-s& x=DAqDM q!9rMr)ct|SrH)itertools_pairwiseris rKr)r)As !(++rMc eZdZdfd ZxZS)UnequalIterablesErrorcPd}||dj|z }t| |y)Nz Iterables have different lengthsz/: index 0 has length {}; index {} has length {})formatsuper__init__)selfdetailsmsg __class__s rKrzUnequalIterablesError.__init__Hs;0   MEMM C rMrH)__name__ __module__ __qualname__r __classcell__)rs@rKrrGs rMrc#nKt|dtiD]}|D]}|tus t|!yw)N fillvalue)r_markerr) iterablescombovals rK_zip_equal_generatorrRsEi;7; .Cg~+-- . s 55c t|d}t|dddD]$\}}t|}||k7st|||ft|S#t$rt |cYSwxYw)Nr)r)r\ enumeraterry TypeErrorr)r first_sizeiitsizes rK _zip_equalrZs /1& y}a0 KEArr7Dz!+ZD4IJJ K I /#I../s3AAA%$A%ct|g|z}|dk(r t|d|iS|dk(rt|S|dk(rt|St d)aGroup elements from *iterable* into fixed-length groups of length *n*. >>> list(grouper('ABCDEF', 3)) [('A', 'B', 'C'), ('D', 'E', 'F')] The keyword arguments *incomplete* and *fillvalue* control what happens for iterables whose length is not a multiple of *n*. When *incomplete* is `'fill'`, the last group will contain instances of *fillvalue*. >>> list(grouper('ABCDEFG', 3, incomplete='fill', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] When *incomplete* is `'ignore'`, the last group will not be emitted. >>> list(grouper('ABCDEFG', 3, incomplete='ignore', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F')] When *incomplete* is `'strict'`, a subclass of `ValueError` will be raised. >>> it = grouper('ABCDEFG', 3, incomplete='strict') >>> list(it) # doctest: +IGNORE_EXCEPTION_DETAIL Traceback (most recent call last): ... UnequalIterablesError fillrrEignorez Expected fill, strict, or ignore)r]rrry ValueError)rRrQ incompleterrws rKr r js^: N a DVD6I66X4  XDz;<>> 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). c3FK|]}t|jywrH)r]__next__).0rs rK zroundrobin..s8$r(##8s!rN)r\r StopIterationr )rpendingnextsr_s rKr7r7sn)nG 8i8 8E  2 f    2 qLG&01E 2s* A"9A"A"#AA"AA"c|t}t|d\}}}tt||\}}t|ttj |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]) 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, ' ']) )boolrrTr rnnot_)rgrRt1t2pp1p2s rKr*r*sX( |Ha IBA T1 FB RX]]B/ 0(2r2B CCrMct|tjfdtt dzDS)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)] c36K|]}t|ywrH)r)rrss rKrzpowerset..sMa|Aq1Msr)rOrrkranger\)rRrs @rKr.r.s2& XA   M5Q!;LM MMrMc#Kt}|j}g}|j}|du}|D]}|r||n|} ||vr |||!y#t$r||vr |||Y>wxYww)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]] Similarly, you may want to convert unhashable ``set`` objects with ``key=frozenset``. For ``dict`` objects, ``key=lambda x: frozenset(x.items())`` can be used. N)setaddappendr) rRkeyseenset seenset_addseenlist seenlist_adduse_keyelementks rKrBrBs6eG++KH??LoG #CL A    Q  s(:A/A A/A,)A/+A,,A/c |(ttjdt|Sttttjdt||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'] rr)rTrn itemgetterr r_)rRrs rKrCrC sL {8&&q)78+<== tS,,Q/31GH IIrMc#NK | | | #|$rYywxYww)aYields 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] Multiple exceptions can be specified as a stopping condition: >>> l = [1, 2, 3, '...', 4, 5, 6] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [7, 6, 5] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [4, 3, 2] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [] N)ru exceptionfirsts rKr!r!s8,  'M&L    s%"%"%c.tt|||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)rRrbrgs rKrr7s" tX& 00rMr)rch|Dcgc] }t|c}|z}td|DScc}w)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)``. c32K|]}t|ywrH)r)rpools rKrz!random_product..\s0$0s)rl)rrwrpoolss rKr5r5Ks3 &* *TU4[ *V 3E 0%0 00 +s/c`t|}| 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)``. )rlr\r)rRrrs rKr4r4_s- ?DYD AA a !!rMct|t}ttt ||}tfd|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(K|] }| ywrHrrrrs rKrz%random_combination..~*Qa*)rlr\sortedrr)rRrrQindicesrs @rKr3r3qs= ?D D AVE!Ha()G *'* **rMct|ttfdt|D}tfd|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)``. c34K|]}tywrH)r)rrrQs rKrz6random_combination_with_replacement..s4aYq\4sc3(K|] }| ywrHrrs rKrz6random_combination_with_replacement..rr)rlr\rr)rRrrrQrs @@rKr2r2s< ?D D A45844G *'* **rMct|}t|}|dks||kDrtd}t|||z }t d|dzD]}|||z |zz|z}|dkr||z }|dks||k\rt g}|rL||z|z|dz |dz }}}||k\r||z}|||z z|z|dz }}||k\r|j |d|z |rLt|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)rlr\rminr IndexErrorr) rRrindexrrQcrrresults rKr&r&s ?D D A A1q5 A Aq1u A 1a!e_! QOq ! qy    uz F a%1*a!eQUa1qj QJEA;!#QUqAqj  d26l#  =rMct|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`s rKr/r/s %( ##rMc#Kt|ddd}t|}tdg||z}t|t d|dz D]!}|j |t ||#yw)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. NrrrXr)rlr\rrrr_sumprod)signalkernelrQwindowrIs rKrrsp6]4R4 F F A A3q !A %F 66!QU+ ,' avv&&'sA,A.cZtgfd}t}||fS)aA variant of :func:`takewhile` that allows complete access to the remainder of the iterator. >>> it = iter('ABCdEfGhI') >>> all_upper, remainder = before_and_after(str.isupper, it) >>> ''.join(all_upper) 'ABC' >>> ''.join(remainder) # takewhile() would lose the 'd' 'dEfGhI' Note that the first iterator must be fully consumed before the second iterator can generate valid results. c3ZKD]!}|r|j|yywrH)r)elemr predicate transitions rK true_iteratorz'before_and_after..true_iterators3 D !!$'  s(+)r]r)rrrremainder_iteratorrs`` @rKrrs5 bBJz2. ?. ..rMc#^Ktt|D]\\}}\}}|||fyw)zReturn overlapping triplets from *iterable*. >>> list(triplewise('ABCDE')) [('A', 'B', 'C'), ('B', 'C', 'D'), ('C', 'D', 'E')] Nr})rRrz_r{rs rKrArAs8#8H#56AAAg s+-c#Kt|}tt||dz |}|D] }|j|t |"yw)aYReturn a sliding window of width *n* over *iterable*. >>> list(sliding_window(range(6), 4)) [(0, 1, 2, 3), (1, 2, 3, 4), (2, 3, 4, 5)] If *iterable* has fewer than *n* items, then nothing is yielded: >>> list(sliding_window(range(3), 4)) [] For a variant with more features, see :func:`windowed`. rrXN)r]rr rrl)rRrQrrrIs rKr9r9 sM hB 6"a!e$Q /F  aFmsA Ac t|}tttt t |dzd}t tjt||S)zReturn all contiguous non-empty subslices of *iterable*. >>> list(subslices('ABC')) [['A'], ['A', 'B'], ['A', 'B', 'C'], ['B'], ['B', 'C'], ['C']] This is similar to :func:`substrings`, but emits items in a different order. r) rOrslicerrr\rTrngetitemr)rRseqslicess rKr:r:!sF x.C ULs3x!|)>> roots = [5, -4, 3] # (x - 5) * (x + 4) * (x - 3) >>> polynomial_from_roots(roots) # x^3 - 4 * x^2 - 17 * x + 60 [1, -4, -17, 60] r)ryrrTrnnegrOrr)rootsfactorss rKr,r,/s5&)Su56G x1#. //rMc#Kt|dd}|0t|||}t||D]\}}||us||k(s|y| t|n|}|dz } |||dz|x}#t$rYywxYww)aYield the index of each place in *iterable* that *value* occurs, beginning with index *start* and ending before index *stop*. See :func:`locate` for a more general means of finding the indexes associated with particular values. >>> list(iter_index('AABCADEAF', 'A')) [0, 1, 4, 7] >>> list(iter_index('AABCADEAF', 'A', 1)) # start index is inclusive [1, 4, 7] >>> list(iter_index('AABCADEAF', 'A', 1, 7)) # stop index is not inclusive [1, 4] rNr)getattrr rr\r)rRrrVstop seq_indexrrrs rKr"r":s'40I HeT *#B. JAw%7e#3  !% s8}$ AI %eQUD99q:   s(8A9A9A** A63A95A66A9c #jK|dkDrdd}td|dzz}tj|dz}t|d||D]Q}t|d|||zEd{t t t ||z|||z|||z|||z<||z}St|d|Ed{y7R7w)zdYield the primes less than n. >>> list(sieve(30)) [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] rr)rrrN) bytearraymathisqrtr"bytesr\r)rQrVdatalimitrs rKr8r8Zs  1u E V Q 'D JJqMA E a .dAua!e444"'E!a%AE,B(C"DQUQQ A$5))) 5*s%AB3B/A B3)B1*B31B3Fc#K|dkr tdt|}tt||x}r8|rt ||k7r td|tt||x}r7yyw)aBatch data into tuples of length *n*. If the number of items in *iterable* is not divisible by *n*: * The last batch will be shorter if *strict* is ``False``. * :exc:`ValueError` will be raised if *strict* is ``True``. >>> list(batched('ABCDEFG', 3)) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G',)] On Python 3.13 and above, this is an alias for :func:`itertools.batched`. rzn must be at least onezbatched(): incomplete batchN)rr]rlr r\)rRrQrErbatchs rK_batchedr lsp 1u122 hBA' '% ' c%jAo:; ; A' '% 's A)A.,A.i )rct|||S)NrD)itertools_batched)rRrQrEs rKrrs 1V<>> list(transpose([(1, 2, 3), (11, 22, 33)])) [(1, 11), (2, 22), (3, 33)] The caller should ensure that the dimensions of the input are compatible. If the input is empty, no output will be produced. ) _zip_strictrs rKr@r@s  rMc@ttj||S)zReshape the 2-D input *matrix* to have a column count given by *cols*. >>> matrix = [(0, 1), (2, 3), (4, 5)] >>> cols = 3 >>> list(reshape(matrix, cols)) [(0, 1, 2), (3, 4, 5)] )rrrk)matrixcolss rKr1r1s 5&&v. 55rMc xt|d}tttt |t ||S)zMultiply two matrices. >>> list(matmul([(7, 5), (3, 5)], [(2, 5), (7, 9)])) [(49, 80), (41, 60)] The caller should ensure that the dimensions of the input matrices are compatible with each other. r)r\rrrrr@)m1m2rQs rKr#r#s0 BqE A 78WR2%?@! DDrMc#Kttj|dzD]}||zr |||z}|dk(ry||zs |dkDr|yyw)zTYield the prime factors of n. >>> list(factor(360)) [2, 2, 2, 3, 3, 5] rN)r8rr)rQprimes rKrrsd tzz!}q()e)K %KAAv e)  1u s*AA Ac t|}|dk(r|dzSttt|t t |}t ||S)zEvaluate a polynomial at a specific value. Example: evaluating x^3 - 4 * x^2 - 17 * x + 60 at x = 2.5: >>> coefficients = [1, -4, -17, 60] >>> x = 2.5 >>> polynomial_eval(coefficients, x) 8.125 r)r\rTpowrreversedrr) coefficientsrIrQpowerss rKr+r+sF LAAv1u fQi%(!3 4F L& ))rMc$tt|S)zfReturn the sum of the squares of the input values. >>> sum_of_squares([10, 20, 30]) 1400 )rrrs rKr;r;s SW rMct|}ttd|}tt t j ||S)aCompute the first derivative of a polynomial. Example: evaluating the derivative of x^3 - 4 * x^2 - 17 * x + 60 >>> coefficients = [1, -4, -17, 60] >>> derivative_coefficients = polynomial_derivative(coefficients) >>> derivative_coefficients [3, -8, -17] r)r\rrrOrTrnro)rrQrs rKr-r-s6 LA eAqk "F HLL,7 88rMcNtt|D] }||z|dz z}|S)zReturn the count of natural numbers up to *n* that are coprime with *n*. >>> totient(9) 6 >>> totient(12) 4 r)rCr)rQrs rKr?r?s5VAY ' Fa!e  HrM)rrH)rN)NN)rN)\__doc__rrn collectionsrcollections.abcr functoolsrr itertoolsrrr r r r r rrrrrrandomrrrsysr__all__objectrryrrrrr>r<r=rr%rrr0r(r'r$rrr6r|r)r ImportErrorrrrrr r7r*r.rBrCr!rr5r4r3r2r&r/rrrAr9r:r,r"r8r rr r@r1r#rr+r;r-r?rrMrKr+s !%    -,. ` (,t#d+K 4$A B % '$3$%+P 4 0!$ ) ;. ,.6  )8 ,!((HJ / %=P2.D8N.*Z J >1("#1("$ + +"'T $',/B( 60@*$%*(6',=G&&GO 6 E  *" 9  eKLHs$ E %E- E*)E*-E76E7