SAMRAI::pdat::NodeIterator< DIM > Class Template Reference

#include <source/patchdata/node/NodeIterator.h>

List of all members.

Public Member Functions
	NodeIterator ()
	NodeIterator (const hier::Box< DIM > &box)
	NodeIterator (const NodeIterator< DIM > &iterator)
NodeIterator< DIM > &	operator= (const NodeIterator< DIM > &iterator)
	~NodeIterator ()
const NodeIndex< DIM > &	operator * () const
const NodeIndex< DIM > &	operator() () const
	operator bool () const
	operator const void * () const
bool	operator! () const
void	operator++ (int)
bool	operator== (const NodeIterator< DIM > &iterator) const
bool	operator!= (const NodeIterator< DIM > &iterator) const

---

Detailed Description

template<int DIM>
class SAMRAI::pdat::NodeIterator< DIM >

Class NodeIterator<DIM> is an iterator that provides methods for stepping through the index space associated with a node centered box. The indices are enumerated in column-major (e.g., Fortran) order. The iterator should be used as follows:

   hier::Box<DIM> box;
   ...
   for (NodeIterator<DIM> c(box); c; c++) {
      // use index c of the box
   }
   

Note that the node iterator may not compile to efficient code, depending on your compiler. Many compilers are not smart enough to optimize the looping constructs and indexing operations.

See also:

pdat::NodeData

pdat::NodeGeometry

pdat::NodeIndex

---

Constructor & Destructor Documentation

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::NodeIterator

(

)

[inline]

Default constructor for the node iterator. The iterator must be initialized before it can be used to iterate over a box.

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::NodeIterator

(

const hier::Box< DIM > &

box

)

[inline]

Constructor for the node iterator. The iterator will enumerate the indices in the argument box.

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::NodeIterator

(

const NodeIterator< DIM > &

iterator

)

[inline]

Copy constructor for the node iterator

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::~NodeIterator

(

)

[inline]

Destructor for the node iterator.

---

Member Function Documentation

template<int DIM>

NodeIterator< DIM > & SAMRAI::pdat::NodeIterator< DIM >::operator=

(

const NodeIterator< DIM > &

iterator

)

[inline]

Assignment operator for the node iterator.

template<int DIM>

const NodeIndex< DIM > & SAMRAI::pdat::NodeIterator< DIM >::operator *

(

)

const [inline]

Extract the node index corresponding to the iterator position in the box.

template<int DIM>

const NodeIndex< DIM > & SAMRAI::pdat::NodeIterator< DIM >::operator()

(

)

const [inline]

Extract the node index corresponding to the iterator position in the box.

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::operator bool

(

)

const [inline]

Return true if the iterator points to a valid index within the box.

template<int DIM>

SAMRAI::pdat::NodeIterator< DIM >::operator const void *

(

)

const [inline]

Return a non-NULL if the iterator points to a valid index within the box.

template<int DIM>

bool SAMRAI::pdat::NodeIterator< DIM >::operator!

(

)

const [inline]

Return whether the iterator points to a valid index within the box. This operator mimics the !p operation applied to a pointer p.

template<int DIM>

void SAMRAI::pdat::NodeIterator< DIM >::operator++

(

int

)

[inline]

Increment the iterator to point to the next index in the box.

template<int DIM>

bool SAMRAI::pdat::NodeIterator< DIM >::operator==

(

const NodeIterator< DIM > &

iterator

)

const [inline]

Test two iterators for equality (same index value).

template<int DIM>

bool SAMRAI::pdat::NodeIterator< DIM >::operator!=

(

const NodeIterator< DIM > &

iterator

)

const [inline]

Test two iterators for inequality (different index values).

---

The documentation for this class was generated from the following files:

• source/patchdata/node/NodeIterator.h
• source/patchdata/node/NodeIterator.I

---