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
|
// ---------------------------------------------------------------------
//
// Copyright (C) 1999 - 2017 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------
#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/smartpointer.h>
#include <deal.II/grid/tria.h>
#include <deal.II/dofs/dof_handler.h>
#include <deal.II/fe/fe.h>
#include <deal.II/grid/tria_accessor.h>
#include <deal.II/dofs/dof_accessor.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/grid/intergrid_map.h>
#include <deal.II/distributed/tria.h>
#include <deal.II/distributed/shared_tria.h>
DEAL_II_NAMESPACE_OPEN
template <class MeshType>
InterGridMap<MeshType>::InterGridMap ()
:
source_grid(nullptr, typeid(*this).name()),
destination_grid(nullptr, typeid(*this).name())
{}
template <class MeshType>
void InterGridMap<MeshType>::make_mapping (const MeshType &source_grid,
const MeshType &destination_grid)
{
// first delete all contents
clear ();
// next store pointers to grids
this->source_grid = &source_grid;
this->destination_grid = &destination_grid;
// then set up the meshes from
// scratch and fill them with end-iterators
const unsigned int n_levels = source_grid.get_triangulation().n_levels();
mapping.resize (n_levels);
for (unsigned int level=0; level<n_levels; ++level)
{
// first find out about the highest
// index used on this level. We could
// in principle ask the triangulation
// about this, but we would have to
// know the underlying data structure
// for this and we would like to
// avoid such knowledge here
unsigned int n_cells = 0;
cell_iterator cell = source_grid.begin(level),
endc = source_grid.end(level);
for (; cell!=endc; ++cell)
if (static_cast<unsigned int>(cell->index()) > n_cells)
n_cells = cell->index();
// note: n_cells is now the largest
// zero-based index, but we need the
// number of cells, which is one larger
mapping[level].resize (n_cells+1, destination_grid.end());
};
// now make up the mapping
// loop over all cells and set the user
// pointers as well as the contents of
// the two arrays. note that the function
// takes a *reference* to the int and
// this may change it
cell_iterator src_cell = source_grid.begin(0),
dst_cell = destination_grid.begin(0),
endc = source_grid.end(0);
for (; src_cell!=endc; ++src_cell, ++dst_cell)
set_mapping (src_cell, dst_cell);
// little assertion that the two grids
// are indeed related:
Assert (dst_cell == destination_grid.end(0),
ExcIncompatibleGrids ());
}
template <class MeshType>
void
InterGridMap<MeshType>::set_mapping (const cell_iterator &src_cell,
const cell_iterator &dst_cell)
{
// first set the map for this cell
mapping[src_cell->level()][src_cell->index()] = dst_cell;
// if both cells have children, we may
// recurse further into the hierarchy
if (src_cell->has_children() && dst_cell->has_children())
{
Assert(src_cell->n_children()==
GeometryInfo<MeshType::dimension>::max_children_per_cell,
ExcNotImplemented());
Assert(dst_cell->n_children()==
GeometryInfo<MeshType::dimension>::max_children_per_cell,
ExcNotImplemented());
Assert(src_cell->refinement_case()==dst_cell->refinement_case(),
ExcNotImplemented());
for (unsigned int c=0; c<GeometryInfo<MeshType::dimension>::max_children_per_cell; ++c)
set_mapping (src_cell->child(c),
dst_cell->child(c));
}
else if (src_cell->has_children() &&
!dst_cell->has_children())
// src grid is more refined here.
// set entries for all children
// of this cell to the one
// dst_cell
for (unsigned int c=0; c<src_cell->n_children(); ++c)
set_entries_to_cell (src_cell->child(c),
dst_cell);
// else (no cell is refined or
// dst_cell is refined): no pointers
// to be set
}
template <class MeshType>
void
InterGridMap<MeshType>::set_entries_to_cell (const cell_iterator &src_cell,
const cell_iterator &dst_cell)
{
// first set the map for this cell
mapping[src_cell->level()][src_cell->index()] = dst_cell;
// then do so for the children as well
// if there are any
if (src_cell->has_children())
for (unsigned int c=0; c<src_cell->n_children(); ++c)
set_entries_to_cell (src_cell->child(c),
dst_cell);
}
template <class MeshType>
typename InterGridMap<MeshType>::cell_iterator
InterGridMap<MeshType>::operator [] (const cell_iterator &source_cell) const
{
Assert (source_cell.state() == IteratorState::valid,
ExcInvalidKey (source_cell));
Assert (source_cell->level() <= static_cast<int>(mapping.size()),
ExcInvalidKey (source_cell));
Assert (source_cell->index() <= static_cast<int>(mapping[source_cell->level()].size()),
ExcInvalidKey (source_cell));
return mapping[source_cell->level()][source_cell->index()];
}
template <class MeshType>
void InterGridMap<MeshType>::clear ()
{
mapping.clear ();
source_grid = nullptr;
destination_grid = nullptr;
}
template <class MeshType>
const MeshType &
InterGridMap<MeshType>::get_source_grid () const
{
return *source_grid;
}
template <class MeshType>
const MeshType &
InterGridMap<MeshType>::get_destination_grid () const
{
return *destination_grid;
}
template <class MeshType>
std::size_t
InterGridMap<MeshType>::memory_consumption () const
{
return (MemoryConsumption::memory_consumption (mapping) +
MemoryConsumption::memory_consumption (source_grid) +
MemoryConsumption::memory_consumption (destination_grid));
}
// explicit instantiations
#include "intergrid_map.inst"
DEAL_II_NAMESPACE_CLOSE
|
