L i$dZddlmZddlmZddlZddlmZddlZddlm Z ddlm Z ddlm Z dd lm Z dd lm Z dd lmZdd lmZdd lmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddlmZddl m!Z!ddl m"Z"ddl m#Z#ddl$m%Z%dd l$m&Z&dd!l'm(Z(dd"l)m*Z*dd#l+m,Z,dd$l+m-Z-dd%l+m.Z.dd&l+m/Z/dd'l+m0Z0dd(l+m1Z1dd)l+m2Z2dd*l+m3Z3dd+l+m4Z4dd,l+m5Z5dd-l+m6Z6dd.l+m7Z7dd/l+m8Z8dd0l9m:Z:dd1l;mZ>dd4l;m?Z?dd5l;m@Z@dd6l;mAZAdd7l;mBZBdd8lmCZCd9d:lmDZDd9d;lmEZEd9dlmIZIdd?lmJZJdd@lmKZKddAl+mLZLddBl+mMZMddCl;mNZNddDl;mOZOddEl;mPZPddFlmQZQddGlmRZRddHlmSZSd9dIlTmUZUd9dJlTmVZVd9dKlTmWZWd9dLlTmXZXd9dMlYmZZZedNdOPZ[ d| d}dQZ\ d~dRZ] ddSZ^ ddTZ_ ddUZ`dVdVdVdVdVdW ddXZaddYZbdZZcd[Zdd\Zedd]Zfd^Zgdd_Zhd`ZiddaZjdbZkdcZlGdddeZmdfZnGdgdhemZoGdidjepZqGdkdlemZrddmZs d ddnZte ddoZue ddpZu ddqZu ddrZvGdsdtejZxGdudveHZyGdwdxexZz d| ddyZ{ ddzZ| dd{Z}y)z9High 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])boundc4tj||||S)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 Y/mnt/ssd/data/python-lab/Trading/venv/lib/python3.12/site-packages/sqlalchemy/sql/util.pyjoin_conditionrY]s#8     !9  ctt|}g}t|D]/\}}|D]%}|j|s|j |'1|S)aGiven 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_sourcergs_&}W-.K C'"1 A  # 1   JrZcztt|}g}t|D]0\}}|D]&}|j|s|j |02t |dkDrXg}|D]M}||}|D]A}t t|jt|s0|j |MO|r|S|S)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'" 1 A  #""1%  " ;! C A  *1-.;;'*%++C0    # # rZc g}tt|}t|dkDr|d}t|}nd}d}t |D]\}}|j |gD]} |rU|Jt|j j| j j|sG|j|r|tj|| ss|j|t|dkDrItt|Dcgc]}t|jc}} |Dcgc] }||| vs |}}|s|tt!t|S|Scc}wcc}w)a Given 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}s_ CmG,-K  7|aH0 (2!'" 1'', A '333qss8>>!##&112BCJJqM%1)= 1    3x!| 7CaN1==1C 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. c3Kt|tr|y|jdk(rtj|j r|j d||jD]&}|jD]}d||(jd|jD] }| yt|tr||jD]}|Ed{y7w)Nbinaryr) isinstancer6__visit_name__r is_comparisonoperatorinsertleftrightpop get_childrenr))elementlrelemfnstackvisits rXrz#visit_binary_product..visit+s g| ,M  # #x /I4K4K   5  LLG $7<<( 'w}}-'AuQxA&' ' IIaL,,. d  '<0 ,,. ' ;&& '&sC2C?5C=6C?N)rr(returnzIterator[ColumnElement[Any]])r\)rexprrrs` @@rXvisit_binary_productrs#N*,E'* t ErZF) check_columnsinclude_aliases include_joinsinclude_selects include_crudc*gi}|rjx|d<|d<|rj|d<|rjx|d<x|d<x|d<|d<|rfdx|d <x|d <|d <|r fd }||d <j|d<tj|i|S)z1locate Table objects within the given expression.selectcompound_selectjoinaliassubquery tablesamplelateralc:j|jSNr_table)enttabless rXzfind_tables.._s cii0rZrupdatedeletec<j|jyrr)columnrs rX visit_columnz!find_tables..visit_columnds MM&,, 'rZrr)r_rtraverse) clauserrrrr _visitorsrrs @rX find_tablesrDs!#F79I=C]]J (i(9:"MM &$*== 1 ' 1Yz2 1Y 6 i  0 ( i1Ih4G (+ (Ig fb), MrZctj}g}t|g}|rC|j}t |t rt |t rtj|jst |trTt |jts:|j}t |tr |j}|j|t |tr|j}|j|t |t r||vrI|j#||j|n&|j%D]}|j||rC|S)zqBreak 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_byros ?? D F 6(OE  MMO a '1o.11!**=!U#J <-IIa* A QA/0II Q!68}  a ^^%  Q 9 < MrZcD dd}tj|i|S)Ncjt|tr |jSt|trJdy)Nz&can't unwrap a textual label reference)rr%rr&)rkws rXreplacez'unwrap_label_reference..replaces2 g/ 0?? " !9 : BB B5rZ)rrHrrrOptional[ExternallyTraversible])rreplacement_traverse)rrs rXunwrap_label_referencers6&.1 (  ( ("g >>rZc |Dchc]}|j |jn|}}tt|Dcgc] }t |c}}|Dcgc] }||vs| c}Scc}wcc}wcc}w)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_byrs~ 22> CG u8Daq1DEFK& JC#5I*IC JJ E Js!A%A*  A/A/c2t|D] }||k(s yy)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+ T>rZc#Kt|tr;t|jEd{t|jEd{yt|t rt|j Ed{y|y7U7:7wr)rr5tables_from_leftmostrrr4r)rs rXrrsb&$' 444' 555 FL )'777 557s3)BBBB -B6B7 BBBc# K|g}|r{|j}|t|tr(|j|j|j fn+t|t r|j|j|rzyywr) rrr5extendrrr4r_rrrrs rXrkrksb HE yy{ dD ! LL$))TZZ0 1 l + LL & s A?BBc#K|g}|r|j}t|ttfr|t|tr(|j |j |jfnot|tr|j|jnCt|tr-|j|j|jn |n|||ryywr) rrr8r2r5rrrr4r_rr)rrs rXsurface_selectables_onlyrs HE yy{ d[%0 1J dD ! LL$))TZZ0 1 l + LL & l +zz% TZZ(  J s CCCcttf}t|g}|rc|j}||jvr|j|S|j D] }t ||r|j|"|rcyr)r4r7rr _annotationsrrr_)rannotation_namefilter_rrsubs rXextract_first_column_annotationrsZ(G 6(OE }} d// /$$_5 5$$& C#w' LL    rZclttt|jt|S)z:Return True if left/right have some overlapping selectable)boolrjrkrl)rrs rXselectables_overlaprs0   %&334G4NO rZcHgfd}tj|id|iS)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<j|jyr)r_effective_value)bindvs rXvisit_bindparamz$bind_values..visit_bindparams %%&rZ bindparam)rr)rrrs @rX bind_valuesr s- A' fb;"@A HrZcft|tr|jdd}d|zSt|S)N'z''z'%s')rstrrrepr)rs rX_quote_ddl_exprrs1'3//#t,G}rZcNeZdZUdZded<dZded<dZded<dZded <d d Zy ) _repr_baserint_LISTr_TUPLEr:_DICT) max_charsrct|}t|}||jkDr.|jdz}|d|d||jz zz|| dz}|S)Nr:rz# ... (%d characters truncated) ... )rrir)selfvaluereplenrepsegment_lengths rXtruncz_repr_base.trunc/sq5kS DNN "!^^q0NAn%9.0 ~o&' (  rZN)rrrr) __name__ __module__ __qualname__r__annotations__rr __slots__rrZrXrr&s,E3NFCOE3NIN rZrcFt}d|_|j|S)N,)rrr)rrps rX_repr_single_valuer?s BBL 88E?rZc&eZdZdZdZdddZddZy) _repr_rowzProvide a string view of a row.)rowc ||_||_yr)rr)rrrs rX__init__z_repr_row.__init__Js"rZc|jddjfd|jDt|jdk(rddSddS)N(, c3.K|] }|ywrr.0rrs rX z%_repr_row.__repr__..Qs9ueEl9r,))rrrri)rrs @rX__repr__z_repr_row.__repr__NsQ  II99 9txx=A%C -  +- -  rZN)r)rzRow[Any]rrrr)rrr__doc__rrrrrZrXrrEs)I# rZrceZdZddZy)_long_statementct|}|dkDrd}d}||z |z }|d|d|d|| dStj|S)Nidr ... z characters truncated ... )rir__str__)rlselflleftlrightrs rXrz_long_statement.__str__WsiD  3;EFEMF*E%=/ug.,,0&N+;=  ;;t$ $rZNr)rrrrrrZrXrrVs %rZrceZdZdZdZ d d dZddZ ddZddZ ddZ dd Z dd Z dd Z y) _repr_paramszProvide 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_paramsNcJ||_||_||_||_||_yr)r"r$r#rr%)rr"r#r%rr$s rXrz_repr_params.__init__os'   "$rZc J|j|j|jSt|jtr |j }nit|jt r |j}nBt|jtr |j}n|j|jS|jrtd|j}t|j|jkDrqd}dj|j|d|jdz |dd||jt|jfz|j|dd|ddfS|j||S|jtd |j|S) NrKz8 ... displaying %i of %i total bound parameter sets ...  r:rrrL)r$rr"rr\rtuplerdictrr rir#r _repr_multir!)rtyp multi_paramsmsgs rXrz_repr_params.__repr__}ss << ::dkk* * dkk4 (**C  U +++C  T ***C::dkk* * <<( L 4;;$,,.Nxx((();4<>((bc):C@D   '' c::$$-KK  rZcd|rt|dtr jnVt|dtr jn6t|dt r j nJdt|dzdjfd|D}nd}|jk(rd|zSd|zS)NrzUnknown parameter type %sr c3BK|]}j|ywr)r!)r r" elem_typers rXrz+_repr_params._repr_multi..s#!9?!!&)4!sr[%s]z(%s)) rr\rr+rr,rtyper)rr/r.elementsr3s` @rXr-z_repr_params._repr_multis ,q/40 JJ LOU3 KK LOT2 JJ 9a)uyy!CO!HH $** H$ $H$ $rZct|}t|}||jkDr(|jdz}|d||| d||jz fS|ddfS)Nr:r)r\rir%)rr"lparams lenparamsrs rX _get_batchesz_repr_params._get_batchessiv,L t &OOq(E%  DOO+  D$& &rZc||jur|jtd|S||jur|j td|S|j |S)NrM Sequence[Any])r_repr_param_dictr r_repr_param_tuple_repr_param_list)rr"r.s rXr!z_repr_params._repr_paramsse $** ((/8 DKK ))$*GH H((0 0rZc4|j|j|j\}}}|rHddjfd|Dz}|d|dz }|ddjfd|Dzz }|Sddjfd |Dz}|S) Nz{%sr c3>K|]\}}|d|ywz: Nrr keyrrs rXrz0_repr_params._repr_param_dict..,"UgRe ~.r parameters truncated ... z%s}c3>K|]\}}|d|ywrBrrCs rXrz0_repr_params._repr_param_dict..rErFz{%s}c3>K|]\}}|d|ywrBrrCs rXrz0_repr_params._repr_param_dict..rErF)rr:itemsrrr"items_first_batchitems_second_batchtrunclentextrs @rXr=z_repr_params._repr_param_dicts    flln -      &7D eH:%?@ @D E &8 D  &7D  rZc>|j|j|\}}}|rHddjfd|Dz}|d|dz }|djfd|Ddz }|Sddjfd |Dt|d k(rd nd d}|S) Nz(%sr c3.K|] }|ywrrr s rXrz1_repr_params._repr_param_tuple.. F5%,FrrrGc3.K|] }|ywrrr s rXrz1_repr_params._repr_param_tuple..G5%,Grrr c3.K|] }|ywrrr s rXrz1_repr_params._repr_param_tuple..rRrrrr)rr:rrirKs @rXr>z_repr_params._repr_param_tuples    f %      F4EFFD eH:%?@ @D  G4FGG D   F4EFF,-2:D rZc|j|j|\}}}|rHddjfd|Dz}|d|dz }|ddjfd|Dzz }|Sddjfd |Dz}|S) Nz[%sr c3.K|] }|ywrrr s rXrz0_repr_params._repr_param_list.."rRrrrGz%s]c3.K|] }|ywrrr s rXrz0_repr_params._repr_param_list..&rTrr4c3.K|] }|ywrrr s rXrz0_repr_params._repr_param_list..*rRr)rr:rrKs @rXr?z_repr_params._repr_param_lists    f %      F4EFFD eH:%?@ @D E G4FGG D  F4EFFD rZ)rrN) r"zOptional[_AnyExecuteParams]r#rr%rrrr$zOptional[bool]r)r/rKr.rrr)r"z Iterable[Any]rr)r"rLr.rrr)r"rMrr)r"r<rr)r"rLrr) rrrrrrrr-r:r!r=r>r?rrZrXr!r!es=I "& %+ % % %  %  %+Z%,%% %8 ' 1' 1 1 1>0rZr!c@fd}tj|id|iS)zWgiven criterion containing bind params, convert selected elements to IS NULL. ct|jtrc|jjvrK|j|_t |_t j|_t j|_ yt|jtrS|jjvr:t |_t j|_t j|_ yyyr) rrr'_identifying_keyrr/ris_ris_notnegate)rnullss rX visit_binaryz-adapt_criterion_to_null..visit_binary5s v{{M 2 ,,5!,,FK6FL'mmFO%,,FM v||] 3 --66FL'mmFO%,,FM 7 4rZr)rcloned_traverse)critr`ras ` rXadapt_criterion_to_nullrd/s$ -$  # #D"x.F GGrZcj||S|dfg}t|}d}|r|j\}}t|trR||urN|j }|j |j |_|j|j|fn|j |}| |J||_||}|r|Sr) ClauseAdapterrrr5_clonerryr_r)rrstop_onradapterret prevrights rX splice_joinsrlJs  | AF ED!G C "YY[ eT "uG';LLNE$--enn=EN LL%**e, -$$U+E  $ $$"IN ;C  JrZcyrrcolumnsr`rs rXreduce_columnsrpgs $'rZcyrrrns rXrprpos 7:rZc |jdd}|jdd tj|}|jd|D tj D]}t |j Dcgc]}|jc}D][} D]T}||ur |j}|j|s' r|j|jk(sC j|[]|r* fd} |D]} | tj | id| i |j Scc}w#tj$r|rYtj$r|rY˂wxYw)aCgiven 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_synonymsc38K|]}t|s|ywrr)r rss rXrz!reduce_columns..sN!2Nsc|jtjk(rtjt j Dcgc]}|jc}}|j|vrt|j|vretD]V}|j|jsr$|j|jjk(sEj|yyyyycc}wr)rreqr<rrrr proxy_setrrreversedshares_lineagenamer)rrsr cset_no_textomitrts rXraz$reduce_columns..visit_binarys),,./;/F/Ft/LM!!++M ;;$&6<<4+?%l3"++FLL9 -6;;;K;K1K HHQK! ",@& /NsC% r)rr< OrderedSetrrrrrx foreign_keysrr;NoReferencedColumnErrorNoReferencedTableErrorrzr{rrr)ror`rrsrrrsfkfk_colrarr|r}rts @@@rXrprpws~0!#'BE JFF?E2M)J8B8M8MNN9L ?? D#--@Q!..@A B! 8YYF((+%388);HHSM/  6 " HF!!!&"x.FG H   &&_A 221 111  sD5 & D::E* E* (E* crrtjddfd}gtj|id|iS)z9traverse an expression and locate binary criterion pairs.zSCan only specify one of 'consider_as_foreign_keys' or 'consider_as_referenced_keys'c$|j|Sr)compare)rVrWs rXcol_isz"criterion_as_pairs..col_issyy|rZcfs|jtjuryt|jt rt|j t syr|jvrS|j |js|j vr(j|j |jfy|j vrT|j|j s|jvr(j|j|j fyyyr|jvrS|j |js|j vr(j|j|j fy|j vrT|j|j s|jvr(j|j |jfyyyt|jtrt|j tr|jj|j r(j|j |jfy|j j|jr(j|j|j fyyyyr) rrrwrrr*rr_r1 references)r any_operatorrrTconsider_as_referenced_keyspairss rXraz(criterion_as_pairs..visit_binarysy|| C &++}5Z LL->   #{{66v||V[[1<<'?? fllFKK89!99v{{FLL1;;&>> fkk6<<89?: ){{99v||V[[1<<'BB fkk6<<89!<<v{{FLL1;;&AA fllFKK89B= &++v.: f4;;))&,,7LL&,, !<=\\,,V[[9LL&++v||!<=: 4.rZr)r; ArgumentErrorrr) expressionrTrrrarrs ``` @@rXcriterion_as_pairsrsX $? ,  %>%>NBDE j"x&>? LrZceZdZdZdZ d d dZered dZeddZ ddZe jfdZ e jd  d dd Z y)rfaYClones 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_selectablesNc|g|d|_||_||_||_t j |xsi|_||_||_y)N)rhanonymize_labels) rrrrr< column_dictrrr)rrrrrrrrs rXrzClauseAdapter.__init__3sU#| 0% !%$$++K,=2>,&<#rZcyrrrobjs rXrzClauseAdapter.traverseJs8;rZcyrrrs rXrzClauseAdapter.traverseUs-0rZcyrrrs rXrzClauseAdapter.traverseXs.1rZc~|jj||}|P||jvrB||vr>|j|D],}|j|||j |g}|*|cS|j rA|?t |tr/|jjj|j}|S)Nrequire_embedded)r_seen) rcorresponding_columnr_corresponding_columnrtrrr.exported_columnsgetr{)rrrrnewcolequivs rXrz#ClauseAdapter._corresponding_column\s55 "26  >cT%5%55#U:J))#. "33%5++se,4 %!M "   3 ,__5599#((CF rZzsqlalchemy.sql.functionsctjj}|jr|j|sy|jr|j |ryt |t rt ||js|jj|rH|jr0|jD] }|j|s|jSy|jSt |trt |jtr|Syt |tsy|s |jryd|j vr|j d}t"rt |t$sJ|jr>||j&vr0|jD] }|j(j+|d nyt"rt |t$sJ|j-|dS)N adapt_columnFTr)r< preloaded sql_functionsrrrr3FunctionElementrr^rr2rr8r*_is_singleton_constantrrr,rrsrr)rr_include_singleton_constants functionsadps rXrzClauseAdapter.replacetsNN00  ??4??3#7 __!5 c: &z **0 ..s3..#::$..s3!& $ $&C'J [- C/-#2L2L S-- -"">2C c#56 66  & &3d6F6F+F22 55--c59E  c#56 66)) $*  rZ)NNNFFN)rrFrOptional[_EquivalentColumnMap]r)Optional[Callable[[ClauseElement], bool]]rrrrrrr!Optional[AbstractSet[FromClause]]rz Literal[None]rNonerr9rr9rrrr)F)rr9rrrz Optional[_ET])rrrrrrrrrr< EMPTY_SETrpreload_modulerrrZrXrfrf s<I7;@D@D$!&DH==4=> = > =  ==!B=* ; ; 0 0 26 2 , 2 ,0>>0T34=BF F 6:F F 5F rZrfc\eZdZeddZeddZed dZed dZd dZy) _ColumnLookupcyrrrrDs rX __getitem__z_ColumnLookup.__getitem__s.1rZcyrrrs rXrz_ColumnLookup.__getitem__sHKrZcyrrrs rXrz_ColumnLookup.__getitem__sJMrZcyrrrs rXrz_ColumnLookup.__getitem__s,/rZcyrrrs rXrz_ColumnLookup.__getitem__srZN)rDrrr)rDColumnClause[Any]rr)rDrPrrP)rDr9rr9)rDrrr)rrrrrrrZrXrrs= 11 KK MM ///rZrceZdZUdZdZded< d dfd ZGddZdZe dd Z e dd Z dd Z dfd Z e r e dd Ze Zej"Z ddZ ddZxZS) ColumnAdapteraExtends 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 )roadapt_requiredallow_label_resolve_wrap __weakref__rroc t |||||||| tj|j|_|j s |jr!|j||j |_||_ ||_ d|_ y)N)rrrrr) superrr<WeakPopulateDict _locate_colrorr_IncludeExcludeMappingrrr) rrrrrrrrrr __class__s rXrzColumnAdapter.__init__s   !!)-#9  ,,T-=-=> ??doo66tT\\JDL,#6  rZceZdZdZdZy)$ColumnAdapter._IncludeExcludeMappingc ||_||_yr)parentro)rrros rXrz-ColumnAdapter._IncludeExcludeMapping.__init__s DK"DLrZcZ|jjr|jj|r1|jjrV|jj|r;|jjr#|jjj|S|S|j|Sr)rrrrrors rXrz0ColumnAdapter._IncludeExcludeMapping.__getitem__sz &&t{{/E/Ec/J++((T[[-C-CC-H;;$$;;,,44S99J<<$ $rZN)rrrrrrrZrXrrs  # %rZrctj|}||_tj|j|_|j s |jr!|j||j |_|Sr) copyrr<rrrorrr)rriacs rXwrapzColumnAdapter.wrap#sV YYt_**2>>: ==BMM44RDBJ rZcyrrrs rXrzColumnAdapter.traverse,s47rZcyrrrs rXrzColumnAdapter.traverse/s),rZc |j|Sr)rors rXrzColumnAdapter.traverse2s||C  rZcFt|tsJt| |Sr)rrrr)rvisitorrs rXrzColumnAdapter.chain7s"'=111w}W%%rZcyrr)rs rXvisitor_iteratorzColumnAdapter.visitor_iterator>s?BrZcR|j|}||ur|j|dy|S)NT)ror)rrrs rXadapt_check_presentz!ColumnAdapter.adapt_check_presentDs3c" S=T77TBJ rZcB|jr+|jD]}|j|d}|n|}ntj ||}|j r|j j |}||}|jr||ury||ur|j|_ |S)NT)r) _is_immutablerrrfrrrrr_allow_label_resolve)rrvisrsc2s rXrzColumnAdapter._locate_colNs   ,, KK$KG=  &&tS1A ::''*B~   18 C<%)%=%=A "rZ)NFNNFTFN)rrFrrrrrrrrrrrrrrrrrrr)rrIrr)rzIterator[ColumnAdapter])rrPrOptional[ColumnElement[Any]])rrrrrrrrrrrrrpropertyr adapt_clauserfcopy_and_process adapt_listrr __classcell__)rs@rXrrs#<I 7;$@D@D$$(!&DH4  >  > "!B: % %77 ,,!2! (! &  B BL//J% %*%* %*rZrcPtjtj|||S)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. )r{type_)rexpectrLimitOffsetRole)rr{rs rX_offset_or_limit_clauser{s&    wT rZcf|yt|dr!|j}tj|S|S)zdReturn the offset or limit clause as a simple integer if possible, else return the clause. N_limit_offset_value)hasattrrr<asint)rrs rX)_offset_or_limit_clause_asint_if_possiblers6~v,-**zz%   rZc"|D|Bt|}|d}|dk7r||z}|dk(rd}n|Jt|}t||z }||fS||t|}||fS|1|/t|}|d}|dk7r||z}|dk(rd}||fSt|}||fS)z0Compute LIMIT/OFFSET in terms of slice start/endNr)rr) limit_clause offset_clausestartstops rX _make_slicers T-A    M A:)E1M A  M , ,,3MBM.te|< &  &&# 4+.t4  &&  t|A    M A:)E1M 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`rrarDryrrr)rzOCallable[[BinaryExpression[Any], ColumnElement[Any], ColumnElement[Any]], None]rrPrr)rr(rrrrrrrrrrrzList[TableClause])rrrr)rr3rzIterator[FromClause])rr(rzIterator[ClauseElement])rr3rr3rr)rcrOr`zCollection[Any]rrOr)rrrrrhrrr)rozIterable[ColumnElement[Any]]r`Optional[ClauseElement]rrrzSequence[ColumnElement[Any]])rorEr`rrrrz/Sequence[Union[ColumnElement[Any], TextClause]])rorEr`rrrrz1Collection[Union[ColumnElement[Any], TextClause]])NNF)rr@r{z Optional[str]rz"Optional[_TypeEngineArgument[int]]rzColumnElement[int])rr@rr@) rr@rr@rrrrrzATuple[Optional[ColumnElement[int]], Optional[ColumnElement[int]]])~r __future__r collectionsrr itertoolsrtypingrrrr r r r r rrrrrrrrrrrrr_typingr annotationrrrbaser r! cache_keyr"ddlr#r6r$r%r&r'r(r)r*r+r,r-r.r/r0schemar1rr2r3r4r5r6r7r8r9r;r< util.typingr=r>r?r@rArBrCrDrErFrGrHrIengine.interfacesrJrKrLrM engine.rowrNrOrYrgrpr}rrrrrrrrkrrrrrrrrrrr!rdrlrprReplacingExternalTraversalrfrrrrrrrZrXrs @"   #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