Struct caffe2op_segmentreduction::AbstractSparseLengthsDef

pub struct AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> { /* private fields */ }

Expand description

| Pulls in slices of the input tensor, | groups them into segments and applies | ‘{op}’ to each segment. Segments are | defined by their LENGTHS. | | This op is basically Gather and Lengths{op} | fused together. | | INDICES should contain integers in | range 0..N-1 where N is the first dimension | of DATA. INDICES represent which slices | of DATA need to be pulled in. | | LENGTHS is a vector that defines slice | sizes by first dimension of DATA. Values | belonging to the same segment are aggregated | together. sum(LENGTHS) has to match | INDICES size. | | The first dimension of the output is | equal to the number of input segment, | i.e. len(LENGTHS). Other dimensions | are inherited from the input tensor. | | {op_doc} bool GradientNeedIndices | = false> |

Implementations§

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>

pub fn populate_schema(schema: &mut OpSchema)

Auto Trait Implementations§

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> RefUnwindSafe for AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>where Context: RefUnwindSafe, ReducerDef: RefUnwindSafe, SIndex: RefUnwindSafe, T: RefUnwindSafe,

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> Send for AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>where Context: Send, ReducerDef: Send, SIndex: Send, T: Send,

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> Sync for AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>where Context: Sync, ReducerDef: Sync, SIndex: Sync, T: Sync,

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> Unpin for AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>where Context: Unpin, ReducerDef: Unpin, SIndex: Unpin, T: Unpin,

impl<T, SIndex, Context, ReducerDef, const GradientNeedIndices: bool> UnwindSafe for AbstractSparseLengthsDef<T, SIndex, Context, ReducerDef, GradientNeedIndices>where Context: UnwindSafe, ReducerDef: UnwindSafe, SIndex: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

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

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.

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.

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,