Struct caffe2_nomnigraph::NomNode
source · pub struct NomNode<T, U = EmptyEdgeData> { /* private fields */ }Expand description
\brief NomNode within a NomGraph.
Implementations§
source§impl<T, U> NomNode<T, U>
impl<T, U> NomNode<T, U>
sourcepub fn add_in_edge(&mut self, e: EdgeRef<T, U>)
pub fn add_in_edge(&mut self, e: EdgeRef<T, U>)
| \brief Adds an edge by reference to known | in-edges. | | \p e A reference to an edge that will be | added as an in-edge.
sourcepub fn add_out_edge(&mut self, e: EdgeRef<T, U>)
pub fn add_out_edge(&mut self, e: EdgeRef<T, U>)
| \brief Adds an edge by reference to known | out-edges. | | \p e A reference to an edge that will be | added as an out-edge.
sourcepub fn remove_in_edge(&mut self, e: EdgeRef<T, U>)
pub fn remove_in_edge(&mut self, e: EdgeRef<T, U>)
| \brief Removes an edge by reference to | known in-edges. | | \p e A reference to an edge that will be | removed from in-edges.
sourcepub fn remove_out_edge(&mut self, e: EdgeRef<T, U>)
pub fn remove_out_edge(&mut self, e: EdgeRef<T, U>)
| \brief Removes an edge by reference to | known out-edges. | | \p e A reference to an edge that will be | removed from out-edges.
pub fn get_out_edges(&self) -> &Vec<EdgeRef<T, U>>
pub fn get_in_edges(&self) -> &Vec<EdgeRef<T, U>>
pub fn set_in_edges(&mut self, edges: Vec<EdgeRef<T, U>>)
pub fn set_out_edges(&mut self, edges: Vec<EdgeRef<T, U>>)
pub fn remove_edge_internal( &mut self, edges: &mut Vec<EdgeRef<T, U>>, e: EdgeRef<T, U> )
Trait Implementations§
Auto Trait Implementations§
impl<T, U> RefUnwindSafe for NomNode<T, U>where T: RefUnwindSafe, U: RefUnwindSafe,
impl<T, U = EmptyEdgeData> !Send for NomNode<T, U>
impl<T, U = EmptyEdgeData> !Sync for NomNode<T, U>
impl<T, U> Unpin for NomNode<T, U>where T: Unpin,
impl<T, U> UnwindSafe for NomNode<T, U>where T: UnwindSafe + RefUnwindSafe, U: RefUnwindSafe,
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.