mir-algorithm ~master (2021-09-24T13:11:04Z)

sort.sort

mir ndslice sorting sort

Sort for one-dimensional Series.

  1. Slice!(Iterator, N, kind) sort(Slice!(Iterator, N, kind) slice)
  2. T[] sort(T[] ar)
  3. Series!(IndexIterator, Iterator, N, kind) sort(Series!(IndexIterator, Iterator, N, kind) series)
    template sort(alias less = "a < b")
    @optmath
    static if(__traits(isSame, naryFun!less, less))
    @optmath
    Series!(IndexIterator, Iterator, N, kind)
    sort
    (
    IndexIterator
    Iterator
    size_t N
    SliceKind kind
    )
    (
    Series!(IndexIterator, Iterator, N, kind) series
    )
    if (
    N == 1
    )
  4. Series!(IndexIterator, Iterator, N, kind) sort(Series!(IndexIterator, Iterator, N, kind) series, Slice!SortIndexIterator indexBuffer, Slice!DataIterator dataBuffer)
  5. alias sort = .sort!(naryFun!less)

Meta

Source

See Implementation

mir ndslice sorting sort functions

Page generated by adrdox