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.

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

Replaced template name collision detection algorithm with a hash table #1

Closed
wants to merge 2 commits into from
Closed

Replaced template name collision detection algorithm with a hash table #1

wants to merge 2 commits into from

Conversation

cceelen
Copy link

@cceelen cceelen commented Aug 20, 2015

Replaced template name collision detection algorithm with a hash table look up. For big XSLTs (10000+ templates) this results in a huge improvement of the compilation time (~factor 20).

I tried to follow the style and use sensible locations for the new code. Please let me know if i got something wrong.

Christian Ceelen added 2 commits August 20, 2015 18:57
…e look up. For big XSLTs (>50000 templates) this results in a huge improvement of the compilation time.
…ddTemplate and store now the xsltTemplatePtr inside instead of the previous xmlNodePtr. xsltFindTemplate is now using this hash table for template look up instead of linear search.
gnomesysadmins pushed a commit that referenced this pull request Sep 14, 2015
For big XSLTs (>50000 templates) this results in a huge improvement of the
compilation time.

Thanks to Christian Ceelen for the original patch.

Fixes GitHub pull request #1
@cceelen cceelen closed this Sep 16, 2015
aasselin-en added a commit to euronext/libxslt that referenced this pull request Mar 13, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
1 participant