Re:Zero-allocation Trie Traversal
by cheez on Sunday November 13, 2016 @12:20PM
(#12944367)
What did I miss? He adds fields onto each node to help with traversal.
[ Parent
| on HN ]
You missed the last paragraph, I think:
> For a production implementation it may be worth packing i into the flags field since it only needs a few bits, even with larger alphabets. Also, I bet, as in Deutsch-Schorr-Waite, the p field could be eliminated and instead one of the child pointers is temporarily reversed. With these changes, this technique would fit into the original struct trie without changes, eliminating the extra memory usage.