ton_lib 0.0.38

A collection of types and utilities for interacting with the TON network
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165

use crate::block_tlb::ShardPfx;
use crate::tlb_adapters::DictValAdapter;
use std::collections::HashMap;
use std::marker::PhantomData;
use ton_lib_core::cell::{CellBuilder, CellParser, TonCell};
use ton_lib_core::constants::TON_MAX_SPLIT_DEPTH;
use ton_lib_core::error::TLCoreError;
use ton_lib_core::traits::tlb::TLB;

// for now it's used only only with ShardPfx in keys
pub struct BinTree<VA: DictValAdapter<T>, T: TLB>(PhantomData<(VA, T)>);

impl<VA: DictValAdapter<T>, T: TLB> Default for BinTree<VA, T> {
    fn default() -> Self { Self::new() }
}

impl<VA: DictValAdapter<T>, T: TLB> BinTree<VA, T> {
    pub fn new() -> Self { Self(PhantomData) }

    pub fn read(parser: &mut CellParser) -> Result<HashMap<ShardPfx, T>, TLCoreError> {
        let mut val = HashMap::new();
        Self::read_impl(parser, ShardPfx::default(), &mut val)?;
        Ok(val)
    }

    fn read_impl(
        parser: &mut CellParser,
        cur_key: ShardPfx,
        cur_val: &mut HashMap<ShardPfx, T>,
    ) -> Result<(), TLCoreError> {
        if cur_key.bits_len > TON_MAX_SPLIT_DEPTH as u32 {
            return Err(TLCoreError::TLBWrongData(format!(
                "[read] BinTree depth exceeded: {} > {TON_MAX_SPLIT_DEPTH}",
                cur_key.bits_len
            )));
        }
        if !parser.read_bit()? {
            cur_val.insert(cur_key, VA::read(parser)?);
            return Ok(());
        }
        let new_bits_len = cur_key.bits_len + 1;

        let left_key = ShardPfx {
            value: cur_key.value,
            bits_len: new_bits_len,
        };
        Self::read_impl(&mut parser.read_next_ref()?.parser(), left_key, cur_val)?;

        let right_key = ShardPfx {
            value: cur_key.value | (1 << (64 - new_bits_len)),
            bits_len: new_bits_len,
        };
        Self::read_impl(&mut parser.read_next_ref()?.parser(), right_key, cur_val)?;
        Ok(())
    }

    pub fn write(builder: &mut CellBuilder, data: &HashMap<ShardPfx, T>) -> Result<(), TLCoreError> {
        if data.is_empty() {
            return Err(TLCoreError::TLBWrongData("BinTree can't be empty".to_string()));
        }
        Self::write_impl(builder, ShardPfx::default(), data)
    }

    fn write_impl(
        builder: &mut CellBuilder,
        cur_key: ShardPfx,
        data: &HashMap<ShardPfx, T>,
    ) -> Result<(), TLCoreError> {
        if cur_key.bits_len > TON_MAX_SPLIT_DEPTH as u32 {
            return Err(TLCoreError::TLBWrongData(format!(
                "[write] BinTree depth exceeded: {} > {TON_MAX_SPLIT_DEPTH}",
                cur_key.bits_len
            )));
        }
        if let Some(val) = data.get(&cur_key) {
            builder.write_bit(false)?;
            return VA::write(builder, val);
        }
        builder.write_bit(true)?;

        let new_bits_len = cur_key.bits_len + 1;
        let left_key = ShardPfx {
            value: cur_key.value,
            bits_len: new_bits_len,
        };
        let right_key = ShardPfx {
            value: cur_key.value | (1 << (64 - new_bits_len)),
            bits_len: new_bits_len,
        };

        let mut left_builder = TonCell::builder();
        Self::write_impl(&mut left_builder, left_key, data)?;
        builder.write_ref(left_builder.build_ref()?)?;

        let mut right_builder = TonCell::builder();
        Self::write_impl(&mut right_builder, right_key, data)?;
        builder.write_ref(right_builder.build_ref()?)?;
        Ok(())
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::tlb_adapters::DictValAdapterNum;

    #[test]
    fn test_bin_tree() -> anyhow::Result<()> {
        //                                                * (0000,len=0)
        //                 * (0100,len=1)                                        * (1100, len=1)
        //        *(0010,len=2)          * [0100,len=2]=3                   * (1010,len=2)          * [1100,len=2] = 6
        // * [0000,len=3]=1   * [0010,len=3]=2                 * [1000,len=3]=4     * [1010,len=3]=5
        let data = HashMap::from([
            (
                ShardPfx {
                    value: 0x0,
                    bits_len: 3,
                },
                1,
            ),
            (
                ShardPfx {
                    value: 0x2_000000000000000,
                    bits_len: 3,
                },
                2,
            ),
            (
                ShardPfx {
                    value: 0x4_000000000000000,
                    bits_len: 2,
                },
                3,
            ),
            (
                ShardPfx {
                    value: 0x8_000000000000000,
                    bits_len: 3,
                },
                4,
            ),
            (
                ShardPfx {
                    value: 0xA_000000000000000,
                    bits_len: 3,
                },
                5,
            ),
            (
                ShardPfx {
                    value: 0xC_000000000000000,
                    bits_len: 2,
                },
                6,
            ),
        ]);
        let mut builder = TonCell::builder();
        BinTree::<DictValAdapterNum<32>, u32>::write(&mut builder, &data)?;
        let cell = builder.build()?;
        let mut parser = cell.parser();
        let parsed_data = BinTree::<DictValAdapterNum<32>, u32>::read(&mut parser)?;
        assert_eq!(data, parsed_data);
        Ok(())
    }
}