File: //proc/1233/cwd/usr/lib/python3/dist-packages/debian/__pycache__/_util.cpython-38.pyc
U
�|�a�4 � @ s� d dl Z d dl mZ z<d dlmZmZmZmZmZmZm Z m
Z
m Z m Z e d�Z
W n ek
rh dZ
Y nX dd� ZG dd � d e�ZeZd
d � ZG d d
� d
ee
�ZG dd� dee
�ZG dd� de�ZdS )� N)�
ReferenceType)
�Iterable�Optional�Generic�Dict�List�Iterator�TypeVar�
TYPE_CHECKING�Any�Callable�TFc C s | d k r| � S d S �N� )�refr r �./usr/lib/python3/dist-packages/debian/_util.py� resolve_ref s r c s\ e Zd ZdZddgZer$� fdd�Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z � Z
S )�_CaseInsensitiveStringz Case insensitive string.
� str_lower�str_origc s t t| ��|� d| _d| _d S )N� )�superr �__init__r r )�self�s�� __class__r r r s z _CaseInsensitiveString.__init__c C s t �| |�}||_|�� |_|S r )�str�__new__r �lowerr )�clsZstr_r r r r r $ s
z _CaseInsensitiveString.__new__c C s | j S r )r �r r r r �__str__, s z _CaseInsensitiveString.__str__c C s
t | j�S r )�hashr r! r r r �__hash__0 s z _CaseInsensitiveString.__hash__c C s, z| j |�� kW S tk
r& Y dS X d S )NF)r r �AttributeError�r �otherr r r �__eq__4 s z _CaseInsensitiveString.__eq__c C s
| |k S r r r& r r r �__ne__; s z _CaseInsensitiveString.__ne__c C s | j S r )r r! r r r r ? s z _CaseInsensitiveString.lower)�__name__�
__module__� __qualname__�__doc__� __slots__r
r r r" r$ r( r) r �
__classcell__r r r r r s r c C s | � � S r )r ��xr r r �default_field_sort_keyG s r2 c @ s~ e Zd ZdZdd� Zedd� �Zejdd� �Zdd� Zd d
�d d �Z d d
�d
d�Z
e dd� �Z e dd� �Z
dd� Zdd� ZdS )�LinkedListNode)�_previous_node�value� next_node� __weakref__c C s d | _ d | _|| _d S r )r4 r6 r5 �r r5 r r r r P s zLinkedListNode.__init__c C s
t | j�S r )r r4 r! r r r �
previous_nodeV s z LinkedListNode.previous_nodec C s |d k rt �|�nd | _d S r )�weakrefr r4 �r �noder r r r9 [ s c C s" t �| j| j� d | _d | _| jS r )r3 �
link_nodesr9 r6 r5 r! r r r �remove` s zLinkedListNode.removeF)� skip_currentc c s$ |r
| j n| }|r |V |j }qd S r )r6 �r r? r< r r r � iter_nextg s zLinkedListNode.iter_nextc c s$ |r
| j n| }|r |V |j }qd S r )r9 r@ r r r �
iter_previousp s z LinkedListNode.iter_previousc C s |r
| |_ | r|| _d S r �r9 r6 rC r r r r= y s zLinkedListNode.link_nodesc C s t �| |� t �||� d S r )r3 r= )Z
first_node�new_nodeZ last_noder r r � _insert_link� s zLinkedListNode._insert_linkc C s* | |k r|| j k st�t�| j || � d S r )r9 �AssertionErrorr3 rE �r rD r r r �
insert_before� s z LinkedListNode.insert_beforec C s* | |k r|| j k st�t�| || j � d S r )r6 rF r3 rE rG r r r � insert_after� s zLinkedListNode.insert_afterN)r* r+ r, r. r �propertyr9 �setterr> rA rB � staticmethodr= rE rH rI r r r r r3 L s"
�
�
r3 c @ s� e Zd ZdZdZd&dd�Zdd� Zdd � Zed
d � �Z d d
� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� ZdS )'�
LinkedListav Specialized linked list implementation to support the deb822 parser needs
We deliberately trade "encapsulation" for features needed by this library
to facilitate their implementation. Notably, we allow nodes to leak and assume
well-behaved calls to remove_node - because that makes it easier to implement
components like Deb822InvalidParagraphElement.
�� head_node� tail_node�_sizeNc C s( d | _ d | _d| _|d k r$| �|� d S �Nr )rO rP rQ �extend)r �valuesr r r r � s
zLinkedList.__init__c C s
| j d k S r )rO r! r r r �__bool__� s zLinkedList.__bool__c C s | j S r )rQ r! r r r �__len__� s zLinkedList.__len__c C s | j d k r| j jS d S r )rP r5 r! r r r �tail� s zLinkedList.tailc C s" | j d krtd��| �| j � d S )Nzpop from empty list)rP �
IndexError� remove_noder! r r r �pop� s
zLinkedList.popc c s$ | j }|d krd S |�� E d H d S r )rO rA )r rO r r r �
iter_nodes� s zLinkedList.iter_nodesc c s dd� | � � D �E d H d S )Nc s s | ] }|j V qd S r �r5 )�.0r< r r r � <genexpr>� s z&LinkedList.__iter__.<locals>.<genexpr>)r[ r! r r r �__iter__� s zLinkedList.__iter__c c s. | j }|d krd S dd� |�� D �E d H d S )Nc s s | ] }|j V qd S r r\ )r] �nr r r r^ � s z*LinkedList.__reversed__.<locals>.<genexpr>)rP rB )r rP r r r � __reversed__� s zLinkedList.__reversed__c C sl || j kr$|j| _ | j d krDd | _n || jkrD|j| _| jd k sDt�| jdksRt�| jd8 _|�� d S )Nr � )rO r6 rP r9 rF rQ r> r; r r r rY � s
zLinkedList.remove_nodec C s" | j d kr| �|�S | �|| j �S r )rO �appendrH r8 r r r �insert_at_head� s
zLinkedList.insert_at_headc C sR t |�}| jd kr || _|| _n | jd k s.t�| j�|� || _| jd7 _|S )Nrb )r3 rO rP rF rI rQ )r r5 r< r r r rc � s
zLinkedList.appendc C s | � t|�|�S r )�insert_node_beforer3 �r r5 �
existing_noder r r rH � s zLinkedList.insert_beforec C s | � t|�|�S r )�insert_node_afterr3 rf r r r rI � s zLinkedList.insert_afterc C sZ | j d krtd��|jd k s&|jd k r.td��|�|� || j krH|| _ | jd7 _|S �Nz,List is empty; node argument cannot be validz&New node must not already be inserted!rb )rO �
ValueErrorr6 r9 rH rQ �r rD rg r r r re � s
z LinkedList.insert_node_beforec C sZ | j d krtd��|jd k s&|jd k r.td��|�|� || j krH|| _ | jd7 _|S ri )rP rj r6 r9 rI rQ rk r r r rh s
z LinkedList.insert_node_afterc C s |D ]}| � |� qd S r )rc )r rT �vr r r rS s zLinkedList.extendc C s d | _ d | _d| _d S rR rN r! r r r �clear s zLinkedList.clear)N)r* r+ r, r- r. r rU rV rJ rW rZ r[ r_ ra rY rd rc rH rI re rh rS rm r r r r rM � s(
rM c @ s~ e Zd ZdZd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
eZ dd� Z dd� Z
dd� Zdd� Zdd� Zdd � ZdS ) �
OrderedSetz�A set-like object that preserves order when iterating over it
We use this to keep track of keys in Deb822Dict, because it's much faster
to look up if a key is in a set than in a list.
Nc C s2 i | _ t� | _|d krg }|D ]}| �|� q d S r )�_OrderedSet__tablerM �_OrderedSet__order�add�r �iterable�itemr r r r # s zOrderedSet.__init__c C sJ || krF| j �|�}z|| j|< W n" tk
rD | j �|� � Y nX d S r )rp rc ro � ExceptionrY �r rt r< r r r rq 1 s zOrderedSet.addc C s" | j | }| j |= | j�|� d S r )ro rp rY rv r r r r> ? s
zOrderedSet.removec C s
t | j�S r )�iterrp r! r r r r_ G s zOrderedSet.__iter__c C s t t| j��S r )rw �reversedrp r! r r r ra L s zOrderedSet.__reversed__c C s
t | j�S r )�lenrp r! r r r rV Q s zOrderedSet.__len__c C s
|| j kS r )ro �r rt r r r � __contains__U s zOrderedSet.__contains__c C s |D ]}| � |� qd S r )rq rr r r r rS ^ s zOrderedSet.extendc C s | � || jj� dS )z2Re-order the given item so it is "last" in the setN)�_reorderrp rc rz r r r �
order_lastd s zOrderedSet.order_lastc C s | � || jj� dS )z3Re-order the given item so it is "first" in the setN)r| rp rd rz r r r � order_firsti s zOrderedSet.order_firstc s4 ||krt d���j| � ��|� �fdd�� dS )zTRe-order the given item so appears directly after the reference item in the sequence�*Cannot re-order an item relative to itselfc s �j �| � �S r )rp rH r0 �Zreference_noder r r �<lambda>t � z)OrderedSet.order_before.<locals>.<lambda>N�rj ro r| �r rt Zreference_itemr r� r � order_beforen s
zOrderedSet.order_beforec s4 ||krt d���j| � ��|� �fdd�� dS )zURe-order the given item so appears directly before the reference item in the sequencer c s �j �| � �S r )rp rI r0 r� r r r� | r� z(OrderedSet.order_after.<locals>.<lambda>Nr� r� r r� r � order_afterv s
zOrderedSet.order_afterc C s. | j | }| j�|� ||j�}|| j |< d S r )ro rp rY r5 )r rt Z
reinserterr< rD r r r r| ~ s
zOrderedSet._reorder)N)r* r+ r, r- r rq r> r_ ra rV r{ rc rS r} r~ r� r� r| r r r r rn s
rn )r: r �typingr r r r r r r r
r r r
� ImportErrorr r r �_strIr2 r3 rM �objectrn r r r r �<module> s 0
-I