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

//! This file defines the [`KeyValue`] type that is used by [`AATreeMap`](crate::AATreeMap).

use crate::iter::IterContent;
use core::{borrow::Borrow, cmp::Ordering};

/// An entry in an [`AATreeMap`](crate::AATreeMap). This type is used with iterators
/// returned by [`AATreeMap`](crate::AATreeMap).
// public but inaccessible
#[derive(Clone, Copy, Debug)]
pub struct KeyValue<K, V> {
	pub key: K,
	pub value: V
}

impl<K, V> KeyValue<K, V> {
	pub(super) fn as_tuple(&self) -> (&K, &V) {
		(&self.key, &self.value)
	}

	pub(super) fn as_tuple_mut(&mut self) -> (&K, &mut V) {
		(&self.key, &mut self.value)
	}

	pub(super) fn into_tuple(self) -> (K, V) {
		(self.key, self.value)
	}
}

impl<K, V> IterContent<(K, V)> for KeyValue<K, V> {
	fn content(self) -> (K, V) {
		self.into_tuple()
	}
}

impl<'a, K, V> IterContent<(&'a K, &'a V)> for &'a KeyValue<K, V> {
	fn content(self) -> (&'a K, &'a V) {
		self.as_tuple()
	}
}

impl<K, V> Borrow<K> for KeyValue<K, V> {
	fn borrow(&self) -> &K {
		&self.key
	}
}

impl<K: PartialEq, V> PartialEq for KeyValue<K, V> {
	fn eq(&self, other: &Self) -> bool {
		self.key.eq(&other.key)
	}
}

impl<K: PartialEq, V> PartialEq<K> for KeyValue<K, V> {
	fn eq(&self, other: &K) -> bool {
		self.key.eq(other)
	}
}

impl<K: Eq, V> Eq for KeyValue<K, V> {}

impl<K: PartialOrd, V> PartialOrd for KeyValue<K, V> {
	fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
		self.key.partial_cmp(&other.key)
	}
}

impl<K: PartialOrd, V> PartialOrd<K> for KeyValue<K, V> {
	fn partial_cmp(&self, other: &K) -> Option<Ordering> {
		self.key.partial_cmp(other)
	}
}

impl<K: Ord, V> Ord for KeyValue<K, V> {
	fn cmp(&self, other: &Self) -> Ordering {
		self.key.cmp(&other.key)
	}
}