/usr/include/dune/grid/onedgrid/onedgridentity.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 | #ifndef DUNE_ONE_D_GRID_ENTITY_HH
#define DUNE_ONE_D_GRID_ENTITY_HH
#include <dune/common/array.hh>
#include <dune/common/fvector.hh>
#include <dune/grid/common/gridenums.hh>
#include <dune/grid/common/entity.hh>
#include "nulliteratorfactory.hh"
/** \file
* \brief The OneDGridEntity class and its specializations
*/
namespace Dune {
// forward declarations
template <class GridImp>
class OneDGridLeafIntersectionIterator;
template <class GridImp>
class OneDGridLevelIntersectionIterator;
template<int codim, class GridImp>
class OneDGridEntityPointer;
template<int codim, PartitionIteratorType pitype, class GridImp>
class OneDGridLevelIterator;
template<class GridImp>
class OneDGridHierarchicIterator;
template<int mydim, int coorddim, class GridImp>
class OneDGridGeometry;
template <int mydim>
class OneDEntityImp {};
/** \brief Specialization for vertices */
template <>
class OneDEntityImp<0>
{
public:
OneDEntityImp(int level, double pos)
: pos_(pos), levelIndex_(0), leafIndex_(0), level_(level),
son_(OneDGridNullIteratorFactory<0>::null()),
pred_(OneDGridNullIteratorFactory<0>::null()),
succ_(OneDGridNullIteratorFactory<0>::null())
{}
OneDEntityImp(int level, const FieldVector<double, 1>& pos, unsigned int id)
: pos_(pos), levelIndex_(0), leafIndex_(0), id_(id), level_(level),
son_(OneDGridNullIteratorFactory<0>::null()),
pred_(OneDGridNullIteratorFactory<0>::null()),
succ_(OneDGridNullIteratorFactory<0>::null())
{}
//private:
bool isLeaf() const {
return son_==OneDGridNullIteratorFactory<0>::null();
}
FieldVector<double, 1> pos_;
//! entity number
unsigned int levelIndex_;
unsigned int leafIndex_;
unsigned int id_;
//! level
int level_;
//! Son vertex on the next finer grid
OneDEntityImp<0>* son_;
//!
OneDEntityImp<0>* pred_;
OneDEntityImp<0>* succ_;
};
/** \brief Specialization for elements */
template <>
class OneDEntityImp<1>
{
public:
/** \brief The different ways to mark an element for grid changes */
enum MarkState { DO_NOTHING , COARSEN , REFINE };
OneDEntityImp(int level, unsigned int id, bool reversedBoundarySegmentNumbering)
: levelIndex_(0), leafIndex_(0), id_(id), level_(level),
markState_(DO_NOTHING), isNew_(false),
reversedBoundarySegmentNumbering_(reversedBoundarySegmentNumbering),
pred_(OneDGridNullIteratorFactory<1>::null()),
succ_(OneDGridNullIteratorFactory<1>::null())
{
father_ = OneDGridNullIteratorFactory<1>::null();
sons_[0] = sons_[1] = OneDGridNullIteratorFactory<1>::null();
}
bool isLeaf() const {
assert( (sons_[0]==OneDGridNullIteratorFactory<1>::null() && sons_[1]==OneDGridNullIteratorFactory<1>::null())
|| (sons_[0]!=OneDGridNullIteratorFactory<1>::null() && sons_[1]!=OneDGridNullIteratorFactory<1>::null()) );
return sons_[0]==OneDGridNullIteratorFactory<1>::null() && sons_[1]==OneDGridNullIteratorFactory<1>::null();
}
array<OneDEntityImp<1>*, 2> sons_;
OneDEntityImp<1>* father_;
OneDEntityImp<0>* vertex_[2];
//! element number
unsigned int levelIndex_;
unsigned int leafIndex_;
/** \brief Unique and persistent id for elements */
unsigned int id_;
//! the level of the entity
int level_;
/** \brief Stores requests for refinement and coarsening */
MarkState markState_;
/** \brief This flag is set by adapt() if this element has been newly created. */
bool isNew_;
/** Since a OneDGrid is one-dimensional and connected, there can only be two possible numberings
of the boundary segments. Either the left one is '0' and the right one is '1' or the reverse.
This flag stores which is the case. It has the same value throughout the entire grid.
This is a waste, because the Intersections class (which hands out the information), can
access data here much easier than data in the central grid class.
*/
bool reversedBoundarySegmentNumbering_;
/** \brief Predecessor in the doubly linked list of elements */
OneDEntityImp<1>* pred_;
/** \brief Successor in the doubly linked list of elements */
OneDEntityImp<1>* succ_;
};
//**********************************************************************
//
// --OneDGridEntity
// --Entity
//
/** \brief The implementation of entities in a OneDGrid
\ingroup OneDGrid
A Grid is a container of grid entities. An entity is parametrized by the codimension.
An entity of codimension c in dimension d is a d-c dimensional object.
*/
template<int cd, int dim, class GridImp>
class OneDGridEntity :
public EntityDefaultImplementation <cd,dim,GridImp,OneDGridEntity>
{
template <int codim_, PartitionIteratorType PiType_, class GridImp_>
friend class OneDGridLevelIterator;
friend class OneDGrid;
typedef typename GridImp::Traits::template Codim< cd >::GeometryImpl GeometryImpl;
public:
/** \brief The type of OneDGrid Entity seeds */
typedef typename GridImp::Traits::template Codim<cd>::EntitySeed EntitySeed;
//! Default constructor
OneDGridEntity()
: target_(OneDGridNullIteratorFactory<0>::null())
{}
typedef typename GridImp::template Codim<cd>::Geometry Geometry;
typedef typename GridImp::template Codim<cd>::EntityPointer EntityPointer;
//! level of this element
int level () const {return target_->level_;}
//! only interior entities
PartitionType partitionType () const { return InteriorEntity; }
unsigned int levelIndex() const {return target_->levelIndex_;}
unsigned int leafIndex() const {return target_->leafIndex_;}
unsigned int globalId() const {return target_->id_;}
//! return the element type identifier (segment)
GeometryType type () const {return GeometryType(0);}
//! geometry of this entity
Geometry geometry () const { return Geometry( geo_ ); }
/** \brief Get the seed corresponding to this entity */
EntitySeed seed () const { return EntitySeed( *this ); }
void setToTarget(OneDEntityImp<0>* target) {
target_ = target;
geo_.target_ = target;
}
//! the current geometry
GeometryImpl geo_;
OneDEntityImp<0>* target_;
};
//***********************
//
// --OneDGridEntity
// --0Entity
//
//***********************
/** \brief Specialization for codim-0-entities.
* \ingroup OneDGrid
*
* This class embodies the topological parts of elements of the grid.
* It has an extended interface compared to the general entity class.
* For example, Entities of codimension 0 allow to visit all neighbors.
*
* OneDGrid only implements the case dim==dimworld==1
*/
template<int dim, class GridImp>
class OneDGridEntity<0,dim, GridImp> :
public EntityDefaultImplementation<0,dim,GridImp, OneDGridEntity>
{
friend class OneDGrid;
template <class GridImp_>
friend class OneDGridLevelIntersectionIterator;
template <class GridImp_>
friend class OneDGridLeafIntersectionIterator;
friend class OneDGridHierarchicIterator <GridImp>;
friend class OneDGridLevelIterator <0,All_Partition,GridImp>;
typedef typename GridImp::Traits::template Codim< 0 >::GeometryImpl GeometryImpl;
typedef typename GridImp::Traits::template Codim< 0 >::GeometryImpl LocalGeometryImpl;
public:
typedef typename GridImp::template Codim<0>::Geometry Geometry;
typedef typename GridImp::template Codim<0>::LocalGeometry LocalGeometry;
typedef typename GridImp::template Codim<0>::LevelIterator LevelIterator;
typedef typename GridImp::LeafIntersectionIterator LeafIntersectionIterator;
typedef typename GridImp::LevelIntersectionIterator LevelIntersectionIterator;
typedef typename GridImp::HierarchicIterator HierarchicIterator;
/** \brief The type of OneDGrid Entity seeds */
typedef typename GridImp::Traits::template Codim<0>::EntitySeed EntitySeed;
//! Default Constructor
OneDGridEntity ()
: target_( OneDGridNullIteratorFactory<1>::null() )
{}
//! Level of this element
int level () const {return target_->level_;}
//! only interior entities
PartitionType partitionType () const { return InteriorEntity; }
//! Level index is unique and consecutive per level and codim
unsigned int levelIndex() const {return target_->levelIndex_;}
unsigned int leafIndex() const {return target_->leafIndex_;}
unsigned int globalId() const {return target_->id_;}
//! Geometry of this entity
Geometry geometry () const { return Geometry( geo_ ); }
/** \brief Get the seed corresponding to this entity */
EntitySeed seed () const { return EntitySeed( *this ); }
//! return the element type identifier (segment)
GeometryType type () const {return GeometryType(1);}
/** \brief Return the number of subentities of codimension cc.
*/
template<int cc>
int count () const {
assert(cc==0 || cc==1);
return (cc==0) ? 1 : 2;
}
/** \brief Return index of sub entity with codim = cc and local number i
*/
int subLevelIndex (int i,unsigned int codim) const {
assert(i==0 || i==1);
return (codim==0)
? target_->levelIndex_
: target_->vertex_[i]->levelIndex_;
}
/** \brief Return leaf index of sub entity with codim = cc and local number i
*/
int subLeafIndex (int i, unsigned int codim) const {
assert(i==0 || i==1);
return (codim==0)
? target_->leafIndex_
: target_->vertex_[i]->leafIndex_;
}
/** \brief Return leaf index of sub entity with codim = cc and local number i
*/
int subId (int i, unsigned int codim) const {
assert(i==0 || i==1);
return (codim==0)
? target_->id_
: target_->vertex_[i]->id_;
}
/** \brief Provide access to sub entity i of given codimension. Entities
* are numbered 0 ... count<cc>()-1
*/
template<int cc>
typename GridImp::template Codim<cc>::EntityPointer subEntity (int i) const
{
if (cc==0) {
assert(i==0);
// The cast is correct when this if clause is executed
return OneDGridLevelIterator<cc,All_Partition,GridImp>( (OneDEntityImp<1-cc>*)this->target_);
} else if (cc==1) {
assert(i==0 || i==1);
// The cast is correct when this if clause is executed
return OneDGridLevelIterator<cc,All_Partition,GridImp>( (OneDEntityImp<1-cc>*)this->target_->vertex_[i]);
}
}
LeafIntersectionIterator ileafbegin () const {
return OneDGridLeafIntersectionIterator<GridImp>(target_, (isLeaf()) ? 0 : 2);
}
LevelIntersectionIterator ilevelbegin () const {
return OneDGridLevelIntersectionIterator<GridImp>(target_, 0);
}
LeafIntersectionIterator ileafend () const {
return OneDGridLeafIntersectionIterator<GridImp>(target_);
}
LevelIntersectionIterator ilevelend () const {
return OneDGridLevelIntersectionIterator<GridImp>(target_);
}
//! returns true if Entity has no children
bool isLeaf () const {
return (target_->sons_[0]==OneDGridNullIteratorFactory<1>::null())
&& (target_->sons_[1]==OneDGridNullIteratorFactory<1>::null());
}
//! Inter-level access to father element on coarser grid.
//! Assumes that meshes are nested.
OneDGridEntityPointer<0, GridImp> father () const {
return OneDGridEntityPointer<0,GridImp>(target_->father_);
}
//! returns true if father entity exists
bool hasFather () const
{
return (this->level()>0);
}
/*! Location of this element relative to the reference element
of the father. This is sufficient to interpolate all
dofs in conforming case. Nonconforming may require access to
neighbors of father and computations with local coordinates.
On the fly case is somewhat inefficient since dofs are visited
several times. If we store interpolation matrices, this is tolerable.
We assume that on-the-fly implementation of numerical algorithms
is only done for simple discretizations. Assumes that meshes are nested.
*/
LocalGeometry geometryInFather () const {
assert(target_->father_);
assert(target_->father_->sons_[0] == target_ || target_->father_->sons_[1] == target_);
if (target_->father_->sons_[0] == target_ && target_->father_->sons_[1] == target_) {
// Copied element?
geometryInFather_.setPositions(0,1);
} else if (target_->father_->sons_[0] == target_) {
// Left son?
geometryInFather_.setPositions(0,0.5);
} else {
// Right son!
geometryInFather_.setPositions(0.5,1);
}
return LocalGeometry( geometryInFather_ );
}
/*! Inter-level access to son elements on higher levels<=maxlevel.
This is provided for sparsely stored nested unstructured meshes.
Returns iterator to first son.
*/
OneDGridHierarchicIterator<GridImp> hbegin (int maxlevel) const {
OneDGridHierarchicIterator<GridImp> it(maxlevel);
if (level()<=maxlevel) {
// Load sons of old target onto the iterator stack
if (!isLeaf()) {
it.elemStack.push(target_->sons_[0]);
it.elemStack.push(target_->sons_[1]);
}
}
GridImp::getRealImplementation(it.virtualEntity_).setToTarget((it.elemStack.empty())
? OneDGridNullIteratorFactory<1>::null() : it.elemStack.top());
return it;
}
//! Returns iterator to one past the last son
HierarchicIterator hend (int maxlevel) const {
return HierarchicIterator(maxlevel);
}
// ***************************************************************
// Interface for Adaptation
// ***************************************************************
/** returns true, if entity might be coarsened during next adaptation cycle */
bool mightVanish () const { return target_->markState_ == OneDEntityImp<1> :: COARSEN; }
/** returns true, if entity was refined during last adaptation cycle */
bool isNew () const { return target_->isNew_; }
void setToTarget(OneDEntityImp<1>* target) {
target_ = target;
geo_.target_ = target;
}
//! the current geometry
GeometryImpl geo_;
mutable LocalGeometryImpl geometryInFather_;
OneDEntityImp<1>* target_;
}; // end of OneDGridEntity codim = 0
} // namespace Dune
#endif
|