rax
rax copied to clipboard
HAT-Trie
trafficstars
"Edges are stored as arrays of bytes directly in the parent node, no need to access non useful children while trying to find a match." Is this the same as a HAT-trie?