|
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 dl mZ ddlmZ ddlmZmZmZmZ ddlm Z dd� Z
G dd � d e �Z G d
d � d e �Z
G d d
� d
e �Zdd� ZG dd� de �ZG dd� de �ZG dd� de�ZG dd� de�Zd dd�ZG dd � d e �ZG d d � d e�ZdS ) � )�absolute_import� )�getattr)�encoding�error�pycompat�util)�
stringutilc C s t �t| �j��d�S )N� _)r �sysbytes�type�__name__�lstrip)�o� r �4/usr/lib/python3/dist-packages/mercurial/smartset.py� _typename s r c @ s� e Zd Zdd� ZeZdd� Zdd� ZdZdZdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zd*dd �Zd d � Zd d � Zd!d"� Zd+d$d%�Zd&d'� Zd(d)� ZdS ),�abstractsmartsetc C � t � �)z!True if the smartset is not empty��NotImplementedError��selfr r r � __nonzero__ � z abstractsmartset.__nonzero__c C r )z provide fast membership testingr )r �revr r r � __contains__ r z abstractsmartset.__contains__c C r )z:iterate the set in the order it is supposed to be iteratedr r r r r �__iter__# r zabstractsmartset.__iter__Nc C r )z/True if the set will iterate in ascending orderr r r r r � isascending/ r z abstractsmartset.isascendingc C r )z0True if the set will iterate in descending orderr r r r r � isdescending3 r z abstractsmartset.isdescendingc C r )z3True if the set will iterate in topographical orderr r r r r �istopo7 r zabstractsmartset.istopoc s> | j du r
t| �� n | � � D ]� ntd��� fdd�| _� S )z%return the minimum element in the setN� arg is an empty sequencec � � S �Nr r ��vr r �<lambda>D � z&abstractsmartset.min.<locals>.<lambda>)�fastasc�min�
ValueErrorr r r$ r r) ; s
zabstractsmartset.minc s< | j du r t| �S | � � D ]� ntd��� fdd�| _� S )z%return the maximum element in the setNr! c r" r# r r r$ r r r& P r' z&abstractsmartset.max.<locals>.<lambda>)�fastdesc�maxr* r r r$ r r, G s
zabstractsmartset.maxc C r )zireturn the first element in the set (user iteration perspective)
Return None if the set is emptyr r r r r �firstS � zabstractsmartset.firstc C r )zhreturn the last element in the set (user iteration perspective)
Return None if the set is emptyr r r r r �lastY r. zabstractsmartset.lastc C r )zkreturn the length of the smartsets
This can be expensive on smartset that could be lazy otherwise.r r r r r �__len___ r. zabstractsmartset.__len__c C r )z$reverse the expected iteration orderr r r r r �reversee r zabstractsmartset.reverseFc C r )z:get the set to iterate in an ascending or descending orderr �r r1 r r r �sorti r zabstractsmartset.sortc C s t |t�r| S | j|j|dd�S )z{Returns a new object with the intersection of the two collections.
This is part of the mandatory API for smartset.F��condrepr�cache)�
isinstance� fullreposet�filterr �r �otherr r r �__and__m s
zabstractsmartset.__and__c C s
t | |�S )ztReturns a new object with the union of the two collections.
This is part of the mandatory API for smartset.)�addsetr: r r r �__add__u s
zabstractsmartset.__add__c s" |j � | j� fdd�d|fdd�S )z{Returns a new object with the substraction of the two collections.
This is part of the mandatory API for smartset.c s
� | � S r# r )�r��cr r r& � s
z*abstractsmartset.__sub__.<locals>.<lambda>s <not %r>Fr4 )r r9 r: r r@ r �__sub__{ s �zabstractsmartset.__sub__Tc C s& |r
t �|d�r
t �|�}t| ||�S )a1 Returns this smartset filtered by condition as a new smartset.
`condition` is a callable which takes a revision number and returns a
boolean. Optional `condrepr` provides a printable representation of
the given `condition`.
This is part of the mandatory API for smartset.s __code__)r � safehasattr� cachefunc� filteredset)r � conditionr5 r6 r r r r9 � s
zabstractsmartset.filterc C s& |dk s|dk r
t �d��| �||�S )zAReturn new smartset that contains selected elements from this setr s negative index not allowed)r �ProgrammingError�_slice)r �start�stopr r r �slice� s
zabstractsmartset.slicec C sz g }t | �}t�|�D ]
}t|d �}|d u r nq t�|| �D ]}t|d �}|d u r- n|�|� q t|d||| fd�S )Ns slice=%d:%d %r)�datarepr)�iterr �xrange�next�append�baseset)r rI rJ �ys�it�x�yr r r rH � s
�
zabstractsmartset._slice�F�NT)r
�
__module__� __qualname__r �__bool__r r r( r+ r r r r) r, r- r/ r0 r1 r3 r< r> rB r9 rK rH r r r r r s.
r c s� e Zd ZdZd1dd�Zejdd� �Zejd d
� �Zejd d � �Z d
d� Z
dd� Z dd� Z ejdd� �Z
dd� ZeZd2dd�Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Z� fd'd(�Zd)d*� Zd+d,� Zd-d.� Ze j d/d0� �Z � Z S )3rQ a� Basic data structure that represents a revset and contains the basic
operation that it should be able to perform.
Every method in this class should be implemented by any smartset class.
This class could be constructed by an (unordered) set, or an (ordered)
list-like object. If a set is provided, it'll be sorted lazily.
>>> x = [4, 0, 7, 6]
>>> y = [5, 6, 7, 3]
Construct by a set:
>>> xs = baseset(set(x))
>>> ys = baseset(set(y))
>>> [list(i) for i in [xs + ys, xs & ys, xs - ys]]
[[0, 4, 6, 7, 3, 5], [6, 7], [0, 4]]
>>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]]
['addset', 'baseset', 'baseset']
Construct by a list-like:
>>> xs = baseset(x)
>>> ys = baseset(i for i in y)
>>> [list(i) for i in [xs + ys, xs & ys, xs - ys]]
[[4, 0, 7, 6, 5, 3], [7, 6], [4, 0]]
>>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]]
['addset', 'filteredset', 'filteredset']
Populate "_set" fields in the lists so set optimization may be used:
>>> [1 in xs, 3 in ys]
[False, True]
Without sort(), results won't be changed:
>>> [list(i) for i in [xs + ys, xs & ys, xs - ys]]
[[4, 0, 7, 6, 5, 3], [7, 6], [4, 0]]
>>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]]
['addset', 'filteredset', 'filteredset']
With sort(), set optimization could be used:
>>> xs.sort(reverse=True)
>>> [list(i) for i in [xs + ys, xs & ys, xs - ys]]
[[7, 6, 4, 0, 5, 3], [7, 6], [4, 0]]
>>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]]
['addset', 'baseset', 'baseset']
>>> ys.sort()
>>> [list(i) for i in [xs + ys, xs & ys, xs - ys]]
[[7, 6, 4, 0, 3, 5], [7, 6], [4, 0]]
>>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]]
['addset', 'baseset', 'baseset']
istopo is preserved across set operations
>>> xs = baseset(set(x), istopo=True)
>>> rs = xs & ys
>>> type(rs).__name__
'baseset'
>>> rs._istopo
True
r NFc C sF d| _ || _t|t�r|| _d| _ n t|t�st|�}|| _|| _dS )z�
datarepr: a tuple of (format, obj, ...), a function or an object that
provides a printable representation of the given data.
NT)�
_ascending�_istopor7 �set�_set�list�_list� _datarepr)r �datarL r r r r �__init__� s
zbaseset.__init__c C �
t | j�S r# )r] r` r r r r r^ � s
z baseset._setc C s | j d d � }|�� |S r# )r` r3 )r �asclistr r r �_asclist� s zbaseset._asclistc C s d| j v sJ �t| j�S )Nr^ )�__dict__r_ r^ r r r r r` s
z
baseset._listc C s. | j d u r
t| j�S | j rt| j�S t| j�S r# )r[ rM r` rf �reversedr r r r r s
zbaseset.__iter__c C rd r# )rM rf r r r r r( �
zbaseset.fastascc C rd r# )rh rf r r r r r+ ri zbaseset.fastdescc C s | j jS r# )r^ r r r r r r s zbaseset.__contains__c C s t t| ��S r# )�bool�lenr r r r r � zbaseset.__nonzero__c C s t |� | _d| _d S �NF)rj r[ r\ r2 r r r r3 s
z baseset.sortc C s* | j d u r | j�� n| j | _ d| _d S rm )r[ r` r1 r\ r r r r r1 ! s
zbaseset.reversec C s d| j v r
t| j�S t| j�S )Nr` )rg rk r` r^ r r r r r0 ( s
zbaseset.__len__c C s t | �dkrdS | jduo| jS )zyReturns True if the collection is ascending order, False if not.
This is part of the mandatory API for smartset.r TN�rk r[ r r r r r . s zbaseset.isascendingc C s" t | �dkrdS | jduo| j S )zzReturns True if the collection is descending order, False if not.
This is part of the mandatory API for smartset.r TNrn r r r r r 6 s zbaseset.isdescendingc C s t | �dkrdS | jS )zlIs the collection is in topographical order or not.
This is part of the mandatory API for smartset.r T)rk r\ r r r r r > s zbaseset.istopoc C �6 | r| j d u r | jd S | j r| jd S | jd S d S )Nr ����r[ r` rf r r r r r- F �
z
baseset.firstc C ro )Nrp r rq r r r r r/ P rr z baseset.lastc sj t |�tu r)d|jv r)d| jv r)| jd ur)tt| j|�|j�| jd�}| j|_|S ttt| �|�|�}|S )Nr^ )rb r )r rQ rg r[ r r^ r\ �super)r r; �op�s�� __class__r r �
_fastsetopZ s
��zbaseset._fastsetopc C � | � |d�S )Ns __and__�rx r: r r r r< j rl zbaseset.__and__c C ry )Ns __sub__rz r: r r r rB m rl zbaseset.__sub__c C sv | j d u rt| j||� | jd�S | j}| j s*tt|�| d�tt|�| d�}}t|||� | jd�}| j |_ |S )N)r r )r[ rQ r` r\ rf r, rk )r rI rJ rb ru r r r rH p s
&zbaseset._slicec C sT dddd�| j }t�| j�}|s!| j}| j d ur | j}t�|�}dt| �||f S )N� � -� +�NFTs <%s%s %s>) r[ r � buildreprra r` rf r �bytereprr )r �dru �lr r r �__repr__| s
zbaseset.__repr__)r NFrV ) r
rX rY �__doc__rc r �
propertycacher^ rf r` r r( r+ r r rZ r3 r1 r0 r r r r- r/ rx r< rB rH r � strmethodr� �
__classcell__r r rv r rQ � s<
;
rQ c @ s� e Zd ZdZdd� dfdd�Zdd� Zd d
� Zd d � Zed
d� �Z edd� �Z
dd� Z e Z dd� Z
d&dd�Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zejd$d%� �ZdS )'rE z�Duck type for baseset class which iterates lazily over the revisions in
the subset and contains a function which tests for membership in the
revset
c C � dS rW r )rT r r r r& � r' zfilteredset.<lambda>Nc C s || _ || _|| _dS )a!
condition: a function that decide whether a revision in the subset
belongs to the revset or not.
condrepr: a tuple of (format, obj, ...), a function or an object that
provides a printable representation of the given condition.
N)�_subset�
_condition� _condrepr)r �subsetrF r5 r r r rc � s
zfilteredset.__init__c C s || j v o | �|�S r# )r� r� �r rT r r r r � � zfilteredset.__contains__c C s | � | j�S r# )� _iterfilterr� r r r r r � rl zfilteredset.__iter__c c s$ � | j }|D ] }||�r|V qd S r# )r� )r rS �condrT r r r r� � � ���zfilteredset._iterfilterc �" �j j� � d u r
d S � �fdd�S )Nc � �� � � �S r# �r� r �rS r r r r& � � z%filteredset.fastasc.<locals>.<lambda>)r� r( r r r� r r( � � zfilteredset.fastascc r� )Nc r� r# r� r r� r r r& � r� z&filteredset.fastdesc.<locals>.<lambda>)r� r+ r r r� r r+ � r� zfilteredset.fastdescc C sp d }| � � r | jnd | �� r| jnd | j| jg}|D ]
}|d ur$|} nq|d ur-|� }n| }|D ]} dS dS �NTF)r r( r r+ )r �fast�
candidates� candidaterS r? r r r r � s" ��zfilteredset.__nonzero__c C s t dd� | D ��}t|�S )Nc s s � | ]}|V qd S r# r )�.0r? r r r � <genexpr>� s � z&filteredset.__len__.<locals>.<genexpr>)rQ rk )r r� r r r r0 � s zfilteredset.__len__Fc C s | j j|d� d S )N�r1 )r� r3 r2 r r r r3 � � zfilteredset.sortc C s | j �� d S r# )r� r1 r r r r r1 � � zfilteredset.reversec C �
| j �� S r# )r� r r r r r r � ri zfilteredset.isascendingc C r� r# )r� r r r r r r � ri zfilteredset.isdescendingc C r� r# )r� r r r r r r � ri zfilteredset.istopoc C � | D ]}| S d S r# r r� r r r r- � � zfilteredset.firstc C sR d }| � � r
| j}n| �� r| j}|d ur |� D ]}| S d S d }| D ]}q$|S r# )r r+ r r( �r rS rT r r r r/ � s
zfilteredset.lastc C s> t �| j�g}t�| j�}|r|�|� dt| �d�|�f S )Ns <%s %s>s , ) r r� r� r r r� rP r �join)r �xsru r r r r� � s
zfilteredset.__repr__rV )r
rX rY r� rc r r r� �propertyr( r+ r rZ r0 r3 r1 r r r r- r/ r r� r� r r r r rE � s,
rE c c s� � t }| rt}d}d}z& |du rt|�}|du r t|�}|||�}|V ||kr+d}||kr1d}q
tyV |}|durD|V |}n|durK|V |D ]}|V qMY dS w )z�produce an ordered iteration from two iterators with the same order
The ascending is used to indicated the iteration direction.
N)r, r) rO �
StopIteration) � ascending�iter1�iter2�choice�val1�val2�nrS �valr r r � _iterordered s< �
� ��r� c @ s� e Zd ZdZd&dd�Zdd� Zdd� ZeZej d d
� �Z
d d � Z d
d� Z e
dd� �Ze
dd� �Zdd� Zd'dd�Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zejd$d%� �ZdS )(r= a Represent the addition of two sets
Wrapper structure for lazily adding two structures without losing much
performance on the __contains__ method
If the ascending attribute is set, that means the two structures are
ordered in either an ascending or descending way. Therefore, we can add
them maintaining the order by iterating over both at the same time
>>> xs = baseset([0, 3, 2])
>>> ys = baseset([5, 2, 4])
>>> rs = addset(xs, ys)
>>> bool(rs), 0 in rs, 1 in rs, 5 in rs, rs.first(), rs.last()
(True, True, False, True, 0, 4)
>>> rs = addset(xs, baseset([]))
>>> bool(rs), 0 in rs, 1 in rs, rs.first(), rs.last()
(True, True, False, 0, 2)
>>> rs = addset(baseset([]), baseset([]))
>>> bool(rs), 0 in rs, rs.first(), rs.last()
(False, False, None, None)
iterate unsorted:
>>> rs = addset(xs, ys)
>>> # (use generator because pypy could call len())
>>> list(x for x in rs) # without _genlist
[0, 3, 2, 5, 4]
>>> assert not rs._genlist
>>> len(rs)
5
>>> [x for x in rs] # with _genlist
[0, 3, 2, 5, 4]
>>> assert rs._genlist
iterate ascending:
>>> rs = addset(xs, ys, ascending=True)
>>> # (use generator because pypy could call len())
>>> list(x for x in rs), list(x for x in rs.fastasc()) # without _asclist
([0, 2, 3, 4, 5], [0, 2, 3, 4, 5])
>>> assert not rs._asclist
>>> len(rs)
5
>>> [x for x in rs], [x for x in rs.fastasc()]
([0, 2, 3, 4, 5], [0, 2, 3, 4, 5])
>>> assert rs._asclist
iterate descending:
>>> rs = addset(xs, ys, ascending=False)
>>> # (use generator because pypy could call len())
>>> list(x for x in rs), list(x for x in rs.fastdesc()) # without _asclist
([5, 4, 3, 2, 0], [5, 4, 3, 2, 0])
>>> assert not rs._asclist
>>> len(rs)
5
>>> [x for x in rs], [x for x in rs.fastdesc()]
([5, 4, 3, 2, 0], [5, 4, 3, 2, 0])
>>> assert rs._asclist
iterate ascending without fastasc:
>>> rs = addset(xs, generatorset(ys), ascending=True)
>>> assert rs.fastasc is None
>>> [x for x in rs]
[0, 2, 3, 4, 5]
iterate descending without fastdesc:
>>> rs = addset(generatorset(xs), ys, ascending=False)
>>> assert rs.fastdesc is None
>>> [x for x in rs]
[5, 4, 3, 2, 0]
Nc C s( || _ || _d | _|| _d | _d | _d S r# )�_r1�_r2�_iterr[ �_genlistrf )r �revs1�revs2r� r r r rc p s
zaddset.__init__c C rd r# )rk r` r r r r r0 x ri zaddset.__len__c C s t | j�p t | j�S r# )rj r� r� r r r r r { r� zaddset.__nonzero__c C s | j s
tt| ��| _ | j S r# )r� rQ rM r r r r r` � s z addset._listc s� � j du r� jr
t� j�S � fdd�}|� S � �� � j r d}nd}t� |�}|dur.|� S t� j|�}|du rDtt� j� j d��}n|� }t� j|�}|du r]tt� j� j d��}n|� }t� j ||�S )a� Iterate over both collections without repeating elements
If the ascending attribute is not set, iterate over the first one and
then over the second one checking for membership on the first one so we
dont yield any duplicates.
If the ascending attribute is set, iterate over both collections at the
same time, yielding only one value at a time in the given order.
Nc 3 s: � � j D ]} | V q� j j}� jD ] } || �s| V qd S r# )r� r r� )r? �inr1r r r �arbitraryordergen� s �
��z*addset.__iter__.<locals>.arbitraryordergens fastascs fastdescr� ) r[ r� rM �_trysetasclistr r� �sortedr� r� )r r� �attrrS r� r� r r r r � s*
zaddset.__iter__c C s, | j dur| jdu rt| j �| _dS dS dS )z9populate the _asclist attribute if possible and necessaryN)r� rf r� r r r r r� � s �zaddset._trysetasclistc �H | � � | jd ur
| jjS | jj� | jj�d � �fv r d S � �fdd�S )Nc � t d� � �� �S rW �r� r �r� r� r r r& � � z addset.fastasc.<locals>.<lambda>)r� rf r r� r( r� r r r� r r( � �
zaddset.fastascc r� )Nc r� rm r� r r� r r r& � r� z!addset.fastdesc.<locals>.<lambda>)r� rf � __reversed__r� r+ r� r r r� r r+ � r� zaddset.fastdescc C s || j v p || jv S r# )r� r� r� r r r r � r� zaddset.__contains__Fc C s | | _ dS )z�Sort the added set
For this we use the cached list with all the generated values and if we
know they are ascending or descending we can sort them in a smart way.
N�r[ r2 r r r r3 � s z addset.sortc C s | j d uo| j S r# r� r r r r r � s zaddset.isascendingc C s | j d uo| j S r# r� r r r r r � r� zaddset.isdescendingc C r� rm r r r r r r � � z
addset.istopoc C s& | j d u r | j�� d S | j | _ d S r# )r[ r` r1 r r r r r1 � s
zaddset.reversec C r� r# r r� r r r r- � r� z addset.firstc C s | � � | �� }| � � |S r# )r1 r- )r r� r r r r/ � s z addset.lastc C s* dddd�| j }dt| �|| j| jf S )Nr{ r| r} r~ s
<%s%s %r, %r>)r[ r r� r� �r r� r r r r� � s zaddset.__repr__r# rV )r
rX rY r� rc r0 r rZ r r� r` r r� r� r( r+ r r3 r r r r1 r- r/ r r� r� r r r r r= ( s0
G
1
r= c s� e Zd ZdZd$� fdd� Zd$dd�Zdd� ZeZd d
� Zd d � Z d
d� Z
dd� Z dd� Z d%dd�Z
dd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zejd"d#� �Z� ZS )&� generatorseta� Wrap a generator for lazy iteration
Wrapper structure for generators that provides lazy membership and can
be iterated more than once.
When asked for membership it generates values until either it finds the
requested one or has gone through all the elements in the generator
>>> xs = generatorset([0, 1, 4], iterasc=True)
>>> assert xs.last() == xs.last()
>>> xs.last() # cached
4
Nc s, |d u r| }n|r t }nt}tt| ��|�S r# )�_generatorsetasc�_generatorsetdescrs r� �__new__)�cls�gen�iterasc�typrv r r r� s zgeneratorset.__new__c C s( || _ d| _i | _g | _d| _d| _dS )zM
gen: a generator producing the values for the generatorset.
NFT)�_genrf �_cacher� � _finishedr[ )r r� r� r r r rc s
zgeneratorset.__init__c C s | j rdS | �� D ]} dS dS r� )r� � _consumegen�r r? r r r r # s
zgeneratorset.__nonzero__c C s> || j v r
| j | S | �� D ] }||kr dS qd| j |< dS r� �r� r� �r rT r� r r r r / s
�
zgeneratorset.__contains__c C s8 | j r| j}n| j}|d ur|� S | �� D ]}qt| �S r# )r[ r( r+ r� rM r� r r r r ; s zgeneratorset.__iter__c s@ | j rt| j�S | j�| �� �tt� �� ���fdd�}|� S )Nc 3 sN � d} | � ��k r�| V nz���V W n
t y! Y d S w | d7 } q)Nr Tr )r� )�i��_len�_next�genlist�nextgenr r r� V s � ��z#generatorset._iterator.<locals>.gen)r� rM r� r� rk rO )r r� r r� r � _iteratorH s
zgeneratorset._iteratorc c sr � | j }| jj}| jD ]
}d||< ||� |V q | js7d| _| jd d � }|�� || _|j| _|j | _
d S d S rW ) r� r� rP r� r� r3 rf r r( r� r+ )r r6 r� �item�ascr r r r� d s �
�zgeneratorset._consumegenc C s | � � D ]}qt| j�S r# )r� rk r� r� r r r r0 s s
zgeneratorset.__len__Fc C � | | _ d S r# r� r2 r r r r3 x rl zgeneratorset.sortc C � | j | _ d S r# r� r r r r r1 { r� zgeneratorset.reversec C � | j S r# r� r r r r r ~ � zgeneratorset.isascendingc C � | j S r# r� r r r r r � � zgeneratorset.isdescendingc C r� rm r r r r r r � r� zgeneratorset.istopoc C �> | j r| j}n| j}|d u r| �� D ]}q| �� S t|� d �S r# )r[ r( r+ r� r- rO r� r r r r- � � zgeneratorset.firstc C r� r# )r[ r+ r( r� r/ rO r� r r r r/ � r� zgeneratorset.lastc C s ddd�| j }dt| �|f S )Nr| r} �FTs <%s%s>)r[ r r� r r r r� � s zgeneratorset.__repr__r# rV )r
rX rY r� r� rc r rZ r r r� r� r0 r3 r1 r r r r- r/ r r� r� r� r r rv r r� s(
r� c @ � e Zd ZdZejZdd� ZdS )r� z@Special case of generatorset optimized for ascending generators.c C sJ || j v r
| j | S | �� D ]}||kr dS ||kr nqd| j |< dS r� r� r� r r r r � �
�
z _generatorsetasc.__contains__N)r
rX rY r� r� r� r( r r r r r r� � � r� c @ r� )r� zASpecial case of generatorset optimized for descending generators.c C sJ || j v r
| j | S | �� D ]}||kr dS ||k r nqd| j |< dS r� r� r� r r r r � r� z _generatorsetdesc.__contains__N)r
rX rY r� r� r� r+ r r r r r r� � r� r� Nc C s@ |du rt | �}||k}|s|d |d }}t|||| jj�S )z�Create a spanset that represents a range of repository revisions
start: first revision included the set (default to 0)
end: first revision excluded (last+1) (default to len(repo))
Spanset will be descending if `end` < `start`.
Nr )rk �_spanset� changelog� filteredrevs)�reporI �endr� r r r �spanset� s r� c s� e Zd ZdZdd� Zd%dd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
e
Zdd� Zdd� Zdd � Zd d � Zd d � Z� fd!d"�Zejd#d$� �Z� ZS )&r� a\ Duck type for baseset class which represents a range of revisions and
can work lazily and without having all the range in memory
Note that spanset(x, y) behave almost like xrange(x, y) except for two
notable points:
- when x < y it will be automatically descending,
- revision filtered with this repoview will be skipped.
c C s || _ || _|| _|| _d S r# )�_start�_endr[ � _hiddenrevs)r rI r� r� �
hiddenrevsr r r rc � s
z_spanset.__init__Fc C r� r# r� r2 r r r r3 � rl z
_spanset.sortc C r� r# r� r r r r r1 � r� z_spanset.reversec C r� rm r r r r r r � r� z_spanset.istopoc c s$ � | j }|D ] }||vr|V qd S r# )r� )r � iterrangeru r? r r r r� � r� z_spanset._iterfilterc C s | j r| �� S | �� S r# �r[ r( r+ r r r r r s z_spanset.__iter__c C s( t �| j| j�}| jr| �|�S t|�S r# )r rN r� r� r� r� rM �r r� r r r r( s
z_spanset.fastascc C s2 t �| jd | jd d�}| jr| �|�S t|�S )Nr rp )r rN r� r� r� r� rM r� r r r r+ s
z_spanset.fastdescc C s0 | j }| j| ko| jk n o|o||v S r# )r� r� r� )r r �hiddenr r r r s
�z_spanset.__contains__c C s | D ]} dS dS r� r r� r r r r s z_spanset.__nonzero__c C s| | j s t| j| j �S d}| j}| j}| j D ] }|| k r"|ks/n || kr-|k r3n q|d7 }qt| j| j �| S )Nr r )r� �absr� r� )r �countrI r� r r r r r0 " s
.�z_spanset.__len__c C r� r# r� r r r r r . r� z_spanset.isascendingc C r� r# r� r r r r r 1 r� z_spanset.isdescendingc C �* | j r| j}n| j}|� D ]}| S d S r# r� r� r r r r- 4 �
z_spanset.firstc C r� r# )r[ r+ r( r� r r r r/ = r� z
_spanset.lastc sz | j r tt| ��||�S | jr"t| j| | j�}t| j| | j�}nt| j| | j�}t| j| | j�}t||| j| j �S r# ) r� rs r� rH r[ r) r� r� r, )r rI rJ rT rU rv r r rH F s z_spanset._slicec C s( ddd�| j }dt| �|| j| jf S )Nr| r} r� s <%s%s %d:%d>)r[ r r� r� r� r r r r� R s z_spanset.__repr__rV )r
rX rY r� rc r3 r1 r r� r r( r+ r r rZ r0 r r r- r/ rH r r� r� r� r r rv r r� � s*
r� c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r8 z�a set containing all revisions in the repo
This class exists to host special optimization and magic to handle virtual
revisions such as "null".
c s" t t| ��dt|�d|jj� d S )Nr T)rs r8 rc rk r� r� )r r� rv r r rc _ s
�zfullreposet.__init__c C s. t �|d�s
t|| j �}|j| �� d� |S )z�As self contains the whole repo, all of the other set should also be
in self. Therefore `self & other = other`.
This boldly assumes the other contains valid revs only.
s isascendingr� )r rC rQ r� r3 r r: r r r r< d s zfullreposet.__and__)r
rX rY r� rc r< r� r r rv r r8 X s r8 )r N)�
__future__r r r � r r r �utilsr r �objectr rQ rE r� r= r� r� r� r� r� r8 r r r r �<module> s( dx% Y )
x