StorageLayoutIJK Enumeration |
Note: This API is now obsolete.
Hint about data organization in memory for IJK volume mesh.
Namespace: OIV.MeshVizXLM.MeshAssembly: OIV.MeshVizXLM.Mesh (in OIV.MeshVizXLM.Mesh.dll) Version: 9.9.13.0.Release.908d87e01
Syntax[ObsoleteAttribute("MeshVizXLM.NET is no longer supported. This enum class will be removed in the next major release.")]
public enum StorageLayoutIJK
<ObsoleteAttribute("MeshVizXLM.NET is no longer supported. This enum class will be removed in the next major release.")>
Public Enumeration StorageLayoutIJK
[ObsoleteAttribute(L"MeshVizXLM.NET is no longer supported. This enum class will be removed in the next major release.")]
public enum class StorageLayoutIJK
[<ObsoleteAttribute("MeshVizXLM.NET is no longer supported. This enum class will be removed in the next major release.")>]
type StorageLayoutIJK
Members
| Member name | Value | Description |
---|
| IJK | 0 | |
| IKJ | 1 | |
| JKI | 2 | |
| JIK | 3 | |
| KJI | 4 | |
| KIJ | 5 | |
| UNKNOWN | 6 |
Means that the data storage organization is unknown, for instance when data
are computed on the fly.
|
Remarks
Hint about data organization in memory for IJK volume mesh.
This information aims at optimizing the data traversal for extractors. Enum
values covering all possible cases for internal data layout in memory. For
instance
means that:
- data (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
See Also