StorageLayoutIJK getStorageLayout()Hint about data organization in memory.
This information aims at optimizing the topology traversal for extractors. Returns the internal data layout in memory as 6 enum values covering all possible cases. For instance
- the cell (i+1,j,k) is consecutive in memory to the data (i,j,k) and,
- the row of data (j+1,k) is consecutive in memory to the row of data (j,k) and,
- the slice of data (k+1) is consecutive in memory to the slice of data (k)
The fastest way to go through the data with such layout is to perform the following triple loop:
for each k with 0 <= k < numK for each j with 0 <= j < numJ for each i with 0 <= i < numI data.get(i,j,k);