HEX
Server: Apache/2.4.52 (Ubuntu)
System: Linux spn-python 5.15.0-89-generic #99-Ubuntu SMP Mon Oct 30 20:42:41 UTC 2023 x86_64
User: arjun (1000)
PHP: 8.1.2-1ubuntu2.20
Disabled: NONE
$ pwd: /usr/local/lib/python3.10/dist-packages/sqlalchemy/sql/__pycache__/
Upload Files
File: //usr/local/lib/python3.10/dist-packages/sqlalchemy/sql/__pycache__/util.cpython-310.pyc
o

���gֻ�@s0dZddlmZddlmZddlZddlmZddlZddlm	Z	ddlm
Z
ddlmZdd	lmZdd
lm
Z
ddlmZdd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;m<Z<dd2l;m=Z=dd3l;m>Z>dd4l;m?Z?dd5l;m@Z@dd6l;mAZAdd7l;mBZBdd8lmCZCd9d:lmDZDd9d;lmEZEd9d<lFmGZGd9d=lFmHZHej�r�dd>lmIZIdd?lmJZJdd@lmKZKddAl+mLZLddBl+mMZMddCl;mNZNddDl;mOZOddEl;mPZPddFlmQZQddGlmRZRddHlmSZSd9dIlTmUZUd9dJlTmVZVd9dKlTmWZWd9dLlTmXZXd9dMlYmZZZedNdOdP�Z[		d�d�dZd[�Z\d�d`da�Z]d�ddde�Z^d�didj�Z_d�dodp�Z`dqdqdqdqdqdr�d�d|d}�Zad�dd��Zbd�d��Zcd�d��Zdd�d��Zed�d�d��Zfd�d��Zgd�d��Zhd�d��Zid�d�d��Zjd�d��Zkd�d��ZlGd�d��d��Zmd�d��ZnGd�d��d�em�ZoGd�d��d�ep�ZqGd�d��d�em�Zrd�d�d��Zs	d�d�d�d��Zted�d�d���Zued�d�d���Zud�d�d��Zu			qd�d�d��ZvGd�d��d�ejw�ZxGd�d��d�eH�ZyGd�d��d�ex�Zz		d�d�d�dƄZ{d�d�dȄZ|d�d�dЄZ}dS)�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)�visitors��is_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�_CE�ColumnElement[Any])�bound�ar2�b�a_subset�Optional[FromClause]�consider_as_foreign_keys�(Optional[AbstractSet[ColumnClause[Any]]]�return�ColumnElement[bool]cCstj||||d�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".

    )rSrU)r4�_join_condition)rQrRrSrU�rZ�>/usr/local/lib/python3.10/dist-packages/sqlalchemy/sql/util.py�join_condition_s�r\�clauses�List[FromClause]�join_to�	List[int]cCsDtt|��}g}t|�D]\}}|D]}|�|�r|�|�qq|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 �	enumerate�is_derived_from�append)r]r_�selectables�idx�i�f�srZrZr[�find_join_source�s

��rj�Sequence[FromClause]�	join_fromc	Cs�tt|��}g}t|�D]\}}|D]}|�|�r |�|�nqqt|�dkrNg}|D]}||}|D]}tt|���t|��rH|�|�nq4q,|rN|S|S)z�Given a list of FROM clauses and a selectable,
    return the indexes from the list of
    clauses which is derived from the selectable.

    r)	rar rbrcrd�len�set�surface_selectables�intersection)	r]rlre�liberal_idxrgrhri�conservative_idxrfrZrZr[�#find_left_clause_that_matches_given�s0	

��	�
��rsrC�onclause�Optional[ColumnElement[Any]]c
sg}tt|��}t��dkr|durd}t|�}nd}d}t��D]:\}}|�|g�D]/}	|rI|dus5J�t|j��|	j��|�rH|�	|�nq+|dusSt
�||	�rZ|�	|�nq+q!t|�dkrwttdd��D������fdd�|D�}|s�|dur�t
tt����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.

    rNTFcSsg|]}t|j��qSrZ)r�_hide_froms)�.0rhrZrZr[�
<listcomp>�sz1find_left_clause_to_join_from.<locals>.<listcomp>csg|]
}�|�vr|�qSrZrZ)rwrg�r]�toremoverZr[rx�s)rnr rmr#rb�
difference�c�union�
issupersetrdr4�	_can_joinrra�range)
r]r_rtrfre�resolve_ambiguity�cols_in_onclausergrhrirZryr[�find_left_clause_to_join_from�s8

�
���r��fn�OCallable[[BinaryExpression[Any], ColumnElement[Any], ColumnElement[Any]], None]�expr�Nonecs*g�d���fdd��t�|��d�dS)	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:

    .. sourcecode:: text

        a <eq> q
        a <eq> e
        a <eq> f
        b <eq> q
        b <eq> e
        b <eq> f
        j <eq> r

    That is, every combination of "left" and
    "right" that doesn't further contain
    a binary comparison is passed as pairs.

    �elementr'rW�Iterator[ColumnElement[Any]]c3s��t|t�r|VdS|jdkrFt�|j�rF��d|��|j�D]}�|j�D]
}��d||�q(q!��	d�|�
�D]}�|�q=dSt|t�rN|V|�
�D]	}�|�EdHqRdS)N�binaryr)�
isinstancer5�__visit_name__r�
is_comparison�operator�insert�left�right�pop�get_childrenr()r��l�r�elem�r��stack�visitrZr[r�-s(�

��

�
�z#visit_binary_product.<locals>.visitN)r�r'rWr�)ra)r�r�rZr�r[�visit_binary_products'r�F)�
check_columns�include_aliases�
include_joins�include_selects�include_crud�clauser'r��boolr�r�r�r��List[TableClause]cs�g�i}|r�j|d<|d<|r�j|d<|r)�j|d<|d<|d<|d<|r;�fdd	�|d
<|d<|d<|rG�fd
d�}||d<�j|d<t�|i|��S)z1locate Table objects within the given expression.�select�compound_select�join�alias�subquery�tablesample�lateralcs��|j�S�N�rd�table)�ent��tablesrZr[�<lambda>aszfind_tables.<locals>.<lambda>r��update�deletec���|j�dSr�r�)�columnr�rZr[�visit_columnf�z!find_tables.<locals>.visit_columnr�r�)rdr�traverse)r�r�r�r�r�r��	_visitorsr�rZr�r[�find_tablesFs*
��
�
r�rcCs�t��}g}t|g�}|rn|��}t|t�r`t|t�r!t�|j	�s`t|t
�r=t|jt�s=|j}t|t
�r7|j}|�|�qt|t�rK|j}|�|�qt|t�rQq||vr_|�|�|�|�n|��D]}|�|�qd|s
|S)zqBreak up an 'order by' expression into individual column-expressions,
    without DESC/ASC/NULLS FIRST/NULLS LAST)r;�
