graphrecords-query 0.5.0

High-performance graph-based data records
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

mod edges;
mod endpoint;
mod neighbors;
mod nodes;
mod via_edges;
mod via_neighbors;
mod via_nodes;

use crate::{BoxedIterator, registry::OperationManifest};
pub use edges::EdgesOperation;
pub use endpoint::EndpointOperation;
use graphrecords_core::{
    GraphRecord,
    graphrecord::{EdgeIndex, NodeIndex},
};
pub use neighbors::NeighborsOperation;
pub use nodes::NodesOperation;
use std::fmt::{self, Display, Formatter};
pub use via_edges::ViaEdgesOperation;
pub use via_neighbors::ViaNeighborsOperation;
pub use via_nodes::ViaNodesOperation;

pub(super) fn operation_manifests() -> Vec<OperationManifest> {
    vec![
        edges::operation_manifest(),
        neighbors::operation_manifest(),
        nodes::operation_manifest(),
        via_edges::operation_manifest(),
        via_neighbors::operation_manifest(),
        via_nodes::operation_manifest(),
        endpoint::via_source_node::operation_manifest(),
        endpoint::via_target_node::operation_manifest(),
    ]
}

#[derive(Clone, Copy, PartialEq, Eq, Hash, Debug)]
pub enum EdgeDirection {
    Incoming,
    Outgoing,
    Both,
}

impl EdgeDirection {
    fn edges_for_node<'a>(
        self,
        graphrecord: &'a GraphRecord,
        node: &'a NodeIndex,
    ) -> BoxedIterator<'a, &'a EdgeIndex> {
        match self {
            Self::Outgoing => Box::new(graphrecord.outgoing_edges(node).expect("Node must exist")),
            Self::Incoming => Box::new(graphrecord.incoming_edges(node).expect("Node must exist")),
            Self::Both => Box::new(
                graphrecord
                    .outgoing_edges(node)
                    .expect("Node must exist")
                    .chain(graphrecord.incoming_edges(node).expect("Node must exist")),
            ),
        }
    }

    fn neighbors_for_node<'a>(
        self,
        graphrecord: &'a GraphRecord,
        node: &'a NodeIndex,
    ) -> BoxedIterator<'a, &'a NodeIndex> {
        match self {
            Self::Outgoing => Box::new(
                graphrecord
                    .outgoing_neighbors(node)
                    .expect("Node must exist"),
            ),
            Self::Incoming => Box::new(
                graphrecord
                    .incoming_neighbors(node)
                    .expect("Node must exist"),
            ),
            Self::Both => Box::new(graphrecord.neighbors(node).expect("Node must exist")),
        }
    }
}

impl Display for EdgeDirection {
    fn fmt(&self, formatter: &mut Formatter<'_>) -> fmt::Result {
        match self {
            Self::Incoming => formatter.write_str("incoming"),
            Self::Outgoing => formatter.write_str("outgoing"),
            Self::Both => formatter.write_str("both"),
        }
    }
}