1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
|
/*
** (c) 1996-2000 The Regents of the University of California (through
** E.O. Lawrence Berkeley National Laboratory), subject to approval by
** the U.S. Department of Energy. Your use of this software is under
** license -- the license agreement is attached and included in the
** directory as license.txt or you may contact Berkeley Lab's Technology
** Transfer Department at TTD@lbl.gov. NOTICE OF U.S. GOVERNMENT RIGHTS.
** The Software was developed under funding from the U.S. Government
** which consequently retains certain rights as follows: the
** U.S. Government has been granted for itself and others acting on its
** behalf a paid-up, nonexclusive, irrevocable, worldwide license in the
** Software to reproduce, prepare derivative works, and perform publicly
** and display publicly. Beginning five (5) years after the date
** permission to assert copyright is obtained from the U.S. Department of
** Energy, and subject to any subsequent five (5) year renewals, the
** U.S. Government is granted for itself and others acting on its behalf
** a paid-up, nonexclusive, irrevocable, worldwide license in the
** Software to reproduce, prepare derivative works, distribute copies to
** the public, perform publicly and display publicly, and to permit
** others to do so.
*/
#ifndef BL_INDEXTYPE_H
#define BL_INDEXTYPE_H
//
// $Id: IndexType.H,v 1.14 2001/10/10 20:12:44 car Exp $
//
#include <iosfwd>
#include <ccse-mpi.H>
#include <IntVect.H>
#include <SPACE.H>
//
//@Man:
//@Memo: Cell-Based or Node-Based Indices
/*@Doc:
The class IndexType defines an index as being cell based or node (edge)
based in each of the BL\_SPACEDIM directions. This class defines an
enumerated type CellIndex to be either CELL or NODE; i.e. each of the
BL\_SPACEDIM dimensions must be either CELL or NODE.
*/
class IndexType
{
friend MPI_Datatype ParallelDescriptor::Mpi_typemap<IndexType>::type();
public:
//
//@ManDoc: The cell index type: one of CELL or NODE.
//
enum CellIndex { CELL = 0, NODE = 1 };
//
//@ManDoc: The default constructor
//
IndexType ();
//
//@ManDoc: The copy constructor.
//
IndexType (const IndexType& rhs);
//
//@ManDoc: Construct an IndexType identical to an IntVect.
//
explicit IndexType (const IntVect& iv);
//
//@ManDoc: The assignment operator.
//
IndexType& operator= (const IndexType& rhs);
/*@ManDoc: Construct an IndexType given an explicit CellIndex for
each direction. D\_DECL is a macro that sets the constructor
to take BL\_SPACEDIM arguments.
*/
IndexType (D_DECL(CellIndex i, CellIndex j, CellIndex k));
//
//@ManDoc: Set IndexType to be NODE based in direction dir.
//
void set (int dir);
//
//@ManDoc: Set IndexType to be CELL based in direction dir.
//
void unset (int dir);
//
//@ManDoc: True if IndexType is NODE based in direction dir.
//
bool test (int dir) const;
//
//@ManDoc: Set NODE based in all directions.
//
void setall ();
//
//@ManDoc: Set CELL based in all directions.
//
void clear ();
//
//@ManDoc: True if this IndexType is NODE based in any direction.
//
bool any () const;
//
//@ManDoc: True if IndexType is valid.
//
bool ok () const;
//
//@ManDoc: Change from CELL to NODE or NODE to CELL in direction dir.
//
void flip (int i);
//
//@ManDoc: True if IndexTypes are identical.
//
bool operator== (const IndexType& t) const;
//
//@ManDoc: True if IndexTypes are not identical.
//
bool operator!= (const IndexType& t) const;
//
//@ManDoc: True if the IndexType is CELL based in all directions.
//
bool cellCentered () const;
//
//@ManDoc: True if the IndexType is NODE based in all directions.
//
bool nodeCentered () const;
//
//@ManDoc: Set IndexType to CellIndex type t in direction dir.
//
void setType (int dir,
CellIndex t);
//
//@ManDoc: Returns the CellIndex in direction dir.
//
CellIndex ixType (int dir) const;
//
//@ManDoc: Return an integer representing the IndexType in direction dir.
//
int operator[] (int dir) const;
//
//@ManDoc: Fill an IntVect of size BL\_SPACEDIM with IndexTypes.
//
IntVect ixType () const;
/*@ManDoc: This static member function returns an IndexType object of value
IndexType::CELL. It is provided as a convenience to our users
when defining a Box all of whose faces should be of type
IndexType::CELL.
*/
static IndexType TheCellType ();
/*@ManDoc: This static member function returns an IndexType object of value
IndexType::NODE. It is provided as a convenience to our users
when defining a Box all of whose faces should be of type
IndexType::NODE.
*/
static IndexType TheNodeType ();
private:
//
// Returns 1<<k.
//
static int mask (int k);
//
// An integer holding the CellIndex in bits 0 - BL\_SPACEDIM-1.
//
unsigned int itype;
};
//
//@ManDoc: Write an IndexType to an ostream in ASCII.
//
std::ostream& operator<< (std::ostream& os, const IndexType& itype);
//
//@ManDoc: Read an IndexType from an istream.
//
std::istream& operator>> (std::istream& is, IndexType& itype);
inline
int
IndexType::mask (int k)
{
return 1<<k;
}
inline
IndexType::IndexType ()
:
itype(0)
{}
inline
IndexType::IndexType (const IndexType& bt)
:
itype(bt.itype)
{}
inline
IndexType&
IndexType::operator= (const IndexType& bt)
{
itype = bt.itype;
return *this;
}
inline
void
IndexType::set (int dir)
{
itype |= mask(dir);
}
inline
void
IndexType::unset (int dir)
{
itype &= ~mask(dir);
}
inline
bool
IndexType::test (int dir) const
{
return (itype & mask(dir)) != 0;
}
inline
void
IndexType::setall ()
{
itype = (1 << BL_SPACEDIM) - 1;
}
inline
void
IndexType::clear ()
{
itype = 0;
}
inline
bool
IndexType::any () const
{
return itype != 0;
}
inline
bool
IndexType::ok () const
{
return itype < (1 << BL_SPACEDIM);
}
inline
void
IndexType::flip (int i)
{
itype ^= mask(i);
}
inline
bool
IndexType::operator== (const IndexType& t) const
{
return t.itype == itype;
}
inline
bool
IndexType::operator!= (const IndexType& t) const
{
return t.itype != itype;
}
inline
bool
IndexType::cellCentered () const
{
return itype == 0;
}
inline
bool
IndexType::nodeCentered () const
{
return itype == (1<<BL_SPACEDIM)-1;
}
inline
int
IndexType::operator[] (int dir) const
{
return test(dir);
}
#endif /*BL_INDEXTYPE_H*/
|