Method has_key_node

src/structures/mmap_tree.rs:199–209

(&mut self, node_offset: usize, key: K)

    }

    pub fn has_key_node(&mut self, node_offset: usize, key: K) -> Result<bool, io::Error> {
        let node = self.storage_manager.load_node(node_offset)?;

        match node.node_type {
            NodeType::Internal => {
                let idx = node.keys.binary_search(&key).unwrap_or_else(|x| x); // Find the child to go to
                self.has_key_node(node.children[idx], key)
            }
            NodeType::Leaf => Ok(node.keys.binary_search(&key).into_iter().next().is_some()),
        }
    }

    pub fn get_range(&mut self, start: K, end: K) -> Result<Vec<(K, V)>, io::Error> {
        let mut result = Vec::new();