Steven:<br>&gt;int index_of(const multi_array&lt;int, 3&gt;&amp; m, int* iter, int dimension) {
<br>
&gt;&nbsp;&nbsp;&nbsp; int offset = iter - m.origin();
<br>
&gt;&nbsp;&nbsp;&nbsp; return(offset / m.strides()[dimension] % m.shape()[dimension] + 
<br>
&gt;m.index_bases()[dimension]);
}
<br><br>Thanks for the code suggestion.&nbsp; Does this code work for N dimensions? it appears to.&nbsp; I would prefer to keep a tight count of the indices in the iterator itself to ensure that we don&#39;t need to do this expensive calculation each time, but this looks like a pretty good starting point and would work similarly for my sequential ublas::matrix iteration as well.<br>
<br>-Jesse<br>