U Ev fEA@sHdZddlmZddlmZmZmZddlZddlm Z ddl m Z m Z ddl mZmZddlmZmZmZmZmZmZmZmZmZd Zed ed Zed ed Zed ZedZddddddZddddddZ GdddeeefZ!edddddZ"edd d!d"dZ"ed ddd#d$dZ"d%dZ"d ddd#d&d'Z#dS)(a Cycler ====== Cycling through combinations of values, producing dictionaries. You can add cyclers:: from cycler import cycler cc = (cycler(color=list('rgb')) + cycler(linestyle=['-', '--', '-.'])) for d in cc: print(d) Results in:: {'color': 'r', 'linestyle': '-'} {'color': 'g', 'linestyle': '--'} {'color': 'b', 'linestyle': '-.'} You can multiply cyclers:: from cycler import cycler cc = (cycler(color=list('rgb')) * cycler(linestyle=['-', '--', '-.'])) for d in cc: print(d) Results in:: {'color': 'r', 'linestyle': '-'} {'color': 'r', 'linestyle': '--'} {'color': 'r', 'linestyle': '-.'} {'color': 'g', 'linestyle': '-'} {'color': 'g', 'linestyle': '--'} {'color': 'g', 'linestyle': '-.'} {'color': 'b', 'linestyle': '-'} {'color': 'b', 'linestyle': '--'} {'color': 'b', 'linestyle': '-.'} ) annotations)HashableIterable GeneratorN)reduce)productcycle)muladd) TypeVarGenericCallableUnionDictListAnyoverloadcastz0.12.1K)boundLVUz#Cycler[K, V] | Iterable[dict[K, V]]*Cycler[K, V] | Iterable[dict[K, V]] | Noneset[K])leftrightreturncCs`|gkrtt|ni}|dk r,tt|ni}t|}t|}||@rXtd||BS)a Helper function to compose cycler keys. Parameters ---------- left, right : iterable of dictionaries or None The cyclers to be composed. Returns ------- keys : set The keys in the composition of the two cyclers. Nz"Can not compose overlapping cycles)nextitersetkeys ValueError)rrZl_peekZr_peekZl_keyZr_keyr#3/tmp/pip-unpacked-wheel-onpxacu0/cycler/__init__.py _process_keys>s  r% Cycler[K, V]z Cycler[K, U]zCycler[K, V | U]cs|j|jkr.tdj|j|j@|j|jAdttttttt ff| ttttttt ff| t t fdd|jDS)aS Concatenate `Cycler`\s, as if chained using `itertools.chain`. The keys must match exactly. Examples -------- >>> num = cycler('a', range(3)) >>> let = cycler('a', 'abc') >>> num.concat(let) cycler('a', [0, 1, 2, 'a', 'b', 'c']) Returns ------- `Cycler` The concatenated cycler. zBKeys do not match: Intersection: {both!r} Disjoint: {just_one!r})ZbothZjust_onec3s$|]}t|||VqdSN_cycler.0kZ_l_rr#r$ tszconcat..) r!r"formatrrrrrrrby_keyrr )rrr#r-r$concatXs  ""r2c@s~eZdZdZddZdEddddd d Zd d Zed dddZddddddZ e ddddddZ dddddZ ddd d!Z d"d#d$d%d&Zed"d#d$d'd(Zed)dd$d*d(Zd+d(Zed"d#d$d,d-Zed)dd$d.d-Zd/d-Zd)dd0d1Zddd$d2d3Zd4dd$d5d6Zd7d8d$d9d:ZdZd;ddd?Zd@ddAdBZeZdddCdDZeZdS)FCyclera Composable cycles. This class has compositions methods: ``+`` for 'inner' products (zip) ``+=`` in-place ``+`` ``*`` for outer products (`itertools.product`) and integer multiplication ``*=`` in-place ``*`` and supports basic slicing via ``[]``. Parameters ---------- left, right : Cycler or None The 'left' and 'right' cyclers. op : func or None Function which composes the 'left' and 'right' cyclers. cCst|Sr')rselfr#r#r$__call__szCycler.__call__NrzCycler[K, V] | Noner)rropcCst|tr t|j|j|j|_n |dk r:dd|D|_ng|_t|tr`t|j|j|j|_nd|_t|j|j|_||_dS)zf Semi-private init. Do not use this directly, use `cycler` function instead. NcSsg|]}t|qSr#)copyr+vr#r#r$ sz#Cycler.__init__..) isinstancer3_left_right_opr%_keys)r5rrr7r#r#r$__init__s$  zCycler.__init__cCs ||jkSr')r@)r5r,r#r#r$ __contains__szCycler.__contains__r)rcCs t|jS)z!The keys this Cycler knows about.)r r@r4r#r#r$r!sz Cycler.keysrNone)oldnewrcskr dS|jkr2tdddd|jkrXtdddd|j|j|jdk r|jjkr|jn4t|j t r|j nfdd|j D|_ dS) a Change a key in this cycler to a new name. Modification is performed in-place. Does nothing if the old key is the same as the new key. Raises a ValueError if the new key is already a key. Raises a KeyError if the old key isn't a key. NzCan't replace z with , z is already a keyz is not a keycsg|]}|iqSr#r#)r+entryrErDr#r$r;sz%Cycler.change_key..) r@r"KeyErrorremover r>r! change_keyr<r=r3)r5rDrEr#rHr$rKs"      zCycler.change_key Iterable[V]r&labelitrrcs,|d}tfdd|D|_h|_|S)a Class method to create 'base' Cycler objects that do not have a 'right' or 'op' and for which the 'left' object is not another Cycler. Parameters ---------- label : hashable The property key. itr : iterable Finite length iterable of the property values. Returns ------- `Cycler` New 'base' cycler. Nc3s|]}|iVqdSr'r#r9rNr#r$r/sz$Cycler._from_iter..)listr=r@)clsrNrOretr#rPr$ _from_iterszCycler._from_iterslice)keyrcs:ttr.|}ttfdd|DStddS)Nc3s |]\}}t||VqdSr'r(r+r,r:rVr#r$r/sz%Cycler.__getitem__..z+Can only use slices with Cycler.__getitem__)r<rUr1rr itemsr")r5rVtransr#rXr$ __getitem__s zCycler.__getitem__z!Generator[dict[K, V], None, None]ccsp|jdkr"|jD]}t|VqnJ|jdkr4td||j|jD]&\}}i}|||||VqDdS)Nz=Operation cannot be None when both left and right are defined)r>r=dictr? TypeErrorupdate)r5raboutr#r#r$__iter__s     zCycler.__iter__z Cycler[L, U]zCycler[K | L, V | U])otherrcCstt|t|kr,tdt|dt|ttttttftttff|tttttftttff|t S)z Pair-wise combine two equal length cyclers (zip). Parameters ---------- other : Cycler z&Can only add equal length cycles, not z and ) lenr"r3rrrrrrzipr5rcr#r#r$__add__s  zCycler.__add__cCsdSr'r#rfr#r#r$__mul__$szCycler.__mul__intcCsdSr'r#rfr#r#r$rh(scsttrRttttttftttff|tttttftttfftStt r| }t t fdd| DStSdS)z Outer product of two cyclers (`itertools.product`) or integer multiplication. Parameters ---------- other : Cycler or int c3s |]\}}t||VqdSr'r(rWrcr#r$r/>sz!Cycler.__mul__..N)r<r3rrrrrrrrir1rr rYNotImplemented)r5rcrZr#rjr$rh,s    cCsdSr'r#rfr#r#r$__rmul__CszCycler.__rmul__cCsdSr'r#rfr#r#r$rlGscCs||Sr'r#rfr#r#r$rlKscCsDtttti}|jdkr t|jSt|j}t|j}||j||Sr')reminrr r>rdr=r?)r5Zop_dictZl_lenZr_lenr#r#r$__len__Ns      zCycler.__len__cCsLt|tstdt|}t|||_||_t|_t|j|j |j|_ |S)z In-place pair-wise combine two equal length cyclers (zip). Parameters ---------- other : Cycler z"Cannot += with a non-Cycler object) r<r3r]r8r%r@r=rer?r>r5rcZold_selfr#r#r$__iadd__Xs   zCycler.__iadd__zCycler[K, V] | intcCsLt|tstdt|}t|||_||_t|_t|j|j |j|_ |S)z In-place outer product of two cyclers (`itertools.product`). Parameters ---------- other : Cycler z"Cannot *= with a non-Cycler object) r<r3r]r8r%r@r=rr?r>ror#r#r$__imul__js   zCycler.__imul__objectboolcCsJt|tsdSt|t|kr"dS|j|jAr2dStddt||DS)NFcss|]\}}||kVqdSr'r#)r+r_r`r#r#r$r/sz Cycler.__eq__..)r<r3rdr!allrerfr#r#r$__eq__|s  z Cycler.__eq__strcsrtdtdi}|jdkrH|jtfdd|D}dd|dS||jd}d }|j|j ||jd SdS) N+*c3s|]}|VqdSr'r#r9Zlabr#r$r/sz"Cycler.__repr__..zcycler(rF)?z({left!r} {op} {right!r}))rr7r) rerr>r!poprQgetr?r0r=)r5Zop_maprOr7msgr#ryr$__repr__s   zCycler.__repr__cCstd}t|jtd}|D]}|d|d7}qt|D]2}|d7}|D]}|d||d7}qD|d7}q4|d 7}|S) NzrXzzzzz
z
z
)sortedr!reprr)r5outputZ sorted_keysrVdr,r#r#r$ _repr_html_s  zCycler._repr_html_zdict[K, list[V]]cCs>|j}dd|D}|D] }|D]}||||q q|S)a Values by key. This returns the transposed values of the cycler. Iterating over a `Cycler` yields dicts with a single value for each key, this method returns a `dict` of `list` which are the values for the given key. The returned value can be used to create an equivalent `Cycler` using only `+`. Returns ------- transpose : dict dict of lists of the values for each key. cSsi|] }|tqSr#)rQr*r#r#r$ sz!Cycler.by_key..)r!append)r5r!rarr,r#r#r$r1s z Cycler.by_keycCs |}ttdd|DS)z Simplify the cycler into a sum (but no products) of cyclers. Returns ------- simple : Cycler css|]\}}t||VqdSr'r(rWr#r#r$r/sz"Cycler.simplify..)r1rr rY)r5rZr#r#r$simplifys zCycler.simplify)NN)__name__ __module__ __qualname____doc__r6rArBpropertyr!rK classmethodrTr[rbrgrrhrlrnrprqru__hash__rrr1Z _transposerr2r#r#r#r$r3wsF $   r3)argrcCsdSr'r#)rr#r#r$cyclersrrLzCycler[str, V])kwargsrcKsdSr'r#)rr#r#r$rsrMcCsdSr'r#)rNrOr#r#r$rscOs|r|rtdt|dkr>t|dts2tdt|dSt|dkrRt|St|dkrftd|rttdd|DStd d S) a Create a new `Cycler` object from a single positional argument, a pair of positional arguments, or the combination of keyword arguments. cycler(arg) cycler(label1=itr1[, label2=iter2[, ...]]) cycler(label, itr) Form 1 simply copies a given `Cycler` object. Form 2 composes a `Cycler` as an inner product of the pairs of keyword arguments. In other words, all of the iterables are cycled simultaneously, as if through zip(). Form 3 creates a `Cycler` from a label and an iterable. This is useful for when the label cannot be a keyword argument (e.g., an integer or a name that has a space in it). Parameters ---------- arg : Cycler Copy constructor for Cycler (does a shallow copy of iterables). label : name The property key. In the 2-arg form of the function, the label can be any hashable object. In the keyword argument form of the function, it must be a valid python identifier. itr : iterable Finite length iterable of the property values. Can be a single-property `Cycler` that would be like a key change, but as a shallow copy. Returns ------- cycler : Cycler New `Cycler` for the given property zEcycler() can only accept positional OR keyword arguments -- not both.rzDIf only one positional argument given, it must be a Cycler instance.zdOnly a single Cycler can be accepted as the lone positional argument. Use keyword arguments instead.css|]\}}t||VqdSr'r(rWr#r#r$r/szcycler..z4Must have at least a positional OR keyword argumentsN)r]rdr<r3r)rr rY)argsrr#r#r$rs&&    csNt|trB|j}t|dkr(d}t||fdd|D}t||S)aD Create a new `Cycler` object from a property name and iterable of values. Parameters ---------- label : hashable The property key. itr : iterable Finite length iterable of the property values. Returns ------- cycler : Cycler New `Cycler` for the given property rz2Can not create Cycler from a multi-property Cyclerc3s|]}|VqdSr'r#r9ryr#r$r/;sz_cycler..)r<r3r!rdr"r|rT)rNrOr!r~r#ryr$r)"s  r))$r __future__rcollections.abcrrrr8 functoolsr itertoolsrroperatorr r typingr r r rrrrrr __version__rrrrr%r2r3rr)r#r#r#r$s2+  ,  ^@