primitiveMeshCellPoints.C
Go to the documentation of this file.
1 /*---------------------------------------------------------------------------*\
2  ========= |
3  \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
4  \\ / O peration | Website: https://openfoam.org
5  \\ / A nd | Copyright (C) 2011-2018 OpenFOAM Foundation
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
13  the Free Software Foundation, either version 3 of the License, or
14  (at your 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, see <http://www.gnu.org/licenses/>.
23 
24 \*---------------------------------------------------------------------------*/
25 
26 #include "primitiveMesh.H"
27 #include "ListOps.H"
28 
29 // * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
30 
32 {
33  if (!cpPtr_)
34  {
35  if (debug)
36  {
37  Pout<< "primitiveMesh::cellPoints() : "
38  << "calculating cellPoints" << endl;
39 
40  if (debug == -1)
41  {
42  // For checking calls:abort so we can quickly hunt down
43  // origin of call
45  << abort(FatalError);
46  }
47  }
48 
49  // Invert pointCells
50  cpPtr_ = new labelListList(nCells());
51  invertManyToMany(nCells(), pointCells(), *cpPtr_);
52  }
53 
54  return *cpPtr_;
55 }
56 
57 
59 (
60  const label celli,
61  DynamicList<label>& storage
62 ) const
63 {
64  if (hasCellPoints())
65  {
66  return cellPoints()[celli];
67  }
68  else
69  {
70  const faceList& fcs = faces();
71  const labelList& cFaces = cells()[celli];
72 
73  labelSet_.clear();
74 
75  forAll(cFaces, i)
76  {
77  const labelList& f = fcs[cFaces[i]];
78 
79  forAll(f, fp)
80  {
81  labelSet_.insert(f[fp]);
82  }
83  }
84 
85  storage.clear();
86  if (labelSet_.size() > storage.capacity())
87  {
88  storage.setCapacity(labelSet_.size());
89  }
90 
91  forAllConstIter(labelHashSet, labelSet_, iter)
92  {
93  storage.append(iter.key());
94  }
95 
96  return storage;
97  }
98 }
99 
100 
102 {
103  return cellPoints(celli, labels_);
104 }
105 
106 
107 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
108 
109 // ************************************************************************* //
List< labelList > labelListList
A List of labelList.
Definition: labelList.H:57
#define forAll(list, i)
Loop across all elements in list.
Definition: UList.H:434
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Definition: label.H:59
bool hasCellPoints() const
error FatalError
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
Definition: error.H:319
label nCells() const
Ostream & endl(Ostream &os)
Add newline and flush stream.
Definition: Ostream.H:256
const cellList & cells() const
bool insert(const Key &key)
Insert a new entry.
Definition: HashSet.H:108
label size() const
Return number of elements in table.
Definition: HashTableI.H:65
Various functions to operate on Lists.
void clear()
Clear all entries from table.
Definition: HashTable.C:468
void setCapacity(const label)
Alter the size of the underlying storage.
Definition: DynamicListI.H:130
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
Definition: DynamicListI.H:296
forAllConstIter(PtrDictionary< phaseModel >, mixture.phases(), phase)
Definition: pEqn.H:29
errorManip< error > abort(error &err)
Definition: errorManip.H:131
const labelListList & pointCells() const
labelList f(nPoints)
prefixOSstream Pout(cout, "Pout")
Definition: IOstreams.H:53
virtual const faceList & faces() const =0
Return faces.
void invertManyToMany(const label len, const UList< InList > &, List< OutList > &)
Invert many-to-many.
label capacity() const
Size of the underlying storage.
Definition: DynamicListI.H:121
void clear()
Clear the addressed list, i.e. set the size to zero.
Definition: DynamicListI.H:236
const labelListList & cellPoints() const