eNUdZddlmZddlZddlZddlZddlZddlmZddlmZddlm Z ddlm Z ddlm Z dd lm Z dd lm Z dd lmZdd lmZdd lmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlZddlmZddlmZddlmZddlmZej ses%ddl!m"Z"ddl!m#Z#ddl!m$Z$ddl!m%Z%dd l!m&Z&dd!l!m'Z'n$ddl(m$Z$ddl(m%Z%ddl(m"Z"ddl)m#Z#dd l)m&Z&dd!l)m'Z'ed"e#Z*ed$e#Z+ed%e#Z,ed&d'(Z-e.Z/d)e0d*<e.dgZ1d)e0d+<dfd0Z2dgd4Z3e"Z4d5e0d6<Gd7d8e%e+e,fZ5ed9e#Z6ed:e#Z7Gd;de8e*Z9Gd?d@e$e8e*Z:dhdAZ;eGdBdCee*Z?GdDdEe#Z@GdFdGe e+e,fZAGdHdIe e+e,fZBeCZDe>> 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 t|||dS)z,insert an item into the dictionary directly.N)rS __setitem__rPrUrVs r: _insert_itemzFacadeDict._insert_items  sE*****r<strc<dt|zS)NzFacadeDict(%s))rS__repr__rOs r:r^zFacadeDict.__repr__s$--"5"555r<N)rGrr-rH)r-rr-rrUr$rVr%r-rW)r-r\) __name__ __module__ __qualname____doc__rJrQrTr[r^r<r:rFrFs~44    ))))++++666666r<rF_DT_FceZdZUdZdZded<d6dZd7d Zd8d Zd9fd Z d:dZ d;dZ ddZd?dZdt|d|dSNrkobject __setattr__)rPrms r:__init__zProperties.__init__s 4$/////r<r-intc*t|jSrAlenrkrOs r:__len__zProperties.__len__4:r< Iterator[_T]chtt|jSrA)r1listrkvaluesrOs r:__iter__zProperties.__iter__s&D**,,--...r< List[str]cttd|jDzS)Nc,g|]}t|Sre)r\).0ks r: z&Properties.__dir__..sAAA!s1vvAAAr<)dirsuperrkkeys)rP __class__s r:__dir__zProperties.__dir__s3577||AAtz/@/@AAAAAr<r8Properties[_F]List[Union[_T, _F]]c@t|t|zSrA)r|)rPr8s r:__add__zProperties.__add__sDzzDKK''r<rUr\objr"rWc||j|<dSrArjrPrUrs r:rYzProperties.__setitem__ 3r<c|j|SrArjrPrUs r: __getitem__zProperties.__getitem__sz#r<c|j|=dSrArjrs r: __delitem__zProperties.__delitem__ JsOOOr<c||j|<dSrArjrs r:rrzProperties.__setattr__rr<Dict[str, Any]cd|jiSrorjrOs r: __getstate__zProperties.__getstate__s$$r<statecJt|d|ddSrorp)rPrs r: __setstate__zProperties.__setstate__s$4%.99999r<cX |j|S#t$rt|wxYwrA)rkKeyErrorAttributeErrorrs r: __getattr__zProperties.__getattr__s< &:c? " & & & %% % &s )boolc||jvSrArjrs r: __contains__zProperties.__contains__dj  r<ReadOnlyProperties[_T]c*t|jS)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrkrOs r: as_readonlyzProperties.as_readonlys"$*---r<rVc:|j|dSrA)rkupdate)rPrVs r:rzProperties.updates %     r< Optional[_T]cdSrArers r:getzProperties.get r<defaultUnion[_DT, _T]cdSrArerPrUrs r:rzProperties.getrr<NOptional[Union[_DT, _T]]Optional[Union[_T, _DT]]c||vr||S|SrArers r:rzProperties.gets $;;9 Nr<c*t|jSrA)r|rkrOs r:rzProperties.keysDJr<List[_T]cNt|jSrA)r|rkr}rOs r:r}zProperties.valuessDJ%%''(((r<List[Tuple[str, _T]]cNt|jSrA)r|rkitemsrOs r:rzProperties.itemssDJ$$&&'''r<c||jvSrArjrs r:has_keyzProperties.has_keyrr<c8|jdSrA)rkclearrOs r:rzProperties.clears r<)rmrlr-rtr-rz)r-r)r8rr-r)rUr\rr"r-rW)rUr\r-r")rUr\r-rW)r-r)rrr-rW)rUr\r-r)r-r)rVrlr-rW)rUr\r-r)rUr\rrr-rrA)rUr\rrr-r)r-r)r-rr-rW)rarbrcrd __slots____annotations__rsrxr~rrrYrrrrrrrrrrrrrr}rrr __classcell__)rs@r:riris7BBI0000////BBBBBB((((%%%%::::&&&& !!!!.... !!!!   X    X =A    ))))((((!!!!r<riceZdZdZdZdZdS)OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.recTt|tdSrA)rirs OrderedDictrOs r:rszOrderedProperties.__init__ s"D+--00000r<N)rarbrcrdrrsrer<r:rrs4I11111r<rceZdZdZdZdS)rzDProvide immutable dict/object attribute to an underlying dictionary.reN)rarbrcrdrrer<r:rrsNNIIIr<rcfdt|D}|dS)zSort an OrderedDict in-place.c$g|] }||f Srere)rrr=s r:rz,_ordered_dictionary_sort..s! 3 3 31a1Y 3 3 3r<)rUN)sortedrr)r=rUrs` r:_ordered_dictionary_sortrsK 4 3 3 3qc 2 2 2 3 3 3EGGIIIHHUOOOOOr<c0eZdZd d dZdZdZdZdZd S) WeakSequencere_WeakSequence__elements Sequence[_T]cjtj|fd|_fd|D|_dS)NcV|}||j|dSdSrA)_storageremove)itemselfrefrPs r:_removez&WeakSequence.__init__.._remove's7799D $$T***** r<c:g|]}tj|Sre)weakrefref)rr9rs r:rz)WeakSequence.__init__..-s2   .5GK ) )   r<)rrrr)rPrrs @r:rszWeakSequence.__init__$s]#*+d"3"3 + + + +      9C    r<cj|jtj||jdSrA)rr3rrr)rPrs r:r3zWeakSequence.append1s, W[t|<<=====r<c*t|jSrA)rwrrOs r:rxzWeakSequence.__len__4s4=!!!r<c8dd|jDDS)Nc3K|]}||V dSrAre)rrs r: z(WeakSequence.__iter__..8s+  sC  r<c3*K|]}|VdSrAre)rrs r:rz(WeakSequence.__iter__..9s(;;cCCEE;;;;;;r<)rrOs r:r~zWeakSequence.__iter__7s3  ;;T];;;    r<cr |j|}|S#t$rtd|zwxYw)NzIndex %s out of range)rr IndexError)rPindexrs r:rzWeakSequence.__getitem__<sQ -&C355L > > >4u<== = >s 6N)re)rr)rarbrcrsr3rxr~rrer<r:rr#si      >>>"""   r<rceZdZdddZdS)OrderedIdentitySetNiterableOptional[Iterable[Any]]ctj|t|_|r|D]}||dSdSrA)rrsr_membersadd)rPros r:rszOrderedIdentitySet.__init__FsZT"""#          r<rA)rr)rarbrcrsrer<r:rrEs-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||_dSrAr)rPrs r:rszPopulateDict.__init__Vs  r<rUrr-c:||x||<}|SrArrPrUvals r: __missing__zPopulateDict.__missing__Ys!,,s+++S C r<N)rrrUrr-rrarbrcrdrsrrer<r:rrNsFr<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||_dSrA)__func__r__self__rrweakself)rPrrs r:rszWeakPopulateDict.__init__ds)%. !* H-- r<rUrr-c`|||x||<}|SrA)rrrs r:rzWeakPopulateDict.__missing__is+,,t}}<<<S C r<N)rrrrrer<r:rr^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 (``==``). )rm_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rmzCallable[[_T], None]rzDict[int, Literal[True]]r Nvia Optional[str]c||_i|_|rt|||_dSt |drt d|j|_dSt |drt d|j|_dSdS)Nr3rrzSet[_T])rmr getattrrhasattrrr3r)rPrmr s r:rszUniqueAppender.__init__s    <")$"4"4D    T8 $ $ <"&z4"8"8"?D    T5 ! ! <"&y$"7"7";D    < .s"E"E"E!*"E1"E"E"Er<)rr0)set_rs r:has_intersectionr"s/ !!"E"Eh"E"E"EFF G GGr<c|tSt|tstt|S|SrA)r/rCrrs r:to_setr%s9yuu a  71::r<Set[Any]c|tSt|tstt|S|SrA) column_setrCrr$s r: to_column_setr)s<y|| a $ $'!**%%%r<c v|}|r|||jdi||S)z5Copy the given dict and update with the given values.re)rQr)r=_newkws r: update_copyr-s@ A   AHNNrNNN Hr< Iterable[_T]rzc#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)rCr\rflatten_iterator)relems r:r0r0sr $$$ 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_alertrk_counter_mutexrtr4floatr5z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r6d?NOptional[Callable[..., None]]c|||_||_||_d|_t j|_i|_dS)Nr)r4r5r6r7 threadingLockr8rk)rPr4r5r6s r:rszLRUCache.__init__s: ! "$ n&& <> r<c0|xjdz c_|jS)Nr)r7rOs r: _inc_counterzLRUCache._inc_counters  }r<rUr$r- Optional[_VT]cdSrArers r:rz LRUCache.get rr<rUnion[_VT, _T]cdSrArers r:rz LRUCache.getrr<Optional[Union[_VT, _T]]c|j|}|%||dd<|dS|SNrr)rkrrA)rPrUrrs r:rz LRUCache.getsDz~~c""  **,,DGAJ7NNr<r%cf|j|}||dd<|dSrH)rkrA)rPrUrs r:rzLRUCache.__getitem__s/z#&&((Q Awr< Iterator[_KT]c*t|jSrA)r1rkrOs r:r~zLRUCache.__iter__!rr<c*t|jSrArvrOs r:rxzLRUCache.__len__$ryr<ValuesView[_VT]cltjd|jDS)Nc&i|]\}}||dS)rre)rrr s r: z#LRUCache.values..(s"!I!I!Ida!QqT!I!I!Ir<)typingrrkrrOs r:r}zLRUCache.values's0 !I!Idj6F6F6H6H!I!I!IJJJr<rVrWcn|||gf|j|<|dSrA)rArk _manage_sizerZs r:rYzLRUCache.__setitem__*s;(9(9(;(;'<= 3 r< _LRUCache__vc|j|=dSrArj)rPrUs r:rzLRUCache.__delitem__.rr<c0|j|j|jzzSrA)r4r5rOs r:size_thresholdzLRUCache.size_threshold1s}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)NFrIT)rUreverser)r8acquirerr6rwr4r5rrkr}operator itemgetterrrelease)rPr6 by_counterrs r:rTzLRUCache._manage_size5sT{""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)r4rtr5r9r6r<)rUr$r-rB)rUr$rrDr-rDrA)rUr$rrFr-rF)rUr$r-r%)r-rKr)r-rNr`)rUr$r-rW)r-r9r)rarbrcrdrrrsrArrrr~rxr}rYrpropertyrXrTrer<r:r3r3sIMMM>>>>48 ? ? ? ? ?   X    X =A     KKKK>>>X>""""""r<r3ceZdZddZdS)_CreateFuncTyper-r&cdSrArerOs r:__call__z_CreateFuncType.__call__N r<N)r-r&rarbrcrdrer<r:rbrbM(      r<rbceZdZddZdS)_ScopeFuncTyper-rcdSrArerOs r:rdz_ScopeFuncType.__call__Srer<Nr_rfrer<r:ririRrgr<ric^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]rnrirorrpCallable[[], _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). Nrm)rPrnros r:rszScopedRegistry.__init__ls%" r<r-r"c|} |j|S#t$r0|j||cYSwxYwrA)rorpr setdefaultrnrs r:rdzScopedRegistry.__call__}sknn D=% % D D D=++C1B1BCC C C C Ds #7AArc8||jvS)z9Return True if an object is present in the current scope.)rorprOs r:haszScopedRegistry.hass~~4=00r<rrWc>||j|<dS)z$Set the value for the current scope.N)rprorPrs r:r/zScopedRegistry.sets +. dnn&&'''r<c^ |j|=dS#t$rYdSwxYw)z Clear the current scope, if any.N)rprorrOs r:rzScopedRegistry.clearsC  dnn..///    DD s  ,,N)rnrqrorrr-r"r-rrr"r-rWr) rarbrcrdrrrsrdrwr/rrer<r:rlrlWs  6I####MMM"DDDD1111 .... r<rlc:eZdZdZddZddZdd Zdd Zdd ZdS)ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. rnrqcD||_tj|_dSrA)rnr>localrp)rPrns r:rszThreadLocalRegistry.__init__s$!)) r<r-r"c |jjS#t$r%|x}|j_|cYSwxYwrA)rprVrrn)rPrs r:rdzThreadLocalRegistry.__call__sO =& &   (,(9(9 9C$-%JJJ s ,==rc,t|jdS)NrV)rrprOs r:rwzThreadLocalRegistry.hasst}g...r<rrWc||j_dSrA)rprVrys r:r/zThreadLocalRegistry.sets! r<c8 |j`dS#t$rYdSwxYwrA)rprVrrOs r:rzThreadLocalRegistry.clears7  ###    DD s  N)rnrqr{r|r}r) rarbrcrdrsrdrwr/rrer<r:rrs ****////""""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. rrTFre)sequencetargetcrs r: has_dupesrs@ A 6>> FA1uutt 5r<)r*r+r,r+r-r+)r=r>r-r?rA)rrr-r+)rrrrr-r+)rrr-r&)rr.r-rz)Vrd __future__rr\r>rrRrrrrrr r r r r rrrrrrrrrr_has_cyrrrr TYPE_CHECKING_py_collectionsrrrrr r!$sqlalchemy.cyextension.immutabledict"sqlalchemy.cyextension.collectionsr"r$r%r& frozensetr(rr)r;rDrBrFrfrgrirrrrSrsort_dictionaryrrrrr/r( column_dictordered_column_setrrrr"r%r)r-r0MutableMappingr3rbrirlrrrer<r:rs&%%"""""" $$$$$$****** ??????;;;;;;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<