bluss

I recognize it's not super easy to implement a new iterator, since it's so much about ndarray implementation details. I think you would want do do something like InnerIter: have...

If I think of the chunks iterator and am not mistaken I think that We use sliced dimension and sliced stride to initialize Baseiter (One can slice in place using...

This code could also be read to understand how to use a slice / subview of an array as a “map” of array views. Imagine we have an array of...

The iteration `Item` for [`Indices`](https://bluss.github.io/rust-ndarray/master/ndarray/struct.Indices.html) is [`D::Pattern`](https://bluss.github.io/rust-ndarray/master/ndarray/trait.Dimension.html#associatedtype.Pattern) where `D` is a dimension. That means if D is `Ix2`, the item is `(usize, usize)`. If `D` is [IxDyn](https://bluss.github.io/rust-ndarray/master/ndarray/type.IxDyn.html), dynamic number of...

This is maybe not so straightforward, you could leave this to me if you want.

Making SliceArg available like that is good

I have sort of gone into this territory with Zip, a chunk iterator might show up there.

What I want now with Zip is that one can zip together chunk producers and arrays. If an array is dim (10, 10) and we get a chunks producer with...

This makes nalgebra a public dependency, optional or not. Then we'll have to be careful. Nice feature for ndarray users but we need to think about release management.

Not bad, that's very interesting. Great to have that stable in cargo :slightly_smiling_face: