valord-map 0.10.0

A dictionary sorted by values.
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

use crate::{OrdBy, ValordMap};

use std::hash::Hash;
use std::ops::{Deref, DerefMut};

pub struct RawEntry<'v, T, K, V>
where
    T: Ord + Clone,
    K: Hash + Eq,
    V: OrdBy<Target = T>,
{
    pub(crate) index: usize,
    pub(crate) valord: &'v mut ValordMap<T, K, V>,
}

impl<'v, T, K, V> RawEntry<'v, T, K, V>
where
    T: Ord + Clone,
    K: Hash + Eq,
    V: OrdBy<Target = T>,
{
    pub(crate) fn try_new_by_key<'a: 'v>(
        valord: &'a mut ValordMap<T, K, V>,
        key: &K,
    ) -> Option<RawEntry<'v, T, K, V>> {
        let (index, _, v) = valord.map.get_full(key)?;
        v.as_ref()?;
        Some(Self { index, valord })
    }

    pub(crate) fn try_new_by_index<'a: 'v>(
        valord: &'a mut ValordMap<T, K, V>,
        index: usize,
    ) -> Option<RawEntry<'v, T, K, V>> {
        valord.get_by_index(index)?;
        Some(Self { index, valord })
    }

    pub(crate) fn insert(&mut self, value: V) -> &mut V {
        let v = self
            .valord
            .map
            .get_index_mut(self.index)
            .map(|(_, v)| {
                if let Some(ref v) = v {
                    ValordMap::<T, K, V>::remove_from_indexs(
                        &mut self.valord.sorted_indexs,
                        &v.ord_by(),
                        self.index,
                    );
                }
                v.insert(value)
            })
            .unwrap();
        v
    }

    pub(crate) fn insert_with_key<F: FnOnce(&K) -> V>(&mut self, value: F) -> &mut V {
        let v = self
            .valord
            .map
            .get_index_mut(self.index)
            .map(|(k, v)| {
                if let Some(ref v) = v {
                    ValordMap::<T, K, V>::remove_from_indexs(
                        &mut self.valord.sorted_indexs,
                        &v.ord_by(),
                        self.index,
                    );
                }
                v.insert(value(k))
            })
            .unwrap();
        v
    }

    pub fn get_mut_with_key(&mut self) -> (&K, &mut V) {
        let (k, v) = self
            .valord
            .map
            .get_index_mut(self.index)
            .map(|(k, v)| (k, v.as_mut().unwrap()))
            .unwrap();
        ValordMap::<T, K, V>::remove_from_indexs(
            &mut self.valord.sorted_indexs,
            &v.ord_by(),
            self.index,
        );

        (k, v)
    }
}

impl<'a, T, K, V> Deref for RawEntry<'a, T, K, V>
where
    T: Ord + Clone,
    K: Hash + Eq,
    V: OrdBy<Target = T>,
{
    type Target = V;

    fn deref(&self) -> &Self::Target {
        // Safety: if value is not exist, try_new() will return None
        self.valord
            .get_by_index(self.index)
            .map(|(_, v)| v)
            .unwrap()
    }
}

impl<'a, T, K, V> DerefMut for RawEntry<'a, T, K, V>
where
    T: Ord + Clone,
    K: Hash + Eq,
    V: OrdBy<Target = T>,
{
    fn deref_mut(&mut self) -> &mut Self::Target {
        // Safety: if value is not exist, try_new() will return None
        self.get_mut_with_key().1
    }
}

impl<'a, T, K, V> Drop for RawEntry<'a, T, K, V>
where
    T: Ord + Clone,
    K: Hash + Eq,
    V: OrdBy<Target = T>,
{
    fn drop(&mut self) {
        if let Some(ord_by) = self
            .valord
            .get_by_index(self.index)
            .map(|(_, v)| v.ord_by().clone())
        {
            self.valord
                .sorted_indexs
                .entry(ord_by)
                .or_default()
                .insert(self.index);
        };
    }
}