Hello all. I was studying the type Map and Stride to understand how to implement
a symmetric matrix allocated in a compact form (just a linear array with the half
of the elements) . I have understood that the Map class uses the Stride class to
"map" the elements of an array of memory into the Eigen::Matrix elememts.

So my question is if it is possible to program a dynamic stride class that
can compute the memory location of a matrix element in function of a given
column and row.

Currently the stride has to be constant but we plan to support compact triangular storage using stride increments.

Hello, Thanks for your response. To you think that new feature will be done the next year?

Nobody started working on it yet. If you have template programming skills, you might give it a try!

I have programming skills, but I'm really new in the idioms that you use in eigen3. If you have a text for studying the use and concepts of traits, BasePlaneObject, etc, etc, and the hole philosophy of eigen3 I will try with pleasure.