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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185


use core::iter::Iterator;
use std::collections::{HashMap, BTreeMap};

use serde::{Deserialize, Deserializer, Serialize, Serializer};

fn sort_map<S, T : Serialize + Ord, U : Serialize>(map : &HashMap<T, U>, serializer : S) -> Result<S::Ok, S::Error> where S : Serializer
{
    let sorted : BTreeMap<_, _> = map.iter().collect();

    sorted.serialize(serializer)
}

#[derive(Serialize, Debug)]
pub struct NamedItemStore<T>
{
    items : Vec<T>,
    #[serde(serialize_with = "sort_map")]
    names : HashMap<String, usize>,
    #[serde(skip_serializing)]
    ids : HashMap<usize, String>
}

impl<T> NamedItemStore<T>
{
    pub fn new() -> NamedItemStore<T>
    {
        NamedItemStore::<T>
        {
            items: Vec::new(),
            names: HashMap::new(),
            ids: HashMap::new()
        }
    }

    pub fn get(&self, id : usize) -> Option<&T>
    {
        self.items.get(id)
    }

    pub fn get_mut(&mut self, id : usize) -> Option<&mut T>
    {
        self.items.get_mut(id)
    }

    pub fn set(&mut self, id : usize, item : T) -> bool
    {
        if let Some(old_item) = self.items.get_mut(id)
        {
            *old_item = item;

            return true;
        }

        false
    }

    pub fn get_name(&self, id : usize) -> Option<String>
    {
        self.ids.get(&id).cloned()
    }

    pub fn get_id(&self, name : &str) -> Option<usize>
    {
        self.names.get(name).cloned()
    }

    pub fn insert_item(&mut self, pos : usize, item : T) -> bool
    {
        if pos > self.items.len()
        {
            return false;
        }

        for pos in (pos..self.items.len()).rev()
        {
            if let Some(moved_name) = self.ids.remove(&pos)
            {
                self.names.insert(moved_name.clone(), pos + 1);
                self.ids.insert(pos + 1, moved_name);
            }
        }

        self.items.insert(pos, item);

        true
    }

    pub fn remove_item(&mut self, id : usize) -> Option<T>
    {
        if id >= self.items.len()
        {
            return None;
        }

        self.rename_item(id, "");

        for pos in (id + 1)..self.items.len()
        {
            if let Some(moved_name) = self.ids.remove(&pos)
            {
                self.names.insert(moved_name.clone(), pos - 1);
                self.ids.insert(pos - 1, moved_name);
            }
        }

        Some(self.items.remove(id))
    }

    pub fn rename_item(&mut self, id : usize, new_name : &str) -> bool
    {
        if !new_name.is_empty() && self.names.contains_key(new_name)
        {
            return false;
        }

        if let Some(old_name) = self.ids.get(&id).cloned()
        {
            let mut bad = false;

            if self.ids.remove(&id).is_none() { bad = true; }
            if self.names.remove(&old_name).is_none() { bad = true; }

            if bad
            {
                warn!("Inconsistent item name storage: {} {}", id, old_name);
                return false;
            }
        }

        if !new_name.is_empty()
        {
            self.ids.insert(id, String::from(new_name));
            self.names.insert(String::from(new_name), id);
        }

        true
    }

    pub fn len(&self) -> usize
    {
        self.items.len()
    }
}

impl<'a, T> IntoIterator for &'a NamedItemStore<T>
{
    type Item = &'a T;
    type IntoIter = std::slice::Iter<'a, T>;

    fn into_iter(self) -> Self::IntoIter
    {
        self.items.iter()
    }
}

#[derive(Deserialize, Debug)]
struct NamedItemStoreRaw<T>
{
    items : Vec<T>,
    names : HashMap<String, usize>
}

impl<'de, T : Deserialize<'de>> Deserialize<'de> for NamedItemStore<T>
{
    fn deserialize<D>(deserializer: D) -> Result<Self, <D as Deserializer<'de>>::Error>
        where D : Deserializer<'de>
    {
        let store_raw = NamedItemStoreRaw::<T>::deserialize(deserializer)?;

        let mut ids = HashMap::new();

        for (name, id) in &store_raw.names
        {
            ids.insert(*id, name.clone());
        }

        Ok(NamedItemStore::<T>
        {
            items : store_raw.items,
            names : store_raw.names,
            ids
        })
    }
}