CachedFwdGraph

rapimt::ver

Struct CachedFwdGraph 

pub struct CachedFwdGraph<NK, Node, Edge> { /* private fields */ }
Expand description

A forwarding graph can be registered with multiple plugins to verify different requirements.

An report is an execution result of a plugin. CachedFwdGraph cache reports of first executions of a plugins.

Methods from Deref<Target = Acyclic<Graph<Node, Edge>>>§

Source

pub fn get_position<'a>( &'a self, id: <G as GraphBase>::NodeId, ) -> TopologicalPosition
where &'a G: NodeIndexable<NodeId = <G as GraphBase>::NodeId> + GraphBase,

Get the position of a node in the topological sort.

Panics if the node index is out of bounds.

Source

pub fn at_position( &self, pos: TopologicalPosition, ) -> Option<<G as GraphBase>::NodeId>

Get the node at a given position in the topological sort, if it exists.

Source

pub fn nodes_iter(&self) -> impl Iterator<Item = <G as GraphBase>::NodeId>

Get an iterator over the nodes, ordered by their position.

Source

pub fn range<'r>( &'r self, range: impl RangeBounds<TopologicalPosition> + 'r, ) -> impl Iterator<Item = <G as GraphBase>::NodeId> + 'r

Get an iterator over the nodes within the range of positions.

The nodes are ordered by their position in the topological sort.

Source

pub fn inner(&self) -> &G

Get the underlying graph.

Source

pub fn try_add_edge( &mut self, a: <G as GraphBase>::NodeId, b: <G as GraphBase>::NodeId, weight: <G as Data>::EdgeWeight, ) -> Result<<G as GraphBase>::EdgeId, AcyclicEdgeError<<G as GraphBase>::NodeId>>
where G: Build, <G as GraphBase>::NodeId: IndexType,

Add an edge to the graph using Build::add_edge.

Returns the id of the added edge, or an AcyclicEdgeError if the edge would create a cycle, a self-loop or if the edge addition failed in the underlying graph.

In cases where edge addition using Build::add_edge cannot fail in the underlying graph (e.g. when multi-edges are allowed, as in DiGraph and StableDiGraph), this will return an error if and only if Self::is_valid_edge returns false.

Note that for some graph types, the semantics of Build::add_edge may not coincide with the semantics of the add_edge method provided by the graph type.

Panics if a or b are not found.

Source

pub fn try_update_edge( &mut self, a: <G as GraphBase>::NodeId, b: <G as GraphBase>::NodeId, weight: <G as Data>::EdgeWeight, ) -> Result<<G as GraphBase>::EdgeId, AcyclicEdgeError<<G as GraphBase>::NodeId>>
where G: Build, <G as GraphBase>::NodeId: IndexType,

Add or update an edge in a graph using Build::update_edge.

Returns the id of the updated edge, or an AcyclicEdgeError if the edge would create a cycle or a self-loop. If the edge does not exist, the edge is created.

This will return an error if and only if Self::is_valid_edge returns false.

Panics if a or b are not found.

Source

pub fn is_valid_edge( &self, a: <G as GraphBase>::NodeId, b: <G as GraphBase>::NodeId, ) -> bool
where <G as GraphBase>::NodeId: IndexType,

Check if an edge would be valid, i.e. adding it would not create a cycle.

Panics if a or b are not found.

Source

pub fn remove_edge( &mut self, e: <Graph<N, E, Directed, Ix> as GraphBase>::EdgeId, ) -> Option<E>

Remove an edge and return its edge weight, or None if it didn’t exist.

Pass through to underlying graph.

Source

pub fn remove_node( &mut self, n: <Graph<N, E, Directed, Ix> as GraphBase>::NodeId, ) -> Option<N>

Remove a node from the graph if it exists, and return its weight. If it doesn’t exist in the graph, return None.

This updates the order in O(v) runtime and removes the node in the underlying graph.

Trait Implementations§

§

impl<NK, Node, Edge> Deref for CachedFwdGraph<NK, Node, Edge>

§

type Target = Acyclic<Graph<Node, Edge>>

The resulting type after dereferencing.
§

fn deref(&self) -> &<CachedFwdGraph<NK, Node, Edge> as Deref>::Target

Dereferences the value.
§

impl<NK, Node, Edge> DerefMut for CachedFwdGraph<NK, Node, Edge>

§

fn deref_mut( &mut self, ) -> &mut <CachedFwdGraph<NK, Node, Edge> as Deref>::Target

Mutably dereferences the value.
§

impl<NK, Node, Edge> Sync for CachedFwdGraph<NK, Node, Edge>

Auto Trait Implementations§

§

impl<NK, Node, Edge> !Freeze for CachedFwdGraph<NK, Node, Edge>

§

impl<NK, Node, Edge> !RefUnwindSafe for CachedFwdGraph<NK, Node, Edge>

§

impl<NK, Node, Edge> Send for CachedFwdGraph<NK, Node, Edge>
where NK: Send, Node: Send, Edge: Send,

§

impl<NK, Node, Edge> Unpin for CachedFwdGraph<NK, Node, Edge>
where NK: Unpin, Node: Unpin, Edge: Unpin,

§

impl<NK, Node, Edge> !UnwindSafe for CachedFwdGraph<NK, Node, Edge>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

type Target = T

🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.