|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/mercurial/__pycache__/ |
Upload File : |
o
�]Lb � @ 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 �0/usr/lib/python3/dist-packages/mercurial/pvec.py�_binD s r c C s2 d}t �|�D ]}t �| d@ �| }| dL } q|S )N� � r )r �xrange�bytechr)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)�depth�bitvecr r r �_joinZ s r c C s( d}| r| d@ r |d7 }| dL } | s|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 s r% r c C s0 | |A }d}|r|t |d@ 7 }|dL }|s|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} ||kr4|| d d } nd} || }
|
rT| rP|
| @ rJ| | N } | d8 } | dK } | s>|
| fS t| |�} |
| fS )Nr r
)r) �_flipbit)r! �yr" �d1�v1�d2�v2�hdist�ddistr �m�i�changesr r r r � _mergevect s.
�
�r5 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�s
i |_|j}| �� |vrj|j}t�| �� d �D ]G}||vri|�|�}|� |�\}}|t
krGdt |d dt � �f||< q"|t
kr]|| \}} |d t
| |�f||< q"t|| || |�||< q"t|| �� � }
tt�|
��S )z3construct a pvec for ctx while filling in the cache�
_pveccacher r � N)�repor � safehasattrr: �rev� changelogr r r8 �
parentrevsr r r r* r5 r �pvec� b85encode) �ctx�r�pvc�cl�nr8 �p1�p2r( r r
r r r �ctxpvec� s&
�rJ c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )rA c C s8 t |t�r|| _tt�|��\| _| _d S t|�| _d S r ) �
isinstance�bytes�_bsr r � b85decode�_depth�_vecrJ )�self� hashorctxr r r �__init__� s
z
pvec.__init__c C s | j S r )rM )rQ r r r �__str__� s z pvec.__str__c C s | j |j ko | j|jkS r )rP rO �rQ r r r r �__eq__� s z pvec.__eq__c C s2 |j | j }|dk r dS t| j|j�|krdS dS )Nr FT)rO r) rP �rQ r �deltar r r �__lt__� s z pvec.__lt__c C s || k S r r rU r r r �__gt__� s z pvec.__gt__c C s* t |j| j �}t| j|j�|krdS dS )NFT)�absrO r) rP rW r r r �__or__� s z pvec.__or__c C s | |B rt d��| j|j S )Ns concurrent pvecs)�
ValueErrorrO rU r r r �__sub__� s z pvec.__sub__c C s( t |j| j �}t| j|j�}t||�S r )r[ rO r) rP �max)rQ r r( �hr r r �distance� s
z
pvec.distancec C s2 t |j| j �}|tkst| j|j�tkrdS d S )NF)r[ r rO �_radiusr) rP )rQ r �distr r r �near� s �z pvec.nearN) �__name__�
__module__� __qualname__rS rT rV rY rZ r\ r^ ra rd r r r r rA � s rA N) �__doc__�
__future__r r8 r � r r �_size�_bytes�
_depthbitsr r r7 rb r r r r r# r r& r) r5 r* rJ �objectrA r r r r �<module> s, +
&