| Server IP : 80.87.202.40 / Your IP : 216.73.216.169 Web Server : Apache System : Linux rospirotorg.ru 5.14.0-539.el9.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Dec 5 22:26:13 UTC 2024 x86_64 User : bitrix ( 600) PHP Version : 8.2.27 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : ON Directory : /usr/lib64/python3.9/site-packages/mercurial/__pycache__/ |
Upload File : |
a
�+�b � @ s� d Z ddlmZ ddlmZ ddlmZmZ dZed Z dZ
e
d Z e e Z e d Z
e
d d
Zd d � Zd
d� Zdd� Zdd� Zdd� Zdd� e�d�D �Zdd� Zdd� Zd d � Zd d � ZG d d!� d!e�Zd"S )#a3
A "pvec" is a changeset property based on the theory of vector clocks
that can be compared to discover relatedness without consulting a
graph. This can be useful for tasks like determining how a
disconnected patch relates to a repository.
Currently a pvec consist of 448 bits, of which 24 are 'depth' and the
remainder are a bit vector. It is represented as a 70-character base85
string.
Construction:
- a root changeset has a depth of 0 and a bit vector based on its hash
- a normal commit has a changeset where depth is increased by one and
one bit vector bit is flipped based on its hash
- a merge changeset pvec is constructed by copying changes from one pvec into
the other to balance its depth
Properties:
- for linear changes, difference in depth is always <= hamming distance
- otherwise, changes are probably divergent
- when hamming distance is < 200, we can reliably detect when pvecs are near
Issues:
- hamming distance ceases to work over distances of ~ 200
- detecting divergence is less accurate when the common ancestor is very close
to either revision or total distance is high
- this could probably be improved by modeling the relation between
delta and hdist
Uses:
- a patch pvec can be used to locate the nearest available common ancestor for
resolving conflicts
- ordering of patches can be established without a DAG
- two head pvecs can be compared to determine whether push/pull/merge is needed
and approximately how many changesets are involved
- can be used to find a heuristic divergence measure between changesets on
different branches
� )�absolute_import� )�nullrev)�pycompat�utili� � � � � c C s" d}| D ]}|d t |� }q|S )z convert a bytestring to a longr � )�ord)�bs�v�b� r �4/usr/lib64/python3.9/site-packages/mercurial/pvec.py�_binD s r c C s2 d}t �|�D ] }t �| d@ �| }| dL } q|S )N� � r )r �xrangeZbytechr)r �lr
�pr r r �_strL s
r c C s t | dt� �t | td� �fS )zdepth and bitvecN)r � _depthbytes)r r r r �_splitU s r c C s t | t�t |t� S �N)r r � _vecbytes)�depthZbitvecr r r �_joinZ s r c C s& d}| r"| d@ r|d7 }| dL } q|S )Nr r r )�x�cr r r �_hweight^ s
r! c C s g | ] }t |��qS r )r! )�.0r r r r �
<listcomp>g r r# r c C s. | |A }d}|r*|t |d@ 7 }|dL }q |S )z+find the hamming distance between two longsr r r )�_htab)�ar �dr r r r �_hammingj s
r' c C s� | \}}|\}}||k r,||||f\}}}}t ||�}|| }|} ||A }
d} ||krh|| d d } nd} || }
|
r�| r�|
| @ r�| | N } | d8 } | dK } qxn
t| |�} |
| fS )Nr r
)r' �_flipbit)r �yr Zd1Zv1Zd2Zv2ZhdistZddistr �m�iZchangesr r r r � _mergevect s*
r, c C s t |�d@ t }| d|> A S )Nl �� r )�hash�_vecbits)r �node�bitr r r r( � s r( c C s� | � � }t�|d�si |_|j}| �� |vr�|j}t�| �� d �D ]�}||vrD|�|�}|� |�\}}|t
kr�dt |d dt � �f||< qD|t
kr�|| \}} |d t
| |�f||< qDt|| || |�||< qDt|| �� � }
tt�|
��S )z3construct a pvec for ctx while filling in the cache�
_pveccacher r � N)Zrepor Z safehasattrr1 ZrevZ changelogr r r/ Z
parentrevsr r r r( r, r �pvecZ b85encode) �ctx�rZpvcZcl�nr/ Zp1Zp2r& r r
r r r �ctxpvec� s$
r7 c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )r3 c C s6 t |t�r(|| _tt�|��\| _| _n
t|�| _d S r ) �
isinstance�bytes�_bsr r Z b85decode�_depth�_vecr7 )�selfZ hashorctxr r r �__init__� s
z
pvec.__init__c C s | j S r )r: )r= r r r �__str__� s z pvec.__str__c C s | j |j ko| j|jkS r )r< r; �r= r r r r �__eq__� s z pvec.__eq__c C s2 |j | j }|dk rdS t| j|j�|kr.dS dS )Nr FT)r; r' r< �r= r Zdeltar r r �__lt__� s z pvec.__lt__c C s || k S r r r@ r r r �__gt__� s z pvec.__gt__c C s* t |j| j �}t| j|j�|kr&dS dS )NFT)�absr; r' r< rB r r r �__or__� s z pvec.__or__c C s | |B rt d��| j|j S )Ns concurrent pvecs)�
ValueErrorr; r@ r r r �__sub__� s z pvec.__sub__c C s( t |j| j �}t| j|j�}t||�S r )rE r; r' r< �max)r= r r& �hr r r �distance� s z
pvec.distancec C s2 t |j| j �}|tks*t| j|j�tkr.dS d S )NF)rE r r; �_radiusr' r< )r= r Zdistr r r �near� s z pvec.nearN) �__name__�
__module__� __qualname__r> r? rA rC rD rF rH rK rM r r r r r3 � s r3 N) �__doc__Z
__future__r r/ r � r r �_sizeZ_bytesZ
_depthbitsr r r. rL r r r r r! r r$ r' r, r( r7 �objectr3 r r r r �<module> s* +
&