Dear all,<br><br>I would like to gauge the interest of the community in a library that can serve 1) as a complement to Boost.MultiArray and 2) as an alternative to Boost.MultiArray.<br><br>For the first type of use, an example of the candidate library&#39;s capabilities is that it makes available a special iterator &quot;it&quot; that allows to browse all the elements of a MultiArray &quot;m&quot;. This special iterator has an it.indices() members that returns a &quot;list&quot; Collection of indices (i.e. an IndexList) such that &quot;m(list)&quot; and &quot;*it&quot; are the same elements. This can be useful for functions whose effect on an element of &quot;m&quot; depends on where this element is situated in &quot;m&quot;.<br>
<br>The second way to use the candidate library is as an alternative to Boost.MultiArray of dynamically chosen (execution time) dimensionality. Moreover, the elements do not necessarily need to be arranged in a multi-dimensional &quot;box&quot;, as is the case in a MultiArray. For example, a &quot;simplex&quot; organization of the elements is already implemented.<br>
<br>If you are interested to know more, I strongly suggest you to take a look at the example file in sandbox/index_list/libs/index_list/examples.cpp . The library itself is in sandbox/index_list/boost and a readme file (with some details concerning concepts and &quot;priorities&quot;) is in sandbox/index_list/libs/README . An automatically generated (Doxygen) documentation is located in sandbox/index_list/libs/index_list/doc/index.html . Sadly, there is no &quot;real&quot; documentation for now.<br>
<br>Many thanks for your time.<br><br>Sincerely,<br><br>Pierre-André Noël<br>