Enum caffe2_transform::TransformPatternMatchType

source · 
pub enum TransformPatternMatchType {
    CONNECTED_SUBGRAPH,
    SORTED_WRT_EXECUTION_ORDER,
    GENERAL,
}
Expand description

| Determines the type of subgraphs that | | PatternMatch will find. | | CONNECTED_SUBGRAPH will only match | subgraphs that are connected. | | These subgraphs satisfy that every | node of the match is connected to the | subgraph of the nodes that come before | it. | | For example, in the graph (1) –> (2) | –> (3) –> (4), | | This is capable of matching the subgraph | [2, 3] and [4, 3] | | This is not capable of matching the subgraph | [2, 4]. | | SORTED_WRT_EXECUTION_ORDER will | match subgraphs that guarantee sorted | execution order. | | The nodes don’t have to be connected. | It is faster than General. | | For example, in the graph (1) –> (2) | –> (3) –> (4), | | This is capable of matching the subgraph | [2, 4], [3, 4]. | | This is not capable of matching the subgraph | [3, 1], [4, 3]. | | GENERAL can match any subgraph. | | For example, in the graph (1) –> (2) | –> (3) –> (4), | | This is capable of matching subgraphs | [2, 4], [3, 4], [4, 2, 1]. | | There is no ordered subgraph of G that | cannot be matched by this. |

Variants§

§

CONNECTED_SUBGRAPH

§

SORTED_WRT_EXECUTION_ORDER

§

GENERAL

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere 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<U> for Twhere 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.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

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<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for Twhere 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<U>>::Error>

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
§

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

§

fn vzip(self) -> V

§

impl<T> Ungil for Twhere T: Send,