Method insert

cranelift/bforest/src/path.rs:264–274

Insert the key-value pair at the current position. The current position must be the correct insertion location for the key. This function does not check for duplicate keys. Use `find` or similar for that. Returns the new root node.

(
        &mut self,
        key: F::Key,
        value: F::Value,
        pool: &mut NodePool<F>,
    )

    /// This function does not check for duplicate keys. Use `find` or similar for that.
    /// Returns the new root node.
    pub fn insert(
        &mut self,
        key: F::Key,
        value: F::Value,
        pool: &mut NodePool<F>,
    ) -> Result<Node, OutOfMemory> {
        if !self.try_leaf_insert(key, value, pool) {
            self.split_and_insert(key, value, pool)?;
        }
        Ok(self.node[0])
    }

    /// Try to insert `key, value` at the current position, but fail and return false if the leaf
    /// node is full.