+ hoRt^RIt^RIt^RIHt^RIHt^RIHtH t ^RI H t H t H t HtHtHtHtHtHtHtHtHt^RIHtHtHt^RIHt.RNR NR NR NR NR NRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNR NR!NR"NR#NR$NR%NR&NR'NR(NR)NR*NR+NR,NR-NR.NR/NR0NR1NR2NR3NR4NR5Nt]!4t] !R6R77]!] R6R77t!]#!]R8R94t$R:t%RsR;lt&R<t'RtR=lt(RtR>lt)RtR?lt*]+3R@lt,RAt-]-t.RBt/RCt0RDt1RtRElt2RFt3^RGI H4t5RHt4]3P]4n!RIRJ]74t8RKt9RLt:RuRMlt;RNtRtRQlt?RtRRlt@RvRTltARtRUltBRwRVltCRW^/RXltDRtRYltERZtFR[tGR\tHR]tIR^tJR_tKR`tLRatMRbtNRctORxRdltPRetQRfRS/RgltR]Rh8d^RiI HStTRfRS/RjltSM]RtS]RP]SnRktURltVRmtWRntXRotYRptZRqt[Rrt\R# ]"d] t!ELi;i ]6d]3t4Li;i)yaImported 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 triplewiseuniqueunique_everseenunique_justseenTstrictsumprodc\W4#N)r)xys&&K/usr/lib/python3/dist-packages/setuptools/_vendor/more_itertools/recipes.pyrL_s A1Ac*\\W44#)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=bs x# $$rMc,\V\V44#)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;rs xu &&rMc #"\V\4'd2\V\^\ V4V, 4R4RjxL R#\ \ WR74RjxL R#L%L5i)zsReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] Nmaxlen) isinstancerr maxleniterrrPs&&rKr<r<sR(E""(C3x=1+<$=tDDDh1222 E2s$AA-A)A-"A+#A-+A-cXVf\V^R7R#\\WV4R4R#)aAdvance *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 NrX)rnextr )iteratorrQs&&rKrrs'@ y hq! VH #T*rMc.\\WR4V4#)zmReturns 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 33rMc V\\\\W4^444^8*#)aw Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False A function that accepts a single argument and returns a transformed version of each input item can be specified with *key*: >>> all_equal('AaaA', key=str.casefold) True >>> all_equal([1, 2, 3], key=lambda x: x < 10) True )r\rOr r rRkeys&&rKrrs%$ tF781156 71 <>> quantify([True, False, True]) 2 )sumrT)rRpreds&&rKr/r/s s4" ##rMc,\V\R44#)zReturns 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$< ((rMcT\P!\\V4V44#)zjReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterablertuple)rRrQs&&rKr#r#s    veHoq9 ::rMcH\\\PW44#)zWReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )rgrToperatormul)vec1vec2s&&rKrrs s8<<, --rMc.\P!V4#)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. )rrl) listOfListss&rKrrs   { ++rMc^Vf\V\V44#\V\W!44#)a Call *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&&*rKr5r5s,, }tVD\** 4, --rMcJ\V4wr\VR4\W4#)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}6s" x=DADM q9rMr(c\V4#rH)itertools_pairwiserjs&rKr(r(Js !(++rMc6aa]tRtRtoRV3RlltRtVtV;t#)UnequalIterablesErroriPc`<RpVeVRP!V!, p\SV` V4R#)z Iterables have different lengthsNz/: index 0 has length {}; index {} has length {})formatsuper__init__)selfdetailsmsg __class__s&& rKrUnequalIterablesError.__init__Qs80   EMM C rMrH)__name__ __module__ __qualname____firstlineno__r__static_attributes____classdictcell__ __classcell__)r __classdict__s@@rKrrPsrMrc#|"\VR\/F$pVFpV\JgK\4h VxK& R#5i) fillvalueN)r_markerr) iterablescombovals& rK_zip_equal_generatorr[s:i;7;Cg~+-- >> 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]rrrz ValueError)rRrQ incompleterrxs&&&& rKrrss^: 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). N)rTr]ranger\r r r_)r iterators num_actives* rKr6r6sLD)$IC NAr2 &78 tY'''3'sAA A A cVf\p\V^4wr#p\\W44wrV\V\\P V44\W643#)aw 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, ' ']) )boolrrTrronot_)rhrRt1t2pp1p2s&& rKr)r)sP( |Ha IBA T FB RX]]B/ 0(22B CCrMca\V4o\P!V3Rl\\ S4^,444#)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. >>> seq = [1, 1, 0] >>> list(powerset(seq)) [(), (1,), (1,), (0,), (1, 1), (1, 0), (1, 0), (1, 1, 0)] For a variant that efficiently yields actual :class:`set` instances, see :func:`powerset_of_sets`. c3<<"TFp\SV4xK R#5irH)r).0rss& rK powerset..sM;La|Aq11;Ls)rOrrlrr\)rRrs&@rKr-r-s2" XA   M5Q!;LM MMrMc# "\4pVPp.pVPpVRJpVF*pV'd V!V4MTpW9dV!V4VxK*K, R# \dY9dT!T4TxKPKSi;i5i)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. 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) rRreseenset seenset_addseenlist seenlist_adduse_keyelementks && rKrBrBs6eG++KH??LoG#CL A     Q ! s*ABABB:BBBc Vf*\\P!^4\V44#\\\\P!^4\W444#)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'] )rTro itemgetterr r_rds&&rKrCrC sJ {8&&q)78+<== tS,,Q/1GH IIrMFc2\\WVR7VR7#)aYields unique elements in sorted order. >>> list(unique([[1, 2], [3, 4], [1, 2]])) [[1, 2], [3, 4]] *key* and *reverse* are passed to :func:`sorted`. >>> list(unique('ABBcCAD', str.casefold)) ['A', 'B', 'c', 'D'] >>> list(unique('ABBcCAD', str.casefold, reverse=True)) ['D', 'c', 'B', 'A'] The elements in *iterable* need not be hashable, but they must be comparable for sorting to work. )rereverse)re)rCsorted)rRrers&&&rKrArAs 6(WE3 OOrMc#Z"Ve V!4xV!4xK TdR#i;i5i)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))) [] Nr)rv exceptionfirsts&&&rKr r -s2,  'M&L    s+(+(+c,\\W 4V4#)ad 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)rRrbrhs&&&rKrrLs" t& 00rMrcVUu.uFp\V4NK upV,p\;QJd.RV4FNK 5#!RV44#uupi)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)``. c38"TFp\V4xK R#5irH)r)rpools& rKr!random_product..qs0%$%s)rm)rrxrpoolss$* rKr4r4`sH &* *TTU4[T *V 3E 50%05050%0 00 +sAcb\V4pVf \V4MTp\\W!44#)aFReturn 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)``. )rmr\r)rRrrs&& rKr3r3ts+ ?DYD AA  !!rMca\V4o\S4p\\\ V4V44p\;QJd.V3RlV4FNK 5#!V3RlV44#)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)``. c36<"TFpSV,xK R#5irHrrrrs& rKr%random_combination..*'Qa')rmr\rrr)rRrrQindicesrs&& @rKr2r2sN ?D D AVE!Ha()G 5*'*5*5*'* **rMcaa\V4o\S4o\V3Rl\V444p\;QJd.V3RlV4FNK 5#!V3RlV44#)a;Return 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)``. c3:<"TFp\S4xK R#5irH)r)rrrQs& rKr6random_combination_with_replacement..s48aYq\\8sc36<"TFpSV,xK R#5irHrrs& rKrrrr)rmr\rr)rRrrrQrs&& @@rKr1r1sM ?D D A45844G 5*'*5*5*'* **rMc6\V4p\V4pV^8gW8d\h^p\WV, 4p\ ^V^,4F pWTV, V,,V,pK" V^8d W%, pV^8gW%8d\ h.pV'dpWQ,V,V^, V^, rpW%8d)W%,pWTV, ,V,V^, rEK.VP VRV, ,4Kw\V4#)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. r)rmr\rminr IndexErrorr) rRrindexrrQcrrresults &&& rKr%r%s ?D D A A15 A A1u A 1a!e_ QOq  qy   uz F %1*a!eQUaj JEA;!#QUq d26l# =rMc\V.V4#)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#"\V4RRR1,p\V4p\^.VR7V,p\V\ ^V^, 44F!pVP V4\ W4xK# R#5i)a&Convolve 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. NrXr)rmr\rrrr_sumprod)signalkernelrQwindowrIs&& rKrrsh6]4R4 F F A A3q !A %F 66!QU+ , av&&-sA:A<c\aaa\S4o.oVVV3Rlp\SS4pV!4V3#)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. c3n<"SF)pS!V4'dVxKSPV4R# R#5irH)r)elemr predicate transitions rK true_iterator'before_and_after..true_iterators/D !!$' s25)r]r)rrrremainder_iteratorrsff @rKrrs5 bBJz2. ?. ..rMc#^"\\V44Fwwrwr4WV3xK R#5i)zReturn overlapping triplets from *iterable*. >>> list(triplewise('ABCDE')) [('A', 'B', 'C'), ('B', 'C', 'D'), ('C', 'D', 'E')] Nr~)rRr{_r|rs& rKr@r@s,#8H#56Ag 7s+-c#"\V4p\\W!^, 4VR7pVF!pVPV4\ V4xK# R#5i)a=Return 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`. rXN)r]rr rrm)rRrQrrrIs&& rKr8r8"sE hB 6"!e$Q /F  aFmsAAc \V4p\\\\ \ V4^,4^44p\ \P\V4V4#)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. ) rOrslicerrr\rTrogetitemr)rRseqslicess& rKr9r96sF 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] )rzrrTronegrOrr)rootsfactorss& rKr+r+Ds5&)Su56G x1#. //rMc#"\VRR4pVf4\WV4p\WR4FwrgWqJg Wq8XgKVxK R#Vf \V4MTpV^, pV!W^,V4;pxK \dR#i;i5i)aYield the index of each place in *iterable* that *value* occurs, beginning with index *start* and ending before index *stop*. >>> 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] The behavior for non-scalar *values* matches the built-in Python types. >>> list(iter_index('ABCDABCD', 'AB')) [0, 4] >>> list(iter_index([0, 1, 2, 3, 0, 1, 2, 3], [0, 1])) [] >>> list(iter_index([[0, 1], [2, 3], [0, 1], [2, 3]], [0, 1])) [0, 2] See :func:`locate` for a more general means of finding the indexes associated with particular values. rN)getattrr rr\r)rRrrVstop seq_indexrrrs&&&& rKr!r!Os2'40I HT *#B.JA7#3/ !% s8}$ AI %eUD99q:   s(6B $B "A99 BB BB c #"V^8d^x^p\R4V^,,p\P!V4^,p\V^W4Fdp\V^WV,4RjxL \ \ \ WD,WV,444W$V,WV,1&WD,pKf \V^V4RjxL R#LdL5i)zXYield the primes less than n. >>> list(sieve(30)) [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] N)rr) bytearraymathisqrtr!bytesr\r)rQrVdatalimitrs& rKr7r7zs  1u E V Q 'D JJqMA E a .dAu!e444"'E!%E,B(C"DUQQ /$5))) 5*s%A+C-C.AC C CCrEc#"V^8d \R4h\V4p\\W144;p'd*V'd\ V4V8wd \R4hVxKER#5i)arBatch 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`. zn must be at least onezbatched(): incomplete batchN)rr]rmr r\)rRrQrErbatchs&&$ rK_batchedrsZ 1u122 hB' '% ' c%jAo:; ;  (s AA'#A'i )rc\WVR7#)rD)itertools_batched)rRrQrEs&&$rKrrs V<>> 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  rMcB\\P!V4V4#)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)] )rrrl)matrixcolss&&rKr0r0s 5&&v. 55rMc \V^,4p\\\\ V\ V444V4#)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\rrrr r?)m1m2rQs&& rKr"r"s0 BqE A 78WR2%?@! DDrMc#"\\P!V4^,4F)pW,'dKVxW,pV^8XgK%R# V^8dVxR#R#5i)zHYield the prime factors of n. >>> list(factor(360)) [2, 2, 2, 3, 3, 5] N)r7r r )rQprimes& rKrrsS tzz!}q()))K KAAv *  1u s5A%A%A%c \V4pV^8Xd V^,#\\\V4\ \ V444p\ W4#)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\rTpowrreversedrr) coefficientsrIrQpowerss&& rKr*r*sD LAAv1u fQi%(!3 4F L ))rMc&\\V4!#)zZReturn the sum of the squares of the input values. >>> sum_of_squares([10, 20, 30]) 1400 )rrrs&rKr:r:s SW rMc\V4p\\^V44p\\ \ P W44#)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#rrOrTrorp)r$rQr%s& rKr,r,s4 LA eAqk "F HLL,7 88rMch\\V44FpW,V^, ,pK V#)zmReturn the count of natural numbers up to *n* that are coprime with *n*. >>> totient(9) 6 >>> totient(12) 4 )rr)rQrs& rKr>r> s-^ Fa!e  HrM)rrH)rN)NF)NN)rN)]__doc__r ro collectionsrcollections.abcr functoolsrr itertoolsrrrr r r r r rrrrrandomrrrsysr__all__objectrrzrrrrr=r;r<rr$rrr/r'r&r#rrr5r}r(r ImportErrorrrrrrr6r)r-rBrCrAr rr4r3r2r1r%r.rrr@r8r9r+r!r7rrrr?r0r"rr*r:r,r>rrMrKr3s !%    -,/ /  / /  /   /   / /  / / / / /  / /  /  !/ "#/ $%/ &'/ ()/ *+/ ,-/ .// 01/ 23/ 45/ 67/ 8*9/ :;/ <=/ >?/ @A/ BC/ D E/ FG/ HI/ JK/ LM/ N O/ P Q/ RS/ TU/ VW/ X Y/ Z[/ \]/ b (,t#d+K 4$A B % '$3$%+P 4=*!$ ) ;. ,.6  )8 ,!((HJ / %=P($D8N**Z JP& >1(11("$ + +"'T $',/B( 60(V*$E(6=u=G&&GO 6 E  *" 9  aKZHs$1 GG# G G # G/.G/