Struct traitgraph_algo::traversal::ForbiddenNode

source · [−]

pub struct ForbiddenNode<NodeIndex> { /* private fields */ }

Expand description

A ForbiddenSubgraph that forbids a single node.

Implementations

source

impl<NodeIndex> ForbiddenNode<NodeIndex>

source

pub fn new(forbidden_node: NodeIndex) -> Self

Construct a new ForbiddenNode that forbids the given node.

Trait Implementations

source

impl<Graph: GraphBase> ForbiddenSubgraph<Graph> for ForbiddenNode<Graph::NodeIndex>

source

fn is_node_forbidden(&self, node: Graph::NodeIndex) -> bool

Returns true if the given node is forbidden.

source

fn is_edge_forbidden(&self, _: Graph::EdgeIndex) -> bool

Returns true if the given edge is forbidden.

Auto Trait Implementations

impl<NodeIndex> RefUnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: RefUnwindSafe,

impl<NodeIndex> Send for ForbiddenNode<NodeIndex> where
NodeIndex: Send,

impl<NodeIndex> Sync for ForbiddenNode<NodeIndex> where
NodeIndex: Sync,

impl<NodeIndex> Unpin for ForbiddenNode<NodeIndex> where
NodeIndex: Unpin,

impl<NodeIndex> UnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: UnwindSafe,

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct traitgraph_algo::traversal::ForbiddenNode

Implementations

impl<NodeIndex> ForbiddenNode<NodeIndex>

pub fn new(forbidden_node: NodeIndex) -> Self

Trait Implementations

impl<Graph: GraphBase> ForbiddenSubgraph<Graph> for ForbiddenNode<Graph::NodeIndex>

fn is_node_forbidden(&self, node: Graph::NodeIndex) -> bool

fn is_edge_forbidden(&self, _: Graph::EdgeIndex) -> bool

Auto Trait Implementations

impl<NodeIndex> RefUnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: RefUnwindSafe,

impl<NodeIndex> Send for ForbiddenNode<NodeIndex> where
NodeIndex: Send,

impl<NodeIndex> Sync for ForbiddenNode<NodeIndex> where
NodeIndex: Sync,

impl<NodeIndex> Unpin for ForbiddenNode<NodeIndex> where
NodeIndex: Unpin,

impl<NodeIndex> UnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

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

type Error = Infallible

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

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

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

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

fn vzip(self) -> V

Struct traitgraph_algo::traversal::ForbiddenNode

Implementations

impl<NodeIndex> ForbiddenNode<NodeIndex>

pub fn new(forbidden_node: NodeIndex) -> Self

Trait Implementations

impl<Graph: GraphBase> ForbiddenSubgraph<Graph> for ForbiddenNode<Graph::NodeIndex>

fn is_node_forbidden(&self, node: Graph::NodeIndex) -> bool

fn is_edge_forbidden(&self, _: Graph::EdgeIndex) -> bool

Auto Trait Implementations

impl<NodeIndex> RefUnwindSafe for ForbiddenNode<NodeIndex> where NodeIndex: RefUnwindSafe,

impl<NodeIndex> Send for ForbiddenNode<NodeIndex> where NodeIndex: Send,

impl<NodeIndex> Sync for ForbiddenNode<NodeIndex> where NodeIndex: Sync,

impl<NodeIndex> Unpin for ForbiddenNode<NodeIndex> where NodeIndex: Unpin,

impl<NodeIndex> UnwindSafe for ForbiddenNode<NodeIndex> where NodeIndex: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

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

type Error = Infallible

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

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

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

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

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V

impl<NodeIndex> RefUnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: RefUnwindSafe,

impl<NodeIndex> Send for ForbiddenNode<NodeIndex> where
NodeIndex: Send,

impl<NodeIndex> Sync for ForbiddenNode<NodeIndex> where
NodeIndex: Sync,

impl<NodeIndex> Unpin for ForbiddenNode<NodeIndex> where
NodeIndex: Unpin,

impl<NodeIndex> UnwindSafe for ForbiddenNode<NodeIndex> where
NodeIndex: UnwindSafe,

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

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

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

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

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

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,