43 if (procNeighbours_.
empty() && !procPatchMap_.
empty())
46 procNeighbours_ = procPatchMap_.
sortedToc();
49 return procNeighbours_;
109 = procPatchMap_.sortedToc();
115 return procAdjacencyTable_;
void resize(const label len)
Adjust allocated size of list.
bool empty() const noexcept
True if List is empty (ie, size() is zero)
static bool & parRun() noexcept
Test if this a parallel run.
static int & msgType() noexcept
Message tag of standard messages.
static int myProcNo(const label communicator=worldComm)
Rank of this process in the communicator (starting from masterNo()). Can be negative if the process i...
static label nProcs(const label communicator=worldComm)
Number of ranks in parallel run (for given communicator). It is 1 for serial run. ...
const labelListList & procAdjacency() const
The complete processor to processor connection adjacency table. Globally synchronized information...
bool empty() const noexcept
True if the hash table is empty.
processorTopology() noexcept
Default construct (empty)
static void allGatherList(UList< T > &values, const int tag=UPstream::msgType(), const label comm=UPstream::worldComm)
Gather data, but keep individual values separate. Uses MPI_Allgather or manual linear/tree communicat...
const labelList & procNeighbours() const
The neighbour processor connections (ascending order) associated with the local rank.
List< Key > sortedToc() const
The table of contents (the keys) in sorted order.
Inter-processor communications stream.