/usr/include/dune/grid/albertagrid/albertagrid.cc 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 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 | #ifndef DUNE_ALBERTAGRID_CC
#define DUNE_ALBERTAGRID_CC
//************************************************************************
//
// implementation of AlbertaGrid
//
// namespace Dune
//
//************************************************************************
#include "geometry.cc"
#include "entity.cc"
#include "intersection.cc"
namespace Dune
{
namespace Alberta
{
static void *adaptationDataHandler_;
}
template< int dim, int dimworld >
static void checkAlbertaDimensions ()
{
// If this check fails, define ALBERTA_DIM accordingly
dune_static_assert( (dimworld == Alberta::dimWorld),
"Template Parameter dimworld does not match "
"ALBERTA's DIM_OF_WORLD setting." );
}
// AlbertaGrid
// -----------
template< int dim, int dimworld >
inline AlbertaGrid < dim, dimworld >::AlbertaGrid ()
: mesh_(),
maxlevel_( 0 ),
numBoundarySegments_( 0 ),
hIndexSet_( dofNumbering_ ),
idSet_( hIndexSet_ ),
levelIndexVec_( (size_t)MAXL, 0 ),
leafIndexSet_( 0 ),
sizeCache_( *this ),
leafMarkerVector_( dofNumbering_ ),
levelMarkerVector_( (size_t)MAXL, MarkerVector( dofNumbering_ ) )
{
checkAlbertaDimensions< dim, dimworld>();
}
template< int dim, int dimworld >
template< class Proj, class Impl >
inline AlbertaGrid< dim, dimworld >
::AlbertaGrid ( const Alberta::MacroData< dimension> ¯oData,
const Alberta::ProjectionFactoryInterface< Proj, Impl > &projectionFactory )
: mesh_(),
maxlevel_( 0 ),
numBoundarySegments_( 0 ),
hIndexSet_( dofNumbering_ ),
idSet_( hIndexSet_ ),
levelIndexVec_( (size_t)MAXL, 0 ),
leafIndexSet_ ( 0 ),
sizeCache_( *this ),
leafMarkerVector_( dofNumbering_ ),
levelMarkerVector_( (size_t)MAXL, MarkerVector( dofNumbering_ ) )
{
checkAlbertaDimensions< dim, dimworld >();
numBoundarySegments_ = mesh_.create( macroData, projectionFactory );
if( !mesh_ )
DUNE_THROW( AlbertaError, "Invalid macro data structure." );
setup();
hIndexSet_.create();
calcExtras();
}
template< int dim, int dimworld >
inline AlbertaGrid< dim, dimworld >
::AlbertaGrid ( const Alberta::MacroData< dimension> ¯oData,
const Dune::shared_ptr< DuneBoundaryProjection< dimensionworld > > &projection )
: mesh_(),
maxlevel_( 0 ),
numBoundarySegments_( 0 ),
hIndexSet_( dofNumbering_ ),
idSet_( hIndexSet_ ),
levelIndexVec_( (size_t)MAXL, 0 ),
leafIndexSet_ ( 0 ),
sizeCache_( *this ),
leafMarkerVector_( dofNumbering_ ),
levelMarkerVector_( (size_t)MAXL, MarkerVector( dofNumbering_ ) )
{
checkAlbertaDimensions< dim, dimworld >();
if( projection != 0 )
{
Alberta::DuneGlobalBoundaryProjectionFactory< dimension > projectionFactory( projection );
numBoundarySegments_ = mesh_.create( macroData, projectionFactory );
}
else
numBoundarySegments_ = mesh_.create( macroData );
if( !mesh_ )
DUNE_THROW( AlbertaError, "Invalid macro data structure." );
setup();
hIndexSet_.create();
calcExtras();
}
template < int dim, int dimworld >
inline AlbertaGrid< dim, dimworld >
::AlbertaGrid ( const std::string ¯oGridFileName )
: mesh_(),
maxlevel_( 0 ),
hIndexSet_( dofNumbering_ ),
idSet_( hIndexSet_ ),
levelIndexVec_( (size_t)MAXL, 0 ),
leafIndexSet_ ( 0 ),
sizeCache_( *this ),
leafMarkerVector_( dofNumbering_ ),
levelMarkerVector_( (size_t)MAXL, MarkerVector( dofNumbering_ ) )
{
checkAlbertaDimensions< dim, dimworld >();
numBoundarySegments_ = mesh_.create( macroGridFileName );
if( !mesh_ )
{
DUNE_THROW( AlbertaIOError,
"Grid file '" << macroGridFileName
<< "' is not in ALBERTA macro triangulation format." );
}
setup();
hIndexSet_.create();
calcExtras();
std::cout << typeName() << " created from macro grid file '"
<< macroGridFileName << "'." << std::endl;
}
template< int dim, int dimworld >
inline void AlbertaGrid< dim, dimworld >::setup ()
{
dofNumbering_.create( mesh_ );
levelProvider_.create( dofNumbering_ );
#if DUNE_ALBERTA_CACHE_COORDINATES
coordCache_.create( dofNumbering_ );
#endif
}
template< int dim, int dimworld >
inline void AlbertaGrid< dim, dimworld >::removeMesh ()
{
for( size_t i = 0; i < levelIndexVec_.size(); ++i )
{
if( levelIndexVec_[ i ] != 0 )
delete levelIndexVec_[ i ];
levelIndexVec_[ i ] = 0;
}
if( leafIndexSet_ != 0 )
delete leafIndexSet_;
leafIndexSet_ = 0;
// release dof vectors
hIndexSet_.release();
levelProvider_.release();
#if DUNE_ALBERTA_CACHE_COORDINATES
coordCache_.release();
#endif
dofNumbering_.release();
sizeCache_.reset();
mesh_.release();
}
template< int dim, int dimworld >
inline AlbertaGrid< dim, dimworld >::~AlbertaGrid ()
{
removeMesh();
}
template< int dim, int dimworld >
template< int codim, PartitionIteratorType pitype >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::template Partition<pitype>::LevelIterator
AlbertaGrid< dim, dimworld >::lbegin ( int level ) const
{
typedef AlbertaGridLevelIterator< codim, pitype, const This > LevelIteratorImp;
assert( level >= 0 );
if( level > maxlevel_ )
return lend< codim, pitype >( level );
MarkerVector &markerVector = levelMarkerVector_[ level ];
if( (codim > 0) && !markerVector.up2Date() )
markerVector.template markSubEntities< 1 >( lbegin< 0 >( level ), lend< 0 >( level ) );
return LevelIteratorImp( *this, &markerVector, level );
}
template< int dim, int dimworld >
template< int codim, PartitionIteratorType pitype >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::template Partition< pitype >::LevelIterator
AlbertaGrid < dim, dimworld >::lend ( int level ) const
{
typedef AlbertaGridLevelIterator< codim, pitype, const This > LevelIteratorImp;
assert( level >= 0 );
return LevelIteratorImp( *this, level );
}
template< int dim, int dimworld >
template< int codim >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::LevelIterator
AlbertaGrid < dim, dimworld >::lbegin ( int level ) const
{
return lbegin< codim, All_Partition >( level );
}
template< int dim, int dimworld >
template< int codim >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::LevelIterator
AlbertaGrid< dim, dimworld >::lend ( int level ) const
{
return lend< codim, All_Partition >( level );
}
template< int dim, int dimworld >
template< int codim, PartitionIteratorType pitype >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::template Partition< pitype >::LeafIterator
AlbertaGrid< dim, dimworld >::leafbegin () const
{
typedef AlbertaGridLeafIterator< codim, pitype, const This > LeafIteratorImp;
MarkerVector &markerVector = leafMarkerVector_;
const int firstMarkedCodim = 2;
if( (codim >= firstMarkedCodim) && !markerVector.up2Date() )
markerVector.template markSubEntities< firstMarkedCodim >( leafbegin< 0 >(), leafend< 0 >() );
return LeafIteratorImp( *this, &markerVector, maxlevel_ );
}
template< int dim, int dimworld >
template< int codim, PartitionIteratorType pitype >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::template Partition< pitype >::LeafIterator
AlbertaGrid< dim, dimworld >::leafend () const
{
typedef AlbertaGridLeafIterator< codim, pitype, const This > LeafIteratorImp;
return LeafIteratorImp( *this, maxlevel_ );
}
template< int dim, int dimworld >
template< int codim >
inline typename AlbertaGrid<dim,dimworld>::Traits
::template Codim< codim >::LeafIterator
AlbertaGrid< dim, dimworld >::leafbegin () const
{
return leafbegin< codim, All_Partition >();
}
template< int dim, int dimworld >
template< int codim >
inline typename AlbertaGrid< dim, dimworld >::Traits
::template Codim< codim >::LeafIterator
AlbertaGrid < dim, dimworld >::leafend () const
{
return leafend< codim, All_Partition >();
}
template< int dim, int dimworld >
inline void AlbertaGrid< dim, dimworld >::globalRefine ( int refCount )
{
typedef typename Traits::template Codim< 0 >::LeafIterator LeafIterator;
// only MAXL levels allowed
assert( (refCount >= 0) && (refCount + maxlevel_ < MAXL) );
for( int i = 0; i < refCount; ++i )
{
// mark all interior elements
const LeafIterator endit = leafend< 0 >();
for( LeafIterator it = leafbegin< 0 >(); it != endit; ++it )
mark( 1, *it );
preAdapt();
adapt();
postAdapt();
}
}
template< int dim, int dimworld >
template< class DataHandle >
inline void AlbertaGrid< dim, dimworld >
::globalRefine ( int refCount, AdaptDataHandleInterface< This, DataHandle > &handle )
{
typedef typename Traits::template Codim< 0 >::LeafIterator LeafIterator;
// only MAXL levels allowed
assert( (refCount >= 0) && (refCount + maxlevel_ < MAXL) );
for( int i = 0; i < refCount; ++i )
{
// mark all interior elements
const LeafIterator endit = leafend< 0 >();
for( LeafIterator it = leafbegin< 0 >(); it != endit; ++it )
mark( 1, *it );
adapt( handle );
}
}
template< int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >::preAdapt ()
{
adaptationState_.preAdapt();
return adaptationState_.coarsen();
}
template < int dim, int dimworld >
inline void AlbertaGrid < dim, dimworld >::postAdapt ()
{
#ifndef NDEBUG
if( leafIndexSet_ != 0 )
{
bool consistent = true;
for( int codim = 0; codim <= dimension; ++codim )
{
if( leafIndexSet_->size( codim ) == mesh_.size( codim ) )
continue;
std::cerr << "Incorrect size of leaf index set for codimension "
<< codim << "!" << std::endl;
std::cerr << "DUNE index set reports: " << leafIndexSet_->size( codim )
<< std::endl;
std::cerr << "ALBERTA mesh reports: " << mesh_.size( codim ) << std::endl;
consistent = false;
}
if( !consistent )
abort();
}
#endif
levelProvider_.markAllOld();
adaptationState_.postAdapt();
}
template< int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >
::mark( int refCount, const typename Traits::template Codim< 0 >::Entity &e )
{
// if not leaf entity, leave method
if( !e.isLeaf() )
return false;
// don't mark macro elements for coarsening
if( refCount < -e.level() )
return false;
// take back previous marking
adaptationState_.unmark( getMark( e ) );
// set new marking
adaptationState_.mark( refCount );
getRealImplementation( e ).elementInfo().setMark( refCount );
return true;
}
template< int dim, int dimworld >
inline int AlbertaGrid< dim, dimworld >
::getMark( const typename Traits::template Codim< 0 >::Entity &e ) const
{
return getRealImplementation( e ).elementInfo().getMark();
}
template< int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >::adapt ()
{
// this is already done in postAdapt
//levelProvider_.markAllOld();
// adapt mesh
hIndexSet_.preAdapt();
const bool refined = mesh_.refine();
const bool coarsened = (adaptationState_.coarsen() ? mesh_.coarsen() : false);
adaptationState_.adapt();
hIndexSet_.postAdapt();
if( refined || coarsened )
calcExtras();
// return true if elements were created
return refined;
}
template< int dim, int dimworld >
template< class DataHandle >
inline bool AlbertaGrid < dim, dimworld >
::adapt ( AdaptDataHandleInterface< This, DataHandle > &handle )
{
// minimum number of elements assumed to be created during adaptation
const int defaultElementChunk = 100;
preAdapt();
const int refineMarked = adaptationState_.refineMarked();
handle.preAdapt( std::max( defaultElementChunk, 4*refineMarked ) );
typedef Alberta::AdaptRestrictProlongHandler
< This, AdaptDataHandleInterface< This, DataHandle > >
DataHandler;
DataHandler dataHandler( *this, handle );
typedef AdaptationCallback< DataHandler > Callback;
typename Callback::DofVectorPointer callbackVector;
callbackVector.create( dofNumbering_.emptyDofSpace(), "Adaptation Callback" );
callbackVector.template setupInterpolation< Callback >();
callbackVector.template setupRestriction< Callback >();
if( Callback::DofVectorPointer::supportsAdaptationData )
callbackVector.setAdaptationData( &dataHandler );
else
Alberta::adaptationDataHandler_ = &dataHandler;
bool refined = adapt();
if( !Callback::DofVectorPointer::supportsAdaptationData )
Alberta::adaptationDataHandler_ = 0;
callbackVector.release();
handle.postAdapt();
postAdapt();
return refined;
}
template< int dim, int dimworld >
inline const Alberta::GlobalVector &
AlbertaGrid< dim, dimworld >
::getCoord ( const ElementInfo &elementInfo, int vertex ) const
{
assert( (vertex >= 0) && (vertex <= dim) );
#if DUNE_ALBERTA_CACHE_COORDINATES
return coordCache_( elementInfo, vertex );
#else
return elementInfo.coordinate( vertex );
#endif
}
template < int dim, int dimworld >
inline int AlbertaGrid < dim, dimworld >::maxLevel() const
{
return maxlevel_;
}
template< int dim, int dimworld >
inline int AlbertaGrid< dim, dimworld >::size ( int level, int codim ) const
{
return ((level >= 0) && (level <= maxlevel_) ? sizeCache_.size( level, codim ) : 0);
}
template< int dim, int dimworld >
inline int AlbertaGrid< dim, dimworld >::size ( int level, GeometryType type ) const
{
return ((level >= 0) && (level <= maxlevel_) ? sizeCache_.size( level, type ) : 0);
}
template< int dim, int dimworld >
inline int AlbertaGrid< dim, dimworld >::size ( int codim ) const
{
assert( sizeCache_.size( codim ) == mesh_.size( codim ) );
return mesh_.size( codim );
}
template< int dim, int dimworld >
inline int AlbertaGrid< dim, dimworld >::size ( GeometryType type ) const
{
return sizeCache_.size( type );
}
template < int dim, int dimworld >
inline const typename AlbertaGrid < dim, dimworld > :: Traits :: LevelIndexSet &
AlbertaGrid < dim, dimworld > :: levelIndexSet (int level) const
{
// assert that given level is in range
assert( (level >= 0) && (level < (int)levelIndexVec_.size()) );
if( levelIndexVec_[ level ] == 0 )
{
levelIndexVec_[ level ] = new typename GridFamily::LevelIndexSetImp ( dofNumbering_ );
levelIndexVec_[ level ]->update( lbegin< 0 >( level ), lend< 0 >( level ) );
}
return *(levelIndexVec_[ level ]);
}
template < int dim, int dimworld >
inline const typename AlbertaGrid < dim, dimworld > :: Traits :: LeafIndexSet &
AlbertaGrid < dim, dimworld > :: leafIndexSet () const
{
if( leafIndexSet_ == 0 )
{
leafIndexSet_ = new typename GridFamily::LeafIndexSetImp( dofNumbering_ );
leafIndexSet_->update( leafbegin< 0 >(), leafend< 0 >() );
}
return *leafIndexSet_;
}
template < int dim, int dimworld >
inline void AlbertaGrid < dim, dimworld >::calcExtras ()
{
// determine new maxlevel
maxlevel_ = levelProvider_.maxLevel();
assert( (maxlevel_ >= 0) && (maxlevel_ < MAXL) );
// unset up2Dat status, if lbegin is called then this status is updated
for( int l = 0; l < MAXL; ++l )
levelMarkerVector_[ l ].clear();
// unset up2Dat status, if leafbegin is called then this status is updated
leafMarkerVector_.clear();
sizeCache_.reset();
// update index sets (if they exist)
if( leafIndexSet_ != 0 )
leafIndexSet_->update( leafbegin< 0 >(), leafend< 0 >() );
for( unsigned int level = 0; level < levelIndexVec_.size(); ++level )
{
if( levelIndexVec_[ level ] )
levelIndexVec_[ level ]->update( lbegin< 0 >( level ), lend< 0 >( level ) );
}
}
template< int dim, int dimworld >
template< GrapeIOFileFormatType format >
inline bool AlbertaGrid< dim, dimworld >
::writeGrid ( const std::string &filename, ctype time ) const
{
switch( format )
{
case xdr:
return writeGridXdr( filename, time );
case ascii:
DUNE_THROW( NotImplemented, "AlbertaGrid does not support writeGrid< ascii >." );
// write leaf grid as macro triangulation
//int ret = ALBERTA write_macro( mesh_ , filename.c_str() );
//return (ret == 1) ? true : false;
default:
DUNE_THROW( NotImplemented, "AlbertaGrid: Unknown output format: " << format << "." );
}
return false;
}
template< int dim, int dimworld >
template< GrapeIOFileFormatType format >
inline bool AlbertaGrid< dim, dimworld >
::readGrid ( const std::string &filename, ctype &time )
{
switch( format )
{
case xdr:
return readGridXdr( filename, time );
case ascii:
DUNE_THROW( NotImplemented, "AlbertaGrid does not support readGrid< ascii >." );
//return readGridAscii (filename , time );
default:
DUNE_THROW( NotImplemented, "AlbertaGrid: Unknown output format: " << format << "." );
}
return false;
}
template< int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >
::writeGridXdr ( const std::string &filename, ctype time ) const
{
if( filename.size() <= 0 )
DUNE_THROW( AlbertaIOError, "No filename given to writeGridXdr." );
return (mesh_.write( filename, time ) && hIndexSet_.write( filename ));
}
template< int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >
::readGridXdr ( const std::string &filename, ctype &time )
{
typedef Alberta::FillFlags< dim > FillFlags;
//removeMesh();
if( filename.size() <= 0 )
return false;
numBoundarySegments_ = mesh_.read( filename, time );
if( !mesh_ )
DUNE_THROW( AlbertaIOError, "Could not read grid file: " << filename << "." );
setup();
hIndexSet_.read( filename );
// calc maxlevel and indexOnLevel and so on
calcExtras();
return true;
}
#if 0
template < int dim, int dimworld >
inline bool AlbertaGrid< dim, dimworld >
::readGridAscii ( const std::string &filename, ctype &time )
{
removeMesh(); // delete all objects
mesh_.create( "AlbertaGrid", filename.c_str() );
time = 0.0;
// unset up2Dat status, if lbegin is called then this status is updated
for( int l = 0; l < MAXL; l++ )
levelMarkerVector_[ l ].unsetUp2Date();
// unset up2Dat status, if leafbegin is called then this status is updated
leafMarkerVector_.unsetUp2Date();
setup();
hIndexSet_.create( dofNumbering_ );
calcExtras();
return true;
}
#endif
// AlbertaGrid::AdaptationCallback
// -------------------------------
template< int dim, int dimworld >
template< class DataHandler >
struct AlbertaGrid< dim, dimworld >::AdaptationCallback
{
static const int dimension = dim;
typedef Alberta::DofVectorPointer< Alberta::GlobalVector > DofVectorPointer;
typedef Alberta::Patch< dimension > Patch;
static DataHandler &getDataHandler ( const DofVectorPointer &dofVector )
{
DataHandler *dataHandler;
if( DofVectorPointer::supportsAdaptationData )
dataHandler = dofVector.getAdaptationData< DataHandler >();
else
dataHandler = (DataHandler *)Alberta::adaptationDataHandler_;
assert( dataHandler != 0 );
return *dataHandler;
}
static void interpolateVector ( const DofVectorPointer &dofVector,
const Patch &patch )
{
DataHandler &dataHandler = getDataHandler( dofVector );
for( int i = 0; i < patch.count(); ++i )
dataHandler.prolongLocal( patch, i );
}
static void restrictVector ( const DofVectorPointer &dofVector,
const Patch &patch )
{
DataHandler &dataHandler = getDataHandler( dofVector );
for( int i = 0; i < patch.count(); ++i )
dataHandler.restrictLocal( patch, i );
}
};
} // namespace Dune
#endif
|