Go to the documentation of this file.
43 Info <<
"Creating new edgesPtr_" <<
endl;
57 const edge&
e = edges[eI];
58 const label start =
e.start();
63 if( (newStartLabel != -1) && (newEndLabel != -1) )
66 cEdges.
append(
edge(newStartLabel, newEndLabel));
78 const point newP = (1.0 - t) * pts[start] + t * pts[end];
91 const point newP = (1.0 - t) * pts[end] + t * pts[start];
98 Info <<
nl <<
"Edge " << eI <<
"consisting of " <<
e
99 <<
" has been replaced with edge " <<
newEdgeLabel_[eI] <<
" "
104 Info <<
"Edge " <<
e <<
" has been deleted!" <<
endl;
110 Info <<
"Found " << cEdges.
size() <<
" new edges" <<
endl;
DynList< direction, 64 > vertexTypes_
#define forAll(list, i)
Loop across all elements in list.
Template functions to aid in the implementation of demand driven data.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
DynList< edge, 128 > * edgesPtr_
Ostream & endl(Ostream &os)
Add newline and flush stream.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
DynList< label, 128 > newEdgeLabel_
const double e
Elementary charge.
DynList< edge, 128 > * cEdgesPtr_
DynList< point, 64 > * cPtsPtr_
helper data
void setSize(const label)
Reset size of List.
DynList< point, 64 > * pointsPtr_
DynList< label, 64 > newVertexLabel_
DynList< scalar, 64 > vertexDistance_
void append(const T &e)
Append an element at the end of the list.