From 26fe793891cf96597ff5fe6f0a2633dbc2019aac Mon Sep 17 00:00:00 2001 From: John Giorshev Date: Sun, 22 Jun 2025 23:09:02 -0400 Subject: [PATCH] sort: clarify doc on less --- src/sort/sort.go | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/src/sort/sort.go b/src/sort/sort.go index b27ecabdd5..f1d7ee647a 100644 --- a/src/sort/sort.go +++ b/src/sort/sort.go @@ -26,13 +26,15 @@ type Interface interface { // Sort may place equal elements in any order in the final result, // while Stable preserves the original input order of equal elements. // - // Less must describe a transitive ordering: + // Less must satisfy [Strict Weak Ordering]. For example: // - if both Less(i, j) and Less(j, k) are true, then Less(i, k) must be true as well. // - if both Less(i, j) and Less(j, k) are false, then Less(i, k) must be false as well. // // Note that floating-point comparison (the < operator on float32 or float64 values) - // is not a transitive ordering when not-a-number (NaN) values are involved. + // is not a strict weak ordering when not-a-number (NaN) values are involved. // See Float64Slice.Less for a correct implementation for floating-point values. + // + // [Strict Weak Ordering]: https://en.wikipedia.org/wiki/Weak_ordering#Strict_weak_orderings Less(i, j int) bool // Swap swaps the elements with indexes i and j.