64 return ((
n.x()+1) * (
n.y()+1) * (
n.z()+1));
85 ((
n.x()+1) *
n.y() *
n.z())
86 + ((
n.y()+1) *
n.z() *
n.x())
87 + ((
n.z()+1) *
n.x() *
n.y())
103 ((
n.x()-1) *
n.y() *
n.z())
104 + ((
n.y()-1) *
n.z() *
n.x())
105 + ((
n.z()-1) *
n.x() *
n.y())
122 + (2 *
n.z() *
n.x())
123 + (2 *
n.x() *
n.y())
190 checkIndex(i, j,
k,
true);
195 return (i + ((
n.x()+1) * (j + (
n.y()+1) *
k)));
202 checkIndex(ijk,
true);
207 return (ijk.
x() + ((
n.x()+1) * (ijk.
y() + (
n.y()+1) * ijk.
z())));
const Cmpt & x() const noexcept
Access to the vector x component.
const Cmpt & z() const noexcept
Access to the vector z component.
const Cmpt & y() const noexcept
Access to the vector y component.
void checkIndex(const label i, const label j, const label k, const bool allowExtra=false) const
Check indices are within ni,nj,nk range.
ijkAddressing()
Construct zero-size addressing.
label index(const label i, const label j, const label k) const
Linear addressing index (offset) for an (i,j,k) position.
bool empty() const noexcept
Addressing is considered empty if any component is zero.
const labelVector & sizes() const noexcept
The (i,j,k) addressing dimensions.
label size() const noexcept
Return the total i*j*k size.
label nInternalFaces() const
The number of internal faces in the i-j-k mesh.
ijkMesh()
Construct zero-sized.
label nBoundaryFaces() const
The number of boundary faces in the i-j-k mesh.
label pointLabel(const label i, const label j, const label k) const
The linear point index for an i-j-k position.
label nCells() const
The number of mesh cells (nx*ny*nz) in the i-j-k mesh.
label nPoints() const
The number of mesh points (nx+1)*(ny+1)*(nz+1) in the i-j-k mesh.
label cellLabel(const label i, const label j, const label k) const
The linear cell index for an i-j-k position - same as index().
label nFaces() const
The total number of mesh faces in the i-j-k mesh.
Vector< label > labelVector
Vector of labels.