#include <source/patchdata/node/NodeIndex.h>
Inheritance diagram for SAMRAI::pdat::NodeIndex< DIM >:
Public Types | |
enum | Corner { Left = 0, Right = 1, LowerLeft = 0, LowerRight = 1, UpperLeft = 2, UpperRight = 3, LLL = 0, ULL = 1, LUL = 2, UUL = 3, LLU = 4, ULU = 5, LUU = 6, UUU = 7 } |
Public Member Functions | |
NodeIndex () | |
NodeIndex (const hier::Index< DIM > &rhs, const Corner corner) | |
NodeIndex (const hier::Index< DIM > &rhs, const hier::IntVector< DIM > &corner) | |
NodeIndex (const NodeIndex< DIM > &rhs) | |
NodeIndex< DIM > & | operator= (const NodeIndex< DIM > &rhs) |
~NodeIndex () | |
NodeIndex< DIM > & | operator+= (const hier::IntVector< DIM > &rhs) |
NodeIndex< DIM > | operator+ (const hier::IntVector< DIM > &rhs) const |
NodeIndex< DIM > & | operator+= (const int rhs) |
NodeIndex< DIM > | operator+ (const int rhs) const |
NodeIndex< DIM > & | operator-= (const hier::IntVector< DIM > &rhs) |
NodeIndex< DIM > | operator- (const hier::IntVector< DIM > &rhs) const |
NodeIndex< DIM > & | operator-= (const int rhs) |
NodeIndex< DIM > | operator- (const int rhs) const |
NodeIndex< DIM > & | operator *= (const hier::IntVector< DIM > &rhs) |
NodeIndex< DIM > | operator * (const hier::IntVector< DIM > &rhs) const |
NodeIndex< DIM > & | operator *= (const int rhs) |
NodeIndex< DIM > | operator * (const int rhs) const |
bool | operator== (const NodeIndex< DIM > &rhs) const |
bool | operator!= (const NodeIndex< DIM > &rhs) const |
|
The Corner enumerated type is used when converting from a cell centered index to a node centered index. In 1d, use Left and Right. In 2d, use LowerLeft, LowerRight, UpperLeft, and UpperRight. In 3d, the naming is less intuitive, and use names LLL through UUU, where L means lower and U means upper. Therefore, to get the box upper in X, lower in Y, and lower in Z, use corner name ULL. |
|
The default constructor for a node index creates an uninitialized index. |
|
Construct a node index from a regular index and a corner. The Corner enumerated type is only defined for 3D or lower, so use the next constructor with an hier::IntVector argument when using higher dimensions. |
|
Construct a node index from a regular index and an hier::IntVector. The hier::IntVector is binary--an assertion failure will result if it contains any values other than 0 or 1. For each dimension, if the hier::IntVector contains a 0, the node index will represent a lower bound in that dimensional direction, and if 1 will represent an upper bound in that direction. |
|
The copy constructor creates a node index equal to the argument. |
|
The node index destructor does nothing interesting. |
|
The assignment operator sets the node index equal to the argument. |
|
Plus-equals operator for a node index and an integer vector. |
|
Plus operator for a node index and an integer vector. |
|
Plus-equals operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Plus operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Minus-equals operator for a node index and an integer vector. |
|
Minus operator for a node index and an integer vector. |
|
Minus-equals operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Minus operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Times-equals operator for a node index and an integer vector. |
|
Times operator for a node index and an integer vector. |
|
Times-equals operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Times operator for a node index and an integer. Reimplemented from SAMRAI::hier::Index< DIM >. |
|
Returns true if two node index objects are equal. All components must be the same for equality. |
|
Returns true if two node index objects are not equal. Any of the components may be different for inequality. |