Your IP : 216.73.216.213
B
�d{Tn) � @ s� d Z dZddlZddlmZ ddlmZmZmZ G dd� de �Z
dZ d Z d
Z
G d d � d e�ZG d
d� dee�ZG dd� de�Zejdd� dkr�eZnddlmZ eZG dd� dee�Zefdd�Zefdd�ZG dd� de�ZG d d � d e�ZdS ) z.Base class to represent a tree structure.
zrestructuredtext en� N)�flatten)� VisitedMixIn�FilteredIterator� no_filterc @ s e Zd ZdZdS )� NodeNotFoundz%raised when a node has not been foundN)�__name__�
__module__� __qualname__�__doc__� r r �D/opt/alt/python37/lib/python3.7/site-packages/logilab/common/tree.pyr ! s r zNo such sibling as '%s'zNo such child as '%s'zNo such node as '%s'c @ s� e Zd ZdZd.dd�Zdd� Zd/dd �Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd0d d �Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd1d*d+�Zd,d-� ZdS )2�Nodez)a basic tree node, characterized by an idNc C s || _ d | _g | _d S )N)�id�parent�children)�self�nidr r r �__init__. s z
Node.__init__c C s
t | j�S )N)�iterr )r r r r �__iter__4 s z
Node.__iter__r c C st dd| | j j| jf g}|d7 }xF| jD ]<}y|�|�|�� W q* tk
rd |�|�� � Y q*X q*W d�|�S )Nz%s%s %s� � �
)� __class__r r r �append�__str__� TypeError�join)r �indent�s�childr r r r 7 s z Node.__str__c C s | j S )N)r )r r r r �is_leafA s z Node.is_leafc C s | j �|� | |_dS )zadd a node to childrenN)r r r )r r r r r r D s z Node.appendc C s | j �|� d|_dS )zremove a child nodeN)r �remover )r r r r r r" I s z Node.removec C s | j �||� | |_dS )zinsert a child nodeN)r �insertr )r �indexr r r r r# N s z Node.insertc C s0 | j �|�}| j �|� | j �||� | |_dS )z!replace a child node with anotherN)r r$ �popr# r )r Z old_child� new_child�ir r r �replaceS s z Node.replacec C s2 y | j �|�S tk
r, tt| ��Y nX dS )z)return the sibling node that has given idN)r �get_child_by_idr �EX_SIBLING_NOT_FOUND)r r r r r � get_siblingZ s zNode.get_siblingc C sF | j }|dkrdS |j�| �}y|j|d S tk
r@ dS X dS )z>
return the next sibling for this node if any
N� )r r r$ �
IndexError)r r r$ r r r � next_siblinga s zNode.next_siblingc C s8 | j }|dkrdS |j�| �}|dkr4|j|d S dS )zB
return the previous sibling for this node if any
Nr r, )r r r$ )r r r$ r r r �previous_siblingo s zNode.previous_siblingc C s: | � � }y |�|d�S tk
r4 tt| ��Y nX dS )zB
return node in whole hierarchy that has given id
r, N)�rootr) r �EX_NODE_NOT_FOUND)r r r0 r r r �get_node_by_id| s
zNode.get_node_by_idc C sd | j |kr| S xD| jD ]:}|rBy |�|d�S tk
r@ wY nX |j |kr|S qW tt| ��dS )z*
return child of given id
r, N)r r r) r �EX_CHILD_NOT_FOUND)r r Zrecurse�cr r r r) � s
zNode.get_child_by_idc C sr t |�dkrb|d | jkrbt |�dkr*| S x6| jD ],}y|�|dd� �S tk
r\ Y q2X q2W tt| ��dS )zD
return child of given path (path is a list of ids)
r r, N)�lenr r �get_child_by_pathr r3 )r �pathr4 r r r r6 � s
zNode.get_child_by_pathc C s | j dk rd| j �� S dS dS )z7
return depth of this node in the tree
Nr, r )r �depth)r r r r r8 � s
z
Node.depthc C s" | j r dtdd� | j D �� S dS )z9
return depth of the tree from this node
r, c S s g | ] }|� � �qS r )�
depth_down)�.0r4 r r r �
<listcomp>� s z#Node.depth_down.<locals>.<listcomp>)r �max)r r r r r9 � s zNode.depth_downc C s t | �� �S )z=
return the width of the tree from this node
)r5 �leaves)r r r r �width� s z
Node.widthc C s | j dk r| j �� S | S )z2
return the root node of the tree
N)r r0 )r r r r r0 � s
z Node.rootc C s4 g }| j r*x| j D ]}||�� 7 }qW |S | gS dS )zS
return a list with all the leaves nodes descendant from this node
N)r r= )r r= r r r r r= � s z Node.leavesc C s4 |dkr g }|� | � x| jD ]}|�|� q W |S )zL
return a list with all the nodes descendant from this node
N)r r r )r Z_listr4 r r r r � s
z Node.flattenc C s$ | g}| j dk r |�| j �� � |S )z8
return list of parents up to root node
N)r �extend�lineage)r Zlstr r r r@ � s
z Node.lineage)N)r )N)N)r r r r
r r r r! r r" r# r( r+ r. r/ r2 r) r6 r8 r9 r> r0 r= r r@ r r r r r
+ s,
r
c @ s e Zd ZdZdS )�VNodeza visitable node
N)r r r r
r r r r rA � s rA c @ s* e Zd ZdZd dd�Zdd� Zdd� ZdS )
�
BinaryNodez*a binary node (i.e. only two children
Nc C s> t �| � |d k s|d k r:|r"|s&t�| �|� | �|� d S )N)rA r �AssertionErrorr )r ZlhsZrhsr r r r � s
zBinaryNode.__init__c C s$ | j �|� | j�| | j d � dS )zDremove the child and replace this node with the other child
r N)r r" r r( )r r r r r r" � s zBinaryNode.removec C s | j d | j d fS )zP
return the left hand side and the right hand side of this node
r r, )r )r r r r � get_parts� s zBinaryNode.get_parts)NN)r r r r
r r" rD r r r r rB � s
rB r )r r )�UserListc @ sJ e Zd ZdZdd� Zddd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )�ListNodez&Used to manipulate Nodes as Lists
c C s t �| � t�| � | | _d S )N)�
list_classr rA r )r r r r r s
zListNode.__init__r c C s& d|d | j jd�dd� | D ��f S )Nz%s%s %sr z, c S s g | ] }t |��qS r )�str)r: �vr r r r; s z$ListNode.__str__.<locals>.<listcomp>)r r r )r r r r r r s zListNode.__str__c C s t �| |� | |_dS )zadd a node to childrenN)rG r r )r r r r r r s zListNode.appendc C s t �| ||� | |_dS )zadd a node to childrenN)rG r# r )r r$ r r r r r# s zListNode.insertc C s t �| |� d|_dS )zadd a node to childrenN)rG r" r )r r r r r r" s zListNode.removec C s t �| |�}d|_dS )zadd a node to childrenN)rG r% r )r r$ r r r r r% # s z ListNode.popc C s
t �| �S )N)rG r )r r r r r ( s zListNode.__iter__N)r ) r r r r
r r r r# r" r% r r r r r rF s
rF c C s� g g }}d\}}x�| r�|| �r�| j rH|sH|�| |f� d}| j d } q�|�| � |d7 }y|d d j | } W q� tk
r� d} Y q�X nd} d}| dkr|r|�� \} }d}qW |S )zq
create a list with tree nodes for which the <filter> function returned true
in a post order fashion
)r r r r, ���N)r r r- r% )�node� filter_func�l�stack�popedr$ r r r �post_order_list- s(
rP c C s� g g }}d\}}x�| r�|| �r�|s.|� | � | jrV|sV|� | |f� d}| jd } q�|d7 }y|d d j| } W q� tk
r� d} Y q�X nd} d}| dkrt|�dkr|�� \} }d}qW |S )zp
create a list with tree nodes for which the <filter> function returned true
in a pre order fashion
)r r r r, rJ N)r r r- r5 r% )rK rL rM rN rO r$ r r r �pre_order_listI s*
rQ c @ s e Zd ZdZddd�ZdS )�PostfixedDepthFirstIteratorzHa postfixed depth first iterator, designed to be used with visitors
Nc C s t �| |t|� d S )N)r r rP )r rK rL r r r r i s z$PostfixedDepthFirstIterator.__init__)N)r r r r
r r r r r rR f s rR c @ s e Zd ZdZddd�ZdS )�PrefixedDepthFirstIteratorzGa prefixed depth first iterator, designed to be used with visitors
Nc C s t �| |t|� d S )N)r r rQ )r rK rL r r r r o s z#PrefixedDepthFirstIterator.__init__)N)r r r r
r r r r r rS l s rS )r
Z
__docformat__�sysZlogilab.commonr Zlogilab.common.visitorr r r � Exceptionr r* r3 r1 �objectr
rA rB � version_info�listrG rE rF rP rQ rR rS r r r r �<module> s* : %