File: //usr/local/lib/python3.10/dist-packages/sqlalchemy/sql/__pycache__/cache_key.cpython-310.pyc
o
���g�� �
@ s| d dl mZ d dlZd dlmZ d dlZd dlmZ d dlmZ d dlmZ d dlm Z d dlm
Z
d d lm Z d d
lm Z d d lm
Z
d d lmZ d d
lmZ d dlmZ d dlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ddl m Z ddl m Z ej r�dd l!m"Z" dd l!m#Z# dd l!m$Z$ dd lm%Z% dd l&m'Z' G d!d"� d"e �Z(G d#d$� d$ej)�Z*e*j+Z+ed%e e*j+ e d f Z,G d&d'� d'ej)�Z-e.e-�\Z/Z0Z1Z2Z3eee4eeed(eed(f f e-ef f Z5G d)d*� d*�Z6G d+d,� d,ee6�Z7G d-d.� d.e6e �Z8G d/d0� d0e6ej9�Z:G d1d2� d2e
�Z;d>d:d;�Z<G d<d=� d=e�Z=e=� Z>dS )?� )� annotationsN)� zip_longest)�Any)�Callable)�Dict)�Iterable)�Iterator)�List)�MutableMapping)�
NamedTuple)�Optional)�Sequence)�Tuple)�Union� )�anon_map)�HasTraversalDispatch)�HasTraverseInternals)�InternalTraversal)�prefix_anon_map� )�util��inspect)� HasMemoized)�Literal)�Protocol)�
BindParameter)�
ClauseElement)�
ColumnElement)�_TraverseInternalsType)�_CoreSingleExecuteParamsc @ s e Zd Zd
dd�Zd S ) � _CacheKeyTraversalDispatchType�self� HasCacheKey�visitor�_CacheKeyTraversal�return�$_CacheKeyTraversalDispatchTypeReturnc C s d S �N� )�sr# r% r* r* �C/usr/local/lib/python3.10/dist-packages/sqlalchemy/sql/cache_key.py�__call__. � z'_CacheKeyTraversalDispatchType.__call__N)r# r$ r% r& r' r( )�__name__�
__module__� __qualname__r- r* r* r* r, r" - s r" c @ s e Zd ZdZdS )�
CacheConstr N)r/ r0 r1 �NO_CACHEr* r* r* r, r2 3 s r2 r c @ s e Zd ZdZdZdZdZdZdS )�CacheTraverseTargetr r r � � N)r/ r0 r1 �CACHE_IN_PLACE�CALL_GEN_CACHE_KEY�STATIC_CACHE_KEY�PROPAGATE_ATTRS� ANON_NAMEr* r* r* r, r4 ? s r4 .c @ s� e Zd ZU dZdZeZded< dZdZ dZ
ded< dZd ed
< e d d
d��Z e
�d�d dd��Zd dd�Ze d dd��ZdS ) r$ ap Mixin for objects which can produce a cache key.
This class is usually in a hierarchy that starts with the
:class:`.HasTraverseInternals` base, but this is optional. Currently,
the class should be able to work on its own without including
:class:`.HasTraverseInternals`.
.. seealso::
:class:`.CacheKey`
:ref:`sql_caching`
r* �_CacheKeyTraversalType�_cache_key_traversalTNzOptional[bool]�
inherit_cacher � _generated_cache_key_traversalr' �CUnion[_CacheKeyTraversalDispatchType, Literal[CacheConst.NO_CACHE]]c C s� | j �dd�}t|�}|rEt| dd�}|du r2z t| t�s J �| j}W n ty1 t| _ t Y S w |tus>J d| � d���t
� | |d�S | j �dd�}|du rq| j �dd�}|du rqt| _ |du ro| j rot
jd| j d d
� tS t
� | |d�S ) z�generate cache key dispatcher for a new class.
This sets the _generated_cache_key_traversal attribute once called
so should only be called once per class.
r> Nr= zclass zK has _cache_key_traversal=NO_CACHE, which conflicts with inherit_cache=Truer? �_traverse_internalsa� Class %s will not make use of SQL compilation caching as it does not set the 'inherit_cache' attribute to ``True``. This can have significant performance implications including some performance degradations in comparison to prior SQLAlchemy versions. Set this attribute to True if this object can make use of the cache key generated by the superclass. Alternatively, this attribute may be set to False which will disable this warning.�cprf)�code)�__dict__�get�bool�getattr�
issubclassr rA �AttributeErrorr3 r? � _cache_key_traversal_visitor�generate_dispatch�_hierarchy_supports_cachingr �warnr/ )�clsr> �inheritr= r* r* r, �_generate_cache_attrs� sX
�
�
���� �
�
�z!HasCacheKey._generate_cache_attrs�sqlalchemy.sql.elementsr �
bindparams�List[BindParameter[Any]]�Optional[Tuple[Any, ...]]c
s� | j }� �| �\}}|r||fS z|jd }W n
ty$ |�� }Y nw |tu r/d� t< dS ||f}|| t�D ]�\}} }
| dur�|
tu rZ| j} | tu rSd� t< dS ||| f7 }q8|
t u rtt
j j } t
| | j�rm| �� �} ||| f7 }q8|
tu r�||| �� ��f7 }q8| r�|
tu r�||| f7 }q8|
tu r�||| d | d r�| d �� ��ndf7 }q8|
tju r�| jr�|| j7 }q8|| �� �7 }q8|
tju s�|
tju s�|
tju r�||t � �fdd�| D ��f7 }q8||
|| | � ��7 }q8|S )aB return an optional cache key.
The cache key is a tuple which can contain any series of
objects that are hashable and also identifies
this object uniquely within the presence of a larger SQL expression
or statement, for the purposes of caching the resulting query.
The cache key should be based on the SQL compiled structure that would
ultimately be produced. That is, two structures that are composed in
exactly the same way should produce the same cache key; any difference
in the structures that would affect the SQL string or the type handlers
should result in a different cache key.
If a structure cannot produce a useful cache key, the NO_CACHE
symbol should be added to the anon_map and the method should
return None.
r? TN�compile_state_plugin�plugin_subjectc � g | ]}|� � ���qS r* ��_gen_cache_key��.0�elem�r rR r* r, �
<listcomp>O s
��z.HasCacheKey._gen_cache_key.<locals>.<listcomp>) � __class__�get_anonrD �KeyErrorrP r3 rJ r9 �_static_cache_keyr; r � preloaded� sql_elements�
isinstance�_anonymous_label� apply_mapr8 rY r7 r: r �dp_annotations_key�!_gen_static_annotations_cache_key�_annotations_cache_key�_gen_annotations_cache_key�dp_clauseelement_list�dp_clauseelement_tuple�dp_memoized_select_entities�tuple)
r# r rR rN �id_�found�
dispatcher�result�attrname�obj�meth�sck�elementsr* r] r, rY � s� ��
�
���
� ���
��zHasCacheKey._gen_cache_key�Optional[CacheKey]c C s8 g }t � }| �||�}t|v rdS |dusJ �t||�S )ap return a cache key.
The cache key is a tuple which can contain any series of
objects that are hashable and also identifies
this object uniquely within the presence of a larger SQL expression
or statement, for the purposes of caching the resulting query.
The cache key should be based on the SQL compiled structure that would
ultimately be produced. That is, two structures that are composed in
exactly the same way should produce the same cache key; any difference
in the structures that would affect the SQL string or the type handlers
should result in a different cache key.
The cache key returned by this method is an instance of
:class:`.CacheKey`, which consists of a tuple representing the
cache key, as well as a list of :class:`.BindParameter` objects
which are extracted from the expression. While two expressions
that produce identical cache key tuples will themselves generate
identical SQL strings, the list of :class:`.BindParameter` objects
indicates the bound values which may have different values in
each one; these bound parameters must be consulted in order to
execute the statement with the correct parameters.
a :class:`_expression.ClauseElement` structure that does not implement
a :meth:`._gen_cache_key` method and does not implement a
:attr:`.traverse_internals` attribute will not be cacheable; when
such an element is embedded into a larger structure, this method
will return None, indicating no cache key is available.
N�r rY r3 �CacheKey)r# rR � _anon_map�keyr* r* r, �_generate_cache_key[ s
z HasCacheKey._generate_cache_keyru c C s8 g }t � }|�||�}t|v rd S |d usJ �t||�S r) rz )rN ru rR r| r} r* r* r, � _generate_cache_key_for_object� s
z*HasCacheKey._generate_cache_key_for_object)r' r@ )r r rR rS r' rT �r' ry )ru r$ r' ry )r/ r0 r1 �__doc__� __slots__r3 r= �__annotations__�_is_has_cache_keyrL r> � classmethodrP r �preload_modulerY r~ r r* r* r* r, r$ \ s$
H
}*r$ c @ s e Zd ZdS )�HasCacheKeyTraverseN)r/ r0 r1 r* r* r* r, r� � s r� c @ s e Zd ZdZejddd��ZdS )�MemoizedHasCacheKeyr* r' ry c C �
t �| �S r) �r$ r~ �r# r* r* r, r~ � s
z'MemoizedHasCacheKey._generate_cache_keyNr� )r/ r0 r1 r� r �memoized_instancemethodr~ r* r* r* r, r� � s r� c @ s e Zd ZdZddd�ZdS )�SlotsMemoizedHasCacheKeyr* r' ry c C r� r) r� r� r* r* r, �$_memoized_method__generate_cache_key� s
z=SlotsMemoizedHasCacheKey._memoized_method__generate_cache_keyNr� )r/ r0 r1 r� r� r* r* r* r, r� � s r� c @ s� e Zd ZU dZded< ded< d/dd �Zd0dd�Zd1dd�Zd1dd�Ze d2d d ��Z
d3d d �Z d4d!d"�Z d5d#d$�Z
d6d&d'�Ze�d(�d7d,d-��Zd.S )8r{ z�The key used to identify a SQL statement construct in the
SQL compilation cache.
.. seealso::
:ref:`sql_caching`
�Tuple[Any, ...]r} z Sequence[BindParameter[Any]]rR r' �
Optional[int]c C s dS )z7CacheKey itself is not hashable - hash the .key portionNr* r� r* r* r, �__hash__� r. zCacheKey.__hash__�statement_cache�MutableMapping[Any, str]� statementr �
parametersr! �strc sn | j |vrt|� || j < }n|| j }| js%t� fdd�t� �D ��}n t� fdd�| jD ��}t||f�S )a� Generate an "offline string" form of this :class:`.CacheKey`
The "offline string" is basically the string SQL for the
statement plus a repr of the bound parameter values in series.
Whereas the :class:`.CacheKey` object is dependent on in-memory
identities in order to work as a cache key, the "offline" version
is suitable for a cache that will work for other processes as well.
The given ``statement_cache`` is a dictionary-like object where the
string form of the statement itself will be cached. This dictionary
should be in a longer lived scope in order to reduce the time spent
stringifying statements.
c 3 s � | ]}� | V qd S r) r* �r[ r} �r� r* r, � <genexpr>� � � z-CacheKey.to_offline_string.<locals>.<genexpr>c 3 s � | ] }� � |j|j�V qd S r) )rE r} �value)r[ � bindparamr� r* r, r� � s
� �
�)r} r� rR ro �sorted�repr)r# r� r� r� �sql_str� param_tupler* r� r, �to_offline_string� s
� zCacheKey.to_offline_string�otherr rF c C s t | j|jk�S r) )rF r} �r# r� r* r* r, �__eq__� � zCacheKey.__eq__c C s | j |j k S r) )r} r� r* r* r, �__ne__� s zCacheKey.__ne__�left�rightc C s t |g �}t |g �}|�|�S r) )r{ �_diff)rN r� r� �ck1�ck2r* r* r, � _diff_tuples� s
zCacheKey._diff_tuples�
Iterator[str]c c s� � | j }|j }g }d} ||}}|D ]
}|| }|| }qtt||��D ]1\}\} }
||k r0q%| |
krVt| t�rEt|
t�rE|�|� ndd�dd� |D ��|| |
f V q%|�d�}d S q )Nr Tzkey%s[%d]: %s != %s� c s s � | ]}d | V qdS )z[%d]Nr* )r[ rp r* r* r, r� r� z,CacheKey._whats_different.<locals>.<genexpr>���)r} � enumerater re ro �append�join�pop) r# r� �k1�k2�stack� pickup_index�s1�s2�idx�e1�e2r* r* r, �_whats_different� s6 �
��
�zCacheKey._whats_differentc C s d� | �|��S )N�, )r� r� r� r* r* r, r�
r� zCacheKey._diffc C s | j g}g }t� }d}|r||�d�}||u r&|�d|d d � |d8 }nTt|t�rT|s;|�d|d d d � n?|d7 }t|�|g | }|�d|d d � n&t|t�rgd t|�j t
t |��f }nt |�}|�d|d d
| d � |s
d d
�
|�f S )Nr� r � r z),r z()�(z<%s object at %s>z r� zCacheKey(key=%s)�
)r} �objectr� r� re ro �listr$ �typer/ �hex�idr� r� )r# r� �output�sentinel�indentr\ �repr_r* r* r, �__str__
s0
� �zCacheKey.__str__�Dict[str, Any]c s t � � � fdd�| jD �S )zused for testingc s i | ] }|j � |j�qS r* )r} �effective_value)r[ �b�r| r* r, �
<dictcomp>/ s z1CacheKey._generate_param_dict.<locals>.<dictcomp>)r rR r� r* r� r, �_generate_param_dict+ s z CacheKey._generate_param_dictrQ �original_cache_key�target_element�ColumnElement[Any]c C s, |j s|| u r |S tjj}|�|| j|j�S r) )�
_is_immutabler rc rd �_OverrideBindsrR )r# r� r� rx r* r* r, �_apply_params_to_element1 s
�z!CacheKey._apply_params_to_elementN)r' r� )r� r� r� r r� r! r' r� )r� r r' rF )r� r{ r� r{ r' r� )r� r{ r' r� )r� r{ r' r� )r' r� )r' r� )r� r{ r� r� r' r� )r/ r0 r1 r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r* r* r* r, r{ � s
$
r{ �tokensr� �
traverse_args�'Iterable[Tuple[str, InternalTraversal]]�args�
Iterable[Any]r' c C s� g }t � }| }t||�D ]D\\}}}|j} | �dd�}
|du r&||df7 }q tt|
�} | tu r6|||f7 }q | ttt t
fv rFt d| � d���|| ||d||�7 }q |S )z;a quick cache key generator used by reflection.flexi_cache.�dp_�visit_NzHaven't implemented symbol z for ad-hoc key from args) r �zip�name�replacerG rJ r7 r8 r9 r; r: �NotImplementedError) r� r� r� rR r| �tuprt �sym�argr} � visit_keyrv r* r* r, �_ad_hoc_cache_key_from_args> s.
�
�r� c @ sF e Zd Ze ZZejZej Z
ej Z ej
Ze Z Z ZZeZeZeZeZd>d d �Zd>d
d�Z d>dd�Z d>dd�Z d>dd�Z d>dd�Z d>dd�Z!d>dd�Z"d>dd �Z#d>d d �Z$d>d d �Z%d>d!d"�Z&d>d#d$�Z'd>d%d&�Z(d>d'd(�Z)d>d)d*�Z*d>d+d,�Z+d>d-d.�Z,d>d/d0�Z-d>d1d2�Z.d>d3d4�Z/d>d5d6�Z0d>d7d8�Z1d>d9d:�Z2d>d;d<�Z3d=S )?r& rt r� ru r �parentr rR rS r' r� c C s t dd� |D ��S )Nc s s � | ]
\}}|j |fV qd S r) )�__code__)r[ �fn�c_keyr* r* r, r� � s � z@_CacheKeyTraversal.visit_with_context_options.<locals>.<genexpr>�ro �r# rt ru r� r rR r* r* r, �visit_with_context_optionsx s z-_CacheKeyTraversal.visit_with_context_optionsc C s |t |��||�fS r) )r rY r� r* r* r, �visit_inspectable� s z$_CacheKeyTraversal.visit_inspectablec C s t |�S r) r� r� r* r* r, �visit_string_list� s z$_CacheKeyTraversal.visit_string_listc C s |t |t�r
|�||�fS |fS r) �re r$ rY r� r* r* r, � visit_multi� s ���z _CacheKeyTraversal.visit_multic � |t � �fdd�|D ��fS )Nc 3 s* � | ]}t |t�r|�� ��n|V qd S r) r� rZ r] r* r, r� � s � ��
�z6_CacheKeyTraversal.visit_multi_list.<locals>.<genexpr>r� r� r* r] r, �visit_multi_list� s
��z#_CacheKeyTraversal.visit_multi_listc �$ |sdS |t � �fdd�|D ��fS )Nr* c 3 s( � | ]}t � �fd d�|D ��V qdS )c 3 � � | ] }|� � ��V qd S r) rX rZ r] r* r, r� � s
�
�
�zJ_CacheKeyTraversal.visit_has_cache_key_tuples.<locals>.<genexpr>.<genexpr>Nr� )r[ �tup_elemr] r* r, r� � s � ��
�z@_CacheKeyTraversal.visit_has_cache_key_tuples.<locals>.<genexpr>r� r� r* r] r, �visit_has_cache_key_tuples� s ��z-_CacheKeyTraversal.visit_has_cache_key_tuplesc r� )Nr* c 3 r� r) rX rZ r] r* r, r� � s � z>_CacheKeyTraversal.visit_has_cache_key_list.<locals>.<genexpr>r� r� r* r] r, �visit_has_cache_key_list� �
�z+_CacheKeyTraversal.visit_has_cache_key_listc r� )Nr* c 3 s" � | ] }|j r|�� ��V qd S r) )r� rY rZ r] r* r, r� � s � �
�z>_CacheKeyTraversal.visit_executable_options.<locals>.<genexpr>r� r� r* r] r, �visit_executable_options� s ��z+_CacheKeyTraversal.visit_executable_optionsc C s | � |dd� |D �|||�S )Nc S s g | ]}t |��qS r* r )r[ �or* r* r, r^ � s z=_CacheKeyTraversal.visit_inspectable_list.<locals>.<listcomp>)r� r� r* r* r, �visit_inspectable_list� s �z)_CacheKeyTraversal.visit_inspectable_listc C s | � |||||�S r) )r� r� r* r* r, �visit_clauseelement_tuples� s
�z-_CacheKeyTraversal.visit_clauseelement_tuplesc r� )Nr* c rW r* rX rZ r] r* r, r^ � zC_CacheKeyTraversal.visit_fromclause_ordered_set.<locals>.<listcomp>r� r� r* r] r, � visit_fromclause_ordered_set
r� z/_CacheKeyTraversal.visit_fromclause_ordered_setc s, |sdS � �fdd�|D �}|t t|��fS )Nr* c rW r* rX rZ r] r* r, r^ # s �zH_CacheKeyTraversal.visit_clauseelement_unordered_set.<locals>.<listcomp>�ro r� )r# rt ru r� r rR �
cache_keysr* r] r, �!visit_clauseelement_unordered_set s ���z4_CacheKeyTraversal.visit_clauseelement_unordered_setc C s
||j fS r) )r� r� r* r* r, �visit_named_ddl_element- s
z*_CacheKeyTraversal.visit_named_ddl_elementc r� )Nr* c s g | ] \}}|� � ��|f�qS r* rX )r[ �clause�strvalr] r* r, r^ E s ��z<_CacheKeyTraversal.visit_prefix_sequence.<locals>.<listcomp>r� r� r* r] r, �visit_prefix_sequence7 s ���z(_CacheKeyTraversal.visit_prefix_sequencec s t � �fdd�|D ��S )Nc 3 sj � | ]0\}}}� |� ���|d ur|� ���nd |d ur"|� ���nd t� fdd�t� �D ��fV qd S )Nc � g | ]}|� | f�qS r* r* r� ��flagsr* r, r^ a r� zG_CacheKeyTraversal.visit_setup_join_tuple.<locals>.<genexpr>.<listcomp>)rY ro r� )r[ �target�onclause�from_r] r r, r� T s �
� � ��
�z<_CacheKeyTraversal.visit_setup_join_tuple.<locals>.<genexpr>r� r� r* r] r, �visit_setup_join_tupleL s �z)_CacheKeyTraversal.visit_setup_join_tuplec s( |sdS |t � �fdd�|�� D ��fS )Nr* c s& g | ]\\}}}|� � ��||f�qS r* rX )r[ r � dialect_name�textr] r* r, r^ t s
���z<_CacheKeyTraversal.visit_table_hint_list.<locals>.<listcomp>)ro �itemsr� r* r] r, �visit_table_hint_listf s ���z(_CacheKeyTraversal.visit_table_hint_listc � |t � fdd�t� �D ��fS )Nc r r* r* r� �ru r* r, r^ � r� z7_CacheKeyTraversal.visit_plain_dict.<locals>.<listcomp>r r� r* r r, �visit_plain_dict s z#_CacheKeyTraversal.visit_plain_dictc r )Nc 3 s4 � | ]� � t � �fd d�t�� �D ��fV qdS )c s g | ]
}|�� | f�qS r* r* r� )r ru r* r, r^ � s ��zF_CacheKeyTraversal.visit_dialect_options.<locals>.<genexpr>.<listcomp>Nr )r[ r )r r, r� � s �
�
���
�z;_CacheKeyTraversal.visit_dialect_options.<locals>.<genexpr>r r� r* r r, �visit_dialect_options� s
��z(_CacheKeyTraversal.visit_dialect_optionsc s" |t � ��fdd�t��D ��fS )Nc 3 s$ � | ]
}|�| � � ��fV qd S r) rX r� �r rR ru r* r, r� � s
� �
�zE_CacheKeyTraversal.visit_string_clauseelement_dict.<locals>.<genexpr>r r� r* r r, � visit_string_clauseelement_dict� s
��z2_CacheKeyTraversal.visit_string_clauseelement_dictc s. |t � �fdd��fdd�t��D �D ��fS )Nc 3 s2 � | ]\}}|t |t�r|�� ��n|fV qd S r) r� �r[ r} r� r] r* r, r� � s � ���
�z=_CacheKeyTraversal.visit_string_multi_dict.<locals>.<genexpr>c r r* r* r� r r* r, r^ � r� z>_CacheKeyTraversal.visit_string_multi_dict.<locals>.<listcomp>r r� r* r r, �visit_string_multi_dict� s
��z*_CacheKeyTraversal.visit_string_multi_dictc s |t � �fdd�|jD ��fS )Nc 3 s" � | ] \}}}|� � ��V qd S r) rX )r[ �k�col�_r] r* r, r� � s
�
�
�zR_CacheKeyTraversal.visit_fromclause_canonical_column_collection.<locals>.<genexpr>)ro � _collectionr� r* r] r, �,visit_fromclause_canonical_column_collection� s
��z?_CacheKeyTraversal.visit_fromclause_canonical_column_collectionc C � d|t < dS �NTr* �r3 r� r* r* r, �visit_unknown_structure� s z*_CacheKeyTraversal.visit_unknown_structurec r� )Nc 3 s: � | ]\}}t |d �r|�� ��n||�� ��fV qdS ��__clause_element__N��hasattrrY r r] r* r, r� � s � ��
�
�z>_CacheKeyTraversal.visit_dml_ordered_values.<locals>.<genexpr>r� r� r* r] r, �visit_dml_ordered_values� s
��z+_CacheKeyTraversal.visit_dml_ordered_valuesc s |t � ��fdd��D ��fS )Nc 3 s: � | ]}t |d �r|�� ��n|�| �� ��fV qdS r$ r& )r[ r r r* r, r� s � ���
�z6_CacheKeyTraversal.visit_dml_values.<locals>.<genexpr>r� r� r* r r, �visit_dml_values� s
��z#_CacheKeyTraversal.visit_dml_valuesc C r r! r" r� r* r* r, �visit_dml_multi_values s z)_CacheKeyTraversal.visit_dml_multi_valuesN) rt r� ru r r� r r r rR rS r' r� )4r/ r0 r1 r8 �visit_has_cache_key�visit_clauseelementr rl �visit_clauseelement_listrh �visit_annotations_keyrm �visit_clauseelement_tuplern � visit_memoized_select_entitiesr7 � visit_string�
visit_boolean�visit_operator�visit_plain_obj�visit_statement_hint_listr9 �
visit_typer; �visit_anon_namer: �visit_propagate_attrsr� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r r# r( r) r* r* r* r* r, r& c sL ��
r& )r� r� r� r� r� r� r' r� )?�
__future__r �enum� itertoolsr �typingr r r r r r r
r r r
r r �visitorsr r r r r r� r �
inspectionr r � util.typingr r �
TYPE_CHECKINGrx r r r r �engine.interfacesr! r" �Enumr2 r3 r< r4 ro r7 r8 r9 r: r; r� r( r$ r� r� �
MemoizedSlotsr� r{ r� r& rJ r* r* r* r, �<module> s� �������
:
%
A