Instruction to split.
An instruction to split always holds the number of splits that we should fork off, and it also contains an instruction how we want the tree to split the data off. We can either do the bottom up scheme, where we try to find exactly the right number of fine grid cells on the finest level and then assign refined cells to remote trees where it is a fit. The realisation of these splitting variants is discussed in peano4::grid::Spacetree::isCellBottomUpSplitCandidate(), grid::Spacetree::isCellTopDownSplitCandidate() and peano4::grid::Spacetree::splitOrJoinCell(). The underlying algorithmic considerations are documented in the domain decomposition overview.
I have no constructor for this struct, but you can easily create one via
using the brace initialisation of C++.
Definition at line 34 of file grid.h.