This is the complete list of members for amrex::BoxArray, including all inherited members.
AmrMesh class | amrex::BoxArray | friend |
BoxArray() noexcept | amrex::BoxArray | |
BoxArray(const BoxArray &rhs)=default | amrex::BoxArray | |
BoxArray(BoxArray &&rhs) noexcept=default | amrex::BoxArray | |
BoxArray(const Box &bx) | amrex::BoxArray | explicit |
BoxArray(size_t n) | amrex::BoxArray | explicit |
BoxArray(const Box *bxvec, int nbox) | amrex::BoxArray | |
BoxArray(const BoxList &bl) | amrex::BoxArray | explicit |
BoxArray(BoxList &&bl) noexcept | amrex::BoxArray | explicit |
BoxArray(const BoxArray &rhs, const BATransformer &trans) | amrex::BoxArray | |
BoxArray(BoxList &&bl, IntVect const &max_grid_size) | amrex::BoxArray | |
boxList() const | amrex::BoxArray | |
capacity() const noexcept | amrex::BoxArray | inline |
CellEqual(const BoxArray &rhs) const noexcept | amrex::BoxArray | |
clear() | amrex::BoxArray | |
clear_hash_bin() const | amrex::BoxArray | |
coarsen(int refinement_ratio) | amrex::BoxArray | |
coarsen(const IntVect &iv) | amrex::BoxArray | |
coarsenable(int refinement_ratio, int min_width=1) const | amrex::BoxArray | |
coarsenable(const IntVect &refinement_ratio, int min_width=1) const | amrex::BoxArray | |
coarsenable(const IntVect &refinement_ratio, const IntVect &min_width) const | amrex::BoxArray | |
complementIn(const Box &b) const | amrex::BoxArray | |
complementIn(BoxList &bl, const Box &b) const | amrex::BoxArray | |
contains(const IntVect &v) const | amrex::BoxArray | |
contains(const Box &b, bool assume_disjoint_ba=false, const IntVect &ng=IntVect(0)) const | amrex::BoxArray | |
contains(const BoxArray &ba, bool assume_disjoint_ba=false, const IntVect &ng=IntVect(0)) const | amrex::BoxArray | |
contains(const BoxArray &ba, Periodicity const &period) const | amrex::BoxArray | |
convert(IndexType typ) | amrex::BoxArray | |
convert(const IntVect &iv) | amrex::BoxArray | |
convert(Box(*fp)(const Box &)) | amrex::BoxArray | |
crseRatio() const noexcept | amrex::BoxArray | inline |
d_numPts() const noexcept | amrex::BoxArray | |
define(const Box &bx) | amrex::BoxArray | |
define(const BoxList &bl) | amrex::BoxArray | |
define(BoxList &&bl) noexcept | amrex::BoxArray | |
empty() const noexcept | amrex::BoxArray | inline |
enclosedCells() | amrex::BoxArray | |
enclosedCells(int dir) | amrex::BoxArray | |
FabArrayBase class | amrex::BoxArray | friend |
Finalize() | amrex::BoxArray | static |
get(int index) const noexcept | amrex::BoxArray | inline |
getCellCenteredBox(int index) const noexcept | amrex::BoxArray | inline |
getDoiHi() const noexcept | amrex::BoxArray | private |
getDoiLo() const noexcept | amrex::BoxArray | private |
getHashMap() const | amrex::BoxArray | private |
getRefID() const noexcept | amrex::BoxArray | inline |
grow(int n) | amrex::BoxArray | |
grow(const IntVect &iv) | amrex::BoxArray | |
grow(int idir, int n_cell) | amrex::BoxArray | |
growcoarsen(int n, const IntVect &iv) | amrex::BoxArray | |
growcoarsen(IntVect const &ngrow, const IntVect &iv) | amrex::BoxArray | |
growHi(int idir, int n_cell) | amrex::BoxArray | |
growLo(int idir, int n_cell) | amrex::BoxArray | |
Initialize() | amrex::BoxArray | static |
initialized | amrex::BoxArray | static |
intersections(const Box &bx) const | amrex::BoxArray | |
intersections(const Box &bx, bool first_only, int ng) const | amrex::BoxArray | |
intersections(const Box &bx, bool first_only, const IntVect &ng) const | amrex::BoxArray | |
intersections(const Box &bx, std::vector< std::pair< int, Box > > &isects) const | amrex::BoxArray | |
intersections(const Box &bx, std::vector< std::pair< int, Box > > &isects, bool first_only, int ng) const | amrex::BoxArray | |
intersections(const Box &bx, std::vector< std::pair< int, Box > > &isects, bool first_only, const IntVect &ng) const | amrex::BoxArray | |
intersects(const Box &b, int ng=0) const | amrex::BoxArray | |
intersects(const Box &b, const IntVect &ng) const | amrex::BoxArray | |
isDisjoint() const | amrex::BoxArray | |
ixType() const noexcept | amrex::BoxArray | inline |
m_bat | amrex::BoxArray | private |
m_ref | amrex::BoxArray | private |
m_simplified_list | amrex::BoxArray | mutableprivate |
maxSize(int block_size) | amrex::BoxArray | |
maxSize(const IntVect &block_size) | amrex::BoxArray | |
minimalBox() const | amrex::BoxArray | |
minimalBox(Long &npts_avg_box) const | amrex::BoxArray | |
minmaxSize(const IntVect &min_size, const IntVect &max_size) | amrex::BoxArray | |
numPts() const noexcept | amrex::BoxArray | |
ok() const | amrex::BoxArray | |
operator!=(const BoxArray &rhs) const noexcept | amrex::BoxArray | |
operator!=(const Vector< Box > &bv) const noexcept | amrex::BoxArray | |
operator=(BoxArray const &rhs)=default | amrex::BoxArray | |
operator=(BoxArray &&rhs) noexcept=default | amrex::BoxArray | |
operator==(const BoxArray &rhs) const noexcept | amrex::BoxArray | |
operator==(const Vector< Box > &bv) const noexcept | amrex::BoxArray | |
operator[](int index) const noexcept | amrex::BoxArray | inline |
operator[](const MFIter &mfi) const noexcept | amrex::BoxArray | |
readFrom(std::istream &is) | amrex::BoxArray | |
refine(int refinement_ratio) | amrex::BoxArray | |
refine(const IntVect &iv) | amrex::BoxArray | |
removeOverlap(bool simplify=true) | amrex::BoxArray | |
resize(Long len) | amrex::BoxArray | |
SameRefs(const BoxArray &lhs, const BoxArray &rhs) | amrex::BoxArray | inlinestatic |
set(int i, const Box &ibox) | amrex::BoxArray | |
shift(int dir, int nzones) | amrex::BoxArray | |
shift(const IntVect &iv) | amrex::BoxArray | |
simplified() const | amrex::BoxArray | |
simplified_list() const | amrex::BoxArray | |
size() const noexcept | amrex::BoxArray | inline |
surroundingNodes() | amrex::BoxArray | |
surroundingNodes(int dir) | amrex::BoxArray | |
transformer() const | amrex::BoxArray | |
type_update() | amrex::BoxArray | private |
uniqify() | amrex::BoxArray | |
writeOn(std::ostream &) const | amrex::BoxArray | |
~BoxArray() noexcept=default | amrex::BoxArray |