Single Pair Delimiter Repair Hints
Provide literal single-pair delimiter insertion hints with unmatched offsets; quotes, escapes and cross-type nesting are outside scope.
Description
Provide literal single-pair delimiter insertion hints with unmatched offsets; quotes, escapes and cross-type nesting are outside scope.
A delimiter balance check can identify unmatched characters for one chosen opener/closer pair. The counts give the minimum insertions needed under that simple pairing model.
When to use this tool
Provide literal single-pair delimiter insertion hints with unmatched offsets; quotes, escapes and cross-type nesting are outside scope.
- Prepare the supplied text, opener, closer 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, opener, closer. 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.unmatchedOpenOffsets, result.unmatchedCloseOffsets, result.minimumInsertions. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require distinct single-UTF-16-unit delimiters. Push opener offsets, pop one for a matching closer when possible, and record unmatched closers otherwise. Return remaining opener offsets and the sum of both unmatched counts.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| text | text. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| opener | opener. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| closer | closer. | 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.unmatchedOpenOffsets | The unmatched open offsets list in the ordering and representation described above. |
| result.unmatchedCloseOffsets | The unmatched close offsets list in the ordering and representation described above. |
| result.minimumInsertions | Total unmatched opener and closer count under the single delimiter-pair model. |
{
"input": {
"text": ")(()",
"opener": "(",
"closer": ")"
},
"output": {
"result": {
"unmatchedOpenOffsets": [
1
],
"unmatchedCloseOffsets": [
0
],
"minimumInsertions": 2
}
}
}Limitations and assumptions
- Quoted strings, escapes and other delimiter types have no special meaning. The tool reports insertion counts and offsets rather than a complete repaired text or language parse.
- Text offsets and lengths use UTF-16 code units unless explicitly described as bytes or code points. CRLF, CR and LF are recognized as line endings; a terminal newline creates a final empty line in the shared line model.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Ordinary string lists have at most 128 entries of at most 128 code units each; numeric lists and matrices have separate bounded size checks. Nonfinite results and excessively large serialized outputs are rejected.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Use a parser or language-aware editor when quoting, syntax or nested constructs matter. For plain text transforms, keep UTF-16 offsets, Unicode code points, grapheme clusters and UTF-8 byte offsets distinct; apply changes to the same source version used to calculate spans.
References
Similar or alternative tools
- Line Pair Zipper
Zip hard-line content positionally; missing lines are null, not empty strings or dropped rows.
- Single Pass Literal Template Renderer
Render a single pass of literal placeholders from an explicit unique name/value table; inserted placeholders are not recursively expanded.