Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/celery/utils/__pycache__/collections.cpython-39.pyc
Ðазад
a t�hXc � @ s� d Z ddlZddlmZ ddlmZ ddlmZmZm Z m Z m Z ddl m Z mZmZ ddlmZmZ ddlmZ dd lmZmZmZmZ d d lmZm Z d d l m Z zdd l m Z! W n e"y� dZ!Y n0 zddl#m$Z$m%Z% W n& e"�y G dd� d�Z$e$Z%Y n0 dZ&dZ'dd� Z(dd� Z)G dd� de�ZG dd� d�Z*G dd � d e+e*�Z,G d d � d �Z-e �.e-� G d d � d e �Z/G d!d"� d"e/e*�Z0G d#d$� d$�Z1e �.e1� G d%d&� d&�Z2G d'd(� d(e2�Z3e �.e3� G d)d*� d*ee2�Z4dS )+z8Custom maps, sets, sequences, and other data structures.� N)� OrderedDict)�deque)�Callable�Mapping�MutableMapping� MutableSet�Sequence)�heapify�heappop�heappush)�chain�count)�Empty)�Any�Dict�Iterable�List� )�first�uniq)� match_case)� reversed_dict)� LazyObject� LazySettingsc @ s e Zd ZdS )r N)�__name__� __module__� __qualname__� r r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/celery/utils/collections.pyr s r ) �AttributeDictMixin� AttributeDict� BufferMap�ChainMap�ConfigurationView� DictAttribute� Evictable� LimitedSet� Messagebufferr � force_mapping�lpmergezK<{name}({size}): maxlen={0.maxlen}, expires={0.expires}, minlen={0.minlen}>c C s* t | ttf�r| j} t | t�s&t| �S | S )z?Wrap object into supporting the mapping interface if necessary.)� isinstancer r Z_wrappedr r$ ��mr r r r( ' s r( c s | j � � fdd�|�� D � | S )zpIn place left precedent dictionary merge. Keeps values from `L`, if the value in `R` is :const:`None`. c s" g | ]\}}|d ur� ||��qS �Nr )�.0�k�v��setitemr r � <listcomp>6 � zlpmerge.<locals>.<listcomp>)� __setitem__�items)�L�Rr r1 r r) / s r) c @ s< e Zd ZdZdd� Zeed�s8er.d dd�Zn d dd�Zd S ) r z#Dict where insertion order matters.c C s t t| �� ��S r- )�next�iter�keys��selfr r r �_LRUkey= s zOrderedDict._LRUkey� move_to_endTc C s |s t d��| �|�| |< d S )Nzno last=True on PyPy)�NotImplementedError�pop)r= �key�lastr r r r? F s zOrderedDict.move_to_endc C s� | j | }|d }|d }||d< ||d< | j}|r^|d }||d< ||d< | |d< |d< n(|d }||d< ||d< | |d< |d< d S �Nr r )Z_OrderedDict__mapZ_OrderedDict__root)r= rB rC �linkZ link_prevZ link_next�rootZ first_noder r r r? Q s N)T)T) r r r �__doc__r> �hasattr� _OrderedDict�_dict_is_orderedr? r r r r r : s r c @ s( e Zd ZdZdd� Zedd�dd�ZdS )r z[Mixin for Mapping interface that adds attribute access. I.e., `d.key -> d[key]`). c C s: z | | W S t y4 tt| �j�d|����Y n0 dS )z`d.key -> d[key]`.z object has no attribute N)�KeyError�AttributeError�typer )r= r/ r r r � __getattr__k s �z AttributeDictMixin.__getattr__N)rB �returnc C s || |< dS )z"`d[key] = value -> d.key = value`.Nr �r= rB �valuer r r � __setattr__t s z AttributeDictMixin.__setattr__)r r r rG rN �strrR r r r r r e s r c @ s e Zd ZdZdS )r z$Dict subclass with attribute access.N)r r r rG r r r r r y s r c @ s� e Zd ZdZdZdd� Zdd� Zdd� Zdd d �Zd d d �Z d d� Z dd� Z dd� Z dd� Z e Zdd� Zdd� ZeZdd� ZeZeZe ZeZdS ) r$ z[Dict interface to attributes. `obj[k] -> obj.k` `obj[k] = val -> obj.k = val` Nc C s t �| d|� d S )N�obj)�objectrR )r= rT r r r �__init__� s zDictAttribute.__init__c C s t | j|�S r- )�getattrrT �r= rB r r r rN � s zDictAttribute.__getattr__c C s t | j||�S r- ��setattrrT rP r r r rR � s zDictAttribute.__setattr__c C s& z | | W S t y | Y S 0 d S r- �rK �r= rB �defaultr r r �get� s zDictAttribute.getc C s || vr|| |< d S r- r r\ r r r � setdefault� s zDictAttribute.setdefaultc C s. zt | j|�W S ty( t|��Y n0 d S r- )rW rT rL rK rX r r r � __getitem__� s zDictAttribute.__getitem__c C s t | j||� d S r- rY rP r r r r5 � s zDictAttribute.__setitem__c C s t | j|�S r- )rH rT rX r r r � __contains__� s zDictAttribute.__contains__c C s t t| j��S r- )r: �dirrT r< r r r � _iterate_keys� s zDictAttribute._iterate_keysc C s | � � S r- �rc r< r r r �__iter__� s zDictAttribute.__iter__c c s$ | � � D ]}|t| j|�fV qd S r- �rc rW rT rX r r r �_iterate_items� s z DictAttribute._iterate_itemsc c s | � � D ]}t| j|�V qd S r- rf rX r r r �_iterate_values� s z DictAttribute._iterate_values)N)N)r r r rG rT rV rN rR r^ r_ r` r5 ra rc �iterkeysre rg � iteritemsrh � itervaluesr6 r; �valuesr r r r r$ } s( r$ c @ s e Zd ZdZdZdZdZdZdZdd� Z dd� Z dd � Z d d � Z d d � Z dd� Zdd� Zdd� Zdd� Zd4dd�Zdd� Zdd� Zd d � Zd d � ZeZd5d d!�Zd"d#� Zd$d%� Zed&d'� �Z d(d)� Z e Z d*d+� Z d,d-� Z e Z!d.d/� Z"e"Z#d0d1� Z$e$Z%d2d3� Z&e Z'e"Z(e$Z)dS )6r" z!Key lookup on a sequence of maps.Nr c O s: t |p i g�}| jj|�d�||d |dd � g d� d S )N�key_tr r )rm �maps�changes�defaults� _observers)�list�__dict__�updater^ )r= rn �kwargsr r r rV � s �zChainMap.__init__c C s( t |�}| j�d|� | j�d|� d S rD )r( rp �insertrn )r= �dr r r � add_defaults� s zChainMap.add_defaultsc G s@ z| j d j|g|�R � W S ty: td|����Y n0 d S )Nr z$Key not found in the first mapping: )rn rA rK r\ r r r rA � s �z ChainMap.popc C s t |��d S r- r[ rX r r r � __missing__� s zChainMap.__missing__c C s | j d ur| � |�S |S r- )rm rX r r r �_key� s z ChainMap._keyc C sB | � |�}| jD ]&}z|| W S ty4 Y q0 q| �|�S r- )rz rn rK ry )r= rB rz �mappingr r r r` � s zChainMap.__getitem__c C s || j | �|�< d S r- �ro rz rP r r r r5 � s zChainMap.__setitem__c C s8 z| j | �|�= W n ty2 td|����Y n0 d S )Nz Key not found in first mapping: )ro rz rK rX r r r � __delitem__ s zChainMap.__delitem__c C s | j �� d S r- �ro �clearr< r r r r s zChainMap.clearc C s, z| | � |� W S ty& | Y S 0 d S r- )rz rK r\ r r r r^ s z ChainMap.getc C s t t� j| j� �S r- )�len�set�unionrn r< r r r �__len__ s zChainMap.__len__c C s | � � S r- rd r< r r r re s zChainMap.__iter__c s" | � � �� t� fdd�| jD ��S )Nc 3 s | ]}� |v V qd S r- r )r. r, �rB r r � <genexpr> r4 z(ChainMap.__contains__.<locals>.<genexpr>)rz �anyrn rX r r� r ra s zChainMap.__contains__c C s t | j�S r- )r� rn r< r r r �__bool__ s zChainMap.__bool__c C s | � |�}|| vr|| |< d S r- )rz r\ r r r r_ % s zChainMap.setdefaultc O s0 | j j|i |��}| jD ]}||i |�� q|S r- )ro rt rq )r= �argsru �result�callbackr r r rt + s zChainMap.updatec C s d� | d�tt| j���S )Nz{0.__class__.__name__}({1})z, )�format�join�map�reprrn r< r r r �__repr__2 s �zChainMap.__repr__c G s | t j|g|�R � �S )z?Create a ChainMap with a single dict created from the iterable.)�dict�fromkeys)�cls�iterabler� r r r r� 7 s zChainMap.fromkeysc C s& | j | jd �� g| jdd � �R � S rD )� __class__rn �copyr< r r r r� = s z ChainMap.copyc s t � fdd�t| j�D �� S )Nc 3 s | ]}� |�V qd S r- r )r. rw ��opr r r� H r4 z!ChainMap._iter.<locals>.<genexpr>)r �reversedrn )r= r� r r� r �_iterB s zChainMap._iterc C s t | �dd� ��S )Nc S s | � � S r- �r; )rw r r r �<lambda>L r4 z(ChainMap._iterate_keys.<locals>.<lambda>)r r� r< r r r rc J s zChainMap._iterate_keysc s � fdd�� D �S )Nc 3 s | ]}|� | fV qd S r- r �r. rB r< r r r� Q r4 z*ChainMap._iterate_items.<locals>.<genexpr>r r< r r< r rg O s zChainMap._iterate_itemsc s � fdd�� D �S )Nc 3 s | ]}� | V qd S r- r r� r< r r r� V r4 z+ChainMap._iterate_values.<locals>.<genexpr>r r< r r< r rh T s zChainMap._iterate_valuesc C s | j �|� d S r- )rq �append)r= r� r r r �bind_toY s zChainMap.bind_to)N)N)*r r r rG rm ro rp rn rq rV rx rA ry rz r` r5 r} r r^ r� re ra r� � __nonzero__r_ rt r� � classmethodr� r� �__copy__r� rc ri rg rj rh rk r� r; r6 rl r r r r r" � sN r" c sh e Zd ZdZd� fdd� Zdd� Z� fdd�Zd d � Zd d � Zdd d�Z dd� Z dd� Z dd� Z � Z S )r# a� A view over an applications configuration dictionaries. Custom (but older) version of :class:`collections.ChainMap`. If the key does not exist in ``changes``, the ``defaults`` dictionaries are consulted. Arguments: changes (Mapping): Map of configuration changes. defaults (List[Mapping]): List of dictionaries containing the default configuration. Nc sJ |d u r g n|}t � j|g|�R � | jj|r<|�d�d n||d� d S )N�_)�prefix�_keys)�superrV rs rt �rstrip)r= ro rp r; r� �r� r r rV o s �zConfigurationView.__init__c C s4 | j }|r.|�|�s || n|}t||�|fS |fS r- )r� � startswithr )r= rB r� �pkeyr r r �_to_keysx s zConfigurationView._to_keysc s� | � � �}t� j}|| jr2t� fdd�| jD ��nd D ]&}z||�W S ty\ Y q80 q8z | �� �W S ty� t|�dkr�tdj|� ��� Y n0 d S )Nc 3 s | ]}|� �V qd S r- r )r. �fr� r r r� � r4 z0ConfigurationView.__getitem__.<locals>.<genexpr>r r z)Key not found: {0!r} (with prefix: {0!r})) r� r� r` r� �tuplerK ry r� r� )r= rB r; �getitemr/ r� r� r r` � s" � �z ConfigurationView.__getitem__c C s || j | �|�< d S r- r| rP r r r r5 � s z ConfigurationView.__setitem__c s t d � fdd�|D ��S )Nc 3 s | ]}� � |�V qd S r- )r^ r� r< r r r� � r4 z*ConfigurationView.first.<locals>.<genexpr>)r )r= r; r r< r r � s zConfigurationView.firstc C s& z | | W S t y | Y S 0 d S r- r[ r\ r r r r^ � s zConfigurationView.getc C s | j �� dS )z&Remove all changes, but keep defaults.Nr~ r< r r r r � s zConfigurationView.clearc s" | � |�� t� fdd�| jD ��S )Nc 3 s$ | ] � t � fd d��D ��V qdS )c 3 s | ]}|� v V qd S r- r )r. r/ r+ r r r� � r4 z;ConfigurationView.__contains__.<locals>.<genexpr>.<genexpr>N)r� )r. r� r+ r r� � r4 z1ConfigurationView.__contains__.<locals>.<genexpr>)r� r� rn rX r r� r ra � s z ConfigurationView.__contains__c C s@ |j d }|j d }| j j|||j d |j d |g| d� d S )Nro rp rm r� )ro rp rm r� rn )rs rt )r= �otherro rp r r r � swap_with� s �zConfigurationView.swap_with)NNN)N)r r r rG rV r� r` r5 r r^ r ra r� � __classcell__r r r� r r# a s r# c @ s� e Zd ZdZdZd*dd�Zdd� Zd d � Zd d � Zd+d d�Z dd� Z dd� Z e Z d,dd�Z d-eed�dd�Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� ZeZed(d)� �ZdS ).r& a/ Kind-of Set (or priority queue) with limitations. Good for when you need to test for membership (`a in set`), but the set should not grow unbounded. ``maxlen`` is enforced at all times, so if the limit is reached we'll also remove non-expired items. You can also configure ``minlen``: this is the minimal residual size of the set. All arguments are optional, and no limits are enabled by default. Arguments: maxlen (int): Optional max number of items. Adding more items than ``maxlen`` will result in immediate removal of items sorted by oldest insertion time. expires (float): TTL for all items. Expired items are purged as keys are inserted. minlen (int): Minimal residual size of this set. .. versionadded:: 4.0 Value must be less than ``maxlen`` if both are configured. Older expired items will be deleted, only after the set exceeds ``minlen`` number of items. data (Sequence): Initial data to initialize set with. Can be an iterable of ``(key, value)`` pairs, a dict (``{key: insertion_time}``), or another instance of :class:`LimitedSet`. Example: >>> s = LimitedSet(maxlen=50000, expires=3600, minlen=4000) >>> for i in range(60000): ... s.add(i) ... s.add(str(i)) ... >>> 57000 in s # last 50k inserted values are kept True >>> '10' in s # '10' did expire and was purged from set. False >>> len(s) # maxlen is reached 50000 >>> s.purge(now=time.monotonic() + 7200) # clock + 2 hours >>> len(s) # now only minlen items are cached 4000 >>>> 57000 in s # even this item is gone now False � r Nc C s� |d u r dn|| _ |d u r dn|| _|d u r0dn|| _i | _g | _|rP| �|� | j | j krhdksrn td��| jdk r�td��d S )Nr z:minlen must be a positive number, less or equal to maxlen.zexpires cannot be negative!)�maxlen�minlen�expires�_data�_heaprt � ValueError)r= r� r� �datar� r r r rV � s � zLimitedSet.__init__c C s, dd� | j �� D �| jdd�< t| j� dS )z=Time consuming recreating of heap. Don't run this too often.c S s g | ]}|�qS r r )r. �entryr r r r3 r4 z,LimitedSet._refresh_heap.<locals>.<listcomp>N)r� rl r� r r< r r r � _refresh_heap s zLimitedSet._refresh_heapc C s | j | jkr| �� d S r- )�_heap_overload�max_heap_percent_overloadr� r< r r r �_maybe_refresh_heap s z LimitedSet._maybe_refresh_heapc C s | j �� g | jdd�< dS )z)Clear all data, start from scratch again.N)r� r r� r< r r r r s zLimitedSet.clearc C s` |p t �� }|| jv r | �|� ||f}|| j|< t| j|� | jr\t| j�| jkr\| �� dS )z=Add a new item, or reset the expiry time of an existing item.N) �time� monotonicr� �discardr r� r� r� �purge)r= �item�nowr� r r r �add s zLimitedSet.addc C s� |sdS t |t�r2| j�|j� | �� | �� nvt |t�r�|�� D ]L\}}t |tt f�rb|d }t |t �s�t dt |��d|� ���| � ||� qDn|D ]}| � |� q�dS )z8Update this set from other LimitedSet, dict or iterable.Nr z$Expecting float timestamp, got type z with value: )r* r& r� rt r� r� r� r6 r� rr �floatr� rM r� )r= r� rB �insertedrT r r r rt s* ���zLimitedSet.updatec C s | j �|d � | �� d S r- )r� rA r� �r= r� r r r r� : s zLimitedSet.discardc C s� |p t �� }t|t�r |� n|}| jr@t| j�| jkr@| �� q&| jr�t| j�| j krbdkr�n n(| j d \}}|| j |kr�q�| �� qFdS )z�Check oldest items and remove them if needed. Arguments: now (float): Time of purging -- by default right now. This can be useful for unit testing. r N) r� r� r* r r� r� r� rA r� r� r� )r= r� Z inserted_timer� r r r r� A s zLimitedSet.purge)r] rO c C sB | j r>t| j �\}}z| j�|� W n ty6 Y q 0 |S q |S )z?Remove and return the oldest item, or :const:`None` when empty.)r� r r� rA rK )r= r] r� r� r r r rA V s zLimitedSet.popc C s dd� | j �� D �S )a6 Whole set as serializable dictionary. Example: >>> s = LimitedSet(maxlen=200) >>> r = LimitedSet(maxlen=200) >>> for i in range(500): ... s.add(i) ... >>> r.update(s.as_dict()) >>> r == s True c S s i | ]\}}||�qS r r )r. r� rB r r r � <dictcomp>p r4 z&LimitedSet.as_dict.<locals>.<dictcomp>)r� rl r< r r r �as_dictb s zLimitedSet.as_dictc C s | j |j kS r- �r� )r= r� r r r �__eq__r s zLimitedSet.__eq__c C s t j| t| �jt| �d�S )N)�name�size)�REPR_LIMITED_SETr� rM r r� r< r r r r� v s �zLimitedSet.__repr__c C s dd� t | j�� �D �S )Nc s s | ]\}}|V qd S r- r )r. r� �ir r r r� ~ r4 z&LimitedSet.__iter__.<locals>.<genexpr>)�sortedr� rl r< r r r re | s zLimitedSet.__iter__c C s t | j�S r- )r� r� r< r r r r� � s zLimitedSet.__len__c C s || j v S r- r� rX r r r ra � s zLimitedSet.__contains__c C s | j | j| j| �� | jffS r- )r� r� r� r� r� r< r r r � __reduce__� s �zLimitedSet.__reduce__c C s t | j�S r- )�boolr� r< r r r r� � s zLimitedSet.__bool__c C s" t | j�d tt | j�d� d S )z5Compute how much is heap bigger than data [percents].�d r )r� r� �maxr� r< r r r r� � s zLimitedSet._heap_overload)r r Nr )N)N)N)r r r rG r� rV r� r� r r� rt r� Z pop_valuer� r rA r� r� r� re r� ra r� r� r� �propertyr� r r r r r& � s. 5 r& c @ sF e Zd ZdZeZdd�dd�Zdefedd�dd �Zdd�d d �Z dS ) r% z2Mixin for classes supporting the ``evict`` method.N�rO c C s | j td� dS )z&Force evict until maxsize is enforced.)�rangeN)�_evictr r< r r r �evict� s zEvictable.evictr� )�limitrO c s2 z� fdd�||�D � W n t y, Y n0 d S )Nc s g | ] }� � � �qS r )�_evict1)r. r� r< r r r3 � r4 z$Evictable._evict.<locals>.<listcomp>)� IndexError)r= r� r� r r< r r� � s zEvictable._evictc C s> | j | jkrt� �z | �� W n | jy8 t� �Y n0 d S r- )� _evictcount�maxsizer� � _pop_to_evictr r< r r r r� � s zEvictable._evict1) r r r rG r r� r� �intr� r� r r r r r% � s r% c @ s� e Zd ZdZeZdefdd�Zdd� Zdd� Zd d � Z d d � Z d d� Z dd� Z dd� Z ed�dd�Zdd� Zdd� Zedd� �ZdS ) r' z A buffer of pending messages.Nc C s@ || _ ||pg �| _| jj| _| jj| _| jj| _| jj| _ d S r- ) r� r� r� �_append�popleft�_popr� �_len�extend�_extend)r= r� r� r r r r rV � s zMessagebuffer.__init__c C s | � |� | jo| �� d S r- )r� r� r� r� r r r �put� s zMessagebuffer.putc C s | � |� | jo| �� d S r- )r� r� r� )r= �itr r r r� � s zMessagebuffer.extendc G s: z | � � W S ty4 |r(|d Y S | �� �Y n0 d S )Nr )r� r� r �r= r] r r r �take� s zMessagebuffer.takec C s | � � S r- )r� r< r r r r� � s zMessagebuffer._pop_to_evictc C s$ dt | �j� dt| �� d| j� d�S �N�<z: �/�>)rM r r� r� r< r r r r� � s zMessagebuffer.__repr__c c s, z| � � V W q ty$ Y q(Y q 0 q d S r- )r� r� r< r r r re � s zMessagebuffer.__iter__c C s | � � S r- )r� r< r r r r� � s zMessagebuffer.__len__r� c C s || j v S r- �r� r� r r r ra � s zMessagebuffer.__contains__c C s t | j�S r- )r� r� r< r r r � __reversed__� s zMessagebuffer.__reversed__c C s | j | S r- r� )r= �indexr r r r` � s zMessagebuffer.__getitem__c C s t | �S r- �r� r< r r r r� � s zMessagebuffer._evictcount)r r r rG r r rV r� r� r� r� r� re r� r� ra r� r` r� r� r r r r r' � s r' c s� e Zd ZdZeZeZdZdZdZ d� fdd� Z dd� Z d d � Z d d � Z d d� Zdd� Zdd� Zdd� Zdd� Zedd� �Z� ZS )r! zMap of buffers.Nr �� c s@ t � �� || _d| _|r$| �|� tdd� | �� D ��| _d S )Nr� c s s | ]}t |�V qd S r- r� )r. �bufr r r r� r4 z%BufferMap.__init__.<locals>.<genexpr>)r� rV r� � bufmaxsizert �sumr6 �total)r= r� r� r� r� r r rV s zBufferMap.__init__c C s: | � |��|� | jd7 _| �|� | jo4| �� d S )Nr )�_get_or_create_bufferr� r� r? r� r� )r= rB r� r r r r� s z BufferMap.putc C s4 | � |��|� | jt|�7 _| jo.| �� d S r- )r� r� r� r� r� r� )r= rB r� r r r r� s zBufferMap.extendc G s� d\}}z | | }W n t y* d}Y n@0 z|�� }| jd8 _W n | jy^ d}Y n 0 | �|� |r�|rz|d S | �� �|S )N)NFTr r )rK r� r� r r? )r= rB r] r� �throwr� r r r r� s zBufferMap.takec C s6 z | | W S t y0 | �� }| |< | Y S 0 d S r- )rK � _new_buffer)r= rB r� r r r r� 3 s z BufferMap._get_or_create_bufferc C s | j | jd�S )N)r� )�Bufferr� r< r r r r� ; s zBufferMap._new_bufferc G s | | � � j|� S r- )r> r� r� r r r �_LRUpop? s zBufferMap._LRUpopc C s� t d�D ]t}| �� }| | }z |�� W n" t| jfyJ | �|� Y q0 | jd8 _t|�sn| �|� n | �|� q~qd S )Nr� r ) r� r> r� r� r rA r� r� r? )r= r� rB r� r r r r� C s zBufferMap._pop_to_evictc C s" dt | �j� d| j� d| j� d�S r� )rM r r� r� r< r r r r� X s zBufferMap.__repr__c C s | j S r- )r� r< r r r r� \ s zBufferMap._evictcount)Nr� )r r r rG r' r� r r� r� r� rV r� r� r� r� r� r� r� r� r� r� r� r r r� r r! � s" r! )5rG r� � collectionsr rI r �collections.abcr r r r r �heapqr r r � itertoolsr r �queuer �typingr r r r Z functionalr r �textr Z__pypy__r rJ � ImportErrorZdjango.utils.functionalr r �__all__r� r( r) r r� r r$ �registerr" r# r& r% r' r! r r r r �<module> sL +J X a F
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка