pub fn append(&mut self, cm_x: pallas::Base) -> Result<(), NoteCommitmentTreeError> {
        if self.inner.append(&cm_x.into()) {
            // Invalidate cached root
            self.cached_root.replace(None);
            Ok(())
        } else {
            Err(NoteCommitmentTreeError::FullTree)
        }
    }
/// Adds a note commitment x-coordinate to the tree.
///
/// The leaves of the tree are actually a base field element, the
/// x-coordinate of the commitment, the data that is actually stored on the
/// chain and input into the proof.
///
/// Returns an error if the tree is full.
Adds a note commitment x-coordinate to the tree.
The leaves of the tree are actually a base field element, the
x-coordinate of the commitment, the data that is actually stored on the
chain and input into the proof.

Returns an error if the tree is full.
Adds a note commitment x - coordinate to the tree . The leaves of the tree are actually a base field element the x - coordinate of the commitment the data that is actually stored on the chain and input into the proof . Returns an error if the tree is full .
pub fn append(&mut self, cm_x: pallas::Base) -> Result<(), NoteCommitmentTreeError> {
        if self.inner.append(&cm_x.into()) {
            // Invalidate cached root
            self.cached_root.replace(None);
            Ok(())
        } else {
            Err(NoteCommitmentTreeError::FullTree)
        }
    }
pub fn append ( & mut self , cm_x : pallas :: Base ) -> Result < ( ) , NoteCommitmentTreeError > { if self . inner . append ( & cm_x . into ( ) ) { // Invalidate cached root self . cached_root . replace ( None ) ; Ok ( ( ) ) } else { Err ( NoteCommitmentTreeError :: FullTree ) } }
Adds a note commitment x-coordinate to the tree.
Adds a note commitment x - coordinate to the tree .
&mut self
cm_x
pallas::Base