mir-algorithm ~master (2021-09-24T13:11:04Z)
Dub
Repo
mir_slice.front
mir
ndslice
slice
mir_slice
Multidimensional input range primitive.
auto ref
front
()
auto ref
front
()
auto ref
front
()
Element
!
dimension
front
()
auto
front
()
auto
front
()
auto ref
front
(T value)
struct
mir_slice
(Iterator_, size_t N_ = 1, SliceKind kind_ = Contiguous, Labels_...)
ref scope return @
trusted
@
property
@
optmath
static if
(
N == 1 && isMutable!DeepElement && !hasAccessByRef
)
auto ref
front
(
size_t
dimension
= 0
T
)
(
T
value
)
if
(
dimension
== 0
)
if
(
0 <
N_
&&
N_
< 255
&&
!
(
kind_
==
Canonical
&&
N_
== 1
)
&&
Labels_.length
<=
N_
&&
isIterator
!
Iterator_
)
bool
empty
()
Element
!
dimension
back
()
Meta
Source
See Implementation
mir
ndslice
slice
mir_slice
aliases
DeepElement
Iterator
Labels
This
_Structure
_lengths
_strides
opDollar
ptr
serdeKeysProxy
enums
PureIndexLength
isFullPureSlice
isIndexedSlice
isPureSlice
functions
_stride
accessFlat
anyEmpty
back
backIndex
backward
dup
elementCount
empty
field
first
front
idup
indexStride
iterator
label
last
lastIndex
length
lightConst
lightImmutable
lightScope
opBinary
opBinaryRight
opEquals
opIndex
opIndexAssign
opIndexOpAssign
opIndexOpAssignImplArray
opIndexUnary
opSlice
opUnary
popBack
popBackAll
popBackExactly
popBackN
popFront
popFrontAll
popFrontExactly
popFrontN
save
select
selectBack
selectFront
shape
strides
structure
toConst
toImmutable
values
manifest constants
doUnittest
hasAccessByRef
templates
Element
variables
L
N
S
_iterator
_labels
_structure
kind
Multidimensional input range primitive.