\n Classes
Implement iterators over GridGlue intersections.
Describes the parallel communication interface class for Dune::GridGlue.
Describes the parallel communication interface class for Dune::GridGlue.
Implement iterators over GridGlue intersections.
Model of the Intersection concept provided by GridGlue.
Definition: gridglue.hh:37
sequential adapter to couple two grids at specified close together boundaries
Definition: gridglue.hh:67
Dune::FieldVector< ctype, dimworld > Coords
The type used for coordinate vectors.
Definition: gridglue.hh:174
Intersection getIntersection(int i) const
Definition: gridglue.hh:388
GridVertex< 1 > Grid1Vertex
The type of the Grid1 vertices.
Definition: gridglue.hh:194
Dune::GridGlue::IntersectionIndexSet< P0, P1 > IndexSet
Type of remote intersection indexSet.
Definition: gridglue.hh:206
\n \n+Namespaces |\n+Typedefs |\n+Functions
\n+ \n Classes |\n-Namespaces
\n- intersectioniterator.hh File Reference
gridgluecommunicate.hh File Reference
\n \n-
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n
\n+
\n+
\n \n \n
\n Generated by![\"doxygen\"/](\"doxygen.svg\")
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,62 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces\n-intersectioniterator.hh File Reference\n-Implement iterators over GridGlue intersections. More...\n-#include \n+Classes | Namespaces | Typedefs | Functions\n+gridgluecommunicate.hh File Reference\n+Describes the parallel communication interface class for Dune::GridGlue.\n+More...\n+#include \n+#include \n+#include \n+#include \n+#include \n Go_to_the_source_code_of_this_file.\n Classes\n-class \u00a0Dune::GridGlue::IntersectionIterator<_P0,_P1,_inside,_outside_>\n+struct \u00a0Dune::GridGlue::GlobalId\n+\u00a0\n+ class \u00a0Dune::GridGlue::CommDataHandle<_DataHandleImp,_DataTypeImp_>\n+\u00a0 describes the features of a data handle for communication in parallel\n+ runs using the GridGlue::communicate methods. More...\n+\u00a0\n+ class \u00a0Dune::GridGlue::StreamingMessageBuffer<_DT_>\n+\u00a0\n+ class \u00a0Dune::GridGlue::CommunicationOperator<_dir_>\n+\u00a0 forward gather scatter to user defined CommInfo class More...\n+\u00a0\n+struct \u00a0Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n+\u00a0 collects all GridGlue data requried for communication More...\n+\u00a0\n+struct \u00a0Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,\n+ DataTypeImp_>_>\n+\u00a0 specialization of the CommPolicy struct, required for the\n+ ParallelIndexsets More...\n \u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n+ Typedefs\n+ typedef std::pair< int, int >\u00a0Dune::GridGlue::RankPair\n+\u00a0\n+typedef CommunicationOperator< Dune::\n+ ForwardCommunication >\u00a0Dune::GridGlue::ForwardOperator\n+\u00a0\n+typedef CommunicationOperator< Dune::\n+ BackwardCommunication >\u00a0Dune::GridGlue::BackwardOperator\n+\u00a0\n+ Functions\n+std::ostream &\u00a0Dune::GridGlue::operator<< (std::ostream &os, const GlobalId\n+ &id)\n+\u00a0\n ***** Detailed Description *****\n-Implement iterators over GridGlue intersections.\n+Describes the parallel communication interface class for Dune::GridGlue.\n Author\n Christian Engwer\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00005_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00005_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: intersectioniterator.hh Source File \n+dune-grid-glue: gridgluecommunicate.hh Source File \n \n \n \n \n \n \n \n@@ -62,85 +62,323 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,100 +5,443 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-intersectioniterator.hh\n+gridgluecommunicate.hh\n Go_to_the_documentation_of_this_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 \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-\n with-dune-grid-glue-exception\n- 12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n- 13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n+ 5#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n+ 6#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n+ 7\n+ 13#include \n 14\n- 15#include \n- 16\n- 17namespace Dune {\n- 18 namespace GridGlue {\n+ 15#include \n+ 16#include \n+ 17#include \n+ 18#include \n 19\n- 21 template\n-22 class IntersectionIterator :\n- 23 public Dune::ForwardIteratorFacade<\n-IntersectionIterator,\n- 24 const Intersection >\n- 25 {\n- 26 public:\n- 27\n-28 typedef ::Dune::GridGlue::GridGlue GridGlue;\n-29 typedef ::Dune::GridGlue::Intersection Intersection;\n- 30\n-31 IntersectionIterator(const GridGlue * glue, unsigned int i)\n- 32 : glue_(glue),\n- 33 index_(i),\n- 34 intersection_(glue_, & glue_->intersections_[index_])\n- 35 {}\n- 36\n-37 const Intersection& dereference() const\n- 38 {\n- 39 assert((\"never dereference the end iterator\" &&\n- 40 index_ != glue_->index__sz));\n- 41 return intersection_;\n+ 20\n+ 21namespace Dune {\n+ 22 namespace GridGlue {\n+ 23\n+24 typedef std::pair RankPair;\n+25 struct GlobalId : public std::pair\n+ 26 {\n+30 GlobalId() {\n+ 31 this->first.first = 0;\n+ 32 this->first.second = 0;\n+ 33 this->second = 0;\n+ 34 }\n+38 GlobalId(int i) {\n+ 39 this->first.first = i;\n+ 40 this->first.second = i;\n+ 41 this->second = 0;\n 42 }\n- 43\n-44 void increment()\n- 45 {\n- 46 intersection_ = Intersection(glue_, & glue_->intersections_[++index_]);\n- 47 }\n- 48\n-49 bool equals(const IntersectionIterator& iter) const\n- 50 {\n- 51 return iter.index_ == index_;\n+48 GlobalId(int i, int j, unsigned int n) {\n+ 49 this->first.first = std::min(i,j);\n+ 50 this->first.second = std::max(i,j);\n+ 51 this->second = n;\n 52 }\n- 53\n- 54 private:\n- 55\n- 56 const GridGlue* glue_;\n- 57 unsigned int index_;\n- 58\n- 59 Intersection 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-gridglue.hh\n-Central component of the module implementing the coupling of two grids.\n+ 53 };\n+ 54\n+55 inline std::ostream& operator<<(std::ostream& os, const GlobalId & id)\n+ 56 {\n+ 57 os << \"(\"\n+ 58 << id.first.first << \",\" << id.first.second << \",\"\n+ 59 << id.second << \")\";\n+ 60 return os;\n+ 61 }\n+ 62\n+ 75 template \n+76 class CommDataHandle\n+ 77 {\n+ 78 public:\n+80 typedef DataTypeImp DataType;\n+ 81\n+ 82 protected:\n+ 83 // one should not create an explicit instance of this inteface object\n+84 CommDataHandle() {}\n+ 85\n+ 86 public:\n+ 87\n+ 91 template\n+92 size_t size (RISType& i) const\n+ 93 {\n+ 94 CHECK_INTERFACE_IMPLEMENTATION((asImp().size(i)));\n+ 95 return asImp().size(i);\n+ 96 }\n+ 97\n+ 103 template\n+104 void gather (MessageBufferImp& buff, const EntityType& e, const RISType &\n+i) const\n+ 105 {\n+ 106 MessageBufferIF buffIF(buff);\n+ 107 CHECK_AND_CALL_INTERFACE_IMPLEMENTATION((asImp().gather(buffIF,e,i)));\n+ 108 }\n+ 109\n+ 117 template\n+118 void scatter (MessageBufferImp& buff, const EntityType& e, const RISType &\n+i, size_t n)\n+ 119 {\n+ 120 MessageBufferIF buffIF(buff);\n+ 121 CHECK_AND_CALL_INTERFACE_IMPLEMENTATION((asImp().scatter(buffIF,e,i,n)));\n+ 122 }\n+ 123\n+ 124 private:\n+ 126 DataHandleImp& asImp () {\n+ 127 return static_cast (*this);\n+ 128 }\n+ 130 const DataHandleImp& asImp () const\n+ 131 {\n+ 132 return static_cast(*this);\n+ 133 }\n+ 134 }; // end class CommDataHandleIF\n+ 135\n+ 140 template\n+141 class StreamingMessageBuffer {\n+ 142 public:\n+143 typedef DT value_type;\n+ 144\n+ 145 // Constructor\n+146 StreamingMessageBuffer (DT *p)\n+ 147 {\n+ 148 a=p;\n+ 149 i=0;\n+ 150 j=0;\n+ 151 }\n+ 152\n+ 153 // write data to message buffer, acts like a stream !\n+ 154 template\n+155 void write (const Y& data)\n+ 156 {\n+ 157 static_assert(std::is_same::value, \"DataType mismatch\");\n+ 158 a[i++] = data;\n+ 159 }\n+ 160\n+ 161 // read data from message buffer, acts like a stream !\n+ 162 template\n+163 void read (Y& data) const\n+ 164 {\n+ 165 static_assert(std::is_same::value, \"DataType mismatch\");\n+ 166 data = a[j++];\n+ 167 }\n+ 168\n+169 size_t counter() const { return i; }\n+ 170\n+171 void clear()\n+ 172 {\n+ 173 i = 0;\n+ 174 j = 0;\n+ 175 }\n+ 176\n+ 177 // we need access to these variables in an assertion\n+ 178#ifdef NDEBUG\n+ 179 private:\n+ 180#endif\n+181 DT *a;\n+182 size_t i;\n+183 mutable size_t j;\n+ 184 };\n+ 185\n+ 192 template\n+193 class CommunicationOperator\n+ 194 {\n+ 195 public:\n+ 196 template\n+197 static const typename CommInfo::DataType& gather(const CommInfo& commInfo,\n+size_t i, size_t j = 0)\n+ 198 {\n+ 199 // get Intersection\n+ 200 typedef typename CommInfo::GridGlue::Intersection Intersection;\n+ 201 Intersection ris(commInfo.gridglue->getIntersection(i));\n+ 202\n+ 203 // fill buffer if we have a new intersection\n+ 204 if (j == 0)\n+ 205 {\n+ 206 commInfo.mbuffer.clear();\n+ 207 if (dir == Dune::ForwardCommunication)\n+ 208 {\n+ 209 // read from grid0\n+ 210 if(ris.self())\n+ 211 commInfo.data->gather(commInfo.mbuffer, ris.inside(), ris);\n+ 212 }\n+ 213 else // (dir == Dune::BackwardCommunication)\n+ 214 {\n+ 215 // read from grid1\n+ 216 if(ris.neighbor())\n+ 217 commInfo.data->gather(commInfo.mbuffer, ris.outside(), ris.flip());\n+ 218 }\n+ 219 }\n+ 220\n+ 221 // return the j'th value in the buffer\n+ 222 assert(j < commInfo.mbuffer.i);\n+ 223 return commInfo.buffer[j];\n+ 224 }\n+ 225\n+ 226 template\n+227 static void scatter(CommInfo& commInfo, const typename CommInfo::DataType&\n+v, std::size_t i, std::size_t j = 0)\n+ 228 {\n+ 229 // extract GridGlue objects...\n+ 230 typedef typename CommInfo::GridGlue::Intersection Intersection;\n+ 231 Intersection ris(commInfo.gridglue->getIntersection(i));\n+ 232\n+ 233 // get size if we have a new intersection\n+ 234 if (j == 0)\n+ 235 {\n+ 236 commInfo.mbuffer.clear();\n+ 237 commInfo.currentsize = commInfo.data->size(ris);\n+ 238 }\n+ 239\n+ 240 // write entry to buffer\n+ 241 commInfo.buffer[j] = v;\n+ 242\n+ 243 // write back the buffer if we are at the end of this intersection\n+ 244 if (j == commInfo.currentsize-1)\n+ 245 {\n+ 246 if (dir == Dune::ForwardCommunication)\n+ 247 {\n+ 248 // write to grid1\n+ 249 if(ris.neighbor())\n+ 250 commInfo.data->scatter(commInfo.mbuffer, ris.outside(), ris.flip(),\n+commInfo.currentsize);\n+ 251 }\n+ 252 else // (dir == Dune::BackwardCommunication)\n+ 253 {\n+ 254 // write to grid0\n+ 255 if(ris.self())\n+ 256 commInfo.data->scatter(commInfo.mbuffer, ris.inside(), ris,\n+commInfo.currentsize);\n+ 257 }\n+ 258 assert(commInfo.mbuffer.j <= commInfo.currentsize);\n+ 259 }\n+ 260 }\n+ 261 };\n+ 262\n+263 typedef CommunicationOperator ForwardOperator;\n+264 typedef CommunicationOperator\n+BackwardOperator;\n+ 265\n+ 270 template \n+271 struct CommInfo\n+ 272 {\n+273 typedef DataTypeImp value_type;\n+274 typedef GG GridGlue;\n+275 typedef DataTypeImp DataType;\n+ 276\n+277 CommInfo() : buffer(100), mbuffer(&buffer[0])\n+ 278 {}\n+ 279\n+ 280 // tunnel information to the policy and the operators\n+281 const GridGlue * gridglue;\n+282 ::Dune::GridGlue::CommDataHandle * data;\n+ 283\n+ 284 // state variables\n+285 std::vector buffer;\n+286 mutable ::Dune::GridGlue::StreamingMessageBuffer mbuffer;\n+287 size_t currentsize;\n+288 Dune::CommunicationDirection dir;\n+ 289 };\n+ 290\n+ 291 } // end namespace GridGlue\n+ 292\n+ 293#if HAVE_MPI\n+ 298 template\n+299 struct CommPolicy< ::Dune::GridGlue::CommInfo >\n+ 300 {\n+304 typedef ::Dune::GridGlue::CommInfo Type;\n+ 305\n+309 typedef DataTypeImp IndexedType;\n+ 310\n+ 314 // typedef SizeOne IndexedTypeFlag;\n+315 typedef VariableSize IndexedTypeFlag;\n+ 316\n+320 static size_t getSize(const Type& commInfo, size_t i)\n+ 321 {\n+ 322 // get Intersection\n+ 323 typedef typename Type::GridGlue::Intersection Intersection;\n+ 324 Intersection ris(commInfo.gridglue->getIntersection(i));\n+ 325\n+ 326 // ask data handle for size\n+ 327 return commInfo.data->size(ris);\n+ 328 }\n+ 329 };\n+ 330#endif\n+ 331\n+ 332} // end namespace Dune\n+ 333#endif\n Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::GridGlue\n-sequential adapter to couple two grids at specified close together boundaries\n-Definition: gridglue.hh:67\n-Dune::GridGlue::Intersection<_P0,_P1,_inside,_outside_>\n-Dune::GridGlue::IntersectionIterator\n-Definition: intersectioniterator.hh:25\n-Dune::GridGlue::IntersectionIterator::GridGlue\n-::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n-Definition: intersectioniterator.hh:28\n-Dune::GridGlue::IntersectionIterator::dereference\n-const Intersection & dereference() const\n-Definition: intersectioniterator.hh:37\n-Dune::GridGlue::IntersectionIterator::increment\n-void increment()\n-Definition: intersectioniterator.hh:44\n-Dune::GridGlue::IntersectionIterator::Intersection\n-::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection\n-Definition: intersectioniterator.hh:29\n-Dune::GridGlue::IntersectionIterator::IntersectionIterator\n-IntersectionIterator(const GridGlue *glue, unsigned int i)\n-Definition: intersectioniterator.hh:31\n-Dune::GridGlue::IntersectionIterator::equals\n-bool equals(const IntersectionIterator &iter) const\n-Definition: intersectioniterator.hh:49\n+Dune::GridGlue::BackwardOperator\n+CommunicationOperator< Dune::BackwardCommunication > BackwardOperator\n+Definition: gridgluecommunicate.hh:264\n+Dune::GridGlue::ForwardOperator\n+CommunicationOperator< Dune::ForwardCommunication > ForwardOperator\n+Definition: gridgluecommunicate.hh:263\n+Dune::GridGlue::RankPair\n+std::pair< int, int > RankPair\n+Definition: gridgluecommunicate.hh:24\n+Dune::GridGlue::operator<<\n+std::ostream & operator<<(std::ostream &os, const GlobalId &id)\n+Definition: gridgluecommunicate.hh:55\n+Dune::GridGlue::Intersection\n+The intersection of two entities of the two patches of a GridGlue.\n+Definition: intersection.hh:261\n+Dune::GridGlue::Intersection::flip\n+Intersection< P0, P1, O, I > flip() const\n+Return a copy of the intersection with inside and outside switched.\n+Definition: intersection.hh:483\n+Dune::GridGlue::Intersection::self\n+bool self() const\n+For parallel computations: Return true if inside() entity exists locally.\n+Definition: intersection.hh:393\n+Dune::GridGlue::Intersection::inside\n+InsideEntity inside(unsigned int parentId=0) const\n+Return element on the inside of this intersection.\n+Definition: intersection.hh:319\n+Dune::GridGlue::Intersection::neighbor\n+size_t neighbor(unsigned int g=0) const\n+Return number of embeddings into local grid0 (grid1) entities.\n+Definition: intersection.hh:399\n+Dune::GridGlue::Intersection::outside\n+OutsideEntity outside(unsigned int parentId=0) const\n+Return element on the outside of this intersection.\n+Definition: intersection.hh:328\n+Dune::GridGlue::GlobalId\n+Definition: gridgluecommunicate.hh:26\n+Dune::GridGlue::GlobalId::GlobalId\n+GlobalId(int i)\n+Definition: gridgluecommunicate.hh:38\n+Dune::GridGlue::GlobalId::GlobalId\n+GlobalId()\n+Definition: gridgluecommunicate.hh:30\n+Dune::GridGlue::GlobalId::GlobalId\n+GlobalId(int i, int j, unsigned int n)\n+Definition: gridgluecommunicate.hh:48\n+Dune::GridGlue::CommDataHandle\n+describes the features of a data handle for communication in parallel runs\n+using the GridGlue::commun...\n+Definition: gridgluecommunicate.hh:77\n+Dune::GridGlue::CommDataHandle::size\n+size_t size(RISType &i) const\n+Definition: gridgluecommunicate.hh:92\n+Dune::GridGlue::CommDataHandle::scatter\n+void scatter(MessageBufferImp &buff, const EntityType &e, const RISType &i,\n+size_t n)\n+Definition: gridgluecommunicate.hh:118\n+Dune::GridGlue::CommDataHandle::gather\n+void gather(MessageBufferImp &buff, const EntityType &e, const RISType &i)\n+const\n+pack data from user to message buffer\n+Definition: gridgluecommunicate.hh:104\n+Dune::GridGlue::CommDataHandle::DataType\n+DataTypeImp DataType\n+data type of data to communicate\n+Definition: gridgluecommunicate.hh:80\n+Dune::GridGlue::CommDataHandle::CommDataHandle\n+CommDataHandle()\n+Definition: gridgluecommunicate.hh:84\n+Dune::GridGlue::StreamingMessageBuffer\n+Definition: gridgluecommunicate.hh:141\n+Dune::GridGlue::StreamingMessageBuffer::j\n+size_t j\n+Definition: gridgluecommunicate.hh:183\n+Dune::GridGlue::StreamingMessageBuffer::StreamingMessageBuffer\n+StreamingMessageBuffer(DT *p)\n+Definition: gridgluecommunicate.hh:146\n+Dune::GridGlue::StreamingMessageBuffer::a\n+DT * a\n+Definition: gridgluecommunicate.hh:181\n+Dune::GridGlue::StreamingMessageBuffer::counter\n+size_t counter() const\n+Definition: gridgluecommunicate.hh:169\n+Dune::GridGlue::StreamingMessageBuffer::write\n+void write(const Y &data)\n+Definition: gridgluecommunicate.hh:155\n+Dune::GridGlue::StreamingMessageBuffer::read\n+void read(Y &data) const\n+Definition: gridgluecommunicate.hh:163\n+Dune::GridGlue::StreamingMessageBuffer::value_type\n+DT value_type\n+Definition: gridgluecommunicate.hh:143\n+Dune::GridGlue::StreamingMessageBuffer::i\n+size_t i\n+Definition: gridgluecommunicate.hh:182\n+Dune::GridGlue::StreamingMessageBuffer::clear\n+void clear()\n+Definition: gridgluecommunicate.hh:171\n+Dune::GridGlue::CommunicationOperator\n+forward gather scatter to user defined CommInfo class\n+Definition: gridgluecommunicate.hh:194\n+Dune::GridGlue::CommunicationOperator::scatter\n+static void scatter(CommInfo &commInfo, const typename CommInfo::DataType &v,\n+std::size_t i, std::size_t j=0)\n+Definition: gridgluecommunicate.hh:227\n+Dune::GridGlue::CommunicationOperator::gather\n+static const CommInfo::DataType & gather(const CommInfo &commInfo, size_t i,\n+size_t j=0)\n+Definition: gridgluecommunicate.hh:197\n+Dune::GridGlue::CommInfo\n+collects all GridGlue data requried for communication\n+Definition: gridgluecommunicate.hh:272\n+Dune::GridGlue::CommInfo::dir\n+Dune::CommunicationDirection dir\n+Definition: gridgluecommunicate.hh:288\n+Dune::GridGlue::CommInfo::value_type\n+DataTypeImp value_type\n+Definition: gridgluecommunicate.hh:273\n+Dune::GridGlue::CommInfo::DataType\n+DataTypeImp DataType\n+Definition: gridgluecommunicate.hh:275\n+Dune::GridGlue::CommInfo::data\n+::Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > * data\n+Definition: gridgluecommunicate.hh:282\n+Dune::GridGlue::CommInfo::GridGlue\n+GG GridGlue\n+Definition: gridgluecommunicate.hh:274\n+Dune::GridGlue::CommInfo::currentsize\n+size_t currentsize\n+Definition: gridgluecommunicate.hh:287\n+Dune::GridGlue::CommInfo::CommInfo\n+CommInfo()\n+Definition: gridgluecommunicate.hh:277\n+Dune::GridGlue::CommInfo::mbuffer\n+mutable ::Dune::GridGlue::StreamingMessageBuffer< DataType > mbuffer\n+Definition: gridgluecommunicate.hh:286\n+Dune::GridGlue::CommInfo::gridglue\n+const GridGlue * gridglue\n+Definition: gridgluecommunicate.hh:281\n+Dune::GridGlue::CommInfo::buffer\n+std::vector< DataType > buffer\n+Definition: gridgluecommunicate.hh:285\n+Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n+>::getSize\n+static size_t getSize(const Type &commInfo, size_t i)\n+Get the number of objects at an intersection.\n+Definition: gridgluecommunicate.hh:320\n+Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n+>::IndexedType\n+DataTypeImp IndexedType\n+The datatype that should be communicated.\n+Definition: gridgluecommunicate.hh:309\n+Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n+>::Type\n+::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > Type\n+The type of the GridGlueCommInfo.\n+Definition: gridgluecommunicate.hh:304\n+Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n+>::IndexedTypeFlag\n+VariableSize IndexedTypeFlag\n+Each intersection can communicate a different number of objects.\n+Definition: gridgluecommunicate.hh:315\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00008.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00008.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridglue.cc File Reference \n+dune-grid-glue: rangegenerators.hh File Reference \n \n \n \n \n \n \n \n@@ -63,38 +63,42 @@\n \n
\n Implement iterators over GridGlue intersections. \n+
Describes the parallel communication interface class for Dune::GridGlue. \n More...
\n-#include <dune/grid-glue/gridglue.hh>\n+
#include <type_traits>\n+
#include <dune/common/bartonnackmanifcheck.hh>\n+
#include <dune/common/parallel/communicator.hh>\n+
#include <dune/grid/common/datahandleif.hh>\n+
#include <dune/grid/common/gridenums.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::GridGlue::IntersectionIterator< P0, P1, inside, outside > |
| struct | Dune::GridGlue::GlobalId |
| class | Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > |
| describes the features of a data handle for communication in parallel runs using the GridGlue::communicate methods. More... | |
| class | Dune::GridGlue::StreamingMessageBuffer< DT > |
| class | Dune::GridGlue::CommunicationOperator< dir > |
| forward gather scatter to user defined CommInfo class More... | |
| struct | Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > |
| collects all GridGlue data requried for communication More... | |
| struct | Dune::CommPolicy< ::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > > |
| specialization of the CommPolicy struct, required for the ParallelIndexsets More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n+Typedefs | |
| typedef std::pair< int, int > | Dune::GridGlue::RankPair |
| typedef CommunicationOperator< Dune::ForwardCommunication > | Dune::GridGlue::ForwardOperator |
| typedef CommunicationOperator< Dune::BackwardCommunication > | Dune::GridGlue::BackwardOperator |
\n+Functions | |
| std::ostream & | Dune::GridGlue::operator<< (std::ostream &os, const GlobalId &id) |
Detailed Description
\n-Implement iterators over GridGlue intersections.
\n+Describes the parallel communication interface class for Dune::GridGlue.
\n- Author
- Christian Engwer
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,62 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces\n-intersectioniterator.hh File Reference\n-Implement iterators over GridGlue intersections. More...\n-#include \n- \n+ \n
\n intersectioniterator.hh
gridgluecommunicate.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+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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-Central component of the module implementing the coupling of two grids.
197 static const typename CommInfo::DataType& gather(const CommInfo& commInfo, size_t i, size_t j = 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+ 227 static void scatter(CommInfo& commInfo, const typename CommInfo::DataType& v, std::size_t i, std::size_t j = 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+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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
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
CommunicationOperator< Dune::BackwardCommunication > BackwardOperator
Definition: gridgluecommunicate.hh:264
CommunicationOperator< Dune::ForwardCommunication > ForwardOperator
Definition: gridgluecommunicate.hh:263
std::ostream & operator<<(std::ostream &os, const GlobalId &id)
Definition: gridgluecommunicate.hh:55
The intersection of two entities of the two patches of a GridGlue.
Definition: intersection.hh:261
Intersection< P0, P1, O, I > flip() const
Return a copy of the intersection with inside and outside switched.
Definition: intersection.hh:483
bool self() const
For parallel computations: Return true if inside() entity exists locally.
Definition: intersection.hh:393
InsideEntity inside(unsigned int parentId=0) const
Return element on the inside of this intersection.
Definition: intersection.hh:319
size_t neighbor(unsigned int g=0) const
Return number of embeddings into local grid0 (grid1) entities.
Definition: intersection.hh:399
OutsideEntity outside(unsigned int parentId=0) const
Return element on the outside of this intersection.
Definition: intersection.hh:328
Definition: gridgluecommunicate.hh:26
GlobalId(int i, int j, unsigned int n)
Definition: gridgluecommunicate.hh:48
describes the features of a data handle for communication in parallel runs using the GridGlue::commun...
Definition: gridgluecommunicate.hh:77
size_t size(RISType &i) const
Definition: gridgluecommunicate.hh:92
void scatter(MessageBufferImp &buff, const EntityType &e, const RISType &i, size_t n)
Definition: gridgluecommunicate.hh:118
void gather(MessageBufferImp &buff, const EntityType &e, const RISType &i) const
pack data from user to message buffer
Definition: gridgluecommunicate.hh:104
DataTypeImp DataType
data type of data to communicate
Definition: gridgluecommunicate.hh:80
Definition: gridgluecommunicate.hh:141
StreamingMessageBuffer(DT *p)
Definition: gridgluecommunicate.hh:146
size_t counter() const
Definition: gridgluecommunicate.hh:169
void write(const Y &data)
Definition: gridgluecommunicate.hh:155
void read(Y &data) const
Definition: gridgluecommunicate.hh:163
DT value_type
Definition: gridgluecommunicate.hh:143
forward gather scatter to user defined CommInfo class
Definition: gridgluecommunicate.hh:194
static void scatter(CommInfo &commInfo, const typename CommInfo::DataType &v, std::size_t i, std::size_t j=0)
Definition: gridgluecommunicate.hh:227
static const CommInfo::DataType & gather(const CommInfo &commInfo, size_t i, size_t j=0)
Definition: gridgluecommunicate.hh:197
collects all GridGlue data requried for communication
Definition: gridgluecommunicate.hh:272
::Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > * data
Definition: gridgluecommunicate.hh:282
mutable ::Dune::GridGlue::StreamingMessageBuffer< DataType > mbuffer
Definition: gridgluecommunicate.hh:286
std::vector< DataType > buffer
Definition: gridgluecommunicate.hh:285
static size_t getSize(const Type &commInfo, size_t i)
Get the number of objects at an intersection.
Definition: gridgluecommunicate.hh:320
DataTypeImp IndexedType
The datatype that should be communicated.
Definition: gridgluecommunicate.hh:309
::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > Type
The type of the GridGlueCommInfo.
Definition: gridgluecommunicate.hh:304
VariableSize IndexedTypeFlag
Each intersection can communicate a different number of objects.
Definition: gridgluecommunicate.hh:315
\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,100 +5,443 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-intersectioniterator.hh\n+gridgluecommunicate.hh\n Go_to_the_documentation_of_this_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 \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-\n with-dune-grid-glue-exception\n- 12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n- 13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n+ 5#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n+ 6#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n+ 7\n+ 13#include \n \n- \n+ \n
\n gridglue.cc File Reference
rangegenerators.hh File Reference
\n-
\n-
\n-
\n-
\n-
\n-
\n-\n+\n+
\n
\n
\n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,28 +5,28 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Namespaces | Functions\n-gridglue.cc File Reference\n-#include \"intersection.hh\"\n-#include \n-#include \n-#include \"../gridglue.hh\"\n-#include \"../common/ringcomm.hh\"\n-#include \n+Classes | Namespaces | Functions\n+rangegenerators.hh File Reference\n+#include \n+Go_to_the_source_code_of_this_file.\n+ Classes\n+struct \u00a0Dune::GridGlue::Reverse<_reverse_>\n+\u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n Functions\n-template\n-void\u00a0Dune::GridGlue::printVector (const std::vector< T > &v, std::string name,\n- int rank)\n+template<... >\n+IteratorRange<... >\u00a0Dune::GridGlue::intersections (const GridGlue<... > &glue,\n+ const Reverse<... > &reverse=!reversed)\n+\u00a0 Iterate over all intersections of a GridGlue. More...\n \u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridgluecommunicate.hh File Reference \n+dune-grid-glue: intersectioniterator.hh File Reference \n \n \n \n \n \n \n \n@@ -64,73 +64,39 @@\n \n \n \n \n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,28 +5,29 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces | Functions\n-rangegenerators.hh File Reference\n-#include \n+Classes | Namespaces\n+gridglueamirawriter.hh File Reference\n+Write all remote intersections to a AmiraMesh file. More...\n+#include \n+#include \n+#include \n Go_to_the_source_code_of_this_file.\n Classes\n-struct \u00a0Dune::GridGlue::Reverse<_reverse_>\n+class \u00a0Dune::GridGlue::GridGlueAmiraWriter\n+\u00a0 Write remote intersections to a AmiraMesh file for debugging purposes.\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n- Functions\n-template<... >\n-IteratorRange<... >\u00a0Dune::GridGlue::intersections (const GridGlue<... > &glue,\n- const Reverse<... > &reverse=!reversed)\n-\u00a0 Iterate over all intersections of a GridGlue. More...\n-\u00a0\n+***** Detailed Description *****\n+Write all remote intersections to a AmiraMesh file.\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: rangegenerators.hh Source File \n+dune-grid-glue: gridglueamirawriter.hh Source File \n \n \n \n \n \n \n \n@@ -62,74 +62,162 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,89 +5,166 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-rangegenerators.hh\n+gridglueamirawriter.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#ifndef DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n- 4#define DUNE_GRIDGLUE_ADAPTER_RANGEGENERATORS_HH\n- 5\n- 6#include \n- 7\n- 8namespace Dune {\n- 9namespace GridGlue {\n+ 8#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n+ 9#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUEAMIRAWRITER_HH\n 10\n- 14template\n-15struct Reverse\n- 16 : std::integral_constant\n- 17{\n-18 typedef Reverse type;\n- 19\n- 20 constexpr\n-21 Reverse operator!() const\n- 22 { return {}; }\n- 23};\n- 24\n- 25#ifdef DOXYGEN\n- 26\n-31const Reverse reversed;\n+ 11#include \n+ 12#include \n+ 13#include \n+ 14\n+ 15namespace Dune {\n+ 16namespace GridGlue {\n+ 17\n+20class GridGlueAmiraWriter\n+ 21{\n+ 22\n+ 26 template \n+ 27 static void writeIntersections(const Glue& glue, const std::string&\n+filename)\n+ 28 {\n+ 29 static_assert((side==0 || side==1), \"'side' can only be 0 or 1\");\n+ 30\n+ 31 std::ofstream fgrid;\n 32\n- 66template<...>\n- 67IteratorRange<...>\n-68intersections(const GridGlue<...>& glue, const Reverse<...>& reverse =\n-!reversed);\n- 69\n- 70#else\n- 71\n- 72namespace {\n- 73const Reverse reversed = {};\n- 74} /* namespace */\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+ 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+ 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- 76template\n- 77IteratorRange< typename GridGlue::template\n-IntersectionIterator >\n- 78intersections(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+ 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+131 static void write(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 Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::intersections\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n-Dune::GridGlue::GridGlue\n-sequential adapter to couple two grids at specified close together boundaries\n-Definition: gridglue.hh:67\n-Dune::GridGlue::GridGlue::intersections\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n-Dune::GridGlue::Reverse\n-Definition: rangegenerators.hh:17\n-Dune::GridGlue::Reverse::reversed\n-const Reverse< true > reversed\n-Definition: rangegenerators.hh:31\n-Dune::GridGlue::Reverse::type\n-Reverse type\n-Definition: rangegenerators.hh:18\n-Dune::GridGlue::Reverse::operator!\n-constexpr Reverse operator!() const\n-Definition: rangegenerators.hh:21\n+Dune::GridGlue::GridGlueAmiraWriter\n+Write remote intersections to a AmiraMesh file for debugging purposes.\n+Definition: gridglueamirawriter.hh:21\n+Dune::GridGlue::GridGlueAmiraWriter::write\n+static void write(const Glue &glue, const std::string &path, int appendix=1)\n+Definition: gridglueamirawriter.hh:131\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: gridglue.cc File Reference \n \n \n \n \n \n \n \n@@ -63,43 +63,39 @@\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 <dune/common/unused.hh>\n-
\n+Classes | |
| struct | Dune::GridGlue::Reverse< reverse > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n Functions | |
| template<typename T > | |
| void | Dune::GridGlue::printVector (const std::vector< T > &v, std::string name, int rank) |
| template<... > | |
| IteratorRange<... > | Dune::GridGlue::intersections (const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed) |
| Iterate over all intersections of a GridGlue. More... | |
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,28 +5,28 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Namespaces | Functions\n-gridglue.cc File Reference\n-#include \"intersection.hh\"\n-#include \n \n- \n+Namespaces
\n+ gridgluecommunicate.hh File Reference
intersectioniterator.hh File Reference
\n \n-
\n-
\n-
\n-
\n-
\n+
\n\n \n
\n
\n-
\n-
\n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,62 +5,27 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces | Typedefs | Functions\n-gridgluecommunicate.hh File Reference\n-Describes the parallel communication interface class for Dune::GridGlue.\n-More...\n-#include \n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces\n+intersectioniterator.hh File Reference\n+Implement iterators over GridGlue intersections. More...\n+#include \n Go_to_the_source_code_of_this_file.\n Classes\n-struct \u00a0Dune::GridGlue::GlobalId\n-\u00a0\n- class \u00a0Dune::GridGlue::CommDataHandle<_DataHandleImp,_DataTypeImp_>\n-\u00a0 describes the features of a data handle for communication in parallel\n- runs using the GridGlue::communicate methods. More...\n-\u00a0\n- class \u00a0Dune::GridGlue::StreamingMessageBuffer<_DT_>\n-\u00a0\n- class \u00a0Dune::GridGlue::CommunicationOperator<_dir_>\n-\u00a0 forward gather scatter to user defined CommInfo class More...\n-\u00a0\n-struct \u00a0Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n-\u00a0 collects all GridGlue data requried for communication More...\n-\u00a0\n-struct \u00a0Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,\n- DataTypeImp_>_>\n-\u00a0 specialization of the CommPolicy struct, required for the\n- ParallelIndexsets More...\n+class \u00a0Dune::GridGlue::IntersectionIterator<_P0,_P1,_inside,_outside_>\n \u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n- Typedefs\n- typedef std::pair< int, int >\u00a0Dune::GridGlue::RankPair\n-\u00a0\n-typedef CommunicationOperator< Dune::\n- ForwardCommunication >\u00a0Dune::GridGlue::ForwardOperator\n-\u00a0\n-typedef CommunicationOperator< Dune::\n- BackwardCommunication >\u00a0Dune::GridGlue::BackwardOperator\n-\u00a0\n- Functions\n-std::ostream &\u00a0Dune::GridGlue::operator<< (std::ostream &os, const GlobalId\n- &id)\n-\u00a0\n ***** Detailed Description *****\n-Describes the parallel communication interface class for Dune::GridGlue.\n+Implement iterators over GridGlue intersections.\n Author\n Christian Engwer\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00017_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: gridgluecommunicate.hh Source File \n+dune-grid-glue: intersectioniterator.hh Source File \n \n \n \n \n \n \n \n@@ -62,323 +62,85 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,443 +5,100 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-gridgluecommunicate.hh\n+intersectioniterator.hh\n Go_to_the_documentation_of_this_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 \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-\n with-dune-grid-glue-exception\n- 5#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n- 6#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n- 7\n- 13#include \n+ 12#ifndef DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n+ 13#define DUNE_GRIDGLUE_ADAPTER_INTERSECTIONITERATOR_HH\n 14\n- 15#include \n- 16#include \n- 17#include \n- 18#include \n+ 15#include \n+ 16\n+ 17namespace Dune {\n+ 18 namespace GridGlue {\n 19\n- 20\n- 21namespace Dune {\n- 22 namespace GridGlue {\n- 23\n-24 typedef std::pair RankPair;\n-25 struct GlobalId : public std::pair\n- 26 {\n-30 GlobalId() {\n- 31 this->first.first = 0;\n- 32 this->first.second = 0;\n- 33 this->second = 0;\n- 34 }\n-38 GlobalId(int i) {\n- 39 this->first.first = i;\n- 40 this->first.second = i;\n- 41 this->second = 0;\n+ 21 template\n+22 class IntersectionIterator :\n+ 23 public Dune::ForwardIteratorFacade<\n+IntersectionIterator,\n+ 24 const Intersection >\n+ 25 {\n+ 26 public:\n+ 27\n+28 typedef ::Dune::GridGlue::GridGlue GridGlue;\n+29 typedef ::Dune::GridGlue::Intersection Intersection;\n+ 30\n+31 IntersectionIterator(const GridGlue * glue, unsigned int i)\n+ 32 : glue_(glue),\n+ 33 index_(i),\n+ 34 intersection_(glue_, & glue_->intersections_[index_])\n+ 35 {}\n+ 36\n+37 const Intersection& dereference() const\n+ 38 {\n+ 39 assert((\"never dereference the end iterator\" &&\n+ 40 index_ != glue_->index__sz));\n+ 41 return intersection_;\n 42 }\n-48 GlobalId(int i, int j, unsigned int n) {\n- 49 this->first.first = std::min(i,j);\n- 50 this->first.second = std::max(i,j);\n- 51 this->second = n;\n+ 43\n+44 void increment()\n+ 45 {\n+ 46 intersection_ = Intersection(glue_, & glue_->intersections_[++index_]);\n+ 47 }\n+ 48\n+49 bool equals(const IntersectionIterator& iter) const\n+ 50 {\n+ 51 return iter.index_ == index_;\n 52 }\n- 53 };\n- 54\n-55 inline std::ostream& operator<<(std::ostream& os, const GlobalId & id)\n- 56 {\n- 57 os << \"(\"\n- 58 << id.first.first << \",\" << id.first.second << \",\"\n- 59 << id.second << \")\";\n- 60 return os;\n- 61 }\n- 62\n- 75 template \n-76 class CommDataHandle\n- 77 {\n- 78 public:\n-80 typedef DataTypeImp DataType;\n- 81\n- 82 protected:\n- 83 // one should not create an explicit instance of this inteface object\n-84 CommDataHandle() {}\n- 85\n- 86 public:\n- 87\n- 91 template\n-92 size_t size (RISType& i) const\n- 93 {\n- 94 CHECK_INTERFACE_IMPLEMENTATION((asImp().size(i)));\n- 95 return asImp().size(i);\n- 96 }\n- 97\n- 103 template\n-104 void gather (MessageBufferImp& buff, const EntityType& e, const RISType &\n-i) const\n- 105 {\n- 106 MessageBufferIF buffIF(buff);\n- 107 CHECK_AND_CALL_INTERFACE_IMPLEMENTATION((asImp().gather(buffIF,e,i)));\n- 108 }\n- 109\n- 117 template\n-118 void scatter (MessageBufferImp& buff, const EntityType& e, const RISType &\n-i, size_t n)\n- 119 {\n- 120 MessageBufferIF buffIF(buff);\n- 121 CHECK_AND_CALL_INTERFACE_IMPLEMENTATION((asImp().scatter(buffIF,e,i,n)));\n- 122 }\n- 123\n- 124 private:\n- 126 DataHandleImp& asImp () {\n- 127 return static_cast (*this);\n- 128 }\n- 130 const DataHandleImp& asImp () const\n- 131 {\n- 132 return static_cast(*this);\n- 133 }\n- 134 }; // end class CommDataHandleIF\n- 135\n- 140 template\n-141 class StreamingMessageBuffer {\n- 142 public:\n-143 typedef DT value_type;\n- 144\n- 145 // Constructor\n-146 StreamingMessageBuffer (DT *p)\n- 147 {\n- 148 a=p;\n- 149 i=0;\n- 150 j=0;\n- 151 }\n- 152\n- 153 // write data to message buffer, acts like a stream !\n- 154 template\n-155 void write (const Y& data)\n- 156 {\n- 157 static_assert(std::is_same::value, \"DataType mismatch\");\n- 158 a[i++] = data;\n- 159 }\n- 160\n- 161 // read data from message buffer, acts like a stream !\n- 162 template\n-163 void read (Y& data) const\n- 164 {\n- 165 static_assert(std::is_same::value, \"DataType mismatch\");\n- 166 data = a[j++];\n- 167 }\n- 168\n-169 size_t counter() const { return i; }\n- 170\n-171 void clear()\n- 172 {\n- 173 i = 0;\n- 174 j = 0;\n- 175 }\n- 176\n- 177 // we need access to these variables in an assertion\n- 178#ifdef NDEBUG\n- 179 private:\n- 180#endif\n-181 DT *a;\n-182 size_t i;\n-183 mutable size_t j;\n- 184 };\n- 185\n- 192 template\n-193 class CommunicationOperator\n- 194 {\n- 195 public:\n- 196 template\n-197 static const typename CommInfo::DataType& gather(const CommInfo& commInfo,\n-size_t i, size_t j = 0)\n- 198 {\n- 199 // get Intersection\n- 200 typedef typename CommInfo::GridGlue::Intersection Intersection;\n- 201 Intersection ris(commInfo.gridglue->getIntersection(i));\n- 202\n- 203 // fill buffer if we have a new intersection\n- 204 if (j == 0)\n- 205 {\n- 206 commInfo.mbuffer.clear();\n- 207 if (dir == Dune::ForwardCommunication)\n- 208 {\n- 209 // read from grid0\n- 210 if(ris.self())\n- 211 commInfo.data->gather(commInfo.mbuffer, ris.inside(), ris);\n- 212 }\n- 213 else // (dir == Dune::BackwardCommunication)\n- 214 {\n- 215 // read from grid1\n- 216 if(ris.neighbor())\n- 217 commInfo.data->gather(commInfo.mbuffer, ris.outside(), ris.flip());\n- 218 }\n- 219 }\n- 220\n- 221 // return the j'th value in the buffer\n- 222 assert(j < commInfo.mbuffer.i);\n- 223 return commInfo.buffer[j];\n- 224 }\n- 225\n- 226 template\n-227 static void scatter(CommInfo& commInfo, const typename CommInfo::DataType&\n-v, std::size_t i, std::size_t j = 0)\n- 228 {\n- 229 // extract GridGlue objects...\n- 230 typedef typename CommInfo::GridGlue::Intersection Intersection;\n- 231 Intersection ris(commInfo.gridglue->getIntersection(i));\n- 232\n- 233 // get size if we have a new intersection\n- 234 if (j == 0)\n- 235 {\n- 236 commInfo.mbuffer.clear();\n- 237 commInfo.currentsize = commInfo.data->size(ris);\n- 238 }\n- 239\n- 240 // write entry to buffer\n- 241 commInfo.buffer[j] = v;\n- 242\n- 243 // write back the buffer if we are at the end of this intersection\n- 244 if (j == commInfo.currentsize-1)\n- 245 {\n- 246 if (dir == Dune::ForwardCommunication)\n- 247 {\n- 248 // write to grid1\n- 249 if(ris.neighbor())\n- 250 commInfo.data->scatter(commInfo.mbuffer, ris.outside(), ris.flip(),\n-commInfo.currentsize);\n- 251 }\n- 252 else // (dir == Dune::BackwardCommunication)\n- 253 {\n- 254 // write to grid0\n- 255 if(ris.self())\n- 256 commInfo.data->scatter(commInfo.mbuffer, ris.inside(), ris,\n-commInfo.currentsize);\n- 257 }\n- 258 assert(commInfo.mbuffer.j <= commInfo.currentsize);\n- 259 }\n- 260 }\n- 261 };\n- 262\n-263 typedef CommunicationOperator ForwardOperator;\n-264 typedef CommunicationOperator\n-BackwardOperator;\n- 265\n- 270 template \n-271 struct CommInfo\n- 272 {\n-273 typedef DataTypeImp value_type;\n-274 typedef GG GridGlue;\n-275 typedef DataTypeImp DataType;\n- 276\n-277 CommInfo() : buffer(100), mbuffer(&buffer[0])\n- 278 {}\n- 279\n- 280 // tunnel information to the policy and the operators\n-281 const GridGlue * gridglue;\n-282 ::Dune::GridGlue::CommDataHandle * data;\n- 283\n- 284 // state variables\n-285 std::vector buffer;\n-286 mutable ::Dune::GridGlue::StreamingMessageBuffer mbuffer;\n-287 size_t currentsize;\n-288 Dune::CommunicationDirection dir;\n- 289 };\n- 290\n- 291 } // end namespace GridGlue\n- 292\n- 293#if HAVE_MPI\n- 298 template\n-299 struct CommPolicy< ::Dune::GridGlue::CommInfo >\n- 300 {\n-304 typedef ::Dune::GridGlue::CommInfo Type;\n- 305\n-309 typedef DataTypeImp IndexedType;\n- 310\n- 314 // typedef SizeOne IndexedTypeFlag;\n-315 typedef VariableSize IndexedTypeFlag;\n- 316\n-320 static size_t getSize(const Type& commInfo, size_t i)\n- 321 {\n- 322 // get Intersection\n- 323 typedef typename Type::GridGlue::Intersection Intersection;\n- 324 Intersection ris(commInfo.gridglue->getIntersection(i));\n- 325\n- 326 // ask data handle for size\n- 327 return commInfo.data->size(ris);\n- 328 }\n- 329 };\n- 330#endif\n- 331\n- 332} // end namespace Dune\n- 333#endif\n+ 53\n+ 54 private:\n+ 55\n+ 56 const GridGlue* glue_;\n+ 57 unsigned int index_;\n+ 58\n+ 59 Intersection 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+gridglue.hh\n+Central component of the module implementing the coupling of two grids.\n Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::BackwardOperator\n-CommunicationOperator< Dune::BackwardCommunication > BackwardOperator\n-Definition: gridgluecommunicate.hh:264\n-Dune::GridGlue::ForwardOperator\n-CommunicationOperator< Dune::ForwardCommunication > ForwardOperator\n-Definition: gridgluecommunicate.hh:263\n-Dune::GridGlue::RankPair\n-std::pair< int, int > RankPair\n-Definition: gridgluecommunicate.hh:24\n-Dune::GridGlue::operator<<\n-std::ostream & operator<<(std::ostream &os, const GlobalId &id)\n-Definition: gridgluecommunicate.hh:55\n-Dune::GridGlue::Intersection\n-The intersection of two entities of the two patches of a GridGlue.\n-Definition: intersection.hh:261\n-Dune::GridGlue::Intersection::flip\n-Intersection< P0, P1, O, I > flip() const\n-Return a copy of the intersection with inside and outside switched.\n-Definition: intersection.hh:483\n-Dune::GridGlue::Intersection::self\n-bool self() const\n-For parallel computations: Return true if inside() entity exists locally.\n-Definition: intersection.hh:393\n-Dune::GridGlue::Intersection::inside\n-InsideEntity inside(unsigned int parentId=0) const\n-Return element on the inside of this intersection.\n-Definition: intersection.hh:319\n-Dune::GridGlue::Intersection::neighbor\n-size_t neighbor(unsigned int g=0) const\n-Return number of embeddings into local grid0 (grid1) entities.\n-Definition: intersection.hh:399\n-Dune::GridGlue::Intersection::outside\n-OutsideEntity outside(unsigned int parentId=0) const\n-Return element on the outside of this intersection.\n-Definition: intersection.hh:328\n-Dune::GridGlue::GlobalId\n-Definition: gridgluecommunicate.hh:26\n-Dune::GridGlue::GlobalId::GlobalId\n-GlobalId(int i)\n-Definition: gridgluecommunicate.hh:38\n-Dune::GridGlue::GlobalId::GlobalId\n-GlobalId()\n-Definition: gridgluecommunicate.hh:30\n-Dune::GridGlue::GlobalId::GlobalId\n-GlobalId(int i, int j, unsigned int n)\n-Definition: gridgluecommunicate.hh:48\n-Dune::GridGlue::CommDataHandle\n-describes the features of a data handle for communication in parallel runs\n-using the GridGlue::commun...\n-Definition: gridgluecommunicate.hh:77\n-Dune::GridGlue::CommDataHandle::size\n-size_t size(RISType &i) const\n-Definition: gridgluecommunicate.hh:92\n-Dune::GridGlue::CommDataHandle::scatter\n-void scatter(MessageBufferImp &buff, const EntityType &e, const RISType &i,\n-size_t n)\n-Definition: gridgluecommunicate.hh:118\n-Dune::GridGlue::CommDataHandle::gather\n-void gather(MessageBufferImp &buff, const EntityType &e, const RISType &i)\n-const\n-pack data from user to message buffer\n-Definition: gridgluecommunicate.hh:104\n-Dune::GridGlue::CommDataHandle::DataType\n-DataTypeImp DataType\n-data type of data to communicate\n-Definition: gridgluecommunicate.hh:80\n-Dune::GridGlue::CommDataHandle::CommDataHandle\n-CommDataHandle()\n-Definition: gridgluecommunicate.hh:84\n-Dune::GridGlue::StreamingMessageBuffer\n-Definition: gridgluecommunicate.hh:141\n-Dune::GridGlue::StreamingMessageBuffer::j\n-size_t j\n-Definition: gridgluecommunicate.hh:183\n-Dune::GridGlue::StreamingMessageBuffer::StreamingMessageBuffer\n-StreamingMessageBuffer(DT *p)\n-Definition: gridgluecommunicate.hh:146\n-Dune::GridGlue::StreamingMessageBuffer::a\n-DT * a\n-Definition: gridgluecommunicate.hh:181\n-Dune::GridGlue::StreamingMessageBuffer::counter\n-size_t counter() const\n-Definition: gridgluecommunicate.hh:169\n-Dune::GridGlue::StreamingMessageBuffer::write\n-void write(const Y &data)\n-Definition: gridgluecommunicate.hh:155\n-Dune::GridGlue::StreamingMessageBuffer::read\n-void read(Y &data) const\n-Definition: gridgluecommunicate.hh:163\n-Dune::GridGlue::StreamingMessageBuffer::value_type\n-DT value_type\n-Definition: gridgluecommunicate.hh:143\n-Dune::GridGlue::StreamingMessageBuffer::i\n-size_t i\n-Definition: gridgluecommunicate.hh:182\n-Dune::GridGlue::StreamingMessageBuffer::clear\n-void clear()\n-Definition: gridgluecommunicate.hh:171\n-Dune::GridGlue::CommunicationOperator\n-forward gather scatter to user defined CommInfo class\n-Definition: gridgluecommunicate.hh:194\n-Dune::GridGlue::CommunicationOperator::scatter\n-static void scatter(CommInfo &commInfo, const typename CommInfo::DataType &v,\n-std::size_t i, std::size_t j=0)\n-Definition: gridgluecommunicate.hh:227\n-Dune::GridGlue::CommunicationOperator::gather\n-static const CommInfo::DataType & gather(const CommInfo &commInfo, size_t i,\n-size_t j=0)\n-Definition: gridgluecommunicate.hh:197\n-Dune::GridGlue::CommInfo\n-collects all GridGlue data requried for communication\n-Definition: gridgluecommunicate.hh:272\n-Dune::GridGlue::CommInfo::dir\n-Dune::CommunicationDirection dir\n-Definition: gridgluecommunicate.hh:288\n-Dune::GridGlue::CommInfo::value_type\n-DataTypeImp value_type\n-Definition: gridgluecommunicate.hh:273\n-Dune::GridGlue::CommInfo::DataType\n-DataTypeImp DataType\n-Definition: gridgluecommunicate.hh:275\n-Dune::GridGlue::CommInfo::data\n-::Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > * data\n-Definition: gridgluecommunicate.hh:282\n-Dune::GridGlue::CommInfo::GridGlue\n-GG GridGlue\n-Definition: gridgluecommunicate.hh:274\n-Dune::GridGlue::CommInfo::currentsize\n-size_t currentsize\n-Definition: gridgluecommunicate.hh:287\n-Dune::GridGlue::CommInfo::CommInfo\n-CommInfo()\n-Definition: gridgluecommunicate.hh:277\n-Dune::GridGlue::CommInfo::mbuffer\n-mutable ::Dune::GridGlue::StreamingMessageBuffer< DataType > mbuffer\n-Definition: gridgluecommunicate.hh:286\n-Dune::GridGlue::CommInfo::gridglue\n-const GridGlue * gridglue\n-Definition: gridgluecommunicate.hh:281\n-Dune::GridGlue::CommInfo::buffer\n-std::vector< DataType > buffer\n-Definition: gridgluecommunicate.hh:285\n-Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n->::getSize\n-static size_t getSize(const Type &commInfo, size_t i)\n-Get the number of objects at an intersection.\n-Definition: gridgluecommunicate.hh:320\n-Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n->::IndexedType\n-DataTypeImp IndexedType\n-The datatype that should be communicated.\n-Definition: gridgluecommunicate.hh:309\n-Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n->::Type\n-::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > Type\n-The type of the GridGlueCommInfo.\n-Definition: gridgluecommunicate.hh:304\n-Dune::CommPolicy<_::Dune::GridGlue::CommInfo<_GG,_DataHandleImp,_DataTypeImp_>\n->::IndexedTypeFlag\n-VariableSize IndexedTypeFlag\n-Each intersection can communicate a different number of objects.\n-Definition: gridgluecommunicate.hh:315\n+Dune::GridGlue::GridGlue\n+sequential adapter to couple two grids at specified close together boundaries\n+Definition: gridglue.hh:67\n+Dune::GridGlue::Intersection<_P0,_P1,_inside,_outside_>\n+Dune::GridGlue::IntersectionIterator\n+Definition: intersectioniterator.hh:25\n+Dune::GridGlue::IntersectionIterator::GridGlue\n+::Dune::GridGlue::GridGlue< P0, P1 > GridGlue\n+Definition: intersectioniterator.hh:28\n+Dune::GridGlue::IntersectionIterator::dereference\n+const Intersection & dereference() const\n+Definition: intersectioniterator.hh:37\n+Dune::GridGlue::IntersectionIterator::increment\n+void increment()\n+Definition: intersectioniterator.hh:44\n+Dune::GridGlue::IntersectionIterator::Intersection\n+::Dune::GridGlue::Intersection< P0, P1, inside, outside > Intersection\n+Definition: intersectioniterator.hh:29\n+Dune::GridGlue::IntersectionIterator::IntersectionIterator\n+IntersectionIterator(const GridGlue *glue, unsigned int i)\n+Definition: intersectioniterator.hh:31\n+Dune::GridGlue::IntersectionIterator::equals\n+bool equals(const IntersectionIterator &iter) const\n+Definition: intersectioniterator.hh:49\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00023.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: rangegenerators.hh File Reference \n+dune-grid-glue: gridglueamirawriter.hh File Reference \n \n \n \n \n \n \n \n@@ -64,42 +64,42 @@\n \n
\n \n \n+ Describes the parallel communication interface class for Dune::GridGlue. \n+
Implement iterators over GridGlue intersections. \n More...
\n-#include <type_traits>\n-
#include <dune/common/bartonnackmanifcheck.hh>\n-
#include <dune/common/parallel/communicator.hh>\n-
#include <dune/grid/common/datahandleif.hh>\n-
#include <dune/grid/common/gridenums.hh>\n+
#include <dune/grid-glue/gridglue.hh>\n
Go to the source code of this file.
\n\n Classes | |
| struct | Dune::GridGlue::GlobalId |
| class | Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > |
| describes the features of a data handle for communication in parallel runs using the GridGlue::communicate methods. More... | |
| class | Dune::GridGlue::StreamingMessageBuffer< DT > |
| class | Dune::GridGlue::CommunicationOperator< dir > |
| forward gather scatter to user defined CommInfo class More... | |
| struct | Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > |
| collects all GridGlue data requried for communication More... | |
| struct | Dune::CommPolicy< ::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > > |
| specialization of the CommPolicy struct, required for the ParallelIndexsets More... | |
| class | Dune::GridGlue::IntersectionIterator< P0, P1, inside, outside > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
\n-Typedefs | |
| typedef std::pair< int, int > | Dune::GridGlue::RankPair |
| typedef CommunicationOperator< Dune::ForwardCommunication > | Dune::GridGlue::ForwardOperator |
| typedef CommunicationOperator< Dune::BackwardCommunication > | Dune::GridGlue::BackwardOperator |
\n-Functions | |
| std::ostream & | Dune::GridGlue::operator<< (std::ostream &os, const GlobalId &id) |
Detailed Description
\n-Describes the parallel communication interface class for Dune::GridGlue.
\n+Implement iterators over GridGlue intersections.
\n- Author
- Christian Engwer
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,62 +5,27 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces | Typedefs | Functions\n-gridgluecommunicate.hh File Reference\n-Describes the parallel communication interface class for Dune::GridGlue.\n-More...\n-#include \n- \n+ \n
\n gridgluecommunicate.hh
intersectioniterator.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
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- 197 static const typename CommInfo::DataType& gather(const CommInfo& commInfo, size_t i, size_t j = 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- 227 static void scatter(CommInfo& commInfo, const typename CommInfo::DataType& v, std::size_t i, std::size_t j = 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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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
CommunicationOperator< Dune::BackwardCommunication > BackwardOperator
Definition: gridgluecommunicate.hh:264
CommunicationOperator< Dune::ForwardCommunication > ForwardOperator
Definition: gridgluecommunicate.hh:263
std::ostream & operator<<(std::ostream &os, const GlobalId &id)
Definition: gridgluecommunicate.hh:55
The intersection of two entities of the two patches of a GridGlue.
Definition: intersection.hh:261
Intersection< P0, P1, O, I > flip() const
Return a copy of the intersection with inside and outside switched.
Definition: intersection.hh:483
bool self() const
For parallel computations: Return true if inside() entity exists locally.
Definition: intersection.hh:393
InsideEntity inside(unsigned int parentId=0) const
Return element on the inside of this intersection.
Definition: intersection.hh:319
size_t neighbor(unsigned int g=0) const
Return number of embeddings into local grid0 (grid1) entities.
Definition: intersection.hh:399
OutsideEntity outside(unsigned int parentId=0) const
Return element on the outside of this intersection.
Definition: intersection.hh:328
Definition: gridgluecommunicate.hh:26
GlobalId(int i, int j, unsigned int n)
Definition: gridgluecommunicate.hh:48
describes the features of a data handle for communication in parallel runs using the GridGlue::commun...
Definition: gridgluecommunicate.hh:77
size_t size(RISType &i) const
Definition: gridgluecommunicate.hh:92
void scatter(MessageBufferImp &buff, const EntityType &e, const RISType &i, size_t n)
Definition: gridgluecommunicate.hh:118
void gather(MessageBufferImp &buff, const EntityType &e, const RISType &i) const
pack data from user to message buffer
Definition: gridgluecommunicate.hh:104
DataTypeImp DataType
data type of data to communicate
Definition: gridgluecommunicate.hh:80
Definition: gridgluecommunicate.hh:141
StreamingMessageBuffer(DT *p)
Definition: gridgluecommunicate.hh:146
size_t counter() const
Definition: gridgluecommunicate.hh:169
void write(const Y &data)
Definition: gridgluecommunicate.hh:155
void read(Y &data) const
Definition: gridgluecommunicate.hh:163
DT value_type
Definition: gridgluecommunicate.hh:143
forward gather scatter to user defined CommInfo class
Definition: gridgluecommunicate.hh:194
static void scatter(CommInfo &commInfo, const typename CommInfo::DataType &v, std::size_t i, std::size_t j=0)
Definition: gridgluecommunicate.hh:227
static const CommInfo::DataType & gather(const CommInfo &commInfo, size_t i, size_t j=0)
Definition: gridgluecommunicate.hh:197
collects all GridGlue data requried for communication
Definition: gridgluecommunicate.hh:272
::Dune::GridGlue::CommDataHandle< DataHandleImp, DataTypeImp > * data
Definition: gridgluecommunicate.hh:282
mutable ::Dune::GridGlue::StreamingMessageBuffer< DataType > mbuffer
Definition: gridgluecommunicate.hh:286
std::vector< DataType > buffer
Definition: gridgluecommunicate.hh:285
static size_t getSize(const Type &commInfo, size_t i)
Get the number of objects at an intersection.
Definition: gridgluecommunicate.hh:320
DataTypeImp IndexedType
The datatype that should be communicated.
Definition: gridgluecommunicate.hh:309
::Dune::GridGlue::CommInfo< GG, DataHandleImp, DataTypeImp > Type
The type of the GridGlueCommInfo.
Definition: gridgluecommunicate.hh:304
VariableSize IndexedTypeFlag
Each intersection can communicate a different number of objects.
Definition: gridgluecommunicate.hh:315
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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,443 +5,100 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-gridgluecommunicate.hh\n+intersectioniterator.hh\n Go_to_the_documentation_of_this_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 \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-\n with-dune-grid-glue-exception\n- 5#ifndef DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n- 6#define DUNE_GRIDGLUE_ADAPTER_GRIDGLUECOMMUNICATE_HH\n- 7\n- 13#include 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. More... | |
Detailed Description
\n+Write all remote intersections to a AmiraMesh file.
\n+\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,28 +5,29 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces | Functions\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 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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,89 +5,166 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-rangegenerators.hh\n+gridglueamirawriter.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-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 gridglue.cc File Reference
\n-\n-
\n-
\n-
\n-\n-\n-
\n+\n
\n+
\n-\n+\n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,29 +5,28 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces\n-gridglueamirawriter.hh File Reference\n-Write all remote intersections to a AmiraMesh file. More...\n-#include \n-#include \n-#include \n-Go_to_the_source_code_of_this_file.\n- Classes\n-class \u00a0Dune::GridGlue::GridGlueAmiraWriter\n-\u00a0 Write remote intersections to a AmiraMesh file for debugging purposes.\n- More...\n-\u00a0\n+Namespaces | Functions\n+gridglue.cc File Reference\n+#include \"intersection.hh\"\n+#include \n+#include \n+#include \"../gridglue.hh\"\n+#include \"../common/ringcomm.hh\"\n+#include \n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n-***** Detailed Description *****\n-Write all remote intersections to a AmiraMesh file.\n+ Functions\n+template\n+void\u00a0Dune::GridGlue::printVector (const std::vector< T > &v, std::string name,\n+ int rank)\n+\u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projectionwriter_impl.hh File Reference \n+dune-grid-glue: crossproduct.hh File Reference \n \n \n \n \n \n \n \n@@ -65,59 +65,33 @@\n dune grid-glue common \n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,60 +6,24 @@\n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n Namespaces | Functions\n-projectionwriter_impl.hh File Reference\n-#include \n+crossproduct.hh File Reference\n Go_to_the_source_code_of_this_file.\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n-namespace \u00a0Dune::GridGlue::ProjectionWriterImplementation\n-\u00a0\n Functions\n-template\n-void\u00a0Dune::GridGlue::ProjectionWriterImplementation::write_points (const\n- Projection< Coordinate > &projection, const Corners &corners, std::\n- ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::ProjectionWriterImplementation::write_normals (const\n- Projection< Coordinate > &projection, const Normals &normals, std::\n- ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::ProjectionWriterImplementation::\n- write_edge_intersection_points (const Projection< Coordinate >\n- &projection, const Corners &corners, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::ProjectionWriterImplementation::\n- write_edge_intersection_normals (const Projection< Coordinate >\n- &projection, const Normals &normals, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::ProjectionWriterImplementation::write_success (const\n- Projection< Coordinate > &projection, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write (const Projection< Coordinate > &projection, const\n- Corners &corners, const Normals &normals, std::ostream &out)\n-\u00a0 write projection in VTK format More...\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write (const Projection< Coordinate > &projection, const\n- Corners &corners, const Normals &normals, const std::string &filename)\n-\u00a0 write projection in VTK format More...\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::print (const Projection< Coordinate > &projection, const\n- Corners &corners, const Normals &normals)\n-\u00a0 Print information about the projection to std::cout stream. More...\n+template\n+static Dune::FieldVector< T, dim >\u00a0Dune::GridGlue::crossProduct (const Dune::\n+ FieldVector< T, dim > &a, const Dune::\n+ FieldVector< T, dim > &b)\n+\u00a0 compute cross product More...\n \u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00029_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: projectionwriter_impl.hh Source File \n+dune-grid-glue: crossproduct.hh Source File \n \n \n \n \n \n \n \n@@ -62,195 +62,46 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,246 +5,50 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-projectionwriter_impl.hh\n+crossproduct.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include \n- 4\n- 5namespace Dune {\n- 6namespace GridGlue {\n- 7\n-8namespace ProjectionWriterImplementation {\n- 9\n- 10template\n-11void write_points(const Projection& 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.images())) {\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 Dune {\n+ 7namespace GridGlue {\n+ 8\n+ 14template \n+15static Dune::FieldVector crossProduct(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-27void write_normals(const Projection& 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.images())) {\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-43void write_edge_intersection_points(const Projection& 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.numberOfEdgeIntersections(); ++i) {\n- 49 const auto& local = projection.edgeIntersections()[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-56void write_edge_intersection_normals(const Projection&\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.numberOfEdgeIntersections(); ++i) {\n- 62 const auto& local = projection.edgeIntersections()[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-72void write_success(const Projection& 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.success());\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-86void write(const Projection& 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.numberOfEdgeIntersections\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-130void write(const Projection& 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 write(projection, corners, normals, out);\n- 137}\n- 138\n- 139template\n-140void print(const Projection& 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.numberOfEdgeIntersections() << \" 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 Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::write\n-void write(const Projection< Coordinate > &projection, const Corners &corners,\n-const Normals &normals, std::ostream &out)\n-write projection in VTK format\n-Definition: projectionwriter_impl.hh:86\n-Dune::GridGlue::print\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-Definition: projectionwriter_impl.hh:140\n-Dune::GridGlue::ProjectionImplementation::interpolate\n-Corners::value_type interpolate(const Coordinate &x, const Corners &corners)\n-Definition: projection_impl.hh:70\n-Dune::GridGlue::ProjectionImplementation::interpolate_unit_normals\n-Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals\n-&normals)\n-Definition: projection_impl.hh:91\n-Dune::GridGlue::ProjectionWriterImplementation::write_normals\n-void write_normals(const Projection< Coordinate > &projection, const Normals\n-&normals, std::ostream &out)\n-Definition: projectionwriter_impl.hh:27\n-Dune::GridGlue::ProjectionWriterImplementation::write_points\n-void write_points(const Projection< Coordinate > &projection, const Corners\n-&corners, std::ostream &out)\n-Definition: projectionwriter_impl.hh:11\n-Dune::GridGlue::ProjectionWriterImplementation::write_success\n-void write_success(const Projection< Coordinate > &projection, std::ostream\n-&out)\n-Definition: projectionwriter_impl.hh:72\n-Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_points\n-void write_edge_intersection_points(const Projection< Coordinate > &projection,\n-const Corners &corners, std::ostream &out)\n-Definition: projectionwriter_impl.hh:43\n-Dune::GridGlue::ProjectionWriterImplementation::write_edge_intersection_normals\n-void write_edge_intersection_normals(const Projection< Coordinate >\n-&projection, const Normals &normals, std::ostream &out)\n-Definition: projectionwriter_impl.hh:56\n-Dune::GridGlue::Projection\n-Projection of a line (triangle) on another line (triangle).\n-Definition: projection.hh:21\n-Dune::GridGlue::Projection::success\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-Definition: projection.hh:252\n-Dune::GridGlue::Projection::numberOfEdgeIntersections\n-unsigned numberOfEdgeIntersections() const\n-Number of edge intersections.\n-Definition: projection.hh:262\n-Dune::GridGlue::Projection::images\n-const std::tuple< Images, Preimages > & images() const\n-Images and preimages of corners.\n-Definition: projection.hh:235\n-Dune::GridGlue::Projection::edgeIntersections\n-const std::array< EdgeIntersection, maxEdgeIntersections > & edgeIntersections\n-() const\n-Edge-edge intersections.\n-Definition: projection.hh:273\n+Dune::GridGlue::crossProduct\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+Definition: crossproduct.hh:15\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: areawriter_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -63,35 +63,56 @@\n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,25 +5,44 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Namespaces | Functions\n-crossproduct.hh File Reference\n+Classes | Namespaces | Functions\n+areawriter_impl.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n Go_to_the_source_code_of_this_file.\n+ Classes\n+struct \u00a0Dune::GridGlue::AreaWriterImplementation::FacetLayout<_dimgrid_>\n+\u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n+namespace \u00a0Dune::GridGlue::AreaWriterImplementation\n+\u00a0\n Functions\n-template\n-static Dune::FieldVector< T, dim >\u00a0Dune::GridGlue::crossProduct (const Dune::\n- FieldVector< T, dim > &a, const Dune::\n- FieldVector< T, dim > &b)\n-\u00a0 compute cross product More...\n+template\n+void\u00a0Dune::GridGlue::AreaWriterImplementation::write_facet_geometry (const\n+ GridView &gv, std::ostream &out)\n+\u00a0\n+template\n+void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out)\n+\u00a0\n+template\n+void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string\n+ &filename)\n+\u00a0\n+template\n+void\u00a0Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string\n+ &base)\n \u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: areawriter_impl.hh Source File \n \n \n \n \n \n \n \n@@ -62,46 +62,169 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,50 +5,185 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-crossproduct.hh\n+areawriter_impl.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#ifndef DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH\n- 4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n+ 3#include \n+ 4#include \n 5\n- 6namespace Dune {\n- 7namespace GridGlue {\n- 8\n- 14template \n-15static Dune::FieldVector crossProduct(const Dune::FieldVector&\n-a,\n- 16 const Dune::FieldVector& b)\n+ 6#include \n+ 7#include \n+ 8#include \n+ 9\n+ 10namespace Dune {\n+ 11namespace GridGlue {\n+ 12\n+13namespace AreaWriterImplementation {\n+ 14\n+ 15template\n+16struct FacetLayout\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+18 bool contains(Dune::GeometryType gt) const\n+ 19 {\n+ 20 return gt.dim() == dimgrid - 1;\n+ 21 }\n+ 22};\n+ 23\n+ 24template\n+25void write_facet_geometry(const GridView& gv, std::ostream& out)\n+ 26{\n+ 27 using Coordinate = Dune::FieldVector;\n 28\n- 29} /* namespace GridGlue */\n- 30} /* namespace Dune */\n- 31\n- 32#endif\n+ 29 std::vector corners;\n+ 30 for (const auto& facet : facets(gv)) {\n+ 31 const auto geometry = facet.geometry();\n+ 32 for (int i = 0; i < geometry.corners(); ++i) {\n+ 33 /* VTK always needs 3-dim coordinates... */\n+ 34 const auto c0 = geometry.corner(i);\n+ 35 Coordinate c1;\n+ 36 for (int d = 0; d < GridView::dimensionworld; ++d)\n+ 37 c1[d] = c0[d];\n+ 38 for (int d = GridView::dimensionworld; d < Coordinate::dimension; ++d)\n+ 39 c1[d] = double(0);\n+ 40 corners.push_back(c1);\n+ 41 }\n+ 42 }\n+ 43\n+ 44 {\n+ 45 out << \"DATASET UNSTRUCTURED_GRID\\n\"\n+ 46 << \"POINTS \" << corners.size() << \" double\\n\";\n+ 47 for (const auto& c : corners)\n+ 48 out << c << \"\\n\";\n+ 49 }\n+ 50 {\n+ 51 out << \"CELLS \" << gv.size(1) << \" \" << (gv.size(1) + corners.size()) <<\n+\"\\n\";\n+ 52 std::size_t c = 0;\n+ 53 for (const auto& facet : facets(gv)) {\n+ 54 const auto geometry = facet.geometry();\n+ 55 out << geometry.corners();\n+ 56 for (int i = 0; i < geometry.corners(); ++i, ++c)\n+ 57 out << \" \" << c;\n+ 58 out << \"\\n\";\n+ 59 }\n+ 60 }\n+ 61 {\n+ 62 out << \"CELL_TYPES \" << gv.size(1) << \"\\n\";\n+ 63 for (const auto& facet : facets(gv)) {\n+ 64 const auto type = facet.type();\n+ 65 if (type.isVertex())\n+ 66 out << \"1\\n\";\n+ 67 else if (type.isLine())\n+ 68 out << \"2\\n\";\n+ 69 else if (type.isTriangle())\n+ 70 out << \"5\\n\";\n+ 71 else if (type.isQuadrilateral())\n+ 72 out << \"9\\n\";\n+ 73 else if (type.isTetrahedron())\n+ 74 out << \"10\\n\";\n+ 75 else\n+ 76 DUNE_THROW(Dune::Exception, \"Unhandled geometry type\");\n+ 77 }\n+ 78 }\n+ 79}\n+ 80\n+ 81} /* namespace AreaWriterImplementation */\n+ 82\n+ 83template\n+84void write_glue_area_vtk(const Glue& glue, std::ostream& out)\n+ 85{\n+ 86 using GridView = typename std::decay< decltype(glue.template gridView\n+()) >::type;\n+ 87 using Mapper = Dune::MultipleCodimMultipleGeomTypeMapper;\n+ 88 using ctype = typename GridView::ctype;\n+ 89\n+ 90 const GridView gv = glue.template gridView();\n+ 91 Mapper mapper(gv);\n+ 92 std::vector coveredArea(mapper.size(), ctype(0));\n+ 93 std::vector totalArea(mapper.size(), ctype(1));\n+ 94\n+ 95 for (const auto& in : intersections(glue, Reverse())) {\n+ 96 const auto element = in.inside();\n+ 97 const auto index = mapper.subIndex(element, in.indexInInside(), 1);\n+ 98 coveredArea[index] += in.geometryInInside().volume();\n+ 99\n+ 100 const auto& refElement = Dune::ReferenceElements::general(element.type());\n+ 101 const auto& subGeometry = refElement.template geometry<1>(in.indexInInside\n+());\n+ 102 totalArea[index] = subGeometry.volume();\n+ 103 }\n+ 104\n+ 105 for (std::size_t i = 0; i < coveredArea.size(); ++i)\n+ 106 coveredArea[i] /= totalArea[i];\n+ 107\n+ 108 out << \"# vtk DataFile Version 2.0\\n\"\n+ 109 << \"Filename: Glue Area\\n\"\n+ 110 << \"ASCII\\n\";\n+ 111\n+ 112 AreaWriterImplementation::write_facet_geometry(gv, out);\n+ 113\n+ 114 out << \"CELL_DATA \" << coveredArea.size() << \"\\n\"\n+ 115 << \"SCALARS CoveredArea double 1\\n\"\n+ 116 << \"LOOKUP_TABLE default\\n\";\n+ 117 for (const auto& value : coveredArea)\n+ 118 out << value << \"\\n\";\n+ 119}\n+ 120\n+ 121template\n+122void write_glue_area_vtk(const Glue& glue, const std::string& filename)\n+ 123{\n+ 124 std::ofstream out(filename.c_str());\n+ 125 write_glue_area_vtk(glue, out);\n+ 126}\n+ 127\n+ 128template\n+129void write_glue_areas_vtk(const Glue& glue, const std::string& base)\n+ 130{\n+ 131 {\n+ 132 std::string filename = base;\n+ 133 filename += \"-inside.vtk\";\n+ 134 write_glue_area_vtk<0>(glue, filename);\n+ 135 }\n+ 136 {\n+ 137 std::string filename = base;\n+ 138 filename += \"-outside.vtk\";\n+ 139 write_glue_area_vtk<1>(glue, filename);\n+ 140 }\n+ 141}\n+ 142\n+ 143} /* namespace GridGlue */\n+ 144} /* namespace Dune */\n Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::crossProduct\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-Definition: crossproduct.hh:15\n+Dune::GridGlue::write_glue_area_vtk\n+void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n+Definition: areawriter_impl.hh:84\n+Dune::GridGlue::write_glue_areas_vtk\n+void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n+Definition: areawriter_impl.hh:129\n+Dune::GridGlue::intersections\n+IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n+> &reverse=!reversed)\n+Iterate over all intersections of a GridGlue.\n+Dune::GridGlue::AreaWriterImplementation::write_facet_geometry\n+void write_facet_geometry(const GridView &gv, std::ostream &out)\n+Definition: areawriter_impl.hh:25\n+Dune::GridGlue::Reverse\n+Definition: rangegenerators.hh:17\n+Dune::GridGlue::AreaWriterImplementation::FacetLayout\n+Definition: areawriter_impl.hh:17\n+Dune::GridGlue::AreaWriterImplementation::FacetLayout::contains\n+bool contains(Dune::GeometryType gt) const\n+Definition: areawriter_impl.hh:18\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: areawriter.hh File Reference \n+dune-grid-glue: ringcomm.hh File Reference \n \n \n \n \n \n \n \n@@ -64,43 +64,77 @@\n \n \n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,185 +5,494 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-areawriter_impl.hh\n+projection_impl.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include \n- 4#include \n- 5\n- 6#include \n- 7#include \n- 8#include \n+ 3#include \n+ 4\n+ 5#include \n+ 6\n+ 7namespace Dune {\n+ 8namespace GridGlue {\n 9\n- 10namespace Dune {\n- 11namespace GridGlue {\n- 12\n-13namespace AreaWriterImplementation {\n- 14\n- 15template\n-16struct FacetLayout\n- 17{\n-18 bool contains(Dune::GeometryType gt) const\n- 19 {\n- 20 return gt.dim() == dimgrid - 1;\n- 21 }\n- 22};\n- 23\n- 24template\n-25void write_facet_geometry(const GridView& gv, std::ostream& out)\n- 26{\n- 27 using Coordinate = Dune::FieldVector;\n- 28\n- 29 std::vector corners;\n- 30 for (const auto& facet : facets(gv)) {\n- 31 const auto geometry = facet.geometry();\n- 32 for (int i = 0; i < geometry.corners(); ++i) {\n- 33 /* VTK always needs 3-dim coordinates... */\n- 34 const auto c0 = geometry.corner(i);\n- 35 Coordinate c1;\n- 36 for (int d = 0; d < GridView::dimensionworld; ++d)\n- 37 c1[d] = c0[d];\n- 38 for (int d = GridView::dimensionworld; d < Coordinate::dimension; ++d)\n- 39 c1[d] = double(0);\n- 40 corners.push_back(c1);\n- 41 }\n- 42 }\n- 43\n- 44 {\n- 45 out << \"DATASET UNSTRUCTURED_GRID\\n\"\n- 46 << \"POINTS \" << corners.size() << \" double\\n\";\n- 47 for (const auto& c : corners)\n- 48 out << c << \"\\n\";\n+10namespace ProjectionImplementation {\n+ 11\n+ 22template\n+ 23inline Coordinate\n+24corner(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+43edgeToCorners(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 {\n- 51 out << \"CELLS \" << gv.size(1) << \" \" << (gv.size(1) + corners.size()) <<\n-\"\\n\";\n- 52 std::size_t c = 0;\n- 53 for (const auto& facet : facets(gv)) {\n- 54 const auto geometry = facet.geometry();\n- 55 out << geometry.corners();\n- 56 for (int i = 0; i < geometry.corners(); ++i, ++c)\n- 57 out << \" \" << c;\n- 58 out << \"\\n\";\n- 59 }\n- 60 }\n- 61 {\n- 62 out << \"CELL_TYPES \" << gv.size(1) << \"\\n\";\n- 63 for (const auto& facet : facets(gv)) {\n- 64 const auto type = facet.type();\n- 65 if (type.isVertex())\n- 66 out << \"1\\n\";\n- 67 else if (type.isLine())\n- 68 out << \"2\\n\";\n- 69 else if (type.isTriangle())\n- 70 out << \"5\\n\";\n- 71 else if (type.isQuadrilateral())\n- 72 out << \"9\\n\";\n- 73 else if (type.isTetrahedron())\n- 74 out << \"10\\n\";\n- 75 else\n- 76 DUNE_THROW(Dune::Exception, \"Unhandled geometry type\");\n- 77 }\n- 78 }\n- 79}\n- 80\n- 81} /* namespace AreaWriterImplementation */\n- 82\n- 83template\n-84void write_glue_area_vtk(const Glue& glue, std::ostream& out)\n- 85{\n- 86 using GridView = typename std::decay< decltype(glue.template gridView\n-()) >::type;\n- 87 using Mapper = Dune::MultipleCodimMultipleGeomTypeMapper;\n- 88 using ctype = typename GridView::ctype;\n- 89\n- 90 const GridView gv = glue.template gridView();\n- 91 Mapper mapper(gv);\n- 92 std::vector coveredArea(mapper.size(), ctype(0));\n- 93 std::vector totalArea(mapper.size(), ctype(1));\n- 94\n- 95 for (const auto& in : intersections(glue, Reverse())) {\n- 96 const auto element = in.inside();\n- 97 const auto index = mapper.subIndex(element, in.indexInInside(), 1);\n- 98 coveredArea[index] += in.geometryInInside().volume();\n- 99\n- 100 const auto& refElement = Dune::ReferenceElements::general(element.type());\n- 101 const auto& subGeometry = refElement.template geometry<1>(in.indexInInside\n-());\n- 102 totalArea[index] = subGeometry.volume();\n- 103 }\n- 104\n- 105 for (std::size_t i = 0; i < coveredArea.size(); ++i)\n- 106 coveredArea[i] /= totalArea[i];\n- 107\n- 108 out << \"# vtk DataFile Version 2.0\\n\"\n- 109 << \"Filename: Glue Area\\n\"\n- 110 << \"ASCII\\n\";\n- 111\n- 112 AreaWriterImplementation::write_facet_geometry(gv, out);\n- 113\n- 114 out << \"CELL_DATA \" << coveredArea.size() << \"\\n\"\n- 115 << \"SCALARS CoveredArea double 1\\n\"\n- 116 << \"LOOKUP_TABLE default\\n\";\n- 117 for (const auto& value : coveredArea)\n- 118 out << value << \"\\n\";\n- 119}\n- 120\n- 121template\n-122void write_glue_area_vtk(const Glue& glue, const std::string& filename)\n- 123{\n- 124 std::ofstream out(filename.c_str());\n- 125 write_glue_area_vtk(glue, out);\n- 126}\n+ 50 DUNE_THROW(Dune::Exception, \"Unexpected edge number.\");\n+ 51}\n+ 52\n+ 68template\n+ 69inline typename Corners::value_type\n+70interpolate(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+91interpolate_unit_normals(const Coordinate& x, const Normals& normals)\n+ 92{\n+ 93 auto n = interpolate(x, normals);\n+ 94 n /= n.two_norm();\n+ 95 return n;\n+ 96}\n+ 97\n+ 109template\n+ 110inline bool\n+111inside(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\u1d62 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-129void write_glue_areas_vtk(const Glue& glue, const std::string& base)\n- 130{\n- 131 {\n- 132 std::string filename = base;\n- 133 filename += \"-inside.vtk\";\n- 134 write_glue_area_vtk<0>(glue, filename);\n- 135 }\n- 136 {\n- 137 std::string filename = base;\n- 138 filename += \"-outside.vtk\";\n- 139 write_glue_area_vtk<1>(glue, filename);\n- 140 }\n- 141}\n- 142\n- 143} /* namespace GridGlue */\n- 144} /* namespace Dune */\n+ 128template\n+ 129Projection\n+130::Projection(const Field overlap, const Field 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+ 139Projection\n+140::epsilon(const Field epsilon)\n+ 141{\n+ 142 m_epsilon = epsilon;\n+ 143}\n+ 144\n+ 145template\n+ 146template\n+ 147void\n+ 148Projection\n+ 149::doProjection(const std::tuple& corners, const std::\n+tuple& normals)\n+ 150{\n+ 151 /* Try to obtain \u03a6(x\u1d62) for each corner x\u1d62 of the preimage triangle.\n+ 152 * This means solving a linear system of equations\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+ 155 * to obtain the barycentric coordinates (\u03b1, \u03b2) of \u03a6(x\u1d62) in the image\n+ 156 * triangle and the distance \u03b4.\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\u1d62 = (y\u1d62 - y\u2080) / ||y\u1d62 - y\u2080||\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\u1d62 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 = (\u03b1, \u03b2, \u03b4) */\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 -\u03b4 as the term is \"-\u03b4 n\u1d62\". */\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 \u03a6\u207b\u00b9(y\u1d62) for each corner y\u1d62 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 \u03a6\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\u1d62 with respect to the triangle\n+ 249 * with the corners \u03a6(x\u1d62). 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\u1d62 on the plane spanned by the y\u1d62\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] = interpolate(images[i+1], target_corners);\n+ 274 v[i] -= interpolate(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\u1d62 to barycentric coordinates with respect to \u03a6(x\u2c7c) */\n+ 286 v[dim-1] = target_corners[i];\n+ 287 v[dim-1] -= interpolate(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 = interpolate(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 \u03a6(x\u2c7c) */\n+ 302 const bool feasible = projectionFeasible(target_corners[i], get<1>\n+(normals)[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>\n+(m_success).all()) {\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 \u03a6(x\u1d62), \u03a6(x\u2c7c) with line through y\u2096, y\u2097:\n+ 335 We want \u03b1, \u03b2 \u2208 \u211d such that\n+ 336 \u03a6(x\u1d62) + \u03b1 (\u03a6(x\u2c7c) - \u03a6(x\u1d62)) = y\u2096 + \u03b2 (y\u2097 - y\u2096)\n+ 337 or\n+ 338 \u03b1 (\u03a6(x\u2c7c)-\u03a6(x\u1d62)) + \u03b2 (y\u2097-y\u2096) = y\u2096-\u03a6(x\u1d62)\n+ 339 To get a 2\u00d72 system of equations, multiply with y\u2098-y\u2080 for\n+ 340 m \u2208 {1,\u0323\u03232} which are linear indep. (and so the system is\n+ 341 equivalent to the original 3\u00d72 system)\n+ 342 */\n+ 343 for (unsigned edgex = 0; edgex < dim; ++edgex) {\n+ 344 unsigned i, j;\n+ 345 std::tie(i, j) = edgeToCorners(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 = interpolate(images[i], ys);\n+ 352 const auto pxj = interpolate(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) = edgeToCorners(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(i));\n+ 402 Coordinate local_y = corner(k);\n+ 403 local_y.axpy(z[1], corner(l) - corner(k));\n+ 404\n+ 405 /* Make sure the intersection is in the triangle. */\n+ 406 if (!inside(local_x, m_epsilon) || !inside(local_y, m_epsilon))\n+ 407 continue;\n+ 408\n+ 409 /* Make sure the intersection respects overlap. */\n+ 410 auto xy = interpolate(local_x, get<0>(corners));\n+ 411 xy -= interpolate(local_y, get<1>(corners));\n+ 412 const auto nx = interpolate_unit_normals(local_x, get<0>(normals));\n+ 413 const auto ny = interpolate_unit_normals(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 (!inside(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 -= interpolate(px, corners);\n+ 453 const auto n = interpolate_unit_normals(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 \u03a6(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+469::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 Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::write_glue_area_vtk\n-void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n-Definition: areawriter_impl.hh:84\n-Dune::GridGlue::write_glue_areas_vtk\n-void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n-Definition: areawriter_impl.hh:129\n-Dune::GridGlue::intersections\n-IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<...\n-> &reverse=!reversed)\n-Iterate over all intersections of a GridGlue.\n-Dune::GridGlue::AreaWriterImplementation::write_facet_geometry\n-void write_facet_geometry(const GridView &gv, std::ostream &out)\n-Definition: areawriter_impl.hh:25\n-Dune::GridGlue::Reverse\n-Definition: rangegenerators.hh:17\n-Dune::GridGlue::AreaWriterImplementation::FacetLayout\n-Definition: areawriter_impl.hh:17\n-Dune::GridGlue::AreaWriterImplementation::FacetLayout::contains\n-bool contains(Dune::GeometryType gt) const\n-Definition: areawriter_impl.hh:18\n+Dune::GridGlue::ProjectionImplementation::interpolate\n+Corners::value_type interpolate(const Coordinate &x, const Corners &corners)\n+Definition: projection_impl.hh:70\n+Dune::GridGlue::ProjectionImplementation::inside\n+bool inside(const Coordinate &x, const Field &epsilon)\n+Definition: projection_impl.hh:111\n+Dune::GridGlue::ProjectionImplementation::edgeToCorners\n+std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)\n+Definition: projection_impl.hh:43\n+Dune::GridGlue::ProjectionImplementation::corner\n+Coordinate corner(unsigned c)\n+Definition: projection_impl.hh:24\n+Dune::GridGlue::ProjectionImplementation::interpolate_unit_normals\n+Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals\n+&normals)\n+Definition: projection_impl.hh:91\n+Dune::GridGlue::Projection\n+Projection of a line (triangle) on another line (triangle).\n+Definition: projection.hh:21\n+Dune::GridGlue::Projection::Field\n+Coordinate::field_type Field\n+Scalar type.\n+Definition: projection.hh:61\n+Dune::GridGlue::Projection::Projection\n+Projection(const Field overlap=Field(0), const Field max_normal_product=Field(-\n+0.1))\n+Definition: projection_impl.hh:130\n+Dune::GridGlue::Projection::epsilon\n+void epsilon(const Field epsilon)\n+Set epsilon used for floating-point comparisons.\n+Definition: projection_impl.hh:140\n+Dune::GridGlue::Projection::project\n+void project(const std::tuple< Corners &, Corners & > &corners, const std::\n+tuple< Normals &, Normals & > &normals)\n+Do the actual projection.\n+Definition: projection_impl.hh:469\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00041.html", "unified_diff": "@@ -71,15 +71,15 @@\n Namespaces \n \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 | |
| 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<typename T > | |
| void | Dune::GridGlue::printVector (const std::vector< T > &v, std::string name, int rank) |
Detailed Description
\n-Write all remote intersections to a AmiraMesh file.
\n-\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,29 +5,28 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * adapter\n-Classes | Namespaces\n-gridglueamirawriter.hh File Reference\n-Write all remote intersections to a AmiraMesh file. More...\n-#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 More... | |
| 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 More... | |
| 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. More... | |
| 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 More... | |
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,60 +6,24 @@\n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n Namespaces | Functions\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-\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- 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- 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- 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- 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- 104 out << "CELLS " << (8 + numberOfEdgeIntersections) << " " << (26 + 3 * numberOfEdgeIntersections) << "\\n";
\n-\n-\n-\n-\n- 109 out << "CELL_TYPES " << (8 + numberOfEdgeIntersections) << "\\n" "5\\n3\\n3\\n3\\n" "5\\n3\\n3\\n3\\n";
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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
Corners::value_type interpolate(const Coordinate &x, const Corners &corners)
Definition: projection_impl.hh:70
Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals &normals)
Definition: projection_impl.hh:91
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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,246 +5,50 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-projectionwriter_impl.hh\n+crossproduct.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include \n \n- \n+ \n
\n crossproduct.hh File Reference
areawriter_impl.hh File Reference
\n-\n+
\n+
\n+
\n+
\n+
\n+\n \n+
\n
\n
\n
\n \n #include <fstream>\n+
#include <vector>\n+
#include <dune/common/fvector.hh>\n+
#include <dune/geometry/type.hh>\n+
#include <dune/grid/common/mcmgmapper.hh>\n+
Go to the source code of this file.
\n\n+Classes | |
| struct | Dune::GridGlue::AreaWriterImplementation::FacetLayout< dimgrid > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::AreaWriterImplementation |
\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 More... | |
| template<typename GridView > | |
| void | Dune::GridGlue::AreaWriterImplementation::write_facet_geometry (const GridView &gv, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,25 +5,44 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Namespaces | Functions\n-crossproduct.hh File Reference\n+Classes | Namespaces | Functions\n+areawriter_impl.hh File Reference\n+#include \n- \n+ \n
\n crossproduct.hh
areawriter_impl.hh
\n Go to the documentation of this file.\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+ 87 using Mapper = Dune::MultipleCodimMultipleGeomTypeMapper<GridView, AreaWriterImplementation::FacetLayout>;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 100 const auto& refElement = Dune::ReferenceElements<ctype, GridView::dimension>::general(element.type());
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\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 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
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
void write_facet_geometry(const GridView &gv, std::ostream &out)
Definition: areawriter_impl.hh:25
Definition: rangegenerators.hh:17
Definition: areawriter_impl.hh:17
bool contains(Dune::GeometryType gt) const
Definition: areawriter_impl.hh:18
\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,50 +5,185 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-crossproduct.hh\n+areawriter_impl.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#ifndef DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH\n- 4#define DUNE_GRIDGLUE_COMMON_CROSSPRODUCT_HH 1\n+ 3#include \n \n- \n+ \n
\n areawriter.hh File Reference
ringcomm.hh File Reference
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n+
\n
\n+\n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,33 +5,40 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Namespaces | Functions\n-areawriter.hh File Reference\n-#include \n-#include \n-#include \"areawriter_impl.hh\"\n+Namespaces | Macros | Functions\n+ringcomm.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Go_to_the_source_code_of_this_file.\n Namespaces\n namespace \u00a0Dune\n \u00a0\n-namespace \u00a0Dune::GridGlue\n+namespace \u00a0Dune::Parallel\n \u00a0\n- Functions\n-template\n-void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string\n- &filename)\n+ Macros\n+#define\u00a0CheckMPIStatus(A, B)\u00a0\u00a0\u00a0{}\n \u00a0\n-template\n-void\u00a0Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string\n- &base)\n+ Functions\n+template\n+void\u00a0Dune::Parallel::MPI_AllApply (MPI_Comm mpicomm, OP &&op, const Args &...\n+ data)\n+\u00a0 apply an operator locally to a difstributed data set More...\n \u00a0\n+***** Macro Definition Documentation *****\n+***** \u25c6\u00a0CheckMPIStatus *****\n+#define CheckMPIStatus ( \u00a0A,\n+ \u00a0B\u00a0\n+ ) \u00a0\u00a0\u00a0{}\n+ Todo:\n+ Implement MPI Status check with exception handling\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: areawriter.hh Source File \n+dune-grid-glue: ringcomm.hh Source File \n \n \n \n \n \n \n \n@@ -62,47 +62,305 @@\n \n \n
\n #include <ostream>\n-
#include <string>\n-
#include "areawriter_impl.hh"\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<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
| template<typename OP , typename... Args> | |
| void | Dune::Parallel::MPI_AllApply (MPI_Comm mpicomm, OP &&op, const Args &... data) |
| apply an operator locally to a difstributed data set More... | |
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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,33 +5,40 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Namespaces | Functions\n-areawriter.hh File Reference\n-#include \n- \n+ \n
\n areawriter.hh
ringcomm.hh
\n-Go to the documentation of this file.\n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,49 +5,309 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-areawriter.hh\n+ringcomm.hh\n Go_to_the_documentation_of_this_file.\n- 1// SPDX-FileCopyrightInfo: Copyright \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 \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-\n+ 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-\n with-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 Dune {\n- 10namespace GridGlue {\n- 11\n- 12template\n- 13void write_glue_area_vtk(const Glue& glue, std::ostream& out);\n- 14\n- 15template\n- 16void write_glue_area_vtk(const Glue& glue, const std::string& filename);\n- 17\n- 37template\n- 38void write_glue_areas_vtk(const Glue& glue, const std::string& base);\n- 39\n- 40} /* namespace GridGlue */\n- 41} /* namespace Dune */\n- 42\n- 43#include \"areawriter_impl.hh\"\n- 44\n- 45#endif\n-areawriter_impl.hh\n+ 5/* IMPLEMENTATION OF CLASS G R I D G L U E */\n+ 6\n+8#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 Dune {\n+20namespace 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< Dune::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< Dune::GeometryType >\n+ 60 {\n+ 61 static const unsigned int size = 1;\n+ 62 static inline MPI_Datatype getType()\n+ 63 {\n+ 64 return Dune::MPITraits< Dune::GeometryType >::getType();\n+ 65 }\n+ 66 };\n+ 67\n+ 68 template\n+ 69 void MPI_SetVectorSize(\n+ 70 std::vector & data,\n+ 71 MPI_Status & status)\n+ 72 {\n+ 73 typedef MPITypeInfo Info;\n+ 74 int sz;\n+ 75 MPI_Get_count(&status, Info::getType(), &sz);\n+ 76 assert(sz%Info::size == 0);\n+ 77 data.resize(sz/Info::size);\n+ 78 }\n+ 79\n+ 89 template\n+ 90 void MPI_SendVectorInRing(\n+ 91 std::vector & data,\n+ 92 std::vector & next,\n+ 93 int tag,\n+ 94 int rightrank,\n+ 95 int leftrank,\n+ 96 MPI_Comm comm,\n+ 97 MPI_Request& r_send,\n+ 98 MPI_Request& r_recv\n+ 99 )\n+ 100 {\n+ 101 // mpi status stuff\n+ 102 [[maybe_unused]] int result = 0;\n+ 103 typedef MPITypeInfo Info;\n+ 104 // resize next buffer to maximum size\n+ 105 next.resize(next.capacity());\n+ 106 // send data (explicitly send data.size elements)\n+ 107 result =\n+ 108 MPI_Isend(\n+ 109 &(data[0]), Info::size*data.size(), Info::getType(), rightrank, tag,\n+ 110 comm, &r_send);\n+ 111 // receive up to maximum size. The acutal size is stored in the status\n+ 112 result =\n+ 113 MPI_Irecv(\n+ 114 &(next[0]), Info::size*next.size(), Info::getType(), leftrank, tag,\n+ 115 comm, &r_recv);\n+ 116 // // check result\n+ 117 // MPI_Status status;\n+ 118 // CheckMPIStatus(result, status);\n+ 119 }\n+ 120\n+ 121 template\n+ 122 using ptr_t = T*;\n+ 123\n+ 124 /* these helper structs are needed as long as we still support\n+ 125 C++11, as we can't use variadic lambdas */\n+ 126 template\n+ 127 struct call_MPI_SendVectorInRing\n+ 128 {\n+ 129 std::tuple & remotedata;\n+ 130 std::tuple & nextdata;\n+ 131 int & tag;\n+ 132 int & rightrank;\n+ 133 int & leftrank;\n+ 134 MPI_Comm & mpicomm;\n+ 135 std::array & requests_send;\n+ 136 std::array & requests_recv;\n+ 137\n+ 138 template\n+ 139 void operator()(I i)\n+ 140 {\n+ 141 MPI_SendVectorInRing(\n+ 142 std::get(remotedata),\n+ 143 std::get(nextdata),\n+ 144 tag+i,\n+ 145 rightrank, leftrank, mpicomm,\n+ 146 requests_send[i],\n+ 147 requests_recv[i]);\n+ 148 }\n+ 149 };\n+ 150 template\n+ 151 struct call_MPI_SetVectorSize\n+ 152 {\n+ 153 std::tuple & nextdata;\n+ 154 std::array & status_recv;\n+ 155\n+ 156 template\n+ 157 void operator()(I i)\n+ 158 {\n+ 159 MPI_SetVectorSize(std::get(nextdata),status_recv[i]);\n+ 160 }\n+ 161 };\n+ 162\n+ 163 template\n+ 164 void MPI_AllApply_impl(MPI_Comm mpicomm,\n+ 165 OP && op,\n+ 166 std::index_sequence indices,\n+ 167 const Args&... data)\n+ 168 {\n+ 169 constexpr std::size_t N = sizeof...(Args);\n+ 170 int myrank = 0;\n+ 171 int commsize = 0;\n+ 172#if HAVE_MPI\n+ 173 MPI_Comm_rank(mpicomm, &myrank);\n+ 174 MPI_Comm_size(mpicomm, &commsize);\n+ 175#endif // HAVE_MPI\n+ 176\n+ 177 if (commsize > 1)\n+ 178 {\n+ 179#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n+ 180 std::cout << myrank << \" Start Communication, size \" << commsize << std::\n+endl;\n+ 181#endif\n+ 182\n+ 183 // get data sizes\n+ 184 std::array size({ ((unsigned int)data.size())... });\n+ 185\n+ 186 // communicate max data size\n+ 187 std::array maxSize;\n+ 188 MPI_Allreduce(&size, &maxSize,\n+ 189 size.size(), MPI_UNSIGNED, MPI_MAX, mpicomm);\n+ 190#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n+ 191 std::cout << myrank << \" maxSize \" << \"done... \" << std::endl;\n+ 192#endif\n+ 193\n+ 194 // allocate receiving buffers with maxsize to ensure sufficient buffer\n+size 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+297void MPI_AllApply(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 Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::write_glue_area_vtk\n-void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n-Definition: areawriter_impl.hh:84\n-Dune::GridGlue::write_glue_areas_vtk\n-void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n-Definition: areawriter_impl.hh:129\n+Dune::Parallel::MPI_AllApply\n+void MPI_AllApply(MPI_Comm mpicomm, OP &&op, const Args &... data)\n+apply an operator locally to a difstributed data set\n+Definition: ringcomm.hh:297\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: areawriter_impl.hh File Reference \n+dune-grid-glue: projection_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -63,56 +63,49 @@\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+Go to the documentation of this file.\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 Definition: gridglue.hh:37
void write_glue_area_vtk(const Glue &glue, std::ostream &out)
Definition: areawriter_impl.hh:84
void write_glue_areas_vtk(const Glue &glue, const std::string &base)
Definition: areawriter_impl.hh:129
void 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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,49 +5,309 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-areawriter.hh\n+ringcomm.hh\n Go_to_the_documentation_of_this_file.\n- 1// SPDX-FileCopyrightInfo: Copyright \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 \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-\n+ 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-\n with-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 areawriter_impl.hh File Reference
projection_impl.hh File Reference
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n\n \n-
\n
\n
\n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,44 +5,45 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Classes | Namespaces | Functions\n-areawriter_impl.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n+Namespaces | Functions\n+projection_impl.hh File Reference\n+#include \n+#include \n Go_to_the_source_code_of_this_file.\n- Classes\n-struct \u00a0Dune::GridGlue::AreaWriterImplementation::FacetLayout<_dimgrid_>\n-\u00a0\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n-namespace \u00a0Dune::GridGlue::AreaWriterImplementation\n+namespace \u00a0Dune::GridGlue::ProjectionImplementation\n \u00a0\n Functions\n-template\n-void\u00a0Dune::GridGlue::AreaWriterImplementation::write_facet_geometry (const\n- GridView &gv, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string\n- &filename)\n-\u00a0\n-template\n-void\u00a0Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string\n- &base)\n+template\n+ Coordinate\u00a0Dune::GridGlue::ProjectionImplementation::\n+ corner (unsigned c)\n+\u00a0\n+std::pair< unsigned, unsigned >\u00a0Dune::GridGlue::ProjectionImplementation::\n+ edgeToCorners (unsigned edge)\n+\u00a0\n+template\n+ Corners::value_type\u00a0Dune::GridGlue::ProjectionImplementation::\n+ interpolate (const Coordinate &x, const\n+ Corners &corners)\n+\u00a0\n+template\n+ Normals::value_type\u00a0Dune::GridGlue::ProjectionImplementation::\n+ interpolate_unit_normals (const Coordinate &x,\n+ const Normals &normals)\n+\u00a0\n+template\n+ bool\u00a0Dune::GridGlue::ProjectionImplementation::\n+ inside (const Coordinate &x, const Field\n+ &epsilon)\n \u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00038_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-grid-glue: areawriter_impl.hh Source File \n+dune-grid-glue: projection_impl.hh Source File \n \n \n \n \n \n \n \n@@ -62,169 +62,449 @@\n \n \n
\n #include <fstream>\n-
#include <vector>\n-
#include <dune/common/fvector.hh>\n-
#include <dune/geometry/type.hh>\n-
#include <dune/grid/common/mcmgmapper.hh>\n+
#include <dune/common/fmatrix.hh>\n+
#include <cmath>\n
Go to the source code of this file.
\n\n-Classes | |
| struct | Dune::GridGlue::AreaWriterImplementation::FacetLayout< dimgrid > |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::GridGlue |
| namespace | Dune::GridGlue::AreaWriterImplementation |
| namespace | Dune::GridGlue::ProjectionImplementation |
\n Functions | |
| template<typename GridView > | |
| void | Dune::GridGlue::AreaWriterImplementation::write_facet_geometry (const GridView &gv, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out) |
| template<int side, typename Glue > | |
| void | Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string &filename) |
| template<typename Glue > | |
| void | Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string &base) |
| template<typename 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.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,44 +5,45 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Classes | Namespaces | Functions\n-areawriter_impl.hh File Reference\n-#include \n- \n+ \n
\n areawriter_impl.hh
projection_impl.hh
\n Go to the documentation of this file.\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n \n 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- 87 using Mapper = Dune::MultipleCodimMultipleGeomTypeMapper<GridView, AreaWriterImplementation::FacetLayout>;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 100 const auto& refElement = Dune::ReferenceElements<ctype, GridView::dimension>::general(element.type());
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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+ 469::project(const std::tuple<Corners&, Corners&>& corners, const std::tuple<Normals&, Normals&>& normals)
\n+\n+\n+\n+\n+\n+\n+\n+\n Definition: gridglue.hh:37
void write_glue_area_vtk(const Glue &glue, std::ostream &out)
Definition: areawriter_impl.hh:84
void write_glue_areas_vtk(const Glue &glue, const std::string &base)
Definition: areawriter_impl.hh:129
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
void write_facet_geometry(const GridView &gv, std::ostream &out)
Definition: areawriter_impl.hh:25
Definition: rangegenerators.hh:17
Definition: areawriter_impl.hh:17
bool contains(Dune::GeometryType gt) const
Definition: areawriter_impl.hh:18
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
Projection(const Field overlap=Field(0), const Field max_normal_product=Field(-0.1))
Definition: projection_impl.hh:130
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
\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,185 +5,494 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-areawriter_impl.hh\n+projection_impl.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include projection.hh File Reference
\n
\n
\n
\n-
\n+
\n\n \n
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,494 +5,49 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-projection_impl.hh\n+areawriter.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include \n- 4\n- 5#include \n- 6\n- 7namespace Dune {\n- 8namespace GridGlue {\n- 9\n-10namespace ProjectionImplementation {\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 Dune {\n+ 10namespace GridGlue {\n 11\n- 22template\n- 23inline Coordinate\n-24corner(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-43edgeToCorners(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-70interpolate(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-91interpolate_unit_normals(const Coordinate& x, const Normals& normals)\n- 92{\n- 93 auto n = interpolate(x, normals);\n- 94 n /= n.two_norm();\n- 95 return n;\n- 96}\n- 97\n- 109template\n- 110inline bool\n-111inside(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\u1d62 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-130::Projection(const Field overlap, const Field 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- 139Projection\n-140::epsilon(const Field epsilon)\n- 141{\n- 142 m_epsilon = epsilon;\n- 143}\n- 144\n- 145template\n- 146template\n- 147void\n- 148Projection\n- 149::doProjection(const std::tuple& corners, const std::\n-tuple& normals)\n- 150{\n- 151 /* Try to obtain \u03a6(x\u1d62) for each corner x\u1d62 of the preimage triangle.\n- 152 * This means solving a linear system of equations\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- 155 * to obtain the barycentric coordinates (\u03b1, \u03b2) of \u03a6(x\u1d62) in the image\n- 156 * triangle and the distance \u03b4.\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\u1d62 = (y\u1d62 - y\u2080) / ||y\u1d62 - y\u2080||\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\u1d62 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 = (\u03b1, \u03b2, \u03b4) */\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 -\u03b4 as the term is \"-\u03b4 n\u1d62\". */\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 \u03a6\u207b\u00b9(y\u1d62) for each corner y\u1d62 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 \u03a6\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\u1d62 with respect to the triangle\n- 249 * with the corners \u03a6(x\u1d62). 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\u1d62 on the plane spanned by the y\u1d62\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] = interpolate(images[i+1], target_corners);\n- 274 v[i] -= interpolate(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\u1d62 to barycentric coordinates with respect to \u03a6(x\u2c7c) */\n- 286 v[dim-1] = target_corners[i];\n- 287 v[dim-1] -= interpolate(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 = interpolate(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 \u03a6(x\u2c7c) */\n- 302 const bool feasible = projectionFeasible(target_corners[i], get<1>\n-(normals)[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>\n-(m_success).all()) {\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 \u03a6(x\u1d62), \u03a6(x\u2c7c) with line through y\u2096, y\u2097:\n- 335 We want \u03b1, \u03b2 \u2208 \u211d such that\n- 336 \u03a6(x\u1d62) + \u03b1 (\u03a6(x\u2c7c) - \u03a6(x\u1d62)) = y\u2096 + \u03b2 (y\u2097 - y\u2096)\n- 337 or\n- 338 \u03b1 (\u03a6(x\u2c7c)-\u03a6(x\u1d62)) + \u03b2 (y\u2097-y\u2096) = y\u2096-\u03a6(x\u1d62)\n- 339 To get a 2\u00d72 system of equations, multiply with y\u2098-y\u2080 for\n- 340 m \u2208 {1,\u0323\u03232} which are linear indep. (and so the system is\n- 341 equivalent to the original 3\u00d72 system)\n- 342 */\n- 343 for (unsigned edgex = 0; edgex < dim; ++edgex) {\n- 344 unsigned i, j;\n- 345 std::tie(i, j) = edgeToCorners(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 = interpolate(images[i], ys);\n- 352 const auto pxj = interpolate(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) = edgeToCorners(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(i));\n- 402 Coordinate local_y = corner(k);\n- 403 local_y.axpy(z[1], corner(l) - corner(k));\n- 404\n- 405 /* Make sure the intersection is in the triangle. */\n- 406 if (!inside(local_x, m_epsilon) || !inside(local_y, m_epsilon))\n- 407 continue;\n- 408\n- 409 /* Make sure the intersection respects overlap. */\n- 410 auto xy = interpolate(local_x, get<0>(corners));\n- 411 xy -= interpolate(local_y, get<1>(corners));\n- 412 const auto nx = interpolate_unit_normals(local_x, get<0>(normals));\n- 413 const auto ny = interpolate_unit_normals(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 (!inside(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 -= interpolate(px, corners);\n- 453 const auto n = interpolate_unit_normals(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 \u03a6(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-469::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+ 12template\n+ 13void write_glue_area_vtk(const Glue& glue, std::ostream& out);\n+ 14\n+ 15template\n+ 16void write_glue_area_vtk(const Glue& glue, const std::string& filename);\n+ 17\n+ 37template\n+ 38void write_glue_areas_vtk(const Glue& glue, const std::string& base);\n+ 39\n+ 40} /* namespace GridGlue */\n+ 41} /* namespace Dune */\n+ 42\n+ 43#include \"areawriter_impl.hh\"\n+ 44\n+ 45#endif\n+areawriter_impl.hh\n Dune\n Definition: gridglue.hh:37\n-Dune::GridGlue::ProjectionImplementation::interpolate\n-Corners::value_type interpolate(const Coordinate &x, const Corners &corners)\n-Definition: projection_impl.hh:70\n-Dune::GridGlue::ProjectionImplementation::inside\n-bool inside(const Coordinate &x, const Field &epsilon)\n-Definition: projection_impl.hh:111\n-Dune::GridGlue::ProjectionImplementation::edgeToCorners\n-std::pair< unsigned, unsigned > edgeToCorners(unsigned edge)\n-Definition: projection_impl.hh:43\n-Dune::GridGlue::ProjectionImplementation::corner\n-Coordinate corner(unsigned c)\n-Definition: projection_impl.hh:24\n-Dune::GridGlue::ProjectionImplementation::interpolate_unit_normals\n-Normals::value_type interpolate_unit_normals(const Coordinate &x, const Normals\n-&normals)\n-Definition: projection_impl.hh:91\n-Dune::GridGlue::Projection\n-Projection of a line (triangle) on another line (triangle).\n-Definition: projection.hh:21\n-Dune::GridGlue::Projection::Field\n-Coordinate::field_type Field\n-Scalar type.\n-Definition: projection.hh:61\n-Dune::GridGlue::Projection::Projection\n-Projection(const Field overlap=Field(0), const Field max_normal_product=Field(-\n-0.1))\n-Definition: projection_impl.hh:130\n-Dune::GridGlue::Projection::epsilon\n-void epsilon(const Field epsilon)\n-Set epsilon used for floating-point comparisons.\n-Definition: projection_impl.hh:140\n-Dune::GridGlue::Projection::project\n-void project(const std::tuple< Corners &, Corners & > &corners, const std::\n-tuple< Normals &, Normals & > &normals)\n-Do the actual projection.\n-Definition: projection_impl.hh:469\n+Dune::GridGlue::write_glue_area_vtk\n+void write_glue_area_vtk(const Glue &glue, std::ostream &out)\n+Definition: areawriter_impl.hh:84\n+Dune::GridGlue::write_glue_areas_vtk\n+void write_glue_areas_vtk(const Glue &glue, const std::string &base)\n+Definition: areawriter_impl.hh:129\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\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: projectionwriter.hh File Reference \n+dune-grid-glue: projectionwriter_impl.hh File Reference \n \n \n \n \n \n \n \n@@ -65,33 +65,47 @@\n dune grid-glue common \n \n \n
#include <array>\n
#include <bitset>\n
#include <tuple>\n-
#include "projection_impl.hh"\n+
#include "projection_impl.hh"\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... |
\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 More... | |
| 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 More... | |
| 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 More... | |
| 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. More... | |
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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,40 +5,38 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-Namespaces | Macros | Functions\n-ringcomm.hh File Reference\n-#include \n- \n+ \n
\n ringcomm.hh
projectionwriter.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,309 +5,63 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-ringcomm.hh\n+projectionwriter.hh\n Go_to_the_documentation_of_this_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 \u00a9 DUNE Project contributors, see file\n+ 1// SPDX-FileCopyrightInfo: Copyright \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-\n+ 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-\n with-dune-grid-glue-exception\n- 5/* IMPLEMENTATION OF CLASS G R I D G L U E */\n- 6\n-8#define CheckMPIStatus(A,B) {}\n- 9\n- 10#include \n- 11#include \n- 12#include \n+ 3#ifndef DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n+ 4#define DUNE_GRIDGLUE_COMMON_PROJECTIONWRITER_HH\n+ 5\n+ 6#include \n+ 7#include \n+ 8\n+ 9#include \n+ 10\n+ 11namespace Dune {\n+ 12namespace GridGlue {\n 13\n- 14#include \n- 15#include \n- 16\n- 17#include \n- 18\n- 19namespace Dune {\n-20namespace 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< Dune::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< Dune::GeometryType >\n- 60 {\n- 61 static const unsigned int size = 1;\n- 62 static inline MPI_Datatype getType()\n- 63 {\n- 64 return Dune::MPITraits< Dune::GeometryType >::getType();\n- 65 }\n- 66 };\n- 67\n- 68 template\n- 69 void MPI_SetVectorSize(\n- 70 std::vector & data,\n- 71 MPI_Status & status)\n- 72 {\n- 73 typedef MPITypeInfo Info;\n- 74 int sz;\n- 75 MPI_Get_count(&status, Info::getType(), &sz);\n- 76 assert(sz%Info::size == 0);\n- 77 data.resize(sz/Info::size);\n- 78 }\n- 79\n- 89 template\n- 90 void MPI_SendVectorInRing(\n- 91 std::vector & data,\n- 92 std::vector & next,\n- 93 int tag,\n- 94 int rightrank,\n- 95 int leftrank,\n- 96 MPI_Comm comm,\n- 97 MPI_Request& r_send,\n- 98 MPI_Request& r_recv\n- 99 )\n- 100 {\n- 101 // mpi status stuff\n- 102 [[maybe_unused]] int result = 0;\n- 103 typedef MPITypeInfo Info;\n- 104 // resize next buffer to maximum size\n- 105 next.resize(next.capacity());\n- 106 // send data (explicitly send data.size elements)\n- 107 result =\n- 108 MPI_Isend(\n- 109 &(data[0]), Info::size*data.size(), Info::getType(), rightrank, tag,\n- 110 comm, &r_send);\n- 111 // receive up to maximum size. The acutal size is stored in the status\n- 112 result =\n- 113 MPI_Irecv(\n- 114 &(next[0]), Info::size*next.size(), Info::getType(), leftrank, tag,\n- 115 comm, &r_recv);\n- 116 // // check result\n- 117 // MPI_Status status;\n- 118 // CheckMPIStatus(result, status);\n- 119 }\n- 120\n- 121 template\n- 122 using ptr_t = T*;\n- 123\n- 124 /* these helper structs are needed as long as we still support\n- 125 C++11, as we can't use variadic lambdas */\n- 126 template\n- 127 struct call_MPI_SendVectorInRing\n- 128 {\n- 129 std::tuple & remotedata;\n- 130 std::tuple & nextdata;\n- 131 int & tag;\n- 132 int & rightrank;\n- 133 int & leftrank;\n- 134 MPI_Comm & mpicomm;\n- 135 std::array & requests_send;\n- 136 std::array & requests_recv;\n- 137\n- 138 template\n- 139 void operator()(I i)\n- 140 {\n- 141 MPI_SendVectorInRing(\n- 142 std::get(remotedata),\n- 143 std::get(nextdata),\n- 144 tag+i,\n- 145 rightrank, leftrank, mpicomm,\n- 146 requests_send[i],\n- 147 requests_recv[i]);\n- 148 }\n- 149 };\n- 150 template\n- 151 struct call_MPI_SetVectorSize\n- 152 {\n- 153 std::tuple & nextdata;\n- 154 std::array & status_recv;\n- 155\n- 156 template\n- 157 void operator()(I i)\n- 158 {\n- 159 MPI_SetVectorSize(std::get(nextdata),status_recv[i]);\n- 160 }\n- 161 };\n- 162\n- 163 template\n- 164 void MPI_AllApply_impl(MPI_Comm mpicomm,\n- 165 OP && op,\n- 166 std::index_sequence indices,\n- 167 const Args&... data)\n- 168 {\n- 169 constexpr std::size_t N = sizeof...(Args);\n- 170 int myrank = 0;\n- 171 int commsize = 0;\n- 172#if HAVE_MPI\n- 173 MPI_Comm_rank(mpicomm, &myrank);\n- 174 MPI_Comm_size(mpicomm, &commsize);\n- 175#endif // HAVE_MPI\n- 176\n- 177 if (commsize > 1)\n- 178 {\n- 179#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n- 180 std::cout << myrank << \" Start Communication, size \" << commsize << std::\n-endl;\n- 181#endif\n- 182\n- 183 // get data sizes\n- 184 std::array size({ ((unsigned int)data.size())... });\n- 185\n- 186 // communicate max data size\n- 187 std::array maxSize;\n- 188 MPI_Allreduce(&size, &maxSize,\n- 189 size.size(), MPI_UNSIGNED, MPI_MAX, mpicomm);\n- 190#ifdef DEBUG_GRIDGLUE_PARALLELMERGE\n- 191 std::cout << myrank << \" maxSize \" << \"done... \" << std::endl;\n- 192#endif\n- 193\n- 194 // allocate receiving buffers with maxsize to ensure sufficient buffer\n-size 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-297void MPI_AllApply(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+ 28template\n+ 29void write(const Projection& projection,\n+ 30 const Corners& corners,\n+ 31 const Normals& normals,\n+ 32 std::ostream& out);\n+ 33\n+ 40template\n+ 41void write(const Projection& projection,\n+ 42 const Corners& corners,\n+ 43 const Normals& normals,\n+ 44 const std::string& filename);\n+ 54template\n+ 55void print(const Projection& projection,\n+ 56 const Corners& corners,\n+ 57 const Normals& normals);\n+ 58\n+ 59} /* namespace GridGlue */\n+ 60} /* namespace Dune */\n+ 61\n+ 62#include \"projectionwriter_impl.hh\"\n+ 63\n+ 64#endif\n+projection.hh\n+projectionwriter_impl.hh\n Dune\n Definition: gridglue.hh:37\n-Dune::Parallel::MPI_AllApply\n-void MPI_AllApply(MPI_Comm mpicomm, OP &&op, const Args &... data)\n-apply an operator locally to a difstributed data set\n-Definition: ringcomm.hh:297\n+Dune::GridGlue::write\n+void write(const Projection< Coordinate > &projection, const Corners &corners,\n+const Normals &normals, std::ostream &out)\n+write projection in VTK format\n+Definition: projectionwriter_impl.hh:86\n+Dune::GridGlue::print\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+Definition: projectionwriter_impl.hh:140\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00047.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00047.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: areawriter.hh File Reference \n \n \n \n \n \n \n \n@@ -65,47 +65,41 @@\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+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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\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(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals, std::ostream &out)
write projection in VTK format
Definition: projectionwriter_impl.hh:86
void print(const Projection< Coordinate > &projection, const Corners &corners, const Normals &normals)
Print information about the projection to std::cout stream.
Definition: projectionwriter_impl.hh:140
\n Generated by
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,309 +5,63 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-ringcomm.hh\n+projectionwriter.hh\n Go_to_the_documentation_of_this_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 \u00a9 DUNE Project contributors, see file\n+ 1// SPDX-FileCopyrightInfo: Copyright \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-\n+ 2// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-\n with-dune-grid-glue-exception\n- 5/* IMPLEMENTATION OF CLASS G R I D G L U E */\n- 6\n-8#define CheckMPIStatus(A,B) {}\n- 9\n- 10#include \n \n+ \n
\n \n Namespaces |\n Functions
\n- projection_impl.hh File Reference
areawriter.hh File Reference
\n-
\n-
\n+\n\n
\n
\n \n \n
\n Generated by 1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,44 +6,32 @@\n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n Namespaces | Functions\n-projection_impl.hh File Reference\n-#include \n-#include \n+areawriter.hh File Reference\n+#include \n+#include \n+#include \"areawriter_impl.hh\"\n Go_to_the_source_code_of_this_file.\n Namespaces\n namespace \u00a0Dune\n \u00a0\n namespace \u00a0Dune::GridGlue\n \u00a0\n-namespace \u00a0Dune::GridGlue::ProjectionImplementation\n-\u00a0\n Functions\n-template\n- Coordinate\u00a0Dune::GridGlue::ProjectionImplementation::\n- corner (unsigned c)\n-\u00a0\n-std::pair< unsigned, unsigned >\u00a0Dune::GridGlue::ProjectionImplementation::\n- edgeToCorners (unsigned edge)\n-\u00a0\n-template\n- Corners::value_type\u00a0Dune::GridGlue::ProjectionImplementation::\n- interpolate (const Coordinate &x, const\n- Corners &corners)\n-\u00a0\n-template\n- Normals::value_type\u00a0Dune::GridGlue::ProjectionImplementation::\n- interpolate_unit_normals (const Coordinate &x,\n- const Normals &normals)\n+template\n+void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, std::ostream &out)\n \u00a0\n-template\n- bool\u00a0Dune::GridGlue::ProjectionImplementation::\n- inside (const Coordinate &x, const Field\n- &epsilon)\n+template\n+void\u00a0Dune::GridGlue::write_glue_area_vtk (const Glue &glue, const std::string\n+ &filename)\n+\u00a0\n+template\n+void\u00a0Dune::GridGlue::write_glue_areas_vtk (const Glue &glue, const std::string\n+ &base)\n \u00a0\n \n ===============================================================================\n Generated by\u00a0[doxygen] 1.9.4\n"}]}, {"source1": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00047_source.html", "source2": "./usr/share/doc/libdune-grid-glue-doc/doxygen/a00047_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: areawriter.hh Source File \n \n \n \n \n \n \n \n@@ -62,449 +62,47 @@\n \n \n
\n #include <dune/common/fmatrix.hh>\n-
#include <cmath>\n+\n
Go to the source code of this file.
\n\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) |
| 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) |
\n Generated by
1.9.4\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,44 +6,32 @@\n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n Namespaces | Functions\n-projection_impl.hh File Reference\n-#include \n- \n+ \n
\n projection_impl.hh
areawriter.hh
\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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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- 469::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 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
Projection(const Field overlap=Field(0), const Field max_normal_product=Field(-0.1))
Definition: projection_impl.hh:130
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
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.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,494 +5,49 @@\n \n dune-grid-glue\u00a02.9\n \n \n * dune\n * grid-glue\n * common\n-projection_impl.hh\n+areawriter.hh\n Go_to_the_documentation_of_this_file.\n 1// SPDX-FileCopyrightInfo: Copyright \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-\n with-dune-grid-glue-exception\n- 3#include \n \n+ \n
\n \n Namespaces |\n Functions
\n- projectionwriter.hh File Reference
projectionwriter_impl.hh File Reference
\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 <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 More... | |
| 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 More... |