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

consider perfect hashing for big static data tables #4

Open
kwantam opened this issue Jul 15, 2015 · 1 comment
Open

consider perfect hashing for big static data tables #4

kwantam opened this issue Jul 15, 2015 · 1 comment
Labels
enhancement

Comments

@kwantam
Copy link
Member

kwantam commented Jul 15, 2015

Given some implementation of perfect hashing, what is its break-even point versus binary searching in Unicode tables? Consider switching tables larger than this break-even point to perfect hashing for enhanced Unicode processing speed.
@mabbamOG
Copy link

I also have experienced a reduction in performance (factor x2)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@kwantam @mabbamOG