#include <AMReX_CArena.H>
◆ NodeTreeWithSize()
| amrex::CArena::NodeTreeWithSize::NodeTreeWithSize |
( |
| ) |
|
|
inline |
◆ extractNode()
| Node amrex::CArena::NodeTreeWithSize::extractNode |
( |
int | idx | ) |
|
|
inline |
◆ find()
| int amrex::CArena::NodeTreeWithSize::find |
( |
const Node & | node | ) |
const |
|
inlinenodiscard |
◆ findPredecessor()
| int amrex::CArena::NodeTreeWithSize::findPredecessor |
( |
const Node & | node | ) |
const |
|
inlinenodiscard |
◆ findSuccessor()
| int amrex::CArena::NodeTreeWithSize::findSuccessor |
( |
const Node & | node | ) |
const |
|
inlinenodiscard |
◆ getFirstFit()
| int amrex::CArena::NodeTreeWithSize::getFirstFit |
( |
std::size_t | size | ) |
const |
|
inlinenodiscard |
◆ getLargestFreeBlock()
| std::size_t amrex::CArena::NodeTreeWithSize::getLargestFreeBlock |
( |
| ) |
const |
|
inlinenodiscard |
◆ insertNode()
| void amrex::CArena::NodeTreeWithSize::insertNode |
( |
const Node & | node | ) |
|
|
inline |
◆ iterate()
template<class F>
| void amrex::CArena::NodeTreeWithSize::iterate |
( |
const F & | f | ) |
const |
|
inline |
◆ size()
| int amrex::CArena::NodeTreeWithSize::size |
( |
| ) |
const |
|
inlinenodiscard |
◆ viewNode()
| const Node & amrex::CArena::NodeTreeWithSize::viewNode |
( |
int | idx | ) |
const |
|
inlinenodiscard |
The documentation for this class was generated from the following file: