관리-도구
편집 파일: util.cpython-37.pyc
B ��4][r � @ sf 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 ddlm Z ddl m Z ddl m Z ddl m Z ddl m!Z! ddl 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"d#� Z+d$d%� Z,d&d'� Z-d(d)� Z.dUd+d,�Z/d-d.� Z0d/d0� Z1d1d2� Z2d3d4� Z3d5d6� Z4d7d8� Z5dVd:d;�Z6d<d=� Z7d>d?� Z8d@dA� Z9G dBdC� dCe:�Z;G dDdE� dEe;�Z<G dFdG� dGe;�Z=dHdI� Z>dWdKdL�Z?dMdN� Z@dXdOdP�ZAG dQdR� dRejB�ZCG dSdT� dTeC�ZDdJS )Yz;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)�Null)�UnaryExpression)�Column)�Alias)� FromClause)� FromGrouping)�Join)� ScalarSelect)� SelectBase)� TableClause� )�exc)�utilz.sql.util.join_conditionc C sL t t|��}g }x6t| �D ]*\}}x |D ]}|�|�r(|�|� q(W qW |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)�clauses�join_to� selectables�idx�i�f�s� r, �F/opt/alt/python37/lib64/python3.7/site-packages/sqlalchemy/sql/util.py�find_join_source1 s r. c C s� t t|��}g }x8t| �D ],\}}x"|D ]}|�|�r(|�|� P q(W qW t|�dkr�g }xD|D ]<}| | }x.|D ]&}tt|���t|��rr|�|� P qrW q`W |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) r% Z join_fromr' Z liberal_idxr) r* r+ Zconservative_idxr( r, r, r- �#find_left_clause_that_matches_givenK s& r3 c s g }t t|��}t� �dkr2|dk r2d}t|�}nd}d}xtt� �D ]h\}}x^|�|g�D ]N} |r�t |j��| j��|�r�|� |� P qZt � || �s�|dk rZ|� |� P qZW qDW t|�dkr�t t dd� � D �� ��� �fdd�|D �}|�s|dk �rt t� ��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 r, )r Z _hide_froms)�.0r* r, r, r- � <listcomp>� s z1find_left_clause_to_join_from.<locals>.<listcomp>c s g | ]}� | �kr|�qS r, r, )r4 r) )r% �toremover, r- r5 � s )r0 r r/ r r" � difference�c�union� issupersetr$ r Z _can_joinr �range) r% r& �onclauser( r' Zresolve_ambiguityZcols_in_onclauser) r* r+ r, )r% r6 r- � find_left_clause_to_join_fromu s. r= c s$ g �� ��fdd��t �|�� 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. c 3 s� t | t�r| V n�| jdkr�t�| j�r���d| � x6�| j�D ](}x"�| j�D ]}� �d ||� qPW q@W �� d� xT| � � D ] }�|� q�W n:t | t �r�| V x(| � � D ] }x�|�D ] }|V q�W q�W d S )N�binaryr ) � isinstancer Z__visit_name__r Z is_comparison�operator�insert�left�right�pop� get_childrenr )�element�l�r�elem�e)�fn�stack�visitr, r- rM � s z#visit_binary_product.<locals>.visitN)r! )rK �exprr, )rK rL rM r- �visit_binary_product� s #rO Fc s� g � i }|r � j |d< |d< |r,� j |d< |r:� j |d< |r^� fdd� |d< |d< |d < |rv� fd d �}||d < � j |d < t�| ddi|� � S )z1locate Table objects within the given expression.�selectZcompound_select�join�aliasc s � � | j�S )N)r$ �table)�ent)�tablesr, r- �<lambda> � z find_tables.<locals>.<lambda>rA �update�deletec s � � | j� d S )N)r$ rS )�column)rU r, r- � visit_column s z!find_tables.<locals>.visit_columnrZ rS Zcolumn_collectionsF)r$ r �traverse)�clauseZ check_columnsZinclude_aliasesZ include_joinsZinclude_selectsZ include_crudZ _visitorsr[ r, )rU r- � find_tables� s r^ c C s� t �� }g }t| g�}x�|r�|�� }t|t�r~t|t�rDt�|j �s~t|t �rT|j }t|t �r`q||kr�|� |� |�|� qx|�� D ]}|�|� q�W qW |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 rF r �addr$ rE )r] �cols�resultrL �tr8 r, r, r- �unwrap_order_by s$ rf c C s dd� }t �| i |�S )Nc S s t | ttf�r| jS d S )N)r? r r rF )rI r, r, r- �replace* s z'unwrap_label_reference.<locals>.replace)r Zreplacement_traverse)rF rg r, r, r- �unwrap_label_reference) s rh c s2 t dd� | D ��� � fdd�tdd� |D �� 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 g | ]}|j d k r|jn|�qS )N)Z_order_by_label_elementrF )r4 �colr, r, r- r5 : s z4expand_column_list_from_order_by.<locals>.<listcomp>c s g | ]}|� kr|�qS r, r, )r4 ri )�cols_already_presentr, r- r5 @ s c S s g | ] }t |��qS r, )rf )r4 �or, r, r- r5 A s )r0 r )ZcollistZorder_byr, )rj r- � expand_column_list_from_order_by1 s rl c C s& x t |�D ]}| |kr dS q W dS dS )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)r1 )r] �searchrI r, r, r- �clause_is_presentF s rn c c sV | g}xJ|rP|� � }|V t|t�r8|�|j|jf� qt|t�r|�|j� qW d S )N) rD r? r �extendrB rC r r$ rF )r] rL rI r, r, r- r1 V s r1 c c s| | g}xp|rv|� � }t|ttf�r(|V t|t�rF|�|j|jf� qt|t�r^|� |j � qt|t �r|� |j � qW d S )N) rD r? r r r ro rB rC r r$ rF r rS )r] rL rI r, r, r- �surface_selectables_onlya s rp Tc c sb t f}|s|tf7 }t| g�}x>|r\|�� }|V x&|�� D ]}t||�rLq<|�|� q<W q W dS )z�traverse 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` rE r? r$ )r] Zinclude_scalar_selectsZfilter_rL rI �subr, r, r- �surface_column_elementso s rr c C s t tt| ���t|���S )z:Return True if left/right have some overlapping selectable)�boolr0 r1 r2 )rB rC r, r, r- �selectables_overlap� s rt 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 )N)r$ Zeffective_value)�bind)�vr, r- �visit_bindparam� s z$bind_values.<locals>.visit_bindparamZ bindparam)r r\ )r] rw r, )rv r- � bind_values� s rx c C s, t | tj�r | �dd�} d| S t| �S d S )N�'z''z'%s')r? r � string_typesrg �repr)rF r, r, r- �_quote_ddl_expr� s r| c @ s$ e Zd ZdZdZdZdZdd� ZdS )� _repr_baser r r )� max_charsc C sP t |�}t|�}|| jkrL| jd }|d|� d|| j || d � }|S )Nr r z# ... (%d characters truncated) ... )r{ r/ r~ )�self�value�repZlenrepZsegment_lengthr, r, r- �trunc� s (z_repr_base.truncN)�__name__� __module__� __qualname__�_LIST�_TUPLE�_DICT� __slots__r� r, r, r, r- r} � s r} c @ s& e Zd ZdZdZd dd�Zdd� ZdS ) � _repr_rowz Provide a string view of a row.)�row�, c C s || _ || _d S )N)r� r~ )r r� r~ r, r, r- �__init__� s z_repr_row.__init__c s: | j � dd�� fdd�| jD ��t| j�dkr2dndf S )Nz(%s%s)z, c 3 s | ]}� |�V qd S )Nr, )r4 r� )r� r, r- � <genexpr>� s z%_repr_row.__repr__.<locals>.<genexpr>r �,� )r� rQ r� r/ )r r, )r� r- �__repr__� s z_repr_row.__repr__N)r� )r� r� r� �__doc__r� r� r� r, r, r, r- r� � s r� c @ s6 e Zd ZdZdZd dd�Zdd� Zdd � Zd d � Zd S )� _repr_paramsz�Provide 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. )�params�batches�, c C s || _ || _|| _d S )N)r� r� r~ )r r� r� r~ r, r, r- r� � s z_repr_params.__init__c C s t | jt�r0| j}| jo,t | jd tttf�}nTt | jt�r`| j}| jo\t | jd tttf�}n$t | jt�rx| j}d}n | �| j�S |r�t | j�| j kr�d}d� | � | jd | j d � |�dd� || j t | j�f | � | jdd � |�dd � f�S |�r | � | j|�S | � | j|�S d S ) Nr Fz8 ... displaying %i of %i total bound parameter sets ... � r ������r )r? r� r! r� �dict�tupler� r� r� r/ r� rQ � _repr_multir� )r �typZismulti�msgr, r, r- r� � s, "z_repr_params.__repr__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 %sz, c 3 s | ]}�� |� �V qd S )N)r� )r4 r� )� elem_typer r, r- r� s z+_repr_params._repr_multi.<locals>.<genexpr>r� z[%s]z(%s)) r? r! r� r� r� r� r� �AssertionError�typerQ )r Z multi_paramsr� �elementsr, )r� r r- r� � s z_repr_params._repr_multic s� | j � || jkr0dd�� fdd�|�� D �� S || jkrjdd�� fdd�|D ��t|�dkrbdnd f S d d�� fd d�|D �� S d S ) Nz{%s}z, c 3 s" | ]\}}d |� |�f V qdS )z%r: %sNr, )r4 �keyr� )r� r, r- r� s z,_repr_params._repr_params.<locals>.<genexpr>z(%s%s)c 3 s | ]}� |�V qd S )Nr, )r4 r� )r� r, r- r� " s r r� r� z[%s]c 3 s | ]}� |�V qd S )Nr, )r4 r� )r� r, r- r� & s )r� r� rQ �itemsr� r/ )r r� r� r, )r� r- r� s z_repr_params._repr_paramsN)r� ) r� r� r� r� r� r� r� r� r� r, r, r, r- r� � s !r� 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 )N) r? rB r Z_identifying_keyrC r r �is_r@ Zisnot�negate)r> )�nullsr, r- � visit_binary/ s z-adapt_criterion_to_null.<locals>.visit_binaryr> )r Zcloned_traverse)Zcritr� r� r, )r� r- �adapt_criterion_to_null) s r� Nc C s� | d kr |S |d fg}t | �}d }xz|r�|�� \}}t|t�rv||k rv|�� }|�� |�|j�|_|�|j |f� n |�|�}|d k r�||_ |d kr$|}q$W |S )N) � ClauseAdapterrD r? r Z_cloneZ_reset_exportedr\ r< r$ rB )rB rC �stop_onrL �adapter�retZ prevrightr, r, r- � splice_joinsD s$ r� c s* |� dd�}|� dd��t�� �� t�� �x�� D ]�}x�tdd� |jD �� D ]�}x�� D ]~}||krbqTy |j}W n> tjk r� |r�wTn� Y n tj k r� |r�wTn� Y nX |� |�rT�r�|j |j krT�� |� P qTW qJW q0W |�r � ��fdd�}x&|D ] } | dk r�t �| i d |i� q�W 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 S s g | ] }|j �qS r, )Z foreign_keys)r4 r8 r, r, r- r5 x s z"reduce_columns.<locals>.<listcomp>c s~ | j tjkrzt�tdd� � ���D �� �}| j|krz| j|krzx:t � �D ].}|� | j�rH�rj|j | jj krH�� |� P qHW d S )Nc S s g | ] }|j �qS r, )� proxy_set)r4 r8 r, r, r- r5 � s z8reduce_columns.<locals>.visit_binary.<locals>.<listcomp>) r@ r �eqr r_ r r7 rB rC �reversed�shares_lineage�namerb )r> rc r8 )�columns�omitr� r, r- r� � s z$reduce_columns.<locals>.visit_binaryNr> )rD r Zordered_column_setr_ r r� rZ r ZNoReferencedColumnErrorZNoReferencedTableErrorr� r� rb r r\ r r7 ) r� r% �kwr� ri Zfkr8 Zfk_colr� r] r, )r� r� r� r- �reduce_columns] s: r� 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 )N)�compare)�a�br, r, r- �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 )N) r@ r r� r? rB r rC r$ r Z references)r> )� any_operatorr� �consider_as_foreign_keys�consider_as_referenced_keys�pairsr, r- r� � s: z(criterion_as_pairs.<locals>.visit_binaryr> )r � ArgumentErrorr r\ )Z expressionr� r� r� r� r, )r� r� r� r� r� r- �criterion_as_pairs� s 'r� c @ s0 e Zd ZdZd dd�Zejfdd�Zdd � 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 C s: |g|d�| _ || _|| _|| _t�|p*i �| _|| _d S )N)r� �anonymize_labels)Z__traverse_options__� selectable� include_fn� exclude_fnr Z column_dict� equivalents�adapt_on_names)r r� r� r� r� r� r� r, r, r- r� s zClauseAdapter.__init__c C s� | j j||d�}|d krb|| jkrb||krbx6| j| D ](}| j|||�|g�d�}|d k r6|S q6W | jr�|d kr�| j j�|j�}|S )N)�require_embedded)r� �_seen) r� Zcorresponding_columnr� �_corresponding_columnr9 r� r8 �getr� )r ri r� r� ZnewcolZequivr, r, r- r� s z#ClauseAdapter._corresponding_columnc C sb t |t�r | j�|�r | jS t |t�s*d S | jr>| �|�s>d S | jrR| �|�rRd S | �|d�S d S )NT)r? r r� r# r r� r� r� )r ri r, r, r- rg ( s zClauseAdapter.replace)NNNFF) r� r� r� r� r� r Z EMPTY_SETr� rg r, r, r, r- r� � s r� c @ s\ e Zd ZdZddd�ZG dd� de�Zd d � Zd d � ZeZ e j Z d d� Z dd� Zdd� 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 C sX t j| ||||||d� t�| j�| _| js2| jrB| �| | j�| _|| _ || _ d | _ d S )N)r� r� r� r� ) r� r� r �populate_column_dict� _locate_colr� r� r� �_IncludeExcludeMapping�adapt_required�allow_label_resolve�_wrap) r r� r� r� r� r� r� r� r� r, r, r- r� V s zColumnAdapter.__init__c @ s e Zd Zdd� Zdd� ZdS )z$ColumnAdapter._IncludeExcludeMappingc C s || _ || _d S )N)�parentr� )r r� r� r, r, r- r� s s z-ColumnAdapter._IncludeExcludeMapping.__init__c C sL | j jr| j �|�r(| j jrB| j �|�rB| j jr>| j jj| S |S | j| S )N)r� r� r� r� r� )r r� r, r, r- � __getitem__w s z0ColumnAdapter._IncludeExcludeMapping.__getitem__N)r� r� r� r� r� r, r, r, r- r� r s r� c C sP | j �| j �}|j�| j� ||_t�|j�|_|j s<|j rL| � ||j�|_|S )N) � __class__�__new__�__dict__rX r� r r� r� r� r� r� r� )r r� Zacr, r, r- �wrap� s zColumnAdapter.wrapc C s | j | S )N)r� )r �objr, r, r- r\ � s zColumnAdapter.traversec C sH t �| |�}| jr*| j�|�}|d k r*|}| jr<||kr<d S | j|_|S )N)r� r\ r� r� r� r� Z_allow_label_resolve)r ri r8 Zc2r, r, r- r� � s zColumnAdapter._locate_colc C s | j �� }|d= |S )Nr� )r� �copy)r �dr, r, r- � __getstate__� s zColumnAdapter.__getstate__c C s | j �|� t�| j�| _d S )N)r� rX r Z PopulateDictr� r� )r �stater, r, r- � __setstate__� s zColumnAdapter.__setstate__)NFNNFTF)r� r� r� r� r� �objectr� r� r\ Z adapt_clauser� Zcopy_and_processZ adapt_listr� r� r� r, r, r, r- r� 7 s r� )FFFFF)T)N)NNF)Er� � collectionsr � itertoolsr r� r r � annotationr r r �baser r Zddlr r� r r r r r r r r r Zschemar r� r r r r r r r r r Z langhelpersZpublic_factoryZ_join_conditionZjoin_conditionr. r3 r= rO r^ rf rh rl rn r1 rp rr rt rx r| r� r} r� r� r� r� r� r� ZReplacingCloningVisitorr� r� r, r, r, r- �<module> sz *4@ " Z M ;P