11 #ifndef _DISJOINTBOXLAYOUT_H_
12 #define _DISJOINTBOXLAYOUT_H_
17 #include "NamespaceHeader.H"
153 {
define(a_boxes, a_procIDs, a_physDomain);}
215 MayDay::Error(
"attempt to setDomain on closed DisjointBoxLayout");
310 int a_dir,
int a_len=1);
320 int a_dir,
int a_len=1);
344 int a_dir,
int a_len);
347 int a_dir,
int a_len);
358 int a_dir,
int a_len)
365 int a_dir,
int a_len)
374 coarsen(output, input, refinement);
381 refine(output, input, refinement);
384 #include "NamespaceFooter.H"
bool checkDomains(const DisjointBoxLayout &a_dbl) const
virtual void closeN(RefCountedPtr< Vector< Vector< std::pair< int, LayoutIndex > > > > neighbors)
void adjCellHi_dbl(DisjointBoxLayout &a_output, const DisjointBoxLayout &a_input, int a_dir, int a_len)
Definition: DisjointBoxLayout.H:363
A reference-counting handle class.
Definition: RefCountedPtr.H:66
Box refine(const Box &b, const IntVect &refinement_ratio)
A class to facilitate interaction with physical boundary conditions.
Definition: ProblemDomain.H:130
RefCountedPtr< bool > m_closed
Definition: BoxLayout.H:621
virtual void closeNoSort()
A not-necessarily-disjoint collective of boxes.
Definition: BoxLayout.H:146
A strange but true thing to make copying from one boxlayoutdata to another fast.
Definition: Copier.H:137
void defineAndLoadBalance(const Vector< Box > &a_boxes, Vector< int > *a_procIDs)
Definition: SliceSpec.H:42
void adjCellLo_dbl(DisjointBoxLayout &a_output, const DisjointBoxLayout &a_input, int a_dir, int a_len)
Definition: DisjointBoxLayout.H:356
virtual void define_pd(const Vector< Box > &a_boxes, const Vector< int > &a_procIDs, const ProblemDomain &a_physDomain)
Definition: DisjointBoxLayout.H:150
const ProblemDomain & physDomain() const
void setDomain(const ProblemDomain &a_domain)
Definition: DisjointBoxLayout.H:211
void degenerate(DisjointBoxLayout &a_to, const SliceSpec &a_ss) const
void coarsen_dbl(DisjointBoxLayout &output, const DisjointBoxLayout &input, int refinement)
Definition: DisjointBoxLayout.H:370
virtual void deepCopy(const DisjointBoxLayout &a_source)
IndexTM< T, N > coarsen(const IndexTM< T, N > &a_p, T a_s)
Definition: IndexTMI.H:432
ProblemDomain m_physDomain
Definition: DisjointBoxLayout.H:331
Box adjCellLo(const Box &b, int dir, int len=1)
A BoxLayout that has a concept of disjointedness.
Definition: DisjointBoxLayout.H:31
virtual ~DisjointBoxLayout()
Definition: DisjointBoxLayout.H:77
static void Error(const char *const a_msg=m_nullString, int m_exitCode=CH_DEFAULT_ERROR_CODE)
Print out message to cerr and exit with the specified exit code.
friend void coarsen(DisjointBoxLayout &output, const DisjointBoxLayout &input, int refinement)
RefCountedPtr< Vector< Vector< std::pair< int, LayoutIndex > > > > m_neighbors
Definition: DisjointBoxLayout.H:335
Box adjCellHi(const Box &b, int dir, int len=1)
void refine_dbl(DisjointBoxLayout &output, const DisjointBoxLayout &input, int refinement)
Definition: DisjointBoxLayout.H:377
friend void adjCellLo(DisjointBoxLayout &a_output, const DisjointBoxLayout &a_input, int a_dir, int a_len=1)
bool checkPeriodic(const ProblemDomain &a_domain) const
virtual void define(const Vector< Box > &a_boxes, const Vector< int > &a_procIDs)
An Iterator based on a DisjointBoxLayout object for neighboring boxes.
Definition: NeighborIterator.H:23
friend void adjCellHi(DisjointBoxLayout &a_output, const DisjointBoxLayout &a_input, int a_dir, int a_len=1)
friend void refine(DisjointBoxLayout &output, const DisjointBoxLayout &input, int refinement)