Your IP : 216.73.216.213

Current Path : /opt/alt/python35/lib/python3.5/site-packages/docutils/__pycache__/
Upload File :
Current File : //opt/alt/python35/lib/python3.5/site-packages/docutils/__pycache__/statemachine.cpython-35.pyc



��]��@s&dZdZddlZddlZddlZddlZddlmZddlm	Z	Gdd�d�Z
Gdd	�d	�ZGd
d�de
�ZGdd
�d
e�Z
Gdd�d�ZGdd�dee
�ZGdd�dee�ZGdd�d�ZGdd�de�ZGdd�de�ZGdd�de�ZGdd�de�ZGdd�de�ZGd d!�d!e�ZGd"d#�d#e�ZGd$d%�d%e�ZGd&d'�d'e�ZGd(d)�d)e�ZGd*d+�d+e�Zd,d-ejd.�d/d0�Zd1d2�Z dS)3a

A finite state machine specialized for regular-expression-based text filters,
this module defines the following classes:

- `StateMachine`, a state machine
- `State`, a state superclass
- `StateMachineWS`, a whitespace-sensitive version of `StateMachine`
- `StateWS`, a state superclass for use with `StateMachineWS`
- `SearchStateMachine`, uses `re.search()` instead of `re.match()`
- `SearchStateMachineWS`, uses `re.search()` instead of `re.match()`
- `ViewList`, extends standard Python lists.
- `StringList`, string-specific ViewList.

Exception classes:

- `StateMachineError`
- `UnknownStateError`
- `DuplicateStateError`
- `UnknownTransitionError`
- `DuplicateTransitionError`
- `TransitionPatternNotFound`
- `TransitionMethodNotFound`
- `UnexpectedIndentationError`
- `TransitionCorrection`: Raised to switch to another transition.
- `StateCorrection`: Raised to switch to another state & transition.

Functions:

- `string2lines()`: split a multi-line string into a list of one-line strings


How To Use This Module
======================
(See the individual classes, methods, and attributes for details.)

1. Import it: ``import statemachine`` or ``from statemachine import ...``.
   You will also need to ``import re``.

2. Derive a subclass of `State` (or `StateWS`) for each state in your state
   machine::

       class MyState(statemachine.State):

   Within the state's class definition:

   a) Include a pattern for each transition, in `State.patterns`::

          patterns = {'atransition': r'pattern', ...}

   b) Include a list of initial transitions to be set up automatically, in
      `State.initial_transitions`::

          initial_transitions = ['atransition', ...]

   c) Define a method for each transition, with the same name as the
      transition pattern::

          def atransition(self, match, context, next_state):
              # do something
              result = [...]  # a list
              return context, next_state, result
              # context, next_state may be altered

      Transition methods may raise an `EOFError` to cut processing short.

   d) You may wish to override the `State.bof()` and/or `State.eof()` implicit
      transition methods, which handle the beginning- and end-of-file.

   e) In order to handle nested processing, you may wish to override the
      attributes `State.nested_sm` and/or `State.nested_sm_kwargs`.

      If you are using `StateWS` as a base class, in order to handle nested
      indented blocks, you may wish to:

      - override the attributes `StateWS.indent_sm`,
        `StateWS.indent_sm_kwargs`, `StateWS.known_indent_sm`, and/or
        `StateWS.known_indent_sm_kwargs`;
      - override the `StateWS.blank()` method; and/or
      - override or extend the `StateWS.indent()`, `StateWS.known_indent()`,
        and/or `StateWS.firstknown_indent()` methods.

3. Create a state machine object::

       sm = StateMachine(state_classes=[MyState, ...],
                         initial_state='MyState')

4. Obtain the input text, which needs to be converted into a tab-free list of
   one-line strings. For example, to read text from a file called
   'inputfile'::

       input_string = open('inputfile').read()
       input_lines = statemachine.string2lines(input_string)

5. Run the state machine on the input text and collect the results, a list::

       results = sm.run(input_lines)

6. Remove any lingering circular references::

       sm.unlink()
Zrestructuredtext�N)�utils)�ErrorOutputc@sWeZdZdZddd�Zdd�Zddddd	d
�Zddd�Zd
dd�Zdd�Z	dd�Z
dd�Zd
dd�Zdd�Z
dd�Zdd�Zdd�Zdd d!�Zd"d#�Zdd$d%�Zdd&d'�Zd(d)�Zd*d+�Zd,d-�Zd.d/�Zd0d1�Zd2d3�Zd4d5�ZdS)6�StateMachinea�
    A finite state machine for text filters using regular expressions.

    The input is provided in the form of a list of one-line strings (no
    newlines). States are subclasses of the `State` class. Transitions consist
    of regular expression patterns and transition methods, and are defined in
    each state.

    The state machine is started with the `run()` method, which returns the
    results of processing in a list.
    FcCsnd|_d|_d|_d|_||_||_||_i|_|j|�g|_	t
�|_dS)a+
        Initialize a `StateMachine` object; add state objects.

        Parameters:

        - `state_classes`: a list of `State` (sub)classes.
        - `initial_state`: a string, the class name of the initial state.
        - `debug`: a boolean; produce verbose output if true (nonzero).
        Nr����)�input_lines�input_offset�line�line_offset�debug�
