Compressed index sets, generators and iterators

Bill Baxter wbaxter at
Wed Nov 1 19:44:38 CST 2006

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.

-------------- next part --------------
An HTML attachment was scrubbed...
-------------- next part --------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
-------------- next part --------------
Numpy-discussion mailing list
Numpy-discussion at

More information about the Numpy-discussion mailing list