avltriee 0.77.2

Customized version of AVLTree library.Process the same value in the third branch. 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.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

use std::num::NonZeroU32;

use crate::AvltrieeNode;

pub trait AvltrieeAllocator<T> {
    fn as_ptr(&self) -> *const AvltrieeNode<T>;
    fn as_mut_ptr(&mut self) -> *mut AvltrieeNode<T>;

    fn get(&self, row: NonZeroU32) -> Option<&AvltrieeNode<T>>;

    fn resize(&mut self, rows_count: u32);
}

pub struct VecAvltrieeAllocator<T> {
    node_list: Vec<AvltrieeNode<T>>,
}

impl<T: Default + Clone> AvltrieeAllocator<T> for VecAvltrieeAllocator<T> {
    fn as_ptr(&self) -> *const AvltrieeNode<T> {
        self.node_list.as_ptr()
    }

    fn as_mut_ptr(&mut self) -> *mut AvltrieeNode<T> {
        self.node_list.as_mut_ptr()
    }

    fn get(&self, row: NonZeroU32) -> Option<&AvltrieeNode<T>> {
        self.node_list.get(row.get() as usize)
    }

    fn resize(&mut self, rows_count: u32) {
        self.node_list
            .resize(rows_count as usize + 1, Default::default())
    }
}

impl<T: Default> VecAvltrieeAllocator<T> {
    pub fn new() -> Self {
        VecAvltrieeAllocator {
            node_list: vec![Default::default()],
        }
    }
}