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
30

use blake2_rfc;

use crate::Array;

#[derive(Clone)]
pub struct Blake2bHasher(blake2_rfc::blake2b::Blake2b);

impl<const N: usize> crate::traits::Hasher<N> for Blake2bHasher {
    #[inline]
    fn new(size: usize) -> Self {
        let hasher = blake2_rfc::blake2b::Blake2b::new(size);
        Self(hasher)
    }

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

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