]j+N%SrSSKJr SSKrSSKrSSKrSSKrSSKJr SSKJr SSKJ r SSKJ r SSKJ r SS KJ r SS KJ r SS KJr SS KJr SS KJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SSKrSSKJr SSKJr SSKJr SSKJ r \RB(d\(d%SSK"J#r# SSK"J$r$ SSK"J%r% SS K"J&r& SS!K"J'r' SS"K"J(r( O$SSK)J%r% SS K)J&r& SSK)J#r# SSK*J$r$ SS!K*J'r' SS"K*J(r( \"S#\S$9r+\"S%\S$9r,\"S&\S$9r-\"S'S(S)9r.\/"5r0S*\1S+'\/"S/5r2S*\1S,'SXS-jr3SYS.jr4\#"5r5S/\1S0'"S1S2\&\,\-45r6\"S3\S$9r7\"S4\S$9r8"S5S6\ \+5r9"S7S8\9\+5r:"S9S:\%\9\+5r;SZS;jr<\=r>\S?\$5rA"S@SA\ \,\-45rB"SBSC\ \,\-45rC\DrE\=rF\'rG"SDSE\ \+5rHS[SFjrISZS\SGjjrJS]SHjrKSIrLS^SJjrMSZS_SKjjrNS`SLjrO"SMSN\R\,\-45rQ"SOSP\ \.5rR"SQSR\ 5rS"SSST\ \+5rT"SUSV\T\+5rUSWrVg)azCollection classes and helpers.) annotationsN)Any)Callable)cast) Container)Dict) FrozenSet)Generic)Iterable)Iterator)List)Mapping)NoReturn)Optional)overload)Sequence)Set)Tuple)TypeVar)Union) ValuesView)HAS_CYEXTENSION)is_non_string_iterable)Literal)Protocol) immutabledict) IdentitySet)ReadOnlyContainer)ImmutableDictBase) OrderedSet) unique_list_T)bound_KT_VT_T_coT) covariantzFrozenSet[Any] EMPTY_SETNONE_SETc[U5RU5n/n[U5[U5pTUH.nXb;aURU5 XEpE O)UR U5 M0 UR U5 U$MJ)a merge 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 Y/home/mande/repo/quber/.venv/lib/python3.13/site-packages/sqlalchemy/util/_collections.pymerge_lists_w_orderingr:Ls{F!f!!!$G F!Wd1gU G!(!(w MM' "  MM%  M c`U(d[$[U[5(aU$[U5$N) EMPTY_DICT isinstancer)ds r9coerce_to_immutabledictrAs(  A} % %Qr;zimmutabledict[Any, Any]r>cJ\rSrSrSrS SjrS SjrS SjrS SjrSSjr Sr g ) FacadeDictz*A dictionary that is not publicly mutable.c2[R"U5nU$r=)r __new__)clsargsnews r9rFFacadeDict.__new__s'', r;c[S5e)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)NotImplementedErrorselfs r9copyFacadeDict.copys! 0  r;c&[[U544$r=)rCdictrMs r9 __reduce__FacadeDict.__reduce__sDJ=((r;c0[RXU5 g)z,insert an item into the dictionary directly.N)rR __setitem__rNkeyvalues r9 _insert_itemFacadeDict._insert_items E*r;c2S[RU5-$)NzFacadeDict(%s))rR__repr__rMs r9r]FacadeDict.__repr__s$--"555r;N)rHrreturnzFacadeDict[Any, Any])r`rr`rrXr%rYr&r`None)r`str) __name__ __module__ __qualname____firstlineno____doc__rFrOrSrZr]__static_attributes__r_r;r9rCrCs4 )+6r;rC_DT_Fc@^\rSrSr%SrSrS\S'SSjrSSjrS Sjr S!U4S jjr S"S jr S#S jr S$S jr S%S jrS#SjrS&SjrS'SjrS$SjrS(SjrS)SjrS*Sjr\S+Sj5r\S,Sj5rS-S.SjjrS!SjrS/SjrS0SjrS(SjrS1SjrSrU=r$)2 Propertiesz8Provide a __getattr__/__setattr__ interface over a dict._data Dict[str, _T]rqc2[RUSU5 gNrqobject __setattr__)rNdatas r9__init__Properties.__init__s4$/r;c,[UR5$r=lenrqrMs r9__len__Properties.__len__4::r;cZ[[URR555$r=)r.listrqvaluesrMs r9__iter__Properties.__iter__sD**,-..r;c>[[55URR5Vs/sHn[ U5PM sn-$s snfr=)dirsuperrqkeysrd)rNk __class__s r9__dir__Properties.__dir__s757|tzz/@A/@!s1v/@AAAAsA c0[U5[U5-$r=)r)rNr7s r9__add__Properties.__add__sDzDK''r;c X RU'gr=rprNrXobjs r9rVProperties.__setitem__  3r;c URU$r=rprNrXs r9 __getitem__Properties.__getitem__szz#r;cURU gr=rprs r9 __delitem__Properties.__delitem__ JJsOr;c X RU'gr=rprs r9rwProperties.__setattr__rr;cSUR0$rtrprMs r9 __getstate__Properties.__getstate__s$$r;c8[RUSUS5 grtru)rNstates r9 __setstate__Properties.__setstate__s4%.9r;cTURU$![a [U5ef=fr=)rqKeyErrorAttributeErrorrs r9 __getattr__Properties.__getattr__s/ &::c? " & % % &s'cXR;$r=rprs r9 __contains__Properties.__contains__jj  r;c,[UR5$)z8Return an immutable proxy for this :class:`.Properties`.)ReadOnlyPropertiesrqrMs r9 as_readonlyProperties.as_readonlys"$**--r;c:URRU5 gr=)rqupdate)rNrYs r9rProperties.updates % r;cgr=r_rs r9getProperties.gets-0r;cgr=r_rNrXdefaults r9rrHKr;cX;aX$U$r=r_rs r9rrs ;9 Nr;c,[UR5$r=)rrqrMs r9rProperties.keysDJJr;cH[URR55$r=)rrqrrMs r9rProperties.valuessDJJ%%'((r;cH[URR55$r=)rrqitemsrMs r9rProperties.itemssDJJ$$&''r;cXR;$r=rprs r9has_keyProperties.has_keyrr;c8URR5 gr=)rqclearrMs r9rProperties.clears r;r_)rxrrr`intr` Iterator[_T])r`z List[str])r7zProperties[_F]r`zList[Union[_T, _F]])rXrdrr#r`rc)rXrdr`r#)rXrdr`rc)r`Dict[str, Any])rrr`rc)rXrdr`bool)r`zReadOnlyProperties[_T])rYrrr`rc)rXrdr`z Optional[_T])rXrdrUnion[_DT, _T]r`rr=)rXrdrzOptional[Union[_DT, _T]]r`zOptional[Union[_T, _DT]])r`List[_T])r`zList[Tuple[str, _T]]r`rc)rerfrgrhri __slots____annotations__ryr~rrrrVrrrwrrrrrrrrrrrrrrj __classcell__)rs@r9rnrnsBI 0/B(%:& !. !00 KK=A!9 ! )(!r;rnc"\rSrSrSrSrSrSrg)OrderedPropertiesizQProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.r_c@[RU[55 gr=)rnry OrderedDictrMs r9ryOrderedProperties.__init__ sD+-0r;N)rerfrgrhrirryrjr_r;r9rrsI1r;rc\rSrSrSrSrSrg)rizDProvide immutable dict/object attribute to an underlying dictionary.r_N)rerfrgrhrirrjr_r;r9rrs NIr;rc[XS9Vs/sHo"X4PM nnUR5 URU5 gs snf)zSort an OrderedDict in-place.)rXN)sortedrr)r@rXrrs r9_ordered_dictionary_sortrs<!'q 2 3 21Y 2E 3GGIHHUO 4s?c:\rSrSrS S SjjrSrSrSrSrSr g) WeakSequencei"c[R"U54SjnX lUVs/sHn[R"X25PM snUlgs snf)NcPU"5nUbURRU5 ggr=)_storageremove)itemselfrefrNs r9_remove&WeakSequence.__init__.._remove&s&9D $$T* r;)weakrefrefrr)rN_WeakSequence__elementsrr8s r9ryWeakSequence.__init__#sE#*++d"3 +  9C 9CgGKK )   s AcvURR[R"XR55 gr=)rr0rrr)rNrs r9r0WeakSequence.append0s! W[[||<=r;c,[UR5$r=)r}rrMs r9r~WeakSequence.__len__3s4==!!r;c6SSUR55$)Nc3.# UH ocMUv M g7fr=r_).0rs r9 (WeakSequence.__iter__..7s ;CCC;s c3.# UH o"5v M g7fr=r_)rrs r9rr8s;]cCEE]srrMs r9rWeakSequence.__iter__6s ;T]];  r;c*URU"5$r=r)rNindexs r9rWeakSequence.__getitem__;s}}U#%%r;)rrN)r_)rz Sequence[_T]) rerfrgrhryr0r~rrrjr_r;r9rr"s  >" &r;rc"\rSrSrSSSjjrSrg)OrderedIdentitySeti?Nc[R"U5 [5UlU(aUHnUR U5 M ggr=)rryr_membersadd)rNiterableos r9ryOrderedIdentitySet.__init__@s6T"#    r;)rr=)rzOptional[Iterable[Any]])rerfrgrhryrjr_r;r9rr?s r;rc,\rSrSrSrSSjrSSjrSrg) PopulateDictiHzA dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. cXlgr=creator)rNr s r9ryPopulateDict.__init__Ps r;c0URU5=X'nU$r=r rNrXvals r9 __missing__PopulateDict.__missing__Ss,,s++ C r;r N)r zCallable[[_KT], _VT]rXrr`rrerfrgrhriryrrjr_r;r9rrHsr;rc,\rSrSrSrSSjrSSjrSrg) WeakPopulateDictiXzYLike PopulateDict, but assumes a self + a method and does not create a reference cycle. ctURUlURn[R"U5Ulgr=)__func__r __self__rrweakself)rNcreator_methodrs r9ryWeakPopulateDict.__init__^s*%.. !** H- r;cNURUR5U5=X'nU$r=r rrs r9rWeakPopulateDict.__missing__cs$,,t}}<< C r;rN)rztypes.MethodTyperrr_r;r9rrXs . r;rcf\rSrSr%SrSrS\S'S\S'S\S 'SSS jjrSS jrSS jr Sr g )UniqueAppenderiqzAppends items to a collection ensuring uniqueness. Additional appends() of the same object are ignored. Membership is determined by identity (``is a``) not equality (``==``). )rx_data_appender_unique&Union[Iterable[_T], Set[_T], List[_T]]rxzCallable[[_T], None]r!zDict[int, Literal[True]]r"NcXl0UlU(a[X5Ulg[ US5(a[ SU5R Ulg[ US5(a[ SU5RUlgg)Nr0rrzSet[_T])rxr"getattrr!hasattrrr0r)rNrxvias r9ryUniqueAppender.__init__~si   ")$"4D  T8 $ $"&z4"8"?"?D  T5 ! !"&y$"7";";D "r;cz[U5nX R;a!URU5 SURU'gg)NT)idr"r!)rNrid_s r9r0UniqueAppender.appends6h ll "    % $DLL  #r;c,[UR5$r=)r.rxrMs r9rUniqueAppender.__iter__sDIIr;)r!r"rxr=)rxr#r'z Optional[str])rr#r`rcr) rerfrgrhrirrryr0rrjr_r;r9r r qsF 4I 00(( %% " <4 < <% r;r c[U5S:Xa0[US[R5(a[ US5$[ SU5$)Nrr List[Any])r}r?types GeneratorTyperr)args r9coerce_generator_argr4s> 3x1}CFE,?,?@@CF|K%%r;cvUcU$[U5(dU/$[U[5(aU$[U5$r=)rr?r)xrs r9to_listr7s9y !! $ $s At  Awr;c.^[U4SjU55$)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. c3R># UHoR(dMUT;v M g7fr=)__hash__)riset_s r9r#has_intersection..s9(QjjyqDy(s' ')any)r<rs` r9has_intersectionr?s 9(9 99r;crUc [5$[U[5(d[[U55$U$r=)r,r?r7r6s r9to_setrBs.yu a  71:r;crUc [5$[U[5(d[[U55$U$r=) column_setr?r7rAs r9 to_column_setrEs0y| a $ $'!*%%r;c zUR5nU(aURU5 UR"S0UD6 U$)z5Copy the given dict and update with the given values.r_)rOr)r@_newkws r9 update_copyrIs/ A  HHNrN Hr;c## UHBn[U[5(d&[US5(a[U5ShvN M>Uv MD gN7f)zyGiven an iterator of which further sub-elements may also be iterators, flatten the sub-elements into a single iterator. rN)r?rdr&flatten_iterator)r6elems r9rKrKs@ $$$z)B)B'- - -J  -s:AA Ac\rSrSr%SrSrS\S'S\S'S\S 'SSS jjrS r\ SS j5r \ SSj5r SSSjjr SSjr S Sjr S!Sjr S"SjrS#SjrS$Sjr\S%Sj5rS&SjrSrg )'LRUCacheizDictionary 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_alertrq_counter_mutexrrOfloatrPz.Optional[Callable[[LRUCache[_KT, _VT]], None]]rQNcxXlX lX0lSUl[R "5Ul0Ulg)Nr)rOrPrQrR threadingLockrSrq)rNrOrPrQs r9ryLRUCache.__init__s/ ! "$ nn& <> r;cDU=RS- slUR$Nr)rRrMs r9 _inc_counterLRUCache._inc_counters  }}r;cgr=r_rs r9r LRUCache.gets.1r;cgr=r_rs r9rr^rr;cxURRU5nUbUR5USS'US$U$Nrr)rqrr[)rNrXrrs r9rr^ s@zz~~c"  **,DGAJ7NNr;cVURUnUR5USS'US$ra)rqr[)rNrXrs r9rLRUCache.__getitem__s.zz#&&(Q Awr;c,[UR5$r=)r.rqrMs r9rLRUCache.__iter__rr;c,[UR5$r=r|rMs r9r~LRUCache.__len__rr;c [R"URR5VVs0sH upXS_M snn5$s snnfrZ)typingrrqr)rNrr;s r9rLRUCache.values s<  djj6F6F6H!I6Hda!qT'6H!IJJ!IsA cdXUR5/4URU'UR5 gr=)r[rq _manage_sizerWs r9rVLRUCache.__setitem__#s,(9(9(;'<= 3 r;cURU gr=rp)rN _LRUCache__vs r9rLRUCache.__delitem__'rr;cNURURUR--$r=)rOrPrMs r9size_thresholdLRUCache.size_threshold*s}}t}}t~~===r;cURRS5(dg[UR5n[ U5UR UR UR --:aU(aSnURU5 [URR5[R"S5SS9nX R SHnURUS M [ U5UR UR UR --:aMURR5 g![a Muf=f!URR5 f=f)NFrbT)rXreverser)rSacquirerrQr}rOrPrrqroperator itemgetterrrelease)rNrQ by_counterrs r9rmLRUCache._manage_size.s{{""5))  "doo.Jd)dmmdmmdnn.LLL!&JOOD)#JJ%%' ++A.  '}}7D! JJtAw/8d)dmmdmmdnn.LLL KK   ! $! ! KK   !s0B*ED27E2 E<E?EEE)rRrqrSrOrQrP)dg?N)rOrrPrTrQzOptional[Callable[..., None]])rXr%r`z Optional[_VT])rXr%rUnion[_VT, _T]r`r~r=)rXr%rOptional[Union[_VT, _T]]r`r)rXr%r`r&)r`z Iterator[_KT]r)r`zValuesView[_VT]rb)rpr%r`rc)r`rTr)rerfrgrhrirrryr[rrrrr~rrVrpropertyrsrmrjr_r;r9rNrNsIM>>48 ? ? ?2 ?11 KK=A!9 !  K>>"r;rNc\rSrSrSSjrSrg)_CreateFuncTypeiFcgr=r_rMs r9__call___CreateFuncType.__call__Gsr;r_N)r`r'rerfrgrhrrjr_r;r9rrFs$r;rc\rSrSrSSjrSrg)_ScopeFuncTypeiJcgr=r_rMs r9r_ScopeFuncType.__call__Kssr;r_Nrarr_r;r9rrJs"r;rcv\rSrSr%SrSrS\S'S\S'S\S 'SS jrSS jrSS jr SS jr SSjr Sr g)ScopedRegistryiNaA 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]rrrrrc*XlX l0Ulg)a&Construct 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). Nr)rNrrs r9ryScopedRegistry.__init__cs%" r;cUR5nURU$![a, URRXR 55s$f=fr=)rrr setdefaultrrs r9rScopedRegistry.__call__tsPnn D==% % D==++C1BC C Ds!3AAc<UR5UR;$)z9Return True if an object is present in the current scope.)rrrMs r9hasScopedRegistry.has{s~~4==00r;c<XRUR5'g)z$Set the value for the current scope.N)rrrNrs r9r,ScopedRegistry.sets+. dnn&'r;c\URUR5 g![a gf=f)z Clear the current scope, if any.N)rrrrMs r9rScopedRegistry.clears,  dnn./   s  ++)rrrN)rCallable[[], _T]rzCallable[[], Any]r`r#r`rrr#r`rcr) rerfrgrhrirrryrrr,rrjr_r;r9rrNsI 6I##M*7H"D1 . r;rcJ\rSrSrSrS SjrS SjrS SjrS SjrSSjr Sr g )ThreadLocalRegistryizTA :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. cDXl[R"5Ulgr=)rrVlocalr)rNrs r9ryThreadLocalRegistry.__init__s$!) r;cURR$![a% UR5=oRlUs$f=fr=)rrYrr)rNrs r9rThreadLocalRegistry.__call__sA ==&& & (,(9 9C--%J s,AAc.[URS5$)NrY)r&rrMs r9rThreadLocalRegistry.hasst}}g..r;c$XRlgr=)rrYrs r9r,ThreadLocalRegistry.sets ! r;c>UR?g![a gf=fr=)rrYrrMs r9rThreadLocalRegistry.clears#  #   s  )rrN)rrrrrr) rerfrgrhriryrrr,rrjr_r;r9rrs  */"r;rc@SnUHnX1LdM US- nUS:dM g g)zjGiven a sequence and search object, return True if there's more than one, False if zero or one of them. rrTFr_)sequencetargetcrs r9 has_dupesrs0 A > FA1u  r;)r2r0r3r0r`r0)r@zMapping[_KT, _VT]r`zimmutabledict[_KT, _VT]r=)r3rr`r0)r6rrzOptional[List[Any]]r`r0)r<zContainer[Any]rz Iterable[Any]r`r)r6rr`zSet[Any])r@Dict[Any, Any]rGzOptional[Dict[Any, Any]]rHrr`r)r6z Iterable[_T]r`r)Wri __future__rrxrVr1rjrrrrrr 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:rAr>rCrkrlrnrrrrRrsort_dictionaryrrrrr,rD column_dictordered_column_setr r4r7r?rBrErIrKMutableMappingrNrrrrrr_r;r9rs&" $* ?;GG9;NK  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;