관리-도구
편집 파일: util.cpython-38.pyc
U -?�fͻ � @ s� d Z ddlmZ ddlmZ ddlZddlmZ ddlZddlm Z ddlm Z ddlm Z dd lm Z dd lm Z dd lmZ dd lmZ dd lmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ddlm 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+m,Z, dd$l+m-Z- dd%l+m.Z. dd&l+m/Z/ dd'l+m0Z0 dd(l+m1Z1 dd)l+m2Z2 dd*l+m3Z3 dd+l+m4Z4 dd,l+m5Z5 dd-l+m6Z6 dd.l+m7Z7 dd/l+m8Z8 dd0l9m:Z: dd1l;m<Z< dd2l;m=Z= dd3l;m>Z> dd4l;m?Z? dd5l;m@Z@ dd6l;mAZA dd7l;mBZB dd8l mCZC d9d:lmDZD d9d;lmEZE d9d<lFmGZG d9d=lFmHZH ej�r�dd>l mIZI dd?l mJZJ dd@l mKZK ddAl+mLZL ddBl+mMZM ddCl;mNZN ddDl;mOZO ddEl;mPZP ddFl mQZQ ddGl mRZR ddHl mSZS d9dIlTmUZU d9dJlTmVZV d9dKlTmWZW d9dLlTmXZX d9dMlYmZZZ edNdOdP�Z[d�dQdQdRdSdTdU�dVdW�Z\dXdQdYdZ�d[d\�Z]d]dQdYd^�d_d`�Z^d]dadbdYdc�ddde�Z_dfdOdgdh�didj�Z`dkdkdkdkdkdl�dmdndndndndndodp�dqdr�Zadsdsdt�dudv�Zbdwdx� Zcdydz� Zdd{d|� ZedQd}dt�d~d�Zfd�d�� Zgd�d�� Zhd�d�� ZidQdQdnd��d�d��Zjd�d�� Zkd�d�� ZlG d�d�� d��Zmd�d�� ZnG d�d�� d�em�ZoG d�d�� d�ep�ZqG d�d�� d�em�ZrdNd�dNd��d�d��Zsd�dRdRdRdRd��d�d��Zted�d�dnd�d��d�d���Zued�d�dnd�d��d�d���Zud�d�dnd�d��d�d��Zud�d�d��ZvG d�d�� d�e jw�ZxG d�d�� d�eH�ZyG d�d�� d�ex�Zzd�d�d�d�d�d��d�d��Z{d�d�dt�d�d��Z|d�d�d�d�d�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])�boundr2 zOptional[FromClause]z(Optional[AbstractSet[ColumnClause[Any]]]zColumnElement[bool])�a�b�a_subset�consider_as_foreign_keys�returnc C s t j| |||d�S )a Create 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". )rS rT )r4 Z_join_condition)rQ rR rS rT � rV �C/opt/hc_python/lib64/python3.8/site-packages/sqlalchemy/sql/util.py�join_condition_ s �rX zList[FromClause]z List[int])�clauses�join_torU c C sD t t|��}g }t| �D ]&\}}|D ]}|�|�r$|�|� q$q|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)rY rZ � selectables�idx�i�f�srV rV rW �find_join_source� s rd zSequence[FromClause])rY � join_fromrU c C s� t t|��}g }t| �D ]*\}}|D ] }|�|�r$|�|� qq$qt|�dkr�g }|D ]:}| | }|D ](}tt|���t|��rh|�|� qXqhqX|r�|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 ) r[ r r\ r] r^ �len�set�surface_selectables� intersection) rY re r_ Z liberal_idxra rb rc Zconservative_idxr` rV rV rW �#find_left_clause_that_matches_given� s( � rj rC � Optional[ColumnElement[Any]])rY rZ �onclauserU c s g }t t|��}t� �dkr2|dk r2d}t|�}nd}d}t� �D ]t\}}|�|g�D ]^} |r�|dk sjt�t |j��| j�� |�r�|� |� qBqV|dk s�t � || �rV|� |� qBqVqBt|�dkr�t t dd� � D �� ��� �fdd�|D �}|�s|dk �rttt� ���S |S dS )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 S s g | ]}t |j��qS rV )r Z _hide_froms)�.0rb rV rV rW � <listcomp>� s z1find_left_clause_to_join_from.<locals>.<listcomp>c s g | ]}� | �kr|�qS rV rV )rm ra �rY ZtoremoverV rW rn � s )rg r rf r# r\ � difference�AssertionError�c�union� issupersetr^ r4 Z _can_joinr r[ �range) rY rZ rl r` r_ Zresolve_ambiguityZcols_in_onclausera rb rc rV ro rW � find_left_clause_to_join_from� s2 �rv zOCallable[[BinaryExpression[Any], ColumnElement[Any], ColumnElement[Any]], None]�None)�fn�exprrU c s0 g �ddd�� ��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:: 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. r' z Iterator[ColumnElement[Any]])�elementrU c 3 s� t | t�r| V n�| jdkr�t�| j�r���d| � �| j�D ]$}�| j�D ]}� �d ||� qLq>�� d� | � � D ] }�|� qvn,t | t �r�| V | � � D ]}�|�E d H q�d S )N�binaryr ) � isinstancer5 Z__visit_name__r Z is_comparison�operator�insert�left�right�pop� get_childrenr( )rz �l�r�elem�rx �stack�visitrV rW r� . s � z#visit_binary_product.<locals>.visitN)r[ )rx ry rV r� rW �visit_binary_product s ( r� F)� check_columns�include_aliases� include_joins�include_selects� include_crudr' �boolzList[TableClause])�clauser� r� r� r� r� rU c s� g � i }|r � j |d< |d< |r,� j |d< |rR� j |d< |d< |d< |d< |rv� fdd � |d < |d < |d < |r�� fd d�}||d< � j |d< t�| i |� � S )z1locate Table objects within the given expression.�selectZcompound_select�join�aliasZsubqueryZ tablesampleZlateralc s � � | j�S �N�r^ �table)Zent�ZtablesrV rW �<lambda>b � z find_tables.<locals>.<lambda>r~ �update�deletec s � � | j� d S r� r� )�columnr� rV rW � visit_columng s z!find_tables.<locals>.visit_columnr� r� )r^ r �traverse)r� r� r� r� r� r� Z _visitorsr� rV r� rW � find_tablesG s* �� � r� r )r� rU c C s� t �� }g }t| g�}|r�|�� }t|t�r�t|t�rBt�|j �s�t|t �r|t|j t �s||j }t|t �rn|j }|�|� qn t|t�r�|j }|�|� qt|t�r�q||kr�|�|� |�|� q|�� D ]}|�|� q�q|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 Zis_ordering_modifier�modifierr, rz r5 r* r^ r$ r% �addr� )r� �cols�resultr� �trr rV rV rW �unwrap_order_byr s> � � � r� c C s dddd�dd�}t �| i |�S )NrG r � Optional[ExternallyTraversible])rz �kwrU c [ s* t | t�r| jS t | t�r&ds&td��d S )NFz&can't unwrap a textual label reference)r| r$ rz r% rq )rz r� rV rV rW �replace� s z'unwrap_label_reference.<locals>.replace)r Zreplacement_traverse)rz r� rV rV rW �unwrap_label_reference� s r� c s6 dd� | D �� t tdd� |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. c S s h | ]}|j d k r|jn|�qS r� )Z_order_by_label_elementrz �rm �colrV rV rW � <setcomp>� s �z3expand_column_list_from_order_by.<locals>.<setcomp>c S s g | ] }t |��qS rV )r� )rm �orV rV rW rn � s z4expand_column_list_from_order_by.<locals>.<listcomp>c s g | ]}|� kr|�qS rV rV r� �Zcols_already_presentrV rW rn � s )r[ r )ZcollistZorder_byZ to_look_forrV r� rW � expand_column_list_from_order_by� s �r� c C s t |�D ]}| |kr dS qdS )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. TFN)rh )r� �searchr� rV rV rW �clause_is_present� s r� zIterator[FromClause]c c sR t | t�r,t| j�E d H t| j�E d H n"t | t�rHt| j�E d H n| V d S r� )r| r4 �tables_from_leftmostr r� r3 rz )r� rV rV rW r� � s r� c c sR | g}|rN|� � }|V t|t�r6|�|j|jf� qt|t�r|�|j� qd S r� ) r� r| r4 �extendr r� r3 r^ rz �r� r� r� rV rV rW rh � s rh c c s� | g}|r�|� � }t|ttf�r&|V t|t�rD|�|j|jf� qt|t�r\|� |j � qt|t �r�|j d k r~|� |j � q�|V q|d k r|V qd S r� ) r� r| r7 r1 r4 r� r r� r3 r^ rz r( r� r� rV rV rW �surface_selectables_only� s r� c C s\ t tf}t| g�}|rX|�� }||jkr2|j| S |�� D ]}t||�rJq:|�|� q:qd S r� )r3 r6 r r� � _annotationsr� r| r^ )r� Zannotation_name�filter_r� r� �subrV rV rW � extract_first_column_annotation� s r� )r r� rU c C s t tt| ���t|���S )z:Return True if left/right have some overlapping selectable)r� rg rh ri )r r� rV rV rW �selectables_overlap s �r� c s& g � � fdd�}t �| i d|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] c s � � | j� d S r� )r^ Zeffective_value)�bind��vrV rW �visit_bindparam s z$bind_values.<locals>.visit_bindparamZ bindparam)r r� )r� r� rV r� rW � bind_values s r� c C s* t | t�r | �dd�} d| S t| �S d S )N�'z''z'%s')r| �strr� �repr)rz rV rV rW �_quote_ddl_expr# s r� c @ sN e Zd ZU dZded< dZded< dZded< dZded < d d d �d d�ZdS )� _repr_baser �int�_LISTr �_TUPLEr9 �_DICT)� max_charsr� r r� )�valuerU c C sP t |�}t|�}|| jkrL| jd }|d|� d|| j || d � }|S )Nr9 r z# ... (%d characters truncated) ... )r� rf r� )�selfr� �repZlenrep�segment_lengthrV rV rW �trunc4 s �� ��z_repr_base.truncN) �__name__� __module__� __qualname__r� �__annotations__r� r� � __slots__r� rV rV rV rW r� + s r� c C s t � }d|_|�| �S )N�, )r� r� r� )r� �rprV rV rW �_repr_single_valueD s r� c @ s4 e Zd ZdZdZdddd�dd�Zd d �d d �Zd S )� _repr_rowz Provide a string view of a row.)�rowr� zRow[Any]r� �r� r� c C s || _ || _d S r� r� )r� r� r� rV rV rW �__init__O s z_repr_row.__init__r� �rU c s: | j � dd�� fdd�| jD ��t| j�dkr2dndf S )N�(%s%s)�, c 3 s | ]}� |�V qd S r� rV �rm r� �r� rV rW � <genexpr>V s z%_repr_row.__repr__.<locals>.<genexpr>r �,� )r� r� r� rf �r� rV r� rW �__repr__S s �z_repr_row.__repr__N)r� )r� r� r� �__doc__r� r� r� rV rV rV rW r� J s r� c @ s e Zd Zdd�dd�ZdS )�_long_statementr� r� c C sX t | �}|dkrJd}d}|| | }| d|� � d|� d| | d � � �S t�| �S d S )Ni� � �d r � ... z characters truncated ... )rf r� �__str__)r� Zlself�lleftZlrightr� rV rV rW r� \ s $�z_long_statement.__str__N)r� r� r� r� rV rV rV rW r� [ s r� c @ s� e Zd ZdZdZd%dddddd �d d �Zd d �dd�Zddd d�dd�Zddd�dd�Zddd d�dd �Z d d d�d d �Z d d d�d!d"�Z dd d�d#d$�Z dS )&� _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_paramsr� r� NzOptional[_AnyExecuteParams]r� zOptional[bool])r� r� r� r� r� c C s" || _ || _|| _|| _|| _d S r� )r� r� r� r� r� )r� r� r� r� r� r� rV rV rW r� t s z_repr_params.__init__r� r� c C s | j d kr| �| j�S t| jt�r*| j}n4t| jt�r>| j}n t| jt�rR| j }n | �| j�S | j r�t d| j�}t | j�| j kr�d}d� | �|d | j d � |�dd� || j t | j�f | �|dd � |�dd � f�S | �||�S n| �t d | j�|�S d S ) NrJ z8 ... displaying %i of %i total bound parameter sets ... � r9 r ������r rK )r� r� r� r| r[ r� �tupler� �dictr� r rf r� r� � _repr_multir� )r� �typ� multi_params�msgrV rV rW r� � sJ ��� ��� ��z_repr_params.__repr__rJ )r� r� rU c s� |rzt |d t�r�j� nDt |d t�r0�j� n.t |d t�rF�j� nds^tdt|d � ��d� � �fdd�|D ��}nd}|�jkr�d| S d | S d S ) Nr FzUnknown parameter type %sr� c 3 s | ]}�� |� �V qd S r� )r� )rm r� �Z elem_typer� rV rW r� � s z+_repr_params._repr_multi.<locals>.<genexpr>r� �[%s]z(%s)) r| r[ r� r� r� r� r� rq �typer� )r� r� r� �elementsrV r� rW r� � s" �� z_repr_params._repr_multiz Iterable[Any]r )r� rU c C sT t |�}t|�}|| jkrF| jd }|d|� || d � || j fS |d d fS d S )Nr9 r )r[ rf r� )r� r� ZlparamsZ lenparamsr� rV rV rW � _get_batches� s �z_repr_params._get_batchesrK )r� r� rU c C sB || j kr| �td|��S || jkr4| �td|��S | �|�S d S )NrL � Sequence[Any])r� �_repr_param_dictr r� �_repr_param_tuple�_repr_param_list)r� r� r� rV rV rW r� � s � z_repr_params._repr_paramsrL c s� | j � | �|�� �\}}}|rldd�� fdd�|D �� }|d|� d�7 }|dd�� fdd�|D �� 7 }n d d�� fd d�|D �� }|S ) Nz{%sr� c 3 s$ | ] \}}|�d � |�� �V qdS �z: NrV �rm �keyr� r� rV rW r� � s �z0_repr_params._repr_param_dict.<locals>.<genexpr>r� � parameters truncated ... z%s}c 3 s$ | ] \}}|�d � |�� �V qdS r rV r r� rV rW r� � s �z{%s}c 3 s$ | ] \}}|�d � |�� �V qdS r rV r r� rV rW r� � s �)r� r �itemsr� �r� r� Zitems_first_batchZitems_second_batchZtrunclen�textrV r� rW r � s0 �������z _repr_params._repr_param_dictr c s� | j � | �|�\}}}|rjdd�� fdd�|D �� }|d|� d�7 }|dd�� fdd�|D ��f 7 }n0d d�� fd d�|D ��t|�d kr�d nd f }|S )Nz(%sr� c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� s z1_repr_params._repr_param_tuple.<locals>.<genexpr>r� r z%s)c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� s r� c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� s r r� r� )r� r r� rf r rV r� rW r s& ��� �z _repr_params._repr_param_tuplec s� | j � | �|�\}}}|rhdd�� fdd�|D �� }|d|� d�7 }|dd�� fdd�|D �� 7 }n d d�� fd d�|D �� }|S ) Nz[%sr� c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� ' s z0_repr_params._repr_param_list.<locals>.<genexpr>r� r z%s]c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� + s r� c 3 s | ]}� |�V qd S r� rV r� r� rV rW r� / s )r� r r� r rV r� rW r s$ ����z _repr_params._repr_param_list)r� r� N) r� r� r� r� r� r� r� r� r r� r r r rV rV rV rW r� j s �- r� zCollection[Any])�crit�nullsrU c s � fdd�}t �| i d|i�S )zWgiven criterion containing bind params, convert selected elements to IS NULL. c sn t | jt�r:| jj� kr:| j| _t� | _tj| _tj | _ n0t | jt�rj| jj� krjt� | _tj| _tj | _ d S r� ) r| r r& Z_identifying_keyr� r. r �is_r} �is_not�negate�r{ �r rV rW � visit_binary: s � � � �z-adapt_criterion_to_null.<locals>.visit_binaryr{ )r Zcloned_traverse)r r r rV r rW �adapt_criterion_to_null4 s r )r r� �stop_onrU c C s� | d kr |S |d fg}t | �}d }|r�|�� \}}t|t�rl||k rl|�� }|�|j�|_|�|j|f� n |�|�}|d k r�|d k s�t �||_|d kr"|}q"|S r� ) � ClauseAdapterr� r| r4 Z_cloner� rl r^ r rq )r r� r r� �adapter�retZ prevrightrV rV rW � splice_joinsO s$ r z Iterable[ColumnElement[Any]]zOptional[ClauseElement]z Sequence[ColumnElement[Any]])�columnsrY r� rU c O s d S r� rV �r rY r� rV rV rW �reduce_columnsl s r rD z/Sequence[Union[ColumnElement[Any], TextClause]]c O s d S r� rV r rV rV rW r t s z1Collection[Union[ColumnElement[Any], TextClause]]c s4 |� dd�}|� dd��t�| �}|�dd� |D ��� t�� �� D ]�}tdd� |jD �� D ]�}� D ]�}||krpqbz |j}W nB tj k r� |r�Y qbn� Y n" tj k r� |r�Y qbn� Y nX |� |�rb�r�|j |j krb�� |� qZqbqZqB|�r*� ��fdd �} |D ]"} | d k �rt�| i d | i� �q|���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 s s | ]}t |�r|V qd S r� r �rm rr rV rV rW r� � s z!reduce_columns.<locals>.<genexpr>c S s g | ] }|j �qS rV )Z foreign_keysr rV rV rW rn � s z"reduce_columns.<locals>.<listcomp>c s| | j tjkrxt�tdd� � ���D �� �}| j|krx| j|krxt � �D ]0}|� | j�rF�rh|j | jj krF�� |� qxqFd S )Nc S s g | ] }|j �qS rV )� proxy_setr rV rV rW rn � s z8reduce_columns.<locals>.visit_binary.<locals>.<listcomp>) r} r �eqr; r� r rp r r� �reversed�shares_lineage�namer� )r{ r� rr �Z cset_no_textZomitr rV rW r � s �� � � z$reduce_columns.<locals>.visit_binaryNr{ )r� r; Z OrderedSetrp r� r r r� r: ZNoReferencedColumnErrorZNoReferencedTableErrorr# r$ r� r r� ) r rY r� r r� r� Zfkrr Zfk_colr r� rV r% rW r | sF � � � c sH �r�rt �d��dd� �� ����fdd�}g �t�| 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 s | � |�S r� )�compare)rQ rR rV rV rW �col_is� s z"criterion_as_pairs.<locals>.col_isc s~ � s| j tjk rd S t| jt�r,t| jt�s0d S �r�| j�krj�| j| j�sV| j�krj��| j| jf� n4| j�kr��| j| j�s�| j�kr���| j| jf� nڈ�r| j�kr܈| j| j�s�| j�kr܈�| j| jf� n:| j�k�rz�| j| j��s| j�k�rz��| j| jf� nbt| jt��rzt| jt��rz| j� | j��rX��| j| jf� n"| j� | j��rz��| j| jf� d S r� ) r} r r! r| r r) r� r^ r0 Z referencesr �� any_operatorr' rT �consider_as_referenced_keys�pairsrV rW r � sR � �� �� �� �� �z(criterion_as_pairs.<locals>.visit_binaryr{ )r: � ArgumentErrorr r� )� expressionrT r* r) r rV r( rW �criterion_as_pairs� s �'r. c @ s� e Zd ZdZdZd ddddddd d �d d �Zerhed dd�dd��Zeddd�dd��Zddd�dd�Ze j fdd�Z e � d�d dddd�dd ��Z dS ) 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 )�__traverse_options__� selectable� include_fn� exclude_fn� equivalents�adapt_on_names�adapt_from_selectablesNFrE � Optional[_EquivalentColumnMap]�)Optional[Callable[[ClauseElement], bool]]r� �!Optional[AbstractSet[FromClause]])r0 r3 r1 r2 r4 �anonymize_labelsr5 c C s@ |g|d�| _ || _|| _|| _t�|p*i �| _|| _|| _d S )N)r r9 ) r/ r0 r1 r2 r; Z column_dictr3 r4 r5 )r� r0 r3 r1 r2 r4 r9 r5 rV rV rW r� 4 s �zClauseAdapter.__init__� Literal[None]rw ��objrU c C s d S r� rV �r� r< rV rV rW r� K s zClauseAdapter.traverser8 c C s d S r� rV r= rV rV rW r� V s r� c C s d S r� rV r= rV rV rW r� Y s c C s� | j j||d�}|d krb|| jkrb||krb| j| D ],}| j|||�|g�d�}|d k r4| S q4| jr�|d kr�t|t�r�| j j� |j �}|S )N��require_embedded)r? �_seen) r0 �corresponding_columnr3 �_corresponding_columnrs r4 r| r- Zexported_columns�getr$ )r� r� r? r@ �newcol�equivrV rV rW rB ] s* � � ���z#ClauseAdapter._corresponding_columnzsqlalchemy.sql.functionsz Optional[_ET])r� � _include_singleton_constantsrU c C sB t jj}| jr | �|�s d S | jr0| �|�r0d S t|t�r�t||j�s�| j� |�r|| j rv| j D ]}|� |�r^ qvq^d S | jS t|t �r�t|j t �r�|S d S n t|t�s�d S |s�|jr�d S d|jkr�|jd }tr�t|t�s�t�| j �r || jk�r | j D ] }|j�|d�d k � r� �q � q�d S t�r4t|t��s4t�| j|dd�S )NZ adapt_columnFTr> )r; Z preloadedZ sql_functionsr1 r2 r| r2 ZFunctionElementr0 r] r5 r1 rz r7 r) Z_is_singleton_constantr� r r+ rq r3 rr rA rB )r� r� rF Z functionsZadprV rV rW r� u sR � � �zClauseAdapter.replace)NNNFFN)F)r� r� r� r� r� r� r r r� r; � EMPTY_SETrB Zpreload_moduler� rV rV rV rW r s( � � �r c @ sl e Zd Zeddd�dd��Zeddd�dd��Zeddd�dd��Zed d d�d d��Zd d d�d d�Zd S )� _ColumnLookuprw )r rU c C s d S r� rV �r� r rV rV rW � __getitem__� s z_ColumnLookup.__getitem__zColumnClause[Any]c C s d S r� rV rI rV rV rW rJ � s rO c C s d S r� rV rI rV rV rW rJ � s r8 c C s d S r� rV rI rV rV rW rJ � s r c C s d S r� rV rI rV rV rW rJ � r� N)r� r� r� r rJ rV rV rV rW rH � s rH c s� e Zd ZU dZdZded< d,dd d d d d d d d d � � fdd� ZG dd� d�Zdd� Ze ddd�dd��Z e ddd�dd��Z ddd�d d�Z d d d �� fd d � Z e r�e d!d"�d#d$��Ze ZejZd%d&d'�d(d)�Zd%d&d'�d*d+�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 )r �adapt_required�allow_label_resolve�_wrap� __weakref__rH r NFTrE r6 r� r7 r8 ) r0 r3 rL r1 r2 r4 rM r9 r5 c sZ t � j||||||| d� t�| j�| _| js4| jrD| �| | j�| _|| _ || _ d | _ d S )N)r1 r2 r4 r9 r5 ) �superr� r; �WeakPopulateDict� _locate_colr r1 r2 �_IncludeExcludeMappingrL rM rN ) r� r0 r3 rL r1 r2 r4 rM r9 r5 �� __class__rV rW r� � s � zColumnAdapter.__init__c @ s e Zd Zdd� Zdd� ZdS )z$ColumnAdapter._IncludeExcludeMappingc C s || _ || _d S r� )�parentr )r� rV r rV rV rW r� s z-ColumnAdapter._IncludeExcludeMapping.__init__c C sL | j jr| j �|�r(| j jrB| j �|�rB| j jr>| j jj| S |S | j| S r� )rV r1 r2 rN r rI rV rV rW rJ s � �� �z0ColumnAdapter._IncludeExcludeMapping.__getitem__N)r� r� r� r� rJ rV rV rV rW rS s rS c C s> t � | �}||_t�|j�|_|js*|jr:| �||j�|_|S r� ) �copyrN r; rQ rR r r1 r2 rS )r� r �acrV rV rW �wrap$ s zColumnAdapter.wrapr: rw r; c C s d S r� rV r= rV rV rW r� - s zColumnAdapter.traverser8 c C s d S r� rV r= rV rV rW r� 0 s r� c C s | j | S r� )r r= rV rV rW r� 3 s rH )�visitorrU c s t |t�st�t� �|�S r� )r| rK rq rP r )r� rZ rT rV rW r 8 s zColumnAdapter.chainzIterator[ColumnAdapter]r� c C s d S r� rV r� rV rV rW �visitor_iterator? s z ColumnAdapter.visitor_iteratorrO rk )r� rU c C s* | j | }||kr&| �|d�d kr&d S |S )NT)r rB )r� r� rD rV rV rW �adapt_check_presentE s z!ColumnAdapter.adapt_check_presentc C s� |j r2| jD ] }|j|dd�}|d k r q>q |}n t�| |�}| jr\| j�|�}|d k r\|}| jrn||krnd S ||k r~| j|_ |S )NT)rF ) � _is_immutabler[ r� r r� rN rR rL rM Z_allow_label_resolve)r� r� Zvisrr �c2rV rV rW rR O s zColumnAdapter._locate_col)NFNNFTFN)r� r� r� r� r� r� r� rS rY r r� r r �propertyr[ Z adapt_clauser Zcopy_and_processZ adapt_listr\ rR � __classcell__rV rV rT rW rK � s6 �$ rK r? z Optional[str]z"Optional[_TypeEngineArgument[int]]zColumnElement[int])rz r$ �type_rU c C s t jtj| ||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. )r$ ra )r �expectr ZLimitOffsetRole)rz r$ ra rV rV rW �_offset_or_limit_clause| s �rc c C s. | dkr dS t | d�r&| j}t�|�S | S dS )zdReturn the offset or limit clause as a simple integer if possible, else return the clause. N�_limit_offset_value)�hasattrrd r; Zasint)r� r� rV rV rW �)_offset_or_limit_clause_asint_if_possible� s rf r� zATuple[Optional[ColumnElement[int]], Optional[ColumnElement[int]]])� limit_clause� offset_clause�start�stoprU c C s� |dk rd|dk rdt |�}|dkr$d}|dkr4|| }|dkrBd}n|dk sNt�t|�}t|| �} nd|dkr~|dk r~t|�} nJ|dk r�|dkr�t |�}|dkr�d}|dkr�|| }|dkr�d}nt|�}| |fS )z0Compute LIMIT/OFFSET in terms of slice start/endNr )rf rq rc )rg rh ri rj rV rV rW � _make_slice� s6 � �rk )NN)N)NNF)NN)~r� � __future__r � collectionsr rW � itertoolsr �typingr r r r r r r r r r r r r r r r r� r r r r Z_typingr � annotationr r r �baser r � cache_keyr! Zddlr" r� r# r$ r% r& r' r( r) r* r+ r, r- r. r/ Zschemar0 r0 r1 r2 r3 r4 r5 r6 r7 r8 r: r; Z util.typingr< r= r> r? r@ rA rB rC rD rE rF rG rH Zengine.interfacesrI rJ rK rL Z engine.rowrM rN rX rd rj rv r� r� r� r� r� r� r� rh r� r� r� r� r� r� r� r� r� r� r� r r r r. ZReplacingExternalTraversalr rH rK rc rf rk rV rV rV rW �<module> s �$ ,9F� +/ K � V � ? 1 0 