Lexicographic Tuple Order Check
Check finite numeric tuples in lexicographic order, with shorter matching prefixes before longer tuples and explicit adjacent failure witnesses.
Description
Check finite numeric tuples in lexicographic order, with shorter matching prefixes before longer tuples and explicit adjacent failure witnesses.
Lexicographic tuple order compares the first unequal component and then length when one tuple is a prefix.
When to use this tool
Check finite numeric tuples in lexicographic order, with shorter matching prefixes before longer tuples and explicit adjacent failure witnesses.
- Prepare the supplied tuples fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter tuples. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.sorted, result.violation. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Scan neighboring tuples using numeric lexicographic comparison. Return sorted plus the first reversed adjacent index pair, or null when no violation exists.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| tuples | tuples. | Numeric rows; at most 128 rows and 128 values per row |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.sorted | Flag for sorted under the exact condition described above. |
| result.violation | The violation list in the ordering and representation described above. |
{
"input": {
"tuples": [
[
1,
2
],
[
1,
1
],
[
2
]
]
},
"output": {
"result": {
"sorted": false,
"violation": [
0,
1
]
}
}
}Limitations and assumptions
- Tuples may have different lengths. No locale sorting, custom directions or tolerance is applied.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Choose the tie policy and whether you need values, original indexes, sorted positions or one-based ranks. Use a complete sort verifier when a local stability or adjacent-comparison check is insufficient.
References
Similar or alternative tools
- Multi Key Order Witness
Compare two numeric multi-key tuples with per-key ascending/descending directions, exposing the first decisive key rather than coercing ties.
- Rank Order Agreement Pairs
Classify numeric rank-order pair agreement and disagreement while retaining all pairs tied in either observation; not a normalized correlation coefficient.