Interface MiDataSetIj

    • Method Detail

      • getStorageLayout

        StorageLayoutIJ 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 2 enum values covering all possible cases. For instance JI means that:

        • the cell (i+1,j) is consecutive in memory to the data (i,j) and,
        • the slice of data (j+1) is consecutive in memory to the slice of data (j)

        The fastest way to go through the data with such layout is to perform the following triple loop:

         for each j with 0 <= j < numJ
           for each i with 0 <= i < numI