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
dask.array indexing bug with slicing with small chunk size on large arrays #452
Comments
That is indeed odd. Checking it out now |
Perhaps more telling In [1]: import dask.array as da
In [2]: import numpy as np
In [3]: x = da.from_array(np.arange(10000), chunks=1)[8000:9000][4]
In [4]: x.compute()
Out[4]: array(8196)
In [5]: from dask.optimize import cull
In [6]: cull(x.dask, x._keys())
Out[6]:
{'from-array-1': array([ 0, 1, 2, ..., 9997, 9998, 9999]),
('from-array-1', 8196): (<function dask.array.core.getarray>,
'from-array-1',
(slice(8196, 8197, None),)),
('x_1', 4): (<function operator.getitem>,
('from-array-1', 8196),
(slice(None, None, None),)),
('x_2',): (<function operator.getitem>, ('x_1', 4), (0,))} |
shoyer
changed the title
dask.array indexing bug with slicing followed by point selection
dask.array indexing bug with slicing with small chunk size on large arrays
Jul 21, 2015
Secondary indexing is not even necessary:
|
Whoa, that's bizarre |
I think I've tracked this down to how dicts order keys. We weren't calling |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The text was updated successfully, but these errors were encountered: