Logarithmic counting #17
Open
Conversation
This file contains 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
tobia
force-pushed
the
logarithmic-counting
branch
from
d54ab99
to
2a44a85
Compare
tobia
force-pushed
the
logarithmic-counting
branch
from
2a44a85
to
343545a
Compare
|
Wow, this is great idea! |
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.
Here's an efficient counting macro I came up with while reading the chapter on Counting.
It can count a practically unlimited number of tokens with Rust's default recursion limit, it's faster than Slice length, and it produces a constant number.
I
assert_eq'ed it on all numbers from 0 to 50, just to be on the safe side.Enjoy!