11 #ifndef _NODECOARSEAVERAGE_H_    12 #define _NODECOARSEAVERAGE_H_    21 #include "NamespaceHeader.H"    63                     const Box&               a_domainFine);
    81                     const Box&               a_domainFine);
   114               const Box&               a_domainFine);
   141               const Box&               a_domainFine);
   253 #include "NamespaceFooter.H" void define(const DisjointBoxLayout &a_gridsFine, const DisjointBoxLayout &a_gridsCoarse, int a_numcomps, int a_refRatio, const ProblemDomain &a_domainFine)
 
A class to facilitate interaction with physical boundary conditions. 
Definition: ProblemDomain.H:141
 
LayoutData< BitSet > m_IVSVfull
Definition: NodeCoarseAverage.H:246
 
Data that maintains a one-to-one mapping of T to the boxes in a BoxLayout. 
Definition: BoxLayout.H:26
 
bool is_defined
Definition: NodeCoarseAverage.H:201
 
bool m_verbose
Definition: NodeCoarseAverage.H:205
 
FArrayBox m_weights
Definition: NodeCoarseAverage.H:226
 
void setVerbose(bool a_verbose)
 
DisjointBoxLayout m_coarsenedGrids
Definition: NodeCoarseAverage.H:234
 
void averageToCoarse(LevelData< NodeFArrayBox > &a_coarse, LevelData< NodeFArrayBox > &a_fine)
 
ProblemDomain m_domainCoarse
Definition: NodeCoarseAverage.H:217
 
int m_numcomps
Definition: NodeCoarseAverage.H:213
 
A BoxLayout that has a concept of disjointedness. 
Definition: DisjointBoxLayout.H:30
 
int m_refRatio
Definition: NodeCoarseAverage.H:209
 
bool m_sameGrids
Definition: NodeCoarseAverage.H:230
 
A Rectangular Domain on an Integer Lattice. 
Definition: Box.H:465
 
LevelData< NodeFArrayBox > m_coarsenedFine
Definition: NodeCoarseAverage.H:238
 
Definition: FArrayBox.H:45
 
Box m_refbox
Definition: NodeCoarseAverage.H:222
 
LayoutData< Vector< IntVectSet > > m_IVSV
Definition: NodeCoarseAverage.H:242
 
Replaces coarse-level data with an average of fine-level data. 
Definition: NodeCoarseAverage.H:25
 
LayoutData< Vector< IntVectSet > > m_IVSVsame
Definition: NodeCoarseAverage.H:250