starling 4.0.0

This tree structure is a binary merkle tree with branch compression via split indexes.
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

use tiny_keccak::Hasher;
use tiny_keccak::Keccak;

use crate::Array;

pub struct KeccakHasher(Keccak);

impl<const N: usize> crate::traits::Hasher<N> for KeccakHasher {
    #[inline]
    fn new(_size: usize) -> Self {
        let hasher = Keccak::v256();
        Self(hasher)
    }

    #[inline]
    fn update(&mut self, data: &[u8]) {
        self.0.update(data);
    }

    #[inline]
    fn finalize(self) -> Array<N> {
        #[cfg(feature = "serde")]
        let mut res = Array::default();
        #[cfg(not(any(feature = "serde")))]
        let mut res = [0; N];
        self.0.finalize(res.as_mut());
        res
    }
}