graph_safe_compare 0.2.1

Equivalence predicate that can handle cyclic, shared, and very-deep graphs.
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

use graph_safe_compare::utils::RefId;
pub use {
    graph_safe_compare::Node,
    std::{
        cmp::Ordering,
        rc::Rc,
    },
    tests_utils::node_types::rc_pair::{
        Datum,
        DatumAllocator,
    },
};


#[derive(Clone, Debug)]
pub struct My(pub Rc<Datum>);

impl Node for My
{
    type Cmp = Ordering;
    type Id = RefId<Rc<Datum>>;
    type Index = usize;

    fn id(&self) -> Self::Id
    {
        RefId(Rc::clone(&self.0))
    }

    fn get_edge(
        &self,
        idx: &Self::Index,
    ) -> Option<Self>
    {
        match (idx, &*self.0.0.borrow()) {
            (0, Some((a, _))) => Some(My(a.clone())),
            (1, Some((_, b))) => Some(My(b.clone())),
            _ => None,
        }
    }

    fn equiv_modulo_edges(
        &self,
        _other: &Self,
    ) -> Self::Cmp
    {
        Ordering::Equal
    }
}