/usr/include/dune/grid/alugrid/2d/intersection.hh is in libdune-grid-dev 2.2.1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 | #ifndef DUNE_ALU2DGRID_INTERSECTION_HH
#define DUNE_ALU2DGRID_INTERSECTION_HH
// System includes
#include <stack>
#include <utility>
// Dune includes
#include <dune/grid/common/grid.hh>
#include <dune/grid/alugrid/common/intersectioniteratorwrapper.hh>
#include <dune/grid/alugrid/2d/alu2dinclude.hh>
#include <dune/grid/alugrid/2d/entity.hh>
namespace Dune
{
// Forward declarations
template<int cd, int dim, class GridImp>
class ALU2dGridEntity;
template<int cd, PartitionIteratorType pitype, class GridImp >
class ALU2dGridLevelIterator;
template<int cd, class GridImp >
class ALU2dGridEntityPointer;
template<int mydim, int coorddim, class GridImp>
class ALU2dGridGeometry;
template<class GridImp>
class ALU2dGridHierarchicIterator;
template<class GridImp>
class ALU2dGridIntersectionBase;
template<class GridImp>
class ALU2dGridLeafIntersectionIterator;
template<class GridImp>
class ALU2dGridLevelIntersectionIterator;
template<int codim, PartitionIteratorType pitype, class GridImp>
class ALU2dGridLeafIterator;
template< int dim, int dimworld, ALU2DSPACE ElementType eltype >
class ALU2dGrid;
// ALU2DIntersectionGeometryStorage
// --------------------------------
template< class LocalGeometryImpl >
class ALU2DIntersectionGeometryStorage
{
typedef ALU2DIntersectionGeometryStorage< LocalGeometryImpl > ThisType;
// one geometry for each face and twist 0 and 1
LocalGeometryImpl geoms_[ 2 ][ 4 ][ 2 ];
//std::vector< LocalGeometryImpl > geoms_[ 2 ][ 4 ];
private:
ALU2DIntersectionGeometryStorage ();
public:
// return reference to local geometry
const LocalGeometryImpl &localGeom ( const int aluFace, const int twist, const int corners ) const
{
assert( corners == 3 || corners == 4 );
assert( 0 <= aluFace && aluFace < corners );
assert( twist == 0 || twist == 1 );
return geoms_[ corners-3 ][ aluFace ][ twist ];
}
// return static instance
static const ThisType &instance ()
{
static const ThisType geomStorage;
return geomStorage;
}
};
//**********************************************************************
//
// --ALU2dGridIntersectionBase
// --IntersectionBase
//**********************************************************************
/*!
Mesh entities of codimension 0 ("elements") allow to visit all neighbors, wh
a neighbor is an entity of codimension 0 which has a common entity of codimens
These neighbors are accessed via a IntersectionIterator. This allows the implement
non-matching meshes. The number of neigbors may be different from the number o
of an element!
*/
template<class GridImp>
class ALU2dGridIntersectionBase
{
static const int dim = GridImp::dimension;
static const int dimworld = GridImp::dimensionworld;
static const ALU2DSPACE ElementType eltype = GridImp::elementType;
typedef typename GridImp::Traits::template Codim< 1 >::GeometryImpl GeometryImpl;
typedef typename GridImp::Traits::template Codim< 1 >::LocalGeometryImpl LocalGeometryImpl;
public:
typedef typename GridImp :: GridObjectFactoryType FactoryType;
typedef ALU2dGridIntersectionBase< GridImp > ImplementationType;
//! type of the intersection
typedef Dune::Intersection< GridImp, Dune::ALU2dGridIntersectionBase > Intersection;
enum { dimension = GridImp::dimension };
enum { dimensionworld = GridImp::dimensionworld };
typedef typename GridImp::template Codim<0>::Entity Entity;
typedef typename GridImp::template Codim<0>::EntityPointer EntityPointer;
typedef typename GridImp::template Codim<1>::Geometry Geometry;
typedef typename GridImp::template Codim<1>::LocalGeometry LocalGeometry;
typedef ALU2dGridEntity<0,dim,GridImp> EntityImp;
typedef FieldVector< alu2d_ctype, dimworld > NormalType;
typedef FieldVector< alu2d_ctype, dim-1 > LocalCoordinate;
typedef ALU2dGridEntityPointer<0,GridImp> EntityPointerImp;
typedef typename ALU2dImplTraits< dimworld, eltype >::ThinelementType ThinelementType;
typedef typename ALU2dImplTraits< dimworld, eltype >::HElementType HElementType;
typedef typename ALU2dImplTraits< dimworld, eltype >::HBndElType HBndElType;
// type of local geometry storage
typedef ALU2DIntersectionGeometryStorage< LocalGeometryImpl > LocalGeometryStorageType;
typedef ALU2dGridIntersectionBase<GridImp> ThisType;
friend class LevelIntersectionIteratorWrapper<GridImp>;
friend class LeafIntersectionIteratorWrapper<GridImp>;
friend class IntersectionIteratorWrapper<GridImp,ThisType>;
protected:
struct impl
{
explicit impl( HElementType *inside = 0 )
: index_(0), useOutside_(false)
{
setInside( inside );
setOutside( 0, -1 );
}
HElementType *inside () const
{
return inside_;
}
int nFaces () const
{
return nFaces_;
}
bool isBoundary () const
{
assert( inside() && (index_ < nFaces()) && inside()->neighbour( index_ ) );
return inside()->neighbour( index_ )->thinis( ThinelementType::bndel_like );
}
HBndElType *boundary () const
{
assert( isBoundary() );
return (HBndElType *)inside()->neighbour( index_ );
}
HElementType *outside () const
{
return outside_;
}
int opposite () const
{
return opposite_;
}
void setInside ( HElementType *inside )
{
inside_ = inside;
nFaces_ = (inside != 0 ? inside->numfaces() : 0);
}
void setOutside ( HElementType *outside, int opposite )
{
outside_ = outside;
opposite_ = opposite;
}
private:
// current element from which we started the intersection iterator
HElementType *inside_;
HElementType *outside_;
int nFaces_;
int opposite_;
public:
mutable int index_;
mutable bool useOutside_;
} current;
public:
//! The default Constructor , creating an empty ALU2dGridIntersectionIterator
ALU2dGridIntersectionBase(const FactoryType& factory, int wLevel);
//! The copy constructor
ALU2dGridIntersectionBase(const ThisType & org);
virtual ~ALU2dGridIntersectionBase() {}
//! The copy constructor
void assign (const ThisType & org);
const Intersection &dereference () const
{
return reinterpret_cast< const Intersection & >( *this );
}
//! check whether entities are the same or whether iterator is done
bool equals (const ThisType & i) const;
//! return level of inside(entity)
int level () const;
//! return true if intersection is with boundary
bool boundary() const;
//! return boundary type
int boundaryId () const;
//! return the boundary segment index
size_t boundarySegmentIndex() const;
//! return true if intersection is with neighbor on this level
bool neighbor () const;
//! return EntityPointer to the Entity on the inside of this intersection.
EntityPointer inside() const;
//! return EntityPointer to the Entity on the outside of this intersection.
EntityPointer outside() const;
//! local index of codim 1 entity in self where intersection is contained in
int indexInInside () const;
//! local index of codim 1 entity in neighbor where intersection is contained in
int indexInOutside () const;
int twistInInside () const;
int twistInOutside () const;
// deprecated methods
int twistInSelf () const { return twistInInside(); }
// deprecated methods
int twistInNeighbor () const { return twistInOutside(); }
NormalType outerNormal ( const LocalCoordinate &local ) const;
NormalType integrationOuterNormal ( const LocalCoordinate &local ) const;
NormalType unitOuterNormal ( const LocalCoordinate &local ) const;
LocalGeometry geometryInInside () const;
LocalGeometry geometryInOutside () const;
Geometry geometry () const;
/** \brief obtain the type of reference element for this intersection */
GeometryType type () const;
protected:
const GridImp& grid() const { return factory_.grid(); }
virtual bool conforming() const = 0;
//! return true if intersection is with boundary
void checkValid () ;
// set interator to end iterator
void done ( const HElementType *inside );
void done ( const EntityImp &en ) { done( &en.getItem() ); }
// invalidate status of internal objects
void unsetUp2Date() ;
// reset IntersectionIterator to first neighbour
void first ( const EntityImp &en, int wLevel );
// reset IntersectionIterator to first neighbour
virtual void setFirstItem ( const HElementType &elem, int wLevel ) = 0;
// the local geometries
mutable GeometryImpl intersectionGlobal_;
mutable LocalGeometryImpl intersectionSelfLocal_;
mutable LocalGeometryImpl intersectionNeighborLocal_;
// reference to factory
const FactoryType& factory_;
const LocalGeometryStorageType &localGeomStorage_;
mutable int walkLevel_;
}; // end ALU2dGridIntersectionBase
//**********************************************************************
//
// --ALU2dGridLevelIntersectionIterator
// --IntersectionLevelIterator
//**********************************************************************
template< class GridImp >
class ALU2dGridLevelIntersectionIterator
: public ALU2dGridIntersectionBase< GridImp >
{
typedef ALU2dGridLevelIntersectionIterator< GridImp > ThisType;
typedef ALU2dGridIntersectionBase< GridImp > BaseType;
static const int dim = GridImp::dimension;
static const int dimworld = GridImp::dimensionworld;
static const ALU2DSPACE ElementType eltype = GridImp::elementType;
typedef typename ALU2dImplTraits< dimworld, eltype >::ThinelementType ThinelementType;
typedef typename BaseType::HElementType HElementType;
typedef typename ALU2dImplTraits< dimworld, eltype >::HBndElType HBndElType;
typedef typename ALU2dImplTraits< dimworld, eltype >::PeriodicBndElType PeriodicBndElType;
friend class LevelIntersectionIteratorWrapper<GridImp>;
friend class IntersectionIteratorWrapper<GridImp,ThisType>;
typedef std::pair< HElementType *, int > IntersectionInfo;
public:
typedef typename GridImp :: GridObjectFactoryType FactoryType;
typedef ALUMemoryProvider< ThisType > StorageType;
enum { dimension = GridImp::dimension };
enum { dimensionworld = GridImp::dimensionworld };
typedef typename GridImp::template Codim<0>::Entity Entity;
typedef typename GridImp::template Codim<1>::Geometry Geometry;
typedef typename GridImp::template Codim<1>::LocalGeometry LocalGeometry;
typedef ALU2dGridEntity<0,dim,GridImp> EntityImp;
typedef ALU2dGridGeometry<dim-1,dimworld,GridImp> GeometryImp;
typedef ALU2dGridGeometry<dim-1,dim,GridImp> LocalGeometryImp;
typedef FieldVector<alu2d_ctype, dimworld> NormalType;
typedef ALU2dGridEntityPointer<0,GridImp> EntityPointer;
typedef MakeableInterfaceObject< Geometry > GeometryObject;
//! The default Constructor , creating an empty ALU2dGridIntersectionIterator
ALU2dGridLevelIntersectionIterator(const FactoryType& factory, int wLevel);
//! The default Constructor , level tells on which level we want neighbours
ALU2dGridLevelIntersectionIterator(const FactoryType& factory, const HElementType* el, int wLevel, bool end=true);
//! The copy constructor
ALU2dGridLevelIntersectionIterator(const ALU2dGridLevelIntersectionIterator<GridImp> & org);
void assign (const ALU2dGridLevelIntersectionIterator<GridImp> & org);
//! increment iterator
void increment ();
public:
//! level is conforming when non-conform grid used
//! otherwise might not be conform
bool conforming () const
{
return (this->grid().nonConform() || isConform());
}
protected:
bool isConform() const
{
return (!current.outside() || (current.outside() == current.inside()->neighbour( current.index_ )));
}
private:
void doIncrement ();
// reset IntersectionIterator to first neighbour
void setFirstItem(const HElementType & elem, int wLevel);
// reset IntersectionIterator to first neighbour
template <class EntityType>
void first(const EntityType & en, int wLevel);
void addNeighboursToStack();
static int getOppositeInFather ( int nrInChild, int nrOfChild );
static int getOppositeInChild ( int nrInFather, int nrOfChild );
void setupIntersection ();
protected:
using BaseType::done;
using BaseType::current;
using BaseType::walkLevel_;
private:
mutable std::stack<IntersectionInfo> nbStack_;
}; // end ALU2dGridLevelIntersectionIterator
//********************************************************************
//
// --ALU2dGridLeafIntersectionIterator
//
//
//********************************************************************
template< class GridImp >
class ALU2dGridLeafIntersectionIterator
: public ALU2dGridIntersectionBase< GridImp >
{
typedef ALU2dGridLeafIntersectionIterator< GridImp > ThisType;
typedef ALU2dGridIntersectionBase< GridImp > BaseType;
friend class LeafIntersectionIteratorWrapper<GridImp>;
friend class IntersectionIteratorWrapper<GridImp,ThisType>;
static const int dim = GridImp::dimension;
static const int dimworld = GridImp::dimensionworld;
static const ALU2DSPACE ElementType eltype = GridImp::elementType;
public:
typedef typename GridImp :: GridObjectFactoryType FactoryType;
typedef ALUMemoryProvider< ThisType > StorageType;
enum { dimension = GridImp::dimension };
enum { dimensionworld = GridImp::dimensionworld };
private:
typedef typename ALU2dImplTraits< dimworld, eltype >::ThinelementType ThinelementType;
typedef typename BaseType::HElementType HElementType;
typedef typename ALU2dImplTraits< dimworld, eltype >::HBndElType HBndElType;
typedef typename ALU2dImplTraits< dimworld, eltype >::PeriodicBndElType PeriodicBndElType;
typedef std::pair< HElementType *, int > IntersectionInfo;
public:
typedef typename GridImp::template Codim<0>::Entity Entity;
typedef typename GridImp::template Codim<1>::Geometry Geometry;
typedef typename GridImp::template Codim<1>::LocalGeometry LocalGeometry;
typedef ALU2dGridEntity<0,dim,GridImp> EntityImp;
typedef ALU2dGridGeometry<dim-1,dimworld,GridImp> GeometryImp;
typedef ALU2dGridGeometry<dim-1,dim,GridImp> LocalGeometryImp;
typedef FieldVector<alu2d_ctype, dimworld> NormalType;
typedef ALU2dGridEntityPointer<0,GridImp> EntityPointer;
typedef MakeableInterfaceObject< Geometry > GeometryObject;
//! The default Constructor , createing an empty ALU2dGridIntersectionIterator
ALU2dGridLeafIntersectionIterator(const FactoryType& factory, int wLevel);
//! The default Constructor , level tells on which level we want neighbours
ALU2dGridLeafIntersectionIterator(const FactoryType& factory, const HElementType* el, int wLevel, bool end=true);
//! The copy constructor
ALU2dGridLeafIntersectionIterator(const ALU2dGridLeafIntersectionIterator<GridImp> & org);
void assign (const ALU2dGridLeafIntersectionIterator<GridImp> & org);
//! increment iterator
void increment ();
public:
//! leaf is conforming, when conform grid version used
bool conforming () const
{
return (!this->grid().nonConform() || isConform());
}
protected:
bool isConform() const
{
return (!current.outside() || (current.outside()->level() == current.inside()->level()) );
}
private:
void doIncrement ();
// reset IntersectionIterator to first neighbour
void setFirstItem(const HElementType & elem, int wLevel);
// reset IntersectionIterator to first neighbour
template <class EntityType>
void first(const EntityType & en, int wLevel);
void setupIntersection ();
protected:
using BaseType::done;
using BaseType::current;
using BaseType::walkLevel_;
private:
std::stack<IntersectionInfo> nbStack_;
}; // end ALU2dGridLeafIntersectionIterator
} // end namespace Dune
#include "intersection_imp.cc"
#if COMPILE_ALU2DGRID_INLINE
#include "intersection.cc"
#endif
#endif // #ifndef DUNE_ALU2DGRID_INTERSECTION_HH
|