column_setr�popleftr�r)r/r�is_ordering_modifier�modifierr,r�r5r*rdr$r%�addr�)r��cols�resultr��tr|rZrZr[�unwrap_order_byqs@

�
��






��r�cCsd	dd�}t�|i|�S)
Nr�rG�kwrrW�Optional[ExternallyTraversible]c[s&t|t�r|jSt|t�rJd��dS)NFz&can't unwrap a textual label reference)r�r$r�r%)r�r�rZrZr[�replace�s


z'unwrap_label_reference.<locals>.replace)r�rGr�rrWr�)r�replacement_traverse)r�r�rZrZr[�unwrap_label_reference�s
	r�cs6dd�|D��ttdd�|D���}�fdd�|D�S)z�Given 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.

    cSs h|]}|jdur|jn|�qSr�)�_order_by_label_elementr��rw�colrZrZr[�	<setcomp>�s��z3expand_column_list_from_order_by.<locals>.<setcomp>cSsg|]}t|��qSrZ)r�)rw�orZrZr[rx�sz4expand_column_list_from_order_by.<locals>.<listcomp>csg|]}|�vr|�qSrZrZr���cols_already_presentrZr[rx�s)rar)�collist�order_by�to_look_forrZr�r[� expand_column_list_from_order_by�s
�r�cCs t|�D]	}||kr
dSqdS)z�Given 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)ro)r��searchr�rZrZr[�clause_is_present�s
	�r��Iterator[FromClause]ccsX�t|t�rt|j�EdHt|j�EdHdSt|t�r't|j�EdHdS|VdSr�)r�r4�tables_from_leftmostr�r�r3r�)r�rZrZr[r��s�


r�ccsZ�|g}|r+|��}|Vt|t�r|�|j|jf�nt|t�r'|�|j�|sdSdSr�)	r�r�r4�extendr�r�r3rdr��r�r�r�rZrZr[ro�s�

