toolbox-rs 0.6.0

A toolbox of basic data structures and 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
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

use bincode::{Decode, Encode};

use crate::graph::NodeID;
use core::mem::swap;

pub trait Edge {
    type ID;
    fn source(&self) -> Self::ID;
    fn target(&self) -> Self::ID;
}

pub trait EdgeData {
    type DATA;
    fn data(&self) -> &Self::DATA;
}

pub trait EdgeWithData: Edge<ID = usize> + EdgeData<DATA = i32> {}
impl EdgeWithData for InputEdge<i32> {}

#[derive(Clone, Copy, Debug, bincode::Decode, bincode::Encode)]
pub struct TrivialEdge {
    pub source: usize,
    pub target: usize,
}

impl Edge for TrivialEdge {
    type ID = NodeID;
    fn source(&self) -> Self::ID {
        self.source
    }
    fn target(&self) -> Self::ID {
        self.target
    }
}

#[derive(Clone, Copy, Debug, Default, Eq, PartialOrd, Ord, PartialEq, Decode, Encode)]
pub struct InputEdge<EdgeDataT: Eq> {
    pub source: NodeID,
    pub target: NodeID,
    pub data: EdgeDataT,
}

impl<EdgeDataT: std::cmp::Eq> Edge for InputEdge<EdgeDataT> {
    type ID = NodeID;
    fn source(&self) -> Self::ID {
        self.source
    }
    fn target(&self) -> Self::ID {
        self.target
    }
}

impl<EdgeDataT: std::cmp::Eq> EdgeData for InputEdge<EdgeDataT> {
    type DATA = EdgeDataT;
    fn data(&self) -> &Self::DATA {
        &self.data
    }
}

impl<EdgeDataT: Eq> InputEdge<EdgeDataT> {
    pub fn new(source: NodeID, target: NodeID, data: EdgeDataT) -> Self {
        Self {
            source,
            target,
            data,
        }
    }

    pub fn is_parallel_to(&self, other: &Self) -> bool {
        self.source == other.source && self.target == other.target
    }

    pub fn reverse(&mut self) {
        swap(&mut self.source, &mut self.target);
    }
}
pub type SimpleEdge = InputEdge<u32>;

#[test]
fn simple_edge_parallel() {
    let edge1 = SimpleEdge::new(1, 2, 3);
    let edge2 = SimpleEdge::new(1, 2, 6);

    assert!(edge1.is_parallel_to(&edge1));
    assert!(edge1.is_parallel_to(&edge2));
    assert!(edge2.is_parallel_to(&edge1));
    assert!(edge2.is_parallel_to(&edge2));
}

#[test]
fn trivial_edge_accessor() {
    let edge = TrivialEdge {
        source: 1,
        target: 2,
    };

    assert_eq!(edge.source(), 1);
    assert_eq!(edge.target(), 2);
}