total ordering
C39971
concept
A total ordering is a binary relation on a set in which every pair of elements is comparable, and the relation is transitive, antisymmetric, and total.
Observed surface forms (2)
| Surface form | Occurrences |
|---|---|
| System.Collections.IComparer implementation | 1 |
| total order | 1 |
Instances (3)
| Instance | Via concept surface |
|---|---|
| Knuth–Bendix order | — |
| CaseInsensitiveComparer | System.Collections.IComparer implementation |
| Sharkovsky ordering | total order |