Struct graphannis_core::graph::storage::prepost::PrePostOrderStorage

pub struct PrePostOrderStorage<OrderT: NumValue, LevelT: NumValue> { /* private fields */ }

Implementations

impl<OrderT, LevelT> PrePostOrderStorage<OrderT, LevelT> where
    OrderT: NumValue,
    LevelT: NumValue, 

pub fn new() -> PrePostOrderStorage<OrderT, LevelT>

pub fn clear(&mut self) -> Result<()>

Trait Implementations

impl<OrderT: Clone + NumValue, LevelT: Clone + NumValue> Clone for PrePostOrderStorage<OrderT, LevelT>

fn clone(&self) -> PrePostOrderStorage<OrderT, LevelT>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<OrderT, LevelT> Default for PrePostOrderStorage<OrderT, LevelT> where
    OrderT: NumValue,
    LevelT: NumValue, 

fn default() -> Self

Returns the “default value” for a type.

impl<'de, OrderT: NumValue, LevelT: NumValue> Deserialize<'de> for PrePostOrderStorage<OrderT, LevelT> where
    OrderT: Deserialize<'de>,
    LevelT: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<OrderT: 'static, LevelT: 'static> EdgeContainer for PrePostOrderStorage<OrderT, LevelT> where
    for<'de> OrderT: NumValue + Deserialize<'de> + Serialize,
    for<'de> LevelT: NumValue + Deserialize<'de> + Serialize, 

fn get_outgoing_edges<'a>(
    &'a self,
    node: NodeID
) -> Box<dyn Iterator<Item = Result<NodeID>> + 'a>

Get all outgoing edges for a given node.

fn get_ingoing_edges<'a>(
    &'a self,
    node: NodeID
) -> Box<dyn Iterator<Item = Result<NodeID>> + 'a>

Get all incoming edges for a given node.

fn source_nodes<'a>(&'a self) -> Box<dyn Iterator<Item = Result<NodeID>> + 'a>

Provides an iterator over all nodes of this edge container that are the source of an edge

fn get_statistics(&self) -> Option<&GraphStatistic>

fn has_outgoing_edges(&self, node: NodeID) -> Result<bool>

Return true of the given node has any outgoing edges.

impl<OrderT: 'static, LevelT: 'static> GraphStorage for PrePostOrderStorage<OrderT, LevelT> where
    for<'de> OrderT: NumValue + Deserialize<'de> + Serialize,
    for<'de> LevelT: NumValue + Deserialize<'de> + Serialize, 

fn get_anno_storage(&self) -> &dyn AnnotationStorage<Edge>

Get the annotation storage for the edges of this graph storage.

fn serialization_id(&self) -> String

Return an identifier for this graph storage which is used to distinguish the different graph storages when (de-) serialized.

fn load_from(location: &Path) -> Result<Self> where
    for<'de> Self: Sized + Deserialize<'de>, 

Load the graph storage from a location on the disk. This location is a directory, which can contain files specific to this graph storage.

fn save_to(&self, location: &Path) -> Result<()>

Save the graph storage a location on the disk. This location must point to an existing directory.

fn find_connected<'a>(
    &'a self,
    node: NodeID,
    min_distance: usize,
    max_distance: Bound<usize>
) -> Box<dyn Iterator<Item = Result<NodeID>> + 'a>

Find all nodes reachable from a given start node inside the component.

fn find_connected_inverse<'a>(
    &'a self,
    start_node: NodeID,
    min_distance: usize,
    max_distance: Bound<usize>
) -> Box<dyn Iterator<Item = Result<NodeID>> + 'a>

Find all nodes reachable from a given start node inside the component, when the directed edges are inversed.

fn distance(&self, source: NodeID, target: NodeID) -> Result<Option<usize>>

Compute the distance (shortest path length) of two nodes inside this component.

fn is_connected(
    &self,
    source: NodeID,
    target: NodeID,
    min_distance: usize,
    max_distance: Bound<usize>
) -> Result<bool>

Check if two nodes are connected with any path in this component given a minimum (min_distance) and maximum (max_distance) path length.

fn copy(
    &mut self,
    node_annos: &dyn AnnotationStorage<NodeID>,
    orig: &dyn GraphStorage
) -> Result<()>

Copy the content of another component. This removes the existing content of this graph storage.

fn as_edgecontainer(&self) -> &dyn EdgeContainer

Upcast this graph storage to the EdgeContainer trait.

fn as_writeable(&mut self) -> Option<&mut dyn WriteableGraphStorage>

Try to downcast this graph storage to a WriteableGraphStorage trait. Returns None if this graph storage is not writable.

fn inverse_has_same_cost(&self) -> bool

If true, finding the inverse connected nodes via find_connected_inverse(…) has the same cost as the non-inverse case.

impl<OrderT: NumValue, LevelT: NumValue> MallocSizeOf for PrePostOrderStorage<OrderT, LevelT> where
    OrderT: MallocSizeOf,
    LevelT: MallocSizeOf, 

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl<OrderT: NumValue, LevelT: NumValue> Serialize for PrePostOrderStorage<OrderT, LevelT> where
    OrderT: Serialize,
    LevelT: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.