Method get_range_node

src/structures/mmap_tree.rs:217–267

(
        &mut self,
        node_offset: usize,
        start: K,
        end: K,
        result: &mut Vec<(K, V)>,
    )

    }

    fn get_range_node(
        &mut self,
        node_offset: usize,
        start: K,
        end: K,
        result: &mut Vec<(K, V)>,
    ) -> Result<(), io::Error> {
        let node = self.storage_manager.load_node(node_offset)?;

        match node.node_type {
            NodeType::Internal => {
                let mut idx = node
                    .keys
                    .binary_search(&start.clone())
                    .unwrap_or_else(|x| x);
                if idx == node.keys.len() {
                    idx -= 1;
                }

                self.get_range_node(node.children[idx], start.clone(), end.clone(), result)?;

                while idx < node.keys.len() && node.keys[idx] < end {
                    self.get_range_node(
                        node.children[idx + 1],
                        start.clone(),
                        end.clone(),
                        result,
                    )?;
                    idx += 1;
                }
            }
            NodeType::Leaf => {
                let mut idx = node.keys.binary_search(&start).unwrap_or_else(|x| x);
                if node.keys.len() == 0 {
                    return Ok(());
                }
                if idx == node.keys.len() {
                    idx -= 1;
                }

                while idx < node.keys.len() && node.keys[idx] < end {
                    if node.keys[idx] >= start {
                        result.push((node.keys[idx].clone(), node.values[idx].clone().unwrap()));
                    }
                    idx += 1;
                }
            }
        }

        Ok(())
    }

    pub fn batch_insert(&mut self, entries: Vec<(K, V)>) -> Result<(), io::Error> {
        if entries.is_empty() {