Struct caffe2_opt::TransformSubgraph
source · pub struct TransformSubgraph<T, U> { /* private fields */ }
Expand description
| @note | | subgraph always starts with ops and | ends with tensors, except for the very | first group, which can be all tensors |
Implementations§
Auto Trait Implementations§
impl<T, U> RefUnwindSafe for TransformSubgraph<T, U>where T: RefUnwindSafe, U: RefUnwindSafe,
impl<T, U> !Send for TransformSubgraph<T, U>
impl<T, U> !Sync for TransformSubgraph<T, U>
impl<T, U> Unpin for TransformSubgraph<T, U>
impl<T, U> UnwindSafe for TransformSubgraph<T, U>where T: 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.