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[[...], int], key_destroy_func: Callable[[None], None], *key_compare_data: Any) → Tree

Parameters:

• key_compare_func

• key_destroy_func

• key_compare_data

Methods

class Tree

destroy() → None

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

Parameters:

• func

• user_data

foreach_node(func: Callable[[...], bool], *user_data: Any) → None

Parameters:

• func

• user_data

height() → int

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

Parameters:

• key

• value

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

Parameters:

• key

• value

lookup(key: None) → None

Parameters:

key

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

Parameters:

lookup_key

lookup_node(key: None) → TreeNode | None

Parameters:

key

lower_bound(key: None) → TreeNode | None

Parameters:

key

nnodes() → int

node_first() → TreeNode | None

node_last() → TreeNode | None

remove(key: None) → bool

Parameters:

key

remove_all() → None

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

Parameters:

• key

• value

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

Parameters:

• key

• value

search(search_func: Callable[[...], int], *user_data: Any) → None

Parameters:

• search_func

• user_data

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

Parameters:

• search_func

• user_data

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

Parameters:

• traverse_func

• traverse_type

• user_data

upper_bound(key: None) → TreeNode | None

Parameters:

key