opt
/
hc_python
/
lib
/
python3.12
/
site-packages
/
sqlalchemy
/
sql
/
__pycache__
/
Go to Home Directory
+
Upload
Create File
root@0UT1S:~$
Execute
By Order of Mr.0UT1S
[DIR] ..
N/A
__init__.cpython-312.pyc
4.56 KB
Rename
Delete
_dml_constructors.cpython-312.pyc
3.88 KB
Rename
Delete
_elements_constructors.cpython-312.pyc
64.02 KB
Rename
Delete
_orm_types.cpython-312.pyc
606 bytes
Rename
Delete
_py_util.cpython-312.pyc
2.88 KB
Rename
Delete
_selectable_constructors.cpython-312.pyc
22.73 KB
Rename
Delete
_typing.cpython-312.pyc
14.53 KB
Rename
Delete
annotation.cpython-312.pyc
20.82 KB
Rename
Delete
base.cpython-312.pyc
95.58 KB
Rename
Delete
cache_key.cpython-312.pyc
34.79 KB
Rename
Delete
coercions.cpython-312.pyc
47.77 KB
Rename
Delete
compiler.cpython-312.pyc
265.58 KB
Rename
Delete
crud.cpython-312.pyc
44.38 KB
Rename
Delete
ddl.cpython-312.pyc
56.46 KB
Rename
Delete
default_comparator.cpython-312.pyc
19.01 KB
Rename
Delete
dml.cpython-312.pyc
72.51 KB
Rename
Delete
elements.cpython-312.pyc
206.64 KB
Rename
Delete
events.cpython-312.pyc
18.75 KB
Rename
Delete
expression.cpython-312.pyc
5.01 KB
Rename
Delete
functions.cpython-312.pyc
73.99 KB
Rename
Delete
lambdas.cpython-312.pyc
53.54 KB
Rename
Delete
naming.cpython-312.pyc
8.25 KB
Rename
Delete
operators.cpython-312.pyc
87.76 KB
Rename
Delete
roles.cpython-312.pyc
11.94 KB
Rename
Delete
schema.cpython-312.pyc
239.80 KB
Rename
Delete
selectable.cpython-312.pyc
255.19 KB
Rename
Delete
sqltypes.cpython-312.pyc
148.12 KB
Rename
Delete
traversals.cpython-312.pyc
41.34 KB
Rename
Delete
type_api.cpython-312.pyc
85.10 KB
Rename
Delete
util.cpython-312.pyc
53.05 KB
Rename
Delete
visitors.cpython-312.pyc
35.21 KB
Rename
Delete
� #��gߍ � �H � d Z ddlmZ ddlmZ ddlmZ ddlZddlZddl Z ddl m Z ddl m Z ddl m Z dd l m Z dd l mZ dd l mZ dd l mZ dd l mZ ddl mZ ddl mZ ddl mZ ddl mZ ddl mZ ddl mZ ddl mZ ddl mZ ddlmZ ddlm Z ddl m Z ddl m Z ddl m!Z! dd l m"Z" dd l m#Z# er d d l$m%Z% d d l&m'Z' e j. se s d d!l(m)Z) d d"l(m*Z+ n dd!l,m)Z) dd"l,m*Z+ g d#�Z- G d$� d%e"� Z. G d&� d'� Z/ G d(� d)e� Z0eee1e0f Z2 G d*� d+� Z3 G d,� d-e"� Z4 G d.� d/� Z5e0Z6dPd0�Z7e5jp Z8 e7� G d1� d2e3e/� Z9 ed3e9�4� Z: ed5d6�4� Z;e e:gdf Z< G d7� d8e"� Z= G d9� d:e"e: � Z> ed;d<�4� Z? G d=� d<e j� � ZA G d>� d?eA� ZB G d@� dAeB� ZCe/ZDeAZEeBZFeCZGe j� f dQdB�ZIe dRdC�� ZJe dSdD�� ZJ dTdE�ZJe dUdF�� ZKe dVdG�� ZK dWdH�ZKe dUdI�� ZLe dXdJ�� ZL dWdK�ZLe dYdL�� ZMe dZdM�� ZMe d[dN�� ZM d\dO�ZMy)]z5Visitor/traversal interface and library functions. � )� annotations)�deque)�EnumN)�Any)�Callable)�cast)�ClassVar)�Dict)�Iterable)�Iterator)�List)�Mapping)�Optional)�overload)�Tuple)�Type)� TYPE_CHECKING)�TypeVar)�Union� )�exc)�util)� langhelpers)�HAS_CYEXTENSION)�Literal)�Protocol)�Self� )�_AnnotationDict)� ColumnElement)�prefix_anon_map)�cache_anon_map) �iterate�traverse_using�traverse�cloned_traverse�replacement_traverse� Visitable�ExternalTraversal�InternalTraversal�anon_mapc � � e Zd Zdd�Zy)�_CompilerDispatchTypec � � y �N� )�_self�self�visitor�kws �H/opt/hc_python/lib64/python3.12/site-packages/sqlalchemy/sql/visitors.py�__call__z _CompilerDispatchType.__call__K s � �#� N)r2 r( r3 r r4 r �returnr ��__name__� __module__� __qualname__r6 r0 r7 r5 r- r- J s � �Mr7 r- c �x � � e Zd ZU dZdZded< ded< ej rd d�Zd � fd� Z e d d �� Z d d �Z � xZ S )r( a, Base class for visitable objects. :class:`.Visitable` is used to implement the SQL compiler dispatch functions. Other forms of traversal such as for cache key generation are implemented separately using the :class:`.HasTraverseInternals` interface. .. versionchanged:: 2.0 The :class:`.Visitable` class was named :class:`.Traversible` in the 1.4 series; the name is changed back to :class:`.Visitable` in 2.0 which is what it was prior to 1.4. Both names remain importable in both 1.4 and 2.0 versions. r0 �str�__visit_name__r- �_original_compiler_dispatchc � � y r/ r0 )r2 r3 r4 s r5 �_compiler_dispatchz Visitable._compiler_dispatchf s � �cr7 c �^ �� d| j v r| j � t �| � � y )Nr? )�__dict__�_generate_compiler_dispatch�super�__init_subclass__)�cls� __class__s �r5 rG zVisitable.__init_subclass__h s& �� � �s�|�|� +� � +� +� -� ��!�#r7 c �0 �� | j }d| j v r| j | _ y t |t � s#t j d| j � d�� �d|z }t j |� � d�fd� }|x| _ | _ y )NrB z__visit_name__ on class z$ must be a string at the class level�visit_%sc �| �� �|� } || fi |��S # t $ r } |j | |fi |��cY d}~S d}~ww xY w)zLook for an attribute named "visit_<visit_name>" on the visitor, and call it with the same kw params. N)�AttributeError� visit_unsupported_compilation)r2 r3 r4 �meth�err�getters �r5 rB zAVisitable._generate_compiler_dispatch.<locals>._compiler_dispatch� sQ �� � (� �g��� �D�'�B�'�'�� "� N�<�w�<�<�T�3�M�"�M�M�� N�s � � ;�6�;�;)r2 r( r3 r r4 r r8 r> ) r? rD rB r@ � isinstancer> r �InvalidRequestErrorr: �operator� attrgetter)rH � visit_name�namerB rQ s @r5 rE z%Visitable._generate_compiler_dispatchm s� �� ��'�'� � �3�<�<� /� /2�.D�.D�C� +� ��*�c�*��)�)�*�3�<�<�.� 9%� %�� � �J�&���$�$�T�*�� (�� (�&)� (�14� (� � (� � �� � � +r7 c � � | S r/ r0 )rH �keys r5 �__class_getitem__zVisitable.__class_getitem__� s � �� r7 )r3 r r4 r r8 r> �r8 �None)rY r r8 r )r: r; r< �__doc__� __slots__�__annotations__�typingr rB rG � classmethodrE rZ � __classcell__)rI s @r5 r( r( N sF �� � � �I���!6�6� ���I�$� �# � �# �Jr7 r( c �� � e Zd ZdZdZ dZ dZ dZ dZ dZ dZ d Z d Z d Z d Z d Z dZ dZ dZ dZ dZ dZ dZ dZ dZ dZ dZ dZ dZ dZ d Z d Z d Z d Z! d Z" d!Z# d"Z$ d#Z% d$Z& d%Z' d&Z( d'Z) d(Z*y))*r* a� Defines visitor symbols used for internal traversal. The :class:`.InternalTraversal` class is used in two ways. One is that it can serve as the superclass for an object that implements the various visit methods of the class. The other is that the symbols themselves of :class:`.InternalTraversal` are used within the ``_traverse_internals`` collection. Such as, the :class:`.Case` object defines ``_traverse_internals`` as :: class Case(ColumnElement[_T]): _traverse_internals = [ ("value", InternalTraversal.dp_clauseelement), ("whens", InternalTraversal.dp_clauseelement_tuples), ("else_", InternalTraversal.dp_clauseelement), ] Above, the :class:`.Case` class indicates its internal state as the attributes named ``value``, ``whens``, and ``else_``. They each link to an :class:`.InternalTraversal` method which indicates the type of datastructure to which each attribute refers. Using the ``_traverse_internals`` structure, objects of type :class:`.InternalTraversible` will have the following methods automatically implemented: * :meth:`.HasTraverseInternals.get_children` * :meth:`.HasTraverseInternals._copy_internals` * :meth:`.HasCacheKey._gen_cache_key` Subclasses can also implement these methods directly, particularly for the :meth:`.HasTraverseInternals._copy_internals` method, when special steps are needed. .. versionadded:: 1.4 �HC�HL�CE�FC�CTS�CL�CT�EO�WC�CO�S�SL�AN�B�O�T�PD�DO�CD�MD�AK�PO�DD�PS�TH�SJ�ME�SH�UK�DML_OV�DML_V�DML_MV�PA�IG�IS�M�MT�HT�ILN)+r: r; r< r] �dp_has_cache_key�dp_has_cache_key_list�dp_clauseelement�)dp_fromclause_canonical_column_collection�dp_clauseelement_tuples�dp_clauseelement_list�dp_clauseelement_tuple�dp_executable_options�dp_with_context_options�dp_fromclause_ordered_set� dp_string�dp_string_list� dp_anon_name� dp_boolean� dp_operator�dp_type� dp_plain_dict�dp_dialect_options� dp_string_clauseelement_dict�dp_string_multi_dict�dp_annotations_key� dp_plain_obj�dp_named_ddl_element�dp_prefix_sequence�dp_table_hint_list�dp_setup_join_tuple�dp_memoized_select_entities�dp_statement_hint_list�dp_unknown_structure�dp_dml_ordered_values� dp_dml_values�dp_dml_multi_values�dp_propagate_attrs� dp_ignore�dp_inspectable�dp_multi� dp_multi_list�dp_has_cache_key_tuples�dp_inspectable_listr0 r7 r5 r* r* � s� � �%�N ��/� ��8���<�04�-� � $��� !��� "��� !�� "�� $� �K��I�� �N�"��L�� �J�� �K�� �G�� �M�� ��,�#'� �� ��� ��� �L�� ��� ��� ��� ��"&� � !��� ��� %��+� �M�� #��� ��)�� �I�� �N�%� �H� � �M�'� #��� �� r7 r* c �p � e Zd ZU dZdZded< dZded< ej d� dd � d d �� Z y ) �HasTraverseInternalsa� base for classes that have a "traverse internals" element, which defines all kinds of ways of traversing the elements of an object. Compared to :class:`.Visitable`, which relies upon an external visitor to define how the object is travered (i.e. the :class:`.SQLCompiler`), the :class:`.HasTraverseInternals` interface allows classes to define their own traversal, that is, what attributes are accessed and in what order. r0 �_TraverseInternalsType�_traverse_internalsF�bool� _is_immutablezsqlalchemy.sql.traversals�� omit_attrsc � ��� t j j } | j }|j j }t j j ��fd� || |d� D � � S # t $ r g cY S w xY w)a� Return immediate child :class:`.visitors.HasTraverseInternals` elements of this :class:`.visitors.HasTraverseInternals`. This is used for visit traversal. \**kw may contain flags that change the collection that is returned, for example to return a subset of items in order to cut down on larger traversals, or to return child items from a different context (such as schema-level collections instead of clause-level). c 3 �D �K � | ] \ }}}|�vr |� ||fi ����� � y �wr/ r0 )�.0�attrname�objrO r4 r� s ��r5 � <genexpr>z4HasTraverseInternals.get_children.<locals>.<genexpr>� s: �� �� � - �(�#��#�t� �z�)�c�o� ��O��O�(�s � �!_generated_get_children_traversal) r � preloaded�sql_traversalsr� rM � _get_children�run_generated_dispatch� itertools�chain� from_iterable)r2 r� r4 � traversals�traverse_internals�dispatchs `` r5 � get_childrenz!HasTraverseInternals.get_children� s� �� �" �^�^�2�2� � �!%�!9�!9� � �+�+�B�B�����,�,� - �'/��(�*M�(�- � � �� � ��I� �s � A1 �1 A?�>A?N)r� �Tuple[str, ...]r4 r r8 z Iterable[HasTraverseInternals]) r: r; r< r] r^ r_ r� r �preload_moduler� r0 r7 r5 r� r� � sY � �� �I�/�/� �M�4� ��T���4�5�/1� � ,� �9<� � '� � 6� r7 r� c � � e Zd Zdd�Zy)� _InternalTraversalDispatchTypec � � y r/ r0 )�sr2 r3 s r5 r6 z'_InternalTraversalDispatchType.__call__� s � �r7 N)r2 �objectr3 �HasTraversalDispatchr8 r r9 r0 r7 r5 r� r� � s � �Lr7 r� c �p � e Zd ZU dZdZi Zded< d d�Z d d�Z d d�Z d d�Z y )r� zcDefine infrastructure for classes that perform internal traversals .. versionadded:: 2.0 r0 z2ClassVar[Dict[Union[InternalTraversal, str], str]]�_dispatch_lookupc �. � t | }t | |d� S )ztGiven a method from :class:`.HasTraversalDispatch`, return the corresponding method on a subclass. N)r� �getattr)r2 � visit_symbolrW s r5 r� z HasTraversalDispatch.dispatch� s � � � �-���t�T�4�(�(r7 c � � |j j | } ||| � S # t $ r | j |j ||� }Y �1w xY wr/ )rI rD �KeyError�generate_dispatch)r2 �target�internal_dispatch�generate_dispatcher_name� dispatchers r5 r� z+HasTraversalDispatch.run_generated_dispatch s_ � � � �)�)�2�2�3K�L�J� �&�$�'�'�� � � �/�/�� � �"3�5M��J� �s �$ �&A � A c �D � | j ||� }t |||� |S r/ )�_generate_dispatcher�setattr)r2 � target_clsr� r� r� s r5 r� z&HasTraversalDispatch.generate_dispatch s/ � � �.�.� � 7� � � � � 4�j�A��r7 c � � g }|D ]5 \ }}| j |� }|��t | }|j ||f� �7 ddj d� |D � � z dz }d|z |z dz } t t t j | i |� � S )Nz return [ z, c 3 �: K � | ] \ }}d |�d|�d|�d��� � y�w)z (z, self.z , visitor.�)Nr0 )r� r� rV s r5 r� z<HasTraversalDispatch._generate_dispatcher.<locals>.<genexpr>1 s( � �� � � 16�,��*� ��:�7�05�s �z ] zdef %s(self, visitor): � )r� r� �append�joinr r� r �_exec_code_in_env) r2 r� � method_name�namesr� � visit_symrO rV �code� meth_texts r5 r� z)HasTraversalDispatch._generate_dispatcher$ s� � � ��#4� �H�i��=�=��+�D�� � -�i� 8� �� � �h� � 3�4� $5� �� � � � 16� � � � � � � 0�+�=��E��L� �� *� � )� )�)�R�� E� � r7 N)r� r* r8 zCallable[..., Any])r� r� r� r� r� r> r8 r )r� z Type[object]r� r� r� r> r8 r� )r� r� r� r> r8 r� ) r: r; r< r] r^ r� r_ r� r� r� r� r0 r7 r5 r� r� � s� � �� �I�KM��H�M�)�(��(� 2�(� #&� (� � (�& � � � 2� � #&� � (� � �!7� �FI� � '� r7 r� c �� � t } t D ]S }|j }|j d� s�!|j dd� }|j }|| vsJ |� �|x| |< | |< �U y )N�dp_�visit_)r� r* rW � startswith�replace�value)�lookup�symrY � visit_key�sym_names r5 � _generate_traversal_dispatchr� C se � � �F� ���h�h�� �>�>�%� �� � �E�8�4�I��y�y�H��6�)� 3�8� 3�)�-6� 6�F�3�K�&��*� !r7 c � � e Zd ZU dZej Zded< ej rd d�Z dd� d d�Z d d�Z dd� d d�Z y )�ExternallyTraversibler0 zMapping[Any, Any]� _annotationsc � � y r/ r0 )r2 �valuess r5 � _annotatez ExternallyTraversible._annotateZ s � �cr7 r� c � � y r/ r0 �r2 r� r4 s r5 r� z"ExternallyTraversible.get_children\ s � �.1r7 c � � t � �)zclone this element��NotImplementedError)r2 r4 s r5 �_clonez ExternallyTraversible._clone` s � �!�#�#r7 c � � t � �)at Reassign internal elements to be clones of themselves. Called during a copy-and-traverse operation on newly shallow-copied elements to create a deep copy. The given clone function should be used, which may be applying additional transformations to the element (i.e. replacement traversal, cloned traversal, annotations). r r s r5 �_copy_internalsz%ExternallyTraversible._copy_internalsd s � � "�#�#r7 N)r� r r8 r )r� r� r4 r r8 � Iterable[ExternallyTraversible])r4 r r8 r )r� r� r4 r r8 r\ )r: r; r< r^ r � EMPTY_DICTr� r_ r` r r r� r r r0 r7 r5 r� r� S sk � ��I�&*�o�o�L�#�5� ���A� 46� 2�!0� 2�=@� 2� ,� 2�$� 02� $� ,� $�9<� $� � $r7 r� �_ET)�bound�_CEzColumnElement[Any]c � � e Zd Zdd�Zy)�_CloneCallableTypec � � y r/ r0 �r2 �elementr4 s r5 r6 z_CloneCallableType.__call__| s � �r7 N)r r r4 r r8 r r9 r0 r7 r5 r r { s � �;r7 r c � � e Zd Zdd�Zy)� _TraverseTransformCallableTypec � � y r/ r0 r s r5 r6 z'_TraverseTransformCallableType.__call__� s � �#r7 N)r r r4 r r8 z Optional[_ET]r9 r0 r7 r5 r r s � �Er7 r �_ExtTr) c � � e Zd ZU dZdZi Zded< ded< dd�Z dd�Ze dd �� Z e dd �� Z dd �Z dd �Z e dd �� Z dd�Zy)r) z�Base class for visitor objects which can traverse externally using the :func:`.visitors.traverse` function. Direct usage of the :func:`.visitors.traverse` function is usually preferred. )� _visitor_dict�_nextzDict[str, Any]�__traverse_options__zOptional[ExternalTraversal]r c �t � | j D ]) }t |d|j z d � }|s� ||fi |��c S y )NrK )�visitor_iteratorr� r? )r2 r� r4 �vrO s r5 �traverse_singlez!ExternalTraversal.traverse_single� s< � ��&�&�A��1�j�3�+=�+=� =�t�D�D���C��2��&� 'r7 c �. � t || j � S )zaTraverse the given expression structure, returning an iterator of all elements. )r# r �r2 r� s r5 r# zExternalTraversal.iterate� s � � �s�D� 5� 5�6�6r7 c � � y r/ r0 r s r5 r% zExternalTraversal.traverse� � � �47r7 c � � y r/ r0 r s r5 r% zExternalTraversal.traverse� � � � !$r7 c �D � t || j | j � S ��2Traverse and visit the given expression structure.)r% r r r s r5 r% zExternalTraversal.traverse� s � � ��T� 6� 6��8J�8J�K�Kr7 c �r � i }t | � D ]& }|j d� s�t | |� ||dd < �( |S )Nr� � )�dirr� r� )r2 �visitorsrW s r5 � _memoized_attr__visitor_dictz.ExternalTraversal._memoized_attr__visitor_dict� sA � � ����I�D����x�(�%,�T�4�%8���a�b��"� � �r7 c # �> K � | }|r|�� t |dd� }|r�yy�w)z8Iterate through this visitor and each 'chained' visitor.r N)r� )r2 r s r5 r z"ExternalTraversal.visitor_iterator� s( � �� � *.����G���7�D�)�A� �s � � c �D � t | j � d }||_ | S )z�'Chain' an additional ExternalTraversal onto this ExternalTraversal The chained visitor will receive all visit events after this one. ���)�listr r )r2 r3 �tails r5 r� zExternalTraversal.chain� s% � � �D�)�)�*�2�.�� �� �� r7 N)r� r( r4 r r8 r )r� � Optional[ExternallyTraversible]r8 � Iterator[ExternallyTraversible]�r� � Literal[None]r8 r\ �r� r� r8 r� �r� r2 r8 r2 )r8 z%Dict[str, _TraverseCallableType[Any]])r8 zIterator[ExternalTraversal])r2 r r3 r) r8 r )r: r; r< r] r^ r r_ r r# r r% r, �propertyr r� r0 r7 r5 r) r) � s� � �� +�I�+-��.�-� &�&�'� 7�2�7� (�7� �7� �7� �$�(�$� �$� �$�L�2�L� (�L�� .�� �*� �*�r7 c �` � e Zd ZdZdZ dd�Zed d�� Ze d d�� Z d d�Zy) �CloningExternalTraversalz�Base class for visitor objects which can traverse using the :func:`.visitors.cloned_traverse` function. Direct usage of the :func:`.visitors.cloned_traverse` function is usually preferred. r0 c �J � |D �cg c] }| j |� �� c}S c c}w )z`Apply cloned traversal to the given list of elements, and return the new list. )r% )r2 �list_�xs r5 �copy_and_processz)CloningExternalTraversal.copy_and_process� s% � � +0�0�%�Q�� � �a� �%�0�0��0s � c � � y r/ r0 r s r5 r% z!CloningExternalTraversal.traverse� r" r7 c � � y r/ r0 r s r5 r% z!CloningExternalTraversal.traverse� r$ r7 c �D � t || j | j � S r& )r& r r r s r5 r% z!CloningExternalTraversal.traverse� s$ � � � ��*�*�D�,>�,>� � r7 N)r< �List[ExternallyTraversible]r8 rB r4 r6 r7 )r: r; r< r] r^ r> r r% r0 r7 r5 r: r: � sj � �� �I�1�0�1� $�1� �7� �7� �$�(�$� �$� �$� �2� � (� r7 r: c �` � e Zd ZdZdZ dd�Zed d�� Ze d d�� Z d d�Zy) �ReplacingExternalTraversalz�Base class for visitor objects which can traverse using the :func:`.visitors.replacement_traverse` function. Direct usage of the :func:`.visitors.replacement_traverse` function is usually preferred. r0 c � � y)a Receive pre-copied elements during a cloning traversal. If the method returns a new element, the element is used instead of creating a simple copy of the element. Traversal will halt on the newly returned element if it is re-encountered. Nr0 )r2 �elems r5 r� z"ReplacingExternalTraversal.replace s � � r7 c � � y r/ r0 r s r5 r% z#ReplacingExternalTraversal.traverse r" r7 c � � y r/ r0 r s r5 r% z#ReplacingExternalTraversal.traverse r$ r7 c �J � � d� fd� }t |� j |� S )r' c �r �� �j D ]' }t t |� j | � }|��%|c S y r/ )r r rD r� )r r4 r �er2 s �r5 r� z4ReplacingExternalTraversal.traverse.<locals>.replace s< �� � �*�*���3�Q�7�?�?��H���=� �H� +� r7 )r r� r4 r r8 r2 )r' r )r2 r� r� s ` r5 r% z#ReplacingExternalTraversal.traverse s9 �� � �*� �� � -� � $�C��)B�)B�G�L�Lr7 N)rF r� r8 r2 r4 r6 r7 )r: r; r< r] r^ r� r r% r0 r7 r5 rD rD � sm � �� �I� �)� � (� � �7� �7� �$�(�$� �$� �$�M�2�M� (�Mr7 rD c # �� K � | �y| �� | j di |��}|syt |g� }|r@|j � }|D ]' }|�� |j |j di |��� �) |r�?yy�w)aH Traverse the given expression structure, returning an iterator. Traversal is configured to be breadth-first. The central API feature used by the :func:`.visitors.iterate` function is the :meth:`_expression.ClauseElement.get_children` method of :class:`_expression.ClauseElement` objects. This method should return all the :class:`_expression.ClauseElement` objects which are associated with a particular :class:`_expression.ClauseElement` object. For example, a :class:`.Case` structure will refer to a series of :class:`_expression.ColumnElement` objects within its "whens" and "else\_" member variables. :param obj: :class:`_expression.ClauseElement` structure to be traversed :param opts: dictionary of iteration options. This dictionary is usually empty in modern usage. Nr0 )r� r �popleftr� )r� �opts�children�stack� t_iterator�ts r5 r# r# 0 sx � �� �0 �{�� �I� �s� � �'�$�'�H� �� �8�*� �E� ��]�]�_� ��A��G� �L�L� �� � �/�$�/� 0� � �s �A)A.�,A.c � � y r/ r0 ��iteratorr� r+ s r5 r$ r$ Y � � � r7 c � � y r/ r0 rT s r5 r$ r$ a � � � r7 c �b � | D ]) }|j |j d� }|s�" ||� �+ |S )a� Visit the given expression structure using the given iterator of objects. :func:`.visitors.traverse_using` is usually called internally as the result of the :func:`.visitors.traverse` function. :param iterator: an iterable or sequence which will yield :class:`_expression.ClauseElement` structures; the iterator is assumed to be the product of the :func:`.visitors.iterate` function. :param obj: the :class:`_expression.ClauseElement` that was used as the target of the :func:`.iterate` function. :param visitors: dictionary of visit functions. See :func:`.traverse` for details on this dictionary. .. seealso:: :func:`.traverse` N)�getr? )rU r� r+ r� rO s r5 r$ r$ i s5 � �: ���|�|�F� 1� 1�4�8�� � ��L� � �Jr7 c � � y r/ r0 �r� rN r+ s r5 r% r% � rV r7 c � � y r/ r0 r\ s r5 r% r% � rX r7 c �0 � t t | |� | |� S )a Traverse and visit the given expression structure using the default iterator. e.g.:: from sqlalchemy.sql import visitors stmt = select(some_table).where(some_table.c.foo == "bar") def visit_bindparam(bind_param): print("found bound value: %s" % bind_param.value) visitors.traverse(stmt, {}, {"bindparam": visit_bindparam}) The iteration of objects uses the :func:`.visitors.iterate` function, which does a breadth-first traversal using a stack. :param obj: :class:`_expression.ClauseElement` structure to be traversed :param opts: dictionary of iteration options. This dictionary is usually empty in modern usage. :param visitors: dictionary of visit functions. The dictionary should have strings as keys, each of which would correspond to the ``__visit_name__`` of a particular kind of SQL expression object, and callable functions as values, each of which represents a visitor function for that kind of object. )r$ r# r\ s r5 r% r% � s � �H �'�#�t�,�c�8� <�<r7 c � � y r/ r0 r\ s r5 r& r& � rV r7 c � � y r/ r0 r\ s r5 r& r& � � � � r7 c � ������ i �t �j dg � � � d��fd� }d����fd� �| � �| fd|i���} d�| S )a Clone the given expression structure, allowing modifications by visitors for mutable objects. Traversal usage is the same as that of :func:`.visitors.traverse`. The visitor functions present in the ``visitors`` dictionary may also modify the internals of the given structure as the traversal proceeds. The :func:`.cloned_traverse` function does **not** provide objects that are part of the :class:`.Immutable` interface to the visit methods (this primarily includes :class:`.ColumnClause`, :class:`.Column`, :class:`.TableClause` and :class:`.Table` objects). As this traversal is only intended to allow in-place mutation of objects, :class:`.Immutable` objects are skipped. The :meth:`.Immutable._clone` method is still called on each object to allow for objects to replace themselves with a different object based on a clone of their sub-internals (e.g. a :class:`.ColumnClause` that clones its subquery to return a new :class:`.ColumnClause`). .. versionchanged:: 2.0 The :func:`.cloned_traverse` function omits objects that are part of the :class:`.Immutable` interface. The central API feature used by the :func:`.visitors.cloned_traverse` and :func:`.visitors.replacement_traverse` functions, in addition to the :meth:`_expression.ClauseElement.get_children` function that is used to achieve the iteration, is the :meth:`_expression.ClauseElement._copy_internals` method. For a :class:`_expression.ClauseElement` structure to support cloning and replacement traversals correctly, it needs to be able to pass a cloning function into its internal members in order to make copies of them. .. seealso:: :func:`.visitors.traverse` :func:`.visitors.replacement_traverse` �stop_onc � �� t | ��� S r/ )r& r\ s ��r5 �deferred_copy_internalsz0cloned_traverse.<locals>.deferred_copy_internals s �� � �s�D�(�3�3r7 c � �� | �v r| S t | � �vr�d|v r2t t t |d | � � }|�|�t | � < |S | j dd�i|��x�t | � < } |j dd�i|�� | j s&�j |j d � }|r ||� �t | � S )Nr� �cloner0 ) �idr r r� r r r� rZ r? )rF r4 �newelemrO rg �clonedrc r+ s ����r5 rg z cloned_traverse.<locals>.clone s� �� � �7�?��K��$�x�v�%� ��?� "� �!6�7� ��I� �t�9L� �G� �*�+2��r�$�x�(� &�� .9�T�[�[�-K�u�-K��-K�K��r�$�x� �7�'��'�'�:�e�:�r�:� �)�)�#�<�<��(>�(>��E�D�� �W� ��"�T�(�#� #r7 Nre r6 �rF r� r4 r r8 r� )�setrZ )r� rN r+ re rg rj rc s `` @@@r5 r& r& � so �� �Z 02�F��$�(�(�9�b�)�*�G�4� "�4� �4� $� $�< ��� � �)@� �DH� �� �E� �Jr7 c � � y r/ r0 �r� rN r� s r5 r' r' 3 rV r7 c � � y r/ r0 rn s r5 r' r' ; ra r7 c � � y r/ r0 rn s r5 r' r' C rX r7 c � ������ i ��j dg � D �ch c] }t |� �� c}� d��fd� }d����fd� �| � �| fd|i���} d�| S c c}w )a] Clone the given expression structure, allowing element replacement by a given replacement function. This function is very similar to the :func:`.visitors.cloned_traverse` function, except instead of being passed a dictionary of visitors, all elements are unconditionally passed into the given replace function. The replace function then has the option to return an entirely new object which will replace the one given. If it returns ``None``, then the object is kept in place. The difference in usage between :func:`.visitors.cloned_traverse` and :func:`.visitors.replacement_traverse` is that in the former case, an already-cloned object is passed to the visitor function, and the visitor function can then manipulate the internal state of the object. In the case of the latter, the visitor function should only return an entirely different object, or do nothing. The use case for :func:`.visitors.replacement_traverse` is that of replacing a FROM clause inside of a SQL structure with a different one, as is a common use case within the ORM. rc c � �� t | ��� S r/ )r' rn s ��r5 re z5replacement_traverse.<locals>.deferred_copy_internalsj s �� � $�C��w�7�7r7 c �8 �� t | � �v sd| j v r| S �| � }|� �j t |� � |S t | � }|�vrCd|v r |d | � }|�|�|< |S | j di |��x�|< } |j dd�i|�� �| S )N�no_replacement_traverser� rg r0 )rh r� �addr r )rF r4 ri �id_elemrg rj r� rc s ����r5 rg z#replacement_traverse.<locals>.cloneo s� �� � �t�H�� �(�D�,=�,=�=��K� �d�m�G��"�� � �B�w�K�(� �� �T�(���&�(� �B��"/�"�Y�-��"5��"�.�.5�F�7�O�#*�N�0;�� � �0A�b�0A�A�F�7�O�g�+�G�+�+�>�%�>�2�>� �g��&r7 Nre r6 rk )rZ rh )r� rN r� r= re rg rj rc s `` @@@r5 r' r' K s� �� �8 �F� "�h�h�y�"� 5�6� 5��r�!�u� 5�6�G�8� "�8� �8� '� '�6 ��� � �)@� �DH� �� �E� �J��O 7s �Ar[ )r� r2 rN �Mapping[str, Any]r8 r3 )rU r r� r5 r+ �(Mapping[str, _TraverseCallableType[Any]]r8 r\ )rU r r� r� r+ rx r8 r� )rU r r� r2 r+ rx r8 r2 )r� r5 rN rw r+ rx r8 r\ )r� r� rN rw r+ rx r8 r� )r� r2 rN rw r+ rx r8 r2 )r� r rN rw r+ rx r8 r )r� r5 rN rw r� �#_TraverseTransformCallableType[Any]r8 r\ )r� r rN rw r� ry r8 r )r� r� rN rw r� ry r8 r� )r� r2 rN rw r� ry r8 r2 )Nr] � __future__r � collectionsr �enumr r� rT r` r r r r r r r r r r r r r r r r � r r r � util._has_cyr � util.typingr r r � annotationr �elementsr �_py_utilr! r" r+ �sqlalchemy.cyextension.util�__all__r- r( r* r> r� r� r� r� �ExtendedInternalTraversalr� r� r� r r �_TraverseCallableTyper r r � MemoizedSlotsr) r: rD � Traversible� ClauseVisitor�CloningVisitor�ReplacingCloningVisitorr r# r$ r% r& r' r0 r7 r5 �<module>r� s� ��� #� � � � � � � � � � � � � � � � � � � � � � � � � *� !� "� ��+�'� ����<�4��� ��N�H� N�G� G�TP �� P �f �e�C�):�$:� ;�<� � �1 � 1 �hM�X� M�L � L �^ .� � 7� (�8�8� � � � $� 0�)� $�B �e�0�1�� �e�/�0�� �#����-� �<�� <�F�X�c�]� F� �� 2�3��G��*�*� G�T$ � 0� $ �N.M�!9� .M�d � �!� �)��4� � #�o�o�&1� (�&1� �&1� %�&1�R ��-�� �� 7�� � � �� � �-� � � � 7� � � � � �!�-�!� (�!� 7�!� %� !�H �� �� �� 7�� � � �� � � � � � � 7� � � � � �$=� (�$=� �$=� 7�$=� %� $=�N �� �� �� 7�� � � �� �� �� �� 7�� � � ��X� (�X� �X� 7�X� %� X�v �� �� �� 1�� � � �� �� �� �� 1�� � � �� � � � � � � 1� � � � � �D� (�D� �D� 1�D� %� Dr7
Save