crdt-graph 0.3.1

An op-based 2P2P-Graph CRDT implementation in Rust.
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 crate::graph::{TwoPTwoPId, TwoPTwoPRemoveEdge, TwoPTwoPRemoveVertex};
use uuid::Uuid;

pub mod bytes;
pub mod simple;
pub mod string;

// ===========================================================================
// Shared remove-operation types (identical across all graph variants)
// ===========================================================================

/// A vertex-remove operation. Only references the original add by ID.
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct RemoveVertex {
    pub id: Uuid,
    pub add_vertex_id: Uuid,
}

impl TwoPTwoPId<Uuid> for RemoveVertex {
    fn id(&self) -> &Uuid {
        &self.id
    }
}

impl TwoPTwoPRemoveVertex<Uuid> for RemoveVertex {
    fn add_vertex_id(&self) -> &Uuid {
        &self.add_vertex_id
    }
}

/// An edge-remove operation. Only references the original add by ID.
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct RemoveEdge {
    pub id: Uuid,
    pub add_edge_id: Uuid,
}

impl TwoPTwoPId<Uuid> for RemoveEdge {
    fn id(&self) -> &Uuid {
        &self.id
    }
}

impl TwoPTwoPRemoveEdge<Uuid> for RemoveEdge {
    fn add_edge_id(&self) -> &Uuid {
        &self.add_edge_id
    }
}