�roccs��|g}|rO|��}t|ttf�r|Vt|t�r#|�|j|jf�n(t|t�r/|�	|j
�nt|t�rD|jdur@|�	|j�n|Vn|durK|V|sdSdSr�)
r�r�r7r1r4r�r�r�r3rdr�r(r�r�rZrZr[�surface_selectables_only�s"�



�r�cCs^ttf}t|g�}|r-|��}||jvr|j|S|��D]
}t||�r%q|�|�q|sdSr�)r3r6rr��_annotationsr�r�rd)r��annotation_name�filter_r�r��subrZrZr[�extract_first_column_annotation�s



�r�r�r�cCsttt|���t|���S)z:Return True if left/right have some overlapping selectable)r�rnrorp)r�r�rZrZr[�selectables_overlaps�r�cs&g��fdd�}t�|id|i��S)z�Return 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]
    cr�r�)rd�effective_value)�bind��vrZr[�visit_bindparamr�z$bind_values.<locals>.visit_bindparam�	bindparam)rr�)r�r�rZr�r[�bind_values
s
r�cCs&t|t�r|�dd�}d|St|�S)N�'z''z'%s')r��strr��repr)r�rZrZr[�_quote_ddl_expr s
r�c@sHeZdZUdZded<dZded<dZded<dZded	<ddd�ZdS)�
_repr_baser�int�_LISTr�_TUPLEr9�_DICT)�	max_charsr��valuerrWr�cCsPt|�}t|�}||jkr&|jd}|d|�d||j||d�}|S)Nr9rz# ... (%d characters truncated) ... )r�rmr�)�selfr��rep�lenrep�segment_lengthrZrZr[�trunc1s


����z_repr_base.truncN)r�rrWr�)	�__name__�
__module__�__qualname__r��__annotations__r�r��	__slots__r�rZrZrZr[r�(s
r�cCst�}d|_|�|�S)N�,)r�r�r�)r��rprZrZr[�_repr_single_valueAs
r�c@s*eZdZdZdZdddd	�Zddd
�ZdS)�	_repr_rowzProvide a string view of a row.)�rowr�r�Row[Any]r�r�cC�||_||_dSr�)rr�)r�rr�rZrZr[�__init__L�
z_repr_row.__init__rWr�cs>|j�dd��fdd�|jD��t|j�dkrdfSdfS)N�(%s%s)�, c3��|]}�|�VqdSr�rZ�rwr��r�rZr[�	<genexpr>S��z%_repr_row.__repr__.<locals>.<genexpr>r�,�)r�r�rrm�r�rZr	r[�__repr__Ps��z_repr_row.__repr__N)r�)rrr�r��rWr�)r�r�r��__doc__r�rrrZrZrZr[r�Gs
r�c@seZdZddd�ZdS)�_long_statementrWr�cCsTt|�}|dkr%d}d}|||}|d|��d|�d||d���St�|�S)Ni���dr� ... z characters truncated ... )rmr��__str__)r��lself�lleft�lrightr�rZrZr[rYs��
z_long_statement.__str__Nr)r�r�r�rrZrZrZr[rXsrc@sleZdZdZdZ			d(d)dd�Zd*dd�Zd+dd�Zd,dd�Zd-dd�Z	d.d!d"�Z
d/d$d%�Zd0d&d'�ZdS)1�_repr_paramsz�Provide 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.

    )�params�batches�ismulti�
max_paramsrr�Nr�Optional[_AnyExecuteParams]rr�rr�r�Optional[bool]cCs"||_||_||_||_||_dSr�)rrrr�r)r�rrrr�rrZrZr[rqs

