rjJjUdZddlmZddlZddlZddlZddlZddlmZddlmZddlm Z ddlm Z ddlm Z dd lm Z dd lm Z dd lmZdd lmZdd lmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlZddlmZddlm Z ddlm!Z!ddl"m#Z#ddl"m$Z$dd l"m%Z%dd!lm&Z&ed"e#Z'ed$e#Z(ed%e#Z)ed&d'(Z*e+Z,d)e-d*<e+dgZ.d)e-d+<dUd,Z/dVd-Z0e#Z1d.e-d/<Gd0d1e$e(e)fZ2ed2e#Z3ed3e#Z4Gd4d5e e'Z5Gd6d7e5e'Z6Gd8d9e%e5e'Z7dWd:Z8e9Z:e8Z;Gd;de e(e)fZ>Gd?d@e e(e)fZ?e@ZAe9ZBe ZCGdAdBe e'ZDdXdCZEdWdYdDZFdZdEZGdFZHd[dGZI dW d\dHZJd]dIZKGdJdKeje(e)fZMGdLdMee*ZNGdNdOeZOGdPdQe e'ZPGdRdSePe'ZQdTZRy)^zCollection classes and helpers.) annotationsN)Any)Callable)cast) Container)Dict) FrozenSet)Generic)Iterable)Iterator)List)Literal)Mapping)NoReturn)Optional)overload)Protocol)Sequence)Set)Tuple)TypeVar)Union) ValuesView) IdentitySet) OrderedSet) unique_list) immutabledict)ImmutableDictBase)ReadOnlyContainer)is_non_string_iterable_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 g/var/www/html/python-recuperauto-other/env/lib/python3.12/site-packages/sqlalchemy/util/_collections.pymerge_lists_w_orderingr9:sF!f!!!$G F!Wd1gUG  G'!(!(%w MM' "  MM%  M cL|stSt|tr|St|SN) EMPTY_DICT isinstancer)ds r8coerce_to_immutabledictr@rs%  A} %Qr:zimmutabledict[Any, Any]r=c8eZdZdZddZd dZd dZd dZd dZy) FacadeDictz*A dictionary that is not publicly mutable.c0tj|}|Sr<)r__new__)clsargsnews r8rDzFacadeDict.__new__s$5$=$=c$B r:ctd)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)NotImplementedErrorselfs r8copyzFacadeDict.copys! 0  r:c&tt|ffSr<)rBdictrJs r8 __reduce__zFacadeDict.__reduce__sDJ=((r:c2tj|||y)z,insert an item into the dictionary directly.N)rN __setitem__rKkeyvalues r8 _insert_itemzFacadeDict._insert_items sE*r:c2dtj|zS)NzFacadeDict(%s))rN__repr__rJs r8rWzFacadeDict.__repr__s$--"555r:N)rFrreturnzFacadeDict[Any, Any])rXrrXrrSr$rTr%rXNone)rXstr) __name__ __module__ __qualname____doc__rDrLrOrUrWr:r8rBrB~s4 )+6r:rB_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]rgc2tj|d|yNrgobject __setattr__)rKdatas r8__init__zProperties.__init__s4$/r:c,t|jSr<lenrgrJs r8__len__zProperties.__len__4::r:cZtt|jjSr<)r-listrgvaluesrJs r8__iter__zProperties.__iter__sD**,-..r:ctt|jjDcgc] }t |c}zScc}wr<)dirsuperrgkeysr\)rKk __class__s r8__dir__zProperties.__dir__s157|tzz/@A!s1vAAAAsAc0t|t|zSr<)rv)rKr6s r8__add__zProperties.__add__sDzDK''r:c"||j|<yr<rfrKrSobjs r8rQzProperties.__setitem__ 3r:c |j|Sr<rfrKrSs r8 __getitem__zProperties.__getitem__szz#r:c|j|=yr<rfrs r8 __delitem__zProperties.__delitem__ JJsOr:c"||j|<yr<rfrs r8rmzProperties.__setattr__rr:cd|jiSrjrfrJs r8 __getstate__zProperties.__getstate__s$$r:c8tj|d|dyrjrk)rKstates r8 __setstate__zProperties.__setstate__s4%.9r:cR |j|S#t$r t|wxYwr<)rgKeyErrorAttributeErrorrs r8 __getattr__zProperties.__getattr__s/ &::c? " & % % &s&c||jvSr<rfrs r8 __contains__zProperties.__contains__djj  r:c,t|jS)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrgrJs r8 as_readonlyzProperties.as_readonlys"$**--r:c:|jj|yr<)rgupdate)rKrTs r8rzProperties.updates % r:cyr<rars r8getzProperties.gets-0r:cyr<rarKrSdefaults r8rzProperties.getHKr:c||vr||S|Sr<rars r8rzProperties.gets $;9 Nr:c,t|jSr<)rvrgrJs r8r|zProperties.keysDJJr:cHt|jjSr<)rvrgrwrJs r8rwzProperties.valuessDJJ%%'((r:cHt|jjSr<)rvrgitemsrJs r8rzProperties.itemssDJJ$$&''r:c||jvSr<rfrs r8has_keyzProperties.has_keyrr:c8|jjyr<)rgclearrJs r8rzProperties.clears r:)rnrhrXintrX Iterator[_T])rXz List[str])r6zProperties[_F]rXzList[Union[_T, _F]])rSr\rr"rXr[)rSr\rXr")rSr\rXr[)rXDict[str, Any])rrrXr[)rSr\rXbool)rXzReadOnlyProperties[_T])rTrhrXr[)rSr\rXz Optional[_T])rSr\rUnion[_DT, _T]rXrr<)rSr\rzOptional[Union[_DT, _T]]rXzOptional[Union[_T, _DT]])rXList[_T])rXzList[Tuple[str, _T]]rXr[)r]r^r_r` __slots____annotations__rorsrxrrrQrrrmrrrrrrrrr|rwrrr __classcell__)r~s@r8reresBI 0/B(%:& !. !00 KK=A!9 ! )(!r:receZdZdZdZdZy)OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.rac@tj|tyr<)rero OrderedDictrJs r8rozOrderedProperties.__init__sD+-0r:N)r]r^r_r`rrorar:r8rrsI1r:rceZdZdZdZy)rzDProvide immutable dict/object attribute to an underlying dictionary.raN)r]r^r_r`rrar:r8rrs NIr:rct||Dcgc] }|||f }}|j|j|ycc}w)zSort an OrderedDict in-place.)rSN)sortedrr)r?rSr}rs r8_ordered_dictionary_sortrs?!'qc 2 31a1Y 3E 3GGIHHUO 4sAc.eZdZdddZdZdZdZdZy) WeakSequencectj|fd}||_|Dcgc]}tj||c}|_ycc}w)NcN|}||jj|yyr<)_storageremove)itemselfrefrKs r8_removez&WeakSequence.__init__.._removes&9D $$T* r:)weakrefrefrr)rK_WeakSequence__elementsrr7s r8rozWeakSequence.__init__sE#*++d"3 +  9C .5GKK )   sA cv|jjtj||jyr<)rr/rrr)rKrs r8r/zWeakSequence.appends# W[[t||<=r:c,t|jSr<)rrrrJs r8rszWeakSequence.__len__!s4==!!r:c6dd|jDDS)Nc3&K|] }|| ywr<ra).0rs r8 z(WeakSequence.__iter__..%s sC sc3*K|] }| ywr<ra)rrs r8rz(WeakSequence.__iter__..&s;cCE;srrJs r8rxzWeakSequence.__iter__$s ;T]];  r:c*|j|Sr<r)rKindexs r8rzWeakSequence.__getitem__)s#t}}U#%%r:N)ra)rz Sequence[_T])r]r^r_ror/rsrxrrar:r8rrs  >" &r:rc eZdZdZddZddZy) PopulateDictzA dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. c||_yr<creator)rKrs r8rozPopulateDict.__init__8s  r:c2|j|x||<}|Sr<rrKrSvals r8 __missing__zPopulateDict.__missing__;s,,s++S C r:N)rzCallable[[_KT], _VT]rSrrXrr]r^r_r`rorrar:r8rr0sr:rc 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)rKcreator_methodrs r8rozWeakPopulateDict.__init__Fs*%.. !** H- r:cP|j|j|x||<}|Sr<)rrrs r8rzWeakPopulateDict.__missing__Ks&,,t}}<<S C r:N)rztypes.MethodTyperrrar:r8rr@s . r:rcVeZdZUdZdZded<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 (``==``). )rn_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rnzCallable[[_T], None]rzDict[int, Literal[True]]rNc||_i|_|rt|||_yt |drt d|j |_yt |drt d|j|_yy)Nr/raddzSet[_T])rnrgetattrrhasattrrr/r)rKrnvias r8rozUniqueAppender.__init__fsg   ")$"4D  T8 $"&z4"8"?"?D  T5 !"&y$"7";";D "r:cxt|}||jvr!|j|d|j|<yy)NT)idrr)rKrid_s r8r/zUniqueAppender.appendts8h dll "    % $DLL  #r:c,t|jSr<)r-rnrJs r8rxzUniqueAppender.__iter__zsDIIr:r<)rnrrz Optional[str])rr"rXr[r) r]r^r_r`rrror/rxrar:r8rrYsF 4I 00(( %% " <4 < <% r:rct|dk(r+t|dtjrt |dSt d|S)Nrr List[Any])rrr>types GeneratorTypervr)args r8coerce_generator_argr~s; 3x1}CFE,?,?@CF|K%%r:c`||St|s|gSt|tr|St|Sr<)r!r>rv)xrs r8to_listrs3y !! $s At Awr:c,tfd|DS)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. c3@K|]}|js|vywr<)__hash__)riset_s r8rz#has_intersection..s9QajjqDy9s )any)riterables` r8has_intersectionr s 9(9 99r:cf| tSt|tstt|S|Sr<)r+r>rrs r8to_setr s+yu a 71:r:cf| tSt|tstt|S|Sr<) column_setr>rr s r8 to_column_setrs-y| a $'!*%%r:c p|j}|r|j||jdi||S)z5Copy the given dict and update with the given values.ra)rLr)r?_newkws r8 update_copyrs1 A   AHHNrN Hr:c#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. rxN)r>r\rflatten_iterator)relems r8rrs@ $$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_alertrg_counter_mutexrrfloatrz.Optional[Callable[[LRUCache[_KT, _VT]], None]]rNc|||_||_||_d|_t j |_i|_y)Nr)rrrr threadingLockrrg)rKrrrs r8rozLRUCache.__init__s5 ! "$ nn& <> r:cD|xjdz c_|jSNr)rrJs r8 _inc_counterzLRUCache._inc_counters  }}r:cyr<rars r8rz LRUCache.gets.1r:cyr<rars r8rz LRUCache.getrr:cv|jj|}||j|dd<|dS|SNrr)rgrr$)rKrSrrs r8rz LRUCache.gets@zz~~c"  **,DGAJ7NNr:cV|j|}|j|dd<|dSr()rgr$)rKrSrs r8rzLRUCache.__getitem__s.zz#&&(Q Awr:c,t|jSr<)r-rgrJs r8rxzLRUCache.__iter__rr:c,t|jSr<rqrJs r8rszLRUCache.__len__rtr:c tj|jjDcic] \}}||d c}}Scc}}wr#)typingrrgr)rKr}rs r8rwzLRUCache.valuess:  djj6F6F6H!Ida!QqT'!IJJ!IsA cf|||jgf|j|<|jyr<)r$rg _manage_sizerRs r8rQzLRUCache.__setitem__ s.(9(9(;'<= 3 r:c|j|=yr<rf)rK _LRUCache__vs r8rzLRUCache.__delitem__rr:cN|j|j|jzzSr<)rrrJs r8size_thresholdzLRUCache.size_thresholds}}t}}t~~===r:c|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)rSreverser)racquirerrrrrrrrgrwoperator itemgetterrrelease)rKr by_counterrs r8r0zLRUCache._manage_sizes{{""5)  "doo.Jd)dmmdmmdnn.LLL!&JOOD)#JJ%%' ++A.  't}}7!D! JJtAw/!d)dmmdmmdnn.LLL KK   ! $! ! KK   !s0B'D5D&4D5& D2/D51D22D55E)dg?N)rrrrrzOptional[Callable[..., None]])rSr$rXz Optional[_VT])rSr$rUnion[_VT, _T]rXr=r<)rSr$rOptional[Union[_VT, _T]]rXr>)rSr$rXr%)rXz Iterator[_KT]r)rXzValuesView[_VT]rZ)r2r$rXr[)rXrr)r]r^r_r`rrror$rrrrxrsrwrQrpropertyr4r0rar:r8rrsIM>>48 ? ? ?2 ?11 KK=A!9 !  K>>"r:rceZdZddZy)_CreateFuncTypecyr<rarJs r8__call__z_CreateFuncType.__call__/r:N)rXr&r]r^r_rCrar:r8rArA.s$r:rAceZdZddZy)_ScopeFuncTypecyr<rarJs r8rCz_ScopeFuncType.__call__3rDr:NrYrErar:r8rGrG2s"r:rGcdeZdZUdZdZded<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]rLrGrMrrNc.||_||_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). NrK)rKrLrMs r8rozScopedRegistry.__init__Ks%" r:c|j} |j|S#t$r-|jj||j cYSwxYwr<)rMrNr setdefaultrLrs r8rCzScopedRegistry.__call__\sRnn D==% % D==++C1BC C Ds!3AAc:|j|jvS)z9Return True if an object is present in the current scope.)rMrNrJs r8haszScopedRegistry.hascs~~4==00r:c>||j|j<y)z$Set the value for the current scope.N)rNrMrKrs r8r+zScopedRegistry.seths+. dnn&'r:cZ |j|j=y#t$rYywxYw)z Clear the current scope, if any.N)rNrMrrJs r8rzScopedRegistry.clearms,  dnn./   s  **N)rLCallable[[], _T]rMzCallable[[], Any]rXr"rXrrr"rXr[r) r]r^r_r`rrrorCrSr+rrar:r8rJrJ6sI 6I##M*7H"D1 . r:rJc8eZdZdZddZd dZd dZd dZd dZy) ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. cD||_tj|_yr<)rLr localrN)rKrLs r8rozThreadLocalRegistry.__init__|s$!) r:c |jjS#t$r&|jx}|j_|cYSwxYwr<)rNrTrrL)rKrs r8rCzThreadLocalRegistry.__call__sC ==&& & (,(9 9C$--%J s,AAc.t|jdS)NrT)rrNrJs r8rSzThreadLocalRegistry.hasst}}g..r:c&||j_yr<)rNrTrUs r8r+zThreadLocalRegistry.sets! r:c< |j`y#t$rYywxYwr<)rNrTrrJs r8rzThreadLocalRegistry.clears#  #   s  N)rLrWrXrYrZr) r]r^r_r`rorCrSr+rrar:r8r\r\vs  */"r:r\c8d}|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. rrTFra)sequencetargetcrs r8 has_dupesrgs7 A 6> FA1u  r:)r1rr2rrXr)r?zMapping[_KT, _VT]rXzimmutabledict[_KT, _VT]r<)rrrXr)rrrzOptional[List[Any]]rXr)rzContainer[Any]rz Iterable[Any]rXr)rrrXzSet[Any])r?Dict[Any, Any]rzOptional[Dict[Any, Any]]rrrXrh)rz Iterable[_T]rXr)Sr` __future__rr8r rr.rrrrrr r r r r rrrrrrrrrrrrr_collections_cyrrr_immutabledict_cyrrr r!r"r$r%r& frozensetr(rr)r9r@r=rBrbrcrerrrrNrsort_dictionaryrOrderedIdentitySetrrr+r column_dictordered_column_setrrrr r rrrMutableMappingrrArGrJr\rgrar:r8rrs]&" 757=EE* T e3 e34(%K >'$dV,.,5p '4o #56"38,60e3 TTTn1 21*JrN  *&8B<&:! 4S>  tCH~ (  "WR["J&:9=    5  DG     f"v$$S#X.f"R%huo%#X#=WR[=@.,<r: