Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3 /
dist-packages /
genshi /
__pycache__ /
[ HOME SHELL ]
Name
Size
Permission
Action
__init__.cpython-310.pyc
632
B
-rw-r--r--
builder.cpython-310.pyc
11.87
KB
-rw-r--r--
compat.cpython-310.pyc
3.35
KB
-rw-r--r--
core.cpython-310.pyc
26.87
KB
-rw-r--r--
input.cpython-310.pyc
15.32
KB
-rw-r--r--
output.cpython-310.pyc
23.89
KB
-rw-r--r--
path.cpython-310.pyc
47.64
KB
-rw-r--r--
util.cpython-310.pyc
6.69
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : path.cpython-310.pyc
o !�b8� � @ s� d Z ddlmZ ddlmZ ddlmZmZ ddlZddl Z ddl m Z ddl Z ddl mZ ddlmZmZmZmZ dd lmZmZmZmZmZmZmZmZm Z d d gZ d Z G d d� de �Z e j!Z!e j"Z"e j#Z#e j$Z$e j%Z%G dd� de �Z&G dd� de �Z'G dd� de �Z(G dd � d e �Z)G dd � d e*�Z+G dd� de �Z,dd� Z-dd � Z.d d � Z/d d � Z0d!d"� Z1G d#d$� d$e �Z2G d%d&� d&e �Z3G d'd(� d(e �Z4G d)d*� d*e �Z5G d+d,� d,e �Z6G d-d.� d.e �Z7G d/d0� d0e �Z8G d1d2� d2e �Z9e6e7e8e9d3�Z:G d4d5� d5e �Z;G d6d7� d7e;�Z<G d8d9� d9e;�Z=G d:d;� d;e;�Z>G d<d=� d=e;�Z?G d>d?� d?e;�Z@G d@dA� dAe;�ZAG dBdC� dCe;�ZBG dDdE� dEe;�ZCG dFdG� dGe;�ZDG dHdI� dIe;�ZEG dJdK� dKe;�ZFG dLdM� dMe;�ZGG dNdO� dOe;�ZHG dPdQ� dQe;�ZIG dRdS� dSe;�ZJG dTdU� dUe;�ZKG dVdW� dWe;�ZLG dXdY� dYe;�ZMG dZd[� d[e;�ZNG d\d]� d]e;�ZOG d^d_� d_e;�ZPi d`e<�dae=�dbe>�dce?�dde@�deeA�dfeB�dgeC�dheD�dieE�djeG�dkeF�dleH�dmeI�dneJ�doeK�dpeL�eMeNeOePdq��ZQG drds� dse �ZRG dtdu� dueR�ZSG dvdw� dweR�ZTG dxdy� dyeR�ZUG dzd{� d{e �ZVG d|d}� d}e �ZWG d~d� de �ZXG d�d�� d�e �ZYG d�d�� d�e �ZZG d�d�� d�e �Z[G d�d�� d�e �Z\G d�d�� d�e �Z]eWeXeZe[e\e]d��Z^e$e2d�d�fZ_e%e2d�d�fZ`dS )�aD Basic support for evaluating XPath expressions against streams. >>> from genshi.input import XML >>> doc = XML('''<doc> ... <items count="4"> ... <item status="new"> ... <summary>Foo</summary> ... </item> ... <item status="closed"> ... <summary>Bar</summary> ... </item> ... <item status="closed" resolution="invalid"> ... <summary>Baz</summary> ... </item> ... <item status="closed" resolution="fixed"> ... <summary>Waz</summary> ... </item> ... </items> ... </doc>''') >>> print(doc.select('items/item[@status="closed" and ' ... '(@resolution="invalid" or not(@resolution))]/summary/text()')) BarBaz Because the XPath engine operates on markup streams (as opposed to tree structures), it only implements a subset of the full XPath 1.0 language. � )�deque)�reduce)�ceil�floorN)�chain)� IS_PYTHON2)�Stream�Attrs� Namespace�QName) �START�END�TEXT�START_NS�END_NS�COMMENT�PI� START_CDATA� END_CDATA�Path�PathSyntaxErrorzrestructuredtext enc @ s0 e Zd ZdZdZdZdZdZdZe dd� �Z d S ) �Axisz7Defines constants for the various supported XPath axes.� attribute�child� descendantzdescendant-or-self�selfc C s t | |�� �dd�d�S )zdReturn the axis constant for the given name, or `None` if no such axis was defined. �-�_N)�getattr�upper�replace)�cls�name� r# �-/usr/lib/python3/dist-packages/genshi/path.py�fornameD s z Axis.fornameN) �__name__� __module__� __qualname__�__doc__� ATTRIBUTE�CHILD� DESCENDANT�DESCENDANT_OR_SELF�SELF� classmethodr% r# r# r# r$ r ; s r c @ �( e Zd Zedd� �Zdd� Zdd� ZdS )�GenericStrategyc C � dS �NTr# �r! �pathr# r# r$ �supportsU s zGenericStrategy.supportsc C � || _ d S �N�r5 �r r5 r# r# r$ �__init__Y � zGenericStrategy.__init__c s� | j }|r(|d d tu rtg| �n5t|d d |d d fg|dd � �n |d d tu s@|d d tu s@|d d tu rFtg| �n|�dg gfgg� d� �fdd� }|S )Nr � � Fc s� | d d� \}}}d }|t u r� r� �� d S |tu s'|tu s'|tu s'|tu r)d S tdd� � d D ��}g } t���d d tkpBd } d} |�r\|� � \} } }�| \}}}|t u s_|t u r|| r|| ru| d d | kru| d d � | � n| � | | f� ||||||�s�qFt� }t| �t|� }d}d}|r�|D ]U}||||||�}t|�tu r�tt| |��D ]+\}}||v r�q�t|�|d k r�|� d� || d7 < || t|�kr�|�|� q�t|�|kr�d}|d7 }|s�d} nq�|s�qFg }| d | k�rd}�d \}}}|tu �r||||||�}|�r|}nD�| d d }|t u �s(|tu �rK|�r6|d d | d k�rB|�| d g |gf� n |d d � |� |tu�rZ| � | d |gf� |sI|tu �rf� � | � |S ) N� c S s g | ] \}}||g f�qS r# r# )�.0�pos�cour# r# r$ � <listcomp>� � z7GenericStrategy.test.<locals>._test.<locals>.<listcomp>���r r= TFr> )r �popr r r r r �lenr* �popleftr, r- �extend�append�set�type�float� enumerater �int�addr. � appendleftr ) �event� namespaces� variables� updateonly�kind�datarA �retval� pos_queue�next_pos�real_len� last_checked�x�pcou�mcou�axis�nodetest� predicates�missed� counters_len�cnum�matched� predicate�pretval�irB � child_counter� next_axis��stack�stepsr# r$ �_tests s� � � � �� � Z z#GenericStrategy.test.<locals>._test�F)r5 r* �_DOTSLASHSLASHr- r+ r, � _DOTSLASH)r �ignore_context�pro r# rl r$ �test\ s * vzGenericStrategy.testN�r& r' r( r/ r6 r; ru r# r# r# r$ r1 S � r1 c @ s, e Zd ZdZedd� �Zdd� Zdd� ZdS ) �SimplePathStrategyzCStrategy for path with only local names, attributes and text nodes.c C sL |d d t u r dS tttf}|D ]\}}}|r dS t||�s# dS qdS )Nr FT)r* � LocalNameTest�CommentNodeTest� TextNodeTest� isinstance)r! r5 � allowed_testsr ra rb r# r# r$ r6 � s �zSimplePathStrategy.supportsc s$ g | _ d}g }dd� � � fdd�}|D ]n}|d tu r<t|�dkr2|d |d d kr1d | _ d S qd }|�|d � q|d tu rJ|�|d � q|d tu rc||�}| j �|||d |f� d S ||�}| j �||d |f� |d g}|d tu rd}qd }q||�}| j �||d |f� d S ) NFc S s0 t | �t |�ur dS t | �tkr| j|jkS dS )z!Tests if two node tests are equalFT)rL ry r" )�node1�node2r# r# r$ � nodes_equal s z0SimplePathStrategy.__init__.<locals>.nodes_equalc s� t | �dkrg S dg}d}tdt | ��D ]4}|dkr6� | | | | �s6||d }|dkr6� | | | | �r#� | | | | �rC|d7 }|�|� q|S )z KMP prefix calculation for tabler r= )rG �rangerJ )�f�pi�sri �r� r# r$ � calculate_pi s � z1SimplePathStrategy.__init__.<locals>.calculate_pir r= rE T)� fragmentsr. rG rJ r+ r* r, )r r5 �self_beginning�fragmentr� r` r� r# r� r$ r; � s8 � zSimplePathStrategy.__init__c s: g ��j ��j�| j� t� ��d� �����fdd� }|S )NFc s� � d u rd S | d d� \}}}|t u r�r�� d S |tu s*|tu s*|tu s*|tu r,d S �s^d}� | d s@|d7 }� | d r6d}�pG|dk} � | d s]�rT|dkr]�||| f� d S n�d \}}} |d ur�| s�� | \} } } } t| �}||kr|n| | |||||�r�|d7 }nd\}}||kr�|d �kr�|d7 }d}d} |d u r�|tu r��||| f� d S | �r � | \} } } } t| �}|dkr�||ks�| | |||||�s�| |d }|dkr�||ks�| | |||||�r�| | |||||�r�|d7 }||k�r|d �k�rn|d7 }d}d} � | d �snnnq�|tu �r=| �s6|d �k�r6||k�r6�d d | f� n�||| f� |d �k�rV||k�rV| �rT| |||||�S dS d S )Nr? r r= rE �NNT)r r r r r rG r )rR rS rT rU rV rW rA �fidrt �ic�fragr� �attribr �frag_len��frags� frags_lenrs rm � stack_pop� stack_pushr# r$ ro J s� � � � �� �� z&SimplePathStrategy.test.<locals>._testrp )rJ rF r� rG �r rs ro r# r� r$ ru ? s nzSimplePathStrategy.testN)r& r' r( r) r/ r6 r; ru r# r# r# r$ rx � s Drx c @ r0 )�SingleStepStrategyc C s t |�dkS �Nr= )rG r4 r# r# r$ r6 � � zSingleStepStrategy.supportsc C r7 r8 r9 r: r# r# r$ r; � r< zSingleStepStrategy.__init__c sd | j ��d d tu rtg� ��d d tu r �d d p d �g � dg�d� ����fdd� }|S )Nr rE r= Fc s� | d d� \}}}|t u r�s�d d8 < d S |tu s)|tu s)|tu s)|tu r+d S �sg�d d tu r;�d dkpV�d d tu oH�d dkpV�d d tu oV�d dk }|tu rc�d d7 < |rgd S �d \}} } | |||||�sxd S | r�d} | D ]8} | |||||�} t | �t u r�t � �| d k r�� � d� � | d7 < � | t | �kr�d} | d7 } | s� d S q~�r��|||||�S dS )Nr? r r= FT)r r r r r r. r+ r, r rL rM rG rJ rO )rR rS rT rU rV rW rA �outsider` ra rb re rg rh ��counters�depthrs � select_attrrn r# r$ ro � sL �� �z&SingleStepStrategy.test.<locals>._testrp )r5 r* rr r� r# r� r$ ru � s /zSingleStepStrategy.testNrv r# r# r# r$ r� � rw r� c @ s@ e Zd ZdZeeefZd dd�Zdd� Z ddd �Z dd d �Z dS )r z�Implements basic XPath support on streams. Instances of this class represent a "compiled" XPath expression, and provide methods for testing the path against a stream, as well as extracting a substream matching that path. NrE c C s` || _ t|||��� | _g | _| jD ]}| jD ]}|�|�r(| j�||�� nqtd��qdS )a) Create the path object from a string. :param text: the path expression :param filename: the name of the file in which the path expression was found (used in error messages) :param lineno: the line on which the expression was found zNo strategy found for pathN) �source� PathParser�parse�paths� strategies� STRATEGIESr6 rJ �NotImplementedError)r �text�filename�linenor5 �strategy_classr# r# r$ r; s ���z Path.__init__c C s| g }| j D ],}g }|D ] \}}}|�d||f � |D ] }|d d| 7 < qq |�d�|�� qdt| �jd�|�f S )Nz%s::%srE z[%s]�/z <%s "%s">�|)r� rJ �joinrL r& )r r� r5 rn r` ra rb rg r# r# r$ �__repr__ s �z Path.__repr__c sJ |du ri }|du r i }t |�}|||f� fdd� }t|� t|dd�d�S )a� Returns a substream of the given stream that matches the path. If there are no matches, this method returns an empty stream. >>> from genshi.input import XML >>> xml = XML('<root><elem><child>Text</child></elem></root>') >>> print(Path('.//child').select(xml)) <child>Text</child> >>> print(Path('.//child/text()').select(xml)) Text :param stream: the stream to select from :param namespaces: (optional) a mapping of namespace prefixes to URIs :param variables: (optional) a mapping of variable names to values :return: the substream matching the path, or an empty stream :rtype: `Stream` Nc 3 s� � � fdd�}�� � }� D ]H}||||�}|du rP|V |d tu rOd}|dkrO|� }|d tu r6|d7 }n |d tu r@|d8 }|V ||||dd� |dks(q |rU|V q d S )Nc s t � �S r8 )�nextr# ��streamr# r$ �<lambda>C s z0Path.select.<locals>._generate.<locals>.<lambda>Tr r= �rU )ru r r ) r� �ns�vs�_nextru rR �resultr� �subevent�r r� r$ � _generateB s. � ����z Path.select.<locals>._generate� serializer)r� )�iterr r )r r� rS rT r� r# r� r$ �select) s �z Path.selectFc s: � fdd�| j D ��t��dkr�d S d �fdd� }|S ) a1 Returns a function that can be used to track whether the path matches a specific stream event. The function returned expects the positional arguments ``event``, ``namespaces`` and ``variables``. The first is a stream event, while the latter two are a mapping of namespace prefixes to URIs, and a mapping of variable names to values, respectively. In addition, the function accepts an ``updateonly`` keyword argument that default to ``False``. If it is set to ``True``, the function only updates its internal state, but does not perform any tests or return a result. If the path matches the event, the function returns the match (for example, a `START` or `TEXT` event.) Otherwise, it returns ``None``. >>> from genshi.input import XML >>> xml = XML('<root><elem><child id="1"/></elem><child id="2"/></root>') >>> test = Path('child').test() >>> namespaces, variables = {}, {} >>> for event in xml: ... if test(event, namespaces, variables): ... print('%s %r' % (event[0], event[1])) START (QName('child'), Attrs([(QName('id'), '2')])) :param ignore_context: if `True`, the path is interpreted like a pattern in XSLT, meaning for example that it will match at any depth :return: a function that can be used to test individual events in a stream against the path :rtype: ``function`` c s g | ]}|� � ��qS r# )ru )r@ r� )rs r# r$ rC w � z Path.test.<locals>.<listcomp>r= r Fc s. d }� D ]}|| |||d�}|d u r|}q|S )Nr� r# )rR rS rT rU rX ru �val)�testsr# r$ �_multi{ s �zPath.test.<locals>._multiNrp )r� rG )r rs r� r# )rs r� r$ ru X s z Path.test�NrE r� rp ) r& r' r( r) r� rx r1 r� r; r� r� ru r# r# r# r$ r s /c @ s e Zd ZdZddd�ZdS )r zEException raised when an XPath expression is syntactically incorrect.NrE c C s4 |r d|||f }t �| |� || _|| _|| _d S )Nz%s (%s, line %d))� Exceptionr; r� r� �offset)r �messager� r� r� r# r# r$ r; � s zPathSyntaxError.__init__)NrE rE )r& r' r( r) r; r# r# r# r$ r � s c @ s� e Zd ZdZdZdZe�dd�dd� eD ��d�d d� eD ��f �j Z d0d d �Z e dd� �Z e dd� �Zdd� Zdd� Zdd� Zdd� Zdd� Zd1d d �Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Z d.d/� Z d S )2r� z)Tokenizes and parses an XPath expression.))�'r� )�"r� )�::�:�..�.�//r� �[�]�()�(�)�@�=�!=�!r� �,�>=�>z<=�<�$z7("[^"]*")|('[^']*')|((?:\d+)?\.\d+)|(%s)|([^%s\s]+)|\s+r� c C s g | ]}t �|��qS r# ��re�escape�r@ �tr# r# r$ rC � r� zPathParser.<listcomp>� c C s g | ] }t �|d ��qS )r r� r� r# r# r$ rC � rD NrE c C s6 || _ || _dd� dd� | �|�D �D �| _d| _d S )Nc S s g | ]}|r|�qS r# r# r� r# r# r$ rC � s �z'PathParser.__init__.<locals>.<listcomp>c S s* g | ]\}}}}}|p|p|p|p|�qS r# r# )r@ �dqstr�sqstr�number�tokenr" r# r# r$ rC � s �r )r� r� � _tokenize�tokensrA )r r� r� r� r# r# r$ r; � s � zPathParser.__init__c C s | j t| j�d kS r� )rA rG r� r� r# r# r$ �at_end� s zPathParser.at_endc C s | j | j S r8 )r� rA r� r# r# r$ � cur_token� r� zPathParser.cur_tokenc C s | j d7 _ | j| j S r� )rA r� r� r# r# r$ � next_token� s zPathParser.next_tokenc C s | j s | j| jd S d S r� )r� r� rA r� r# r# r$ � peek_token� s zPathParser.peek_tokenc C sT | � � g}| jdkr| �� |�| � � � | jdks | js(td| j | j| j��|S )a� Parses the XPath expression and returns a list of location path tests. For union expressions (such as `*|text()`), this function returns one test for each operand in the union. For patch expressions that don't use the union operator, the function always returns a list of size 1. Each path test in turn is a sequence of tests that correspond to the location steps, each tuples of the form `(axis, testfunc, predicates)` r� z+Unexpected token %r after end of expression)�_location_pathr� r� rJ r� r r� r� )r r� r# r# r$ r� � s ���zPathParser.parsec C s� g } | j �d�rJ|s8| j dkr0| �� | �� \}}}|�t||f� | js,| j �d�s/ |S qtd| j| j ��| j dkrF|�tt � g f� | �� | �� \}}}|sUt }|�|||f� | jsf| j �d�si |S q)NTr� r� z%Absolute location paths not supported) r� � startswithr� �_location_steprJ r- r� r r� r� �NodeTestr+ )r rn r` ra rb r# r# r$ r� � s: ��� �zPathParser._location_pathc C s� | j dkr t}| �� n:| j dkrt}n2| j dkr!td| j| j��| �� dkrDt� | j �}|d u r;td| | j| j��| �� | �� nd }| � |pKt �}g }| j dkr`|� | � � � | j dksT|||fS )Nr� r� r� zUnsupported axis "parent"r� zUnsupport axis "%s"r� )r� r* r� r. r r� r� r� r r% � _node_testr+ rJ � _predicate)r r` ra rb r# r# r$ r� � s0 � � � zPathParser._location_stepc C s� d }}| � � }|dv r| �� }n9|dkr1| j}| �� | �� }|dkr*t||�}n t|||�}n| jdkr;t|�}n| jdkrDt� }nt|| j�}| j sQ| �� |S )N)r� r� r� �*r� ) r� � _node_typer� r� �QualifiedPrincipalTypeTest�QualifiedNameTest�PrincipalTypeTestr� ry r� )r r` ru �prefixr� � localnamer# r# r$ r� s& zPathParser._node_testc C s� | j }| �� g }| j dkr0| �� | j dkr0| j }|d |d f| jv r+|dd� }|�|� t�|�}|sAtd| | j| j��||� S )Nr� r� r rE r= z%s() not allowed here) r� r� �_QUOTESrJ � _nodetest_map�getr r� r� )r r" �args�stringr! r# r# r$ r� s �zPathParser._node_typec C sP | j dksJ �| �� | �� }| j dkr td| j | j| j��| js&| �� |S )Nr� r� z/Expected "]" to close predicate, but found "%s")r� r� �_or_exprr r� r� r� �r �exprr# r# r$ r� 3 s ��zPathParser._predicatec C �6 | � � }| jdkr| �� t|| � � �}| jdks |S )N�or)� _and_exprr� r� � OrOperatorr� r# r# r$ r� ? � �zPathParser._or_exprc C r� )N�and)�_equality_exprr� r� � AndOperatorr� r# r# r$ r F r zPathParser._and_exprc C �@ | � � }| jdv r t| j }| �� ||| � � �}| jdv s |S )N)r� r� )�_relational_exprr� � _operator_mapr� �r r� �opr# r# r$ r M � �zPathParser._equality_exprc C r )N)r� r� r� r� )� _sub_exprr� r r� r r# r# r$ r U r zPathParser._relational_exprc C sR | j }|dkr | �� S | �� | �� }| j dkr#td| j | j| j��| �� |S )Nr� r� z4Expected ")" to close sub-expression, but found "%s")r� � _primary_exprr� r� r r� r� )r r� r� r# r# r$ r ] s ��zPathParser._sub_exprc C s� | j }t|�dkr |d |d f| jv r | �� t|dd� �S |d �� s,|d dkr6| �� tt|��S |dkrF| �� }| �� t|�S | j sT| � � � d�rT| � � S d }|dkr`t }| �� | �|�S )Nr= r rE r� r� r� r� )r� rG r� r� � StringLiteral�isdigit� NumberLiteral�as_float�VariableReferencer� r� r� �_function_callr* r� )r r� r` r# r# r$ r j s$ " zPathParser._primary_exprc C s� | j }| �� dkr g }n5| j dksJ �| �� | �� g}| j dkr1| �� |�| �� � | j dks!| j dksAtd| j | j| j��| �� t�|�}|sVtd| | j| j��||� S )Nr� r� r� r� z<Expected ")" to close function argument list, but found "%s"zUnsupported function "%s") r� r� r� rJ r r� r� � _function_mapr� )r r" r� r! r# r# r$ r s. � �� �zPathParser._function_callr� r8 ) r& r' r( r) r� �_TOKENSr� �compiler� �findallr� r; �propertyr� r� r� r� r� r� r� r� r� r� r� r r r r r r r# r# r# r$ r� � s< �� r� c C s* t | t�rt| �dks J �| d d S | S )zConvert value to a scalar. If a single element Attrs() object is passed the value of the single attribute will be returned.r= r )r| r rG ��valuer# r# r$ � as_scalar� s r c C � t t| ��S r8 )rM r r r# r# r$ r � s r c C s t rtnt}|t| ��S r8 )r �longrO r )r �long_clsr# r# r$ �as_long� s r c C s t | �} | du r dS t�| �S )NFr� )r �six� text_typer r# r# r$ � as_string� s r" c C r r8 )�boolr r r# r# r$ �as_bool� � r$ c @ �. e Zd ZdZdgZdd� Zdd� Zdd� Zd S ) r� z?Node test that matches any event with the given principal type.�principal_typec C r7 r8 )r' )r r' r# r# r$ r; � r< zPrincipalTypeTest.__init__c C s& |t u r| jtu r|d pd S dS d S )Nr= T)r r' r* �r rV rW rA rS rT r# r# r$ �__call__� s �zPrincipalTypeTest.__call__c C r2 )Nr� r# r� r# r# r$ r� � � zPrincipalTypeTest.__repr__N�r& r' r( r) � __slots__r; r) r� r# r# r# r$ r� � s r� c @ �0 e Zd ZdZddgZdd� Zdd� Zdd � Zd S ) r� z[Node test that matches any event with the given principal type in a specific namespace.r' r� c C � || _ || _d S r8 )r' r� )r r' r� r# r# r$ r; � � z#QualifiedPrincipalTypeTest.__init__c sX t |�| j��� |tu r*| jtu r$|d r$t� fdd�|d D ��p#d S |d � v S d S )Nr= c s g | ] \}}|� v r||f�qS r# r# )r@ r" r �� namespacer# r$ rC � s �z7QualifiedPrincipalTypeTest.__call__.<locals>.<listcomp>r )r r� r� r r' r* r r( r# r0 r$ r) � s � �z#QualifiedPrincipalTypeTest.__call__c C � d| j S )Nz%s:*)r� r� r# r# r$ r� � r< z#QualifiedPrincipalTypeTest.__repr__Nr+ r# r# r# r$ r� � s r� c @ r- ) ry zWNode test that matches any event with the given principal type and local name. r' r" c C r. r8 )r' r" )r r' r" r# r# r$ r; � r/ zLocalNameTest.__init__c C sP |t u r&| jtu r | j|d v r t| j|d �| j�fg�S |d j| jkS d S )Nr= r )r r' r* r" r r� r� r( r# r# r$ r) � s �zLocalNameTest.__call__c C � | j S r8 �r" r� r# r# r$ r� � � zLocalNameTest.__repr__Nr+ r# r# r# r$ ry � s ry c @ �0 e Zd ZdZg d�Zdd� Zdd� Zdd� Zd S ) r� z[Node test that matches any event with the given principal type and qualified name. �r' r� r" c C � || _ || _|| _d S r8 r7 )r r' r� r" r# r# r$ r; � � zQualifiedNameTest.__init__c C s` t d|�| j�| jf �}|tu r.| jtu r(||d v r(t||d �|�fg�S |d |kS d S )Nz%s}%sr= r )r r� r� r" r r' r* r )r rV rW rA rS rT �qnamer# r# r$ r) � s �zQualifiedNameTest.__call__c C � d| j | jf S )Nz%s:%s)r� r" r� r# r# r$ r� � � zQualifiedNameTest.__repr__Nr+ r# r# r# r$ r� � � r� c @ �$ e Zd ZdZg Zdd� Zdd� ZdS )rz z*Node test that matches any comment events.c C � |t u S r8 )r r( r# r# r$ r) � � zCommentNodeTest.__call__c C r2 )Nz comment()r# r� r# r# r$ r� � r* zCommentNodeTest.__repr__N�r& r' r( r) r, r) r� r# r# r# r$ rz � � rz c @ r> )r� z Node test that matches any node.c C s |t u rdS |||fS r3 �r r( r# r# r$ r) s zNodeTest.__call__c C r2 )Nznode()r# r� r# r# r$ r� r* zNodeTest.__repr__NrA r# r# r# r$ r� s r� c @ s0 e Zd ZdZdgZd dd�Zdd� Zdd � ZdS ) � ProcessingInstructionNodeTestz8Node test that matches any processing instruction event.�targetNc C r7 r8 �rE )r rE r# r# r$ r; r< z&ProcessingInstructionNodeTest.__init__c C s |t u o| j p|d | jkS �Nr )r rE r( r# r# r$ r) s z&ProcessingInstructionNodeTest.__call__c C s d}| j r d| j d }d| S )Nr� r� zprocessing-instruction(%s)rF )r �argr# r# r$ r� s z&ProcessingInstructionNodeTest.__repr__r8 r+ r# r# r# r$ rD s rD c @ r> )r{ z&Node test that matches any text event.c C r? r8 )r r( r# r# r$ r) r@ zTextNodeTest.__call__c C r2 )Nztext()r# r� r# r# r$ r� r* zTextNodeTest.__repr__NrA r# r# r# r$ r{ rB r{ )�comment�nodezprocessing-instructionr� c @ � e Zd ZdZdS )�Functionz3Base class for function nodes in XPath expressions.N�r& r' r( r) r# r# r# r$ rL ' � rL c @ s2 e Zd ZdZdgZeZdd� Zdd� Zdd� Z d S ) �BooleanFunctionzPThe `boolean` function, which converts its argument to a boolean value. r� c C r7 r8 �r� r� r# r# r$ r; 0 r< zBooleanFunction.__init__c C � | � |||||�}t|�S r8 )r� r$ �r rV rW rA rS rT r� r# r# r$ r) 2 � zBooleanFunction.__call__c C r2 )Nz boolean(%r)rP r� r# r# r$ r� 5 r< zBooleanFunction.__repr__N) r& r' r( r) r, r# � _return_typer; r) r� r# r# r# r$ rO * s rO c @ r& ) �CeilingFunctionzeThe `ceiling` function, which returns the nearest lower integer number for the given number. r� c C r7 r8 �r� �r r� r# r# r$ r; = r< zCeilingFunction.__init__c C � | � |||||�}tt|��S r8 )r� r r �r rV rW rA rS rT r� r# r# r$ r) ? � zCeilingFunction.__call__c C r2 )Nz ceiling(%r)rV r� r# r# r$ r� B r< zCeilingFunction.__repr__Nr+ r# r# r# r$ rU 8 � rU c @ r& ) �ConcatFunctionzoThe `concat` function, which concatenates (joins) the variable number of strings it gets as arguments. �exprsc G r7 r8 )r] )r r] r# r# r$ r; J r< zConcatFunction.__init__c s> g }� ����fdd�| j D �D ] }|�t|�� qd�|�S )Nc s g | ] }|�� �����qS r# r# �r@ r� �rW rV rS rA rT r# r$ rC N s �z+ConcatFunction.__call__.<locals>.<listcomp>r� )r] rJ r" r� )r rV rW rA rS rT �strings�itemr# r_ r$ r) L s � zConcatFunction.__call__c C s dd� dd� | jD �� S )Nz concat(%s)z, c S � g | ]}t |��qS r# )�reprr^ r# r# r$ rC S � z+ConcatFunction.__repr__.<locals>.<listcomp>)r� r] r� r# r# r$ r� R s zConcatFunction.__repr__Nr+ r# r# r# r$ r\ E s r\ c @ r- ) �ContainsFunctionz\The `contains` function, which returns whether a string contains a given substring. �string1�string2c C r. r8 �rf rg �r rf rg r# r# r$ r; Z r/ zContainsFunction.__init__c C s4 | � |||||�}| �|||||�}t|�t|�v S r8 )rf rg r" �r rV rW rA rS rT rf rg r# r# r$ r) ] � zContainsFunction.__call__c C r; �Nzcontains(%r, %r)rh r� r# r# r$ r� a r< zContainsFunction.__repr__Nr+ r# r# r# r$ re U � re c @ sP e Zd ZdZddgZejejejej d�Z ddd�Z dd � Z d d � Z d d � ZdS )�MatchesFunctionz]The `matches` function, which returns whether a string matches a regular expression. rf rg )r� �mri r] r� c C s || _ || _| �|�| _d S r8 )rf rg � _map_flags�flags)r rf rg rq r# r# r$ r; k s zMatchesFunction.__init__c C s< t | �|||||��}t | �|||||��}t�||| j�S r8 )r" rf rg r� �searchrq rj r# r# r$ r) o s zMatchesFunction.__call__c s t tj� fdd�|D �tj�S )Nc s g | ]}� j | �qS r# )�flag_map)r@ �flagr� r# r$ rC u r� z.MatchesFunction._map_flags.<locals>.<listcomp>)r �operator�or_r� �U)r rq r# r� r$ rp s s �zMatchesFunction._map_flagsc C r; rl rh r� r# r# r$ r� v r< zMatchesFunction.__repr__N)r� )r& r' r( r) r, r� �S�M�I�X� flag_mappingr; r) rp r� r# r# r# r$ rn d s rn c @ r> )� FalseFunctionzEThe `false` function, which always returns the boolean `false` value.c C r2 �NFr# r( r# r# r$ r) | r* zFalseFunction.__call__c C r2 )Nzfalse()r# r� r# r# r$ r� ~ r* zFalseFunction.__repr__NrA r# r# r# r$ r} y rB r} c @ r& ) � FloorFunctionzfThe `ceiling` function, which returns the nearest higher integer number for the given number. r� c C r7 r8 rV rW r# r# r$ r; � r< zFloorFunction.__init__c C rX r8 )r� r r rY r# r# r$ r) � rZ zFloorFunction.__call__c C r2 )Nz floor(%r)rV r� r# r# r$ r� � r< zFloorFunction.__repr__Nr+ r# r# r# r$ r � r[ r c @ r> )�LocalNameFunctionzXThe `local-name` function, which returns the local name of the current element. c C � |t u r |d jS d S rG )r r� r( r# r# r$ r) � � �zLocalNameFunction.__call__c C r2 )Nz local-name()r# r� r# r# r$ r� � r* zLocalNameFunction.__repr__NrA r# r# r# r$ r� � � r� c @ r> )� NameFunctionzVThe `name` function, which returns the qualified name of the current element. c C s |t u r|d S d S rG rC r( r# r# r$ r) � s �zNameFunction.__call__c C r2 )Nzname()r# r� r# r# r$ r� � r* zNameFunction.__repr__NrA r# r# r# r$ r� � r� r� c @ r> )�NamespaceUriFunctionz^The `namespace-uri` function, which returns the namespace URI of the current element. c C r� rG )r r1 r( r# r# r$ r) � r� z NamespaceUriFunction.__call__c C r2 )Nznamespace-uri()r# r� r# r# r$ r� � r* z NamespaceUriFunction.__repr__NrA r# r# r# r$ r� � r� r� c @ r& ) � NotFunctionzUThe `not` function, which returns the negated boolean value of its argument. r� c C r7 r8 rP r� r# r# r$ r; � r< zNotFunction.__init__c C s t | �|||||�� S r8 )r$ r� r( r# r# r$ r) � s zNotFunction.__call__c C r2 )Nznot(%s)rP r� r# r# r$ r� � r< zNotFunction.__repr__Nr+ r# r# r# r$ r� � s r� c @ s: e Zd ZdZdgZe�d�jZdd� Z dd� Z dd � Z d S ) �NormalizeSpaceFunctionz�The `normalize-space` function, which removes leading and trailing whitespace in the given string, and replaces multiple adjacent whitespace characters inside the string with a single space. r� z\s{2,}c C r7 r8 rP r� r# r# r$ r; � r< z NormalizeSpaceFunction.__init__c C s& | � |||||�}| �dt|��� �S )N� )r� � _normalizer" �strip�r rV rW rA rS rT r� r# r# r$ r) � s z NormalizeSpaceFunction.__call__c C s dt | j� S )Nznormalize-space(%s))rc r� r� r# r# r$ r� � s z NormalizeSpaceFunction.__repr__N) r& r' r( r) r, r� r �subr� r; r) r� r# r# r# r$ r� � s r� c @ r& ) �NumberFunctionz=The `number` function that converts its argument to a number.r� c C r7 r8 rP r� r# r# r$ r; � r< zNumberFunction.__init__c C rQ r8 )r� r rR r# r# r$ r) � rS zNumberFunction.__call__c C r2 )Nz number(%r)rP r� r# r# r$ r� � r< zNumberFunction.__repr__Nr+ r# r# r# r$ r� � s r� c @ r& ) � RoundFunctionz]The `round` function, which returns the nearest integer number for the given number. r� c C r7 r8 rV rW r# r# r$ r; � r< zRoundFunction.__init__c C rX r8 )r� �roundr rY r# r# r$ r) � rZ zRoundFunction.__call__c C r2 )Nz round(%r)rV r� r# r# r$ r� � r< zRoundFunction.__repr__Nr+ r# r# r# r$ r� � r[ r� c @ r- ) �StartsWithFunctionzbThe `starts-with` function that returns whether one string starts with a given substring. rf rg c C r. r8 rh ri r# r# r$ r; � r/ zStartsWithFunction.__init__c C s6 | � |||||�}| �|||||�}t|��t|��S r8 )rf rg r" r� rj r# r# r$ r) � s zStartsWithFunction.__call__c C r; )Nzstarts-with(%r, %r)rh r� r# r# r$ r� � r< zStartsWithFunction.__repr__Nr+ r# r# r# r$ r� � rm r� c @ r& ) �StringLengthFunctionzRThe `string-length` function that returns the length of the given string. r� c C r7 r8 rP r� r# r# r$ r; � r< z StringLengthFunction.__init__c C rX r8 )r� rG r" r� r# r# r$ r) � rZ z StringLengthFunction.__call__c C r2 )Nzstring-length(%r)rP r� r# r# r$ r� � r< z StringLengthFunction.__repr__Nr+ r# r# r# r$ r� � r[ r� c @ s2 e Zd ZdZg d�Zd dd�Zdd� Zdd � ZdS ) �SubstringFunctionz�The `substring` function that returns the part of a string that starts at the given offset, and optionally limited to the given length. �r� �start�lengthNc C r8 r8 r� )r r� r� r� r# r# r$ r; r9 zSubstringFunction.__init__c C sd | � |||||�}| �|||||�}d}| jd ur"| �|||||�}|t|�tt|��t|� � S rG )r� r� r� r rG r" ) r rV rW rA rS rT r� r� r� r# r# r$ r) s zSubstringFunction.__call__c C s. | j d urd| j| j| j f S d| j| jf S )Nzsubstring(%r, %r, %r)zsubstring(%r, %r))r� r� r� r� r# r# r$ r� s �zSubstringFunction.__repr__r8 r+ r# r# r# r$ r� � s r� c @ r- ) �SubstringAfterFunctionzrThe `substring-after` function that returns the part of a string that is found after the given substring. rf rg c C r. r8 rh ri r# r# r$ r; r/ z SubstringAfterFunction.__init__c C sV t | �|||||��}t | �|||||��}|�|�}|dkr)||t|� d � S dS �Nr r� )r" rf rg �findrG � r rV rW rA rS rT rf rg �indexr# r# r$ r) s z SubstringAfterFunction.__call__c C r; �Nzsubstring-after(%r, %r)rh r� r# r# r$ r� $ r< z SubstringAfterFunction.__repr__Nr+ r# r# r# r$ r� � r� c @ r- ) �SubstringBeforeFunctionztThe `substring-before` function that returns the part of a string that is found before the given substring. rf rg c C r. r8 rh ri r# r# r$ r; , r/ z SubstringBeforeFunction.__init__c C sN t | �|||||��}t | �|||||��}|�|�}|dkr%|d |� S dS r� )r" rf rg r� r� r# r# r$ r) / s z SubstringBeforeFunction.__call__c C r; r� rh r� r# r# r$ r� 6 r< z SubstringBeforeFunction.__repr__Nr+ r# r# r# r$ r� ' r� r� c @ r6 ) �TranslateFunctionznThe `translate` function that translates a set of characters in a string to target set of characters. �r� � fromchars�tocharsc C r8 r8 r� )r r� r� r� r# r# r$ r; > r9 zTranslateFunction.__init__c C sn t | �|||||��}t | �|||||��}t | �|||||��}ttdd� |D �dd� |D ���} |�| �S )Nc S rb r# ��ord�r@ �cr# r# r$ rC F rd z.TranslateFunction.__call__.<locals>.<listcomp>c S rb r# r� r� r# r# r$ rC G rd )r" r� r� r� �dict�zip� translate) r rV rW rA rS rT r� r� r� �tabler# r# r$ r) B s � zTranslateFunction.__call__c C s d| j | j| jf S )Nztranslate(%r, %r, %r)r� r� r# r# r$ r� I s �zTranslateFunction.__repr__Nr+ r# r# r# r$ r� 9 r= r� c @ r> )� TrueFunctionzCThe `true` function, which always returns the boolean `true` value.c C r2 r3 r# r( r# r# r$ r) P r* zTrueFunction.__call__c C r2 )Nztrue()r# r� r# r# r$ r� R r* zTrueFunction.__repr__NrA r# r# r# r$ r� M rB r� �boolean�ceiling�concat�contains�matches�falser z local-namer" z namespace-uriznormalize-space�notr� r� z starts-withz string-length� substring)zsubstring-afterzsubstring-beforer� �truec @ rK )�Literalz&Abstract base class for literal nodes.NrM r# r# r# r$ r� d rN r� c @ r& ) r zA string literal node.r� c C r7 r8 �r� )r r� r# r# r$ r; j r< zStringLiteral.__init__c C r3 r8 r� r( r# r# r$ r) l r5 zStringLiteral.__call__c C r2 )Nz"%s"r� r� r# r# r$ r� n r< zStringLiteral.__repr__Nr+ r# r# r# r$ r g � r c @ r& ) r zA number literal node.r� c C r7 r8 rV rW r# r# r$ r; t r< zNumberLiteral.__init__c C r3 r8 rV r( r# r# r$ r) v r5 zNumberLiteral.__call__c C � t | j�S r8 )�strr� r� r# r# r$ r� x r< zNumberLiteral.__repr__Nr+ r# r# r# r$ r q r� r c @ r& ) r zA variable reference node.r" c C r7 r8 r4 )r r" r# r# r$ r; ~ r< zVariableReference.__init__c C s |� | j�S r8 )r� r" r( r# r# r$ r) � r% zVariableReference.__call__c C r� r8 )r� r" r� r# r# r$ r� � r< zVariableReference.__repr__Nr+ r# r# r# r$ r { r� r c @ r- ) r zThe boolean operator `and`.�lval�rvalc C r. r8 �r� r� �r r� r� r# r# r$ r; � r/ zAndOperator.__init__c C s8 t | �|||||��}|sdS | �|||||�}t |�S r~ �r$ r� r� �r rV rW rA rS rT r� r� r# r# r$ r) � � zAndOperator.__call__c C r; )Nz %s and %sr� r� r# r# r$ r� � r< zAndOperator.__repr__Nr+ r# r# r# r$ r � � r c @ r- ) �EqualsOperatorzThe equality operator `=`.r� r� c C r. r8 r� r� r# r# r$ r; � r/ zEqualsOperator.__init__c C s4 t | �|||||��}t | �|||||��}||kS r8 �r r� r� r� r# r# r$ r) � � zEqualsOperator.__call__c C r; )Nz%s=%sr� r� r# r# r$ r� � r< zEqualsOperator.__repr__Nr+ r# r# r# r$ r� � � r� c @ r- ) �NotEqualsOperatorzThe equality operator `!=`.r� r� c C r. r8 r� r� r# r# r$ r; � r/ zNotEqualsOperator.__init__c C s4 t | �|||||��}t | �|||||��}||kS r8 r� r� r# r# r$ r) � r� zNotEqualsOperator.__call__c C r; )Nz%s!=%sr� r� r# r# r$ r� � r< zNotEqualsOperator.__repr__Nr+ r# r# r# r$ r� � r� r� c @ r- ) r zThe boolean operator `or`.r� r� c C r. r8 r� r� r# r# r$ r; � r/ zOrOperator.__init__c C s8 t | �|||||��}|rdS | �|||||�}t |�S r3 r� r� r# r# r$ r) � r� zOrOperator.__call__c C r; )Nz%s or %sr� r� r# r# r$ r� � r< zOrOperator.__repr__Nr+ r# r# r# r$ r � r� r c @ r- ) �GreaterThanOperatorz+The relational operator `>` (greater than).r� r� c C r. r8 r� r� r# r# r$ r; � r/ z GreaterThanOperator.__init__c C s4 | � |||||�}| �|||||�}t|�t|�kS r8 �r� r� r r� r# r# r$ r) � rk z GreaterThanOperator.__call__c C r; )Nz%s>%sr� r� r# r# r$ r� � r< z GreaterThanOperator.__repr__Nr+ r# r# r# r$ r� � r� r� c @ r- ) �GreaterThanOrEqualOperatorz5The relational operator `>=` (greater than or equal).r� r� c C r. r8 r� r� r# r# r$ r; � r/ z#GreaterThanOrEqualOperator.__init__c C s4 | � |||||�}| �|||||�}t|�t|�kS r8 r� r� r# r# r$ r) � rk z#GreaterThanOrEqualOperator.__call__c C r; )Nz%s>=%sr� r� r# r# r$ r� � r< z#GreaterThanOrEqualOperator.__repr__Nr+ r# r# r# r$ r� � r� r� c @ r- ) �LessThanOperatorz(The relational operator `<` (less than).r� r� c C r. r8 r� r� r# r# r$ r; � r/ zLessThanOperator.__init__c C s4 | � |||||�}| �|||||�}t|�t|�k S r8 r� r� r# r# r$ r) � rk zLessThanOperator.__call__c C r; )Nz%s<%sr� r� r# r# r$ r� � r< zLessThanOperator.__repr__Nr+ r# r# r# r$ r� � r� r� c @ r- ) �LessThanOrEqualOperatorz2The relational operator `<=` (less than or equal).r� r� c C r. r8 r� r� r# r# r$ r; � r/ z LessThanOrEqualOperator.__init__c C s4 | � |||||�}| �|||||�}t|�t|�kS r8 r� r� r# r# r$ r) � rk z LessThanOrEqualOperator.__call__c C r; )Nz%s<=%sr� r� r# r# r$ r� � r< z LessThanOrEqualOperator.__repr__Nr+ r# r# r# r$ r� � r� r� )r� r� r� r� r� r� r# )ar) � collectionsr � functoolsr �mathr r ru r� � itertoolsr r � genshi.compatr � genshi.corer r r r r r r r r r r r r �__all__� __docformat__�objectr r* r+ r, r- r. r1 rx r� r r� r r� r r r r" r$ r� r� ry r� rz r� rD r{ r� rL rO rU r\ re rn r} r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r r r r� r� r r� r� r� r� r rq rr r# r# r# r$ �<module> s� , PF � ��������������� � �
Close
