diff options
Diffstat (limited to 'src/sort/slice.go')
| -rw-r--r-- | src/sort/slice.go | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/sort/slice.go b/src/sort/slice.go index 73ba548a47..bc9dd84ed2 100644 --- a/src/sort/slice.go +++ b/src/sort/slice.go @@ -14,12 +14,12 @@ import ( // // The sort is not guaranteed to be stable: equal elements // may be reversed from their original order. -// For a stable sort, use SliceStable. +// For a stable sort, use [SliceStable]. // // The less function must satisfy the same requirements as // the Interface type's Less method. // -// Note: in many situations, the newer slices.SortFunc function is more +// Note: in many situations, the newer [slices.SortFunc] function is more // ergonomic and runs faster. func Slice(x any, less func(i, j int) bool) { rv := reflectlite.ValueOf(x) @@ -36,7 +36,7 @@ func Slice(x any, less func(i, j int) bool) { // The less function must satisfy the same requirements as // the Interface type's Less method. // -// Note: in many situations, the newer slices.SortStableFunc function is more +// Note: in many situations, the newer [slices.SortStableFunc] function is more // ergonomic and runs faster. func SliceStable(x any, less func(i, j int) bool) { rv := reflectlite.ValueOf(x) @@ -47,7 +47,7 @@ func SliceStable(x any, less func(i, j int) bool) { // SliceIsSorted reports whether the slice x is sorted according to the provided less function. // It panics if x is not a slice. // -// Note: in many situations, the newer slices.IsSortedFunc function is more +// Note: in many situations, the newer [slices.IsSortedFunc] function is more // ergonomic and runs faster. func SliceIsSorted(x any, less func(i, j int) bool) bool { rv := reflectlite.ValueOf(x) |