src/dynamicMesh/slidingInterface/enrichedPatch/enrichedPatchPointPoints.C

   1 /*---------------------------------------------------------------------------*\
   2   =========                 |
   3   \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   4    \\    /   O peration     |
   5     \\  /    A nd           | Copyright (C) 1991-2009 OpenCFD Ltd.
   6      \\/     M anipulation  |
   7 -------------------------------------------------------------------------------
   8 License
   9     This file is part of OpenFOAM.
  10
  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.
  15
  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.
  20
  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
  24
  25 Description
  26
  27 \*---------------------------------------------------------------------------*/
  28
  29 #include "enrichedPatch.H"
  30 #include "primitiveMesh.H"
  31 #include "DynamicList.H"
  32
  33 // * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
  34
  35
  36 // * * * * * * * * * * * * * Private Member Functions  * * * * * * * * * * * //
  37
  38 void Foam::enrichedPatch::calcPointPoints() const
  39 {
  40     // Calculate point-point addressing
  41     if (pointPointsPtr_)
  42     {
  43         FatalErrorIn("void enrichedPatch::calcPointPoints() const")
  44             << "Point-point addressing already calculated."
  45             << abort(FatalError);
  46     }
  47
  48     // Algorithm:
  49     // Go through all faces and add the previous and next point as the
  50     // neighbour for each point. While inserting points, reject the
  51     // duplicates (as every internal edge will be visited twice).
  52     List<DynamicList<label, primitiveMesh::edgesPerPoint_> >
  53         pp(meshPoints().size());
  54
  55     const faceList& lf = localFaces();
  56
  57     register bool found = false;
  58
  59     forAll (lf, faceI)
  60     {
  61         const face& curFace = lf[faceI];
  62
  63         forAll (curFace, pointI)
  64         {
  65             DynamicList<label, primitiveMesh::edgesPerPoint_>&
  66                 curPp = pp[curFace[pointI]];
  67
  68             // Do next label
  69             label next = curFace.nextLabel(pointI);
  70
  71             found = false;
  72
  73             forAll (curPp, i)
  74             {
  75                 if (curPp[i] == next)
  76                 {
  77                     found = true;
  78                     break;
  79                 }
  80             }
  81
  82             if (!found)
  83             {
  84                 curPp.append(next);
  85             }
  86
  87             // Do previous label
  88             label prev = curFace.prevLabel(pointI);
  89             found = false;
  90
  91             forAll (curPp, i)
  92             {
  93                 if (curPp[i] == prev)
  94                 {
  95                     found = true;
  96                     break;
  97                 }
  98             }
  99
 100             if (!found)
 101             {
 102                 curPp.append(prev);
 103             }
 104         }
 105     }
 106
 107     // Re-pack the list
 108     pointPointsPtr_ = new labelListList(pp.size());
 109     labelListList& ppAddr = *pointPointsPtr_;
 110
 111     forAll (pp, pointI)
 112     {
 113         ppAddr[pointI].transfer(pp[pointI]);
 114     }
 115 }
 116
 117
 118 // ************************************************************************* //