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
mod node;
mod node_ref;

use crate::node::RootNode;

const B: u16 = 12;

#[derive(Debug)]
pub struct BTreeSet<K> {
	root: RootNode<K, ()>,
}

impl<K> BTreeSet<K>
where
	K: Ord,
{
	pub fn new() -> Self {
		Self {
			root: RootNode::new(),
		}
	}

	pub fn insert(&mut self, key: K) -> bool { self.root.insert(key, ()).is_some() }

	pub fn remove(&mut self, key: &K) -> bool { self.root.remove(key).is_some() }
}

impl<K> Default for BTreeSet<K>
where
	K: Ord,
{
	fn default() -> Self { Self::new() }
}

#[derive(Debug)]
pub struct BTreeMap<K, V> {
	root: RootNode<K, V>,
}

impl<K, V> BTreeMap<K, V>
where
	K: Ord,
{
	pub fn new() -> Self {
		Self {
			root: RootNode::new(),
		}
	}

	pub fn insert(&mut self, key: K, value: V) -> Option<V> { self.root.insert(key, value) }

	pub fn remove(&mut self, key: &K) -> Option<V> { self.root.remove(key) }
}

impl<K, V> Default for BTreeMap<K, V>
where
	K: Ord,
{
	fn default() -> Self { Self::new() }
}