maartenbreddels commented on pull request #7449:

   @pitrou  your size commit made the benchmark go from `52->60 M/s` 👍 
   > Yes, too. The main point of this state-machine-based decoder is that it's 
branchless, and so it will perform roughly as well on non-Ascii data with 
unpredictable branching. On pure Ascii data, a branch-based decoder may be 
faster since the branches will always be predicted right.
   Yes, it would be interesting to see how the two methods deals with a 
25/25/25/25% mix of 1-2-3 or 4 byte encoded codepoints, vs say a few % 

This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:

Reply via email to