fn add_node<'a>(&mut self, key_package: &'a KeyPackage) -> (LeafIndex, &'a Credential) {
        if !self.nodes.is_empty() {
            self.nodes.push(Node::new_blank_parent_node());
        }
        self.nodes.push(Node::new_leaf(Some((key_package).clone())));
        (
            (self.leaf_count().as_usize() - 1).into(),
            key_package.credential(),
        )
    }
/// Add a node for the provided key package the tree on the right side.
/// Note, that this function will not fill blank leaves. This function
/// returns references to the `LeafIndex` the `KeyPackage` was placed into
/// and to the Credential of the `KeyPackage.`
Add a node for the provided key package the tree on the right side.
Note, that this function will not fill blank leaves.
Add a node for the provided key package the tree on the right side . Note that this function will not fill blank leaves .
fn add_node<'a>(&mut self, key_package: &'a KeyPackage) -> (LeafIndex, &'a Credential) {
        if !self.nodes.is_empty() {
            self.nodes.push(Node::new_blank_parent_node());
        }
        self.nodes.push(Node::new_leaf(Some((key_package).clone())));
        (
            (self.leaf_count().as_usize() - 1).into(),
            key_package.credential(),
        )
    }
fn add_node < ' a > ( & mut self , key_package : & ' a KeyPackage ) -> ( LeafIndex , & ' a Credential ) { if ! self . nodes . is_empty ( ) { self . nodes . push ( Node :: new_blank_parent_node ( ) ) ; } self . nodes . push ( Node :: new_leaf ( Some ( ( key_package ) . clone ( ) ) ) ) ; ( ( self . leaf_count ( ) . as_usize ( ) - 1 ) . into ( ) , key_package . credential ( ) , ) }
Add a node for the provided key package the tree on the right side.
Add a node for the provided key package the tree on the right side .
&mut self
key_package
&'a KeyPackage
&mut self
key_package
&'a KeyPackage