minPos.minPos

Slice!(Iterator, N, kind == Contiguous && N > 1 ? Canonical : kind) minPos(Slice!(Iterator, N, kind) slice)
template minPos(alias pred = "a < b")
@optmath
static if(__traits(isSame, naryFun!pred, pred))
@optmath
Slice!(Iterator, N,
kind == Contiguous &&
N > 1
? Canonical : kind)
minPos
(
Iterator
size_t N
SliceKind kind
)
(
Slice!(Iterator, N, kind) slice
)
alias minPos = .minPos!(naryFun!pred)

Parameters

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

Return Value

Type: Slice!(Iterator, N,

kind == Contiguous &&

N > 1

? Canonical : kind)

Multidimensional backward index such that element is minimal(maximal). Backward index equals zeros, if slice is empty.

Meta

Source

See Implementation

mir algorithm iteration minPos functions

minPos