sinistra 0.1.0-202603071957

A generic graph framework with pluggable storage and topology and streaming graph algorithms.
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

use std::{
    collections::{HashMap, HashSet},
    hash::Hash,
};

mod color;

pub use color::Color;

pub trait PropertyMap {
    type Key;
    type Value;

    fn get_property(&self, key: &Self::Key) -> Option<&Self::Value>;
    fn set_property(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value>;
}

pub trait PropertySet {
    type Key;

    fn check(&self, key: &Self::Key) -> bool;
    fn mark(&mut self, key: Self::Key, value: bool) -> bool;
}

impl<K: Hash + Eq, V> PropertyMap for HashMap<K, V> {
    type Key = K;
    type Value = V;

    fn get_property(&self, key: &Self::Key) -> Option<&Self::Value> {
        self.get(key)
    }

    fn set_property(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value> {
        self.insert(key, value)
    }
}

impl<K: Hash + Eq> PropertySet for HashSet<K> {
    type Key = K;

    fn check(&self, key: &Self::Key) -> bool {
        self.contains(key)
    }

    fn mark(&mut self, key: Self::Key, value: bool) -> bool {
        if value {
            self.insert(key)
        } else {
            self.remove(&key)
        }
    }
}