-
Notifications
You must be signed in to change notification settings - Fork 43
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.
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
Perfect hashing? #348
Comments
I have no real idea how/what gperf really does :/
I guess we could benefit from gperf for that 2nd part, but the benefit will not be much (vs the added gperf opacity/complexity when debugging): in my experience debugging and timing things, the time spent parsing a 30K or 500K OPS/publisher.css is really peanuts compared to the time spent checking/applying it to all the nodes of a book (even if parsing a 500K css takes 2 seconds, checking/applying the thousand rules can take minutes). So, I don't think the benefit will really be noticable. |
Just a random drive-by so that I don't forget about it ;).
Inspired by ArtifexSoftware/mupdf@6bbfe28 in MµPDF, I'm wondering if we couldn't also make use of something similar in a few places to speed things up.
I vaguely remember you switched some similar stuff to a binary search recently, @poire-z ?
The text was updated successfully, but these errors were encountered: