File: //kunden/lib/python3/dist-packages/dulwich/__pycache__/walk.cpython-39.pyc
a
�~�_E> � @ s� d Z ddlZddlZddlmZ ddlmZmZmZm Z ddl
m Z ddl m
Z
dZdZeefZd ZG d
d � d e�ZG d d
� d
e�ZG dd� de�Zdd� fdd�ZdS )z=General implementation of walking commits and their contents.� N)�chain)�RENAME_CHANGE_TYPES� tree_changes�tree_changes_for_merge�RenameDetector)�MissingCommitError)�Tag�dateZtopo� c @ s* e Zd ZdZdd� Zd dd�Zdd� ZdS )
� WalkEntryz1Object encapsulating a single result from a walk.c C s( || _ |j| _|j| _i | _|j| _d S �N)�commit�store�_store� get_parents� _get_parents�_changes�rename_detector�_rename_detector)�self�walkerr
� r �./usr/lib/python3/dist-packages/dulwich/walk.py�__init__5 s
zWalkEntry.__init__Nc
sL � j �|�}|du �rB� j}� �|�s0t}d}n�t� �|��dkr�t}� j� �|�d j}|r�|�� jj |�\}}� j| }nvt
}� fdd�� �|�D �}|r�� fdd�|D �}g }|D ]:} z| �� jj |�\}}
W n t y� Y q�0 |� |
� q�|j} |�r � j| } | �� jj |�\}} t
|� j|| � jd��}|� j |< � j | S )a- Get the tree changes for this entry.
Args:
path_prefix: Portion of the path in the repository to
use to filter changes. Must be a directory name. Must be
a full, valid, path reference (no partial names or wildcards).
Returns: For commits with up to one parent, a list of TreeChange
objects; if the commit has no parents, these will be relative to
the empty tree. For merge commits, a list of lists of TreeChange
objects; see dulwich.diff.tree_changes_for_merge.
N� r c s g | ]}� j | j�qS r )r �tree��.0�p�r r r �
<listcomp>Y s z%WalkEntry.changes.<locals>.<listcomp>c s g | ]}� j | �qS r )r r r r r r \ � )r )r �getr
r r �lenr r Z lookup_path� __getitem__r �KeyError�append�listr )
r Z path_prefix�cachedr
Z changes_func�parent�modeZ subtree_shaZ parent_treesr �stZcommit_tree_shaZ commit_treer r r �changes< sX
�
��
��
zWalkEntry.changesc C s d| j j| �� f S )Nz!<WalkEntry commit=%s, changes=%r>)r
�idr, r r r r �__repr__u s �zWalkEntry.__repr__)N)�__name__�
__module__� __qualname__�__doc__r r, r. r r r r r 2 s
9r c @ s4 e Zd ZdZdd� Zdd� Zdd� Zdd � ZeZd
S ) �_CommitTimeQueuez3Priority queue of WalkEntry objects by commit time.c C sx || _ |j| _|j| _|j| _g | _t� | _ t� | _
t� | _ |j | _
d | _t| _d| _t|j|j�D ]}| �|� qdd S )NF)�_walkerr r r r �excluded� _excluded�_pq�set�_pq_set�_seen�_done�since� _min_time�_last�_MAX_EXTRA_COMMITS�_extra_commits_left� _is_finishedr �include�_push)r r � commit_idr r r r } s z_CommitTimeQueue.__init__c C s� z| j | }W n ty( t|��Y n0 t|t�rH| �|jd � d S |}|j| jvr�|j| j vr�t
� | j |j
|f� | j�|j� | j�|j� d S �Nr )r r% r �
isinstancer rC �objectr- r9 r; �heapq�heappushr7 � commit_time�addr: )r Z object_id�objr
r r r rC � s
z_CommitTimeQueue._pushc C s^ | j }| j}|g}|rZ|�� }| �|�D ].}||vrL||v rL|�| j| � |�|� q(qd S r )r6 r: �popr r& r rK )r r
r5 �seen�todor) r r r �_exclude_parents� s z!_CommitTimeQueue._exclude_parentsc s. � j r
d S � j�r$t�� j�\}}|j}� j�|� |� jv r@q
� j�|� � � |�D ]}� �
|� qVd}|� j v }|r̈ � |� � jr�t
� fdd�� jD ��r̈ jd \}}� jr�|j� jjkr�d}nd}� jd ur�|j� jk r�d}|r�t� _n� jd8 _� j�s �q$|s
|� _t� j|�S q
d� _ d S )NTc 3 s | ]\}}|j � jv V qd S r )r- r6 )r �_�cr r r � <genexpr>� s �z(_CommitTimeQueue.next.<locals>.<genexpr>r Fr )rA r7 rH �heappopr- r9 �remover; rK r rC r6 rP �allr> rJ r= r? r@ r r4 )r rQ r
Zsha� parent_idZreset_extra_commitsZ is_excluded�nr r r �next� sH
�
�z_CommitTimeQueue.nextN) r/ r0 r1 r2 r rC rP rY �__next__r r r r r3 z s 5r3 c @ sd e Zd ZdZdeddddddddd� ef dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )�Walkerz�Object for performing a walk of commits in a store.
Walker objects are initialized with a store and other options and can then
be treated as iterators of Commit objects.
NFc C s | j S r ��parents�r
r r r �<lambda>� r! zWalker.<lambda>c C s� |t vrtd| ��|| _t|t�r*|g}|| _t|p8g �| _|| _|| _ || _
|r\t|�p^d| _ | rr|srt |�}|| _
| | _| | _|
| _| | _d| _|
| �| _t�� | _dS )a� Constructor.
Args:
store: ObjectStore instance for looking up objects.
include: Iterable of SHAs of commits to include along with their
ancestors.
exclude: Iterable of SHAs of commits to exclude along with their
ancestors, overriding includes.
order: ORDER_* constant specifying the order of results.
Anything other than ORDER_DATE may result in O(n) memory usage.
reverse: If True, reverse the order of output, requiring O(n)
memory.
max_entries: The maximum number of entries to yield, or None for
no limit.
paths: Iterable of file or subtree paths to show entries for.
rename_detector: diff.RenameDetector object for detecting
renames.
follow: If True, follow path across renames/copies. Forces a
default rename_detector.
since: Timestamp to list commits after.
until: Timestamp to list commits before.
get_parents: Method to retrieve the parents of a commit
queue_cls: A class to use for a queue of commits, supporting the
iterator protocol. The constructor takes a single argument, the
Walker.
zUnknown walk order %sNr )�
ALL_ORDERS�
ValueErrorr rF �bytesrB r8 r5 �order�reverse� max_entries�pathsr r r �followr< �until� _num_entries�_queue� collections�deque�
_out_queue)r r rB Zexcluderc rd re rf r rg r< rh r Z queue_clsr r r r � s* !
zWalker.__init__c C sJ |d u r dS | j D ]2}||kr$ dS |�|�r|t|� dkr dS qdS )NFT�/ )rf �
startswithr# )r Z changed_pathZ
followed_pathr r r �
_path_matches% s
�zWalker._path_matchesc C s` |sdS |j j}|jj}| �|�rN| jrJ|jtv rJ| j�|� | j� |� dS | �|�r\dS dS )NFT)
�old�path�newrp rg �typer rf rK rU )r �changeZold_path�new_pathr r r �_change_matches0 s
zWalker._change_matchesc C s� |j }| jdur |j| jk r dS | jdur:|j| jkr:dS |j| jv rJdS | jdu rXdS t| �|��dkr�|� � D ] }|D ]}| �
|�rz dS qzqrn |� � D ]}| �
|�r� dS q�dS )a Determine if a walk entry should be returned..
Args:
entry: The WalkEntry to consider.
Returns: True if the WalkEntry should be returned by this walk, or
False otherwise (e.g. if it doesn't match any requested paths).
NFTr ) r
r< rJ rh r- r5 rf r# r r, rw )r �entryr
Z path_changesru r r r �_should_return? s$
zWalker._should_returnc C s� | j }|d u s| j|k r~t| j�}|d ur6| j�|� |d u sLt| j�tkr| jsVd S | j�� }| � |�r| jd7 _|S qd S rE )
re ri rY rj rm r& r# r? �popleftry )r re rx r r r �_next` s
z Walker._nextc C s, | j tkrt|| j�}| jr(tt|��}|S )a Possibly reorder a results iterator.
Args:
results: An iterator of WalkEntry objects, in the order returned
from the queue_cls.
Returns: An iterator or list of WalkEntry objects, in the order
required by the Walker.
)rc �
ORDER_TOPO�
_topo_reorderr rd �reversedr' )r Zresultsr r r �_reordero s
zWalker._reorderc C s t | �t | jd ���S r )�iterr r{ r r r r �__iter__~ s zWalker.__iter__)
r/ r0 r1 r2 �
ORDER_DATEr3 r rp rw ry r{ r r� r r r r r[ � s �
: !r[ c C s | j S r r\ r^ r r r r_ � r! r_ c c s� t �� }i }t �t�}| D ].}|�|� ||j�D ]}|| d7 < q2q|r�|�� }|j}|j}|| rt|||< qJ||�D ]6} || d8 < || s||�| d�}
|
r||� |
� q||V qJdS )a� Reorder an iterable of entries topologically.
This works best assuming the entries are already in almost-topological
order, e.g. in commit time order.
Args:
entries: An iterable of WalkEntry objects.
get_parents: Optional function for getting the parents of a commit.
Returns: iterator over WalkEntry objects from entries in FIFO order, except
where a parent would be yielded before any of its children.
r N)
rk rl � defaultdict�intr& r
rz r- rM �
appendleft) �entriesr rO �pendingZ num_childrenrx r r
rD rW Z parent_entryr r r r} � s*
r} )r2 rk rH � itertoolsr Zdulwich.diff_treer r r r Zdulwich.errorsr Zdulwich.objectsr r� r| r` r? rG r r3 r[ r} r r r r �<module> s Hj