initial_state�
current_state�states�
add_states�	observersr�_stderr)�self�
state_classesrr�r�F/opt/alt/python35/lib/python3.5/site-packages/docutils/statemachine.py�__init__�s								
	zStateMachine.__init__cCs7x't|jj��D]}|j�qWd|_dS)z9Remove circular references to objects no longer required.N)�listr�values�unlink)r�staterrrr�szStateMachine.unlinkrNcCs|j�t|t�r%||_nt|d|�|_||_d
|_|pX|j|_|jr�t	d|jdj
|j�fd|j�d}g}|j�}yB|jr�t	dd|j�|j
|�\}}	|j|	�x�y�ys|j�|jrF|jj|j�\}
}t	d|
||jfd|j�|j|||�\}}}	WnUtk
r�|jr�t	d	|jjd|j�|j|�}	|j|	�PYnX|j|	�Wntk
r?}
zR|j�|
jd
f}|jr*t	d|jj|d
fd|j�w�WYdd}
~
Xn�tk
r�}
zt|j�|
jd
}t|
j�dkr�d}n|
jdf}|jr�t	d||d
fd|j�WYdd}
~
XnXd}|j|�}q�WWn|jr|j��YnXg|_|S)a�
        Run the state machine on `input_lines`. Return results (a list).

        Reset `self.line_offset` and `self.current_state`. Run the
        beginning-of-file transition. Input one line at a time and check for a
        matching transition. If a match is found, call the transition method
        and possibly change the state. Store the context returned by the
        transition method to be passed on to the next transition matched.
        Accumulate the results returned by the transition methods in a list.
        Run the end-of-file transition. Finally, return the accumulated
        results.

        Parameters:

        - `input_lines`: a list of strings without newlines, or `StringList`.
        - `input_offset`: the line offset of `input_lines` from the beginning
          of the file.
        - `context`: application-specific storage.
        - `input_source`: name or path of source of `input_lines`.
        - `initial_state`: name of initial state.
        �sourcerz5
StateMachine.run: input_lines (line_offset=%s):
| %sz
| �fileNz!
StateMachine.run: bof transitionz4
StateMachine.run: line (source=%r, offset=%r):
| %sz$
StateMachine.run: %s.eof transitionrzE
StateMachine.run: TransitionCorrection to state "%s", transition %s.z@
StateMachine.run: StateCorrection to state "%s", transition %s.r)�runtime_init�
isinstance�
StringListrrr
rr
r�print�joinr�	get_state�bof�extend�	next_line�infor	�
check_line�EOFError�	__class__�__name__�eof�TransitionCorrection�
previous_line�args�StateCorrection�len�errorr)rrr�contextZinput_sourcer�transitions�resultsr�resultr�offset�
next_stateZ	exceptionrrr�run�s�
			&	

		
	

	!

		.	
	zStateMachine.runcCs�|rP|jrG||jkrGtd|j||j�fd|j�||_y|j|jSWn!tk
r�t|j��YnXdS)z�
        Return current state object; set it first if `next_state` given.

        Parameter `next_state`: a string, the name of the next state.

        Exception: `UnknownStateError` raised if `next_state` unknown.
        zJ
StateMachine.get_state: Changing state from "%s" to "%s" (input line %s).rN)rr
r �abs_line_numberrr�KeyError�UnknownStateError)rr7rrrr"s		
zStateMachine.get_statercCsgzUy&|j|7_|j|j|_Wn!tk
rLd|_t�YnX|jSWd|j�XdS)z9Load `self.line` with the `n`'th next line and return it.N)r
rr	�
IndexErrorr(�notify_observers)r�nrrrr%.s
	zStateMachine.next_linecCs:y|j|jdj�SWntk
r5dSYnXdS)z3Return 1 if the next line is blank or non-existant.rN)rr
�stripr<)rrrr�is_next_line_blank;s
zStateMachine.is_next_line_blankcCs|jt|j�dkS)z0Return 1 if the input is at or past end-of-file.r)r
r0r)rrrr�at_eofBszStateMachine.at_eofcCs
|jdkS)z8Return 1 if the input is at or before beginning-of-file.r)r
)rrrr�at_bofFszStateMachine.at_bofcCsN|j|8_|jdkr*d|_n|j|j|_|j�|jS)z=Load `self.line` with the `n`'th previous line and return it.rN)r
r	rr=)rr>rrrr-Js
zStateMachine.previous_linecCshzVy'||j|_|j|j|_Wn!tk
rMd|_t�YnX|jSWd|j�XdS)z?Jump to absolute line offset `line_offset`, load and return it.N)rr
rr	r<r(r=)rr
rrr�	goto_lineTs
	zStateMachine.goto_linecCs|jj||j�S)z<Return source of line at absolute line offset `line_offset`.)rrr)rr
rrr�
get_sourceaszStateMachine.get_sourcecCs|j|jS)z;Return line offset of current line, from beginning of file.)r
r)rrrr�abs_line_offseteszStateMachine.abs_line_offsetcCs|j|jdS)z5Return line number of current line (counting from 1).r)r
r)rrrrr9iszStateMachine.abs_line_numbercCs�|dkr|j}n||jd}y&|jj|�\}}|d}WnYtk
r�|j||j�\}}||dfSYntk
r�d\}}YnX||fS)a\Return (source, line) tuple for current or given line number.

        Looks up the source and line number in the `self.input_lines`
        StringList instance to count for included source files.

        If the optional argument `lineno` is given, convert it from an
        absolute line number to the corresponding (source, line) pair.
        Nr)NN)r
