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

indexing into a 3D array has unexpected overhead #3712

Closed
samtkaplan opened this issue Jul 14, 2013 · 0 comments
Closed

indexing into a 3D array has unexpected overhead #3712

samtkaplan opened this issue Jul 14, 2013 · 0 comments

Comments

@samtkaplan
Copy link

accessing a 3D array using 3D indexing is ~3X slower than indexing into a 3D array using 1D (linear) indexing. Please refer to the mailing list discussion here:

https://groups.google.com/d/msg/julia-users/aYS_AvKqPCI/DyTiq4lKIAoJ

and the gist, here:

https://gist.github.com/samtkaplan/5991236

Please note that, in the gist, the 1D indices are explicitly computed from the 3D indices. That is, the overhead of converting 3D indices to 1D indices is included in the 1D indexing example.

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

No branches or pull requests

1 participant