avltriee
Features
A customized version of AVLTree. Process the same value in the third branch. This allows efficient searches even for sets with small cardinality in the distribution of values.
One data is immovable from one row, and positional relationships such as left, right, and parent are all referenced by row numbers. No search is required for value reference by specifying a row.
Example
init
use Avltriee;
use AvltrieeNode;
let length=100;
let mut buffer: =
.map
.collect;
let mut triee = new;
insert & update
unsafe
unsafe
unsafe
unsafe
iterator
for i in triee.iter
for i in triee.desc_iter
for i in t.iter_value_from
for i in t.iter_value_to
for i in t.iter_value_range
remove
triee.remove;
search
let = triee.search;