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
31
32

use crate::traits::Hasher;
use crate::Array;
use std::collections::hash_map::DefaultHasher;
use std::hash::Hasher as DefaultHasherTrait;

impl<const N: usize> Hasher<N> for DefaultHasher {
    #[inline]
    fn new(_size: usize) -> Self {
        Self::new()
    }

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

    #[inline]
    fn finalize(self) -> Array<N> {
        let value = Self::finish(&self).to_le_bytes();
        #[cfg(feature = "serde")]
        let mut v = Array::default();
        #[cfg(not(any(feature = "serde")))]
        let mut v = [0; N];
        if N >= 8 {
            v[..8].copy_from_slice(&value);
        } else {
            v[..N].copy_from_slice(&value[..N]);
        }

        v
    }
}