pub struct AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef> { /* private fields */ }
Expand description
| Applies ‘{op}’ to each segment of input
| tensor. In order to allow for more efficient
| implementation of ‘{op}’, the input
| segments have to be contiguous and non-empty.
|
| SEGMENT_IDS is a vector that maps each
| of the first dimension slices of the
|
| DATA to a particular group (segment).
| Values belonging to the same segment
| are aggregated together.
|
| The first dimension of the output is
| equal to the number of input segments,
| i.e. SEGMENT_IDS[-1]+1
. Other dimensions
| are inherited from the input tensor.
|
| {op_doc}
|
Implementations§
source§impl<T, SIndex, Context, ReducerDef> AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>
impl<T, SIndex, Context, ReducerDef> AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>
pub fn populate_schema(schema: &mut OpSchema)
Auto Trait Implementations§
impl<T, SIndex, Context, ReducerDef> RefUnwindSafe for AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>where Context: RefUnwindSafe, ReducerDef: RefUnwindSafe, SIndex: RefUnwindSafe, T: RefUnwindSafe,
impl<T, SIndex, Context, ReducerDef> Send for AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>where Context: Send, ReducerDef: Send, SIndex: Send, T: Send,
impl<T, SIndex, Context, ReducerDef> Sync for AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>where Context: Sync, ReducerDef: Sync, SIndex: Sync, T: Sync,
impl<T, SIndex, Context, ReducerDef> Unpin for AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>where Context: Unpin, ReducerDef: Unpin, SIndex: Unpin, T: Unpin,
impl<T, SIndex, Context, ReducerDef> UnwindSafe for AbstractSortedSegmentRangeDef<T, SIndex, Context, ReducerDef>where Context: UnwindSafe, ReducerDef: UnwindSafe, SIndex: UnwindSafe, T: UnwindSafe,
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.