Data structureresearch
Ctrie (concurrent hash-array mapped trie)
Also called concurrent trie.
Lock-free hash trie with cheap atomic snapshots, supporting linearizable lookups and insertions.
Lock-free hash trie with cheap atomic snapshots, supporting linearizable lookups and insertions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 3YJ33R Edit this page History Report an error