---

GraphNode Class Reference

#include <GraphNode.H>

Collaboration diagram for GraphNode:

[legend]List of all members.

Public Methods
	GraphNode ()
	~GraphNode ()
int	size () const
void	clear ()
bool	isRegular () const
bool	isCovered () const
bool	isIrregular () const
void	defineAsRegular ()
void	defineAsCovered ()
Vector< FaceIndex >	getFaces (const VolIndex &a_vof, const int &a_idir, const Side::LoHiSide &a_sd, const Box &a_domain) const
Vector< VolIndex >	getVoFs (const IntVect &a_iv) const
const GraphNode &	operator= (const GraphNode &ebiin)
	GraphNode (const GraphNode &ebiin)
Vector< VolIndex >	refine (const VolIndex &a_coarVoF) const
VolIndex	coarsen (const VolIndex &a_fineVoF) const
void	addIrregularNode (const GraphNodeImplem &a_nodein, int cellIndex)
void	addIrregularNode (const GraphNodeImplem &a_nodein)
Vector< Vector< VolIndex > >	getVoFSets (const Box &a_box) const
int	linearSize () const
void	linearOut (void *buffer) const
void	linearIn (void *buffer)
void	setDefaults ()
	internal use only
Public Attributes
Vector< GraphNodeImplem > *	m_cellList

---

Detailed Description

This is a list showing the connectivity of a given cell. This has the special property of also being able to set itself to regular or covered by setting the current nodeimplem pointer to 1 or 0.

---

Constructor & Destructor Documentation

GraphNode::GraphNode (    )

constructor sets node to regular as default.

GraphNode::~GraphNode (    )

GraphNode::GraphNode (  const GraphNode &    ebiin )

---

Member Function Documentation

void GraphNode::addIrregularNode (  const GraphNodeImplem &    a_nodein )

void GraphNode::addIrregularNode (  const GraphNodeImplem &    a_nodein, int    cellIndex )

void GraphNode::clear (    )

deletes memory if it has been allocated and sets members to 0

VolIndex GraphNode::coarsen (  const VolIndex &    a_fineVoF )  const

Returns the corresponding VoF from the next coarser EBGraph (same solution location, different index space, factor of two refinement ratio).

void GraphNode::defineAsCovered (    )

Set Node to covered. If previously set to irregular, deletes their memory.

void GraphNode::defineAsRegular (    )

Set Node to regular. If previously set to irregular, deletes their memory.

Vector<FaceIndex> GraphNode::getFaces (  const VolIndex &    a_vof, const int &    a_idir, const Side::LoHiSide &    a_sd, const Box &    a_domain )  const

Get the faces in the direction and side for the vof in the list. if the vof's cell index is not found in the list, abort. Use the input vof's grid index for a the grid index of the list.

Vector<VolIndex> GraphNode::getVoFs (  const IntVect &    a_iv )  const

Return all the vofs in the list, using the input intvect for the gridIndex

Vector<Vector<VolIndex> > GraphNode::getVoFSets (  const Box &    a_box )  const

get all sets of connected vofs within the box. used in coarsening

bool GraphNode::isCovered (    )  const

Return true if the node is covered (m_thisNode==0).

bool GraphNode::isIrregular (    )  const

Return true if the node is neither regular or covered.

bool GraphNode::isRegular (    )  const

Return true if the node is regular (m_thisNode==1).

void GraphNode::linearIn (  void *    buffer )

void GraphNode::linearOut (  void *    buffer )  const

int GraphNode::linearSize (    )  const

const GraphNode& GraphNode::operator= (  const GraphNode &    ebiin )

Vector<VolIndex> GraphNode::refine (  const VolIndex &    a_coarVoF )  const

Returns the corresponding set of VoFs from the next finer EBGraph (factor of two refinement). The result is only defined if this {\tt EBGraph} was defined by coarsening.

void GraphNode::setDefaults (    )

internal use only

int GraphNode::size (    )  const

---

Member Data Documentation

Vector<GraphNodeImplem>* GraphNode::m_cellList

The connectivity data at this point. If m_thisNode == 0, node is covered. If m_thisNode == 1, node is regular. otherwise, it is a real list.

---

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

• GraphNode.H

---