관리-도구
편집 파일: cache_key.cpython-38.pyc
U -?�f�� � @ 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 �rtdd 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;d3d4d5d3d6�d7d8�Z<G d9d:� 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 Zdddd�dd�ZdS )� _CacheKeyTraversalDispatchType� HasCacheKey�_CacheKeyTraversal�$_CacheKeyTraversalDispatchTypeReturn)�self�visitor�returnc C s d S �N� )�sr& r' r* r* �H/opt/hc_python/lib64/python3.8/site-packages/sqlalchemy/sql/cache_key.py�__call__. s z'_CacheKeyTraversalDispatchType.__call__N)�__name__� __module__� __qualname__r- r* r* r* r, r" - s r" c @ s e Zd ZdZdS )� CacheConstr N)r. r/ r0 �NO_CACHEr* r* r* r, r1 3 s r1 r c @ s e Zd ZdZdZdZdZdZdS )�CacheTraverseTargetr r r � � N)r. r/ r0 �CACHE_IN_PLACE�CALL_GEN_CACHE_KEY�STATIC_CACHE_KEY�PROPAGATE_ATTRS� ANON_NAMEr* r* r* r, r3 ? s r3 .c @ s� e Zd ZU dZdZeZded< dZdZ dZ ded< dZd ed < e d d �d d��Z e �d�dddd�dd��Zdd �dd�Ze d dd�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_traversalzCUnion[_CacheKeyTraversalDispatchType, Literal[CacheConst.NO_CACHE]]�r( c C s� | j �dd�}t|�}|r�t| dd�}|dkrfzt| t�s>t�| j}W n tk rd t | _ t Y S X |t k s~td| � d���t � | |d�S | j �dd�}|dkr�| j �dd�}|dkr�t | _ |dkr�| j r�tjd| j d d � t S t � | |d�S dS ) 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.Zcprf)�code)�__dict__�get�bool�getattr� issubclassr �AssertionErrorr@ �AttributeErrorr2 r> � _cache_key_traversal_visitorZgenerate_dispatch�_hierarchy_supports_cachingr �warnr. )�clsr= �inheritr< r* r* r, �_generate_cache_attrs� s\ � � � ��� � � �z!HasCacheKey._generate_cache_attrs�sqlalchemy.sql.elementsr �List[BindParameter[Any]]zOptional[Tuple[Any, ...]])r � bindparamsr( c s� | j }� �| �\}}|r ||fS z|jd }W n tk rJ |�� }Y nX |tkr`d� t< dS ||f}|| t�D �]v\}} } | dk rr| tkr�| j} | tkr�d� t< dS ||| f7 }qr| t kr�t j j } t | | j�r�| �� �} ||| f7 }qr| tk�r ||| �� ��f7 }qr| rr| tk�r(||| f7 }qr| tk�r`||| d | d �rV| d �� ��ndf7 }qr| tjk�r�| j�r�|| j7 }n|| �� �7 }qr| tjk�s�| tjk�s�| tjk�r�||t � �fdd�| D ��f7 }qr|| || | � ��7 }qr|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> TNZcompile_state_pluginZplugin_subjectc s g | ]}|� � ���qS r* ��_gen_cache_key��.0�elem�r rQ r* r, � <listcomp>O s �z.HasCacheKey._gen_cache_key.<locals>.<listcomp>) � __class__Zget_anonrB �KeyErrorrN r2 rI r8 Z_static_cache_keyr: r � preloaded� sql_elements� isinstanceZ_anonymous_labelZ apply_mapr7 rS r6 r9 r �dp_annotations_keyZ!_gen_static_annotations_cache_keyZ_annotations_cache_keyZ_gen_annotations_cache_key�dp_clauseelement_list�dp_clauseelement_tuple�dp_memoized_select_entities�tuple) r& r rQ rL �id_�found� dispatcher�result�attrname�obj�methZsck�elementsr* rW r, rS � s� � � � �� ���� ��� �zHasCacheKey._gen_cache_key�Optional[CacheKey]c C s< g }t � }| �||�}t|kr"dS |dk s.t�t||�S dS )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 rS r2 rG �CacheKey)r& rQ � _anon_map�keyr* r* r, �_generate_cache_key[ s z HasCacheKey._generate_cache_key)rh r( c C s< g }t � }|�||�}t|kr"d S |d k s.t�t||�S d S r) rl )rL rh rQ rn ro r* r* r, � _generate_cache_key_for_object� s z*HasCacheKey._generate_cache_key_for_object)r. r/ r0 �__doc__� __slots__r2 r< �__annotations__�_is_has_cache_keyrJ r= � classmethodrN r �preload_modulerS rp rq r* r* r* r, r# \ s H}*r# c @ s e Zd ZdS )�HasCacheKeyTraverseN)r. r/ r0 r* r* r* r, rx � s rx c @ s$ e Zd ZdZejdd�dd��ZdS )�MemoizedHasCacheKeyr* rk r? c C s t �| �S r) �r# rp �r& r* r* r, rp � s z'MemoizedHasCacheKey._generate_cache_keyN)r. r/ r0 rs r Zmemoized_instancemethodrp r* r* r* r, ry � s ry c @ s e Zd ZdZdd�dd�ZdS )�SlotsMemoizedHasCacheKeyr* rk r? c C s t �| �S r) rz r{ r* r* r, �$_memoized_method__generate_cache_key� s z=SlotsMemoizedHasCacheKey._memoized_method__generate_cache_keyN)r. r/ r0 rs r} r* r* r* r, r| � s r| c @ s� e Zd ZU dZded< ded< dd�dd �Zd d d d d�dd�Zddd�dd�Zddd�dd�Ze d d d d�dd��Z d dd�d d �Z d d d�d d �Z d d�d d!�Z d"d�d#d$�Ze�d%�d d&d&d'�d(d)��Zd*S )+rm z�The key used to identify a SQL statement construct in the SQL compilation cache. .. seealso:: :ref:`sql_caching` �Tuple[Any, ...]ro z Sequence[BindParameter[Any]]rQ z Optional[int]r? c C s dS )z7CacheKey itself is not hashable - hash the .key portionNr* r{ r* r* r, �__hash__� s zCacheKey.__hash__zMutableMapping[Any, str]r r! �str)�statement_cache� statement� parametersr( c sn | j |kr t|� || j < }n || j }| jsJt� fdd�t� �D ��}nt� 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* �rU ro �r� r* r, � <genexpr>� s z-CacheKey.to_offline_string.<locals>.<genexpr>c 3 s | ]}� � |j|j�V qd S r) )rC ro �value)rU Z bindparamr� r* r, r� � s �)ro r� rQ rb �sorted�repr)r& r� r� r� Zsql_strZ param_tupler* r� r, �to_offline_string� s �zCacheKey.to_offline_stringr rD )�otherr( c C s t | j|jk�S r) )rD ro �r& r� r* r* r, �__eq__� s zCacheKey.__eq__c C s | j |j k S r) )ro r� r* r* r, �__ne__� s zCacheKey.__ne__)�left�rightr( c C s t |g �}t |g �}|�|�S r) )rm �_diff)rL r� r� Zck1Zck2r* r* r, � _diff_tuples� s zCacheKey._diff_tuplesz Iterator[str]c c s� | j }|j }g }d}|| }}|D ]}|| }|| }q"tt||��D ]d\}\} } ||k r\qF| | krFt| t�r�t| t�r�|�|� qqFdd�dd� |D ��|| | f V qF|�d�}q�qd S )Nr zkey%s[%d]: %s != %s� c s s | ]}d | V qdS )z[%d]Nr* )rU rc r* r* r, r� s z,CacheKey._whats_different.<locals>.<genexpr>���)ro � enumerater r] rb �append�join�pop) r& r� Zk1Zk2�stackZ pickup_index�s1�s2�idx�e1�e2r* r* r, �_whats_different� s. � zCacheKey._whats_differentc C s d� | �|��S )N�, )r� r� r� r* r* r, r� s zCacheKey._diffc C s | j g}g }t� }d}|r�|�d�}||krL|�d|d d � |d8 }qt|t�r�|sv|�d|d d d � q�|d7 }t|�|g | }|�d|d d � qt|t�r�d t|�j t t |��f }nt |�}|�d|d d | d � qd d � |�f S )Nr� r � r z),r z()�(z<%s object at %s>z r� zCacheKey(key=%s)� )ro �objectr� r� r] rb �listr# �typer. �hex�idr� r� )r& r� �output�sentinel�indentrV �repr_r* r* r, �__str__ s. � zCacheKey.__str__zDict[str, Any]c s t � � � fdd�| jD �S )zused for testingc s i | ]}|j � |j�qS r* )ro Zeffective_value)rU �b�rn r* r, � <dictcomp>/ s z1CacheKey._generate_param_dict.<locals>.<dictcomp>)r rQ r{ r* r� r, �_generate_param_dict+ s z CacheKey._generate_param_dictrO zColumnElement[Any])�original_cache_key�target_elementr( c C s, |j s|| kr|S tjj}|�|| j|j�S r) )� _is_immutabler r[ r\ Z_OverrideBindsrQ )r& r� r� rj r* r* r, �_apply_params_to_element1 s �z!CacheKey._apply_params_to_elementN)r. r/ r0 rr rt r r� r� r� rv r� r� r� r� r� r rw r� r* r* r* r, rm � s $ rm r~ z'Iterable[Tuple[str, InternalTraversal]]z Iterable[Any])�tokens� traverse_args�argsr( c C s� g }t � }| }t||�D ]�\\}}}|j} | �dd�} |dkrL||df7 }qtt| �} | tkrl|||f7 }q| ttt t fkr�t d| � d���q|| ||d||�7 }q|S )z;a quick cache key generator used by reflection.flexi_cache.Zdp_�visit_NzHaven't implemented symbol z for ad-hoc key from args) r �zip�name�replacerE rI r6 r7 r8 r: r9 �NotImplementedError) r� r� r� rQ rn �tuprg �sym�argro Z visit_keyri r* r* r, �_ad_hoc_cache_key_from_args> s. � �r� c @ s� e Zd Ze ZZejZej Z ej Z ej Ze Z Z ZZeZeZeZeZddddddd�dd�Zddddddd�d d �Z ddddddd�d d �Z ddddddd�d d�Z ddddddd�dd�Z ddddddd�dd�Z ddddddd�dd�Z!ddddddd�dd�Z"ddddddd�dd�Z#ddddddd�dd�Z$ddddddd�dd �Z%ddddddd�d d �Z&ddddddd�d d �Z'ddddddd�d!d"�Z(ddddddd�d#d$�Z)ddddddd�d%d&�Z*ddddddd�d'd(�Z+ddddddd�d)d*�Z,ddddddd�d+d,�Z-ddddddd�d-d.�Z.ddddddd�d/d0�Z/ddddddd�d1d2�Z0ddddddd�d3d4�Z1ddddddd�d5d6�Z2ddddddd�d7d8�Z3d9S ):r$ r� r r rP r~ )rg rh �parentr rQ r( c C s t dd� |D ��S )Nc s s | ]\}}|j |fV qd S r) )�__code__)rU �fnZc_keyr* r* r, r� � s z@_CacheKeyTraversal.visit_with_context_options.<locals>.<genexpr>�rb �r& rg rh r� r rQ r* r* r, �visit_with_context_optionsx s z-_CacheKeyTraversal.visit_with_context_optionsc C s |t |��||�fS r) )r rS 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|�||�n|fS r) �r] r# rS r� r* r* r, � visit_multi� s ��z _CacheKeyTraversal.visit_multic s |t � �fdd�|D ��fS )Nc 3 s( | ] }t |t�r |�� ��n|V qd S r) r� rT rW r* r, r� � s ��z6_CacheKeyTraversal.visit_multi_list.<locals>.<genexpr>r� r� r* rW r, �visit_multi_list� s ��z#_CacheKeyTraversal.visit_multi_listc s$ |sdS |t � �fdd�|D ��fS )Nr* c 3 s& | ] }t � �fd d�|D ��V qdS )c 3 s | ]}|� � ��V qd S r) rR rT rW r* r, r� � s �zJ_CacheKeyTraversal.visit_has_cache_key_tuples.<locals>.<genexpr>.<genexpr>Nr� )rU Ztup_elemrW r* r, r� � s ��z@_CacheKeyTraversal.visit_has_cache_key_tuples.<locals>.<genexpr>r� r� r* rW r, �visit_has_cache_key_tuples� s ��z-_CacheKeyTraversal.visit_has_cache_key_tuplesc s$ |sdS |t � �fdd�|D ��fS )Nr* c 3 s | ]}|� � ��V qd S r) rR rT rW r* r, r� � s z>_CacheKeyTraversal.visit_has_cache_key_list.<locals>.<genexpr>r� r� r* rW r, �visit_has_cache_key_list� s �z+_CacheKeyTraversal.visit_has_cache_key_listc s$ |sdS |t � �fdd�|D ��fS )Nr* c 3 s | ]}|j r|�� ��V qd S r) )ru rS rT rW r* r, r� � s �z>_CacheKeyTraversal.visit_executable_options.<locals>.<genexpr>r� r� r* rW r, �visit_executable_options� s ��z+_CacheKeyTraversal.visit_executable_optionsc C s | � |dd� |D �|||�S )Nc S s g | ] }t |��qS r* r )rU �or* r* r, rX � 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 s$ |sdS |t � �fdd�|D ��fS )Nr* c s g | ]}|� � ���qS r* rR rT rW r* r, rX s zC_CacheKeyTraversal.visit_fromclause_ordered_set.<locals>.<listcomp>r� r� r* rW r, � visit_fromclause_ordered_set s �z/_CacheKeyTraversal.visit_fromclause_ordered_setc s, |sdS � �fdd�|D �}|t t|��fS )Nr* c s g | ]}|� � ���qS r* rR rT rW r* r, rX # s zH_CacheKeyTraversal.visit_clauseelement_unordered_set.<locals>.<listcomp>�rb r� )r& rg rh r� r rQ Z cache_keysr* rW 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 s$ |sdS |t � �fdd�|D ��fS )Nr* c s g | ]\}}|� � ��|f�qS r* rR )rU �clause�strvalrW r* r, rX E s �z<_CacheKeyTraversal.visit_prefix_sequence.<locals>.<listcomp>r� r� r* rW r, �visit_prefix_sequence7 s ���z(_CacheKeyTraversal.visit_prefix_sequencec s t � �fdd�|D ��S )Nc 3 sh | ]`\}}}� |� ���|d k r,|� ���nd |d k rB|� ���nd t� fdd�t� �D ��fV qd S )Nc s g | ]}|� | f�qS r* r* r� ��flagsr* r, rX a s zG_CacheKeyTraversal.visit_setup_join_tuple.<locals>.<genexpr>.<listcomp>)rS rb r� )rU �targetZonclauseZfrom_rW r� r, r� T s � ���z<_CacheKeyTraversal.visit_setup_join_tuple.<locals>.<genexpr>r� r� r* rW 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* rR )rU r� � dialect_name�textrW r* r, rX t s � �z<_CacheKeyTraversal.visit_table_hint_list.<locals>.<listcomp>)rb �itemsr� r* rW r, �visit_table_hint_listf s ���z(_CacheKeyTraversal.visit_table_hint_listc s |t � fdd�t� �D ��fS )Nc s g | ]}|� | f�qS r* r* r� �rh r* r, rX � s z7_CacheKeyTraversal.visit_plain_dict.<locals>.<listcomp>r� r� r* r� r, �visit_plain_dict s z#_CacheKeyTraversal.visit_plain_dictc s |t � fdd�t� �D ��fS )Nc 3 s2 | ]*� � t � �fd d�t�� �D ��fV qdS )c s g | ]}|�� | f�qS r* r* r� )r� rh r* r, rX � s �zF_CacheKeyTraversal.visit_dialect_options.<locals>.<genexpr>.<listcomp>Nr� )rU 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) rR r� �r rQ rh 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 s0 | ](\}}|t |t�r"|�� ��n|fV qd S r) r� �rU ro r� rW r* r, r� � s ���z=_CacheKeyTraversal.visit_string_multi_dict.<locals>.<genexpr>c s g | ]}|� | f�qS r* r* r� r� r* r, rX � s 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) rR )rU �k�col�_rW r* r, r� � s �zR_CacheKeyTraversal.visit_fromclause_canonical_column_collection.<locals>.<genexpr>)rb Z _collectionr� r* rW r, �,visit_fromclause_canonical_column_collection� s ��z?_CacheKeyTraversal.visit_fromclause_canonical_column_collectionc C s d|t < dS �NTr* �r2 r� r* r* r, �visit_unknown_structure� s z*_CacheKeyTraversal.visit_unknown_structurec s |t � �fdd�|D ��fS )Nc 3 s8 | ]0\}}t |d �r |�� ��n||�� ��fV qdS �Z__clause_element__N��hasattrrS r� rW r* r, r� � s �� �z>_CacheKeyTraversal.visit_dml_ordered_values.<locals>.<genexpr>r� r� r* rW r, �visit_dml_ordered_values� s ��z+_CacheKeyTraversal.visit_dml_ordered_valuesc s |t � ��fdd��D ��fS )Nc 3 s8 | ]0}t |d �r |�� ��n|�| �� ��fV qdS r� r� )rU 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 s d|t < dS r� r� r� r* r* r, �visit_dml_multi_values s z)_CacheKeyTraversal.visit_dml_multi_valuesN)4r. r/ r0 r7 Zvisit_has_cache_keyZvisit_clauseelementr r_ Zvisit_clauseelement_listr^ Zvisit_annotations_keyr` Zvisit_clauseelement_tuplera Z visit_memoized_select_entitiesr6 Z visit_stringZ visit_booleanZvisit_operatorZvisit_plain_objZvisit_statement_hint_listr8 Z visit_typer: Zvisit_anon_namer9 Zvisit_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 sJ �� r$ )?� __future__r �enum� itertoolsr �typingr r r r r r r r r r r r Zvisitorsr r r r r r� r Z inspectionr r Z util.typingr r � TYPE_CHECKINGrj r r r r Zengine.interfacesr! r" �Enumr1 r2 r; r3 rb r6 r7 r8 r9 r: r� r% r# rx ry Z MemoizedSlotsr| rm r� r$ rI r* r* r* r, �<module> s� ������� : % A