Collection Code Prefix Uniqueness Checker
Audit exact and leading-prefix collection-code ambiguities under explicit case policy; prefix comparisons are bounded to 1000 records, not authority registry validation.
Description
Collection prefixes can be ambiguous even without exact duplication when one is a leading substring of another.
Collection prefixes can be ambiguous even without exact duplication when one is a leading substring of another. An explicit case policy controls whether letter-case differences distinguish codes.1
Audit exact and leading-prefix collection-code ambiguities under explicit case policy; prefix comparisons are bounded to 1000 records, not authority registry validation.
When to use Collection Code Prefix Uniqueness Checker
Use this tool to audit exact and leading-prefix collection-code ambiguities under explicit case policy; prefix comparisons are bounded to 1000 records, not authority registry validation.
Prepare the inventory, measurements or policy dates for the collection and reporting period. Confirm units, record order and any independently established thresholds or permissions.
How to use Collection Code Prefix Uniqueness Checker and understand its results
- Prepare the inventory, measurements or policy dates for the collection and reporting period. Confirm units, record order and any independently established thresholds or permissions.
- Enter collectionPrefixes, caseSensitivePrefixes using the field table and calculation rules, then run the tool.
- Read exactDuplicatePrefixCount, ambiguousLeadingPrefixPairs, prefixSetUnambiguous. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| collectionPrefixes | Collection prefixes | string | Required |
| caseSensitivePrefixes | Case sensitive prefixes | boolean | Required |
Paste 1–1,000 nonempty trimmed newline-separated prefixes, each an ASCII letter followed by at most 31 letters, digits, underscores or hyphens. Use exact case or uppercase normalization according to the option. Count exact duplicate pairs and all leading-prefix ambiguous pairs, including duplicates; emit zero-based i:j lines and an unambiguous flag. More than 100,000 ambiguity pairs is rejected.
ambiguous(i,j) = prefix_i startsWith prefix_j OR prefix_j startsWith prefix_i Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| exactDuplicatePrefixCount | Exact duplicate prefix count | number |
| ambiguousLeadingPrefixPairs | Ambiguous leading prefix pairs | string |
| prefixSetUnambiguous | Prefix set unambiguous | boolean |
{
"input": {
"collectionPrefixes": "ABC\nAB\nXYZ",
"caseSensitivePrefixes": false
},
"output": {
"exactDuplicatePrefixCount": 0,
"ambiguousLeadingPrefixPairs": "0:1",
"prefixSetUnambiguous": false
}
}Limitations and assumptions
Duplicate count is a count of pairs, not distinct repeated codes. No authority registry or reservation service is checked. Prefix ambiguity depends on the supplied matching convention.
Numeric inputs must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Extremely large text inputs are rejected. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors. A successfully returned false flag is an evaluated outcome; its meaning is explained above.
Alternative or Complementary methods
Use Accession Number Year Sequence Validator: Validate strict ASCII YYYY-sequence and caller year without conflating year.lot.item or correcting leading zeros; validation does not reserve identity. For a complementary task, use Offsite Storage Transport Manifest Box Count Reconciler: Reconcile stable expected/arrived box identities including duplicates, not mere equal counts or inferred transport chain of custody.
References
Similar or alternative tools
- Accession Number Year Sequence Validator
Validate strict ASCII YYYY-sequence and caller year without conflating year.lot.item or correcting leading zeros; validation does not reserve identity.
- Offsite Storage Transport Manifest Box Count Reconciler
Reconcile stable expected/arrived box identities including duplicates, not mere equal counts or inferred transport chain of custody.