/usr/include/dune/grid/alugrid/3d/indexsets.hh is in libdune-grid-dev 2.4.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 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_ALU3DGRIDINDEXSETS_HH
#define DUNE_ALU3DGRIDINDEXSETS_HH
//- System includes
#include <vector>
//- Dune includes
#include <dune/common/stdstreams.hh>
#include <dune/common/bigunsignedint.hh>
#include <dune/common/hash.hh>
#include <dune/grid/common/grid.hh>
#include <dune/grid/common/indexidset.hh>
//- Local includes
#include "alu3dinclude.hh"
#include "topology.hh"
#include "alu3diterators.hh"
namespace Dune
{
// External Forward Declarations
// -----------------------------
template< ALU3dGridElementType, class >
class ALU3dGrid;
template<int cd, int dim, class GridImp>
class ALU3dGridEntity;
// ALU3dGridHierarchicIndexSet
// ---------------------------
//! hierarchic index set of ALU3dGrid
template< ALU3dGridElementType elType, class Comm >
class ALU3dGridHierarchicIndexSet
: public IndexSet< ALU3dGrid< elType, Comm >, ALU3dGridHierarchicIndexSet< elType, Comm > >
{
typedef ALU3dGridHierarchicIndexSet< elType, Comm > This;
typedef ALU3dGrid< elType, Comm > GridType;
enum { numCodim = GridType::dimension + 1 };
friend class ALU3dGrid< elType, Comm >;
// constructor
ALU3dGridHierarchicIndexSet( const GridType &grid )
: grid_( grid )
{}
public:
typedef typename GridType::Traits::template Codim<0>::Entity EntityCodim0Type;
//! return hierarchic index of given entity
template <class EntityType>
int index (const EntityType & ep) const
{
enum { cd = EntityType :: codimension };
return index<cd>(ep);
}
//! return hierarchic index of given entity
template< int codim >
int index ( const typename GridType::Traits::template Codim< codim >::Entity &entity ) const
{
return GridType::getRealImplementation( entity ).getIndex();
}
//! return subIndex i of given entity for subEntity with codim
int subIndex ( const EntityCodim0Type &e, int i, unsigned int codim ) const
{
// call method subIndex on real implementation
return GridType::getRealImplementation( e ).subIndex( i, codim );
}
//! return size of indexset, i.e. maxindex+1
//! for given type, if type is not exisiting within grid 0 is returned
int size ( GeometryType type ) const
{
if( elType == tetra && !type.isSimplex() ) return 0;
if( elType == hexa && !type.isCube() ) return 0;
// return size of hierarchic index set
return this->size(GridType::dimension-type.dim());
}
//! return size of indexset, i.e. maxindex+1
int size ( int codim ) const
{
// return size of hierarchic index set
return grid_.hierSetSize(codim);
}
//! deliver all geometry types used in this grid
const std::vector<GeometryType>& geomTypes (int codim) const
{
return grid_.geomTypes(codim);
}
//! return true because all entities are contained in this set
template <class EntityType>
bool contains (const EntityType &) const { return true; }
private:
// our Grid
const GridType & grid_;
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
class ALUMacroKey : public ALU3DSPACE Key4<int>
{
typedef int A;
typedef ALUMacroKey ThisType;
typedef ALU3DSPACE Key4<A> BaseType;
public:
ALUMacroKey() : BaseType(-1,-1,-1,-1) {}
ALUMacroKey(const A&a,const A&b,const A&c,const A&d) : BaseType(a,b,c,d) {}
ALUMacroKey(const ALUMacroKey & org ) : BaseType(org) {}
ALUMacroKey & operator = (const ALUMacroKey & org )
{
BaseType::operator = (org);
return *this;
}
bool operator == (const ALUMacroKey & org) const
{
return ( (this->_a == org._a) &&
(this->_b == org._b) &&
(this->_c == org._c) &&
(this->_d == org._d) );
}
// operator < is already implemented in BaseType
bool operator > (const ALUMacroKey & org) const
{
return ( (!this->operator == (org)) && (!this->operator <(org)) );
}
void print(std::ostream & out) const
{
out << "[" << this->_a << "," << this->_b << "," << this->_c << "," << this->_d << "]";
}
#ifdef HAVE_DUNE_HASH
inline friend std::size_t hash_value(const ALUMacroKey& arg)
{
std::size_t seed = 0;
hash_combine(seed,arg._a);
hash_combine(seed,arg._b);
hash_combine(seed,arg._c);
hash_combine(seed,arg._d);
return seed;
}
#endif // HAVE_DUNE_HASH
};
template <class MacroKeyImp>
class ALUGridId
{
MacroKeyImp key_;
int nChild_;
int codim_;
public:
ALUGridId() : key_()
, nChild_(-1)
, codim_(-1)
{}
ALUGridId(const MacroKeyImp & key, int nChild , int cd)
: key_(key) , nChild_(nChild)
, codim_(cd)
{}
ALUGridId(const ALUGridId & org )
: key_(org.key_)
, nChild_(org.nChild_)
, codim_(org.codim_)
{}
ALUGridId & operator = (const ALUGridId & org )
{
key_ = org.key_;
nChild_ = org.nChild_;
codim_ = org.codim_;
return *this;
}
bool operator == (const ALUGridId & org) const
{
return equals(org);
}
bool operator != (const ALUGridId & org) const
{
return ! equals(org);
}
bool operator <= (const ALUGridId & org) const
{
if(equals(org)) return true;
else return lesser(org);
}
bool operator >= (const ALUGridId & org) const
{
if(equals(org)) return true;
else return ! lesser(org);
}
bool operator < (const ALUGridId & org) const
{
return lesser(org);
}
bool operator > (const ALUGridId & org) const
{
return (!equals(org) && ! lesser(org));
}
const MacroKeyImp & getKey() const { return key_; }
int nChild() const { return nChild_; }
int codim() const { return codim_; }
bool isValid () const
{
return ( (nChild_ >= 0) && (codim_ >= 0) );
}
void reset()
{
nChild_ = -1;
codim_ = -1;
}
void print(std::ostream & out) const
{
out << "(" << getKey() << "," << nChild_ << "," << codim_ << ")";
}
#ifdef HAVE_DUNE_HASH
inline friend std::size_t hash_value(const ALUGridId& arg)
{
std::size_t seed = hash<MacroKeyImp>() (arg.getKey());
hash_combine(seed,arg.nChild());
hash_combine(seed,arg.codim());
return seed;
}
#endif // HAVE_DUNE_HASH
protected:
// returns true is the id is lesser then org
bool lesser(const ALUGridId & org) const
{
if(getKey() < org.getKey() ) return true;
if(getKey() > org.getKey() ) return false;
if(getKey() == org.getKey() )
{
if(nChild_ == org.nChild_)
{
return codim_ < org.codim_;
}
else
return nChild_ < org.nChild_;
}
assert( equals(org) );
return false;
}
// returns true if this id equals org
bool equals(const ALUGridId & org) const
{
return ( (getKey() == org.getKey() ) && (nChild_ == org.nChild_)
&& (codim_ == org.codim_) );
}
};
} // drop out of namespace Dune, as hash definitions have to be done in global namespace
DUNE_DEFINE_HASH(DUNE_HASH_TEMPLATE_ARGS(),DUNE_HASH_TYPE(Dune::ALUMacroKey))
DUNE_DEFINE_HASH(DUNE_HASH_TEMPLATE_ARGS(typename MacroKeyImp),DUNE_HASH_TYPE(Dune::ALUGridId<MacroKeyImp>))
namespace Dune {
inline std::ostream& operator<< (std::ostream& s, const ALUMacroKey & key)
{
key.print(s);
return s;
}
template <class KeyImp>
inline std::ostream& operator<< (std::ostream& s, const ALUGridId<KeyImp> & id)
{
id.print(s);
return s;
}
//*****************************************************************
//
// --GlobalIdSet
//
//*****************************************************************
//! global id set for ALU3dGrid
template< ALU3dGridElementType elType, class Comm >
class ALU3dGridGlobalIdSet
: public IdSet< ALU3dGrid< elType, Comm >, ALU3dGridGlobalIdSet< elType, Comm > ,
typename ALU3dGrid< elType, Comm >::Traits::GlobalIdType >,
public ALU3DSPACE AdaptRestrictProlongType
{
typedef ALU3dGrid< elType, Comm > GridType;
typedef typename GridType::HierarchicIndexSet HierarchicIndexSetType;
typedef ALU3dImplTraits< elType, Comm > ImplTraitsType;
typedef typename ImplTraitsType::IMPLElementType IMPLElementType;
typedef typename ImplTraitsType::GEOElementType GEOElementType;
typedef typename ImplTraitsType::GEOFaceType GEOFaceType;
typedef typename ImplTraitsType::GEOEdgeType GEOEdgeType;
typedef typename ImplTraitsType::GitterImplType GitterImplType;
typedef typename ImplTraitsType::HElementType HElementType;
typedef typename ImplTraitsType::HFaceType HFaceType;
typedef typename ImplTraitsType::HEdgeType HEdgeType;
typedef typename ImplTraitsType::VertexType VertexType;
typedef typename ImplTraitsType::HBndSegType HBndSegType;
typedef EntityCount< elType > EntityCountType;
using ALU3DSPACE AdaptRestrictProlongType :: postRefinement ;
using ALU3DSPACE AdaptRestrictProlongType :: preCoarsening ;
public:
//! export type of id
typedef typename GridType::Traits::GlobalIdType IdType;
private:
typedef ALUMacroKey MacroKeyType;
typedef ALUGridId < MacroKeyType > MacroIdType; // same as IdType
enum { numCodim = GridType::dimension+1 };
// this means that only up to 300000000 entities are allowed
typedef typename GridType::Traits::template Codim<0>::Entity EntityCodim0Type;
private:
mutable std::map< int , IdType > ids_[numCodim];
//mutable std::map< int , MacroKeyType > macroKeys_[numCodim];
// our Grid
const GridType & grid_;
// the hierarchicIndexSet
const HierarchicIndexSetType & hset_;
int vertexKey_[4];
int chunkSize_ ;
enum { startOffSet_ = 0 };
public:
//! import default implementation of subId<cc>
//! \todo remove after next release
using IdSet < GridType , ALU3dGridGlobalIdSet, IdType > :: subId;
//! create id set, only allowed for ALU3dGrid
ALU3dGridGlobalIdSet(const GridType & grid)
: grid_(grid), hset_(grid.hierarchicIndexSet())
, chunkSize_(100)
{
if(elType == hexa)
{
// see ALUGrid/src/serial/gitter_mgb.cc
// InsertUniqueHexa
const int vxKey[4] = {0,1,3,4};
for(int i=0; i<4; i++) vertexKey_[i] = vxKey[i];
}
else
{
assert( elType == tetra );
// see ALUGrid/src/serial/gitter_mgb.cc
// InsertUniqueTetra
const int vxKey[4] = {0,1,2,3};
for(int i=0; i<4; i++) vertexKey_[i] = vxKey[i];
}
// setup the id set
buildIdSet();
}
virtual ~ALU3dGridGlobalIdSet() {}
// update id set after adaptation
void updateIdSet()
{
// to be revised
buildIdSet();
}
// print all ids
void print () const
{
for(int i=0 ; i<numCodim; ++i)
{
std::cout << "*****************************************************\n";
std::cout << "Ids for codim " << i << "\n";
std::cout << "*****************************************************\n";
for(unsigned int k=0; k<ids_[i].size(); ++k)
{
std::cout << "Item[" << i << "," << k <<"] has id " << ids_[i][k] << "\n";
}
std::cout << "\n\n\n";
}
}
template <class IterType>
void checkId(const IdType & macroId, const IterType & idIter) const //int codim , unsigned int num ) const
{
IdType id = getId(macroId);
for(int i=0 ; i<numCodim; ++i)
{
typedef typename std::map<int,IdType>::iterator IteratorType;
IteratorType end = ids_[i].end();
for(IteratorType it = ids_[i].begin(); it != end; ++it)
//for(unsigned int k=0; k<ids_[i].size(); ++k)
{
if(idIter == it) continue;
//if((i == codim) && (k == num)) continue;
const IdType & checkMId = (*it).second; //ids_[i][k];
IdType checkId = getId(checkMId);
if( id == checkId )
{
//std::cout << "Check(codim,num = " << codim<< "," << num <<") failed for k="<<k << " codim = " << i << "\n";
std::cout << id << " equals " << checkId << "\n";
assert( id != checkId );
DUNE_THROW(GridError," " << id << " equals " << checkId << "\n");
}
else
{
bool lesser = (id < checkId);
bool greater = (id > checkId);
assert( lesser != greater );
if( lesser == greater )
{
assert( lesser != greater );
DUNE_THROW(GridError," lesser equals greater of one id ");
}
}
}
}
}
// check id set for uniqueness
void uniquenessCheck() const
{
for(int i=0 ; i<numCodim; i++)
{
typedef typename std::map<int,IdType>::iterator IteratorType;
IteratorType end = ids_[i].end();
for(IteratorType it = ids_[i].begin(); it != end; ++it)
//unsigned int k=0; k<ids_[i].size(); ++k)
{
const IdType & id = (*it).second; //ids_[i][k];
if( id.isValid() )
checkId(id,it); //i,k);
}
}
}
void setChunkSize( int chunkSize )
{
chunkSize_ = chunkSize;
}
// creates the id set
void buildIdSet ()
{
for(int i=0; i<numCodim; ++i)
{
ids_[i].clear();
}
GitterImplType &gitter = grid_.myGrid();
// all interior and border vertices
{
typename ALU3DSPACE AccessIterator< VertexType >::Handle fw( gitter.container() );
for( fw.first (); !fw.done(); fw.next() )
{
int idx = fw.item().getIndex();
ids_[3][idx] = buildMacroVertexId( fw.item() );
}
}
// all ghost vertices
{
typedef typename ALU3DSPACE ALU3dGridLevelIteratorWrapper< 3, Ghost_Partition, Comm > IteratorType;
IteratorType fw (grid_ , 0 , grid_.nlinks() );
typedef typename IteratorType :: val_t val_t;
for (fw.first () ; ! fw.done () ; fw.next ())
{
val_t & item = fw.item();
assert( item.first );
VertexType & vx = * (item.first);
int idx = vx.getIndex();
ids_[3][idx] = buildMacroVertexId( vx );
}
}
// create ids for all macro edges
{
typename ALU3DSPACE AccessIterator< HEdgeType >::Handle w( gitter.container() );
for (w.first(); !w.done(); w.next())
{
int idx = w.item().getIndex();
ids_[2][idx] = buildMacroEdgeId( w.item() );
buildEdgeIds( w.item() , ids_[2][idx] , startOffSet_ );
}
}
// all ghost edges
{
typedef typename ALU3DSPACE ALU3dGridLevelIteratorWrapper< 2, Ghost_Partition, Comm > IteratorType;
IteratorType fw( grid_, 0, grid_.nlinks() );
typedef typename IteratorType :: val_t val_t;
for (fw.first () ; ! fw.done () ; fw.next ())
{
val_t & item = fw.item();
assert( item.first );
HEdgeType & edge = * (item.first);
int idx = edge.getIndex();
ids_[2][idx] = buildMacroEdgeId( edge );
buildEdgeIds( edge , ids_[2][idx] , startOffSet_ );
}
}
// for all macro faces and all children
{
typename ALU3DSPACE AccessIterator< HFaceType >::Handle w( gitter.container() );
for (w.first () ; ! w.done () ; w.next ())
{
int idx = w.item().getIndex();
ids_[1][idx] = buildMacroFaceId( w.item() );
buildFaceIds( w.item() , ids_[1][idx] , startOffSet_ );
}
}
// all ghost faces
{
typedef typename ALU3DSPACE ALU3dGridLevelIteratorWrapper< 1, Ghost_Partition, Comm > IteratorType;
IteratorType fw (grid_ , 0 , grid_.nlinks() );
typedef typename IteratorType :: val_t val_t;
for (fw.first () ; ! fw.done () ; fw.next ())
{
val_t & item = fw.item();
assert( item.first );
HFaceType & face = * (item.first);
int idx = face.getIndex();
ids_[1][idx] = buildMacroFaceId( face );
buildFaceIds( face , ids_[1][idx] , startOffSet_ );
}
}
// for all macro elements and all internal entities
{
typename ALU3DSPACE AccessIterator< HElementType >::Handle w( gitter.container() );
for (w.first () ; ! w.done () ; w.next ())
{
int idx = w.item().getIndex();
ids_[0][idx] = buildMacroElementId( w.item() );
buildElementIds( w.item() , ids_[0][idx] , startOffSet_ );
}
}
// all ghost elements
{
typedef typename ALU3DSPACE ALU3dGridLevelIteratorWrapper< 0, Ghost_Partition, Comm > IteratorType;
IteratorType fw (grid_ , 0 , grid_.nlinks() );
typedef typename IteratorType :: val_t val_t;
for (fw.first () ; ! fw.done () ; fw.next ())
{
val_t & item = fw.item();
assert( item.second );
HElementType & elem = * ( item.second->getGhost().first );
int idx = elem.getIndex();
ids_[0][idx] = buildMacroElementId( elem );
buildElementIds( elem , ids_[0][idx] , startOffSet_ );
}
}
// check uniqueness of id only in serial, because
// in parallel some faces and edges of ghost exists more than once
// but have the same id, but not the same index, there for the check
// will fail for ghost elements
#if ! ALU3DGRID_PARALLEL
// be carefull with this check, it's complexity is O(N^2)
//uniquenessCheck();
#endif
}
IdType buildMacroVertexId(const VertexType & item )
{
int vx[4] = { item.ident(), -1, -1, -1};
enum {codim = 3 };
MacroKeyType key(vx[0],vx[1],vx[2],vx[3]);
MacroIdType id(key,1, codim + startOffSet_ );
return id;
}
IdType buildMacroEdgeId(const HEdgeType & item )
{
const GEOEdgeType & edge = static_cast<const GEOEdgeType &> (item);
int vx[4] = {-1,-1,-1,-1};
for(int i=0; i<2; ++i)
{
vx[i] = edge.myvertex(i)->ident();
}
enum { codim = 2 };
MacroKeyType key(vx[0],vx[1],vx[2],vx[3]);
MacroIdType id( key,1, codim + startOffSet_ );
return id;
}
IdType buildMacroFaceId(const HFaceType & item )
{
const GEOFaceType & face = static_cast<const GEOFaceType &> (item);
int vx[4] = {-1,-1,-1,-1};
for(int i=0; i<3; ++i)
{
vx[i] = face.myvertex(i)->ident();
}
enum { codim = 1 };
MacroKeyType key(vx[0],vx[1],vx[2],vx[3]);
MacroIdType id(key,1, codim + startOffSet_ );
return id;
}
IdType buildMacroElementId(const HElementType & item )
{
const GEOElementType & elem = static_cast<const GEOElementType &> (item);
int vx[4] = {-1,-1,-1,-1};
for(int i=0; i<4; ++i)
{
vx[i] = elem.myvertex(vertexKey_[i])->ident();
}
enum { codim = 0 };
MacroKeyType key(vx[0],vx[1],vx[2],vx[3]);
return MacroIdType(key,1, codim + startOffSet_ );
}
template <int cd>
IdType createId(const typename ImplTraitsType::
template Codim<cd>::InterfaceType & item , const IdType & creatorId , int nChild )
{
assert( creatorId.isValid() );
// we have up to 12 internal hexa faces, therefore need 100 offset
enum { childOffSet = ((cd == 1) && (elType == hexa)) ? 16 : 8 };
enum { codimOffSet = 4 };
assert( nChild < childOffSet );
int newChild = (creatorId.nChild() * childOffSet ) + nChild;
int newCodim = (creatorId.codim() * codimOffSet ) + ( cd + startOffSet_ );
IdType newId( creatorId.getKey() , newChild , newCodim );
assert( newId != creatorId );
return newId;
}
// build ids for all children of this element
void buildElementIds(const HElementType & item , const IdType & macroId , int nChild)
{
enum { codim = 0 };
ids_[codim][item.getIndex()] = createId<codim>(item,macroId,nChild);
const IdType & itemId = ids_[codim][item.getIndex()];
buildInteriorElementIds(item,itemId);
}
// build ids for all children of this element
void buildInteriorElementIds(const HElementType & item , const IdType & fatherId)
{
assert( fatherId.isValid() );
// build id for inner vertex
{
const VertexType * v = item.innerVertex() ;
// for tetras there is no inner vertex, therefore check
if(v) buildVertexIds(*v,fatherId );
}
// build edge ids for all inner edges
{
int inneredge = startOffSet_;
for(const HEdgeType * e = item.innerHedge () ; e ; e = e->next ())
{
buildEdgeIds(*e,fatherId,inneredge);
++inneredge;
}
}
// build face ids for all inner faces
{
int innerface = startOffSet_;
for(const HFaceType * f = item.innerHface () ; f ; f = f->next ())
{
buildFaceIds(*f,fatherId,innerface);
++innerface;
}
}
// build ids of all children
{
int numChild = startOffSet_;
for(const HElementType * child = item.down(); child; child =child->next() )
{
//assert( numChild == child->nChild() );
buildElementIds(*child, fatherId, numChild);
++numChild;
}
}
}
// build ids for all children of this face
void buildFaceIds(const HFaceType & face, const IdType & fatherId , int innerFace )
{
enum { codim = 1 };
ids_[codim][face.getIndex()] = createId<codim>(face,fatherId,innerFace);
const IdType & faceId = ids_[codim][face.getIndex()];
buildInteriorFaceIds(face,faceId);
}
// build ids for all children of this face
void buildInteriorFaceIds(const HFaceType & face, const IdType & faceId)
{
assert( faceId.isValid () );
// build id for inner vertex
{
const VertexType * v = face.innerVertex() ;
//std::cout << "create inner vertex of face " << face.getIndex() << "\n";
if(v) buildVertexIds(*v,faceId );
}
// build ids for all inner edges
{
int inneredge = startOffSet_;
for (const HEdgeType * e = face.innerHedge () ; e ; e = e->next ())
{
buildEdgeIds(*e,faceId ,inneredge );
++inneredge;
}
}
// build ids for all child faces
{
int child = startOffSet_;
for(const HFaceType * f = face.down () ; f ; f = f->next ())
{
assert( child == f->nChild()+startOffSet_);
buildFaceIds(*f,faceId,child);
++child;
}
}
}
// build ids for all children of this edge
void buildEdgeIds(const HEdgeType & edge, const IdType & fatherId , int inneredge)
{
enum { codim = 2 };
ids_[codim][edge.getIndex()] = createId<codim>(edge,fatherId,inneredge);
const IdType & edgeId = ids_[codim][edge.getIndex()];
buildInteriorEdgeIds(edge,edgeId);
}
void buildInteriorEdgeIds(const HEdgeType & edge, const IdType & edgeId)
{
assert( edgeId.isValid() );
// build id for inner vertex
{
const VertexType * v = edge.innerVertex() ;
if(v) buildVertexIds(*v,edgeId );
}
// build ids for all inner edges
{
int child = startOffSet_;
for (const HEdgeType * e = edge.down () ; e ; e = e->next ())
{
assert( child == e->nChild()+ startOffSet_ );
buildEdgeIds(*e,edgeId , child );
++child;
}
}
}
// build id for this vertex
void buildVertexIds(const VertexType & vertex, const IdType & fatherId )
{
enum { codim = 3 };
// inner vertex number is 1
ids_[codim][vertex.getIndex()] = createId<codim>(vertex,fatherId,1);
assert( ids_[codim][vertex.getIndex()].isValid() );
}
friend class ALU3dGrid< elType, Comm >;
const IdType & getId(const IdType & macroId) const
{
return macroId;
}
public:
//! return global id of given entity
template <class EntityType>
IdType id (const EntityType & ep) const
{
enum { cd = EntityType :: codimension };
assert( ids_[cd].find( hset_.index(ep) ) != ids_[cd].end() );
const IdType & macroId = ids_[cd][hset_.index(ep)];
assert( macroId.isValid() );
return getId(macroId);
}
//! return global id of given entity
template <int codim>
IdType id (const typename GridType:: template Codim<codim> :: Entity & ep) const
{
assert( ids_[codim].find( hset_.index(ep) ) != ids_[codim].end() );
const IdType & macroId = ids_[codim][hset_.index(ep)];
assert( macroId.isValid() );
return getId(macroId);
}
//! return subId of given entity
IdType subId ( const EntityCodim0Type &e, int i, unsigned int codim ) const
{
const int hIndex = hset_.subIndex( e, i, codim );
assert( ids_[ codim ].find( hIndex ) != ids_[ codim ].end() );
const IdType ¯oId = ids_[ codim ][ hIndex ];
assert( macroId.isValid() );
return getId( macroId );
}
template <int d, ALU3dGridElementType element_t >
struct BuildIds;
template <int d>
struct BuildIds<d,tetra>
{
//static const IdType zero;
template <class MyIdSet, class IdStorageType>
static void buildFace(MyIdSet & set, const HElementType & item, int faceNum,
IdStorageType & ids )
{
const IMPLElementType & elem = static_cast<const IMPLElementType &> (item);
const HFaceType & face = *(elem.myhface3(faceNum));
const IdType & id = ids[face.getIndex()];
assert( id.isValid() );
set.buildInteriorFaceIds(face,id);
}
};
template <int d>
struct BuildIds<d,hexa>
{
//static const IdType zero;
template <class MyIdSet, class IdStorageType>
static void buildFace(MyIdSet & set, const HElementType & item, int faceNum,
IdStorageType & ids )
{
const IMPLElementType & elem = static_cast<const IMPLElementType &> (item);
const HFaceType & face = *(elem.myhface4(faceNum));
const IdType & id = ids[face.getIndex()];
assert( id.isValid() );
set.buildInteriorFaceIds(face,id);
}
};
// create ids for refined elements
int postRefinement( HElementType & item )
{
{
enum { elCodim = 0 };
const IdType & fatherId = ids_[elCodim][item.getIndex()];
assert( fatherId.isValid() );
buildInteriorElementIds(item, fatherId );
}
for(int i=0; i<EntityCountType::numFaces; ++i)
{
enum { faceCodim = 1 };
BuildIds< GridType::dimension, elType >::buildFace(*this,item,i,ids_[faceCodim]);
}
for(int i=0; i<EntityCountType::numEdges; ++i)
{
enum { edgeCodim = 2 };
const IMPLElementType & elem = static_cast<const IMPLElementType &> (item);
const HEdgeType & edge = *( elem.myhedge1(i));
const IdType & id = ids_[edgeCodim][edge.getIndex()];
assert( id.isValid() );
buildInteriorEdgeIds(edge,id);
}
return 0;
}
// dummy functions
int preCoarsening( HElementType & elem )
{
/*
const IdType & fatherId = ids_[0][item.getIndex()];
removeElementIds(item,fatherId,item.nChild());
for(int i=0; i<EntityCountType::numFaces; ++i)
BuildIds<dim,elType>::buildFace(*this,item,i,ids_[1]);
for(int i=0; i<EntityCountType::numEdges; ++i)
{
const IMPLElementType & elem = static_cast<const IMPLElementType &> (item);
const HEdgeType & edge = *( elem.myhedge1(i));
const HEdgeType * child = edge.down();
assert( child );
if( ids_[2][child->getIndex() ] > zero_ ) continue;
buildEdgeIds(edge,ids_[2][edge.getIndex()],0);
}
#ifndef NDEBUG
//uniquenessCheck();
#endif
*/
return 0;
}
// dummy functions
int preCoarsening ( HBndSegType & el ) { return 0; }
//! prolong data, elem is the father
int postRefinement ( HBndSegType & el ) { return 0; }
};
//***********************************************************
//
// --LocalIdSet
//
//***********************************************************
//! hierarchic index set of ALU3dGrid
template< ALU3dGridElementType elType, class Comm >
class ALU3dGridLocalIdSet
: public IdSet< ALU3dGrid< elType, Comm >, ALU3dGridLocalIdSet< elType, Comm >, int >,
public ALU3DSPACE AdaptRestrictProlongType
{
typedef ALU3dGridLocalIdSet< elType, Comm > This;
typedef ALU3dImplTraits< elType, Comm > ImplTraitsType;
typedef typename ImplTraitsType::HElementType HElementType;
typedef typename ImplTraitsType::HBndSegType HBndSegType;
typedef ALU3dGrid< elType, Comm > GridType;
typedef typename GridType::HierarchicIndexSet HierarchicIndexSetType;
// this means that only up to 300000000 entities are allowed
enum { codimMultiplier = 300000000 };
typedef typename GridType::Traits::template Codim<0>::Entity EntityCodim0Type;
// create local id set , only for the grid allowed
ALU3dGridLocalIdSet(const GridType & grid) : hset_(grid.hierarchicIndexSet())
{
for( int codim = 0; codim <= GridType::dimension; ++codim )
codimStart_[ codim ] = codim * codimMultiplier;
}
friend class ALU3dGrid< elType, Comm >;
// fake method to have the same method like GlobalIdSet
void updateIdSet() {}
using ALU3DSPACE AdaptRestrictProlongType :: postRefinement ;
using ALU3DSPACE AdaptRestrictProlongType :: preCoarsening ;
public:
//! export type of id
typedef int IdType;
//! import default implementation of subId<cc>
//! \todo remove after next release
using IdSet < GridType , ALU3dGridLocalIdSet, IdType > :: subId;
//! return global id of given entity
template <class EntityType>
int id (const EntityType & ep) const
{
enum { cd = EntityType :: codimension };
assert( hset_.size(cd) < codimMultiplier );
return codimStart_[cd] + hset_.index(ep);
}
//! return global id of given entity
template <int codim>
int id (const typename GridType:: template Codim<codim> :: Entity & ep) const
{
//enum { cd = EntityType :: codimension };
assert( hset_.size(codim) < codimMultiplier );
return codimStart_[codim] + hset_.index(ep);
}
//! return subId of given entity
IdType subId ( const EntityCodim0Type &e, int i, unsigned int codim ) const
{
assert( hset_.size( codim ) < codimMultiplier );
return codimStart_[ codim ] + hset_.subIndex( e, i, codim );
}
// dummy functions
int preCoarsening( HElementType & elem ) { return 0; }
// create ids for refined elements
int postRefinement( HElementType & item ) { return 0; }
// dummy functions
int preCoarsening ( HBndSegType & el ) { return 0; }
//! prolong data, elem is the father
int postRefinement ( HBndSegType & el ) { return 0; }
void setChunkSize( int chunkSize ) {}
private:
// our HierarchicIndexSet
const HierarchicIndexSetType & hset_;
// store start of each codim numbers
int codimStart_[ GridType::dimension+1 ];
};
} // end namespace Dune
#endif // #ifndef DUNE_ALU3DGRIDINDEXSETS_HH
|