worktable 0.9.0-alpha9

WorkTable is in-memory storage
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

use std::fmt::Debug;
use std::hash::Hash;

use data_bucket::Link;
use indexset::core::multipair::MultiPair;
use indexset::core::node::NodeLike;
use indexset::core::pair::Pair;

use crate::util::OffsetEqLink;
use crate::{IndexMap, IndexMultiMap};

mod cdc;
pub mod util;

pub use cdc::TableIndexCdc;
pub use util::convert_change_events;

pub trait TableIndex<T> {
    fn insert(&self, value: T, link: Link) -> Option<Link>;
    fn insert_checked(&self, value: T, link: Link) -> Option<()>;
    fn remove(&self, value: &T, link: Link) -> Option<(T, Link)>;
}

impl<T, Node> TableIndex<T> for IndexMultiMap<T, OffsetEqLink, Node>
where
    T: Debug + Eq + Hash + Clone + Send + Ord,
    Node: NodeLike<MultiPair<T, OffsetEqLink>> + Send + 'static,
{
    fn insert(&self, value: T, link: Link) -> Option<Link> {
        self.insert(value, OffsetEqLink(link)).map(|l| l.0)
    }

    fn insert_checked(&self, value: T, link: Link) -> Option<()> {
        if self.insert(value, OffsetEqLink(link)).is_some() {
            None
        } else {
            Some(())
        }
    }

    fn remove(&self, value: &T, link: Link) -> Option<(T, Link)> {
        self.remove(value, &OffsetEqLink(link))
            .map(|(v, l)| (v, l.0))
    }
}

impl<T, Node> TableIndex<T> for IndexMap<T, OffsetEqLink, Node>
where
    T: Debug + Eq + Hash + Clone + Send + Ord,
    Node: NodeLike<Pair<T, OffsetEqLink>> + Send + 'static,
{
    fn insert(&self, value: T, link: Link) -> Option<Link> {
        self.insert(value, OffsetEqLink(link)).map(|l| l.0)
    }

    fn insert_checked(&self, value: T, link: Link) -> Option<()> {
        self.checked_insert(value, OffsetEqLink(link))
    }

    fn remove(&self, value: &T, _: Link) -> Option<(T, Link)> {
        self.remove(value).map(|(v, l)| (v, l.0))
    }
}