o bi, @sUddlZddlZddlmZddlmZddlmZmZm Z m Z m Z m Z m Z mZmZmZmZmZmZddlZddlZddlZedZejed<eeeejeZ e dZ!dFded e ed e ed efd d Z"dedee#efded efddZ$e dddZ%GdddZ&Gddde&Z'zddl(Z(dZ)Wn e*ydZ)Ynwej+dkrddl,m-Z.ddl/m0Z1nddl.Z.ddl1Z1e2dZ3de#d ee e4e4fe e4ffddZ5d Z6e6d!Z7d"e#d#ee#d e8fd$d%Z9d"e#d e8fd&d'Z:d"e#d e8fd(d)Z;d*ee!d e e!fd+d,Zzddl?Z?dZ@Wn e*y-dZ@YnwGd1d2d2ZAGd3d4d4eBZCded5ed efd6d7ZDd8ed9ed efd:d;ZEdd?ZGd@e4dAe4d e e e4e4ffdBdCZHGdDdEdEee!ZIdS)GN)product)deque) CallableIteratorListOptionalTupleTypeTypeVarUnionDictAnySequenceIterable AbstractSetlarkloggerTseqkeyvaluereturnc Cshi}|D]-}|dur||n|}|dur||n|}z |||Wqty1|g||<Yqw|SN)appendKeyError)rrrditemkvr>/home/ubuntu/.local/lib/python3.10/site-packages/lark/utils.pyclassifys r!data namespacememocsxt|tr+d|vr|d}||Sd|vr|dSfdd|DSt|tr:fdd|DS|S)N__type__@csi|] \}}|t|qSr _deserialize).0rrr$r#rr *z _deserialize..csg|]}t|qSrr')r)rr*rr ,sz _deserialize..) isinstancedict deserializeitemslist)r"r#r$class_rr*r r(#s     r(_T Serialize)boundc @sleZdZdZdedefddZddeeeffddZ e d e e d eeefd ee efde fd d ZdS)r5alSafe-ish serialization interface that doesn't rely on Pickle Attributes: __serialize_fields__ (List[str]): Fields (aka attributes) to serialize. __serialize_namespace__ (list): List of classes that deserialization is allowed to instantiate. Should include all field types that aren't builtin types. types_to_memoizercCst|}|||fSr)SerializeMemoizer serialize)selfr7r$rrr memo_serialize;szSerialize.memo_serializeNcsdrrdjiStd}fdd|D}tj|d<tdr0||S)Nr&__serialize_fields__csi|] }|tt|qSr) _serializegetattr)r)fr$r:rr r+Dr,z'Serialize.serialize..r%r=)in_typesmemoizedgetr>type__name__hasattrr=)r:r$fieldsresrr@r r9?s   zSerialize.serializeclsr"r$c Cst|dg}dd|D}t|d}d|vr||dS||}|D]"}zt||t||||Wq#tyE}ztd||d}~wwt|drO||S)N__serialize_namespace__cSsi|]}|j|qSr)rE)r)crrr r+Mz)Serialize.deserialize..r<r&zCannot find key for classr()r>__new__setattrr(rrF)rIr"r$r#rGinstr?errr r0Js      zSerialize.deserializer)rE __module__ __qualname____doc__rr r;r strr9 classmethodr r4intr0rrrr r52s  4c @seZdZdZdZdeddfddZdedefd d Z de e e ffd d Z ed e e e fde ee fde e e fde e e ffddZdS)r8z.MAXWIDTHr) _has_regexresub categ_patternsearch ImportError sre_parseparsegetwidth sre_constantserror ValueErrorregexcompiler> MAXREPEATmatchrV)ra regexp_finalrKrdrrr get_regexp_widths    rx)LuLlLtLmLoMnMcPc)NdNls categoriescs8t|dkrtfdd|DS|dkpt|vS)Nrfc3s|]}t|VqdSr)_test_unicode_category)r)charrrr sz)_test_unicode_category.._)lenall unicodedatacategory)rrrrr rs rcC t|tS)z Checks if all characters in `s` are alphanumeric characters (Unicode standard, so diacritics, indian vowels, non-latin numbers, etc. all pass). Synonymous with a Python `ID_CONTINUE` identifier. See PEP 3131 for details. )r _ID_CONTINUErrrr is_id_continue rcCr)z Checks if all characters in `s` are alphabetic characters (Unicode standard, so diacritics, indian vowels, non-latin numbers, etc. all pass). Synonymous with a Python `ID_START` identifier. See PEP 3131 for details. )r _ID_STARTrrrr is_id_startrrlcCstt|S)zGiven a list (l) will removing duplicates from the list, preserving the original order of the list. Assumes that the list entries are hashable.)r2r/fromkeys)rrrr dedup_listsrc@sBeZdZd ddZdefddZddZdeeeffd d Z dS) rXrNcCs i|_dSr)enumsr\rrr rY zEnumerator.__init__cCs$||jvr t|j|j|<|j|Sr)rrr:rrrr rCs  zEnumerator.getcC t|jSr)rrr\rrr __len__rzEnumerator.__len__cCs.dd|jD}t|t|jksJ|S)NcSsi|]\}}||qSrr)r)rrrrr r+z'Enumerator.reversed..)rr1r)r:rrrr r[szEnumerator.reversed)rN) rErQrRrYrVrCrr r r[rrrr rXs  rXcCs0|sggStdd|DsJ|tt|S)a Accepts a list of alternatives, and enumerates all their possible concatenations. Examples: >>> combine_alternatives([range(2), [4,5]]) [[0, 4], [0, 5], [1, 4], [1, 5]] >>> combine_alternatives(["abc", "xy", '$']) [['a', 'x', '$'], ['a', 'y', '$'], ['b', 'x', '$'], ['b', 'y', '$'], ['c', 'x', '$'], ['c', 'y', '$']] >>> combine_alternatives([]) [[]] css|]}|VqdSrr)r)rrrr rsz'combine_alternatives..)rr2r)listsrrr combine_alternativess rc@s&eZdZeejjZedddZdS)FSrcKs6trd|vrtj|f|dd|St||fi|S)NwT)mode overwrite)_has_atomicwrites atomicwrites atomic_writeopen)namerkwargsrrr rs zFS.openN)r)rErQrR staticmethodospathexistsrrrrr rs rc@seZdZddZdS)fzsetcCsddtt|S)Nz{%s}, )joinmapreprr\rrr __repr__szfzset.__repr__N)rErQrRrrrrr rs rpredcs gfdd|D}|fS)Ncs"g|] }|s |r|qSr)rr)elem false_elemsrrr r-s"z!classify_bool..r)rr true_elemsrrr classify_boolsrinitialexpandccs^tt|}t|}|r-|}|V||D]}||vr(||||q|s dSdSr)rr2setpopleftaddr)rropen_qvisitednode next_noderrr bfss     rccs8tt|}|r|}|V|||7}|s dSdS)zVbfs, but doesn't keep track of visited (aka seen), because there can be no repetitionsN)rr2r)rrrrrrr bfs_all_uniques   rcsft|tr |St|trfdd|DSt|tr!t|St|tr1fdd|DS|S)Ncsg|]}t|qSrr=rr$rr r-rz_serialize..csi|] \}}|t|qSrr)r)rrrrr r+ sz_serialize..)r.r5r9r2 frozensetr/r1)rr$rrr r=s     r=n max_factorcCsz|dksJ|dks J||kr|dfgSt|ddD]}t||\}}|||kr6t||||fgSqJd|)a Splits n up into smaller factors and summands <= max_factor. Returns a list of [(a, b), ...] so that the following code returns n: n = 1 for a, b in values: n = n * a + b Currently, we also keep a + b <= max_factor, but that might change rrfFzFailed to factorize %s)rangedivmod small_factors)rrarbrrr r's    rc@seZdZdZddeefddZdedefdd Z defd d Z de efd d Z defddZ ddZdefddZddZdS) OrderedSetzkA minimal OrderedSet implementation, using a dictionary. (relies on the dictionary being ordered) rr1cCst||_dSr)r/rr)r:r1rrr rYDr]zOrderedSet.__init__rrcCs ||jvSrrrrrr __contains__GrzOrderedSet.__contains__cCsd|j|<dSrrrrrr rJszOrderedSet.addcCrr)iterrr\rrr __iter__MrzOrderedSet.__iter__cCs |j|=dSrrrrrr removePrZzOrderedSet.removecCrr)r^rr\rrr __bool__SrzOrderedSet.__bool__cCrr)rrr\rrr rVrzOrderedSet.__len__cCs"t|jddtt|dS)N(r))rDrErrrr\rrr rYs"zOrderedSet.__repr__N)r)rErQrRrSrrrYr r^rrrrrrrVrrrrrr r?s r)NN)Jrr itertoolsr collectionsrtypingrrrrrr r r r r rrrsysrhlogging getLoggerrLogger__annotations__ addHandler StreamHandlersetLevelCRITICALobjectNO_VALUErr!rTr(r4r5r8rsrgrl version_info re._parser_parserrm re._constants _constantsrprtrjrVrxrrr^rrrrrXrrrrrrrrrr=rrrrrr sh   < $" /    &    "