U [¹Öh}ã@sªddlmZddlZddlmZddlmZddlmZddlmZddlmZej rbd d l m Z Gd d „d ee e fƒZ Gd d„deeedfeede ffƒZdS)é)Ú annotationsN)ÚAny)ÚDict)ÚTuple)ÚUnioné)ÚLiteralé)Ú CacheConstc@s eZdZdZdddœdd„ZdS)Úprefix_anon_mapafA 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. Ústr©ÚkeyÚreturncCsB| dd¡\}}| |d¡}|d||<|›d|›}|||<|S)Nú r Ú_)ÚsplitÚget)ÚselfrÚidentZderivedZanonymous_counterÚvalue©rú=./venv/lib/python3.8/site-packages/sqlalchemy/sql/_py_util.pyÚ __missing__"s   zprefix_anon_map.__missing__N)Ú__name__Ú __module__Ú __qualname__Ú__doc__rrrrrr s r c@s4eZdZdZdZdddœdd„Zdd d œd d „Zd S)Úcache_anon_mapaUA 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. rrzTuple[str, bool])Úobject_rcCsXt|ƒ}||kr,||}|dk s$t‚|dfSt|jƒ||<}|jd7_|dfSdS)NTr F)ÚidÚAssertionErrorr Ú_index)rrZidselfZs_valZid_rrrÚget_anon;s zcache_anon_map.get_anonÚintr r cCs$t|jƒ||<}|jd7_|S)Nr )r r")rrÚvalrrrrHszcache_anon_map.__missing__N)rrrrr"r#rrrrrr+s  rzLiteral[CacheConst.NO_CACHE]T)Z __future__rÚtypingrrrrZ util.typingrZ TYPE_CHECKINGZ cache_keyr r r r$rrrrrÚs        ÿ