rrr&�	TypeError�get_source_and_liner<)r�linenor6�srcZ	srcoffsetZsrclinerrrrGms	

z StateMachine.get_source_and_linecCs�|jj|jdddd|dt|��|jj|jdddd|dd�|jj|jdt||��dS)	Nr�rzinternal padding after r6zinternal padding before �r)r�insertr
r0r)rrrrrr�insert_input�s


zStateMachine.insert_inputcCs�y7|jj|j|�}|jt|�d�|SWnLtk
r�}z,|jd}|jt|�d��WYdd}~XnXdS)z�
        Return a contiguous block of text.

        If `flush_left` is true, raise `UnexpectedIndentationError` if an
        indented line is encountered before the text block ends (with a blank
        line).
        rrN)r�get_text_blockr
r%r0�UnexpectedIndentationErrorr.)r�
flush_left�block�errrrrrN�s	
zStateMachine.get_text_blockc
Cs�|dkr|j}d}|jrGtd|jj|fd|j�x�|D]p}|j|\}}}|j|j�}	|	rN|jr�td||jjfd|j�||	||�SqNW|jr�td|jjd|j�|j	||�SdS)a�
        Examine one line of input for a transition match & execute its method.

        Parameters:

        - `context`: application-dependent storage.
        - `state`: a `State` object, the current state.
        - `transitions`: an optional ordered list of transition names to try,
          instead of ``state.transition_order``.

        Return the values returned by the transition method:

        - context: possibly modified from the parameter `context`;
        - next state name (`State` subclass name);
        - the result output of the transition, a list.

        When there is no match, ``state.no_match()`` is called and its return
        value is returned.
        Nz5
StateMachine.check_line: state="%s", transitions=%r.rz@
StateMachine.check_line: Matched transition "%s" in state "%s".z1
StateMachine.check_line: No match in state "%s".)
�transition_orderrr r)r*rr3�matchr	�no_match)
rr2rr3Zstate_correction�name�pattern�methodr7rTrrrr'�s*		
		zStateMachine.check_linecCsA|j}||jkr$t|��|||j�|j|<dS)z�
        Initialize & add a `state_class` (`State` subclass) object.

        Exception: `DuplicateStateError` raised if `state_class` was already
        added.
        N)r*r�DuplicateStateErrorr)r�state_classZ	statenamerrr�	add_state�s	zStateMachine.add_statecCs"x|D]}|j|�qWdS)zE
        Add `state_classes` (a list of `State` subclasses).
        N)r[)rrrZrrrr�s
zStateMachine.add_statescCs.x't|jj��D]}|j�qWdS)z+
        Initialize `self.states`.
        N)rrrr)rrrrrr�szStateMachine.runtime_initcCsvt�\}}}}}td||fd|j�td|j�d|j�td|||fd|j�dS)zReport error details.z%s: %srz
input line %szmodule %s, line %s, function %sN)�_exception_datar rr9)r�type�value�moduler	�functionrrrr1�s
zStateMachine.errorcCs|jj|�dS)z�
        The `observer` parameter is a function or bound method which takes two
        arguments, the source and offset of the current line.
        N)r�append)r�observerrrr�attach_observer�szStateMachine.attach_observercCs|jj|�dS)N)r�remove)rrbrrr�detach_observer�szStateMachine.detach_observercCsVxO|jD]D}y|jj|j�}Wntk
rCd}YnX||�q
WdS)N)NN)rrr&r
r<)rrbr&rrrr=s
zStateMachine.notify_observers)r*�
__module__�__qualname__�__doc__rrr8r"r%r@rArBr-rCrDrEr9rGrMrNr'r[rrr1rcrer=rrrrrus4/`



,rc@s�eZdZdZdZdZdZdZddd�Zdd�Z	dd	�Z
d
d�Zdd
�Zdd�Z
dd�Zddd�Zdd�Zdd�Zdd�Zdd�Zdd�ZdS)�Stateav
    State superclass. Contains a list of transitions, and transition methods.

    Transition methods all have the same signature. They take 3 parameters:

    - An `re` match object. ``match.string`` contains the matched input line,
      ``match.start()`` gives the start index of the match, and
      ``match.end()`` gives the end index.
    - A context object, whose meaning is application-defined (initial value
      ``None``). It can be used to store any information required by the state
      machine, and the retured context is passed on to the next transition
      method unchanged.
    - The name of the next state, a string, taken from the transitions list;
      normally it is returned unchanged, but it may be altered by the
      transition method if necessary.

    Transition methods all return a 3-tuple:

    - A context object, as (potentially) modified by the transition method.
    - The next state name (a return value of ``None`` means no state change).
    - The processing result, a list, which is accumulated by the state
      machine.

    Transition methods may raise an `EOFError` to cut processing short.

    There are two implicit transitions, and corresponding transition methods
    are defined: `bof()` handles the beginning-of-file, and `eof()` handles
    the end-of-file. These methods have non-standard signatures and return
    values. `bof()` returns the initial context and results, and may be used
    to return a header string, or do any other processing needed. `eof()`
    should handle any remaining context and wrap things up; it returns the
    final processing result.

    Typical applications need only subclass `State` (or a subclass), set the
    `patterns` and `initial_transitions` class attributes, and provide
    corresponding transition methods. The default object initialization will
    take care of constructing the list of transitions.
    NFcCs�g|_i|_|j�||_||_|jdkrL|jj|_|jdkr|d|jgd|jji|_dS)z�
        Initialize a `State` object; make & add initial transitions.

        Parameters:

        - `statemachine`: the controlling `StateMachine` object.
        - `debug`: a boolean; produce verbose output if true.
        Nrr)	rSr3�add_initial_transitions�
