Palindromic Suffix Lengths
Bounded UTF-16 string palindromic suffix lengths; exact code-unit matching, no Unicode normalization or grapheme inference.
Description
Bounded UTF-16 string palindromic suffix lengths; exact code-unit matching, no Unicode normalization or grapheme inference.
Palindromic suffixes are ending substrings that read the same backward. Their lengths describe different suffix choices.
When to use this tool
Bounded UTF-16 string palindromic suffix lengths; exact code-unit matching, no Unicode normalization or grapheme inference.
- Prepare the supplied text 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 text. 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.lengths. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
For each length from one through text length, compare that suffix with its UTF-16 code-unit reversal and return successful lengths in ascending order.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| text | text. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.lengths | The lengths list in the ordering and representation described above. |
{
"input": {
"text": "caba"
},
"output": {
"result": {
"lengths": [
1,
3
]
}
}
}Limitations and assumptions
- The empty suffix is excluded. Text is bounded to 128 code units and comparisons are case-sensitive without normalization.
- The string-analysis source text is bounded to 128 UTF-16 code units; offsets and lengths use those code units.
- 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
Use a code-point or grapheme-aware text method when the task concerns user-perceived characters. These bounded literal operations retain case and code-unit structure rather than normalizing linguistic text.
References
Similar or alternative tools
- Palindromic Prefix Lengths
Bounded UTF-16 string palindromic prefix lengths; exact code-unit matching, no Unicode normalization or grapheme inference.
- Adjacent Transposition Witness
Find exact one-adjacent-transposition witnesses between bounded UTF-16 strings; swapping equal adjacent units is excluded as no change.