,h} SSKJr SSKrSSKJr SSKJr SSKJr SSKJr SSKJr \R(aS S K J r "S S \\ \ 45r "S S\\\S4\\S\ 445rg)) annotationsN)Any)Dict)Tuple)Union)Literal) CacheConstc"\rSrSrSrSSjrSrg)prefix_anon_mapaNA map that creates new keys for missing key access. Considers keys of the form " " to produce new symbols "_", where "index" is an incrementing integer corresponding to . Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which is otherwise usually used for this type of operation. cvURSS5up#URUS5nUS-X'USU3nXPU'U$)N r _)splitget)selfkeyidentderivedanonymous_countervalues O/var/www/auris/envauris/lib/python3.13/site-packages/sqlalchemy/sql/_py_util.py __missing__prefix_anon_map.__missing__"sP99S!, HHWa0)A- )1./0S  N)rstrreturnr)__name__ __module__ __qualname____firstlineno____doc__r__static_attributes__rrrr r s  rr c0\rSrSrSrSrSSjrS SjrSrg) cache_anon_map+aAA map that creates new keys for missing key access. Produces an incrementing sequence given a series of unique keys. This is similar to the compiler prefix_anon_map class although simpler. Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which is otherwise usually used for this type of operation. rc[U5nX ;aXnUSLdeUS4$[UR5=X'nU=RS- slUS4$)NTr F)idr_index)robject_idselfs_valid_s rget_anoncache_anon_map.get_anon;s^G >LE$ $$$; "%T[[!1 1DL3 KK1 K: rcb[UR5=X'nU=RS- slU$)Nr )rr,)rrvals rrcache_anon_map.__missing__Hs*dkk** C q  rrN)r-rr zTuple[str, bool])rintr r) r!r"r#r$r%r,r1rr&rrrr(r(+s F rr(zLiteral[CacheConst.NO_CACHE]T) __future__rtypingrrrr util.typingr TYPE_CHECKING cache_keyr rr r6r(rrrr<sl# ! %d38n* s22 3U74=#;M5N NO r