/usr/include/dune/grid/alugrid/common/defaultindexsets.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 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_DEFAULTINDEXSETS_HH
#define DUNE_DEFAULTINDEXSETS_HH
//- system includes
#include <vector>
#include <rpc/rpc.h>
//- Dune includes
#include <dune/common/forloop.hh>
#include <dune/grid/common/grid.hh>
#include <dune/grid/common/adaptcallback.hh> // for compatibility only
#include <dune/grid/utility/persistentcontainer.hh>
/** @file
@author Robert Kloefkorn
@brief Provides default index set implementations for Level- and
LeafIndexsets used by ALUGrid.
*/
namespace Dune
{
//! LevelIterator tpyes for all codims and partition types
template <class GridImp>
struct DefaultLevelIteratorTypes
{
//! The types
template<int cd>
struct Codim
{
template<PartitionIteratorType pitype>
struct Partition
{
typedef typename GridImp::Traits::template Codim<cd>::template Partition<pitype>::LevelIterator Iterator;
};
};
};
//! LeafIterator tpyes for all codims and partition types
template <class GridImp>
struct DefaultLeafIteratorTypes
{
//! The types of the iterator
template<int cd>
struct Codim
{
template<PartitionIteratorType pitype>
struct Partition
{
typedef typename GridImp::Traits::template Codim<cd>::
template Partition<pitype>::LeafIterator Iterator;
};
};
};
/*! \brief
DefaultIndexSet creates an index set by using the grids persistent container
an a given pair of iterators
*/
template < class GridImp, class IteratorImp >
class DefaultIndexSet :
public IndexSet< GridImp, DefaultIndexSet <GridImp, IteratorImp>, unsigned int >
{
typedef GridImp GridType;
enum { dim = GridType :: dimension };
public:
enum { ncodim = GridType::dimension + 1 };
//! type of index
typedef unsigned int IndexType;
private:
//! type of iterator to generate index set
typedef IteratorImp IteratorType ;
public:
struct Index
{
int index_;
Index() : index_( -1 ) {}
int index() const { return index_; }
void set( const int index ) { index_ = index; }
};
typedef PersistentContainer< GridType, Index > PersistentContainerType ;
typedef std::vector< PersistentContainerType* > PersistentContainerVectorType;
private:
typedef DefaultIndexSet<GridType, IteratorType > ThisType;
template< int codim >
struct InsertEntity
{
static void apply ( const typename GridImp::template Codim< 0 >::Entity &entity,
PersistentContainerVectorType &indexContainer,
std::vector< int > &sizes )
{
PersistentContainerType &codimContainer = *(indexContainer[ codim ]);
if( codim == 0 )
{
Index &idx = codimContainer[ entity ];
if( idx.index() < 0 )
idx.set( sizes[ codim ]++ );
}
else
{
for( int i = 0; i < entity.subEntities(codim); ++i )
{
Index &idx = codimContainer( entity, i );
if( idx.index() < 0 )
idx.set( sizes[ codim ]++ );
}
}
}
};
template <class EntityType, int codim>
struct EntitySpec
{
static IndexType subIndex( const PersistentContainerType& indexContainer,
const EntityType & e,
int i )
{
// if the codimension equals that of the entity simply return the index
if( codim == EntityType :: codimension )
return indexContainer[ e ].index();
DUNE_THROW(NotImplemented,"subIndex for entities with codimension > 0 is not implemented");
return IndexType(-1);
}
};
template <class EntityType>
struct EntitySpec<EntityType,0>
{
static IndexType subIndex( const PersistentContainerType& indexContainer,
const EntityType & e,
int i )
{
assert( indexContainer( e, i ).index() >= 0 );
return indexContainer( e, i ).index();
}
};
public:
//! import default implementation of subIndex<cc>
//! \todo remove after next release
using IndexSet<GridType, DefaultIndexSet>::subIndex;
//! create index set by using the given begin and end iterator
//! for the given level (level == -1 means leaf level)
DefaultIndexSet( const GridType & grid ,
const IteratorType& begin,
const IteratorType& end,
const int level = -1 )
: grid_(grid),
indexContainers_( ncodim, (PersistentContainerType *) 0),
size_( ncodim, -1 ),
level_(level)
{
for( int codim=0; codim < ncodim; ++codim )
indexContainers_[ codim ] = new PersistentContainerType( grid, codim );
calcNewIndex (begin, end);
}
//! desctructor deleting persistent containers
~DefaultIndexSet ()
{
for( int codim=0; codim < ncodim; ++codim )
delete indexContainers_[ codim ];
}
const PersistentContainerType& indexContainer( const size_t codim ) const
{
assert( codim < indexContainers_.size() );
assert( indexContainers_[ codim ] );
return *( indexContainers_[ codim ] );
}
PersistentContainerType& indexContainer( const size_t codim )
{
assert( codim < indexContainers_.size() );
assert( indexContainers_[ codim ] );
return *( indexContainers_[ codim ] );
}
//! return LevelIndex of given entity
template<class EntityType>
IndexType index (const EntityType & en) const
{
enum { cd = EntityType :: codimension };
// this must not be true for vertices
// therefore only check other codims
#ifndef NDEBUG
const int codim = cd;
assert( (codim == dim) ? (1) : ( level_ < 0 ) || (level_ == en.level() ));
assert( indexContainer( codim )[ en ].index() >= 0 );
#endif
return indexContainer( cd )[ en ].index();
}
//! return LevelIndex of given entity
template<int cd>
IndexType index (const typename GridImp::template Codim<cd>::Entity& en) const
{
// this must not be true for vertices
// therefore only check other codims
#ifndef NDEBUG
const int codim = cd;
//const bool isLeaf = (codim == 0) ? en.isLeaf() : true ;
assert( (codim == dim) ? (1) : ( level_ < 0 ) || (level_ == en.level() ));
assert( indexContainer( cd )[ en ].index() >= 0 );
#endif
return indexContainer( cd )[ en ].index();
}
//! return subIndex (LevelIndex) for a given Entity of codim = 0 and a
//! given SubEntity codim and number of SubEntity
template< int cc >
IndexType subIndex ( const typename remove_const< GridImp >::type::Traits::template Codim< cc >::Entity &e,
int i, unsigned int codim ) const
{
assert( (codim != 0) || (level_ < 0) || ( level_ == e.level() ) );
typedef typename remove_const< GridImp >::type::Traits::template Codim< cc >::Entity Entity;
return EntitySpec< Entity, cc > :: subIndex( indexContainer( codim ), e, i );
}
//! returns true if this set provides an index for given entity
template<class EntityType>
bool contains (const EntityType& en) const
{
enum { cd = EntityType :: codimension };
return (indexContainer( cd )[ en ].index() >= 0 );
}
//! return size of IndexSet for a given level and codim
IndexType size ( int codim ) const
{
assert( codim >= 0 && codim <= GridType::dimension );
return size_[ codim ];
}
//! return size of IndexSet for a given level and codim
//! this method is to be revised
IndexType size ( GeometryType type ) const
{
if( typeNotValid(type) ) return 0;
return size_[GridType::dimension-type.dim()];
}
//! do calculation of the index set, has to be called when grid was
//! changed or if index set is created
void calcNewIndex ( const IteratorType &begin, const IteratorType &end )
{
// resize arrays to new size
// and set size to zero
for( int cd = 0; cd < ncodim; ++cd )
{
indexContainer( cd ).resize( Index() );
indexContainer( cd ).shrinkToFit();
indexContainer( cd ).fill( Index() );
size_[ cd ] = 0;
}
// grid walk to setup index set
for( IteratorType it = begin; it != end; ++it )
{
assert( ( level_ < 0 ) ? it->isLeaf() : (it->level() == level_) );
ForLoop< InsertEntity, 0, dim >::apply( *it, indexContainers_, size_ );
}
// remember the number of entity on level and cd = 0
for(int cd=0; cd<ncodim; ++cd)
{
#ifndef NDEBUG
const int gridSize = ( level_ < 0 ) ? grid_.size( cd ) : grid_.size( level_, cd);
const int mySize = size_[cd];
if( mySize > gridSize )
{
std::cout << "DefaultIndexSet[ " << level_ << " ]: " << mySize << " s | g " << gridSize << std::endl;
}
// this assertion currently fails for 3d conforming
// assert( ( grid_.conformingRefinement() && dim == 3 && level_ >= 0 ) ? true : (mySize <= gridSize) );
#endif
}
}
std::vector< GeometryType > types ( int codim ) const { return grid_.geomTypes( codim ); }
//! deliver all geometry types used in this grid
const std::vector<GeometryType>& geomTypes (int codim) const
{
return grid_.geomTypes( codim );
}
//! returns true if this set provides an index for given entity
bool containsIndex ( const int cd, const int idx ) const
{
assert( (typename PersistentContainerType::Size)idx < indexContainer( cd ).size() );
return ((indexContainer( cd ).begin() + idx)->index() >= 0);
}
private:
// return whether set has this type stored or not
bool typeNotValid (const GeometryType & type) const
{
int codim = GridType :: dimension - type.dim();
const std::vector<GeometryType> & geomT = geomTypes(codim);
for(size_t i=0; i<geomT.size(); ++i) if(geomT[i] == type) return false;
return true;
}
// grid this index set belongs to
const GridType& grid_;
//! vector with PersistentContainer for each codim
PersistentContainerVectorType indexContainers_;
// number of entitys of each level an codim
std::vector< int > size_;
// the level for which this index set is created
const int level_;
};
} // end namespace Dune
#endif // #ifndef DUNE_DEFAULTINDEXSETS_HH
|