Struct swh_graph::views::GraphSpy

pub struct GraphSpy<G: SwhGraph> {
    pub graph: G,
    pub history: Arc<Mutex<Vec<(&'static str, String)>>>,
}

Wraps a graph, and records calls to its methods, useful for tests

Fields

graph: G

history: Arc<Mutex<Vec<(&'static str, String)>>>

Pairs of (method, arguments)

Implementations

impl<G: SwhGraph> GraphSpy<G>

pub fn new(graph: G) -> Self

Trait Implementations

impl<G: SwhBackwardGraph> SwhBackwardGraph for GraphSpy<G>

type Predecessors<'succ> = <G as SwhBackwardGraph>::Predecessors<'succ> where Self: 'succ

fn predecessors(&self, node_id: NodeId) -> Self::Predecessors<'_>

Return an IntoIterator over the predecessors of a node.

fn indegree(&self, node_id: NodeId) -> usize

Return the number of predecessors of a node.

impl<G: SwhForwardGraph> SwhForwardGraph for GraphSpy<G>

type Successors<'succ> = <G as SwhForwardGraph>::Successors<'succ> where Self: 'succ

fn successors(&self, node_id: NodeId) -> Self::Successors<'_>

Return an IntoIterator over the successors of a node.

fn outdegree(&self, node_id: NodeId) -> usize

Return the number of successors of a node.

impl<G: SwhGraph> SwhGraph for GraphSpy<G>

fn path(&self) -> &Path

Return the base path of the graph

fn is_transposed(&self) -> bool

Returns whether the graph is in the ori->snp->rel,rev->dir->cnt direction (with a few dir->rev arcs)

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn has_node(&self, node_id: NodeId) -> bool

Returns whether the given node id exists in the graph

fn num_arcs(&self) -> u64

Return the number of arcs in the graph.

fn has_arc(&self, src_node_id: NodeId, dst_node_id: NodeId) -> bool

Return whether there is an arc going from src_node_id to dst_node_id.

impl<G: SwhGraphWithProperties> SwhGraphWithProperties for GraphSpy<G>

type Maps = <G as SwhGraphWithProperties>::Maps

type Timestamps = <G as SwhGraphWithProperties>::Timestamps

type Persons = <G as SwhGraphWithProperties>::Persons

type Contents = <G as SwhGraphWithProperties>::Contents

type Strings = <G as SwhGraphWithProperties>::Strings

type LabelNames = <G as SwhGraphWithProperties>::LabelNames

fn properties( &self ) -> &SwhGraphProperties<Self::Maps, Self::Timestamps, Self::Persons, Self::Contents, Self::Strings, Self::LabelNames>

impl<G: SwhLabelledBackwardGraph> SwhLabelledBackwardGraph for GraphSpy<G>

type LabelledArcs<'arc> = <G as SwhLabelledBackwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'succ> = <G as SwhLabelledBackwardGraph>::LabelledPredecessors<'succ> where Self: 'succ

fn labelled_predecessors( &self, node_id: NodeId ) -> Self::LabelledPredecessors<'_>

Return an IntoIterator over the successors of a node.

impl<G: SwhLabelledForwardGraph> SwhLabelledForwardGraph for GraphSpy<G>

type LabelledArcs<'arc> = <G as SwhLabelledForwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledSuccessors<'succ> = <G as SwhLabelledForwardGraph>::LabelledSuccessors<'succ> where Self: 'succ

fn labelled_successors(&self, node_id: NodeId) -> Self::LabelledSuccessors<'_>

Return an IntoIterator over the successors of a node.