49 label oldCellI = refCell.
cellNo();
51 label newCellI = map[oldCellI];
76 iter != cellPairs.
end();
80 label newMaster = map[iter.key()];
86 newSlave = map[iter()];
89 if ((newMaster != iter.key()) || (newSlave != iter()))
105 iter != cellPairs.
end();
109 label newMaster = map[iter.key()];
115 newSlave = map[iter()];
122 "edgeVertex::updateLabels(const labelList&, "
124 ) <<
"master cell:" << iter.key()
125 <<
" has disappeared" <<
endl;
129 newCellPairs.insert(newMaster, newSlave);
133 cellPairs = newCellPairs;
147 bool changed =
false;
156 label newCellI = map[iter.key()];
158 if (newCellI != iter.key())
178 label newCellI = map[iter.key()];
182 newCells.insert(newCellI);
202 if (isEdge(mesh, cut))
204 const edge&
e = mesh.
edges()[getEdge(mesh, cut)];
206 return weight*pts[e.
end()] + (1-weight)*pts[e.
start()];
210 return pts[getVertex(mesh, cut)];
222 if (!isEdge(mesh, cut0) && !isEdge(mesh, cut1))
227 getVertex(mesh, cut0),
228 getVertex(mesh, cut1)
247 label edgeI = getEdge(cut);
251 os <<
"edge:" << edgeI << e <<
' ' << coord(cut, weight);
255 label vertI = getVertex(cut);
257 os <<
"vertex:" << vertI <<
' ' << coord(cut, weight);
276 writeCut(os, cuts[cutI], weights[cutI]);