You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A method idx.asflat(shape) would return an index j such that a[idx].flatten() == a.flatten()[j].
More generally, we could have a method that reindexes into a reshaped array.
One thing I'm not sure about is how generally this can work. How generally is a flattened index of a simple index still a simple index (i.e., we would not require IntegerIndex, which is not yet implemented)?
The text was updated successfully, but these errors were encountered:
There are certainly cases where it isn't. For example, if a tuple of slices has some slices with negative steps and others with positive step, then the flattened index would be reshuffled in a way that can't be indexed by a single slice. For example
A method idx.asflat(shape) would return an index
j
such thata[idx].flatten() == a.flatten()[j]
.More generally, we could have a method that reindexes into a reshaped array.
One thing I'm not sure about is how generally this can work. How generally is a flattened index of a simple index still a simple index (i.e., we would not require IntegerIndex, which is not yet implemented)?
The text was updated successfully, but these errors were encountered: