| addToDerefineList(morton< N > key) | Tree< N, value > | |
| addToList(morton< N > key) | Tree< N, value > | |
| ancestorcoords | Tree< N, value > | protected |
| ancestorkey | Tree< N, value > | protected |
| ancestorlength | Tree< N, value > | protected |
| assignProcs(vector< uint > &Nbrs, uint myrank) | FullTree< N, value > | |
| begin() | FullTree< N, value > | virtual |
| boundarylist | Tree< N, value > | |
| centroid(morton< N > key, real *xyz) | Tree< N, value > | |
| centroidFixedLevel(morton< N > key, const uint mylevel, real *xyz) | Tree< N, value > | |
| clearMesh() | Tree< N, value > | |
| clearMortonSTL() | Tree< N, value > | |
| clearRefineList() | Tree< N, value > | |
| construct(real *length, real *coords, uint nx, uint ny, uint nz) | Tree< N, value > | |
| constructHigherLevelNbrs(const morton< N > &key, const uint &keylevel, const uint &direction, morton< N > *nbr) | Tree< N, value > | |
| constructNonlocalHigherLevelNbrs(const morton< N > &key, const uint &keylevel, const uint &direction, morton< N > *nbr) | Tree< N, value > | |
| convertCoordToMorton(real *xyz, morton< N > &key) | FullTree< N, value > | virtual |
| convertStl2Morton(uint geom_size, real *geom_xyz) | Tree< N, value > | |
| count(morton< N > key) | Tree< N, value > | |
| Dbegin() | Tree< N, value > | |
| Dend() | Tree< N, value > | |
| derefine(morton< N > key) | Tree< N, value > | |
| derefineDerefineList(uint nlevel) | Tree< N, value > | |
| derefineDerefineList() | Tree< N, value > | |
| derefinelist | FullTree< N, value > | private |
| enclosingBox(morton< N > key, real *X) | Tree< N, value > | |
| enclosingBoxFixedLevel(morton< N > key, uint mylevel, real *X) | Tree< N, value > | |
| end() | FullTree< N, value > | virtual |
| extractBoundary() | Tree< N, value > | |
| extractBoundaryP(uint istart, uint iend) | Tree< N, value > | |
| find(morton< N > key) | FullTree< N, value > | virtual |
| findFlipLevel(morton< WSIZE > key, uint fixedlevel, uint *changedirectionlevel, uint *direction) | FullTree< N, value > | |
| Tree::findFlipLevel(morton< N > key, uint *mylevel, uint *changedirectionlevel, uint *direction) | Tree< N, value > | |
| findInDerefine(morton< N > key) | Tree< N, value > | |
| findInList(morton< N > key) | Tree< N, value > | |
| fixedlevel | FullTree< N, value > | private |
| flipForNbr(morton< WSIZE > *key, uint fixedlevel, uint *changedirectionlevel, uint *direction) | FullTree< N, value > | |
| Tree::flipForNbr(morton< N > *key, uint *mylevel, uint *changedirectionlevel, uint *direction) | Tree< N, value > | |
| flipRefineElemTag(typename std::unordered_map< morton< N >, int >::iterator it) | Tree< N, value > | |
| fourToOne() | Tree< N, value > | |
| fourToOneP(uint istart, uint iend) | Tree< N, value > | |
| FullTree(real *length, real *coords) | FullTree< N, value > | inline |
| getDirections(morton< N > &key, vector< uint > &directions) | Tree< N, value > | |
| getKey(uint i, morton< N > &key) | Tree< N, value > | |
| getLevel() | FullTree< N, value > | |
| insertKey(morton< N > key) | FullTree< N, value > | |
| insertNbrs(vector< int > &Nbrs) | Tree< N, value > | |
| insertSeed(morton< N > &key) | Tree< N, value > | |
| isBoundary(uint &direction, uint myrank) | FullTree< N, value > | |
| Tree::isBoundary(morton< N > &key) | Tree< N, value > | |
| Tree::isBoundary(const morton< N > &key, uint direction) | Tree< N, value > | |
| isInMeshList(const morton< N > &key) | Tree< N, value > | |
| isInRefineList(const morton< N > &key) | Tree< N, value > | |
| isInsideSolid(const morton< N > key, const real *geom_xyz, uint n) | Tree< N, value > | |
| IsInVectorList(morton< N > key) | Tree< N, value > | |
| level(morton< N > key, uint *level) | FullTree< N, value > | virtual |
| mesh | FullTree< N, value > | private |
| mortonSTL | FullTree< N, value > | private |
| mortonSTLclear() | Tree< N, value > | |
| nbrsConstrcut(vector< uint > &Nbrs, uint myrank) | FullTree< N, value > | |
| npx | Tree< N, value > | protected |
| npy | Tree< N, value > | protected |
| npz | Tree< N, value > | protected |
| printMesh() | Tree< N, value > | |
| pushToDerefinelist(uint nlevel) | Tree< N, value > | |
| pushToRefinelist(uint level) | Tree< N, value > | |
| Rbegin() | Tree< N, value > | |
| readDerefineList(typename std::unordered_map< morton< N >, int >::iterator it) | Tree< N, value > | |
| readRefineList(typename std::unordered_map< morton< N >, int >::iterator it) | Tree< N, value > | |
| refine(morton< N > key) | Tree< N, value > | |
| refinelist | FullTree< N, value > | private |
| refinelistReset() | Tree< N, value > | |
| refineListSize() | Tree< N, value > | |
| refineRefineList() | Tree< N, value > | |
| refineRefineList(bitvector< N > &V) | Tree< N, value > | |
| refineRefineList(uint istart, uint iend) | Tree< N, value > | |
| removeFromDerefineList(typename std::unordered_map< morton< N >, int >::iterator it) | Tree< N, value > | |
| Rend() | Tree< N, value > | |
| reserve(uint *reservedsize) | Tree< N, value > | |
| retainFourToOne() | Tree< N, value > | |
| setLevel(const uint &l) | FullTree< N, value > | |
| siblings(morton< N > key, uint mylevel, morton< N > *sibkey) | Tree< N, value > | |
| size() | FullTree< N, value > | virtual |
| Tree(real *length, real *coords, uint nx, uint ny, uint nz) | Tree< N, value > | |
| Tree(real *length, real *coords) | Tree< N, value > | |
| Tree() | Tree< N, value > | inline |
| ~FullTree() | FullTree< N, value > | inline |
| ~Tree() | Tree< N, value > | |
1.8.14