Count number of class in data.

Counts number of each class in slice.

IndirectSort sort the data and return the sorted index.

InplaceInsertionSort will sort the data and their index using insertion-sort algorithm.

InplaceMergesort sort the slice "d" in-place, without memory allocation, using mergesort algorithm.

IsExist will return true if value `v` exist in slice of `d`, otherwise it will return false.

Max find the maximum value in slice and return its value and index.

MaxCountOf count number of occurrence of each element of classes in data and return the class with maximum count.

MaxRange find the (last) maximum value in slice between index "l" and "r".

MergeByDistance merge two slice of integers by their distance between each others.

Min find the minimum value in slice and return its value and index.

MinRange find the (last) minimum value in slice between index "l" and "r".

Remove value "v" from slice if its exist and return new slice and true; otherwise, if not found, return unmodified slice and false.

SortByIndex will sort the slice `d` using sorted index `sortedListID`.

Sum all value in slice.

Swap two indices value of slice.

To64 convert slice of integer to 64 bit values.