ergo_avltree_rust 0.1.1

Implementation of cryptographically authenticated dictionary based on AVL tree
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
44
45
46
47
48
49
50
51
52
53
54
55
56

use crate::batch_avl_prover::*;
use crate::batch_node::*;
use crate::operation::*;
use alloc::boxed::Box;
use alloc::vec::Vec;
use anyhow::Result;
use core::iter::Iterator;

///
/// Interface for persistent versioned
///
pub trait VersionedAVLStorage {
    ///
    /// Synchronize storage with prover's state
    ///
    /// @param batchProver - prover to synchronize storage with
    /// @return
    ///
    fn update(
        &mut self,
        prover: &mut BatchAVLProver,
        additional_data: Vec<(ADKey, ADValue)>,
    ) -> Result<()>;

    ///
    /// Return root node and tree height at version
    ///
    fn rollback(&mut self, version: &ADDigest) -> Result<(NodeId, usize)>;

    ///
    /// Current version of storage. Version is prover's root hash value during last storage update.
    ///
    /// @return current version, if any; None is storage is empty
    ///
    fn version(&self) -> Option<ADDigest>;

    ///
    /// If storage is empty
    ///
    /// @return true is storage is empty, false otherwise
    ///
    fn is_empty(&self) -> bool {
        self.version().is_none()
    }

    fn non_empty(&self) -> bool {
        !self.is_empty()
    }

    ////
    /// Versions store keeps and can rollback to.
    ///
    /// @return versions store keeps
    ///
    fn rollback_versions<'a>(&'a self) -> Box<dyn Iterator<Item = ADDigest> + 'a>;
}