44 if (procNeighbours_.
empty() && !procPatchMap_.
empty())
47 procNeighbours_ = procPatchMap_.
sortedToc();
50 return procNeighbours_;
110 = procPatchMap_.sortedToc();
116 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)
processorTopology()
Default construct (empty)
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 void allGatherList(List< T > &values, const int tag=UPstream::msgType(), const label comm=UPstream::worldComm)
Gather data, but keep individual values separate. Uses linear/tree communication. ...
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.
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.