/usr/include/dune/grid/geometrygrid/grid.hh is in libdune-grid-dev 2.3.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 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 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_GEOGRID_GRID_HH
#define DUNE_GEOGRID_GRID_HH
#include <dune/common/nullptr.hh>
#include <dune/common/static_assert.hh>
#include <dune/grid/common/grid.hh>
#include <dune/grid/geometrygrid/backuprestore.hh>
#include <dune/grid/geometrygrid/capabilities.hh>
#include <dune/grid/geometrygrid/datahandle.hh>
#include <dune/grid/geometrygrid/gridfamily.hh>
#include <dune/grid/geometrygrid/identity.hh>
#include <dune/grid/geometrygrid/persistentcontainer.hh>
namespace Dune
{
// DefaultCoordFunction
// --------------------
template< class HostGrid >
class DefaultCoordFunction
: public IdenticalCoordFunction< typename HostGrid::ctype, HostGrid::dimensionworld >
{};
// GeometryGrid
// ------------
/** \class GeometryGrid
* \brief grid wrapper replacing the geometries
* \ingroup GeoGrid
*
* GeometryGrid wraps another DUNE grid and replaces its geometry by the
* generic geometries from dune-grid. These are linear (respectively
* n-linear) DUNE geometries interpolating some given corners. These corners
* are obtained by mapping the corners of the host grid's geometry (also
* called host geometry) by a coordinate function.
*
* An example of a coordinate function is given by the following code:
* \code
* class ExampleFunction
* : public Dune :: AnalyticalCoordFunction< double, 2, 3, ExampleFunction >
* {
* typedef ExampleFunction This;
* typedef Dune :: AnalyticalCoordFunction< double, 2, 3, This > Base;
*
* public:
* typedef Base :: DomainVector DomainVector;
* typedef Base :: RangeVector RangeVector;
*
* void evaluate ( const DomainVector &x, RangeVector &y ) const
* {
* y[ 0 ] = x[ 0 ];
* y[ 1 ] = x[ 1 ];
* y[ 2 ] = x[ 0 ] + x[ 1 ];
* }
* };
* \endcode
*
* \note A dune-fem Function can be used as a coordinate function.
* The evaluation of discrete functions would be very expensive,
* though.
*
* \tparam HostGrid DUNE grid to be wrapped (called host grid)
* \tparam CoordFunction coordinate function
*
* \nosubgrouping
*/
template< class HostGrid, class CoordFunction = DefaultCoordFunction< HostGrid >, class Allocator = std::allocator< void > >
class GeometryGrid
/** \cond */
: public GridDefaultImplementation
< HostGrid::dimension, CoordFunction::dimRange, typename HostGrid::ctype,
GeoGrid::GridFamily< HostGrid, CoordFunction, Allocator > >,
public GeoGrid::ExportParams< HostGrid, CoordFunction >,
public GeoGrid::BackupRestoreFacilities< GeometryGrid< HostGrid, CoordFunction, Allocator > >
/** \endcond */
{
typedef GeometryGrid< HostGrid, CoordFunction, Allocator > Grid;
typedef GridDefaultImplementation
< HostGrid::dimension, CoordFunction::dimRange, typename HostGrid::ctype,
GeoGrid::GridFamily< HostGrid, CoordFunction, Allocator > >
Base;
friend class GeoGrid::HierarchicIterator< const Grid >;
template< int, class, bool > friend class GeoGrid::EntityBase;
template< class, bool > friend class GeoGrid::EntityPointer;
template< int, class > friend class GeoGrid::EntityProxy;
template< int, int, class > friend class GeoGrid::Geometry;
template< class, class, class, PartitionIteratorType > friend class GeoGrid::GridView;
template< class, class > friend class GeoGrid::Intersection;
template< class, class > friend class GeoGrid::IntersectionIterator;
template< class, class > friend class GeoGrid::IdSet;
template< class, class > friend class GeoGrid::IndexSet;
template< class > friend struct HostGridAccess;
template< class, class > friend class GeoGrid::CommDataHandle;
public:
/** \cond */
typedef GeoGrid::GridFamily< HostGrid, CoordFunction, Allocator > GridFamily;
/** \endcond */
/** \name Traits
* \{ */
//! type of the grid traits
typedef typename GridFamily::Traits Traits;
/** \brief traits structure containing types for a codimension
*
* \tparam codim codimension
*
* \nosubgrouping
*/
template< int codim >
struct Codim;
/** \} */
/** \name Iterator Types
* \{ */
//! iterator over the grid hierarchy
typedef typename Traits::HierarchicIterator HierarchicIterator;
//! iterator over intersections with other entities on the leaf level
typedef typename Traits::LeafIntersectionIterator LeafIntersectionIterator;
//! iterator over intersections with other entities on the same level
typedef typename Traits::LevelIntersectionIterator LevelIntersectionIterator;
/** \} */
/** \name Grid View Types
* \{ */
/** \brief Types for GridView */
template< PartitionIteratorType pitype >
struct Partition
{
typedef typename GridFamily::Traits::template Partition< pitype >::LevelGridView
LevelGridView;
typedef typename GridFamily::Traits::template Partition< pitype >::LeafGridView
LeafGridView;
};
/** \brief View types for All_Partition */
typedef typename Partition< All_Partition >::LevelGridView LevelGridView;
typedef typename Partition< All_Partition >::LeafGridView LeafGridView;
/** \} */
/** \name Index and Id Set Types
* \{ */
/** \brief type of leaf index set
*
* The index set assigns consecutive indices to the entities of the
* leaf grid. The indices are of integral type and can be used to access
* arrays.
*
* The leaf index set is a model of Dune::IndexSet.
*/
typedef typename Traits::LeafIndexSet LeafIndexSet;
/** \brief type of level index set
*
* The index set assigns consecutive indices to the entities of a grid
* level. The indices are of integral type and can be used to access
* arrays.
*
* The level index set is a model of Dune::IndexSet.
*/
typedef typename Traits::LevelIndexSet LevelIndexSet;
/** \brief type of global id set
*
* The id set assigns a unique identifier to each entity within the
* grid. This identifier is unique over all processes sharing this grid.
*
* \note Id's are neither consecutive nor necessarily of an integral
* type.
*
* The global id set is a model of Dune::IdSet.
*/
typedef typename Traits::GlobalIdSet GlobalIdSet;
/** \brief type of local id set
*
* The id set assigns a unique identifier to each entity within the
* grid. This identifier needs only to be unique over this process.
*
* Though the local id set may be identical to the global id set, it is
* often implemented more efficiently.
*
* \note Ids are neither consecutive nor necessarily of an integral
* type.
* \note Local ids need not be compatible with global ids. Also, no
* mapping from local ids to global ones needs to exist.
*
* The global id set is a model of Dune::IdSet.
*/
typedef typename Traits::LocalIdSet LocalIdSet;
/** \} */
/** \name Miscellaneous Types
* \{ */
//! type of vector coordinates (e.g., double)
typedef typename Traits::ctype ctype;
//! communicator with all other processes having some part of the grid
typedef typename Traits::CollectiveCommunication CollectiveCommunication;
/** \} */
/** \name Construction and Destruction
* \{ */
/** \brief constructor
*
* The references to host grid and coordinate function are stored in the
* grid. Therefore, they must remain valid until the grid is destroyed.
*
* \param[in] hostGrid reference to the grid to wrap
* \param[in] coordFunction reference to the coordinate function
* \param[in] allocator storage allocator
*/
GeometryGrid ( HostGrid &hostGrid, CoordFunction &coordFunction, const Allocator &allocator = Allocator() )
: hostGrid_( &hostGrid ),
coordFunction_( coordFunction ),
removeHostGrid_( false ),
levelIndexSets_( hostGrid_->maxLevel()+1, nullptr, allocator ),
storageAllocator_( allocator )
{}
/** \brief constructor
*
* The grid takes ownership of the pointers to host grid and coordinate
* function. They will be deleted when the grid is destroyed.
*
* \param[in] hostGrid pointer to the grid to wrap
* \param[in] coordFunction pointer to the coordinate function
* \param[in] allocator storage allocator
*/
GeometryGrid ( HostGrid *hostGrid, CoordFunction *coordFunction, const Allocator &allocator = Allocator() )
: hostGrid_( hostGrid ),
coordFunction_( *coordFunction ),
removeHostGrid_( true ),
levelIndexSets_( hostGrid_->maxLevel()+1, nullptr, allocator ),
storageAllocator_( allocator )
{}
/** \brief destructor
*/
~GeometryGrid ()
{
for( unsigned int i = 0; i < levelIndexSets_.size(); ++i )
{
if( levelIndexSets_[ i ] )
delete( levelIndexSets_[ i ] );
}
if( removeHostGrid_ )
{
delete &coordFunction_;
delete hostGrid_;
}
}
/** \} */
/** \name Size Methods
* \{ */
/** \brief obtain maximal grid level
*
* Grid levels are numbered 0, ..., L, where L is the value returned by
* this method.
*
* \returns maximal grid level
*/
int maxLevel () const
{
return hostGrid().maxLevel();
}
/** \brief obtain number of entites on a level
*
* \param[in] level level to consider
* \param[in] codim codimension to consider
*
* \returns number of entities of codimension \em codim on grid level
* \em level.
*/
int size ( int level, int codim ) const
{
return levelView( level ).size( codim );
}
/** \brief obtain number of leaf entities
*
* \param[in] codim codimension to consider
*
* \returns number of leaf entities of codimension \em codim
*/
int size ( int codim ) const
{
return leafView().size( codim );
}
/** \brief obtain number of entites on a level
*
* \param[in] level level to consider
* \param[in] type geometry type to consider
*
* \returns number of entities with a geometry of type \em type on grid
* level \em level.
*/
int size ( int level, GeometryType type ) const
{
return levelView( level ).size( type );
}
/** \brief obtain number of leaf entities
*
* \returns number of leaf entities with a geometry of type \em type
*/
int size ( GeometryType type ) const
{
return leafView().size( type );
}
/** \brief returns the number of boundary segments within the macro grid
*
* \returns number of boundary segments within the macro grid
*/
size_t numBoundarySegments () const
{
return hostGrid().numBoundarySegments( );
}
/** \} */
template< int codim >
typename Codim< codim >::LevelIterator lbegin ( int level ) const
{
return levelView( level ).template begin< codim >();
}
template< int codim >
typename Codim< codim >::LevelIterator lend ( int level ) const
{
return levelView( level ).template end< codim >();
}
template< int codim, PartitionIteratorType pitype >
typename Codim< codim >::template Partition< pitype >::LevelIterator
lbegin ( int level ) const
{
return levelView( level ).template begin< codim, pitype >();
}
template< int codim, PartitionIteratorType pitype >
typename Codim< codim >::template Partition< pitype >::LevelIterator
lend ( int level ) const
{
return levelView( level ).template end< codim, pitype >();
}
template< int codim >
typename Codim< codim >::LeafIterator leafbegin () const
{
return leafView().template begin< codim >();
}
template< int codim >
typename Codim< codim >::LeafIterator leafend () const
{
return leafView().template end< codim >();
}
template< int codim, PartitionIteratorType pitype >
typename Codim< codim >::template Partition< pitype >::LeafIterator
leafbegin () const
{
return leafView().template begin< codim, pitype >();
}
template< int codim, PartitionIteratorType pitype >
typename Codim< codim >::template Partition< pitype >::LeafIterator
leafend () const
{
return leafView().template end< codim, pitype >();
}
const GlobalIdSet &globalIdSet () const
{
if( !globalIdSet_ )
globalIdSet_ = GlobalIdSet( hostGrid().globalIdSet() );
assert( globalIdSet_ );
return globalIdSet_;
}
const LocalIdSet &localIdSet () const
{
if( !localIdSet_ )
localIdSet_ = LocalIdSet( hostGrid().localIdSet() );
assert( localIdSet_ );
return localIdSet_;
}
const LevelIndexSet &levelIndexSet ( int level ) const
{
assert( levelIndexSets_.size() == (size_t)(maxLevel()+1) );
if( (level < 0) || (level > maxLevel()) )
{
DUNE_THROW( GridError, "LevelIndexSet for nonexisting level " << level
<< " requested." );
}
LevelIndexSet *&levelIndexSet = levelIndexSets_[ level ];
if( !levelIndexSet )
levelIndexSet = new LevelIndexSet( hostGrid().levelIndexSet( level ) );
assert( levelIndexSet );
return *levelIndexSet;
}
const LeafIndexSet &leafIndexSet () const
{
if( !leafIndexSet_ )
leafIndexSet_ = LeafIndexSet( hostGrid().leafIndexSet() );
assert( leafIndexSet_ );
return leafIndexSet_;
}
void globalRefine ( int refCount )
{
hostGrid().globalRefine( refCount );
update();
}
bool mark ( int refCount, const typename Codim< 0 >::Entity &entity )
{
return hostGrid().mark( refCount, getHostEntity< 0 >( entity ) );
}
int getMark ( const typename Codim< 0 >::Entity &entity ) const
{
return hostGrid().getMark( getHostEntity< 0 >( entity ) );
}
bool preAdapt ()
{
return hostGrid().preAdapt();
}
bool adapt ()
{
bool ret = hostGrid().adapt();
update();
return ret;
}
void postAdapt ()
{
hostGrid().postAdapt();
}
/** \name Parallel Data Distribution and Communication Methods
* \{ */
/** \brief obtain size of overlap region for the leaf grid
*
* \param[in] codim codimension for with the information is desired
*/
int overlapSize ( int codim ) const
{
return leafView().overlapSize( codim );
}
/** \brief obtain size of ghost region for the leaf grid
*
* \param[in] codim codimension for with the information is desired
*/
int ghostSize( int codim ) const
{
return leafView().ghostSize( codim );
}
/** \brief obtain size of overlap region for a grid level
*
* \param[in] level grid level (0, ..., maxLevel())
* \param[in] codim codimension (0, ..., dimension)
*/
int overlapSize ( int level, int codim ) const
{
return levelView( level ).overlapSize( codim );
}
/** \brief obtain size of ghost region for a grid level
*
* \param[in] level grid level (0, ..., maxLevel())
* \param[in] codim codimension (0, ..., dimension)
*/
int ghostSize ( int level, int codim ) const
{
return levelView( level ).ghostSize( codim );
}
/** \brief communicate information on a grid level
*
* \param dataHandle communication data handle (user defined)
* \param[in] interface communication interface (one of
* InteriorBorder_InteriorBorder_Interface,
* InteriorBorder_All_Interface,
* Overlap_OverlapFront_Interface,
* Overlap_All_Interface,
* All_All_Interface)
* \param[in] direction communication direction (one of
* ForwardCommunication or BackwardCommunication)
* \param[in] level grid level to communicate
*/
template< class DataHandle, class Data >
void communicate ( CommDataHandleIF< DataHandle, Data > &dataHandle,
InterfaceType interface,
CommunicationDirection direction,
int level ) const
{
levelView( level ).communicate( dataHandle, interface, direction );
}
/** \brief communicate information on leaf entities
*
* \param dataHandle communication data handle (user defined)
* \param[in] interface communication interface (one of
* InteriorBorder_InteriorBorder_Interface,
* InteriorBorder_All_Interface,
* Overlap_OverlapFront_Interface,
* Overlap_All_Interface,
* All_All_Interface)
* \param[in] direction communication direction (one of
* ForwardCommunication, BackwardCommunication)
*/
template< class DataHandle, class Data >
void communicate ( CommDataHandleIF< DataHandle, Data > &dataHandle,
InterfaceType interface,
CommunicationDirection direction ) const
{
leafView().communicate( dataHandle, interface, direction );
}
/** \brief obtain CollectiveCommunication object
*
* The CollectiveCommunication object should be used to globally
* communicate information between all processes sharing this grid.
*
* \note The CollectiveCommunication object returned is identical to the
* one returned by the host grid.
*/
const CollectiveCommunication &comm () const
{
return hostGrid().comm();
}
#if 0
// data handle interface different between geo and interface
/** \brief rebalance the load each process has to handle
*
* A parallel grid is redistributed such that each process has about
* the same load (e.g., the same number of leaf entites).
*
* \note DUNE does not specify, how the load is measured.
*
* \returns \b true, if the grid has changed.
*/
bool loadBalance ()
{
const bool gridChanged= hostGrid().loadBalance();
if( gridChanged )
update();
return gridChanged;
}
/** \brief rebalance the load each process has to handle
*
* A parallel grid is redistributed such that each process has about
* the same load (e.g., the same number of leaf entites).
*
* The data handle is used to communicate the data associated with
* entities that move from one process to another.
*
* \note DUNE does not specify, how the load is measured.
*
* \param datahandle communication data handle (user defined)
*
* \returns \b true, if the grid has changed.
*/
template< class DataHandle, class Data >
bool loadBalance ( CommDataHandleIF< DataHandle, Data > &datahandle )
{
typedef CommDataHandleIF< DataHandle, Data > DataHandleIF;
typedef GeoGrid :: CommDataHandle< Grid, DataHandleIF > WrappedDataHandle;
WrappedDataHandle wrappedDataHandle( *this, datahandle );
const bool gridChanged = hostGrid().loadBalance( wrappedDataHandle );
if( gridChanged )
update();
return gridChanged;
}
#endif
/** \brief obtain EntityPointer from EntitySeed. */
template< class EntitySeed >
typename Traits::template Codim< EntitySeed::codimension >::EntityPointer
entityPointer ( const EntitySeed &seed ) const
{
typedef typename Traits::template Codim< EntitySeed::codimension >::EntityPointerImpl EntityPointerImpl;
return EntityPointerImpl( *this, seed );
}
/** \} */
/** \name Grid Views
* \{ */
/** \brief View for a grid level */
template< PartitionIteratorType pitype >
typename Partition< pitype >::LevelGridView levelView ( int level ) const
{
typedef typename Partition< pitype >::LevelGridView View;
typedef typename View::GridViewImp ViewImp;
return View( ViewImp( *this, hostGrid().levelView( level ) ) );
}
template< PartitionIteratorType pitype >
typename Partition< pitype >::LevelGridView levelGridView ( int level ) const
{
return levelView<pitype>(level);
}
/** \brief View for the leaf grid */
template< PartitionIteratorType pitype >
typename Partition< pitype >::LeafGridView leafView () const
{
typedef typename Traits::template Partition< pitype >::LeafGridView View;
typedef typename View::GridViewImp ViewImp;
return View( ViewImp( *this, hostGrid().leafView() ) );
}
template< PartitionIteratorType pitype >
typename Partition< pitype >::LeafGridView leafGridView () const
{
return leafGridView<pitype>();
}
/** \brief View for a grid level for All_Partition */
LevelGridView levelView ( int level ) const
{
typedef typename LevelGridView::GridViewImp ViewImp;
return LevelGridView( ViewImp( *this, hostGrid().levelView( level ) ) );
}
LevelGridView levelGridView ( int level ) const
{
return levelView(level);
}
/** \brief View for the leaf grid for All_Partition*/
LeafGridView leafView () const
{
typedef typename LeafGridView::GridViewImp ViewImp;
return LeafGridView( ViewImp( *this, hostGrid().leafView() ) );
}
LeafGridView leafGridView () const
{
return leafView();
}
/** \} */
/** \name Miscellaneous Methods
* \{ */
const HostGrid &hostGrid () const
{
return *hostGrid_;
}
HostGrid &hostGrid ()
{
return *hostGrid_;
}
/** \brief update grid caches
*
* This method has to be called whenever the underlying host grid changes.
*
* \note If you adapt the host grid through this geometry grid's
* adaptation or load balancing methods, update is automatically
* called.
*/
void update ()
{
// adapt the coordinate function
GeoGrid::AdaptCoordFunction< typename CoordFunction::Interface >::adapt( coordFunction_ );
const int newNumLevels = maxLevel()+1;
const int oldNumLevels = levelIndexSets_.size();
for( int i = newNumLevels; i < oldNumLevels; ++i )
{
if( levelIndexSets_[ i ] )
delete levelIndexSets_[ i ];
}
levelIndexSets_.resize( newNumLevels, nullptr );
}
/** \} */
using Base::getRealImplementation;
protected:
const CoordFunction &coordFunction () const
{
return coordFunction_;
}
template< int codim >
static const typename HostGrid::template Codim< codim >::Entity &
getHostEntity( const typename Codim< codim >::Entity &entity )
{
return getRealImplementation( entity ).hostEntity();
}
void *allocateStorage ( std::size_t size ) const
{
return storageAllocator_.allocate( size );
}
void deallocateStorage ( void *p, std::size_t size ) const
{
storageAllocator_.deallocate( (char *)p, size );
}
private:
HostGrid *const hostGrid_;
CoordFunction &coordFunction_;
bool removeHostGrid_;
mutable std::vector< LevelIndexSet *, typename Allocator::template rebind< LevelIndexSet * >::other > levelIndexSets_;
mutable LeafIndexSet leafIndexSet_;
mutable GlobalIdSet globalIdSet_;
mutable LocalIdSet localIdSet_;
mutable typename Allocator::template rebind< char >::other storageAllocator_;
};
// GeometryGrid::Codim
// -------------------
template< class HostGrid, class CoordFunction, class Allocator >
template< int codim >
struct GeometryGrid< HostGrid, CoordFunction, Allocator >::Codim
: public Base::template Codim< codim >
{
/** \name Entity and Entity Pointer Types
* \{ */
/** \brief type of entity
*
* The entity is a model of Dune::Entity.
*/
typedef typename Traits::template Codim< codim >::Entity Entity;
/** \brief type of entity pointer
*
* The entity pointer is a model of Dune::EntityPointer.
*/
typedef typename Traits::template Codim< codim >::EntityPointer EntityPointer;
/** \} */
/** \name Geometry Types
* \{ */
/** \brief type of world geometry
*
* Models the geomtry mapping of the entity, i.e., the mapping from the
* reference element into world coordinates.
*
* The geometry is a model of Dune::Geometry, implemented through the
* generic geometries provided by dune-grid.
*/
typedef typename Traits::template Codim< codim >::Geometry Geometry;
/** \brief type of local geometry
*
* Models the geomtry mapping into the reference element of dimension
* \em dimension.
*
* The local geometry is a model of Dune::Geometry, implemented through
* the generic geometries provided by dune-grid.
*/
typedef typename Traits::template Codim< codim >::LocalGeometry LocalGeometry;
/** \} */
/** \name Iterator Types
* \{ */
template< PartitionIteratorType pitype >
struct Partition
{
typedef typename Traits::template Codim< codim >
::template Partition< pitype >::LeafIterator
LeafIterator;
typedef typename Traits::template Codim< codim >
::template Partition< pitype >::LevelIterator
LevelIterator;
};
/** \brief type of level iterator
*
* This iterator enumerates the entites of codimension \em codim of a
* grid level.
*
* The level iterator is a model of Dune::LevelIterator.
*/
typedef typename Partition< All_Partition >::LeafIterator LeafIterator;
/** \brief type of leaf iterator
*
* This iterator enumerates the entites of codimension \em codim of the
* leaf grid.
*
* The leaf iterator is a model of Dune::LeafIterator.
*/
typedef typename Partition< All_Partition >::LevelIterator LevelIterator;
/** \} */
};
} // namespace Dune
#endif // #ifndef DUNE_GEOGRID_GRID_HH
|