Struct Node

pub struct Node(/* private fields */);

A node of the Sapling Incremental Note Commitment Tree.

Note that it’s handled as a byte buffer and not a point coordinate (jubjub::Fq) because that’s how the spec handles the MerkleCRH^Sapling function inputs and outputs.

Implementations

impl Node

pub fn bytes_in_display_order(&self) -> [u8; 32]

Return the node bytes in little-endian byte order suitable for printing out byte by byte.

zcashd’s z_getsubtreesbyindex does not reverse the byte order of subtree roots.

Trait Implementations

impl AsRef<[u8; 32]> for Node

fn as_ref(&self) -> &[u8; 32]

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Node

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Node

fn default() -> Node

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Node

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Node

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<Scalar> for Node

fn from(x: Fq) -> Self

Converts to this type from the input type.

impl HashSer for Node

Required to serialize NoteCommitmentTrees in a format matching zcashd.

Zebra stores Sapling note commitment trees as Frontiers while the z_gettreestate RPC requires CommitmentTrees. Implementing incrementalmerkletree::Hashable for Nodes allows the conversion.

fn read<R: Read>(reader: R) -> Result<Self>

Parses a node from the given byte source.

fn write<W: Write>(&self, writer: W) -> Result<()>

Serializes this node.

impl Hashable for Node

fn combine(level: Level, a: &Self, b: &Self) -> Self

Combine two nodes to generate a new node in the given level. Level 0 is the layer above the leaves (layer 31). Level 31 is the root (layer 0).

fn empty_root(level: Level) -> Self

Return the node for the level below the given level. (A quirk of the API)

fn empty_leaf() -> Self

impl PartialEq for Node

fn eq(&self, other: &Node) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Node

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl ToHex for &Node

fn encode_hex<T: FromIterator<char>>(&self) -> T

Encode the hex strict representing self into the result. Lower case letters are used (e.g. f9b4ca)

fn encode_hex_upper<T: FromIterator<char>>(&self) -> T

Encode the hex strict representing self into the result. Upper case letters are used (e.g. F9B4CA)

impl ToHex for Node

fn encode_hex<T: FromIterator<char>>(&self) -> T

Encode the hex strict representing self into the result. Lower case letters are used (e.g. f9b4ca)

fn encode_hex_upper<T: FromIterator<char>>(&self) -> T

Encode the hex strict representing self into the result. Upper case letters are used (e.g. F9B4CA)

impl TryFrom<&[u8]> for Node

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(bytes: &[u8]) -> Result<Self, Self::Error>

Performs the conversion.

impl Copy for Node

impl Eq for Node

impl StructuralPartialEq for Node