z_repr_params.__init__rWr�c	Cs�|jdur|�|j�St|jt�r|j}nt|jt�r|j}nt|jt�r)|j	}n|�|j�S|jrst
d|j�}t|j�|jkrmd}d�
|�|d|jd�|�dd�||jt|j�f|�|dd�|�dd�f�S|�||�S|�t
d	|j�|�S)
NrJz8 ... displaying %i of %i total bound parameter sets ... � r9r������rrK)rr�rr�rar��tupler��dictr�rrmrr��_repr_multir)r��typ�multi_params�msgrZrZr[rsH
��������z_repr_params.__repr__r(rJr'cs�|r;t|dt�r
�j�n t|dt�r�j�nt|dt�r#�j�n
Jdt|d���d���fdd�|D��}nd}|�jkrFd|Sd	|S)
NrFzUnknown parameter type %src3s�|]	}��|��VqdSr�)r)rwr��	elem_typer�rZr[r
�s�
�z+_repr_params._repr_multi.<locals>.<genexpr>r
�[%s]z(%s))	r�rar�r$r�r%r��typer�)r�r(r'�elementsrZr*r[r&�s"
�
�
z_repr_params._repr_multi�
Iterable[Any]rcCsPt|�}t|�}||jkr#|jd}|d|�||d�||jfS|ddfS)Nr9r)rarmr)r�r�lparams�	lenparamsrrZrZr[�_get_batches�s


�
z_repr_params._get_batchesrKcCs>||jur
|�td|��S||jur|�td|��S|�|�S)NrL�
Sequence[Any])r��_repr_param_dictrr��_repr_param_tuple�_repr_param_list)r�rr'rZrZr[r�s
�

z_repr_params._repr_paramsrLcs�|j�|�|���\}}}|r7dd��fdd�|D��}|d|�d�7}|dd��fdd�|D��7}|Sd	d��fd
d�|D��}|S)Nz{%src3�&�|]\}}|�d�|���VqdS�z: NrZ�rw�keyr�r	rZr[r
��
��
�z0_repr_params._repr_param_dict.<locals>.<genexpr>r� parameters truncated ... z%s}c3r7r8rZr9r	rZr[r
�r;z{%s}c3r7r8rZr9r	rZr[r
�r;)r�r2�itemsr��r�r�items_first_batch�items_second_batch�trunclen�textrZr	r[r4�s2�����
���z_repr_params._repr_param_dictr3cs�|j�|�|�\}}}|r6dd��fdd�|D��}|d|�d�7}|dd��fdd�|D��f7}|Sd	d��fd
d�|D��t|�dkrJdnd
f}|S)Nz(%src3rr�rZrr	rZr[r

rz1_repr_params._repr_param_tuple.<locals>.<genexpr>rr<z%s)c3rr�rZrr	rZr[r
rrc3rr�rZrr	rZr[r
rrrr
)r�r2r�rmr>rZr	r[r5s(�����z_repr_params._repr_param_tuplecs�|j�|�|�\}}}|r5dd��fdd�|D��}|d|�d�7}|dd��fdd�|D��7}|Sd	d��fd
d�|D��}|S)Nz[%src3rr�rZrr	rZr[r
$rz0_repr_params._repr_param_list.<locals>.<genexpr>rr<z%s]c3rr�rZrr	rZr[r
(rr,c3rr�rZrr	rZr[r
,r)r�r2r�r>rZr	r[r6s&�����z_repr_params._repr_param_list)rr�N)
rrrr�rr�r�r�rr r)r(rJr'r�rWr�)rr/rWr)rrKr'r�rWr�)rrLrWr�)rr3rWr�)rrKrWr�)
r�r�r�rr�rrr&r2rr4r5r6rZrZrZr[rgs�

-



r�crit�nulls�Collection[Any]cs�fdd�}t�|id|i�S)zWgiven criterion containing bind params, convert selected elements
    to IS NULL.

    csxt|jt�r|jj�vr|j|_t�|_tj|_tj	|_
