diff options
| -rw-r--r-- | src/slices/slices.go | 4 | ||||
| -rw-r--r-- | src/slices/sort.go | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/src/slices/slices.go b/src/slices/slices.go index c8eacae90e..653d4dd093 100644 --- a/src/slices/slices.go +++ b/src/slices/slices.go @@ -68,7 +68,7 @@ func Compare[S ~[]E, E cmp.Ordered](s1, s2 S) int { return 0 } -// CompareFunc is like Compare but uses a custom comparison function on each +// CompareFunc is like [Compare] but uses a custom comparison function on each // pair of elements. // The result is the first non-zero result of cmp; if cmp always // returns 0 the result is 0 if len(s1) == len(s2), -1 if len(s1) < len(s2), @@ -368,7 +368,7 @@ func Compact[S ~[]E, E comparable](s S) S { return s[:i] } -// CompactFunc is like Compact but uses a comparison function. +// CompactFunc is like [Compact] but uses a comparison function. func CompactFunc[S ~[]E, E any](s S, eq func(E, E) bool) S { if len(s) < 2 { return s diff --git a/src/slices/sort.go b/src/slices/sort.go index af1d51ecd4..a634c12f6f 100644 --- a/src/slices/sort.go +++ b/src/slices/sort.go @@ -138,7 +138,7 @@ func BinarySearch[S ~[]E, E cmp.Ordered](x S, target E) (int, bool) { return i, i < n && (x[i] == target || (isNaN(x[i]) && isNaN(target))) } -// BinarySearchFunc works like BinarySearch, but uses a custom comparison +// BinarySearchFunc works like [BinarySearch], but uses a custom comparison // function. The slice must be sorted in increasing order, where "increasing" // is defined by cmp. cmp should return 0 if the slice element matches // the target, a negative number if the slice element precedes the target, |