Skip to content
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

allocate iteration structures lazily (pt. 2) #15011

Merged
merged 1 commit into from
Mar 14, 2017
Merged

Conversation

stefanpenner
Copy link
Member

No description provided.

@stefanpenner stefanpenner requested a review from krisselden March 14, 2017 07:34
@stefanpenner stefanpenner merged commit 05ea1a5 into master Mar 14, 2017
@stefanpenner stefanpenner deleted the alloc-lazy branch March 14, 2017 08:02
@stefanpenner
Copy link
Member Author

stefanpenner commented Apr 4, 2017

running first test, please wait...
  newer (empty) ........... 58,974,514.36 op/s <--- on multiple runs new and newer appear to be neck & neck
  new (empty) ............. 59,456,605.66 op/s
  old (empty) ............. 14,503,708.66 op/s

  newer (notEmpty) ......... 2,358,686.27 op/s
  new (notEmpty) ........... 2,607,808.42 op/s
  old (notEmpty) ........... 2,547,490.09 op/s

  newer (notEmpty miss) ... 12,846,094.84 op/s <--- this one is improved here
  new (notEmpty miss) ...... 7,415,061.28 op/s
  old (notEmpty miss) ...... 6,886,484.49 op/s

This improves the notEmpty but miss scenario by nearly 2x.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant