minIndex.minIndex

size_t[N] minIndex(Slice!(Iterator, N, kind) slice)
template minIndex(alias pred = "a < b")
@optmath
static if(__traits(isSame, naryFun!pred, pred))
@optmath
size_t[N]
minIndex
(
Iterator
size_t N
SliceKind kind
)
(
Slice!(Iterator, N, kind) slice
)
alias minIndex = .minIndex!(naryFun!pred)

Parameters

slice Slice!(Iterator, N, kind): ndslice.

Return Value

Type: size_t[N]

Multidimensional index such that element is minimal(maximal). Index elements equal to size_t.max, if slice is empty.

Meta

Source

See Implementation

mir algorithm iteration minIndex functions

minIndex