Current File : //snap/core18/current/usr/lib/python3/dist-packages/urwid/__pycache__/treetools.cpython-36.pyc
3
��dZ�< � @ s� d dl mZmZ d dlZd dlmZ G dd� de�ZG dd� dej�Z G dd � d e
�Z G d
d � d e �Z G d d
� d
ej
�ZG dd� dej�ZdS )� )�division�print_functionN)�SelectableIconc @ s e Zd ZdS )�TreeWidgetErrorN)�__name__�
__module__� __qualname__� r r �1/usr/lib/python3/dist-packages/urwid/treetools.pyr & s r c @ s� e Zd ZdZdZedd�Zedd�Zdd� Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$S )%�
TreeWidgetz9A widget representing something in a nested tree display.� �+r �-c C s8 || _ d | _t|d� | _d| _| j� }| jj|� d S )N�get_first_childT)�_node� _innerwidget�hasattr�is_leaf�expanded�get_indented_widget�_TreeWidget__super�__init__)�self�node�widgetr r r
r 0 s zTreeWidget.__init__c C s | j S )zS
Allow selection of non-leaf nodes so children may be (un)expanded
)r )r r r r
�
selectable8 s zTreeWidget.selectablec C sL | j � }| js4tjdd| j| jg| j f|gdd�}| j� }tj|d|d�S )NZfixed� )Z dividechars�relative�d )�width�left)r r ) �get_inner_widgetr �urwidZColumns�unexpanded_icon�
expanded_iconr �get_indent_colsZPadding)r r � indent_colsr r r
r > s z TreeWidget.get_indented_widgetc C s | j | jg| j | jjjd< dS )z-Update display widget text for parent widgetsr N)r# r$ r �_wZ base_widgetZ widget_list)r r r r
�update_expanded_iconH s z TreeWidget.update_expanded_iconc C s | j | j� j� S )N)r& �get_node� get_depth)r r r r
r% N s zTreeWidget.get_indent_colsc C s | j d kr| j� | _ | j S )N)r �load_inner_widget)r r r r
r! Q s
zTreeWidget.get_inner_widgetc C s t j| j� �S )N)r" ZText�get_display_text)r r r r
r+ V s z TreeWidget.load_inner_widgetc C s | j S )N)r )r r r r
r) Y s zTreeWidget.get_nodec C s | j � j� d t| j � j� � S )Nz: )r) �get_key�str� get_value)r r r r
r, \ s zTreeWidget.get_display_textc C s� | j � }|dk r|S | j� }|j� }|j� }x<|dkrh|dkrh|j� }|j� }|d8 }||j� ks.t�q.W |dkrvdS |j� S dS )z5Return the next TreeWidget depth first from this one.Nr r )� first_childr) � next_siblingr* �
get_parent�AssertionError�
get_widget)r Z
firstchild�thisnodeZnextnode�depthr r r
� next_inorder` s zTreeWidget.next_inorderc C sp | j }|j� }|dk r8|j� }|j� }|dkr2|S |S n4|j� }|dkrT|dkrTdS |dkrd|j� }|j� S dS )z9Return the previous TreeWidget depth first from this one.Nr )r � prev_siblingr4 �
last_childr* r2 )r r5 ZprevnodeZ
prevwidget� lastchildr6 r r r
� prev_inorderw s zTreeWidget.prev_inorderc C sZ | j r
|S |dkr"d| _| j� n4|dkr:d| _| j� n | jj� rR| jj||�S |S dS )z2Handle expand & collapse requests (non-leaf nodes)r
�rightTr FN)r
r< )r r r( r' r r �keypress)r �size�keyr r r
r= � s
zTreeWidget.keypressc C sH | j s|dks|dkrdS |dkrD|| j� krD| j | _| j� dS dS )Nz mouse pressr Fr T)r r% r r( )r r> ZeventZbutton�col�row�focusr r r
� mouse_event� s
zTreeWidget.mouse_eventc C s6 | j s| j rdS | jj� r.| jj� }|j� S dS dS )z Return first child if expanded.N)r r r � has_childrenr r4 )r Z firstnoder r r
r0 � s
zTreeWidget.first_childc C sL | j s| j rdS | jj� r,| jj� j� }ndS |j� }|dkrD|S |S dS )z Return last child if expanded.N)r r r rD �get_last_childr4 r9 )r r: Zlastdescendantr r r
r9 � s
zTreeWidget.last_childN)r r r �__doc__r& r r# r$ r r r r( r% r! r+ r) r, r7 r; r= rC r0 r9 r r r r
r * s&
r c @ s� e Zd ZdZd"dd�Zd#dd�Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd d!� ZdS )$�TreeNodea:
Store tree contents and cache TreeWidget objects.
A TreeNode consists of the following elements:
* key: accessor token for parent nodes
* value: subclass-specific data
* parent: a TreeNode which contains a pointer back to this object
* widget: The widget used to render the object
Nc C s" || _ || _|| _|| _d | _d S )N)�_key�_parent�_value�_depth�_widget)r �value�parentr? r6 r r r
r � s
zTreeNode.__init__Fc C s" | j dks|dkr | j� | _ | j S )z! Return the widget for this node.NT)rL � load_widget)r �reloadr r r
r4 � s
zTreeNode.get_widgetc C s t | �S )N)r )r r r r
rO � s zTreeNode.load_widgetc C s< | j d kr | jd kr d| _ n| j d kr6| jj� d | _ | j S )Nr r )rK rI r* )r r r r
r* � s
zTreeNode.get_depthc C s. | j � dkrd S | j� }| j� }|j|�S d S )Nr )r* r- r2 �get_child_index)r r? rN r r r
� get_index� s
zTreeNode.get_indexc C s | j S )N)rH )r r r r
r- � s zTreeNode.get_keyc C s
|| _ d S )N)rH )r r? r r r
�set_key� s zTreeNode.set_keyc C s | j � j| j|� d S )N)r2 �change_child_keyrH )r r? r r r
�
change_key� s zTreeNode.change_keyc C s& | j d kr | j� dkr | j� | _ | j S )Nr )rI r* � load_parent)r r r r
r2 � s
zTreeNode.get_parentc C s t d��dS )z�Provide TreeNode with a parent for the current node. This function
is only required if the tree was instantiated from a child node
(virtual function)z(virtual function. Implement in subclassN)r )r r r r
rV � s zTreeNode.load_parentc C s | j S )N)rJ )r r r r
r/ s zTreeNode.get_valuec C s | j � dkS )Nr )r* )r r r r
�is_root s zTreeNode.is_rootc C s& | j � dkr | j� j| j� �S d S d S )Nr )r* r2 �
next_childr- )r r r r
r1 s zTreeNode.next_siblingc C s& | j � dkr | j� j| j� �S d S d S )Nr )r* r2 �
prev_childr- )r r r r
r8 s zTreeNode.prev_siblingc C s" | }x|j � d k r |j � }qW |S )N)r2 )r �rootr r r
�get_root s zTreeNode.get_root)NNN)F)r r r rF r r4 rO r* rR r- rS rU r2 rV r/ rW r1 r8 r[ r r r r
rG � s
rG c @ s� e Zd ZdZd dd�Zd!dd�Zdd � Zd
d � Zd"d d
�Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � ZdS )#�
ParentNodez"Maintain sort order for TreeNodes.Nc C s$ t j| ||||d� d | _i | _d S )N)rN r? r6 )rG r � _child_keys� _children)r rM rN r? r6 r r r
r s zParentNode.__init__Fc C s" | j dks|dkr | j� | _ | j S )z,Return a possibly ordered list of child keysNT)r] �load_child_keys)r rP r r r
�get_child_keys! s
zParentNode.get_child_keysc C s t d��dS )zPProvide ParentNode with an ordered list of child keys (virtual
function)z(virtual function. Implement in subclassN)r )r r r r
r_ ' s zParentNode.load_child_keysc C s | j |�}|j� S )z8Return the widget for a given key. Create if necessary.)�get_child_noder4 )r r? Zchildr r r
�get_child_widget, s
zParentNode.get_child_widgetc C s, || j ks|dkr"| j|�| j |< | j | S )z<Return the child node for a given key. Create if necessary.T)r^ �load_child_node)r r? rP r r r
ra 2 s zParentNode.get_child_nodec C s t d��dS )z6Load the child node for a given key (virtual function)z(virtual function. Implement in subclassN)r )r r? r r r
rc 8 s zParentNode.load_child_nodec C s || j |< dS )z]Set the child node for a given key. Useful for bottom-up, lazy
population of a tree.N)r^ )r r? r r r r
�set_child_node< s zParentNode.set_child_nodec C s< || j krtd| ��| j j|�| j |< | j | j|� d S )Nz%s is already in use)r^ r �poprS )r ZoldkeyZnewkeyr r r
rT A s
zParentNode.change_child_keyc C sJ y| j � j|�S tk
rD d}t||| j� t| j � �f ��Y nX d S )Nz#Can't find key %s in ParentNode %s
zParentNode items: %sz7Can't find key %s in ParentNode %s
ParentNode items: %s)r` �index�
ValueErrorr r- r. )r r? Z errorstringr r r
rQ G s zParentNode.get_child_indexc C sH | j |�}|dkrdS |d7 }| j� }|t|�k r@| j|| �S dS dS )z=Return the next child node in index order from the given key.Nr )rQ r` �lenra )r r? rf �
child_keysr r r
rX P s
zParentNode.next_childc C sD | j |�}|dkrdS | j� }|d8 }|dkr<| j|| �S dS dS )zAReturn the previous child node in index order from the given key.Nr r )rQ r` ra )r r? rf ri r r r
rY ` s
zParentNode.prev_childc C s | j � }| j|d �S )z+Return the first TreeNode in the directory.r )r` ra )r ri r r r
r o s zParentNode.get_first_childc C s | j � }| j|d �S )z*Return the last TreeNode in the directory.r ���)r` ra )r ri r r r
rE t s zParentNode.get_last_childc C s t | j� �dkS )z!Does this node have any children?r )rh r` )r r r r
rD y s zParentNode.has_children)NNN)F)F)r r r rF r r` r_ rb ra rc rd rT rQ rX rY r rE rD r r r r
r\ s
r\ c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
�
TreeWalkerzTListWalker-compatible class for displaying TreeWidgets
positions are TreeNodes.c C s
|| _ dS )z,start_from: TreeNode with the initial focus.N)rB )r �
start_fromr r r
r � s zTreeWalker.__init__c C s | j j� }|| j fS )N)rB r4 )r r r r r
� get_focus� s
zTreeWalker.get_focusc C s || _ | j� d S )N)rB Z _modified)r rB r r r
� set_focus� s zTreeWalker.set_focusc C s, |j � }|j� }|d kr dS ||j� fS d S )N)NN)r4 r7 r) )r rl r �targetr r r
�get_next� s
zTreeWalker.get_nextc C s, |j � }|j� }|d kr dS ||j� fS d S )N)NN)r4 r; r) )r rl r ro r r r
�get_prev� s
zTreeWalker.get_prevN) r r r rF r rm rn rp rq r r r r
rk ~ s rk c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )� TreeListBoxzPA ListBox with special handling for navigation and
collapsing of TreeWidgetsc C s | j j||�}| j||�S )N)Z_TreeListBox__superr= �unhandled_input)r r> r? r r r
r= � s zTreeListBox.keypressc C sX |dkr| j |� n@|dkr(| j|� n,|dkr<| j|� n|dkrP| j|� n|S dS )z Handle macro-navigation keysr r �home�endN)�move_focus_to_parent�collapse_focus_parent�
focus_home� focus_end)r r> �inputr r r
rs � s zTreeListBox.unhandled_inputc C s> | j j� \}}| j|� | j j� \}}||kr:| j|d� dS )zCollapse parent directory.r N)�bodyrm rv r= )r r> r �posZpwidgetZpposr r r
rw � s
z!TreeListBox.collapse_focus_parentc C s� | j j� \}}|j� }|dkr"dS | j|�\}}}|\}} }
} } |\}
}x4|D ],\}}}||8 }||krN| j|||� dS qNW | j||j� � dS )z(Move focus to parent of widget in focus.N)r{ rm r2 Zcalculate_visible� change_focus)r r> r r| � parentposZmiddle�topZbottom�
row_offsetZ focus_widgetZ focus_posZ
focus_rowsZcursorZtrim_topZ
fill_aboveZrowsr r r
rv � s z TreeListBox.move_focus_to_parentc C s& | j j� \}}|j� }| j||� dS )zMove focus to very top.N)r{ rm r[ r} )r r> r r| �rootnoder r r
rx � s zTreeListBox.focus_homec
C sL |\}}| j j� \}}|j� }|j� }|j� }|j� } | j|| |d � dS )zMove focus to far bottom.r N)r{ rm r[ r4 r9 r) r} )
r r> ZmaxrowZmaxcolr r| r� Z
rootwidgetZ
lastwidgetZlastnoder r r
ry � s zTreeListBox.focus_endN)
r r r rF r= rs rw rv rx ry r r r r
rr � s
rr )Z
__future__r r r" Z
urwid.wimpr � RuntimeErrorr Z
WidgetWrapr �objectrG r\ Z
ListWalkerrk ZListBoxrr r r r r
�<module> s Ue"
Mini Shell