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

use crate::reference::*;
use crate::table::Table;
use crate::weak_entry::*;

pub struct TableVecLinearWeak<D, R, RW> {
    v: std::vec::Vec<WeakEntry<D, R, RW>>,
}

impl<D, R, RW> Default for TableVecLinearWeak<D, R, RW>
where
    D: std::hash::Hash + std::cmp::Eq + std::fmt::Debug,
    R: Reference<D>,
    RW: ReferenceWeak<D, R>,
{
    fn default() -> Self {
        Self { v: Vec::new() }
    }
}

impl<D, R, RW> Table<D, R> for TableVecLinearWeak<D, R, RW>
where
    D: std::hash::Hash + std::cmp::Eq + std::fmt::Debug,
    R: Reference<D>,
    RW: ReferenceWeak<D, R>,
{
    fn get(&self, hash: u64, data: &D) -> Option<R> {
        // Linear search
        for existing in self.v.iter().filter_map(|x| x.get(hash, data)) {
            return Some(existing);
        }
        None
    }

    fn get_or_insert<CF>(&mut self, hash: u64, mut data: D, creation_meta: CF) -> R
    where
        CF: FnOnce(&mut D),
    {
        if let Some(existing_obj) = self.get(hash, &data) {
            return existing_obj;
        }

        creation_meta(&mut data);
        let obj = R::new(data);
        let weak = RW::weak_downgrade(&obj);

        self.v.push(WeakEntry::new(hash, weak));

        obj
    }
}