shell bypass 403
UnknownSec Shell
:
/
snap
/
core22
/
current
/
lib
/
python3
/
dist-packages
/
urwid
/
__pycache__
/ [
drwxr-xr-x
]
upload
mass deface
mass delete
console
info server
name :
treetools.cpython-310.pyc
o ��o_7= � @ 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�|� 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 � zTreeWidget.selectablec C sL | � � }| jstjdd| j| jg| j f|gdd�}| �� }tj|d|d�S )N�fixed� )� dividechars)�relative�d )�width�left) �get_inner_widgetr �urwid�Columns�unexpanded_icon� expanded_iconr �get_indent_cols�Padding)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 �_w� base_widget� widget_listr r r r �update_expanded_iconH s ��z TreeWidget.update_expanded_iconc C s | j | �� �� S �N)r, �get_node� get_depthr r r r r* N s zTreeWidget.get_indent_colsc C s | j d u r | �� | _ | j S r1 )r �load_inner_widgetr r r r r% Q s zTreeWidget.get_inner_widgetc C s t �| �� �S r1 )r& �Text�get_display_textr r r r r4 V s z TreeWidget.load_inner_widgetc C � | j S r1 )r r r r r r2 Y � zTreeWidget.get_nodec C s | � � �� d t| � � �� � S )Nz: )r2 �get_key�str� get_valuer r r r r6 \ s �zTreeWidget.get_display_textc C s� | � � }|dur |S | �� }|�� }|�� }|du r:|dkr:|�� }|�� }|d8 }||�� ks2J �|du r:|dks |du r@dS |�� S )z5Return the next TreeWidget depth first from this one.Nr r )� first_childr2 � next_siblingr3 � get_parent� get_widget)r � firstchild�thisnode�nextnode�depthr r r � next_inorder` s �zTreeWidget.next_inorderc C sj | j }|�� }|dur|�� }|�� }|du r|S |S |�� }|du r)|dkr)dS |du r1|�� }|�� S )z9Return the previous TreeWidget depth first from this one.Nr )r � prev_siblingr? � last_childr3 r> )r rA �prevnode� prevwidget� lastchildrC r r r � prev_inorderw s zTreeWidget.prev_inorderc C sZ | j r|S |dv rd| _| �� dS |dkr d| _| �� dS | j�� r+| j�||�S |S )z2Handle expand & collapse requests (non-leaf nodes))r �rightTr FN)r r r0 r- r r �keypress�r �size�keyr r r rL � s zTreeWidget.keypressc C sH | j s |dks |dkr dS |dkr"|| �� kr"| j | _| �� dS dS )Nz mouse pressr Fr T)r r* r r0 )r rN �event�button�col�row�focusr r r � mouse_event� s zTreeWidget.mouse_eventc C s0 | j s| jsdS | j�� r| j�� }|�� S dS )z Return first child if expanded.N)r r r � has_childrenr r? )r � firstnoder r r r< � s zTreeWidget.first_childc C sF | j s| jsdS | j�� r| j�� �� }ndS |�� }|du r!|S |S )z Return last child if expanded.N)r r r rV �get_last_childr? rF )r rI �lastdescendantr r r rF � s zTreeWidget.last_childN)r r r �__doc__r, r r( r) r r r r0 r* r% r4 r2 r6 rD rJ rL rU r< rF 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 r1 )�_key�_parent�_value�_depth�_widget�r �value�parentrO rC r r r r � s zTreeNode.__init__Fc C �" | j du s |dkr| �� | _ | j S )z! Return the widget for this node.NT)r` � load_widget�r �reloadr r r r? � � zTreeNode.get_widgetc C s t | �S r1 )r r r r r re � s zTreeNode.load_widgetc C s@ | j d u r| jd u rd| _ | j S | j d u r | j�� d | _ | j S )Nr r )r_ r] r3 r r r r r3 � s �zTreeNode.get_depthc C s* | � � dkrd S | �� }| �� }|�|�S �Nr )r3 r9 r> �get_child_index)r rO rc r r r � get_index� s zTreeNode.get_indexc C r7 r1 �r\ r r r r r9 � r8 zTreeNode.get_keyc C s || _ d S r1 rl �r rO r r r �set_key� � zTreeNode.set_keyc C s | � � �| j|� d S r1 )r> �change_child_keyr\ rm r r r � change_key� s zTreeNode.change_keyc C s& | j d kr| �� dkr| �� | _ | j S ri )r] r3 � load_parentr r r r r> � s zTreeNode.get_parentc C � t d��)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)�(virtual function. Implement in subclass�r r r r r rr � r zTreeNode.load_parentc C r7 r1 )r^ r r r r r; r8 zTreeNode.get_valuec C s | � � dkS ri )r3 r r r r �is_root s zTreeNode.is_rootc C �" | � � dkr| �� �| �� �S d S ri )r3 r> � next_childr9 r r r r r= � zTreeNode.next_siblingc C rw ri )r3 r> � prev_childr9 r r r r rE ry zTreeNode.prev_siblingc C s( | }|� � d ur|� � }|� � d us|S r1 )r> )r �rootr r r �get_root s �zTreeNode.get_root�NNN�F)r r r rZ r r? re r3 rk r9 rn rq r> rr r; rv r= rE r| r r r r r[ � s" r[ 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)rc rO rC )r[ r � _child_keys� _childrenra r r r r s zParentNode.__init__Fc C rd )z,Return a possibly ordered list of child keysNT)r� �load_child_keysrf r r r �get_child_keys! rh zParentNode.get_child_keysc C rs )zPProvide ParentNode with an ordered list of child keys (virtual function)rt ru r r r r r� ' s zParentNode.load_child_keysc C s | � |�}|�� S )z8Return the widget for a given key. Create if necessary.)�get_child_noder? )r rO �childr r r �get_child_widget, s zParentNode.get_child_widgetc C s, || j vs |dkr| �|�| j |< | j | S )z<Return the child node for a given key. Create if necessary.T)r� �load_child_node)r rO rg r r r r� 2 s zParentNode.get_child_nodec C rs )z6Load the child node for a given key (virtual function)rt ru rm r r r r� 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 rO r r r r �set_child_node< s zParentNode.set_child_nodec C s< || j v r td| ��| j �|�| j |< | j | �|� d S )Nz%s is already in use)r� r �poprn )r �oldkey�newkeyr r r rp A s zParentNode.change_child_keyc C sB z| � � �|�W S ty d}t||| �� t| � � �f ��w )Nz7Can't find key %s in ParentNode %s ParentNode items: %s)r� �index� ValueErrorr r9 r: )r rO � errorstringr r r rj G s ��zParentNode.get_child_indexc C sD | � |�}|du r dS |d7 }| �� }|t|�k r | �|| �S dS )z=Return the next child node in index order from the given key.Nr )rj r� �lenr� �r rO r� � child_keysr r r rx P s zParentNode.next_childc C s@ | � |�}|du r dS | �� }|d8 }|dkr | �|| �S dS )zAReturn the previous child node in index order from the given key.Nr r )rj r� r� r� r r r rz ` s zParentNode.prev_childc C � | � � }| �|d �S )z+Return the first TreeNode in the directory.r �r� r� �r r� r r r r o � zParentNode.get_first_childc C r� )z*Return the last TreeNode in the directory.���r� r� r r r rX t r� zParentNode.get_last_childc C s t | �� �dkS )z!Does this node have any children?r )r� r� r r r r rV y s zParentNode.has_childrenr} r~ )r r r rZ r r� r� r� r� r� r� rp rj rx rz r rX rV 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)rT )r � start_fromr r r r � s zTreeWalker.__init__c C s | j �� }|| j fS r1 )rT r? )r r r r r � get_focus� s zTreeWalker.get_focusc C s || _ | �� d S r1 )rT � _modified)r rT r r r � set_focus� s zTreeWalker.set_focusc C �( |� � }|�� }|d u rdS ||�� fS �N)NN)r? rD r2 �r r� r �targetr r r �get_next� � zTreeWalker.get_nextc C r� r� )r? rJ r2 r� r r r �get_prev� r� zTreeWalker.get_prevN) r r r rZ r r� r� r� r� r r r r r� ~ s r� c @ sP e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dS )� TreeListBoxzPA ListBox with special handling for navigation and collapsing of TreeWidgetsc C s | j �||�}| �||�S r1 )�_TreeListBox__superrL �unhandled_inputrM r r r rL � s zTreeListBox.keypressc C s0 |dkr | � |� dS |dkr| �|� dS |S )z Handle macro-navigation keysr$ r N)�move_focus_to_parent�collapse_focus_parent)r rN �inputr r r r� � s zTreeListBox.unhandled_inputc C sB | j �� \}}| �|� | j �� \}}||kr | �|d� dS dS )zCollapse parent directory.r N)�bodyr� r� rL )r rN r �pos�pwidget�pposr r r r� � s �z!TreeListBox.collapse_focus_parentc C s� | j �� \}}|�� }|du rdS | �|�\}}}|\}} } } } |\} }|D ]\}}}||8 }||kr=| �|||� dS q&| �||�� � dS )z(Move focus to parent of widget in focus.N)r� r� r> �calculate_visible� change_focus)r rN r r� � parentpos�middle�top�bottom� row_offset� focus_widget� focus_pos� focus_rows�cursor�trim_top� fill_above�rowsr r r r� � s �z TreeListBox.move_focus_to_parentc C � | � |�S r1 )� focus_home�r rN r r r �_keypress_max_left� ro z TreeListBox._keypress_max_leftc C r� r1 )� focus_endr� r r r �_keypress_max_right� ro z TreeListBox._keypress_max_rightc C s& | j �� \}}|�� }| �||� dS )zMove focus to very top.N)r� r� r| r� )r rN r r� �rootnoder r r r� � s zTreeListBox.focus_homec C sT |\}}| j �� \}}|�� }|�� }|�� }|r(|�� } | �|| |d � dS dS )zMove focus to far bottom.r N)r� r� r| r? rF r2 r� ) r rN �maxrow�maxcolr r� r� � rootwidget� lastwidget�lastnoder r r r� � s �zTreeListBox.focus_endN) r r r rZ rL r� r� r� r� r� r� r� r r r r r� � s r� )� __future__r r r& � urwid.wimpr � RuntimeErrorr � WidgetWrapr �objectr[ r � ListWalkerr� �ListBoxr� r r r r �<module> s Ue"
© 2026 UnknownSec