Previous Lexicographic Permutation
Return the previous lexicographic index permutation without wraparound; null marks the boundary of the permutation order.
Description
Return the previous lexicographic index permutation without wraparound; null marks the boundary of the permutation order.
A permutation predecessor moves to the previous ordering of the same indexes under lexicographic order.
When to use this tool
Return the previous lexicographic index permutation without wraparound; null marks the boundary of the permutation order.
- 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.permutation. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate the permutation, compute its exact Lehmer-factorial rank, subtract one and unrank when in range; otherwise return null.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.permutation | The permutation list in the ordering and representation described above. |
{
"input": {
"permutation": [
1,
0,
2
]
},
"output": {
"result": {
"permutation": [
0,
2,
1
]
}
}
}Limitations and assumptions
- There is no wraparound before the identity ordering. Values must be a permutation of 0 through length minus one.
- Except in the diagnostic validator, a permutation must contain each integer from zero through length minus one exactly once. Lists contain at most 128 entries.
- 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
Keep the index-to-image convention and composition direction explicit. A rank, cycle table, reorder-index list and inverse map encode different operations even when their entries are all integers.
References
Similar or alternative tools
- Permutation Lexicographic Rank
Return a zero-based exact lexicographic permutation rank as decimal integer text; no floating factorial approximation.
- Permutation Lexicographic Unrank
Unrank a zero-based lexicographic index permutation from exact integer text and an explicit bounded size.