o  o_7=ã@sddlmZmZ ddlZddlmZGdd„deƒZGdd„dejƒZ Gdd „d e ƒZ Gd d „d e ƒZ Gd d „d ej ƒZGdd„dejƒZdS)é)ÚdivisionÚprint_functionN)ÚSelectableIconc@s eZdZdS)ÚTreeWidgetErrorN)Ú__name__Ú __module__Ú __qualname__©r r ú1/usr/lib/python3/dist-packages/urwid/treetools.pyr&src@s eZdZdZdZeddƒZeddƒZdd„Zdd „Z d d „Z d d „Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„Zdd„Zdd„Zdd„Zd d!„Zd"d#„Zd$S)%Ú TreeWidgetz9A widget representing something in a nested tree display.éú+rú-cCs8||_d|_t|dƒ |_d|_| ¡}|j |¡dS)NÚget_first_childT)Ú_nodeÚ _innerwidgetÚhasattrÚis_leafÚexpandedÚget_indented_widgetÚ_TreeWidget__superÚ__init__)ÚselfÚnodeÚwidgetr r r r0s zTreeWidget.__init__cCs|j S)zS Allow selection of non-leaf nodes so children may be (un)expanded )r©rr r r Ú selectable8ózTreeWidget.selectablecCsL| ¡}|jstjdd|j|jg|jf|gdd}| ¡}tj|d|dS)NÚfixedé)Ú dividechars)Úrelativeéd)ÚwidthÚleft) Úget_inner_widgetrÚurwidÚColumnsÚunexpanded_iconÚ expanded_iconrÚget_indent_colsÚPadding)rrÚ indent_colsr r r r>sÿþþÿzTreeWidget.get_indented_widgetcCs |j|jg|j|jjjd<dS)z-Update display widget text for parent widgetsrN)r(r)rÚ_wÚ base_widgetÚ widget_listrr r r Úupdate_expanded_iconHsÿÿzTreeWidget.update_expanded_iconcCs|j| ¡ ¡S©N)r,Úget_nodeÚ get_depthrr r r r*NszTreeWidget.get_indent_colscCs|jdur | ¡|_|jSr1)rÚload_inner_widgetrr r r r%Qs  zTreeWidget.get_inner_widgetcCst | ¡¡Sr1)r&ÚTextÚget_display_textrr r r r4VszTreeWidget.load_inner_widgetcCó|jSr1)rrr r r r2YózTreeWidget.get_nodecCs | ¡ ¡dt| ¡ ¡ƒS)Nz: )r2Úget_keyÚstrÚ get_valuerr r r r6\sÿzTreeWidget.get_display_textcCsˆ| ¡}|dur |S| ¡}| ¡}| ¡}|dur:|dkr:| ¡}| ¡}|d8}|| ¡ks2J‚|dur:|dks|dur@dS| ¡S)z5Return the next TreeWidget depth first from this one.Nrr)Ú first_childr2Ú next_siblingr3Ú get_parentÚ get_widget)rÚ firstchildÚthisnodeÚnextnodeÚdepthr r r Ú next_inorder`sûzTreeWidget.next_inordercCsj|j}| ¡}|dur| ¡}| ¡}|dur|S|S| ¡}|dur)|dkr)dS|dur1| ¡}| ¡S)z9Return the previous TreeWidget depth first from this one.Nr)rÚ prev_siblingr?Ú last_childr3r>)rrAÚprevnodeÚ prevwidgetÚ lastchildrCr r r Ú prev_inorderwszTreeWidget.prev_inordercCsZ|jr|S|dvrd|_| ¡dS|dkrd|_| ¡dS|j ¡r+|j ||¡S|S)z2Handle expand & collapse requests (non-leaf nodes))r ÚrightTrFN)rrr0r-rrÚkeypress©rÚsizeÚkeyr r r rLs   zTreeWidget.keypresscCsH|js |dks |dkr dS|dkr"|| ¡kr"|j |_| ¡dSdS)Nz mouse pressrFrT)rr*rr0)rrNÚeventÚbuttonÚcolÚrowÚfocusr r r Ú mouse_events zTreeWidget.mouse_eventcCs0|js|jsdS|j ¡r|j ¡}| ¡SdS)zReturn first child if expanded.N)rrrÚ has_childrenrr?)rÚ firstnoder r r r<¨s   zTreeWidget.first_childcCsF|js|jsdS|j ¡r|j ¡ ¡}ndS| ¡}|dur!|S|S)zReturn last child if expanded.N)rrrrVÚget_last_childr?rF)rrIÚlastdescendantr r r rF³s  zTreeWidget.last_childN)rrrÚ__doc__r,rr(r)rrrr0r*r%r4r2r6rDrJrLrUr<rFr r r r r *s(    r c@sŒeZdZdZd"dd„Zd#dd„Zdd „Zd d „Zd d „Zdd„Z dd„Z dd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„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 NcCs"||_||_||_||_d|_dSr1)Ú_keyÚ_parentÚ_valueÚ_depthÚ_widget©rÚvalueÚparentrOrCr r r rÍs  zTreeNode.__init__FcCó"|jdus |dkr| ¡|_|jS)z! Return the widget for this node.NT)r`Ú load_widget©rÚreloadr r r r?Ôó zTreeNode.get_widgetcCst|ƒSr1)r rr r r reÚszTreeNode.load_widgetcCs@|jdur|jdurd|_|jS|jdur|j ¡d|_|jS)Nrr)r_r]r3rr r r r3Ýs  þzTreeNode.get_depthcCs*| ¡dkrdS| ¡}| ¡}| |¡S©Nr)r3r9r>Úget_child_index)rrOrcr r r Ú get_indexäs  zTreeNode.get_indexcCr7r1©r\rr r r r9ìr8zTreeNode.get_keycCs ||_dSr1rl©rrOr r r Úset_keyïó zTreeNode.set_keycCs| ¡ |j|¡dSr1)r>Úchange_child_keyr\rmr r r Ú change_keyòszTreeNode.change_keycCs&|jdkr| ¡dkr| ¡|_|jSri)r]r3Ú load_parentrr r r r>õs zTreeNode.get_parentcCótdƒ‚)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©rrr r r rrúrzTreeNode.load_parentcCr7r1)r^rr r r r;r8zTreeNode.get_valuecCs | ¡dkSri)r3rr r r Úis_roots zTreeNode.is_rootcCó"| ¡dkr| ¡ | ¡¡SdSri)r3r>Ú next_childr9rr r r r=ó zTreeNode.next_siblingcCrwri)r3r>Ú prev_childr9rr r r rE ryzTreeNode.prev_siblingcCs(|}| ¡dur| ¡}| ¡dus|Sr1)r>)rÚrootr r r Úget_roots   ÿzTreeNode.get_root©NNN©F)rrrrZrr?rer3rkr9rnrqr>rrr;rvr=rEr|r r r r r[Äs"   r[c@s†eZdZdZd dd„Zd!dd„Zdd „Zd d „Zd!d d „Zdd„Z dd„Z dd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„ZdS)"Ú ParentNodez"Maintain sort order for TreeNodes.NcCs$tj|||||dd|_i|_dS)N)rcrOrC)r[rÚ _child_keysÚ _childrenrar r r rs zParentNode.__init__FcCrd)z,Return a possibly ordered list of child keysNT)r€Úload_child_keysrfr r r Úget_child_keys!rhzParentNode.get_child_keyscCrs)zPProvide ParentNode with an ordered list of child keys (virtual function)rtrurr r r r‚'szParentNode.load_child_keyscCs| |¡}| ¡S)z8Return the widget for a given key. Create if necessary.)Úget_child_noder?)rrOÚchildr r r Úget_child_widget,s zParentNode.get_child_widgetcCs,||jvs |dkr| |¡|j|<|j|S)zÚcalculate_visibleÚ change_focus)rrNrrªÚ 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_parentcCó | |¡Sr1)Ú focus_home©rrNr r r Ú_keypress_max_leftÒrozTreeListBox._keypress_max_leftcCr»r1)Ú focus_endr½r r r Ú_keypress_max_rightÕrozTreeListBox._keypress_max_rightcCs&|j ¡\}}| ¡}| ||¡dS)zMove focus to very top.N)r©r™r|r®)rrNrrªÚrootnoder r r r¼ØszTreeListBox.focus_homec CsT|\}}|j ¡\}}| ¡}| ¡}| ¡}|r(| ¡} | || |d¡dSdS)zMove focus to far bottom.rN)r©r™r|r?rFr2r®) rrNÚmaxrowÚmaxcolrrªrÁÚ rootwidgetÚ lastwidgetÚlastnoder r r r¿ßsýzTreeListBox.focus_endN) rrrrZrLr¥r§r¦r¾rÀr¼r¿r r r r r£ s   r£)Ú __future__rrr&Ú urwid.wimprÚ RuntimeErrorrÚ WidgetWrapr Úobjectr[rÚ ListWalkerr—ÚListBoxr£r r r r Ús Ue"