INTERNAL ONLY. More...
#include <graph_communicator.hpp>
Public Member Functions | |
comm_edge_iterator () | |
comm_edge_iterator (int nedges) | |
Constructor for a past-the-end iterator. More... | |
comm_edge_iterator (shared_array< int > indices, shared_array< int > edges) | |
Protected Member Functions | |
const std::pair< int, int > & | dereference () const |
bool | equal (const comm_edge_iterator &other) const |
void | increment () |
Protected Attributes | |
shared_array< int > | indices |
shared_array< int > | edges |
int | edge_index |
std::pair< int, int > | edge |
Friends | |
class | boost::iterator_core_access |
INTERNAL ONLY.
The iterator used to access the edges in a communicator's graph topology.
|
inline |
|
inline |
Constructor for a past-the-end iterator.
|
inline |
|
inlineprotected |
References edge, edge_index, edges, and indices.
|
inlineprotected |
References edge_index.
|
inlineprotected |
References edge_index.
|
friend |
|
mutableprotected |
Referenced by dereference().
|
protected |
Referenced by dereference(), equal(), and increment().
|
protected |
Referenced by dereference().
|
protected |
Referenced by dereference().