-
Notifications
You must be signed in to change notification settings - Fork 11
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
Add appendix B which contains an example of the extension algorithm execution. #237
base: main
Are you sure you want to change the base?
Conversation
Note entry intersection is specifically being done to the updated font.
|
||
* Step 8 - the fetch for //foo.bar/01.gk was previously started during iteration 1. | ||
|
||
* Step 9 - The fetched patch //foo.bar/01.gk is applied to the current font subset. This patch adds glyph data for code points 'a' through 'z' |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think it's 'a' through 'm'.
|
||
* Step 8 - the fetch for //foo.bar/04.gk was previously started during iteration 1. | ||
|
||
* Step 9 - The fetched patch //foo.bar/04.gk is applied to the current font subset. This patch adds glyph data for code points 'A' through 'Z' |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
'N' through 'Z' here
|
||
<b>Optimized Extension Example</b> | ||
|
||
Note: this example execution is described as it would be implemented in an optimized client which aims to reduce the number of round trips needing to be |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think one aspect of this description needs updating in light of #238 (as expected) and the second isn't accurate relative to the example. This is will now be following the selection criteria rather than "making choices". And I don't think it's doing any speculative loading -- it's choosing 3 as it should. Or maybe that's what was meant.
I think going forward we can talk about the algorithm now that it's nailed down, and occasionally talk about speculative loading. For the latter I want to get away from the term "preload" because we're using that for adding patches to a file on the server side.
The example shows howed a mixed (table + glyph keyed) IFT font would typically be processed by a client.
For #216
Preview | Diff