\n Classes
Model of the Intersection concept provided by GridGlue.
Implement iterators over GridGlue intersections.
Describes the parallel communication interface class for Dune::GridGlue.
Implement iterators over GridGlue intersections.
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
gridglueamirawriter.hh File Reference
\n-
\n+\n+
\n+
\n+
\n\n \n
\n
\n-
\n-\n+
\n \n #include <dune/common/iteratorrange.hh>\n+\n+
Write all remote intersections to a AmiraMesh file. \n+More...
\n+#include <fstream>\n+
#include <sstream>\n+
#include <type_traits>\n
Go to the source code of this file.
\n\n Classes | |
| struct | Dune::GridGlue::Reverse< reverse > |
| class | Dune::GridGlue::GridGlueAmiraWriter |
| Write remote intersections to a AmiraMesh file for debugging purposes. 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. | |
Detailed Description
\n+Write all remote intersections to a AmiraMesh file.
\n+\n Generated by
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,28 @@\n dune-grid-glue\u00a02.10\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
gridglueamirawriter.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+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\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
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
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,88 +1,165 @@\n dune-grid-glue\u00a02.10\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+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 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_RANGEGENERATORS_HH\n-4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n-5\n-6#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.10\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.10\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/a00014.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00014.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 \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.10\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 \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.10\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:256\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:257\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/a00020.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00020.html", "unified_diff": "@@ -79,15 +79,15 @@\n \n
\n \n-\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:256
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:257
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.10\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 templategridglue.cc File Reference
\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,32 @@\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+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+#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-#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 _\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_\bV_\bt_\bk_\bW_\br_\bi_\bt_\be_\br\n+\u00a0 Write remote intersections to a vtk 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 vtk file for debugging.\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: intersectionindexset.hh Source File \n+dune-grid-glue: gridgluevtkwriter.hh Source File \n \n \n \n \n \n \n \n@@ -74,87 +74,318 @@\n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,48 +1,480 @@\n dune-grid-glue\u00a02.10\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+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#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+3#include \n+4\n+5#include \n+6\n+7namespace _\bD_\bu_\bn_\be {\n+8namespace GridGlue {\n+9\n+_\b1_\b0namespace ProjectionImplementation {\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+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+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 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+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_\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:_\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:_\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: crossproduct.hh File Reference \n+dune-grid-glue: ringcomm.hh File Reference \n \n \n \n \n \n \n \n@@ -71,35 +71,77 @@\n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,39 @@\n dune-grid-glue\u00a02.10\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-crossproduct.hh File Reference\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 _\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+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 \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+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/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: crossproduct.hh Source File \n+dune-grid-glue: ringcomm.hh Source File \n \n \n \n \n \n \n \n@@ -74,48 +74,309 @@\n \n \n \n \n \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::GridGlueVtkWriter |
| Write remote intersections to a vtk file for debugging purposes. More... | |
\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,21 +2,32 @@\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+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 intersectionindexset.hh
gridgluevtkwriter.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,105 +1,349 @@\n dune-grid-glue\u00a02.10\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+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-_\b1// 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_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+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-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+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 54\n-55 } // end namespace GridGlue\n-56} // end namespace Dune\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#endif // DUNE_GRIDGLUE_ADAPTER_INTERSECTIONINDEXSET_HH\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 _\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:_\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:257\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:_\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:256\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/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: 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- 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+ 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 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
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:257
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
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:256
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,105 +1,349 @@\n dune-grid-glue\u00a02.10\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+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-_\b1// 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_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 \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/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: 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 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.10\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/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: areawriter.hh File Reference \n+dune-grid-glue: projection_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -72,41 +72,47 @@\n dune grid-glue common \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.10\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 \n+ \n
\n \n Namespaces |\n Functions
\n- areawriter.hh File Reference
projection_impl.hh File Reference
\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,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-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+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_\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:_\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+ 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+ 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+ 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-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+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: areawriter.hh Source File \n+dune-grid-glue: projection_impl.hh Source File \n \n \n \n \n \n \n \n@@ -74,47 +74,464 @@\n \n \n
\n #include <ostream>\n-
#include <string>\n-
#include "areawriter_impl.hh"\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::ProjectionImplementation |
\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 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,31 +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-areawriter.hh File Reference\n-#include \n- \n+ \n
\n areawriter.hh
projection_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+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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_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
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
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,48 +1,480 @@\n dune-grid-glue\u00a02.10\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+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#ifndef DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n-4#define DUNE_GRIDGLUE_COMMON_AREAWRITER_HH\n-5\n-6#include \n \n- \n+ \n
\n crossproduct.hh File Reference
ringcomm.hh File Reference
\n-\n+
\n+
\n+
\n+
\n+
\n+
\n+\n \n
\n+
\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+
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::Parallel |
\n+Macros | |
| #define | CheckMPIStatus(A, B) {} |
\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 | |
| 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,24 +1,39 @@\n dune-grid-glue\u00a02.10\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-crossproduct.hh File Reference\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 crossproduct.hh
ringcomm.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,49 +1,308 @@\n dune-grid-glue\u00a02.10\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-crossproduct.hh\n+ringcomm.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_COMMON_CROSSPRODUCT_HH\n-4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n-5\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+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 actual 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 _\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:_\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+_\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 ===============================================================================\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: projection_impl.hh File Reference \n+dune-grid-glue: projection.hh File Reference \n \n \n \n \n \n \n \n@@ -70,49 +70,41 @@\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+Go to the documentation of this file.\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 \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+Definition gridglue.hh:37
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
void MPI_AllApply(MPI_Comm mpicomm, OP &&op, const Args &... data)
apply an operator locally to a difstributed data set
Definition ringcomm.hh:297
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,49 +1,308 @@\n dune-grid-glue\u00a02.10\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-crossproduct.hh\n+ringcomm.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_COMMON_CROSSPRODUCT_HH\n-4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n-5\n-6namespace _\bD_\bu_\bn_\be {\n-7namespace GridGlue {\n-8\n-14template projection.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": "@@ -1,44 +1,28 @@\n dune-grid-glue\u00a02.10\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+_\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 _\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-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- 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- 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- 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/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: projection_impl.hh Source File \n+dune-grid-glue: projection.hh Source File \n \n \n \n \n \n \n \n@@ -74,464 +74,137 @@\n \n \n
\n #include <dune/common/fmatrix.hh>\n-
#include <cmath>\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 |
| namespace | Dune::GridGlue::ProjectionImplementation |
\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) |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,44 +1,28 @@\n dune-grid-glue\u00a02.10\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
projection.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,480 +1,175 @@\n dune-grid-glue\u00a02.10\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+projection.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-4\n-5#include \n-6\n-7namespace _\bD_\bu_\bn_\be {\n-8namespace GridGlue {\n+3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n+4#define DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n+5\n+6#include \n+7#include \n+8#include \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-32\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 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-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+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-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+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 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+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 _\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:_\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 ===============================================================================\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": "@@ -77,16 +77,16 @@\n Namespaces |\n Functions \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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n \n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n+\n+\n+\n+
\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\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- 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 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
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
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,480 +1,175 @@\n dune-grid-glue\u00a02.10\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+projection.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 projectionwriter.hh File Reference
\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,23 @@\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+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 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-\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-\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-\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+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/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 \n \n \n \n-dune-grid-glue: projectionwriter_impl.hh Source File \n+dune-grid-glue: crossproduct.hh Source File \n \n \n \n \n \n \n \n@@ -74,211 +74,48 @@\n \n \n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,175 +1,238 @@\n dune-grid-glue\u00a02.10\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+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#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-4#define DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-5\n-6#include \n-7#include \n-8#include \n+3#include \n+4\n+5namespace _\bD_\bu_\bn_\be {\n+6namespace GridGlue {\n+7\n+_\b8namespace ProjectionWriterImplementation {\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+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+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 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+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-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+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:_\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:_\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 ===============================================================================\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/a00053.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00053.html", "unified_diff": "@@ -82,15 +82,15 @@\n \n
\n
\n
\n
\n-
\n+
\n\n \n
#include <iostream>\n
#include <string>\n-
#include <dune/grid-glue/common/projection.hh>\n-
#include "projectionwriter_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 | ||
\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.10\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.10\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 actual 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/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: projectionwriter_impl.hh File Reference \n+dune-grid-glue: crossproduct.hh File Reference \n \n \n \n \n \n \n \n@@ -72,59 +72,33 @@\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.10\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- projectionwriter_impl.hh File Reference
crossproduct.hh File Reference
\n-
\n-\n+\n \n
\n
\n
\n \n #include <fstream>\n-
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::ProjectionWriterImplementation |
\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<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": "@@ -2,59 +2,23 @@\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
crossproduct.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,238 +1,49 @@\n dune-grid-glue\u00a02.10\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+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#include \n-4\n-5namespace _\bD_\bu_\bn_\be {\n-6namespace GridGlue {\n-7\n-_\b8namespace ProjectionWriterImplementation {\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+3#ifndef DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH\n+4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n+5\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-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-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 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-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+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:_\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:_\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:_\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/a00050.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00050.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: projectionwriter_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -70,41 +70,61 @@\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+ 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+\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- 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- 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- 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 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
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
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,238 +1,49 @@\n dune-grid-glue\u00a02.10\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+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#include projectionwriter_impl.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": "@@ -1,28 +1,60 @@\n dune-grid-glue\u00a02.10\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+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-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+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+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+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+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/a00050_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00050_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: projectionwriter_impl.hh Source File \n \n \n \n \n \n \n \n@@ -74,137 +74,211 @@\n \n \n
\n #include <array>\n-
#include <bitset>\n-
#include <tuple>\n-
#include "projection_impl.hh"\n+
#include <fstream>\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 |
| namespace | Dune::GridGlue::ProjectionWriterImplementation |
\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. | |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,60 @@\n dune-grid-glue\u00a02.10\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
projectionwriter_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 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+ 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+ 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+ 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+ 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- 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 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
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
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,175 +1,238 @@\n dune-grid-glue\u00a02.10\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+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#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-4#define DUNE_GRIDGLUE_COMMON_PROJECTIONHELPER2_HH\n-5\n-6#include Mesh grid extractor base class. \n More...
\n#include <deque>\n
#include <functional>\n
#include <dune/common/deprecated.hh>\n
#include <dune/grid/common/mcmgmapper.hh>\n-
#include "extractor.hh"\n+
#include "extractor.hh"\n
Go to the source code of this file.
\n\n Classes | |||
| class | Dune::GridGlue::Codim0Extractor< GV > | ||
\n Classes | |
| class | Dune::GridGlue::Codim1Extractor< GV > |
| class | Dune::GridGlue::Extractor< GV, cd > |
| Provides codimension-independent methods for grid extraction. More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::CornerInfo |
| Helpful struct holding one index for the coordinate (vertex) to which it is associated and the element's corner index;. More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::CoordinateInfo |
| struct | Dune::GridGlue::Extractor< GV, cd >::VertexInfo |
| simple struct holding a vertex pointer and an index More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::ElementInfo |
| simple struct holding an element seed and an index More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::SubEntityInfo |
| Holds some information about an element's subentity involved in a coupling. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-Grid extractor class for codim 1 subgrids.
\n+extractor base class
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,29 +2,49 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-codim1extractor.hh File Reference\n-Grid extractor class for codim 1 subgrids. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \"_\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n-#include \n- \n+ \n
\n codim1extractor.hh
extractor.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+\n+\n+\n+\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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+\n+\n+\n+\n+\n+
\n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n+\n+\n+\n \n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n+\n+\n+\n+\n+
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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 FieldVector<ctype,dimworld> reconstructedNormal = crossProduct(cornerCoords[1] - cornerCoords[0],
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 337 DUNE_THROW(Dune::NotImplemented, "the extractor does only work for triangle and quadrilateral faces (" << face_corners << " corners)");
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n+
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-extractor base class
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+
\n+ 409typename Extractor<GV,cd>::LocalGeometry Extractor<GV,cd>::geometryLocal(unsigned int index) const
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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.
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
Definition codim1extractor.hh:42
Extractor< GV, 1 >::IndexType IndexType
Definition codim1extractor.hh:51
GV::Traits::template Codim< 0 >::Entity Element
Definition codim1extractor.hh:62
Dune::FieldVector< ctype, dimworld > Coords
Definition codim1extractor.hh:59
Codim1Extractor(const GV &gv, const Predicate &predicate)
Constructor.
Definition codim1extractor.hh:81
static constexpr int simplex_corners
compile time number of corners of surface simplices
Definition codim1extractor.hh:54
Extractor< GV, 1 >::VertexInfo VertexInfo
Definition codim1extractor.hh:68
Extractor< GV, 1 >::CoordinateInfo CoordinateInfo
Definition codim1extractor.hh:69
Extractor< GV, 1 >::ElementInfo ElementInfo
Definition codim1extractor.hh:67
Extractor< GV, 1 >::SubEntityInfo SubEntityInfo
Definition codim1extractor.hh:66
Extractor< GV, 1 >::VertexInfoMap VertexInfoMap
Definition codim1extractor.hh:70
std::function< bool(const Element &, unsigned int subentity)> Predicate
Definition codim1extractor.hh:63
GV::Traits::template Codim< dim >::Entity Vertex
Definition codim1extractor.hh:61
Provides codimension-independent methods for grid extraction.
Definition extractor.hh:46
static constexpr auto dimworld
Definition extractor.hh:50
GV::Traits::template Codim< dim >::Entity Vertex
Definition extractor.hh:63
VertexInfoMap vtxInfo_
a map enabling faster access to vertices and coordinates
Definition extractor.hh:206
Element element(unsigned int index) const
gets the parent element for a given face index, throws an exception if index not valid
Definition extractor.hh:361
int indexInInside(unsigned int index) const
gets the number face in the parent element
Definition extractor.hh:326
Dune::FieldVector< ctype, dim > LocalCoords
Definition extractor.hh:61
LocalGeometry geometryLocal(unsigned int index) const
Get geometry of the extracted face in element coordinates.
Definition extractor.hh:409
Dune::MultiLinearGeometry< ctype, dim-codim, dimworld > Geometry
Definition extractor.hh:77
static constexpr int cube_corners
Definition extractor.hh:54
std::vector< CoordinateInfo > coords_
all information about the corner vertices of the extracted
Definition extractor.hh:196
GV::Traits::template Codim< 0 >::Entity Element
Definition extractor.hh:66
const GridView & gridView() const
give access to the Dune::GridView where this Patch belongs to
Definition extractor.hh:344
void getFaces(std::vector< VertexVector > &faces) const
Get the corners of the extracted subentities.
Definition extractor.hh:285
std::vector< unsigned int > VertexVector
Definition extractor.hh:69
const GridView gv_
the grid object to extract the surface from
Definition extractor.hh:191
std::vector< SubEntityInfo > subEntities_
all information about the extracted subEntities
Definition extractor.hh:199
Vertex vertex(unsigned int index) const
gets the vertex for a given coordinate index throws an exception if index not valid
Definition extractor.hh:377
Dune::FieldVector< ctype, dimworld > Coords
Definition extractor.hh:60
void getGeometryTypes(std::vector< Dune::GeometryType > &geometryTypes) const
Get the list of geometry types.
Definition extractor.hh:274
MultipleCodimMultipleGeomTypeMapper< GridView > CellMapper
Definition extractor.hh:70
std::map< IndexType, VertexInfo > VertexInfoMap
Definition extractor.hh:186
bool faceIndices(const Element &e, int &first, int &count) const
gets index of first subentity as well as the total number of subentities that were extracted from thi...
Definition extractor.hh:304
Geometry geometry(unsigned int index) const
Get world geometry of the extracted face.
Definition extractor.hh:397
unsigned int nCoords() const
getter for the count of coordinates
Definition extractor.hh:268
std::map< IndexType, ElementInfo > ElementInfoMap
Definition extractor.hh:185
void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords) const
getter for the coordinates array
Definition extractor.hh:256
ElementInfoMap elmtInfo_
a map enabling faster access to elements and faces
Definition extractor.hh:213
void clear()
delete everything build up so far and free the memory
Definition extractor.hh:235
Dune::MultiLinearGeometry< ctype, dim-codim, dim > LocalGeometry
Definition extractor.hh:78
Helpful struct holding one index for the coordinate (vertex) to which it is associated and the elemen...
Definition extractor.hh:88
unsigned int idx
index of the vertex
Definition extractor.hh:89
Definition extractor.hh:94
CoordinateInfo(unsigned int index_, IndexType vtxindex_)
Definition extractor.hh:98
unsigned int index
the index of this coordinate (in internal storage scheme) // NEEDED??
Definition extractor.hh:109
Coords coord
the coordinate
Definition extractor.hh:106
IndexType vtxindex
the index of the parent element (from index set)
Definition extractor.hh:103
simple struct holding a vertex pointer and an index
Definition extractor.hh:116
VertexInfo(unsigned int idx_, const Vertex &p_)
Definition extractor.hh:117
simple struct holding an element seed and an index
Definition extractor.hh:128
unsigned int idx
the index of this element's first face in the internal list of extracted faces
Definition extractor.hh:133
unsigned int faces
the number of extracted faces for this element
Definition extractor.hh:136
ElementInfo(unsigned int idx_, const Element &p_, unsigned int f_)
Definition extractor.hh:129
ElementSeed p
the entity seed for the element
Definition extractor.hh:139
Holds some information about an element's subentity involved in a coupling.
Definition extractor.hh:147
unsigned int nCorners() const
Definition extractor.hh:161
CornerInfo corners[cube_corners]
the corner indices plus the numbers of the vertices in the parent element
Definition extractor.hh:181
IndexType parent
the index of the parent element (from index set)
Definition extractor.hh:167
SubEntityInfo(IndexType parent_, unsigned int num_in_parent_, const Dune::GeometryType &geometryType)
Definition extractor.hh:156
unsigned int num_in_parent
the number of the face in the parent element
Definition extractor.hh:170
Dune::GeometryType geometryType_
The GeometryType of the subentity.
Definition extractor.hh:173
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,470 +1,587 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n-codim1extractor.hh\n+extractor.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 5/*\n-6 * Filename: codim1extractor.hh\n+6 * Filename: extractor.hh\n 7 * Version: 1.0\n-8 * Created on: Jun 23, 2009\n-9 * Author: Oliver Sander, Christian Engwer\n+8 * Created on: Oct 05, 2009\n+9 * Author: Christian Engwer\n 10 * ---------------------------------\n 11 * Project: dune-grid-glue\n-12 * Description: class for grid extractors extracting surface grids\n+12 * Description: base class for all grid extractors\n 13 *\n 14 */\n-20#ifndef DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n-21#define DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n+20#ifndef DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n+21#define DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n 22\n-23#include \"_\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n-24\n-25#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- vtksurfacewriter.hh File Reference
codim1extractor.hh File Reference
\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": "@@ -2,27 +2,29 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-vtksurfacewriter.hh File Reference\n-helper class for graphical output of grids in generic representation _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include \n-#include \"_\b._\b._\b/_\ba_\bd_\ba_\bp_\bt_\be_\br_\b/_\bg_\br_\bi_\bd_\bg_\bl_\bu_\be_\bv_\bt_\bk_\bw_\br_\bi_\bt_\be_\br_\b._\bh_\bh\"\n+codim1extractor.hh File Reference\n+Grid extractor class for codim 1 subgrids. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \"_\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b._\bh_\bh\"\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/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\br_\bo_\bs_\bs_\bp_\br_\bo_\bd_\bu_\bc_\bt_\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:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\b _\bG_\bV_\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-helper class for graphical output of grids in generic representation\n+Grid extractor class for codim 1 subgrids.\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/a00059_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00059_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: vtksurfacewriter.hh Source File \n+dune-grid-glue: codim1extractor.hh Source File \n \n \n \n \n \n \n \n@@ -74,258 +74,400 @@\n \n \n \n
\n helper class for graphical output of grids in generic representation \n+
Grid extractor class for codim 1 subgrids. \n More...
\n-#include <fstream>\n-
#include <iomanip>\n-
#include <vector>\n-
#include <cstring>\n-
#include "../adapter/gridgluevtkwriter.hh"\n+
#include "extractor.hh"\n+
#include <array>\n+
#include <deque>\n+
#include <functional>\n+
#include <dune/common/deprecated.hh>\n+
#include <dune/common/version.hh>\n+
#include <dune/grid-glue/common/crossproduct.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::VtkSurfaceWriter |
| class | Dune::GridGlue::Codim1Extractor< GV > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-helper class for graphical output of grids in generic representation
\n+Grid extractor class for codim 1 subgrids.
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,27 +2,29 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-vtksurfacewriter.hh File Reference\n-helper class for graphical output of grids in generic representation _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n vtksurfacewriter.hh
codim1extractor.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,280 +1,470 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n-vtksurfacewriter.hh\n+codim1extractor.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 5/*\n-6 * Filename: VtkSurfaceWriter.hh\n+6 * Filename: codim1extractor.hh\n 7 * Version: 1.0\n-8 * Created on: Jan 16, 2009\n-9 * Author: Gerrit Buse\n+8 * Created on: Jun 23, 2009\n+9 * Author: Oliver Sander, Christian Engwer\n 10 * ---------------------------------\n 11 * Project: dune-grid-glue\n-12 * Description: helper class for graphical output of grids in generic\n-representation\n+12 * Description: class for grid extractors extracting surface grids\n 13 *\n 14 */\n-20#ifndef DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n-21#define DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n+20#ifndef DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n+21#define DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n 22\n-23#include \n-24#include \n-25#include \n-26#include \n-27\n-28#include \"../adapter/gridgluevtkwriter.hh\"\n-29\n-30namespace _\bD_\bu_\bn_\be {\n-31\n-32 namespace GridGlue {\n-33\n-_\b3_\b4class _\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br\n-35{\n-36public:\n-37\n-38\n-_\b3_\b9 _\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br(const char* filename) : filename_(filename)\n-40 {}\n-41\n-_\b4_\b2 _\b~_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br()\n-43 {}\n+23#include \"_\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n+24\n+25#include \n+26#include \n+27#include \n+28\n+29#include \n+30#include \n+31#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\br_\bo_\bs_\bs_\bp_\br_\bo_\bd_\bu_\bc_\bt_\b._\bh_\bh>\n+32\n+33namespace _\bD_\bu_\bn_\be {\n+34\n+35 namespace GridGlue {\n+36\n+40template\n+_\b4_\b1class _\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br : public _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br\n+42{\n+43public:\n 44\n-_\b4_\b5 void _\bs_\be_\bt_\bF_\bi_\bl_\be_\bn_\ba_\bm_\be(const char* name)\n-46 {\n-47 if (std::strlen(name) > 0)\n-48 this->filename_ = name;\n-49 }\n-50\n-51\n-52 template\n-_\b5_\b3 void _\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be(const std::vector& coords, const std::vector& indices, int corners, int dim)\n-54 {\n-55 std::ofstream fos;\n-56 char buffer[64];\n-57 sprintf(buffer, \"%s.vtk\", this->filename_);\n-58 fos.open(buffer);\n-59 fos << std::setprecision(8) << std::setw(1);\n-60 // write preamble\n-61 fos << \"# vtk DataFile Version 2.0\\nFilename: \" << buffer << \"\\nASCII\" <<\n-std::endl;\n-62 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bs(coords, dim, fos);\n-63 const int polycount = indices.size()/corners;\n-64 int corner_count[polycount];\n-65 for (int i = 0; i < polycount; ++i)\n-66 corner_count[i] = corners;\n-67 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bl_\by_\bg_\bo_\bn_\bs(indices, corner_count, polycount, dim, fos);\n-68 fos.close();\n-69 }\n-70\n+45 /* E X P O R T E D T Y P E S A N D C O N S T A N T S */\n+46\n+47 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd;\n+48 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bm;\n+49 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bd_\bi_\bm;\n+50 using _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bu_\bb_\be_\b__\bc_\bo_\br_\bn_\be_\br_\bs;\n+_\b5_\b1 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be _\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be;\n+52\n+_\b5_\b4 static constexpr int _\bs_\bi_\bm_\bp_\bl_\be_\bx_\b__\bc_\bo_\br_\bn_\be_\br_\bs = _\bd_\bi_\bm;\n+55\n+_\b5_\b6 typedef GV _\bG_\br_\bi_\bd_\bV_\bi_\be_\bw;\n+57\n+_\b5_\b8 typedef typename GV::Grid::ctype _\bc_\bt_\by_\bp_\be;\n+_\b5_\b9 typedef Dune::FieldVector _\bC_\bo_\bo_\br_\bd_\bs;\n+60\n+_\b6_\b1 typedef typename GV::Traits::template Codim::Entity _\bV_\be_\br_\bt_\be_\bx;\n+_\b6_\b2 typedef typename GV::Traits::template Codim<0>::Entity _\bE_\bl_\be_\bm_\be_\bn_\bt;\n+_\b6_\b3 typedef std::function\n+_\bP_\br_\be_\bd_\bi_\bc_\ba_\bt_\be;\n+64\n+65 // import typedefs from base class\n+_\b6_\b6 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bn_\bf_\bo _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bn_\bf_\bo;\n+_\b6_\b7 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bn_\bf_\bo _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bn_\bf_\bo;\n+_\b6_\b8 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo _\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo;\n+_\b6_\b9 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bI_\bn_\bf_\bo _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bI_\bn_\bf_\bo;\n+_\b7_\b0 typedef typename _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b<_\bG_\bV_\b,_\b1_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo_\bM_\ba_\bp _\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo_\bM_\ba_\bp;\n 71\n-72 template\n-_\b7_\b3 void _\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bD_\ba_\bt_\ba(const std::vector& coords, const std::\n-vector& indices, int corners, const std::vector& data, const\n-char* dataname, int dim)\n-74 {\n-75 std::ofstream fos;\n-76 char buffer[64];\n-77 sprintf(buffer, \"%s.vtk\", this->filename_);\n-78 fos.open(buffer);\n-79 fos << std::setprecision(8) << std::setw(1);\n-80 // write preamble\n-81 fos << \"# vtk DataFile Version 2.0\\nFilename: \" << buffer << \"\\nASCII\" <<\n-std::endl;\n-82 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bs(coords, dim, fos);\n-83 const int polycount = indices.size()/corners;\n-84 int corner_count[polycount];\n-85 for (int i = 0; i < polycount; ++i)\n-86 corner_count[i] = corners;\n-87 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bl_\by_\bg_\bo_\bn_\bs(indices, corner_count, polycount, dim, fos);\n-88 this->_\bw_\br_\bi_\bt_\be_\bC_\be_\bl_\bl_\bD_\ba_\bt_\ba(data, dataname, dim, fos);\n-89 fos.close();\n-90 }\n+72public:\n+73\n+74 /* C O N S T R U C T O R S A N D D E S T R U C T O R S */\n+75\n+_\b8_\b1 _\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br(const GV& gv, const _\bP_\br_\be_\bd_\bi_\bc_\ba_\bt_\be& predicate)\n+82 : _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br(gv)\n+83 {\n+84 std::cout << \"This is Codim1Extractor on a <\" << _\bd_\bi_\bm\n+85 << \",\" << _\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd << \"> grid!\"\n+86 << std::endl;\n+87 update(predicate);\n+88 }\n+89\n+90private:\n 91\n-92\n-93 template\n-_\b9_\b4 void _\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\ba_\bt_\ba(const std::vector& coords, const std::\n-vector& indices, int corners, const std::vector& data, const\n-char* dataname, int dim)\n-95 {\n-96 std::ofstream fos;\n-97 char buffer[64];\n-98 sprintf(buffer, \"%s.vtk\", this->filename_);\n-99 fos.open(buffer);\n-100 fos << std::setprecision(8) << std::setw(1);\n-101 // write preamble\n-102 fos << \"# vtk DataFile Version 2.0\\nFilename: \" << buffer << \"\\nASCII\" <<\n-std::endl;\n-103 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bs(coords, dim, fos);\n-104 const int polycount = indices.size()/corners;\n-105 int corner_count[polycount];\n-106 for (int i = 0; i < polycount; ++i)\n-107 corner_count[i] = corners;\n-108 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bl_\by_\bg_\bo_\bn_\bs(indices, corner_count, polycount, dim, fos);\n-109 this->_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bD_\ba_\bt_\ba(data, dataname, dim, fos);\n-110 fos.close();\n-111 }\n-112\n-113protected:\n-114\n-115 template\n-_\b1_\b1_\b6 void _\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bs(const std::vector& coords, int dim, std::ofstream& fos)\n-117 {\n-118 fos << \"DATASET POLYDATA\\nPOINTS \" << coords.size() << \" \" << TypeNames\n-[Nametraits::nameidx] << std::endl;\n-119 for (unsigned int i = 0; i < coords.size(); ++i)\n+105 void update(const _\bP_\br_\be_\bd_\bi_\bc_\ba_\bt_\be& predicate);\n+106\n+107};\n+108\n+109\n+110template\n+111void Codim1Extractor::update(const Predicate& predicate)\n+112{\n+113 // free everything there is in this object\n+114 this->clear();\n+115\n+116 // In this first pass iterate over all entities of codim 0.\n+117 // For each codim 1 intersection check if it is part of the boundary and if\n+so,\n+118 // get its corner vertices, find resp. store them together with their\n+associated index,\n+119 // and remember the indices of the boundary faces' corners.\n 120 {\n-121 fos << coords[i][0];\n-122 if (dim == 2)\n-123 fos << \" \" << coords[i][1] << \" 0 \\n\" << coords[i][0] << \" \" << coords[i]\n-[1] << \" 0.01\" << std::endl;\n-124 else // dim == 3\n-125 fos << \" \" << coords[i][1] << \" \" << coords[i][2] << std::endl;\n-126 }\n-127 }\n+121 // several counter for consecutive indexing are needed\n+122 int simplex_index = 0;\n+123 int vertex_index = 0;\n+124 IndexType eindex = 0; // suppress warning\n+125\n+126 // needed later for insertion into a std::set which only\n+127 // works with const references\n 128\n-_\b1_\b2_\b9 void _\bw_\br_\bi_\bt_\be_\bP_\bo_\bl_\by_\bg_\bo_\bn_\bs(const std::vector& indices, const int*\n-corners, int ncorners, int dim, std::ofstream& fos)\n-130 {\n-131 if (dim == 2)\n-132 {\n-133 fos << \"POLYGONS \" << indices.size()/2 << \" \" << 5*(indices.size() / 2) <<\n-std::endl;\n-134 for (unsigned int i = 0; i < indices.size(); i += 2)\n-135 fos << \"4 \" << 2*indices[i] << \" \" << 2*indices[i+1] << \" \" << 2*indices\n-[i+1]+1 << \" \"<< 2*indices[i]+1 << std::endl;\n-136\n-137 // arbitrary shapes - ignored here!\n-138 // int sum = ncorners;\n-139 // for (int i = 0; i < ncorners; ++i)\n-140 // sum += (corners[i] > 2 ? corners[i] : 3);\n-141 //\n-142 // fos << \"POLYGONS \" << ncorners << \" \" << sum << std::endl;\n-143 // int index = 0;\n-144 // for (int i = 0; i < ncorners; ++i)\n-145 // {\n-146 // // write the first index twice if it is an edge\n-147 // // => triangle instead of edge - paraview can display it then\n-148 // if (corners[i] > 2)\n-149 // fos << corners[i];\n-150 // else\n-151 // fos << \"3 \" << indices[index];\n-152 //\n-153 // for (int j = 0; j < corners[i]; ++j)\n-154 // fos << \" \" << indices[index++];\n-155 // fos << std::endl;\n-156 // }\n-157 }\n-158 else\n-159 {\n-160 int sum = ncorners;\n-161 for (int i = 0; i < ncorners; ++i)\n-162 sum += corners[i];\n-163 fos << \"POLYGONS \" << ncorners << \" \" << sum << std::endl;\n-164 int index = 0;\n-165 for (int i = 0; i < ncorners; ++i)\n-166 {\n-167 fos << corners[i];\n-168 for (int j = 0; j < corners[i]; ++j)\n-169 fos << \" \" << indices[index++];\n-170 fos << std::endl;\n-171 }\n-172 }\n-173 }\n-174\n-175 template\n-_\b1_\b7_\b6 void _\bw_\br_\bi_\bt_\be_\bC_\be_\bl_\bl_\bD_\ba_\bt_\ba(const std::vector& data, const char* dataname, int\n-dim, std::ofstream& fos)\n-177 {\n-178 fos << \"CELL_DATA \" << data.size()*(dim == 2 ? 2 : 1) << std::endl;\n-179 fos << \"SCALARS \" << dataname << \" \" << TypeNames[Nametraits::nameidx]\n-<< \" 1\" << std::endl;\n-180 fos << \"LOOKUP_TABLE default\" << std::endl;\n-181 for (unsigned int i = 0; i < data.size(); ++i)\n-182 {\n-183 fos << data[i] << std::endl;\n-184 if (dim == 2)\n-185 fos << data[i] << std::endl;\n-186 }\n-187 }\n-188\n-189 template\n-_\b1_\b9_\b0 void _\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bD_\ba_\bt_\ba(const std::vector& data, const char* dataname, int\n-dim, std::ofstream& fos)\n-191 {\n-192 fos << \"POINT_DATA \" << data.size()*(dim == 2 ? 2 : 1) << std::endl;\n-193 fos << \"SCALARS \" << dataname << \" \" << TypeNames[Nametraits::nameidx]\n-<< \" 1\" << std::endl;\n-194 fos << \"LOOKUP_TABLE default\" << std::endl;\n-195 for (unsigned int i = 0; i < data.size(); ++i)\n-196 {\n-197 fos << data[i] << std::endl;\n-198 if (dim == 2)\n-199 fos << data[i] << std::endl;\n-200 }\n-201 }\n-202\n-203\n-204private:\n-205 const char* filename_;\n-206};\n-207\n-208} // namespace GridGlue\n+129 // a temporary container where newly acquired face\n+130 // information can be stored at first\n+131 std::deque temp_faces;\n+132\n+133 // iterate over interior codim 0 elements on the grid\n+134 for (const auto& elmt : elements(this->gv_, Partitions::interior))\n+135 {\n+136 Dune::GeometryType gt = elmt.type();\n+137\n+138 // if some face is part of the surface add it!\n+139 if (elmt.hasBoundaryIntersections())\n+140 {\n+141 // add an entry to the element info map, the index will be set properly\n+later,\n+142 // whereas the number of faces is already known\n+143 eindex = this->cellMapper_.index(elmt);\n+144 this->elmtInfo_.emplace(eindex, ElementInfo(simplex_index, elmt, 0));\n+145\n+146 // now add the faces in ascending order of their indices\n+147 // (we are only talking about 1-4 faces here, so O(n^2) is ok!)\n+148 for (const auto& in : _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs(this->gv_, elmt))\n+149 {\n+150 // Stop only at selected boundary faces\n+151 if (!in.boundary() or !predicate(elmt, in.indexInInside()))\n+152 continue;\n+153\n+154 const auto& refElement = Dune::ReferenceElements::general(gt);\n+155 // get the corner count of this face\n+156 const int face_corners = refElement.size(in.indexInInside(), 1, dim);\n+157\n+158 // now we only have to care about the 3D case, i.e. a triangle face can be\n+159 // inserted directly whereas a quadrilateral face has to be divided into\n+two triangles\n+160 switch (face_corners)\n+161 {\n+162 case 2 :\n+163 case 3:\n+164 {\n+165 // we have a simplex here\n+166\n+167 // register the additional face(s)\n+168 this->elmtInfo_.at(eindex).faces++;\n+169\n+170 // add a new face to the temporary collection\n+171 temp_faces.emplace_back(eindex, in.indexInInside(),\n+172 Dune::GeometryTypes::simplex(dim-codim));\n+173\n+174 std::vector > cornerCoords(face_corners);\n+175\n+176 // try for each of the faces vertices whether it is already inserted or not\n+177 for (int i = 0; i < face_corners; ++i)\n+178 {\n+179 // get the number of the vertex in the parent element\n+180 int vertex_number = refElement.subEntity(in.indexInInside(), 1, i, dim);\n+181\n+182 // get the vertex pointer and the index from the index set\n+183 const Vertex vertex = elmt.template subEntity(vertex_number);\n+184 cornerCoords[i] = vertex.geometry().corner(0);\n+185\n+186 IndexType vindex = this->gv_.indexSet().template index(vertex);\n+187\n+188 // remember the vertex' number in parent element's vertices\n+189 temp_faces.back().corners[i].num = vertex_number;\n+190\n+191 // if the vertex is not yet inserted in the vertex info map\n+192 // it is a new one -> it will be inserted now!\n+193 typename VertexInfoMap::iterator vimit = this->vtxInfo_.find(vindex);\n+194 if (vimit == this->vtxInfo_.end())\n+195 {\n+196 // insert into the map\n+197 this->vtxInfo_.emplace(vindex, VertexInfo(vertex_index, vertex));\n+198 // remember the vertex as a corner of the current face in temp_faces\n+199 temp_faces.back().corners[i].idx = vertex_index;\n+200 // increase the current index\n+201 vertex_index++;\n+202 }\n+203 else\n+204 {\n+205 // only insert the index into the simplices array\n+206 temp_faces.back().corners[i].idx = vimit->second.idx;\n+207 }\n+208 }\n 209\n-210} // namespace Dune\n-211\n-212#endif // DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n+210 // Now we have the correct vertices in the last entries of temp_faces, but\n+they may\n+211 // have the wrong orientation. We want them to be oriented such that all\n+boundary edges\n+212 // point in the counterclockwise direction. Therefore, we check the\n+orientation of the\n+213 // new face and possibly switch the two vertices.\n+214 FieldVector realNormal = in.centerUnitOuterNormal();\n+215\n+216 // Compute segment normal\n+217 FieldVector reconstructedNormal;\n+218 if (dim==2) // boundary face is a line segment\n+219 {\n+220 reconstructedNormal[0] = cornerCoords[1][1] - cornerCoords[0][1];\n+221 reconstructedNormal[1] = cornerCoords[0][0] - cornerCoords[1][0];\n+222 } else { // boundary face is a triangle\n+223 FieldVector segment1 = cornerCoords[1] - cornerCoords[0];\n+224 FieldVector segment2 = cornerCoords[2] - cornerCoords[0];\n+225 reconstructedNormal = _\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt(segment1, segment2);\n+226 }\n+227 reconstructedNormal /= reconstructedNormal.two_norm();\n+228\n+229 if (realNormal * reconstructedNormal < 0.0)\n+230 std::swap(temp_faces.back().corners[0], temp_faces.back().corners[1]);\n+231\n+232 // now increase the current face index\n+233 simplex_index++;\n+234 break;\n+235 }\n+236 case 4 :\n+237 {\n+238 assert(dim == 3 && cube_corners == 4);\n+239 // we have a quadrilateral here\n+240 std::array vertex_indices;\n+241 std::array vertex_numbers;\n+242\n+243 // register the additional face(s) (2 simplices)\n+244 this->elmtInfo_.at(eindex).faces += 2;\n+245\n+246 std::array, 4> cornerCoords;\n+247\n+248 // get the vertex pointers for the quadrilateral's corner vertices\n+249 // and try for each of them whether it is already inserted or not\n+250 for (int i = 0; i < cube_corners; ++i)\n+251 {\n+252 // get the number of the vertex in the parent element\n+253 vertex_numbers[i] = refElement.subEntity(in.indexInInside(), 1, i, dim);\n+254\n+255 // get the vertex pointer and the index from the index set\n+256 const Vertex vertex = elmt.template subEntity(vertex_numbers[i]);\n+257 cornerCoords[i] = vertex.geometry().corner(0);\n+258\n+259 IndexType vindex = this->gv_.indexSet().template index(vertex);\n+260\n+261 // if the vertex is not yet inserted in the vertex info map\n+262 // it is a new one -> it will be inserted now!\n+263 typename VertexInfoMap::iterator vimit = this->vtxInfo_.find(vindex);\n+264 if (vimit == this->vtxInfo_.end())\n+265 {\n+266 // insert into the map\n+267 this->vtxInfo_.emplace(vindex, VertexInfo(vertex_index, vertex));\n+268 // remember this vertex' index\n+269 vertex_indices[i] = vertex_index;\n+270 // increase the current index\n+271 vertex_index++;\n+272 }\n+273 else\n+274 {\n+275 // only remember the vertex' index\n+276 vertex_indices[i] = vimit->second.idx;\n+277 }\n+278 }\n+279\n+280 // now introduce the two triangles subdividing the quadrilateral\n+281 // ATTENTION: the order of vertices given by \"orientedSubface\" corresponds\n+to the order\n+282 // of a Dune quadrilateral, i.e. the triangles are given by 0 1 2 and 3 2 1\n+283\n+284 // add a new face to the temporary collection for the first tri\n+285 temp_faces.emplace_back(eindex, in.indexInInside(),\n+286 Dune::GeometryTypes::simplex(dim-codim));\n+287 temp_faces.back().corners[0].idx = vertex_indices[0];\n+288 temp_faces.back().corners[1].idx = vertex_indices[1];\n+289 temp_faces.back().corners[2].idx = vertex_indices[2];\n+290 // remember the vertices' numbers in parent element's vertices\n+291 temp_faces.back().corners[0].num = vertex_numbers[0];\n+292 temp_faces.back().corners[1].num = vertex_numbers[1];\n+293 temp_faces.back().corners[2].num = vertex_numbers[2];\n+294\n+295 // Now we have the correct vertices in the last entries of temp_faces, but\n+they may\n+296 // have the wrong orientation. We want the triangle vertices on\n+counterclockwise order,\n+297 // when viewed from the outside of the grid. Therefore, we check the\n+orientation of the\n+298 // new face and possibly switch two vertices.\n+299 FieldVector realNormal = in.centerUnitOuterNormal();\n+300\n+301 // Compute segment normal\n+302 FieldVector reconstructedNormal = _\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt(cornerCoords\n+[1] - cornerCoords[0],\n+303 cornerCoords[2] - cornerCoords[0]);\n+304 reconstructedNormal /= reconstructedNormal.two_norm();\n+305\n+306 if (realNormal * reconstructedNormal < 0.0)\n+307 std::swap(temp_faces.back().corners[0], temp_faces.back().corners[1]);\n+308\n+309\n+310 // add a new face to the temporary collection for the second tri\n+311 temp_faces.emplace_back(eindex, in.indexInInside(),\n+312 Dune::GeometryTypes::simplex(dim-codim));\n+313 temp_faces.back().corners[0].idx = vertex_indices[3];\n+314 temp_faces.back().corners[1].idx = vertex_indices[2];\n+315 temp_faces.back().corners[2].idx = vertex_indices[1];\n+316 // remember the vertices' numbers in parent element's vertices\n+317 temp_faces.back().corners[0].num = vertex_numbers[3];\n+318 temp_faces.back().corners[1].num = vertex_numbers[2];\n+319 temp_faces.back().corners[2].num = vertex_numbers[1];\n+320\n+321 // Now we have the correct vertices in the last entries of temp_faces, but\n+they may\n+322 // have the wrong orientation. We want the triangle vertices on\n+counterclockwise order,\n+323 // when viewed from the outside of the grid. Therefore, we check the\n+orientation of the\n+324 // new face and possibly switch two vertices.\n+325 // Compute segment normal\n+326 reconstructedNormal = _\bc_\br_\bo_\bs_\bs_\bP_\br_\bo_\bd_\bu_\bc_\bt(cornerCoords[2] - cornerCoords[3],\n+327 cornerCoords[1] - cornerCoords[3]);\n+328 reconstructedNormal /= reconstructedNormal.two_norm();\n+329\n+330 if (realNormal * reconstructedNormal < 0.0)\n+331 std::swap(temp_faces.back().corners[0], temp_faces.back().corners[1]);\n+332\n+333 simplex_index+=2;\n+334 break;\n+335 }\n+336 default :\n+337 DUNE_THROW(Dune::NotImplemented, \"the extractor does only work for triangle\n+and quadrilateral faces (\" << face_corners << \" corners)\");\n+338 break;\n+339 }\n+340 } // end loop over found surface parts\n+341 }\n+342 } // end loop over elements\n+343\n+344 std::cout << \"added \" << simplex_index << \" subfaces\\n\";\n+345\n+346 // allocate the array for the face specific information...\n+347 this->subEntities_.resize(simplex_index);\n+348 // ...and fill in the data from the temporary containers\n+349 copy(temp_faces.begin(), temp_faces.end(), this->subEntities_.begin());\n+350 }\n+351\n+352\n+353 // now first write the array with the coordinates...\n+354 this->coords_.resize(this->vtxInfo_.size());\n+355 for (const auto& vinfo : this->vtxInfo_)\n+356 {\n+357 // get a pointer to the associated info object\n+358 CoordinateInfo* current = &this->coords_[vinfo.second.idx];\n+359 // store this coordinates index // NEEDED?\n+360 current->index = vinfo.second.idx;\n+361 // store the vertex' index for the index2vertex mapping\n+362 current->vtxindex = vinfo.first;\n+363 // store the vertex' coordinates under the associated index\n+364 // in the coordinates array\n+365 const auto vtx = this->grid().entity(vinfo.second.p);\n+366 current->coord = vtx.geometry().corner(0);\n+367 }\n+368\n+369}\n+370\n+371} // namespace GridGlue\n+372\n+373} // namespace Dune\n+374\n+375#endif // DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n+_\bc_\br_\bo_\bs_\bs_\bp_\br_\bo_\bd_\bu_\bc_\bt_\b._\bh_\bh\n+_\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b._\bh_\bh\n+extractor base class\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:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:35\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bC_\be_\bl_\bl_\bD_\ba_\bt_\ba\n-void writeCellData(const std::vector< T > &data, const char *dataname, int dim,\n-std::ofstream &fos)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:176\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bD_\ba_\bt_\ba\n-void writePointData(const std::vector< T > &data, const char *dataname, int\n-dim, std::ofstream &fos)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:190\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\ba_\bt_\ba\n-void writeSurfaceVertexData(const std::vector< K > &coords, const std::vector<\n-unsigned int > &indices, int corners, const std::vector< T > &data, const char\n-*dataname, int dim)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bs_\be_\bt_\bF_\bi_\bl_\be_\bn_\ba_\bm_\be\n-void setFilename(const char *name)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:45\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bD_\ba_\bt_\ba\n-void writeSurfaceElementData(const std::vector< K > &coords, const std::vector<\n-unsigned int > &indices, int corners, const std::vector< T > &data, const char\n-*dataname, int dim)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:73\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\b~_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br\n-~VtkSurfaceWriter()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:42\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br\n-VtkSurfaceWriter(const char *filename)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:39\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bS_\bu_\br_\bf_\ba_\bc_\be\n-void writeSurface(const std::vector< K > &coords, const std::vector< unsigned\n-int > &indices, int corners, int dim)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:53\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bP_\bo_\bi_\bn_\bt_\bs\n-void writePoints(const std::vector< K > &coords, int dim, std::ofstream &fos)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:116\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bV_\bt_\bk_\bS_\bu_\br_\bf_\ba_\bc_\be_\bW_\br_\bi_\bt_\be_\br_\b:_\b:_\bw_\br_\bi_\bt_\be_\bP_\bo_\bl_\by_\bg_\bo_\bn_\bs\n-void writePolygons(const std::vector< unsigned int > &indices, const int\n-*corners, int ncorners, int dim, std::ofstream &fos)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vtksurfacewriter.hh:129\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:_\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+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:42\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+Extractor< GV, 1 >::IndexType IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bG_\br_\bi_\bd_\bV_\bi_\be_\bw\n+GV GridView\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt\n+GV::Traits::template Codim< 0 >::Entity Element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bs\n+Dune::FieldVector< ctype, dimworld > Coords\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:59\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bt_\by_\bp_\be\n+GV::Grid::ctype ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:58\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br\n+Codim1Extractor(const GV &gv, const Predicate &predicate)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b__\bc_\bo_\br_\bn_\be_\br_\bs\n+static constexpr int simplex_corners\n+compile time number of corners of surface simplices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo\n+Extractor< GV, 1 >::VertexInfo VertexInfo\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bI_\bn_\bf_\bo\n+Extractor< GV, 1 >::CoordinateInfo CoordinateInfo\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:69\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bn_\bf_\bo\n+Extractor< GV, 1 >::ElementInfo ElementInfo\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bn_\bf_\bo\n+Extractor< GV, 1 >::SubEntityInfo SubEntityInfo\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:66\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo_\bM_\ba_\bp\n+Extractor< GV, 1 >::VertexInfoMap VertexInfoMap\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:70\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bP_\br_\be_\bd_\bi_\bc_\ba_\bt_\be\n+std::function< bool(const Element &, unsigned int subentity)> Predicate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:63\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b1_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n+GV::Traits::template Codim< dim >::Entity Vertex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn codim1extractor.hh:61\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 _\bG_\bV_\b,_\b _\b1_\b _\b>_\b:_\b:_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd\n+static constexpr auto dimworld\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:50\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:_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be\n+int IndexType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:73\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_\bV_\b,_\b _\b1_\b _\b>_\b:_\b:_\bc_\bu_\bb_\be_\b__\bc_\bo_\br_\bn_\be_\br_\bs\n+static constexpr int cube_corners\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:54\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_\bV_\b,_\b _\b1_\b _\b>_\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:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo_\bM_\ba_\bp\n+std::map< IndexType, VertexInfo > VertexInfoMap\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:186\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_\bV_\b,_\b _\b1_\b _\b>_\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:_\bE_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bI_\bn_\bf_\bo\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:94\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:_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bo\n+simple struct holding a vertex pointer and an index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:116\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:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bn_\bf_\bo\n+simple struct holding an element seed and an index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:128\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:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bn_\bf_\bo\n+Holds some information about an element's subentity involved in a coupling.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn extractor.hh:147\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/a00062.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00062.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: extractor.hh File Reference \n+dune-grid-glue: vtksurfacewriter.hh File Reference \n \n \n \n \n \n \n \n@@ -72,62 +72,42 @@\n dune grid-glue extractors \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+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n- 53 void writeSurface(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, int dim)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n- 73 void writeSurfaceElementData(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, const std::vector<T>& data, const char* dataname, int dim)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n+\n+\n \n-\n-\n-\n-
\n-\n-\n-\n-\n-\n+\n+\n+\n+ 94 void writeSurfaceVertexData(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, const std::vector<T>& data, const char* dataname, int dim)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 129 void writePolygons(const std::vector<unsigned int>& indices, const int* corners, int ncorners, int dim, std::ofstream& fos)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 176 void writeCellData(const std::vector<T>& data, const char* dataname, int dim, std::ofstream& fos)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n- 190 void writePointData(const std::vector<T>& data, const char* dataname, int dim, std::ofstream& fos)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 302 FieldVector<ctype,dimworld> reconstructedNormal = crossProduct(cornerCoords[1] - cornerCoords[0],
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 337 DUNE_THROW(Dune::NotImplemented, "the extractor does only work for triangle and quadrilateral faces (" << face_corners << " corners)");
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+extractor base class
Definition gridglue.hh:37
Definition vtksurfacewriter.hh:35
void writeCellData(const std::vector< T > &data, const char *dataname, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:176
void writePointData(const std::vector< T > &data, const char *dataname, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:190
void writeSurfaceVertexData(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, const std::vector< T > &data, const char *dataname, int dim)
Definition vtksurfacewriter.hh:94
void setFilename(const char *name)
Definition vtksurfacewriter.hh:45
void writeSurfaceElementData(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, const std::vector< T > &data, const char *dataname, int dim)
Definition vtksurfacewriter.hh:73
~VtkSurfaceWriter()
Definition vtksurfacewriter.hh:42
VtkSurfaceWriter(const char *filename)
Definition vtksurfacewriter.hh:39
void writeSurface(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, int dim)
Definition vtksurfacewriter.hh:53
void writePoints(const std::vector< K > &coords, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:116
void writePolygons(const std::vector< unsigned int > &indices, const int *corners, int ncorners, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:129
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
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
Definition codim1extractor.hh:42
Extractor< GV, 1 >::IndexType IndexType
Definition codim1extractor.hh:51
GV::Traits::template Codim< 0 >::Entity Element
Definition codim1extractor.hh:62
Dune::FieldVector< ctype, dimworld > Coords
Definition codim1extractor.hh:59
Codim1Extractor(const GV &gv, const Predicate &predicate)
Constructor.
Definition codim1extractor.hh:81
static constexpr int simplex_corners
compile time number of corners of surface simplices
Definition codim1extractor.hh:54
Extractor< GV, 1 >::VertexInfo VertexInfo
Definition codim1extractor.hh:68
Extractor< GV, 1 >::CoordinateInfo CoordinateInfo
Definition codim1extractor.hh:69
Extractor< GV, 1 >::ElementInfo ElementInfo
Definition codim1extractor.hh:67
Extractor< GV, 1 >::SubEntityInfo SubEntityInfo
Definition codim1extractor.hh:66
Extractor< GV, 1 >::VertexInfoMap VertexInfoMap
Definition codim1extractor.hh:70
std::function< bool(const Element &, unsigned int subentity)> Predicate
Definition codim1extractor.hh:63
GV::Traits::template Codim< dim >::Entity Vertex
Definition codim1extractor.hh:61
Provides codimension-independent methods for grid extraction.
Definition extractor.hh:46
static constexpr auto dimworld
Definition extractor.hh:50
static constexpr int cube_corners
Definition extractor.hh:54
std::map< IndexType, VertexInfo > VertexInfoMap
Definition extractor.hh:186
Definition extractor.hh:94
simple struct holding a vertex pointer and an index
Definition extractor.hh:116
simple struct holding an element seed and an index
Definition extractor.hh:128
Holds some information about an element's subentity involved in a coupling.
Definition extractor.hh:147
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,280 +1,470 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n-vtksurfacewriter.hh\n+codim1extractor.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 5/*\n-6 * Filename: VtkSurfaceWriter.hh\n+6 * Filename: codim1extractor.hh\n 7 * Version: 1.0\n-8 * Created on: Jan 16, 2009\n-9 * Author: Gerrit Buse\n+8 * Created on: Jun 23, 2009\n+9 * Author: Oliver Sander, Christian Engwer\n 10 * ---------------------------------\n 11 * Project: dune-grid-glue\n-12 * Description: helper class for graphical output of grids in generic\n-representation\n+12 * Description: class for grid extractors extracting surface grids\n 13 *\n 14 */\n-20#ifndef DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n-21#define DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n+20#ifndef DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n+21#define DUNE_GRIDGLUE_EXTRACTORS_CODIM1EXTRACTOR_HH\n 22\n-23#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- extractor.hh File Reference
vtksurfacewriter.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 Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,49 +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 * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-extractor.hh File Reference\n-extractor base class _\bM_\bo_\br_\be_\b._\b._\b.\n+vtksurfacewriter.hh File Reference\n+helper class for graphical output of grids in generic representation _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n #include \n-#include \n
extractor base class \n+
helper class for graphical output of grids in generic representation \n More...
\n-#include <vector>\n-
#include <map>\n-
#include <algorithm>\n-
#include <dune/common/exceptions.hh>\n-
#include <dune/common/fvector.hh>\n-
#include <dune/common/version.hh>\n-
#include <dune/grid/common/geometry.hh>\n-
#include <dune/grid/common/grid.hh>\n-
#include <dune/grid/common/mcmgmapper.hh>\n-
#include <dune/geometry/multilineargeometry.hh>\n+
#include <fstream>\n+
#include <iomanip>\n+
#include <vector>\n+
#include <cstring>\n+
#include "../adapter/gridgluevtkwriter.hh"\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::Extractor< GV, cd > |
| Provides codimension-independent methods for grid extraction. More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::CornerInfo |
| Helpful struct holding one index for the coordinate (vertex) to which it is associated and the element's corner index;. More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::CoordinateInfo |
| struct | Dune::GridGlue::Extractor< GV, cd >::VertexInfo |
| simple struct holding a vertex pointer and an index More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::ElementInfo |
| simple struct holding an element seed and an index More... | |
| struct | Dune::GridGlue::Extractor< GV, cd >::SubEntityInfo |
| Holds some information about an element's subentity involved in a coupling. More... | |
| class | Dune::GridGlue::VtkSurfaceWriter |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-extractor base class
\n+helper class for graphical output of grids in generic representation
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,49 +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 * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-extractor.hh File Reference\n-extractor base class _\bM_\bo_\br_\be_\b._\b._\b.\n+vtksurfacewriter.hh File Reference\n+helper class for graphical output of grids in generic representation _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n- \n+ \n
\n extractor.hh
vtksurfacewriter.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,587 +1,280 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n-extractor.hh\n+vtksurfacewriter.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 5/*\n-6 * Filename: extractor.hh\n+6 * Filename: VtkSurfaceWriter.hh\n 7 * Version: 1.0\n-8 * Created on: Oct 05, 2009\n-9 * Author: Christian Engwer\n+8 * Created on: Jan 16, 2009\n+9 * Author: Gerrit Buse\n 10 * ---------------------------------\n 11 * Project: dune-grid-glue\n-12 * Description: base class for all grid extractors\n+12 * Description: helper class for graphical output of grids in generic\n+representation\n 13 *\n 14 */\n-20#ifndef DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n-21#define DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n+20#ifndef DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n+21#define DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n 22\n-23#include \n-24#include
\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- 53 void writeSurface(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, int dim)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n+\n+
\n+\n+\n+\n+\n+\n \n+
\n+\n \n- 73 void writeSurfaceElementData(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, const std::vector<T>& data, const char* dataname, int dim)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n+\n+
\n-\n-\n-\n+
\n+\n+\n+\n+\n+ 94 void writeSurfaceVertexData(const std::vector<K>& coords, const std::vector<unsigned int>& indices, int corners, const std::vector<T>& data, const char* dataname, int dim)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n 118 fos << "DATASET POLYDATA\\nPOINTS " << coords.size() << " " << TypeNames[Nametraits<K>::nameidx] << std::endl;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-
\n-\n-\n-\n-\n-\n-\n-\n- 129 ElementInfo(unsigned int idx_, const Element& p_, unsigned int f_) : idx(idx_), faces(f_), p(p_.seed())
\n-\n+ 129 void writePolygons(const std::vector<unsigned int>& indices, const int* corners, int ncorners, int dim, std::ofstream& fos)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n \n-\n-\n+\n+\n+
\n+\n+\n+ 176 void writeCellData(const std::vector<T>& data, const char* dataname, int dim, std::ofstream& fos)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n 190 void writePointData(const std::vector<T>& data, const char* dataname, int dim, std::ofstream& fos)
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n- 409typename Extractor<GV,cd>::LocalGeometry Extractor<GV,cd>::geometryLocal(unsigned int index) const
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-Definition gridglue.hh:37
Provides codimension-independent methods for grid extraction.
Definition extractor.hh:46
GV::Traits::template Codim< dim >::Entity Vertex
Definition extractor.hh:63
VertexInfoMap vtxInfo_
a map enabling faster access to vertices and coordinates
Definition extractor.hh:206
Element element(unsigned int index) const
gets the parent element for a given face index, throws an exception if index not valid
Definition extractor.hh:361
int indexInInside(unsigned int index) const
gets the number face in the parent element
Definition extractor.hh:326
Dune::FieldVector< ctype, dim > LocalCoords
Definition extractor.hh:61
LocalGeometry geometryLocal(unsigned int index) const
Get geometry of the extracted face in element coordinates.
Definition extractor.hh:409
Dune::MultiLinearGeometry< ctype, dim-codim, dimworld > Geometry
Definition extractor.hh:77
std::vector< CoordinateInfo > coords_
all information about the corner vertices of the extracted
Definition extractor.hh:196
GV::Traits::template Codim< 0 >::Entity Element
Definition extractor.hh:66
const GridView & gridView() const
give access to the Dune::GridView where this Patch belongs to
Definition extractor.hh:344
void getFaces(std::vector< VertexVector > &faces) const
Get the corners of the extracted subentities.
Definition extractor.hh:285
std::vector< unsigned int > VertexVector
Definition extractor.hh:69
const GridView gv_
the grid object to extract the surface from
Definition extractor.hh:191
std::vector< SubEntityInfo > subEntities_
all information about the extracted subEntities
Definition extractor.hh:199
Vertex vertex(unsigned int index) const
gets the vertex for a given coordinate index throws an exception if index not valid
Definition extractor.hh:377
Dune::FieldVector< ctype, dimworld > Coords
Definition extractor.hh:60
void getGeometryTypes(std::vector< Dune::GeometryType > &geometryTypes) const
Get the list of geometry types.
Definition extractor.hh:274
MultipleCodimMultipleGeomTypeMapper< GridView > CellMapper
Definition extractor.hh:70
std::map< IndexType, VertexInfo > VertexInfoMap
Definition extractor.hh:186
bool faceIndices(const Element &e, int &first, int &count) const
gets index of first subentity as well as the total number of subentities that were extracted from thi...
Definition extractor.hh:304
Geometry geometry(unsigned int index) const
Get world geometry of the extracted face.
Definition extractor.hh:397
unsigned int nCoords() const
getter for the count of coordinates
Definition extractor.hh:268
std::map< IndexType, ElementInfo > ElementInfoMap
Definition extractor.hh:185
void getCoords(std::vector< Dune::FieldVector< ctype, dimworld > > &coords) const
getter for the coordinates array
Definition extractor.hh:256
ElementInfoMap elmtInfo_
a map enabling faster access to elements and faces
Definition extractor.hh:213
void clear()
delete everything build up so far and free the memory
Definition extractor.hh:235
Dune::MultiLinearGeometry< ctype, dim-codim, dim > LocalGeometry
Definition extractor.hh:78
Helpful struct holding one index for the coordinate (vertex) to which it is associated and the elemen...
Definition extractor.hh:88
unsigned int idx
index of the vertex
Definition extractor.hh:89
Definition extractor.hh:94
CoordinateInfo(unsigned int index_, IndexType vtxindex_)
Definition extractor.hh:98
unsigned int index
the index of this coordinate (in internal storage scheme) // NEEDED??
Definition extractor.hh:109
Coords coord
the coordinate
Definition extractor.hh:106
IndexType vtxindex
the index of the parent element (from index set)
Definition extractor.hh:103
simple struct holding a vertex pointer and an index
Definition extractor.hh:116
VertexInfo(unsigned int idx_, const Vertex &p_)
Definition extractor.hh:117
simple struct holding an element seed and an index
Definition extractor.hh:128
unsigned int idx
the index of this element's first face in the internal list of extracted faces
Definition extractor.hh:133
unsigned int faces
the number of extracted faces for this element
Definition extractor.hh:136
ElementInfo(unsigned int idx_, const Element &p_, unsigned int f_)
Definition extractor.hh:129
ElementSeed p
the entity seed for the element
Definition extractor.hh:139
Holds some information about an element's subentity involved in a coupling.
Definition extractor.hh:147
unsigned int nCorners() const
Definition extractor.hh:161
CornerInfo corners[cube_corners]
the corner indices plus the numbers of the vertices in the parent element
Definition extractor.hh:181
IndexType parent
the index of the parent element (from index set)
Definition extractor.hh:167
SubEntityInfo(IndexType parent_, unsigned int num_in_parent_, const Dune::GeometryType &geometryType)
Definition extractor.hh:156
unsigned int num_in_parent
the number of the face in the parent element
Definition extractor.hh:170
Dune::GeometryType geometryType_
The GeometryType of the subentity.
Definition extractor.hh:173
Definition vtksurfacewriter.hh:35
void writeCellData(const std::vector< T > &data, const char *dataname, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:176
void writePointData(const std::vector< T > &data, const char *dataname, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:190
void writeSurfaceVertexData(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, const std::vector< T > &data, const char *dataname, int dim)
Definition vtksurfacewriter.hh:94
void setFilename(const char *name)
Definition vtksurfacewriter.hh:45
void writeSurfaceElementData(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, const std::vector< T > &data, const char *dataname, int dim)
Definition vtksurfacewriter.hh:73
~VtkSurfaceWriter()
Definition vtksurfacewriter.hh:42
VtkSurfaceWriter(const char *filename)
Definition vtksurfacewriter.hh:39
void writeSurface(const std::vector< K > &coords, const std::vector< unsigned int > &indices, int corners, int dim)
Definition vtksurfacewriter.hh:53
void writePoints(const std::vector< K > &coords, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:116
void writePolygons(const std::vector< unsigned int > &indices, const int *corners, int ncorners, int dim, std::ofstream &fos)
Definition vtksurfacewriter.hh:129
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,587 +1,280 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\be_\bx_\bt_\br_\ba_\bc_\bt_\bo_\br_\bs\n-extractor.hh\n+vtksurfacewriter.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 5/*\n-6 * Filename: extractor.hh\n+6 * Filename: VtkSurfaceWriter.hh\n 7 * Version: 1.0\n-8 * Created on: Oct 05, 2009\n-9 * Author: Christian Engwer\n+8 * Created on: Jan 16, 2009\n+9 * Author: Gerrit Buse\n 10 * ---------------------------------\n 11 * Project: dune-grid-glue\n-12 * Description: base class for all grid extractors\n+12 * Description: helper class for graphical output of grids in generic\n+representation\n 13 *\n 14 */\n-20#ifndef DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n-21#define DUNE_GRIDGLUE_EXTRACTORS_EXTRACTOR_HH\n+20#ifndef DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n+21#define DUNE_GRIDGLUE_EXTRACTORS_VTKSURFACEWRITER_HH\n 22\n-23#include \n \n- \n+ \n
\n standardmerge.cc File Reference
simplexintersection.cc File Reference
\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,52 +1,65 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\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-standardmerge.cc File Reference\n-#include \"config.h\"\n-#include \"_\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh\"\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\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+simplexintersection.cc 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:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\bd_\bi_\bm_\b1_\b,_\b _\bd_\bi_\bm_\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b0_\b,_\b _\bT_\b _\b>\n \u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bE_\bC_\bL\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b1_\b,_\b _\bT_\b _\b>\n \u00a0\n-#define\u00a0 _\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE(T, A, B, C)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 1, 1, 1)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b1_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b2_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 2, 2, 2)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b2_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n \u00a0\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 3, 3, 3)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b3_\b,_\b _\b3_\b,_\b _\bT_\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+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn (std::integral_constant< int, 0 >,\n+ const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners,\n+ std::vector< std::vector< unsigned int > > &subElements, std::vector<\n+ std::vector< int > > &faceIds)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn (std::integral_constant< int, 1 >,\n+ const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners,\n+ std::vector< std::vector< unsigned int > > &subElements, std::vector<\n+ std::vector< int > > &faceIds)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn (std::integral_constant< int, 2 >,\n+ const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners,\n+ std::vector< std::vector< unsigned int > > &subElements, std::vector<\n+ std::vector< int > > &faceIds)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn (std::integral_constant< int, 3 >,\n+ const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners,\n+ std::vector< std::vector< unsigned int > > &subElements, std::vector<\n+ std::vector< int > > &faceIds)\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\u00a0D\bDE\bEC\bCL\bL *\b**\b**\b**\b**\b*\n-#define DECL\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0S\bST\bTA\bAN\bND\bDA\bAR\bRD\bD_\b_M\bME\bER\bRG\bGE\bE_\b_I\bIN\bNS\bST\bTA\bAN\bNT\bTI\bIA\bAT\bTE\bE *\b**\b**\b**\b**\b*\n-#define STANDARD_MERGE_INSTANTIATE ( \u00a0 T,\n- \u00a0 A,\n- \u00a0 B,\n- \u00a0 C\u00a0\n- )\n-V\bVa\bal\blu\bue\be:\b:\n-_\bD_\bE_\bC_\bL template \\\n-void StandardMerge::build(const std::vector >&\n-grid1_coords, \\\n-const std::vector& grid1_elements, \\\n-const std::vector& grid1_element_types, \\\n-const std::vector >& grid2_coords, \\\n-const std::vector& grid2_elements, \\\n-const std::vector& grid2_element_types \\\n-)\n-_\bD_\bE_\bC_\bL\n-#define DECL\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standardmerge.cc:12\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/a00068.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00068.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: contactmerge.hh File Reference \n+dune-grid-glue: conformingmerge.hh File Reference \n \n \n \n \n \n \n \n@@ -72,54 +72,46 @@\n dune grid-glue merging \n \n \n \n \n
\n+Classes | |
| class | Dune::GridGlue::SimplexMethod< dimWorld, dim1, dim2, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 0, 0, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 0, 1, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 0, 2, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 0, 3, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 1, 1, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 1, 2, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 1, 3, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 2, 2, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 2, 3, T > |
| class | Dune::GridGlue::SimplexMethod< dimWorld, 3, 3, T > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n-Macros | |
| #define | DECL |
| #define | STANDARD_MERGE_INSTANTIATE(T, A, B, C) |
\n Functions | |
| Dune::GridGlue::STANDARD_MERGE_INSTANTIATE (double, 1, 1, 1) | |
| Dune::GridGlue::STANDARD_MERGE_INSTANTIATE (double, 2, 2, 2) | |
| Dune::GridGlue::STANDARD_MERGE_INSTANTIATE (double, 3, 3, 3) | |
| template<int dimworld, typename T > | |
| void | Dune::GridGlue::simplexSubdivision (std::integral_constant< int, 0 >, const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds) |
| template<int dimworld, typename T > | |
| void | Dune::GridGlue::simplexSubdivision (std::integral_constant< int, 1 >, const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds) |
| template<int dimworld, typename T > | |
| void | Dune::GridGlue::simplexSubdivision (std::integral_constant< int, 2 >, const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds) |
| template<int dimworld, typename T > | |
| void | Dune::GridGlue::simplexSubdivision (std::integral_constant< int, 3 >, const std::vector< Dune::FieldVector< T, dimworld > > &elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds) |
Macro Definition Documentation
\n-\n-◆ DECL
\n-\n-\n-
\n-\n-\n- \n-
\n-
| #define DECL | \n-
\n-\n-
\n-◆ STANDARD_MERGE_INSTANTIATE
\n-\n-\n-
\n \n \n \n- \n-
\n-
| #define STANDARD_MERGE_INSTANTIATE | \n-( | \n-\n- | T, | \n-
| \n- | \n- | \n- | A, | \n-
| \n- | \n- | \n- | B, | \n-
| \n- | \n- | \n- | C | \n-
| \n- | ) | \n-\n- |
\n-Value:\n-
\n- DECL template \\
\n- void StandardMerge<T,A,B,C>::build(const std::vector<Dune::FieldVector<T,C> >& grid1_coords, \\
\n- const std::vector<unsigned int>& grid1_elements, \\
\n- const std::vector<Dune::GeometryType>& grid1_element_types, \\
\n- const std::vector<Dune::FieldVector<T,C> >& grid2_coords, \\
\n- const std::vector<unsigned int>& grid2_elements, \\
\n- const std::vector<Dune::GeometryType>& grid2_element_types \\
\n- )
\n-\n-\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,52 +1,65 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\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-standardmerge.cc File Reference\n-#include \"config.h\"\n-#include \"_\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh\"\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\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+simplexintersection.cc 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:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\bd_\bi_\bm_\b1_\b,_\b _\bd_\bi_\bm_\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b0_\b,_\b _\bT_\b _\b>\n \u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bE_\bC_\bL\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b1_\b,_\b _\bT_\b _\b>\n \u00a0\n-#define\u00a0 _\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE(T, A, B, C)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 1, 1, 1)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b0_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b1_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b1_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b2_\b,_\b _\b2_\b,_\b _\bT_\b _\b>\n \u00a0\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 2, 2, 2)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b2_\b,_\b _\b3_\b,_\b _\bT_\b _\b>\n \u00a0\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bT_\bA_\bN_\bD_\bA_\bR_\bD_\b__\bM_\bE_\bR_\bG_\bE_\b__\bI_\bN_\bS_\bT_\bA_\bN_\bT_\bI_\bA_\bT_\bE (double, 3, 3, 3)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\b3_\b,_\b _\b3_\b,_\b _\bT_\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 \n+ \n
\n \n Classes |\n Namespaces
\n- contactmerge.hh File Reference
conformingmerge.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 \n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,40 +2,31 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-contactmerge.hh File Reference\n-Merge two grid boundary surfaces that may be a positive distance apart. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n+conformingmerge.hh File Reference\n+Implementation of the Merger concept for conforming interfaces. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n #include \n #include \n-#include \n-#include \n-#include \n+#include \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/_\bm_\be_\br_\bg_\bi_\bn_\bg_\b/_\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh>\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 \"_\bc_\bo_\bn_\bt_\ba_\bc_\bt_\bm_\be_\br_\bg_\be_\b._\bc_\bc\"\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:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b<_\b _\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd_\b,_\b _\bT_\b _\b>\n-\u00a0 Merge two codimension-1 surfaces that may be a positive distance apart.\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:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b<_\b _\bd_\bi_\bm_\b,_\b _\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd_\b,_\b _\bT_\b _\b>\n+\u00a0 Implementation of the _\bM_\be_\br_\bg_\be_\br concept for conforming interfaces. _\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-Merge two grid boundary surfaces that may be a positive distance apart.\n+Implementation of the Merger concept for conforming interfaces.\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/a00068_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00068_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: contactmerge.hh Source File \n+dune-grid-glue: conformingmerge.hh Source File \n \n \n \n \n \n \n \n@@ -74,235 +74,220 @@\n \n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,304 +1,253 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n-contactmerge.hh\n+conformingmerge.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-10#ifndef DUNE_GRIDGLUE_MERGING_CONTACTMERGE_HH\n-11#define DUNE_GRIDGLUE_MERGING_CONTACTMERGE_HH\n-12\n-13\n-14#include \n-15#include \n-16#include \n-17#include \n-18#include \n-19#include \n-20#include \n-21#include \n-22\n-23#include \n-24#include \n-25#include \n-26#include \n-27\n-28#include \n-29\n-30#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bm_\be_\br_\bg_\bi_\bn_\bg_\b/_\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh>\n-31#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-32\n-33namespace _\bD_\bu_\bn_\be {\n-34namespace GridGlue {\n+5/*\n+6 * Filename: conformingmerge.hh\n+7 * Version: 1.0\n+8 * Created on: Sep 14, 2009\n+9 * Author: Oliver Sander\n+10 * ---------------------------------\n+11 * Project: dune-grid-glue\n+12 * Description: implementation of the Merger concept for conforming\n+interfaces\n+13 *\n+14 */\n+21#ifndef DUNE_GRIDGLUE_MERGING_CONFORMINGMERGE_HH\n+22#define DUNE_GRIDGLUE_MERGING_CONFORMINGMERGE_HH\n+23\n+24#include \n+25#include \n+26#include \n+27#include \n+28\n+29#include \n+30#include \n+31\n+32#include \n+33\n+34#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bm_\be_\br_\bg_\bi_\bn_\bg_\b/_\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh>\n 35\n-41template\n-_\b4_\b2class _\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be\n-43: public _\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be\n-44{\n-45 static constexpr int dim = dimworld-1;\n-46\n-47 static_assert( dim==1 || dim==2,\n-48 \"ContactMerge yet only handles the cases dim==1 and dim==2!\");\n-49\n-50 typedef _\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b<_\bT_\b,_\bd_\bi_\bm_\b,_\bd_\bi_\bm_\b,_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd_\b> _\bB_\ba_\bs_\be;\n+36namespace _\bD_\bu_\bn_\be {\n+37\n+38 namespace GridGlue {\n+39\n+46template\n+_\b4_\b7class _\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be\n+48 : public _\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be\n+49{\n+50\n 51public:\n 52\n 53 /* E X P O R T E D T Y P E S A N D C O N S T A N T S */\n 54\n _\b5_\b6 typedef T _\bc_\bt_\by_\bp_\be;\n 57\n _\b5_\b9 typedef Dune::FieldVector _\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs;\n 60\n _\b6_\b2 typedef Dune::FieldVector _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bs;\n 63\n-_\b6_\b5 enum _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bT_\by_\bp_\be {_\bO_\bU_\bT_\bE_\bR_\b__\bN_\bO_\bR_\bM_\bA_\bL, _\bC_\bL_\bO_\bS_\bE_\bS_\bT_\b__\bP_\bO_\bI_\bN_\bT};\n-_\b7_\b3 _\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be(const T allowedOverlap=T(0),\n-74 std::function<_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs(_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs)> domainDirections=nullptr,\n-75 std::function<_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs(_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs)> targetDirections=nullptr,\n-76 _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bT_\by_\bp_\be type = _\bO_\bU_\bT_\bE_\bR_\b__\bN_\bO_\bR_\bM_\bA_\bL)\n-77 : domainDirections_(domainDirections), targetDirections_(targetDirections),\n-78 overlap_(allowedOverlap), type_(type)\n-79 {}\n-80\n-_\b8_\b6 _\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be(const T allowedOverlap, _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bT_\by_\bp_\be type)\n-87 : overlap_(allowedOverlap),\n-88 type_(type)\n-89 {}\n+64private:\n+65\n+66 /* M E M B E R V A R I A B L E S */\n+67\n+69 T tolerance_;\n+70\n+71 typedef typename _\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b<_\bT_\b,_\bd_\bi_\bm_\b,_\bd_\bi_\bm_\b,_\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd_\b>_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\bi_\bc_\bi_\ba_\bl_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+SimplicialIntersection;\n+72\n+77 void computeIntersections(const Dune::GeometryType& grid1ElementType,\n+78 const std::vector >& grid1ElementCorners,\n+79 std::bitset<(1<& neighborIntersects1,\n+80 unsigned int grid1Index,\n+81 const Dune::GeometryType& grid2ElementType,\n+82 const std::vector >& grid2ElementCorners,\n+83 std::bitset<(1<& neighborIntersects2,\n+84 unsigned int grid2Index,\n+85 std::vector& intersections);\n+86\n+87public:\n+88\n+_\b8_\b9 static constexpr T _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be = 1e-4;\n 90\n-99 inline\n-_\b1_\b0_\b0 void _\bs_\be_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bD_\bi_\br_\be_\bc_\bt_\bi_\bo_\bn_\bs(std::function<_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs(_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs)>\n-domainDirections,\n-101 std::function<_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs(_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs)> targetDirections)\n-102 {\n-103 domainDirections_ = domainDirections;\n-104 targetDirections_ = targetDirections;\n-105 this->_\bv_\ba_\bl_\bi_\bd = false;\n-106 }\n-107\n-_\b1_\b0_\b9 void _\bs_\be_\bt_\bO_\bv_\be_\br_\bl_\ba_\bp(T overlap)\n-110 {\n-111 overlap_ = overlap;\n-112 }\n-113\n-_\b1_\b1_\b5 T _\bg_\be_\bt_\bO_\bv_\be_\br_\bl_\ba_\bp() const\n-116 {\n-117 return overlap_;\n-118 }\n-119\n-_\b1_\b2_\b3 void _\bm_\bi_\bn_\bN_\bo_\br_\bm_\ba_\bl_\bA_\bn_\bg_\bl_\be(T angle)\n-124 {\n-125 using std::cos;\n-126 maxNormalProduct_ = cos(angle);\n-127 }\n-128\n-_\b1_\b3_\b2 T _\bm_\bi_\bn_\bN_\bo_\br_\bm_\ba_\bl_\bA_\bn_\bg_\bl_\be() const\n-133 {\n-134 using std::acos;\n-135 return acos(maxNormalProduct_);\n-136 }\n-137\n-138protected:\n-_\b1_\b3_\b9 typedef typename _\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b:_\b:\n-_\bS_\bi_\bm_\bp_\bl_\bi_\bc_\bi_\ba_\bl_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn _\bS_\bi_\bm_\bp_\bl_\bi_\bc_\bi_\ba_\bl_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn;\n+_\b9_\b1 _\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be(T tolerance = _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be) :\n+92 tolerance_(tolerance)\n+93 {}\n+94};\n+95\n+96template\n+97constexpr T _\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b<_\bd_\bi_\bm_\b,_\b _\bd_\bi_\bm_\bw_\bo_\br_\bl_\bd_\b,_\b _\bT_\b>_\b:_\b:_\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be;\n+98\n+99template\n+100void ConformingMerge::computeIntersections(const Dune::\n+GeometryType& grid1ElementType,\n+101 const std::vector >& grid1ElementCorners,\n+102 std::bitset<(1<& neighborIntersects1,\n+103 unsigned int grid1Index,\n+104 const Dune::GeometryType& grid2ElementType,\n+105 const std::vector >& grid2ElementCorners,\n+106 std::bitset<(1<& neighborIntersects2,\n+107 unsigned int grid2Index,\n+108 std::vector& _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs)\n+109{\n+110 this->counter++;\n+111\n+112 // A few consistency checks\n+113 assert((unsigned int)(Dune::ReferenceElements::general\n+(grid1ElementType).size(dim)) == grid1ElementCorners.size());\n+114 assert((unsigned int)(Dune::ReferenceElements::general\n+(grid2ElementType).size(dim)) == grid2ElementCorners.size());\n+115 // any intersection we may find will be the entire elements.\n+116 neighborIntersects1.reset();\n+117 neighborIntersects2.reset();\n+118\n+119 // the intersection is either conforming or empty, hence the GeometryTypes\n+have to match\n+120 if (grid1ElementType != grid2ElementType)\n+121 return;\n+122\n+123 // ////////////////////////////////////////////////////////////\n+124 // Find correspondences between the different corners\n+125 // ////////////////////////////////////////////////////////////\n+126 std::vector other(grid1ElementCorners.size(), -1);\n+127\n+128 for (unsigned int i=0; i domainDirections_;\n-146 std::vector nodalDomainDirections_;\n-147\n-156 std::function<_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs(_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs)> targetDirections_;\n-157 std::vector nodalTargetDirections_;\n-158\n-160 T overlap_;\n-161\n-163 _\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bT_\by_\bp_\be type_;\n+141 // No corresponding grid2 vertex found for this grid1 vertex\n+142 if (other[i] == -1)\n+143 return;\n+144\n+145 }\n+146\n+147 // ////////////////////////////////////////////////////////////\n+148 // Set up the new remote intersection\n+149 // ////////////////////////////////////////////////////////////\n+150\n+151 const auto& refElement = Dune::ReferenceElements::general\n+(grid1ElementType);\n+152\n+154 if (grid1ElementType.isSimplex()) {\n+155\n+156 _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs.emplace_back(grid1Index, grid2Index);\n+157\n+158 for (int i=0; i >& grid1ElementCorners,\n-176 std::bitset<(1<& neighborIntersects1,\n-177 unsigned int grid1Index,\n-178 const Dune::GeometryType& grid2ElementType,\n-179 const std::vector >& grid2ElementCorners,\n-180 std::bitset<(1<& neighborIntersects2,\n-181 unsigned int grid2Index,\n-182 std::vector& intersections) override;\n-183\n-187protected:\n-_\b1_\b8_\b8 void _\bb_\bu_\bi_\bl_\bd(const std::vector >& grid1Coords,\n-189 const std::vector& grid1Elements,\n-190 const std::vector& grid1ElementTypes,\n-191 const std::vector >& grid2Coords,\n-192 const std::vector& grid2Elements,\n-193 const std::vector& grid2ElementTypes) override\n-194 {\n-195 std::cout<<\"ContactMerge building grid!\\n\";\n-196 // setup the nodal direction vectors\n-197 _\bs_\be_\bt_\bu_\bp_\bN_\bo_\bd_\ba_\bl_\bD_\bi_\br_\be_\bc_\bt_\bi_\bo_\bn_\bs(grid1Coords, grid1Elements, grid1ElementTypes,\n-198 grid2Coords, grid2Elements, grid2ElementTypes);\n+170 SimplicialIntersection newSimplicialIntersection(grid1Index, grid2Index);\n+171\n+172 for (int j=0; j::general(gt);\n-211 return ref.position(i,dim);\n-212 }\n-213\n-214protected:\n-215\n-217 void _\bc_\bo_\bm_\bp_\bu_\bt_\be_\bC_\by_\bc_\bl_\bi_\bc_\bO_\br_\bd_\be_\br(const std::vector >&\n-polytopeCorners,\n-218 const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bs& center, std::vector& ordering) const;\n-219\n-221 void _\bs_\be_\bt_\bu_\bp_\bN_\bo_\bd_\ba_\bl_\bD_\bi_\br_\be_\bc_\bt_\bi_\bo_\bn_\bs(const std::vector& coords1,\n-222 const std::vector& elements1,\n-223 const std::vector& elementTypes1,\n-224 const std::vector& coords2,\n-225 const std::vector& elements2,\n-226 const std::vector& elementTypes2);\n-227\n-229 void _\bc_\bo_\bm_\bp_\bu_\bt_\be_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl_\bF_\bi_\be_\bl_\bd(const std::vector& coords,\n-230 const std::vector& elements,\n-231 const std::vector& elementTypes,\n-232 std::vector& normals);\n-233\n-235 void _\br_\be_\bm_\bo_\bv_\be_\bD_\bo_\bu_\bb_\bl_\be_\bs(std::vector >&\n-polytopeCorners);\n-236};\n-237\n-238} /* namespace GridGlue */\n-239} /* namespace Dune */\n-240\n-241#include \"_\bc_\bo_\bn_\bt_\ba_\bc_\bt_\bm_\be_\br_\bg_\be_\b._\bc_\bc\"\n-242\n-243#endif // DUNE_GRIDGLUE_MERGING_CONTACTMERGE_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-_\bc_\bo_\bn_\bt_\ba_\bc_\bt_\bm_\be_\br_\bg_\be_\b._\bc_\bc\n+207} // namespace Dune\n+208\n+209#endif // DUNE_GRIDGLUE_MERGING_CONFORMINGMERGE_HH\n _\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bm_\be_\br_\bg_\be_\b._\bh_\bh\n Common base class for many merger implementations: produce pairs of entities\n that may intersect.\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:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be\n-Merge two codimension-1 surfaces that may be a positive distance apart.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:44\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bc_\bo_\bm_\bp_\bu_\bt_\be_\bC_\by_\bc_\bl_\bi_\bc_\bO_\br_\bd_\be_\br\n-void computeCyclicOrder(const std::vector< std::array< LocalCoords, 2 > >\n-&polytopeCorners, const LocalCoords ¢er, std::vector< int > &ordering)\n-const\n-Order the corners of the intersection polytope in cyclic order.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.cc:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\bi_\bc_\bi_\ba_\bl_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n-StandardMerge< T, dimworld-1, dimworld-1, dimworld >::SimplicialIntersection\n-SimplicialIntersection\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:139\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\br_\be_\bm_\bo_\bv_\be_\bD_\bo_\bu_\bb_\bl_\be_\bs\n-void removeDoubles(std::vector< std::array< LocalCoords, 2 > >\n-&polytopeCorners)\n-Remove all multiples.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.cc:335\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bs_\be_\bt_\bO_\bv_\be_\br_\bl_\ba_\bp\n-void setOverlap(T overlap)\n-Set the allowed overlap of the surfaces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:109\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs\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:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be\n+Implementation of the Merger concept for conforming interfaces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:49\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bs\n+Dune::FieldVector< T, dim > LocalCoords\n+the coordinate type used in this interface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b:_\b:_\bW_\bo_\br_\bl_\bd_\bC_\bo_\bo_\br_\bd_\bs\n Dune::FieldVector< T, dimworld > WorldCoords\n the coordinate type used in this interface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:59\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bs_\be_\bt_\bu_\bp_\bN_\bo_\bd_\ba_\bl_\bD_\bi_\br_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-void setupNodalDirections(const std::vector< WorldCoords > &coords1, const\n-std::vector< unsigned int > &elements1, const std::vector< Dune::GeometryType >\n-&elementTypes1, const std::vector< WorldCoords > &coords2, const std::vector<\n-unsigned int > &elements2, const std::vector< Dune::GeometryType >\n-&elementTypes2)\n-Setup the direction vectors containing the directions for each vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.cc:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bm_\bi_\bn_\bN_\bo_\br_\bm_\ba_\bl_\bA_\bn_\bg_\bl_\be\n-void minNormalAngle(T angle)\n-set minimum angle in radians between normals at x and \u00ce\u00a6(x)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:123\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bc_\bt_\by_\bp_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:59\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b:_\b:_\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be\n+static constexpr T default_tolerance\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:89\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b:_\b:_\bc_\bt_\by_\bp_\be\n T ctype\n the numeric type used in this interface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:56\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bP_\br_\bo_\bj_\be_\bc_\bt_\bi_\bo_\bn_\bT_\by_\bp_\be\n-ProjectionType\n-Type of the projection, closest point or outer normal projection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bC_\bL_\bO_\bS_\bE_\bS_\bT_\b__\bP_\bO_\bI_\bN_\bT\n-@ CLOSEST_POINT\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bO_\bU_\bT_\bE_\bR_\b__\bN_\bO_\bR_\bM_\bA_\bL\n-@ OUTER_NORMAL\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bc_\bo_\bm_\bp_\bu_\bt_\be_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl_\bF_\bi_\be_\bl_\bd\n-void computeOuterNormalField(const std::vector< WorldCoords > &coords, const\n-std::vector< unsigned int > &elements, const std::vector< Dune::GeometryType >\n-&elementTypes, std::vector< WorldCoords > &normals)\n-If no direction field was specified compute the outer normal field.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.cc:296\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bg_\be_\bt_\bO_\bv_\be_\br_\bl_\ba_\bp\n-T getOverlap() const\n-Get the allowed overlap of the surfaces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:115\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be\n-ContactMerge(const T allowedOverlap=T(0), std::function< WorldCoords\n-(WorldCoords)> domainDirections=nullptr, std::function< WorldCoords\n-(WorldCoords)> targetDirections=nullptr, ProjectionType type=OUTER_NORMAL)\n-Construct merger given overlap and possible projection directions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:73\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bs_\be_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bD_\bi_\br_\be_\bc_\bt_\bi_\bo_\bn_\bs\n-void setSurfaceDirections(std::function< WorldCoords(WorldCoords)>\n-domainDirections, std::function< WorldCoords(WorldCoords)> targetDirections)\n-Set surface direction functions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n-void build(const std::vector< Dune::FieldVector< T, dimworld > > &grid1Coords,\n-const std::vector< unsigned int > &grid1Elements, const std::vector< Dune::\n-GeometryType > &grid1ElementTypes, const std::vector< Dune::FieldVector< T,\n-dimworld > > &grid2Coords, const std::vector< unsigned int > &grid2Elements,\n-const std::vector< Dune::GeometryType > &grid2ElementTypes) override\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:188\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be\n-ContactMerge(const T allowedOverlap, ProjectionType type)\n-Construct merger given overlap and type of the projection.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bm_\bi_\bn_\bN_\bo_\br_\bm_\ba_\bl_\bA_\bn_\bg_\bl_\be\n-T minNormalAngle() const\n-get minimum angle in radians between normals at x and \u00ce\u00a6(x)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:132\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bt_\ba_\bc_\bt_\bM_\be_\br_\bg_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bs\n-Dune::FieldVector< T, dim > LocalCoords\n-the coordinate type used in this interface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn contactmerge.hh:62\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be_\b:_\b:_\bC_\bo_\bn_\bf_\bo_\br_\bm_\bi_\bn_\bg_\bM_\be_\br_\bg_\be\n+ConformingMerge(T tolerance=default_tolerance)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conformingmerge.hh:91\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be\n Common base class for many merger implementations: produce pairs of entities\n that may intersect.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standardmerge.hh:58\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n-void build(const std::vector< Dune::FieldVector< T, dimworld > > &grid1_Coords,\n-const std::vector< unsigned int > &grid1_elements, const std::vector< Dune::\n-GeometryType > &grid1_element_types, const std::vector< Dune::FieldVector< T,\n-dimworld > > &grid2_coords, const std::vector< unsigned int > &grid2_elements,\n-const std::vector< Dune::GeometryType > &grid2_element_types) override\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standardmerge.hh:392\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b:_\b:_\bv_\ba_\bl_\bi_\bd\n-bool valid\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standardmerge.hh:86\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\be_\br_\bg_\be_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\bi_\bc_\bi_\ba_\bl_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn\n+typename IntersectionListProvider::SimplicialIntersection\n+SimplicialIntersection\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standardmerge.hh:83\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/a00071.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00071.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: computeintersection.hh File Reference \n+dune-grid-glue: contactmerge.cc File Reference \n \n \n \n \n \n \n \n@@ -70,47 +70,29 @@\n \n
\n \n+ Merge two grid boundary surfaces that may be a positive distance apart. \n+
Implementation of the Merger concept for conforming interfaces. \n More...
\n-#include <iostream>\n-
#include <fstream>\n-
#include <iomanip>\n+
#include <iomanip>\n
#include <vector>\n
#include <algorithm>\n-
#include <limits>\n-
#include <memory>\n-
#include <functional>\n+
#include <bitset>\n+
#include <dune/common/fmatrix.hh>\n
#include <dune/common/fvector.hh>\n-
#include <dune/common/exceptions.hh>\n-
#include <dune/common/bitsetvector.hh>\n-
#include <dune/common/deprecated.hh>\n-
#include <dune/grid/common/grid.hh>\n-
#include <dune/grid-glue/merging/standardmerge.hh>\n-
#include <dune/grid-glue/gridglue.hh>\n-
#include "contactmerge.cc"\n+
#include <dune/geometry/referenceelements.hh>\n+
#include <dune/grid-glue/merging/standardmerge.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::ContactMerge< dimworld, T > |
| Merge two codimension-1 surfaces that may be a positive distance apart. More... | |
| class | Dune::GridGlue::ConformingMerge< dim, dimworld, T > |
| Implementation of the Merger concept for conforming interfaces. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
Detailed Description
\n-Merge two grid boundary surfaces that may be a positive distance apart.
\n+Implementation of the Merger concept for conforming interfaces.
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,40 +2,31 @@\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-contactmerge.hh File Reference\n-Merge two grid boundary surfaces that may be a positive distance apart. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n contactmerge.hh
conformingmerge.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-\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+\n+\n+\n+\n+
\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n-
\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+ 71 typedef typename StandardMerge<T,dim,dim,dimworld>::SimplicialIntersection SimplicialIntersection;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 139 typedef typename StandardMerge<T,dimworld-1,dimworld-1,dimworld>::SimplicialIntersection SimplicialIntersection;
\n+\n+\n+ 100void ConformingMerge<dim, dimworld, T>::computeIntersections(const Dune::GeometryType& grid1ElementType,
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 113 assert((unsigned int)(Dune::ReferenceElements<T,dim>::general(grid1ElementType).size(dim)) == grid1ElementCorners.size());
\n+ 114 assert((unsigned int)(Dune::ReferenceElements<T,dim>::general(grid2ElementType).size(dim)) == grid2ElementCorners.size());
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n+\n+\n \n-\n-
\n+\n \n-\n+\n \n-\n-\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.
Common base class for many merger implementations: produce pairs of entities that may intersect.
Common base class for many merger implementations: produce pairs of entities that may intersect.
Definition gridglue.hh:37
Merge two codimension-1 surfaces that may be a positive distance apart.
Definition contactmerge.hh:44
void computeCyclicOrder(const std::vector< std::array< LocalCoords, 2 > > &polytopeCorners, const LocalCoords ¢er, std::vector< int > &ordering) const
Order the corners of the intersection polytope in cyclic order.
Definition contactmerge.cc:214
StandardMerge< T, dimworld-1, dimworld-1, dimworld >::SimplicialIntersection SimplicialIntersection
Definition contactmerge.hh:139
void removeDoubles(std::vector< std::array< LocalCoords, 2 > > &polytopeCorners)
Remove all multiples.
Definition contactmerge.cc:335
void setOverlap(T overlap)
Set the allowed overlap of the surfaces.
Definition contactmerge.hh:109
Dune::FieldVector< T, dimworld > WorldCoords
the coordinate type used in this interface
Definition contactmerge.hh:59
void setupNodalDirections(const std::vector< WorldCoords > &coords1, const std::vector< unsigned int > &elements1, const std::vector< Dune::GeometryType > &elementTypes1, const std::vector< WorldCoords > &coords2, const std::vector< unsigned int > &elements2, const std::vector< Dune::GeometryType > &elementTypes2)
Setup the direction vectors containing the directions for each vertex.
Definition contactmerge.cc:269
void minNormalAngle(T angle)
set minimum angle in radians between normals at x and \u03a6(x)
Definition contactmerge.hh:123
T ctype
the numeric type used in this interface
Definition contactmerge.hh:56
ProjectionType
Type of the projection, closest point or outer normal projection.
Definition contactmerge.hh:65
void computeOuterNormalField(const std::vector< WorldCoords > &coords, const std::vector< unsigned int > &elements, const std::vector< Dune::GeometryType > &elementTypes, std::vector< WorldCoords > &normals)
If no direction field was specified compute the outer normal field.
Definition contactmerge.cc:296
T getOverlap() const
Get the allowed overlap of the surfaces.
Definition contactmerge.hh:115
ContactMerge(const T allowedOverlap=T(0), std::function< WorldCoords(WorldCoords)> domainDirections=nullptr, std::function< WorldCoords(WorldCoords)> targetDirections=nullptr, ProjectionType type=OUTER_NORMAL)
Construct merger given overlap and possible projection directions.
Definition contactmerge.hh:73
void setSurfaceDirections(std::function< WorldCoords(WorldCoords)> domainDirections, std::function< WorldCoords(WorldCoords)> targetDirections)
Set surface direction functions.
Definition contactmerge.hh:100
void build(const std::vector< Dune::FieldVector< T, dimworld > > &grid1Coords, const std::vector< unsigned int > &grid1Elements, const std::vector< Dune::GeometryType > &grid1ElementTypes, const std::vector< Dune::FieldVector< T, dimworld > > &grid2Coords, const std::vector< unsigned int > &grid2Elements, const std::vector< Dune::GeometryType > &grid2ElementTypes) override
Definition contactmerge.hh:188
ContactMerge(const T allowedOverlap, ProjectionType type)
Construct merger given overlap and type of the projection.
Definition contactmerge.hh:86
T minNormalAngle() const
get minimum angle in radians between normals at x and \u03a6(x)
Definition contactmerge.hh:132
Dune::FieldVector< T, dim > LocalCoords
the coordinate type used in this interface
Definition contactmerge.hh:62
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Implementation of the Merger concept for conforming interfaces.
Definition conformingmerge.hh:49
Dune::FieldVector< T, dim > LocalCoords
the coordinate type used in this interface
Definition conformingmerge.hh:62
Dune::FieldVector< T, dimworld > WorldCoords
the coordinate type used in this interface
Definition conformingmerge.hh:59
static constexpr T default_tolerance
Definition conformingmerge.hh:89
T ctype
the numeric type used in this interface
Definition conformingmerge.hh:56
ConformingMerge(T tolerance=default_tolerance)
Definition conformingmerge.hh:91
Common base class for many merger implementations: produce pairs of entities that may intersect.
Definition standardmerge.hh:58
void build(const std::vector< Dune::FieldVector< T, dimworld > > &grid1_Coords, const std::vector< unsigned int > &grid1_elements, const std::vector< Dune::GeometryType > &grid1_element_types, const std::vector< Dune::FieldVector< T, dimworld > > &grid2_coords, const std::vector< unsigned int > &grid2_elements, const std::vector< Dune::GeometryType > &grid2_element_types) override
Definition standardmerge.hh:392
typename IntersectionListProvider::SimplicialIntersection SimplicialIntersection
Definition standardmerge.hh:83
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,304 +1,253 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n-contactmerge.hh\n+conformingmerge.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-10#ifndef DUNE_GRIDGLUE_MERGING_CONTACTMERGE_HH\n-11#define DUNE_GRIDGLUE_MERGING_CONTACTMERGE_HH\n-12\n-13\n-14#include contactmerge.cc File Reference
\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": "@@ -1,32 +1,19 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\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-computeintersection.hh File Reference\n-#include \n-#include \n-#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-#include \"_\bc_\bo_\bm_\bp_\bu_\bt_\be_\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+contactmerge.cc File Reference\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\br_\bo_\bs_\bs_\bp_\br_\bo_\bd_\bu_\bc_\bt_\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 _\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:_\bC_\bo_\bm_\bp_\bu_\bt_\ba_\bt_\bi_\bo_\bn_\bM_\be_\bt_\bh_\bo_\bd_\b<_\b _\bd_\bi_\bm_\bW_\bo_\br_\bl_\bd_\b,_\b _\bd_\bi_\bm_\b1_\b,_\b _\bd_\bi_\bm_\b2_\b,_\b _\bT_\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_\bC_\bo_\bm_\bp_\bu_\bt_\ba_\bt_\bi_\bo_\bn_\b<_\b _\bC_\bM_\b _\b>\n-\u00a0 _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn computation method for two elements of arbitrary\n- dimension. _\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-int\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\br_\bi_\bd_\bG_\bl_\bu_\be_\b:_\b:_\bi_\bn_\bs_\be_\br_\bt_\bP_\bo_\bi_\bn_\bt (const V p, std::vector< V > &P)\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/a00071_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00071_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: computeintersection.hh Source File \n+dune-grid-glue: contactmerge.cc Source File \n \n \n \n \n \n \n \n@@ -74,190 +74,389 @@\n \n \n
\n #include <dune/common/fvector.hh>\n-
#include <dune/common/fmatrix.hh>\n-
#include "simplexintersection.cc"\n-
#include "computeintersection.cc"\n+\n
Go to the source code of this file.
\n\n-Classes | |
| class | Dune::GridGlue::ComputationMethod< dimWorld, dim1, dim2, T > |
| class | Dune::GridGlue::IntersectionComputation< CM > |
| Intersection computation method for two elements of arbitrary dimension. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n-Functions | |
| template<class V > | |
| int | Dune::GridGlue::insertPoint (const V p, std::vector< V > &P) |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,19 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\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-computeintersection.hh File Reference\n-#include \n- \n+ \n
\n computeintersection.hh
contactmerge.cc
\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,214 +1,439 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n-computeintersection.hh\n+contactmerge.cc\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_MERGING_COMPUTEINTERSECTION_HH\n-4#define DUNE_GRIDGLUE_MERGING_COMPUTEINTERSECTION_HH\n 5\n-6#include \n-7#include \n+6#include <_\bd_\bu_\bn_\be_\b/_\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\br_\bo_\bs_\bs_\bp_\br_\bo_\bd_\bu_\bc_\bt_\b._\bh_\bh>\n+7#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 8\n 9namespace _\bD_\bu_\bn_\be {\n 10namespace GridGlue {\n 11\n-12template\n-_\b1_\b3class _\bC_\bo_\bm_\bp_\bu_\bt_\ba_\bt_\bi_\bo_\bn_\bM_\be_\bt_\bh_\bo_\bd {\n-14public:\n-_\b1_\b5 typedef FieldVector _\bV_\be_\bc_\bt_\bo_\br;\n-_\b1_\b6 static const int _\bg_\br_\bi_\bd_\b1_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim1;\n-_\b1_\b7 static const int _\bg_\br_\bi_\bd_\b2_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim2;\n-_\b1_\b8 static const int _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = (dim1 < dim2)?(dim1):(dim2);\n-19\n-_\b2_\b0 static bool _\bc_\bo_\bm_\bp_\bu_\bt_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bP_\bo_\bi_\bn_\bt_\bs(const std::vector X,\n-21 const std::vector Y,\n-22 std::vector >& SX,\n-23 std::vector >& SY,\n-24 std::vector& P);\n-_\b2_\b5 static void _\bg_\br_\bi_\bd_\b1_\b__\bs_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn_\bs(const std::vector elementCorners,\n-26 std::vector >& subElements,\n-27 std::vector >& faceIds);\n-_\b2_\b8 static void _\bg_\br_\bi_\bd_\b2_\b__\bs_\bu_\bb_\bd_\bi_\bv_\bi_\bs_\bi_\bo_\bn_\bs(const std::vector elementCorners,\n-29 std::vector >& subElements,\n-30 std::vector >& faceIds);\n-31};\n-32\n-38template\n-_\b3_\b9class _\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bC_\bo_\bm_\bp_\bu_\bt_\ba_\bt_\bi_\bo_\bn {\n-40private:\n-41 typedef typename CM::Vector V;\n-42 const int dimWorld = V::dimension;\n-43 const int dim1 = CM::grid1Dimension;\n-44 const int dim2 = CM::grid2Dimension;\n-45public:\n-59 static bool _\bc_\bo_\bm_\bp_\bu_\bt_\be_\bI_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn(const std::vector& X,\n-60 const std::vector& Y,\n-61 std::vector >& SX,\n-62 std::vector >& SY,\n-63 std::vector& P);\n+12template\n+13void ContactMerge::computeIntersections(const Dune::\n+GeometryType& grid1ElementType,\n+14 const std::vector >& grid1ElementCorners,\n+15 std::bitset<(1<& neighborIntersects1,\n+16 unsigned int grid1Index,\n+17 const Dune::GeometryType& grid2ElementType,\n+18 const std::vector >& grid2ElementCorners,\n+19 std::bitset<(1<& neighborIntersects2,\n+20 unsigned int grid2Index,\n+21 std::vector& _\bi_\bn_\bt_\be_\br_\bs_\be_\bc_\bt_\bi_\bo_\bn_\bs)\n+22{\n+23 using std::get;\n+24\n+25 std::vector > polytopeCorners;\n+26\n+27 // Initialize\n+28 neighborIntersects1.reset();\n+29 neighborIntersects2.reset();\n+30\n+31 const int nCorners1 = grid1ElementCorners.size();\n+32 const int nCorners2 = grid2ElementCorners.size();\n+33\n+34 if (nCorners1 != dimworld)\n+35 DUNE_THROW(Dune::Exception, \"element1 must have \" << dimworld << \" corners,\n+but has \" << nCorners1);\n+36 if (nCorners2 != dimworld)\n+37 DUNE_THROW(Dune::Exception, \"element2 must have \" << dimworld << \" corners,\n+but has \" << nCorners2);\n+38\n+39 // The grid1 projection directions\n+40 std::vector directions1(nCorners1);\n+41 for (size_t i=0; igrid1ElementCorners_\n+[grid1Index][i]];\n+43\n+44 // The grid2 projection directions\n+45 std::vector directions2(nCorners2);\n+46 for (size_t i=0; igrid2ElementCorners_\n+[grid2Index][i]];\n+48\n+49 // The difference between the closest point projection and the normal\n+projection is just the ordering\n+50 // of the involved surfaces. The closest point projection is done along the\n+outer normal field of grid2\n+51 // (due to being a best approximation) and the outer normal projection is\n+using the outer normal field\n+52 // of grid1 instead.\n+53 std::array cornersRef ={std::\n+cref(grid1ElementCorners), std::cref(grid2ElementCorners)};\n+54 std::array directionsRef ={std::cref\n+(directions1), std::cref(directions2)};\n+55 std::array elementTypes = {grid1ElementType,\n+grid2ElementType};\n+56\n+57 // Determine which is the grid we use for outer normal projection\n+58 const size_t domGrid = (type_==ProjectionType::OUTER_NORMAL) ? 0 : 1;\n+59 const size_t tarGrid = (type_==ProjectionType::OUTER_NORMAL) ? 1 : 0;\n+60\n+62 // Compute all corners of the intersection polytope\n 64\n-74 template\n-_\b7_\b5 static void _\bo_\br_\bd_\be_\br_\bP_\bo_\bi_\bn_\bt_\bs(const V& centroid,\n-76 const std::vector >& SX,\n-77 const std::vector >& SY,\n-78 const std::vector& P,\n-79 std::vector >& H)\n-80 {\n-81 if (isDim > 1)\n-82 orderPoints_(std::integral_constant(),std::\n-integral_constant(),\n-83 centroid, SX, SY, P,H);\n-84 }\n-85\n-86private:\n-87 static void orderPoints_(std::integral_constant,\n-88 std::integral_constant,\n-89 const V& centroid,\n-90 const std::vector >& SX,\n-91 const std::vector >& SY,\n-92 const std::vector& P,\n-93 std::vector >& H) {}\n-94 static void orderPoints_(std::integral_constant,\n-95 std::integral_constant,\n-96 const V& centroid,\n-97 const std::vector >& SX,\n-98 const std::vector >& SY,\n-99 const std::vector& P,\n-100 std::vector >& H) {}\n-101 static void orderPoints_(std::integral_constant,\n-102 std::integral_constant,\n-103 const V& centroid,\n-104 const std::vector >& SX,\n-105 const std::vector >& SY,\n-106 const std::vector& P,\n-107 std::vector >& H) {}\n-108 static void orderPoints_(std::integral_constant,\n-109 std::integral_constant,\n-110 const V& centroid,\n-111 const std::vector >& SX,\n-112 const std::vector >& SY,\n-113 const std::vector& P,\n-114 std::vector >& H);\n-115 static void orderPoints_(std::integral_constant,\n-116 std::integral_constant,\n-117 const V& centroid,\n-118 const std::vector >& SX,\n-119 const std::vector >& SY,\n-120 const std::vector& P,\n-121 std::vector >& H);\n-122 static void orderPoints_(std::integral_constant,\n-123 std::integral_constant,\n-124 const V& centroid,\n-125 const std::vector >& SX,\n-126 const std::vector
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+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
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+ 35 DUNE_THROW(Dune::Exception, "element1 must have " << dimworld << " corners, but has " << nCorners1);
\n+\n+ 37 DUNE_THROW(Dune::Exception, "element2 must have " << dimworld << " corners, but has " << nCorners2);
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 49 // The difference between the closest point projection and the normal projection is just the ordering
\n+ 50 // of the involved surfaces. The closest point projection is done along the outer normal field of grid2
\n+ 51 // (due to being a best approximation) and the outer normal projection is using the outer normal field
\n+\n+ 53 std::array<decltype(std::cref(grid1ElementCorners)),2> cornersRef ={std::cref(grid1ElementCorners), std::cref(grid2ElementCorners)};
\n+ 54 std::array<decltype(std::cref(directions1)),2> directionsRef ={std::cref(directions1), std::cref(directions2)};
\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 114 std::array<decltype(std::ref(neighborIntersects1)),2> neighborIntersectsRef = {std::ref(neighborIntersects1), std::ref(neighborIntersects2)};
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+ 214void ContactMerge<dimworld, T>::computeCyclicOrder(const std::vector<std::array<LocalCoords,2> >& polytopeCorners,
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n 335void ContactMerge<dimworld, T>::removeDoubles(std::vector<std::array<LocalCoords,2> >& polytopeCorners)
\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
int insertPoint(const V p, std::vector< V > &P)
Definition computeintersection.hh:164
Definition computeintersection.hh:13
static void grid2_subdivisions(const std::vector< Vector > elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds)
static bool computeIntersectionPoints(const std::vector< Vector > X, const std::vector< Vector > Y, std::vector< std::vector< int > > &SX, std::vector< std::vector< int > > &SY, std::vector< Vector > &P)
FieldVector< T, dimWorld > Vector
Definition computeintersection.hh:15
static const int grid1Dimension
Definition computeintersection.hh:16
static void grid1_subdivisions(const std::vector< Vector > elementCorners, std::vector< std::vector< unsigned int > > &subElements, std::vector< std::vector< int > > &faceIds)
static const int grid2Dimension
Definition computeintersection.hh:17
static const int intersectionDimension
Definition computeintersection.hh:18
Intersection computation method for two elements of arbitrary dimension.
Definition computeintersection.hh:39
static void orderPoints(const V ¢roid, const std::vector< std::vector< int > > &SX, const std::vector< std::vector< int > > &SY, const std::vector< V > &P, std::vector< std::vector< int > > &H)
Order Points in the point list P face-wise such that a subsimplex subdivision can be constructed.
Definition computeintersection.hh:75
static bool computeIntersection(const std::vector< V > &X, const std::vector< V > &Y, std::vector< std::vector< int > > &SX, std::vector< std::vector< int > > &SY, std::vector< V > &P)
Compute the intersection of two elements X and Y Compute the intersection of two elements X and Y,...
Definition computeintersection.cc:14
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
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
Coordinate corner(unsigned c)
Definition projection_impl.hh:24
void computeCyclicOrder(const std::vector< std::array< LocalCoords, 2 > > &polytopeCorners, const LocalCoords ¢er, std::vector< int > &ordering) const
Order the corners of the intersection polytope in cyclic order.
Definition contactmerge.cc:214
void removeDoubles(std::vector< std::array< LocalCoords, 2 > > &polytopeCorners)
Remove all multiples.
Definition contactmerge.cc:335
Dune::FieldVector< T, dimworld > WorldCoords
the coordinate type used in this interface
Definition contactmerge.hh:59
void setupNodalDirections(const std::vector< WorldCoords > &coords1, const std::vector< unsigned int > &elements1, const std::vector< Dune::GeometryType > &elementTypes1, const std::vector< WorldCoords > &coords2, const std::vector< unsigned int > &elements2, const std::vector< Dune::GeometryType > &elementTypes2)
Setup the direction vectors containing the directions for each vertex.
Definition contactmerge.cc:269
void computeOuterNormalField(const std::vector< WorldCoords > &coords, const std::vector< unsigned int > &elements, const std::vector< Dune::GeometryType > &elementTypes, std::vector< WorldCoords > &normals)
If no direction field was specified compute the outer normal field.
Definition contactmerge.cc:296
Dune::FieldVector< T, dim > LocalCoords
the coordinate type used in this interface
Definition contactmerge.hh:62
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,214 +1,439 @@\n dune-grid-glue\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\br_\bi_\bd_\b-_\bg_\bl_\bu_\be\n * _\bm_\be_\br_\bg_\bi_\bn_\bg\n-computeintersection.hh\n+contactmerge.cc\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_MERGING_COMPUTEINTERSECTION_HH\n-4#define DUNE_GRIDGLUE_MERGING_COMPUTEINTERSECTION_HH\n 5\n-6#include