Bugfix and optimization for 1D Array/ArrayView#1884
Open
kennyweiss wants to merge 8 commits into
Open
Conversation
Setting it to compile time 1 (in ArrayBase) avoids the cost in ArrayBase::operator[]. Note that ArrayView can still have non-unit strides.
kennyweiss
requested review from
Arlie-Capps,
BradWhitlock,
bmhan12,
jcs15c,
nselliott,
publixsubfan,
rhornung67 and
white238
kennyweiss
added
bug
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.
Summary
ArrayViewcopy/assign operator where the stride was not copiedaxom::Arrray<T,1>. Since this always has a unit stride, we should compile away the stride multiplication.Array<double>::address_bracket/1024: develop ~385 ns → branch ~283 ns (~26% faster)Array<double>::address_flatIndex/1024: develop ~344 ns → branch ~283 ns (~18% faster)axom::Arrayusers