And tests whether the slice satisfying c != zero within all c in the slice.

AndFunc tests the slice satisfying f(c), or true if none do.

Contains reports whether v is present in s.

ContainsFunc reports whether v satisfying f(s[i]) is present in s.

Filter returns a slice satisfying c != zero within all c in the slice.

FilterFunc returns a slice satisfying f(c) within all c in the slice.

FirstFunc returns the first item from the slice satisfying f(c), or zero if none do.

FirstOrZero returns the first non-zero item from the slice, or zero if none do.

FirstOrZeroFunc returns the first item from the slice satisfying f(c), or zero if none do.

FromSwigVector returns a slice mapped by v.Get() within all c in the SwigVector[E].

FromSwigVectorFunc returns a slice mapped by mapped by f(v.Get()) within all c in the SwigVector[E].

Group returns a map group by all elements in s that have the same values.

GroupFunc returns a map satisfying f(c) within all c in the map group by all elements in s that have the same values.

Intersect returns a slice satisfying c != zero within all c in the slice.

IntersectFunc returns a slice satisfying f(c) within all c in the slice.

IsPartialSorted reports whether data[:k] is partial sorted, as top k of data[:].

LinearSearch searches for target in a sorted slice and returns the position where target is found, or the position where target would appear in the sort order; it also returns a bool saying whether the target is really found in the slice.

LinearSearchFunc works like LinearSearch, but uses a custom comparison function.

Map returns a slice mapped by format "%v" within all c in the slice.

MapFunc returns a slice mapped by f(c) within all c in the slice.

MapIndexFunc works like MapFunc, returns a slice mapped by f(i, c) within all c in the slice.

Or tests whether the slice satisfying c != zero within any c in the slice.

OrFunc tests the slice satisfying f(c), or false if none do.

PartialSort rearranges elements such that the range [0, m) contains the sorted m smallest elements in the range [first, data.Len).

PartialSortFunc works like PartialSort, but uses a custom comparison function.

Reverse reorder a slice of any ordered type in reverse order.

SearchMax uses liner search to find and return the biggest index i in [0, n) at which f(i) is min(f...), assuming that on the range [0, n), Search returns the first true index.

SearchMin uses liner search to find and return the smallest index i in [0, n) at which f(i) is min(f...), assuming that on the range [0, n), Search returns the first true index.

SearchMinFunc works like SearchMin, but uses a custom comparison function.

Split slices s into all subslices separated by sep and returns a slice of the subslices between those separators.

SplitMap slices s into all key-value pairs and returns a map of the key-value pairs.

SplitN slices s into subslices and returns a slice of the subslices.

ToSwigVector returns a SwigVector[E] mapped by v.Get() within all c in the slice.

ToSwigVectorFunc returns a SwigVector[E] mapped by f(c) within all c in the slice.

TypeAssertFilter returns a slice satisfying r, ok := any(c).(R); ok == true within all r in the slice.

TypeAssertFilterFunc returns a slice satisfying f(c) within all c in the slice.

Union returns a slice satisfying c != zero within all c in the slice.

UnionFunc returns a slice satisfying f(c) within all c in the slice.

Uniq returns a slice satisfying c != zero within all c in the slice.

UniqFunc returns a slice satisfying f(c) within all c in the slice.

SwigVector represents Go wrapper with std::vector<T> %include <std_vector.i> %template(vector_float) std::vector<float>; See: https://www.swig.org/Doc4.1/Go.html.

An MaxHeap is a max-heap of slices.

An MinHeap is a min-heap of slices.

SortSlice attaches the methods of Interface to []E, sorting in increasing order.