aatree 0.2.3

AATree implementation in 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
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146

use super::{AATreeMap, KeyValue};
use core::{
	fmt::{self, Debug, Formatter},
	mem
};

pub enum Entry<'a, K, V> {
	Vacant(VacantEntry<'a, K, V>),
	Occupied(OccupiedEntry<'a, K, V>)
}

impl<K: Debug, V: Debug> Debug for Entry<'_, K, V> {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		match self {
			Self::Vacant(v) => f.debug_tuple("Entry").field(v).finish(),
			Self::Occupied(o) => f.debug_tuple("Entry").field(o).finish()
		}
	}
}

impl<'a, K, V> Entry<'a, K, V> {
	pub fn key(&self) -> &K {
		match self {
			Self::Vacant(entry) => entry.key(),
			Self::Occupied(entry) => entry.key()
		}
	}

	pub fn and_modify<F>(mut self, f: F) -> Self
	where
		F: FnOnce(&mut V)
	{
		if let Self::Occupied(entry) = &mut self {
			f(entry.get_mut());
		}
		self
	}

	pub fn or_insert(self, default: V) -> &'a mut V
	where
		K: Ord + Clone
	{
		// TODO remove K: Clone once this doesn't require it anymore
		self.or_insert_with(|| default)
	}

	pub fn or_insert_with<F>(self, default: F) -> &'a mut V
	where
		F: FnOnce() -> V,
		K: Ord + Clone
	{
		// TODO remove K: Clone once this doesn't require it anymore
		self.or_insert_with_key(|_| default())
	}

	pub fn or_insert_with_key<F>(self, default: F) -> &'a mut V
	where
		F: FnOnce(&K) -> V,
		K: Ord + Clone
	{
		match self {
			Self::Occupied(entry) => entry.into_mut(),
			// TODO remove K: Clone once this doesn't require it anymore
			Self::Vacant(entry) => {
				let value = default(entry.key());
				entry.insert(value)
			}
		}
	}

	pub fn or_default(self) -> &'a mut V
	where
		K: Ord + Clone,
		V: Default
	{
		// TODO remove K: Clone once this doesn't require it anymore
		self.or_insert_with(V::default)
	}
}

pub struct OccupiedEntry<'a, K, V> {
	pub(crate) entry: &'a mut KeyValue<K, V>
}

impl<'a, K, V> OccupiedEntry<'a, K, V> {
	pub fn key(&self) -> &K {
		&self.entry.key
	}

	pub fn get(&self) -> &V {
		&self.entry.value
	}

	pub fn get_mut(&mut self) -> &mut V {
		&mut self.entry.value
	}

	pub fn into_mut(self) -> &'a mut V {
		&mut self.entry.value
	}

	pub fn insert(&mut self, value: V) -> V {
		mem::replace(&mut self.entry.value, value)
	}
}

impl<K: Debug, V: Debug> Debug for OccupiedEntry<'_, K, V> {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		f.debug_struct("OccupiedEntry")
			.field("key", self.key())
			.field("value", self.get())
			.finish()
	}
}

pub struct VacantEntry<'a, K, V> {
	pub(crate) key: K,
	pub(crate) map: &'a mut AATreeMap<K, V>
}

impl<'a, K, V> VacantEntry<'a, K, V> {
	pub fn key(&self) -> &K {
		&self.key
	}

	pub fn into_key(self) -> K {
		self.key
	}

	pub fn insert(self, value: V) -> &'a mut V
	where
		K: Ord + Clone
	{
		// TODO properly return a reference and stop cloning the key
		self.map.insert(self.key.clone(), value);
		self.map.get_mut(&self.key).unwrap()
	}
}

impl<K: Debug, V: Debug> Debug for VacantEntry<'_, K, V> {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		f.debug_struct("VacantEntry")
			.field("key", self.key())
			.finish()
	}
}