Empty proves absence.
A never-used empty slot ends the search. A key previously inserted on this path would not have passed it.
Choose the operations
Loading an example replaces the draft and restarts its trace.
Inspect the table
Step 0Never-used emptyOccupiedDeletedCurrent slot
Start with an empty table
This operation’s probes so far
Deleted means keep looking.
A tombstone holds no key, but preserves a path to keys stored farther along. It can be a later insertion candidate.
Check before you reuse.
Insertion remembers the first tombstone, then proves absence. An existing equal key leaves the table unchanged.
See every operation result
Each arrow is one inspected slot, including empty and deleted slots. Results describe the applied operations, even while editor changes are unapplied.
| Operation | Home | Probe order | Result |
|---|
This is a readable result record, not a saved lesson or a file the explorer imports.
Connect the ideas
Study the twelve-question lesson
Download the original deck, open RecallWeave, choose the JSON under Bring your own lesson, inspect its preview and select Start this deck. Your answers, review, practice and study notes use the existing learner.
Sources and permission
Primary references: NIST: hash table and Open Data Structures §5.2. Examples, questions and diagrams here are original.
This small model uses a simple remainder hash and deliberately keeps its capacity fixed. It displays exact work for a chosen history; it does not establish average performance, security or learning efficacy.