/usr/include/dune/grid/yaspgrid/yaspgridintersection.hh is in libdune-grid-dev 2.4.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_GRID_YASPGRIDINTERSECTION_HH
#define DUNE_GRID_YASPGRIDINTERSECTION_HH
/** \file
* \brief The YaspIntersection class
*
YaspIntersection provides data about intersection with
neighboring codim 0 entities.
*/
namespace Dune {
/** \brief YaspIntersection provides data about intersection with
neighboring codim 0 entities.
*/
template<class GridImp>
class YaspIntersection
{
enum { dim=GridImp::dimension };
enum { dimworld=GridImp::dimensionworld };
typedef typename GridImp::ctype ctype;
typedef typename GridImp::Traits::template Codim< 1 >::GeometryImpl GeometryImpl;
typedef typename GridImp::Traits::template Codim< 1 >::LocalGeometryImpl LocalGeometryImpl;
friend class YaspIntersectionIterator<GridImp>;
public:
// types used from grids
typedef typename GridImp::YGridLevelIterator YGLI;
typedef typename GridImp::YGrid::Iterator I;
typedef typename GridImp::template Codim<0>::Entity Entity;
typedef typename GridImp::template Codim<0>::EntityPointer EntityPointer;
typedef typename GridImp::template Codim<1>::Geometry Geometry;
typedef typename GridImp::template Codim<1>::LocalGeometry LocalGeometry;
void update() {
// vector with per-direction movements
std::array<int,dim> dist{{0}};
// first move: back to center
dist[_dir] = 1 - 2*_face;
// update face info
_dir = _count / 2;
_face = _count % 2;
// second move: to new neighbor
dist[_dir] += -1 + 2*_face;
// move transforming iterator
_outside.transformingsubiterator().move(dist);
}
/*! return true if we are on the boundary of the domain
unless we are periodic in that direction
*/
bool boundary () const
{
// Coordinate of intersection in its direction
int coord = _inside.transformingsubiterator().coord(_dir) + _face;
if (_inside.gridlevel()->mg->isPeriodic(_dir))
return false;
else
return coord == 0
||
coord == _inside.gridlevel()->mg->levelSize(_inside.gridlevel()->level(),_dir);
}
//! return true if neighbor across intersection exists in this processor
bool neighbor () const
{
// Coordinate of intersection in its direction
int coord = _inside.transformingsubiterator().coord(_dir) + _face;
return coord > _inside.gridlevel()->overlap[0].dataBegin()->min(_dir)
&&
coord <= _inside.gridlevel()->overlap[0].dataBegin()->max(_dir);
}
//! Yasp is always conform
bool conforming () const
{
return true;
}
//! return EntityPointer to the Entity on the inside of this intersection
//! (that is the Entity where we started this Iterator)
Entity inside() const
{
return Entity(_inside);
}
//! return EntityPointer to the Entity on the outside of this intersection
Entity outside() const
{
return Entity(_outside);
}
#if DUNE_GRID_EXPERIMENTAL_GRID_EXTENSIONS
//! identifier for boundary segment from macro grid
//! (attach your boundary condition as needed)
int boundaryId() const
{
if(boundary()) return indexInInside()+1;
return 0;
}
#endif
//! identifier for boundary segment from macro grid
//! (attach your boundary condition as needed)
int boundarySegmentIndex() const
{
if(! boundary())
DUNE_THROW(GridError, "called boundarySegmentIndex while boundary() == false");
// size of local macro grid
const Dune::array<int, dim> & size = _inside.gridlevel()->mg->begin()->overlap[0].dataBegin()->size();
const Dune::array<int, dim> & origin = _inside.gridlevel()->mg->begin()->overlap[0].dataBegin()->origin();
Dune::array<int, dim> sides;
{
for (int i=0; i<dim; i++)
{
sides[i] =
((_inside.gridlevel()->mg->begin()->overlap[0].dataBegin()->origin(i)
== 0)+
(_inside.gridlevel()->mg->begin()->overlap[0].dataBegin()->origin(i) +
_inside.gridlevel()->mg->begin()->overlap[0].dataBegin()->size(i)
==
_inside.gridlevel()->mg->levelSize(0,i)));
}
}
// global position of the cell on macro grid
Dune::array<int, dim> pos = _inside.transformingsubiterator().coord();
for(int i=0; i<dim; i++)
{
pos[i] = pos[i] / (1<<_inside.level());
pos[i] = pos[i] - origin[i];
}
// compute unit-cube-face-sizes
Dune::array<int, dim> fsize;
{
int vol = 1;
for (int k=0; k<dim; k++)
vol *= size[k];
for (int k=0; k<dim; k++)
fsize[k] = vol/size[k];
}
// compute index in the unit-cube-face
int index = 0;
{
int localoffset = 1;
for (int k=dim-1; k>=0; k--)
{
if (k == _dir) continue;
index += (pos[k]) * localoffset;
localoffset *= size[k];
}
}
// add unit-cube-face-offsets
{
for (int k=0; k<_dir; k++)
index += sides[k] * fsize[k];
// add fsize if we are on the right face and there is a left-face-boundary on this processor
index += _face * (sides[_dir]>1) * fsize[_dir];
}
return index;
}
//! return unit outer normal, this should be dependent on local coordinates for higher order boundary
FieldVector<ctype, dimworld> outerNormal (const FieldVector<ctype, dim-1>& local) const
{
return _faceInfo[_count].normal;
}
//! return unit outer normal, this should be dependent on local coordinates for higher order boundary
FieldVector<ctype, dimworld> unitOuterNormal (const FieldVector<ctype, dim-1>& local) const
{
return _faceInfo[_count].normal;
}
//! return unit outer normal at center of intersection geometry
FieldVector<ctype, dimworld> centerUnitOuterNormal () const
{
return _faceInfo[_count].normal;
}
//! return unit outer normal, this should be dependent on
//! local coordinates for higher order boundary
//! the normal is scaled with the integration element of the intersection.
FieldVector<ctype, dimworld> integrationOuterNormal (const FieldVector<ctype, dim-1>& local) const
{
FieldVector<ctype, dimworld> n = _faceInfo[_count].normal;
n *= geometry().volume();
return n;
}
/*! intersection of codimension 1 of this neighbor with element where iteration started.
Here returned element is in LOCAL coordinates of the element where iteration started.
*/
LocalGeometry geometryInInside () const
{
return LocalGeometry( _faceInfo[_count].geom_inside );
}
/*! intersection of codimension 1 of this neighbor with element where iteration started.
Here returned element is in LOCAL coordinates of neighbor
*/
LocalGeometry geometryInOutside () const
{
return LocalGeometry( _faceInfo[_count].geom_outside );
}
/*! intersection of codimension 1 of this neighbor with element where iteration started.
*/
Geometry geometry () const
{
std::bitset<dim> shift;
shift.set();
shift[_dir] = false;
Dune::FieldVector<ctype,dimworld> ll, ur;
for (int i=0; i<dimworld; i++)
{
int coord = _inside.transformingsubiterator().coord(i);
if ((i == _dir) and (_face))
coord++;
ll[i] = _inside.transformingsubiterator().coordCont()->coordinate(i,coord);
if (i != _dir)
coord++;
ur[i] = _inside.transformingsubiterator().coordCont()->coordinate(i,coord);
// If on periodic overlap, transform coordinates by domain size
if (_inside.gridlevel()->mg->isPeriodic(i)) {
int coord = _inside.transformingsubiterator().coord(i);
if (coord < 0) {
auto size = _inside.gridlevel()->mg->domainSize()[i];
ll[i] += size;
ur[i] += size;
} else if (coord + 1 > _inside.gridlevel()->mg->levelSize(_inside.gridlevel()->level(),i)) {
auto size = _inside.gridlevel()->mg->domainSize()[i];
ll[i] -= size;
ur[i] -= size;
}
}
}
GeometryImpl _is_global(ll,ur,shift);
return Geometry( _is_global );
}
/** \brief obtain the type of reference element for this intersection */
GeometryType type () const
{
return GeometryType(GeometryType::cube, dim-1);
}
//! local index of codim 1 entity in self where intersection is contained in
int indexInInside () const
{
return _count;
}
//! local index of codim 1 entity in neighbor where intersection is contained in
int indexInOutside () const
{
// flip the last bit
return _count^1;
}
YaspIntersection()
: _count(~uint8_t(0)) // Use as marker for invalid intersection
, _dir(0)
, _face(0)
{}
//! make intersection iterator from entity, initialize to first neighbor
YaspIntersection (const YaspEntity<0,dim,GridImp>& myself, bool toend) :
_inside(myself.gridlevel(),
myself.transformingsubiterator()),
_outside(myself.gridlevel(),
myself.transformingsubiterator()),
// initialize to first neighbor
_count(0),
_dir(0),
_face(0)
{
if (toend)
{
// initialize end iterator
_count = 2*dim;
return;
}
_count = 0;
// move transforming iterator
_outside.transformingsubiterator().move(_dir,-1);
}
//! copy constructor -- use default
//! copy operator - use default
void assign (const YaspIntersection& it)
{
*this = it;
}
bool equals(const YaspIntersection& other) const
{
// compare counts first -- that's cheaper if the test fails
return _count == other._count && _inside.equals(other._inside);
}
private:
/* EntityPointers (get automatically updated) */
YaspEntity<0,GridImp::dimension,GridImp> _inside; //!< entitypointer to myself
YaspEntity<0,GridImp::dimension,GridImp> _outside; //!< outside entitypointer
/* current position */
uint8_t _count; //!< valid neighbor count in 0 .. 2*dim-1
uint8_t _dir; //!< count/2
uint8_t _face; //!< count%2
/* static data */
struct faceInfo
{
FieldVector<ctype, dimworld> normal;
LocalGeometryImpl geom_inside; //!< intersection in own local coordinates
LocalGeometryImpl geom_outside; //!< intersection in neighbors local coordinates
};
/* static face info */
static const array<faceInfo, 2*GridImp::dimension> _faceInfo;
static array<faceInfo, 2*dim> initFaceInfo()
{
array<faceInfo, 2*dim> I;
for (uint8_t i=0; i<dim; i++)
{
// compute normals
I[2*i].normal = 0.0;
I[2*i+1].normal = 0.0;
I[2*i].normal[i] = -1.0;
I[2*i+1].normal[i] = +1.0;
// determine the shift vector for these intersection
std::bitset<dim> s;
s.set();
s[i] = false;
// store intersection geometries
Dune::FieldVector<ctype, dim> ll(0.0);
Dune::FieldVector<ctype, dim> ur(1.0);
ur[i] = 0.0;
I[2*i].geom_inside = LocalGeometryImpl(ll,ur,s);
I[2*i+1].geom_outside = LocalGeometryImpl(ll,ur,s);
ll[i] = 1.0;
ur[i] = 1.0;
I[2*i].geom_outside = LocalGeometryImpl(ll,ur,s);
I[2*i+1].geom_inside = LocalGeometryImpl(ll,ur,s);
}
return I;
}
};
template<class GridImp>
const array<typename YaspIntersection<GridImp>::faceInfo, 2*GridImp::dimension>
YaspIntersection<GridImp>::_faceInfo =
YaspIntersection<GridImp>::initFaceInfo();
} // namespace Dune
#endif // DUNE_GRID_YASPGRIDINTERSECTION_HH
|