Qortal/pirate-librustzcash
1
0
Fork 1
mirror of https://github.com/Qortal/pirate-librustzcash.git synced 2025-08-01 12:51:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

add intented use of the api

Browse Source
This commit is contained in:
NikVolf
2019-10-11 08:50:44 +03:00
parent 6b7a3dec9c
commit 3082593fcc
1 changed files with 6 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/tree.rs
View File

@@ -8,10 +8,15 @@ use crate::{Entry, EntryLink, NodeData, Error, EntryKind};
/// With only some of the leaves/nodes pre-loaded / pre-generated. /// With only some of the leaves/nodes pre-loaded / pre-generated.
/// Exact amount of the loaded data can be calculated by the constructing party, /// Exact amount of the loaded data can be calculated by the constructing party,
/// depending on the length of the tree and maximum amount of operations that are going /// depending on the length of the tree and maximum amount of operations that are going
/// to happen after construction. /// to happen after construction. `Tree` should not be used as self-contained data structure,
/// since it's internal state can grow indefinitely after serial operations.
/// Intended use of this `Tree` is to instantiate it based on partially loaded data (see example
/// how to pick right nodes from the array representation of MMR Tree), perform several operations
/// (append-s/delete-s) and then drop it.
pub struct Tree { pub struct Tree {
stored: HashMap<u32, Entry>, stored: HashMap<u32, Entry>,
// This can grow indefinitely if `Tree` is misused as a self-contained data structure
generated: Vec<Entry>, generated: Vec<Entry>,
// number of persistent(!) tree entries // number of persistent(!) tree entries