Chris Wellons personal blog
Zero-allocation Trie Traversal
As part of a demonstration in an upcoming article , I wrote a simple trie implementation. A trie is a search tree where the keys are a sequence of symbols (i.e. strings). Strings with a common prefix share an initial path down the trie, and the keys themselves are stored implicitly by the structure of the trie. It’s…
- Points
- 112
- HN comments
- 12
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2016
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 13, 2016 | Zero-allocation Trie Traversal by ingve | 112 | 12 |
