rune-alloc 0.14.1

The Rune Language, an embeddable dynamic programming language for Rust.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

use core::borrow::Borrow;
use core::cmp::Ordering;

use super::node::{ForceResult::*, Root};
use super::search::SearchResult::*;

use crate::alloc::{AllocError, Allocator};

impl<K, V> Root<K, V> {
    /// Calculates the length of both trees that result from splitting up
    /// a given number of distinct key-value pairs.
    pub(crate) fn calc_split_length(
        total_num: usize,
        root_a: &Root<K, V>,
        root_b: &Root<K, V>,
    ) -> (usize, usize) {
        let (length_a, length_b);
        if root_a.height() < root_b.height() {
            length_a = root_a.reborrow().calc_length();
            length_b = total_num - length_a;
            debug_assert_eq!(length_b, root_b.reborrow().calc_length());
        } else {
            length_b = root_b.reborrow().calc_length();
            length_a = total_num - length_b;
            debug_assert_eq!(length_a, root_a.reborrow().calc_length());
        }
        (length_a, length_b)
    }

    /// Split off a tree with key-value pairs at and after the given key.
    /// The result is meaningful only if the tree is ordered by key,
    /// and if the ordering of `Q` corresponds to that of `K`.
    /// If `self` respects all `BTreeMap` tree invariants, then both
    /// `self` and the returned tree will respect those invariants.
    pub(crate) fn split_off<C: ?Sized, Q: ?Sized, A: Allocator, E>(
        &mut self,
        cx: &mut C,
        key: &Q,
        alloc: &A,
        cmp: fn(&mut C, &Q, &Q) -> Result<Ordering, E>,
    ) -> Result<Result<Self, AllocError>, E>
    where
        K: Borrow<Q>,
    {
        let left_root = self;

        let mut right_root = match Root::new_pillar(left_root.height(), alloc) {
            Ok(root) => root,
            Err(e) => return Ok(Err(e)),
        };

        let mut left_node = left_root.borrow_mut();
        let mut right_node = right_root.borrow_mut();

        loop {
            let mut split_edge = match left_node.search_node(cx, key, cmp)? {
                // key is going to the right tree
                Found(kv) => kv.left_edge(),
                GoDown(edge) => edge,
            };

            split_edge.move_suffix(&mut right_node);

            match (split_edge.force(), right_node.force()) {
                (Internal(edge), Internal(node)) => {
                    left_node = edge.descend();
                    right_node = node.first_edge().descend();
                }
                (Leaf(_), Leaf(_)) => break,
                _ => unreachable!(),
            }
        }

        left_root.fix_right_border(alloc);
        right_root.fix_left_border(alloc);
        Ok(Ok(right_root))
    }

    /// Creates a tree consisting of empty nodes.
    fn new_pillar<A: Allocator>(height: usize, alloc: &A) -> Result<Self, AllocError> {
        let mut root = Root::new(alloc)?;

        for _ in 0..height {
            root.push_internal_level(alloc)?;
        }

        Ok(root)
    }
}