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
44
45
46
47
48


use near_sdk::borsh::{self, BorshDeserialize, BorshSerialize};
use tree_map::TreeMap;

mod tree_map;
mod raw_value;

#[derive(BorshDeserialize, BorshSerialize)]
pub struct BitTree {
    bit_tree: TreeMap,
}

impl BitTree {
    pub fn new(max_bits: u32, key_prefix: Vec<u8>, bit_width: u8) -> Self {
        Self {
            bit_tree: TreeMap::new(max_bits, key_prefix, bit_width),
        }
        //total 36 bits, 28 bits instead
    }

    pub fn get(&self, key: &[u8]) -> Option<u8> {
        self.bit_tree.get(key)
    }

    pub fn set(&mut self, key: &[u8], val: u8) {
        self.bit_tree.set(key, val)
    }

    pub fn del(&mut self, key: &[u8]) {
        self.bit_tree.del(key)
    }

    pub fn check(&self ,key: &[u8]) -> bool {
        self.bit_tree.check(key)
    }

    pub fn get_and_set(&mut self, key: &[u8], val: u8 ) -> Option<u8> {
        let bits = self.get(key);
        self.set(key, val);
        bits
    }

    pub fn check_and_set(&mut self, key: &[u8], val: u8 ) -> bool {
        let bits = self.check(key);
        self.set(key, val);
        bits
    }
}