Build four independent representations for one incident platform. Freeze the incident-code dictionary before BASE/CHECK placement. Keep shipment IDs inside a fixed hash neighborhood, reporting a failed add without losing existing IDs. Compare two unsigned-ID replica sets with a signed invertible table and publish a diff only after complete peeling. Build a k-mer overlap graph from route fragments and stop each unitig at a branch. The acceptance contract differs across these structures: exact static lookup, bounded-locality set mutation, probabilistic recovery with explicit failure, and graph compaction that preserves alternatives.
Make this comfortable
Project: audit static prefixes, neighborhood placement, replica differences, and unitigs
Acceptance trace
Store dock47 and dock83, then verify dock is a prefix but not a member. Insert colliding shipment IDs into a 31-slot table with width five; rejected placement must leave membership unchanged. Reconcile {19,29,47,61} against {19,47,83} and require left-only {29,61} plus right-only {83}. Feed seven three-character route fragments into the graph and compare the multiset of k-mers extracted from returned unitigs with the deduplicated input edges. Keep the original sets and code dictionary as independent oracles, rather than trusting a structure's own reported count.
Failure and cost review
Generate absent code prefixes and confirm CHECK rejects cross-parent slots. After every hash insertion or deletion, verify that each resident is within its own circular neighborhood; exercise a full table and an empty slot too distant to use. Force an overloaded reconciliation table and demand an explicit undecodable result. Include isolated directed cycles, branch vertices, and duplicate k-mers in graph cases. Record lookup length, relocation work, peel scans, and long unitig string copying separately. None of these models provides concurrent mutation or durable storage; rebuilding the frozen indexes and checking replica parameters belong to the surrounding service.
Common Mistakes
- Do not equate a reachable trie prefix with a stored terminal code.
- Do not place a hash resident outside its home window to force success.
- Do not publish a partial replica peel as an exact difference.
- Do not compact a k-mer path across a graph branch.
Connected lessons
data structures
projects