state_machiner�	nested_smr)�nested_sm_kwargsr*)rrkrrrrrVs
			
		zState.__init__cCsdS)z{
        Initialize this `State` before running the state machine; called from
        `self.state_machine.run()`.
        Nr)rrrrrzszState.runtime_initcCs
d|_dS)z9Remove circular references to objects no longer required.N)rk)rrrrr�szState.unlinkcCs5|jr1|j|j�\}}|j||�dS)z>Make and add transitions listed in `self.initial_transitions`.N)�initial_transitions�make_transitions�add_transitions)r�namesr3rrrrj�s	zState.add_initial_transitionscCskxA|D]9}||jkr(t|��||krt|��qW||jdd�<|jj|�dS)a"
        Add a list of transitions to the start of the transition list.

        Parameters:

        - `names`: a list of transition names.
        - `transitions`: a mapping of names to transition tuples.

        Exceptions: `DuplicateTransitionError`, `UnknownTransitionError`.
        Nr)r3�DuplicateTransitionError�UnknownTransitionErrorrS�update)rrqr3rVrrrrp�s
zState.add_transitionscCsB||jkrt|��|g|jdd�<||j|<dS)z�
        Add a transition to the start of the transition list.

        Parameter `transition`: a ready-made transition 3-tuple.

        Exception: `DuplicateTransitionError`.
        Nr)r3rrrS)rrVZ
transitionrrr�add_transition�szState.add_transitionc	Cs9y|j|=|jj|�Wnt|��YnXdS)z^
        Remove a transition by `name`.

        Exception: `UnknownTransitionError`.
        N)r3rSrdrs)rrVrrr�remove_transition�s

zState.remove_transitioncCs�|dkr|jj}y/|j|}t|d�sFtj|�}Wn.tk
rwtd|jj|f��YnXyt||�}Wn.t	k
r�t
d|jj|f��YnX|||fS)a�
        Make & return a transition tuple based on `name`.

        This is a convenience function to simplify transition creation.

        Parameters:

        - `name`: a string, the name of the transition pattern & method. This
          `State` object must have a method called '`name`', and a dictionary
          `self.patterns` containing a key '`name`'.
        - `next_state`: a string, the name of the next `State` object for this
          transition. A value of ``None`` (or absent) implies no state change
          (i.e., continue with the same state).

        Exceptions: `TransitionPatternNotFound`, `TransitionMethodNotFound`.
        NrTz%s.patterns[%r]z%s.%s)r)r*�patterns�hasattr�re�compiler:�TransitionPatternNotFound�getattr�AttributeError�TransitionMethodNotFound)rrVr7rWrXrrr�make_transition�s


zState.make_transitioncCs�td�}g}i}xk|D]c}t|�|krZ|j|�||<|j|�q|j|�||d<|j|d�qW||fS)z�
        Return a list of transition names and a transition mapping.

        Parameter `name_list`: a list, where each entry is either a transition
        name string, or a 1- or 2-tuple (transition name, optional next state
        name).
        rJr)r]rra)rZ	name_listZ
stringtyperqr3Z	namestaterrrro�s
zState.make_transitionscCs
|dgfS)a'
        Called when there is no match from `StateMachine.check_line()`.

        Return the same values returned by transition methods:

        - context: unchanged;
        - next state name: ``None``;
        - empty result list.

        Override in subclasses to catch this event.
        Nr)rr2r3rrrrU�szState.no_matchcCs
|gfS)z�
        Handle beginning-of-file. Return unchanged `context`, empty result.

        Override in subclasses.

        Parameter `context`: application-defined storage.
        r)rr2rrrr#�sz	State.bofcCsgS)z�
        Handle end-of-file. Return empty result.

        Override in subclasses.

        Parameter `context`: application-defined storage.
        r)rr2rrrr+sz	State.eofcCs
||gfS)z�
        A "do nothing" transition method.

        Return unchanged `context` & `next_state`, empty result. Useful for
        simple state changes (actionless transitions).
        r)rrTr2r7rrr�nopsz	State.nop)r*rfrgrhrwrnrlrmrrrrjrprurvrrorUr#r+r�rrrrri	s$'$
!

ric@sOeZdZdZdddd�Zdddd�Zddddd	�Zd
S)�StateMachineWSaq
    `StateMachine` subclass specialized for whitespace recognition.

    There are three methods provided for extracting indented text blocks:

    - `get_indented()`: use when the indent is unknown.
    - `get_known_indented()`: use when the indent is known for all lines.
    - `get_first_known_indented()`: use when only the first line's indent is
      known.
    FTcCs�|j�}|jj|j||�\}}}|rM|jt|�d�x/|r~|dj�r~|j�|d7}qPW||||fS)a
        Return a block of indented lines of text, and info.

        Extract an indented block where the indent is unknown for all lines.

        :Parameters:
            - `until_blank`: Stop collecting at the first blank line if true.
            - `strip_indent`: Strip common leading indent if true (default).

        :Return:
            - the indented block (a list of lines of text),
            - its indent,
            - its first line offset from BOF, and
            - whether or not it finished with a blank line.
        rr)rEr�get_indentedr
