Tree

class Tree(*args, **kwargs)

Constructors:

new_full(key_compare_func:GLib.CompareDataFunc, key_compare_data=None, key_destroy_func:GLib.DestroyNotify) -> GLib.Tree

Constructors

class Tree

classmethod new_full(key_compare_func: Callable[[Any, Any, Any], int], key_compare_data: Any, key_destroy_func: Callable[[Any], None]) → Tree

Parameters:

• key_compare_func

• key_compare_data

• key_destroy_func

Methods

class Tree

destroy() → None

foreach(func: Callable[[Any, Any, Any], bool], user_data: Any = None) → None

Parameters:

• func

• user_data

foreach_node(func: Callable[[TreeNode, Any], bool], user_data: Any = None) → None

Parameters:

• func

• user_data

height() → int

insert(key: Any = None, value: Any = None) → None

Parameters:

• key

• value

insert_node(key: Any = None, value: Any = None) → TreeNode | None

Parameters:

• key

• value

lookup(key: Any = None) → Any | None

Parameters:

key

lookup_extended(lookup_key: Any = None) → tuple[bool, Any | None, Any | None]

Parameters:

lookup_key

lookup_node(key: Any = None) → TreeNode | None

Parameters:

key

lower_bound(key: Any = None) → TreeNode | None

Parameters:

key

nnodes() → int

node_first() → TreeNode | None

node_last() → TreeNode | None

remove(key: Any = None) → bool

Parameters:

key

remove_all() → None

replace(key: Any = None, value: Any = None) → None

Parameters:

• key

• value

replace_node(key: Any = None, value: Any = None) → TreeNode | None

Parameters:

• key

• value

search(search_func: Callable[[Any, Any], int], user_data: Any = None) → Any | None

Parameters:

• search_func

• user_data

search_node(search_func: Callable[[Any, Any], int], user_data: Any = None) → TreeNode | None

Parameters:

• search_func

• user_data

traverse(traverse_func: Callable[[Any, Any, Any], bool], traverse_type: TraverseType, user_data: Any = None) → None

Parameters:

• traverse_func

• traverse_type

• user_data

upper_bound(key: Any = None) → TreeNode | None

Parameters:

key