Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

HAT-Trie #33

Open
bitnom opened this issue Sep 7, 2020 · 0 comments
Open

HAT-Trie #33

bitnom opened this issue Sep 7, 2020 · 0 comments

Comments

@bitnom
Copy link

bitnom commented Sep 7, 2020

"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?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@bitnom