Commit 582dac29 authored by Franjo's avatar Franjo

Changes to the updates of the DynList

parent 250fe370
...@@ -55,8 +55,10 @@ void decomposeCells::findAddressingForCell ...@@ -55,8 +55,10 @@ void decomposeCells::findAddressingForCell
const faceListPMG& faces = mesh_.faces(); const faceListPMG& faces = mesh_.faces();
forAll(faceEdges, feI) forAll(faceEdges, feI)
{ {
faceEdges[feI].setSize(faces[c[feI]].size()); DynList<label, 8>& fEdges = faceEdges[feI];
faceEdges[feI] = -1;
fEdges.setSize(faces[c[feI]].size());
fEdges = -1;
} }
forAll(c, fI) forAll(c, fI)
......
...@@ -214,12 +214,7 @@ void meshUntangler::cutRegion::planeCut(const plane& plane) ...@@ -214,12 +214,7 @@ void meshUntangler::cutRegion::planeCut(const plane& plane)
"testSmoothing" "testSmoothing"
); );
objectRegistry oR(runTime); polyMeshGen pmg(runTime);
polyMeshGen pmg
(
oR
);
this->createPolyMeshFromRegion(pmg); this->createPolyMeshFromRegion(pmg);
# endif # endif
...@@ -272,7 +267,8 @@ void meshUntangler::cutRegion::createPolyMeshFromRegion ...@@ -272,7 +267,8 @@ void meshUntangler::cutRegion::createPolyMeshFromRegion
fEdges.append(edges[f[eI]]); fEdges.append(edges[f[eI]]);
Info << "Edges forming face " << fI << " are " << fEdges << endl; Info << "Edges forming face " << fI << " are " << fEdges << endl;
labelListList sf = sortEdgesIntoChains(fEdges).sortedChains(); sortEdgesIntoChains sorter(fEdges);
const DynList<labelList>& sf = sorter.sortedChains();
if( sf.size() != 1 ) if( sf.size() != 1 )
FatalErrorIn FatalErrorIn
( (
......
...@@ -56,16 +56,14 @@ void meshUntangler::cutRegion::tieBreak(const DynList<label, 8>& f) ...@@ -56,16 +56,14 @@ void meshUntangler::cutRegion::tieBreak(const DynList<label, 8>& f)
deleteDemandDrivenData(cEdgesPtr_); deleteDemandDrivenData(cEdgesPtr_);
deleteDemandDrivenData(cFacesPtr_); deleteDemandDrivenData(cFacesPtr_);
//- remove coincident vertices
//removeCoincidentVertices();
const DynList<edge, 128>& edges = *edgesPtr_; const DynList<edge, 128>& edges = *edgesPtr_;
DynList<edge> faceEdges; DynList<edge> faceEdges;
forAll(f, eI) forAll(f, eI)
faceEdges.append(edges[f[eI]]); faceEdges.append(edges[f[eI]]);
labelListList fvertices = sortEdgesIntoChains(faceEdges).sortedChains(); sortEdgesIntoChains sorter(faceEdges);
const DynList<labelList>& fvertices = sorter.sortedChains();
if( fvertices.size() != 1 ) if( fvertices.size() != 1 )
{ {
valid_ = false; valid_ = false;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment