42 #ifndef marchingCells_H 43 #define marchingCells_H
void size(const label n)
Older name for setAddressableSize.
A list of keyword definitions, which are a keyword followed by a number of values (eg...
labelList addedCells_
Which are the added cells.
FaceCellWave< wallPointData< bool > > meshWave_
Engine propagating the active cells.
Wave propagation of information through grid. Every iteration information goes through one layer of c...
label marchingStep_
Marching step.
void setMarchingStep(const label step)
Set marching step.
labelHashSet seedPatches_
Patches used as seeds in the marching algorithm.
DynamicList< label > activeCells_
Which are the active cells.
labelList seedFaceZoneIDs_
Face zones used as seeds in the marching algorithm.
const labelList & getActiveCells() const
Get the active cells.
void addFixedCells(const cellZoneMesh &cellZoneMesh, const labelList &fixedCellZoneIDs)
Add fixed cells through cellZone IDs.
List< wallPointData< bool > > allCellInfo_
Information for all cells.
void update(const label iters=1)
Update active cells.
boolList isActiveCell_
Whether each cell is curently active or not.
label numberOfAddedCells() const
Number of newly added cells in the last iteration.
bool initialised_
Has the initial seeding been conducted.
List< wallPointData< bool > > allFaceInfo_
Information for all faces.
virtual ~marchingCells()=default
Destructor.
void appendSeedCell(const label cellID)
Append cell to seed cells.
label nIters_
Iterations conducted thus far.
Mesh data needed to do the Finite Volume discretisation.
loopControl iters(runTime, aMesh.solutionDict(), "solution")
void initialise()
Initialise the active cells from the seeding patches.
TypeName("marchingCells")
Runtime type information.
void march(label nVisited, const label cI, labelList &newlyAddedCells)
List< label > labelList
A List of labels.
boolList isFixedCell_
Should this cell remain incative.
ZoneMesh< cellZone, polyMesh > cellZoneMesh
A ZoneMesh with the type cellZone.
labelList seedCellZoneIDs_
Cell zones, the boundary faces of which are used as seeds in the marching algorithm.