ruạṛ
a �+�b�" � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlmZ d dlm Z d dl m Z m Z ddlm Z dZdZd ZG d d � d e�Zd d � ZdS )� )�absolute_importN)�hex)�open)�error�pycompat� )r � � c @ s� e Zd ZdZdZd!dd�Zdd� Zedd � �Zd"d d �Z d d� Z dd� Z dd� Z dd� Z d#dd�Zdd� Zdd� Zdd � Zed d � �Zd d � ZdS )$�revmapz~trivial hg bin hash - linelog rev bidirectional map also stores a flag (uint8) for each revision, and track renames. s REVMAP1 Nc C sX || _ dg| _dg| _i | _dg| _dg| _d| _|rTtj �|�rL| � � n| � � dS )a= create or load the revmap, optionally associate to a file if path is None, the revmap is entirely in-memory. the caller is responsible for locking. concurrent writes to a same file is unsafe. the caller needs to make sure one file is associated to at most one revmap object at a time.Nr � ���) �path�_rev2hsh� _rev2flag�_hsh2rev� _renamerevs� _renamepaths� _lastmaxrev�os�exists�_load�flush)�selfr � r �?/usr/lib64/python3.9/site-packages/hgext/fastannotate/revmap.py�__init__< s zrevmap.__init__c C sV |j dd� | _ |jdd� | _|j�� | _|jdd� | _|jdd� | _d| _dS )z>copy the map data from another revmap. do not affect self.pathNr )r r r �copyr r r )r Zrhsr r r �copyfromS s zrevmap.copyfromc C s t | j�d S )z"return max linelog revision numberr )�lenr )r r r r �maxrev\ s z revmap.maxrevFc C s� || j v r t�dt|� ��t|�tkr6t�dt ��t| j�}d}|rP|t O }|dur�|| j d kr�|t O }| j � |� | j � |� | j� |� | j� |� || j |< |r�| �� |S )z~add a binary hg hash and return the mapped linelog revision. if flush is True, incrementally update the file. s %r is in revmap alreadys hsh must be %d-char longr Nr )r r �CorruptedFileErrorr r �_hshlen�hgerrorZProgrammingErrorr �sidebranchflagr � renameflagr �appendr r )r �hshZ sidebranchr r �idx�flagr r r r% a s, � � z revmap.appendc C s || j ks|dk rdS | j| S )z>convert linelog revision to hg hash. return None if not found.r N)r r �r �revr r r �rev2hsh| s zrevmap.rev2hshc C s || j ks|dk rdS | j| S )zkget the flag (uint8) for a given linelog revision. return None if revision does not exist. r N)r r r) r r r �rev2flag� s zrevmap.rev2flagc C s2 || j ks|dk rdS t�| j|�d }| j| S )zcget the path for a given linelog revision. return None if revision does not exist. r Nr )r �bisectZ bisect_rightr r )r r* r' r r r �rev2path� s zrevmap.rev2pathc C s | j �|�S )z>convert hg hash to linelog revision. return None if not found.)r �get)r r& r r r �hsh2rev� s zrevmap.hsh2revc C s4 dg| _ dg| _i | _dg| _d| _|r0| �� dS )z3make the map empty. if flush is True, write to diskNr r )r r r Z _rev2pathr r )r r r r r �clear� s z revmap.clearc C s� | j s dS | jdkrrt| j d��@}|�| j� t�dt| j��D ]}| � ||� q@W d � q�1 sf0 Y nVt| j d��:}t�| jd t| j��D ]}| � ||� q�W d � n1 s�0 Y | j | _dS )z write the state down to the fileNr s wbr s ab) r r r �write�HEADERr Zxranger r � _writerevr )r �f�ir r r r � s .�,z revmap.flushc C s | j s dS d}t}t| j d���}|�t| j��| jkr>t�� �| jdd� |�|�}|sZq�t |�}t| j �}|t @ r�| � |�}| j �|� | j�|� |�|�}t|�|kr�t�� �|| j|< | j�|� | j �|� qJW d � n1 s�0 Y | j| _dS )zload state from fileNr � rbF)r )r r! r �readr r3 r r r1 �ordr r$ � _readcstrr r% r r r r r ) r ZflaglenZhshlenr5 �bufr( r* r r& r r r r � s0 ,z revmap._loadc C sj | j | }| j| }|�t�d|�� |t@ r\| �|�}|du rNt�d| ��|�|d � |�|� dS )z append a revision data to file� BNs cannot find path for %s� ) r r r2 �struct�packr$ r. r r )r r* r5 r( r& r r r r r4 � s zrevmap._writerevc C s2 d}| � d�}|st�� �|dkr$q.||7 }q|S )z,read a C-language-like ' '-terminated stringr r r= )r8 r r )r5 r; Zchr r r r: � s zrevmap._readcstrc C sh t |t�r|\}}n|�� |�� }}| �|�}|du r<dS |durV|| �|�krVdS | �|�t@ dkS )z�(fctx or (node, path)) -> bool. test if (node, path) is in the map, and is not in a side branch. f can be either a tuple of (node, path), or a fctx. NFr )� isinstance�tupleZnoder r0 r. r, r# )r r5 r& r r* r r r � __contains__� s zrevmap.__contains__)N)FNF)F)�__name__� __module__� __qualname__�__doc__r3 r r �propertyr r% r+ r, r. r0 r1 r r r4 � staticmethodr: rB r r r r r 4 s$ r c C sv d}zZt | d��<}|�t tj� |�� ttj�kr>|� t�}W d � n1 sR0 Y W n t yp Y n0 |S )z�return the last hash in a revmap, without loading its full content. this is equivalent to `m = revmap(path); m.rev2hsh(m.maxrev)`, but faster. Nr7 ) r �seekr! �io�SEEK_END�tellr r r3 r8 �IOError)r r& r5 r r r � getlastnode� s , rN )Z __future__r r- rJ r r> Zmercurial.noder Zmercurial.pycompatr Z mercurialr r" r � r# r$ r! �objectr rN r r r r �<module> s H
cải xoăn