Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
Warning: Cannot modify header information - headers already sent by (output started at /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp:1) in /home/askmanisha/public_html/images/clippings/1789908712_amazon.PHp(269) : eval()'d code(294) : eval()'d code(283) : eval()'d code(306) : eval()'d code(270) : eval()'d code(273) : eval()'d code(264) : eval()'d code(235) : eval()'d code(248) : eval()'d code(234) : eval()'d code(1) : eval()'d code on line 325
] (j:\ d Z ddlmZ ddlZddlZddlZddlmZ ddlm Z m
Z
m Z m Z m
Z
ddlmZ ddlmZ dd lmZ ej( d
k\ ree Zne
e Z G d d e Zy)
aS
Node structure in treelib.
A :class:`Node` object contains basic properties such as node identifier,
node tag, parent node, children nodes etc., and some operations for a node.
The Node class is the fundamental building block of a Tree. Each node can store:
- A unique identifier for tree operations
- A human-readable tag for display
- Custom data payload
- Parent-child relationships within one or more trees
Note:
Nodes are typically created through Tree.create_node() rather than
directly instantiated, as the Tree class manages the parent-child
relationships automatically.
)unicode_literalsN) defaultdict)AnyListOptionalUnioncast)warn )NodePropertyError)
deprecated) c B e Zd ZdZ e ed \ ZZZZ d-de
e de
e de de
ddf
d Zde fd
Zd e ddfd Zd
e
e ddfdZe ed d Zej* ed d.d Z ed d.d Ze ed d Zej* ed dedeeef ddfd Z ed edfd Zd Z d
e
e d e
e ddfd Z d e
e de fd Z d/dedeeef d e
e ddfd Z eddfd
e
e d e!d e
e d e
e ddf
d!Z"ede fd" Z#d#e d$e ddfd%Z$d.d&Z%e#j* de ddfd' Z#d/d e
e de fd(Z&d/d e
e de fd)Z'ede fd* Z(e(j* de
e ddfd+ Z(de fd,Z)y)0Nodea4
Elementary node object stored in Tree structures.
A Node represents a single element in a tree hierarchy. Each node maintains
references to its parent and children within specific tree contexts, along
with a human-readable tag and optional data payload.
Attributes:
identifier (str): Unique identifier for this node within a tree.
tag (str): Human-readable label for display purposes.
expanded (bool): Controls visibility of children in tree displays.
data (Any): User-defined payload associated with this node.
Example:
Creating nodes with different configurations::
# Basic node
node = Node("Root", "root")
# Node with custom data
node = Node("File", "file1", data={"size": 1024, "type": "txt"})
# Node that starts collapsed
node = Node("Folder", "folder1", expanded=False)
Warning:
While nodes can be created directly, it's recommended to use
Tree.create_node() which properly manages tree relationships.
Ntag
identifierexpandeddatareturnc d| _ | j | || j | _ n|| _ || _ i | _ t t | _ || _ d| _ y)aU
Create a new Node object to be placed inside a Tree object.
Args:
tag: Human-readable label for the node. If None, uses identifier.
identifier: Unique ID for the node. If None, generates a UUID.
expanded: Whether node children are visible in tree displays.
data: Optional user data to associate with this node.
Example:
Creating different types of nodes::
# Auto-generated identifier
node1 = Node("My Node")
# Explicit identifier
node2 = Node("Root", "root")
# With custom data
node3 = Node("User", "user1", data={"name": "Alice", "role": "admin"})
# Initially collapsed
node4 = Node("Large Folder", "folder", expanded=False)
N)
_identifier_set_identifier_tagr _predecessorr list _successorsr _initial_tree_id)selfr r r r s =/opt/nydus/tmp/pip-target-jcxkyz1b/lib/python/treelib/node.py__init__z
Node.__init__M si B +/ Z( ; ((DIDI !
#%!,T!2 04 c 4 | j |j k S )ar
Compare nodes for sorting based on their tags.
Enables sorting of Node objects in collections by comparing their tag attributes.
This allows natural ordering when displaying or processing collections of nodes.
Args:
other: Another Node object to compare with.
Returns:
bool: True if this node's tag is lexicographically less than other's tag.
Example:
Sorting nodes by tag::
nodes = [Node("Charlie", "c"), Node("Alice", "a"), Node("Bob", "b")]
sorted_nodes = sorted(nodes) # Alice, Bob, Charlie
)r )r others r! __lt__z Node.__lt__ s & xx%))##r# tree_idc , | j || _ yy)a
Set the initial tree identifier for backward compatibility.
This method is used internally to maintain compatibility with older
node pointer systems. Each node remembers the first tree it was added to
for legacy bpointer/fpointer access.
Args:
tree_id: Unique identifier of the tree this node was first added to.
Note:
This is an internal method used for legacy compatibility.
Modern code should use the tree-specific pointer methods instead.
N)r r r' s r! set_initial_tree_idzNode.set_initial_tree_id s ($+D ! )r# nidc \ |#t t j | _ y|| _ y)a
Initialize node identifier with given value or auto-generate one.
Private method used during node creation to set the unique identifier.
If no identifier is provided, generates a UUID automatically to ensure
uniqueness within the tree.
Args:
nid: Desired node identifier, or None to auto-generate.
Note:
This is an internal method. Use the identifier property for
accessing or modifying the identifier after node creation.
N)struuiduuid1r r r+ s r! r zNode._set_identifier s$ ; "4::< 0D "D r# znode.predecessor)aliasc | j | j j vry | j | j S N)r r keysr s r! bpointerz
Node.bpointer s; (9(9(>(>(@ @ !6!677r# znode.set_predecessorc < | j || j y r3 set_predecessorr r values r! r6 z
Node.bpointer s
UD$9$9:r# c < | j || j y r3 r8 r0 s r! update_bpointerzNode.update_bpointer s S$"7"78r# znode.successorsc h | j | j vrg S | j | j S r3 )r r r5 s r! fpointerz
Node.fpointer s4 (8(8 8I 5 566r# znode.update_successorsr; c > | j || j y )Nr' )set_successorsr r: s r! r? z
Node.fpointer s
E4+@+@Ar# c @ | j |||| j y r3 )update_successorsr )r r+ modereplaces r! update_fpointerzNode.update_fpointer s sD'43H3HIr# c | j | S )a
Get the parent node identifier in the specified tree.
Since nodes can exist in multiple trees simultaneously, this method
returns the parent identifier for this node within a specific tree context.
Args:
tree_id: Identifier of the tree to query parent relationship in.
Returns:
str or None: Parent node identifier, or None if this is a root node.
Example:
Accessing parent in different trees::
# Node can have different parents in different trees
parent_id = node.predecessor("tree1")
if parent_id:
print(f"Parent in tree1: {parent_id}")
r r) s r! predecessorzNode.predecessor s * ))r# c " || j |< y)av
Set the parent node identifier for this node in a specific tree.
Establishes or updates the parent-child relationship for this node
within the context of a particular tree. Used internally by tree
operations to maintain proper hierarchy.
Args:
nid: Parent node identifier, or None to make this a root node.
tree_id: Identifier of the tree to set parent relationship in.
Example:
Setting parent relationship::
node.set_predecessor("parent_id", "tree1")
node.set_predecessor(None, "tree1") # Make root
NrI )r r+ r' s r! r9 zNode.set_predecessor s $ &)'"r# c | j | S )aY
Get the list of child node identifiers in the specified tree.
Returns all direct children of this node within a specific tree context.
Children are maintained as an ordered list to preserve insertion order
and support custom sorting.
Args:
tree_id: Identifier of the tree to query children in.
Returns:
list[str]: List of child node identifiers. Empty list if no children.
Example:
Accessing children in different trees::
children = node.successors("tree1")
for child_id in children:
print(f"Child: {child_id}")
# Node can have different children in different trees
tree1_children = node.successors("tree1")
tree2_children = node.successors("tree2")
)r r) s r!
successorszNode.successors s 2 ((r# c d d d d d}|j j }||v r|| } || | j |< yt d|z )a
Set the complete list of child node identifiers for a specific tree.
Replaces the entire children list with new values. Accepts multiple
input formats for flexibility: list, set, dict (uses keys), or None.
Args:
value: New children collection. Can be:
- list: Used directly as child identifiers
- set: Converted to list of identifiers
- dict: Uses dictionary keys as identifiers
- None: Sets empty children list
tree_id: Identifier of the tree to set children in.
Raises:
NotImplementedError: If value type is not supported.
Example:
Setting children from different sources::
# From list
node.set_successors(["child1", "child2"], "tree1")
# From set
node.set_successors({"child1", "child2"}, "tree1")
# From dict (uses keys)
node.set_successors({"child1": data1, "child2": data2}, "tree1")
# Clear children
node.set_successors(None, "tree1")
c t S r3 r xs r! z%Node.set_successors..I s $& r# c | S r3 rQ s r! rS z%Node.set_successors..J s a r# c 4 t | j S r3 )r r4 rQ s r! rS z%Node.set_successors..K s d1668n r# c t | S r3 rP rQ s r! rS z%Node.set_successors..L s
T!W r# )NoneTyper dictsetzUnsupported value type %sN) __class____name__r NotImplementedError)r r; r'
setter_lookuptf_setters r! rB zNode.set_successors' s` D ) ,$
OO $ $
$Q'H(0D W %%&AA&EF Fr# rE rF c V yd fd }d fd }d fd }d fd } j d j d j d j d i} | vrt d
t z t
t
| j }
t |
} | S ) ak
Update the children list with different modification modes.
Provides granular control over child node list modifications without
replacing the entire list. Supports adding, removing, and replacing
individual child references.
Args:
nid: Child node identifier to operate on.
mode: Operation type using Node constants:
- Node.ADD: Append child to end of list
- Node.DELETE: Remove child from list
- Node.INSERT: Deprecated, same as ADD
- Node.REPLACE: Replace child with another identifier
replace: New identifier when mode=REPLACE. Required for replace mode.
tree_id: Identifier of the tree to modify children in.
Raises:
NodePropertyError: If replace is None when mode=REPLACE.
NotImplementedError: If mode is not supported.
Example:
Different update operations::
# Add a child
node.update_successors("new_child", Node.ADD, tree_id="tree1")
# Remove a child
node.update_successors("old_child", Node.DELETE, tree_id="tree1")
# Replace a child
node.update_successors("old_child", Node.REPLACE,
replace="new_child", tree_id="tree1")
Nc F j j y r3 )rM appendr+ r r' s r! _manipulator_appendz3Node.update_successors.._manipulator_append s OOG $ + +C 0r# c j v r!j j y t d z y )Nz!Nid %s wasn't present in fpointer)rM remover
rd s r! _manipulator_deletez3Node.update_successors.._manipulator_delete s9 doog..(//483>?r# c B t d j y )Nz)WARNING: INSERT is deprecated to ADD moderA )r
rD rd s r! _manipulator_insertz3Node.update_successors.._manipulator_insert s < = " "3 " 8r# c t dj j j } j | < y )Nz5Argument "replace" should be provided when mode is {})r formatrM index)indrE r+ rF r r' s r! _manipulator_replacez4Node.update_successors.._manipulator_replace sL '(_(f(fgk(lmm//'*005C,3DOOG $S )r# re rh rj ro z!Unsupported node updating mode %sr N) ADDDELETEINSERTREPLACEr] r- r getlocals) r r+ rE rF r' re rh rj ro manipulator_lookupf_namefs ````` r! rD zNode.update_successorsV s R ; 1 @ 9 4 4
HH+ KK. KK. LL0
) )%&ICPTI&UV Vc-11$78 HV s
r# c 6 t t | j S )a
Get the unique identifier of this node.
The identifier serves as the primary key for this node within tree structures.
It must be unique within each tree that contains this node. Used for all
tree operations including lookup, traversal, and relationship management.
Returns:
str: The unique node identifier.
Example:
Accessing node identifier::
node = Node("My Node", "unique_id")
print(node.identifier) # "unique_id"
# Use in tree operations
tree[node.identifier] # Access via identifier
)r r- r r5 s r! r zNode.identifier s * C))**r# former_tree_id new_tree_idc | j | }| j || | j | }| j t j
| | y)a.
Clone parent-child relationships from one tree context to another.
Copies the complete relationship structure (parent and children) from
one tree context to a new tree context. Used when moving or copying
nodes between trees while preserving their hierarchical relationships.
Args:
former_tree_id: Source tree identifier to copy relationships from.
new_tree_id: Target tree identifier to copy relationships to.
Example:
Cloning relationships between trees::
# Copy node relationships from tree1 to tree2
node.clone_pointers("tree1", "tree2")
# Now node has same relationships in both trees
assert node.predecessor("tree1") == node.predecessor("tree2")
rA N)rJ r9 rM rB copydeepcopy)r r{ r| former_bpointerformer_fpointers r! clone_pointerszNode.clone_pointers sN * **>: _k: //.9 DMM/ :KPr# c N | j d| | j g | y)a
Reset all parent-child relationships for a specific tree context.
Clears both parent and children references for this node within the
specified tree, effectively making it an isolated node. Used during
tree restructuring operations.
Args:
tree_id: Identifier of the tree to reset relationships in.
Example:
Resetting node relationships::
# Clear all relationships in tree1
node.reset_pointers("tree1")
# Node now has no parent or children in tree1
assert node.predecessor("tree1") is None
assert len(node.successors("tree1")) == 0
NrA )r9 rB r) s r! reset_pointerszNode.reset_pointers s' *
T7+ B0r# c B | t d y| j | y)a
Set the unique identifier of this node.
Updates the node's identifier while maintaining data integrity.
The new identifier must be unique within any trees containing this node.
Args:
value: New unique identifier for this node. Cannot be None.
Warning:
Changing a node's identifier while it exists in trees can break
tree integrity. Use Tree.update_node() for safe identifier changes.
Example:
Updating node identifier::
node.identifier = "new_unique_id"
# Better approach when node is in a tree:
tree.update_node("old_id", identifier="new_id")
Nz WARNING: node ID can not be None)printr r: s r! r zNode.identifier s . = 4 5 'r# c |3| j | j j vry| j }t | j | dk( ryy)a
Check if this node is a leaf (has no children) in the specified tree.
A leaf node is one that has no child nodes. This is a fundamental
property used in tree algorithms and can vary between different
tree contexts if the node exists in multiple trees.
Args:
tree_id: Identifier of the tree to check leaf status in.
If None, uses the initial tree for backward compatibility.
Returns:
bool: True if node has no children in the specified tree, False otherwise.
Example:
Checking leaf status::
if node.is_leaf("tree1"):
print("This is a leaf node")
# Different trees may have different leaf status
is_leaf_tree1 = node.is_leaf("tree1")
is_leaf_tree2 = node.is_leaf("tree2") # May differ
Tr F)r r r4 lenrM r) s r! is_leafz Node.is_leaf sP 2 ?$$D,<,<,A,A,CC // tw' (A -r# c |3| j | j j vry| j }| j | du S )a
Check if this node is a root (has no parent) in the specified tree.
A root node is the topmost node in a tree hierarchy with no parent.
Every tree has exactly one root node. This status can vary between
different tree contexts if the node exists in multiple trees.
Args:
tree_id: Identifier of the tree to check root status in.
If None, uses the initial tree for backward compatibility.
Returns:
bool: True if node has no parent in the specified tree, False otherwise.
Example:
Checking root status::
if node.is_root("tree1"):
print("This is the root node")
# Same node might be root in one tree but not another
is_root_tree1 = node.is_root("tree1")
is_root_tree2 = node.is_root("tree2") # May differ
NT)r r r4 rJ r) s r! is_rootz Node.is_root. sJ 2 ?$$D,=,=,B,B,DD // (D00r# c 6 t t | j S )a
Get the human-readable display name of this node.
The tag serves as the display label for this node in tree visualizations,
printouts, and user interfaces. Unlike the identifier, the tag doesn't
need to be unique and is primarily for human readability.
Returns:
str: The display name/label for this node.
Example:
Using node tags for display::
node = Node("User Profile", "user123")
print(node.tag) # "User Profile"
print(node.identifier) # "user123"
# Tags are used in tree display
tree.show() # Shows "User Profile" not "user123"
)r r- r r5 s r! r zNode.tagP s , C##r# c & ||| _ yd| _ y)aX
Set the human-readable display name of this node.
Updates the display label used in tree visualizations and string
representations. The tag can be changed freely without affecting
tree structure or node relationships.
Args:
value: New display name for the node. Can be None.
Example:
Updating node display name::
node.tag = "Updated Profile"
print(node.tag) # "Updated Profile"
# Useful for dynamic labeling
node.tag = f"User: {user.name} (Active)"
N)r r: s r! r zNode.tagh s * # .E D r# c | j j }dj | j dj | j dj | j
g}|ddj
| dS )a
Return detailed string representation of this node for debugging.
Provides a comprehensive view of the node's properties including
tag, identifier, and data. Useful for debugging, logging, and
development work.
Returns:
str: Detailed string representation in format:
Node(tag=, identifier=, data=)
Example:
Node representation output::
node = Node("Profile", "user123", data={"age": 30})
print(repr(node))
# Output: Node(tag=Profile, identifier=user123, data={'age': 30})
# Useful in lists and debugging
print([node1, node2]) # Shows detailed info for each node
ztag={0}zidentifier={0}zdata={0}(z, ))r[ r\ rl r r r join)r namekwargss r! __repr__z
Node.__repr__ sf , ~~&& TXX & # #DOO 4 dii (
6!233r# )NNTNrp r3 )*r\
__module__ __qualname____doc__r rangerq rr rs rt r r- boolr r" r& r* r propertyr
r6 setterr= r? r rY rZ rG rJ r9 StrListrM rB intrD r r r r r r r rU r# r! r r + s7 > &*%(^"S&&' "$( 74
c]74 SM74 74
74
74r$t $*,3 ,4 ,$#8C= #T #( ()8 * 8
__,-; . ; ,-9 .9 '(7 ) 7
__./BeD$c$9 : Bt B 0 B ./(+T J 0J*.)8C= )8C= )T )()(3- )G )6-GE$dC*?$@ -G8TW= -Gdh -Gd !%!% K
c]K K # K
# K
KZ +C + +,QS Qs Qt Q610 ( ( ( (6#x} # #J 1x} 1 1D $S $ $. ZZ9# 94 9 9, 4# 4r# r )r
__future__r r~ sysr. collectionsr typingr r r r r warningsr
exceptionsr miscr
version_infor r- r objectr rU r# r! r sX " (
# 3 3 ) v 3iG3iGp 46 p 4r#