[Numpy-discussion] Compressed index sets, generators and iterators

[Bill B. <wb...@gm...>]

Has any thought been given to using compressed or functional representations
of index sets?

For instance there could be a where-like function that returns an object
that can generate a set of indexes on the fly, rather than explicitly
allocating arrays and enumerating all of the indices.

What's the reason iterators are not supported currently?
For instance  A[range(0,4)] works for a 1d A, but A[xrange(0,4)] does not.
Are iterators just too inefficient to bother with?

I could imagine an iterator that generates a set of N-tuples for an N-d
array being a legal indexing construct.  Even something like
A[idx_iterator] = value_iterator  would seem to make sense.

--bb