1
1
Fork 0
mirror of https://github.com/NixOS/nix.git synced 2025-12-23 01:11:07 +01:00

docs: add explanation to sort primop

This commit is contained in:
Johannes Kirschbauer 2025-11-13 10:47:26 +07:00
parent f2253a00bc
commit af6326dfa4
No known key found for this signature in database

View file

@ -4014,6 +4014,8 @@ static RegisterPrimOp primop_sort({
1. Transitivity 1. Transitivity
If a is less than b and b is less than c, then it follows that a is less than c.
```nix ```nix
comparator a b && comparator b c -> comparator a c comparator a b && comparator b c -> comparator a c
``` ```
@ -4026,9 +4028,23 @@ static RegisterPrimOp primop_sort({
1. Transitivity of equivalence 1. Transitivity of equivalence
First, two values a and b are considered equivalent with respect to the comparator if:
```
!comparator a b && !comparator b a
```
In other words, neither is considered "less than" the other.
Transitivity of equivalence means:
If a is equivalent to b, and b is equivalent to c, then a must also be equivalent to c.
```nix ```nix
let equiv = a: b: (!comparator a b && !comparator b a); in let
equiv a b && equiv b c -> equiv a c equiv = x: y: (!comparator x y && !comparator y x);
in
equiv a b && equiv b c -> equiv a c
``` ```
If the *comparator* violates any of these properties, then `builtins.sort` If the *comparator* violates any of these properties, then `builtins.sort`