r%r0r?�
trim_start)r�until_blank�strip_indentr6�indented�indent�blank_finishrrrr�&s	
zStateMachineWS.get_indentedcCs�|j�}|jj|j||d|�\}}}|jt|�d�x/|r~|dj�r~|j�|d7}qPW|||fS)a�
        Return an indented block and info.

        Extract an indented block where the indent is known for all lines.
        Starting with the current line, extract the entire text block with at
        least `indent` indentation (which must be whitespace, except for the
        first line).

        :Parameters:
            - `indent`: The number of indent columns/characters.
            - `until_blank`: Stop collecting at the first blank line if true.
            - `strip_indent`: Strip `indent` characters of indentation if true
              (default).

        :Return:
            - the indented block,
            - its first line offset from BOF, and
            - whether or not it finished with a blank line.
        �block_indentrr)rErr�r
r%r0r?r�)rr�r�r�r6r�r�rrr�get_known_indented@s	
z!StateMachineWS.get_known_indentedcCs�|j�}|jj|j||d|�\}}}|jt|�d�|r�x/|r�|dj�r�|j�|d7}qVW||||fS)a�
        Return an indented block and info.

        Extract an indented block where the indent is known for the first line
        and unknown for all other lines.

        :Parameters:
            - `indent`: The first line's indent (# of columns/characters).
            - `until_blank`: Stop collecting at the first blank line if true
              (1).
            - `strip_indent`: Strip `indent` characters of indentation if true
              (1, default).
            - `strip_top`: Strip blank lines from the beginning of the block.

        :Return:
            - the indented block,
            - its indent,
            - its first line offset from BOF, and
            - whether or not it finished with a blank line.
        �first_indentrr)rErr�r
r%r0r?r�)rr�r�r�Z	strip_topr6r�r�rrr�get_first_known_indented^s	
z'StateMachineWS.get_first_known_indentedN)r*rfrgrhr�r�r�rrrrr�s
r�c@s�eZdZdZdZdZdZdZddddiZdZ	ddd	�Z
d
d�Zdd
�Zdd�Z
dd�Zdd�ZdS)�StateWSa�
    State superclass specialized for whitespace (blank lines & indents).

    Use this class with `StateMachineWS`.  The transitions 'blank' (for blank
    lines) and 'indent' (for indented text blocks) are added automatically,
    before any other transitions.  The transition method `blank()` handles
    blank lines and `indent()` handles nested indented blocks.  Indented
    blocks trigger a new state machine to be created by `indent()` and run.
    The class of the state machine to be created is in `indent_sm`, and the
    constructor keyword arguments are in the dictionary `indent_sm_kwargs`.

    The methods `known_indent()` and `firstknown_indent()` are provided for
    indented blocks where the indent (all lines' and first line's only,
    respectively) is known to the transition method, along with the attributes
    `known_indent_sm` and `known_indent_sm_kwargs`.  Neither transition method
    is triggered automatically.
    N�blankz *$r�z +FcCs�tj|||�|jdkr.|j|_|jdkrI|j|_|jdkrd|j|_|jdkr|j|_dS)z�
        Initialize a `StateSM` object; extends `State.__init__()`.

        Check for indent state machine attributes, set defaults if not set.
        N)rir�	indent_smrl�indent_sm_kwargsrm�known_indent_sm�known_indent_sm_kwargs)rrkrrrrr�szStateWS.__init__cCsdtj|�|jdkr%i|_|jj|j�|j|j�\}}|j||�dS)z�
        Add whitespace-specific transitions before those defined in subclass.

        Extends `State.add_initial_transitions()`.
        N)rirjrwrt�ws_patternsro�ws_initial_transitionsrp)rrqr3rrrrj�s
	zStateWS.add_initial_transitionscCs|j|||�S)z9Handle blank lines. Does nothing. Override in subclasses.)r�)rrTr2r7rrrr��sz
StateWS.blankc
CsX|jj�\}}}}|jd|j|j�}|j|d|�}	|||	fS)z�
        Handle an indented text block. Extend or override in subclasses.

        Recursively run the registered state machine for indented blocks
        (`self.indent_sm`).
        rr)rkr�r�rr�r8)
rrTr2r7r�r�r
r��smr4rrrr��szStateWS.indentc	Cs^|jj|j��\}}}|jd|j|j�}|j|d|�}|||fS)a
        Handle a known-indent text block. Extend or override in subclasses.

        Recursively run the registered state machine for known-indent indented
        blocks (`self.known_indent_sm`). The indent is the length of the
        match, ``match.end()``.
        rr)rkr��endr�rr�r8)	rrTr2r7r�r
r�r�r4rrr�known_indent�s
	!zStateWS.known_indentc	Cs^|jj|j��\}}}|jd|j|j�}|j|d|�}|||fS)a0
        Handle an indented text block (first line's indent known).

        Extend or override in subclasses.

        Recursively run the registered state machine for known-indent indented
        blocks (`self.known_indent_sm`). The indent is the length of the
        match, ``match.end()``.
        rr)rkr�r�r�rr�r8)	rrTr2r7r�r
