\n Classes
Model of the Intersection concept provided by GridGlue.
Describes the parallel communication interface class for Dune::GridGlue.
Implement iterators over GridGlue intersections.
Implement iterators over GridGlue intersections.
Model of the Intersection concept provided by GridGlue.
Definition gridglue.hh:37
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
Dune::FieldVector< ctype, dimworld > Coords
The type used for coordinate vectors.
Definition gridglue.hh:174
Intersection getIntersection(int i) const
Definition gridglue.hh:388
GridVertex< 1 > Grid1Vertex
The type of the Grid1 vertices.
Definition gridglue.hh:194
Dune::GridGlue::IntersectionIndexSet< P0, P1 > IndexSet
Type of remote intersection indexSet.
Definition gridglue.hh:206
gridgluevtkwriter.hh File Reference
\n \n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n
\n\n \n
\n
\n-
\n \n+
\n \n Model of the Intersection concept provided by GridGlue. \n+
Write all remote intersections to a vtk file for debugging. \n More...
\n-#include <algorithm>\n-
#include <optional>\n-
#include <tuple>\n-
#include <dune/common/deprecated.hh>\n-
#include <dune/common/version.hh>\n-
#include <dune/geometry/affinegeometry.hh>\n+
#include <fstream>\n+
#include <iomanip>\n+
#include <type_traits>\n+
#include <vector>\n+
#include <dune/common/classname.hh>\n+
#include <dune/geometry/type.hh>\n
#include <dune/geometry/referenceelements.hh>\n
#include <dune/grid-glue/gridglue.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::IntersectionData< P0, P1 > |
| storage class for Dune::GridGlue::Intersection related data More... | |
| struct | Dune::GridGlue::IntersectionTraits< P0, P1, inside, outside > |
| class | Dune::GridGlue::Intersection< P0, P1, I, O > |
| The intersection of two entities of the two patches of a GridGlue. More... | |
| class | Dune::GridGlue::GridGlueVtkWriter |
| Write remote intersections to a vtk file for debugging purposes. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n-Macros | |
| #define | ONLY_SIMPLEX_INTERSECTIONS |
Detailed Description
\n-Model of the Intersection concept provided by GridGlue.
\n-- Author
- Christian Engwer
Macro Definition Documentation
\n-\n-◆ ONLY_SIMPLEX_INTERSECTIONS
\n-\n-\n-
\n-\n- \n-
\n-
| #define ONLY_SIMPLEX_INTERSECTIONS | \n-
\n-\n-
\n-Write all remote intersections to a vtk file for debugging.
\n+\n Generated by
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,46 +1,33 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n-intersection.hh File Reference\n-Model of the Intersection concept provided by GridGlue. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n intersection.hh
gridgluevtkwriter.hh
\n Go to the documentation of this file.
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,752 +1,349 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersection.hh\n+gridgluevtkwriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-11#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n-12#define DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n-13\n-14#include \n-15#include \n-16#include \n-17\n-18#include \n-19#include \n-20#include \n-21#include \n-22#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+5/*\n+6 * Filename: GridGlueVtkWriter.hh\n+7 * Version: 1.0\n+8 * Created on: Mar 5, 2009\n+9 * Author: Gerrit Buse\n+10 * ---------------------------------\n+11 * Project: dune-grid-glue\n+12 * Description: Class thought to make graphical debugging of couplings\n+easier.\n+13 *\n+14 */\n+20#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n+21#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n+22\n 23\n-_\b2_\b4#define ONLY_SIMPLEX_INTERSECTIONS\n-25\n-26namespace _\bD_\bu_\bn_\be {\n-27 namespace GridGlue {\n+24#include \n+25#include \n+26#include \n+27#include \n 28\n-29 // forward declaration\n-30 template\n-31 class IntersectionIndexSet;\n+29#include \n+30#include \n+31#include \n 32\n-36 template\n-_\b3_\b7 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n-38 {\n-39 public:\n-_\b4_\b0 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n-41\n-_\b4_\b2 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be;\n-43\n-_\b4_\b5 static constexpr int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd;\n-46\n-47 private:\n-48 // intermediate quantities\n-49 template\n-50 static constexpr int dim() { return GridGlue::template GridView::\n-Grid::dimension - GridGlue::template GridPatch::codim; }\n-51\n-52 public:\n-_\b5_\b4 static constexpr int _\bm_\by_\bd_\bi_\bm = dim<0>() < dim<1>() ? dim<0>() : dim<1>();\n-55\n-56 template\n-_\b5_\b7 using _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = AffineGeometry<\n-58 typename GridGlue::template GridView::ctype, _\bm_\by_\bd_\bi_\bm, GridGlue::template\n-GridView::dimension>;\n+33#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+34\n+35namespace _\bD_\bu_\bn_\be {\n+36namespace GridGlue {\n+37\n+_\b4_\b0class _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br\n+41{\n+42\n+46 template \n+47 static void writeExtractedPart(const Glue& glue, const std::string&\n+filename)\n+48 {\n+49 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n+50\n+51 std::ofstream fgrid;\n+52\n+53 fgrid.open(filename.c_str());\n+54\n+55 using GridView = typename Glue::template GridView;\n+56 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br = typename Glue::template GridPatch;\n+57\n+58 typedef typename GridView::ctype ctype;\n 59\n-_\b6_\b0 using _\bG_\br_\bi_\bd_\b0_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridLocalGeometry<0>\n-instead\")]] = _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b0_\b>;\n-_\b6_\b1 using _\bG_\br_\bi_\bd_\b1_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridLocalGeometry<1>\n-instead\")]] = _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b1_\b>;\n+60 const int domdimw = GridView::dimensionworld;\n+61 const int patchDim = _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm - _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bd_\bi_\bm;\n 62\n-63 template\n-_\b6_\b4 using _\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by = AffineGeometry<\n-65 typename GridGlue::template GridView::ctype, _\bm_\by_\bd_\bi_\bm, GridGlue::template\n-GridView::dimensionworld>;\n-66\n-_\b6_\b7 using _\bG_\br_\bi_\bd_\b0_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridGeometry<0> instead\")]] =\n-_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b0_\b>;\n-_\b6_\b8 using _\bG_\br_\bi_\bd_\b1_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridGeometry<1> instead\")]] =\n-_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b1_\b>;\n+63 // coordinates have to be in R^3 in the VTK format\n+64 std::string coordinatePadding;\n+65 for (int i=domdimw; i<3; i++)\n+66 coordinatePadding += \" 0\";\n+67\n+68 fgrid << \"# vtk DataFile Version 2.0\\nFilename: \" << filename << \"\\nASCII\"\n+<< std::endl;\n 69\n-70 template\n-_\b7_\b1 using _\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be = typename GridGlue::template GridView::IndexSet::\n-IndexType;\n-72\n-_\b7_\b3 using _\bG_\br_\bi_\bd_\b0_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be [[deprecated(\"please use GridIndexType<0> instead\")]] =\n-_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\b<_\b0_\b>;\n-_\b7_\b4 using _\bG_\br_\bi_\bd_\b1_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be [[deprecated(\"please use GridIndexType<1> instead\")]] =\n-_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\b<_\b1_\b>;\n-75\n-77 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned int mergeindex, unsigned int\n-offset, bool grid0local, bool grid1local);\n-78\n-_\b8_\b0 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba() = default;\n-81\n-82 /* Accessor Functions */\n-83\n-84 template\n-_\b8_\b5 const _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bs_\bi_\bd_\be_\b>& _\bl_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by(unsigned int parentId = 0)\n-const\n-86 { return *std::get(sideData_).gridlocalgeom[parentId]; }\n-87\n-88 template\n-_\b8_\b9 const _\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bs_\bi_\bd_\be_\b>& _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n-90 { return *std::get(sideData_).gridgeom; }\n-91\n-92 template\n-_\b9_\b3 bool _\bl_\bo_\bc_\ba_\bl() const\n-94 { return std::get(sideData_).gridlocal; }\n-95\n-96 template\n-_\b9_\b7 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bi_\bn_\bd_\be_\bx(unsigned int parentId = 0) const\n-98 { return std::get(sideData_).gridindices[parentId]; }\n+70 // WRITE POINTS\n+71 // ----------------\n+72 std::vector coords;\n+73 glue.template patch()._\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(coords);\n+74\n+75 fgrid << ((patchDim==3) ? \"DATASET UNSTRUCTURED_GRID\" : \"DATASET POLYDATA\")\n+<< std::endl;\n+76 fgrid << \"POINTS \" << coords.size() << \" \" << Dune::className() <<\n+std::endl;\n+77\n+78 for (size_t i=0; i faces;\n+87 std::vector geometryTypes;\n+88 glue.template patch().getFaces(faces);\n+89 glue.template patch().getGeometryTypes(geometryTypes);\n+90\n+91 unsigned int faceCornerCount = 0;\n+92 for (size_t i=0; i\n-_\b1_\b0_\b1 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bp_\ba_\br_\be_\bn_\bt_\bs() const\n-102 { return std::get(sideData_).gridindices.size(); }\n-103\n-104 private:\n-105 template\n-106 void initializeGeometry(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned mergeindex);\n+100 fgrid << faces[i].size();\n+101\n+102 // vtk expects the vertices to by cyclically ordered\n+103 // therefore unfortunately we have to deal with several element types on a\n+case-by-case basis\n+104 if (geometryTypes[i].isSimplex()) {\n+105 for (int j=0; j\n-116 struct SideData {\n-118 bool gridlocal = false;\n+108 } else if (geometryTypes[i].isQuadrilateral()) {\n+109 fgrid << \" \" << faces[i][0] << \" \" << faces[i][1]\n+110 << \" \" << faces[i][3] << \" \" << faces[i][2];\n+111\n+112 } else if (geometryTypes[i].isPyramid()) {\n+113 fgrid << \" \" << faces[i][0] << \" \" << faces[i][1]\n+114 << \" \" << faces[i][3] << \" \" << faces[i][2] << \" \" << faces[i][4];\n+115\n+116 } else if (geometryTypes[i].isPrism()) {\n+117 fgrid << \" \" << faces[i][0] << \" \" << faces[i][2] << \" \" << faces[i][1]\n+118 << \" \" << faces[i][3] << \" \" << faces[i][5] << \" \" << faces[i][4];\n 119\n-121 std::vector< GridIndexType > gridindices;\n-122\n-124 std::vector< std::optional< GridLocalGeometry > > gridlocalgeom;\n+120 } else if (geometryTypes[i].isHexahedron()) {\n+121 fgrid << \" \" << faces[i][0] << \" \" << faces[i][1]\n+122 << \" \" << faces[i][3] << \" \" << faces[i][2]\n+123 << \" \" << faces[i][4] << \" \" << faces[i][5]\n+124 << \" \" << faces[i][7] << \" \" << faces[i][6];\n 125\n-133 std::optional< GridGeometry > gridgeom;\n-134 };\n-135\n-136 std::tuple< SideData<0>, SideData<1> > sideData_;\n-137 };\n-138\n-139 template\n-140 template\n-141 void IntersectionData::initializeGeometry(const GridGlue& glue,\n-unsigned mergeindex)\n-142 {\n-143 auto& data = std::get(sideData_);\n-144\n-145 const unsigned n_parents = glue.merger_->template parents\n-(mergeindex);\n-146\n-147 // init containers\n-148 data.gridindices.resize(n_parents);\n-149 data.gridlocalgeom.resize(n_parents);\n-150\n-151 // default values\n-152 data.gridindices[0] = 0;\n+126 } else {\n+127 DUNE_THROW(Dune::NotImplemented, \"Geometry type \" << geometryTypes[i] << \"\n+not supported yet\");\n+128 }\n+129\n+130 fgrid << std::endl;\n+131 }\n+132\n+133 fgrid << std::endl;\n+134\n+135 // 3d VTK files need an extra section specifying the CELL_TYPES aka\n+GeometryTypes\n+136 if (patchDim==3) {\n+137\n+138 fgrid << \"CELL_TYPES \" << geometryTypes.size() << std::endl;\n+139\n+140 for (size_t i=0; i::\n-template Codim<0>::Geometry::mydimension;\n-161\n-162 // coordinates within the subentity that contains the remote intersection\n-163 std::array() >, nSimplexCorners>\n-corners_subEntity_local;\n+154 }\n+155\n+156#if 0\n+157 // WRITE CELL DATA\n+158 // ---------------\n+159 ctype accum = 0.0, delta = 1.0 / (ctype) (gridSubEntityData.size()-1);\n+160\n+161 fgrid << \"CELL_DATA \" << gridSubEntityData.size() << std::endl;\n+162 fgrid << \"SCALARS property_coding \" << Dune::className() << \" 1\" <<\n+std::endl;\n+163 fgrid << \"LOOKUP_TABLE default\" << std::endl;\n 164\n-165 for (unsigned int par = 0; par < n_parents; ++par) {\n-166 for (int i = 0; i < nSimplexCorners; ++i)\n-167 corners_subEntity_local[i] = glue.merger_->template parentLocal\n-(mergeindex, i, par);\n-168\n-169 // Coordinates of the remote intersection corners wrt the element\n-coordinate system\n-170 std::array, nSimplexCorners>\n-corners_element_local;\n-171\n-172 if (data.gridlocal) {\n-173 data.gridindices[par] = glue.merger_->template parent\n-(mergeindex,par);\n-174\n-175 typename GridGlue::template GridPatch::LocalGeometry\n-176 gridLocalGeometry = glue.template patch().geometryLocal\n-(data.gridindices[par]);\n-177 for (std::size_t i=0; i::Geometry\n-196 gridWorldGeometry = glue.template patch().geometry(data.gridindices\n-[par]);\n-197\n-198 // world coordinates of the remote intersection corners\n-199 std::array::\n-dimensionworld>, nSimplexCorners> corners_global;\n-200\n-201 for (std::size_t i=0; i\n-_\b2_\b1_\b3 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned\n-int mergeindex, unsigned int offset,\n-214 bool grid0local, bool grid1local)\n-215 : index_(mergeindex+offset)\n-216 {\n-217 // if an invalid index is given do not proceed!\n-218 // (happens when the parent GridGlue initializes the \"end\"-Intersection)\n-219 assert (0 <= mergeindex || mergeindex < glue.index__sz);\n-220\n-221 std::get<0>(sideData_).gridlocal = grid0local;\n-222 std::get<1>(sideData_).gridlocal = grid1local;\n-223\n-224 initializeGeometry<0>(glue, mergeindex);\n-225 initializeGeometry<1>(glue, mergeindex);\n-226 }\n+165 for (typename GridSubEntityData::const_iterator sEIt =\n+gridSubEntityData.begin();\n+166 sEIt != gridSubEntityData.end();\n+167 ++sEIt, accum += delta)\n+168 {\n+169 // \"encode\" the parent with one color...\n+170 fgrid << accum << std::endl;\n+171 }\n+172#endif\n+173 fgrid.close();\n+174 }\n+175\n+176\n+180 template \n+181 static void writeIntersections(const Glue& glue, const std::string&\n+filename)\n+182 {\n+183 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n+184\n+185 std::ofstream fmerged;\n+186\n+187 fmerged.open(filename.c_str());\n+188\n+189 using GridView = typename Glue::template GridView;\n+190 typedef typename GridView::ctype ctype;\n+191\n+192 const int domdimw = GridView::dimensionworld;\n+193 const int intersectionDim = Glue::Intersection::mydim;\n+194\n+195 // coordinates have to be in R^3 in the VTK format\n+196 std::string coordinatePadding;\n+197 for (int i=domdimw; i<3; i++)\n+198 coordinatePadding += \" 0\";\n+199\n+200 int overlaps = glue.size();\n+201\n+202 // WRITE POINTS\n+203 // ----------------\n+204 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br = typename Glue::template GridPatch<0>;\n+205 std::vector coords;\n+206 glue.template patch()._\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(coords);\n+207\n+208 // the merged grid (i.e. the set of remote intersections\n+209 fmerged << \"# vtk DataFile Version 2.0\\nFilename: \" << filename <<\n+\"\\nASCII\" << std::endl;\n+210 fmerged << ((intersectionDim==3) ? \"DATASET UNSTRUCTURED_GRID\" : \"DATASET\n+POLYDATA\") << std::endl;\n+211 fmerged << \"POINTS \" << overlaps*(intersectionDim+1) << \" \" << Dune::\n+className() << std::endl;\n+212\n+213 for (const auto& intersection : _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(glue, _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bs_\bi_\bd_\be_\b _\b=_\b=_\b _\b1_\b>{}))\n+214 {\n+215 const auto& geometry = intersection.geometry();\n+216 for (int i = 0; i < geometry.corners(); ++i)\n+217 fmerged << geometry.corner(i) << coordinatePadding << std::endl;\n+218 }\n+219\n+220 // WRITE POLYGONS\n+221 // ----------------\n+222\n+223 std::vector faces;\n+224 std::vector geometryTypes;\n+225 glue.template patch().getFaces(faces);\n+226 glue.template patch().getGeometryTypes(geometryTypes);\n 227\n-232 template\n-_\b2_\b3_\b3 struct _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs\n-234 {\n-_\b2_\b3_\b5 using _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be = _\b:_\b:_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>;\n-_\b2_\b3_\b6 using _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba = _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>;\n-237\n-_\b2_\b3_\b8 using _\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw = typename GridGlue::template GridView;\n-_\b2_\b3_\b9 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw = typename GridGlue::template GridView;\n-240\n-_\b2_\b4_\b1 using _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n-GridLocalGeometry;\n-_\b2_\b4_\b2 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n-GridLocalGeometry;\n-243\n-_\b2_\b4_\b4 using _\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template GridGeometry;\n-_\b2_\b4_\b5 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n-GridGeometry;\n-246\n-_\b2_\b4_\b7 static constexpr auto _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm;\n-_\b2_\b4_\b8 static constexpr auto _\bm_\by_\bd_\bi_\bm = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bm_\by_\bd_\bi_\bm;\n-_\b2_\b4_\b9 static constexpr int _\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = inside;\n-_\b2_\b5_\b0 static constexpr int _\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = outside;\n-251\n-_\b2_\b5_\b2 using _\bc_\bt_\by_\bp_\be = typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\bt_\by_\bp_\be;\n-_\b2_\b5_\b3 using _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = Dune::FieldVector;\n-_\b2_\b5_\b4 using _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = Dune::FieldVector;\n-255 };\n-256\n-259 template\n-_\b2_\b6_\b0 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-261 {\n-262\n-263 public:\n-264\n-_\b2_\b6_\b5 typedef _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bI_\b,_\bO_\b> _\bT_\br_\ba_\bi_\bt_\bs;\n-266\n-_\b2_\b6_\b7 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n-_\b2_\b6_\b8 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba;\n-269\n-270\n-_\b2_\b7_\b1 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw _\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw;\n-_\b2_\b7_\b2 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+228 unsigned int faceCornerCount = 0;\n+229 for (size_t i=0; i() << \" 1\"\n+<< std::endl;\n+260 fmerged << \"LOOKUP_TABLE default\" << std::endl;\n+261\n+262 for (typename GridSubEntityData::const_iterator sEIt =\n+gridSubEntityData.begin();\n+263 sEIt != gridSubEntityData.end();\n+264 ++sEIt, accum += delta)\n+265 {\n+266 // ...and mark all of its merged grid parts with the same color\n+267 for (int j = 0; j < sEIt->first.second; ++j)\n+268 fmerged << accum << std::endl;\n+269 }\n+270#endif\n+271 fmerged.close();\n+272 }\n 273\n-_\b2_\b7_\b4 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw;\n-_\b2_\b7_\b5 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-_\b2_\b7_\b6 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-277\n-_\b2_\b7_\b8 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-_\b2_\b7_\b9 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be _\bc_\bt_\by_\bp_\be;\n-280\n-_\b2_\b8_\b1 typedef typename InsideGridView::Traits::template Codim<0>::Entity\n-_\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by;\n-_\b2_\b8_\b2 typedef typename OutsideGridView::Traits::template Codim<0>::Entity\n-_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by;\n-283\n-_\b2_\b8_\b4 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-_\b2_\b8_\b5 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-286\n-_\b2_\b8_\b8 static constexpr auto _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm;\n+274public:\n+275 template\n+_\b2_\b7_\b6 static void _\bw_\br_\bi_\bt_\be(const Glue& glue, const std::string& filenameTrunk)\n+277 {\n+278\n+279 // Write extracted grid and remote intersection on the grid0-side\n+280 writeExtractedPart(glue,\n+281 filenameTrunk + \"-grid0.vtk\");\n+282\n+283 writeIntersections(glue,\n+284 filenameTrunk + \"-intersections-grid0.vtk\");\n+285\n+286 // Write extracted grid and remote intersection on the grid1-side\n+287 writeExtractedPart(glue,\n+288 filenameTrunk + \"-grid1.vtk\");\n 289\n-_\b2_\b9_\b1 static constexpr auto _\bm_\by_\bd_\bi_\bm = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bm_\by_\bd_\bi_\bm;\n+290 writeIntersections(glue,\n+291 filenameTrunk + \"-intersections-grid1.vtk\");\n 292\n-_\b2_\b9_\b4 static constexpr int _\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh;\n-295\n-_\b2_\b9_\b7 static constexpr int _\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh;\n-298\n-299 // typedef unsigned int IndexType;\n-300\n-301 private:\n-305 static constexpr int codimensionWorld = _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm - _\bm_\by_\bd_\bi_\bm;\n-306\n-307 public:\n-308 /* C O N S T R U C T O R S */\n-309\n-_\b3_\b1_\b1 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue, const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba* i) :\n-312 glue_(glue), i_(i) {}\n-313\n-314 /* F U N C T I O N A L I T Y */\n-315\n-318 _\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n-_\b3_\b1_\b9 _\bi_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n-320 {\n-321 assert(_\bs_\be_\bl_\bf());\n-322 return glue_->template patch().element(i_->template index(parentId));\n-323 }\n-324\n-327 _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n-_\b3_\b2_\b8 _\bo_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n-329 {\n-330 assert(_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br());\n-331 return glue_->template patch().element(i_->template index(parentId));\n-332 }\n-333\n-_\b3_\b3_\b5 bool _\bc_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg() const\n-336 {\n-337 throw Dune::NotImplemented();\n-338 }\n-339\n-_\b3_\b4_\b2 const _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0)\n-const\n-343 {\n-344 return i_->template localGeometry(parentId);\n-345 }\n-346\n-_\b3_\b4_\b9 const _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0)\n-const\n-350 {\n-351 return i_->template localGeometry(parentId);\n-352 }\n-353\n-_\b3_\b6_\b0 const _\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n-361 {\n-362 return i_->template geometry();\n-363 }\n-364\n-_\b3_\b7_\b1 const _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bO_\bu_\bt_\bs_\bi_\bd_\be() const // DUNE_DEPRECATED\n-372 {\n-373 return i_->template geometry();\n-374 }\n-375\n-_\b3_\b7_\b7 Dune::GeometryType _\bt_\by_\bp_\be() const\n-378 {\n-379 #ifdef ONLY_SIMPLEX_INTERSECTIONS\n-380 # if DUNE_VERSION_NEWER(DUNE_GEOMETRY, 2, 6)\n-381 return Dune::GeometryTypes::simplex(_\bm_\by_\bd_\bi_\bm);\n-382 # else\n-383 static const Dune::GeometryType _\bt_\by_\bp_\be(Dune::GeometryType::simplex, _\bm_\by_\bd_\bi_\bm);\n-384 return _\bt_\by_\bp_\be;\n-385 # endif\n-386 #else\n-387 #error Not Implemented\n-388 #endif\n-389 }\n-390\n-391\n-_\b3_\b9_\b3 bool _\bs_\be_\bl_\bf() const\n-394 {\n-395 return i_->template local();\n-396 }\n-397\n-_\b3_\b9_\b9 size_t _\bn_\be_\bi_\bg_\bh_\bb_\bo_\br(unsigned int g = 0) const\n-400 {\n-401 if (g == 0 && i_->template local()) {\n-402 return i_->template parents();\n-403 } else if (g == 1 && i_->template local()) {\n-404 return i_->template parents();\n-405 }\n-406 return 0;\n-407 }\n-408\n-_\b4_\b1_\b0 int _\bi_\bn_\bd_\be_\bx_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n-411 {\n-412 assert(_\bs_\be_\bl_\bf());\n-413 return glue_->template patch().indexInInside(i_->template index\n-(parentId));\n-414 }\n-415\n-_\b4_\b1_\b7 int _\bi_\bn_\bd_\be_\bx_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n-418 {\n-419 assert(_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br());\n-420 return glue_->template patch().indexInInside(i_->template index\n-(parentId));\n-421 }\n-422\n-_\b4_\b2_\b7 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n-428 {\n-429 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be normal;\n-430\n-431 if (codimensionWorld == 0)\n-432 DUNE_THROW(Dune::Exception, \"There is no normal vector to a full-\n-dimensional intersection\");\n-433 else if (codimensionWorld == 1) {\n-434 /* TODO: Implement the general n-ary cross product here */\n-435 const auto jacobianTransposed = _\bg_\be_\bo_\bm_\be_\bt_\br_\by().jacobianTransposed(local);\n-436 if (_\bm_\by_\bd_\bi_\bm==1) {\n-437 normal[0] = - jacobianTransposed[0][1];\n-438 normal[1] = jacobianTransposed[0][0];\n-439 } else if (_\bm_\by_\bd_\bi_\bm==2) {\n-440 normal[0] = (jacobianTransposed[0][1] * jacobianTransposed[1][2] -\n-jacobianTransposed[0][2] * jacobianTransposed[1][1]);\n-441 normal[1] = - (jacobianTransposed[0][0] * jacobianTransposed[1][2] -\n-jacobianTransposed[0][2] * jacobianTransposed[1][0]);\n-442 normal[2] = (jacobianTransposed[0][0] * jacobianTransposed[1][1] -\n-jacobianTransposed[0][1] * jacobianTransposed[1][0]);\n-443 } else\n-444 DUNE_THROW(Dune::NotImplemented, \"Remote intersections don't implement the\n-'outerNormal' method for \" << _\bm_\by_\bd_\bi_\bm << \"-dimensional intersections yet\");\n-445 } else\n-446 DUNE_THROW(Dune::NotImplemented, \"Remote intersections don't implement the\n-'outerNormal' method for intersections with codim >= 2 yet\");\n-447\n-448 return normal;\n-449 }\n-450\n-_\b4_\b5_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n-456 {\n-457 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be normal = _\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(local);\n-458 normal /= normal.two_norm();\n-459 return normal;\n-460 }\n-461\n-_\b4_\b6_\b6 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n-467 {\n-468 return (_\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(local) *= _\bg_\be_\bo_\bm_\be_\bt_\br_\by().integrationElement(local));\n-469 }\n-470\n-_\b4_\b7_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br_\bU_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl () const\n-476 {\n-477 return _\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(ReferenceElements::general(_\bt_\by_\bp_\be\n-()).position(0,0));\n-478 }\n-479\n-_\b4_\b8_\b3 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bO_\b,_\bI_\b> _\bf_\bl_\bi_\bp() const\n-484 {\n-485 return _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bO_\b,_\bI_\b>(glue_,i_);\n-486 }\n-487\n-488#ifdef QUICKHACK_INDEX\n-489 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be IndexType;\n-490\n-491 IndexType index() const\n-492 {\n-493 return i_->_\bi_\bn_\bd_\be_\bx_\b_;\n-494 }\n-495\n-496#endif\n-497\n-498 private:\n-499\n-500 friend class IntersectionIndexSet;\n-501\n-502 /* M E M B E R V A R I A B L E S */\n-503\n-505 const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue_;\n-506\n-508 const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba* i_;\n-509 };\n-510\n-511\n-512 } // end namespace GridGlue\n-513} // end namespace Dune\n-514\n-515#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n+293 }\n+294\n+295};\n+296\n+297} /* namespace GridGlue */\n+298} /* namespace Dune */\n+299\n+300#endif // DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n _\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n Central component of the module implementing the coupling of two grids.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n-sequential adapter to couple two grids at specified close together boundaries\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-unsigned int IndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:147\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\bt_\by_\bp_\be\n-PromotionTraits< typenameGridView< 0 >::ctype, typenameGridView< 1 >::ctype >::\n-PromotedType ctype\n-The type used for coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:171\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd\n-static constexpr int dimworld\n-export the world dimension This is the maximum of the extractors' world\n-dimensions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:166\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n-storage class for Dune::GridGlue::Intersection related data\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:38\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-GridGlue::IndexType IndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:42\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim,\n-GridGlue::template GridView< side >::dimensionworld > GridGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bl_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-const GridLocalGeometry< side > & localGeometry(unsigned int parentId=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n-static constexpr int coorddim\n-Dimension of the world space of the intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:45\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-GridGeometry< 0 > Grid0Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-typename GridGlue::template GridView< side >::IndexSet::IndexType GridIndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-IndexType index(unsigned int parentId=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:97\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bp_\ba_\br_\be_\bn_\bt_\bs\n-IndexType parents() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:101\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-GridLocalGeometry< 1 > Grid1LocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:61\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-const GridGeometry< side > & geometry() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:89\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-bool local() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:93\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n-::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:40\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bm_\by_\bd_\bi_\bm\n-static constexpr int mydim\n-Dimension of the intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim,\n-GridGlue::template GridView< side >::dimension > GridLocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:58\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-GridLocalGeometry< 0 > Grid0LocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:60\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n-IndexType index_\n-index of this intersection after GridGlue interface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:112\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-GridIndexType< 1 > Grid1IndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:74\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-GridGeometry< 1 > Grid1Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-GridIndexType< 0 > Grid0IndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:73\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n-IntersectionData()=default\n-Default Constructor.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-The intersection of two entities of the two patches of a GridGlue.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:261\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Traits::OutsideLocalGeometry OutsideLocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bf_\bl_\bi_\bp\n-Intersection< P0, P1, O, I > flip() const\n-Return a copy of the intersection with inside and outside switched.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:483\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg\n-bool conforming() const\n-Return true if intersection is conforming.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:335\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n-InsideGridView::Traits::template Codim< 0 >::Entity InsideEntity\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n-Traits::GridGlue GridGlue\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:267\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bd_\be_\bx_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be\n-int indexInOutside(unsigned int parentId=0) const\n-Local number of codim 1 entity in outside() Entity where intersection is\n-contained in.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:417\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bd_\be_\bx_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be\n-int indexInInside(unsigned int parentId=0) const\n-Local number of codim 1 entity in the inside() Entity where intersection is\n-contained in.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:410\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\be_\bl_\bf\n-bool self() const\n-For parallel computations: Return true if inside() entity exists locally.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:393\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bm_\by_\bd_\bi_\bm\n-static constexpr auto mydim\n-dimension of the intersection\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:291\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n-static constexpr int outsidePatch\n-outside patch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:297\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\by_\bp_\be\n-Dune::GeometryType type() const\n-Type of reference element for this intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:377\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be\n-InsideEntity inside(unsigned int parentId=0) const\n-Return element on the inside of this intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:319\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Traits::LocalCoordinate LocalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:284\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be\n-const OutsideLocalGeometry & geometryInOutside(unsigned int parentId=0) const\n-Geometric information about this intersection in local coordinates of the\n-outside() element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:349\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n-GlobalCoordinate unitOuterNormal(const LocalCoordinate &local) const\n-Return a unit outer normal.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:455\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bt_\by_\bp_\be\n-Traits::ctype ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:279\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs\n-IntersectionTraits< P0, P1, I, O > Traits\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:265\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n-Traits::IntersectionData IntersectionData\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:268\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Traits::GlobalCoordinate GlobalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:285\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Traits::OutsideGeometry OutsideGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:276\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br\n-size_t neighbor(unsigned int g=0) const\n-Return number of embeddings into local grid0 (grid1) entities.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:399\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-Intersection(const GridGlue *glue, const IntersectionData *i)\n-Constructor for a given Dataset.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:311\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n-static constexpr int insidePatch\n-inside patch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:294\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Traits::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:278\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n-OutsideGridView::Traits::template Codim< 0 >::Entity OutsideEntity\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:282\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be\n-OutsideEntity outside(unsigned int parentId=0) const\n-Return element on the outside of this intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:328\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-const Geometry & geometry() const\n-Geometric information about this intersection as part of the inside grid.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:360\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Traits::InsideLocalGeometry InsideLocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:272\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n-GlobalCoordinate outerNormal(const LocalCoordinate &local) const\n-Return an outer normal (length not necessarily 1)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:427\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bO_\bu_\bt_\bs_\bi_\bd_\be\n-const OutsideGeometry & geometryOutside() const\n-Geometric information about this intersection as part of the outside grid.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:371\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n-Traits::OutsideGridView OutsideGridView\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:274\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n-GlobalCoordinate integrationOuterNormal(const LocalCoordinate &local) const\n-Return an outer normal with the length of the integration element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:466\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n-Traits::InsideGridView InsideGridView\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:271\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be\n-const InsideLocalGeometry & geometryInInside(unsigned int parentId=0) const\n-Geometric information about this intersection in local coordinates of the\n-inside() element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:342\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\be_\bn_\bt_\be_\br_\bU_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n-GlobalCoordinate centerUnitOuterNormal() const\n-Unit outer normal at the center of the intersection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:475\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n-static constexpr auto coorddim\n-dimension of the world space of the intersection\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:288\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:234\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n-static constexpr int insidePatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:249\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Dune::FieldVector< ctype, mydim > LocalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:253\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n-static constexpr auto coorddim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:247\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-typename IntersectionData::template GridGeometry< outside > OutsideGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:245\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be\n-typename GridGlue::ctype ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:252\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n-typename GridGlue::template GridView< outside > OutsideGridView\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:239\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Dune::FieldVector< ctype, coorddim > GlobalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:254\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-typename IntersectionData::template GridLocalGeometry< outside >\n-OutsideLocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:242\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n-typename GridGlue::template GridView< inside > InsideGridView\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:238\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-typename IntersectionData::template GridGeometry< inside > Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:244\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-typename IntersectionData::template GridLocalGeometry< inside >\n-InsideLocalGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:241\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n-static constexpr int outsidePatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:250\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bm_\by_\bd_\bi_\bm\n-static constexpr auto mydim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:248\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n+> &reverse=!reversed)\n+Iterate over all intersections of a GridGlue.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br\n+Write remote intersections to a vtk file for debugging purposes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridgluevtkwriter.hh:41\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be\n+static void write(const Glue &glue, const std::string &filenameTrunk)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridgluevtkwriter.hh:276\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:17\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br\n+Provides codimension-independent methods for grid extraction.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:46\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bd_\bi_\bm\n+static constexpr auto codim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:52\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs\n+void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords)\n+const\n+getter for the coordinates array\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm\n+static constexpr auto dim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:51\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00008.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00008.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridgluevtkwriter.hh File Reference \n+dune-grid-glue: intersectionindexset.hh File Reference \n \n \n \n \n \n \n \n@@ -72,46 +72,34 @@\n dune grid-glue adapter \n
\n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n+\n+\n+\n+\n \n-\n-\n-\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n \n 50 static constexpr int dim() { return GridGlue::template GridView<side>::Grid::dimension - GridGlue::template GridPatch<side>::codim; }
\n-\n-\n-\n-\n-\n-\n- 58 typename GridGlue::template GridView<side>::ctype, mydim, GridGlue::template GridView<side>::dimension>;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n- 60 using Grid0LocalGeometry [[deprecated("please use GridLocalGeometry<0> instead")]] = GridLocalGeometry<0>;
\n- 61 using Grid1LocalGeometry [[deprecated("please use GridLocalGeometry<1> instead")]] = GridLocalGeometry<1>;
\n+\n+\n \n-\n-\n- 65 typename GridGlue::template GridView<side>::ctype, mydim, GridGlue::template GridView<side>::dimensionworld>;
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n- 77 IntersectionData(const GridGlue& glue, unsigned int mergeindex, unsigned int offset, bool grid0local, bool grid1local);
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-
\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n- 160 static constexpr int elementdim = GridGlue::template GridView<side>::template Codim<0>::Geometry::mydimension;
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 199 std::array<Dune::FieldVector<ctype, GridGlue::template GridView<side>::dimensionworld>, nSimplexCorners> corners_global;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 213 IntersectionData<P0, P1>::IntersectionData(const GridGlue& glue, unsigned int mergeindex, unsigned int offset,
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 210 fmerged << ((intersectionDim==3) ? "DATASET UNSTRUCTURED_GRID" : "DATASET POLYDATA") << std::endl;
\n+ 211 fmerged << "POINTS " << overlaps*(intersectionDim+1) << " " << Dune::className<ctype>() << std::endl;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n \n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n- 440 normal[0] = (jacobianTransposed[0][1] * jacobianTransposed[1][2] - jacobianTransposed[0][2] * jacobianTransposed[1][1]);
\n- 441 normal[1] = - (jacobianTransposed[0][0] * jacobianTransposed[1][2] - jacobianTransposed[0][2] * jacobianTransposed[1][0]);
\n- 442 normal[2] = (jacobianTransposed[0][0] * jacobianTransposed[1][1] - jacobianTransposed[0][1] * jacobianTransposed[1][0]);
\n-\n- 444 DUNE_THROW(Dune::NotImplemented, "Remote intersections don't implement the 'outerNormal' method for " << mydim << "-dimensional intersections yet");
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n+\n
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n Central component of the module implementing the coupling of two grids.
Definition gridglue.hh:37
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
PromotionTraits< typenameGridView< 0 >::ctype, typenameGridView< 1 >::ctype >::PromotedType ctype
The type used for coordinates.
Definition gridglue.hh:171
static constexpr int dimworld
export the world dimension This is the maximum of the extractors' world dimensions.
Definition gridglue.hh:166
storage class for Dune::GridGlue::Intersection related data
Definition intersection.hh:38
GridGlue::IndexType IndexType
Definition intersection.hh:42
AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim, GridGlue::template GridView< side >::dimensionworld > GridGeometry
Definition intersection.hh:65
const GridLocalGeometry< side > & localGeometry(unsigned int parentId=0) const
Definition intersection.hh:85
static constexpr int coorddim
Dimension of the world space of the intersection.
Definition intersection.hh:45
GridGeometry< 0 > Grid0Geometry
Definition intersection.hh:67
typename GridGlue::template GridView< side >::IndexSet::IndexType GridIndexType
Definition intersection.hh:71
IndexType index(unsigned int parentId=0) const
Definition intersection.hh:97
GridLocalGeometry< 1 > Grid1LocalGeometry
Definition intersection.hh:61
const GridGeometry< side > & geometry() const
Definition intersection.hh:89
::Dune::GridGlue::GridGlue< P0, P1 > GridGlue
Definition intersection.hh:40
static constexpr int mydim
Dimension of the intersection.
Definition intersection.hh:54
AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim, GridGlue::template GridView< side >::dimension > GridLocalGeometry
Definition intersection.hh:58
GridLocalGeometry< 0 > Grid0LocalGeometry
Definition intersection.hh:60
IndexType index_
index of this intersection after GridGlue interface
Definition intersection.hh:112
GridIndexType< 1 > Grid1IndexType
Definition intersection.hh:74
GridGeometry< 1 > Grid1Geometry
Definition intersection.hh:68
GridIndexType< 0 > Grid0IndexType
Definition intersection.hh:73
The intersection of two entities of the two patches of a GridGlue.
Definition intersection.hh:261
Traits::OutsideLocalGeometry OutsideLocalGeometry
Definition intersection.hh:275
Intersection< P0, P1, O, I > flip() const
Return a copy of the intersection with inside and outside switched.
Definition intersection.hh:483
bool conforming() const
Return true if intersection is conforming.
Definition intersection.hh:335
InsideGridView::Traits::template Codim< 0 >::Entity InsideEntity
Definition intersection.hh:281
int indexInOutside(unsigned int parentId=0) const
Local number of codim 1 entity in outside() Entity where intersection is contained in.
Definition intersection.hh:417
int indexInInside(unsigned int parentId=0) const
Local number of codim 1 entity in the inside() Entity where intersection is contained in.
Definition intersection.hh:410
bool self() const
For parallel computations: Return true if inside() entity exists locally.
Definition intersection.hh:393
static constexpr auto mydim
dimension of the intersection
Definition intersection.hh:291
static constexpr int outsidePatch
outside patch
Definition intersection.hh:297
Dune::GeometryType type() const
Type of reference element for this intersection.
Definition intersection.hh:377
InsideEntity inside(unsigned int parentId=0) const
Return element on the inside of this intersection.
Definition intersection.hh:319
Traits::LocalCoordinate LocalCoordinate
Definition intersection.hh:284
const OutsideLocalGeometry & geometryInOutside(unsigned int parentId=0) const
Geometric information about this intersection in local coordinates of the outside() element.
Definition intersection.hh:349
GlobalCoordinate unitOuterNormal(const LocalCoordinate &local) const
Return a unit outer normal.
Definition intersection.hh:455
IntersectionTraits< P0, P1, I, O > Traits
Definition intersection.hh:265
Traits::IntersectionData IntersectionData
Definition intersection.hh:268
Traits::GlobalCoordinate GlobalCoordinate
Definition intersection.hh:285
Traits::OutsideGeometry OutsideGeometry
Definition intersection.hh:276
size_t neighbor(unsigned int g=0) const
Return number of embeddings into local grid0 (grid1) entities.
Definition intersection.hh:399
Intersection(const GridGlue *glue, const IntersectionData *i)
Constructor for a given Dataset.
Definition intersection.hh:311
static constexpr int insidePatch
inside patch
Definition intersection.hh:294
OutsideGridView::Traits::template Codim< 0 >::Entity OutsideEntity
Definition intersection.hh:282
OutsideEntity outside(unsigned int parentId=0) const
Return element on the outside of this intersection.
Definition intersection.hh:328
const Geometry & geometry() const
Geometric information about this intersection as part of the inside grid.
Definition intersection.hh:360
Traits::InsideLocalGeometry InsideLocalGeometry
Definition intersection.hh:272
GlobalCoordinate outerNormal(const LocalCoordinate &local) const
Return an outer normal (length not necessarily 1)
Definition intersection.hh:427
const OutsideGeometry & geometryOutside() const
Geometric information about this intersection as part of the outside grid.
Definition intersection.hh:371
Traits::OutsideGridView OutsideGridView
Definition intersection.hh:274
GlobalCoordinate integrationOuterNormal(const LocalCoordinate &local) const
Return an outer normal with the length of the integration element.
Definition intersection.hh:466
Traits::InsideGridView InsideGridView
Definition intersection.hh:271
const InsideLocalGeometry & geometryInInside(unsigned int parentId=0) const
Geometric information about this intersection in local coordinates of the inside() element.
Definition intersection.hh:342
GlobalCoordinate centerUnitOuterNormal() const
Unit outer normal at the center of the intersection.
Definition intersection.hh:475
static constexpr auto coorddim
dimension of the world space of the intersection
Definition intersection.hh:288
Definition intersection.hh:234
static constexpr int insidePatch
Definition intersection.hh:249
Dune::FieldVector< ctype, mydim > LocalCoordinate
Definition intersection.hh:253
static constexpr auto coorddim
Definition intersection.hh:247
typename IntersectionData::template GridGeometry< outside > OutsideGeometry
Definition intersection.hh:245
typename GridGlue::ctype ctype
Definition intersection.hh:252
typename GridGlue::template GridView< outside > OutsideGridView
Definition intersection.hh:239
Dune::FieldVector< ctype, coorddim > GlobalCoordinate
Definition intersection.hh:254
typename IntersectionData::template GridLocalGeometry< outside > OutsideLocalGeometry
Definition intersection.hh:242
typename GridGlue::template GridView< inside > InsideGridView
Definition intersection.hh:238
typename IntersectionData::template GridGeometry< inside > Geometry
Definition intersection.hh:244
typename IntersectionData::template GridLocalGeometry< inside > InsideLocalGeometry
Definition intersection.hh:241
static constexpr int outsidePatch
Definition intersection.hh:250
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Write remote intersections to a vtk file for debugging purposes.
Definition gridgluevtkwriter.hh:41
static void write(const Glue &glue, const std::string &filenameTrunk)
Definition gridgluevtkwriter.hh:276
Definition rangegenerators.hh:17
Provides codimension-independent methods for grid extraction.
Definition extractor.hh:46
void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords) const
getter for the coordinates array
Definition extractor.hh:275
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,752 +1,349 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersection.hh\n+gridgluevtkwriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-11#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n-12#define DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n-13\n-14#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- gridgluevtkwriter.hh File Reference
intersectionindexset.hh File Reference
\n-\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+\n\n
\n
\n-\n+
\n \n Write all remote intersections to a vtk file for debugging. \n-More...
\n-#include <fstream>\n-
#include <iomanip>\n-
#include <type_traits>\n-
#include <vector>\n-
#include <dune/common/classname.hh>\n-
#include <dune/geometry/type.hh>\n-
#include <dune/geometry/referenceelements.hh>\n-
#include <dune/grid-glue/gridglue.hh>\n+\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::GridGlueVtkWriter |
| Write remote intersections to a vtk file for debugging purposes. More... | |
| class | Dune::GridGlue::IntersectionIndexSet< P0, P1 > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-Write all remote intersections to a vtk file for debugging.
\n-\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,32 +2,21 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-gridgluevtkwriter.hh File Reference\n-Write all remote intersections to a vtk file for debugging. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n gridgluevtkwriter.hh
intersectionindexset.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,349 +1,105 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-gridgluevtkwriter.hh\n+intersectionindexset.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+_\b1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-5/*\n-6 * Filename: GridGlueVtkWriter.hh\n-7 * Version: 1.0\n-8 * Created on: Mar 5, 2009\n-9 * Author: Gerrit Buse\n-10 * ---------------------------------\n-11 * Project: dune-grid-glue\n-12 * Description: Class thought to make graphical debugging of couplings\n-easier.\n-13 *\n-14 */\n-20#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n-21#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n-22\n+3#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n+4#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n+5\n+6#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+7#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+8\n+9#ifndef ONLY_SIMPLEX_INTERSECTIONS\n+10// we currently support only one intersection type. If we want to support\n+more,\n+11// we have to think about the semantics of our IndexSet\n+12#error Not Implemented\n+13#endif\n+14\n+15namespace _\bD_\bu_\bn_\be {\n+16 namespace _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be {\n+17\n+18 template\n+_\b1_\b9 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt\n+20 {\n+21 friend class ::Dune::GridGlue::GridGlue;\n+22 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n 23\n-24#include \n-25#include \n-26#include \n-27#include \n-28\n-29#include \n-30#include \n-31#include \n-32\n-33#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-34\n-35namespace _\bD_\bu_\bn_\be {\n-36namespace GridGlue {\n-37\n-_\b4_\b0class _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br\n-41{\n-42\n-46 template \n-47 static void writeExtractedPart(const Glue& glue, const std::string&\n-filename)\n-48 {\n-49 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n-50\n-51 std::ofstream fgrid;\n-52\n-53 fgrid.open(filename.c_str());\n+24 public:\n+25\n+_\b2_\b7 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be;\n+_\b2_\b9 typedef size_t _\bS_\bi_\bz_\be_\bT_\by_\bp_\be;\n+30\n+33 template\n+_\b3_\b4 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bi_\bn_\bd_\be_\bx (const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bI_\b,_\bO_\b> & i) const\n+35 {\n+36 return i.i_->_\bi_\bn_\bd_\be_\bx_\b_;\n+37 }\n+38\n+_\b4_\b1 _\bS_\bi_\bz_\be_\bT_\by_\bp_\be _\bs_\bi_\bz_\be () const\n+42 {\n+43 return glue_->_\bs_\bi_\bz_\be();\n+44 }\n+45\n+46 private:\n+47\n+49 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be * g) :\n+50 glue_(g) {}\n+51\n+52 const GridGlue * glue_;\n+53 };\n 54\n-55 using GridView = typename Glue::template GridView;\n-56 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br = typename Glue::template GridPatch;\n+55 } // end namespace GridGlue\n+56} // end namespace Dune\n 57\n-58 typedef typename GridView::ctype ctype;\n-59\n-60 const int domdimw = GridView::dimensionworld;\n-61 const int patchDim = _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm - _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bd_\bi_\bm;\n-62\n-63 // coordinates have to be in R^3 in the VTK format\n-64 std::string coordinatePadding;\n-65 for (int i=domdimw; i<3; i++)\n-66 coordinatePadding += \" 0\";\n-67\n-68 fgrid << \"# vtk DataFile Version 2.0\\nFilename: \" << filename << \"\\nASCII\"\n-<< std::endl;\n-69\n-70 // WRITE POINTS\n-71 // ----------------\n-72 std::vector coords;\n-73 glue.template patch()._\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(coords);\n-74\n-75 fgrid << ((patchDim==3) ? \"DATASET UNSTRUCTURED_GRID\" : \"DATASET POLYDATA\")\n-<< std::endl;\n-76 fgrid << \"POINTS \" << coords.size() << \" \" << Dune::className() <<\n-std::endl;\n-77\n-78 for (size_t i=0; i faces;\n-87 std::vector geometryTypes;\n-88 glue.template patch().getFaces(faces);\n-89 glue.template patch().getGeometryTypes(geometryTypes);\n-90\n-91 unsigned int faceCornerCount = 0;\n-92 for (size_t i=0; i() << \" 1\" <<\n-std::endl;\n-163 fgrid << \"LOOKUP_TABLE default\" << std::endl;\n-164\n-165 for (typename GridSubEntityData::const_iterator sEIt =\n-gridSubEntityData.begin();\n-166 sEIt != gridSubEntityData.end();\n-167 ++sEIt, accum += delta)\n-168 {\n-169 // \"encode\" the parent with one color...\n-170 fgrid << accum << std::endl;\n-171 }\n-172#endif\n-173 fgrid.close();\n-174 }\n-175\n-176\n-180 template \n-181 static void writeIntersections(const Glue& glue, const std::string&\n-filename)\n-182 {\n-183 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n-184\n-185 std::ofstream fmerged;\n-186\n-187 fmerged.open(filename.c_str());\n-188\n-189 using GridView = typename Glue::template GridView;\n-190 typedef typename GridView::ctype ctype;\n-191\n-192 const int domdimw = GridView::dimensionworld;\n-193 const int intersectionDim = Glue::Intersection::mydim;\n-194\n-195 // coordinates have to be in R^3 in the VTK format\n-196 std::string coordinatePadding;\n-197 for (int i=domdimw; i<3; i++)\n-198 coordinatePadding += \" 0\";\n-199\n-200 int overlaps = glue.size();\n-201\n-202 // WRITE POINTS\n-203 // ----------------\n-204 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br = typename Glue::template GridPatch<0>;\n-205 std::vector coords;\n-206 glue.template patch()._\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(coords);\n-207\n-208 // the merged grid (i.e. the set of remote intersections\n-209 fmerged << \"# vtk DataFile Version 2.0\\nFilename: \" << filename <<\n-\"\\nASCII\" << std::endl;\n-210 fmerged << ((intersectionDim==3) ? \"DATASET UNSTRUCTURED_GRID\" : \"DATASET\n-POLYDATA\") << std::endl;\n-211 fmerged << \"POINTS \" << overlaps*(intersectionDim+1) << \" \" << Dune::\n-className() << std::endl;\n-212\n-213 for (const auto& intersection : _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(glue, _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bs_\bi_\bd_\be_\b _\b=_\b=_\b _\b1_\b>{}))\n-214 {\n-215 const auto& geometry = intersection.geometry();\n-216 for (int i = 0; i < geometry.corners(); ++i)\n-217 fmerged << geometry.corner(i) << coordinatePadding << std::endl;\n-218 }\n-219\n-220 // WRITE POLYGONS\n-221 // ----------------\n-222\n-223 std::vector faces;\n-224 std::vector geometryTypes;\n-225 glue.template patch().getFaces(faces);\n-226 glue.template patch().getGeometryTypes(geometryTypes);\n-227\n-228 unsigned int faceCornerCount = 0;\n-229 for (size_t i=0; i() << \" 1\"\n-<< std::endl;\n-260 fmerged << \"LOOKUP_TABLE default\" << std::endl;\n-261\n-262 for (typename GridSubEntityData::const_iterator sEIt =\n-gridSubEntityData.begin();\n-263 sEIt != gridSubEntityData.end();\n-264 ++sEIt, accum += delta)\n-265 {\n-266 // ...and mark all of its merged grid parts with the same color\n-267 for (int j = 0; j < sEIt->first.second; ++j)\n-268 fmerged << accum << std::endl;\n-269 }\n-270#endif\n-271 fmerged.close();\n-272 }\n-273\n-274public:\n-275 template\n-_\b2_\b7_\b6 static void _\bw_\br_\bi_\bt_\be(const Glue& glue, const std::string& filenameTrunk)\n-277 {\n-278\n-279 // Write extracted grid and remote intersection on the grid0-side\n-280 writeExtractedPart(glue,\n-281 filenameTrunk + \"-grid0.vtk\");\n-282\n-283 writeIntersections(glue,\n-284 filenameTrunk + \"-intersections-grid0.vtk\");\n-285\n-286 // Write extracted grid and remote intersection on the grid1-side\n-287 writeExtractedPart(glue,\n-288 filenameTrunk + \"-grid1.vtk\");\n-289\n-290 writeIntersections(glue,\n-291 filenameTrunk + \"-intersections-grid1.vtk\");\n-292\n-293 }\n-294\n-295};\n-296\n-297} /* namespace GridGlue */\n-298} /* namespace Dune */\n-299\n-300#endif // DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n+58#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n _\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n Central component of the module implementing the coupling of two grids.\n+_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh\n+Model of the Intersection concept provided by GridGlue.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br\n-Write remote intersections to a vtk file for debugging purposes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridgluevtkwriter.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be\n-static void write(const Glue &glue, const std::string &filenameTrunk)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridgluevtkwriter.hh:276\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:17\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br\n-Provides codimension-independent methods for grid extraction.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bd_\bi_\bm\n-static constexpr auto codim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bg_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs\n-void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords)\n-const\n-getter for the coordinates array\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm\n-static constexpr auto dim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+sequential adapter to couple two grids at specified close together boundaries\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+unsigned int IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:147\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bz_\be\n+size_t size() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:393\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n+IndexType index_\n+index of this intersection after GridGlue interface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:112\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+The intersection of two entities of the two patches of a GridGlue.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:261\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:20\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bs_\bi_\bz_\be\n+SizeType size() const\n+Return total number of intersections.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:41\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+GridGlue::IndexType IndexType\n+The type used for the indices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:27\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+IndexType index(const Intersection< P0, P1, I, O > &i) const\n+Map Dune::GridGlue::Intersection to index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:34\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bS_\bi_\bz_\be_\bT_\by_\bp_\be\n+size_t SizeType\n+The type used for the size.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:29\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00011.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00011.html", "unified_diff": "@@ -75,19 +75,19 @@\n
\n-\n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n- 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+Go to the documentation of this file. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+ 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+
\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 210 fmerged << ((intersectionDim==3) ? "DATASET UNSTRUCTURED_GRID" : "DATASET POLYDATA") << std::endl;
\n- 211 fmerged << "POINTS " << overlaps*(intersectionDim+1) << " " << Dune::className<ctype>() << std::endl;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-Central component of the module implementing the coupling of two grids.
Model of the Intersection concept provided by GridGlue.
Definition gridglue.hh:37
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Write remote intersections to a vtk file for debugging purposes.
Definition gridgluevtkwriter.hh:41
static void write(const Glue &glue, const std::string &filenameTrunk)
Definition gridgluevtkwriter.hh:276
Definition rangegenerators.hh:17
Provides codimension-independent methods for grid extraction.
Definition extractor.hh:46
void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords) const
getter for the coordinates array
Definition extractor.hh:275
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
IndexType index_
index of this intersection after GridGlue interface
Definition intersection.hh:112
The intersection of two entities of the two patches of a GridGlue.
Definition intersection.hh:261
Definition intersectionindexset.hh:20
SizeType size() const
Return total number of intersections.
Definition intersectionindexset.hh:41
GridGlue::IndexType IndexType
The type used for the indices.
Definition intersectionindexset.hh:27
IndexType index(const Intersection< P0, P1, I, O > &i) const
Map Dune::GridGlue::Intersection to index.
Definition intersectionindexset.hh:34
size_t SizeType
The type used for the size.
Definition intersectionindexset.hh:29
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,349 +1,105 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-gridgluevtkwriter.hh\n+intersectionindexset.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+_\b1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-5/*\n-6 * Filename: GridGlueVtkWriter.hh\n-7 * Version: 1.0\n-8 * Created on: Mar 5, 2009\n-9 * Author: Gerrit Buse\n-10 * ---------------------------------\n-11 * Project: dune-grid-glue\n-12 * Description: Class thought to make graphical debugging of couplings\n-easier.\n-13 *\n-14 */\n-20#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n-21#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEVTKWRITER_HH\n-22\n+3#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n+4#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n+5\n+6#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+7#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+8\n+9#ifndef ONLY_SIMPLEX_INTERSECTIONS\n+10// we currently support only one intersection type. If we want to support\n+more,\n+11// we have to think about the semantics of our IndexSet\n+12#error Not Implemented\n+13#endif\n+14\n+15namespace _\bD_\bu_\bn_\be {\n+16 namespace _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be {\n+17\n+18 template\n \n
\n \n Namespaces |\n Functions
\n gridglue.cc File Reference
\n-
\n+
\n
\n
\n
\n-
\n+
\n
\n\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,21 +2,27 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-intersectionindexset.hh File Reference\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+gridglueamirawriter.hh File Reference\n+Write all remote intersections to a AmiraMesh file. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n+\u00a0 Write remote intersections to a AmiraMesh file for debugging purposes.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+Write all remote intersections to a AmiraMesh file.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: intersectionindexset.hh Source File \n+dune-grid-glue: gridglueamirawriter.hh Source File \n \n \n \n \n \n \n \n@@ -74,87 +74,166 @@\n \n \n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,27 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-intersectioniterator.hh File Reference\n-Implement iterators over GridGlue intersections. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+rangegenerators.hh File Reference\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bi_\bn_\bs_\bi_\bd_\be_\b,_\b _\bo_\bu_\bt_\bs_\bi_\bd_\be_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b _\br_\be_\bv_\be_\br_\bs_\be_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Implement iterators over GridGlue intersections.\n- Author\n- Christian Engwer\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template<... >\n+IteratorRange<... >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs (const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be<... > &glue,\n+ const _\bR_\be_\bv_\be_\br_\bs_\be<... > &reverse=!reversed)\n+\u00a0 Iterate over all intersections of a _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be.\n+\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: intersectioniterator.hh Source File \n+dune-grid-glue: rangegenerators.hh Source File \n \n \n \n \n \n \n \n@@ -74,95 +74,78 @@\n \n \n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,238 +1,480 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projectionwriter_impl.hh\n+projection_impl.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#include \n+3#include \n 4\n-5namespace _\bD_\bu_\bn_\be {\n-6namespace GridGlue {\n-7\n-_\b8namespace ProjectionWriterImplementation {\n+5#include \n+6\n+7namespace _\bD_\bu_\bn_\be {\n+8namespace GridGlue {\n 9\n-10template\n-_\b1_\b1void _\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, const Corners&\n-corners, std::ostream& out)\n-12{\n-13 using namespace ProjectionImplementation;\n-14 using std::get;\n-15 const unsigned other_side = 1 - side;\n-16\n-17 for (const auto& c : get(corners))\n-18 out << c << \"\\n\";\n-19\n-20 for (const auto& i : get(projection._\bi_\bm_\ba_\bg_\be_\bs())) {\n-21 const auto global = interpolate(i, get(corners));\n-22 out << global << \"\\n\";\n-23 }\n-24}\n-25\n-26template\n-_\b2_\b7void _\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, const Normals&\n-normals, std::ostream& out)\n-28{\n-29 using namespace ProjectionImplementation;\n-30 using std::get;\n-31 const unsigned other_side = 1 - side;\n+_\b1_\b0namespace ProjectionImplementation {\n+11\n+22template\n+23inline Coordinate\n+_\b2_\b4_\bc_\bo_\br_\bn_\be_\br(unsigned c)\n+25{\n+26 Coordinate x(Field(0));\n+27 if (c == 0)\n+28 return x;\n+29 x[c-1] = Field(1);\n+30 return x;\n+31}\n 32\n-33 for (const auto& n : get(normals))\n-34 out << n << \"\\n\";\n-35\n-36 for (const auto& x : get(projection._\bi_\bm_\ba_\bg_\be_\bs())) {\n-37 const auto n = interpolate_unit_normals(x, get(normals));\n-38 out << n << \"\\n\";\n-39 }\n-40}\n-41\n-42template\n-_\b4_\b3void _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n-const Corners& corners, std::ostream& out)\n+42inline std::pair\n+_\b4_\b3_\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(unsigned edge)\n 44{\n-45 using namespace ProjectionImplementation;\n-46 using std::get;\n-47\n-48 for (std::size_t i = 0; i < projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(); ++i) {\n-49 const auto& local = projection._\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs()[i].local;\n-50 out << interpolate(local[0], get<0>(corners)) << \"\\n\"\n-51 << interpolate(local[1], get<1>(corners)) << \"\\n\";\n-52 }\n-53}\n-54\n-55template\n-_\b5_\b6void _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>&\n-projection, const Normals& normals, std::ostream& out)\n-57{\n-58 using namespace ProjectionImplementation;\n-59 using std::get;\n-60\n-61 for (std::size_t i = 0; i < projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(); ++i) {\n-62 const auto& local = projection._\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs()[i].local;\n-63 const auto n0 = interpolate_unit_normals(local[0], get<0>(normals));\n-64 const auto n1 = interpolate_unit_normals(local[1], get<1>(normals));\n-65\n-66 out << n0 << \"\\n\"\n-67 << n1 << \"\\n\";\n-68 }\n-69}\n-70\n-71template\n-_\b7_\b2void _\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, std::ostream&\n-out)\n-73{\n-74 using std::get;\n-75\n-76 out << side << \"\\n\";\n+45 switch(edge) {\n+46 case 0: return {0, 1};\n+47 case 1: return {0, 2};\n+48 case 2: return {1, 2};\n+49 }\n+50 DUNE_THROW(Dune::Exception, \"Unexpected edge number.\");\n+51}\n+52\n+68template\n+69inline typename Corners::value_type\n+_\b7_\b0_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(const Coordinate& x, const Corners& corners)\n+71{\n+72 auto y = corners[0];\n+73 for (unsigned i = 0; i < corners.size() - 1; ++i)\n+74 y.axpy(x[i], corners[i+1] - corners[0]);\n+75 return y;\n+76}\n 77\n-78 const auto& success = get(projection._\bs_\bu_\bc_\bc_\be_\bs_\bs());\n-79 for (std::size_t i = 0; i < success.size(); ++i)\n-80 out << (success[i] ? \"1\\n\" : \"0\\n\");\n-81}\n-82\n-83} /* namespace ProjectionWriterImplementation */\n-84\n-85template\n-_\b8_\b6void _\bw_\br_\bi_\bt_\be(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n-87 const Corners& corners,\n-88 const Normals& normals,\n-89 std::ostream& out)\n-90{\n-91 using namespace ProjectionWriterImplementation;\n-92\n-93 const auto numberOfEdgeIntersections = projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-();\n-94 const auto nPoints = 12 + 2 * numberOfEdgeIntersections;\n-95\n-96 out << \"# vtk DataFile Version2.0\\n\"\n-97 << \"Filename: projection\\n\"\n-98 << \"ASCII\\n\"\n-99 << \"DATASET UNSTRUCTURED_GRID\\n\"\n-100 << \"POINTS \" << nPoints << \" double\\n\";\n-101 write_points<0>(projection, corners, out);\n-102 write_points<1>(projection, corners, out);\n-103 write_edge_intersection_points(projection, corners, out);\n-104 out << \"CELLS \" << (8 + numberOfEdgeIntersections) << \" \" << (26 + 3 *\n-numberOfEdgeIntersections) << \"\\n\";\n-105 out << \"3 0 1 2\\n\" \"2 0 3\\n\" \"2 1 4\\n\" \"2 2 5\\n\"\n-106 << \"3 6 7 8\\n\" \"2 6 9\\n\" \"2 7 10\\n\" \"2 8 11\\n\";\n-107 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n-108 out << \"2 \" << (12 + 2*i) << \" \" << (12 + 2*i + 1) << \"\\n\";\n-109 out << \"CELL_TYPES \" << (8 + numberOfEdgeIntersections) << \"\\n\"\n-\"5\\n3\\n3\\n3\\n\" \"5\\n3\\n3\\n3\\n\";\n-110 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n-111 out << \"3\\n\";\n-112 out << \"CELL_DATA \" << (8 + numberOfEdgeIntersections) << \"\\n\";\n-113 out << \"SCALARS success int 1\\n\"\n-114 << \"LOOKUP_TABLE success\\n\";\n-115 write_success<0>(projection, out);\n-116 write_success<1>(projection, out);\n-117 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n-118 out << \"2\\n\";\n-119 out << \"LOOKUP_TABLE success 2\\n\"\n-120 << \"1.0 0.0 0.0 1.0\\n\"\n-121 << \"0.0 1.0 0.0 1.0\\n\";\n-122 out << \"POINT_DATA \" << nPoints << \"\\n\"\n-123 << \"NORMALS normals double\\n\";\n-124 write_normals<0>(projection, normals, out);\n-125 write_normals<1>(projection, normals, out);\n-126 write_edge_intersection_normals(projection, normals, out);\n-127}\n-128\n-129template\n-_\b1_\b3_\b0void _\bw_\br_\bi_\bt_\be(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n-131 const Corners& corners,\n-132 const Normals& normals,\n-133 const std::string& filename)\n-134{\n-135 std::ofstream out(filename.c_str());\n-136 _\bw_\br_\bi_\bt_\be(projection, corners, normals, out);\n-137}\n-138\n-139template\n-_\b1_\b4_\b0void _\bp_\br_\bi_\bn_\bt(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n-141 const Corners& corners,\n-142 const Normals& normals)\n-143{\n-144 using namespace ProjectionWriterImplementation;\n-145\n-146 std::cout << \"Side 0 corners and images:\\n\";\n-147 write_points<0>(projection, corners, std::cout);\n-148 std::cout << \"Side 0 success:\\n\";\n-149 write_success<0>(projection, std::cout);\n-150 std::cout << \"Side 1 corners and images:\\n\";\n-151 write_points<1>(projection, corners, std::cout);\n-152 std::cout << \"Side 1 success:\\n\";\n-153 write_success<1>(projection, std::cout);\n-154 std::cout << \"Side 0 normals and projected normals:\\n\";\n-155 write_normals<0>(projection, normals, std::cout);\n-156 std::cout << \"Side 1 normals and projected normals:\\n\";\n-157 write_normals<1>(projection, normals, std::cout);\n-158 std::cout << projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs() << \" edge\n-intersections:\\n\";\n-159 write_edge_intersection_points(projection, corners, std::cout);\n-160}\n-161\n-162} /* namespace GridGlue */\n-163} /* namespace Dune */\n+89template\n+90inline typename Normals::value_type\n+_\b9_\b1_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const Coordinate& x, const Normals& normals)\n+92{\n+93 auto n = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(x, normals);\n+94 n /= n.two_norm();\n+95 return n;\n+96}\n+97\n+109template\n+110inline bool\n+_\b1_\b1_\b1_\bi_\bn_\bs_\bi_\bd_\be(const Coordinate& x, const Field& epsilon)\n+112{\n+113 const unsigned dim = Coordinate::dimension;\n+114 Field sum(0);\n+115 for (unsigned i = 0; i < dim-1; ++i) {\n+116 if (x[i] < -epsilon)\n+117 return false;\n+118 sum += x[i];\n+119 }\n+120 /* If any x\u00e1\u00b5\u00a2 is NaN, sum will be NaN and this comparison false! */\n+121 if (sum <= Field(1) + epsilon)\n+122 return true;\n+123 return false;\n+124}\n+125\n+126} /* namespace ProjectionImplementation */\n+127\n+128template\n+129Projection\n+_\b1_\b3_\b0::Projection(const _\bF_\bi_\be_\bl_\bd overlap, const _\bF_\bi_\be_\bl_\bd max_normal_product)\n+131 : m_overlap(overlap)\n+132 , m_max_normal_product(max_normal_product)\n+133{\n+134 /* Nothing. */\n+135}\n+136\n+137template\n+138void\n+139_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>\n+_\b1_\b4_\b0_\b:_\b:_\be_\bp_\bs_\bi_\bl_\bo_\bn(const _\bF_\bi_\be_\bl_\bd epsilon)\n+141{\n+142 m_epsilon = epsilon;\n+143}\n+144\n+145template\n+146template\n+147void\n+148_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>\n+149_\b:_\b:_\bd_\bo_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn(const std::tuple& corners, const std::\n+tuple& normals)\n+150{\n+151 /* Try to obtain \u00ce\u00a6(x\u00e1\u00b5\u00a2) for each corner x\u00e1\u00b5\u00a2 of the preimage triangle.\n+152 * This means solving a linear system of equations\n+153 * \u00ce\u00a6(x\u00e1\u00b5\u00a2) = (1-\u00ce\u00b1-\u00ce\u00b2) y\u00e2\u0082\u0080 + \u00ce\u00b1 y\u00e2\u0082\u0081 + \u00ce\u00b2 y\u00e2\u0082\u0082 = x\u00e1\u00b5\u00a2 + \u00ce\u00b4 n\u00e1\u00b5\u00a2\n+154 * or \u00ce\u00b1 (y\u00e2\u0082\u0081 - y\u00e2\u0082\u0080) + \u00ce\u00b2 (y\u00e2\u0082\u0082 - y\u00e2\u0082\u0080) - \u00ce\u00b4 n\u00e1\u00b5\u00a2 = x\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080\n+155 * to obtain the barycentric coordinates (\u00ce\u00b1, \u00ce\u00b2) of \u00ce\u00a6(x\u00e1\u00b5\u00a2) in the image\n+156 * triangle and the distance \u00ce\u00b4.\n+157 *\n+158 * In the matrix m corresponding to the system, only the third column and\n+the\n+159 * right-hand side depend on i. The first two columns can be assembled\n+before\n+160 * and reused.\n+161 */\n+162 using namespace ProjectionImplementation;\n+163 using std::get;\n+164 typedef Dune::FieldMatrix Matrix;\n+165 Matrix m;\n+166\n+167 const auto& origin = get<0>(corners);\n+168 const auto& origin_normals = get<0>(normals);\n+169 const auto& target = get<1>(corners);\n+170 const auto& target_normals = get<1>(normals);\n+171 auto& images = get<0>(m_images);\n+172 auto& success = get<0>(m_success);\n+173\n+174 /* directions\u00e1\u00b5\u00a2 = (y\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080) / ||y\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080||\n+175 * These are the first to columns of the system matrix; the rescaling is\n+done\n+176 * to ensure all columns have a comparable norm (the last has the normal\n+with norm 1.\n+177 */\n+178 std::array directions;\n+179 std::array scales;\n+180 /* estimator for the diameter of the target face */\n+181 Field scaleSum(0);\n+182 for (unsigned i = 0; i < dim-1; ++i) {\n+183 directions[i] = target[i+1] - target[0];\n+184 scales[i] = directions[i].infinity_norm();\n+185 directions[i] /= scales[i];\n+186 scaleSum += scales[i];\n+187 }\n+188\n+189 for (unsigned i = 0; i < dim-1; ++i) {\n+190 for (unsigned j = 0; j < dim; ++j) {\n+191 m[j][i] = directions[i][j];\n+192 }\n+193 }\n+194\n+195 m_projection_valid = true;\n+196 success.reset();\n+197\n+198 /* Now project x\u00e1\u00b5\u00a2 for each i */\n+199 for (unsigned i = 0; i < origin.size(); ++i) {\n+200 for (unsigned j = 0; j < dim; ++j)\n+201 m[j][dim-1] = origin_normals[i][j];\n+202\n+203 const Coordinate rhs = origin[i] - target[0];\n+204\n+205 try {\n+206 /* y = (\u00ce\u00b1, \u00ce\u00b2, \u00ce\u00b4) */\n+207 auto& y = images[i];\n+208 m.solve(y, rhs);\n+209 for (unsigned j = 0; j < dim-1; ++j)\n+210 y[j] /= scales[j];\n+211 /* Solving gave us -\u00ce\u00b4 as the term is \"-\u00ce\u00b4 n\u00e1\u00b5\u00a2\". */\n+212 y[dim-1] *= Field(-1);\n+213\n+214 /* If the forward projection is too far in the wrong direction\n+215 * then this might result in artificial inverse projections or\n+216 * edge intersections. To prevent these wrong cases but not\n+217 * dismiss feasible intersections, the projection is dismissed\n+218 * if the forward projection is further than two times the\n+219 * approximate diameter of the image triangle.\n+220 */\n+221 if(y[dim-1] < -2*scaleSum) {\n+222 success.set(i,false);\n+223 m_projection_valid = false;\n+224 return;\n+225 }\n+226\n+227 const bool feasible = projectionFeasible(origin[i], origin_normals[i], y,\n+target, target_normals);\n+228 success.set(i, feasible);\n+229 }\n+230 catch (const Dune::FMatrixError&) {\n+231 success.set(i, false);\n+232 m_projection_valid = false;\n+233 }\n+234 }\n+235}\n+236\n+237template\n+238template\n+239void\n+240Projection\n+241::doInverseProjection(const std::tuple& corners, const\n+std::tuple& normals)\n+242{\n+243 /* Try to obtain \u00ce\u00a6\u00e2\u0081\u00bb\u00c2\u00b9(y\u00e1\u00b5\u00a2) for each corner y\u00e1\u00b5\u00a2 of the image triangle.\n+244 * Instead of solving the problem directly (which would lead to\n+245 * non-linear equations), we make use of the forward projection \u00ce\u00a6\n+246 * which projects the preimage triangle on the plane spanned by the\n+247 * image triangle. The inverse projection is then given by finding\n+248 * the barycentric coordinates of y\u00e1\u00b5\u00a2 with respect to the triangle\n+249 * with the corners \u00ce\u00a6(x\u00e1\u00b5\u00a2). This way we only have to solve linear\n+250 * equations.\n+251 */\n+252\n+253 using namespace ProjectionImplementation;\n+254 using std::get;\n+255 typedef Dune::FieldMatrix Matrix;\n+256 typedef Dune::FieldVector Vector;\n+257\n+258 /* The inverse projection can only be computed if the forward projection\n+259 * managed to project all x\u00e1\u00b5\u00a2 on the plane spanned by the y\u00e1\u00b5\u00a2\n+260 */\n+261 if (!m_projection_valid) {\n+262 get<1>(m_success).reset();\n+263 return;\n+264 }\n+265\n+266 const auto& images = get<0>(m_images);\n+267 const auto& target_corners = get<1>(corners);\n+268 auto& preimages = get<1>(m_images);\n+269 auto& success = get<1>(m_success);\n+270\n+271 std::array v;\n+272 for (unsigned i = 0; i < dim-1; ++i) {\n+273 v[i] = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[i+1], target_corners);\n+274 v[i] -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[0], target_corners);\n+275 }\n+276\n+277 Matrix m;\n+278 for (unsigned i = 0; i < dim-1; ++i) {\n+279 for (unsigned j = 0; j < dim-1; ++j) {\n+280 m[i][j] = v[i]*v[j];\n+281 }\n+282 }\n+283\n+284 for (unsigned i = 0; i < dim; ++i) {\n+285 /* Convert y\u00e1\u00b5\u00a2 to barycentric coordinates with respect to \u00ce\u00a6(x\u00e2\u00b1\u00bc) */\n+286 v[dim-1] = target_corners[i];\n+287 v[dim-1] -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[0], target_corners);\n+288\n+289 Vector rhs, z;\n+290 for (unsigned j = 0; j < dim-1; ++j)\n+291 rhs[j] = v[dim-1]*v[j];\n+292 m.solve(z, rhs);\n+293\n+294 for (unsigned j = 0; j < dim-1; ++j)\n+295 preimages[i][j] = z[j];\n+296\n+297 /* Calculate distance along normal direction */\n+298 const auto x = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(z, get<0>(corners));\n+299 preimages[i][dim-1] = (x - target_corners[i]) * get<1>(normals)[i];\n+300\n+301 /* Check y_i lies inside the \u00ce\u00a6(x\u00e2\u00b1\u00bc) */\n+302 const bool feasible = projectionFeasible(target_corners[i], get<1>(normals)\n+[i], preimages[i], get<0>(corners), get<0>(normals));\n+303 success.set(i, feasible);\n+304 }\n+305}\n+306\n+307template\n+308template\n+309void\n+310Projection\n+311::doEdgeIntersection(const std::tuple& corners, const\n+std::tuple& normals)\n+312{\n+313 using namespace ProjectionImplementation;\n+314 using std::get;\n+315\n+316 m_number_of_edge_intersections = 0;\n+317\n+318 /* There are no edge intersections for 2d, only for 3d */\n+319 if (dim != 3)\n+320 return;\n+321\n+322 /* There are no edge intersections\n+323 * - when the projection is invalid,\n+324 * - when the projected triangle lies fully in the target triangle,\n+325 * - or when the target triangle lies fully in the projected triangle.\n+326 */\n+327 if (!m_projection_valid || get<0>(m_success).all() || get<1>(m_success).all\n+()) {\n+328 return;\n+329 }\n+330\n+331 const auto& images = get<0>(m_images);\n+332 const auto& ys = get<1>(corners);\n+333\n+334 /* Intersect line through \u00ce\u00a6(x\u00e1\u00b5\u00a2), \u00ce\u00a6(x\u00e2\u00b1\u00bc) with line through y\u00e2\u0082\u0096, y\u00e2\u0082\u0097:\n+335 We want \u00ce\u00b1, \u00ce\u00b2 \u00e2\u0088\u0088 \u00e2\u0084\u009d such that\n+336 \u00ce\u00a6(x\u00e1\u00b5\u00a2) + \u00ce\u00b1 (\u00ce\u00a6(x\u00e2\u00b1\u00bc) - \u00ce\u00a6(x\u00e1\u00b5\u00a2)) = y\u00e2\u0082\u0096 + \u00ce\u00b2 (y\u00e2\u0082\u0097 - y\u00e2\u0082\u0096)\n+337 or\n+338 \u00ce\u00b1 (\u00ce\u00a6(x\u00e2\u00b1\u00bc)-\u00ce\u00a6(x\u00e1\u00b5\u00a2)) + \u00ce\u00b2 (y\u00e2\u0082\u0097-y\u00e2\u0082\u0096) = y\u00e2\u0082\u0096-\u00ce\u00a6(x\u00e1\u00b5\u00a2)\n+339 To get a 2\u00c3\u00972 system of equations, multiply with y\u00e2\u0082\u0098-y\u00e2\u0082\u0080 for\n+340 m \u00e2\u0088\u0088 {1,\u00cc\u00a3\u00cc\u00a32} which are linear indep. (and so the system is\n+341 equivalent to the original 3\u00c3\u00972 system)\n+342 */\n+343 for (unsigned edgex = 0; edgex < dim; ++edgex) {\n+344 unsigned i, j;\n+345 std::tie(i, j) = _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(edgex);\n+346\n+347 /* Both sides of edgex lie in the target triangle means no edge\n+intersection */\n+348 if (get<0>(m_success)[i] && get<0>(m_success)[j])\n+349 continue;\n+350\n+351 const auto pxi = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[i], ys);\n+352 const auto pxj = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[j], ys);\n+353 const auto pxjpxi = pxj - pxi;\n+354\n+355 typedef Dune::FieldMatrix Matrix;\n+356 typedef Dune::FieldVector Vector;\n+357\n+358 for (unsigned edgey = 0; edgey < dim; ++edgey) {\n+359 unsigned k, l;\n+360 std::tie(k, l) = _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(edgey);\n+361\n+362 /* Both sides of edgey lie in the projected triangle means no edge\n+intersection */\n+363 if (get<1>(m_success)[k] && get<1>(m_success)[l])\n+364 continue;\n+365\n+366 const auto ykyl = ys[k] - ys[l];\n+367 const auto ykpxi = ys[k] - pxi;\n+368\n+369 /* If edges are parallel then the intersection is already computed by\n+vertex projections. */\n+370 bool parallel = true;\n+371 for (unsigned h=0; h<3; h++)\n+372 parallel &= std::abs(ykyl[(h+1)%3]*pxjpxi[(h+2)%3] - ykyl[(h+2)%3]*pxjpxi[\n+(h+1)%3])<1e-14;\n+373 if (parallel)\n+374 continue;\n+375\n+376 Matrix mat;\n+377 Vector rhs, z;\n+378\n+379 for (unsigned m = 0; m < dim-1; ++m) {\n+380 const auto ym1y0 = ys[m+1] - ys[0];\n+381 mat[m][0] = pxjpxi * ym1y0;\n+382 mat[m][1] = ykyl * ym1y0;\n+383 rhs[m] = ykpxi * ym1y0;\n+384 }\n+385\n+386 try {\n+387 using std::isfinite;\n+388\n+389 mat.solve(z, rhs);\n+390\n+391 /* If solving the system gives a NaN, the edges are probably parallel. */\n+392 if (!isfinite(z[0]) || !isfinite(z[1]))\n+393 continue;\n+394\n+395 /* Filter out corner (pre)images. We only want \"real\" edge-edge\n+intersections here. */\n+396 if (z[0] < m_epsilon || z[0] > Field(1) - m_epsilon\n+397 || z[1] < m_epsilon || z[1] > Field(1) - m_epsilon)\n+398 continue;\n+399\n+400 Coordinate local_x = corner(i);\n+401 local_x.axpy(z[0], corner(j) - corner\n+(i));\n+402 Coordinate local_y = corner(k);\n+403 local_y.axpy(z[1], corner(l) - corner\n+(k));\n+404\n+405 /* Make sure the intersection is in the triangle. */\n+406 if (!_\bi_\bn_\bs_\bi_\bd_\be(local_x, m_epsilon) || !_\bi_\bn_\bs_\bi_\bd_\be(local_y, m_epsilon))\n+407 continue;\n+408\n+409 /* Make sure the intersection respects overlap. */\n+410 auto xy = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(local_x, get<0>(corners));\n+411 xy -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(local_y, get<1>(corners));\n+412 const auto nx = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(local_x, get<0>(normals));\n+413 const auto ny = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(local_y, get<1>(normals));\n+414 local_x[dim-1] = -(xy*nx);\n+415 local_y[dim-1] = xy*ny;\n+416\n+417 if (local_x[dim-1] < -m_overlap-m_epsilon || local_y[dim-1] < -m_overlap-\n+m_epsilon)\n+418 continue;\n+419\n+420 /* Normals should be opposing. */\n+421 if (nx*ny > m_max_normal_product + m_epsilon)\n+422 continue;\n+423\n+424 /* Intersection is feasible. Store it. */\n+425 auto& intersection = m_edge_intersections\n+[m_number_of_edge_intersections++];\n+426 intersection = { {{edgex, edgey}}, {{local_x, local_y}} };\n+427 }\n+428 catch(const Dune::FMatrixError&) {\n+429 /* Edges might be parallel, ignore and continue with next edge */\n+430 }\n+431 }\n+432 }\n+433}\n+434\n+435template\n+436template\n+437bool Projection\n+438::projectionFeasible(const Coordinate& x, const Coordinate& nx, const\n+Coordinate& px, const Corners& corners, const Normals& normals) const\n+439{\n+440 using namespace ProjectionImplementation;\n+441\n+442 /* Image must be within simplex. */\n+443 if (!_\bi_\bn_\bs_\bi_\bd_\be(px, m_epsilon))\n+444 return false;\n+445\n+446 /* Distance along normal must not be smaller than -overlap. */\n+447 if (px[dim-1] < -m_overlap-m_epsilon)\n+448 return false;\n+449\n+450 /* Distance along normal at image must not be smaller than -overlap. */\n+451 auto xmy = x;\n+452 xmy -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(px, corners);\n+453 const auto n = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(px, normals);\n+454 const auto d = xmy * n;\n+455 if (d < -m_overlap-m_epsilon)\n+456 return false;\n+457\n+458 /* Normals at x and \u00ce\u00a6(x) are opposing. */\n+459 if (nx * n > m_max_normal_product + m_epsilon)\n+460 return false;\n+461\n+462 /* Okay, projection is feasible. */\n+463 return true;\n+464}\n+465\n+466template\n+467template\n+468void Projection\n+_\b4_\b6_\b9::project(const std::tuple& corners, const std::\n+tuple& normals)\n+470{\n+471 doProjection(corners, normals);\n+472 doInverseProjection(corners, normals);\n+473 doEdgeIntersection(corners, normals);\n+474}\n+475\n+476} /* namespace GridGlue */\n+477} /* namespace Dune */\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be\n-void write(const Projection< Coordinate > &projection, const Corners &corners,\n-const Normals &normals, std::ostream &out)\n-write projection in VTK format\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt\n-void print(const Projection< Coordinate > &projection, const Corners &corners,\n-const Normals &normals)\n-Print information about the projection to std::cout stream.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:140\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n-void write_normals(const Projection< Coordinate > &projection, const Normals\n-&normals, std::ostream &out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:27\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs\n-void write_points(const Projection< Coordinate > &projection, const Corners\n-&corners, std::ostream &out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs\n-void write_success(const Projection< Coordinate > &projection, std::ostream\n-&out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:72\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs\n-void write_edge_intersection_points(const Projection< Coordinate > &projection,\n-const Corners &corners, std::ostream &out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n-void write_edge_intersection_normals(const Projection< Coordinate >\n-&projection, const Normals &normals, std::ostream &out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n+Corners::value_type interpolate(const Coordinate &x, const Corners &corners)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:70\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be\n+bool inside(const Coordinate &x, const Field &epsilon)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:111\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs\n+std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:43\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n+Coordinate corner(unsigned c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n+Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals\n+&normals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:91\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn\n Projection of a line (triangle) on another line (triangle).\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\bu_\bc_\bc_\be_\bs_\bs\n-const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const\n-Indicate whether projection (inverse projection) is valid for each corner or\n-not.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:252\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-unsigned numberOfEdgeIntersections() const\n-Number of edge intersections.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bm_\ba_\bg_\be_\bs\n-const std::tuple< Images, Preimages > & images() const\n-Images and preimages of corners.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:235\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections\n-() const\n-Edge-edge intersections.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:273\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bF_\bi_\be_\bl_\bd\n+Coordinate::field_type Field\n+Scalar type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:61\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00032.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00032.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: areawriter.hh File Reference \n+dune-grid-glue: projectionwriter.hh File Reference \n \n \n \n \n \n \n \n@@ -72,41 +72,45 @@\n dune grid-glue common \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,48 +1,62 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-areawriter.hh\n+projectionwriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n-4#define DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n+3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n+4#define DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n 5\n-6#include \n+6#include \n 7#include \n 8\n-9namespace _\bD_\bu_\bn_\be {\n-10namespace GridGlue {\n-11\n-12template\n-13void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk(const Glue& glue, std::ostream& out);\n-14\n-15template\n-16void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk(const Glue& glue, const std::string& filename);\n-17\n-37template\n-38void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk(const Glue& glue, const std::string& base);\n-39\n-40} /* namespace GridGlue */\n-41} /* namespace Dune */\n-42\n-43#include \"_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n-44\n-45#endif\n-_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\n+9#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+10\n+11namespace _\bD_\bu_\bn_\be {\n+12namespace GridGlue {\n+13\n+28template\n+29void _\bw_\br_\bi_\bt_\be(const Projection& projection,\n+30 const Corners& corners,\n+31 const Normals& normals,\n+32 std::ostream& out);\n+33\n+40template\n+41void _\bw_\br_\bi_\bt_\be(const Projection& projection,\n+42 const Corners& corners,\n+43 const Normals& normals,\n+44 const std::string& filename);\n+54template\n+55void _\bp_\br_\bi_\bn_\bt(const Projection& projection,\n+56 const Corners& corners,\n+57 const Normals& normals);\n+58\n+59} /* namespace GridGlue */\n+60} /* namespace Dune */\n+61\n+62#include \"_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n+63\n+64#endif\n+_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\n+_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk\n-void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn areawriter_impl.hh:84\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk\n-void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn areawriter_impl.hh:129\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be\n+void write(const Projection< Coordinate > &projection, const Corners &corners,\n+const Normals &normals, std::ostream &out)\n+write projection in VTK format\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:86\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt\n+void print(const Projection< Coordinate > &projection, const Corners &corners,\n+const Normals &normals)\n+Print information about the projection to std::cout stream.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:140\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00035.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00035.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: ringcomm.hh File Reference \n+dune-grid-glue: areawriter.hh File Reference \n \n \n \n \n \n \n \n@@ -71,77 +71,43 @@\n \n \n \n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,480 +1,238 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projection_impl.hh\n+projectionwriter_impl.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#include \n+3#include \n 4\n-5#include \n-6\n-7namespace _\bD_\bu_\bn_\be {\n-8namespace GridGlue {\n+5namespace _\bD_\bu_\bn_\be {\n+6namespace GridGlue {\n+7\n+_\b8namespace ProjectionWriterImplementation {\n 9\n-_\b1_\b0namespace ProjectionImplementation {\n-11\n-22template\n-23inline Coordinate\n-_\b2_\b4_\bc_\bo_\br_\bn_\be_\br(unsigned c)\n-25{\n-26 Coordinate x(Field(0));\n-27 if (c == 0)\n-28 return x;\n-29 x[c-1] = Field(1);\n-30 return x;\n-31}\n+10template\n+_\b1_\b1void _\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, const Corners&\n+corners, std::ostream& out)\n+12{\n+13 using namespace ProjectionImplementation;\n+14 using std::get;\n+15 const unsigned other_side = 1 - side;\n+16\n+17 for (const auto& c : get(corners))\n+18 out << c << \"\\n\";\n+19\n+20 for (const auto& i : get(projection._\bi_\bm_\ba_\bg_\be_\bs())) {\n+21 const auto global = interpolate(i, get(corners));\n+22 out << global << \"\\n\";\n+23 }\n+24}\n+25\n+26template\n+_\b2_\b7void _\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, const Normals&\n+normals, std::ostream& out)\n+28{\n+29 using namespace ProjectionImplementation;\n+30 using std::get;\n+31 const unsigned other_side = 1 - side;\n 32\n-42inline std::pair\n-_\b4_\b3_\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(unsigned edge)\n+33 for (const auto& n : get(normals))\n+34 out << n << \"\\n\";\n+35\n+36 for (const auto& x : get(projection._\bi_\bm_\ba_\bg_\be_\bs())) {\n+37 const auto n = interpolate_unit_normals(x, get(normals));\n+38 out << n << \"\\n\";\n+39 }\n+40}\n+41\n+42template\n+_\b4_\b3void _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n+const Corners& corners, std::ostream& out)\n 44{\n-45 switch(edge) {\n-46 case 0: return {0, 1};\n-47 case 1: return {0, 2};\n-48 case 2: return {1, 2};\n-49 }\n-50 DUNE_THROW(Dune::Exception, \"Unexpected edge number.\");\n-51}\n-52\n-68template\n-69inline typename Corners::value_type\n-_\b7_\b0_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(const Coordinate& x, const Corners& corners)\n-71{\n-72 auto y = corners[0];\n-73 for (unsigned i = 0; i < corners.size() - 1; ++i)\n-74 y.axpy(x[i], corners[i+1] - corners[0]);\n-75 return y;\n-76}\n+45 using namespace ProjectionImplementation;\n+46 using std::get;\n+47\n+48 for (std::size_t i = 0; i < projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(); ++i) {\n+49 const auto& local = projection._\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs()[i].local;\n+50 out << interpolate(local[0], get<0>(corners)) << \"\\n\"\n+51 << interpolate(local[1], get<1>(corners)) << \"\\n\";\n+52 }\n+53}\n+54\n+55template\n+_\b5_\b6void _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>&\n+projection, const Normals& normals, std::ostream& out)\n+57{\n+58 using namespace ProjectionImplementation;\n+59 using std::get;\n+60\n+61 for (std::size_t i = 0; i < projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(); ++i) {\n+62 const auto& local = projection._\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs()[i].local;\n+63 const auto n0 = interpolate_unit_normals(local[0], get<0>(normals));\n+64 const auto n1 = interpolate_unit_normals(local[1], get<1>(normals));\n+65\n+66 out << n0 << \"\\n\"\n+67 << n1 << \"\\n\";\n+68 }\n+69}\n+70\n+71template\n+_\b7_\b2void _\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection, std::ostream&\n+out)\n+73{\n+74 using std::get;\n+75\n+76 out << side << \"\\n\";\n 77\n-89template\n-90inline typename Normals::value_type\n-_\b9_\b1_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(const Coordinate& x, const Normals& normals)\n-92{\n-93 auto n = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(x, normals);\n-94 n /= n.two_norm();\n-95 return n;\n-96}\n-97\n-109template\n-110inline bool\n-_\b1_\b1_\b1_\bi_\bn_\bs_\bi_\bd_\be(const Coordinate& x, const Field& epsilon)\n-112{\n-113 const unsigned dim = Coordinate::dimension;\n-114 Field sum(0);\n-115 for (unsigned i = 0; i < dim-1; ++i) {\n-116 if (x[i] < -epsilon)\n-117 return false;\n-118 sum += x[i];\n-119 }\n-120 /* If any x\u00e1\u00b5\u00a2 is NaN, sum will be NaN and this comparison false! */\n-121 if (sum <= Field(1) + epsilon)\n-122 return true;\n-123 return false;\n-124}\n-125\n-126} /* namespace ProjectionImplementation */\n-127\n-128template\n-129Projection\n-_\b1_\b3_\b0::Projection(const _\bF_\bi_\be_\bl_\bd overlap, const _\bF_\bi_\be_\bl_\bd max_normal_product)\n-131 : m_overlap(overlap)\n-132 , m_max_normal_product(max_normal_product)\n-133{\n-134 /* Nothing. */\n-135}\n-136\n-137template\n-138void\n-139_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>\n-_\b1_\b4_\b0_\b:_\b:_\be_\bp_\bs_\bi_\bl_\bo_\bn(const _\bF_\bi_\be_\bl_\bd epsilon)\n-141{\n-142 m_epsilon = epsilon;\n-143}\n-144\n-145template\n-146template\n-147void\n-148_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>\n-149_\b:_\b:_\bd_\bo_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn(const std::tuple& corners, const std::\n-tuple& normals)\n-150{\n-151 /* Try to obtain \u00ce\u00a6(x\u00e1\u00b5\u00a2) for each corner x\u00e1\u00b5\u00a2 of the preimage triangle.\n-152 * This means solving a linear system of equations\n-153 * \u00ce\u00a6(x\u00e1\u00b5\u00a2) = (1-\u00ce\u00b1-\u00ce\u00b2) y\u00e2\u0082\u0080 + \u00ce\u00b1 y\u00e2\u0082\u0081 + \u00ce\u00b2 y\u00e2\u0082\u0082 = x\u00e1\u00b5\u00a2 + \u00ce\u00b4 n\u00e1\u00b5\u00a2\n-154 * or \u00ce\u00b1 (y\u00e2\u0082\u0081 - y\u00e2\u0082\u0080) + \u00ce\u00b2 (y\u00e2\u0082\u0082 - y\u00e2\u0082\u0080) - \u00ce\u00b4 n\u00e1\u00b5\u00a2 = x\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080\n-155 * to obtain the barycentric coordinates (\u00ce\u00b1, \u00ce\u00b2) of \u00ce\u00a6(x\u00e1\u00b5\u00a2) in the image\n-156 * triangle and the distance \u00ce\u00b4.\n-157 *\n-158 * In the matrix m corresponding to the system, only the third column and\n-the\n-159 * right-hand side depend on i. The first two columns can be assembled\n-before\n-160 * and reused.\n-161 */\n-162 using namespace ProjectionImplementation;\n-163 using std::get;\n-164 typedef Dune::FieldMatrix Matrix;\n-165 Matrix m;\n-166\n-167 const auto& origin = get<0>(corners);\n-168 const auto& origin_normals = get<0>(normals);\n-169 const auto& target = get<1>(corners);\n-170 const auto& target_normals = get<1>(normals);\n-171 auto& images = get<0>(m_images);\n-172 auto& success = get<0>(m_success);\n-173\n-174 /* directions\u00e1\u00b5\u00a2 = (y\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080) / ||y\u00e1\u00b5\u00a2 - y\u00e2\u0082\u0080||\n-175 * These are the first to columns of the system matrix; the rescaling is\n-done\n-176 * to ensure all columns have a comparable norm (the last has the normal\n-with norm 1.\n-177 */\n-178 std::array directions;\n-179 std::array scales;\n-180 /* estimator for the diameter of the target face */\n-181 Field scaleSum(0);\n-182 for (unsigned i = 0; i < dim-1; ++i) {\n-183 directions[i] = target[i+1] - target[0];\n-184 scales[i] = directions[i].infinity_norm();\n-185 directions[i] /= scales[i];\n-186 scaleSum += scales[i];\n-187 }\n-188\n-189 for (unsigned i = 0; i < dim-1; ++i) {\n-190 for (unsigned j = 0; j < dim; ++j) {\n-191 m[j][i] = directions[i][j];\n-192 }\n-193 }\n-194\n-195 m_projection_valid = true;\n-196 success.reset();\n-197\n-198 /* Now project x\u00e1\u00b5\u00a2 for each i */\n-199 for (unsigned i = 0; i < origin.size(); ++i) {\n-200 for (unsigned j = 0; j < dim; ++j)\n-201 m[j][dim-1] = origin_normals[i][j];\n-202\n-203 const Coordinate rhs = origin[i] - target[0];\n-204\n-205 try {\n-206 /* y = (\u00ce\u00b1, \u00ce\u00b2, \u00ce\u00b4) */\n-207 auto& y = images[i];\n-208 m.solve(y, rhs);\n-209 for (unsigned j = 0; j < dim-1; ++j)\n-210 y[j] /= scales[j];\n-211 /* Solving gave us -\u00ce\u00b4 as the term is \"-\u00ce\u00b4 n\u00e1\u00b5\u00a2\". */\n-212 y[dim-1] *= Field(-1);\n-213\n-214 /* If the forward projection is too far in the wrong direction\n-215 * then this might result in artificial inverse projections or\n-216 * edge intersections. To prevent these wrong cases but not\n-217 * dismiss feasible intersections, the projection is dismissed\n-218 * if the forward projection is further than two times the\n-219 * approximate diameter of the image triangle.\n-220 */\n-221 if(y[dim-1] < -2*scaleSum) {\n-222 success.set(i,false);\n-223 m_projection_valid = false;\n-224 return;\n-225 }\n-226\n-227 const bool feasible = projectionFeasible(origin[i], origin_normals[i], y,\n-target, target_normals);\n-228 success.set(i, feasible);\n-229 }\n-230 catch (const Dune::FMatrixError&) {\n-231 success.set(i, false);\n-232 m_projection_valid = false;\n-233 }\n-234 }\n-235}\n-236\n-237template\n-238template\n-239void\n-240Projection\n-241::doInverseProjection(const std::tuple& corners, const\n-std::tuple& normals)\n-242{\n-243 /* Try to obtain \u00ce\u00a6\u00e2\u0081\u00bb\u00c2\u00b9(y\u00e1\u00b5\u00a2) for each corner y\u00e1\u00b5\u00a2 of the image triangle.\n-244 * Instead of solving the problem directly (which would lead to\n-245 * non-linear equations), we make use of the forward projection \u00ce\u00a6\n-246 * which projects the preimage triangle on the plane spanned by the\n-247 * image triangle. The inverse projection is then given by finding\n-248 * the barycentric coordinates of y\u00e1\u00b5\u00a2 with respect to the triangle\n-249 * with the corners \u00ce\u00a6(x\u00e1\u00b5\u00a2). This way we only have to solve linear\n-250 * equations.\n-251 */\n-252\n-253 using namespace ProjectionImplementation;\n-254 using std::get;\n-255 typedef Dune::FieldMatrix Matrix;\n-256 typedef Dune::FieldVector Vector;\n-257\n-258 /* The inverse projection can only be computed if the forward projection\n-259 * managed to project all x\u00e1\u00b5\u00a2 on the plane spanned by the y\u00e1\u00b5\u00a2\n-260 */\n-261 if (!m_projection_valid) {\n-262 get<1>(m_success).reset();\n-263 return;\n-264 }\n-265\n-266 const auto& images = get<0>(m_images);\n-267 const auto& target_corners = get<1>(corners);\n-268 auto& preimages = get<1>(m_images);\n-269 auto& success = get<1>(m_success);\n-270\n-271 std::array v;\n-272 for (unsigned i = 0; i < dim-1; ++i) {\n-273 v[i] = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[i+1], target_corners);\n-274 v[i] -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[0], target_corners);\n-275 }\n-276\n-277 Matrix m;\n-278 for (unsigned i = 0; i < dim-1; ++i) {\n-279 for (unsigned j = 0; j < dim-1; ++j) {\n-280 m[i][j] = v[i]*v[j];\n-281 }\n-282 }\n-283\n-284 for (unsigned i = 0; i < dim; ++i) {\n-285 /* Convert y\u00e1\u00b5\u00a2 to barycentric coordinates with respect to \u00ce\u00a6(x\u00e2\u00b1\u00bc) */\n-286 v[dim-1] = target_corners[i];\n-287 v[dim-1] -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[0], target_corners);\n-288\n-289 Vector rhs, z;\n-290 for (unsigned j = 0; j < dim-1; ++j)\n-291 rhs[j] = v[dim-1]*v[j];\n-292 m.solve(z, rhs);\n-293\n-294 for (unsigned j = 0; j < dim-1; ++j)\n-295 preimages[i][j] = z[j];\n-296\n-297 /* Calculate distance along normal direction */\n-298 const auto x = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(z, get<0>(corners));\n-299 preimages[i][dim-1] = (x - target_corners[i]) * get<1>(normals)[i];\n-300\n-301 /* Check y_i lies inside the \u00ce\u00a6(x\u00e2\u00b1\u00bc) */\n-302 const bool feasible = projectionFeasible(target_corners[i], get<1>(normals)\n-[i], preimages[i], get<0>(corners), get<0>(normals));\n-303 success.set(i, feasible);\n-304 }\n-305}\n-306\n-307template\n-308template\n-309void\n-310Projection\n-311::doEdgeIntersection(const std::tuple& corners, const\n-std::tuple& normals)\n-312{\n-313 using namespace ProjectionImplementation;\n-314 using std::get;\n-315\n-316 m_number_of_edge_intersections = 0;\n-317\n-318 /* There are no edge intersections for 2d, only for 3d */\n-319 if (dim != 3)\n-320 return;\n-321\n-322 /* There are no edge intersections\n-323 * - when the projection is invalid,\n-324 * - when the projected triangle lies fully in the target triangle,\n-325 * - or when the target triangle lies fully in the projected triangle.\n-326 */\n-327 if (!m_projection_valid || get<0>(m_success).all() || get<1>(m_success).all\n-()) {\n-328 return;\n-329 }\n-330\n-331 const auto& images = get<0>(m_images);\n-332 const auto& ys = get<1>(corners);\n-333\n-334 /* Intersect line through \u00ce\u00a6(x\u00e1\u00b5\u00a2), \u00ce\u00a6(x\u00e2\u00b1\u00bc) with line through y\u00e2\u0082\u0096, y\u00e2\u0082\u0097:\n-335 We want \u00ce\u00b1, \u00ce\u00b2 \u00e2\u0088\u0088 \u00e2\u0084\u009d such that\n-336 \u00ce\u00a6(x\u00e1\u00b5\u00a2) + \u00ce\u00b1 (\u00ce\u00a6(x\u00e2\u00b1\u00bc) - \u00ce\u00a6(x\u00e1\u00b5\u00a2)) = y\u00e2\u0082\u0096 + \u00ce\u00b2 (y\u00e2\u0082\u0097 - y\u00e2\u0082\u0096)\n-337 or\n-338 \u00ce\u00b1 (\u00ce\u00a6(x\u00e2\u00b1\u00bc)-\u00ce\u00a6(x\u00e1\u00b5\u00a2)) + \u00ce\u00b2 (y\u00e2\u0082\u0097-y\u00e2\u0082\u0096) = y\u00e2\u0082\u0096-\u00ce\u00a6(x\u00e1\u00b5\u00a2)\n-339 To get a 2\u00c3\u00972 system of equations, multiply with y\u00e2\u0082\u0098-y\u00e2\u0082\u0080 for\n-340 m \u00e2\u0088\u0088 {1,\u00cc\u00a3\u00cc\u00a32} which are linear indep. (and so the system is\n-341 equivalent to the original 3\u00c3\u00972 system)\n-342 */\n-343 for (unsigned edgex = 0; edgex < dim; ++edgex) {\n-344 unsigned i, j;\n-345 std::tie(i, j) = _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(edgex);\n-346\n-347 /* Both sides of edgex lie in the target triangle means no edge\n-intersection */\n-348 if (get<0>(m_success)[i] && get<0>(m_success)[j])\n-349 continue;\n-350\n-351 const auto pxi = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[i], ys);\n-352 const auto pxj = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(images[j], ys);\n-353 const auto pxjpxi = pxj - pxi;\n-354\n-355 typedef Dune::FieldMatrix Matrix;\n-356 typedef Dune::FieldVector Vector;\n-357\n-358 for (unsigned edgey = 0; edgey < dim; ++edgey) {\n-359 unsigned k, l;\n-360 std::tie(k, l) = _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs(edgey);\n-361\n-362 /* Both sides of edgey lie in the projected triangle means no edge\n-intersection */\n-363 if (get<1>(m_success)[k] && get<1>(m_success)[l])\n-364 continue;\n-365\n-366 const auto ykyl = ys[k] - ys[l];\n-367 const auto ykpxi = ys[k] - pxi;\n-368\n-369 /* If edges are parallel then the intersection is already computed by\n-vertex projections. */\n-370 bool parallel = true;\n-371 for (unsigned h=0; h<3; h++)\n-372 parallel &= std::abs(ykyl[(h+1)%3]*pxjpxi[(h+2)%3] - ykyl[(h+2)%3]*pxjpxi[\n-(h+1)%3])<1e-14;\n-373 if (parallel)\n-374 continue;\n-375\n-376 Matrix mat;\n-377 Vector rhs, z;\n-378\n-379 for (unsigned m = 0; m < dim-1; ++m) {\n-380 const auto ym1y0 = ys[m+1] - ys[0];\n-381 mat[m][0] = pxjpxi * ym1y0;\n-382 mat[m][1] = ykyl * ym1y0;\n-383 rhs[m] = ykpxi * ym1y0;\n-384 }\n-385\n-386 try {\n-387 using std::isfinite;\n-388\n-389 mat.solve(z, rhs);\n-390\n-391 /* If solving the system gives a NaN, the edges are probably parallel. */\n-392 if (!isfinite(z[0]) || !isfinite(z[1]))\n-393 continue;\n-394\n-395 /* Filter out corner (pre)images. We only want \"real\" edge-edge\n-intersections here. */\n-396 if (z[0] < m_epsilon || z[0] > Field(1) - m_epsilon\n-397 || z[1] < m_epsilon || z[1] > Field(1) - m_epsilon)\n-398 continue;\n-399\n-400 Coordinate local_x = corner(i);\n-401 local_x.axpy(z[0], corner(j) - corner\n-(i));\n-402 Coordinate local_y = corner(k);\n-403 local_y.axpy(z[1], corner(l) - corner\n-(k));\n-404\n-405 /* Make sure the intersection is in the triangle. */\n-406 if (!_\bi_\bn_\bs_\bi_\bd_\be(local_x, m_epsilon) || !_\bi_\bn_\bs_\bi_\bd_\be(local_y, m_epsilon))\n-407 continue;\n-408\n-409 /* Make sure the intersection respects overlap. */\n-410 auto xy = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(local_x, get<0>(corners));\n-411 xy -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(local_y, get<1>(corners));\n-412 const auto nx = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(local_x, get<0>(normals));\n-413 const auto ny = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(local_y, get<1>(normals));\n-414 local_x[dim-1] = -(xy*nx);\n-415 local_y[dim-1] = xy*ny;\n-416\n-417 if (local_x[dim-1] < -m_overlap-m_epsilon || local_y[dim-1] < -m_overlap-\n-m_epsilon)\n-418 continue;\n-419\n-420 /* Normals should be opposing. */\n-421 if (nx*ny > m_max_normal_product + m_epsilon)\n-422 continue;\n-423\n-424 /* Intersection is feasible. Store it. */\n-425 auto& intersection = m_edge_intersections\n-[m_number_of_edge_intersections++];\n-426 intersection = { {{edgex, edgey}}, {{local_x, local_y}} };\n-427 }\n-428 catch(const Dune::FMatrixError&) {\n-429 /* Edges might be parallel, ignore and continue with next edge */\n-430 }\n-431 }\n-432 }\n-433}\n-434\n-435template\n-436template\n-437bool Projection\n-438::projectionFeasible(const Coordinate& x, const Coordinate& nx, const\n-Coordinate& px, const Corners& corners, const Normals& normals) const\n-439{\n-440 using namespace ProjectionImplementation;\n-441\n-442 /* Image must be within simplex. */\n-443 if (!_\bi_\bn_\bs_\bi_\bd_\be(px, m_epsilon))\n-444 return false;\n-445\n-446 /* Distance along normal must not be smaller than -overlap. */\n-447 if (px[dim-1] < -m_overlap-m_epsilon)\n-448 return false;\n-449\n-450 /* Distance along normal at image must not be smaller than -overlap. */\n-451 auto xmy = x;\n-452 xmy -= _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(px, corners);\n-453 const auto n = _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs(px, normals);\n-454 const auto d = xmy * n;\n-455 if (d < -m_overlap-m_epsilon)\n-456 return false;\n-457\n-458 /* Normals at x and \u00ce\u00a6(x) are opposing. */\n-459 if (nx * n > m_max_normal_product + m_epsilon)\n-460 return false;\n-461\n-462 /* Okay, projection is feasible. */\n-463 return true;\n-464}\n-465\n-466template\n-467template\n-468void Projection\n-_\b4_\b6_\b9::project(const std::tuple& corners, const std::\n-tuple& normals)\n-470{\n-471 doProjection(corners, normals);\n-472 doInverseProjection(corners, normals);\n-473 doEdgeIntersection(corners, normals);\n-474}\n-475\n-476} /* namespace GridGlue */\n-477} /* namespace Dune */\n+78 const auto& success = get(projection._\bs_\bu_\bc_\bc_\be_\bs_\bs());\n+79 for (std::size_t i = 0; i < success.size(); ++i)\n+80 out << (success[i] ? \"1\\n\" : \"0\\n\");\n+81}\n+82\n+83} /* namespace ProjectionWriterImplementation */\n+84\n+85template\n+_\b8_\b6void _\bw_\br_\bi_\bt_\be(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n+87 const Corners& corners,\n+88 const Normals& normals,\n+89 std::ostream& out)\n+90{\n+91 using namespace ProjectionWriterImplementation;\n+92\n+93 const auto numberOfEdgeIntersections = projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+();\n+94 const auto nPoints = 12 + 2 * numberOfEdgeIntersections;\n+95\n+96 out << \"# vtk DataFile Version2.0\\n\"\n+97 << \"Filename: projection\\n\"\n+98 << \"ASCII\\n\"\n+99 << \"DATASET UNSTRUCTURED_GRID\\n\"\n+100 << \"POINTS \" << nPoints << \" double\\n\";\n+101 write_points<0>(projection, corners, out);\n+102 write_points<1>(projection, corners, out);\n+103 write_edge_intersection_points(projection, corners, out);\n+104 out << \"CELLS \" << (8 + numberOfEdgeIntersections) << \" \" << (26 + 3 *\n+numberOfEdgeIntersections) << \"\\n\";\n+105 out << \"3 0 1 2\\n\" \"2 0 3\\n\" \"2 1 4\\n\" \"2 2 5\\n\"\n+106 << \"3 6 7 8\\n\" \"2 6 9\\n\" \"2 7 10\\n\" \"2 8 11\\n\";\n+107 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n+108 out << \"2 \" << (12 + 2*i) << \" \" << (12 + 2*i + 1) << \"\\n\";\n+109 out << \"CELL_TYPES \" << (8 + numberOfEdgeIntersections) << \"\\n\"\n+\"5\\n3\\n3\\n3\\n\" \"5\\n3\\n3\\n3\\n\";\n+110 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n+111 out << \"3\\n\";\n+112 out << \"CELL_DATA \" << (8 + numberOfEdgeIntersections) << \"\\n\";\n+113 out << \"SCALARS success int 1\\n\"\n+114 << \"LOOKUP_TABLE success\\n\";\n+115 write_success<0>(projection, out);\n+116 write_success<1>(projection, out);\n+117 for (std::size_t i = 0; i < numberOfEdgeIntersections; ++i)\n+118 out << \"2\\n\";\n+119 out << \"LOOKUP_TABLE success 2\\n\"\n+120 << \"1.0 0.0 0.0 1.0\\n\"\n+121 << \"0.0 1.0 0.0 1.0\\n\";\n+122 out << \"POINT_DATA \" << nPoints << \"\\n\"\n+123 << \"NORMALS normals double\\n\";\n+124 write_normals<0>(projection, normals, out);\n+125 write_normals<1>(projection, normals, out);\n+126 write_edge_intersection_normals(projection, normals, out);\n+127}\n+128\n+129template\n+_\b1_\b3_\b0void _\bw_\br_\bi_\bt_\be(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n+131 const Corners& corners,\n+132 const Normals& normals,\n+133 const std::string& filename)\n+134{\n+135 std::ofstream out(filename.c_str());\n+136 _\bw_\br_\bi_\bt_\be(projection, corners, normals, out);\n+137}\n+138\n+139template\n+_\b1_\b4_\b0void _\bp_\br_\bi_\bn_\bt(const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b>& projection,\n+141 const Corners& corners,\n+142 const Normals& normals)\n+143{\n+144 using namespace ProjectionWriterImplementation;\n+145\n+146 std::cout << \"Side 0 corners and images:\\n\";\n+147 write_points<0>(projection, corners, std::cout);\n+148 std::cout << \"Side 0 success:\\n\";\n+149 write_success<0>(projection, std::cout);\n+150 std::cout << \"Side 1 corners and images:\\n\";\n+151 write_points<1>(projection, corners, std::cout);\n+152 std::cout << \"Side 1 success:\\n\";\n+153 write_success<1>(projection, std::cout);\n+154 std::cout << \"Side 0 normals and projected normals:\\n\";\n+155 write_normals<0>(projection, normals, std::cout);\n+156 std::cout << \"Side 1 normals and projected normals:\\n\";\n+157 write_normals<1>(projection, normals, std::cout);\n+158 std::cout << projection._\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs() << \" edge\n+intersections:\\n\";\n+159 write_edge_intersection_points(projection, corners, std::cout);\n+160}\n+161\n+162} /* namespace GridGlue */\n+163} /* namespace Dune */\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n-Corners::value_type interpolate(const Coordinate &x, const Corners &corners)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:70\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be\n-bool inside(const Coordinate &x, const Field &epsilon)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:111\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs\n-std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-Coordinate corner(unsigned c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n-Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals\n-&normals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:91\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be\n+void write(const Projection< Coordinate > &projection, const Corners &corners,\n+const Normals &normals, std::ostream &out)\n+write projection in VTK format\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:86\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt\n+void print(const Projection< Coordinate > &projection, const Corners &corners,\n+const Normals &normals)\n+Print information about the projection to std::cout stream.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:140\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n+void write_normals(const Projection< Coordinate > &projection, const Normals\n+&normals, std::ostream &out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:27\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs\n+void write_points(const Projection< Coordinate > &projection, const Corners\n+&corners, std::ostream &out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:11\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs\n+void write_success(const Projection< Coordinate > &projection, std::ostream\n+&out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs\n+void write_edge_intersection_points(const Projection< Coordinate > &projection,\n+const Corners &corners, std::ostream &out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:43\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs\n+void write_edge_intersection_normals(const Projection< Coordinate >\n+&projection, const Normals &normals, std::ostream &out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projectionwriter_impl.hh:56\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn\n Projection of a line (triangle) on another line (triangle).\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bF_\bi_\be_\bl_\bd\n-Coordinate::field_type Field\n-Scalar type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\bu_\bc_\bc_\be_\bs_\bs\n+const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const\n+Indicate whether projection (inverse projection) is valid for each corner or\n+not.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:252\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+unsigned numberOfEdgeIntersections() const\n+Number of edge intersections.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:262\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bm_\ba_\bg_\be_\bs\n+const std::tuple< Images, Preimages > & images() const\n+Images and preimages of corners.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:235\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections\n+() const\n+Edge-edge intersections.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:273\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projection.hh File Reference \n+dune-grid-glue: crossproduct.hh File Reference \n \n \n \n \n \n \n \n@@ -70,41 +70,35 @@\n \n \n \n+ \n \n
\n Generated by 1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,24 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-projection.hh File Reference\n-#include \n-#include \n-#include \n-#include \"_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+crossproduct.hh File Reference\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\b _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b _\b>\n-\u00a0 _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn of a line (triangle) on another line (triangle). _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b<_\b _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b _\b>_\b:_\b:_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-\u00a0 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn between two edges of a triangle. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+static Dune::FieldVector< T, dim >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt (const Dune::\n+ FieldVector< T, dim > &a, const Dune::\n+ FieldVector< T, dim > &b)\n+\u00a0 compute cross product\n+\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projection.hh Source File \n+dune-grid-glue: crossproduct.hh Source File \n \n \n \n \n \n \n \n@@ -74,137 +74,48 @@\n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,175 +1,49 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projection.hh\n+crossproduct.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-4#define DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n+3#ifndef DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH\n+4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n 5\n-6#include \n-7#include \n-8#include \n-9\n-10namespace _\bD_\bu_\bn_\be {\n-11namespace GridGlue {\n-12\n-19template\n-_\b2_\b0class _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn\n-21{\n-22public:\n-_\b2_\b8 struct _\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-29 {\n-_\b3_\b3 std::array _\be_\bd_\bg_\be;\n-34\n-_\b4_\b1 std::array _\bl_\bo_\bc_\ba_\bl;\n-42 };\n-43\n-_\b4_\b7 constexpr static unsigned _\bd_\bi_\bm = Coordinate::dimension;\n-48\n-_\b5_\b4 constexpr static unsigned _\bm_\ba_\bx_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs = _\bd_\bi_\bm == 3 ? 9 : 0;\n-55\n-56 static_assert(_\bd_\bi_\bm == 2 || _\bd_\bi_\bm == 3, \"Projection only implemented for dim=2\n-or dim=3\");\n-57\n-_\b6_\b1 typedef typename Coordinate::field_type _\bF_\bi_\be_\bl_\bd;\n-62\n-_\b7_\b0 typedef std::array _\bI_\bm_\ba_\bg_\be_\bs;\n-71\n-_\b7_\b8 typedef _\bI_\bm_\ba_\bg_\be_\bs _\bP_\br_\be_\bi_\bm_\ba_\bg_\be_\bs;\n-79\n-80private:\n-84 const _\bF_\bi_\be_\bl_\bd m_overlap;\n-85\n-94 const _\bF_\bi_\be_\bl_\bd m_max_normal_product;\n-95\n-101 _\bF_\bi_\be_\bl_\bd m_epsilon = _\bF_\bi_\be_\bl_\bd(1e-12);\n-102\n-104 std::tuple m_images;\n-105\n-107 std::tuple, std::bitset > m_success;\n-108\n-110 unsigned m_number_of_edge_intersections;\n-111\n-113 std::array m_edge_intersections;\n-114\n-126 bool m_projection_valid;\n-127\n-133 template\n-134 void doProjection(const std::tuple& corners, const\n-std::tuple& normals);\n-135\n-144 template\n-145 void doInverseProjection(const std::tuple& corners,\n-const std::tuple& normals);\n-146\n-155 template\n-156 void doEdgeIntersection(const std::tuple& corners,\n-const std::tuple& normals);\n-157\n-183 template\n-184 inline bool projectionFeasible(const Coordinate& x, const Coordinate& nx,\n-const Coordinate& px, const Corners& corners, const Normals& normals) const;\n-185\n-186public:\n-191 _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn(const _\bF_\bi_\be_\bl_\bd overlap = _\bF_\bi_\be_\bl_\bd(0), const _\bF_\bi_\be_\bl_\bd max_normal_product =\n-_\bF_\bi_\be_\bl_\bd(-0.1));\n-192\n-198 void _\be_\bp_\bs_\bi_\bl_\bo_\bn(const _\bF_\bi_\be_\bl_\bd _\be_\bp_\bs_\bi_\bl_\bo_\bn);\n-199\n-212 template\n-213 void _\bp_\br_\bo_\bj_\be_\bc_\bt(const std::tuple& corners, const std::\n-tuple& normals);\n-214\n-_\b2_\b3_\b5 const std::tuple& _\bi_\bm_\ba_\bg_\be_\bs() const\n-236 { return m_images; }\n-237\n-_\b2_\b5_\b2 const std::tuple, std::bitset >& _\bs_\bu_\bc_\bc_\be_\bs_\bs() const\n-253 { return m_success; }\n-254\n-_\b2_\b6_\b2 unsigned _\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs() const\n-263 { return m_number_of_edge_intersections; }\n-264\n-_\b2_\b7_\b3 const std::array& _\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-() const\n-274 { return m_edge_intersections; }\n-275};\n-276\n-277} /* namespace GridGlue */\n-278} /* namespace Dune */\n-279\n-280#include \"_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n-281\n-282#endif\n-_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\n+6namespace _\bD_\bu_\bn_\be {\n+7namespace GridGlue {\n+8\n+14template \n+_\b1_\b5static Dune::FieldVector _\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt(const Dune::FieldVector&\n+a,\n+16 const Dune::FieldVector& b)\n+17{\n+18 if (dim!=3)\n+19 DUNE_THROW(Dune::NotImplemented, \"crossProduct does not work for dimension \"\n+<< dim);\n+20\n+21 Dune::FieldVector c;\n+22 c[0] = a[1]*b[2] - a[2]*b[1];\n+23 c[1] = a[2]*b[0] - a[0]*b[2];\n+24 c[2] = a[0]*b[1] - a[1]*b[0];\n+25\n+26 return c;\n+27}\n+28\n+29} /* namespace GridGlue */\n+30} /* namespace Dune */\n+31\n+32#endif\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn\n-Projection of a line (triangle) on another line (triangle).\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bF_\bi_\be_\bl_\bd\n-Coordinate::field_type Field\n-Scalar type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:61\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\bu_\bc_\bc_\be_\bs_\bs\n-const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const\n-Indicate whether projection (inverse projection) is valid for each corner or\n-not.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:252\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bm_\ba_\bx_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-static constexpr unsigned maxEdgeIntersections\n-maximum number of edge-edge intersections\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\br_\be_\bi_\bm_\ba_\bg_\be_\bs\n-Images Preimages\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bm_\ba_\bg_\be_\bs\n-std::array< Coordinate, dim > Images\n-List of corner images.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:70\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bp_\bs_\bi_\bl_\bo_\bn\n-void epsilon(const Field epsilon)\n-Set epsilon used for floating-point comparisons.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:140\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bp_\br_\bo_\bj_\be_\bc_\bt\n-void project(const std::tuple< Corners &, Corners & > &corners, const std::\n-tuple< Normals &, Normals & > &normals)\n-Do the actual projection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection_impl.hh:469\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bd_\bi_\bm\n-static constexpr unsigned dim\n-dimension of coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bn_\bu_\bm_\bb_\be_\br_\bO_\bf_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-unsigned numberOfEdgeIntersections() const\n-Number of edge intersections.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bm_\ba_\bg_\be_\bs\n-const std::tuple< Images, Preimages > & images() const\n-Images and preimages of corners.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:235\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections\n-() const\n-Edge-edge intersections.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:273\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-Intersection between two edges of a triangle.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:29\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-std::array< Coordinate, 2 > local\n-Local coordinates of intersection and distance along normals.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bE_\bd_\bg_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\be_\bd_\bg_\be\n-std::array< unsigned, 2 > edge\n-Edge numbers in image and preimage triangle.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn projection.hh:33\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt\n+static Dune::FieldVector< T, dim > crossProduct(const Dune::FieldVector< T, dim\n+> &a, const Dune::FieldVector< T, dim > &b)\n+compute cross product\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn crossproduct.hh:15\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00044.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00044.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: areawriter_impl.hh File Reference \n+dune-grid-glue: ringcomm.hh File Reference \n \n \n \n \n \n \n \n@@ -70,57 +70,78 @@\n \n \n
#include "intersection.hh"\n+
#include "intersection.hh"\n
#include <vector>\n
#include <iterator>\n
#include "../gridglue.hh"\n-
#include "../common/ringcomm.hh"\n+
#include "../common/ringcomm.hh"\n
#include <dune/common/unused.hh>\n
Go to the source code of this file.
\n\n Namespaces | |||
| namespace | Dune |
\n Classes | |
| class | Dune::GridGlue::IntersectionIndexSet< P0, P1 > |
| class | Dune::GridGlue::GridGlueAmiraWriter |
| Write remote intersections to a AmiraMesh file for debugging purposes. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n+Write all remote intersections to a AmiraMesh file.
\n+\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,21 +2,27 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-intersectionindexset.hh File Reference\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+gridglueamirawriter.hh File Reference\n+Write all remote intersections to a AmiraMesh file. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n- \n+ \n
\n intersectionindexset.hh
gridglueamirawriter.hh
\n-Go to the documentation of this file.\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,105 +1,165 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersectionindexset.hh\n+gridglueamirawriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-_\b1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n-4#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n-5\n-6#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-7#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n-8\n-9#ifndef ONLY_SIMPLEX_INTERSECTIONS\n-10// we currently support only one intersection type. If we want to support\n-more,\n-11// we have to think about the semantics of our IndexSet\n-12#error Not Implemented\n-13#endif\n+8#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+9#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+10\n+11#include \n+12#include \n+13#include \n 14\n 15namespace _\bD_\bu_\bn_\be {\n-16 namespace _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be {\n+16namespace GridGlue {\n 17\n-18 template\n-_\b1_\b9 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt\n-20 {\n-21 friend class ::Dune::GridGlue::GridGlue;\n-22 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n-23\n-24 public:\n-25\n-_\b2_\b7 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be;\n-_\b2_\b9 typedef size_t _\bS_\bi_\bz_\be_\bT_\by_\bp_\be;\n+_\b2_\b0class _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n+21{\n+22\n+26 template \n+27 static void writeIntersections(const Glue& glue, const std::string&\n+filename)\n+28 {\n+29 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n 30\n-33 template\n-_\b3_\b4 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bi_\bn_\bd_\be_\bx (const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bI_\b,_\bO_\b> & i) const\n-35 {\n-36 return i.i_->_\bi_\bn_\bd_\be_\bx_\b_;\n-37 }\n+31 std::ofstream fgrid;\n+32\n+33 fgrid.open(filename.c_str());\n+34\n+35 using GridView = typename Glue::template GridView;\n+36 const int dim = GridView::dimension;\n+37 const int domdimw = GridView::dimensionworld;\n 38\n-_\b4_\b1 _\bS_\bi_\bz_\be_\bT_\by_\bp_\be _\bs_\bi_\bz_\be () const\n-42 {\n-43 return glue_->_\bs_\bi_\bz_\be();\n-44 }\n+39 // coordinates have to be in R^3 in the VTK format\n+40 std::string coordinatePadding;\n+41 for (int i=domdimw; i<3; i++)\n+42 coordinatePadding += \" 0\";\n+43\n+44 int overlaps = glue.size();\n 45\n-46 private:\n+46 if (dim==3) {\n 47\n-49 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be * g) :\n-50 glue_(g) {}\n-51\n-52 const GridGlue * glue_;\n-53 };\n-54\n-55 } // end namespace GridGlue\n-56} // end namespace Dune\n-57\n-58#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n-_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n-Central component of the module implementing the coupling of two grids.\n-_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh\n-Model of the Intersection concept provided by GridGlue.\n+48 fgrid << \"# HyperSurface 0.1 ASCII \\n\" << std::endl;\n+49 fgrid<<\"\\n\";\n+50 fgrid<<\"Parameters {\\n\";\n+51 fgrid<<\" Materials {\\n\";\n+52 fgrid<<\" outside {\\n\";\n+53 fgrid<<\" Id 0\\n\";\n+54 fgrid<<\" }\\n\";\n+55 fgrid<<\" inside {\\n\";\n+56 fgrid<<\" Id 1\\n\";\n+57 fgrid<<\" }\\n\";\n+58 fgrid<<\" }\\n\";\n+59 fgrid<<\"\\n\";\n+60 fgrid<<\"}\\n\";\n+61\n+62 // ////////////////////////////////////////////\n+63 // Write vertices\n+64 // ////////////////////////////////////////////\n+65\n+66 //use dim and not dim+1\n+67 fgrid<<\"\\nVertices \"<< overlaps*(dim)<<\"\\n\";\n+68 auto isEnd = glue.template iend();\n+69 for (auto isIt = glue.template ibegin(); isIt != isEnd; ++isIt)\n+70 {\n+71 const auto& geometry = isIt->geometry();\n+72 for (int i = 0; i < geometry.corners(); ++i)\n+73 fgrid << geometry.corner(i) << coordinatePadding << std::endl;\n+74 }\n+75\n+76 // ////////////////////////////////////////////\n+77 // Write triangles\n+78 // ////////////////////////////////////////////\n+79\n+80 fgrid<<\"NBranchingPoints 0\\n\";\n+81 fgrid<<\"NVerticesOnCurves 0\\n\";\n+82 fgrid<<\"BoundaryCurves 0\\n\";\n+83 fgrid<<\"Patches 1\\n\";\n+84 fgrid<<\"{\\n\";\n+85 fgrid<<\"InnerRegion inside\\n\";\n+86 fgrid<<\"OuterRegion outside\\n\";\n+87 fgrid<<\"BoundaryID 0\\n\";\n+88 fgrid<<\"BranchingPoints 0\";\n+89 fgrid<<\"\\n\";\n+90\n+91 fgrid<<\"Triangles \"<();\n+119 for (auto isIt = glue.template ibegin(); isIt != isEnd; ++isIt) {\n+120 const auto& geometry = isIt->geometry();\n+121 for (int i = 0; i <2; ++i)\n+122 fgrid << geometry.corner(i) <<\" \"<<0<<\"\\n\";\n+123 }\n+124 }\n+125\n+126 fgrid.close();\n+127 }\n+128\n+129public:\n+130 template\n+_\b1_\b3_\b1 static void _\bw_\br_\bi_\bt_\be(const Glue& glue, const std::string& path, int\n+appendix=1)\n+132 {\n+133 std::ostringstream name0;\n+134 name0 << path;\n+135 name0 << \"/domain.surf\" << std::setw(3) << std::setfill('0') << appendix;\n+136\n+137 // Write extracted grid and remote intersection on the grid1-side\n+138 writeIntersections(glue,name0.str());\n+139\n+140 std::ostringstream name1;\n+141 name1 << path;\n+142 name1 << \"/target.surf\" << std::setw(3) << std::setfill('0') << appendix;\n+143\n+144 writeIntersections(glue, name1.str());\n+145 }\n+146\n+147};\n+148\n+149} // namespace GridGlue\n+150} // namespace Dune\n+151\n+152#endif // DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n-sequential adapter to couple two grids at specified close together boundaries\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-unsigned int IndexType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:147\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bz_\be\n-size_t size() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:393\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n-IndexType index_\n-index of this intersection after GridGlue interface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:112\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-The intersection of two entities of the two patches of a GridGlue.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:261\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:20\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bs_\bi_\bz_\be\n-SizeType size() const\n-Return total number of intersections.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n-GridGlue::IndexType IndexType\n-The type used for the indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:27\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-IndexType index(const Intersection< P0, P1, I, O > &i) const\n-Map Dune::GridGlue::Intersection to index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:34\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bn_\bd_\be_\bx_\bS_\be_\bt_\b:_\b:_\bS_\bi_\bz_\be_\bT_\by_\bp_\be\n-size_t SizeType\n-The type used for the size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectionindexset.hh:29\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n+Write remote intersections to a AmiraMesh file for debugging purposes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglueamirawriter.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be\n+static void write(const Glue &glue, const std::string &path, int appendix=1)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglueamirawriter.hh:131\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00020.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00020.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridglueamirawriter.hh File Reference \n+dune-grid-glue: intersectioniterator.hh File Reference \n \n \n \n \n \n \n \n@@ -72,41 +72,39 @@\n dune grid-glue adapter \n
\n \n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+Go to the documentation of this file. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n \n \n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n \n+\n+\n+\n+\n+\n+\n+\n \n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n \n-\n+\n \n-\n-\n-\n-\n-\n-Central component of the module implementing the coupling of two grids.
Model of the Intersection concept provided by GridGlue.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+Definition gridglue.hh:37
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
IndexType index_
index of this intersection after GridGlue interface
Definition intersection.hh:112
The intersection of two entities of the two patches of a GridGlue.
Definition intersection.hh:261
Definition intersectionindexset.hh:20
SizeType size() const
Return total number of intersections.
Definition intersectionindexset.hh:41
GridGlue::IndexType IndexType
The type used for the indices.
Definition intersectionindexset.hh:27
IndexType index(const Intersection< P0, P1, I, O > &i) const
Map Dune::GridGlue::Intersection to index.
Definition intersectionindexset.hh:34
size_t SizeType
The type used for the size.
Definition intersectionindexset.hh:29
Write remote intersections to a AmiraMesh file for debugging purposes.
Definition gridglueamirawriter.hh:21
static void write(const Glue &glue, const std::string &path, int appendix=1)
Definition gridglueamirawriter.hh:131
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,105 +1,165 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersectionindexset.hh\n+gridglueamirawriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-_\b1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n-4#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\n-5\n-6#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-7#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n-8\n-9#ifndef ONLY_SIMPLEX_INTERSECTIONS\n-10// we currently support only one intersection type. If we want to support\n-more,\n-11// we have to think about the semantics of our IndexSet\n-12#error Not Implemented\n-13#endif\n+8#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+9#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+10\n+11#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- gridglueamirawriter.hh File Reference
intersectioniterator.hh File Reference
\n \n-
\n-
\n-
\n+
\n\n \n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,27 +2,25 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-gridglueamirawriter.hh File Reference\n-Write all remote intersections to a AmiraMesh file. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n+intersectioniterator.hh File Reference\n+Implement iterators over GridGlue intersections. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n-\u00a0 Write remote intersections to a AmiraMesh file for debugging purposes.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bi_\bn_\bs_\bi_\bd_\be_\b,_\b _\bo_\bu_\bt_\bs_\bi_\bd_\be_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Write all remote intersections to a AmiraMesh file.\n+Implement iterators over GridGlue intersections.\n+ Author\n+ Christian Engwer\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00020_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00020_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridglueamirawriter.hh Source File \n+dune-grid-glue: intersectioniterator.hh Source File \n \n \n \n \n \n \n \n@@ -74,166 +74,95 @@\n \n \n \n
\n \n+ Write all remote intersections to a AmiraMesh file. \n+
Implement iterators over GridGlue intersections. \n More...
\n-#include <fstream>\n-
#include <sstream>\n-
#include <type_traits>\n+
#include <dune/grid-glue/gridglue.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::GridGlueAmiraWriter |
| Write remote intersections to a AmiraMesh file for debugging purposes. More... | |
| class | Dune::GridGlue::IntersectionIterator< P0, P1, inside, outside > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-Write all remote intersections to a AmiraMesh file.
\n+Implement iterators over GridGlue intersections.
\n+- Author
- Christian Engwer
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,27 +2,25 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-gridglueamirawriter.hh File Reference\n-Write all remote intersections to a AmiraMesh file. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n gridglueamirawriter.hh
intersectioniterator.hh
\n-Go to the documentation of this file.\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,165 +1,99 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-gridglueamirawriter.hh\n+intersectioniterator.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n+2// vi: set et ts=4 sw=2 sts=2:\n+3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-8#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n-9#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n-10\n-11#include \n-12#include \n-13#include \n+12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n+13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n 14\n-15namespace _\bD_\bu_\bn_\be {\n-16namespace GridGlue {\n-17\n-_\b2_\b0class _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n-21{\n-22\n-26 template \n-27 static void writeIntersections(const Glue& glue, const std::string&\n-filename)\n-28 {\n-29 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n+15#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+16\n+17namespace _\bD_\bu_\bn_\be {\n+18 namespace GridGlue {\n+19\n+21 template\n+_\b2_\b2 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br :\n+23 public Dune::ForwardIteratorFacade<\n+IntersectionIterator,\n+24 const Intersection >\n+25 {\n+26 public:\n+27\n+_\b2_\b8 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n+_\b2_\b9 typedef ::Dune::GridGlue::Intersection _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn;\n 30\n-31 std::ofstream fgrid;\n-32\n-33 fgrid.open(filename.c_str());\n-34\n-35 using GridView = typename Glue::template GridView;\n-36 const int dim = GridView::dimension;\n-37 const int domdimw = GridView::dimensionworld;\n-38\n-39 // coordinates have to be in R^3 in the VTK format\n-40 std::string coordinatePadding;\n-41 for (int i=domdimw; i<3; i++)\n-42 coordinatePadding += \" 0\";\n+_\b3_\b1 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be * glue, unsigned int i)\n+32 : glue_(glue),\n+33 index_(i),\n+34 intersection_(glue_, & glue_->intersections_[index_])\n+35 {}\n+36\n+_\b3_\b7 const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn& _\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be() const\n+38 {\n+39 assert((\"never dereference the end iterator\" &&\n+40 index_ != glue_->index__sz));\n+41 return intersection_;\n+42 }\n 43\n-44 int overlaps = glue.size();\n-45\n-46 if (dim==3) {\n-47\n-48 fgrid << \"# HyperSurface 0.1 ASCII \\n\" << std::endl;\n-49 fgrid<<\"\\n\";\n-50 fgrid<<\"Parameters {\\n\";\n-51 fgrid<<\" Materials {\\n\";\n-52 fgrid<<\" outside {\\n\";\n-53 fgrid<<\" Id 0\\n\";\n-54 fgrid<<\" }\\n\";\n-55 fgrid<<\" inside {\\n\";\n-56 fgrid<<\" Id 1\\n\";\n-57 fgrid<<\" }\\n\";\n-58 fgrid<<\" }\\n\";\n-59 fgrid<<\"\\n\";\n-60 fgrid<<\"}\\n\";\n+_\b4_\b4 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+45 {\n+46 intersection_ = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn(glue_, & glue_->intersections_[++index_]);\n+47 }\n+48\n+_\b4_\b9 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br& iter) const\n+50 {\n+51 return iter.index_ == index_;\n+52 }\n+53\n+54 private:\n+55\n+56 const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue_;\n+57 unsigned int index_;\n+58\n+59 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn intersection_;\n+60 };\n 61\n-62 // ////////////////////////////////////////////\n-63 // Write vertices\n-64 // ////////////////////////////////////////////\n-65\n-66 //use dim and not dim+1\n-67 fgrid<<\"\\nVertices \"<< overlaps*(dim)<<\"\\n\";\n-68 auto isEnd = glue.template iend();\n-69 for (auto isIt = glue.template ibegin(); isIt != isEnd; ++isIt)\n-70 {\n-71 const auto& geometry = isIt->geometry();\n-72 for (int i = 0; i < geometry.corners(); ++i)\n-73 fgrid << geometry.corner(i) << coordinatePadding << std::endl;\n-74 }\n-75\n-76 // ////////////////////////////////////////////\n-77 // Write triangles\n-78 // ////////////////////////////////////////////\n-79\n-80 fgrid<<\"NBranchingPoints 0\\n\";\n-81 fgrid<<\"NVerticesOnCurves 0\\n\";\n-82 fgrid<<\"BoundaryCurves 0\\n\";\n-83 fgrid<<\"Patches 1\\n\";\n-84 fgrid<<\"{\\n\";\n-85 fgrid<<\"InnerRegion inside\\n\";\n-86 fgrid<<\"OuterRegion outside\\n\";\n-87 fgrid<<\"BoundaryID 0\\n\";\n-88 fgrid<<\"BranchingPoints 0\";\n-89 fgrid<<\"\\n\";\n-90\n-91 fgrid<<\"Triangles \"<();\n-119 for (auto isIt = glue.template ibegin(); isIt != isEnd; ++isIt) {\n-120 const auto& geometry = isIt->geometry();\n-121 for (int i = 0; i <2; ++i)\n-122 fgrid << geometry.corner(i) <<\" \"<<0<<\"\\n\";\n-123 }\n-124 }\n-125\n-126 fgrid.close();\n-127 }\n-128\n-129public:\n-130 template\n-_\b1_\b3_\b1 static void _\bw_\br_\bi_\bt_\be(const Glue& glue, const std::string& path, int\n-appendix=1)\n-132 {\n-133 std::ostringstream name0;\n-134 name0 << path;\n-135 name0 << \"/domain.surf\" << std::setw(3) << std::setfill('0') << appendix;\n-136\n-137 // Write extracted grid and remote intersection on the grid1-side\n-138 writeIntersections(glue,name0.str());\n-139\n-140 std::ostringstream name1;\n-141 name1 << path;\n-142 name1 << \"/target.surf\" << std::setw(3) << std::setfill('0') << appendix;\n-143\n-144 writeIntersections(glue, name1.str());\n-145 }\n-146\n-147};\n-148\n-149} // namespace GridGlue\n-150} // namespace Dune\n-151\n-152#endif // DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+62 } // end namespace GridGlue\n+63} // end namespace Dune\n+64\n+65#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n+_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n+Central component of the module implementing the coupling of two grids.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br\n-Write remote intersections to a AmiraMesh file for debugging purposes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglueamirawriter.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\bA_\bm_\bi_\br_\ba_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be\n-static void write(const Glue &glue, const std::string &path, int appendix=1)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglueamirawriter.hh:131\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+sequential adapter to couple two grids at specified close together boundaries\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bi_\bn_\bs_\bi_\bd_\be_\b,_\b _\bo_\bu_\bt_\bs_\bi_\bd_\be_\b _\b>\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:25\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:28\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n+const Intersection & dereference() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:37\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n+void increment()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:44\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:29\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+IntersectionIterator(const GridGlue *glue, unsigned int i)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:31\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const IntersectionIterator &iter) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:49\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: intersectioniterator.hh File Reference \n+dune-grid-glue: rangegenerators.hh File Reference \n \n \n \n \n \n \n \n@@ -71,40 +71,42 @@\n \n
\n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n- 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n+Go to the documentation of this file.\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+ 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+
\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-Central component of the module implementing the coupling of two grids.
Definition gridglue.hh:37
Write remote intersections to a AmiraMesh file for debugging purposes.
Definition gridglueamirawriter.hh:21
static void write(const Glue &glue, const std::string &path, int appendix=1)
Definition gridglueamirawriter.hh:131
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
Definition intersectioniterator.hh:25
::Dune::GridGlue::GridGlue< P0, P1 > GridGlue
Definition intersectioniterator.hh:28
const Intersection & dereference() const
Definition intersectioniterator.hh:37
void increment()
Definition intersectioniterator.hh:44
::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection
Definition intersectioniterator.hh:29
IntersectionIterator(const GridGlue *glue, unsigned int i)
Definition intersectioniterator.hh:31
bool equals(const IntersectionIterator &iter) const
Definition intersectioniterator.hh:49
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,165 +1,99 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-gridglueamirawriter.hh\n+intersectioniterator.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n+2// vi: set et ts=4 sw=2 sts=2:\n+3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-8#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n-9#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n-10\n-11#include rangegenerators.hh File Reference
\n-\n-
\n+
\n\n \n
\n
\n+
\n-\n+
\n \n Implement iterators over GridGlue intersections. \n-More...
\n-#include <dune/grid-glue/gridglue.hh>\n+
#include <dune/common/iteratorrange.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::IntersectionIterator< P0, P1, inside, outside > |
| struct | Dune::GridGlue::Reverse< reverse > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n+Functions | |
| template<... > | |
| IteratorRange<... > | Dune::GridGlue::intersections (const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed) |
| Iterate over all intersections of a GridGlue. | |
Detailed Description
\n-Implement iterators over GridGlue intersections.
\n-- Author
- Christian Engwer
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,27 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-intersectioniterator.hh File Reference\n-Implement iterators over GridGlue intersections. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+rangegenerators.hh File Reference\n+#include \n- \n+ \n
\n intersectioniterator.hh
rangegenerators.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,99 +1,88 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersectioniterator.hh\n+rangegenerators.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n-13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n-14\n-15#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-16\n-17namespace _\bD_\bu_\bn_\be {\n-18 namespace GridGlue {\n+3#ifndef DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n+4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n+5\n+6#include \n+7\n+8namespace _\bD_\bu_\bn_\be {\n+9namespace GridGlue {\n+10\n+14template\n+_\b1_\b5struct _\bR_\be_\bv_\be_\br_\bs_\be\n+16 : std::integral_constant\n+17{\n+_\b1_\b8 typedef _\bR_\be_\bv_\be_\br_\bs_\be _\bt_\by_\bp_\be;\n 19\n-21 template\n-_\b2_\b2 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br :\n-23 public Dune::ForwardIteratorFacade<\n-IntersectionIterator,\n-24 const Intersection >\n-25 {\n-26 public:\n-27\n-_\b2_\b8 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n-_\b2_\b9 typedef ::Dune::GridGlue::Intersection _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn;\n-30\n-_\b3_\b1 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be * glue, unsigned int i)\n-32 : glue_(glue),\n-33 index_(i),\n-34 intersection_(glue_, & glue_->intersections_[index_])\n-35 {}\n-36\n-_\b3_\b7 const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn& _\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be() const\n-38 {\n-39 assert((\"never dereference the end iterator\" &&\n-40 index_ != glue_->index__sz));\n-41 return intersection_;\n-42 }\n-43\n-_\b4_\b4 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-45 {\n-46 intersection_ = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn(glue_, & glue_->intersections_[++index_]);\n-47 }\n-48\n-_\b4_\b9 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br& iter) const\n-50 {\n-51 return iter.index_ == index_;\n-52 }\n-53\n-54 private:\n-55\n-56 const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue_;\n-57 unsigned int index_;\n-58\n-59 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn intersection_;\n-60 };\n-61\n-62 } // end namespace GridGlue\n-63} // end namespace Dune\n-64\n-65#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n-_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n-Central component of the module implementing the coupling of two grids.\n+20 constexpr\n+_\b2_\b1 _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b!_\br_\be_\bv_\be_\br_\bs_\be_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!() const\n+22 { return {}; }\n+23};\n+24\n+25#ifdef DOXYGEN\n+26\n+_\b3_\b1const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bt_\br_\bu_\be_\b> _\br_\be_\bv_\be_\br_\bs_\be_\bd;\n+32\n+66template<...>\n+67IteratorRange<...>\n+_\b6_\b8_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b<_\b._\b._\b._\b>& glue, const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b._\b._\b._\b>& reverse =\n+!reversed);\n+69\n+70#else\n+71\n+72namespace {\n+73const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bt_\br_\bu_\be_\b> reversed = {};\n+74} /* namespace */\n+75\n+76template\n+77IteratorRange< typename GridGlue::template\n+IntersectionIterator >\n+78_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(const GridGlue& glue, const Reverse& = {})\n+79{\n+80 const static int side = reverse ? 1 : 0;\n+81 return {glue.template ibegin(), glue.template iend()};\n+82}\n+83\n+84#endif // DOXYGEN\n+85\n+86} /* namespace GridGlue */\n+87} /* namespace Dune */\n+88\n+89#endif\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n+> &reverse=!reversed)\n+Iterate over all intersections of a GridGlue.\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n sequential adapter to couple two grids at specified close together boundaries\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bi_\bn_\bs_\bi_\bd_\be_\b,_\b _\bo_\bu_\bt_\bs_\bi_\bd_\be_\b _\b>\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:25\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n-::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:28\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-const Intersection & dereference() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n-void increment()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:44\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:29\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-IntersectionIterator(const GridGlue *glue, unsigned int i)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:31\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n-bool equals(const IntersectionIterator &iter) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersectioniterator.hh:49\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n+IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n+> &reverse=!reversed)\n+Iterate over all intersections of a GridGlue.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:17\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\br_\be_\bv_\be_\br_\bs_\be_\bd\n+const Reverse< true > reversed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:31\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\bt_\by_\bp_\be\n+Reverse type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:18\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!\n+constexpr Reverse operator!() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:21\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00026.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00026.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: rangegenerators.hh File Reference \n+dune-grid-glue: intersection.hh File Reference \n \n \n \n \n \n \n \n@@ -72,41 +72,73 @@\n dune grid-glue adapter \n
\n \n \n+ \n-\n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n- 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n+Go to the documentation of this file. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+ 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-Central component of the module implementing the coupling of two grids.
\n+\n+\n+
\n+\n+Definition gridglue.hh:37
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
Definition intersectioniterator.hh:25
::Dune::GridGlue::GridGlue< P0, P1 > GridGlue
Definition intersectioniterator.hh:28
const Intersection & dereference() const
Definition intersectioniterator.hh:37
void increment()
Definition intersectioniterator.hh:44
::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection
Definition intersectioniterator.hh:29
IntersectionIterator(const GridGlue *glue, unsigned int i)
Definition intersectioniterator.hh:31
bool equals(const IntersectionIterator &iter) const
Definition intersectioniterator.hh:49
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Definition rangegenerators.hh:17
constexpr Reverse<!reverse > operator!() const
Definition rangegenerators.hh:21
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,99 +1,88 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-intersectioniterator.hh\n+rangegenerators.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n-13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n-14\n-15#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n-16\n-17namespace _\bD_\bu_\bn_\be {\n-18 namespace GridGlue {\n+3#ifndef DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n+4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n+5\n+6#include intersection.hh File Reference
\n-
\n+\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n
\n-
\n+\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,46 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-rangegenerators.hh File Reference\n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n+intersection.hh File Reference\n+Model of the Intersection concept provided by GridGlue. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b _\br_\be_\bv_\be_\br_\bs_\be_\b _\b>\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b _\b>\n+\u00a0 storage class for _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn related data _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bi_\bn_\bs_\bi_\bd_\be_\b,_\b _\bo_\bu_\bt_\bs_\bi_\bd_\be_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\b _\bP_\b0_\b,_\b _\bP_\b1_\b,_\b _\bI_\b,_\b _\bO_\b _\b>\n+\u00a0 The intersection of two entities of the two patches of a _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template<... >\n-IteratorRange<... >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs (const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be<... > &glue,\n- const _\bR_\be_\bv_\be_\br_\bs_\be<... > &reverse=!reversed)\n-\u00a0 Iterate over all intersections of a _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be.\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bO_\bN_\bL_\bY_\b__\bS_\bI_\bM_\bP_\bL_\bE_\bX_\b__\bI_\bN_\bT_\bE_\bR_\bS_\bE_\bC_\bT_\bI_\bO_\bN_\bS\n \u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+Model of the Intersection concept provided by GridGlue.\n+ Author\n+ Christian Engwer\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0O\bON\bNL\bLY\bY_\b_S\bSI\bIM\bMP\bPL\bLE\bEX\bX_\b_I\bIN\bNT\bTE\bER\bRS\bSE\bEC\bCT\bTI\bIO\bON\bNS\bS *\b**\b**\b**\b**\b*\n+#define ONLY_SIMPLEX_INTERSECTIONS\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00026_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00026_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: rangegenerators.hh Source File \n+dune-grid-glue: intersection.hh Source File \n \n \n \n \n \n \n \n@@ -74,78 +74,578 @@\n \n \n
\n #include <dune/common/iteratorrange.hh>\n+\n+
Model of the Intersection concept provided by GridGlue. \n+More...
\n+#include <algorithm>\n+
#include <optional>\n+
#include <tuple>\n+
#include <dune/common/deprecated.hh>\n+
#include <dune/common/version.hh>\n+
#include <dune/geometry/affinegeometry.hh>\n+
#include <dune/geometry/referenceelements.hh>\n+
#include <dune/grid-glue/gridglue.hh>\n
Go to the source code of this file.
\n\n Classes | |
| struct | Dune::GridGlue::Reverse< reverse > |
| class | Dune::GridGlue::IntersectionData< P0, P1 > |
| storage class for Dune::GridGlue::Intersection related data More... | |
| struct | Dune::GridGlue::IntersectionTraits< P0, P1, inside, outside > |
| class | Dune::GridGlue::Intersection< P0, P1, I, O > |
| The intersection of two entities of the two patches of a GridGlue. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n-Functions | |
| template<... > | |
| IteratorRange<... > | Dune::GridGlue::intersections (const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed) |
| Iterate over all intersections of a GridGlue. | |
\n+Macros | |
| #define | ONLY_SIMPLEX_INTERSECTIONS |
Detailed Description
\n+Model of the Intersection concept provided by GridGlue.
\n+- Author
- Christian Engwer
Macro Definition Documentation
\n+\n+◆ ONLY_SIMPLEX_INTERSECTIONS
\n+\n+\n+
\n \n+ \n+
\n+
| #define ONLY_SIMPLEX_INTERSECTIONS | \n+
\n+\n+
\n+\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,46 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-rangegenerators.hh File Reference\n-#include \n- \n+ \n
\n rangegenerators.hh
intersection.hh
\n-Go to the documentation of this file.\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,88 +1,752 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-rangegenerators.hh\n+intersection.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n+2// vi: set et ts=4 sw=2 sts=2:\n+3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n-4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n-5\n-6#include \n-7\n-8namespace _\bD_\bu_\bn_\be {\n-9namespace GridGlue {\n-10\n-14template\n-_\b1_\b5struct _\bR_\be_\bv_\be_\br_\bs_\be\n-16 : std::integral_constant\n-17{\n-_\b1_\b8 typedef _\bR_\be_\bv_\be_\br_\bs_\be _\bt_\by_\bp_\be;\n-19\n-20 constexpr\n-_\b2_\b1 _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b!_\br_\be_\bv_\be_\br_\bs_\be_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!() const\n-22 { return {}; }\n-23};\n-24\n-25#ifdef DOXYGEN\n-26\n-_\b3_\b1const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bt_\br_\bu_\be_\b> _\br_\be_\bv_\be_\br_\bs_\be_\bd;\n+11#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n+12#define DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n+13\n+14#include \n+15#include \n+16#include \n+17\n+18#include \n+19#include \n+20#include \n+21#include \n+22#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh>\n+23\n+_\b2_\b4#define ONLY_SIMPLEX_INTERSECTIONS\n+25\n+26namespace _\bD_\bu_\bn_\be {\n+27 namespace GridGlue {\n+28\n+29 // forward declaration\n+30 template\n+31 class IntersectionIndexSet;\n 32\n-66template<...>\n-67IteratorRange<...>\n-_\b6_\b8_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b<_\b._\b._\b._\b>& glue, const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\b._\b._\b._\b>& reverse =\n-!reversed);\n+36 template\n+_\b3_\b7 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n+38 {\n+39 public:\n+_\b4_\b0 typedef ::Dune::GridGlue::GridGlue _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n+41\n+_\b4_\b2 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be;\n+43\n+_\b4_\b5 static constexpr int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd;\n+46\n+47 private:\n+48 // intermediate quantities\n+49 template\n+50 static constexpr int dim() { return GridGlue::template GridView::\n+Grid::dimension - GridGlue::template GridPatch::codim; }\n+51\n+52 public:\n+_\b5_\b4 static constexpr int _\bm_\by_\bd_\bi_\bm = dim<0>() < dim<1>() ? dim<0>() : dim<1>();\n+55\n+56 template\n+_\b5_\b7 using _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = AffineGeometry<\n+58 typename GridGlue::template GridView::ctype, _\bm_\by_\bd_\bi_\bm, GridGlue::template\n+GridView::dimension>;\n+59\n+_\b6_\b0 using _\bG_\br_\bi_\bd_\b0_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridLocalGeometry<0>\n+instead\")]] = _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b0_\b>;\n+_\b6_\b1 using _\bG_\br_\bi_\bd_\b1_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridLocalGeometry<1>\n+instead\")]] = _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b1_\b>;\n+62\n+63 template\n+_\b6_\b4 using _\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by = AffineGeometry<\n+65 typename GridGlue::template GridView::ctype, _\bm_\by_\bd_\bi_\bm, GridGlue::template\n+GridView::dimensionworld>;\n+66\n+_\b6_\b7 using _\bG_\br_\bi_\bd_\b0_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridGeometry<0> instead\")]] =\n+_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b0_\b>;\n+_\b6_\b8 using _\bG_\br_\bi_\bd_\b1_\bG_\be_\bo_\bm_\be_\bt_\br_\by [[deprecated(\"please use GridGeometry<1> instead\")]] =\n+_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b1_\b>;\n 69\n-70#else\n-71\n-72namespace {\n-73const _\bR_\be_\bv_\be_\br_\bs_\be_\b<_\bt_\br_\bu_\be_\b> reversed = {};\n-74} /* namespace */\n+70 template\n+_\b7_\b1 using _\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be = typename GridGlue::template GridView::IndexSet::\n+IndexType;\n+72\n+_\b7_\b3 using _\bG_\br_\bi_\bd_\b0_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be [[deprecated(\"please use GridIndexType<0> instead\")]] =\n+_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\b<_\b0_\b>;\n+_\b7_\b4 using _\bG_\br_\bi_\bd_\b1_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be [[deprecated(\"please use GridIndexType<1> instead\")]] =\n+_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\b<_\b1_\b>;\n 75\n-76template\n-77IteratorRange< typename GridGlue::template\n-IntersectionIterator >\n-78_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(const GridGlue& glue, const Reverse& = {})\n-79{\n-80 const static int side = reverse ? 1 : 0;\n-81 return {glue.template ibegin(), glue.template iend()};\n-82}\n+77 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned int mergeindex, unsigned int\n+offset, bool grid0local, bool grid1local);\n+78\n+_\b8_\b0 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba() = default;\n+81\n+82 /* Accessor Functions */\n 83\n-84#endif // DOXYGEN\n-85\n-86} /* namespace GridGlue */\n-87} /* namespace Dune */\n-88\n-89#endif\n+84 template\n+_\b8_\b5 const _\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bs_\bi_\bd_\be_\b>& _\bl_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by(unsigned int parentId = 0)\n+const\n+86 { return *std::get(sideData_).gridlocalgeom[parentId]; }\n+87\n+88 template\n+_\b8_\b9 const _\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bs_\bi_\bd_\be_\b>& _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n+90 { return *std::get(sideData_).gridgeom; }\n+91\n+92 template\n+_\b9_\b3 bool _\bl_\bo_\bc_\ba_\bl() const\n+94 { return std::get(sideData_).gridlocal; }\n+95\n+96 template\n+_\b9_\b7 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bi_\bn_\bd_\be_\bx(unsigned int parentId = 0) const\n+98 { return std::get(sideData_).gridindices[parentId]; }\n+99\n+100 template\n+_\b1_\b0_\b1 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bp_\ba_\br_\be_\bn_\bt_\bs() const\n+102 { return std::get(sideData_).gridindices.size(); }\n+103\n+104 private:\n+105 template\n+106 void initializeGeometry(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned mergeindex);\n+107\n+108 /* M E M B E R V A R I A B L E S */\n+109\n+110 public:\n+_\b1_\b1_\b2 _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bi_\bn_\bd_\be_\bx_\b_;\n+113\n+114 private:\n+115 template\n+116 struct SideData {\n+118 bool gridlocal = false;\n+119\n+121 std::vector< GridIndexType > gridindices;\n+122\n+124 std::vector< std::optional< GridLocalGeometry > > gridlocalgeom;\n+125\n+133 std::optional< GridGeometry > gridgeom;\n+134 };\n+135\n+136 std::tuple< SideData<0>, SideData<1> > sideData_;\n+137 };\n+138\n+139 template\n+140 template\n+141 void IntersectionData::initializeGeometry(const GridGlue& glue,\n+unsigned mergeindex)\n+142 {\n+143 auto& data = std::get(sideData_);\n+144\n+145 const unsigned n_parents = glue.merger_->template parents\n+(mergeindex);\n+146\n+147 // init containers\n+148 data.gridindices.resize(n_parents);\n+149 data.gridlocalgeom.resize(n_parents);\n+150\n+151 // default values\n+152 data.gridindices[0] = 0;\n+153\n+154 static constexpr int nSimplexCorners = mydim + 1;\n+155 using ctype = typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\bt_\by_\bp_\be;\n+156\n+157 // initialize the local and the global geometries of grid `side`\n+158\n+159 // compute the coordinates of the subface's corners in codim 0 entity local\n+coordinates\n+160 static constexpr int elementdim = GridGlue::template GridView::\n+template Codim<0>::Geometry::mydimension;\n+161\n+162 // coordinates within the subentity that contains the remote intersection\n+163 std::array() >, nSimplexCorners>\n+corners_subEntity_local;\n+164\n+165 for (unsigned int par = 0; par < n_parents; ++par) {\n+166 for (int i = 0; i < nSimplexCorners; ++i)\n+167 corners_subEntity_local[i] = glue.merger_->template parentLocal\n+(mergeindex, i, par);\n+168\n+169 // Coordinates of the remote intersection corners wrt the element\n+coordinate system\n+170 std::array, nSimplexCorners>\n+corners_element_local;\n+171\n+172 if (data.gridlocal) {\n+173 data.gridindices[par] = glue.merger_->template parent\n+(mergeindex,par);\n+174\n+175 typename GridGlue::template GridPatch::LocalGeometry\n+176 gridLocalGeometry = glue.template patch().geometryLocal\n+(data.gridindices[par]);\n+177 for (std::size_t i=0; i::Geometry\n+196 gridWorldGeometry = glue.template patch().geometry(data.gridindices\n+[par]);\n+197\n+198 // world coordinates of the remote intersection corners\n+199 std::array::\n+dimensionworld>, nSimplexCorners> corners_global;\n+200\n+201 for (std::size_t i=0; i\n+_\b2_\b1_\b3 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be& glue, unsigned\n+int mergeindex, unsigned int offset,\n+214 bool grid0local, bool grid1local)\n+215 : index_(mergeindex+offset)\n+216 {\n+217 // if an invalid index is given do not proceed!\n+218 // (happens when the parent GridGlue initializes the \"end\"-Intersection)\n+219 assert (0 <= mergeindex || mergeindex < glue.index__sz);\n+220\n+221 std::get<0>(sideData_).gridlocal = grid0local;\n+222 std::get<1>(sideData_).gridlocal = grid1local;\n+223\n+224 initializeGeometry<0>(glue, mergeindex);\n+225 initializeGeometry<1>(glue, mergeindex);\n+226 }\n+227\n+232 template\n+_\b2_\b3_\b3 struct _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs\n+234 {\n+_\b2_\b3_\b5 using _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be = _\b:_\b:_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>;\n+_\b2_\b3_\b6 using _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba = _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b<_\bP_\b0_\b,_\b _\bP_\b1_\b>;\n+237\n+_\b2_\b3_\b8 using _\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw = typename GridGlue::template GridView;\n+_\b2_\b3_\b9 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw = typename GridGlue::template GridView;\n+240\n+_\b2_\b4_\b1 using _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n+GridLocalGeometry;\n+_\b2_\b4_\b2 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n+GridLocalGeometry;\n+243\n+_\b2_\b4_\b4 using _\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template GridGeometry;\n+_\b2_\b4_\b5 using _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by = typename IntersectionData::template\n+GridGeometry;\n+246\n+_\b2_\b4_\b7 static constexpr auto _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm;\n+_\b2_\b4_\b8 static constexpr auto _\bm_\by_\bd_\bi_\bm = _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bm_\by_\bd_\bi_\bm;\n+_\b2_\b4_\b9 static constexpr int _\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = inside;\n+_\b2_\b5_\b0 static constexpr int _\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = outside;\n+251\n+_\b2_\b5_\b2 using _\bc_\bt_\by_\bp_\be = typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\bt_\by_\bp_\be;\n+_\b2_\b5_\b3 using _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = Dune::FieldVector;\n+_\b2_\b5_\b4 using _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = Dune::FieldVector;\n+255 };\n+256\n+259 template\n+_\b2_\b6_\b0 class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+261 {\n+262\n+263 public:\n+264\n+_\b2_\b6_\b5 typedef _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bI_\b,_\bO_\b> _\bT_\br_\ba_\bi_\bt_\bs;\n+266\n+_\b2_\b6_\b7 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be;\n+_\b2_\b6_\b8 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba;\n+269\n+270\n+_\b2_\b7_\b1 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw _\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw;\n+_\b2_\b7_\b2 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+273\n+_\b2_\b7_\b4 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw;\n+_\b2_\b7_\b5 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+_\b2_\b7_\b6 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+277\n+_\b2_\b7_\b8 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+_\b2_\b7_\b9 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be _\bc_\bt_\by_\bp_\be;\n+280\n+_\b2_\b8_\b1 typedef typename InsideGridView::Traits::template Codim<0>::Entity\n+_\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by;\n+_\b2_\b8_\b2 typedef typename OutsideGridView::Traits::template Codim<0>::Entity\n+_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by;\n+283\n+_\b2_\b8_\b4 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+_\b2_\b8_\b5 typedef typename _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+286\n+_\b2_\b8_\b8 static constexpr auto _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm;\n+289\n+_\b2_\b9_\b1 static constexpr auto _\bm_\by_\bd_\bi_\bm = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bm_\by_\bd_\bi_\bm;\n+292\n+_\b2_\b9_\b4 static constexpr int _\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh;\n+295\n+_\b2_\b9_\b7 static constexpr int _\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh = _\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh;\n+298\n+299 // typedef unsigned int IndexType;\n+300\n+301 private:\n+305 static constexpr int codimensionWorld = _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm - _\bm_\by_\bd_\bi_\bm;\n+306\n+307 public:\n+308 /* C O N S T R U C T O R S */\n+309\n+_\b3_\b1_\b1 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn(const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue, const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba* i) :\n+312 glue_(glue), i_(i) {}\n+313\n+314 /* F U N C T I O N A L I T Y */\n+315\n+318 _\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n+_\b3_\b1_\b9 _\bi_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n+320 {\n+321 assert(_\bs_\be_\bl_\bf());\n+322 return glue_->template patch().element(i_->template index(parentId));\n+323 }\n+324\n+327 _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n+_\b3_\b2_\b8 _\bo_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n+329 {\n+330 assert(_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br());\n+331 return glue_->template patch().element(i_->template index(parentId));\n+332 }\n+333\n+_\b3_\b3_\b5 bool _\bc_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg() const\n+336 {\n+337 throw Dune::NotImplemented();\n+338 }\n+339\n+_\b3_\b4_\b2 const _\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0)\n+const\n+343 {\n+344 return i_->template localGeometry(parentId);\n+345 }\n+346\n+_\b3_\b4_\b9 const _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0)\n+const\n+350 {\n+351 return i_->template localGeometry(parentId);\n+352 }\n+353\n+_\b3_\b6_\b0 const _\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n+361 {\n+362 return i_->template geometry();\n+363 }\n+364\n+_\b3_\b7_\b1 const _\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by& _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bO_\bu_\bt_\bs_\bi_\bd_\be() const // DUNE_DEPRECATED\n+372 {\n+373 return i_->template geometry();\n+374 }\n+375\n+_\b3_\b7_\b7 Dune::GeometryType _\bt_\by_\bp_\be() const\n+378 {\n+379 #ifdef ONLY_SIMPLEX_INTERSECTIONS\n+380 # if DUNE_VERSION_NEWER(DUNE_GEOMETRY, 2, 6)\n+381 return Dune::GeometryTypes::simplex(_\bm_\by_\bd_\bi_\bm);\n+382 # else\n+383 static const Dune::GeometryType _\bt_\by_\bp_\be(Dune::GeometryType::simplex, _\bm_\by_\bd_\bi_\bm);\n+384 return _\bt_\by_\bp_\be;\n+385 # endif\n+386 #else\n+387 #error Not Implemented\n+388 #endif\n+389 }\n+390\n+391\n+_\b3_\b9_\b3 bool _\bs_\be_\bl_\bf() const\n+394 {\n+395 return i_->template local();\n+396 }\n+397\n+_\b3_\b9_\b9 size_t _\bn_\be_\bi_\bg_\bh_\bb_\bo_\br(unsigned int g = 0) const\n+400 {\n+401 if (g == 0 && i_->template local()) {\n+402 return i_->template parents();\n+403 } else if (g == 1 && i_->template local()) {\n+404 return i_->template parents();\n+405 }\n+406 return 0;\n+407 }\n+408\n+_\b4_\b1_\b0 int _\bi_\bn_\bd_\be_\bx_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n+411 {\n+412 assert(_\bs_\be_\bl_\bf());\n+413 return glue_->template patch().indexInInside(i_->template index\n+(parentId));\n+414 }\n+415\n+_\b4_\b1_\b7 int _\bi_\bn_\bd_\be_\bx_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be(unsigned int parentId = 0) const\n+418 {\n+419 assert(_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br());\n+420 return glue_->template patch().indexInInside(i_->template index\n+(parentId));\n+421 }\n+422\n+_\b4_\b2_\b7 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n+428 {\n+429 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be normal;\n+430\n+431 if (codimensionWorld == 0)\n+432 DUNE_THROW(Dune::Exception, \"There is no normal vector to a full-\n+dimensional intersection\");\n+433 else if (codimensionWorld == 1) {\n+434 /* TODO: Implement the general n-ary cross product here */\n+435 const auto jacobianTransposed = _\bg_\be_\bo_\bm_\be_\bt_\br_\by().jacobianTransposed(local);\n+436 if (_\bm_\by_\bd_\bi_\bm==1) {\n+437 normal[0] = - jacobianTransposed[0][1];\n+438 normal[1] = jacobianTransposed[0][0];\n+439 } else if (_\bm_\by_\bd_\bi_\bm==2) {\n+440 normal[0] = (jacobianTransposed[0][1] * jacobianTransposed[1][2] -\n+jacobianTransposed[0][2] * jacobianTransposed[1][1]);\n+441 normal[1] = - (jacobianTransposed[0][0] * jacobianTransposed[1][2] -\n+jacobianTransposed[0][2] * jacobianTransposed[1][0]);\n+442 normal[2] = (jacobianTransposed[0][0] * jacobianTransposed[1][1] -\n+jacobianTransposed[0][1] * jacobianTransposed[1][0]);\n+443 } else\n+444 DUNE_THROW(Dune::NotImplemented, \"Remote intersections don't implement the\n+'outerNormal' method for \" << _\bm_\by_\bd_\bi_\bm << \"-dimensional intersections yet\");\n+445 } else\n+446 DUNE_THROW(Dune::NotImplemented, \"Remote intersections don't implement the\n+'outerNormal' method for intersections with codim >= 2 yet\");\n+447\n+448 return normal;\n+449 }\n+450\n+_\b4_\b5_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n+456 {\n+457 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be normal = _\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(local);\n+458 normal /= normal.two_norm();\n+459 return normal;\n+460 }\n+461\n+_\b4_\b6_\b6 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local) const\n+467 {\n+468 return (_\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(local) *= _\bg_\be_\bo_\bm_\be_\bt_\br_\by().integrationElement(local));\n+469 }\n+470\n+_\b4_\b7_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br_\bU_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl () const\n+476 {\n+477 return _\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(ReferenceElements::general(_\bt_\by_\bp_\be\n+()).position(0,0));\n+478 }\n+479\n+_\b4_\b8_\b3 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bO_\b,_\bI_\b> _\bf_\bl_\bi_\bp() const\n+484 {\n+485 return _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b<_\bP_\b0_\b,_\bP_\b1_\b,_\bO_\b,_\bI_\b>(glue_,i_);\n+486 }\n+487\n+488#ifdef QUICKHACK_INDEX\n+489 typedef typename _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be IndexType;\n+490\n+491 IndexType index() const\n+492 {\n+493 return i_->_\bi_\bn_\bd_\be_\bx_\b_;\n+494 }\n+495\n+496#endif\n+497\n+498 private:\n+499\n+500 friend class IntersectionIndexSet;\n+501\n+502 /* M E M B E R V A R I A B L E S */\n+503\n+505 const _\bG_\br_\bi_\bd_\bG_\bl_\bu_\be* glue_;\n+506\n+508 const _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba* i_;\n+509 };\n+510\n+511\n+512 } // end namespace GridGlue\n+513} // end namespace Dune\n+514\n+515#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTION_HH\n+_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\b._\bh_\bh\n+Central component of the module implementing the coupling of two grids.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n sequential adapter to couple two grids at specified close together boundaries\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:17\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\br_\be_\bv_\be_\br_\bs_\be_\bd\n-const Reverse< true > reversed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:31\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\bt_\by_\bp_\be\n-Reverse type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:18\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bR_\be_\bv_\be_\br_\bs_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!\n-constexpr Reverse operator!() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangegenerators.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+unsigned int IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:147\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bc_\bt_\by_\bp_\be\n+PromotionTraits< typenameGridView< 0 >::ctype, typenameGridView< 1 >::ctype >::\n+PromotedType ctype\n+The type used for coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:171\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd\n+static constexpr int dimworld\n+export the world dimension This is the maximum of the extractors' world\n+dimensions.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:166\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n+storage class for Dune::GridGlue::Intersection related data\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:38\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+GridGlue::IndexType IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:42\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim,\n+GridGlue::template GridView< side >::dimensionworld > GridGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:65\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bl_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+const GridLocalGeometry< side > & localGeometry(unsigned int parentId=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n+static constexpr int coorddim\n+Dimension of the world space of the intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:45\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+GridGeometry< 0 > Grid0Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+typename GridGlue::template GridView< side >::IndexSet::IndexType GridIndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+IndexType index(unsigned int parentId=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:97\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bp_\ba_\br_\be_\bn_\bt_\bs\n+IndexType parents() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:101\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+GridLocalGeometry< 1 > Grid1LocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n+const GridGeometry< side > & geometry() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:89\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+bool local() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:93\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:40\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bm_\by_\bd_\bi_\bm\n+static constexpr int mydim\n+Dimension of the intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim,\n+GridGlue::template GridView< side >::dimension > GridLocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:58\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+GridLocalGeometry< 0 > Grid0LocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:60\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n+IndexType index_\n+index of this intersection after GridGlue interface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:112\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+GridIndexType< 1 > Grid1IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:74\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b1_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+GridGeometry< 1 > Grid1Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bG_\br_\bi_\bd_\b0_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+GridIndexType< 0 > Grid0IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:73\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n+IntersectionData()=default\n+Default Constructor.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+The intersection of two entities of the two patches of a GridGlue.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:261\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Traits::OutsideLocalGeometry OutsideLocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bf_\bl_\bi_\bp\n+Intersection< P0, P1, O, I > flip() const\n+Return a copy of the intersection with inside and outside switched.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:483\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg\n+bool conforming() const\n+Return true if intersection is conforming.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:335\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n+InsideGridView::Traits::template Codim< 0 >::Entity InsideEntity\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:281\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+Traits::GridGlue GridGlue\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bd_\be_\bx_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be\n+int indexInOutside(unsigned int parentId=0) const\n+Local number of codim 1 entity in outside() Entity where intersection is\n+contained in.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:417\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bd_\be_\bx_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be\n+int indexInInside(unsigned int parentId=0) const\n+Local number of codim 1 entity in the inside() Entity where intersection is\n+contained in.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:410\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\be_\bl_\bf\n+bool self() const\n+For parallel computations: Return true if inside() entity exists locally.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:393\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bm_\by_\bd_\bi_\bm\n+static constexpr auto mydim\n+dimension of the intersection\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:291\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n+static constexpr int outsidePatch\n+outside patch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:297\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\by_\bp_\be\n+Dune::GeometryType type() const\n+Type of reference element for this intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:377\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be\n+InsideEntity inside(unsigned int parentId=0) const\n+Return element on the inside of this intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:319\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Traits::LocalCoordinate LocalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:284\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bO_\bu_\bt_\bs_\bi_\bd_\be\n+const OutsideLocalGeometry & geometryInOutside(unsigned int parentId=0) const\n+Geometric information about this intersection in local coordinates of the\n+outside() element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:349\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bu_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n+GlobalCoordinate unitOuterNormal(const LocalCoordinate &local) const\n+Return a unit outer normal.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:455\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bt_\by_\bp_\be\n+Traits::ctype ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:279\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs\n+IntersectionTraits< P0, P1, I, O > Traits\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:265\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\ba_\bt_\ba\n+Traits::IntersectionData IntersectionData\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:268\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Traits::GlobalCoordinate GlobalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:285\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Traits::OutsideGeometry OutsideGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:276\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bn_\be_\bi_\bg_\bh_\bb_\bo_\br\n+size_t neighbor(unsigned int g=0) const\n+Return number of embeddings into local grid0 (grid1) entities.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:399\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+Intersection(const GridGlue *glue, const IntersectionData *i)\n+Constructor for a given Dataset.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:311\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n+static constexpr int insidePatch\n+inside patch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:294\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Traits::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:278\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bE_\bn_\bt_\bi_\bt_\by\n+OutsideGridView::Traits::template Codim< 0 >::Entity OutsideEntity\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:282\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be\n+OutsideEntity outside(unsigned int parentId=0) const\n+Return element on the outside of this intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:328\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n+const Geometry & geometry() const\n+Geometric information about this intersection as part of the inside grid.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Traits::InsideLocalGeometry InsideLocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:272\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n+GlobalCoordinate outerNormal(const LocalCoordinate &local) const\n+Return an outer normal (length not necessarily 1)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:427\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bO_\bu_\bt_\bs_\bi_\bd_\be\n+const OutsideGeometry & geometryOutside() const\n+Geometric information about this intersection as part of the outside grid.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:371\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n+Traits::OutsideGridView OutsideGridView\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:274\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n+GlobalCoordinate integrationOuterNormal(const LocalCoordinate &local) const\n+Return an outer normal with the length of the integration element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:466\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n+Traits::InsideGridView InsideGridView\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:271\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bI_\bn_\bI_\bn_\bs_\bi_\bd_\be\n+const InsideLocalGeometry & geometryInInside(unsigned int parentId=0) const\n+Geometric information about this intersection in local coordinates of the\n+inside() element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:342\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\be_\bn_\bt_\be_\br_\bU_\bn_\bi_\bt_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n+GlobalCoordinate centerUnitOuterNormal() const\n+Unit outer normal at the center of the intersection.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:475\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n+static constexpr auto coorddim\n+dimension of the world space of the intersection\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:288\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:234\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bi_\bn_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n+static constexpr int insidePatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:249\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Dune::FieldVector< ctype, mydim > LocalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:253\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm\n+static constexpr auto coorddim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:247\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+typename IntersectionData::template GridGeometry< outside > OutsideGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:245\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be\n+typename GridGlue::ctype ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:252\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n+typename GridGlue::template GridView< outside > OutsideGridView\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:239\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Dune::FieldVector< ctype, coorddim > GlobalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:254\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bO_\bu_\bt_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+typename IntersectionData::template GridLocalGeometry< outside >\n+OutsideLocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:242\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n+typename GridGlue::template GridView< inside > InsideGridView\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:238\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+typename IntersectionData::template GridGeometry< inside > Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:244\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bI_\bn_\bs_\bi_\bd_\be_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+typename IntersectionData::template GridLocalGeometry< inside >\n+InsideLocalGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:241\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bo_\bu_\bt_\bs_\bi_\bd_\be_\bP_\ba_\bt_\bc_\bh\n+static constexpr int outsidePatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:250\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bm_\by_\bd_\bi_\bm\n+static constexpr auto mydim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn intersection.hh:248\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projectionwriter_impl.hh File Reference \n+dune-grid-glue: projection_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -72,59 +72,47 @@\n dune grid-glue common \n
\n \n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n- 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n+Go to the documentation of this file.\n-\n-\n-
\n-\n-\n+\n+\n \n-\n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+ 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 50 static constexpr int dim() { return GridGlue::template GridView<side>::Grid::dimension - GridGlue::template GridPatch<side>::codim; }
\n+\n+\n+\n+\n+\n+\n+ 58 typename GridGlue::template GridView<side>::ctype, mydim, GridGlue::template GridView<side>::dimension>;
\n+\n+ 60 using Grid0LocalGeometry [[deprecated("please use GridLocalGeometry<0> instead")]] = GridLocalGeometry<0>;
\n+ 61 using Grid1LocalGeometry [[deprecated("please use GridLocalGeometry<1> instead")]] = GridLocalGeometry<1>;
\n+\n+\n+\n+ 65 typename GridGlue::template GridView<side>::ctype, mydim, GridGlue::template GridView<side>::dimensionworld>;
\n+\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n+ 77 IntersectionData(const GridGlue& glue, unsigned int mergeindex, unsigned int offset, bool grid0local, bool grid1local);
\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 160 static constexpr int elementdim = GridGlue::template GridView<side>::template Codim<0>::Geometry::mydimension;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 199 std::array<Dune::FieldVector<ctype, GridGlue::template GridView<side>::dimensionworld>, nSimplexCorners> corners_global;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+ 213 IntersectionData<P0, P1>::IntersectionData(const GridGlue& glue, unsigned int mergeindex, unsigned int offset,
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+ 440 normal[0] = (jacobianTransposed[0][1] * jacobianTransposed[1][2] - jacobianTransposed[0][2] * jacobianTransposed[1][1]);
\n+ 441 normal[1] = - (jacobianTransposed[0][0] * jacobianTransposed[1][2] - jacobianTransposed[0][2] * jacobianTransposed[1][0]);
\n+ 442 normal[2] = (jacobianTransposed[0][0] * jacobianTransposed[1][1] - jacobianTransposed[0][1] * jacobianTransposed[1][0]);
\n+\n+ 444 DUNE_THROW(Dune::NotImplemented, "Remote intersections don't implement the 'outerNormal' method for " << mydim << "-dimensional intersections yet");
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+Central component of the module implementing the coupling of two grids.
Definition gridglue.hh:37
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
sequential adapter to couple two grids at specified close together boundaries
Definition gridglue.hh:67
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Definition rangegenerators.hh:17
constexpr Reverse<!reverse > operator!() const
Definition rangegenerators.hh:21
PromotionTraits< typenameGridView< 0 >::ctype, typenameGridView< 1 >::ctype >::PromotedType ctype
The type used for coordinates.
Definition gridglue.hh:171
static constexpr int dimworld
export the world dimension This is the maximum of the extractors' world dimensions.
Definition gridglue.hh:166
storage class for Dune::GridGlue::Intersection related data
Definition intersection.hh:38
GridGlue::IndexType IndexType
Definition intersection.hh:42
AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim, GridGlue::template GridView< side >::dimensionworld > GridGeometry
Definition intersection.hh:65
const GridLocalGeometry< side > & localGeometry(unsigned int parentId=0) const
Definition intersection.hh:85
static constexpr int coorddim
Dimension of the world space of the intersection.
Definition intersection.hh:45
GridGeometry< 0 > Grid0Geometry
Definition intersection.hh:67
typename GridGlue::template GridView< side >::IndexSet::IndexType GridIndexType
Definition intersection.hh:71
IndexType index(unsigned int parentId=0) const
Definition intersection.hh:97
GridLocalGeometry< 1 > Grid1LocalGeometry
Definition intersection.hh:61
const GridGeometry< side > & geometry() const
Definition intersection.hh:89
::Dune::GridGlue::GridGlue< P0, P1 > GridGlue
Definition intersection.hh:40
static constexpr int mydim
Dimension of the intersection.
Definition intersection.hh:54
AffineGeometry< typename GridGlue::template GridView< side >::ctype, mydim, GridGlue::template GridView< side >::dimension > GridLocalGeometry
Definition intersection.hh:58
GridLocalGeometry< 0 > Grid0LocalGeometry
Definition intersection.hh:60
IndexType index_
index of this intersection after GridGlue interface
Definition intersection.hh:112
GridIndexType< 1 > Grid1IndexType
Definition intersection.hh:74
GridGeometry< 1 > Grid1Geometry
Definition intersection.hh:68
GridIndexType< 0 > Grid0IndexType
Definition intersection.hh:73
The intersection of two entities of the two patches of a GridGlue.
Definition intersection.hh:261
Traits::OutsideLocalGeometry OutsideLocalGeometry
Definition intersection.hh:275
Intersection< P0, P1, O, I > flip() const
Return a copy of the intersection with inside and outside switched.
Definition intersection.hh:483
bool conforming() const
Return true if intersection is conforming.
Definition intersection.hh:335
InsideGridView::Traits::template Codim< 0 >::Entity InsideEntity
Definition intersection.hh:281
int indexInOutside(unsigned int parentId=0) const
Local number of codim 1 entity in outside() Entity where intersection is contained in.
Definition intersection.hh:417
int indexInInside(unsigned int parentId=0) const
Local number of codim 1 entity in the inside() Entity where intersection is contained in.
Definition intersection.hh:410
bool self() const
For parallel computations: Return true if inside() entity exists locally.
Definition intersection.hh:393
static constexpr auto mydim
dimension of the intersection
Definition intersection.hh:291
static constexpr int outsidePatch
outside patch
Definition intersection.hh:297
Dune::GeometryType type() const
Type of reference element for this intersection.
Definition intersection.hh:377
InsideEntity inside(unsigned int parentId=0) const
Return element on the inside of this intersection.
Definition intersection.hh:319
Traits::LocalCoordinate LocalCoordinate
Definition intersection.hh:284
const OutsideLocalGeometry & geometryInOutside(unsigned int parentId=0) const
Geometric information about this intersection in local coordinates of the outside() element.
Definition intersection.hh:349
GlobalCoordinate unitOuterNormal(const LocalCoordinate &local) const
Return a unit outer normal.
Definition intersection.hh:455
IntersectionTraits< P0, P1, I, O > Traits
Definition intersection.hh:265
Traits::IntersectionData IntersectionData
Definition intersection.hh:268
Traits::GlobalCoordinate GlobalCoordinate
Definition intersection.hh:285
Traits::OutsideGeometry OutsideGeometry
Definition intersection.hh:276
size_t neighbor(unsigned int g=0) const
Return number of embeddings into local grid0 (grid1) entities.
Definition intersection.hh:399
Intersection(const GridGlue *glue, const IntersectionData *i)
Constructor for a given Dataset.
Definition intersection.hh:311
static constexpr int insidePatch
inside patch
Definition intersection.hh:294
OutsideGridView::Traits::template Codim< 0 >::Entity OutsideEntity
Definition intersection.hh:282
OutsideEntity outside(unsigned int parentId=0) const
Return element on the outside of this intersection.
Definition intersection.hh:328
const Geometry & geometry() const
Geometric information about this intersection as part of the inside grid.
Definition intersection.hh:360
Traits::InsideLocalGeometry InsideLocalGeometry
Definition intersection.hh:272
GlobalCoordinate outerNormal(const LocalCoordinate &local) const
Return an outer normal (length not necessarily 1)
Definition intersection.hh:427
const OutsideGeometry & geometryOutside() const
Geometric information about this intersection as part of the outside grid.
Definition intersection.hh:371
Traits::OutsideGridView OutsideGridView
Definition intersection.hh:274
GlobalCoordinate integrationOuterNormal(const LocalCoordinate &local) const
Return an outer normal with the length of the integration element.
Definition intersection.hh:466
Traits::InsideGridView InsideGridView
Definition intersection.hh:271
const InsideLocalGeometry & geometryInInside(unsigned int parentId=0) const
Geometric information about this intersection in local coordinates of the inside() element.
Definition intersection.hh:342
GlobalCoordinate centerUnitOuterNormal() const
Unit outer normal at the center of the intersection.
Definition intersection.hh:475
static constexpr auto coorddim
dimension of the world space of the intersection
Definition intersection.hh:288
Definition intersection.hh:234
static constexpr int insidePatch
Definition intersection.hh:249
Dune::FieldVector< ctype, mydim > LocalCoordinate
Definition intersection.hh:253
static constexpr auto coorddim
Definition intersection.hh:247
typename IntersectionData::template GridGeometry< outside > OutsideGeometry
Definition intersection.hh:245
typename GridGlue::ctype ctype
Definition intersection.hh:252
typename GridGlue::template GridView< outside > OutsideGridView
Definition intersection.hh:239
Dune::FieldVector< ctype, coorddim > GlobalCoordinate
Definition intersection.hh:254
typename IntersectionData::template GridLocalGeometry< outside > OutsideLocalGeometry
Definition intersection.hh:242
typename GridGlue::template GridView< inside > InsideGridView
Definition intersection.hh:238
typename IntersectionData::template GridGeometry< inside > Geometry
Definition intersection.hh:244
typename IntersectionData::template GridLocalGeometry< inside > InsideLocalGeometry
Definition intersection.hh:241
static constexpr int outsidePatch
Definition intersection.hh:250
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,88 +1,752 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\ba_\bd_\ba_\bp_\bt_\be_\br\n-rangegenerators.hh\n+intersection.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n+2// vi: set et ts=4 sw=2 sts=2:\n+3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n-4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n-5\n-6#include \n \n+ \n
\n \n Namespaces |\n Functions
\n- projectionwriter_impl.hh File Reference
projection_impl.hh File Reference
\n-
\n+
\n+
\n\n \n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,59 +2,43 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-projectionwriter_impl.hh File Reference\n-#include \n+projection_impl.hh File Reference\n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs (const\n- _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const Corners &corners, std::\n- ostream &out)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const\n- _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const Normals &normals, std::\n- ostream &out)\n+template\n+ Coordinate\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bc_\bo_\br_\bn_\be_\br (unsigned c)\n+\u00a0\n+std::pair< unsigned, unsigned >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs (unsigned edge)\n \u00a0\n template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate >\n- &projection, const Corners &corners, std::ostream &out)\n+ Corners::value_type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be (const Coordinate &x, const\n+ Corners &corners)\n \u00a0\n template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate >\n- &projection, const Normals &normals, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs (const\n- _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n- Corners &corners, const Normals &normals, std::ostream &out)\n-\u00a0 write projection in VTK format\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n- Corners &corners, const Normals &normals, const std::string &filename)\n-\u00a0 write projection in VTK format\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n- Corners &corners, const Normals &normals)\n-\u00a0 Print information about the projection to std::cout stream.\n+ Normals::value_type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const Coordinate &x,\n+ const Normals &normals)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bi_\bn_\bs_\bi_\bd_\be (const Coordinate &x, const Field\n+ &epsilon)\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projectionwriter_impl.hh Source File \n+dune-grid-glue: projection_impl.hh Source File \n \n \n \n \n \n \n \n@@ -74,211 +74,464 @@\n \n \n
\n #include <fstream>\n+
#include <dune/common/fmatrix.hh>\n+
#include <cmath>\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::ProjectionWriterImplementation |
| namespace | Dune::GridGlue::ProjectionImplementation |
\n Functions | |
| template<unsigned side, typename Coordinate , typename Corners > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_points (const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out) |
| template<unsigned side, typename Coordinate , typename Normals > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_normals (const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out) |
| template<typename Coordinate , typename Corners > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_points (const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out) |
| template<typename Coordinate , typename Normals > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_normals (const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out) |
| template<unsigned side, typename Coordinate > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_success (const Projection< Coordinate > &projection, std::ostream &out) |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, const std::string &filename) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::print (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals) |
| Print information about the projection to std::cout stream. | |
| template<typename Coordinate , typename Field > | |
| Coordinate | Dune::GridGlue::ProjectionImplementation::corner (unsigned c) |
| std::pair< unsigned, unsigned > | Dune::GridGlue::ProjectionImplementation::edgeToCorners (unsigned edge) |
| template<typename Coordinate , typename Corners > | |
| Corners::value_type | Dune::GridGlue::ProjectionImplementation::interpolate (const Coordinate &x, const Corners &corners) |
| template<typename Coordinate , typename Normals > | |
| Normals::value_type | Dune::GridGlue::ProjectionImplementation::interpolate_unit_normals (const Coordinate &x, const Normals &normals) |
| template<typename Coordinate , typename Field > | |
| bool | Dune::GridGlue::ProjectionImplementation::inside (const Coordinate &x, const Field &epsilon) |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,59 +2,43 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-projectionwriter_impl.hh File Reference\n-#include \n- \n+ \n
\n projectionwriter_impl.hh
projection_impl.hh
\n Go to the documentation of this file.\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n+\n
\n \n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n+\n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n \n-\n-
\n+\n+\n+\n+\n \n-
\n-\n-\n- 11void write_points(const Projection<Coordinate>& projection, const Corners& corners, std::ostream& out)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n 27void write_normals(const Projection<Coordinate>& projection, const Normals& normals, std::ostream& out)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n
\n-\n-\n+\n+\n \n-
\n-\n-\n- 43void write_edge_intersection_points(const Projection<Coordinate>& projection, const Corners& corners, std::ostream& out)
\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 56void write_edge_intersection_normals(const Projection<Coordinate>& projection, const Normals& normals, std::ostream& out)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+ 104 out << "CELLS " << (8 + numberOfEdgeIntersections) << " " << (26 + 3 * numberOfEdgeIntersections) << "\\n";
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+ 149::doProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n+\n+\n+\n+ 153 * \u03a6(x\u1d62) = (1-\u03b1-\u03b2) y\u2080 + \u03b1 y\u2081 + \u03b2 y\u2082 = x\u1d62 + \u03b4 n\u1d62
\n+ 154 * or \u03b1 (y\u2081 - y\u2080) + \u03b2 (y\u2082 - y\u2080) - \u03b4 n\u1d62 = x\u1d62 - y\u2080
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 227 const bool feasible = projectionFeasible(origin[i], origin_normals[i], y, target, target_normals);
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 241::doInverseProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 302 const bool feasible = projectionFeasible(target_corners[i], get<1>(normals)[i], preimages[i], get<0>(corners), get<0>(normals));
\n+\n+\n+\n+\n+\n+\n+\n+\n+ 311::doEdgeIntersection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 336 \u03a6(x\u1d62) + \u03b1 (\u03a6(x\u2c7c) - \u03a6(x\u1d62)) = y\u2096 + \u03b2 (y\u2097 - y\u2096)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 438::projectionFeasible(const Coordinate& x, const Coordinate& nx, const Coordinate& px, const Corners& corners, const Normals& normals) const
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n 469::project(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n+\n+\n+\n+\n+\n+Definition gridglue.hh:37
void write(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out)
write projection in VTK format
Definition projectionwriter_impl.hh:86
void print(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals)
Print information about the projection to std::cout stream.
Definition projectionwriter_impl.hh:140
void write_normals(const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out)
Definition projectionwriter_impl.hh:27
void write_points(const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out)
Definition projectionwriter_impl.hh:11
void write_success(const Projection< Coordinate > &projection, std::ostream &out)
Definition projectionwriter_impl.hh:72
void write_edge_intersection_points(const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out)
Definition projectionwriter_impl.hh:43
void write_edge_intersection_normals(const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out)
Definition projectionwriter_impl.hh:56
Corners::value_type interpolate(const Coordinate &x, const Corners &corners)
Definition projection_impl.hh:70
bool inside(const Coordinate &x, const Field &epsilon)
Definition projection_impl.hh:111
std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)
Definition projection_impl.hh:43
Coordinate corner(unsigned c)
Definition projection_impl.hh:24
Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals &normals)
Definition projection_impl.hh:91
Projection of a line (triangle) on another line (triangle).
Definition projection.hh:21
const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const
Indicate whether projection (inverse projection) is valid for each corner or not.
Definition projection.hh:252
unsigned numberOfEdgeIntersections() const
Number of edge intersections.
Definition projection.hh:262
const std::tuple< Images, Preimages > & images() const
Images and preimages of corners.
Definition projection.hh:235
const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections() const
Edge-edge intersections.
Definition projection.hh:273
Coordinate::field_type Field
Scalar type.
Definition projection.hh:61
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,238 +1,480 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projectionwriter_impl.hh\n+projection_impl.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#include \n \n+ \n
\n \n Namespaces |\n Functions
\n- areawriter.hh File Reference
projectionwriter.hh File Reference
\n-
\n+
\n
\n-
\n+
\n+
\n\n \n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,31 +2,36 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-areawriter.hh File Reference\n-#include \n+projectionwriter.hh File Reference\n+#include \n #include \n-#include \"_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+#include \"_\bp_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, std::ostream &out)\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals, std::ostream &out)\n+\u00a0 write projection in VTK format\n \u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n- &filename)\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals, const std::string &filename)\n+\u00a0 write projection in VTK format\n \u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n- &base)\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals)\n+\u00a0 Print information about the projection to std::cout stream.\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00032_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00032_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: areawriter.hh Source File \n+dune-grid-glue: projectionwriter.hh Source File \n \n \n \n \n \n \n \n@@ -74,47 +74,57 @@\n \n \n
\n #include <ostream>\n+
#include <iostream>\n
#include <string>\n-
#include "areawriter_impl.hh"\n+
#include <dune/grid-glue/common/projection.hh>\n+
#include "projectionwriter_impl.hh"\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n Functions | |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, const std::string &filename) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::print (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals) |
| Print information about the projection to std::cout stream. | |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,31 +2,36 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-areawriter.hh File Reference\n-#include \n- \n+ \n
\n areawriter.hh
projectionwriter.hh
\n Go to the documentation of this file.\n-\n-\n+\n+\n
\n \n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n+\n+\n \n-\n+\n \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n Definition gridglue.hh:37
void write_glue_area_vtk(const Glue &glue, std::ostream &out)
Definition areawriter_impl.hh:84
void write_glue_areas_vtk(const Glue &glue, const std::string &base)
Definition areawriter_impl.hh:129
void write(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out)
write projection in VTK format
Definition projectionwriter_impl.hh:86
void print(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals)
Print information about the projection to std::cout stream.
Definition projectionwriter_impl.hh:140
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,48 +1,62 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-areawriter.hh\n+projectionwriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n-4#define DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n+3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n+4#define DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n 5\n-6#include \n \n- \n+ \n
\n ringcomm.hh File Reference
areawriter.hh File Reference
\n-
\n-
\n-
\n-
\n-
\n-
\n+\n\n
\n-
\n
\n-\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,39 +1,32 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-ringcomm.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+areawriter.hh File Reference\n+#include \n+#include \n+#include \"_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bC_\bh_\be_\bc_\bk_\bM_\bP_\bI_\bS_\bt_\ba_\bt_\bu_\bs(A, B)\u00a0\u00a0\u00a0{}\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\b:_\b:_\bM_\bP_\bI_\b__\bA_\bl_\bl_\bA_\bp_\bp_\bl_\by (MPI_Comm mpicomm, OP &&op, const Args &...\n- data)\n-\u00a0 apply an operator locally to a difstributed data set\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, std::ostream &out)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n+ &filename)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n+ &base)\n \u00a0\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0C\bCh\bhe\bec\bck\bkM\bMP\bPI\bIS\bSt\bta\bat\btu\bus\bs *\b**\b**\b**\b**\b*\n-#define CheckMPIStatus ( \u00a0 A,\n- \u00a0 B\u00a0\n- ) \u00a0\u00a0\u00a0{}\n- _\bT\bT_\bo\bo_\bd\bd_\bo\bo_\b:\b:\n- Implement MPI Status check with exception handling\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00035_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00035_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: ringcomm.hh Source File \n+dune-grid-glue: areawriter.hh Source File \n \n \n \n \n \n \n \n@@ -74,309 +74,47 @@\n \n \n
\n #include <mpi.h>\n-
#include <functional>\n-
#include <utility>\n-
#include <dune/common/fvector.hh>\n-
#include <dune/common/hybridutilities.hh>\n-
#include <dune/geometry/type.hh>\n+\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::Parallel |
| namespace | Dune::GridGlue |
\n-Macros | |
| #define | CheckMPIStatus(A, B) {} |
\n Functions | |
| template<typename OP , typename... Args> | |
| void | Dune::Parallel::MPI_AllApply (MPI_Comm mpicomm, OP &&op, const Args &... data) |
| apply an operator locally to a difstributed data set | |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
Macro Definition Documentation
\n-\n-◆ CheckMPIStatus
\n-\n-\n-
\n \n- \n-
\n-
| #define CheckMPIStatus | \n-( | \n-\n- | A, | \n-
| \n- | \n- | \n- | B | \n-
| \n- | ) | \n-{} | \n-
\n-
\n-- Todo:
- Implement MPI Status check with exception handling
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,39 +1,32 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-ringcomm.hh File Reference\n-#include \n- \n+ \n
\n ringcomm.hh
areawriter.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,308 +1,48 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-ringcomm.hh\n+areawriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-5/* IMPLEMENTATION OF CLASS G R I D G L U E */\n-6\n-_\b8#define CheckMPIStatus(A,B) {}\n-9\n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16\n-17#include \n-18\n-19namespace _\bD_\bu_\bn_\be {\n-_\b2_\b0namespace Parallel {\n-21\n-22 namespace Impl {\n-23\n-25 template\n-26 struct MPITypeInfo {};\n-27\n-28 template<>\n-29 struct MPITypeInfo< int >\n-30 {\n-31 static const unsigned int size = 1;\n-32 static inline MPI_Datatype getType()\n-33 {\n-34 return MPI_INT;\n-35 }\n-36 };\n-37\n-38 template\n-39 struct MPITypeInfo< _\bD_\bu_\bn_\be::FieldVector >\n-40 {\n-41 static const unsigned int size = N;\n-42 static inline MPI_Datatype getType()\n-43 {\n-44 return Dune::MPITraits::getType();\n-45 }\n-46 };\n-47\n-48 template<>\n-49 struct MPITypeInfo< unsigned int >\n-50 {\n-51 static const unsigned int size = 1;\n-52 static inline MPI_Datatype getType()\n-53 {\n-54 return MPI_UNSIGNED;\n-55 }\n-56 };\n-57\n-58 template<>\n-59 struct MPITypeInfo< _\bD_\bu_\bn_\be::GeometryType >\n-60 {\n-61 static const unsigned int size = 1;\n-62 static inline MPI_Datatype getType()\n-63 {\n-64 return Dune::MPITraits< Dune::GeometryType >::getType();\n-65 }\n-66 };\n-67\n-68 template\n-69 void MPI_SetVectorSize(\n-70 std::vector & data,\n-71 MPI_Status & status)\n-72 {\n-73 typedef MPITypeInfo Info;\n-74 int sz;\n-75 MPI_Get_count(&status, Info::getType(), &sz);\n-76 assert(sz%Info::size == 0);\n-77 data.resize(sz/Info::size);\n-78 }\n-79\n-89 template\n-90 void MPI_SendVectorInRing(\n-91 std::vector & data,\n-92 std::vector & next,\n-93 int tag,\n-94 int rightrank,\n-95 int leftrank,\n-96 MPI_Comm comm,\n-97 MPI_Request& r_send,\n-98 MPI_Request& r_recv\n-99 )\n-100 {\n-101 // mpi status stuff\n-102 [[maybe_unused]] int result = 0;\n-103 typedef MPITypeInfo Info;\n-104 // resize next buffer to maximum size\n-105 next.resize(next.capacity());\n-106 // send data (explicitly send data.size elements)\n-107 result =\n-108 MPI_Isend(\n-109 &(data[0]), Info::size*data.size(), Info::getType(), rightrank, tag,\n-110 comm, &r_send);\n-111 // receive up to maximum size. The acutal size is stored in the status\n-112 result =\n-113 MPI_Irecv(\n-114 &(next[0]), Info::size*next.size(), Info::getType(), leftrank, tag,\n-115 comm, &r_recv);\n-116 // // check result\n-117 // MPI_Status status;\n-118 // CheckMPIStatus(result, status);\n-119 }\n-120\n-121 template\n-122 using ptr_t = T*;\n-123\n-124 /* these helper structs are needed as long as we still support\n-125 C++11, as we can't use variadic lambdas */\n-126 template\n-127 struct call_MPI_SendVectorInRing\n-128 {\n-129 std::tuple & remotedata;\n-130 std::tuple & nextdata;\n-131 int & tag;\n-132 int & rightrank;\n-133 int & leftrank;\n-134 MPI_Comm & mpicomm;\n-135 std::array & requests_send;\n-136 std::array & requests_recv;\n-137\n-138 template\n-139 void operator()(I i)\n-140 {\n-141 MPI_SendVectorInRing(\n-142 std::get(remotedata),\n-143 std::get(nextdata),\n-144 tag+i,\n-145 rightrank, leftrank, mpicomm,\n-146 requests_send[i],\n-147 requests_recv[i]);\n-148 }\n-149 };\n-150 template\n-151 struct call_MPI_SetVectorSize\n-152 {\n-153 std::tuple & nextdata;\n-154 std::array & status_recv;\n-155\n-156 template\n-157 void operator()(I i)\n-158 {\n-159 MPI_SetVectorSize(std::get(nextdata),status_recv[i]);\n-160 }\n-161 };\n-162\n-163 template\n-164 void MPI_AllApply_impl(MPI_Comm mpicomm,\n-165 OP && op,\n-166 std::index_sequence indices,\n-167 const Args&... data)\n-168 {\n-169 constexpr std::size_t N = sizeof...(Args);\n-170 int myrank = 0;\n-171 int commsize = 0;\n-172#if HAVE_MPI\n-173 MPI_Comm_rank(mpicomm, &myrank);\n-174 MPI_Comm_size(mpicomm, &commsize);\n-175#endif // HAVE_MPI\n-176\n-177 if (commsize > 1)\n-178 {\n-179#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n-180 std::cout << myrank << \" Start Communication, size \" << commsize << std::\n-endl;\n-181#endif\n-182\n-183 // get data sizes\n-184 std::array size({ ((unsigned int)data.size())... });\n-185\n-186 // communicate max data size\n-187 std::array maxSize;\n-188 MPI_Allreduce(&size, &maxSize,\n-189 size.size(), MPI_UNSIGNED, MPI_MAX, mpicomm);\n-190#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n-191 std::cout << myrank << \" maxSize \" << \"done... \" << std::endl;\n-192#endif\n-193\n-194 // allocate receiving buffers with maxsize to ensure sufficient buffer size\n-for communication\n-195 std::tuple remotedata { Args(maxSize[Indices])... };\n-196\n-197 // copy local data to receiving buffer\n-198 remotedata = std::tie(data...);\n-199\n-200 // allocate second set of receiving buffers necessary for async\n-communication\n-201 std::tuple nextdata { Args(maxSize[Indices])... };\n-202\n-203 // communicate data in the ring\n-204 int rightrank = (myrank + 1 + commsize) % commsize;\n-205 int leftrank = (myrank - 1 + commsize) % commsize;\n-206\n-207 std::cout << myrank << \": size = \" << commsize << std::endl;\n-208 std::cout << myrank << \": left = \" << leftrank\n-209 << \" right = \" << rightrank << std::endl;\n-210\n-211 // currently the remote data is our own data\n-212 int remoterank = myrank;\n-213\n-214 for (int i=1; i requests_send;\n-223 std::array requests_recv;\n-224\n-225 int tag = 0;\n-226 Dune::Hybrid::forEach(indices,\n-227 // [&](auto i){\n-228 // MPI_SendVectorInRing(\n-229 // std::get(remotedata),\n-230 // std::get(nextdata),\n-231 // tag+i,\n-232 // rightrank, leftrank, mpicomm,\n-233 // requests_send[i],\n-234 // requests_recv[i]);\n-235 // });\n-236 call_MPI_SendVectorInRing({\n-237 remotedata,\n-238 nextdata,\n-239 tag,\n-240 rightrank, leftrank, mpicomm,\n-241 requests_send,\n-242 requests_recv\n-243 }));\n-244\n-245 // apply operator\n-246 op(remoterank,std::get(remotedata)...);\n-247\n-248 // wait for communication to finalize\n-249 std::array status_send;\n-250 std::array status_recv;\n-251 MPI_Waitall(N,&requests_recv[0],&status_recv[0]);\n-252\n-253 // we finished receiving from nextrank and thus remoterank = nextrank\n-254 remoterank = nextrank;\n-255\n-256 // get current data sizes\n-257 // and resize vectors\n-258 Dune::Hybrid::forEach(indices,\n-259 // [&](auto i){\n-260 // MPI_SetVectorSize(std::get(nextdata),status_recv[i]);\n-261 // });\n-262 call_MPI_SetVectorSize({\n-263 nextdata, status_recv\n-264 }));\n-265\n-266 MPI_Waitall(N,&requests_send[0],&status_send[0]);\n-267\n-268 // swap the communication buffers\n-269 std::swap(remotedata,nextdata);\n-270 }\n-271\n-272 // last apply (or the only one in the case of sequential application)\n-273 op(remoterank,std::get(remotedata)...);\n-274 }\n-275 else // sequential\n-276 {\n-277 op(myrank,data...);\n-278 }\n-279 }\n-280\n-281 } // end namespace Impl\n-282\n-296template\n-_\b2_\b9_\b7void _\bM_\bP_\bI_\b__\bA_\bl_\bl_\bA_\bp_\bp_\bl_\by(MPI_Comm mpicomm,\n-298 OP && op,\n-299 const Args& ... data)\n-300{\n-301 Impl::MPI_AllApply_impl(\n-302 mpicomm,\n-303 std::forward(op),\n-304 std::make_index_sequence(),\n-305 data...\n-306 );\n-307}\n-308\n-309} // end namespace Parallel\n-310} // end namespace Dune\n+3#ifndef DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n+4#define DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n+5\n+6#include \n+7#include \n+8\n+9namespace _\bD_\bu_\bn_\be {\n+10namespace GridGlue {\n+11\n+12template\n+13void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk(const Glue& glue, std::ostream& out);\n+14\n+15template\n+16void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk(const Glue& glue, const std::string& filename);\n+17\n+37template\n+38void _\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk(const Glue& glue, const std::string& base);\n+39\n+40} /* namespace GridGlue */\n+41} /* namespace Dune */\n+42\n+43#include \"_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\"\n+44\n+45#endif\n+_\ba_\br_\be_\ba_\bw_\br_\bi_\bt_\be_\br_\b__\bi_\bm_\bp_\bl_\b._\bh_\bh\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gridglue.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\b:_\b:_\bM_\bP_\bI_\b__\bA_\bl_\bl_\bA_\bp_\bp_\bl_\by\n-void MPI_AllApply(MPI_Comm mpicomm, OP &&op, const Args &... data)\n-apply an operator locally to a difstributed data set\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ringcomm.hh:297\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk\n+void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn areawriter_impl.hh:84\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk\n+void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn areawriter_impl.hh:129\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projection_impl.hh File Reference \n+dune-grid-glue: projectionwriter_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -72,47 +72,59 @@\n dune grid-glue common \n
\n \n \n-\n-\n-\n+\n+\n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n- 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n+Go to the documentation of this file.\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+ 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n Definition gridglue.hh:37
void MPI_AllApply(MPI_Comm mpicomm, OP &&op, const Args &... data)
apply an operator locally to a difstributed data set
Definition ringcomm.hh:297
void write_glue_area_vtk(const Glue &glue, std::ostream &out)
Definition areawriter_impl.hh:84
void write_glue_areas_vtk(const Glue &glue, const std::string &base)
Definition areawriter_impl.hh:129
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,308 +1,48 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-ringcomm.hh\n+areawriter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n+2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-5/* IMPLEMENTATION OF CLASS G R I D G L U E */\n-6\n-_\b8#define CheckMPIStatus(A,B) {}\n-9\n-10#include \n \n+ \n
\n \n Namespaces |\n Functions
\n- projection_impl.hh File Reference
projectionwriter_impl.hh File Reference
\n-
\n-
\n+
\n\n \n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,43 +2,59 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-projection_impl.hh File Reference\n-#include \n-#include \n+projectionwriter_impl.hh File Reference\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n- Coordinate\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bc_\bo_\br_\bn_\be_\br (unsigned c)\n-\u00a0\n-std::pair< unsigned, unsigned >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\be_\bd_\bg_\be_\bT_\bo_\bC_\bo_\br_\bn_\be_\br_\bs (unsigned edge)\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bp_\bo_\bi_\bn_\bt_\bs (const\n+ _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const Corners &corners, std::\n+ ostream &out)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const\n+ _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const Normals &normals, std::\n+ ostream &out)\n \u00a0\n template\n- Corners::value_type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be (const Coordinate &x, const\n- Corners &corners)\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bp_\bo_\bi_\bn_\bt_\bs (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate >\n+ &projection, const Corners &corners, std::ostream &out)\n \u00a0\n template\n- Normals::value_type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\b__\bu_\bn_\bi_\bt_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const Coordinate &x,\n- const Normals &normals)\n-\u00a0\n-template\n- bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bi_\bn_\bs_\bi_\bd_\be (const Coordinate &x, const Field\n- &epsilon)\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bw_\br_\bi_\bt_\be_\b__\be_\bd_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b__\bn_\bo_\br_\bm_\ba_\bl_\bs (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate >\n+ &projection, const Normals &normals, std::ostream &out)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs (const\n+ _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, std::ostream &out)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals, std::ostream &out)\n+\u00a0 write projection in VTK format\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals, const std::string &filename)\n+\u00a0 write projection in VTK format\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt (const _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn< Coordinate > &projection, const\n+ Corners &corners, const Normals &normals)\n+\u00a0 Print information about the projection to std::cout stream.\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projection_impl.hh Source File \n+dune-grid-glue: projectionwriter_impl.hh Source File \n \n \n \n \n \n \n \n@@ -74,464 +74,211 @@\n \n \n
\n #include <dune/common/fmatrix.hh>\n-
#include <cmath>\n+
#include <fstream>\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::ProjectionImplementation |
| namespace | Dune::GridGlue::ProjectionWriterImplementation |
\n Functions | |
| template<typename Coordinate , typename Field > | |
| Coordinate | Dune::GridGlue::ProjectionImplementation::corner (unsigned c) |
| std::pair< unsigned, unsigned > | Dune::GridGlue::ProjectionImplementation::edgeToCorners (unsigned edge) |
| template<typename Coordinate , typename Corners > | |
| Corners::value_type | Dune::GridGlue::ProjectionImplementation::interpolate (const Coordinate &x, const Corners &corners) |
| template<typename Coordinate , typename Normals > | |
| Normals::value_type | Dune::GridGlue::ProjectionImplementation::interpolate_unit_normals (const Coordinate &x, const Normals &normals) |
| template<typename Coordinate , typename Field > | |
| bool | Dune::GridGlue::ProjectionImplementation::inside (const Coordinate &x, const Field &epsilon) |
| template<unsigned side, typename Coordinate , typename Corners > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_points (const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out) |
| template<unsigned side, typename Coordinate , typename Normals > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_normals (const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out) |
| template<typename Coordinate , typename Corners > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_points (const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out) |
| template<typename Coordinate , typename Normals > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_normals (const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out) |
| template<unsigned side, typename Coordinate > | |
| void | Dune::GridGlue::ProjectionWriterImplementation::write_success (const Projection< Coordinate > &projection, std::ostream &out) |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::write (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, const std::string &filename) |
| write projection in VTK format | |
| template<typename Coordinate , typename Corners , typename Normals > | |
| void | Dune::GridGlue::print (const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals) |
| Print information about the projection to std::cout stream. | |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,43 +2,59 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-projection_impl.hh File Reference\n-#include \n- \n+ \n
\n projection_impl.hh
projectionwriter_impl.hh
\n Go to the documentation of this file.\n+\n+\n+
\n+\n+\n \n-\n-\n-\n-\n-\n- 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n+\n \n-\n-\n-\n-\n+\n+\n+\n+\n+\n \n-
\n+\n+\n+\n-\n-\n-\n-\n-
\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+
\n+\n+\n+ 11void write_points(const Projection<Coordinate>& projection, const Corners& corners, std::ostream& out)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n 27void write_normals(const Projection<Coordinate>& projection, const Normals& normals, std::ostream& out)
\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n+
\n-\n-\n-\n- 43void write_edge_intersection_points(const Projection<Coordinate>& projection, const Corners& corners, std::ostream& out)
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+ 56void write_edge_intersection_normals(const Projection<Coordinate>& projection, const Normals& normals, std::ostream& out)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n 104 out << "CELLS " << (8 + numberOfEdgeIntersections) << " " << (26 + 3 * numberOfEdgeIntersections) << "\\n";
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+ 149::doProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n-\n-\n-\n- 153 * \u03a6(x\u1d62) = (1-\u03b1-\u03b2) y\u2080 + \u03b1 y\u2081 + \u03b2 y\u2082 = x\u1d62 + \u03b4 n\u1d62
\n- 154 * or \u03b1 (y\u2081 - y\u2080) + \u03b2 (y\u2082 - y\u2080) - \u03b4 n\u1d62 = x\u1d62 - y\u2080
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 227 const bool feasible = projectionFeasible(origin[i], origin_normals[i], y, target, target_normals);
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 241::doInverseProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 302 const bool feasible = projectionFeasible(target_corners[i], get<1>(normals)[i], preimages[i], get<0>(corners), get<0>(normals));
\n-\n-\n-\n-\n-\n-\n-\n-\n- 311::doEdgeIntersection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 336 \u03a6(x\u1d62) + \u03b1 (\u03a6(x\u2c7c) - \u03a6(x\u1d62)) = y\u2096 + \u03b2 (y\u2097 - y\u2096)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 438::projectionFeasible(const Coordinate& x, const Coordinate& nx, const Coordinate& px, const Corners& corners, const Normals& normals) const
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n 469::project(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n-\n-\n-\n-\n-\n-Definition gridglue.hh:37
Corners::value_type interpolate(const Coordinate &x, const Corners &corners)
Definition projection_impl.hh:70
bool inside(const Coordinate &x, const Field &epsilon)
Definition projection_impl.hh:111
std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)
Definition projection_impl.hh:43
Coordinate corner(unsigned c)
Definition projection_impl.hh:24
Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals &normals)
Definition projection_impl.hh:91
void write(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out)
write projection in VTK format
Definition projectionwriter_impl.hh:86
void print(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals)
Print information about the projection to std::cout stream.
Definition projectionwriter_impl.hh:140
void write_normals(const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out)
Definition projectionwriter_impl.hh:27
void write_points(const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out)
Definition projectionwriter_impl.hh:11
void write_success(const Projection< Coordinate > &projection, std::ostream &out)
Definition projectionwriter_impl.hh:72
void write_edge_intersection_points(const Projection< Coordinate > &projection, const Corners &corners, std::ostream &out)
Definition projectionwriter_impl.hh:43
void write_edge_intersection_normals(const Projection< Coordinate > &projection, const Normals &normals, std::ostream &out)
Definition projectionwriter_impl.hh:56
Projection of a line (triangle) on another line (triangle).
Definition projection.hh:21
Coordinate::field_type Field
Scalar type.
Definition projection.hh:61
const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const
Indicate whether projection (inverse projection) is valid for each corner or not.
Definition projection.hh:252
unsigned numberOfEdgeIntersections() const
Number of edge intersections.
Definition projection.hh:262
const std::tuple< Images, Preimages > & images() const
Images and preimages of corners.
Definition projection.hh:235
const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections() const
Edge-edge intersections.
Definition projection.hh:273
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,480 +1,238 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projection_impl.hh\n+projectionwriter_impl.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#include crossproduct.hh File Reference
\n-\n+\n \n-
\n
\n+
\n
\n \n Go to the source code of this file.
\n\n-Classes | |
| class | Dune::GridGlue::Projection< Coordinate > |
| Projection of a line (triangle) on another line (triangle). More... | |
| struct | Dune::GridGlue::Projection< Coordinate >::EdgeIntersection |
| Intersection between two edges of a triangle. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n+Functions | |
| template<class T , int dim> | |
| static Dune::FieldVector< T, dim > | Dune::GridGlue::crossProduct (const Dune::FieldVector< T, dim > &a, const Dune::FieldVector< T, dim > &b) |
| compute cross product | |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,24 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-projection.hh File Reference\n-#include \n- \n+ \n
\n projection.hh
crossproduct.hh
\n Go to the documentation of this file.\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n
\n \n 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-dune-grid-glue-exception
\n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 134 void doProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals);
\n-\n-\n- 145 void doInverseProjection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals);
\n-\n-\n- 156 void doEdgeIntersection(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals);
\n-\n-\n- 184 inline bool projectionFeasible(const Coordinate& x, const Coordinate& nx, const Coordinate& px, const Corners& corners, const Normals& normals) const;
\n-\n-\n-\n-\n-\n-\n-\n- 213 void project(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals);
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n Definition gridglue.hh:37
Projection of a line (triangle) on another line (triangle).
Definition projection.hh:21
Coordinate::field_type Field
Scalar type.
Definition projection.hh:61
const std::tuple< std::bitset< dim >, std::bitset< dim > > & success() const
Indicate whether projection (inverse projection) is valid for each corner or not.
Definition projection.hh:252
static constexpr unsigned maxEdgeIntersections
maximum number of edge-edge intersections
Definition projection.hh:54
std::array< Coordinate, dim > Images
List of corner images.
Definition projection.hh:70
void epsilon(const Field epsilon)
Set epsilon used for floating-point comparisons.
Definition projection_impl.hh:140
void project(const std::tuple< Corners &, Corners & > &corners, const std::tuple< Normals &, Normals & > &normals)
Do the actual projection.
Definition projection_impl.hh:469
static constexpr unsigned dim
dimension of coordinates
Definition projection.hh:47
unsigned numberOfEdgeIntersections() const
Number of edge intersections.
Definition projection.hh:262
const std::tuple< Images, Preimages > & images() const
Images and preimages of corners.
Definition projection.hh:235
const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections() const
Edge-edge intersections.
Definition projection.hh:273
Intersection between two edges of a triangle.
Definition projection.hh:29
std::array< Coordinate, 2 > local
Local coordinates of intersection and distance along normals.
Definition projection.hh:41
std::array< unsigned, 2 > edge
Edge numbers in image and preimage triangle.
Definition projection.hh:33
static Dune::FieldVector< T, dim > crossProduct(const Dune::FieldVector< T, dim > &a, const Dune::FieldVector< T, dim > &b)
compute cross product
Definition crossproduct.hh:15
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,175 +1,49 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-projection.hh\n+crossproduct.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n dune-grid-glue-exception\n-3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-4#define DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n+3#ifndef DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH\n+4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n 5\n-6#include \n \n- \n+ \n
\n areawriter_impl.hh File Reference
ringcomm.hh File Reference
\n-
\n-
\n+
\n+
\n+
\n
\n+
\n
\n-
\n\n \n-
\n
\n+
\n
\n+\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,43 +1,39 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-areawriter_impl.hh File Reference\n-#include \n-#include \n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+ringcomm.hh File Reference\n+#include \n+#include \n+#include \n #include \n+#include \n #include \n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bA_\br_\be_\ba_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bF_\ba_\bc_\be_\bt_\bL_\ba_\by_\bo_\bu_\bt_\b<_\b _\bd_\bi_\bm_\bg_\br_\bi_\bd_\b _\b>\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bA_\br_\be_\ba_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bC_\bh_\be_\bc_\bk_\bM_\bP_\bI_\bS_\bt_\ba_\bt_\bu_\bs(A, B)\u00a0\u00a0\u00a0{}\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bA_\br_\be_\ba_\bW_\br_\bi_\bt_\be_\br_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bf_\ba_\bc_\be_\bt_\b__\bg_\be_\bo_\bm_\be_\bt_\br_\by (const\n- GridView &gv, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n- &filename)\n-\u00a0\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bw_\br_\bi_\bt_\be_\b__\bg_\bl_\bu_\be_\b__\ba_\br_\be_\ba_\bs_\b__\bv_\bt_\bk (const Glue &glue, const std::string\n- &base)\n-\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\b:_\b:_\bM_\bP_\bI_\b__\bA_\bl_\bl_\bA_\bp_\bp_\bl_\by (MPI_Comm mpicomm, OP &&op, const Args &...\n+ data)\n+\u00a0 apply an operator locally to a difstributed data set\n+\u00a0\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0C\bCh\bhe\bec\bck\bkM\bMP\bPI\bIS\bSt\bta\bat\btu\bus\bs *\b**\b**\b**\b**\b*\n+#define CheckMPIStatus ( \u00a0 A,\n+ \u00a0 B\u00a0\n+ ) \u00a0\u00a0\u00a0{}\n+ _\bT\bT_\bo\bo_\bd\bd_\bo\bo_\b:\b:\n+ Implement MPI Status check with exception handling\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00044_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00044_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n
#include <fstream>\n-
#include <vector>\n+
#include <mpi.h>\n+
#include <functional>\n+
#include <utility>\n
#include <dune/common/fvector.hh>\n+
#include <dune/common/hybridutilities.hh>\n
#include <dune/geometry/type.hh>\n-
#include <dune/grid/common/mcmgmapper.hh>\n
Go to the source code of this file.
\n\n-Classes | |
| struct | Dune::GridGlue::AreaWriterImplementation::FacetLayout< dimgrid > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::AreaWriterImplementation |
| namespace | Dune::Parallel |
\n+Macros | |
| #define | CheckMPIStatus(A, B) {} |
\n Functions | |
| template<typename GridView > | |
| void | Dune::GridGlue::AreaWriterImplementation::write_facet_geometry (const GridView &gv, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
| template<typename OP , typename... Args> | |
| void | Dune::Parallel::MPI_AllApply (MPI_Comm mpicomm, OP &&op, const Args &... data) |
| apply an operator locally to a difstributed data set | |
Macro Definition Documentation
\n+\n+◆ CheckMPIStatus
\n+\n+\n+
\n \n+ \n+
\n+
| #define CheckMPIStatus | \n+( | \n+\n+ | A, | \n+
| \n+ | \n+ | \n+ | B | \n+
| \n+ | ) | \n+{} | \n+
\n+
\n+- Todo:
- Implement MPI Status check with exception handling
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,43 +1,39 @@\n dune-grid-glue\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-areawriter_impl.hh File Reference\n-#include