Dune Core Modules (2.4.1)

persistentcontainermap.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_PERSISTENTCONTAINERMAP_HH
4#define DUNE_PERSISTENTCONTAINERMAP_HH
5
6#include <algorithm>
7#include <cassert>
8
12
13namespace Dune
14{
15
16 // PersistentContainerMap
17 // ----------------------
18
20 template< class G, class IdSet, class Map >
22 {
24
25 protected:
26 template< class reference, class iterator >
27 class IteratorWrapper;
28
29 template< int codim >
30 struct Resize;
31
32 public:
33 typedef G Grid;
34
35 typedef typename Map::mapped_type Value;
36 typedef typename Map::size_type Size;
37
38 typedef IteratorWrapper< const Value, typename Map::const_iterator > ConstIterator;
39 typedef IteratorWrapper< Value, typename Map::iterator > Iterator;
40
41 PersistentContainerMap ( const Grid &grid, int codim, const IdSet &idSet, const Value &value )
42 : grid_( &grid ),
43 codim_( codim ),
44 idSet_( &idSet ),
45 data_()
46 {
47 resize( value );
48 }
49
50 template< class Entity >
51 const Value &operator[] ( const Entity &entity ) const
52 {
53 assert( Entity::codimension == codimension() );
54 typename Map::const_iterator pos = data_.find( idSet().id( entity ) );
55 assert( pos != data_.end() );
56 return pos->second;
57 }
58
59 template< class Entity >
60 Value &operator[] ( const Entity &entity )
61 {
62 assert( Entity::codimension == codimension() );
63 typename Map::iterator pos = data_.find( idSet().id( entity ) );
64 assert( pos != data_.end() );
65 return pos->second;
66 }
67
68 template< class Entity >
69 const Value &operator() ( const Entity &entity, int subEntity ) const
70 {
71 typename Map::const_iterator pos = data_.find( idSet().subId( entity, subEntity, codimension() ) );
72 assert( pos != data_.end() );
73 return pos->second;
74 }
75
76 template< class Entity >
77 Value &operator() ( const Entity &entity, int subEntity )
78 {
79 typename Map::iterator pos = data_.find( idSet().subId( entity, subEntity, codimension() ) );
80 assert( pos != data_.end() );
81 return pos->second;
82 }
83
84 Size size () const { return data_.size(); }
85
86 void resize ( const Value &value = Value() )
87 {
89 }
90
91 void shrinkToFit () {}
92
93 void fill ( const Value &value ) { std::fill( begin(), end(), value ); }
94
95 void swap ( This &other )
96 {
97 std::swap( grid_, other.grid_ );
98 std::swap( codim_, other.codim_ );
99 std::swap( idSet_, other.idSet_ );
100 std::swap( data_, other.data_ );
101 }
102
103 ConstIterator begin () const;
104 Iterator begin ();
105
106 ConstIterator end () const;
107 Iterator end ();
108
109 int codimension () const { return codim_; }
110
111 protected:
112 const Grid &grid () const { return *grid_; }
113
114 template< int codim >
115 void resize ( const Value &value );
116
117 template< int codim >
118 void migrateLevel ( int level, const Value &value, Map &data,
119 integral_constant< bool, true > );
120
121 template< int codim >
122 void migrateLevel ( int level, const Value &value, Map &data,
123 integral_constant< bool, false > );
124
125 static void migrateEntry ( const typename IdSet::IdType &id, const Value &value,
126 Map &oldData, Map &newData );
127
128 const IdSet &idSet () const { return *idSet_; }
129
130 const Grid *grid_;
131 int codim_;
132 const IdSet *idSet_;
133 Map data_;
134 };
135
136
137
138 // PersistentContainerMap::IteratorWrapper
139 // ---------------------------------------
140
141 template< class G, class IdSet, class Map >
142 template< class value, class iterator >
143 class PersistentContainerMap< G, IdSet, Map >::IteratorWrapper
144 : public iterator
145 {
146 typedef IteratorWrapper< const value, typename Map::const_iterator > ConstWrapper;
147
148 public:
149 IteratorWrapper ( const iterator &it ) : it_( it ) {}
150
151 operator ConstWrapper () const { return ConstWrapper( it_ ); }
152
153 value &operator* () { return it_->second; }
154 value *operator-> () { return &(it_->second); }
155
156 bool operator== ( const IteratorWrapper &other ) const { return (it_ == other.it_); }
157 bool operator!= ( const IteratorWrapper &other ) const { return (it_ != other.it_); }
158
159 IteratorWrapper &operator++ () { ++it_; return *this; }
160
161 private:
162 iterator it_;
163 };
164
165
166
167 // PersistentContainerMap::Resize
168 // ------------------------------
169
170 template< class G, class IdSet, class Map >
171 template< int codim >
172 struct PersistentContainerMap< G, IdSet, Map >::Resize
173 {
174 static void apply ( PersistentContainerMap< G, IdSet, Map > &container,
175 const Value &value )
176 {
177 if( codim == container.codimension() )
178 container.template resize< codim >( value );
179 }
180 };
181
182
183
184 // Implementation of PersistentContainerMap
185 // ----------------------------------------
186
187 template< class G, class IdSet, class Map >
188 inline typename PersistentContainerMap< G, IdSet, Map >::ConstIterator
189 PersistentContainerMap< G, IdSet, Map >::begin () const
190 {
191 return ConstIterator( data_.begin() );
192 }
193
194 template< class G, class IdSet, class Map >
195 inline typename PersistentContainerMap< G, IdSet, Map >::Iterator
196 PersistentContainerMap< G, IdSet, Map >::begin ()
197 {
198 return Iterator( data_.begin() );
199 }
200
201
202 template< class G, class IdSet, class Map >
203 inline typename PersistentContainerMap< G, IdSet, Map >::ConstIterator
204 PersistentContainerMap< G, IdSet, Map >::end () const
205 {
206 return ConstIterator( data_.end() );
207 }
208
209 template< class G, class IdSet, class Map >
210 inline typename PersistentContainerMap< G, IdSet, Map >::Iterator
211 PersistentContainerMap< G, IdSet, Map >::end ()
212 {
213 return Iterator( data_.end() );
214 }
215
216
217 template< class G, class IdSet, class Map >
218 template< int codim >
219 inline void PersistentContainerMap< G, IdSet, Map >::resize ( const Value &value )
220 {
221 integral_constant< bool, Capabilities::hasEntity< Grid, codim >::v > hasEntity;
222 assert( codim == codimension() );
223
224 // create empty map and swap it with current map (no need to copy twice)
225 Map data;
226 std::swap( data, data_ );
227
228 // copy all data from old map into new one (adding new entries, if necessary)
229 const int maxLevel = grid().maxLevel();
230 for ( int level = 0; level <= maxLevel; ++level )
231 migrateLevel< codim >( level, value, data, hasEntity );
232 }
233
234
235 template< class G, class IdSet, class Map >
236 template< int codim >
237 inline void PersistentContainerMap< G, IdSet, Map >
238 ::migrateLevel ( int level, const Value &value, Map &data,
239 integral_constant< bool, true > )
240 {
241 typedef typename Grid::LevelGridView LevelView;
242 typedef typename LevelView::template Codim< codim >::Iterator LevelIterator;
243
244 const LevelView levelView = grid().levelGridView( level );
245 const LevelIterator end = levelView.template end< codim >();
246 for( LevelIterator it = levelView.template begin< codim >(); it != end; ++it )
247 migrateEntry( idSet().id( *it ), value, data, data_ );
248 }
249
250
251 template< class G, class IdSet, class Map >
252 template< int codim >
253 inline void PersistentContainerMap< G, IdSet, Map >
254 ::migrateLevel ( int level, const Value &value, Map &data,
255 integral_constant< bool, false > )
256 {
257 typedef typename Grid::LevelGridView LevelView;
258 typedef typename LevelView::template Codim< 0 >::Iterator LevelIterator;
259
260 const LevelView levelView = grid().levelGridView( level );
261 const LevelIterator end = levelView.template end< 0 >();
262 for( LevelIterator it = levelView.template begin< 0 >(); it != end; ++it )
263 {
264 const typename LevelIterator::Entity &entity = *it;
265 const int subEntities = entity.subEntities( codim );
266 for( int i = 0; i < subEntities; ++i )
267 migrateEntry( idSet().subId( entity, i, codim ), value, data, data_ );
268 }
269 }
270
271
272 template< class G, class IdSet, class Map >
273 inline void PersistentContainerMap< G, IdSet, Map >
274 ::migrateEntry ( const typename IdSet::IdType &id, const Value &value,
275 Map &oldData, Map &newData )
276 {
277 // insert entry for id
278 const std::pair< typename Map::iterator, bool > inserted
279 = newData.insert( std::make_pair( id, value ) );
280
281 // if entry did not exist previously, copy data
282 if( inserted.second )
283 {
284 const typename Map::iterator pos = oldData.find( id );
285 if( pos != oldData.end() )
286 {
287 inserted.first->second = pos->second;
288 oldData.erase( pos );
289 }
290 }
291 }
292
293} // namespace Dune
294
295#endif // #ifndef DUNE_PERSISTENTCONTAINERMAP_HH
Wrapper class for entities.
Definition: entity.hh:62
@ codimension
Know your own codimension.
Definition: entity.hh:104
A static loop using TMP.
Definition: forloop.hh:110
Partition< All_Partition >::LevelGridView LevelGridView
View types for All_Partition.
Definition: grid.hh:428
Id Set Interface.
Definition: indexidset.hh:414
IdTypeImp IdType
Type used to represent an id.
Definition: indexidset.hh:417
map-based implementation of the PersistentContainer
Definition: persistentcontainermap.hh:22
A set of traits classes to store static information about grid implementation.
A static for loop for template meta-programming.
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition: iteratorfacades.hh:230
EnableIfInterOperable< T1, T2, bool >::type operator!=(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for inequality.
Definition: iteratorfacades.hh:252
Dune namespace.
Definition: alignment.hh:10
Traits for type conversions and type information.
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.111.3 (Nov 21, 23:30, 2024)