src/mesh/cfMesh/meshLibrary/utilities/octrees/meshOctree/meshOctreeI.H

   1 /*---------------------------------------------------------------------------*\
   2   =========                 |
   3   \\      /  F ield         | cfMesh: A library for mesh generation
   4    \\    /   O peration     |
   5     \\  /    A nd           | Author: Franjo Juretic (franjo.juretic@c-fields.com)
   6      \\/     M anipulation  | Copyright (C) Creative Fields, Ltd.
   7 -------------------------------------------------------------------------------
   8 License
   9     This file is part of cfMesh.
  10
  11     cfMesh 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 3 of the License, or (at your
  14     option) any later version.
  15
  16     cfMesh 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 cfMesh.  If not, see <http://www.gnu.org/licenses/>.
  23
  24 Description
  25
  26
  27 \*---------------------------------------------------------------------------*/
  28
  29 #include "meshOctree.H"
  30
  31 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
  32
  33 namespace Foam
  34 {
  35
  36 inline bool meshOctree::isQuadtree() const
  37 {
  38     return isQuadtree_;
  39 }
  40
  41 //- return octant vectors
  42 inline const FixedList<Vector<label>, 8>& meshOctree::octantVectors() const
  43 {
  44     return octantVectors_;
  45 }
  46
  47 //- return leaves of the octree
  48 inline label meshOctree::numberOfLeaves() const
  49 {
  50     if( leaves_.size() == 0 )
  51         FatalErrorIn
  52         (
  53             "inline const label& meshOctree::numberOfLeaves() const"
  54         ) << "Leaves are not yet created!!" << exit(FatalError);
  55
  56     return leaves_.size();
  57 }
  58
  59 inline const meshOctreeCubeBasic& meshOctree::returnLeaf
  60 (
  61     const label leafI
  62 ) const
  63 {
  64     return *leaves_[leafI];
  65 }
  66
  67 inline short meshOctree::leafAtProc(const label leafI) const
  68 {
  69     return leaves_[leafI]->procNo();
  70 }
  71
  72 inline bool meshOctree::hasContainedTriangles(const label leafI) const
  73 {
  74     if( leaves_[leafI]->hasContainedElements() )
  75         return true;
  76
  77     return false;
  78 }
  79
  80 inline void meshOctree::containedTriangles
  81 (
  82     const label leafI,
  83     DynList<label>& triangles
  84 ) const
  85 {
  86     triangles.clear();
  87
  88     if( !leaves_[leafI]->hasContainedElements() )
  89     {
  90         triangles.clear();
  91         return;
  92     }
  93
  94     const VRWGraph& containedTriangles =
  95         leaves_[leafI]->slotPtr()->containedTriangles_;
  96     constRow elmts = containedTriangles[leaves_[leafI]->containedElements()];
  97     forAll(elmts, elI)
  98         triangles.append(elmts[elI]);
  99 }
 100
 101 inline bool meshOctree::hasContainedEdges(const label leafI) const
 102 {
 103     if( leaves_[leafI]->hasContainedEdges() )
 104         return true;
 105
 106     return false;
 107 }
 108
 109 inline void meshOctree::containedEdges
 110 (
 111     const label leafI,
 112     DynList<label>& edges
 113 ) const
 114 {
 115     edges.clear();
 116
 117     if( !leaves_[leafI]->hasContainedEdges() )
 118     {
 119         edges.clear();
 120         return;
 121     }
 122
 123     const VRWGraph& containedEdges =
 124         leaves_[leafI]->slotPtr()->containedEdges_;
 125     constRow elmts = containedEdges[leaves_[leafI]->containedEdges()];
 126     forAll(elmts, eI)
 127         edges.append(elmts[eI]);
 128 }
 129
 130 inline const triSurf& meshOctree::surface() const
 131 {
 132     return surface_;
 133 }
 134
 135 inline const boundBox& meshOctree::rootBox() const
 136 {
 137     return rootBox_;
 138 }
 139
 140 inline const FixedList<meshOctreeCubeCoordinates, 26>&
 141 meshOctree::regularityPositions() const
 142 {
 143     return regularityPositions_;
 144 }
 145
 146 inline const FixedList<FixedList<meshOctreeCubeCoordinates, 8>, 8>&
 147 meshOctree::positionsOfLeavesAtNodes() const
 148 {
 149     return vrtLeavesPos_;
 150 }
 151
 152 inline const labelList& meshOctree::neiProcs() const
 153 {
 154     return neiProcs_;
 155 }
 156
 157 inline label meshOctree::findNeighbourOverNode
 158 (
 159     const label leafI,
 160     const label nodeI
 161 ) const
 162 {
 163     return findNeighbourOverNode(leaves_[leafI]->coordinates(), nodeI);
 164 }
 165
 166 inline void meshOctree::findNeighboursOverEdge
 167 (
 168     const label leafI,
 169     const label eI,
 170     DynList<label>& neighbourLeaves
 171 ) const
 172 {
 173     findNeighboursOverEdge(leaves_[leafI]->coordinates(), eI, neighbourLeaves);
 174 }
 175
 176 inline void meshOctree::findNeighboursInDirection
 177 (
 178     const label leafI,
 179     const label dir,
 180     DynList<label>& neiLeaves
 181 ) const
 182 {
 183     findNeighboursInDirection(leaves_[leafI]->coordinates(), dir, neiLeaves);
 184 }
 185
 186 inline void meshOctree::findNeighboursForLeaf
 187 (
 188     const label leafI,
 189     DynList<label>& neighbourLeaves
 190 ) const
 191 {
 192     findNeighboursForLeaf(leaves_[leafI]->coordinates(), neighbourLeaves);
 193 }
 194
 195 inline void meshOctree::findAllLeafNeighbours
 196 (
 197     const label leafI,
 198     DynList<label>& neighbourLeaves
 199 ) const
 200 {
 201     findAllLeafNeighbours(leaves_[leafI]->coordinates(), neighbourLeaves);
 202 }
 203
 204 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 205
 206 } // End namespace Foam
 207
 208 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //