Go to the documentation of this file.
49 template<
class graphType>
class graphRow;
50 template<
class graphType>
57 template<
class graphType>
114 template<
class listType>
120 friend Ostream& operator<< <graphType>
void checkIndex(const label i) const
check index
void appendIfNotIn(const label)
Append an element to the given row if it does not exist there.
graphType & data_
reference to the graph
void append(const label)
Append an element to the given row.
const label rowI_
row number
void setSize(const label size)
Reset the number of rows.
const typedef graphRow< const VRWGraph > constRow
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
label size() const
Returns the number of rows.
void clear()
Clear the graph.
Ostream & operator<<(Ostream &, const edgeMesh &)
label operator[](const label) const
set and get operators
const double e
Elementary charge.
graphRow(graphType &, const label)
Construct from graph and row number.
This class is an implementation of a graph with variable column width. The imoplementation is memory ...
label containsAtPosition(const label e) const
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
bool contains(const label e) const
check if the element is in the given row (takes linear time)
void operator=(const graphRow< graphType > &)
Assignment operator.