r�r�r4rrr�first_known_indent�s
!zStateWS.first_known_indent)r�r�)r*rfrgrhr�r�r�r�r�r�rrjr�r�r�r�rrrrr��s
r�c@s"eZdZdZdd�ZdS)�_SearchOverridea�
    Mix-in class to override `StateMachine` regular expression behavior.

    Changes regular expression matching, from the default `re.match()`
    (succeeds only if the pattern matches at the start of `self.line`) to
    `re.search()` (succeeds if the pattern matches anywhere in `self.line`).
    When subclassing a `StateMachine`, list this class **first** in the
    inheritance list of the class definition.
    cCs|j|j�S)z�
        Return the result of a regular expression search.

        Overrides `StateMachine.match()`.

        Parameter `pattern`: `re` compiled regular expression.
        )�searchr	)rrWrrrrTsz_SearchOverride.matchN)r*rfrgrhrTrrrrr�
s
r�c@seZdZdZdS)�SearchStateMachinez@`StateMachine` which uses `re.search()` instead of `re.match()`.N)r*rfrgrhrrrrr�$sr�c@seZdZdZdS)�SearchStateMachineWSzB`StateMachineWS` which uses `re.search()` instead of `re.match()`.N)r*rfrgrhrrrrr�)sr�c@seZdZdZddddddd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�Zdd�Z
dd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd)d*�ZeZd+d,�Zd-d.�Zdd/d0d1�Zdd/d2d3�ZdQd5d6�Zd4d7d8�Zd4d9d:�Zd;d<�Z d=d>�Z!d?d@�Z"dAdB�Z#dCdD�Z$dEdF�Z%dGdH�Z&dIdJ�Z'dKdL�Z(dMdN�Z)dOdP�Z*dS)R�ViewLista>
    List with extended functionality: slices of ViewList objects are child
    lists, linked to their parents. Changes made to a child list also affect
    the parent list.  A child list is effectively a "view" (in the SQL sense)
    of the parent list.  Changes to parent lists, however, do *not* affect
    active child lists.  If a parent list is changed, any active child lists
    should be recreated.

    The start and end of the slice can be trimmed using the `trim_start()` and
    `trim_end()` methods, without affecting the parent list.  The link between
    child and parent lists can be broken by calling `disconnect()` on the
    child list.

    Also, ViewList objects keep track of the source & offset of each item.
    This information is accessible via the `source()`, `offset()`, and
    `info()` methods.
    Ncs�g|_g|_||_||_t|t�rb|jdd�|_|jdd�|_nU|dk	r�t|�|_|r�||_n(�fdd�tt|��D�|_t|j�t|j�ks�t	d��dS)Ncsg|]}�|f�qSrr)�.0�i)rrr�
