pub fn ingest(&mut self, element: H256) -> Result<H256, ProverError> {
        self.count += 1;
        self.tree.push_leaf(element, TREE_DEPTH)?;
        Ok(self.tree.hash())
    }
/// Push a leaf to the tree. Appends it to the first unoccupied slot
///
/// This will fail if the underlying tree is full.
Push a leaf to the tree. Appends it to the first unoccupied slot
This will fail if the underlying tree is full.
Push a leaf to the tree . Appends it to the first unoccupied slot This will fail if the underlying tree is full .
pub fn ingest(&mut self, element: H256) -> Result<H256, ProverError> {
        self.count += 1;
        self.tree.push_leaf(element, TREE_DEPTH)?;
        Ok(self.tree.hash())
    }
pub fn ingest ( & mut self , element : H256 ) -> Result < H256 , ProverError > { self . count += 1 ; self . tree . push_leaf ( element , TREE_DEPTH ) ? ; Ok ( self . tree . hash ( ) ) }
Push a leaf to the tree.
Push a leaf to the tree .
&mut self
element
H256
&mut self
element
H256