Go to the documentation of this file.
82 return octree_.findCubeForPosition(cc);
91 containedLeaves.
clear();
92 octree_.findLeavesContainedInBox(bb, containedLeaves);
meshOctreeCube * findCubeForPosition(const meshOctreeCubeCoordinates &) const
return the pointer to the meshOctreeCube at the given position
scalar & searchRangeAccess()
return search range
List< Pair< meshOctreeCubeCoordinates > > neiRange_
boundBox & rootBoxAccess()
return rootBox
List< meshOctreeSlot > dataSlots_
List of slots containing data generated by each processor.
List< meshOctreeSlot > & dataSlotsAccess()
return octree slots
void findLeavesContainedInBox(const boundBox &, DynList< const meshOctreeCube *, 256 > &) const
find leaves contained in a given boundBox
labelList & neiProcsAccess()
return neighbour processors
bool & isRootInitialisedAccess()
return isRootInitialised_
LongList< meshOctreeCube * > leaves_
list of cubes which are leaves of the octree
const meshOctree & octree() const
return octree
meshOctreeCube & initialCubeAccess()
return initial cube
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
A bounding box defined in terms of the points at its extremities.
meshOctreeCube * initialCubePtr_
Root cube of the octree structure.
List< Pair< meshOctreeCubeCoordinates > > & neiRangeAccess()
return the range of leaves at each processor
scalar searchRange_
octree search range
void findLeaves(LongList< meshOctreeCube * > &leaves) const
find leaves for a given cube
void clear()
Clear the list, i.e. set next free to zero.
void createListOfLeaves()
create leaves
LongList< meshOctreeCube * > & leavesAccess()
return leaves
meshOctree & octree_
Reference to the octree.