/opt/cloudlinux/venv/lib/python3.11/site-packages/sqlalchemy/sql/__pycache__
Edit: /opt/cloudlinux/venv/lib/python3.11/site-packages/sqlalchemy/sql/__pycache__/util.cpython-311.pyc (42224B)
NW d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ddlm
Z
dd lm Z dd
l m
Z
dd l mZ dd lmZ dd
lmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ddl 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& d d!lm'Z' d d"lm(Z( e(j) * e#j+ d# Z,d$ Z-d% Z.d& Z/d' Z0 dEd)Z1d* Z2d+ Z3d, Z4d- Z5d. Z6d/ Z7d0 Z8dFd2Z9d3 Z:d4 Z;d5 Z< G d6 d7e= Z> G d8 d9e> Z? G d: d;e> Z@d< ZAdGd>ZBd? ZC dHd@ZD G dA dBejE ZF G dC dDeF ZGd=S )Iz;High level utilities which build upon other modules here.
)deque)chain ) operators)visitors)_deep_annotate)_deep_deannotate)_shallow_annotate)
_from_objects) ColumnSet) sort_tables)_expand_cloned)
_find_columns)_label_reference)_textual_label_reference)
BindParameter) ColumnClause)
ColumnElement)Grouping)Label)Null)UnaryExpression)Column)Alias)
FromClause) FromGrouping)Join) ScalarSelect)
SelectBase) TableClause )exc)utilz.sql.util.join_conditionc t t | }g }t | D ]4\ }}|D ],}| | r| | -5|S )a Given 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 g/builddir/build/BUILD/cloudlinux-venv-1.0.12/venv/lib64/python3.11/site-packages/sqlalchemy/sql/util.pyfind_join_sourcer1 3 sz " }W--..K
C'"" 1 A ##
1
J c t t | }g }t | D ]6\ }}|D ].}| | r| | n/7t | dk rkg }|D ]b}| | }|D ]U}t
t | t | r| | nVc|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_fromr+ liberal_idxr- r. r/ conservative_idxr, s r0 #find_left_clause_that_matches_givenr; M s, }Y//00KK'""
1 A ##
""1%%%
;! C A
*1--..;;'** %++C000E
$# # r2 c
g }t t | }t dk r|d}t | }nd}d}t D ]\ }}| |g D ]} |rWt |j | j | r| | n0[t j || s|| | nt | dk r/t t d D
fd|D }|s | t t S |S )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.
r NTFc 6 g | ]}t |j S )r _hide_froms).0r. s r0
z1find_left_clause_to_join_from.. s" CCCaN1=11CCCr2 c ( g | ]}| v |S r> r> )r@ r- r) toremoves r0 rA z1find_left_clause_to_join_from.. s' <<>!#&&112BCC JJqMMME 1%%
)=
1
*> 3xx!|| CC7CCC D
=<<<<#<<< 8'S\\"""
r2 c R g fdt | ddS )a Produce a traversal of the given expression, delivering
column comparisons to the given function.
The function is of the form::
def my_fn(binary, left, right)
For each binary expression located which has a
comparison operator, the product of "left" and
"right" will be delivered to that function,
in terms of that binary.
Hence an expression like::
and_(
(a + b) == q + func.sum(e + f),
j == r
)
would have the traversal::
a 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.
c 3 K t | t r| V d S | j dk rt j | j r d| | j D ](} | j D ]} d || ) d |
D ]
} | d S t | t r| V |
D ]} | D ]}|V d S )Nbinaryr )
isinstancer __visit_name__r
is_comparisonoperatorinsertleftrightpop get_childrenr )elementlrelemefnstackvisits r0 ra z#visit_binary_product..visit sf g| , , MMMMM
#x
/
/I4K 5
5
/
LLG $ $ $U7<((
'
' w}-- ' 'ABuQxA&&&&' IIaLLL ,,..
d
'<00
,,..
t AGGGG
r2 N)r% )r_ exprr` ra s ` @@r0 visit_binary_productrc sQ F
E , t EEEr2 Fc g i }|rj x|d< |d< |r
j |d< |r
j |d< |rfdx|d< x|d< |d< |r
fd }||d
< j |d < t j | d d
i| S )z1locate Table objects within the given expression.selectcompound_selectjoinaliasc 8 | j S Nr( table)enttabless r0 z find_tables.. s
ci00 r2 rU updatedeletec < | j d S rj rk )columnrn s r0 visit_columnz!find_tables..visit_column s MM&, ' ' ' ' 'r2 rs rl column_collectionsF)r( r traverse) clause
check_columnsinclude_aliases
include_joinsinclude_selects include_crud _visitorsrt rn s @r0 find_tablesr~ s FI K=C]J (i(9 : * "M & + #] ' 1
1 0 0 0 1 ( 1i 1I 5
+ ( ( ( ( ( + ( Ig f 3U ;YGGG Mr2 c t j }g }t | g }|rO| }t |t
rt |t rt j |j st |t rSt |j t s9|j }t |t r|j }| | t |t r|j }t |t r||vr*| | | | n,| D ]}| | |O|S )zqBreak up an 'order by' expression into individual column-expressions,
without DESC/ASC/NULLS FIRST/NULLS LAST)r#
column_setr popleftrQ r r r is_ordering_modifiermodifierr rZ r r r( r r addrY )rw colsresultr` trE s r0 unwrap_order_byr sg ? D
F 6(OOE
MMOO a ' ' 1o.. 1!*== !U##
J <- -
I a** " A Q! -..
I! 688
}}
a ^^%%
Q5 6 Mr2 c 4 d }t j | i | S )Nc L t | t t f r| j S d S rj )rQ r r rZ )r] s r0 replacez'unwrap_label_reference..replace8 s- d -/G H I I < r2 )r replacement_traverse)rZ r s r0 unwrap_label_referencer 7 s( ("g > >>r2 c t d | D t t d |D }fd|D S )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.
c . g | ]}|j |j n|S rj )_order_by_label_elementrZ )r@ cols r0 rA z4expand_column_list_from_order_by..G s6
6BCKK
r2 c , g | ]}t | S r> )r )r@ os r0 rA z4expand_column_list_from_order_by..M s D D Daq 1 1 D D Dr2 c g | ]}|v| S r> r> )r@ r cols_already_presents r0 rA z4expand_column_list_from_order_by..O s$ J J JC#5I*I*IC*I*I*Ir2 )r5 r% r )collistorder_by to_look_forr s @r0 expand_column_list_from_order_byr ? sn
u D D8 D D DEFFK J J J J; J J JJr2 c < t | D ] }| |k r dS dS )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)r6 )rw searchr] s r0 clause_is_presentr R s7 $F++ T>>44 ur2 c # K t | t r8t | j D ]}|V t | j D ]}|V d S t | t
r t | j D ]}|V d S | V d S rj )rQ r tables_from_leftmostrV rW r rZ )rw r s r0 r r b s &$ %fk22 AGGGG%fl33 AGGGG FL ) ) %fn55 AGGGG r2 c # K | g}|r| }|V t |t r"| |j |j f n/t |t r| |j |d S d S rj ) rX rQ r extendrV rW r r( rZ rw r` r] s r0 r6 r6 o s
HE
'yy{{
dD ! ! ' LL$)TZ0 1 1 1 1
l
+
+ ' LL & & &
' ' ' ' 'r2 c # K | g}|r| }t |t t f r|V t |t r"| |j |j f nrt |t r| |j
nBt |t r'|j | |j n |V n||V |d S d S rj )
rX rQ r r r r rV rW r r( rZ r rl r s r0 surface_selectables_onlyr z s
HE
yy{{ d[% 0 1 1 JJJ dD ! !
LL$)TZ0 1 1 1 1
l
+
+ LL & & & &
l
+
+ z% TZ((((
JJJ r2 Tc #
K t f}|s |t fz
}t | g }|rY| }|V | D ](}t || r| | )|WdS dS )ztraverse and yield only outer-exposed column elements, such as would
be addressable in the WHERE clause of a SELECT if this element were
in the columns clause.N)r r r r rY rQ r( )rw include_scalar_selectsfilter_r` r] subs r0 surface_column_elementsr s
oG ! !J= 6(OOE
}}
$$&& C#w''
LL
r2 c t t t | t | S )z:Return True if left/right have some overlapping selectable)boolr5 r6 r7 )rV rW s r0 selectables_overlapr sA % %&&334G4N4NOO r2 c F g fd}t j | i d|i S )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 d S rj )r( effective_value)bindvs r0 visit_bindparamz$bind_values..visit_bindparam s %&&&&&r2 bindparam)r rv )rw r r s @r0 bind_valuesr sD A' ' ' ' '
fb;"@AAA Hr2 c t | t j r| dd } d| z S t | S )N'z''z'%s')rQ r# string_typesr repr)rZ s r0 _quote_ddl_exprr sA '4,-- //#t,, G}} r2 c $ e Zd ZdZdZdZdZd ZdS )
_repr_baser r r! ) max_charsc t | }t | }|| j k r.| j dz }|d| d|| j z
z z || d z }|S )Nr! r z# ... (%d characters truncated) ... )r r4 r )selfvaluereplenrepsegment_lengths r0 truncz_repr_base.trunc sx 5kkS DN " " !^q 0NAn$%9 .0
~o&&' (
r2 N)__name__
__module__ __qualname___LIST_TUPLE_DICT __slots__r r> r2 r0 r r s7
E
F
E I
r2 r c $ e Zd ZdZdZddZd ZdS ) _repr_rowz Provide a string view of a row.)row, c " || _ || _ d S rj )r r )r r r s r0 __init__z_repr_row.__init__ s "r2 c | j dd fd| j D t | j dk rdnddS )N(, c 3 . K | ]} | V d S rj r> r@ r r s r0 z%_repr_row.__repr__.. s+ 99ueeEll999999r2 r , ))r rg r r4 )r r s @r0 __repr__z_repr_row.__repr__ s^
II9999999 9 9 9tx==A%%CC2 - -
r2 N)r )r r r __doc__r r r r> r2 r0 r r sB ))I# # # #
r2 r c 0 e Zd ZdZdZd dZd Zd Zd ZdS )
_repr_paramszProvide a string view of bound parameters.
Truncates display to a given numnber of 'multi' parameter sets,
as well as long values to a given number of characters.
)paramsbatchesismultir Nc > || _ || _ || _ || _ d S rj )r r r r )r r r r r s r0 r z_repr_params.__init__ s" "r2 c & | j | | j S t | j t r| j }n^t | j t r| j }n.( sD ! !9?!!&)44! ! ! ! ! !r2 r [%s]z(%s)) rQ r% r r r r r typerg )r multi_paramsr elementsr s ` @r0 r z_repr_params._repr_multi s ,q/400
J LOU33
K LOT22
J 9 a )) u yy ! ! ! ! !CO! ! ! HH H $* H$ $H$ $r2 c b | j || j u r6dd fd| D z S || j u r K | ]\ }}|d | V dS )z: Nr> )r@ keyr r s r0 r z,_repr_params._repr_params..7 sN "U !$UU5\\\2 r2 r c 3 . K | ]} | V d S rj r> r s r0 r z,_repr_params._repr_params..> s+ ;;5%%,,;;;;;;r2 r r r r r c 3 . K | ]} | V d S rj r> r s r0 r z,_repr_params._repr_params..B s+ &H&HuuU||&H&H&H&H&H&Hr2 )r r rg itemsr r4 )r r r r s @r0 r z_repr_params._repr_params3 s
$* &,llnn
DK
;;;;F;;;;;;6{{a''R//
TYY&H&H&H&H&H&H&H H HI Ir2 )r N) r r r r r r r r r r> r2 r0 r r sk /I# # # # 7 7 7<% % %0J J J J Jr2 r c > fd}t j | i d|i S )zWgiven criterion containing bind params, convert selected elements
to IS NULL.
c t | j t rQ| j j v rC| j | _ t | _ t j | _ t j | _
d S t | j t rE| j j v r9t | _ t j | _ t j | _
d S d S d S rj ) rQ rV r _identifying_keyrW r r is_rT isnotnegate)rP nullss r0 visit_binaryz-adapt_criterion_to_null..visit_binaryK s v{M 2 2 , ,55 !,FK 66FL 'mFO %OFMMM v|] 3 3 , -66 66FL 'mFO %OFMMM
, ,66r2 rP )r cloned_traverse)critr r s ` r0 adapt_criterion_to_nullr E s8 , , , , ,$ #D"x .F G GGr2 Nc | |S |d fg}t | }d }|r| \ }}t |t rh||urd| }| | |j |_ | |j |f n| | }|||_ ||}||S rj )
ClauseAdapterrX rQ r _clone_reset_exportedrv rJ r( rV )rV rW stop_onr` adapterret prevrights r0 splice_joinsr
` s | T]OED!!G
C
"YY[[ eT " " ,uG';';LLNNE ! ! # # # $ - -en = =EN LL%*e, - - - -$$U++E "IN ;C Jr2 c z
| dd }| dd t j t j
D ]}t d |j D D ]~} D ]y}||u r |j }n+# t j $ r |rY # t j $ r |rY 6 w xY w|
| r) r|j |j k r
| nz|r&
fd}|D ] } | t j | i d|i t
S )aC given 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_synonymsc g | ] }|j
S r> ) foreign_keysr@ rE s r0 rA z"reduce_columns.. s @@@Q!.@@@r2 c | j t j k rt j t d D }| j |v rf| j |v r_t D ]Q}|
| j r/r|j | j j k r | d S Ld S d S d S d S )Nc g | ] }|j
S r> ) proxy_setr s r0 rA z8reduce_columns..visit_binary.. s JJJAAKJJJr2 )
rT r eqr# r r rD rV rW reversedshares_lineagenamer )rP r rE columnsomitr
s r0 r z$reduce_columns..visit_binary s ),..JJ1C1CD1I1IJJJK ;$&&6<4+?+? %g . . " " ++FL99 " -"126;;K1K1K HHQKKK !EE /. '&+?+?" "r2 NrP )rX r# ordered_column_setr r r rs r" NoReferencedColumnErrorNoReferencedTableErrorr r r r rv r rD ) r r) kwr r fkrE fk_colr rw r r
s ` @@r0 reduce_columnsr y s ( !#'BE J J FF?E22M%g..G ? D @@#-@@@A B
88 YFF2 1 1 1
((++ %)*38););HHSMMME1 4 H " " " " " " " H HF!!&"x .FGGG W''-- . ..s ?BB/ B/ -B/ c rrt j d d fd}g t j | i d|i S )z9traverse an expression and locate binary criterion pairs.zSCan only specify one of 'consider_as_foreign_keys' or 'consider_as_referenced_keys'c , | | S rj )compare)abs r0 col_isz"criterion_as_pairs..col_is s yy||r2 c s| j t j urd S t | j t
rt | j t
sd S r| j v rB | j | j s | j vr# | j | j f d S | j v rB | j | j s | j vr% | j | j f d S d S d S r| j v rB | j | j s | j vr# | j | j f d S | j v rB | j | j s | j vr% | j | j f d S d S d S t | j t rt | j t r| j | j r# | j | j f d S | j | j r' | j | j f d S d S d S d S rj )
rT r r rQ rV r rW r( r
references)rP any_operatorr& consider_as_foreign_keysconsider_as_referenced_keyspairss r0 r z(criterion_as_pairs..visit_binary s y| C C F&+}55 Z L->
>
F # >{ 666v|V[11 7<'??? flFK 899999 !999v{FL11 :;&>>> fk6< 899999 :9>> ) >{ 999v|V[11 :<'BBB fk6< 899999 !<<<v{FL11 =;&AAA flFK 899999 =<AA &+v..
>: f4 4
> ;))&,77 >LL&, !<=====\,,V[99 >LL&+v|!<=====
>
>
>
>
> >r2 rP )r"
ArgumentErrorr rv )
expressionr* r+ r) r r& r, s ``` @@r0 criterion_as_pairsr/ s
$?
,
%> %> %> %> %> %> %> %> %>N
E j"x &>??? Lr2 c > e Zd ZdZ ddZej fdZd ZdS )r a5 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
NFc |g|d| _ || _ || _ || _ t j |pi | _ || _ d S )N)r anonymize_labels)__traverse_options__
selectable
include_fn
exclude_fnr# column_dict equivalentsadapt_on_names)r r4 r8 r5 r6 r9 r2 s r0 r zClauseAdapter.__init__ sX #| 0%
%
! %$$ +K,=2>> ,r2 c : | j || }|O|| j v rF||vrB| j | D ]4}| ||| |g }||c S 5| j r&|$| j j |j }|S )N)require_embedded)r; _seen) r4 corresponding_columnr8 _corresponding_columnrF r9 rE getr )r r r; r< newcolequivs r0 r> z#ClauseAdapter._corresponding_column1 s 55 "2 6
>cT%5 5 5#U:J:J )#.
"
" 33%5 ++se,, 4
%!MMM & 56>_&**3844F
r2 c @ t |t r!| j | r| j S t |t sd S | j r| | sd S | j r| | rd S | |d S )NT)rQ r r4 r' r r5 r6 r> )r r s r0 r zClauseAdapter.replaceD s c: & & 94?+J+J ,
,
9 ? "C // 94
_ 9T__S%9%9 94
_ 9 !5!5 94--c488 8r2 )NNNFF) r r r r r r# EMPTY_SETr> r r> r2 r0 r r sm : - - - -( ,0> & 9 9 9 9 9r2 r c t e Zd ZdZ d
dZ G d de Zd Zd ZeZ e
j Z d
Z
d Zd ZdS )
ColumnAdaptera 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
NFTc
t | |||||| t j | j | _ | j s| j r | | | j | _ || _ || _
d | _ d S )N)r5 r6 r9 r2 ) r r r# WeakPopulateDict _locate_colr r5 r6 _IncludeExcludeMappingadapt_requiredallow_label_resolve_wrap) r r4 r8 rJ r5 r6 r9 rK r2 s r0 r zColumnAdapter.__init__r s !!) -
,T-=>> ? Kdo K 66tT\JJDL ,#6
r2 c e Zd Zd Zd ZdS )$ColumnAdapter._IncludeExcludeMappingc " || _ || _ d S rj )parentr )r rP r s r0 r z-ColumnAdapter._IncludeExcludeMapping.__init__ s DK"DLLLr2 c | j j r| j | r&| j j r?| j | r%| j j r| j j j | S |S | j | S rj )rP r5 r6 rL r )r r s r0 __getitem__z0ColumnAdapter._IncludeExcludeMapping.__getitem__ s &
/3{/E/Ec/J/J
+(
-1[-C-CC-H-H
;$ ;,4S99 J<$ $r2 N)r r r r rR r> r2 r0 rI rN s2 # # # % % % % %r2 rI c ( | j | j }|j | j ||_ t j |j |_ |j s|j
r | ||j |_ |S rj ) __class____new____dict__rp rL r# rG rH r r5 r6 rI )r r acs r0 wrapzColumnAdapter.wrap s
^
#
#DN
3
3
4=)))*2>::
= EBM E 44RDDBJ r2 c | j | S rj )r )r objs r0 rv zColumnAdapter.traverse s |C r2 c t | | }| j r | j | }||}| j r||u rd S | j |_ |S rj )r rv rL rH rJ rK _allow_label_resolve)r r rE c2s r0 rH zColumnAdapter._locate_col sh " "4 - - : ''**B~ 1884!%!9 r2 c > | j }|d= |S )Nr )rV copy)r ds r0 __getstate__zColumnAdapter.__getstate__ s! M
iLr2 c v | j | t j | j | _ d S rj )rV rp r# rG rH r )r states r0 __setstate__zColumnAdapter.__setstate__ s1
U###,T-=>> r2 )NFNNFTF)r r r r r objectrI rX rv adapt_clauser copy_and_process
adapt_listrH ra rd r> r2 r0 rE rE S s B 8
%
%
%
%
%
%
%
% ! ! ! L /J
? ? ? ? ?r2 rE )FFFFF)Trj )NNF)Hr collectionsr itertoolsr r r r
annotationr r r
baser r ddlr
r r r r r r r r r r r r schemar r4 r r r r r r r r" r# langhelperspublic_factory_join_conditionjoin_conditionr1 r; rM rc r~ r r r r r r6 r r r r r re r r r r r
r r/ ReplacingCloningVisitorr rE r> r2 r0 rt s & & & & & & ( ( ( ( ( ( ) ) ) ) ) ) $ $ $ $ $ $ # # # # # # & & & & & & . . . . . . # # # # # # " " " " " " # # # # # # % % % % % % " " " " " " $ $ $ $ $ $ $ $ $ $ $ $ " " " " " " # # # # # # !004
4' ' 'T1 1 1h< < <B
% % % %P" " "J? ? ?K K K&
' ' ' & &
* .
"UJ UJ UJ UJ UJ: UJ UJ UJpH H H6 2H/ H/ H/Z " $ < < < <~M9 M9 M9 M9 M9H4 M9 M9 M9`q? q? q? q? q?M q? q? q? q? q?r2