o 0 i, @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 AbstractSetZlarkloggerTseqkeyvaluereturnc Cshi}|D]-}|dur||n|}|dur||n|}z |||Wqty1|g||<Yqw|SN)appendKeyError)rrrditemkvrV/home/app/PaddleOCR-VL-test/.venv_paddleocr/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)rr'#s     r'_T Serialize)boundc @sleZdZdZdedefddZddeeeffddZ e d e e d eeefd ee efde fd d ZdS)r4alSafe-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)selfr6r#rrrmemo_serialize;szSerialize.memo_serializeNcsdrrdjiStd}fdd|D}tj|d<tdr0||S)Nr%__serialize_fields__csi|] }|tt|qSr) _serializegetattr)r(fr#r9rrr*Dr+z'Serialize.serialize..r$r<)in_typesmemoizedgetr=type__name__hasattrr<)r9r#fieldsresrr?rr8?s   zSerialize.serializeclsr!r#c Cst|dg}dd|D}t|d}d|vr||dS||}|D]"}zt||t||||Wq#tyE}ztd||d}~wwt|drO||S)NZ__serialize_namespace__cSsi|]}|j|qSr)rD)r(crrrr*Mz)Serialize.deserialize..r;r%zCannot find key for classr')r=__new__setattrr'rrE)rHr!r#r"rFinstr>errrr/Js      zSerialize.deserializer)rD __module__ __qualname____doc__rr r:r strr8 classmethodr r3intr/rrrrr42s  4c @seZdZdZdZdeddfddZdedefd d Z de e e ffd d Z ed e e e fde ee fde e e fde e e ffddZdS)r7z.MAXWIDTHr) _has_regexresub categ_patternsearch ImportError sre_parseparsegetwidth sre_constantserror ValueErrorregexcompiler= MAXREPEATmatchrT)r_Z regexp_finalrIrbrrrget_regexp_widths    ru)ZLuZLlLtZLmZLoZMnZMcZPc)ZNdZNls categoriescs8t|dkrtfdd|DS|dkpt|vS)Nrdc3s|]}t|VqdSr)_test_unicode_category)r(charrxrr sz)_test_unicode_category.._)lenall unicodedatacategory)rwrxrr{rrys rycC 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. )ry _ID_CONTINUErwrrris_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. )ry _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.)r1r.fromkeys)rrrr dedup_listsrc@sBeZdZd ddZdefddZddZdeeeffd d Z dS) rVrNcCs i|_dSr)enumsrZrrrrW zEnumerator.__init__cCs$||jvr t|j|j|<|j|Sr)rr~r9rrrrrBs  zEnumerator.getcC t|jSr)r~rrZrrr__len__rzEnumerator.__len__cCs.dd|jD}t|t|jksJ|S)NcSsi|]\}}||qSrr)r(rrrrrr*z'Enumerator.reversed..)rr0r~)r9rrrrrYszEnumerator.reversed)rN) rDrOrPrWrTrBrr r rYrrrrrVs  rVcCs0|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(rrrrr|sz'combine_alternatives..)rr1r)listsrrrcombine_alternativess rc@s&eZdZeejjZedddZdS)FSrcKs6trd|vrtj|f|dd|St||fi|S)NwT)mode overwrite)_has_atomicwrites atomicwritesZ atomic_writeopen)namerkwargsrrrrs zFS.openN)r)rDrOrP staticmethodospathexistsrrrrrrs rc@seZdZddZdS)fzsetcCsddtt|S)Nz{%s}, )joinmapreprrZrrr__repr__szfzset.__repr__N)rDrOrPrrrrrrs rpredcs gfdd|D}|fS)Ncs"g|] }|s |r|qSr)rr(elemZ false_elemsrrrr,s"z!classify_bool..r)rrZ true_elemsrrr classify_boolsrinitialexpandccs^tt|}t|}|r-|}|V||D]}||vr(||||q|s dSdSr)rr1setpopleftaddr)rropen_qvisitednodeZ next_noderrrbfss     rccs8tt|}|r|}|V|||7}|s dSdS)zVbfs, but doesn't keep track of visited (aka seen), because there can be no repetitionsN)rr1r)rrrrrrrbfs_all_uniques   rcsft|tr |St|trfdd|DSt|tr!t|St|tr1fdd|DS|S)Ncsg|]}t|qSrr<rr#rrr,rz_serialize..csi|] \}}|t|qSrr)r(rrrrrr* sz_serialize..)r-r4r8r1 frozensetr.r0)rr#rrrr<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 rrdFzFailed to factorize %s)rangedivmod small_factors)rrarbrrrr'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) rr0cCst||_dSr)r.rr)r9r0rrrrWDr[zOrderedSet.__init__rrcCs ||jvSrrrrrr __contains__GrzOrderedSet.__contains__cCsd|j|<dSrrrrrrrJszOrderedSet.addcCrr)iterrrZrrr__iter__MrzOrderedSet.__iter__cCs |j|=dSrrrrrrremovePrXzOrderedSet.removecCrr)r\rrZrrr__bool__SrzOrderedSet.__bool__cCrr)r~rrZrrrrVrzOrderedSet.__len__cCs"t|jddtt|dS)N(r))rCrDrrrrZrrrrYs"zOrderedSet.__repr__N)r)rDrOrPrQrrrWr r\rrrrrrrTrrrrrrr?s r)NN)Jrr itertoolsr collectionsrtypingrrrrrr r r r r rrrsysrflogging getLoggerrLogger__annotations__ addHandler StreamHandlersetLevelCRITICALobjectZNO_VALUErr rRr'r3r4r7rqrerj version_infoZ re._parser_parserrkZ re._constants _constantsrnrrrhrTrurrr\ryrrrrVrrrrrrrrrr<rrrrrrsh   < $" /    &    "