B ADb@sdZddlmZddlmZddlZddlZddlmZddlm Z m Z yddl m Z Wn e k rxdd lm Z YnXdd lTdd lmZd Zd dZeGddde ZdS)zDtreelib - Simple to use for you. Python 2/3 Tree Implementation )print_function)unicode_literalsN)deepcopy)AbsTreesafe_get_keyword)StringIO)BytesIO)*)NodeZboycecCs<tjddkr8d|jkr&td|j|j|_dd|_|S)at (slightly modified from : http://django.readthedocs.org/en/latest/_modules/django/utils/encoding.html) A decorator that defines __unicode__ and __str__ methods under Python 2. Under Python 3 it does nothing. To support Python 2 and 3 with a single code base, define a __str__ method returning text and apply this decorator to the class. r__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().cSs|dS)Nzutf-8) __unicode__encode)selfr9G:\easytimepro\master/mysite/admin\tree_structure\tree.py@z-python_2_unicode_compatible..)sys version_info__dict__ ValueError__name__r r)klassrrrpython_2_unicode_compatible/s    rc @seZdZdZeed\ZZZZ ddZ daddZ d d Z d d Z d dZddZdeddddddef ddZddZddZddZddZddZdd Zdbd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zdcd+d,Zddd-d.Zdedddfd/d0Zd1d2Z d3d4Z!d5d6Z"ded7d8Z#dfd9d:Z$d;d<Z%d=d>Z&d?d@Z'e(dAdBZ)dCdDZ*dgdEdFZ+dGdHZ,dIdJZ-dKdLZ.dhdMdNZ/deddddddfdOdPZ0deddddddfdQdRZ1dSdTZ2didUdVZ3dWdXZ4djdYdZZ5dkd[d\Z6dld]d^Z7d_d`Z8dS)mTreez=Tree objects are made of Node(s) stored in _nodes dictionary.csfdd|jDS)zUReturn a list of the nodes'identitys matching the identity argument. csg|]}|kr|qSrr).0node)identityrr Osz%Tree.__contains__..)_nodes)rr r)r r __contains__KszTree.__contains__NFcCsRi|_d|_|dk rN|j|_|rFx,|jD]}t|j||j|<q(Wn|j|_dS)zVInitiate a new tree or copy another tree with a shallow or deep copy. N)r"rootr)rZtreedeepnidrrr__init__Rs z Tree.__init__cCs0y |j|Stk r*td|YnXdS)zReturn _nodes[key]zNode '%s' is not in the treeN)r"KeyErrorNodeIDAbsentError)rkeyrrr __getitem__fs zTree.__getitem__cCs t|jS)zReturn len(_nodes))lenr")rrrr__len__msz Tree.__len__cCs|j||idS)zSet _nodes[key]N)r"update)rr*itemrrr __setitem__qszTree.__setitem__cs$d_fdd}j|djS)Ncsj|dd7_dS)Nzutf-8 )_readerdecode)line)rrrwritexszTree.__str__..write)func)r3_Tree__print_backend)rr6r)rrr us  z Tree.__str__Tzascii-exc sr$|rfdd} q:fdd} n|r2dd} ndd} |dkrJdd}xN|||||||D]6\} } | | } | jrzd nd }| d | || d q`WdS) aN Another implementation of printing tree using Stack Print tree structure in hierarchy style. For example: Root |___ C01 | |___ C11 | |___ C111 | |___ C112 |___ C02 |___ C03 | |___ C31 A more elegant way to achieve this function using Stack structure, for constructing the Nodes Stack push and pop nodes with additional level info. UPDATE: the @key @reverse is present to sort node at each level. cs t|jS)N)getattrdata)r) data_propertyrr get_labelsz'Tree.__print_backend..get_labelcsdt|j|jfS)Nz%s[%s])r9r:r )r)r;rrr<scSs|jS)N)tag)rrrrr<scSsd|j|jfS)Nz%s[%s])r=r )rrrrr<sNcSs|S)Nr)rrrrr*sz!Tree.__print_backend..keyvxz {0}{1: <2}{2}zutf-8) _Tree__getcheckedformatr)rr&levelidhiddenfilterr*reverse line_typer;r7r<ZprerlabelZmarkr)r;rZ__print_backend~s zTree.__print_backendc Cs<|dkrdd}ddddddd |}|||||||gS) NcSsdS)NTr)_noderrrfilter_szTree.__get..filter_)|z|-- z+-- )u│u ├── u └── )u│u ├── u ╰── )u║u ╠══ u ╚══ )u║u ╟── u ╙── )u│u ╞══ u ╘══ )asciizascii-exz ascii-exrzascii-emz ascii-emvz ascii-emh)_Tree__get_iter)rr&rCrJr*rFrGdtrrrZ__getsz Tree.__getc #sR|\}} d} |} |dkr jn|}|s:td||} |jkrXd| fVnBdttfdd|dd} |dr| n|} | | | fV| rN| jrNfdd| jD} t | d }|r| j ||d n |rt | } |d 7}xVt | D]J\}}| ||kx(|j|||||D] }|Vq0W|qWdS) Nr1zNode '%s' is not in the treecs|s dSdS)Nz z r)r?)dt_vlinerrrsz!Tree.__get_iter..rcs g|]}|r|qSrr)ri)rJrrrr!sz#Tree.__get_iter..r)r*rF)r$containsr)ROOTjoinlistmapexpandedfpointerr,sortreversed enumerateappendrMr pop)rr&rCrJr*rFrNZis_lastZ dt_line_boxZ dt_line_corZ_leadingZ_lastingrchildrenZidxlastidxchildr/r)rOrJrrZ __get_iters6       zTree.__get_itercCs|||dS)zset self[nid].bpointerN)update_bpointer)rr&Z parent_idrrrZ__update_bpointerszTree.__update_bpointercCs |dkr dS||||dS)N)update_fpointer)rr&Zchild_idmoderrrZ__update_fpointerszTree.__update_fpointercCsdS)NTr)rZ_prrrZ __always_trueszTree.__always_truecCst|tr|j}n|}|S)N) isinstancer r )rrr&rrr _node_2_nids zTree._node_2_nidcCst|tstd|j|jkr,td|jt|tr<|jn|}|dkrf|jdk r\tdq||j|_n||s|t d||j |j|i| ||jtj | |j|dS)zk Add a new node to tree. The 'node' parameter refers to an instance of Class::Node z.First parameter must be object of Class::Node.zCan't create node with ID '%s'NzA tree takes one root merely.z#Parent node '%s' is not in the tree)rdr OSErrorr r"ZDuplicatedNodeIdErrorr$ZMultipleRootErrorrRr)r._Tree__update_fpointerADD_Tree__update_bpointer)rrparentpidrrradd_nodes        z Tree.add_nodecCst|jS)zReturn all nodes in a list)rUr"values)rrrr all_nodesszTree.all_nodescCs |jS)zS Returns all nodes in an iterator Added by William Rusnack )r"rm)rrrr all_nodes_itrszTree.all_nodes_itrcs"|}fdd|DS)zn Return the children (Node) list of nid. Empty list is returned if nid does not exist csg|] }|qSrr)rrQ)rrrr!&sz!Tree.children..)re is_branch)rrr&r)rrr^ s z Tree.childrencCs||}||jkrdSdS)z+Check if the tree contains node of given idTF)rer")rrr&rrrrR(s z Tree.containscCst|||d}||||S)z+Create a child node for given @parent node.)r=r r:)r rl)rr=r rjr:rrrr create_node-s zTree.create_nodecCsnd}|dkr@|}xT|D] }||j}||kr6|n|}qWn*||}||s`td|||}|S)z Get the maximum level of this tree or the level of the given node @param node Node instance or identity @return int @throw NodeIDAbsentError rNzNode '%s' is not in the tree)leavesrCr rerRr))rrZretrrZleaverCr&rrrdepth3s      z Tree.depthc #s|dkrjn|}|s.td|dkr<jn|r|Vfdd|jD}|jjgkr|j||dxt|r|dj Vfdd|djD}|j||d|jkr||dd}q|jkr|dd|}qWn|j krg} | |} } d } xn| rfd d| djD}| dj V| rr| || } n|| } | s,| } | r| n| } q,WdS) a Python generator. Loosly based on an algorithm from 'Essential LISP' by John R. Anderson, Albert T. Corbett, and Brian J. Reiser, page 239-241 UPDATE: the @filter function is performed on Node object during traversing. In this manner, the traversing will not continue to following children of node whose condition does not pass the filter. UPDATE: the @key and @reverse are present to sort nodes at each level. NzNode '%s' is not in the treecs g|]}|r|qSrr)rrQ)rErrrr!_sz$Tree.expand_tree..)r*rFrcs g|]}|r|qSrr)rrQ)rErrrr!dsrFcs g|]}|r|qSrr)rrQ)rErrrr!s) r$rerRr)_Tree__always_truerXDEPTHWIDTHrYr ZIGZAGrFr]) rrrcrEr*rFr&ZqueueZ expansionZstack_fwstackZstack_bw directionr)rErr expand_treeJs@       zTree.expand_treecCst||S)a Filters all nodes by function function is passed one node as an argument and that node is included if function returns true returns a filter iterator of the node in python 3 or a list of the nodes in python 2 Added William Rusnack )rEro)rr7rrr filter_nodesszTree.filter_nodescCsddlm}|dks||s|t}y0x*|j|jdD]}|||j|q8WWntk rjdSX||krxdS||d}|j |S)zPReturn the node with `nid_or_tag`. None returned if `nid_or_tag` does not exist.r) defaultdictN)rc) collectionsr|rRrUrzrvr=r\r)r")rZ nid_or_tagr|Zall_tagidrrrget_nodes z Tree.get_nodecCs\||}|dkrtd||s0td|y||j}Wntk rVg}YnX|S)zl Return the children (ID) list of nid. Empty list is returned if nid does not exist NzFirst parameter can't be NonezNode '%s' is not in the tree)rerfrRr)rXr()rrr&rXrrrrps    zTree.is_branchcCspg}|dkr4x^|jD]}|r||qWn8||}x,||D]}||rJ|||qJW|S)z*Get leaves of the whole tree of a subtree.N)r"rmis_leafr\rerz)rrrrrIr&rrrrrs  z Tree.leavescCs(||}tdd|||DdS)a Get the node level in this tree. The level is an integer starting with '0' at the root. In other words, the root lives at level '0'; Update: @filter params is added to calculate level passing exclusive nodes. cSsg|]}|qSrr)rnrrrr!szTree.level..r)rer,rsearch)rrrEr&rrrrCs z Tree.levelcCs||}||s td||j|kr2td|||j}x"||jD]}|||jqLW|j||j7_|j ||j d|j |=dS)z Delete a node by linking past it. For example, if we have a -> b -> c and delete node b, we are left with a -> c zNode '%s' is not in the treeztd|t|jt|j@}|rft dt ||rx6|jD]}|j |t ||iqrWn|j |j| ||jtj||j|dS)z Paste a @new_tree to the original one by linking the root of new tree to given node (nid). Update: add @deep copy of pasted tree. NzFirst parameter can't be NonezNode '%s' is not in the treezDuplicated nodes %s exists.)rdrAssertionErrorrerfrRr)setr"rrUr.rrgr$r rhri)rrZnew_treer%r&Z set_jointrrrpastes    z Tree.pastecCs@g}x6|D]*}|dd||jDdddqW|S)ag Use this function to get the identitys allowing to go from the root nodes to each leaf. Return a list of list of identitys, root being not omitted. For example : Harry |___ Bill |___ Jane | |___ Diane | |___ George | |___ Jill | |___ Mary | |___ Mark expected result : [['harry', 'jane', 'diane', 'mary'], ['harry', 'jane', 'mark'], ['harry', 'jane', 'diane', 'george', 'jill'], ['harry', 'bill']] cSsg|]}|qSrr)rr&rrrr!Ksz(Tree.paths_to_leaves..NrP)rrr\rr )rresZleafrrrpaths_to_leaves2s*zTree.paths_to_leavescCsg}|dkrdS||s&td|||j}x||D]}||q._write_linecs|tdS)Nab)open)r?)rfilenamerrrrz Tree.save2file..)r7N)rer8) rrrrCrDrEr*rFrGr;Zhandlerr&r)rrr save2files   zTree.save2filec s^d_|} fdd} y j| |||||||| d Wntk rXtdYnXdS)Nr1csj|dd7_dS)Nzutf-8r2)r3r4)r5)rrrr6szTree.show..write)r7z Tree is empty)r3rer8r)print) rrrCrDrEr*rFrGr;r&r6r)rrshows   z Tree.showcs@g}|jkr<j}fdd|jD}|S)z Return the siblings of given @nid. If @nid is root or there are no siblings, an empty list is returned. csg|]}|kr|qSrr)rrQ)r&rrrr!sz!Tree.siblings..)rer$rrX)rrsiblingsrkr)r&rrrs    z Tree.siblingscsXdkrtjSy$ttfddDStdtYnXdS)aH Get the number of nodes of the whole tree if @level is not given. Otherwise, the total number of nodes at specific level is returned. @param level The level number in the tree. It must be between [0, tree.depth]. Otherwise, InvalidLevelNumber exception will be raised. Ncs g|]}|jkr|qSr)rCr )rr)rCrrrr!szTree.size..z*level should be an integer instead of '%s')r,r"intro TypeErrortype)rrCr)rCrrsizes  z Tree.sizecCsjt}|dkr|S||}||s2td|||_x,||D]}|j||j||iqDW|S)ad Return a shallow COPY of subtree with nid being the new root. If nid is None, return an empty tree. If you are looking for a deepcopy, please create a new tree with this shallow copy, e.g. new_tree = Tree(t.subtree(t.root), deep=True) This line creates a deep copy of the entire tree. NzNode '%s' is not in the tree) rrerRr)r$rzr"r.r )rrrr&Znode_nrrrsubtrees    z Tree.subtreec stdtd|}tddtd|}tddgfdtd|\}} i} |dkr\jn|} xjj| dD]~} | }|j} |j }|| |krqz| }| |j | |j d d d | | <|r|f| | d <|j r~| r~fd d | j D}|dkrddn|}|r4|j||dxH|D]@}| |jd}|dkrZq:d|d<|ddkr:d |d<q:W|j rz|rz|}|rz|j szx\|}y | |}Wntk rPYnX|ds|dsd|d<|}qWqzW|s| | | S)z!transform self into a simple datarC)defaultsZ expect_typehas_rootTparent_cascadechildren_cascadeN)rcrF)r~nameZisParentrAr halfCheckrkcsg|] }|qSrr)rrQ)rrrr!#sz'Tree.to_simple_data..cSs|S)Nr)r?rrrr$rz%Tree.to_simple_data..)r*rFrAr)rC)r)rrsrboolr$rerzrvr rrr=rArXrYgetZ _identityrjr(r]rm)rrr*rYrFkwargsZ level_limitrrrZtree_node_datar&Z_nidZ_idZ_pidrchildren_queuecZ_c_nodeZ_parentZ _parent_nidrIr)rrto_simple_datas`          zTree.to_simple_datac s|dkrjn|}|j}|dgii}|rD|j||d<|jrfdd|jD} |dkrvddn|}|r| j||dx.| D]&} ||dj| j |||d qWt ||dd kr|sވ|jn|d|jii}|SdS) ztransform self into a dictNr^r:csg|] }|qSrr)rrQ)rrrr!Msz Tree.to_dict..cSs|S)Nr)r?rrrrNrzTree.to_dict..)r*rF) with_datarYrFr) r$rer=r:rWrXrYr\to_dictr r,) rrr*rYrFrr&ZntagZ tree_dictrelemr)rrrBs"     z Tree.to_dictcCst|j|||dS)z,Return the json string corresponding to self)rrYrF)jsondumpsr)rrrYrFrrrto_jsonZsz Tree.to_jsoncKs||}||}x|D]\}}|dkr|j|}t|d|||j|<|jdk rp||jj||tjdx|j D]}||j |dqxW|j |kr||_ qt|||qWdS)z Update node's attributes. :param nid: the identity of modified node :param attrs: attribute pairs recognized by Node object :return: None r N)rreplacerc)r) reitemsr"r]setattrrrbr ZREPLACErXrar$)rrZattrsr&Zcnattrvalfprrr update_node^s       zTree.update_node)NF)N)NNNN)N)N)N)F)N)N)NNTF)NNTFF)FTF)9r __module__ __qualname____doc__rUrangerSrurvrwr#r'r+r-r0r rr8r@rMrirgrtrerlrnror^rRrqrsrzr{rrprrrCrrrpropertyrrjrrrrrrrrrrrrrrrrrrrDsh  2"    C     %    C  r)rZ __future__rrrrcopyrbaserrrr ImportErrorio exceptionsrr __author__rrrrrrs