arnaucube/miden-crypto
1
0
Fork 0
mirror of https://github.com/arnaucube/miden-crypto.git synced 2026-01-12 00:51:29 +01:00
Code Issues Projects Releases Wiki Activity

feat: add leaves() iterator to SimpleSmt

Browse Source
This commit is contained in:
Bobbin Threadbare
2023-05-09 18:46:06 -07:00
parent 13aeda5a27
commit 629494b601
4 changed files with 57 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/merkle/merkle_tree.rs
View File

@@ -118,15 +118,15 @@ impl MerkleTree {
// --------------------------------------------------------------------------------------------
/// Returns an iterator over the leaves of this [MerkleTree].
pub fn leaves(&self) -> core::slice::Iter<Word> {
pub fn leaves(&self) -> impl Iterator<Item = (u64, &Word)> {
let leaves_start = self.nodes.len() / 2;
self.nodes[leaves_start..].iter()
self.nodes.iter().skip(leaves_start).enumerate().map(|(i, v)| (i as u64, v))
}
/// Returns n iterator over every inner node of this [MerkleTree].
///
/// The iterator order is unspecified.
pub fn inner_nodes(&self) -> InnerNodeIterator<'_> {
pub fn inner_nodes(&self) -> InnerNodeIterator {
InnerNodeIterator {
nodes: &self.nodes,
index: 1, // index 0 is just padding, start at 1