/
lib64
/
python3.9
/
site-packages
/
mercurial
/
__pycache__
/
Upload File
HOME
a �+�bA� � @ sR d dl mZmZ d dlZd dlZd dlZd dlZd dlZddlm Z ddl m Z ddl m Z mZmZmZm Z mZ ddlmZ e�d�Zd Zd ZejZd d � Zd\dd�Zdd� Zdd� Z d]dd�Z d^dd�Z d_dd�Z d`dd �Z dad d �Z!d d � Z"dbd!d"�Z#G d#d$� d$e$�Z%G d%d&� d&e%�Z&G d'd(� d(e%�Z'G d)d*� d*e%�Z(d+d,� Z)G d-d.� d.e%�Z*G d/d0� d0e$�Z+G d1d2� d2e%�Z,G d3d4� d4e%�Z-G d5d6� d6e%�Z.d7d8� Z/G d9d:� d:e%�Z0G d;d<� d<e%�Z1G d=d>� d>e%�Z2G d?d@� d@e%�Z3dcdAdB�Z4dCdD� Z5dEdF� Z6dGdH� Z7dIdJ� Z8dKZ9dLdM� Z:dNdO� Z;dPdQ� Z<dRdS� Z=dTdU� Z>dVdW� Z?dXdY� Z@daAdddZd[�ZBdS )e� )�absolute_import�print_functionN� )�_)�open)�encoding�error�pathutil�policy�pycompat�util)� stringutil�dirstate) � re� glob� path� relglob� relpath� relre� rootglob� listfile� listfile0� set� include� subinclude� rootfilesin�r r c C s2 t j�| �}z|jW S ty, |j Y S 0 dS )zZcompile the regexp with the best available regexp engine and return a matcher functionN)r �re�compileZ test_match�AttributeError�match)�regex�m� r# �5/usr/lib64/python3.9/site-packages/mercurial/match.py� _rematcher2 s r% Fc C s� g }g }|D ]�\}}} |dkr�|du r0t �d��|�|j| ||d�� |r |jD ]2} |�| �j| ||d�} t| | |d�} |�| � qPq |�||| f� q ||fS )zFReturns the kindpats list with the 'set' patterns expanded to matchersr Ns" fileset expression with no context��badfn)r �ProgrammingError�appendZ matchfilesetZsubstate�sub�prefixdirmatcher) �cwd�kindpats�ctx� listsubreposr' �matchers�other�kind�pat�sourceZsubpathZsmZpmr# r# r$ � _expandsets= s" � r5 c C s� g }g }| D ]�\}}}|dkr�t �t�|��}t�|�}t �||�}t �|�} | dg d| gf} t �||| �} | rz| d7 } |�| | f� q |�|||f� q ||fS )z_Returns the list of subinclude matcher args and the kindpats without the subincludes in it.r � s include:%s� /)r �dirnamer �normpathZpconvert�join� canonpathr) ) r- �rootZ relmatchersr1 r2 r3 r4 Z sourceroot�pathZnewroot� matcherargs�prefixr# r# r$ �_expandsubincludeU s r@ c C s* | D ] \}}}|dks |dvr dS qdS )zQChecks whether the kindspats match everything, as e.g. 'relpath:.' does. r6 r FTr# �r- r2 r3 r4 r# r# r$ �_kindpatsalwaysmatchn s rB c C sn g }t |||||d�\}}|r6| |||d�} |�| � |rD|�|� |sRt|d�S t|�dkrf|d S t|�S )N�r. r/ r' r& r r )r5 r) �extend� nevermatcher�len� unionmatcher) Z matcherclsr< r, r- r. r/ r' r0 Zfmsr" r# r# r$ �_buildkindpatsmatcherx s$ � rH r c s t j�| �sJ �t j�| t�|��}t} | rJ|�� j� � j �� �fdd�} |r�| ||| ||| �} t | �rrt | �}q�t t | || ||| d�}nt | �}|r�| |d| ||| �} t t| || ||dd�}t||�}|r�| |d| ||| �} t t| || ||dd�}t||�}|S )a� build an object to match a set of file patterns arguments: root - the canonical root of the tree you're matching against cwd - the current working directory, if relevant patterns - patterns to find include - patterns to include (unless they are excluded) exclude - patterns to exclude (even if they are included) default - if a pattern in patterns has no explicit type, assume this one auditor - optional path auditor ctx - optional changecontext listsubrepos - if True, recurse into subrepositories warn - optional function used for printing warnings badfn - optional bad() callback for this matcher instead of the default icasefs - make a matcher for wdir on case insensitive filesystems, which normalizes the given patterns to the case in the filesystem a pattern is one of: 'glob:<glob>' - a glob relative to cwd 're:<regexp>' - a regular expression 'path:<path>' - a path relative to repository root, which is matched recursively 'rootfilesin:<path>' - a path relative to repository root, which is matched non-recursively (will not match subdirectories) 'relglob:<glob>' - an unrooted glob (*.c matches C files in all dirs) 'relpath:<path>' - a path relative to cwd 'relre:<regexp>' - a regexp that needn't match the start of a name 'set:<fileset>' - a fileset expression 'include:<path>' - a file of patterns to read and include 'subinclude:<path>' - a file of patterns to match against files under the same directory '<something>' - a pattern of the specified default type >>> def _match(root, *args, **kwargs): ... return match(util.localpath(root), *args, **kwargs) Usually a patternmatcher is returned: >>> _match(b'/foo', b'.', [b're:.*\.c$', b'path:foo/a', b'*.py']) <patternmatcher patterns='.*\\.c$|foo/a(?:/|$)|[^/]*\\.py$'> Combining 'patterns' with 'include' (resp. 'exclude') gives an intersectionmatcher (resp. a differencematcher): >>> type(_match(b'/foo', b'.', [b're:.*\.c$'], include=[b'path:lib'])) <class 'mercurial.match.intersectionmatcher'> >>> type(_match(b'/foo', b'.', [b're:.*\.c$'], exclude=[b'path:build'])) <class 'mercurial.match.differencematcher'> Notice that, if 'patterns' is empty, an alwaysmatcher is returned: >>> _match(b'/foo', b'.', []) <alwaysmatcher> The 'default' argument determines which kind of pattern is assumed if a pattern has no prefix: >>> _match(b'/foo', b'.', [b'.*\.c$'], default=b're') <patternmatcher patterns='.*\\.c$'> >>> _match(b'/foo', b'.', [b'main.py'], default=b'relpath') <patternmatcher patterns='main\\.py(?:/|$)'> >>> _match(b'/foo', b'.', [b'main.py'], default=b're') <patternmatcher patterns='main.py'> The primary use of matchers is to check whether a value (usually a file name) matches againset one of the patterns given at initialization. There are two ways of doing this check. >>> m = _match(b'/foo', b'', [b're:.*\.c$', b'relpath:a']) 1. Calling the matcher with a file name returns True if any pattern matches that file name: >>> m(b'a') True >>> m(b'main.c') True >>> m(b'test.py') False 2. Using the exact() method only returns True if the file name matches one of the exact patterns (i.e. not re: or glob: patterns): >>> m.exact(b'a') True >>> m.exact(b'main.c') False c sn t | |||||�}g }|D ]N\}} } |dvrX| } �| �} | | krX| � v rX|�|| | f� |�|| | f� q|S )N)r r )� _donormalizer) ) �patterns�defaultr< r, �auditor�warn�kpr- r2 Zpatsr4 �p�r Z dsnormalizer# r$ � normalize� s zmatch.<locals>.normalizerC r N)�osr= �isabsr: r � localpathrI Zrepor rQ rB � alwaysmatcherrH �patternmatcher�includematcher�intersectmatchers�differencematcher)r< r, rJ ZincludeZexcluderK rL r. r/ rM r' ZicasefsrQ r- r" ZimZemr# rP r$ r � s\ ` � � � r c C s t | |d�S )Nr& )� exactmatcher)�filesr' r# r# r$ �exact9 s r\ c C s t | �S �N)rU r& r# r# r$ �always= s r^ c C s t | �S r] )rE r& r# r# r$ �neverA s r_ c C s t � | �}||_|S )zWMake a copy of the given matcher, replacing its bad method with the given one. )�copy�bad)r r' r" r# r# r$ �badmatchE s rb c s� g }� fdd�| D �D �]�\}}|t v r>tj||||d�}�n�|dv rTt�|�}�n�|dv r�z8t�|�} |dkr|| �d�} n| �� } dd� | D �} W n$ ty� t � t d �| ��Y n0 t | � ||||�D ]\} } } |� | | |f� q�qn�|d k�r�zXtj�|t�|��} t| |�}t |� ||||�D ]"\} } } |� | | | �pB|f� �q(W q t j �y� } z t � d ||jf ��W Y d }~qd }~0 t�y� } z.|�r�|t d �|t�|j�f � W Y d }~qd }~0 0 q|� ||df� q|S )z�Convert 'kind:pat' from the patterns list to tuples with kind and normalized and rooted patterns and with listfiles expanded.c s g | ]}t |� ��qS r# �� _patsplit)�.0rO �rK r# r$ � <listcomp>R r6 z _donormalize.<locals>.<listcomp>)rL )r r r r )r r r � c S s g | ] }|r|�qS r# r# �re �fr# r# r$ rg ^ r6 s unable to read file list (%s)r s %s: %sNs* skipping unreadable pattern file '%s': %s r6 )�cwdrelativepatternkindsr r; r r9 Zreadfile�split� splitlines�EnvironmentErrorr �Abortr rI r) rR r= r: rT �readpatternfile�message�IOErrorr Z forcebytestr�strerror)rJ rK r< r, rL rM r- r2 r3 r[ �krO r4 �fullpathZ includepats�instr# rf r$ rI N s\ � � �����rI c @ s� e Zd Zd dd�Zdd� Zdd� ZdZedd � �Zd d � Z ed d � �Z dd� Z dd� Z dd� Z dd� Zdd� Zdd� Zdd� Zd d � ZdS ) � basematcherNc C s |d ur|| _ d S r] )ra ��selfr' r# r# r$ �__init__� s zbasematcher.__init__c C s | � |�S r] )�matchfn)ry �fnr# r# r$ �__call__� s zbasematcher.__call__c C s dS )zoCallback from dirstate.walk for each explicit file that can't be found/accessed, with an error message.Nr# �ry rj �msgr# r# r$ ra � s zbasematcher.badc C s g S r] r# �ry r# r# r$ �_files� s zbasematcher._filesc C s | j S )z�Explicitly listed files or patterns or roots: if no patterns or .always(): empty list, if exact: list exact files, if not .anypats(): list all files and dirs, else: optimal roots�r� r� r# r# r$ r[ � s zbasematcher.filesc C s t | j�S r] )�setr� r� r# r# r$ �_fileset� s zbasematcher._filesetc C s || j v S )z!Returns True if f is in .files().)r� �ry rj r# r# r$ r\ � s zbasematcher.exactc C s dS �NFr# r� r# r# r$ r{ � s zbasematcher.matchfnc C s dS )a� Decides whether a directory should be visited based on whether it has potential matches in it or one of its subdirectories. This is based on the match's primary, included, and excluded patterns. Returns the string 'all' if the given directory and all subdirectories should be visited. Otherwise returns True or False indicating whether the given directory should be visited. Tr# �ry �dirr# r# r$ �visitdir� s zbasematcher.visitdirc C s dS )a] Decides whether a directory should be visited based on whether it has potential matches in it or one of its subdirectories, and potentially lists which subdirectories of that directory should be visited. This is based on the match's primary, included, and excluded patterns. This function is very similar to 'visitdir', and the following mapping can be applied: visitdir | visitchildrenlist ----------+------------------- False | set() 'all' | 'all' True | 'this' OR non-empty set of subdirs -or files- to visit Example: Assume matchers ['path:foo/bar', 'rootfilesin:qux'], we would return the following values (assuming the implementation of visitchildrenset is capable of recognizing this; some implementations are not). '' -> {'foo', 'qux'} 'baz' -> set() 'foo' -> {'bar'} # Ideally this would be 'all', but since the prefix nature of matchers # is applied to the entire matcher, we have to downgrade this to # 'this' due to the non-prefix 'rootfilesin'-kind matcher being mixed # in. 'foo/bar' -> 'this' 'qux' -> 'this' Important: Most matchers do not know if they're representing files or directories. They see ['path:dir/f'] and don't know whether 'f' is a file or a directory, so visitchildrenset('dir') for most matchers will return {'f'}, but if the matcher knows it's a file (like exactmatcher does), it may return 'this'. Do not rely on the return being a set indicating that there are no files in this dir to investigate (or equivalently that if there are files to investigate in 'dir' that it will always return 'this'). � thisr# r� r# r# r$ �visitchildrenset� s )z basematcher.visitchildrensetc C s dS )zcMatcher will match everything and .files() will be empty -- optimization might be possible.Fr# r� r# r# r$ r^ � s zbasematcher.alwaysc C s dS )zcMatcher will match exactly the list of files in .files() -- optimization might be possible.Fr# r� r# r# r$ �isexact� s zbasematcher.isexactc C s dS )z_Matcher will match the paths in .files() recursively -- optimization might be possible.Fr# r� r# r# r$ r? � s zbasematcher.prefixc C s | � � o | �� o | �� S )z`None of .always(), .isexact(), and .prefix() is true -- optimizations will be difficult.)r^ r� r? r� r# r# r$ �anypats� s zbasematcher.anypats)N)�__name__� __module__� __qualname__rz r} ra � traversedir� propertycacher� r[ r� r\ r{ r� r� r^ r� r? r� r# r# r# r$ rw � s" +rw c sJ e Zd ZdZd� fdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z � Z S )rU zMatches everything.Nc s t t| ��|� d S r] )�superrU rz rx �� __class__r# r$ rz � s zalwaysmatcher.__init__c C s dS �NTr# r� r# r# r$ r^ � s zalwaysmatcher.alwaysc C s dS r� r# r� r# r# r$ r{ � s zalwaysmatcher.matchfnc C s dS �N� allr# r� r# r# r$ r� s zalwaysmatcher.visitdirc C s dS r� r# r� r# r# r$ r� s z alwaysmatcher.visitchildrensetc C s dS )Nz<alwaysmatcher>r# r� r# r# r$ �__repr__ s zalwaysmatcher.__repr__)N) r� r� r� �__doc__rz r^ r{ r� r� r� � __classcell__r# r# r� r$ rU � s rU c sJ e Zd ZdZd� fdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z � Z S )rE zMatches nothing.Nc s t t| ��|� d S r] )r� rE rz rx r� r# r$ rz s znevermatcher.__init__c C s dS r� r# r� r# r# r$ r� s znevermatcher.isexactc C s dS r� r# r� r# r# r$ r? s znevermatcher.prefixc C s dS r� r# r� r# r# r$ r� s znevermatcher.visitdirc C s t � S r] )r� r� r# r# r$ r� s z nevermatcher.visitchildrensetc C s dS )Nz<nevermatcher>r# r� r# r# r$ r� # s znevermatcher.__repr__)N) r� r� r� r� rz r� r? r� r� r� r� r# r# r� r$ rE s rE c s0 e Zd ZdZd� fdd� Zejdd� �Z� ZS )�predicatematcherz/A matcher adapter for a simple boolean functionNc s t t| ��|� || _|| _d S r] )r� r� rz r{ � _predrepr)ry ZpredfnZpredreprr' r� r# r$ rz * s zpredicatematcher.__init__c C s t �| j�pt�| j�}d| S )Ns <predicatenmatcher pred=%s>)r Z buildreprr� r Zbytereprr{ )ry �sr# r# r$ r� / s �zpredicatematcher.__repr__)NN) r� r� r� r� rz r � strmethodr� r� r# r# r� r$ r� ' s r� c s| t ��}|dkrdS � �v r dS |dkrDt�fdd�t�� �D ��S d�v rPdS tjr`td��nd �t� �fd d��D ��S ) zDReturns True if `path` (or any parent of `path`) is in `prefix_set`.r FT� c 3 s | ]}|� v V qd S r] r# )re Z parentdir)� prefix_setr# r$ � <genexpr>B s z)path_or_parents_in_set.<locals>.<genexpr>r6 r7 �/c 3 s( | ] }� � |�o � t|� �kV qd S r] �� startswithrF )re Zpf)r= �slr# r$ r� R r6 )rF �anyr �finddirsr Zispy3�ord)r= r� �lr# )r= r� r� r$ �path_or_parents_in_set7 s � r� c sT e Zd ZdZd� fdd� Zedd� �Zdd� Zd d � Zd d � Z e j d d� �Z � Z S )rV a( Matches a set of (kind, pat, source) against a 'root' directory. >>> kindpats = [ ... (b're', br'.*\.c$', b''), ... (b'path', b'foo/a', b''), ... (b'relpath', b'b', b''), ... (b'glob', b'*.h', b''), ... ] >>> m = patternmatcher(b'foo', kindpats) >>> m(b'main.c') # matches re:.*\.c$ True >>> m(b'b.txt') False >>> m(b'foo/a') # matches path:foo/a True >>> m(b'a') # does not match path:b, since 'root' is 'foo' False >>> m(b'b') # matches relpath:b, since 'root' is 'foo' True >>> m(b'lib.h') # matches glob:*.h True >>> m.files() ['', 'foo/a', 'b', ''] >>> m.exact(b'foo/a') True >>> m.exact(b'b') True >>> m.exact(b'lib.h') # exact matches are for (rel)path kinds False Nc s< t t| ��|� t|�| _t|�| _t|d|�\| _| _d S )N� $) r� rV rz �_explicitfilesr� �_prefix� _buildmatch�_patsr{ )ry r< r- r' r� r# r$ rz v s zpatternmatcher.__init__c C s t t�| j��S r] �r� r �dirsr� r� r# r# r$ �_dirs} s zpatternmatcher._dirsc C s* | j r|| jv rdS || jv p(t|| j�S r� )r� r� r� r� r� r# r# r$ r� � s zpatternmatcher.visitdirc C s0 | � |�}|du rdS |s t� S |dks,J �dS )NTr� r� )r� r� )ry r� �retr# r# r$ r� � s z patternmatcher.visitchildrensetc C s | j S r] )r� r� r# r# r$ r? � s zpatternmatcher.prefixc C s dt �| j� S )Ns <patternmatcher patterns=%r>�r �bytestrr� r� r# r# r$ r� � s zpatternmatcher.__repr__)N)r� r� r� r� rz r� r� r� r� r? r r� r� r� r# r# r� r$ rV U s rV c @ s2 e Zd Zd dd�Zdd� Zedd� �Zdd � ZdS ) � _dirchildrenNc C s, i | _ |p g | _| j}|D ] }||� qd S r] )r� � _onlyinclude�addpath)ry �paths� onlyincluder� rj r# r# r$ rz � s z_dirchildren.__init__c C sN |dkr d S | j }tj}||�D ](\}}|| jvr4q |�|t� ��|� q d S �Nr6 )r� r� �_findsplitdirsr� � setdefaultr� �add)ry r= r� Z findsplitdirs�d�br# r# r$ r� � s z_dirchildren.addpathc c sb t | �}| �d�}|dkrL| d |� | |d |� fV |}| �dd|�}qd| d |� fV d S )Nr7 ���r r r6 )rF �rfind)r= Zoldpos�posr# r# r$ r� � s z_dirchildren._findsplitdirsc C s | j �|t� �S r] )r� �getr� )ry r= r# r# r$ r� � s z_dirchildren.get)N)r� r� r� rz r� � staticmethodr� r� r# r# r# r$ r� � s r� c sH e Zd Zd � fdd� Zdd� Zedd� �Zdd � Zej d d � �Z � Z S ) rW Nc sh t t| ��|� td ur || _t|d|�\| _| _t|�| _t |�\}}}t |�| _ t |�| _ || _ d S )N� (?:/|$))r� rW rz �rustmodZ _kindpatsr� r� r{ r� �_rootsdirsandparentsr� �_rootsr� �_parents)ry r< r- r' �rootsr� �parentsr� r# r$ rz � s zincludematcher.__init__c C s4 | j r|| jv rdS || jv p2|| jv p2t|| j�S r� )r� r� r� r� r� r� r# r# r$ r� � s � �zincludematcher.visitdirc C s t t�| j| j| j�| jd�S )N)r� )r� � itertools�chainr� r� r� r� r# r# r$ �_allparentschildren� s �z"includematcher._allparentschildrenc C sZ | j r|| jv rdS d| jv s4|| jv s4t|| j�r8dS || jv rT| j�|�pRt� S t� S )Nr� r6 r� )r� r� r� r� r� r� r� r� r� r# r# r$ r� � s �� � z includematcher.visitchildrensetc C s dt �| j� S )Ns <includematcher includes=%r>r� r� r# r# r$ r� � s zincludematcher.__repr__)N) r� r� r� rz r� r� r� r� r r� r� r� r# r# r� r$ rW � s rW c sr e Zd ZdZd� fdd� ZejZedd� �Z dd� Z ed d � �Z ed d � �Z d d� Z dd� Zejdd� �Z� ZS )rZ a� Matches the input files exactly. They are interpreted as paths, not patterns (so no kind-prefixes). >>> m = exactmatcher([b'a.txt', br're:.*\.c$']) >>> m(b'a.txt') True >>> m(b'b.txt') False Input files that would be matched are exactly those returned by .files() >>> m.files() ['a.txt', 're:.*\\.c$'] So pattern 're:.*\.c$' is not considered as a regex, but as a file name >>> m(b'main.c') False >>> m(br're:.*\.c$') True Nc s0 t t| ��|� t|t�r"|| _n t|�| _d S r] )r� rZ rz � isinstance�listr� )ry r[ r' r� r# r$ rz s zexactmatcher.__init__c C s t t�| j��S r] r� r� r# r# r$ r� s zexactmatcher._dirsc C s || j v S r] )r� r� r# r# r$ r� s zexactmatcher.visitdirc C s | j | jdh B S )z2A memoized set of candidates for visitchildrenset.r6 )r� r� r� r# r# r$ � _visitchildrenset_candidates" s z)exactmatcher._visitchildrenset_candidatesc C s t | j�S )z:A memoized sorted list of candidates for visitchildrenset.)�sortedr� r� r# r# r$ �#_sorted_visitchildrenset_candidates' s z0exactmatcher._sorted_visitchildrenset_candidatesc s� | j r|| jvrt� S |dkr&| j}nf| j}|d }t�||�}|t�t t d�d �� }tj|||d�}t |�� � fdd�|||� D �}dd� |D �}|s�J �|S )Nr6 r7 r )�loc s h | ]}|� d � �qS r] r# �re �c�Zdlenr# r$ � <setcomp>A r6 z0exactmatcher.visitchildrenset.<locals>.<setcomp>c S s h | ]}d |vr|�qS )r7 r# r� r# r# r$ r� G r6 ) r� r� r� r� r� �bisectZ bisect_leftr Z strtolocal�chrr� rF )ry r� Z candidatesr� �firstZdnextZlastr� r# r� r$ r� , s z exactmatcher.visitchildrensetc C s dS r� r# r� r# r# r$ r� M s zexactmatcher.isexactc C s d| j S )Ns <exactmatcher files=%r>r� r� r# r# r$ r� P s zexactmatcher.__repr__)N)r� r� r� r� rz rw r\ r{ r� r� r� r� r� r� r� r r� r� r� r# r# r� r$ rZ � s !rZ c sZ e Zd ZdZ� fdd�Zdd� Zedd� �Zdd � Zd d � Z d d � Z e j dd� �Z � ZS )rY z�Composes two matchers by matching if the first matches and the second does not. The second matcher's non-matching-attributes (bad, traversedir) are ignored. c s. t t| ��� || _|| _|j| _|j| _d S r] )r� rY rz �_m1�_m2ra r� �ry �m1�m2r� r# r$ rz \ s zdifferencematcher.__init__c C s | � |�o| �|� S r] �r� r� r� r# r# r$ r{ c s zdifferencematcher.matchfnc s* � � � r � fdd�� j�� D �S � j�� S )Nc s g | ]}� |�r|�qS r# r# ri r� r# r$ rg i r6 z,differencematcher._files.<locals>.<listcomp>)r� r� r[ r� r# r� r$ r� f s zdifferencematcher._filesc C s< | j �|�dkrdS | j �|�s,| j�|�S t| j�|��S )Nr� F)r� r� r� �boolr� r# r# r$ r� q s zdifferencematcher.visitdirc C s> | j �|�}|dkrt� S | j�|�}|s.|S |dv r:dS |S )Nr� )r� r� r� )r� r� r� r� )ry r� �m2_set�m1_setr# r# r$ r� y s z"differencematcher.visitchildrensetc C s | j �� S r] )r� r� r� r# r# r$ r� � s zdifferencematcher.isexactc C s d| j | jf S )Ns <differencematcher m1=%r, m2=%r>r� r� r# r# r$ r� � s zdifferencematcher.__repr__)r� r� r� r� rz r{ r� r� r� r� r� r r� r� r� r# r# r� r$ rY U s rY c C s^ | du s|du r| p|S | � � r>t�|�}| j|_| j|_|S |� � rTt�| �}|S t| |�S )z�Composes two matchers by matching if both of them match. The second matcher's non-matching-attributes (bad, traversedir) are ignored. N)r^ r` ra r� �intersectionmatcher)r� r� r" r# r# r$ rX � s rX c s^ e Zd Z� fdd�Zedd� �Zdd� Zdd� Zd d � Zd d � Z d d� Z e j dd� �Z � ZS )r� c s. t t| ��� || _|| _|j| _|j| _d S r] )r� r� rz r� r� ra r� r� r� r# r$ rz � s z intersectionmatcher.__init__c sR | � � r>| j| j }� |� � s(� | }� � fdd�|�� D �S | j�� | j�� S )Nc s g | ]}� |�r|�qS r# r# ri �r� r# r$ rg � r6 z.intersectionmatcher._files.<locals>.<listcomp>)r� r� r� r[ )ry r� r# r� r$ r� � s zintersectionmatcher._filesc C s | � |�o| �|�S r] r� r� r# r# r$ r{ � s zintersectionmatcher.matchfnc C s4 | j �|�}|dkr | j�|�S t|o0| j�|��S r� )r� r� r� r� )ry r� Zvisit1r# r# r$ r� � s z intersectionmatcher.visitdirc C sz | j �|�}|st� S | j�|�}|s,t� S |dkr8|S |dkrD|S |dksT|dkrXdS t|t�rlt|t�spJ �|�|�S )Nr� r� )r� r� r� r� r� � intersection)ry r� r� r� r# r# r$ r� � s z$intersectionmatcher.visitchildrensetc C s | j �� o| j�� S r] )r� r^ r� r� r# r# r$ r^ � s zintersectionmatcher.alwaysc C s | j �� p| j�� S r] )r� r� r� r� r# r# r$ r� � s zintersectionmatcher.isexactc C s d| j | jf S )Ns" <intersectionmatcher m1=%r, m2=%r>r� r� r# r# r$ r� � s z intersectionmatcher.__repr__)r� r� r� rz r� r� r{ r� r� r^ r� r r� r� r� r# r# r� r$ r� � s r� c s^ e Zd ZdZ� fdd�Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z e j dd� �Z � ZS )� subdirmatchera� Adapt a matcher to work on a subdirectory only. The paths are remapped to remove/insert the path as needed: >>> from . import pycompat >>> m1 = match(util.localpath(b'/root'), b'', [b'a.txt', b'sub/b.txt'], auditor=lambda name: None) >>> m2 = subdirmatcher(b'sub', m1) >>> m2(b'a.txt') False >>> m2(b'b.txt') True >>> m2.matchfn(b'a.txt') False >>> m2.matchfn(b'b.txt') True >>> m2.files() ['b.txt'] >>> m2.exact(b'b.txt') True >>> def bad(f, msg): ... print(pycompat.sysstr(b"%s: %s" % (f, msg))) >>> m1.bad = bad >>> m2.bad(b'x.txt', b'No such file') sub/x.txt: No such file c s` t t| ��� � | _|| _|�� | _� fdd�|jD �| _|�� r\t � fdd�|jD ��| _d S )Nc s. g | ]&}|� � d �r|t� �d d� �qS )r7 r Nr� ri �r= r# r$ rg s �z*subdirmatcher.__init__.<locals>.<listcomp>c 3 s | ]}|� kV qd S r] r# ri r� r# r$ r� r6 z)subdirmatcher.__init__.<locals>.<genexpr>) r� r� rz �_path�_matcherr^ �_alwaysr� r? r� )ry r= �matcherr� r� r$ rz s �zsubdirmatcher.__init__c C s | j �| jd | |� d S �Nr7 )r� ra r� r~ r# r# r$ ra s zsubdirmatcher.badc C s | j �| jd | �S r� )r� r{ r� r� r# r# r$ r{ s zsubdirmatcher.matchfnc C s* |dkr| j }n| j d | }| j�|�S �Nr6 r7 )r� r� r� r� r# r# r$ r� ! s zsubdirmatcher.visitdirc C s* |dkr| j }n| j d | }| j�|�S r� )r� r� r� r� r# r# r$ r� ( s z subdirmatcher.visitchildrensetc C s | j S r] )r� r� r# r# r$ r^ / s zsubdirmatcher.alwaysc C s | j �� o| j S r] )r� r? r� r� r# r# r$ r? 2 s zsubdirmatcher.prefixc C s d| j | jf S )Ns# <subdirmatcher path=%r, matcher=%r>)r� r� r� r# r# r$ r� 5 s �zsubdirmatcher.__repr__)r� r� r� r� rz ra r{ r� r� r^ r? r r� r� r� r# r# r� r$ r� � s r� c sp e Zd ZdZd� fdd� Zedd� �Zdd� Zed d � �Zd d � Z d d� Z dd� Z dd� Z e jdd� �Z� ZS )r+ a Adapt a matcher to work on a parent directory. The matcher's non-matching-attributes (bad, traversedir) are ignored. The prefix path should usually be the relative path from the root of this matcher to the root of the wrapped matcher. >>> m1 = match(util.localpath(b'/root/d/e'), b'f', [b'../a.txt', b'b.txt'], auditor=lambda name: None) >>> m2 = prefixdirmatcher(b'd/e', m1) >>> m2(b'a.txt') False >>> m2(b'd/e/a.txt') True >>> m2(b'd/e/b.txt') False >>> m2.files() ['d/e/a.txt', 'd/e/f/b.txt'] >>> m2.exact(b'd/e/a.txt') True >>> m2.visitdir(b'd') True >>> m2.visitdir(b'd/e') True >>> m2.visitdir(b'd/e/f') True >>> m2.visitdir(b'd/e/g') False >>> m2.visitdir(b'd/ef') False Nc s8 t t| ��|� |s t�d��|| _|d | _|| _d S )Ns prefix path must not be emptyr7 )r� r+ rz r r( r� � _pathprefixr� )ry r= r� r' r� r# r$ rz ] s zprefixdirmatcher.__init__c s � fdd�� j jD �S )Nc s g | ]}� j | �qS r# )r� ri r� r# r$ rg g r6 z+prefixdirmatcher._files.<locals>.<listcomp>)r� r� r� r# r� r$ r� e s zprefixdirmatcher._filesc C s* |� | j�sdS | j�|t| j�d � �S r� )r� r� r� r{ rF r� r# r# r$ r{ i s zprefixdirmatcher.matchfnc C s t t�| j��S r] )r� r r� r� r� r# r# r$ � _pathdirsn s zprefixdirmatcher._pathdirsc C sF || j kr| j�d�S |�| j�r<| j�|t| j�d � �S || jv S r� )r� r� r� r� r� rF r� r� r# r# r$ r� r s zprefixdirmatcher.visitdirc C sP || j kr| j�d�S |�| j�r<| j�|t| j�d � �S || jv rJdS t� S )Nr6 r� )r� r� r� r� r� rF r� r� r� r# r# r$ r� y s z!prefixdirmatcher.visitchildrensetc C s | j �� S r] )r� r� r� r# r# r$ r� � s zprefixdirmatcher.isexactc C s | j �� S r] )r� r? r� r# r# r$ r? � s zprefixdirmatcher.prefixc C s dt �| j�| jf S )Ns& <prefixdirmatcher path=%r, matcher=%r>)r r� r� r� r� r# r# r$ r� � s �zprefixdirmatcher.__repr__)N)r� r� r� r� rz r� r� r{ r� r� r� r� r? r r� r� r� r# r# r� r$ r+ = s r+ c sF e Zd ZdZ� fdd�Zdd� Zdd� Zdd � Zej d d � �Z � Z S ) rG z�A matcher that is the union of several matchers. The non-matching-attributes (bad, traversedir) are taken from the first matcher. c s( |d }t t| ��� |j| _|| _d S )Nr )r� rG rz r� � _matchers)ry r0 r� r� r# r$ rz � s zunionmatcher.__init__c C s | j D ]}||�r dS qdS �NTF�r� )ry rj r r# r# r$ r{ � s zunionmatcher.matchfnc C s6 d}| j D ]&}|�|�}|dkr(| S ||O }q |S )NFr� )r� r� )ry r� �rr" �vr# r# r$ r� � s zunionmatcher.visitdirc C sl t � }d}| jD ]N}|�|�}|s$q|dkr4| S |s@|dkrFd}qt|t �sTJ �|�|�}q|rhdS |S )NFr� r� T)r� r� r� r� �union)ry r� r� �thisr" r� r# r# r$ r� � s z unionmatcher.visitchildrensetc C s d| j S )Ns <unionmatcher matchers=%r>r� r� r# r# r$ r� � s zunionmatcher.__repr__) r� r� r� r� rz r{ r� r� r r� r� r� r# r# r� r$ rG � s rG c C s t | |�d S )a If pattern is 'kind:pat' with a known kind, return kind. >>> patkind(br're:.*\.c$') 're' >>> patkind(b'glob:*.c') 'glob' >>> patkind(b'relpath:test.py') 'relpath' >>> patkind(b'main.py') >>> patkind(b'main.py', default=b're') 're' r rc )�patternrK r# r# r$ �patkind� s r� c C s0 d| v r(| � dd�\}}|tv r(||fS || fS )zPSplit a string into the optional pattern kind prefix and the actual pattern.� :r )rl �allpatternkinds)r� rK r2 r3 r# r# r$ rd � s rd c sN dt �� � �d}d}tjjj}� ��fdd�}� �k �rJ�� � d � }� d7 � |dvrj||||�7 }q0|dkr�|� dkr�� d7 � |� dkr�� d7 � |d 7 }q�|d 7 }n|d 7 }q0|d kr�|d 7 }q0|dk�r�� }|�k � r��||d � dv � r�|d7 }|�k �r(�||d � dk�r(|d7 }� q�|�k�r<|d7 }nf�� |� �dd�}|d � |dd� dk�r|d|dd� }n|dd� dk�r�d| }d||f }q0|dk�r�|d7 }|d7 }q0|dk�r�|�r�|d7 }|d8 }q0|d k�r�|�r�|d 7 }q0|dk�r:|� }|�r*� d7 � ||||�7 }n||||�7 }q0||||�7 }q0|S ) a Convert an extended glob string to a regexp string. >>> from . import pycompat >>> def bprint(s): ... print(pycompat.sysstr(s)) >>> bprint(_globre(br'?')) . >>> bprint(_globre(br'*')) [^/]* >>> bprint(_globre(br'**')) .* >>> bprint(_globre(br'**/a')) (?:.*/)?a >>> bprint(_globre(br'a/**/b')) a/(?:.*/)?b >>> bprint(_globre(br'[a*?!^][^b][!c]')) [a*?!^][\^b][^c] >>> bprint(_globre(br'{a,b}')) (?:a|b) >>> bprint(_globre(br'.\*\?')) \.\*\? r r6 c s � �k o�� � d � S )Nr r# r# ��i�nr3 r# r$ �peek� s z_globre.<locals>.peekr s *?[{},\� *r7 s (?:.*/)?� .*� [^/]*� ?� .� [s !]� ]s \[� \s \\� !� ^Ns %s[%s]� {s (?:� }� )� ,� |)rF r r Zregexbytesescapemapr� �replace) r3 �res�group�escaper r� �j�stuffrO r# r� r$ �_globre� sf r c C s� |s| dv rdS | dkr |S | dv r@|dkr0dS t j�|�d S | dkrn|dkrVd}nt j�|�d }|d S | d kr�t|�}|�d �r�d |td �d � | S d| | S | dkr�|�d�r�|S d | S | dv r�t|�| S t�d| |f ��d S )z|Convert a (normalized) pattern of any kind into a regular expression. globsuffix is appended to the regexp of globs.)r r r6 r �r r r r� r r7 s [^/]+$r r r Ns (?:|.*/)r r �r r s not a regex pattern: %s:%s)r r Zreescaper r� rF r r( )r2 r3 � globsuffixZescapedZglobrer# r# r$ �_regex2 s2 r c s� g �t | |�\�} �r2i ���fdd�}��|� d}| r�tdd� | D ��r�dd� | D �� � fdd �}d t�tt� ��� }��|� nt| |�\}}��|� t��d kr�|�d fS |�fd d�fS dS )zlReturn regexp string and a matcher function for kindpats. globsuffix is appended to the regexp of globs.c sX � D ]N\}}| � |�r��|�}|d u r8t|� }|�|< || t|�d � �r dS qdS r� )r� r� r rF )rj r? r> �mf)� subincludes� submatchersr# r$ �matchsubinclude_ s z$_buildmatch.<locals>.matchsubincluder6 c s s | ]\}}}|d kV qdS )r Nr# �re rt rO r� r# r# r$ r� o r6 z _buildmatch.<locals>.<genexpr>c S s h | ]\}}}|�qS r# r# r! r# r# r$ r� p r6 z _buildmatch.<locals>.<setcomp>c s, | � d�}|dkr | d |� }nd}|� v S )Nr7 r r )r� )rj r r� )r� r# r$ r r s z_buildmatch.<locals>.mfs rootfilesin: %sr r c s t � fdd��D ��S )Nc 3 s | ]}|� �V qd S r] r# )re r �rj r# r$ r� � r6 z0_buildmatch.<locals>.<lambda>.<locals>.<genexpr>�r� r" )� matchfuncsr" r$ �<lambda>� r6 z _buildmatch.<locals>.<lambda>N) r@ r) �allr Zpprintr� r� �_buildregexmatchrF )r- r r< r r! r r# )r� r$ r r r$ r� V s$ r� i N c C s d� | �S )z5gather multiple regular expressions into a single oner )r: )�regexpsr# r# r$ � _joinregexes� s r) c s� z�g }�fdd�| D �}t |�}d}d}t|�D ]j\}}t|�} | tkr`td�| } t�| ��n.|| tkr�|||� } |�t | �� |}d}|| d 7 }q0|dkr�t|���fdd�} n4||d� } |�t | �� d d� |D �� � fd d�} || fW S t j�y� | D ]n\} }}ztt | |��� W nL t j�yv |�r\t�td �|| |f ��nt�td �| |f ��Y n0 �q t�td ���Y n0 dS )aK Build a match function from a list of kinds and kindpats, return regexp string and a matcher function. Test too large input >>> _buildregexmatch([ ... (b'relglob', b'?' * MAX_RE_SIZE, b'') ... ], b'$') Traceback (most recent call last): ... Abort: matcher pattern is too long (20009 bytes) c s g | ]\}}}t ||� ��qS r# )r r! )r r# r$ rg � r6 z$_buildregexmatch.<locals>.<listcomp>r s& matcher pattern is too long (%d bytes)r c s t � | ��S r] )r� �r� )r� r# r$ r% � r6 z"_buildregexmatch.<locals>.<lambda>Nc S s g | ] }t |��qS r# )r% )re �gr# r# r$ rg � r6 c s t � fdd��D ��S )Nc 3 s | ]}|� �V qd S r] r# )re r" r* r# r$ r� � r6 z5_buildregexmatch.<locals>.<lambda>.<locals>.<genexpr>r# r* )� allmatchersr* r$ r% � r6 s %s: invalid pattern (%s): %ss invalid pattern (%s): %ss invalid pattern) r) � enumeraterF � MAX_RE_SIZEr r ro r) r% r r )r- r Z allgroupsr( Z fullregexpZstartidxZ groupsize�idxr� Z piecesizer r �funcrt rO r� r# )r, r r� r$ r' � sH � r' c C s� g }g }| D ]�\}}}|dv rrg }|� d�D ]2}d|v sPd|v sPd|v sPd|v rT q`|�|� q,|�d�|�� q |dv r�|dkr�d }|�|� q |d v r�|dkr�d }|�|� q |�d � q ||fS ) a1 Returns roots and directories corresponding to each pattern. This calculates the roots and directories exactly matching the patterns and returns a tuple of (roots, dirs) for each. It does not return other directories which may also need to be considered, like the parent directories. r r7 r r r r )r r r r6 �r )rl r) r: )r- r� r� r2 r3 r4 r< rO r# r# r$ �_patternrootsanddirs� s( r2 c C s t | �\}}|S )zFReturns root directories to match recursively from the given patterns.)r2 )r- r� r� r# r# r$ r� � s r� c C s< t | �\}}t� }|�t�|�� |�t�|�� |||fS )a� Returns roots and exact directories from patterns. `roots` are directories to match recursively, `dirs` should be matched non-recursively, and `parents` are the implicitly required directories to walk to items in either roots or dirs. Returns a tuple of (roots, dirs, parents). >>> r = _rootsdirsandparents( ... [(b'glob', b'g/h/*', b''), (b'glob', b'g/h', b''), ... (b'glob', b'g*', b'')]) >>> print(r[0:2], sorted(r[2])) # the set has an unstable output (['g/h', 'g/h', ''], []) ['', 'g'] >>> r = _rootsdirsandparents( ... [(b'rootfilesin', b'g/h', b''), (b'rootfilesin', b'', b'')]) >>> print(r[0:2], sorted(r[2])) # the set has an unstable output ([], ['g/h', '']) ['', 'g'] >>> r = _rootsdirsandparents( ... [(b'relpath', b'r', b''), (b'path', b'p/p', b''), ... (b'path', b'', b'')]) >>> print(r[0:2], sorted(r[2])) # the set has an unstable output (['r', 'p/p', ''], []) ['', 'p'] >>> r = _rootsdirsandparents( ... [(b'relglob', b'rg*', b''), (b're', b're/', b''), ... (b'relre', b'rr', b'')]) >>> print(r[0:2], sorted(r[2])) # the set has an unstable output (['', '', ''], []) [''] )r2 r� �updater r� )r- r� r� rO r# r# r$ r� � s r� c C s dd� | D �}t |�S )z�Returns the potential explicit filenames from the patterns. >>> _explicitfiles([(b'path', b'foo/bar', b'')]) ['foo/bar'] >>> _explicitfiles([(b'rootfilesin', b'foo/bar', b'')]) [] c S s g | ]}|d dvr|�qS )r r1 r# )re rN r# r# r$ rg r6 z"_explicitfiles.<locals>.<listcomp>)r� )r- Zfilabler# r# r$ r� s r� c C s" | D ]\}}}|dvr dS qdS )z:Whether all the patterns match a prefix (i.e. recursively)r FTr# rA r# r# r$ r� # s r� c C s� ddddddd�}d}g }t | d�}tt�|�dd �D �]D\}}d |v r�tsXtj�d �at�|�} | rx|d | �d�� }|� d d �}|� � }|s�q6|� d�r�|dd � � � } z || }W q6 t y� |r�|td�| | f � Y q60 q6|} t�|�D ]\\} } |� | ��r$| } |t| �d � } �qRq�|� | d �r�| } |t| �d d � } �qRq�|�rn|�| | ||f� q6|�| | � q6|�� |S )a. parse a pattern file, returning a list of patterns. These patterns should be given to compile() to be validated and converted into a match function. trailing white space is dropped. the escape character is backslash. comments start with #. empty lines are skipped. lines can be of the following formats: syntax: regexp # defaults following lines to non-rooted regexps syntax: glob # defaults following lines to non-rooted globs re:pattern # non-rooted regular expression glob:pattern # non-rooted glob rootglob:pat # rooted glob (same root as ^ in regexps) pattern # pattern of the current default type if sourceinfo is set, returns a list of tuples: (pattern, lineno, originalline). This is useful to debug ignore patterns. s relre:s relglob:s rootglob:r r )r s regexpr r r r s rbr )�start� #s ((?:^|[^\\])(?:\\\\)*)#.*Ns \#s syntax:� s! %s: ignoring invalid syntax '%s' r� )r r- r Ziterfile� _commentrer r �search�endr �rstripr� �strip�KeyErrorr r Z iteritemsrF r) �close) �filepathrM Z sourceinfoZsyntaxesZsyntaxrJ �fp�lineno�liner" r� Z linesyntaxZrelsr# r# r$ rp . s\ � � rp )NFN)NFN) NNNr NNFNNF)N)N)N)NN)N)F)CZ __future__r r r� r` r� rR r Zi18nr r r � r r r r r Zutilsr Z importrustr� r� rk r� r% r5 r@ rB rH r r\ r^ r_ rb rI �objectrw rU rE r� r� rV r� rW rZ rY rX r� r� r+ rG r� rd r r r� r. r) r' r2 r� r� r� r� r7 rp r# r# r# r$ �<module> s� � � % 4t E%=YE=RS4 T$06 ,