DUNE PDELab (2.7)

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( entity.impl(), 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( entity.impl(), end );
196 }
197 }
198
200 IntersectionIterator
201 iend ( const typename Codim< 0 >::Entity &entity ) const
202 {
203 typename IntersectionIteratorImpl::End end;
204 return IntersectionIteratorImpl( entity.impl(), end );
205 }
206
208 const CollectiveCommunication &comm () const
209 {
210 return grid().comm();
211 }
212
214 int overlapSize ( int codim ) const { return 0; }
215
217 int ghostSize ( int codim ) const { return 0; }
218
220 template< class DataHandleImp, class DataType >
221 void communicate ( CommDataHandleIF< DataHandleImp, DataType > &data,
222 InterfaceType iftype,
223 CommunicationDirection dir ) const
224 {}
225
226 private:
227 const Grid *grid_;
228 const IndexSet *indexSet_;
229 int level_;
230 };
231
232
233 template< class GridImp >
234 struct AlbertaLeafGridViewTraits
235 {
236 typedef AlbertaLeafGridView< GridImp > GridViewImp;
237
239 typedef typename std::remove_const<GridImp>::type Grid;
240
242 typedef typename Grid::Traits::LeafIndexSet IndexSet;
243
245 typedef typename Grid::Traits::LeafIntersection Intersection;
246
248 typedef typename Grid::Traits::LeafIntersectionIterator
249 IntersectionIterator;
250
252 typedef typename Grid::Traits::CollectiveCommunication CollectiveCommunication;
253
254 template< int cd >
255 struct Codim
256 {
257 typedef typename Grid::Traits::template Codim< cd >::template Partition< All_Partition >::LeafIterator
258 Iterator;
259
260 typedef typename Grid::Traits::template Codim< cd >::Entity Entity;
261
262 typedef typename Grid::template Codim< cd >::Geometry Geometry;
263 typedef typename Grid::template Codim< cd >::LocalGeometry
264 LocalGeometry;
265
267 template <PartitionIteratorType pit >
268 struct Partition
269 {
271 typedef typename Grid::template Codim< cd >::template Partition< pit >::LeafIterator
272 Iterator;
273 };
274 };
275
276 enum { conforming = Capabilities::isLeafwiseConforming< Grid >::v };
277 };
278
279
280 template< class GridImp >
281 class AlbertaLeafGridView
282 {
283 typedef AlbertaLeafGridView< GridImp > ThisType;
284
285 public:
286 typedef AlbertaLeafGridViewTraits<GridImp> Traits;
287
289 typedef typename Traits::Grid Grid;
290
292 typedef typename Traits::IndexSet IndexSet;
293
295 typedef typename Traits::Intersection Intersection;
296
298 typedef typename Traits::IntersectionIterator IntersectionIterator;
299
301 typedef typename Traits::CollectiveCommunication CollectiveCommunication;
302
304 template< int cd >
305 struct Codim : public Traits::template Codim<cd> {};
306
307 enum { conforming = Traits::conforming };
308
309 private:
310 typedef Alberta::ElementInfo< Grid::dimension > ElementInfo;
311
312 typedef Dune::AlbertaGridLeafIntersectionIterator< GridImp > IntersectionIteratorImpl;
313
314 public:
315 AlbertaLeafGridView ( const Grid &grid )
316 : grid_( &grid ),
317 indexSet_( &(grid.leafIndexSet()) )
318 {}
319
320 // use default implementation of copy constructor and assignment operator
321#if 0
322 AlbertaLeafGridView ( const ThisType &other )
323 : grid_( other.grid_ ),
324 indexSet_( other.indexSet_ )
325 {}
326
328 ThisType &operator= ( const ThisType & other)
329 {
330 grid_ = other.grid_;
331 indexSet_ = other.indexSet_;
332 }
333#endif
334
336 const Grid &grid () const
337 {
338 return *grid_;
339 }
340
342 const IndexSet &indexSet () const
343 {
344 return *indexSet_;
345 }
346
348 int size ( int codim ) const
349 {
350 return grid().size( codim );
351 }
352
354 int size ( const GeometryType &type ) const
355 {
356 return grid().size( type );
357 }
358
360 template< int cd >
361 typename Codim< cd >::Iterator begin () const
362 {
363 return grid().template leafbegin< cd, All_Partition >();
364 }
365
367 template< int cd, PartitionIteratorType pit >
368 typename Codim< cd >::template Partition< pit >::Iterator begin () const
369 {
370 return grid().template leafbegin< cd, pit >();
371 }
372
374 template< int cd >
375 typename Codim< cd >::Iterator end () const
376 {
377 return grid().template leafend< cd, All_Partition >();
378 }
379
381 template< int cd, PartitionIteratorType pit >
382 typename Codim< cd >::template Partition< pit >::Iterator end () const
383 {
384 return grid().template leafend< cd, pit >();
385 }
386
388 IntersectionIterator
389 ibegin ( const typename Codim< 0 >::Entity &entity ) const
390 {
391 const ElementInfo elementInfo = entity.impl().elementInfo();
392 assert( !!elementInfo );
393
394#ifndef NDEBUG
395 for( int i = 0; i <= Grid::dimension; ++i )
396 {
397 if( elementInfo.elInfo().opp_vertex[ i ] == 127 )
398 DUNE_THROW( NotImplemented, "AlbertaGrid: Intersections on outside entities are not fully implemented, yet." );
399 }
400#endif // #ifndef NDEBUG
401
402 typename IntersectionIteratorImpl::Begin begin;
403 return IntersectionIteratorImpl( entity.impl(), begin );
404 }
405
407 IntersectionIterator
408 iend ( const typename Codim< 0 >::Entity &entity ) const
409 {
410 assert( !!entity.impl().elementInfo() );
411 typename IntersectionIteratorImpl::End end;
412 return IntersectionIteratorImpl( entity.impl(), end );
413 }
414
416 const CollectiveCommunication &comm () const
417 {
418 return grid().comm();
419 }
420
422 int overlapSize ( int codim ) const { return 0; }
423
425 int ghostSize ( int codim ) const { return 0; }
426
428 template< class DataHandleImp, class DataType >
429 void communicate ( CommDataHandleIF< DataHandleImp, DataType > &data,
430 InterfaceType iftype,
431 CommunicationDirection dir ) const
432 {}
433
434 private:
435 const Grid *grid_;
436 const IndexSet *indexSet_;
437 };
438
439}
440
441#endif // #if HAVE_ALBERTA
442#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.
typetraits.hh
Traits for type conversions and type information.
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: alignedallocator.hh:14
Dune::AlbertaLeafGridViewTraits::Codim::Partition
Define types needed to iterate over entities of a given partition type.
Definition: gridview.hh:269
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:272
Dune::AlbertaLeafGridView::Codim
Codim Structure.
Definition: gridview.hh:305
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:113
Dune::Capabilities::isLevelwiseConforming
Specialize with 'true' if implementation guarantees conforming level grids. (default=false)
Definition: capabilities.hh:104
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.111.3 (Jul 15, 22:36, 2024)