Pj1ddlmZddlZddlZddlmZddlmZddlm Z m Z e rddlm Z m Z e dZ e dZe d Ze d Ze d Zgd ZdCdZdDdZdEdZefdFdZefdGd"ZefdHd%ZefdId)ZefdJd+ZefdKd-ZefdLd0ZdMd2ZefdNd4ZdefdOd6Z dPdQd;Z!dRd=Z"dSd@Z#dTdBZ$dS)U) annotationsN)Mapping)reduce) TYPE_CHECKINGTypeVar)CallableIterable_K_V_K2_V2_T) merge merge_withvalmapkeymapitemmap valfilter keyfilter itemfilterassocdissocassoc_in update_inget_infCallable[..., object]kwargsdict[str, object]returntypec|dt}|r2t|jd|dd|S)Nfactoryz'() got an unexpected keyword argument 'r')popdict TypeError__name__popitem)rrr#s aC:\Projects\DSCons\.venv\Lib\site-packages\torch\fx\experimental\unification\unification_tools.py _get_factoryr+%s\JJy$//G  z X X&..BRBRSTBU X X X    NdictsMapping[object, object]objectct|dkr#t|dts|d}tt|}|}|D]}|||S)zMerge a collection of dictionaries >>> merge({1: "one"}, {2: "two"}) {1: 'one', 2: 'two'} Later dictionaries have precedence >>> merge({1: 2, 3: 4}, {3: 3, 4: 4}) {1: 2, 3: 3, 4: 4} See Also: merge_with r)len isinstancerr+rupdate)r-rr#rvds r*rr.sm 5zzQz%(G<<a5&))G B  ! Ir,funccXt|dkr#t|dts|d}tt|}|}|D]B}|D]+\}}||vr|g||<|||,Ct|||S)aMerge dictionaries and apply function to combined values A key may occur in more than one dict, and all values mapped from the key will be passed to the function as a list, such as func([val1, val2, ...]). >>> merge_with(sum, {1: 1, 2: 2}, {1: 10, 2: 20}) {1: 11, 2: 22} >>> merge_with(first, {1: 1, 2: 2}, {2: 20, 3: 30}) # doctest: +SKIP {1: 1, 2: 2, 3: 30} See Also: merge r1r)r2r3rr+ritemsappendr)r7r-rr#resultr6kvs r*rrFs" 5zzQz%(G<<a:v..G WYYF $$GGII $ $DAqCq q   ####  $ $ ( ((r,Callable[[_V], _V2]r6Mapping[_K, _V]r# dict[_K, _V2]c |}|t|t|||S)zApply function to values of dictionary >>> bills = {"Alice": [20, 15, 30], "Bob": [10, 35]} >>> valmap(sum, bills) # doctest: +SKIP {'Alice': 65, 'Bob': 45} See Also: keymap itemmap )r4zipkeysmapvaluesr7r6r#r5s r*rresJ BIIc!&&((Cahhjj1122333 Ir,Callable[[_K], _K2] dict[_K2, _V]c |}|tt||||S)zApply function to keys of dictionary >>> bills = {"Alice": [20, 15, 30], "Bob": [10, 35]} >>> keymap(str.lower, bills) # doctest: +SKIP {'alice': [20, 15, 30], 'bob': [10, 35]} See Also: valmap itemmap )r4rBrDrCrErFs r*rrwsJ BIIc#dAFFHH%%qxxzz22333 Ir,!Callable[[tuple[_K, _V]], object]dict[object, object]c|}|t|||S)zApply function to items of dictionary >>> accountids = {"Alice": 10, "Bob": 20} >>> itemmap(reversed, accountids) # doctest: +SKIP {10: "Alice", 20: "Bob"} See Also: keymap valmap )r4rDr9rFs r*rrs8 BIIc$ ""### Ir, predicateCallable[[_V], bool] dict[_K, _V]cn|}|D]\}}||r|||<|S)zFilter items in dictionary by value >>> iseven = lambda x: x % 2 == 0 >>> d = {1: 2, 2: 3, 3: 4, 4: 5} >>> valfilter(iseven, d) {1: 2, 3: 4} See Also: keyfilter itemfilter valmap r9rMr6r#r5r<r=s r*rrI B 1 9Q<< BqE Ir,Callable[[_K], bool]cn|}|D]\}}||r|||<|S)zFilter items in dictionary by key >>> iseven = lambda x: x % 2 == 0 >>> d = {1: 2, 2: 3, 3: 4, 4: 5} >>> keyfilter(iseven, d) {2: 3, 4: 5} See Also: valfilter itemfilter keymap rQrRs r*rrrSr,Callable[[tuple[_K, _V]], bool]cr|}|D]}||r |\}}|||<|S)aFilter items in dictionary by item >>> def isvalid(item): ... k, v = item ... return k % 2 == 0 and v < 4 >>> d = {1: 2, 2: 3, 3: 4, 4: 5} >>> itemfilter(isvalid, d) {2: 3} See Also: keyfilter valfilter itemmap rQ)rMr6r#r5itemr<r=s r*rrsN$ B  9T?? DAqBqE Ir,keyvaluecN|}|||||<|S)zReturn a new dict with new key value pair New dict has d[key] set to value. Does not modify the initial dictionary. >>> assoc({"x": 1}, "x", 2) {'x': 2} >>> assoc({"x": 1}, "y", 3) # doctest: +SKIP {'x': 1, 'y': 3} )r4)r6rYrZr#d2s r*rrs, BIIaLLLBsG Ir,rCc6tt|}|}t|t|dzkr"|||D] }||vr||= n4t |}|||D] }||||<|S)aBReturn a new dict with the given key(s) removed. New dict has d[key] deleted for each supplied key. Does not modify the initial dictionary. >>> dissoc({"x": 1, "y": 2}, "y") {'x': 1} >>> dissoc({"x": 1, "y": 2}, "y", "x") {} >>> dissoc({"x": 1}, "y") # Ignores missing keys {'x': 1} g333333?)r+rr2r4setdifference_update)r6rCrr#r\rY remainingr<s r*rrs66**G B 4yy3q66C< !   CbyysG FF ##D)))  AaDBqEE Ir,Iterable[object]c0t||fd|S)aReturn a new dict with new, potentially nested, key value pair >>> purchase = { ... "name": "Alice", ... "order": {"items": ["Apple", "Orange"], "costs": [0.50, 1.25]}, ... "credit card": "5555-1234-1234-1234", ... } >>> assoc_in(purchase, ["order", "costs"], [0.25, 1.00]) # doctest: +SKIP {'credit card': '5555-1234-1234-1234', 'name': 'Alice', 'order': {'costs': [0.25, 1.00], 'items': ['Apple', 'Orange']}} cSN)xrZs r*zassoc_in.."sr,)r)r6rCrZr#s ` r*rrs!$ Qooooug > >>r,defaultc^t|}t|}|x}}|||D]C} ||vr(||}|} | |n |x}} | x||<}| }D||vr|||||<n||||<|S)aUpdate value in a (potentially) nested dictionary inputs: d - dictionary on which to operate keys - list or tuple giving the location of the value to be changed in d func - function to operate on that value If keys == [k0,..,kX] and d[k0]..[kX] == v, update_in returns a copy of the original dictionary with v replaced by func(v), but does not mutate the original dictionary. If k0 is not a key in d, update_in creates nested dictionaries to the depth specified by the keys, with the innermost value set to func(default). >>> inc = lambda x: x + 1 >>> update_in({"a": 0}, ["a"], inc) {'a': 1} >>> transaction = { ... "name": "Alice", ... "purchase": {"items": ["Apple", "Orange"], "costs": [0.50, 1.25]}, ... "credit card": "5555-1234-1234-1234", ... } >>> update_in(transaction, ["purchase", "costs"], sum) # doctest: +SKIP {'credit card': '5555-1234-1234-1234', 'name': 'Alice', 'purchase': {'costs': 1.75, 'items': ['Apple', 'Orange']}} >>> # updating a value when k0 is not in d >>> update_in({}, [1, 2, 3], str, default="bar") {1: {2: {3: 'bar'}}} >>> update_in({1: "foo"}, [2, 3, 4], inc, 0) {1: 'foo', 2: {3: {4: 1}}} )iternextr4) r6rCr7rhr#ksr<r5innerrYdtemps r*rr%sR dB RABIIaLLL   66!AGIIE LLOOOO !A  a5 Avv4!::a4==a Ir,Fcoll no_defaultboolc~ ttj||S#ttt f$r|r|cYSwxYw)aReturns coll[i0][i1]...[iX] where [i0, i1, ..., iX]==keys. If coll[i0][i1]...[iX] cannot be found, returns ``default``, unless ``no_default`` is specified, then it raises KeyError or IndexError. ``get_in`` is a generalization of ``operator.getitem`` for nested data structures such as dictionaries and lists. >>> transaction = { ... "name": "Alice", ... "purchase": {"items": ["Apple", "Orange"], "costs": [0.50, 1.25]}, ... "credit card": "5555-1234-1234-1234", ... } >>> get_in(["purchase", "items", 0], transaction) 'Apple' >>> get_in(["name"], transaction) 'Alice' >>> get_in(["purchase", "total"], transaction) >>> get_in(["purchase", "items", "apple"], transaction) >>> get_in(["purchase", "items", 10], transaction) >>> get_in(["purchase", "total"], transaction, 0) 0 >>> get_in(["y"], {}, no_default=True) Traceback (most recent call last): ... KeyError: 'y' See Also: itertoolz.get operator.getitem )roperatorgetitemKeyError IndexErrorr')rCrorhrps r*rrfs^J        j) ,   s <<indexcttr3tdkr dfdSrtjSdStjS)Nr1rc|fSrdre)rfrws r*rgzgetter..s ah[r,cdS)Nrere)rfs r*rgzgetter..sRr,)r3listr2rs itemgetter)rws`r*getterr}sk% * u::??!HE(((( (  &. .< "5)))r,seqdict[object, list[object]]ct|st|}tjd}|D]}||||i}|D]\}}|j||<|S)aGroup a collection by a key function >>> names = ["Alice", "Bob", "Charlie", "Dan", "Edith", "Frank"] >>> groupby(len, names) # doctest: +SKIP {3: ['Bob', 'Dan'], 5: ['Alice', 'Edith', 'Frank'], 7: ['Charlie']} >>> iseven = lambda x: x % 2 == 0 >>> groupby(iseven, [1, 2, 3, 4, 5, 6, 7, 8]) # doctest: +SKIP {False: [1, 3, 5, 7], True: [2, 4, 6, 8]} Non-callable keys imply grouping on a member. >>> groupby( ... "gender", ... [ ... {"name": "Alice", "gender": "F"}, ... {"name": "Bob", "gender": "M"}, ... {"name": "Charlie", "gender": "M"}, ... ], ... ) # doctest:+SKIP {'F': [{'gender': 'F', 'name': 'Alice'}], 'M': [{'gender': 'M', 'name': 'Bob'}, {'gender': 'M', 'name': 'Charlie'}]} Not to be confused with ``itertools.groupby`` See Also: countby cgjSrd)r:rer,r*rgzgroupby..s r,)callabler} collections defaultdictr9__self__)rYr~r6rXr5r<r=s r*groupbyrs< C==Skk 1 122A##d)) T%'B 1 1 Ir, Iterable[_T]c:tt|S)zBThe first element in a sequence >>> first("ABC") 'A' )rkrj)r~s r*firstrs S ??r,)rrrrr r!)r-r.rr/r r/)r7rr-r.rr/r r/)r7r>r6r?r#r!r r@)r7rGr6r?r#r!r rH)r7rJr6r?r#r!r rK)rMrNr6r?r#r!r rO)rMrTr6r?r#r!r rO)rMrVr6r?r#r!r rO) r6r?rYr/rZr/r#r!r rO)r6r.rCr/rr/r r/) r6r.rCrarZr/r#r!r r/) r6r.rCrar7rrhr/r#r!r r/)NF) rCraror/rhr/rprqr r/)rwr/r r)rYr/r~rar r)r~rr r)% __future__rrrscollections.abcr functoolsrtypingrrrr r r r r r__all__r+rrr&rrrrrrrrrrrr}rrrer,r*rs""""""######))))))))322222222 WT]] WT]] genn genn WT]]   "0))))@DH&DH&RV&JN.JN.UY6EI$B ?????2 >>>>>H .....b * * * *&&&&Rr,