/usr/include/dune/grid/albertagrid/agrid.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 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 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_ALBERTAGRID_IMP_HH
#define DUNE_ALBERTAGRID_IMP_HH
/** \file
* \author Robert Kloefkorn and Martin Nolte
* \brief provides the AlbertaGrid class
*/
#if HAVE_ALBERTA || DOXYGEN
#include <cassert>
#include <cstddef>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <memory>
#include <vector>
// Dune includes
#include <dune/common/deprecated.hh>
#include <dune/common/fvector.hh>
#include <dune/common/fmatrix.hh>
#include <dune/common/stdstreams.hh>
#include <dune/common/parallel/collectivecommunication.hh>
#include <dune/grid/common/grid.hh>
#include <dune/grid/common/gridfactory.hh>
#include <dune/grid/common/adaptcallback.hh>
#include <dune/grid/common/sizecache.hh>
//- Local includes
// some cpp defines and include of alberta.h
#include "albertaheader.hh"
#include <dune/grid/albertagrid/misc.hh>
#include <dune/grid/albertagrid/capabilities.hh>
#include <dune/grid/albertagrid/backuprestore.hh>
#include <dune/grid/albertagrid/coordcache.hh>
#include <dune/grid/albertagrid/gridfamily.hh>
#include <dune/grid/albertagrid/level.hh>
#include <dune/grid/albertagrid/intersection.hh>
#include <dune/grid/albertagrid/intersectioniterator.hh>
#include <dune/grid/albertagrid/datahandle.hh>
#include <dune/grid/albertagrid/entityseed.hh>
#include "indexsets.hh"
#include "geometry.hh"
#include "entity.hh"
#include "entitypointer.hh"
#include "hierarchiciterator.hh"
#include "treeiterator.hh"
#include "leveliterator.hh"
#include "leafiterator.hh"
namespace Dune
{
// External Forward Declarations
// -----------------------------
template< class Grid >
struct DGFGridFactory;
// AlbertaGrid
// -----------
/** \class AlbertaGrid
* \brief [<em> provides \ref Dune::Grid </em>]
* \brief simplicial grid imlementation from the ALBERTA finite element
* toolbox
* \ingroup GridImplementations
* \ingroup AlbertaGrid
*
* AlbertaGrid provides access to the grid from the ALBERTA finite element
* toolbox through the %Dune interface.
*
* ALBERTA is a finite element toolbox written by Alfred Schmidt and
* Kunibert G. Siebert (see http://www.alberta-fem.de). It contains a
* simplicial mesh in 1, 2 and 3 space dimensions that can be dynamically
* adapted by a bisection algorithm.
*
* Supported ALBERTA versions include 2.0 or higher.
* It can be downloaded from the ALBERTA website (www.alberta-fem.de).
* After installing ALBERTA, just configure DUNE with the --with-alberta
* option and provide the path to ALBERTA.
*
* Each program linking to ALBERTA only supports a fixed dimension of world.
* This is obtained from the <tt>ALBERTA_DIM</tt> preprocessor variable,
* which defaults to <tt>WORLDDIM</tt>.
*
* Further installation instructions can be found here:
* http://www.dune-project.org/external_libraries/install_alberta.html
*
* If you use automake and want to compile a program maude, the following
* <tt>Makefile.am</tt> snippet might help:
* \code
* bin_PROGRAMS = maude
*
* ALBERTA_DIM = 2
*
* maude_SOURCES = maude.cc
* maude_CPPFLAGS = $(AM_CPPFLAGS) $(ALBERTA_CPPFLAGS)
* maude_LDFLAGS = $(AM_LDFLAGS) $(ALBERTA_LDFLAGS) $(DUNE_LDFLAGS)
* maude_LDADD = $(ALBERTA_LIBS) $(DUNE_LIBS)
* \endcode
* This will compile and link your program with the world dimension
* specified by <tt>WORLDDIM</tt>.
* If you want to use different world dimensions per program, you can use
* the following snippet in your <tt>Makefile.am</tt>:
* \code
* bin_PROGRAMS = maude2d maude3d
*
* maude2d_SOURCES = maude.cc
* maude2d_CPPFLAGS = $(AM_CPPFLAGS) $(ALBERTA2D_CPPFLAGS)
* maude2d_LDFLAGS = $(AM_LDFLAGS) $(ALBERTA2D_LDFLAGS) $(DUNE_LDFLAGS)
* maude2d_LDADD = $(ALBERTA2D_LIBS) $(DUNE_LIBS)
*
* maude3d_SOURCES = maude.cc
* maude3d_CPPFLAGS = $(AM_CPPFLAGS) $(ALBERTA3D_CPPFLAGS)
* maude3d_LDFLAGS = $(AM_LDFLAGS) $(ALBERTA3D_LDFLAGS) $(DUNE_LDFLAGS)
* maude3d_LDADD = $(ALBERTA3D_LIBS) $(DUNE_LIBS)
* \endcode
*
* In either case the preprocessor variables <tt>HAVE_ALBERTA</tt>, which
* tells you whether ALBERTA was found by configure, and <tt>ALBERTA_DIM</tt>
* which tells you the dimension of world <em>for this program</em>.
*
* For further details look into the <tt>alberta.m4</tt> autoconf snippet.
*/
template< int dim, int dimworld = Alberta::dimWorld >
class AlbertaGrid
: public GridDefaultImplementation
< dim, dimworld, Alberta::Real, AlbertaGridFamily< dim, dimworld > >
{
typedef AlbertaGrid< dim, dimworld > This;
typedef GridDefaultImplementation
< dim, dimworld, Alberta::Real, AlbertaGridFamily< dim, dimworld > >
Base;
template< int, int, class > friend class AlbertaGridEntity;
template< int, class > friend class AlbertaGridEntityPointer;
template< class > friend class AlbertaLevelGridView;
template< class > friend class AlbertaLeafGridView;
friend class GridFactory< This >;
friend struct DGFGridFactory< This >;
friend class AlbertaGridHierarchicIterator< This >;
friend class AlbertaGridIntersectionBase< const This >;
friend class AlbertaGridLeafIntersection< const This >;
friend class AlbertaMarkerVector< dim, dimworld >;
#if (__GNUC__ < 4) && !(defined __ICC)
// add additional friend decls for gcc 3.4
friend struct AlbertaMarkerVector< dim, dimworld >::MarkSubEntities<true>;
friend struct AlbertaMarkerVector< dim, dimworld >::MarkSubEntities<false>;
#endif
friend class AlbertaGridIndexSet< dim, dimworld >;
friend class AlbertaGridHierarchicIndexSet< dim, dimworld >;
template< class, class >
friend class Alberta::AdaptRestrictProlongHandler;
public:
//! the grid family of AlbertaGrid
typedef AlbertaGridFamily< dim, dimworld > GridFamily;
typedef typename GridFamily::ctype ctype;
static const int dimension = GridFamily::dimension;
static const int dimensionworld = GridFamily::dimensionworld;
// the Traits
typedef typename AlbertaGridFamily< dim, dimworld >::Traits Traits;
//! type of leaf index set
typedef typename Traits::LeafIndexSet LeafIndexSet;
//! type of level index sets
typedef typename Traits::LevelIndexSet LevelIndexSet;
//! type of hierarchic index set
typedef typename Traits::HierarchicIndexSet HierarchicIndexSet;
//! type of global id set
typedef typename Traits::GlobalIdSet GlobalIdSet;
//! type of local id set
typedef typename Traits::LocalIdSet LocalIdSet;
//! type of collective communication
typedef typename Traits::CollectiveCommunication CollectiveCommunication;
private:
//! type of LeafIterator
typedef typename Traits::template Codim<0>::LeafIterator LeafIterator;
//! id set impl
typedef AlbertaGridIdSet<dim,dimworld> IdSetImp;
//! AdaptationState
struct AdaptationState
{
enum Phase { ComputationPhase, PreAdaptationPhase, PostAdaptationPhase };
private:
Phase phase_;
int coarsenMarked_;
int refineMarked_;
public:
AdaptationState ()
: phase_( ComputationPhase ),
coarsenMarked_( 0 ),
refineMarked_( 0 )
{}
void mark ( int count )
{
if( count < 0 )
++coarsenMarked_;
if( count > 0 )
refineMarked_ += (2 << count);
}
void unmark ( int count )
{
if( count < 0 )
--coarsenMarked_;
if( count > 0 )
refineMarked_ -= (2 << count);
}
bool coarsen () const
{
return (coarsenMarked_ > 0);
}
int refineMarked () const
{
return refineMarked_;
}
void preAdapt ()
{
if( phase_ != ComputationPhase )
error( "preAdapt may only be called in computation phase." );
phase_ = PreAdaptationPhase;
}
void adapt ()
{
if( phase_ != PreAdaptationPhase )
error( "adapt may only be called in preadapdation phase." );
phase_ = PostAdaptationPhase;
}
void postAdapt ()
{
if( phase_ != PostAdaptationPhase )
error( "postAdapt may only be called in postadaptation phase." );
phase_ = ComputationPhase;
coarsenMarked_ = 0;
refineMarked_ = 0;
}
private:
void error ( const std::string &message )
{
DUNE_THROW( InvalidStateException, message );
}
};
template< class DataHandler >
struct AdaptationCallback;
// max number of allowed levels is 64
static const int MAXL = 64;
typedef Alberta::ElementInfo< dimension > ElementInfo;
typedef Alberta::MeshPointer< dimension > MeshPointer;
typedef Alberta::HierarchyDofNumbering< dimension > DofNumbering;
typedef AlbertaGridLevelProvider< dimension > LevelProvider;
// forbid copying and assignment
AlbertaGrid ( const This & );
This &operator= ( const This & );
public:
/** \brief create an empty grid */
AlbertaGrid ();
/** \brief create a grid from an ALBERTA macro data structure
*
* \param[in] macroData macro data to create grid from
* \param[in] projection shared pointer to a global boundary projection (defaults to 0)
*/
AlbertaGrid ( const Alberta::MacroData< dimension > ¯oData,
const std::shared_ptr< DuneBoundaryProjection< dimensionworld > > &projection
= std::shared_ptr< DuneBoundaryProjection< dimensionworld > >() );
template< class Proj, class Impl >
AlbertaGrid ( const Alberta::MacroData< dimension > ¯oData,
const Alberta::ProjectionFactoryInterface< Proj, Impl > &projectionFactory );
/** \brief create a grid from an ALBERTA macro grid file
*
* \param[in] macroGridFileName name of the macro grid file
*/
AlbertaGrid ( const std::string ¯oGridFileName );
/** \brief desctructor */
~AlbertaGrid ();
//! Return maximum level defined in this grid. Levels are numbered
//! 0 ... maxLevel with 0 the coarsest level.
int maxLevel () const;
//! Iterator to first entity of given codim on level
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LevelIterator
lbegin (int level) const;
//! one past the end on this level
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LevelIterator
lend (int level) const;
//! Iterator to first entity of given codim on level
template< int codim >
typename Traits::template Codim< codim >::LevelIterator
lbegin ( int level ) const;
//! one past the end on this level
template< int codim >
typename Traits::template Codim< codim >::LevelIterator
lend ( int level ) const;
//! return LeafIterator which points to first leaf entity
template< int codim, PartitionIteratorType pitype >
typename Traits
::template Codim< codim >::template Partition< pitype >::LeafIterator
leafbegin () const;
//! return LeafIterator which points behind last leaf entity
template< int codim, PartitionIteratorType pitype >
typename Traits
::template Codim< codim >::template Partition< pitype >::LeafIterator
leafend () const;
//! return LeafIterator which points to first leaf entity
template< int codim >
typename Traits::template Codim< codim >::LeafIterator
leafbegin () const;
//! return LeafIterator which points behind last leaf entity
template< int codim >
typename Traits::template Codim< codim >::LeafIterator
leafend () const;
/** \brief Number of grid entities per level and codim
* because lbegin and lend are none const, and we need this methods
* counting the entities on each level, you know.
*/
int size (int level, int codim) const;
//! number of entities per level and geometry type in this process
int size (int level, GeometryType type) const;
//! number of leaf entities per codim in this process
int size (int codim) const;
//! number of leaf entities per geometry type in this process
int size (GeometryType type) const;
//! number of boundary segments within the macro grid
std::size_t numBoundarySegments () const
{
return numBoundarySegments_;
}
//! View for a grid level for All_Partition
typename Traits::LevelGridView levelGridView ( int level ) const
{
typedef typename Traits::LevelGridView View;
typedef typename View::GridViewImp ViewImp;
return View( ViewImp( *this, level ) );
}
//! View for the leaf grid for All_Partition
typename Traits::LeafGridView leafGridView () const
{
typedef typename Traits::LeafGridView View;
typedef typename View::GridViewImp ViewImp;
return View( ViewImp( *this ) );
}
public:
//***************************************************************
// Interface for Adaptation
//***************************************************************
using Base::getMark;
using Base::mark;
/** \copydoc Dune::Grid::getMark(const typename Codim<0>::Entity &e) const */
int getMark ( const typename Traits::template Codim< 0 >::Entity &e ) const;
/** \copydoc Dune::Grid::mark(int refCount,const typename Codim<0>::Entity &e) */
bool mark ( int refCount, const typename Traits::template Codim< 0 >::Entity &e );
//! uses the interface, mark on entity and refineLocal
void globalRefine ( int refCount );
template< class DataHandle >
void globalRefine ( int refCount, AdaptDataHandleInterface< This, DataHandle > &handle );
/** \copydoc Dune::Grid::adapt() */
bool adapt ();
//! callback adapt method with AdaptDataHandleInterface
template< class DataHandle >
bool adapt ( AdaptDataHandleInterface< This, DataHandle > &handle );
//! returns true, if a least one element is marked for coarsening
bool preAdapt ();
//! clean up some markers
void postAdapt();
/** \brief return reference to collective communication, if MPI found
* this is specialisation for MPI */
const CollectiveCommunication &comm () const
{
return comm_;
}
static std::string typeName ()
{
std::ostringstream s;
s << "AlbertaGrid< " << dim << ", " << dimworld << " >";
return s.str();
}
/** \brief obtain Entity from EntitySeed. */
template< class EntitySeed >
typename Traits::template Codim< EntitySeed::codimension >::Entity
entity ( const EntitySeed &seed ) const
{
typedef typename Traits::template Codim< EntitySeed::codimension >::EntityImpl EntityImpl;
return EntityImpl( *this, this->getRealImplementation(seed).elementInfo( meshPointer() ), this->getRealImplementation(seed).subEntity() );
}
//**********************************************************
// End of Interface Methods
//**********************************************************
/** \brief write Grid to file in Xdr */
bool writeGrid( const std::string &filename, ctype time ) const;
/** \brief read Grid from file filename and store time of mesh in time */
bool readGrid( const std::string &filename, ctype &time );
// return hierarchic index set
const HierarchicIndexSet & hierarchicIndexSet () const { return hIndexSet_; }
//! return level index set for given level
const typename Traits :: LevelIndexSet & levelIndexSet (int level) const;
//! return leaf index set
const typename Traits :: LeafIndexSet & leafIndexSet () const;
//! return global IdSet
const GlobalIdSet &globalIdSet () const
{
return idSet_;
}
//! return local IdSet
const LocalIdSet &localIdSet () const
{
return idSet_;
}
// access to mesh pointer, needed by some methods
ALBERTA MESH* getMesh () const
{
return mesh_;
};
const MeshPointer &meshPointer () const
{
return mesh_;
}
const DofNumbering &dofNumbering () const
{
return dofNumbering_;
}
const LevelProvider &levelProvider () const
{
return levelProvider_;
}
int dune2alberta ( int codim, int i ) const
{
return numberingMap_.dune2alberta( codim, i );
}
int alberta2dune ( int codim, int i ) const
{
return numberingMap_.alberta2dune( codim, i );
}
int generic2alberta ( int codim, int i ) const
{
return genericNumberingMap_.dune2alberta( codim, i );
}
int alberta2generic ( int codim, int i ) const
{
return genericNumberingMap_.alberta2dune( codim, i );
}
// write ALBERTA mesh file
bool
DUNE_DEPRECATED_MSG("Deprecated in Dune 3.0, use writeGrid instead.")
writeGridXdr ( const std::string &filename, ctype time ) const;
//! reads ALBERTA mesh file
bool
DUNE_DEPRECATED_MSG("Deprecated in Dune 3.0, use readGrid instead.")
readGridXdr ( const std::string &filename, ctype &time );
private:
using Base::getRealImplementation;
typedef std::vector<int> ArrayType;
void setup ();
// make the calculation of indexOnLevel and so on.
// extra method because of Reihenfolge
void calcExtras();
private:
// delete mesh and all vectors
void removeMesh();
//***********************************************************************
// MemoryManagement for Entitys and Geometrys
//**********************************************************************
typedef MakeableInterfaceObject< typename Traits::template Codim< 0 >::Entity >
EntityObject;
public:
friend class AlbertaGridLeafIntersectionIterator< const This >;
template< int codim >
static int
getTwist ( const typename Traits::template Codim< codim >::Entity &entity )
{
return getRealImplementation( entity ).twist();
}
template< int codim >
static int
getTwist ( const typename Traits::template Codim< 0 >::Entity &entity, int subEntity )
{
return getRealImplementation( entity ).template twist< codim >( subEntity );
}
static int
getTwistInInside ( const typename Traits::LeafIntersection &intersection )
{
return getRealImplementation( intersection ).twistInInside();
}
static int
getTwistInOutside ( const typename Traits::LeafIntersection &intersection )
{
return getRealImplementation( intersection ).twistInOutside();
}
const AlbertaGridLeafIntersection< const This > &
getRealIntersection ( const typename Traits::LeafIntersection &intersection ) const
{
return getRealImplementation( intersection );
}
public:
// read global element number from elNumbers_
const Alberta::GlobalVector &
getCoord ( const ElementInfo &elementInfo, int vertex ) const;
private:
// pointer to an Albert Mesh, which contains the data
MeshPointer mesh_;
// collective communication
CollectiveCommunication comm_;
// maximum level of the mesh
int maxlevel_;
// number of boundary segments within the macro grid
size_t numBoundarySegments_;
// map between ALBERTA and DUNE numbering
Alberta::NumberingMap< dimension, Alberta::Dune2AlbertaNumbering > numberingMap_;
Alberta::NumberingMap< dimension, Alberta::Generic2AlbertaNumbering > genericNumberingMap_;
DofNumbering dofNumbering_;
LevelProvider levelProvider_;
// hierarchical numbering of AlbertaGrid, unique per codim
HierarchicIndexSet hIndexSet_;
// the id set of this grid
IdSetImp idSet_;
// the level index set, is generated from the HierarchicIndexSet
// is generated, when accessed
mutable std::vector< typename GridFamily::LevelIndexSetImp * > levelIndexVec_;
// the leaf index set, is generated from the HierarchicIndexSet
// is generated, when accessed
mutable typename GridFamily::LeafIndexSetImp* leafIndexSet_;
SizeCache< This > sizeCache_;
typedef AlbertaMarkerVector< dim, dimworld > MarkerVector;
// needed for VertexIterator, mark on which element a vertex is treated
mutable MarkerVector leafMarkerVector_;
// needed for VertexIterator, mark on which element a vertex is treated
mutable std::vector< MarkerVector > levelMarkerVector_;
#if DUNE_ALBERTA_CACHE_COORDINATES
Alberta::CoordCache< dimension > coordCache_;
#endif
// current state of adaptation
AdaptationState adaptationState_;
};
} // namespace Dune
#include "albertagrid.cc"
// undef all dangerous defines
#undef DIM
#undef DIM_OF_WORLD
#ifdef _ABS_NOT_DEFINED_
#undef ABS
#endif
#ifdef _MIN_NOT_DEFINED_
#undef MIN
#endif
#ifdef _MAX_NOT_DEFINED_
#undef MAX
#endif
#ifdef obstack_chunk_alloc
#undef obstack_chunk_alloc
#endif
#ifdef obstack_chunk_free
#undef obstack_chunk_free
#endif
#include <dune/grid/albertagrid/undefine-3.0.hh>
// We use MEM_ALLOC, so undefine it here.
#undef MEM_ALLOC
// We use MEM_REALLOC, so undefine it here.
#undef MEM_REALLOC
// We use MEM_CALLOC, so undefine it here.
#undef MEM_CALLOC
// We use MEM_FREE, so undefine it here.
#undef MEM_FREE
// Macro ERROR may be defined by alberta_util.h. If so, undefine it.
#ifdef ERROR
#undef ERROR
#endif // #ifdef ERROR
// Macro ERROR_EXIT may be defined by alberta_util.h. If so, undefine it.
#ifdef ERROR_EXIT
#undef ERROR_EXIT
#endif // #ifdef ERROR_EXIT
// Macro WARNING may be defined by alberta_util.h. If so, undefine it.
#ifdef WARNING
#undef WARNING
#endif // #ifdef WARNING
// Macro TEST may be defined by alberta_util.h. If so, undefine it.
#ifdef TEST
#undef TEST
#endif // #ifdef TEST
// Macro TEST_EXIT may be defined by alberta_util.h. If so, undefine it.
#ifdef TEST_EXIT
#undef TEST_EXIT
#endif // #ifdef TEST_EXIT
// Macro DEBUG_TEST may be defined by alberta_util.h. If so, undefine it.
#ifdef DEBUG_TEST
#undef DEBUG_TEST
#endif // #ifdef DEBUG_TEST
// Macro DEBUG_TEST_EXIT may be defined by alberta_util.h. If so, undefine it.
#ifdef DEBUG_TEST_EXIT
#undef DEBUG_TEST_EXIT
#endif // #ifdef DEBUG_TEST_EXIT
// Macro INFO may be defined by alberta_util.h. If so, undefine it.
#ifdef INFO
#undef INFO
#endif // #ifdef INFO
// Macro PRINT_INFO may be defined by alberta_util.h. If so, undefine it.
#ifdef PRINT_INFO
#undef PRINT_INFO
#endif // #ifdef PRINT_INFO
// Macro PRINT_INT_VEC may be defined by alberta_util.h. If so, undefine it.
#ifdef PRINT_INT_VEC
#undef PRINT_INT_VEC
#endif // #ifdef PRINT_INT_VEC
// Macro PRINT_REAL_VEC may be defined by alberta_util.h. If so, undefine it.
#ifdef PRINT_REAL_VEC
#undef PRINT_REAL_VEC
#endif // #ifdef PRINT_REAL_VEC
// Macro WAIT may be defined by alberta_util.h. If so, undefine it.
#ifdef WAIT
#undef WAIT
#endif // #ifdef WAIT
// Macro WAIT_REALLY may be defined by alberta_util.h. If so, undefine it.
#ifdef WAIT_REALLY
#undef WAIT_REALLY
#endif // #ifdef WAIT_REALLY
// Macro GET_WORKSPACE may be defined by alberta_util.h. If so, undefine it.
#ifdef GET_WORKSPACE
#undef GET_WORKSPACE
#endif // #ifdef GET_WORKSPACE
// Macro FREE_WORKSPACE may be defined by alberta_util.h. If so, undefine it.
#ifdef FREE_WORKSPACE
#undef FREE_WORKSPACE
#endif // #ifdef FREE_WORKSPACE
// Macro MAT_ALLOC may be defined by alberta_util.h. If so, undefine it.
#ifdef MAT_ALLOC
#undef MAT_ALLOC
#endif // #ifdef MAT_ALLOC
// Macro MAT_FREE may be defined by alberta_util.h. If so, undefine it.
#ifdef MAT_FREE
#undef MAT_FREE
#endif // #ifdef MAT_FREE
// Macro NAME may be defined by alberta_util.h. If so, undefine it.
#ifdef NAME
#undef NAME
#endif // #ifdef NAME
// Macro GET_STRUCT may be defined by alberta_util.h. If so, undefine it.
#ifdef GET_STRUCT
#undef GET_STRUCT
#endif // #ifdef GET_STRUCT
// Macro ADD_PARAMETER may be defined by alberta_util.h. If so, undefine it.
#ifdef ADD_PARAMETER
#undef ADD_PARAMETER
#endif // #ifdef ADD_PARAMETER
// Macro GET_PARAMETER may be defined by alberta_util.h. If so, undefine it.
#ifdef GET_PARAMETER
#undef GET_PARAMETER
#endif // #ifdef GET_PARAMETER
#define _ALBERTA_H_
#endif // HAVE_ALBERTA || DOXYGEN
#endif
|