mii/merkle.rs
1
0
Fork 0
mirror of https://github.com/mii443/merkle.rs.git synced 2025-08-23 00:15:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reverse Vec and use pop() instead of remove(0) for effiency.

Browse Source
This commit is contained in:
Romain Ruetschi
2016-11-10 14:42:45 +01:00
parent 60d3158619
commit a30b4ac75c
1 changed files with 5 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/lib.rs
View File

@ -93,16 +93,18 @@ impl <D, T> MerkleTree<D, T> where D: Digest, T: Hashable {
cur.push(leaf);
}
cur.reverse();
while cur.len() > 1 {
let mut next = Vec::with_capacity(len);
while cur.len() > 0 {
if cur.len() == 1 {
next.push(cur.remove(0));
next.push(cur.pop().unwrap());
}
else {
let left = cur.remove(0);
let right = cur.remove(0);
let right = cur.pop().unwrap();
let left = cur.pop().unwrap();
let combined_hash = combine_hashes::<D>(
&mut digest,