Index the QPACK static table by name - #10
Merged
Merged
Conversation
Motivation: StaticHeaderTable.find does a linear scan of all 99 static table entries. It's called once per header by both the static and dynamic encoders. The scan relies on string comparisons for (potentially) every header name in the table which is where a lot of the cost lies. Modifications: - Add a static field name to index map. This is used by `find` to get all indexes for a given header in constant time. - Add benchmarks Result: Faster header encoding - static encoding benchmark: 2.8x faster - dynamic encoding benchmark: 1.3x faster
Contributor
Author
josephnoir
approved these changes
Jul 9, 2026
Co-authored-by: Raphael Hiesgen <github@hiesgen.dev>
glbrntt
enabled auto-merge (squash)
July 10, 2026 07:26
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Motivation:
StaticHeaderTable.find does a linear scan of all 99 static table
entries. It's called once per header by both the static and dynamic
encoders. The scan relies on string comparisons for (potentially) every
header name in the table which is where a lot of the cost lies.
Modifications:
findto getall indexes for a given header in constant time.
Result:
Faster header encoding