Rework how table keyed entries are ordered in the compiled patch map. - #251
Merged
Conversation
…size. This results in https://w3c.github.io/IFT/Overview.html#invalidating-patch-selection selecting the smaller patch when multiple patches are valid candidates.
This should reduce the number of entry id deltas encoded into the final patch map.
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
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.
Where possible order entries by the number of bytes the entry will load ascending. The invalidating patch selection algorithm breaks ties to the entry which appears earlier. So this ensures in the event of a tie the smaller total patch will be selected.