Go to the documentation of this file.
59 leaves[leaves.
size()-1]->coordinates();
80 if( (cc >=
range[procI].first()) && (cc <=
range[procI].second()) )
93 Info <<
"Time for updating communication pattern "
List< Pair< meshOctreeCubeCoordinates > > neiRange_
List< Key > toc() const
Return the table of contents.
#define forAll(list, i)
Loop across all elements in list.
static void scatterList(const List< commsStruct > &comms, List< T > &Values, const int tag, const label comm)
Scatter data. Reverse of gatherList.
void findCoordinatesOfMissingCubes(LongList< meshOctreeCubeCoordinates > &coordinates) const
find coordinates of cubes which are located on other processors
static label nProcs(const label communicator=0)
Number of processes in parallel run.
Ostream & endl(Ostream &os)
Add newline and flush stream.
label size() const
Size of the active part of the list.
LongList< meshOctreeCube * > leaves_
list of cubes which are leaves of the octree
void updateCommunicationPattern()
static int myProcNo(const label communicator=0)
Number of this process (starting from masterNo() = 0)
static void gatherList(const List< commsStruct > &comms, List< T > &Values, const int tag, const label comm)
Gather data but keep individual values separate.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
bool insert(const Key &key)
Insert a new entry.
meshOctreeCube * initialCubePtr_
Root cube of the octree structure.
void size(const label)
Override size to be inconsistent with allocated storage.
meshOctree & octree_
Reference to the octree.