<listcomp>Zs	z%ViewList.__init__.<locals>.<listcomp>z
data mismatch)
�data�items�parent�
parent_offsetrr�r�ranger0�AssertionError)r�initlistrr�r�r�r)rrrBs				(zViewList.__init__cCs
t|j�S)N)�strr�)rrrr�__str__]szViewList.__str__cCsd|jj|j|jfS)Nz%s(%s, items=%s))r)r*r�r�)rrrr�__repr__`szViewList.__repr__cCs|j|j|�kS)N)r��_ViewList__cast)r�otherrrr�__lt__dszViewList.__lt__cCs|j|j|�kS)N)r�r�)rr�rrr�__le__eszViewList.__le__cCs|j|j|�kS)N)r�r�)rr�rrr�__eq__fszViewList.__eq__cCs|j|j|�kS)N)r�r�)rr�rrr�__ne__gszViewList.__ne__cCs|j|j|�kS)N)r�r�)rr�rrr�__gt__hszViewList.__gt__cCs|j|j|�kS)N)r�r�)rr�rrr�__ge__iszViewList.__ge__cCst|j|j|��S)N)Zcmpr�r�)rr�rrr�__cmp__jszViewList.__cmp__cCst|t�r|jS|SdS)N)rr�r�)rr�rrr�__castlszViewList.__castcCs
||jkS)N)r�)r�itemrrr�__contains__rszViewList.__contains__cCs
t|j�S)N)r0r�)rrrr�__len__sszViewList.__len__cCs�t|t�rx|jdks*td��|j|j|j|j�d|j|j|j�d|d|jptd�S|j|SdS)Nrzcannot handle slice with strider�r�r�r)Nr)	r�slice�stepr�r)r��start�stopr�)rr�rrr�__getitem__yszViewList.__getitem__cCst|t�r�|jdks*td��t|t�sEtd��|j|j|j|j�<|j	|j	|j|j�<t
|j�t
|j	�ks�td��|jr||j|jp�d|j|jp�t
|�|j�<n*||j|<|jr||j||j<dS)Nrzcannot handle slice with stridez(assigning non-ViewList to ViewList slicez
data mismatchr)Nr)
rr�r�r�r�rFr�r�r�r�r0r�r�)rr�r�rrr�__setitem__�s*	<
	zViewList.__setitem__cCs�y2|j|=|j|=|jr1|j||j=Wn�tk
r�|jdks]td��|j|j|j�=|j|j|j�=|jr�|j|jp�d|j|jp�t	|�|j�=YnXdS)Nzcannot handle slice with strider)
r�r�r�r�rFr�r�r�r�r0)rr�rrr�__delitem__�s

	
	zViewList.__delitem__cCsFt|t�r6|j|j|jd|j|j�Std��dS)Nr�z!adding non-ViewList to a ViewList)rr�r)r�r�rF)rr�rrr�__add__�szViewList.__add__cCsFt|t�r6|j|j|jd|j|j�Std��dS)Nr�z!adding ViewList to a non-ViewList)rr�r)r�r�rF)rr�rrr�__radd__�szViewList.__radd__cCs4t|t�r$|j|j7_ntd��|S)Nz!argument to += must be a ViewList)rr�r�rF)rr�rrr�__iadd__�szViewList.__iadd__cCs!|j|j|d|j|�S)Nr�)r)r�r�)rr>rrr�__mul__�szViewList.__mul__cCs"|j|9_|j|9_|S)N)r�r�)rr>rrr�__imul__�szViewList.__imul__cCsqt|t�std��|jrG|jjt|j�|j|�|jj|j�|j	j|j	�dS)Nz(extending a ViewList with a non-ViewList)
rr�rFr�rLr0r�r�r$r�)rr�rrrr$�s	#zViewList.extendrcCsx|dkr|j|�nX|jrN|jjt|j�|j|||�|jj|�|jj||f�dS)N)r$r�rLr0r�r�rar�)rr�rr6rrrra�s	
zViewList.appendcCs|dkr�t|t�s'td��|j|j||�<|j|j||�<|jrt|j�|t|j�}|jj||j|�nu|jj||�|jj|||f�|jrt|j�|t|j�}|jj||j|||�dS)Nz+inserting non-ViewList with no source given)	rr�rFr�r�r�r0rLr�)rr�r�rr6�indexrrrrL�s	 	 zViewList.insertrcCs`|jr@t|j�|t|j�}|jj||j�|jj|�|jj|�S)N)r�r0r��popr�r�)rr�r�rrrr��s
	 zViewList.popcCs�|t|j�kr7td|t|j�f��n|dkrOtd��|jd|�=|jd|�=|jr�|j|7_dS)zW
        Remove items from the start of the list, without touching the parent.
        zCSize of trim too large; can't trim %s items from a list of size %s.rzTrim size must be >= 0.N)r0r�r<r�r�r�)rr>rrrr��s	zViewList.trim_startcCsu|t|j�kr7td|t|j�f��n|dkrOtd��|j|d�=|j|d�=dS)zU
        Remove items from the end of the list, without touching the parent.
        zCSize of trim too large; can't trim %s items from a list of size %s.rzTrim size must be >= 0.N)r0r�r<r�)rr>rrr�trim_end�szViewList.trim_endcCs|j|�}||=dS)N)r�)rr�r�rrrrdszViewList.removecCs|jj|�S)N)r��count)rr�rrrr�szViewList.countcCs|jj|�S)N)r�r�)rr�rrrr�szViewList.indexcCs'|jj�|jj�d|_dS)N)r��reverser�r�)rrrrr�
s

zViewList.reversecGsatt|j|j��}|j|�dd�|D�|_dd�|D�|_d|_dS)NcSsg|]}|d�qS)rr)r��entryrrrr�s	z!ViewList.sort.<locals>.<listcomp>cSsg|]}|d�qS)rr)r�r�rrrr�s	)r�zipr�r��sortr�)rr.Ztmprrrr�s

z
ViewList.sortcCsYy|j|SWnCtk
rT|t|j�krM|j|dddfS�YnXdS)z%Return source & offset for index `i`.rrN)r�r<r0r�)rr�rrrr&s
z
ViewList.infocCs|j|�dS)zReturn source for index `i`.r)r&)rr�rrrr szViewList.sourcecCs|j|�dS)zReturn offset for index `i`.r)r&)rr�rrrr6$szViewList.offsetcCs
d|_dS)z-Break link between this list and parent list.N)r�)rrrr�
disconnect(szViewList.disconnectccs>x7t|j|j�D] \}\}}|||fVqWdS)z8Return iterator yielding (source, offset, value) tuples.N)r�r�r�)rr^rr6rrr�xitems,s(zViewList.xitemscCs)x"|j�D]}td|�q
WdS)z=Print the list in `grep` format (`source:offset:value` lines)z%s:%d:%sN)r�r )rr	rrr�pprint1szViewList.pprintr)+r*rfrgrhrr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r��__rmul__r�r$rarLr�r�r�rdr�r�r�r�r&rr6r�r�r�rrrrr�.sR		

r�c@s|eZdZdZdejdd�Zddd�Zdddd	d	d
d�Zddd
�Z	dd�Z
dd�Zd	S)rz*A `ViewList` with string-specific methods.rcs7�fdd�|j||�D�|j||�<dS)z�
        Trim `length` characters off the beginning of each item, in-place,
        from index `start` to `end`.  No whitespace-checking is done on the
        trimmed text.  Does not affect slice parent.
        cs g|]}|�d��qS)Nr)r�r	)�lengthrrr�As	z(StringList.trim_left.<locals>.<listcomp>N)r�)rr�r�r�r)r�r�	trim_left;szStringList.trim_leftFcCs�|}t|j�}x||kr�|j|}|j�s>P|r�|ddkr�|j|�\}}t|||�||d��|d7}qW|||�S)z�
        Return a contiguous block of text.

        If `flush_left` is true, raise `UnexpectedIndentationError` if an
        indented line is encountered before the text block ends (with a blank
        line).
        r� r)r0r�r?r&rO)rr�rPr��lastr	rr6rrrrNDs

