crit_bit

Module0xd5ea…ecde

crit_bit

Functions26

assert_has_leafBytecode
public fun assert_has_leaf<T0: store>(&CritbitTree<T0>,u64)
borrow_leaf_by_indexBytecode
public fun borrow_leaf_by_index<T0: store>(&CritbitTree<T0>,u64): &T0
borrow_leaf_by_keyBytecode
public fun borrow_leaf_by_key<T0: store>(&CritbitTree<T0>,u64): &T0
borrow_mut_leaf_by_keyBytecode
public fun borrow_mut_leaf_by_key<T0: store>(&mut CritbitTree<T0>,u64): &mut T0
find_leafBytecode
public fun find_leaf<T0: store>(&CritbitTree<T0>,u64): (bool, u64)
has_leafBytecode
public fun has_leaf<T0: store>(&CritbitTree<T0>,u64): bool
insert_leafBytecode
public fun insert_leaf<T0: store>(&mut CritbitTree<T0>,u64,T0): u64
is_emptyBytecode
public fun is_empty<T0: store>(&CritbitTree<T0>): bool
max_leafBytecode
public fun max_leaf<T0: store>(&CritbitTree<T0>): (u64, u64)
min_leafBytecode
public fun min_leaf<T0: store>(&CritbitTree<T0>): (u64, u64)
newBytecode
public fun new<T0: store>(): CritbitTree<T0>
previous_leafBytecode
public fun previous_leaf<T0: store>(&CritbitTree<T0>,u64): (u64, u64)
remove_leaf_by_keyBytecode
public fun remove_leaf_by_key<T0: store>(&mut CritbitTree<T0>,u64): T0
sizeBytecode
public fun size<T0: store>(&CritbitTree<T0>): u64

key is an object with an id. store can be kept inside other objects. copy can be duplicated. drop can be thrown away.

Constants are shown the way the code loads them. Bytecode does not keep their names.

Index	Value	Type	Use	Used in
0	1	u64	Abort code	insert_leaf
1	2	u64	Abort code	insert_leaf
2	3	u64	Abort code	insert_leaf
3	4	u64	Abort code	min_leaf max_leaf previous_leaf next_leafand 4 more
4	6	u64	Abort code	remove_leaf_by_index
5	7	u64	Abort code	update_child
6	9223372036854775808	u64	Value	new previous_leaf next_leaf left_most_leafand 6 more
7	18446744073709551615	u64	Value	previous_leaf next_leaf insert_leaf remove_leaf_by_indexand 2 more
8	9223372036854775807	u64	Value	insert_leaf