a
lj @ sj d dl mZmZmZ d dlmZ d dlZd dlmZ ddl m
Z
ddlmZ e
d Zd
d ZeeZdS ) )absolute_importdivisionunicode_literals)OrderedDictN)string_types )base )moduleFactoryFactoryz
{([^}]*)}(.*)c s, | }| dj G fdddtj}t S )NZasdc s4 e Zd ZdZ fddZdd Zdd Zdd Zd
S )z#getETreeBuilder..TreeWalkera Given the particular ElementTree representation, this implementation,
to avoid using recursion, returns "nodes" as tuples with the following
content:
1. The current element
2. The index of the element relative to its parent
3. A stack of ancestor elements
4. A flag "text", "tail" or None to indicate if the current node is a
text node; either the text or tail of the current element (1)
c sH t |tr2|\}}}}|dv r.tjt||fS |}t|dsD| }|jdv rVtjfS |jdkr|tj |j
|d|dfS |j krtj|j
fS t |jt
sJ t|jt|j}|r| \}}n
d }|j}t }t|j D ]>\} }
t| }|r|
||d|df<