dSt|jt�r8|jj�vr:t�|_tj|_tj	|_
dSdSdSr�)r�r�r&�_identifying_keyr�r.r�is_r��is_not�negate�r��rDrZr[�visit_binary7s
�
��z-adapt_criterion_to_null.<locals>.visit_binaryr�)r�cloned_traverse)rCrDrLrZrKr[�adapt_criterion_to_null1srN�stop_oncCs�|dur|S|dfg}t|�}d}|rP|��\}}t|t�r6||ur6|��}|�|j�|_|�|j|f�n|�|�}|durH|dusEJ�||_|durN|}|s|Sr�)	�
ClauseAdapterr�r�r4�_cloner�rtrdr�)r�r�rOr��adapter�ret�	prevrightrZrZr[�splice_joinsLs&

�rU�columns�Iterable[ColumnElement[Any]]�Optional[ClauseElement]r��Sequence[ColumnElement[Any]]cO�dSr�rZ�rVr]r�rZrZr[�reduce_columnsi�r\rD�/Sequence[Union[ColumnElement[Any], TextClause]]cOrZr�rZr[rZrZr[r\qr]�1Collection[Union[ColumnElement[Any], TextClause]]cs|�dd�}|�dd��t�|�}|�dd�|D���t����D]L}tdd�|jD��D]?}�D]:}||ur8q1z|j}Wntj	yJ|rIYq1�tj
yV|rUYq1�w|�|�rk�rd|j|jkrk��
|�nq1q-q!|r����fdd	�}	|D]}
|
d
ur�t�|
id|	i�qz|���S)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_synonymscss�|]	}t|�r|VqdSr�r�rwr|rZrZr[r
�s��
�z!reduce_columns.<locals>.<genexpr>cS�g|]}|j�qSrZ)�foreign_keysrbrZrZr[rx��z"reduce_columns.<locals>.<listcomp>cs�|jtjkr=t�tdd�����D���}|j|vr?|j|vrAt	��D]}|�
|j�r<�r4|j|jjkr<��|�dSq#dSdSdSdS)NcSrcrZ)�	proxy_setrbrZrZr[rx�rez8reduce_columns.<locals>.visit_binary.<locals>.<listcomp>)
r�r�eqr;r�rr{r�r��reversed�shares_lineage�namer�)r�r�r|��cset_no_text�omitrarZr[rL�s$���
��z$reduce_columns.<locals>.visit_binaryNr�)r�r;�
OrderedSetr{r�rrfr�r:�NoReferencedColumnError�NoReferencedTableErrorrirjr�rr�)rVr]r�r`r�r��fkr|�fk_colrLr�rZrkr[r\ysL

�
�
�
���
csH�r	�r	t�d��dd�������fdd�}g�t�|id|i��S)z9traverse an expression and locate binary criterion pairs.zSCan only specify one of 'consider_as_foreign_keys' or 'consider_as_referenced_keys'cSs
|�|�Sr�)�compare)rQrRrZrZr[�col_is�s
z"criterion_as_pairs.<locals>.col_iscs��s
|jtjur
dSt|jt�rt|jt�sdS�rV|j�vr6�|j|j�s+|j�vr6��|j|jf�dS|j�vrR�|j|j�sG|j�vrT��|j|jf�dSdSdS�r�|j�vrt�|j|j�si|j�vrt��|j|jf�dS|j�vr��|j|j�s�|j�vr���|j|jf�dSdSdSt|jt�r�t|jt�r�|j�	|j�r���|j|jf�dS|j�	|j�rȈ�|j|jf�dSdSdSdSr�)
r�rrgr�r�r)r�rdr0�
referencesrJ��any_operatorrtrU�consider_as_referenced_keys�pairsrZr[rL�sR�
�

�
�
�

�
���z(criterion_as_pairs.<locals>.visit_binaryr�)r:�
ArgumentErrorrr�)�
expressionrUrxrwrLrZrvr[�criterion_as_pairs�s�'r|c@s|eZdZdZdZ						d%d&dd�Zer)ed'dd��Zed(dd��Zd)dd�Ze	j
fdd�Ze	�d�	d*d+d#d$��Z
dS),rPaYClones 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�equivalents�adapt_on_names�adapt_from_selectablesNFr~rEr��Optional[_EquivalentColumnMap]r�)Optional[Callable[[ClauseElement], bool]]r�r�r��anonymize_labelsr��!Optional[AbstractSet[FromClause]]cCs@|g|d�|_||_||_||_t�|pi�|_||_||_dS)N)rOr�)	r}r~rr�r;�column_dictr�r�r�)r�r~r�rr�r�r�r�rZrZr[r5s�
zClauseAdapter.__init__�obj�
Literal[None]rWr�cCrZr�rZ�r�r�rZrZr[r�L�zClauseAdapter.traverser8cCrZr�rZr�rZrZr[r�Wr�r�cCrZr�rZr�rZrZr[r�ZscCs�|jj||d�}|dur1||jvr1||vr1|j|D]}|j|||�|g�d�}|dur0|Sq|jrE|durEt|t�rE|jj�	|j
�}|S)N��require_embedded)r��_seen)r~�corresponding_columnr��_corresponding_columnr}r�r�r-�exported_columns�getrj)r�r�r�r��newcol�equivrZrZr[r�^s(�
����z#ClauseAdapter._corresponding_columnzsqlalchemy.sql.functionsr��_include_singleton_constants�
Optional[_ET]cCs6tjj}|jr|�|�sdS|jr|�|�rdSt|t�rOt||j�sO|j�	|�r@|j
r=|j
D]}|�	|�r:|jSq/dS|jSt|t�rMt|jt
�rM|SdSt|t�sVdS|s]|jr]dSd|jvrg|jd}trpt|t�spJ�|j
r�||jvr�|j
D]
}|j�|d�dur�nq{dStr�t|t�s�J�|j|dd�S)N�adapt_columnFTr�)r;�	preloaded�
sql_functionsrr�r�r2�FunctionElementr~rcr�r1r�r7r)�_is_singleton_constantr�rr+r�r|r�r�)r�r�r��	functions�adprZrZr[r�vsR�

��





��zClauseAdapter.replace)NNNFFN)r~rEr�r�rr�r�r�r�r�r�r�r�r��r�r�rWr��r�r8rWr8�r�r�rWr�)F)r�r8r�r�rWr�)r�r�r�rr�rrrr�r;�	EMPTY_SETr��preload_moduler�rZrZrZr[rPs*
�


��rPc@sNeZdZeddd��Zeddd��Zedd	d��Zeddd��Zdd
d�ZdS)�
_ColumnLookupr:r�rWcCrZr�rZ�r�r:rZrZr[�__getitem__�r�z_ColumnLookup.__getitem__�ColumnClause[Any]cCrZr�rZr�rZrZr[r��r�rOcCrZr�rZr�rZrZr[r��r�r8cCrZr�rZr�rZrZr[r��r�rcCrZr�rZr�rZrZr[r��sN)r:r�rWr�)r:r�rWr�)r:rOrWrO)r:r8rWr8)r:rrWr)r�r�r�rr�rZrZrZr[r��sr�cs�eZdZUdZdZded<								d4d5�fdd�
ZGdd�d�Zdd�Ze	d6d d!��Z
e	d7d#d!��Z
d8d%d!�Z
d9�fd(d)�ZerKe
d:d+d,��Ze
ZejZd;d0d1�Zd;d2d3�Z�ZS)<�
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

    )rV�adapt_required�allow_label_resolve�_wrap�__weakref__r�rVNFTr~rEr�r�r�r�rr�r�r�r�r�r�r�c

	sZt�j|||||||	d�t�|j�|_|js|jr"|�||j�|_||_	||_
d|_dS)N)rr�r�r�r�)�superrr;�WeakPopulateDict�_locate_colrVrr��_IncludeExcludeMappingr�r�r�)
r�r~r�r�rr�r�r�r�r���	__class__rZr[r�s�

zColumnAdapter.__init__c@seZdZdd�Zdd�ZdS)z$ColumnAdapter._IncludeExcludeMappingcCrr�)�parentrV)r�r�rVrZrZr[rrz-ColumnAdapter._IncludeExcludeMapping.__init__cCsL|jjr
|j�|�r|jjr!|j�|�r!|jjr|jjj|S|S|j|Sr�)r�rr�r�rVr�rZrZr[r�s�
��
�
z0ColumnAdapter._IncludeExcludeMapping.__getitem__N)r�r�r�rr�rZrZrZr[r�sr�cCs>t�|�}||_t�|j�|_|js|jr|�||j�|_|Sr�)	�copyr�r;r�r�rVrr�r�)r�rR�acrZrZr[�wrap%s
zColumnAdapter.wrapr�r�rWr�cCrZr�rZr�rZrZr[r�.r�zColumnAdapter.traverser8cCrZr�rZr�rZrZr[r�1r�r�cCs
|j|Sr�)rVr�rZrZr[r�4s
�visitorrHcst|t�sJ�t��|�Sr�)r�r�r�r)r�r�r�rZr[r9szColumnAdapter.chain�Iterator[ColumnAdapter]cCrZr�rZrrZrZr[�visitor_iterator@r�zColumnAdapter.visitor_iteratorr�rOrucCs*|j|}||ur|�|d�durdS|S)NT)rVr�)r�r�r�rZrZr[�adapt_check_presentFs
z!ColumnAdapter.adapt_check_presentcCs�|jr|jD]}|j|dd�}|durnq|}nt�||�}|jr.|j�|�}|dur.|}|jr7||ur7dS||ur?|j|_	|S)NT)r�)
�
_is_immutabler�r�rPr�r�r�r�r��_allow_label_resolve)r�r��visr|�c2rZrZr[r�Ps$
��
zColumnAdapter._locate_col)NFNNFTFN)r~rEr�r�r�r�rr�r�r�r�r�r�r�r�r�r�r�r�r�r�)r�rHrWr�)rWr�)r�rOrWru)r�r�r�rr�r�rr�r�rr�rr�propertyr��adapt_clauserP�copy_and_process�
adapt_listr�r��
__classcell__rZrZr�r[r��s8
�	


r�r�r?rj�
Optional[str]�type_�"Optional[_TypeEngineArgument[int]]�ColumnElement[int]cCstjtj|||d�S)z�Convert 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.

    )rjr�)r�expectr�LimitOffsetRole)r�rjr�rZrZr[�_offset_or_limit_clause}s
�r�cCs*|durdSt|d�r|j}t�|�S|S)zdReturn the offset or limit clause as a simple integer if possible,
    else return the clause.

    N�_limit_offset_value)�hasattrr�r;�asint)r�r�rZrZr[�)_offset_or_limit_clause_asint_if_possible�s

r��limit_clause�
offset_clause�startr��stop�ATuple[Optional[ColumnElement[int]], Optional[ColumnElement[int]]]cCs�|dur5|dur5t|�}|durd}|dkr||}|dkr!d}n
|dus'J�t|�}t||�}||fS|durE|durEt|�}||fS|durm|durmt|�}|durWd}|dkr_||}|dkrid}||fSt|�}||fS)z0Compute LIMIT/OFFSET in terms of slice start/endNr)r�r�)r�r�r�r�rZrZr[�_make_slice�s<�����r�)NN)
rQr2rRr2rSrTrUrVrWrX)r]r^r_r2rWr`)r]rkrlr2rWr`)r]rkr_rCrtrurWr`)r�r�r�rOrWr�)r�r'r�r�r�r�r�r�r�r�r�r�rWr�)r�rrWr)r�r2rWr�)r�r2r�r2rWr�)rCrNrDrErWrNr�)r�rTr�rTrOrTrWrT)rVrWr]rXr�r�rWrY)rVrDr]rXr�r�rWr^)rVrDr]rXr�r�rWr_)NNF)r�r?rjr�r�r�rWr�)r�r?rWr?)
r�r?r�r?r�r�r�r�rWr�)~r�
__future__r�collectionsrr��	itertoolsr�typingrrrrr	r
rrr
rrrrrrrr
rrrr�_typingr�
annotationrrr�baserr �	cache_keyr!�ddlr"r.r#r$r%r&r'r(r)r*r+r,r-r.r/�schemar0r~r1r2r3r4r5r6r7r8r:r;�util.typingr<r=r>r?r@rArBrCrDrErFrGrH�engine.interfacesrIrJrKrL�
engine.rowrMrNr\rjrsr�r�r�r�r�r�r�r�ror�r�r�r�r�r�r�r�r�rrrNrUr\r|�ReplacingExternalTraversalrPr�r�r�r�r�rZrZrZr[�<module>s�
$

,
9E�
+/




K�
V
�?50�

@ Telegram