3.9.4. qupulse.utils.tree¶

This module contains a tree implementation.

Functions

`is_tree_circular`(root)
`make_empty_weak_reference`()

Classes

Node([parent, children])

class qupulse.utils.tree.Node(parent: Optional[qupulse.utils.tree._NodeType] = None, children: Optional[Iterable] = None)[source]¶

Bases: object

assert_tree_integrity() → None[source]¶

property children: Sequence[qupulse.utils.tree._NodeType]¶

shallow copy of children

Type: return

debug = False¶

depth() → int[source]¶

get_breadth_first_iterator() → Generator[qupulse.utils.tree._NodeType, None, None][source]¶

get_depth_first_iterator() → Generator[qupulse.utils.tree._NodeType, None, None][source]¶

get_location() → Tuple[int, ...][source]¶

get_root() → qupulse.utils.tree._NodeType[source]¶

is_balanced() → bool[source]¶

is_leaf() → bool[source]¶

locate(location: Tuple[int, ...]) → qupulse.utils.tree._NodeType[source]¶

property parent: Union[None, qupulse.utils.tree._NodeType]¶

property parent_index: int¶

parse_child(child) → qupulse.utils.tree._NodeType[source]¶