+ }j{ ^RIHt^RIt^RIHt^RIHt^RIHt^RIHt^RIHt]P'd^RI H t !R R ]] ] 3,4t !R R ]]]R 3,]]R,] 3,3,4tR#)) annotationsN)Any)Dict)Tuple)Union)Literal) CacheConstc&]tRt^tRtRRltRtR#)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. c V^8dQhRRRR/#)keystrreturn)formats"X/home/luca/screen-checking/.venv/lib/python3.14/site-packages/sqlalchemy/sql/_py_util.py __annotate__prefix_anon_map.__annotate__"sssc ~VPR^4wr#VPV^4pV^,W&V RV 2pWPV&V#) _)splitget)selfridentderivedanonymous_countervalues&& r __missing__prefix_anon_map.__missing__"sO3* HHWa0)A- )1./0S  rrN)__name__ __module__ __qualname____firstlineno____doc__r!__static_attributes__rrrr r s rr c6]tRt^+tRt^tRRltRRltRtR#)cache_anon_mapaAA 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. c V^8dQhRRRR/#)r object_rrzTuple[str, bool]r)rs"rrcache_anon_map.__annotate__;s   (8 rc \V4pW 9dW,pVRJgQhVR3#\VP4;W&pV;P^, unVR3#)TF)idr_index)rr,idselfs_valid_s&& rget_anoncache_anon_map.get_anon;s^G >LE$ $$$; "%T[[!1 1DL3 KK1 K: rc V^8dQhRRRR/#)r rintrrr)rs"rrr-Hsssrc j\VP4;W&pV;P^, unV#))rr0)rrvals&& rr!cache_anon_map.__missing__Hs*dkk** C q  rrN) r#r$r%r&r'r0r4r!r(rrrr*r*+s F rr*zLiteral[CacheConst.NO_CACHE]T) __future__rtypingrrrr util.typingr TYPE_CHECKING cache_keyr rr r7r*rrrrAso# ! %d38n* s22 3U74=#;M5N NO r