,hVSrSSKJr SSKJr SSKrSSKJr SSKrSSKJ 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 SSKJr SSKJr SSKJr SSK J!r! SSK J"r" SSK J#r# SSK$J%r% SS K$J&r& SS!K'J(r( SS"K)J*r* SS#K+J,r, SS$K+J-r- SS%K+J.r. SS&K+J/r/ SS'K+J0r0 SS(K+J1r1 SS)K+J2r2 SS*K+J3r3 SS+K+J4r4 SS,K+J5r5 SS-K+J6r6 SS.K+J7r7 SS/K+J8r8 SS0K9J:r: SS1K;Jr> SS4K;J?r? SS5K;J@r@ SS6K;JArA SS7K;JBrB SS8KJCrC S9S:KJDrD S9S;KJErE S9SKJIrI SS?KJJrJ SS@KJKrK SSAK+JLrL SSBK+JMrM SSCK;JNrN SSDK;JOrO SSEK;JPrP SSFKJQrQ SSGKJRrR SSHKJSrS S9SIKTJUrU S9SJKTJVrV S9SKKTJWrW S9SLKTJXrX S9SMKYJZrZ \"SNSOSP9r[S|S}SQjjr\S~SRjr]SSSjr^SSTjr_SSUjr`SVSVSVSVSVSW.SSXjjraSSYjrbSZrcS[rdS\reSS]jrfS^rgSS_jrhS`riSSajrjSbrkScrl"SdSe5rmSfrn"SgSh\m5ro"SiSj\p5rq"SkSl\m5rrSSmjrsSSSnjjrt\SSoj5ru\SSpj5ruSSqjruSSrjrv"SsSt\R5rx"SuSv\H5ry"SwSx\x5rzS|SSyjjr{SSzjr|SS{jr}g)z;High level utilities which build upon other modules here. ) annotations)dequeN)chain) AbstractSet)Any)Callable)cast) Collection)Dict)Iterable)Iterator)List)Optional)overload)Sequence)Tuple) TYPE_CHECKING)TypeVar)Union) coercions) operators)roles)visitorsis_text_clause)_deep_annotate)_deep_deannotate)_shallow_annotate)_expand_cloned) _from_objects) HasCacheKey) sort_tables) _find_columns)_label_reference)_textual_label_reference) BindParameter) ClauseElement) ColumnClause) ColumnElement)Grouping)KeyedColumnElement)Label) NamedColumn)Null)UnaryExpression)Column)Alias) FromClause) FromGrouping)Join) ScalarSelect) SelectBase) TableClause)_ET)exc)util)Literal)Protocol)_EquivalentColumnMap)_LimitOffsetType)_TypeEngineArgument)BinaryExpression) TextClause)_JoinTargetElement)_SelectIterable) Selectable)_TraverseCallableType)ExternallyTraversible)ExternalTraversal)_AnyExecuteParams)_AnyMultiExecuteParams)_AnySingleExecuteParams)_CoreSingleExecuteParams)Row_CEColumnElement[Any])boundc0[R"UUUUS9$)aCreate a join condition between two tables or selectables. e.g.:: join_condition(tablea, tableb) would produce an expression along the lines of:: tablea.c.id == tableb.c.tablea_id The join is determined based on the foreign key relationships between the two selectables. If there are multiple ways to join, or no way to join, an error is raised. :param a_subset: An optional expression that is a sub-component of ``a``. An attempt will be made to join to just this sub-component first before looking at the full ``a`` construct, and if found will be successful even if there are other ways to join to ``a``. This allows the "right side" of a join to be passed thereby providing a "natural join". )a_subsetconsider_as_foreign_keys)r5_join_condition)abrSrTs K/var/www/auris/envauris/lib/python3.13/site-packages/sqlalchemy/sql/util.pyjoin_conditionrY_s#8     !9  c[[U55n/n[U5H7upEUH,nURU5(dMUR U5 M. M9 U$)apGiven a list of FROM clauses and a selectable, return the first index and element from the list of clauses which can be joined against the selectable. returns None, None if no match is found. e.g.:: clause1 = table1.join(table2) clause2 = table4.join(table5) join_to = table2.join(table3) find_join_source([clause1, clause2], join_to) == clause1 )listr! enumerateis_derived_fromappend)clausesjoin_to selectablesidxifss rXfind_join_sourcergsV&}W-.K C'"A  ## 1 # JrZc[[U55n/n[U5H8upEUH-nURU5(dMUR U5 M6 M: [ U5S:af/nUHUnXnUHHn[ [U55R[U55(dM6UR U5 MS MW U(aU$U$)zGiven a list of FROM clauses and a selectable, return the indexes from the list of clauses which is derived from the selectable. r) r\r!r]r^r_lensetsurface_selectables intersection) r` join_fromrb liberal_idxrdrerfconservative_idxrcs rX#find_left_clause_that_matches_givenrps}Y/0KK'"A  ##""1%#" ;!C A *1-.;;'*%++C0 ! # # rZc "/n[[U55n[U5S:aUbSn[U5nOSnSn[ U5HupxUR U/5Hn U(a]Uce[UR 5RU R 5RU5(aURU5 M|MgUc[R"X5(dMURU5 M M [U5S:aQ[[UVs/sHn[UR5PM sn65n UVs/sHopUU ;dM UPM nnU(d Ub[[![U555$U$s snfs snf)aGiven a list of FROM clauses, a selectable, and optional ON clause, return a list of integer indexes from the clauses list indicating the clauses that can be joined from. The presence of an "onclause" indicates that at least one clause can definitely be joined from; if the list of clauses is of length one and the onclause is given, returns that index. If the list of clauses is more than length one, and the onclause is given, attempts to locate which clauses contain the same columns. rNTF)rjr!rir$r] differencecunion issupersetr_r5 _can_joinrr _hide_fromsr\range) r`raonclausercrbresolve_ambiguitycols_in_onclauserdrerftoremoves rXfind_left_clause_to_join_fromr}sb CmG,-K  7|aH0 (2!'"'',A '333qss8>>!##&112BCCJJqMD%)=)= 1 -# 3x!| 7C7aN1==17C D <#Q8!;q#< 8'E#g,'(( D q a e a f b q b e b f j r That is, every combination of "left" and "right" that doesn't further contain a binary comparison is passed as pairs. c32># [U[5(aUv gURS:Xa[R"UR 5(aTR SU5 T"UR5H(nT"UR5HnT"TSX5 M M* TRS5 UR5H nT"U5 M g[U[5(aUv UR5HnT"U5ShvN M gN 7f)Nbinaryr) isinstancer6__visit_name__r is_comparisonoperatorinsertleftrightpop get_childrenr))elementlrelemfnstackvisits rXr#visit_binary_product..visit-s g| , ,M  # #x /I4K4K   5 5  LLG $7<<(w}}-AuQx&.) IIaL,,.d /'<00 ,,. ;&&/&sDD D DN)rr(returnzIterator[ColumnElement[Any]])r\)rexprrrs` @@rXvisit_binary_productrs(N*,E''* t ErZF) check_columnsinclude_aliases include_joinsinclude_selects include_crudc`^/m0nU(aTR=US'US'U(aTRUS'U(aTR=US'=US'=US'US'U(aU4Sj=US '=US 'US 'U(a U4S jnXvS 'TRUS'[R"U0U5 T$)z1locate Table objects within the given expression.selectcompound_selectjoinaliassubquery tablesamplelateralc:>TRUR5$Nr_table)enttabless rXfind_tables..as cii0rZrupdatedeletec<>TRUR5 grr)columnrs rX visit_column!find_tables..visit_columnfs MM&,, 'rZrr)r_rtraverse) clauserrrrr _visitorsrrs @rX find_tablesrFs!#F79I=C]]J (i(9:"MM &$*== 1 ' 1Yz2 1Y 6 i  0 ( i1Ih4G (+(Ig fb), MrZcR[R"5n/n[U/5nU(Ga{UR5n[ U[ 5(Ga#[ U[ 5(a%[R"UR5(d[ U[5(a_[ UR[5(d@URn[ U[5(a URnURU5 M[ U[5(a URnURU5 GM[ U[ 5(aGM)XA;a"UR#U5 URU5 O(UR%5HnURU5 M U(aGM{U$)zmBreak up an 'order by' expression into individual column-expressions, without DESC/ASC/NULLS FIRST/NULLS LAST)r< column_setrpopleftrr*r0ris_ordering_modifiermodifierr-rr6r+r_r%r&addr)rcolsresultrtrss rXunwrap_order_byrqs/ ?? D F 6(OE  MMO a ' '1o..11!**==!U##J <--IIa** A QA/00II Q!688}  a ^^% Q&9 %< MrZcHSSjn[R"U0U5$)Nc~[U[5(a UR$[U[5(aS5eg)Nz&can't unwrap a textual label reference)rr%rr&)rkws rXreplace'unwrap_label_reference..replaces8 g/ 0 0?? " !9 : : BB B5rZ)rrHrrrOptional[ExternallyTraversible])rreplacement_traverse)rrs rXunwrap_label_referencers6&.1 (  ( ("g >>rZc UVs1sHnURb UROUiM nn[[UVs/sHn[ U5PM sn65nUVs/sH o"U;dM UPM sn$s snfs snfs snf)zGiven the columns clause and ORDER BY of a selectable, return a list of column expressions that can be added to the collist corresponding to the ORDER BY, without repeating those already in the collist. )_order_by_label_elementrr\rr)collistorder_bycolcols_already_presento to_look_fors rX expand_column_list_from_order_byrsC22> CG u8D8aq18DEFK& J;C5I*IC; JJ E Js%A1A6  A;(A;c6[U5H nX:XdM g g)zGiven a target clause and a second to search within, return True if the target is plainly present in the search without any subqueries or aliases involved. Basically descends through Joins. TF)rk)rsearchrs rXclause_is_presentrs $F+ >,rZc#&# [U[5(a;[UR5ShvN [UR5ShvN g[U[ 5(a[UR 5ShvN gUv gNZN?N7fr)rr5tables_from_leftmostrrr4r)rs rXrrse&$' 444' 555 FL ) )'777 557s3.BB B B 2BB B BBc#6# U/nU(aUR5nUv [U[5(a(URURUR 45 O0[U[ 5(aURUR5 U(aMgg7fr) rrr5extendrrr4r_rrrrs rXrkrksi HE yy{ dD ! ! LL$))TZZ0 1 l + + LL & %s BBBc## U/nU(aUR5n[U[[45(aUv [U[5(a(UR UR UR45 O{[U[5(aURUR5 OJ[U[5(a.URbURUR5 O Uv OUbUv U(aMgg7fr) rrr8r2r5rrrr4r_rr)rrs rXsurface_selectables_onlyrs HE yy{ d[%0 1 1J dD ! ! LL$))TZZ0 1 l + + LL & l + +zz% TZZ(  J %s C9C?=C?c$[[4n[U/5nU(aqUR5nXR;aURU$UR 5H&n[ XR5(aMURU5 M( U(aMqgr)r4r7rr _annotationsrrr_)rannotation_namefilter_rrsubs rXextract_first_column_annotationrs{Z(G 6(OE }} // /$$_5 5$$&C#'' LL ' % rZcl[[[U55R[U555$)z:Return True if left/right have some overlapping selectable)boolrjrkrl)rrs rXselectables_overlaprs0   %&334G4NO rZcL^/mU4Sjn[R"U0SU05 T$)zReturn an ordered list of "bound" values in the given clause. E.g.:: >>> expr = and_(table.c.foo == 5, table.c.foo == 7) >>> bind_values(expr) [5, 7] c<>TRUR5 gr)r_effective_value)bindvs rXvisit_bindparam$bind_values..visit_bindparams %%&rZ bindparam)rr)rrrs @rX bind_valuesr s- A' fb;"@A HrZcp[U[5(aURSS5nSU-$[U5$)N'z''z'%s')rstrrrepr)rs rX_quote_ddl_exprr s4'3//#t,G}rZcX\rSrSr%SrS\S'SrS\S'SrS\S'S rS\S 'SS jr S r g ) _repr_basei(rint_LISTr_TUPLEr:_DICT) max_charsrc[U5n[U5nX0R:a,URS-nUSUSX0R- --X$*S-nU$)Nr:rz# ... (%d characters truncated) ... )rrir)selfvaluereplenrepsegment_lengths rXtrunc_repr_base.trunc1sk5kS NN "!^^q0NAn%9.0 o&' (  rZN)rrrr) __name__ __module__ __qualname____firstlineno__r__annotations__rr __slots__r__static_attributes__rrZrXrr(s,E3NFCOE3NIN rZrcF[5nSUlURU5$)N,)rrr)rrps rX_repr_single_valuer As BBL 88E?rZc4\rSrSrSrSrSS SjjrS SjrSrg) _repr_rowiGzProvide a string view of a row.)rowcXlX lgr)r r)rr rs rX__init___repr_row.__init__Ls "rZc^URmSSRU4SjUR55<[UR5S:XaSOS<S3$)N(, c34># UH nT"U5v M g7frr.0rrs rX %_repr_row.__repr__..Ss9ueEllr,))rrr ri)rrs @rX__repr___repr_row.__repr__PsC  II99 9txx=A%C2 -  rZ)rr N)r)r zRow[Any]rrrr) rrrr__doc__rrrrrrZrXr r Gs)I# rZr c\rSrSrSSjrSrg)_long_statementiXc[U5nUS:aSnSnX- U- nUSUSUSX*S3$[RU5$)Nidr ... z characters truncated ... )rir__str__)rlselflleftlrightrs rXr'_long_statement.__str__YseD  3;EFMF*E%=/ug.,,0N+;=  ;;t$ $rZrNr)rrrrr'rrrZrXr"r"Xs %rZr"c\rSrSrSrSrSSSjjrSSjrSSjrSSjr SS jr SS jr SS jr SS jr S rg) _repr_paramsigzProvide a string view of bound parameters. Truncates display to a given number of 'multi' parameter sets, as well as long values to a given number of characters. )paramsbatchesismulti max_paramsNc@XlXPlX lX@lX0lgr)r.r0r/rr1)rr.r/r1rr0s rXr_repr_params.__init__qs   "$rZc rURcURUR5$[UR[5(a UR nOs[UR[ 5(a URnOG[UR[5(a URnOURUR5$UR(a[SUR5n[UR5UR:apSnSRURUSURS- U5SSX0R[UR54-URUSSU5SS45$URX!5$UR[S UR5U5$) NrKz8 ... displaying %i of %i total bound parameter sets ...  r:rrrL)r0rr.rr\rtuplerdictrr rir/r _repr_multir-)rtyp multi_paramsmsgs rXr_repr_params.__repr__sx << ::dkk* * dkk4 ( (**C  U + +++C  T * ***C::dkk* * <<( L 4;;$,,.Nxx((();4<>((bc):C@D   '' ::$$-KK  rZc^^U(a[US[5(a TRmO`[US[5(a TRmO;[US[ 5(a TR mOS[US5-5eSRUU4SjU55nOSnUTR:XaSU-$SU-$)NrzUnknown parameter type %src3H># UHnTRUT5v M g7fr)r-)rr. elem_typers rXr+_repr_params._repr_multi..s$!CO!!&)44# UHupU<ST"U53v M g7fz: Nrrkeyrrs rXr0_repr_params._repr_param_dict..)&7 gRe ~.&7 r& parameters truncated ... z%s}c3D># UHupU<ST"U53v M g7frTrrUs rXrrWs)&8 gRe ~.&8rYz{%s}c3D># UHupU<ST"U53v M g7frTrrUs rXrrWrXrY)rrJitemsrrr.items_first_batchitems_second_batchtrunclentextrs @rXrN_repr_params._repr_param_dicts    flln -      &7D eH:%?@ @D E &8 D  &7D  rZcV^URmURU5unnnU(aKSSRU4SjU55-nUSUS3- nUSRU4SjU55<S3- nU$SSRU4S jU55<[U5S :XaS OS <S3nU$) Nz(%src34># UH nT"U5v M g7frrrs rXr1_repr_params._repr_param_tuple.. F4E5%,,4Err&rZc34># UH nT"U5v M g7frrrs rXrrfG4F5%,,4Frrrc34># UH nT"U5v M g7frrrs rXrrfrgrrrr)rrJrrir^s @rXrO_repr_params._repr_param_tuples    f %      F4EFFD eH:%?@ @D  G4FGG D   F4EFF,-2:D rZc(^URmURU5unnnU(aJSSRU4SjU55-nUSUS3- nUSSRU4SjU55-- nU$SSRU4S jU55-nU$) Nz[%src34># UH nT"U5v M g7frrrs rXr0_repr_params._repr_param_list..$rgrr&rZz%s]c34># UH nT"U5v M g7frrrs rXrrn(rirrCc34># UH nT"U5v M g7frrrs rXrrn,rgr)rrJrr^s @rXrP_repr_params._repr_param_lists    f %      F4EFFD eH:%?@ @D E G4FGG D  F4EFFD rZ)r/r0rr1r.)r%rN) r.zOptional[_AnyExecuteParams]r/rr1rrrr0zOptional[bool]r)r<rKr;rrr)r.z Iterable[Any]rr)r.rLr;rrr)r.rMrr)r.rMrr)r.rLrr)rrrrr rrrr:rJr-rNrOrPrrrZrXr-r-gs=I "& %+ % % %  %  %+Z%,%% %8 ' 1' 1 1 1>0rZr-cD^U4Sjn[R"U0SU05$)zOgiven criterion containing bind params, convert selected elements to IS NULL. c>[UR[5(aeURRT;aKURUl[ 5Ul[ RUl[ RUl g[UR[5(aUURRT;a:[ 5Ul[ RUl[ RUl gggr) rrr'_identifying_keyrr/ris_ris_notnegate)rnullss rX visit_binary-adapt_criterion_to_null..visit_binary7s v{{M 2 2 ,,5!,,FK6FL'mmFO%,,FM v||] 3 3 --66FL'mmFO%,,FM 7 4rZr)rcloned_traverse)critrxrys ` rXadapt_criterion_to_nullr}1s$ -$  # #D"x.F GGrZcUcU$US4/n[U5nSnU(aUR5up[U[5(aRXLaNUR 5nUR UR 5UlURURU45 OUR U5nUb UceXlUcUnU(aMU$r) ClauseAdapterrrr5_clonerryr_r)rrstop_onradapterret prevrights rX splice_joinsrLs  | AF ED!G C "YY[ eT " "u';LLNE$--enn=EN LL%**e, -$$U+E  $ $$"N ;C % JrZcgrrcolumnsr`rs rXreduce_columnsris $'rZcgrrrs rXrrqs 7:rZc<^ ^ ^ URSS5nURSS5m [R"U5nURSU55m [R"5m T Hn[ UR Vs/sHofRPM sn6HlnT HcnXeLaM URnURU5(dM.T (aURUR:XdMQT RU5 Mj Mn M U(a0U U U 4Sjn UH"n U cM[R "U 0SU 05 M$ URT 5$s snf![Ra U(aMe[Ra U(aMef=f)agiven a list of columns, return a 'reduced' set based on natural equivalents. the set is reduced to the smallest list of columns which have no natural equivalent present in the list. A "natural equivalent" means that two columns will ultimately represent the same value because they are related by a foreign key. \*clauses is an optional list of join clauses which will be traversed to further identify columns that are "equivalent". \**kw may specify 'ignore_nonexistent_tables' to ignore foreign keys whose tables are not yet configured, or columns that aren't yet present. This function is primarily used to determine the most minimal "primary key" from a selectable, by reducing the set of primary key columns present in the selectable to just those that are not repeated. ignore_nonexistent_tablesF only_synonymsc3J# UHn[U5(dMUv M g7frr)rrss rXr!reduce_columns..sNa!2:s# #c>UR[R:Xa[R"[ TR T5Vs/sHoRPM sn65nURU;aURU;as[T5HcnURUR5(dM%T(a&URURR:XdMRTRU5 g ggggs snfr)rreqr<rrrr proxy_setrrreversedshares_lineagenamer)rrsr cset_no_textomitrs rXry$reduce_columns..visit_binarys),,./;/F/Ft/LM/L!++/LM ;;$&6<<4+?%l3++FLL99 -6;;;K;K1K HHQK! 4,@& /NsC; r)rr< OrderedSetrrrrr foreign_keysrr;NoReferencedColumnErrorNoReferencedTableErrorrrrrr)rr`rrrrrsfkfk_colryrrrrs @@@rXrrysl0!#'BE JFF?E2M)J8B8M8MNN9L ?? D#--@-Q..-@AB!8YYF((++%388);HHSM/"B6 "F!!!&"x.FG   &&_A 221 111  sE + EF ;F F c^^^^^T(aT(a[R"S5eSmUUUUU4Sjn/m[R"U0SU05 T$)z9traverse an expression and locate binary criterion pairs.zSCan only specify one of 'consider_as_foreign_keys' or 'consider_as_referenced_keys'c$URU5$r)compare)rVrWs rXcol_is"criterion_as_pairs..col_issyy|rZc >T(dUR[RLag[UR[ 5(a[UR [ 5(dgT(aURT;aZT"UR UR5(dUR T;a(TRUR UR45 gUR T;a[T"URUR 5(dURT;a(TRURUR 45 gggT(aURT;aZT"UR UR5(dUR T;a(TRURUR 45 gUR T;a[T"URUR 5(dURT;a(TRUR UR45 ggg[UR[5(a[UR [5(aURRUR 5(a(TRUR UR45 gUR RUR5(a(TRURUR 45 ggggr) rrrrrr*rr_r1 references)r any_operatorrrTconsider_as_referenced_keyspairss rXry(criterion_as_pairs..visit_binarysy|| C &++}55Z LL-> >   #{{66v||V[[11<<'?? fllFKK89!99v{{FLL11;;&>> fkk6<<89?: ){{99v||V[[11<<'BB fkk6<<89!<<v{{FLL11;;&AA fllFKK89B= &++v..: f44;;))&,,77LL&,, !<=\\,,V[[99LL&++v||!<=: 4.rZr)r; ArgumentErrorrr) expressionrTrrryrrs ``` @@rXcriterion_as_pairsrsX $? ,  %>%>NBDE j"x&>? LrZc\rSrSrSrSrS SSjjr\(a\SSj5r \SSj5r SSjr \ R4S jr \ R"S 5SSS jj5rS rg)ri a Clones and modifies clauses based on column correspondence. E.g.:: table1 = Table( "sometable", metadata, Column("col1", Integer), Column("col2", Integer), ) table2 = Table( "someothertable", metadata, Column("col1", Integer), Column("col2", Integer), ) condition = table1.c.col1 == table2.c.col1 make an alias of table1:: s = table1.alias("foo") calling ``ClauseAdapter(s).traverse(condition)`` converts condition to read:: s.c.col1 == table2.c.col1 )__traverse_options__ selectable include_fn exclude_fn equivalentsadapt_on_namesadapt_from_selectablesNcU/US.UlXlX0lX@l[R "U=(d 05UlXPlXplg)N)ranonymize_labels) rrrrr< column_dictrrr)rrrrrrrrs rXrClauseAdapter.__init__5sK#| 0% !%$$++K,=2>,&<#rZcgrrrobjs rXrClauseAdapter.traverseLs8;rZcgrrrs rXrrWs-0rZcgrrrs rXrrZs.1rZcURRXS9nUcRXR;aCX;a>URUH+nURUUUR U/5S9nUcM)Us $ UR (aGUcD[ U[5(a/URRRUR5nU$)Nrequire_embedded)r_seen) rcorresponding_columnr_corresponding_columnrtrrr.exported_columnsgetr)rrrrnewcolequivs rXr#ClauseAdapter._corresponding_column^s55 6  >c%5%55#:J))#.33%5++se,4 %!M/   3 ,,__5599#((CF rZzsqlalchemy.sql.functionsct[RRnUR(aURU5(dgUR(aUR U5(ag[ U[ 5(a[ XR5(dURRU5(aTUR(a7URH&nURU5(dM UR$ gUR$[ U[5(a![ UR[5(aU$g[ U[5(dgU(dUR(agSUR ;aUR Sn["(a[ U[$5(deUR(aBXR&;a3URH"nUR(R+US5cM" O g["(a[ U[$5(deUR-USS9$)N adapt_columnFTr)r< preloaded sql_functionsrrrr3FunctionElementrr^rr2rr8r*_is_singleton_constantrrr,rrsrr)rr_include_singleton_constants functionsadps rXrClauseAdapter.replacevsNN00  ??4??3#7#7 __!5!5 c: & &z **0 0 ..s33..#::..s33!& ; $&C''J [-- C//-#2L2L S-- -"">2C =c#566 66  & &36F6F+F2255--c59E3 =c#566 66)) $*  rZ)rrrrrrr)NNNFFN)rrFrOptional[_EquivalentColumnMap]r)Optional[Callable[[ClauseElement], bool]]rrrrrrr!Optional[AbstractSet[FromClause]]rz Literal[None]rNonerr9rr9rrrr)F)rr9rrrz Optional[_ET])rrrrr rrrrrr< EMPTY_SETrpreload_modulerrrrZrXrr s<I7;@D@D$!&DH==4=> = > =  ==!B=* ; ; 0 0 26 2 , 2 ,0>>0 34=BF F 6:F F 5F rZrcn\rSrSr\S Sj5r\S Sj5r\S Sj5r\S Sj5rS SjrSrg) _ColumnLookupicgrrrrVs rX __getitem___ColumnLookup.__getitem__s.1rZcgrrrs rXrrsHKrZcgrrrs rXrrsJMrZcgrrrs rXrrs,/rZcgrrrs rXrrsCrZrN)rVrrr)rVColumnClause[Any]rr)rVrPrrP)rVr9rr9)rVrrr)rrrrrrrrrZrXrrs= 11 KK MM ///rZrc<^\rSrSr%SrSrS\S'SSU4Sjjjr"SS5rS r \ SS j5r \ SS j5r SS jr SU4S jjr \ (a \SSj5r\ r\R$rSSjrSSjrSrU=r$) ColumnAdapteria+Extends ClauseAdapter with extra utility functions. Key aspects of ColumnAdapter include: * Expressions that are adapted are stored in a persistent .columns collection; so that an expression E adapted into an expression E1, will return the same object E1 when adapted a second time. This is important in particular for things like Label objects that are anonymized, so that the ColumnAdapter can be used to present a consistent "adapted" view of things. * Exclusion of items from the persistent collection based on include/exclude rules, but also independent of hash identity. This because "annotated" items all have the same hash identity as their parent. * "wrapping" capability is added, so that the replacement of an expression E can proceed through a series of adapters. This differs from the visitor's "chaining" feature in that the resulting object is passed through all replacing functions unconditionally, rather than stopping at the first one that returns non-None. * An adapt_required option, used by eager loading to indicate that We don't trust a result row column that is not translated. This is to prevent a column from being interpreted as that of the child row in a self-referential scenario, see inheritance/test_basic.py->EagerTargetingTest.test_adapt_stringency )radapt_requiredallow_label_resolve_wrap __weakref__rrc  >[T U]UUUUUUU S9 [R"UR5UlUR (dUR(a URXR 5UlX0l Xpl SUl g)N)rrrrr) superrr<WeakPopulateDict _locate_colrrr_IncludeExcludeMappingrrr) rrrrrrrrrr __class__s rXrColumnAdapter.__init__s|   !!)-#9  ,,T-=-=> ??doo66t\\JDL,#6  rZc \rSrSrSrSrSrg)$ColumnAdapter._IncludeExcludeMappingicXlX lgr)parentr)rrrs rXr-ColumnAdapter._IncludeExcludeMapping.__init__s  K"LrZcURR(a URRU5(a;URR(a`URRU5(a@URR(a#URRRU$U$URU$r)rrrrrrs rXr0ColumnAdapter._IncludeExcludeMapping.__getitem__s &&t{{/E/Ec/J/J++((T[[-C-CC-H-H;;$$;;,,44S99J<<$ $rZ)rrN)rrrrrrrrrZrXrrs  # %rZrc [R"U5nXl[R"UR5UlUR (dUR(a URX"R 5UlU$r) copyrr<rrrrrr)rracs rXwrapColumnAdapter.wrap%sR YYt_**2>>: ==BMM44RDBJ rZcgrrrs rXrColumnAdapter.traverse.s47rZcgrrrs rXrr1s),rZc URU$r)rrs rXrr4s||C  rZcP>[U[5(de[TU] U5$r)rrrr)rvisitorrs rXrColumnAdapter.chain9s%'=1111w}W%%rZcgrr)rs rXvisitor_iteratorColumnAdapter.visitor_iterator@s?BrZcTURUnX!LaURUS5cgU$)NT)rr)rrrs rXadapt_check_present!ColumnAdapter.adapt_check_presentFs1c" =T77TBJ rZc`UR(a+URHnURUSS9nUcM O UnO[R X5nUR (a UR R U5nUbUnUR(aX1LagX1LaURUl U$)NT)r) _is_immutabler rrrrrrr_allow_label_resolve)rrvisrsc2s rXrColumnAdapter._locate_colPs   ,,KK$KG=- &&t1A ::''*B~   18 <%)%=%=A "rZ)rrrr)NFNNFTFN)rrFrrrrrrrrrrrrrrrrrrr)rrIrr)rzIterator[ColumnAdapter])rrPrOptional[ColumnElement[Any]])rrrrr rrrrrrrrrpropertyr  adapt_clausercopy_and_process adapt_listr rr __classcell__)rs@rXrrs-<I 7;$@D@D$$(!&DH4  >  > "!B: % %77 ,,!2! (! &  B BL//J% %*%* %**rZrcJ[R"[RXUS9$)zConvert the given value to an "offset or limit" clause. This handles incoming integers and converts to an expression; if an expression is already given, it is passed through. )rtype_)rexpectrLimitOffsetRole)rrrs rX_offset_or_limit_clauser}s$    w rZctUcg[US5(a"URn[R"U5$U$)z\Return the offset or limit clause as a simple integer if possible, else return the clause. N_limit_offset_value)hasattrr r<asint)rrs rX)_offset_or_limit_clause_asint_if_possibler#s9~v,--**zz%   rZc.UbFUbC[U5nUcSnUS:waX-nUS:XaSnOUce[U5n[X2- 5nX4$UcUb[U5nX4$Ub3Uc0[U5nUcSnUS:waX-nUS:XaSnX4$[U5nX4$)z0Compute LIMIT/OFFSET in terms of slice start/endNr)r#r) limit_clause offset_clausestartstops rX _make_slicer)s T-A    M A:)1M A  M , ,,3MBM.t|< &  &&# 4+.t4  &&  t|A    M A:)1M A  M  &&4MBM  &&rZ)NN) rVr3rWr3rSOptional[FromClause]rTz(Optional[AbstractSet[ColumnClause[Any]]]rzColumnElement[bool])r`zList[FromClause]rar3r List[int])r`Sequence[FromClause]rmr3rr+)r`r,rarDryrrr+)rzOCallable[[BinaryExpression[Any], ColumnElement[Any], ColumnElement[Any]], None]rrPrr)rr(rrrrrrrrrrrzList[TableClause])rrrr)rr3rzIterator[FromClause])rr(rzIterator[ClauseElement])rr3rr3rr)r|rOrxzCollection[Any]rrOr)rr*rr*rr*rr*)rzIterable[ColumnElement[Any]]r`Optional[ClauseElement]rrrzSequence[ColumnElement[Any]])rrEr`r-rrrz/Sequence[Union[ColumnElement[Any], TextClause]])rrEr`r-rrrz1Collection[Union[ColumnElement[Any], TextClause]])NNF)rr@rz Optional[str]rz"Optional[_TypeEngineArgument[int]]rzColumnElement[int])rr@rr@) r%r@r&r@r'rr(rrzATuple[Optional[ColumnElement[int]], Optional[ColumnElement[int]]])~r  __future__r collectionsrr itertoolsrtypingrrrr r r r r rrrrrrrrrrrrr_typingr annotationrrrbaser r! cache_keyr"ddlr#rEr$r%r&r'r(r)r*r+r,r-r.r/r0schemar1rr2r3r4r5r6r7r8r9r;r< util.typingr=r>r?r@rArBrCrDrErFrGrHrIengine.interfacesrJrKrLrM engine.rowrNrOrYrgrpr}rrrrrrrrkrrrrrrr r rr"r-r}rrrReplacingExternalTraversalrrrrr#r)rrZrXr<s!#   #8<> 1+4&.##"#(!%"$$"#!" -),*$.+&//+5:;<  e/0 &*IM !!!#!G !  !H (28) !).8))X6 !6 6+6 6r? ?  ?  ?J !!( (( (  (  (((V,^ ?K"  '&  &2   " %c %G:GTH<%)  " : ' )'%' '" ' ' : :%: :5 : :Q' Q'%Q' Q'7 Q'l" $ <~q H77q h 0H 0 jMj^04      .       2'"2'#2' 2'  2' G 2'rZ