zStringList.get_text_blockTNcCs�|}|}|dk	r*|dkr*|}|dk	r@|d7}t|j�}x�||kr=|j|}	|	r�|	ddks�|dk	r�|	d|�j�r�||ko�|j|dj�}
P|	j�}|s�|r0d}
PnF|dkr0t|	�t|�}|dkr!|}nt||�}|d7}qRWd}
|||�}
|dk	r�|
r�|
jd|d�|
jd<|r�|r�|
j|d|dk	�|
|p�d|
fS)a�
        Extract and return a StringList of indented lines of text.

        Collect all lines with indentation, determine the minimum indentation,
        remove the minimum indentation from all indented lines (unless
        `strip_indent` is false), and return them. All lines up to but not
        including the first unindented line will be returned.

        :Parameters:
          - `start`: The index of the first line to examine.
          - `until_blank`: Stop collecting at the first blank line if true.
          - `strip_indent`: Strip common leading indent if true (default).
          - `block_indent`: The indent of the entire block, if known.
          - `first_indent`: The indent of the first line, if known.

        :Return:
          - a StringList of indented lines with mininum indent removed;
          - the amount of the indent;
          - a boolean: did the indented block finish with a blank line or EOF?
        Nrrr�r�)r0r�r?�lstrip�minr�)rr�r�r�r�r�r�r�r�r	r��strippedZline_indentrQrrrr�YsB

	zStringList.get_indentedc
sl|||�}|�xtt|j��D]�}tj|j|�}y||}Wn3tk
r�|t|j|�t|�7}YnXy||}Wn3tk
r�|t|j|�t|�7}YnX|j|||�j�|j|<}	|	r,t�t|	�t|	j����q,W|rhd�koD|knrh�fdd�|jD�|_|S)Nrcs g|]}|�d��qS)Nr)r�r	)r�rrr��s	z+StringList.get_2D_block.<locals>.<listcomp>)	r�r0r�rZcolumn_indicesr<�rstripr�r�)
r�top�leftZbottom�rightr�rQr�Zcir	r)r�r�get_2D_block�s$
&
&()"zStringList.get_2D_blockcCs�ttd�rtj}ndSx�tt|j��D]{}|j|}t|t�r5g}x:|D]2}|j|�||�dkrd|j|�qdWdj	|�|j|<q5WdS)z�
        Pad all double-width characters in self by appending `pad_char` to each.
        For East Asian language support.
        �east_asian_widthNZWFrJ)
rx�unicodedatar�r�r0r�rr�rar!)rZpad_charr�r�r	�new�charrrr�pad_double_width�s


zStringList.pad_double_widthcCsDx=tt|j��D]&}|j|j||�|j|<qWdS)z6Replace all occurrences of substring `old` with `new`.N)r�r0r��replace)r�oldr�r�rrrr��szStringList.replace)r*rfrgrh�sys�maxsizer�rNr�r�r�r�rrrrr7s		;rc@seZdZdS)�StateMachineErrorN)r*rfrgrrrrr��sr�c@seZdZdS)r;N)r*rfrgrrrrr;�sr;c@seZdZdS)rYN)r*rfrgrrrrrY�srYc@seZdZdS)rsN)r*rfrgrrrrrs�srsc@seZdZdS)rrN)r*rfrgrrrrrr�srrc@seZdZdS)r{N)r*rfrgrrrrr{�sr{c@seZdZdS)r~N)r*rfrgrrrrr~�sr~c@seZdZdS)rON)r*rfrgrrrrrO�srOc@seZdZdZdS)r,z�
    Raise from within a transition method to switch to another transition.

    Raise with one argument, the new transition name.
    N)r*rfrgrhrrrrr,�sr,c@seZdZdZdS)r/z�
    Raise from within a transition method to switch to another state.

    Raise with one or two arguments: new state name, and an optional new
    transition name.
    N)r*rfrgrhrrrrr/�sr/�Fz[]cs5|r|jd|�}�fdd�|j�D�S)a�
    Return a list of one-line strings with tabs expanded, no newlines, and
    trailing whitespace stripped.

    Each tab is expanded with between 1 and `tab_width` spaces, so that the
    next character's index becomes a multiple of `tab_width` (8 by default).

    Parameters:

    - `astring`: a multi-line string.
    - `tab_width`: the number of columns between tab stops.
    - `convert_whitespace`: convert form feeds and vertical tabs to spaces?
    r�cs%g|]}|j��j��qSr)�
expandtabsr�)r��s)�	tab_widthrrr��s	z string2lines.<locals>.<listcomp>)�sub�
splitlines)Zastringr�Zconvert_whitespace�
whitespacer)r�r�string2lines�sr�cCsYtj�\}}}x|jr-|j}qW|jj}|j||j|j|jfS)z�
    Return exception information:

    - the exception's class name;
    - the exception object;
    - the name of the file containing the offending code;
    - the line number of the offending code;
    - the function name of the offending code.
    )	r��exc_info�tb_next�tb_frame�f_coder*�co_filename�	tb_lineno�co_name)r]r^�	traceback�coderrrr\�s

r\)!rhZ
__docformat__r�ry�typesr��docutilsrZdocutils.utils.error_reportingrrrir�r�r�r�r�r�r�	Exceptionr�r;rYrsrrr{r~rOr,r/rzr�r\rrrr�<module>is@���g��
