@gNUdZddlmZddlmZddlZddlZddlZddl Z ddl m Z ddl m Z ddl m Z ddl m Z ddl mZdd l mZdd l mZdd l mZdd l mZdd l mZddl mZddl mZddl mZddl mZddl mZddl mZddl mZddl mZddl mZddlZddlmZddl m Z ddl m!Z!e j"ses%ddl#m$Z$ddl#m%Z%ddl#m&Z&ddl#m'Z'ddl#m(Z(dd l#m)Z)n$ddl*m&Z&ddl*m'Z'ddl*m$Z$ddl+m%Z%ddl+m(Z(dd l+m)Z)ed!e "Z,ed#e "Z-ed$e "Z.ed%d&'Z/e0Z1d(e2d)<e0dgZ3d(e2d*<ded/Z4dfd3Z5e$Z6d4e2d5<Gd6d7e'e-e.fZ7ed8e "Z8ed9e "Z9Gd:d;ee,Z:Gd<d=e:e,Z;Gd>d?e&e:e,ZZ?e=Z@GdAdBee,ZAGdCdDe%ZBGdEdFe e-e.fZCGdGdHe e-e.fZDeEZFe>ZGe(ZHGdIdJee,ZIdhdMZJdgdidQZKdRZLdSZMdjdUZNdgdVZOdkdYZPGdZd[e jQe-e.fZRGd\d]e!e/ZSGd^d_e!ZTGd`daee,ZUGdbdceUe,ZVddZWdS)lzCollection classes and helpers.) annotationsN)Any)Callable)cast)Dict) FrozenSet)Generic)Iterable)Iterator)List)Mapping)NoReturn)Optional)overload)Sequence)Set)Tuple)TypeVar)Union) ValuesView)HAS_CYEXTENSION)Literal)Protocol) immutabledict) IdentitySet)ReadOnlyContainer)ImmutableDictBase) OrderedSet) unique_list_T)bound_KT_VT_T_coT) covariantzFrozenSet[Any] EMPTY_SETNONE_SETa List[Any]breturnc,t||}g}t|t|}} |D]6}||vr||||}}n,||7||nP|S)afmerge two lists, maintaining ordering as much as possible. this is to reconcile vars(cls) with cls.__annotations__. Example:: >>> a = ['__tablename__', 'id', 'x', 'created_at'] >>> b = ['id', 'name', 'data', 'y', 'created_at'] >>> merge_lists_w_ordering(a, b) ['__tablename__', 'id', 'name', 'data', 'y', 'x', 'created_at'] This is not necessarily the ordering that things had on the class, in this case the class is:: class User(Base): __tablename__ = "users" id: Mapped[int] = mapped_column(primary_key=True) name: Mapped[str] data: Mapped[Optional[str]] x = Column(Integer) y: Mapped[int] created_at: Mapped[datetime.datetime] = mapped_column() But things are *mostly* ordered. The algorithm could also be done by creating a partial ordering for all items in both lists and then using topological_sort(), but that is too much overhead. Background on how I came up with this is at: https://gist.github.com/zzzeek/89de958cf0803d148e74861bd682ebae )set intersectioniterdiscardappendextend)r)r+overlapresultcurrentotherelements P/var/www/piapp/venv/lib/python3.11/site-packages/sqlalchemy/util/_collections.pymerge_lists_w_orderingr:KsF!ff!!!$$G F!WWd1ggUG   G'!!(((!(%w MM' " " " " MM%   MdMapping[_KT, _VT]immutabledict[_KT, _VT]c`|stSt|tr|St|SN) EMPTY_DICT isinstancer)r<s r9coerce_to_immutabledictrCs5   A} % % Qr;zimmutabledict[Any, Any]rAc:eZdZdZddZddZdd ZddZddZdS) FacadeDictz*A dictionary that is not publicly mutable.argsrr,FacadeDict[Any, Any]c.tj|}|Sr@)r__new__)clsrFnews r9rIzFacadeDict.__new__s',, r;rc td)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)NotImplementedErrorselfs r9copyzFacadeDict.copys! 0   r;c0tt|ffSr@)rEdictrNs r9 __reduce__zFacadeDict.__reduce__sDJJ=((r;keyr#valuer$Nonec>t|||dS)z,insert an item into the dictionary directly.N)rR __setitem__rOrTrUs r9 _insert_itemzFacadeDict._insert_items  sE*****r;strc<dt|zS)NzFacadeDict(%s))rR__repr__rNs r9r]zFacadeDict.__repr__s$--"5"555r;N)rFrr,rG)r,rr,rrTr#rUr$r,rV)r,r[) __name__ __module__ __qualname____doc__rIrPrSrZr]r;r9rErEs~44    ))))++++666666r;rE_DT_FceZdZUdZdZded<d6dZd7d Zd8d Zd9fd Z d:dZ d;dZ ddZd?dZdt|d|dSNrjobject __setattr__)rOrls r9__init__zProperties.__init__s 4$/////r;r,intc*t|jSr@lenrjrNs r9__len__zProperties.__len__4:r; Iterator[_T]chtt|jSr@)r0listrjvaluesrNs r9__iter__zProperties.__iter__s&D**,,--...r; List[str]cttd|jDzS)Nc,g|]}t|Srd)r[).0ks r9 z&Properties.__dir__..sAAA!s1vvAAAr;)dirsuperrjkeys)rO __class__s r9__dir__zProperties.__dir__s3577||AAtz/@/@AAAAAr;r7Properties[_F]List[Union[_T, _F]]c@t|t|zSr@)r{)rOr7s r9__add__zProperties.__add__sDzzDKK''r;rTr[objr!rVc||j|<dSr@rirOrTrs r9rXzProperties.__setitem__ 3r;c|j|Sr@rirOrTs r9 __getitem__zProperties.__getitem__sz#r;c|j|=dSr@rirs r9 __delitem__zProperties.__delitem__ JsOOOr;c||j|<dSr@rirs r9rqzProperties.__setattr__rr;Dict[str, Any]cd|jiSrnrirNs r9 __getstate__zProperties.__getstate__s$$r;statecJt|d|ddSrnro)rOrs r9 __setstate__zProperties.__setstate__s$4%.99999r;cX |j|S#t$rt|wxYwr@)rjKeyErrorAttributeErrorrs r9 __getattr__zProperties.__getattr__s< &:c? " & & & %% % &s )boolc||jvSr@rirs r9 __contains__zProperties.__contains__dj  r;ReadOnlyProperties[_T]c*t|jS)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrjrNs r9 as_readonlyzProperties.as_readonlys"$*---r;rUc:|j|dSr@)rjupdate)rOrUs r9rzProperties.updates %     r; Optional[_T]cdSr@rdrs r9getzProperties.get r;defaultUnion[_DT, _T]cdSr@rdrOrTrs r9rzProperties.getrr;NOptional[Union[_DT, _T]]Optional[Union[_T, _DT]]c||vr||S|Sr@rdrs r9rzProperties.gets $;;9 Nr;c*t|jSr@)r{rjrNs r9rzProperties.keysDJr;List[_T]cNt|jSr@)r{rjr|rNs r9r|zProperties.valuessDJ%%''(((r;List[Tuple[str, _T]]cNt|jSr@)r{rjitemsrNs r9rzProperties.itemssDJ$$&&'''r;c||jvSr@rirs r9has_keyzProperties.has_keyrr;c8|jdSr@)rjclearrNs r9rzProperties.clears r;)rlrkr,rsr,ry)r,r~)r7rr,r)rTr[rr!r,rV)rTr[r,r!)rTr[r,rV)r,r)rrr,rV)rTr[r,r)r,r)rUrkr,rV)rTr[r,r)rTr[rrr,rr@)rTr[rrr,r)r,r)r,rr,rV)r`rarbrc __slots____annotations__rrrwr}rrrXrrrqrrrrrrrrrr|rrr __classcell__)rs@r9rhrhs7BBI0000////BBBBBB((((%%%%::::&&&& !!!!.... !!!!   X    X =A    ))))((((!!!!r;rhceZdZdZdZdZdS)OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.rdcTt|tdSr@)rhrr OrderedDictrNs r9rrzOrderedProperties.__init__ s"D+--00000r;N)r`rarbrcrrrrdr;r9rrs4I11111r;rceZdZdZdZdS)rzDProvide immutable dict/object attribute to an underlying dictionary.rdN)r`rarbrcrrdr;r9rrsNNIIIr;rcfdt|D}|dS)zSort an OrderedDict in-place.c$g|] }||f Srdrd)rrr<s r9rz,_ordered_dictionary_sort..s! 3 3 31a1Y 3 3 3r;)rTN)sortedrr)r<rTrs` r9_ordered_dictionary_sortrsK 4 3 3 3qc 2 2 2 3 3 3EGGIIIHHUOOOOOr;c0eZdZd d dZdZdZdZdZd S) WeakSequencerd_WeakSequence__elements Sequence[_T]cjtj|fd|_fd|D|_dS)NcV|}||j|dSdSr@)_storageremove)itemselfrefrOs r9_removez&WeakSequence.__init__.._remove's7799D $$T***** r;c:g|]}tj|Srd)weakrefref)rr8rs r9rz)WeakSequence.__init__..-s2   .5GK ) )   r;)rrrr)rOrrs @r9rrzWeakSequence.__init__$s]#*+d"3"3 + + + +      9C    r;cj|jtj||jdSr@)rr2rrr)rOrs r9r2zWeakSequence.append1s, W[t|<<=====r;c*t|jSr@)rvrrNs r9rwzWeakSequence.__len__4s4=!!!r;c8dd|jDDS)Nc3K|]}||V dSr@rd)rrs r9 z(WeakSequence.__iter__..8s+  sC  r;c3*K|]}|VdSr@rd)rrs r9rz(WeakSequence.__iter__..9s(;;cCCEE;;;;;;r;)rrNs r9r}zWeakSequence.__iter__7s3  ;;T];;;    r;cr |j|}|S#t$rtd|zwxYw)NzIndex %s out of range)rr IndexError)rOindexrs r9rzWeakSequence.__getitem__<sQ -&C355L > > >4u<== = >s 6N)rd)rr)r`rarbrrr2rwr}rrdr;r9rr#si      >>>"""   r;rceZdZdddZdS)OrderedIdentitySetNiterableOptional[Iterable[Any]]ctj|t|_|r|D]}||dSdSr@)rrrr_membersadd)rOros r9rrzOrderedIdentitySet.__init__FsZT"""#          r;r@)rr)r`rarbrrrdr;r9rrEs-r;rc"eZdZdZd dZd dZd S) PopulateDictzA dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. creatorCallable[[_KT], _VT]c||_dSr@r)rOrs r9rrzPopulateDict.__init__Vs  r;rTrr,c:||x||<}|Sr@rrOrTvals r9 __missing__zPopulateDict.__missing__Ys!,,s+++S C r;N)rrrTrr,rr`rarbrcrrrrdr;r9rrNsFr;rc"eZdZdZd dZd dZd S) WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create a reference cycle. creator_methodtypes.MethodTypec^|j|_|j}tj||_dSr@)__func__r__self__rrweakself)rOrrs r9rrzWeakPopulateDict.__init__ds)%. !* H-- r;rTrr,c`|||x||<}|Sr@)rrrs r9rzWeakPopulateDict.__missing__is+,,t}}<<<S C r;N)rrrrrdr;r9rr^sF .... r;rcReZdZUdZdZded<ded<ded< ddd ZddZddZd S)UniqueAppenderzAppends items to a collection ensuring uniqueness. Additional appends() of the same object are ignored. Membership is determined by identity (``is a``) not equality (``==``). )rl_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rlzCallable[[_T], None]rzDict[int, Literal[True]]rNvia Optional[str]c||_i|_|rt|||_dSt |drt d|j|_dSt |drt d|j|_dSdS)Nr2rrzSet[_T])rlrgetattrrhasattrrr2r)rOrlr s r9rrzUniqueAppender.__init__s    <")$"4"4D    T8 $ $ <"&z4"8"8"?D    T5 ! ! <"&y$"7"7";D    < .s"E"E"E!*"E1"E"E"Er;)rr/)set_rs r9has_intersectionr#s/ !!"E"Eh"E"E"EFF G GGr;c|tSt|tstt|S|Sr@)r.rBrrs r9to_setr&s9yuu a  71::r;Set[Any]c|tSt|tstt|S|Sr@) column_setrBrr%s r9 to_column_setr*s<y|| a $ $'!**%%%r;c v|}|r|||jdi||S)z5Copy the given dict and update with the given values.rd)rPr)r<_newkws r9 update_copyr.s@ A   AHNNrNNN Hr; Iterable[_T]ryc#K|D]A}t|ts&t|drt|Ed{V=|VBdS)zGiven an iterator of which further sub-elements may also be iterators, flatten the sub-elements into a single iterator. r}N)rBr[rflatten_iterator)relems r9r1r1sr $$$ z)B)B '-- - - - - - - - -JJJJ r;ceZdZUdZdZded<ded<ded< d'd(d ZdZed)dZ ed*dZ d+d,dZ d-dZ d.dZ d/dZ d0dZ d1d"Zd2d$Zed3d%Zd4d&Zd S)5LRUCachezDictionary with 'squishy' removal of least recently used items. Note that either get() or [] should be used here, but generally its not safe to do an "in" check first as the dictionary can change subsequent to that call. )capacity threshold size_alertrj_counter_mutexrsr5floatr6z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r7d?NOptional[Callable[..., None]]c|||_||_||_d|_t j|_i|_dS)Nr)r5r6r7r8 threadingLockr9rj)rOr5r6r7s r9rrzLRUCache.__init__s: ! "$ n&& <> r;c0|xjdz c_|jS)Nr)r8rNs r9 _inc_counterzLRUCache._inc_counters  }r;rTr#r, Optional[_VT]cdSr@rdrs r9rz LRUCache.get rr;rUnion[_VT, _T]cdSr@rdrs r9rz LRUCache.getrr;Optional[Union[_VT, _T]]c|j|}|%||dd<|dS|SNrr)rjrrB)rOrTrrs r9rz LRUCache.getsDz~~c""  **,,DGAJ7NNr;r$cf|j|}||dd<|dSrI)rjrB)rOrTrs r9rzLRUCache.__getitem__s/z#&&((Q Awr; Iterator[_KT]c*t|jSr@)r0rjrNs r9r}zLRUCache.__iter__#rr;c*t|jSr@rurNs r9rwzLRUCache.__len__&rxr;ValuesView[_VT]cltjd|jDS)Nc&i|]\}}||dS)rrd)rrr!s r9 z#LRUCache.values..*s"!I!I!Ida!QqT!I!I!Ir;)typingrrjrrNs r9r|zLRUCache.values)s0 !I!Idj6F6F6H6H!I!I!IJJJr;rUrVcn|||gf|j|<|dSr@)rBrj _manage_sizerYs r9rXzLRUCache.__setitem__,s;(9(9(;(;'<= 3 r; _LRUCache__vc|j|=dSr@ri)rOrVs r9rzLRUCache.__delitem__0rr;c0|j|j|jzzSr@)r5r6rNs r9size_thresholdzLRUCache.size_threshold3s}t}t~===r;c|jdsdS t|j}t ||j|j|jzzkr|rd}||t|j tj dd}||jdD]!} |j|d=#t$rYwxYwt ||j|j|jzzk|j dS#|j wxYw)NFrJT)rTreverser)r9acquirerr7rvr5r6rrjr|operator itemgetterrrelease)rOr7 by_counterrs r9rUzLRUCache._manage_size7sT{""5))  F "do..Jd))dmdmdn.LLLL*!&JOOD)))#J%%'' +A..  't}7!!D! JtAw//#!!! !d))dmdmdn.LLLL K   ! ! ! ! !DK   ! ! ! !s0B!D"CD" CD"C+D""D=)r;r<N)r5rsr6r:r7r=)rTr#r,rC)rTr#rrEr,rEr@)rTr#rrGr,rG)rTr#r,r$)r,rLr)r,rOr_)rVr#r,rV)r,r:r)r`rarbrcrrrrrBrrrr}rwr|rXrpropertyrYrUrdr;r9r4r4sIMMM>>>>48 ? ? ? ? ?   X    X =A     KKKK>>>X>""""""r;r4ceZdZddZdS)_CreateFuncTyper,r%cdSr@rdrNs r9__call__z_CreateFuncType.__call__P r;N)r,r%r`rarbrerdr;r9rcrcO(      r;rcceZdZddZdS)_ScopeFuncTyper,rcdSr@rdrNs r9rez_ScopeFuncType.__call__Urfr;Nr^rgrdr;r9rjrjTrhr;rjc^eZdZUdZdZded<ded<ded<dd ZddZddZddZ ddZ dS)ScopedRegistryaA Registry that can store one or multiple instances of a single class on the basis of a "scope" function. The object implements ``__call__`` as the "getter", so by calling ``myregistry()`` the contained object is returned for the current scope. :param createfunc: a callable that returns a new object to be placed in the registry :param scopefunc: a callable that will return a key to store/retrieve an object.  createfunc scopefuncregistryz_CreateFuncType[_T]rorjrprrqCallable[[], _T]Callable[[], Any]c0||_||_i|_dS)aVConstruct a new :class:`.ScopedRegistry`. :param createfunc: A creation function that will generate a new value for the current scope, if none is present. :param scopefunc: A function that returns a hashable token representing the current scope (such as, current thread identifier). Nrn)rOrorps r9rrzScopedRegistry.__init__ns%" r;r,r!c|} |j|S#t$r0|j||cYSwxYwr@)rprqr setdefaultrors r9rezScopedRegistry.__call__sknn D=% % D D D=++C1B1BCC C C C Ds #7AArc8||jvS)z9Return True if an object is present in the current scope.)rprqrNs r9haszScopedRegistry.hass~~4=00r;rrVc>||j|<dS)z$Set the value for the current scope.N)rqrprOrs r9r.zScopedRegistry.sets +. dnn&&'''r;c^ |j|=dS#t$rYdSwxYw)z Clear the current scope, if any.N)rqrprrNs r9rzScopedRegistry.clearsC  dnn..///    DD s  ,,N)rorrrprsr,r!r,rrr!r,rVr) r`rarbrcrrrrrerxr.rrdr;r9rmrmYs  6I####MMM"DDDD1111 .... r;rmc:eZdZdZddZddZdd Zdd Zdd ZdS)ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. rorrcD||_tj|_dSr@)ror?localrq)rOros r9rrzThreadLocalRegistry.__init__s$!)) r;r,r!c |jjS#t$r%|x}|j_|cYSwxYwr@)rqrUrro)rOrs r9rezThreadLocalRegistry.__call__sO =& &   (,(9(9 9C$-%JJJ s ,==rc,t|jdS)NrU)rrqrNs r9rxzThreadLocalRegistry.hasst}g...r;rrVc||j_dSr@)rqrUrzs r9r.zThreadLocalRegistry.sets! r;c8 |j`dS#t$rYdSwxYwr@)rqrUrrNs r9rzThreadLocalRegistry.clears7  ###    DD s  N)rorrr|r}r~r) r`rarbrcrrrerxr.rrdr;r9rrs ****////""""r;rc8d}|D]}||ur|dz }|dkrdSdS)zrGiven a sequence and search object, return True if there's more than one, False if zero or one of them. rrTFrd)sequencetargetcrs r9 has_dupesrs@ A 6>> FA1uutt 5r;)r)r*r+r*r,r*)r<r=r,r>r@)rrr,r*)rrrrr,r*)rrr,r')rr/r,ry)Xrc __future__rcollections.abcabcrr]r?rrSrrrrrr r r r r rrrrrrrrrr_has_cyrrr TYPE_CHECKING_py_collectionsrrrrrr $sqlalchemy.cyextension.immutabledict"sqlalchemy.cyextension.collectionsr!r#r$r% frozensetr'rr(r:rCrArErerfrhrrrrRrsort_dictionaryrrrrr.r) column_dictordered_column_setrrrr#r&r*r.r1MutableMappingr4rcrjrmrrrdr;r9rs&%%"""""")))))) $$$$$$ ??????;;;;;;GGGGGGGGGGGG999999;;;;;;;NMMMMMKKKKKK  WT ge3 ge34(((%IKK ''''$9dV,,,,,,5555p    '4moo 555566666"38,6660ge3 WTVVVVVVVVr11111 2111*JrN  *8B<D     4S>        tCH~   (  """""WR["""J&&&&     HHH        h"h"h"h"h"v$S#X.h"h"h"V     huo        X   =====WR[===@.,<r;