etj+NUdZddlmZddlZddlZddlZddlZddlmZddlmZddlm Z ddlm Z ddlm Z dd lm Z dd lm Z dd lmZdd lmZdd lmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlZddlmZddlmZddlmZddlm Z ej!ses%ddl"m#Z#ddl"m$Z$ddl"m%Z%dd l"m&Z&dd!l"m'Z'dd"l"m(Z(n$ddl)m%Z%dd l)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/Z0d*e1d+<e/dgZ2d*e1d,<dpd1Z3dqd5Z4e#Z5d6e1d7<Gd8d9e&e,e-fZ6ed:e$Z7ed;e$Z8Gd<d=e e+Z9Gd>d?e9e+Z:Gd@dAe%e9e+Z;drdBZe>> 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 Z/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/sqlalchemy/util/_collections.pymerge_lists_w_orderingr<LsF!ff!!!$$G F!WWd1ggUG   G'!!(((!(%w MM' " " " " MM%   MdMapping[_KT, _VT]immutabledict[_KT, _VT]c`|stSt|tr|St|SN) EMPTY_DICT isinstancer)r>s r;coerce_to_immutabledictrEs5   A} % % Qr=zimmutabledict[Any, Any]rCc:eZdZdZddZddZdd ZddZddZdS) FacadeDictz*A dictionary that is not publicly mutable.argsrr.FacadeDict[Any, Any]c.tj|}|SrB)r __new__)clsrHnews r;rKzFacadeDict.__new__s',, r=rc td)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)NotImplementedErrorselfs r;copyzFacadeDict.copys! 0   r=c0tt|ffSrB)rGdictrPs r; __reduce__zFacadeDict.__reduce__sDJJ=((r=keyr%valuer&Nonec>t|||dS)z,insert an item into the dictionary directly.N)rT __setitem__rQrVrWs r; _insert_itemzFacadeDict._insert_items  sE*****r=strc<dt|zS)NzFacadeDict(%s))rT__repr__rPs r;r_zFacadeDict.__repr__s$--"5"555r=N)rHrr.rI)r.rr.rrVr%rWr&r.rX)r.r]) __name__ __module__ __qualname____doc__rKrRrUr\r_r=r;rGrGs~44    ))))++++666666r=rG_DT_FceZdZUdZdZded<d6dZd7d Zd8d Zd9fd Z d:dZ d;dZ ddZd?dZdt|d|dSNrlobject __setattr__)rQrns r;__init__zProperties.__init__s 4$/////r=r.intc*t|jSrBlenrlrPs r;__len__zProperties.__len__4:r= Iterator[_T]chtt|jSrB)r2listrlvaluesrPs r;__iter__zProperties.__iter__s&D**,,--...r= List[str]cttd|jDzS)Nc,g|]}t|Srf)r]).0ks r; z&Properties.__dir__..sAAA!s1vvAAAr=)dirsuperrlkeys)rQ __class__s r;__dir__zProperties.__dir__s3577||AAtz/@/@AAAAAr=r9Properties[_F]List[Union[_T, _F]]c@t|t|zSrB)r})rQr9s r;__add__zProperties.__add__sDzzDKK''r=rVr]objr#rXc||j|<dSrBrkrQrVrs r;rZzProperties.__setitem__ 3r=c|j|SrBrkrQrVs r; __getitem__zProperties.__getitem__sz#r=c|j|=dSrBrkrs r; __delitem__zProperties.__delitem__ JsOOOr=c||j|<dSrBrkrs r;rszProperties.__setattr__rr=Dict[str, Any]cd|jiSrprkrPs r; __getstate__zProperties.__getstate__s$$r=statecJt|d|ddSrprq)rQrs r; __setstate__zProperties.__setstate__s$4%.99999r=cX |j|S#t$rt|wxYwrB)rlKeyErrorAttributeErrorrs r; __getattr__zProperties.__getattr__s< &:c? " & & & %% % &s )boolc||jvSrBrkrs r; __contains__zProperties.__contains__dj  r=ReadOnlyProperties[_T]c*t|jS)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrlrPs r; as_readonlyzProperties.as_readonlys"$*---r=rWc:|j|dSrB)rlupdate)rQrWs r;rzProperties.updates %     r= Optional[_T]cdSrBrfrs r;getzProperties.gets-0Sr=defaultUnion[_DT, _T]cdSrBrfrQrVrs r;rzProperties.getHKr=NOptional[Union[_DT, _T]]Optional[Union[_T, _DT]]c||vr||S|SrBrfrs r;rzProperties.gets $;;9 Nr=c*t|jSrB)r}rlrPs r;rzProperties.keysDJr=List[_T]cNt|jSrB)r}rlr~rPs r;r~zProperties.valuessDJ%%''(((r=List[Tuple[str, _T]]cNt|jSrB)r}rlitemsrPs r;rzProperties.itemssDJ$$&&'''r=c||jvSrBrkrs r;has_keyzProperties.has_keyrr=c8|jdSrB)rlclearrPs r;rzProperties.clears r=)rnrmr.rur.r{)r.r)r9rr.r)rVr]rr#r.rX)rVr]r.r#)rVr]r.rX)r.r)rrr.rX)rVr]r.r)r.r)rWrmr.rX)rVr]r.r)rVr]rrr.rrB)rVr]rrr.r)r.r)r.rr.rX)rbrcrdre __slots____annotations__rtryrrrrZrrrsrrrrrrrrrr~rrr __classcell__)rs@r;rjrjs%BBI0000////BBBBBB((((%%%%::::&&&& !!!!.... !!!!000X0 KKKXK=A    ))))((((!!!!r=rjceZdZdZdZdZdS)OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.rfcTt|tdSrB)rjrt OrderedDictrPs r;rtzOrderedProperties.__init__ s"D+--00000r=N)rbrcrdrerrtrfr=r;rrs4I11111r=rceZdZdZdZdS)rzDProvide immutable dict/object attribute to an underlying dictionary.rfN)rbrcrdrerrfr=r;rrsNNIIIr=rcfdt|D}|dS)zSort an OrderedDict in-place.c$g|] }||f Srfrf)rrr>s r;rz,_ordered_dictionary_sort..s! 3 3 31a1Y 3 3 3r=)rVN)sortedrr)r>rVrs` r;_ordered_dictionary_sortrsK 4 3 3 3qc 2 2 2 3 3 3EGGIIIHHUOOOOOr=c0eZdZd d dZdZdZdZdZd S) WeakSequencerf_WeakSequence__elements Sequence[_T]cjtj|fd|_fd|D|_dS)NcV|}||j|dSdSrB)_storageremove)itemselfrefrQs r;_removez&WeakSequence.__init__.._remove&s7799D $$T***** r=c:g|]}tj|Srf)weakrefref)rr:rs r;rz)WeakSequence.__init__..,s2   .5GK ) )   r=)rrrr)rQrrs @r;rtzWeakSequence.__init__#s]#*+d"3"3 + + + +      9C    r=cj|jtj||jdSrB)rr4rrr)rQrs r;r4zWeakSequence.append0s, W[t|<<=====r=c*t|jSrB)rxrrPs r;ryzWeakSequence.__len__3s4=!!!r=c8dd|jDDS)Nc3K|]}||V dSrBrf)rrs r; z(WeakSequence.__iter__..7s+  sC  r=c3*K|]}|VdSrBrf)rrs r;rz(WeakSequence.__iter__..8s(;;cCCEE;;;;;;r=rrPs r;rzWeakSequence.__iter__6s3  ;;T];;;    r=c,|j|SrBr)rQindexs r;rzWeakSequence.__getitem__;s#t}U#%%%r=N)rf)rr)rbrcrdrtr4ryrrrfr=r;rr"si      >>>"""   &&&&&r=rceZdZdddZdS)OrderedIdentitySetNiterableOptional[Iterable[Any]]ctj|t|_|r|D]}||dSdSrB)rrtr_membersadd)rQros r;rtzOrderedIdentitySet.__init__@sZT"""#          r=rB)rr)rbrcrdrtrfr=r;rr?s-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||_dSrBr)rQrs r;rtzPopulateDict.__init__Ps  r=rVrr.c:||x||<}|SrBrrQrVvals r; __missing__zPopulateDict.__missing__Ss!,,s+++S C r=N)rrrVrr.rrbrcrdrertrrfr=r;rrHsFr=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||_dSrB)__func__r__self__rrweakself)rQrrs r;rtzWeakPopulateDict.__init__^s)%. !* H-- r=rVrr.c`|||x||<}|SrB)rrrs r;rzWeakPopulateDict.__missing__cs+,,t}}<<<S C r=N)rrrrrfr=r;rrXsF .... 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 (``==``). )rn_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rnzCallable[[_T], None]r zDict[int, Literal[True]]r Nvia Optional[str]c||_i|_|rt|||_dSt |drt d|j|_dSt |drt d|j|_dSdS)Nr4rrzSet[_T])rnr getattrr hasattrrr4r)rQrnr s r;rtzUniqueAppender.__init__~s    <")$"4"4D    T8 $ $ <"&z4"8"8"?D    T5 ! ! <"&y$"7"7";D    < .s.99Qaj9qDy999999r=)any)rrs` r;has_intersectionr&s( 9999(999 9 99r=c|tSt|tstt|S|SrB)r0rDrrs r;to_setr)s9yuu a  71::r=Set[Any]c|tSt|tstt|S|SrB) column_setrDrr(s r; to_column_setr-s<y|| a $ $'!**%%%r=Dict[Any, Any]_newOptional[Dict[Any, Any]]kwc v|}|r|||jdi||S)z5Copy the given dict and update with the given values.rf)rRr)r>r/r1s r; update_copyr3s@ A   AHNNrNNN Hr= Iterable[_T]r{c#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. rN)rDr]rflatten_iterator)relems r;r6r6sr $$$ 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_alertrl_counter_mutexrur:floatr;z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r<d?NOptional[Callable[..., None]]c|||_||_||_d|_t j|_i|_dS)Nr)r:r;r<r= threadingLockr>rl)rQr:r;r<s r;rtzLRUCache.__init__s: ! "$ n&& <> r=c0|xjdz c_|jS)Nr)r=rPs r; _inc_counterzLRUCache._inc_counters  }r=rVr%r. Optional[_VT]cdSrBrfrs r;rz LRUCache.gets.1cr=rUnion[_VT, _T]cdSrBrfrs r;rz LRUCache.getrr=Optional[Union[_VT, _T]]c|j|}|%||dd<|dS|SNrr)rlrrG)rQrVrrs r;rz LRUCache.get sDz~~c""  **,,DGAJ7NNr=r&cf|j|}||dd<|dSrN)rlrG)rQrVrs r;rzLRUCache.__getitem__s/z#&&((Q Awr= Iterator[_KT]c*t|jSrB)r2rlrPs r;rzLRUCache.__iter__rr=c*t|jSrBrwrPs r;ryzLRUCache.__len__rzr=ValuesView[_VT]cltjd|jDS)Nc&i|]\}}||dS)rrf)rrr$s r; z#LRUCache.values..!s"!I!I!Ida!QqT!I!I!Ir=)typingrrlrrPs r;r~zLRUCache.values s0 !I!Idj6F6F6H6H!I!I!IJJJr=rWrXcn|||gf|j|<|dSrB)rGrl _manage_sizer[s r;rZzLRUCache.__setitem__#s;(9(9(;(;'<= 3 r= _LRUCache__vc|j|=dSrBrk)rQr[s r;rzLRUCache.__delitem__'rr=c0|j|j|jzzSrB)r:r;rPs r;size_thresholdzLRUCache.size_threshold*s}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)NFrOT)rVreverser)r>acquirerr<rxr:r;rrlr~operator itemgetterrrelease)rQr< by_counterrs r;rZzLRUCache._manage_size.sT{""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@rAN)r:rur;r?r<rB)rVr%r.rH)rVr%rrJr.rJrB)rVr%rrLr.rL)rVr%r.r&)r.rQr)r.rTra)r[r%r.rX)r.r?r)rbrcrdrerrrtrGrrrrryr~rZrpropertyr^rZrfr=r;r9r9szIMMM>>>>48 ? ? ? ? ?111X1 KKKXK=A     KKKK>>>X>""""""r=r9ceZdZddZdS)_CreateFuncTyper.r'cdSrBrfrPs r;__call__z_CreateFuncType.__call__Gr=N)r.r'rbrcrdrjrfr=r;rhrhFs$$$$$$r=rhceZdZddZdS)_ScopeFuncTyper.rcdSrBrfrPs r;rjz_ScopeFuncType.__call__Krkr=Nr`rlrfr=r;rnrnJs""""""r=rnc^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]rsrnrtrruCallable[[], _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). Nrr)rQrsrts r;rtzScopedRegistry.__init__cs%" r=r.r#c|} |j|S#t$r0|j||cYSwxYwrB)rtrur setdefaultrsrs r;rjzScopedRegistry.__call__tsknn D=% % D D D=++C1B1BCC C C C Ds #7AArc8||jvS)z9Return True if an object is present in the current scope.)rtrurPs r;haszScopedRegistry.has{s~~4=00r=rrXc>||j|<dS)z$Set the value for the current scope.N)rurtrQrs r;r0zScopedRegistry.sets +. dnn&&'''r=c^ |j|=dS#t$rYdSwxYw)z Clear the current scope, if any.N)rurtrrPs r;rzScopedRegistry.clearsC  dnn..///    DD s  ,,N)rsrvrtrwr.r#r.rrr#r.rXr) rbrcrdrerrrtrjr|r0rrfr=r;rqrqNs  6I####MMM"DDDD1111 .... r=rqc:eZdZdZddZddZdd Zdd Zdd ZdS)ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. rsrvcD||_tj|_dSrB)rsrDlocalru)rQrss r;rtzThreadLocalRegistry.__init__s$!)) r=r.r#c |jjS#t$r%|x}|j_|cYSwxYwrB)rurWrrs)rQrs r;rjzThreadLocalRegistry.__call__sO =& &   (,(9(9 9C$-%JJJ s ,==rc,t|jdS)NrW)rrurPs r;r|zThreadLocalRegistry.hasst}g...r=rrXc||j_dSrB)rurWr~s r;r0zThreadLocalRegistry.sets! r=c8 |j`dS#t$rYdSwxYwrB)rurWrrPs r;rzThreadLocalRegistry.clears7  ###    DD s  N)rsrvrrrr) rbrcrdrertrjr|r0rrfr=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. rrTFrf)sequencetargetcrs r; has_dupesrs@ A 6>> FA1uutt 5r=)r+r,r-r,r.r,)r>r?r.r@rB)rrr.r,)rrrrr.r,)rrrr r.r)rrr.r*)r>r.r/r0r1rr.r.)rr4r.r{)Wre __future__rrbrDrrXrrrrrr r r r r rrrrrrrrrrr_has_cyrrrr TYPE_CHECKING_py_collectionsrrrr r!r"$sqlalchemy.cyextension.immutabledict"sqlalchemy.cyextension.collectionsr#r%r&r' frozensetr)rr*r<rErCrGrgrhrjrrrrTrsort_dictionaryrrrrr0r, column_dictordered_column_setrrrr&r)r-r3r6MutableMappingr9rhrnrqrrrfr=r;rs&%%"""""" $$$$$$****** ??????;;;;;;GGGGGGGGGGGG999999;;;;;;;NMMMMMKKKKKK WT ge3 ge34(((%IKK ''''$9dV,,,,,,5555p    '4moo 555566666"38,6660ge3 WTTTTTTTTTn11111 2111*JrN  *&&&&&8B<&&&:     4S>        tCH~   (  """""WR["""J&&&&::::9=          f"f"f"f"f"v$S#X.f"f"f"R%%%%%huo%%%#####X###=====WR[===@.,<r=