String Cyclic Rotation Offsets
Return all cyclic left-rotation offsets mapping one UTF-16 string to another; all tied witnesses are retained, including periodic strings.
Description
Return all cyclic left-rotation offsets mapping one UTF-16 string to another; all tied witnesses are retained, including periodic strings.
Matching cyclic offsets can be nonunique when a source repeats. Returning every offset avoids choosing an arbitrary alignment.
When to use this tool
Return all cyclic left-rotation offsets mapping one UTF-16 string to another; all tied witnesses are retained, including periodic strings.
- Prepare the supplied left, right 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 left, right. 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.offsets. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Generate each left rotation of left and return offsets where it equals right exactly.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| left | left. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| right | right. | 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.offsets | The offsets list in the ordering and representation described above. |
{
"input": {
"left": "abab",
"right": "baba"
},
"output": {
"result": {
"offsets": [
1,
3
]
}
}
}Limitations and assumptions
- Offsets count UTF-16 code units. Different lengths cannot match; empty-to-empty produces [0] under the single-empty-rotation convention.
- 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
- Distinct String Rotation Count
Bounded UTF-16 string distinct string rotation count; exact code-unit matching, no Unicode normalization or grapheme inference.
- Cyclic String Equivalence Check
Check exact cyclic UTF-16 string equivalence without normalization; empty strings are equivalent to each other.