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
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

use super::node::{Leaf, Node};
use std::fmt::Debug;

#[derive(Debug)]
pub(crate) enum LeafInsertState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Ok(Option<V>),
    // Split(K, V),
    Split(*mut Leaf<K, V>),
    // We split in the reverse direction.
    RevSplit(*mut Leaf<K, V>),
}

#[derive(Debug)]
pub(crate) enum LeafRemoveState<V>
where
    V: Clone,
{
    Ok(Option<V>),
    // Indicate that we found the associated value, but this
    // removal means we no longer exist so should be removed.
    Shrink(Option<V>),
}

#[derive(Debug)]
pub(crate) enum BranchInsertState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Ok,
    // Two nodes that need addition to a new branch?
    Split(*mut Node<K, V>, *mut Node<K, V>),
}

#[derive(Debug)]
pub(crate) enum BranchShrinkState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Balanced,
    Merge(*mut Node<K, V>),
    Shrink(*mut Node<K, V>),
}

/*
#[derive(Debug)]
pub(crate) enum BranchTrimState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Complete,
    Promote(*mut Node<K, V>),
}

pub(crate) enum CRTrimState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Complete,
    Clone(*mut Node<K, V>),
    Promote(*mut Node<K, V>),
}
*/

#[derive(Debug)]
pub(crate) enum CRInsertState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    // We did not need to clone, here is the result.
    NoClone(Option<V>),
    // We had to clone the referenced node provided.
    Clone(Option<V>, *mut Node<K, V>),
    // We had to split, but did not need a clone.
    // REMEMBER: In all split cases it means the key MUST NOT have
    // previously existed, so it implies return none to the
    // caller.
    Split(*mut Node<K, V>),
    RevSplit(*mut Node<K, V>),
    // We had to clone and split.
    CloneSplit(*mut Node<K, V>, *mut Node<K, V>),
    CloneRevSplit(*mut Node<K, V>, *mut Node<K, V>),
}

#[derive(Debug)]
pub(crate) enum CRCloneState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    Clone(*mut Node<K, V>),
    NoClone,
}

#[derive(Debug)]
pub(crate) enum CRRemoveState<K, V>
where
    K: Ord + Clone + Debug,
    V: Clone,
{
    // We did not need to clone, here is the result.
    NoClone(Option<V>),
    // We had to clone the referenced node provided.
    Clone(Option<V>, *mut Node<K, V>),
    //
    Shrink(Option<V>),
    //
    CloneShrink(Option<V>, *mut Node<K, V>),
}