File: //usr/lib/python3/dist-packages/duplicity/__pycache__/lazy.cpython-310.pyc
o
�~�_L; � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlZddl m
Z
dd l m Z dd
l m Z G d d � d e�Z
G d
d� de�ZG dd� de�ZG dd� de�ZdS )z=Define some lazy data structures and functions acting on them� )�print_function)�map)�next)�range)�objectN)�log)�robust)�utilc @ s� e Zd ZdZedd� �Zedd� �Zedd� �Zedd � �Zed
d � �Z ed d
� �Z
eddd� fdd��Z edd� �Z edd� �Z
edd� �Zedd� �Zedd � �Zed d d ��ZdS ) �Iterz:Hold static methods for the manipulation of lazy iteratorsc c s � |D ] }| |�r |V qdS )z5Like filter in a lazy functional programming languageN� )� predicate�iterator�ir r �0/usr/lib/python3/dist-packages/duplicity/lazy.py�filter) s ���z Iter.filterc c s � |D ]}| |�V qdS )z2Like map in a lazy functional programming languageNr ��functionr
r r r r r 0 s � �zIter.mapc C s |D ]}| |� qdS )z(Run function on each element in iteratorNr r r r r �foreach6 s
�z Iter.foreachc g � � | D ]
}|D ]}|V qqdS )z Lazily concatenate iteratorsNr )�iters�iterr r r r �cat< � ���zIter.catc c r )z6Lazily concatenate iterators, iterated by big iteratorNr )�
iter_of_itersr r r r r �cat2C r z Iter.cat2c C s | D ]} dS dS )z True if iterator has length 0N� r �r r r r r �emptyJ s z
Iter.emptyNc C s | |kS �Nr )�x�yr r r �<lambda>R s z
Iter.<lambda>c C s� | D ]/}zt |�}W n ty |rtd|f � Y dS w |||�s1|r.td||f � dS qzt |�}W n
tyB Y dS w |rLtd|f � dS )zxTrue if iterator 1 has same elements as iterator 2
Use equality operator, or == if it is unspecified.
zEnd when i1 = %sNz%s not equal to %sr zEnd when i2 = %s)r �
StopIteration�print)�iter1�iter2�verbose�operator�i1�i2r r r �equalQ s* �
� �z
Iter.equalc C s d}| D ]}|r | S q|S )z:True if any element in iterator is true. Short circuitingNr r r r r �Ork � �zIter.Orc C s d}| D ]}|s | S q|S )z<True if all elements in iterator are true. Short circuitingr r r r r r �Andt r, zIter.Andc C s4 d} zt | � W n ty | Y S w |d }q)zReturn length of iteratorr r �r r" r r r r �len} s ��zIter.lenc C s8 zt |�}W n ty | Y S w | |t�| ||��S )z0foldr the "fundamental list recursion operator"?)r r" r
�foldr��f�defaultr � next_itemr r r r0 � s �z
Iter.foldrc C s2 zt |�}W n ty | Y S w | ||�}q)z)the fundamental list iteration operator..r. r1 r r r �foldl� s �
�z
Iter.foldlc s� �dkr�s�st ��}|�� |�� fS �sdd� ��s dd� �g � dg� ��dd� �dg�� �������fdd���fd d
�}tt|tt�����S ) ax Split a single iterater into a number of streams
The return val will be a list with length num_of_forks, each
of which will be an iterator like iter. final_func is the
function that will be called on each element in iter just as
it is being removed from the buffer. closing_func is called
when all the streams are finished.
� c S � d S r r )r r r r r! � � z Iter.multiplex.<locals>.<lambda>c S r7 r r r r r r r! � r8 ���Nc s� �| dkr8z
� � dt��� W n ty( ��kr&�d s&�� d�d< t�w t��D ]
}�| d7 < q-� �| }�| d8 < t� �}|d �vrg�| |d ksZJ ��� |d � � |d = |S )z-Return the next element requested by fork_numr9 r Nr r6 )�insertr r" r r/ )�fork_numr �
return_val�blen)�buffer�called_closing_func� closing_func�
final_func� forkpositionr � num_of_forks�starting_forkpositionr r �get_next� s* ��
z Iter.multiplex.<locals>.get_nextc 3 s. � z� | �}W n
t y Y d S w |V qr )r" )r; �ret)rE r r �
make_iterator� s � ��z%Iter.multiplex.<locals>.make_iterator)�IterMultiplex2�yielda�yieldb�tupler �listr )r rC rA r@ �im2rG r ) r> r? r@ rA rB rE r rC rD r � multiplex� s
zIter.multiplex)NN)�__name__�
__module__� __qualname__�__doc__� staticmethodr r r r r r r* r+ r- r/ r0 r5 rN r r r r r
& s8
r
c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) rH z�Multiplex an iterator into 2 parts
This is a special optimized case of the Iter.multiplex function,
used when there is no closing_func or final_func, and we only want
to split it into 2. By profiling, this is a time sensitive class.
c C s d| _ g | _|| _d S )Nr )� a_leading_byr> r )�selfr r r r �__init__� s
zIterMultiplex2.__init__c c sj � | j | j}} | jdkr%zt|�}W n
ty Y dS w |�|� n|�d�}| jd7 _|V q )zReturn first iteratorr r N�r> r rT r r" �append�pop�rU �bufr �elemr r r rI � � �
�
�zIterMultiplex2.yieldac c sj � | j | j}} | jdkr%zt|�}W n
ty Y dS w |�|� n|�d�}| jd8 _|V q )zReturn second iteratorr r NrW rZ r r r rJ � r] zIterMultiplex2.yieldbN)rO rP rQ rR rV rI rJ r r r r rH � s
rH c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�IterTreeReduceraH Tree style reducer object for iterator - stolen from rdiff-backup
The indicies of a RORPIter form a tree type structure. This class
can be used on each element of an iter in sequence and the result
will be as if the corresponding tree was reduced. This tries to
bridge the gap between the tree nature of directories, and the
iterator nature of the connection between hosts and the temporal
order in which the files are processed.
This will usually be used by subclassing ITRBranch below and then
call the initializer below with the new class.
c C s* || _ || _d| _||� | _| jg| _dS )zITR initializerN)� branch_class� branch_args�index� root_branch�branches)rU r_ r` r r r rV s
zIterTreeReducer.__init__c C sV | j } |d }|j}||dt|�� kr(|�� |d= |s dS |d �|� ndS q)a Run Finish() on all branches index has passed
When we pass out of a branch, delete it and process it with
the parent. The innermost branches will be the last in the
list. Return None if we are out of the entire tree, and 1
otherwise.
r r9 N)rc �
base_indexr/ �
call_end_proc�branch_process)rU ra rc �to_be_finishedrd r r r �finish_branches# s �z IterTreeReducer.finish_branchesc C s | j | j� }| j�|� |S )z;Return branch of type self.branch_class, add to branch list)r_ r` rc rX �rU �branchr r r �
add_branch: s zIterTreeReducer.add_branchc C s( t �|j|j|� |jsd|_||_dS )z"Run start_process on latest branchr N)r �check_common_error�on_error�
start_process�caught_exception�start_successfulrd )rU ra rj �argsr r r �process_w_branch@ s �
z IterTreeReducer.process_w_branchc C s0 | j �� }|�� | j sdS | j d �|� q)z,Call at end of sequence to tie everything upr r9 N)rc rY re rf )rU rg r r r �FinishH s
�zIterTreeReducer.Finishc G s� |d }| j du r| �|| j|� || _ dS || j kr/t�td�t�| j �t�|�f � dS | �|�du r8dS | j d }|j
r[|j |� rOt �
|j|j|� n| �� }| �|||� n|�|� || _ dS )ad Process args, where args[0] is current position in iterator
Returns true if args successfully processed, false if index is
not in the current tree and thus the final result is
available.
Also note below we set self.index after doing the necessary
start processing, in case there is a crash in the middle.
r Nr z#Warning: oldindex %s >= newindex %sr9 )ra rr rb r �Warn�_r �uindexrh rc rp �can_fast_processr rl rm � fast_processrk �log_prev_error)rU rq ra � last_branchrj r r r �__call__Q s.
�
�
zIterTreeReducer.__call__N)
rO rP rQ rR rV rh rk rr rs r{ r r r r r^
s
r^ c @ sd e Zd ZdZd ZZdZd ZZdd� Z dd� Z
dd� Z d d
� Z d d � Z
d
d� Zdd� Zdd� ZdS )� ITRBrancha Helper class for IterTreeReducer above
There are five stub functions below: start_process, end_process,
branch_process, fast_process, and can_fast_process. A class that
subclasses this one will probably fill in these functions to do
more.
Nc C s, | j s| js d| _t�| j| j� d| _ dS )z1Runs the end_process on self, checking for errorsr N)�finishedrp ro r rl rm � end_process�rU r r r re � s
zITRBranch.call_end_procc G � dS )z!Do some initial processing (stub)Nr �rU rq r r r rn � � zITRBranch.start_processc C r� )z4Do any final processing before leaving branch (stub)Nr r r r r r~ � r� zITRBranch.end_processc C s |j sJ �dS )z2Process a branch right after it is finished (stub)N)r} ri r r r rf � s
zITRBranch.branch_processc G r� )z9True if object can be processed without new branch (stub)Nr r� r r r rw � r� zITRBranch.can_fast_processc G r� )z,Process args without new child branch (stub)Nr r� r r r rx � r� zITRBranch.fast_processc G sz d| _ |r|d rt|d t�rtjj|d � }n
| jr$tjj| j� }nd}t�t d�|t
� |�f tj j
t
�|�� dS )z1This is run on any exception in start/end-processr r �.zError '%s' processing %sN)ro �
isinstancerK �os�path�joinra r rt ru r �fsdecode� WarningCode�cannot_process�escape)rU �excrq �filenamer r r rm � s �zITRBranch.on_errorc C s@ |sd}nt jj|� }t�td�t�|� tjj t�
|�� dS )z%Call function if no pending exceptionr� z%Skipping %s because of previous errorN) r� r� r� r rt ru r r� r� �process_skippedr� )rU ra � index_strr r r ry � s �zITRBranch.log_prev_error)rO rP rQ rR rd ra r} ro rp re rn r~ rf rw rx rm ry r r r r r| x s
r| )rR �
__future__r �builtinsr r r r r� � duplicityr r r r
rH r^ r| r r r r �<module> s 80k