|
| constexpr | HElementCollector ()=default |
| | Default c'tor does nothing. More...
|
| |
| MInt & | elementId (const MInt id) |
| | Accessor for element id. More...
|
| |
| MInt | elementId (const MInt id) const |
| | Accessor for element id (const version). More...
|
| |
| MInt & | hrefSurfaceIds (const MInt id, const MInt dir, const MInt pos) |
| | Accessor for h-refined surface ids. More...
|
| |
| MInt | hrefSurfaceIds (const MInt id, const MInt dir, const MInt pos) const |
| | Accessor for h-refined surface ids (const version). More...
|
| |
| constexpr | Container ()=default |
| | Default c'tor does nothing. More...
|
| |
| constexpr MInt | capacity () const |
| | Return capacity (i.e., maximum number of nodes) More...
|
| |
| void | reset (const MInt capacity) |
| | Reset tree, re-create data structures with given capacity, and set size to zero. More...
|
| |
| void | resize (const MInt capacity) |
| | Resize the container capacity. More...
|
| |
| constexpr MInt | size () const |
| | Return size (i.e., currently used number of nodes) More...
|
| |
| void | size (const MInt size_) |
| | Resize tree WITHOUT CONSIDERING ANY NODE CONSISTENCY! Use at own risk and remove ASAP... More...
|
| |
| void | append (const MInt count) |
| | Append nodes to end of tree. More...
|
| |
| void | append () |
| |
| void | shrink (const MInt count) |
| | Remove nodes from end of tree. More...
|
| |
| void | shrink () |
| |
| void | copy (const T &source, const MInt begin, const MInt end, const MInt to) |
| | Copy nodes to another location without changing any parent/child/neighbor information. More...
|
| |
| void | copy (const T &source, const MInt from, const MInt to) |
| |
| void | copy (const MInt begin, const MInt end, const MInt to) |
| |
| void | copy (const MInt from, const MInt to) |
| |
| void | move (const MInt begin, const MInt end, const MInt to) |
| | Move nodes to another location and update parent/child/neighbor information accordingly. More...
|
| |
| void | move (const MInt from, const MInt to) |
| |
| void | swap (const MInt a, const MInt b) |
| | Swap two nodes and update parent/child/neighbor information accordingly. More...
|
| |
| void | insert (const MInt begin, const MInt count) |
| |
| void | insert (const MInt id) |
| |
| void | erase (const MInt begin, const MInt end) |
| | Erase nodes in range [begin, end) and update parent/child/neighbor information. More...
|
| |
| void | erase (const MInt id) |
| |
| void | removeAndShift (const MInt begin, const MInt end) |
| |
| void | removeAndShift (const MInt id) |
| |
| void | removeAndFill (const MInt begin, const MInt end) |
| |
| void | removeAndFill (const MInt id) |
| |
| void | clear () |
| | Clear tree by invalidating all nodes and setting size to zero. More...
|
| |
| HElementCollector< nDim, SysEqn > & | derived () |
| |
| const HElementCollector< nDim, SysEqn > & | derived () const |
| |
| void | rawCopy (const T &source, const MInt begin, const MInt end, const MInt to) |
| | Copy range of nodes [begin, end) to range starting at 'to'. More...
|
| |
| void | rawCopy (const T &source, const MInt from, const MInt to) |
| |
| void | deleteConnectivity (const MInt NotUsed(begin), const MInt NotUsed(end)) |
| |
| void | moveConnectivity (const MInt NotUsed(begin), const MInt NotUsed(end), const MInt NotUsed(to)) |
| |
| void | moveConnectivity (const MInt from, const MInt to) |
| |
| constexpr MInt | dummy () const |
| |
|
| using | Storage = std::vector< T > |
| |
| virtual void | resize () |
| |
| void | resetStorage (const MInt n, Storage< T > &c) |
| | Create new container with given size and replace original one. More...
|
| |
| void | resizeStorage (const MInt n, Storage< T > &c) |
| | Resize container with given size. More...
|
| |
| void | fill_invalid (Container_ &c, const MInt begin, const MInt end, const MInt solverSize=1, const T value=Invalid< T >::value()) |
| |
| void | copyData (const Container_ &source, Container_ &target, Functor &&f, const MInt begin, const MInt end, const MInt dest, const MInt solverSize=1) |
| | Copy [begin, end) range with given solver size from source to dest position of target. More...
|
| |
| MBool | isValidId (const MInt id) const |
| | Return whether given id refers to a valid node (auxiliary method). More...
|
| |
template<
MInt nDim, class SysEqn>
class maia::dg::collector::HElementCollector< nDim, SysEqn >
Definition at line 62 of file dgcartesianhelementcollector.h.