d_dZ?d_dZ@eAfdZBdZCeCZDdZEdZFdZGd_dZHd ZI dd!lmJZKd"ZJeIjeJ_n #e7$reIZJYnwxYwGd#d$eLZMd%ZNd&ZOd`d(ZPd)ZQd*ZRd+ZSd_d,ZTd_d-ZUdad.ZVd_d/ZWdbd0ZXd1d2d3ZYd_d4ZZd5Z[d6Z\d7Z]d8Z^d9Z_d:Z`d;Zad<Zbd=Zcd>Zdd?Zed@ZfdcdAZgdBZhdddCZie.dDkrddElmjZkdddFZjeijej_neiZjdGZlemenffdHZodIZpdJZqdKZrdLZsetehdMZudNZvdOZwdPZxdQZydRZzgdSZ{e dTZ|dUZ}ej~j*ZdVZdWZdXZdYZdZZd[Zdd\d]ZdS)daImported 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) bisect_leftinsort)dequesuppress) lru_cachepartialreduce)heappush heappushpop) accumulatechain combinationscompresscountcyclegroupbyisliceproductrepeatstarmap takewhiletee zip_longest)prodcombisqrtgcd)mulnot_ itemgettergetitemindex) randrangesamplechoice) hexversion)2 all_equalbatchedbefore_and_afterconsumeconvolve dotproduct first_truefactorflattengrouperis_prime iter_except iter_indexloopsmatmul multinomialncyclesnthnth_combinationpadnonepad_nonepairwise partitionpolynomial_evalpolynomial_from_rootspolynomial_derivativepowersetprependquantifyreshape#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobinrunning_mediansievesliding_window subslicessum_of_squarestabulatetailtaketotient transpose triplewiseuniqueunique_everseenunique_justseenTstrict)sumprodc"t||SN)r-)xys /Users/kimhansen/Desktop/03 Workspace/ceo-agents/chl-effectiveness/mcp-servers/whoop/.venv/lib/python3.11/site-packages/more_itertools/recipes.pyrblsJq!,,) heappush_maxheappushpop_maxFc<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 rarSrSxs x## $ $$rcc<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 rarQrQs xu & &&rcc t|}t|td||z dS#t$r!t t ||cYSwxYw)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] rNmaxlen)lenrmax TypeErroriterr)rhrisizes rarRrRsr88}}hAtax 0 0$777 ///E(1---...../s3(AAcn|t|ddStt|||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 Nrro)rnextr)iteratorrhs rar+r+sG@ y hq!!!!!! VHa # #T*****rcc@tt||d|S)zReturns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)rwr)rirhdefaults rar9r9s  xD))7 3 33rccDt||}|D] }|D]}dSdSdS)a 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 FT)r)rikeyrxfirstseconds rar(r(sF$x%%H  F555tt 4rcc<tt||S)zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumrk)ripreds rarDrDs s4"" # ##rcc<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)rrris rar<r<s 6$<< ( ((rcc`tjtt||S)zvReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterablertuplerirhs rar8r8s%  veHooq99 : ::rccHttt||S)zReturns the dot product of the two iterables. >>> dotproduct([10, 15, 12], [0.65, 0.80, 1.25]) 33.5 >>> 10 * 0.65 + 15 * 0.80 + 12 * 1.25 33.5 In Python 3.12 and later, use ``math.sumprod()`` instead. )rrkr)vec1vec2s rar-r-s s3d## $ $$rcc*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. )rr) listOfListss rar0r0+s  { + ++rcc||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 rarJrJ7s9, }tVD\\*** 4e,, - --rccft|\}}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`. Nrrwzip)riabs ra _pairwiserRs. x==DAqDMMM q!99rc)r=c t|Sr^)itertools_pairwisers rar=r=fs!(+++rcc eZdZdfd ZxZS)UnequalIterablesErrorNcld}| |dj|z }t|dS)Nz Iterables have different lengthsz/: index 0 has length {}; index {} has length {})formatsuper__init__)selfdetailsmsg __class__s rarzUnequalIterablesError.__init__msI0   MEM C rcr^)__name__ __module__ __qualname__r __classcell__)rs@rarrls=rcrc#rKt|dtiD]"}|D]}|turt|V#dS)N fillvalue)r_markerr) iterablescombovals ra_zip_equal_generatorrws`i;7;; . .Cg~~+--- rcc  t|d}t|dddD]-\}}t|}||krt|||f.t|S#t$rt |cYSwxYw)Nr)r)rq enumeraterrrsr)r first_sizeiitrus ra _zip_equalrs /1&& y}a00 K KEArr77Dz!!+ZD4IJJJJ"I ///#I...../sA#A&&BBfillct|g|z}|dkr t|d|iS|dkr t|S|dkr t|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. >>> iterator = grouper('ABCDEFG', 3, incomplete='strict') >>> list(iterator) # doctest: +IGNORE_EXCEPTION_DETAIL Traceback (most recent call last): ... UnequalIterablesError rrr[ignorez Expected fill, strict, or ignore)rtrrr ValueError)rirh incompleter iteratorss rar1r1so:h 1$IVI;;;;X9%%XI;<<>> 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). rN)rkrtrangerqrrrw)rr num_actives rarKrKs~D)$$IC NNAr22(( &J7788 tY''''''''''((rcc|t}t|d\}}}tt||\}}t|tt|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, ' ']) N)boolrrkrr )rrit1t2pp1p2s rar>r>sc( |Ha  IBA T1  FB RT2 ' '"b)9)9 ::rcct|tjfdtt dzDS)a1Yields 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`. c38K|]}t|VdSr^)r).0rss ra zpowerset..s-MMa|Aq11MMMMMMrcr)rgrrrrq)rirs @rarBrBsH" XA  MMMM5Q!;L;LMMM M MMrcc#Kt}|j}g}|j}|du}|D]H}|r ||n|} ||vr|||V&#t$r||vr|||VYEwxYwdS)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)setaddappendrs) rir|seenset seenset_addseenlist seenlist_adduse_keyelementks rarXrXs6eeG+KH?LoG  # 0CCLLL  A       Q    sA  A-,A-c |*ttdt|Sttttdt||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'] Nrr)rkr!rrw)rir|s rarYrY'sQ {:a=='("3"3444 tSA#(>(>?? @ @@rccHt|||}t||S)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. )r|reverse)r|)sortedrY)rir|r sequenceds rarWrW6s+ xS':::I 9# . . ..rcc#xKt|5| |V |V #1swxYwYdS)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)r exceptionr}s rar3r3Js, )    %''MMM $&&LLL s /33c>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' )rwfilter)rirzrs rar.r.gs" tX&& 0 00rcrrcRd|D|z}td|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, repeat=repeat)``. c,g|]}t|Srrpools ra z"random_product..s * * *TU4[[ * * *rcc34K|]}t|VdSr^)r&rs rarz!random_product..s(00$000000rcr)rrpoolss rarIrI{s9 + *T * * *V 3E 00%000 0 00rcct|}|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)``. )rrqr%)rirrs rarHrHs8 ??DYD AA a ! !!rcct|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|] }|V dSr^rrrrs rarz%random_combination..'**Qa******rc)rrqrr%r)rirrhindicesrs @rarGrGs[ ??D D AVE!HHa(())G ****'*** * **rcct|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)``. c36K|]}tVdSr^)r$rrrhs rarz6random_combination_with_replacement..s)44aYq\\444444rcc3(K|] }|V dSr^rrs rarz6random_combination_with_replacement..rrc)rrqrr)rirrrhrs @@rarFrFsg ??D D A444458844444G ****'*** * **rcct|}t|}|dks||krtd}t|||z }t d|dzD]}|||z |zz|z}|dkr||z }|dks||krt g}|rS||z|z|dz |dz }}}||kr||z}|||z z|z|dz }}||k||d|z |St|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. rrr)rrqrminr IndexErrorr) rirr#rrhcrrresults rar:r:s8 ??D D A A1q55 A Aq1u A 1a!e__!! QOq  qyy    uzz F $a%1*a!eQUa1qjj QJEA;!#QUqAqjj  d26l### $ ==rcc$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)valuerxs rarCrCs %( # ##rcc#Kt|ddd}t|}tdg||z}t|t d|dz D])}||t ||V*dS)u}Discrete linear convolution of two iterables. Equivalent to polynomial multiplication. For example, multiplying ``(x² -x - 20)`` by ``(x - 3)`` gives ``(x³ -4x² -17x + 60)``. >>> list(convolve([1, -1, -20], [1, -3])) [1, -4, -17, 60] Examples of popular kinds of kernels: * The kernel ``[0.25, 0.25, 0.25, 0.25]`` computes a moving average. For image data, this blurs the image and reduces noise. * The kernel ``[1/2, 0, -1/2]`` estimates the first derivative of a function evaluated at evenly spaced inputs. * The kernel ``[1, -2, 1]`` estimates the second derivative of a function evaluated at evenly spaced inputs. Convolutions are mathematically commutative; however, the inputs are evaluated differently. The signal is consumed lazily and can be infinite. The kernel is fully consumed before the calculations begin. Supports all numeric types: int, float, complex, Decimal, Fraction. References: * Article: https://betterexplained.com/articles/intuitive-convolution/ * Video by 3Blue1Brown: https://www.youtube.com/watch?v=KuXjwB4LzSA Nrrror)rrqrrrr_sumprod)signalkernelrhwindowr_s rar,r,sF6]]44R4 F F A A3q ! ! !A %F 66!QU++ , ,'' avv&&&&&&''rcct|\}}tt||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. )rrrr) predicatertruesafters rar*r*&s<r77LE5 Yy%00#e** = =E %<rcct|d\}}}t|dt|dt|dt|||S)zReturn overlapping triplets from *iterable*. >>> list(triplewise('ABCDE')) [('A', 'B', 'C'), ('B', 'C', 'D'), ('C', 'D', 'E')] rNr)rirrt3s rarVrV9sPXq!!JBBTNNNTNNNTNNN r2r??rcct||}t|D]$\}}tt|||d%t |Sr^)rrrwrr)rirhrrrxs ra_sliding_window_islicerIsUHa  I ++++ 8 VHa # #T****  ?rcc#Kt|}tt||dz |}|D](}||t |V)dS)Nrro)rtrrrr)rirhrxrr_s ra_sliding_window_dequer QsqH~~H 6(AE**1 5 5 5F  aFmmrcc|dkrt||S|dkrt||S|dkrt|S|dkrt|St d|)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`. rzn should be at least one, not )r rr=rrrs rarNrNZsy 2vv$Xq111 Q%h222 a!!! a8}}=!==>>>rcc t|}tttt t |dzd}t tt||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. rr ) rgrslicerrrqrkr"r)riseqslicess rarOrOssR x..C ULs3xx!|)<)>> roots = [5, -4, 3] # (x - 5) * (x + 4) * (x - 3) >>> polynomial_from_roots(roots) # x³ - 4 x² - 17 x + 60 [1, -4, -17, 60] Note that polynomial coefficients are specified in descending power order. Supports all numeric types: int, float, complex, Decimal, Fraction. r)rgr,)rootspolyroots rar@r@s> 3D00HTAu:..// Krcc#:Kt|dd}|7t|||}t||D]\}}||us||kr|VdS|t|n|}|dz }t t 5 |||dz|x}V#1swxYwYdS)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. r#Nr)getattrrrrqrr)rirrmstop seq_indexrxrrs rar4r4s 2'400I(E400#He44  JAw%7e#3#3   !% s8}}}$ AI j ! ! ; ; ;%IeQUD999q::: ; ; ; ; ; ; ; ; ; ; ;s9BBBc #K|dkrdVd}td|dzz}t|d|t|dzD]_}t|d|||zEd{Vtt t ||z|||z|||z|||z<||z}`t|d|Ed{VdS)zeYield the primes less than n. >>> list(sieve(30)) [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] r r)rrr)rN) bytearrayr4rbytesrqr)rhrmdatars rarMrMs 1uu E V  Q 'D aU1XX\ : : :dAua!e444444444"'E!a%AE,B,B(C(C"D"DQUQQ A$5)))))))))))rcc#"K|dkrtdt|}tt||x}rI|r"t ||krtd|Vtt||x}GdSdS)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)rrtrrrq)rirhr[rxbatchs ra_batchedr s 1uu1222H~~H!,,-- -%  >> 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 rarUrUs  rccf t|n#t$rYdSwxYwt||S)z.Scalars are bytes, strings, and non-iterables.T)rtrs isinstance)r stringlikes ra _is_scalarr)sF U tt eZ ( ((s   ct|} t|}n#t$r|cYSwxYwt|f|}t |r|Stj|}Z)z.Depth-first iterator over scalars in a tensor.)rtrw StopIterationrr)r)tensorrxrs ra_flatten_tensorr- sF||H1 NNEE   OOO %8,, e   O&x001s " 11ct|tr"ttj||S|^}}t |}t tt||}t||S)aChange the shape of a *matrix*. If *shape* is an integer, the matrix must be two dimensional and the shape is interpreted as the desired number of columns: >>> matrix = [(0, 1), (2, 3), (4, 5)] >>> cols = 3 >>> list(reshape(matrix, cols)) [(0, 1, 2), (3, 4, 5)] If *shape* is a tuple (or other iterable), the input matrix can have any number of dimensions. It will first be flattened and then rebuilt to the desired shape which can also be multidimensional: >>> matrix = [(0, 1), (2, 3), (4, 5)] # Start with a 3 x 2 matrix >>> list(reshape(matrix, (2, 3))) # Make a 2 x 3 matrix [(0, 1, 2), (3, 4, 5)] >>> list(reshape(matrix, (6,))) # Make a vector of length six [0, 1, 2, 3, 4, 5] >>> list(reshape(matrix, (2, 1, 3, 1))) # Make 2 x 1 x 3 x 1 tensor [(((0,), (1,), (2,)),), (((3,), (4,), (5,)),)] Each dimension is assumed to be uniform, either all arrays or all scalars. Flattening stops when the first value in a dimension is a scalar. Scalars are bytes, strings, and non-iterables. The reshape iterator stops when the requested shape is complete or when the input is exhausted, whichever comes first. ) r'intr)rrr-r reversedr)matrixshape first_dimdims scalar_streamreshapeds rarErEspB%;u*622E:::I#F++Mgx~~}==H (I & &&rcc t|d}tttt |t ||S)a#Multiply 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. Supports all numeric types: int, float, complex, Decimal, Fraction. r)rqr)rrrrU)m1m2rhs rar6r6@s= BqE A 78WR2%?%?@@! D DDrcctd|D]R}dx}}d}|dkr:||z|z|z}||z|z|z}||z|z|z}t||z |}|dk:||kr|cSStd)Nrr zprime or under 5)rrr)rhrr_r`ds ra_factor_pollardr<Os1a[[   A 1ffQaAQaAQaAAE1 A 1ff 66HHH  ' ( ((rcc#*K|dkrdStD]}||zs|V||z}||zg}|dkr|gng}|D]F}|dkst|r||-t|}||||zfz }Gt |Ed{VdS)aYield the prime factors of n. >>> list(factor(360)) [2, 2, 2, 3, 3, 5] Finds small factors with trial division. Larger factors are either verified as prime with ``is_prime`` or split into smaller factors with Pollard's rho algorithm. r Nri)_primes_below_211r2rr<r)rhprimeprimestodofacts rar/r/bs 1uu#e) KKK %KAe)  Fa%%A33RD && v::!: MM!    "1%%D T19% %DDf~~rcc t|}|dkrt|dSttt |t t |}t||S)aEvaluate a polynomial at a specific value. Computes with better numeric stability than Horner's method. Evaluate ``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 Note that polynomial coefficients are specified in descending power order. Supports all numeric types: int, float, complex, Decimal, Fraction. r)rqtyperkpowrr0rr) coefficientsr_rhpowerss rar?r?sc LAAvvtAwwqzz fQii%((!3!3 4 4F L& ) ))rcc.tt|S)zReturn the sum of the squares of the input values. >>> sum_of_squares([10, 20, 30]) 1400 Supports all numeric types: int, float, complex, Decimal, Fraction. )rrr%s rarPrPs SWW rcct|}ttd|}tt t ||S)uCompute the first derivative of a polynomial. Evaluate the derivative of ``x³ - 4 x² - 17 x + 60``: >>> coefficients = [1, -4, -17, 60] >>> derivative_coefficients = polynomial_derivative(coefficients) >>> derivative_coefficients [3, -8, -17] Note that polynomial coefficients are specified in descending power order. Supports all numeric types: int, float, complex, Decimal, Fraction. r)rqr0rrgrkr)rGrhrHs rarArAs@ LA eAqkk " "F Cv.. / //rccTtt|D] }|||zz} |S)uReturn the count of natural numbers up to *n* that are coprime with *n*. Euler's totient function φ(n) gives the number of totatives. Totative are integers k in the range 1 ≤ k ≤ n such that gcd(n, k) = 1. >>> n = 9 >>> totient(n) 6 >>> totatives = [x for x in range(1, n) if gcd(n, x) == 1] >>> totatives [1, 2, 4, 5, 7, 8] >>> len(totatives) 6 Reference: https://en.wikipedia.org/wiki/Euler%27s_totient_function )rr/)rhr@s rarTrTs3&VAYY Q%Z Hrc))i)r )i)I)ltT7)r =)lay)r  iS_)l;n>)r rrN )lp )r rrRrNrSrP)l)r iEi$inii=ik)l%!Hn fW) r rrRrNrSrPrQrL%)c|dz |z dz }||z }d|z|z|kr |dzr|dksJ||fS)z#Return s, d such that 2**s * d == nrr) bit_length)rhrr;s ra _shift_to_oddr[s\ a%1  ""Q&A QA Fa<1  Q 16666 a4Krcc|dkr|dzrd|cxkr|ksnJt|dz \}}t|||}|dks ||dz krdSt|dz D]}||z|z}||dz krdSdS)Nr rTF)r[rFr)rhbaserr;r__s ra_strong_probable_primer_s EEAEAMMMMMMMMMM Q  DAq D!QAAvva!et 1q5\\ EAI A::44  5rccdkrdvSdzrdzrdzrdzr dzrdzsd StD] \}}|krnfd td D}tfd |DS) aReturn ``True`` if *n* is prime and ``False`` otherwise. Basic examples: >>> is_prime(37) True >>> is_prime(3 * 13) False >>> is_prime(18_446_744_073_709_551_557) True Find the next prime over one billion: >>> next(filter(is_prime, count(10**9))) 1000000007 Generate random primes up to 200 bits and up to 60 decimal digits: >>> from random import seed, randrange, getrandbits >>> seed(18675309) >>> next(filter(is_prime, map(getrandbits, repeat(200)))) 893303929355758292373272075469392561129886005037663238028407 >>> next(filter(is_prime, map(randrange, repeat(10**60)))) 269638077304026462407872868003560484232362454342414618963649 This function is exact for values of *n* below 10**24. For larger inputs, the probabilistic Miller-Rabin primality test has a less than 1 in 2**128 chance of a false positive. rT>r rrRrNrSrPrrrRrNrSrPFc3>K|]}tddz VdS)r rN)_private_randrangers rarzis_prime..*s2AA!#Aq1u--AAAAAArc@c38K|]}t|VdSr^)r_)rr]rhs rarzis_prime..,s.AA4%a..AAAAAArc)_perfect_testsrall)rhlimitbasess` rar2r2sB 2vv((( Ea!eA!a%AFq2vu&BB u u99 E BAAAuRyyAAA AAAA5AAA A AArcc"td|S)zReturns an iterable with *n* elements for efficient looping. Like ``range(n)`` but doesn't create integers. >>> i = 0 >>> for _ in loops(5): ... i += 1 >>> i 5 Nr)rhs rar5r5/s $??rccbtttt||S)uNumber of distinct arrangements of a multiset. The expression ``multinomial(3, 4, 2)`` has several equivalent interpretations: * In the expansion of ``(a + b + c)⁹``, the coefficient of the ``a³b⁴c²`` term is 1260. * There are 1260 distinct ways to arrange 9 balls consisting of 3 reds, 4 greens, and 2 blues. * There are 1260 unique ways to place 9 distinct objects into three bins with sizes 3, 4, and 2. The :func:`multinomial` function computes the length of :func:`distinct_permutations`. For example, there are 83,160 distinct anagrams of the word "abracadabra": >>> from more_itertools import distinct_permutations, ilen >>> ilen(distinct_permutations('abracadabra')) 83160 This can be computed directly from the letter counts, 5a 2b 2r 1c 1d: >>> from collections import Counter >>> list(Counter('abracadabra').values()) [5, 2, 2, 1, 1] >>> multinomial(5, 2, 2, 1, 1) 83160 A binomial coefficient is a special case of multinomial where there are only two categories. For example, the number of ways to arrange 12 balls with 5 reds and 7 blues is ``multinomial(5, 7)`` or ``math.comb(12, 5)``. Likewise, factorial is a special case of multinomial where the multiplicities are all just 1 so that ``multinomial(1, 1, 1, 1, 1, 1, 1) == math.factorial(7)``. Reference: https://en.wikipedia.org/wiki/Multinomial_theorem )rrkrr )countss rar7r7=s'T D*V,,f55 6 66rcc #<K|j}g}g}tt5 t|t |||dVt |t |||d|dzdz Vm#1swxYwYdS)z.Non-windowed running_median() for Python 3.14+Trr N)__next__rr+rdr r rerxreadlohis ra#_running_median_minheap_and_maxheaprrjs  D B B - && & [TTVV44 5 5 5Q%KKK RTTVV44 5 5 5a52a5=A% % % %  &&&&&&&&&&&sA/BBBc #DK|j}g}g}tt5 t|t || |d Vt|t ||  |d|dz dz Vq#1swxYwYdS)zDBackport of non-windowed running_median() for Python 3.13 and prior.Trr N)rmrr+r r rns ra_running_median_minheap_onlyrtzs  D B B - && & R+b$$&&111 2 2 2a5&LLL R+b4466'222 3 3 3a52a5=A% % % %  &&&&&&&&&&&sA3BBBc#bKt}g}|D]}||t||t||kr%t ||}||=t|}|dz}|dzr||n||dz ||zdz VdS)z+Yield median of values in a sliding window.r rN)rrrrqrpopleft)rxrprorderedr_rrhms ra_running_median_windowedrysWWFG  I I aw w<<& GV^^%5%566A LL FEHgajjA(Cq'HHHHH I Ircroct|}|4t|}|dkrtdt||Stst |St |S)aDCumulative median of values seen so far or values in a sliding window. Set *maxlen* to a positive integer to specify the maximum size of the sliding window. The default of *None* is equivalent to an unbounded window. For example: >>> list(running_median([5.0, 9.0, 4.0, 12.0, 8.0, 9.0])) [5.0, 7.0, 5.0, 7.0, 8.0, 8.5] >>> list(running_median([5.0, 9.0, 4.0, 12.0, 8.0, 9.0], maxlen=3)) [5.0, 7.0, 5.0, 9.0, 8.0, 9.0] Supports numeric types such as int, float, Decimal, and Fraction, but not complex numbers which are unorderable. On version Python 3.13 and prior, max-heaps are simulated with negative values. The negation causes Decimal inputs to apply context rounding, making the results slightly different than that obtained by statistics.median(). NrzWindow size should be positive)rtr#rry_max_heap_availablertrr)rirprxs rarLrLsl.H~~H v Q;;=>> >'&999 6+H555 .x 8 88rc)rr^)rN)NF)NN)rN)__doc__randombisectrr collectionsr contextlibr functoolsrr r heapqr r itertoolsr rrrrrrrrrrrrrmathrrrroperatorrr r!r"r#r$r%r&sysr'__all__objectrrr$rsr\r ImportErrorrdrer{rSrQrRr+r9r(rrDr<r;r8r-r0rJrr=rrrrrr1rKr>rBrXrYrWr3r.rIrHrGrFr:rCr,r*rVrr rNrOr@r4rMr r)r"rUstrrr)r-rEr6r<rr?r/r?rPrArTrer[r_Randomrbr2r5r7rrrtryrLrrcrars &&&&&&&&0000000000'''''''' ('''''''''''::::::::::::::,,,,,,,,,,3 3 3 j &((,Ct'#d+++KKKKK-(((((((---,,HHH- 33333333    % % % ''''$ 8 8 8 %+%+%+%+P 4 4 4 44!$$$$ ) ) ) ;;; % % % , , ,....6    )888888 ,,,!(HHHHJ / / / %=%=%=%=P((($;;;8NNN*****Z A A A A////(:1111("#11111(""""$ + + + +++"'''T $ $ $('('('V&    ???2 - - -,&;&;&;&;R****%*(666666',=====&GOOG   #&u)))) 1 1 1&'&'&'R E E E ) ) ) E%%**%%B***.000&   2     &#V]__.-B-B-B`   *7*7*7Z & & & & & & III&(,"9"9"9"9"9"9"9sH B B*)B*.B55C?CCCC D##D-,D-