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

use {
    graph_safe_compare::utils::RefId,
    tests_utils::node_types::borrow_pair::Inner,
};
pub use {
    graph_safe_compare::Node,
    tests_utils::node_types::borrow_pair::{
        Datum,
        DatumAllocator,
    },
};


#[derive(Copy, Clone, Debug)]
pub struct My<'l>(pub &'l Datum<'l>);

impl<'l> Node for My<'l>
{
    type Cmp = bool;
    type Id = RefId<&'l Datum<'l>>;
    type Index = u32;

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

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

    fn equiv_modulo_edges(
        &self,
        _other: &Self,
    ) -> bool
    {
        true
    }
}