Unix Dot Entry Classifier
Classify exact Unix dot entries separately from dot-prefixed names; no filesystem lookup or hidden-attribute guarantee.
Description
Classify exact Unix dot entries separately from dot-prefixed names; no filesystem lookup or hidden-attribute guarantee.
Unix dot entries have exact special spellings distinct from other dot-prefixed names.
When to use this tool
Classify exact Unix dot entries separately from dot-prefixed names; no filesystem lookup or hidden-attribute guarantee.
- Prepare the supplied name 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. 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.classification. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Return current-directory-entry for exactly dot, parent-directory-entry for exactly dot-dot, other-dot-prefixed-name for other names beginning with dot and other-name otherwise.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| name | name. | 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.classification | The classification value under the stated formula or text convention. |
{
"input": {
"name": ".hidden"
},
"output": {
"result": {
"classification": "other-dot-prefixed-name"
}
}
}Limitations and assumptions
- This is a text classifier, without filename validation or filesystem access. A dot prefix alone is not evidence of a platform's hidden-file attribute.
- 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
- Leading Dot Filename Extension Split
Split the final filename extension while preserving a leading-dot-only name as extensionless; a trailing dot gives an empty extension.
- Filename Casefold Collision Table
Audit the bounded ASCII case-insensitive filename branch; rejects non-ASCII rather than pretend lowercasing implements full Unicode case folding.