Rank Permutation Breakpoint Count
Count forward unit-adjacency breakpoints inside an explicit index permutation; endpoints are not padded with sentinel values.
Description
Count forward unit-adjacency breakpoints inside an explicit index permutation; endpoints are not padded with sentinel values.
An increasing consecutive run in a rank permutation breaks when the next value is not exactly one greater.
When to use this tool
Count forward unit-adjacency breakpoints inside an explicit index permutation; endpoints are not padded with sentinel values.
- Prepare the supplied permutation 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 permutation. 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.breakpoints. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate permutation and return each right-hand position j whose value differs from the preceding value plus one.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| permutation | permutation. | List of finite numbers; at most 128 entries |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.breakpoints | The breakpoints list in the ordering and representation described above. |
{
"input": {
"permutation": [
0,
2,
1,
3
]
},
"output": {
"result": {
"breakpoints": [
1,
2,
3
]
}
}
}Limitations and assumptions
- The tool reports positions, not just a count. It adds no artificial endpoints and does not use the absolute-difference breakpoint convention.
- 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
- Competition Rank Tie Table
Assign one-based ascending competition numeric ranks; exact numeric ties are preserved according to the stated policy.
- Dense Rank Tie Table
Assign one-based ascending dense numeric ranks; exact numeric ties are preserved according to the stated policy.