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
49
50
51
52
53
54

use {
    graph_safe_compare::{
        Cmp,
        Node,
    },
    std::{
        cmp::Ordering,
        convert::identity,
    },
    tests_utils::node_types::lazy::{
        Datum,
        DatumAllocator,
        Id,
    },
};


#[derive(Clone, Debug)]
struct My(Datum);

impl Node for My
{
    type Cmp = Ordering;
    type Id = Id;
    type Index = usize;

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

    fn get_edge(
        &self,
        index: &Self::Index,
    ) -> Option<Self>
    {
        match (self.0.get_edges(), index) {
            (Some((a, _)), 0) => Some(My(a)),
            (Some((_, b)), 1) => Some(My(b)),
            _ => None,
        }
    }

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


tests_utils::eq_variations_tests!(My, Datum, identity, DatumAllocator::new);