Filename Literal Affix Renamer
Plan literal filename affix replacement in a defined prefix-then-suffix order; no glob/regex or filesystem rename occurs.
Description
Plan literal filename affix replacement in a defined prefix-then-suffix order; no glob/regex or filesystem rename occurs.
Literal affix replacement can change a filename without interpreting a pattern or extension grammar.
When to use this tool
Plan literal filename affix replacement in a defined prefix-then-suffix order; no glob/regex or filesystem rename occurs.
- Prepare the supplied name, removePrefix, removeSuffix, addPrefix, addSuffix 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 name, removePrefix, removeSuffix, addPrefix, addSuffix. 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.name. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate name, remove a matching nonempty prefix, then a matching nonempty suffix from the remaining text, add the requested affixes and validate the final filename.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| name | name. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| removePrefix | remove prefix. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| removeSuffix | remove suffix. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| addPrefix | add prefix. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| addSuffix | add suffix. | 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.name | The name value under the stated formula or text convention. |
{
"input": {
"name": "old-a.txt",
"removePrefix": "old-",
"removeSuffix": ".txt",
"addPrefix": "new-",
"addSuffix": ".md"
},
"output": {
"result": {
"name": "new-a.md"
}
}
}Limitations and assumptions
- Missing affixes are left alone and comparisons are case-sensitive. No regex, actual rename or filesystem conflict check occurs.
- 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.
- String lists have at most 128 entries of at most 128 code units; matrices have at most 128 rows and columns. Larger numeric lists and parsed JSON have separate bounded budgets. 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 filesystem-aware implementation with appropriate platform semantics for actual file operations. Literal slash components, Unicode comparison and filename plans do not resolve symlinks or atomically reserve a destination.
References
Similar or alternative tools
- Filename Casefold Collision Table
Audit the bounded ASCII case-insensitive filename branch; rejects non-ASCII rather than pretend lowercasing implements full Unicode case folding.
- Filename Collision Plan
Plan exact-case filename collisions using numbered suffixes before the final extension, reserving all requested names; no files are touched.