![]() |
Shamrock 2025.10.0
Astrophysical Code
|
Public Member Functions | |
| bool | is_id_leaf (u32 id) const |
| is the given id a leaf (Note that if there is no internal cell every node is a leaf) | |
| template<class Functor_iter > | |
| void | for_each_in_cell (const u32 &cell_id, Functor_iter &&func_it) const |
| Iterate over all particles in a given cell. | |
Public Attributes | |
| const u32 * | sort_index_map |
| Pointer to the sort index map. | |
| const u32 * | reduc_index_map |
| Pointer to the reduction index map. | |
| const u32 * | endrange |
| Id of the other end of the index range corresponding to the cell. | |
| u32 | offset_leaf |
| number of internal cells & offset to retrieve the first leaf | |
Definition at line 26 of file CellIterator.hpp.
|
inline |
Iterate over all particles in a given cell.
| [in] | cell_id | ID of the cell to iterate over. |
| [in] | func_it | function to call for each particle in the cell. |
This function takes a cell ID and a functor as argument. It will then iterate over all particles in the given cell and call the functor with each particle's index as argument.
Definition at line 46 of file CellIterator.hpp.
Here is the call graph for this function:
|
inline |
is the given id a leaf (Note that if there is no internal cell every node is a leaf)
Definition at line 33 of file CellIterator.hpp.
| const u32* shamtree::CellIteratorAccessed::endrange |
Id of the other end of the index range corresponding to the cell.
Definition at line 29 of file CellIterator.hpp.
| u32 shamtree::CellIteratorAccessed::offset_leaf |
number of internal cells & offset to retrieve the first leaf
Definition at line 30 of file CellIterator.hpp.
| const u32* shamtree::CellIteratorAccessed::reduc_index_map |
Pointer to the reduction index map.
Definition at line 28 of file CellIterator.hpp.
| const u32* shamtree::CellIteratorAccessed::sort_index_map |
Pointer to the sort index map.
Definition at line 27 of file CellIterator.hpp.