File: //usr/lib/python3/dist-packages/mercurial/__pycache__/hbisect.cpython-310.pyc
o
�]Lb�+ � @ s� d dl mZ d dlZd dlZddlmZ ddlmZmZ ddl m
Z
dd� Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zejdd� �Zdd� Zdd� Zdd� ZdS )� )�absolute_importN� )�_)�hex�short)�errorc s� �� � ��j��j}�fdd�|d D ����fdd�}d}||d |d �\� }|s8d }||d |d �\� }��� �}|skt|d �d
kr^t|d �d
kr^|d |d kr^t�td ���t�td �� t|�f ��i }t �
� g�}g } |r�|� � }
||
g kr�| � |
� ||
�D ] } | d
kr�| |v r�|| � |
� q�|
g|| < |� | � q�|sw| �
� t| �} � �fdd�| D �}
| d
ks�|
s͇fdd�| D �d|fS | d }d}d
}t� }| D ]u}
|
|v r�|�|�|
g �� q�||
p�|
g}d||
< t|�}| | }t||�}||k�r|
�v�r|}|
}||k�r n9||k �r+|
�v�r+|�|�|
g �� q�|�|
g �D ] }|| �rFtt|| | ��||< �q1||g ||< �q1q�|du�sWJ ���|�}|g| |fS )a� find the next node (if any) for testing during a bisect search.
returns a (nodes, number, good) tuple.
'nodes' is the final result of the bisect if 'number' is 0.
Otherwise 'number' indicates the remaining possible candidates for
the search and 'nodes' contains the next bisect target.
'good' is True if bisect is searching for a first good changeset, False
if searching for a first bad one.
c s h | ]}� � |��qS � ��rev��.0�n�� changelogr �3/usr/lib/python3/dist-packages/mercurial/hbisect.py� <setcomp>& � zbisect.<locals>.<setcomp>� skipc s\ t � fdd�| D ��}t�dd� �}��d||�D ]}g ||< q|| d u r*|d fS ||fS )Nc � g | ]}� � |��qS r r r r r r �
<listcomp>) r z2bisect.<locals>.buildancestors.<locals>.<listcomp>c S s d S )Nr r r r r �<lambda>* s z0bisect.<locals>.buildancestors.<locals>.<lambda>s! descendants(%ln) - ancestors(%ln))�min� collections� defaultdict�revs)�bad�good�badrev� ancestorsr
)r �repor r �buildancestors( s
z bisect.<locals>.buildancestorsF� bad� goodTr s+ starting revisions are not directly relateds) inconsistent state, %d:%s is good and bad���c s g | ] }|�vr|� kr|�qS r r �r �c)r �skipr r r W s zbisect.<locals>.<listcomp>c r r ��noder$ r r r r Y r r � N)�
unfilteredr �
parentrevsr( �lenr �Abortr r r �deque�popleft�append�sort�set�update�getr �list)r �state� clparentsr r r r �children�visit�
candidatesr
�prev�tot� unskipped�perfect�best_rev�best_len�poison�a�x�y�valuer% � best_noder )r r r r& r �bisect s�
��
��
�
rG c C sj | |d � � }t|�dkr3|r|d }n|d }tdd� |D �t|�@ �}|dkr3|d �|d �S d S )Nr r r! r" c S s h | ]}|� � �qS r r' )r �ir r r r � s z extendrange.<locals>.<setcomp>)�parentsr, r2 �ancestor)r r6 �nodesr rI �side�numr r r � extendrange� s
rN c C sn g g g g d�}| j �d�D ]'}|d d� �� \}}| �� �|�}||vr-t�td�| ��|| �|� q
|S )N)� currentr" r! r � bisect.stater# s unknown bisect kind %s) �vfs� tryreadlines�splitr* �lookupr r- r r0 )r r6 �l�kindr( r r r �
load_state� s rW c C sx | j dddd�}| �� �& t|�D ]}|| D ]
}|�d|t|�f � qq|�� W d � d S 1 s5w Y d S )NrP � wT)�
atomictemps %s %s
)rQ �wlock�sorted�writer �close)r r6 �frV r( r r r �
save_state� s
�
"�r_ c C s | j �d�r| j �d� dS dS )z+remove any bisect state from the repositoryrP N)rQ �exists�unlink)r r r r �
resetstate� s �rb c C s8 | d r
| d r
dS | d st �td���t �td���)z`check we have both 'good' and 'bad' to define a range
Raise StateError exception otherwise.r" r! Ts' cannot bisect (no known good revisions)s& cannot bisect (no known bad revisions))r �
StateErrorr )r6 r r r �
checkstate� s
rd c c s: � zd V W |g|d< t | |� d S |g|d< t | |� w )NrO )r_ )r r6 r( r r r �
restore_state� s �
� re c
C s t | �}|dv rt| �� jj|| �S d}| �d�}t|�dkr%d}d}nd}d}d }d
|||f }d ||f } d }
d
} d|
| |f } |dkrL| �|�S |dkrU| �|�S |dkr^| �| �S |dkrg| �| �S |dkrp| �|�S |dkry| �|�S t�t d���)a
Return a list of revision(s) that match the given status:
- ``good``, ``bad``, ``skip``: csets explicitly marked as good/bad/skip
- ``goods``, ``bads`` : csets topologically good/bad
- ``range`` : csets taking part in the bisection
- ``pruned`` : csets that are goods, bads or skipped
- ``untested`` : csets whose fate is yet unknown
- ``ignored`` : csets ignored due to DAG topology
- ``current`` : the cset currently being bisected
)r" r! r rO s9 ( bisect(bad)::bisect(good) | bisect(good)::bisect(bad) )s bisect(good)::bisect(bad)r s bisect(good)::s
::bisect(bad)s ::bisect(good)s
bisect(bad)::s bisect(skip)s ( (%s) | (%s) | (%s) )s ( (%s) - (%s) )s ::bisect(bad) - ::bisect(good)s ::bisect(good) - ::bisect(bad)s ( ( (%s) | (%s) ) - (%s) )s ranges pruned� untested� ignored� goods� badss invalid bisect state)
rW �mapr* r r
r r, r �
ParseErrorr )
r �statusr6 �range�_t�goods�bads�skips�pruned�untested�iba�iga�ignoredr r r r4 � s:
r4 c C s� | j �|�}|t| d�v rtd�S |t| d�v r td�S |t| d�v r'td�S |t| d�v s5|t| d�v r9td�S |t| d�v rDtd�S |t| d�v rOtd �S |t| d
�v rZtd �S d S ) Nr" r! r s skippedrf rO rg rh s good (implicit)ri s bad (implicit))r r
r4 r )r r( r
r r r �label s rw c C s� |� � }t|�dkr9|r| �td�� n| �td�� |�||d � t||||�}|d ur8| �td�| � n |rC| �td�� n| �td�� |D ] }|�|| � qL|�� d S )Nr s The first good revision is:
s The first bad revision is:
r s� Not all ancestors of this changeset have been checked.
Use bisect --extend to continue the bisection from
the common ancestor, %s.
sC Due to skipped revisions, the first good revision could be any of:
sB Due to skipped revisions, the first bad revision could be any of:
)r* r, r\ r �showrN r] )�uir r6 � displayerrK r �
extendnoder
r r r � printresult$ s< ����
���� r| )�
__future__r r �
contextlib�i18nr r( r r � r rG rN rW r_ rb rd �contextmanagerre r4 rw r| r r r r �<module> s"
k
D