Documentation
¶
Index ¶
- func IntrincsLess[T common.IntrincsOrd](a, b T) bool
- func IntrincsMax[T common.IntrincsOrd](arr ...T) T
- func IntrincsMax2[T common.IntrincsOrd](a, b T) T
- func IntrincsMin[T common.IntrincsOrd](arr ...T) T
- func IntrincsMin2[T common.IntrincsOrd](a, b T) T
- func NewSliceBy[T any](len int, cap int, f func(int) T) []T
- func NewSliceFilling[T any](len int, cap int, elem T) []T
- func SliceClone[T any](sl []T, keepCap bool) []T
- func SliceFilter[T any](sl []T, f func(int, T) bool) []T
- func SliceFlatMap[T, U any](sl []T, f func(int, T) []U) []U
- func SliceForeach[T any](sl []T, f func(int, T))
- func SliceHeapSort[T any](sl []T, lessOp LessOp[T])
- func SliceHeapSortIntrincs[T common.IntrincsOrd](sl []T)
- func SliceInsertionSort[T any](sl []T, lessOp LessOp[T])
- func SliceInsertionSortIntrincs[T common.IntrincsOrd](sl []T)
- func SliceIsSorted[T any](sl []T, lessOp LessOp[T]) bool
- func SliceIsSortedIntrincs[T common.IntrincsOrd](sl []T, lessOp LessOp[T]) bool
- func SliceMap[T, U any](sl []T, f func(int, T) U) []U
- func SliceMax[T any](sl []T, lessOp func(T, T) bool) T
- func SliceMaxIntrincs[T common.IntrincsOrd](sl []T) T
- func SliceMin[T any](sl []T, lessOp func(T, T) bool) T
- func SliceMinIntrincs[T common.IntrincsOrd](sl []T) T
- func SliceNthElement[T any](sl []T, n int, lessOp LessOp[T])
- func SliceNthElementIntrincs[T common.IntrincsOrd](sl []T, n int)
- func SlicePartialSort[T any](sl []T, n int, lessOp LessOp[T])
- func SlicePartialSortIntrincs[T common.IntrincsOrd](sl []T, n int)
- func SliceQuickSort[T any](sl []T, lessOp LessOp[T])
- func SliceQuickSortIntrincs[T common.IntrincsOrd](sl []T)
- func SliceReduce[T, U any](sl []T, f func(U, int, T) U, init U) U
- func SliceReverse[T any](sl []T)
- func SliceScan[T, U any](sl []T, f func(U, int, T) U, init U) []U
- func SliceStableSort[T any](sl []T, lessOp LessOp[T])
- func SliceStableSortIntrincs[T common.IntrincsOrd](sl []T)
- func SliceSwapRange[T any](sl []T, i, j, n int)
- func SliceZip2By[T, U, V any](slA []T, slB []U, f func(int, T, U) V) []V
- func SliceZip3By[T, U, V, W any](slA []T, slB []U, slC []V, f func(int, T, U, V) W) []W
- type LessOp
- type Optional
- type Result
- func NewResult[T any](data T, err error) *Result[T]
- func NewResultErr[T any](err error) *Result[T]
- func NewResultOk[T any](data T) *Result[T]
- func ResultFlatMap[T, U any](r *Result[T], f func(T) *Result[U]) *Result[U]
- func ResultFlatMapCascade2[T1, T2, T3 any](r *Result[T1], f1 func(T1) *Result[T2], f2 func(T2) *Result[T3]) *Result[T3]
- func ResultFlatMapCascade3[T1, T2, T3, T4 any](r *Result[T1], f1 func(T1) *Result[T2], f2 func(T2) *Result[T3], ...) *Result[T4]
- func ResultFlatMapCascade4[T1, T2, T3, T4, T5 any](r *Result[T1], f1 func(T1) *Result[T2], f2 func(T2) *Result[T3], ...) *Result[T5]
- func ResultFlatMapCascade5[T1, T2, T3, T4, T5, T6 any](r *Result[T1], f1 func(T1) *Result[T2], f2 func(T2) *Result[T3], ...) *Result[T6]
- func ResultFlatMapCascade6[T1, T2, T3, T4, T5, T6, T7 any](r *Result[T1], f1 func(T1) *Result[T2], f2 func(T2) *Result[T3], ...) *Result[T7]
- func ResultFlatMapRaw[T, U any](r *Result[T], f ResultRawFunc[T, U]) *Result[U]
- func ResultFlatMapRawCascade2[T1, T2, T3 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3]) *Result[T3]
- func ResultFlatMapRawCascade3[T1, T2, T3, T4 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], ...) *Result[T4]
- func ResultFlatMapRawCascade4[T1, T2, T3, T4, T5 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], ...) *Result[T5]
- func ResultFlatMapRawCascade5[T1, T2, T3, T4, T5, T6 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], ...) *Result[T6]
- func ResultFlatMapRawCascade6[T1, T2, T3, T4, T5, T6, T7 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], ...) *Result[T7]
- func ResultMap[T, U any](r *Result[T], f func(T) U) *Result[U]
- type ResultRawFunc
- type Tuple2
- type Tuple3
- type Tuple4
- type Tuple5
- type Tuple6
- type Variant2
- type Variant3
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func IntrincsLess ¶
func IntrincsLess[T common.IntrincsOrd](a, b T) bool
func IntrincsMax ¶
func IntrincsMax[T common.IntrincsOrd](arr ...T) T
func IntrincsMax2 ¶
func IntrincsMax2[T common.IntrincsOrd](a, b T) T
func IntrincsMin ¶
func IntrincsMin[T common.IntrincsOrd](arr ...T) T
func IntrincsMin2 ¶
func IntrincsMin2[T common.IntrincsOrd](a, b T) T
func NewSliceFilling ¶
func SliceClone ¶
func SliceFilter ¶
func SliceFlatMap ¶
func SliceForeach ¶
func SliceHeapSort ¶
func SliceHeapSortIntrincs ¶
func SliceHeapSortIntrincs[T common.IntrincsOrd](sl []T)
func SliceInsertionSort ¶
func SliceInsertionSortIntrincs ¶
func SliceInsertionSortIntrincs[T common.IntrincsOrd](sl []T)
func SliceIsSorted ¶
func SliceIsSortedIntrincs ¶
func SliceIsSortedIntrincs[T common.IntrincsOrd](sl []T, lessOp LessOp[T]) bool
func SliceMaxIntrincs ¶
func SliceMaxIntrincs[T common.IntrincsOrd](sl []T) T
func SliceMinIntrincs ¶
func SliceMinIntrincs[T common.IntrincsOrd](sl []T) T
func SliceNthElement ¶
func SliceNthElementIntrincs ¶
func SliceNthElementIntrincs[T common.IntrincsOrd](sl []T, n int)
func SlicePartialSort ¶
func SlicePartialSortIntrincs ¶
func SlicePartialSortIntrincs[T common.IntrincsOrd](sl []T, n int)
func SliceQuickSort ¶
func SliceQuickSortIntrincs ¶
func SliceQuickSortIntrincs[T common.IntrincsOrd](sl []T)
func SliceReduce ¶
func SliceReverse ¶
func SliceReverse[T any](sl []T)
func SliceStableSort ¶
func SliceStableSortIntrincs ¶
func SliceStableSortIntrincs[T common.IntrincsOrd](sl []T)
func SliceSwapRange ¶
func SliceZip2By ¶
func SliceZip3By ¶
Types ¶
type Optional ¶
type Optional[T any] struct { // contains filtered or unexported fields }
func NewOptionalNone ¶
func NewOptionalSome ¶
func OptionalFlatMap ¶
func OptionalMap ¶
type Result ¶
type Result[T any] struct { // contains filtered or unexported fields }
func NewResultErr ¶
func NewResultOk ¶
func ResultFlatMapCascade2 ¶
func ResultFlatMapCascade3 ¶
func ResultFlatMapCascade4 ¶
func ResultFlatMapCascade5 ¶
func ResultFlatMapCascade6 ¶
func ResultFlatMapRaw ¶
func ResultFlatMapRaw[T, U any](r *Result[T], f ResultRawFunc[T, U]) *Result[U]
func ResultFlatMapRawCascade2 ¶
func ResultFlatMapRawCascade2[T1, T2, T3 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3]) *Result[T3]
func ResultFlatMapRawCascade3 ¶
func ResultFlatMapRawCascade3[T1, T2, T3, T4 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], f3 ResultRawFunc[T3, T4]) *Result[T4]
func ResultFlatMapRawCascade4 ¶
func ResultFlatMapRawCascade4[T1, T2, T3, T4, T5 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], f3 ResultRawFunc[T3, T4], f4 ResultRawFunc[T4, T5]) *Result[T5]
func ResultFlatMapRawCascade5 ¶
func ResultFlatMapRawCascade5[T1, T2, T3, T4, T5, T6 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], f3 ResultRawFunc[T3, T4], f4 ResultRawFunc[T4, T5], f5 ResultRawFunc[T5, T6]) *Result[T6]
func ResultFlatMapRawCascade6 ¶
func ResultFlatMapRawCascade6[T1, T2, T3, T4, T5, T6, T7 any](r *Result[T1], f1 ResultRawFunc[T1, T2], f2 ResultRawFunc[T2, T3], f3 ResultRawFunc[T3, T4], f4 ResultRawFunc[T4, T5], f5 ResultRawFunc[T5, T6], f6 ResultRawFunc[T6, T7]) *Result[T7]
type ResultRawFunc ¶
type Variant2 ¶
type Variant2[T0, T1 any] struct { // contains filtered or unexported fields }
func NewVariant2A ¶
func NewVariant2B ¶
type Variant3 ¶
type Variant3[T0, T1, T2 any] struct { // contains filtered or unexported fields }
func NewVariant3A ¶
func NewVariant3B ¶
func NewVariant3C ¶
Source Files
¶
Click to show internal directories.
Click to hide internal directories.