/usr/include/dune/grid/albertagrid/treeiterator.hh is in libdune-grid-dev 2.5.1-1.
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 511 512 513 514 515 516 517 518 519 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_ALBERTA_TREEITERATOR_HH
#define DUNE_ALBERTA_TREEITERATOR_HH
#include <dune/common/typetraits.hh>
#include <dune/grid/albertagrid/meshpointer.hh>
#include <dune/grid/albertagrid/entitypointer.hh>
#if HAVE_ALBERTA
namespace Dune
{
// AlbertaMarkerVector
// -------------------
/** \class AlbertaMarkerVector
* \ingroup AlbertaGrid
* \brief marker assigning subentities to one element containing them
*
* This Helper class is used for the level and leaf iterators of higher
* codimension to visit each entity only once (on the element assigned to
* it by this marker)
*/
template< int dim, int dimworld >
class AlbertaMarkerVector
{
typedef AlbertaMarkerVector< dim, dimworld > This;
typedef AlbertaGrid< dim, dimworld > Grid;
//friend class AlbertaGrid< dim, dimworld >;
static const int dimension = Grid::dimension;
typedef Alberta::HierarchyDofNumbering< dimension > DofNumbering;
typedef Alberta::ElementInfo< dimension > ElementInfo;
template< bool >
struct NoMarkSubEntities;
template< bool >
struct MarkSubEntities;
public:
//! create AlbertaMarkerVector with empty vectors
explicit AlbertaMarkerVector ( const DofNumbering &dofNumbering )
: dofNumbering_( dofNumbering )
{
for( int codim = 0; codim <= dimension; ++codim )
marker_[ codim ] = 0;
}
AlbertaMarkerVector ( const This &other )
: dofNumbering_( other.dofNumbering_ )
{
for( int codim = 0; codim <= dimension; ++codim )
marker_[ codim ] = 0;
}
~AlbertaMarkerVector ()
{
clear();
}
private:
This &operator= ( const This & );
public:
//! visit subentity on this element?
template< int codim >
bool subEntityOnElement ( const ElementInfo &elementInfo, int subEntity ) const;
template< int firstCodim, class Iterator >
void markSubEntities ( const Iterator &begin, const Iterator &end );
void clear ()
{
for( int codim = 0; codim <= dimension; ++codim )
{
if( marker_[ codim ] != 0 )
delete[] marker_[ codim ];
marker_[ codim ] = 0;
}
}
//! return true if marking is up to date
bool up2Date () const
{
return (marker_[ dimension ] != 0);
}
//! print for debugin' only
void print ( std::ostream &out = std::cout ) const;
private:
const DofNumbering &dofNumbering_;
int *marker_[ dimension+1 ];
};
// AlbertaMarkerVector::NoMarkSubEntities
// --------------------------------------
template< int dim, int dimworld >
template< bool >
struct AlbertaMarkerVector< dim, dimworld >::NoMarkSubEntities
{
template< int firstCodim, class Iterator >
static void mark ( const DofNumbering &dofNumbering, int *(&marker)[ dimension + 1 ],
const Iterator &begin, const Iterator &end )
{}
};
// AlbertaMarkerVector::MarkSubEntities
// ------------------------------------
template< int dim, int dimworld >
template< bool >
struct AlbertaMarkerVector< dim, dimworld >::MarkSubEntities
{
template< int codim >
struct Codim
{
static const int numSubEntities = Alberta::NumSubEntities< dimension, codim >::value;
typedef Alberta::ElementInfo< dimension > ElementInfo;
static void apply ( const DofNumbering &dofNumbering,
int *(&marker)[ dimension + 1 ],
const ElementInfo &elementInfo )
{
int *array = marker[ codim ];
const int index = dofNumbering( elementInfo, 0, 0 );
for( int i = 0; i < numSubEntities; ++i )
{
int &mark = array[ dofNumbering( elementInfo, codim, i ) ];
mark = std::max( index, mark );
}
}
};
template< int firstCodim, class Iterator >
static void mark ( const DofNumbering &dofNumbering, int *(&marker)[ dimension + 1 ],
const Iterator &begin, const Iterator &end )
{
for( int codim = firstCodim; codim <= dimension; ++codim )
{
const int size = dofNumbering.size( codim );
marker[ codim ] = new int[ size ];
int *array = marker[ codim ];
for( int i = 0; i < size; ++i )
array[ i ] = -1;
}
for( Iterator it = begin; it != end; ++it )
{
const ElementInfo &elementInfo = Grid::getRealImplementation( *it ).elementInfo();
ForLoop< Codim, firstCodim, dimension >::apply( dofNumbering, marker, elementInfo );
}
}
};
// AlbertaGridTreeIterator
// -----------------------
/*!
Enables iteration over all entities of a given codimension and level of a grid.
*/
template< int codim, class GridImp, bool leafIterator >
class AlbertaGridTreeIterator
: public AlbertaGridEntityPointer< codim, GridImp >
{
typedef AlbertaGridTreeIterator< codim, GridImp, leafIterator > This;
typedef AlbertaGridEntityPointer< codim, GridImp > Base;
public:
static const int dimension = GridImp::dimension;
static const int codimension = codim;
static const int dimensionworld = GridImp::dimensionworld;
private:
friend class AlbertaGrid< dimension, dimensionworld >;
static const int numSubEntities
= Alberta::NumSubEntities< dimension, codimension >::value;
public:
typedef typename Base::ElementInfo ElementInfo;
typedef Alberta::MeshPointer< dimension > MeshPointer;
typedef typename MeshPointer::MacroIterator MacroIterator;
typedef typename GridImp::template Codim< codim >::Entity Entity;
typedef MakeableInterfaceObject< Entity > EntityObject;
typedef typename EntityObject::ImplementationType EntityImp;
typedef AlbertaMarkerVector< dimension, dimensionworld > MarkerVector;
AlbertaGridTreeIterator ();
//! Constructor making end iterator
AlbertaGridTreeIterator ( const This &other );
//! Constructor making end iterator
This &operator= ( const This &other );
//! Constructor making end iterator
AlbertaGridTreeIterator ( const GridImp &grid, int travLevel );
//! Constructor making begin iterator
AlbertaGridTreeIterator ( const GridImp &grid,
const MarkerVector *marker,
int travLevel );
//! increment
void increment();
protected:
using Base::entityImp;
using Base::grid;
private:
void nextElement ( ElementInfo &elementInfo );
void nextElementStop (ElementInfo &elementInfo );
bool stopAtElement ( const ElementInfo &elementInfo ) const;
void goNext ( ElementInfo &elementInfo );
void goNext ( const std::integral_constant< int, 0 > cdVariable,
ElementInfo &elementInfo );
void goNext ( const std::integral_constant< int, 1 > cdVariable,
ElementInfo &elementInfo );
template< int cd >
void goNext ( const std::integral_constant< int, cd > cdVariable,
ElementInfo &elementInfo );
//! current level
int level_;
//! Number of the subentity within the element
int subEntity_;
MacroIterator macroIterator_;
// knows on which element a point,edge,face is viewed
const MarkerVector *marker_;
};
// Implementation of AlbertaMarkerVector
// -------------------------------------
template< int dim, int dimworld >
template< int codim >
inline bool AlbertaMarkerVector< dim, dimworld >
::subEntityOnElement ( const ElementInfo &elementInfo, int subEntity ) const
{
assert( marker_[ codim ] != 0 );
const int subIndex = dofNumbering_( elementInfo, codim, subEntity );
const int markIndex = marker_[ codim ][ subIndex ];
assert( (markIndex >= 0) );
const int index = dofNumbering_( elementInfo, 0, 0 );
return (markIndex == index);
}
template< int dim, int dimworld >
template< int firstCodim, class Iterator >
inline void AlbertaMarkerVector< dim, dimworld >
::markSubEntities ( const Iterator &begin, const Iterator &end )
{
clear();
std::conditional< (firstCodim <= dimension), MarkSubEntities<true>, NoMarkSubEntities<false> >::type
::template mark< firstCodim, Iterator >( dofNumbering_, marker_, begin, end );
}
template< int dim, int dimworld >
inline void AlbertaMarkerVector< dim, dimworld >::print ( std::ostream &out ) const
{
for( int codim = 1; codim <= dimension; ++codim )
{
int *marker = marker_[ codim ];
if( marker != 0 )
{
const int size = dofNumbering_.size( codim );
out << std::endl;
out << "Codimension " << codim << " (" << size << " entries)" << std::endl;
for( int i = 0; i < size; ++i )
out << "subentity " << i << " visited on Element " << marker[ i ] << std::endl;
}
}
}
// Implementation of AlbertaGridTreeIterator
// -----------------------------------------
template< int codim, class GridImp, bool leafIterator >
inline AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::AlbertaGridTreeIterator ()
: Base(),
level_( -1 ),
subEntity_( -1 ),
macroIterator_(),
marker_( NULL )
{}
template< int codim, class GridImp, bool leafIterator >
inline AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::AlbertaGridTreeIterator ( const GridImp &grid,
const MarkerVector *marker,
int travLevel )
: Base( grid ),
level_( travLevel ),
subEntity_( (codim == 0 ? 0 : -1) ),
macroIterator_( grid.meshPointer().begin() ),
marker_( marker )
{
ElementInfo elementInfo = *macroIterator_;
nextElementStop( elementInfo );
if( codim > 0 )
goNext( elementInfo );
// it is ok to set the invalid ElementInfo
entityImp().setElement( elementInfo, subEntity_ );
}
// Make LevelIterator with point to element from previous iterations
template< int codim, class GridImp, bool leafIterator >
inline AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::AlbertaGridTreeIterator ( const GridImp &grid,
int travLevel )
: Base( grid ),
level_( travLevel ),
subEntity_( -1 ),
macroIterator_( grid.meshPointer().end() ),
marker_( 0 )
{}
// Make LevelIterator with point to element from previous iterations
template< int codim, class GridImp, bool leafIterator >
inline AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::AlbertaGridTreeIterator( const This &other )
: Base( other ),
level_( other.level_ ),
subEntity_( other.subEntity_ ),
macroIterator_( other.macroIterator_ ),
marker_( other.marker_ )
{}
// Make LevelIterator with point to element from previous iterations
template< int codim, class GridImp, bool leafIterator >
inline typename AlbertaGridTreeIterator< codim, GridImp, leafIterator >::This &
AlbertaGridTreeIterator< codim, GridImp, leafIterator >::operator= ( const This &other )
{
Base::operator=( other );
level_ = other.level_;
subEntity_ = other.subEntity_;
macroIterator_ = other.macroIterator_;
marker_ = other.marker_;
return *this;
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >::increment ()
{
ElementInfo elementInfo = entityImp().elementInfo_;
goNext ( elementInfo );
// it is ok to set the invalid ElementInfo
entityImp().setElement( elementInfo, subEntity_ );
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::nextElement ( ElementInfo &elementInfo )
{
if( elementInfo.isLeaf() || (elementInfo.level() >= level_) )
{
while( (elementInfo.level() > 0) && (elementInfo.indexInFather() == 1) )
elementInfo = elementInfo.father();
if( elementInfo.level() == 0 )
{
++macroIterator_;
elementInfo = *macroIterator_;
}
else
elementInfo = elementInfo.father().child( 1 );
}
else
elementInfo = elementInfo.child( 0 );
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::nextElementStop ( ElementInfo &elementInfo )
{
while( !(!elementInfo || stopAtElement( elementInfo )) )
nextElement( elementInfo );
}
template< int codim, class GridImp, bool leafIterator >
inline bool AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::stopAtElement ( const ElementInfo &elementInfo ) const
{
if( !elementInfo )
return true;
return (leafIterator ? elementInfo.isLeaf() : (level_ == elementInfo.level()));
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::goNext ( ElementInfo &elementInfo )
{
std::integral_constant< int, codim > codimVariable;
goNext( codimVariable, elementInfo );
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::goNext ( const std::integral_constant< int, 0 > cdVariable,
ElementInfo &elementInfo )
{
assert( stopAtElement( elementInfo ) );
nextElement( elementInfo );
nextElementStop( elementInfo );
}
template< int codim, class GridImp, bool leafIterator >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::goNext ( const std::integral_constant< int, 1 > cdVariable,
ElementInfo &elementInfo )
{
assert( stopAtElement( elementInfo ) );
++subEntity_;
if( subEntity_ >= numSubEntities )
{
subEntity_ = 0;
nextElement( elementInfo );
nextElementStop( elementInfo );
if( !elementInfo )
return;
}
if( leafIterator )
{
const int face = (dimension == 1 ? (numSubEntities-1)-subEntity_ : subEntity_);
const ALBERTA EL *neighbor = elementInfo.elInfo().neigh[ face ];
if( (neighbor != NULL) && !elementInfo.isBoundary( face ) )
{
// face is reached from element with largest number
const int elIndex = grid().dofNumbering() ( elementInfo, 0, 0 );
const int nbIndex = grid().dofNumbering() ( neighbor, 0, 0 );
if( elIndex < nbIndex )
goNext( cdVariable, elementInfo );
}
// uncomment this assertion only if codimension 1 entities are marked
// assert( marker_->template subEntityOnElement< 1 >( elementInfo, subEntity_ ) );
}
else
{
assert( marker_ != 0 );
if( !marker_->template subEntityOnElement< 1 >( elementInfo, subEntity_ ) )
goNext( cdVariable, elementInfo );
}
}
template< int codim, class GridImp, bool leafIterator >
template< int cd >
inline void AlbertaGridTreeIterator< codim, GridImp, leafIterator >
::goNext ( const std::integral_constant< int, cd > cdVariable,
ElementInfo &elementInfo )
{
assert( stopAtElement( elementInfo ) );
++subEntity_;
if( subEntity_ >= numSubEntities )
{
subEntity_ = 0;
nextElement( elementInfo );
nextElementStop( elementInfo );
if( !elementInfo )
return;
}
assert( marker_ != 0 );
if( !marker_->template subEntityOnElement< cd >( elementInfo, subEntity_ ) )
goNext( cdVariable, elementInfo );
}
}
#endif // #if HAVE_ALBERTA
#endif // #ifndef DUNE_ALBERTA_TREEITERATOR_HH
|