Fix tutorials: typo in tutorials/viscoelastic/viscoelasticFluidFoam/S-MDCPP/constant...
[OpenFOAM-1.6-ext.git] / src / dynamicMesh / polyMeshModifiers / slidingInterface / enrichedPatch / enrichedPatchPointPoints.C
blobefe479b04a1644c3ae1884bfd220a46761ba4735
1 /*---------------------------------------------------------------------------*\
2   =========                 |
3   \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
4    \\    /   O peration     |
5     \\  /    A nd           | Copyright held by original author
6      \\/     M anipulation  |
7 -------------------------------------------------------------------------------
8 License
9     This file is part of OpenFOAM.
11     OpenFOAM is free software; you can redistribute it and/or modify it
12     under the terms of the GNU General Public License as published by the
13     Free Software Foundation; either version 2 of the License, or (at your
14     option) any later version.
16     OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
17     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
18     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
19     for more details.
21     You should have received a copy of the GNU General Public License
22     along with OpenFOAM; if not, write to the Free Software Foundation,
23     Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
25 Description
26     Enriched patch addressing
28 Author
29     Hrvoje Jasak, Wikki Ltd.  All rights reserved.  Copyright Hrvoje Jasak.
31 \*---------------------------------------------------------------------------*/
33 #include "enrichedPatch.H"
34 #include "primitiveMesh.H"
35 #include "DynamicList.H"
37 // * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
40 // * * * * * * * * * * * * * Private Member Functions  * * * * * * * * * * * //
42 void Foam::enrichedPatch::calcPointPoints() const
44     // Calculate point-point addressing
45     if (pointPointsPtr_)
46     {
47         FatalErrorIn("void enrichedPatch::calcPointPoints() const")
48             << "Point-point addressing already calculated."
49             << abort(FatalError);
50     }
52     // Algorithm:
53     // Go through all faces and add the previous and next point as the
54     // neighbour for each point. While inserting points, reject the
55     // duplicates (as every internal edge will be visited twice).
56     List<DynamicList<label, primitiveMesh::edgesPerPoint_> >
57         pp(meshPoints().size());
59     const faceList& lf = localFaces();
61     register bool found = false;
63     forAll (lf, faceI)
64     {
65         const face& curFace = lf[faceI];
67         forAll (curFace, pointI)
68         {
69             DynamicList<label, primitiveMesh::edgesPerPoint_>&
70                 curPp = pp[curFace[pointI]];
72             // Do next label
73             label next = curFace.nextLabel(pointI);
75             found = false;
77             forAll (curPp, i)
78             {
79                 if (curPp[i] == next)
80                 {
81                     found = true;
82                     break;
83                 }
84             }
86             if (!found)
87             {
88                 curPp.append(next);
89             }
91             // Do previous label
92             label prev = curFace.prevLabel(pointI);
93             found = false;
95             forAll (curPp, i)
96             {
97                 if (curPp[i] == prev)
98                 {
99                     found = true;
100                     break;
101                 }
102             }
104             if (!found)
105             {
106                 curPp.append(prev);
107             }
108         }
109     }
111     // Re-pack the list
112     pointPointsPtr_ = new labelListList(pp.size());
113     labelListList& ppAddr = *pointPointsPtr_;
115     forAll (pp, pointI)
116     {
117         ppAddr[pointI].transfer(pp[pointI].shrink());
118     }
122 // ************************************************************************* //