Dune Core Modules (2.5.2)

gridview.hh
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
2// vi: set et ts=4 sw=2 sts=2:
3#ifndef DUNE_ALBERTAGRID_GRIDVIEW_HH
4#define DUNE_ALBERTAGRID_GRIDVIEW_HH
5
6#if HAVE_ALBERTA
7
8#include <dune/common/typetraits.hh>
9#include <dune/common/exceptions.hh>
10
11#include <dune/grid/common/capabilities.hh>
12#include <dune/grid/common/gridview.hh>
13
14#include <dune/grid/albertagrid/intersectioniterator.hh>
15
16namespace Dune
17{
18
19 template< class GridImp >
20 class AlbertaLevelGridView;
21
22 template< class GridImp >
23 class AlbertaLeafGridView;
24
25
26 template< class GridImp >
27 struct AlbertaLevelGridViewTraits
28 {
29 typedef AlbertaLevelGridView< GridImp > GridViewImp;
30
32 typedef typename std::remove_const<GridImp>::type Grid;
33
35 typedef typename Grid::Traits::LevelIndexSet IndexSet;
36
38 typedef typename Grid::Traits::LevelIntersection Intersection;
39
41 typedef typename Grid::Traits::LevelIntersectionIterator
42 IntersectionIterator;
43
45 typedef typename Grid::Traits::CollectiveCommunication CollectiveCommunication;
46
47 template< int cd >
48 struct Codim
49 {
50 typedef typename Grid::Traits::template Codim< cd >::template Partition< All_Partition >::LevelIterator Iterator;
51
52 typedef typename Grid::Traits::template Codim< cd >::Entity Entity;
53
54 typedef typename Grid::template Codim< cd >::Geometry Geometry;
55 typedef typename Grid::template Codim< cd >::LocalGeometry
56 LocalGeometry;
57
59 template< PartitionIteratorType pit >
60 struct Partition
61 {
63 typedef typename Grid::template Codim< cd >::template Partition< pit >::LevelIterator
64 Iterator;
65 };
66 };
67
68 enum { conforming = Capabilities::isLevelwiseConforming< Grid >::v };
69 };
70
71
72 template< class GridImp >
73 class AlbertaLevelGridView
74 {
75 typedef AlbertaLevelGridView< GridImp > ThisType;
76
77 public:
78 typedef AlbertaLevelGridViewTraits<GridImp> Traits;
79
81 typedef typename Traits::Grid Grid;
82
84 typedef typename Traits::IndexSet IndexSet;
85
87 typedef typename Traits::Intersection Intersection;
88
90 typedef typename Traits::IntersectionIterator IntersectionIterator;
91
93 typedef typename Traits::CollectiveCommunication CollectiveCommunication;
94
96 template< int cd >
97 struct Codim : public Traits::template Codim<cd> {};
98
99 enum { conforming = Traits::conforming };
100
101 private:
102 typedef Alberta::ElementInfo< Grid::dimension > ElementInfo;
103
104 typedef Dune::AlbertaGridLeafIntersectionIterator< GridImp > IntersectionIteratorImpl;
105
106 public:
107 AlbertaLevelGridView ( const Grid &grid, int level )
108 : grid_( &grid ),
109 indexSet_( &(grid.levelIndexSet( level )) ),
110 level_( level )
111 {}
112
113 // use default implementation of copy constructor and assignment operator
114#if 0
115 AlbertaLevelGridView ( const ThisType &other )
116 : grid_( other.grid_ ),
117 indexSet_( other.indexSet_ ),
118 level_( other.level_ )
119 {}
120
122 ThisType &operator= ( const ThisType & other)
123 {
124 grid_ = other.grid_;
125 indexSet_ = other.indexSet_;
126 level_ = other.level_;
127 }
128#endif
129
131 const Grid &grid () const
132 {
133 return *grid_;
134 }
135
137 const IndexSet &indexSet () const
138 {
139 return *indexSet_;
140 }
141
143 int size ( int codim ) const
144 {
145 return grid().size( level_, codim );
146 }
147
149 int size ( const GeometryType &type ) const
150 {
151 return grid().size( level_, type );
152 }
153
155 template< int cd >
156 typename Codim< cd >::Iterator begin () const
157 {
158 return grid().template lbegin< cd, All_Partition >( level_ );
159 }
160
162 template< int cd, PartitionIteratorType pit >
163 typename Codim< cd >::template Partition< pit >::Iterator begin () const
164 {
165 return grid().template lbegin< cd, pit >( level_ );
166 }
167
169 template< int cd >
170 typename Codim< cd >::Iterator end () const
171 {
172 return grid().template lend< cd, All_Partition >( level_ );
173 }
174
176 template< int cd, PartitionIteratorType pit >
177 typename Codim< cd >::template Partition< pit >::Iterator end () const
178 {
179 return grid().template lend< cd, pit >( level_ );
180 }
181
183 IntersectionIterator
184 ibegin ( const typename Codim< 0 >::Entity &entity ) const
185 {
186 if( grid().maxLevel() == 0)
187 {
188 typename IntersectionIteratorImpl::Begin begin;
189 return IntersectionIteratorImpl( Grid::getRealImplementation( entity ), begin );
190 }
191 else
192 {
193 DUNE_THROW( NotImplemented, "method ibegin not implemented on LevelGridView for AlbertaGrid." );
194 typename IntersectionIteratorImpl::End end;
195 return IntersectionIteratorImpl( Grid::getRealImplementation( entity ), end );
196 }
197 }
198
200 IntersectionIterator
201 iend ( const typename Codim< 0 >::Entity &entity ) const
202 {
203 typename IntersectionIteratorImpl::End end;
204 return IntersectionIteratorImpl( Grid::getRealImplementation( entity ), end );
205 }
206
208 const CollectiveCommunication &comm () const
209 {
210 return grid().comm();
211 }
212
214 int overlapSize(int codim) const
215 {
216 return grid().overlapSize(level_, codim);
217 }
218
220 int ghostSize(int codim) const
221 {
222 return grid().ghostSize(level_, codim);
223 }
224
226 template< class DataHandleImp, class DataType >
227 void communicate ( CommDataHandleIF< DataHandleImp, DataType > &data,
228 InterfaceType iftype,
229 CommunicationDirection dir ) const
230 {}
231
232 private:
233 const Grid *grid_;
234 const IndexSet *indexSet_;
235 int level_;
236 };
237
238
239 template< class GridImp >
240 struct AlbertaLeafGridViewTraits
241 {
242 typedef AlbertaLeafGridView< GridImp > GridViewImp;
243
245 typedef typename std::remove_const<GridImp>::type Grid;
246
248 typedef typename Grid::Traits::LeafIndexSet IndexSet;
249
251 typedef typename Grid::Traits::LeafIntersection Intersection;
252
254 typedef typename Grid::Traits::LeafIntersectionIterator
255 IntersectionIterator;
256
258 typedef typename Grid::Traits::CollectiveCommunication CollectiveCommunication;
259
260 template< int cd >
261 struct Codim
262 {
263 typedef typename Grid::Traits::template Codim< cd >::template Partition< All_Partition >::LeafIterator
264 Iterator;
265
266 typedef typename Grid::Traits::template Codim< cd >::Entity Entity;
267
268 typedef typename Grid::template Codim< cd >::Geometry Geometry;
269 typedef typename Grid::template Codim< cd >::LocalGeometry
270 LocalGeometry;
271
273 template <PartitionIteratorType pit >
274 struct Partition
275 {
277 typedef typename Grid::template Codim< cd >::template Partition< pit >::LeafIterator
278 Iterator;
279 };
280 };
281
282 enum { conforming = Capabilities::isLeafwiseConforming< Grid >::v };
283 };
284
285
286 template< class GridImp >
287 class AlbertaLeafGridView
288 {
289 typedef AlbertaLeafGridView< GridImp > ThisType;
290
291 public:
292 typedef AlbertaLeafGridViewTraits<GridImp> Traits;
293
295 typedef typename Traits::Grid Grid;
296
298 typedef typename Traits::IndexSet IndexSet;
299
301 typedef typename Traits::Intersection Intersection;
302
304 typedef typename Traits::IntersectionIterator IntersectionIterator;
305
307 typedef typename Traits::CollectiveCommunication CollectiveCommunication;
308
310 template< int cd >
311 struct Codim : public Traits::template Codim<cd> {};
312
313 enum { conforming = Traits::conforming };
314
315 private:
316 typedef Alberta::ElementInfo< Grid::dimension > ElementInfo;
317
318 typedef Dune::AlbertaGridLeafIntersectionIterator< GridImp > IntersectionIteratorImpl;
319
320 public:
321 AlbertaLeafGridView ( const Grid &grid )
322 : grid_( &grid ),
323 indexSet_( &(grid.leafIndexSet()) )
324 {}
325
326 // use default implementation of copy constructor and assignment operator
327#if 0
328 AlbertaLeafGridView ( const ThisType &other )
329 : grid_( other.grid_ ),
330 indexSet_( other.indexSet_ )
331 {}
332
334 ThisType &operator= ( const ThisType & other)
335 {
336 grid_ = other.grid_;
337 indexSet_ = other.indexSet_;
338 }
339#endif
340
342 const Grid &grid () const
343 {
344 return *grid_;
345 }
346
348 const IndexSet &indexSet () const
349 {
350 return *indexSet_;
351 }
352
354 int size ( int codim ) const
355 {
356 return grid().size( codim );
357 }
358
360 int size ( const GeometryType &type ) const
361 {
362 return grid().size( type );
363 }
364
366 template< int cd >
367 typename Codim< cd >::Iterator begin () const
368 {
369 return grid().template leafbegin< cd, All_Partition >();
370 }
371
373 template< int cd, PartitionIteratorType pit >
374 typename Codim< cd >::template Partition< pit >::Iterator begin () const
375 {
376 return grid().template leafbegin< cd, pit >();
377 }
378
380 template< int cd >
381 typename Codim< cd >::Iterator end () const
382 {
383 return grid().template leafend< cd, All_Partition >();
384 }
385
387 template< int cd, PartitionIteratorType pit >
388 typename Codim< cd >::template Partition< pit >::Iterator end () const
389 {
390 return grid().template leafend< cd, pit >();
391 }
392
394 IntersectionIterator
395 ibegin ( const typename Codim< 0 >::Entity &entity ) const
396 {
397 const ElementInfo elementInfo = Grid::getRealImplementation( entity ).elementInfo();
398 assert( !!elementInfo );
399
400#ifndef NDEBUG
401 for( int i = 0; i <= Grid::dimension; ++i )
402 {
403 if( elementInfo.elInfo().opp_vertex[ i ] == 127 )
404 DUNE_THROW( NotImplemented, "AlbertaGrid: Intersections on outside entities are not fully implemented, yet." );
405 }
406#endif // #ifndef NDEBUG
407
408 typename IntersectionIteratorImpl::Begin begin;
409 return IntersectionIteratorImpl( Grid::getRealImplementation( entity ), begin );
410 }
411
413 IntersectionIterator
414 iend ( const typename Codim< 0 >::Entity &entity ) const
415 {
416 assert( !!Grid::getRealImplementation( entity ).elementInfo() );
417 typename IntersectionIteratorImpl::End end;
418 return IntersectionIteratorImpl( Grid::getRealImplementation( entity ), end );
419 }
420
422 const CollectiveCommunication &comm () const
423 {
424 return grid().comm();
425 }
426
428 int overlapSize(int codim) const
429 {
430 return grid().overlapSize(codim);
431 }
432
434 int ghostSize(int codim) const
435 {
436 return grid().ghostSize(codim);
437 }
438
440 template< class DataHandleImp, class DataType >
441 void communicate ( CommDataHandleIF< DataHandleImp, DataType > &data,
442 InterfaceType iftype,
443 CommunicationDirection dir ) const
444 {}
445
446 private:
447 const Grid *grid_;
448 const IndexSet *indexSet_;
449 };
450
451}
452
453#endif // #if HAVE_ALBERTA
454#endif // #ifndef DUNE_ALBERTAGRID_GRIDVIEW_HH
intersectioniterator.hh
Implementation of the IntersectionIterator for AlbertaGrid.
Dune::Grid
Grid abstract base class.
Definition: grid.hh:373
Dune::Grid::dimension
@ dimension
The dimension of the grid.
Definition: grid.hh:387
capabilities.hh
A set of traits classes to store static information about grid implementation.
exceptions.hh
A few common exception classes.
DUNE_THROW
#define DUNE_THROW(E, m)
Definition: exceptions.hh:216
Dune::CommunicationDirection
CommunicationDirection
Define a type for communication direction parameter.
Definition: gridenums.hh:168
Dune::InterfaceType
InterfaceType
Parameter to be used for the communication functions.
Definition: gridenums.hh:84
Dune
Dune namespace.
Definition: alignment.hh:11
Dune::AlbertaLeafGridViewTraits::Codim::Partition
Define types needed to iterate over entities of a given partition type.
Definition: gridview.hh:275
Dune::AlbertaLeafGridViewTraits::Codim::Partition::Iterator
Grid::template Codim< cd >::template Partition< pit >::LeafIterator Iterator
iterator over a given codim and partition type
Definition: gridview.hh:278
Dune::AlbertaLeafGridView::Codim
Codim Structure.
Definition: gridview.hh:311
Dune::AlbertaLevelGridViewTraits::Codim::Partition
Define types needed to iterate over entities of a given partition type.
Definition: gridview.hh:61
Dune::AlbertaLevelGridViewTraits::Codim::Partition::Iterator
Grid::template Codim< cd >::template Partition< pit >::LevelIterator Iterator
iterator over a given codim and partition type
Definition: gridview.hh:64
Dune::AlbertaLevelGridView::Codim
Codim Structure.
Definition: gridview.hh:97
Dune::Capabilities::isLeafwiseConforming
Specialize with 'true' if implementation guarantees a conforming leaf grid. (default=false)
Definition: capabilities.hh:87
Dune::Capabilities::isLevelwiseConforming
Specialize with 'true' if implementation guarantees conforming level grids. (default=false)
Definition: capabilities.hh:78
typetraits.hh
Traits for type conversions and type information.
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.111.3 (Nov 13, 23:29, 2024)