l j3dZddlmZgdZddlZddlmZmZm Z m Z m Z m Z m Z ddlmZmZmZddlZedZedZed ejejZed e ZerddlmZdSdZdTdZdUdZdVdZdWd"Z dXd%Z!dXd&Z"edYd*Z#edZd+Z#ed[d,Z#d\d/Z#d]d4Z$d^d7Z%d_d;Z&d`d>Z'dadBZ(dbdDZ)dadEZ*dadFZ+edcdHZ,edddJZ,ededKZ,dfdMZ,dgdPZ-dhdRZ.dS)izOperations on iterables.) annotations) adjacent_n_tuplesadjacent_pairsall_elements_are_instancesconcatenate_listslist_difference_update list_updatelistify make_evenmake_even_by_cyclingremove_list_redundancies remove_nonesstretch_array_to_lengthtuplifyN)Callable Collection GeneratorHashableIterable ReversibleSequence) TYPE_CHECKINGTypeVaroverloadTUFH)boundobjects Sequence[T]nintreturnzip[tuple[T, ...]]cNtfdt|DddiS)aReturns the Sequence objects cyclically split into n length tuples. See Also -------- adjacent_pairs : alias with n=2 Examples -------- .. code-block:: pycon >>> list(adjacent_n_tuples([1, 2, 3, 4], 2)) [(1, 2), (2, 3), (3, 4), (4, 1)] >>> list(adjacent_n_tuples([1, 2, 3, 4], 3)) [(1, 2, 3), (2, 3, 4), (3, 4, 1), (4, 1, 2)] c3DK|]}g|dd|VdSN).0kr s P/home/agentuser/manim-venv/lib/python3.11/site-packages/manim/utils/iterables.py z$adjacent_n_tuples..=s>@@!-7122;-!-@@@@@@strictT)ziprange)r r"s` r,rr-s3 @@@@uQxx@@@ N N NNr.c"t|dS)zAlias for ``adjacent_n_tuples(objects, 2)``. See Also -------- adjacent_n_tuples Examples -------- .. code-block:: pycon >>> list(adjacent_pairs([1, 2, 3, 4])) [(1, 2), (2, 3), (3, 4), (4, 1)] )r)r s r,rr@s Wa ( ((r.iterableIterable[object]Class type[object]boolc:tfd|DS)z^Returns ``True`` if all elements of iterable are instances of Class. False otherwise. c38K|]}t|VdSr() isinstance)r*er6s r,r-z-all_elements_are_instances..Us-66z!U##666666r.)all)r4r6s `r,rrQs( 6666X666 6 66r.items Iterable[T] property_funcCallable[[T], U]list[tuple[list[T], U | None]]cg}g}d}|D]X}||}||kr0t|dkr|||f|}|g}C||Yt|dkr|||f|S)aTakes in a Sequence, and returns a list of tuples, (batch, prop) such that all items in a batch have the same output when put into the Callable property_func, and such that chaining all these batches together would give the original Sequence (i.e. order is preserved). Examples -------- .. code-block:: pycon >>> batch_by_property([(1, 2), (3, 4), (5, 6, 7), (8, 9)], len) [([(1, 2), (3, 4)], 2), ([(5, 6, 7)], 3), ([(8, 9)], 2)] Nr)lenappend)r>r@batch_prop_pairs curr_batch curr_propitemprops r,batch_by_propertyrKXs 8:JI $ $}T"" 9  :"" ''Y(?@@@IJJ   d # # # # :Y 7888 r. list_of_listslist[T]cd|DS)zCombines the Iterables provided as arguments into one list. Examples -------- .. code-block:: pycon >>> concatenate_lists([1, 2], [3, 4], [5]) [1, 2, 3, 4, 5] cg|] }|D]}| Sr)r))r*lstrIs r, z%concatenate_lists..s% : : :Sc : :dD : : : :r.r))rLs r,rr{s ; :M : : ::r.l1l2c fd|DS)zReturns a list containing all the elements of l1 not in l2. Examples -------- .. code-block:: pycon >>> list_difference_update([1, 2, 3, 4], [2, 4]) [1, 3] cg|]}|v| Sr)r)r*r<rSs r,rQz*list_difference_update.. ) ) )!Qb[[A[[[r.r)rRrSs `r,rrs * ) ) )r ) ) ))r.c@fd|DtzS)a9Used instead of ``set.update()`` to maintain order, making sure duplicates are removed from l1, not l2. Removes overlap of l1 and l2 and then concatenates l2 unchanged. Examples -------- .. code-block:: pycon >>> list_update([1, 2, 3], [2, 4, 4]) [1, 3, 2, 4, 4] cg|]}|v| Sr)r)rVs r,rQzlist_update..rWr.)listrXs `r,r r s* * ) ) )r ) ) )DHH 44r.objstr list[str]cdSr(r)r\s r,r r s$'Cr.cdSr(r)r`s r,r r s*-#r.cdSr(r)r`s r,r r s #r.str | Iterable[T] | Tlist[str] | list[T]ct|tr|gSt|trt|S|gS)zConverts obj to a list intelligently. Examples -------- .. code-block:: pycon >>> listify("str") ['str'] >>> listify((1, 2)) [1, 2] >>> listify(len) [] )r;r]rr[r`s r,r r sB#su #x  Cyyu r. iterable_1 iterable_2 Iterable[U]tuple[list[T], list[U]]ct|t|ctttfdtDfdtDfS)aExtends the shorter of the two iterables with duplicate values until its length is equal to the longer iterable (favours earlier elements). See Also -------- make_even_by_cycling : cycles elements instead of favouring earlier ones Examples -------- .. code-block:: pycon >>> make_even([1, 2], [3, 4, 5, 6]) ([1, 1, 2, 2], [3, 4, 5, 6]) >>> make_even([1, 2], [3, 4, 5, 6, 7]) ([1, 1, 1, 2, 2], [3, 4, 5, 6, 7]) c,g|]}|zzSr)r))r*r" len_list_1lengthlist_1s r,rQzmake_even..'CCCZF* +CCCr.c,g|]}|zzSr)r))r*r" len_list_2rmlist_2s r,rQzmake_even..ror.)r[rDmaxr1)rfrgrlrqrmrnrrs @@@@@r,r r s(*%%tJ'7'7NFFVJVJ Z ( (FCCCCCCU6]]CCCCCCCCCU6]]CCC r. Collection[T] Collection[U]ctt|t|}tj|tj|fdt |Dfdt |DfS)aExtends the shorter of the two iterables with duplicate values until its length is equal to the longer iterable (cycles over shorter iterable). See Also -------- make_even : favours earlier elements instead of cycling them Examples -------- .. code-block:: pycon >>> make_even_by_cycling([1, 2], [3, 4, 5, 6]) ([1, 2, 1, 2], [3, 4, 5, 6]) >>> make_even_by_cycling([1, 2], [3, 4, 5, 6, 7]) ([1, 2, 1, 2, 1], [3, 4, 5, 6, 7]) c.g|]}tSr)next)r*_cycle1s r,rQz(make_even_by_cycling..---!f---r.c.g|]}tSr)rx)r*rzcycle2s r,rQz(make_even_by_cycling..r|r.)rsrDitcycler1)rfrgrmr{r~s @@r,r r s(Z#j// 2 2F Xj ! !F Xj ! !F----uV}}-------uV}}--- r.rP Reversible[H]list[H]cg}t}t|D]0}||vr*||||1||S)zgUsed instead of ``list(set(l))`` to maintain order. Keeps the last occurrence of each element. )setreversedrEaddreverse)rPreversed_resultusedxs r,r r slO 55D c]] D==  " "1 % % % HHQKKK r.sequenceIterable[T | None]cd|DS)zRemoves elements where bool(x) evaluates to False. Examples -------- .. code-block:: pycon >>> remove_nones(["m", "", "l", 0, 42, False, True]) ['m', 'l', 42, True] cg|]}||Sr)r))r*rs r,rQz remove_nones..s % % %!1 %A % % %r.r))rs r,rrs & %x % % %%r.nparraynpt.NDArray[F]rmcxt||kr|Stj||g|jddRS)aExtends/truncates nparray so that ``len(result) == length``. The elements of nparray are cycled to achieve the desired length. See Also -------- resize_preserving_order : favours earlier elements instead of cycling them make_even_by_cycling : similar cycling behaviour for balancing 2 iterables Examples -------- .. code-block:: pycon >>> points = np.array([[1, 2], [3, 4]]) >>> resize_array(points, 1) array([[1, 2]]) >>> resize_array(points, 3) array([[1, 2], [3, 4], [1, 2]]) >>> resize_array(points, 2) array([[1, 2], [3, 4]]) N)rDnpresizeshape)rrms r, resize_arrayrsB0 7||v 9Wv: abb(9:: ; ;;r.npt.NDArray[np.float64]ct|dkr%tj|g|jddRSt||kr|Stj|t|z|z}||S)a"Extends/truncates nparray so that ``len(result) == length``. The elements of nparray are duplicated to achieve the desired length (favours earlier elements). Constructs a zeroes array of length if nparray is empty. See Also -------- resize_array : cycles elements instead of favouring earlier ones make_even : similar earlier-favouring behaviour for balancing 2 iterables Examples -------- .. code-block:: pycon >>> resize_preserving_order(np.array([]), 5) array([0., 0., 0., 0., 0.]) >>> nparray = np.array([[1, 2], [3, 4]]) >>> resize_preserving_order(nparray, 1) array([[1, 2]]) >>> resize_preserving_order(nparray, 3) array([[1, 2], [1, 2], [3, 4]]) rrN)rDrzerosrarange)rrmindicess r,resize_preserving_orderr:s{< 7||qx4'-"344555 7||vi#g,,.&8G 7 r.ct|krStjdtdz |}tjfd|DS)avExtends/truncates nparray so that ``len(result) == length``. New elements are interpolated to achieve the desired length. Note that if nparray's length changes, its dtype may too (e.g. int -> float: see Examples) See Also -------- resize_array : cycles elements instead of interpolating resize_preserving_order : favours earlier elements instead of interpolating Examples -------- .. code-block:: pycon >>> nparray = np.array([[1, 2], [3, 4]]) >>> resize_with_interpolation(nparray, 1) array([[1., 2.]]) >>> resize_with_interpolation(nparray, 4) array([[1. , 2. ], [1.66666667, 2.66666667], [2.33333333, 3.33333333], [3. , 4. ]]) >>> nparray = np.array([[[1, 2], [3, 4]]]) >>> nparray = np.array([[1, 2], [3, 4], [5, 6]]) >>> resize_with_interpolation(nparray, 4) array([[1. , 2. ], [2.33333333, 3.33333333], [3.66666667, 4.66666667], [5. , 6. ]]) >>> nparray = np.array([[1, 2], [3, 4], [1, 2]]) >>> resize_with_interpolation(nparray, 4) array([[1. , 2. ], [2.33333333, 3.33333333], [2.33333333, 3.33333333], [1. , 2. ]]) rrcg|]Q}t|ttj||dz}}}d|z |z||zzRS)r)r#rceil)r*cilhrhars r,rQz-resize_with_interpolation..sj   "2wwBGBKK(8(8"q&BUgbk !A O 3   r.)rDrlinspacearray)rrm cont_indicess` r,resize_with_interpolationr`stL 7||v;q#g,,"2F;;L 8    "     r.ct|}||krtdtj|t |z }||z}||t S)Nz8Trying to stretch array to a length shorter than its own)rDWarningrrfloatastyper#)rrmcurr_lenrs r,rrsb7||H&PQQQi%--/G xG 7>>#&& ''r. tuple[str]cdSr(r)r`s r,rrs%(Sr.tuple[T]cdSr(r)r`s r,rrs+.3r.cdSr(r)r`s r,rrs!$r.tuple[str] | tuple[T]ct|tr|fSt|trt|S|fS)zConverts obj to a tuple intelligently. Examples -------- .. code-block:: pycon >>> tuplify("str") ('str',) >>> tuplify([1, 2]) (1, 2) >>> tuplify(len) (,) )r;r]rtupler`s r,rrsB#sv #x  Szzv r.argsGenerator[T, None, None]c'Kt}tj|D] }||vr|||V!dS)azReturns a generator that yields all unique elements of the Iterables provided via args in the order provided. Examples -------- .. code-block:: pycon >>> gen = uniq_chain([1, 2], [2, 3], [1, 4, 4]) >>> from collections.abc import Generator >>> isinstance(gen, Generator) True >>> tuple(gen) (1, 2, 3, 4) N)rrchainr)r unique_itemsrs r, uniq_chainrs]55L Xt_    r.objectc t|trEttt d|DSt|t r3ttt d|DSt|ttfr&ttd|DSt|S)z7Determines a hash, even of potentially mutable objects.c3XK|]%\}}t|t|fV&dSr(hash_obj)r*r+vs r,r-zhash_obj..s7 T T1(1++x{{!; T T T T T Tr.c34K|]}t|VdSr(rr*r<s r,r-zhash_obj..s( : :! : : : : : :r.c34K|]}t|VdSr(rrs r,r-zhash_obj..s(33!(1++333333r.)r;dicthashrsortedr>rr[r`s r,rrs#tWE& T T T T TTTUUVVV#s=E& : :c : : :::;;<<<#t}%%5E33s33333444 99r.)r r!r"r#r$r%)r r!r$r%)r4r5r6r7r$r8)r>r?r@rAr$rB)rLr?r$rM)rRr?rSr?r$rM)r\r]r$r^)r\r?r$rM)r\rr$rM)r\rcr$rd)rfr?rgrhr$ri)rfrtrgrur$ri)rPrr$r)rrr$rM)rrrmr#r$r)rrrmr#r$r)r\r]r$r)r\r?r$r)r\rr$r)r\rcr$r)rr?r$r)r\rr$r#)/__doc__ __future__r__all__ itertoolsrcollections.abcrrrrrrrtypingrrrnumpyrrrfloat64int_rr numpy.typingnptrrrrKrrr r r r r rrrrrrrrr)r.r,rs@""""""    4333333333 GCLL GCLL GCRW%% GCx   OOOO&))))"7777    F ; ; ; ; * * * * 5 5 5 5 ''' ' --- - ### #,<:     & & & &<<<<:####L////d(((( ((( ( ... . $$$ $,.      r.