3 #ifndef DUNE_DEFAULTINDEXSETS_HH
4 #define DUNE_DEFAULTINDEXSETS_HH
11 #include <dune/common/forloop.hh>
27 template <
class Gr
idImp>
34 template<PartitionIteratorType pitype>
43 template <
class Gr
idImp>
50 template<PartitionIteratorType pitype>
53 typedef typename GridImp::Traits::template
Codim<cd>::
65 template <
class Gr
idImp,
class IteratorImp >
67 public IndexSet< GridImp, DefaultIndexSet <GridImp, IteratorImp>, unsigned int >
69 typedef GridImp GridType;
70 enum { dim = GridType :: dimension };
73 enum {
ncodim = GridType::dimension + 1 };
80 typedef IteratorImp IteratorType ;
100 static void apply (
const typename GridImp::template Codim< 0 >::Entity &entity,
102 std::vector< int > &sizes )
107 Index &idx = codimContainer[ entity ];
108 if( idx.
index() < 0 )
109 idx.
set( sizes[ codim ]++ );
113 for(
int i = 0; i < entity.template count< codim >(); ++i )
115 Index &idx = codimContainer( entity, i );
116 if( idx.
index() < 0 )
117 idx.
set( sizes[ codim ]++ );
123 template <
class EntityType,
int codim>
127 const EntityType & e,
131 if( codim == EntityType :: codimension )
132 return indexContainer[ e ].index();
134 DUNE_THROW(NotImplemented,
"subIndex for entities with codimension > 0 is not implemented");
139 template <
class EntityType>
140 struct EntitySpec<EntityType,0>
143 const EntityType & e,
154 using IndexSet<GridType, DefaultIndexSet>::subIndex;
159 const IteratorType& begin,
160 const IteratorType& end,
161 const int level = -1 )
167 for(
int codim=0; codim <
ncodim; ++codim )
176 for(
int codim=0; codim <
ncodim; ++codim )
177 delete indexContainers_[ codim ];
182 assert( codim < indexContainers_.size() );
183 assert( indexContainers_[ codim ] );
184 return *( indexContainers_[ codim ] );
189 assert( codim < indexContainers_.size() );
190 assert( indexContainers_[ codim ] );
191 return *( indexContainers_[ codim ] );
195 template<
class EntityType>
198 enum { cd = EntityType :: codimension };
202 const int codim = cd;
203 assert( (codim == dim) ? (1) : ( level_ < 0 ) || (level_ == en.level() ));
216 const int codim = cd;
218 assert( (codim == dim) ? (1) : ( level_ < 0 ) || (level_ == en.level() ));
227 IndexType subIndex (
const typename remove_const< GridImp >::type::Traits::template Codim< cc >::Entity &e,
228 int i,
unsigned int codim )
const
230 assert( (codim != 0) || (level_ < 0) || ( level_ == e.level() ) );
231 typedef typename remove_const< GridImp >::type::Traits::template Codim< cc >::Entity
Entity;
236 template<
class EntityType>
239 enum { cd = EntityType :: codimension };
246 assert( codim >= 0 && codim <= GridType::dimension );
247 return size_[ codim ];
254 if( typeNotValid(type) )
return 0;
255 return size_[GridType::dimension-type.dim()];
260 void calcNewIndex (
const IteratorType &begin,
const IteratorType &end )
264 for(
int cd = 0; cd <
ncodim; ++cd )
273 for( IteratorType it = begin; it != end; ++it )
275 assert( ( level_ < 0 ) ? it->isLeaf() : (it->level() == level_) );
276 ForLoop< InsertEntity, 0, dim >::apply( *it, indexContainers_, size_ );
280 for(
int cd=0; cd<
ncodim; ++cd)
283 const int gridSize = ( level_ < 0 ) ? grid_.size( cd ) : grid_.size( level_, cd);
284 const int mySize = size_[cd];
285 if( mySize > gridSize )
287 std::cout <<
"DefaultIndexSet[ " << level_ <<
" ]: " << mySize <<
" s | g " << gridSize << std::endl;
296 const std::vector<GeometryType>&
geomTypes (
int codim)
const
298 return grid_.geomTypes( codim );
312 int codim = GridType :: dimension - type.dim();
313 const std::vector<GeometryType> & geomT =
geomTypes(codim);
314 for(
size_t i=0; i<geomT.size(); ++i)
if(geomT[i] == type)
return false;
319 const GridType& grid_;
325 std::vector< int > size_;
334 #endif // #ifndef DUNE_DEFAULTINDEXSETS_HH