e?1iNUdZddlmZddlmZddlZddlZddlZddl 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 jDses%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*<dVd+Z4dWd,Z5e$Z6d-e2d.<Gd/d0e'e-e.fZ7ed1e "Z8ed2e "Z9Gd3d4ee,Z:Gd5d6e:e,Z;Gd7d8e&e:e,ZZ?e=Z@Gd:d;ee,ZAGd<d=e%ZBGd>d?e e-e.fZCGd@dAe e-e.fZDeEZFe>ZGe(ZHGdBdCee,ZIdYdDZJdXdZdEZKdFZLdGZMd[dHZNdXdIZOd\dJZPGdKdLe je-e.fZRGdMdNe!e/ZSGdOdPe!ZTGdQdRee,ZUGdSdTeUe,ZVdUZWy)]zCollection 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_SETct|j|}g}t|t|}} |D].}||vr|j|||}}n'|j |0|j | |SH)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)aboverlapresultcurrentotherelements f/home/www/therecruiter.miabetepe.com/venv/lib/python3.12/site-packages/sqlalchemy/util/_collections.pymerge_lists_w_orderingr8KsF!f!!!$G F!Wd1gUG  G'!(!(%w MM' "  MM%  M cL|stSt|tr|St|SN) EMPTY_DICT isinstancer)ds r7coerce_to_immutabledictr?s%  A} %Qr9zimmutabledict[Any, Any]r<c8eZdZdZddZd dZd dZd dZd dZy) FacadeDictz*A dictionary that is not publicly mutable.c0tj|}|Sr;)r__new__)clsargsnews r7rCzFacadeDict.__new__s'', r9ctd)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)NotImplementedErrorselfs r7copyzFacadeDict.copys! 0  r9c&tt|ffSr;)rAdictrIs r7 __reduce__zFacadeDict.__reduce__sDJ=((r9c2tj|||y)z,insert an item into the dictionary directly.N)rM __setitem__rJkeyvalues r7 _insert_itemzFacadeDict._insert_items sE*r9c2dtj|zS)NzFacadeDict(%s))rM__repr__rIs r7rVzFacadeDict.__repr__s$--"555r9N)rErreturnzFacadeDict[Any, Any])rWrrWrrRr#rSr$rWNone)rWstr) __name__ __module__ __qualname____doc__rCrKrNrTrVr9r7rArAs4 )+6r9rA_DT_FceZdZUdZdZded<ddZddZddZdfd Z d d Z d!d Z d"d Z d#d Z d!d Zd$dZd%dZd"dZd&dZd'dZd(dZed)dZed*dZ d+ d,dZddZd-dZd.dZd&dZd/dZxZS)0 Propertiesz8Provide a __getattr__/__setattr__ interface over a dict._data Dict[str, _T]rfc2tj|d|yNrfobject __setattr__)rJdatas r7__init__zProperties.__init__s4$/r9c,t|jSr;lenrfrIs r7__len__zProperties.__len__4::r9cZtt|jjSr;)r,listrfvaluesrIs r7__iter__zProperties.__iter__sD**,-..r9ctt|jjDcgc] }t |c}zScc}wr;)dirsuperrfkeysr[)rJk __class__s r7__dir__zProperties.__dir__s157|tzz/@A!s1vAAAAsAc0t|t|zSr;)ru)rJr5s r7__add__zProperties.__add__sDzDK''r9c"||j|<yr;rerJrRobjs r7rPzProperties.__setitem__ 3r9c |j|Sr;rerJrRs r7 __getitem__zProperties.__getitem__szz#r9c|j|=yr;rers r7 __delitem__zProperties.__delitem__ JJsOr9c"||j|<yr;rers r7rlzProperties.__setattr__rr9cd|jiSrirerIs r7 __getstate__zProperties.__getstate__s$$r9c8tj|d|dyrirj)rJstates r7 __setstate__zProperties.__setstate__s4%.9r9cR |j|S#t$r t|wxYwr;)rfKeyErrorAttributeErrorrs r7 __getattr__zProperties.__getattr__s/ &::c? " & % % &s&c||jvSr;rers r7 __contains__zProperties.__contains__djj  r9c,t|jS)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrfrIs r7 as_readonlyzProperties.as_readonlys"$**--r9c:|jj|yr;)rfupdate)rJrSs r7rzProperties.updates % r9cyr;r`rs r7getzProperties.get r9cyr;r`rJrRdefaults r7rzProperties.getrr9c||vr||S|Sr;r`rs r7rzProperties.gets $;9 Nr9c,t|jSr;)rurfrIs r7r{zProperties.keysDJJr9cHt|jjSr;)rurfrvrIs r7rvzProperties.valuessDJJ%%'((r9cHt|jjSr;)rurfitemsrIs r7rzProperties.itemssDJJ$$&''r9c||jvSr;rers r7has_keyzProperties.has_keyrr9c8|jjyr;)rfclearrIs r7rzProperties.clears r9)rmrgrWintrW Iterator[_T])rWz List[str])r5zProperties[_F]rWzList[Union[_T, _F]])rRr[rr!rWrZ)rRr[rWr!)rRr[rWrZ)rWDict[str, Any])rrrWrZ)rRr[rWbool)rWzReadOnlyProperties[_T])rSrgrWrZ)rRr[rWz Optional[_T])rRr[rUnion[_DT, _T]rWrr;)rRr[rzOptional[Union[_DT, _T]]rWzOptional[Union[_T, _DT]])rWList[_T])rWzList[Tuple[str, _T]]rWrZ)r\r]r^r_ __slots____annotations__rnrrrwr~rrPrrrlrrrrrrrrr{rvrrr __classcell__)r}s@r7rdrdsBI 0/B(%:& !. !    =A!9 ! )(!r9rdceZdZdZdZdZy)OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.r`c@tj|tyr;)rdrn OrderedDictrIs r7rnzOrderedProperties.__init__ sD+-0r9N)r\r]r^r_rrnr`r9r7rrsI1r9rceZdZdZdZy)rzDProvide immutable dict/object attribute to an underlying dictionary.r`N)r\r]r^r_rr`r9r7rrs NIr9rct||Dcgc] }|||f }}|j|j|ycc}w)zSort an OrderedDict in-place.)rRN)sortedrr)r>rRr|rs r7_ordered_dictionary_sortrs?!'qc 2 31a1Y 3E 3GGIHHUO 4sAc.eZdZdddZdZdZdZdZy) WeakSequencectj|fd}||_|Dcgc]}tj||c}|_ycc}w)NcN|}||jj|yyr;)_storageremove)itemselfrefrJs r7_removez&WeakSequence.__init__.._remove's&9D $$T* r9)weakrefrefrr)rJ_WeakSequence__elementsrr6s r7rnzWeakSequence.__init__$sE#*++d"3 +  9C .5GKK )   sA cv|jjtj||jyr;)rr.rrr)rJrs r7r.zWeakSequence.append1s# W[[t||<=r9c,t|jSr;)rqrrIs r7rrzWeakSequence.__len__4s4==!!r9c6dd|jDDS)Nc3&K|] }|| ywr;r`).0rs r7 z(WeakSequence.__iter__..8s sC sc3*K|] }| ywr;r`)rrs r7rz(WeakSequence.__iter__..9s;cCE;s)rrIs r7rwzWeakSequence.__iter__7s ;T]];  r9cf |j|}|S#t$rtd|zwxYw)NzIndex %s out of range)rr IndexError)rJindexrs r7rzWeakSequence.__getitem__<s@ --&C5L >4u<= = >s0N)r`)rz Sequence[_T])r\r]r^rnr.rrrwrr`r9r7rr#s  >" r9rceZdZdddZy)OrderedIdentitySetNctj|t|_|r|D]}|j |yyr;)rrnr_membersadd)rJiterableos r7rnzOrderedIdentitySet.__init__Fs;T"#      r9r;)rzOptional[Iterable[Any]])r\r]r^rnr`r9r7rrEsr9rc eZdZdZddZddZy) PopulateDictzA dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. c||_yr;creator)rJrs r7rnzPopulateDict.__init__Vs  r9c2|j|x||<}|Sr;rrJrRvals r7 __missing__zPopulateDict.__missing__Ys,,s++S C r9N)rzCallable[[_KT], _VT]rRrrWrr\r]r^r_rnrr`r9r7rrNsr9rc eZdZdZddZddZy)WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create a reference cycle. cr|j|_|j}tj||_yr;)__func__r__self__rrweakself)rJcreator_methodrs r7rnzWeakPopulateDict.__init__ds*%.. !** H- r9cP|j|j|x||<}|Sr;)rrrs r7rzWeakPopulateDict.__missing__is&,,t}}<<S C r9N)rztypes.MethodTyperrr`r9r7rr^s . r9rcVeZdZUdZdZded<ded<ded< d dd Zdd Zdd Zy )UniqueAppenderzAppends items to a collection ensuring uniqueness. Additional appends() of the same object are ignored. Membership is determined by identity (``is a``) not equality (``==``). )rm_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rmzCallable[[_T], None]rzDict[int, Literal[True]]rNc||_i|_|rt|||_yt |drt d|j |_yt |drt d|j|_yy)Nr.rrzSet[_T])rmrgetattrrhasattrrr.r)rJrmvias r7rnzUniqueAppender.__init__sg   ")$"4D  T8 $"&z4"8"?"?D  T5 !"&y$"7";";D "r9cxt|}||jvr!|j|d|j|<yy)NT)idrr)rJrid_s r7r.zUniqueAppender.appends8h dll "    % $DLL  #r9c,t|jSr;)r,rmrIs r7rwzUniqueAppender.__iter__sDIIr9r;)rmrrz Optional[str])rr!rWrZr) r\r]r^r_rrrnr.rwr`r9r7rrwsF 4I 00(( %% " <4 < <% r9rct|dk(r+t|dtjrt |dSt d|S)Nrr List[Any])rqr=types GeneratorTyperur)args r7coerce_generator_argrs; 3x1}CFE,?,?@CF|K%%r9c||St|tjrt|ttfr|gSt|t r|St |Sr;)r=collections_abcr r[bytesru)xrs r7to_listrsMy a11 2j C<7s At Awr9cvt|j|Dcgc]}|js|c}Scc}w)zreturn True if any items of set\_ are present in iterable. Goes through special effort to ensure __hash__ is not called on items in iterable that don't support it. )rr+__hash__)set_ris r7has_intersectionr s. !!h"E!**1"EF GG"Es6 6 cf| tSt|tstt|S|Sr;)r*r=rrs r7to_setrs+yu a 71:r9cf| tSt|tstt|S|Sr;) column_setr=rrs r7 to_column_setrs-y| a $'!*%%r9c p|j}|r|j||jdi||S)z5Copy the given dict and update with the given values.r`)rKr)r>_newkws r7 update_copyrs1 A   AHHNrN Hr9c#K|D]6}t|ts t|drt|Ed{3|8y7 w)zGiven an iterator of which further sub-elements may also be iterators, flatten the sub-elements into a single iterator. rwN)r=r[rflatten_iterator)relems r7rrs@ $$z)B'- - -J  -s0A? AceZdZUdZdZded<ded<ded< d dd Zd Zedd Z edd Z d ddZ ddZ ddZ ddZ d dZ d!dZd"dZed#dZd$dZy )%LRUCachezDictionary 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_alertrf_counter_mutexrrfloatrz.Optional[Callable[[LRUCache[_KT, _VT]], None]]rNc|||_||_||_d|_t j |_i|_y)Nr)rrrr  threadingLockr!rf)rJrrrs r7rnzLRUCache.__init__s5 ! "$ nn& <> r9cD|xjdz c_|jSNr)r rIs r7 _inc_counterzLRUCache._inc_counters  }}r9cyr;r`rs r7rz LRUCache.get rr9cyr;r`rs r7rz LRUCache.getrr9cv|jj|}||j|dd<|dS|SNrr)rfrr()rJrRrrs r7rz LRUCache.gets@zz~~c"  **,DGAJ7NNr9cV|j|}|j|dd<|dSr,)rfr()rJrRrs r7rzLRUCache.__getitem__s.zz#&&(Q Awr9c,t|jSr;)r,rfrIs r7rwzLRUCache.__iter__#rr9c,t|jSr;rprIs r7rrzLRUCache.__len__&rsr9c tj|jjDcic] \}}||d c}}Scc}}wr')typingrrfr)rJr|r s r7rvzLRUCache.values)s:  djj6F6F6H!Ida!QqT'!IJJ!IsA cf|||jgf|j|<|jyr;)r(rf _manage_sizerQs r7rPzLRUCache.__setitem__,s.(9(9(;'<= 3 r9c|j|=yr;re)rJ _LRUCache__vs r7rzLRUCache.__delitem__0rr9cN|j|j|jzzSr;)rrrIs r7size_thresholdzLRUCache.size_threshold3s}}t}}t~~===r9c|jjdsy t|j}t ||j |j |j zzkDr|rd}|j|t|jjtjdd}||j dD]} |j|d=t ||j |j |j zzkDr|jjy#t$rYowxYw#|jjwxYw)NFr-T)rRreverser)r!acquirerrrqrrrrfrvoperator itemgetterrrelease)rJr by_counterrs r7r4zLRUCache._manage_size7s{{""5)  "doo.Jd)dmmdmmdnn.LLL!&JOOD)#JJ%%' ++A.  't}}7!D! JJtAw/!d)dmmdmmdnn.LLL KK   ! $! ! KK   !s0B'D5D&4D5& D2/D51D22D55E)dg?N)rrrr"rzOptional[Callable[..., None]])rRr#rWz Optional[_VT])rRr#rUnion[_VT, _T]rWrAr;)rRr#rOptional[Union[_VT, _T]]rWrB)rRr#rWr$)rWz Iterator[_KT]r)rWzValuesView[_VT]rY)r6r#rWrZ)rWr"r)r\r]r^r_rrrnr(rrrrwrrrvrPrpropertyr8r4r`r9r7rrsIM>>48 ? ? ?2 ?    =A!9 !  K>>"r9rceZdZddZy)_CreateFuncTypecyr;r`rIs r7__call__z_CreateFuncType.__call__P r9N)rWr%r\r]r^rGr`r9r7rErEO r9rEceZdZddZy)_ScopeFuncTypecyr;r`rIs r7rGz_ScopeFuncType.__call__UrHr9NrXrIr`r9r7rLrLTrJr9rLcdeZdZUdZdZded<ded<ded< dd Zdd Zdd Zdd Z dd Z y)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]rQrLrRrrSc.||_||_i|_y)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). NrP)rJrQrRs r7rnzScopedRegistry.__init__ns%" r9c|j} |j|S#t$r-|jj||j cYSwxYwr;)rRrSr setdefaultrQrs r7rGzScopedRegistry.__call__sRnn D==% % D==++C1BC C Ds!3AAc:|j|jvS)z9Return True if an object is present in the current scope.)rRrSrIs r7haszScopedRegistry.hass~~4==00r9c>||j|j<y)z$Set the value for the current scope.N)rSrRrJrs r7r*zScopedRegistry.sets+. dnn&'r9cZ |j|j=y#t$rYywxYw)z Clear the current scope, if any.N)rSrRrrIs r7rzScopedRegistry.clears,  dnn./   s  **N)rQCallable[[], _T]rRzCallable[[], Any]rWr!rWrrr!rWrZr) r\r]r^r_rrrnrGrXr*rr`r9r7rOrOYsI 6I##M*7H"D1 . r9rOc8eZdZdZddZd dZd dZd dZd dZy) ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. cD||_tj|_yr;)rQr$localrS)rJrQs r7rnzThreadLocalRegistry.__init__s$!) r9c |jjS#t$r&|jx}|j_|cYSwxYwr;)rSrSrrQ)rJrs r7rGzThreadLocalRegistry.__call__sC ==&& & (,(9 9C$--%J s,AAc.t|jdS)NrS)rrSrIs r7rXzThreadLocalRegistry.hasst}}g..r9c&||j_yr;)rSrSrZs r7r*zThreadLocalRegistry.sets! r9c< |j`y#t$rYywxYwr;)rSrSrrIs r7rzThreadLocalRegistry.clears#  #   s  N)rQr\r]r^r_r) r\r]r^r_rnrGrXr*rr`r9r7raras  */"r9rac8d}|D]}||us|dz }|dkDsyy)zrGiven a sequence and search object, return True if there's more than one, False if zero or one of them. rrTFr`)sequencetargetcrs r7 has_dupesrls7 A 6> FA1u  r9)r0rr1rrWr)r>zMapping[_KT, _VT]rWzimmutabledict[_KT, _VT]r;)rrrWr)rrrzOptional[List[Any]]rWr)rrrWzSet[Any])rz Iterable[_T]rWr)Xr_ __future__rcollections.abcabcrr<r$rr2rrrrrr r r r r rrrrrrrrrr_has_cyrrr TYPE_CHECKING_py_collectionsrrrrrr $sqlalchemy.cyextension.immutabledict"sqlalchemy.cyextension.collectionsr!r#r$r% frozensetr'rr(r8r?r<rArarbrdrrrrMrsort_dictionaryrrrrr*r column_dictordered_column_setrrrr rrrrMutableMappingrrErLrOrarlr`r9r7rzsh&") $ ?;GG9;NK  T e3 e34(%K >'$dV,.,5p '4o #56"38,60e3 TVVr1 21*JrN  *8B<D 4S>  tCH~ (  "WR["J& H  h"v$$S#X.h"V huo  X =WR[=@.,<r9