DUNE PDELab (2.7)

utility.hh
1// -*- tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
2// vi: set et ts=8 sw=2 sts=2:
3
4#ifndef DUNE_PDELAB_ORDERING_UTILITY_HH
5#define DUNE_PDELAB_ORDERING_UTILITY_HH
6
7#include <vector>
8#include <bitset>
9
10#include <dune/pdelab/common/dofindex.hh>
11#include <dune/pdelab/common/globaldofindex.hh>
12#include <dune/pdelab/ordering/transformations.hh>
13
14namespace Dune {
15 namespace PDELab {
16
19
21 struct MergeMode
22 {
23
24 enum type {
25 lexicographic,
26 interleaved
27 };
28
29 };
30
31#ifndef DOXYGEN
32
33 namespace ordering {
34
35 // This is an implementation detail of the composite orderings, no need to confuse our users!
36 struct update_direct_children
37 : public TypeTree::DirectChildrenVisitor
38 , public TypeTree::DynamicTraversal
39 {
40
41 template<typename GFS, typename Child, typename TreePath, typename ChildIndex>
42 void afterChild(const GFS& gfs, Child& child, TreePath tp, ChildIndex childIndex) const
43 {
44 child.update();
45 }
46
47 };
48
49 } // end namespace ordering
50
51#endif // DOXYGEN
52
53
54 struct DefaultDOFIndexAccessor
55 {
56
57 template<typename DOFIndex, typename SizeType, typename IndexType>
58 static typename std::enable_if<
59 std::is_integral<IndexType>::value
60 >::type
61 store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, IndexType tree_index)
62 {
63 dof_index.clear();
64 dof_index.entityIndex()[0] = GlobalGeometryTypeIndex::index(gt);
65 dof_index.entityIndex()[1] = entity_index;
66 dof_index.treeIndex().push_back(tree_index);
67 }
68
69 template<typename DOFIndex, typename SizeType, typename IndexType>
70 static typename std::enable_if<
71 !std::is_integral<IndexType>::value
72 >::type
73 store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, IndexType tree_index)
74 {
75 dof_index.entityIndex()[0] = GlobalGeometryTypeIndex::index(gt);
76 dof_index.entityIndex()[1] = entity_index;
77 dof_index.treeIndex() = tree_index;
78 }
79
80 template<typename DOFIndex, typename SizeType, typename IndexType>
81 static typename std::enable_if<
82 std::is_integral<IndexType>::value
83 >::type
84 store(DOFIndex& dof_index, SizeType gt_index, SizeType entity_index, IndexType tree_index)
85 {
86 dof_index.clear();
87 dof_index.entityIndex()[0] = gt_index;
88 dof_index.entityIndex()[1] = entity_index;
89 dof_index.treeIndex().push_back(tree_index);
90 }
91
92 template<typename DOFIndex, typename SizeType, typename IndexType>
93 static typename std::enable_if<
94 !std::is_integral<IndexType>::value
95 >::type
96 store(DOFIndex& dof_index, SizeType gt_index, SizeType entity_index, IndexType tree_index)
97 {
98 dof_index.entityIndex()[0] = gt_index;
99 dof_index.entityIndex()[1] = entity_index;
100 dof_index.treeIndex() = tree_index;
101 }
102
103
104 struct GeometryIndex
105 {
106
107 template<typename Index>
108 static std::size_t geometryType(const Index& geometry_index)
109 {
110 return geometry_index[0];
111 }
112
113 template<typename Index>
114 static std::size_t entityIndex(const Index& geometry_index)
115 {
116 return geometry_index[1];
117 }
118
119 template<typename Index, typename SizeType>
120 static void store(Index& index, const GeometryType& gt, SizeType entity_index)
121 {
122 index[0] = GlobalGeometryTypeIndex::index(gt);
123 index[1] = entity_index;
124 }
125
126 };
127
128 template<typename DOFIndex>
129 static std::size_t geometryType(const DOFIndex& dof_index)
130 {
131 return GeometryIndex::geometryType(dof_index.entityIndex());
132 }
133
134 template<typename DOFIndex>
135 static std::size_t entityIndex(const DOFIndex& dof_index)
136 {
137 return GeometryIndex::entityIndex(dof_index.entityIndex());
138 }
139
140 };
141
142 struct SimpleDOFIndexAccessor
143 {
144
145 template<typename DOFIndex, typename SizeType>
146 static void store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, SizeType tree_index)
147 {
148 dof_index = entity_index;
149 }
150
151 };
152
153
154 template<typename DI, typename CI>
155 struct SimpleOrderingTraits
156 {
157
158 typedef DI DOFIndex;
159
160 typedef CI ContainerIndex;
161
162 typedef std::size_t SizeType;
163
164 typedef DefaultDOFIndexAccessor DOFIndexAccessor;
165
166 };
167
168
169 template<typename SizeType_, typename CI>
170 struct SimpleOrderingTraits<SimpleDOFIndex<SizeType_>,CI>
171 {
172
173 typedef SimpleDOFIndex<SizeType_> DOFIndex;
174
175 typedef CI ContainerIndex;
176
177 typedef SizeType_ SizeType;
178
179 typedef SimpleDOFIndexAccessor DOFIndexAccessor;
180
181 };
182
183
184
185 template<typename DI, typename CI>
186 struct OrderingTraits
187 : public SimpleOrderingTraits<DI,CI>
188 {
189
190 // The maximum dimension supported (length of bitsets)
191 // 32 dimensions should probably be fine for now... ;-)
192 static const std::size_t max_dim = 32;
193
194 typedef std::bitset<max_dim> CodimFlag;
195
196 typedef typename DI::TreeIndex TreeIndex;
197
198 typedef typename DI::View DOFIndexView;
199 typedef typename DI::View::TreeIndex TreeIndexView;
200
201 typedef typename DI::size_type SizeType;
202 typedef typename DI::size_type size_type;
203
204 };
205
206
207 template<typename ES, typename DI, typename CI>
208 struct LocalOrderingTraits
209 : public OrderingTraits<DI,
210 CI
211 >
212 {
213
214 using EntitySet = ES;
215 using GridView = typename ES::GridView;
216
217 };
218
219 template<typename ES, typename DI, typename CI>
220 struct GridViewOrderingTraits
221 : public LocalOrderingTraits<ES,DI,CI>
222 {
223
224 typedef typename DI::EntityIndex EntityIndex;
225 typedef typename DI::View::EntityIndex EntityIndexView;
226
227 };
228
229
230 template<typename DI, typename CI>
231 class VirtualOrderingBase
232 {
233 public:
234
235 typedef OrderingTraits<DI,CI> Traits;
236
237 VirtualOrderingBase() {}
238 virtual ~VirtualOrderingBase() = default;
239
240 virtual void map_index_dynamic(typename Traits::DOFIndexView di, typename Traits::ContainerIndex& ci) const = 0;
241 };
242
243
244 template<typename child_type>
245 struct extract_child_bases
246 : public TypeTree::DirectChildrenVisitor
247 , public TypeTree::DynamicTraversal
248 {
249
250 template<typename Node, typename Child, typename TreePath, typename ChildIndex>
251 void afterChild(const Node& node, Child& child, TreePath tp, ChildIndex child_index)
252 {
253 extract_child(node,child,child_index);
254 }
255
256 template<typename Node, typename Child, typename ChildIndex>
257 typename std::enable_if<Node::has_dynamic_ordering_children>::type
258 extract_child(const Node& node, Child& child, ChildIndex child_index)
259 {
260 _children[child_index] = &child;
261 }
262
263 template<typename Node, typename Child, typename ChildIndex>
264 typename std::enable_if<!Node::has_dynamic_ordering_children>::type
265 extract_child(const Node& node, Child& child, ChildIndex child_index)
266 {
267 }
268
269 extract_child_bases(std::vector<child_type*>& children)
270 : _children(children)
271 {}
272
273 private:
274 std::vector<child_type*>& _children;
275
276 };
277
278
280
289 struct DummyDOFIndexIterator
290 {
291
292 typedef std::size_t size_type;
293
294 DummyDOFIndexIterator& operator++()
295 {
296 return *this;
297 }
298
299 DummyDOFIndexIterator& operator+=(size_type i)
300 {
301 return *this;
302 }
303
304 DummyDOFIndexIterator& operator*()
305 {
306 return *this;
307 }
308
309 DummyDOFIndexIterator* operator->()
310 {
311 return this;
312 }
313
314 DummyDOFIndexIterator& treeIndex()
315 {
316 return *this;
317 }
318
319 bool operator==(const DummyDOFIndexIterator& r) const
320 {
321 return true;
322 }
323
324 bool operator!=(const DummyDOFIndexIterator& r) const
325 {
326 return !operator==(r);
327 }
328
329 void push_back(size_type i)
330 {}
331
332 };
333
335 } // namespace PDELab
336} // namespace Dune
337
338#endif // DUNE_PDELAB_ORDERING_UTILITY_HH
Dune::GlobalGeometryTypeIndex::index
static constexpr std::size_t index(const GeometryType &gt)
Compute the index for the given geometry type over all dimensions.
Definition: typeindex.hh:133
Dune::VTK::geometryType
GeometryType geometryType(const Dune::GeometryType &t)
mapping from GeometryType to VTKGeometryType
Definition: common.hh:199
Dune::FloatCmp::gt
bool gt(const T &first, const T &second, typename EpsilonType< T >::Type epsilon)
test if first greater than second
Definition: float_cmp.cc:156
Dune::TypeTree::Child
typename impl::_Child< Node, indices... >::type Child
Template alias for the type of a child node given by a list of child indices.
Definition: childextraction.hh:276
Dune::TypeTree::child
ImplementationDefined child(Node &&node, Indices... indices)
Extracts the child of a node given by a sequence of compile-time and run-time indices.
Definition: childextraction.hh:179
Dune
Dune namespace.
Definition: alignedallocator.hh:14
Dune::PDELab::DummyDOFIndexIterator
Dummy iterator type over DOF indices.
Definition: utility.hh:290
Dune::PDELab::MergeMode
Index merging algorithm for global orderings.
Definition: utility.hh:22
Dune::PDELab::MergeMode::type
type
Definition: utility.hh:24
Dune::PDELab::MergeMode::interleaved
@ interleaved
Indices are interleaved according to a user-supplied pattern ([i1,i2],[j1,j2] -> [i1,...
Definition: utility.hh:26
Dune::PDELab::MergeMode::lexicographic
@ lexicographic
Lexicographically ordered ([i1,i2],[j1,j2] -> [i1,i2,j1,j2]).
Definition: utility.hh:25
Dune::TypeTree::DefaultVisitor::afterChild
void afterChild(T &&t, Child &&child, TreePath treePath, ChildIndex childIndex) const
Method for child-parent traversal.
Definition: visitor.hh:119
Dune::TypeTree::DirectChildrenVisitor
Convenience base class for visiting the direct children of a node.
Definition: visitor.hh:339
Dune::TypeTree::DynamicTraversal
Mixin base class for visitors that only need a dynamic TreePath during traversal.
Definition: visitor.hh:324
transformations.hh
Define and register ordering related transformations. This header defines the two transformations gfs...
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.111.3 (Jul 15, 22:36, 2024)