pub fn parse_node(data: &[u8]) -> Result<(HashKey, HashKey)> {
    ensure!(data[0] == NODE, "not a node");
    let mut left: HashKey = [0; 32];
    let mut right: HashKey = [0; 32];
    left.copy_from_slice(&data[1..33]);
    right.copy_from_slice(&data[33..]);
    Ok((left, right))
}
// Left and right nodes are always 32
Left and right nodes are always 32
Left and right nodes are always 32
pub fn parse_node(data: &[u8]) -> Result<(HashKey, HashKey)> {
    ensure!(data[0] == NODE, "not a node");
    let mut left: HashKey = [0; 32];
    let mut right: HashKey = [0; 32];
    left.copy_from_slice(&data[1..33]);
    right.copy_from_slice(&data[33..]);
    Ok((left, right))
}
pub fn parse_node ( data : & [ u8 ] ) -> Result < ( HashKey , HashKey ) > { ensure ! ( data [ 0 ] NODE " " ) ; let mut left : HashKey = [ 0 ; 32 ] ; let mut right : HashKey = [ 0 ; 32 ] ; left . copy_from_slice ( & data [ 1 .. 33 ] ) ; right . copy_from_slice ( & data [ 33 .. ] ) ; Ok ( ( left , right ) ) }
Left and right nodes are always 32
Left and right nodes are always 32
data
&[u8]