Add allocation_binary_trees benchmark#118
Open
danvinci wants to merge 16 commits into
Open
Conversation
danvinci
force-pushed
the
bench-binary-trees
branch
from
071bfae to
d8c0c84
Compare
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
1 participant
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.
Adds
allocation_binary_treesacross all 14 languages.Per timed window: build a complete depth-14 tree (16,383 nodes), traverse for a node-count checksum, discard; repeat 25 times. NITER=5, minimum reported. Single-threaded conventions match PR #112.
Cross-language assertion:
bt_sum == 25 * (2^14 - 1) * NITER.Test plan
lang,allocation_binary_trees,time_mslocally on macOS arm64Drafted with assistance from Claude Opus 4.7.