Array operations optimization #8
Merged
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
jprichardson
added a commit
that referenced
this pull request
Jul 24, 2014
Array operations optimization
|
Looks good, thanks! |
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.
As demonstrated by http://jsperf.com/base58-array-ops, and even a basic understanding should make it clear, using
unshiftis much slower than usingpushinArrayoperations as eachunshiftis an O(n) operation.This change just reverses the operation order on the array so as
pushbecomes possible, with a single O(n) reversal done at the end of the function.On Chrome, this gives a slight (~10-15%) improvement, but on Firefox 30 it gives up to a 50% improvement in ops/sec.