Implement Stream-Safe Text Process and QuickCheck algorithms #22
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.
This change implements a few new Unicode algorithms: the Stream-Safe Text Process, which bounds decomposition buffers in the face of long runs of non-starter characters, and the QuickCheck algorithms, which allow checking whether a string is normalized efficiently.
First, it refactors the table generation script to simplify the tables. Instead of emitting binary search tables, we just present the compiler a large switch statement, which it's happy to optimize. This change improves performance (see numbers below) and keeps the code simple.
Then, implementing both the algorithms is straightforward per the spec. I've also simplified the decomposition code to remove its custom sorting implementation and only sort each character once.
Before:
After: