a
`�]_e � @ s� d dl mZmZ d dlmZ d dlmZ G dd� de�ZG dd� de�Z G dd � d e �Z
e� e
� e� e
� G d
d � d e �Z e� e � e� e � e � Z
ddd�Zdd� ZdS )� )�Sequence�Hashable)�Integral)�reducec @ s< e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zd d � Z d
S )�
_PListBuilderzc
Helper class to allow construction of a list without
having to reverse it in the end.
)�_head�_tailc C s t | _t | _d S �N)� _EMPTY_PLISTr r ��self� r
�7/usr/lib64/python3.9/site-packages/pyrsistent/_plist.py�__init__
s z_PListBuilder.__init__c C s6 | j s||�| _| j| _ n||�| j _| j j| _ | jS r )r r �rest)r �elem� constructorr
r
r �_append s
z_PListBuilder._appendc C s | � |dd� �S )Nc S s
t | t�S r )�PListr
)�er
r
r �<lambda> � z+_PListBuilder.append_elem.<locals>.<lambda>�r �r r r
r
r � append_elem s z_PListBuilder.append_elemc C s | � |dd� �S )Nc S s | S r r
)�lr
r
r r r z,_PListBuilder.append_plist.<locals>.<lambda>r )r �plr
r
r � append_plist s z_PListBuilder.append_plistc C s | j S r )r r r
r
r �build! s z_PListBuilder.buildN)
�__name__�
__module__� __qualname__�__doc__� __slots__r r r r r r
r
r
r r s
r c @ s� e Zd ZdZejZejZdd� Zdd� Zdd� Z e Z
dd � Z d
d � Z d d
� Z
e
Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zd d � Zd S ) �
_PListBase)� __weakref__c C s t t| �ffS r )�plist�listr r
r
r �
__reduce__. s z_PListBase.__reduce__c C s t dd� | D ��S )a
Return the length of the list, computed by traversing it.
This is obviously O(n) but with the current implementation
where a list is also a node the overhead of storing the length
in every node would be quite significant.
c s s | ]
}d V qdS )� Nr
)�.0�_r
r
r � <genexpr>: r z%_PListBase.__len__.<locals>.<genexpr>)�sumr r
r
r �__len__2 s z_PListBase.__len__c C s d� t| ��S )Nz
plist({0}))�formatr' r r
r
r �__repr__< s z_PListBase.__repr__c C s
t || �S )z
Return a new list with elem inserted as new head.
>>> plist([1, 2]).cons(3)
plist([3, 1, 2])
)r r r
r
r �cons@ s z_PListBase.consc C s | }|D ]}|� |�}q|S )a
Return a new list with all elements of iterable repeatedly cons:ed to the current list.
NB! The elements will be inserted in the reverse order of the iterable.
Runs in O(len(iterable)).
>>> plist([1, 2]).mcons([3, 4])
plist([4, 3, 1, 2])
�r1 )r �iterable�headr r
r
r �mconsI s z_PListBase.mconsc C s& t � }| }|r"|�|j�}|j}q
|S )a
Return a reversed version of list. Runs in O(n) where n is the length of the list.
>>> plist([1, 2, 3]).reverse()
plist([3, 2, 1])
Also supports the standard reversed function.
>>> reversed(plist([1, 2, 3]))
plist([3, 2, 1])
)r& r1 �firstr )r �resultr4 r
r
r �reverseX s z_PListBase.reversec C sN t � }| }d}|r6||k r6|�|j� |j}|d7 }q|sB| tfS |�� |fS )z�
Spilt the list at position specified by index. Returns a tuple containing the
list up until index and the list after the index. Runs in O(index).
>>> plist([1, 2, 3, 4]).split(2)
(plist([1, 2]), plist([3, 4]))
r r) )r r r6 r r
r )r �indexZlb�
right_list�ir
r
r �splitm s
z_PListBase.splitc c s | }|r|j V |j}qd S r �r6 r )r Zlir
r
r �__iter__� s z_PListBase.__iter__c C s t |t�stS t| �t|�k S r )�
isinstancer$ �NotImplemented�tuple)r �otherr
r
r �__lt__� s
z_PListBase.__lt__c C sH t |t�stS | }|}|r<|r<|j|jks.dS |j}|j}q| oF| S )z�
Traverses the lists, checking equality of elements.
This is an O(n) operation, but preserves the standard semantics of list equality.
F)r? r$ r@ r6 r )r rB Z self_headZ
other_headr
r
r �__eq__� s
z_PListBase.__eq__c
C s� t |t�rN|jd ur>|jd u r>|jd u s2|jdkr>| �|j�S tt| �| �S t |t�sjt dt
|�j ��|dk r~|t | �7 }z| �|�j
W S ty� } ztd�|�W Y d }~n
d }~0 0 d S )Nr) z-'%s' object cannot be interpreted as an indexr �PList index out of range)r? �slice�start�stop�step�_dropr& rA r � TypeError�typer �lenr6 �AttributeError�
IndexError)r r9 r r
r
r � __getitem__� s
(
z_PListBase.__getitem__c C s0 |dk rt d��| }|dkr,|j}|d8 }q|S )Nr rE r) )rO r )r �countr4 r
r
r rJ � s
z_PListBase._dropc C s t t| ��S r )�hashrA r r
r
r �__hash__� s z_PListBase.__hash__c C sJ t � }| }|r8|j|kr$|�|j�S |�|j� |j}q
td�|���dS )a
Return new list with first element equal to elem removed. O(k) where k is the position
of the element that is removed.
Raises ValueError if no matching element is found.
>>> plist([1, 2, 1]).remove(1)
plist([2, 1])
z{0} not found in PListN)r r6 r r r �
ValueErrorr/ )r r Zbuilderr4 r
r
r �remove� s
z_PListBase.removeN)r r r! r# r rQ r9 r( r. r0 �__str__r1 r5 r8 � __reversed__r< r> rC rD rP rJ rS rU r
r
r
r r$ % s&
r$ c s0 e Zd ZdZdZ� fdd�Zdd� ZeZ� ZS )r a�
Classical Lisp style singly linked list. Adding elements to the head using cons is O(1).
Element access is O(k) where k is the position of the element in the list. Taking the
length of the list is O(n).
Fully supports the Sequence and Hashable protocols including indexing and slicing but
if you need fast random access go for the PVector instead.
Do not instantiate directly, instead use the factory functions :py:func:`l` or :py:func:`plist` to
create an instance.
Some examples:
>>> x = plist([1, 2])
>>> y = x.cons(3)
>>> x
plist([1, 2])
>>> y
plist([3, 1, 2])
>>> y.first
3
>>> y.rest == x
True
>>> y[:2]
plist([3, 1])
r= c s t t| ��| �}||_||_|S r )�superr �__new__r6 r )�clsr6 r �instance�� __class__r
r rY � s z
PList.__new__c C s dS )NTr
r r
r
r �__bool__ s zPList.__bool__) r r r! r" r# rY r^ � __nonzero__�
__classcell__r
r
r\ r r � s
r c @ s4 e Zd ZdZdd� ZeZedd� �Zedd� �ZdS ) � _EmptyPListr
c C s dS )NFr
r r
r
r r^
s z_EmptyPList.__bool__c C s t d��d S )NzEmpty PList has no first)rN r r
r
r r6 s z_EmptyPList.firstc C s | S r r
r r
r
r r s z_EmptyPList.restN) r r r! r# r^ r_ �propertyr6 r r
r
r
r ra
s
ra r
Fc C s$ |st | �} | �� tdd� | t�S )a
Creates a new persistent list containing all elements of iterable.
Optional parameter reverse specifies if the elements should be inserted in
reverse order or not.
>>> plist([1, 2, 3])
plist([1, 2, 3])
>>> plist([1, 2, 3], reverse=True)
plist([3, 2, 1])
c S s
| � |�S r r2 )r r r
r
r r / r zplist.<locals>.<lambda>)r' r8 r r
)r3 r8 r
r
r r& s r& c G s t | �S )zj
Creates a new persistent list containing all arguments.
>>> l(1, 2, 3)
plist([1, 2, 3])
)r& )�elementsr
r
r r 2 s r N)r
F)�collections.abcr r Znumbersr � functoolsr �objectr r$ r �registerra r
r& r r
r
r
r �<module> s :(