Utilities for handling filesystem paths. \n+
helper classes to provide unique types for standard functions \n More...
\n#include <algorithm>\n-
#include <iterator>\n-
#include <string>\n-
#include <dune/common/exceptions.hh>\n-
#include <dune/common/stringutility.hh>\n-
#include <dune/common/path.hh>\n-
\n+Classes | |
| struct | Dune::Min< Type > |
| struct | Dune::Max< Type > |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
\n-Functions | |
| std::string | Dune::concatPaths (const std::string &base, const std::string &p) |
| concatenate two paths | |
| std::string | Dune::processPath (const std::string &p) |
| sanitize a path for further processing | |
| bool | Dune::pathIndicatesDirectory (const std::string &p) |
| check whether the given path indicates that it is a directory | |
| std::string | Dune::prettyPath (const std::string &p, bool isDirectory) |
| pretty print path | |
| std::string | Dune::prettyPath (const std::string &p) |
| pretty print path | |
| std::string | Dune::relativePath (const std::string &newbase, const std::string &p) |
| compute a relative path between two paths | |
Detailed Description
\n-Utilities for handling filesystem paths.
\n-- Author
- J\u00f6 Fahlke jorri.nosp@m.t@jo.nosp@m.rrit..nosp@m.de
helper classes to provide unique types for standard functions
\n\n Generated by
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,46 +1,24 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-path.cc File Reference\n-_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bU_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs \u00bb _\bF_\bi_\bl_\be_\bs_\by_\bs_\bt_\be_\bm_\b _\bP_\ba_\bt_\bh_\bs\n-Utilities for handling filesystem paths. _\bM_\bo_\br_\be_\b._\b._\b.\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+binaryfunctions.hh File Reference\n+helper classes to provide unique types for standard functions _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n\n \n
\n
\n+
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,40 +1,73 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n+ * _\bs_\bi_\bm_\bd\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-dynvector.hh File Reference\n-_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bD_\be_\bn_\bs_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b _\ba_\bn_\bd_\b _\bV_\be_\bc_\bt_\bo_\br_\b _\bT_\be_\bm_\bp_\bl_\ba_\bt_\be_\b _\bL_\bi_\bb_\br_\ba_\br_\by\n-This file implements a dense vector with a dynamic size. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n+standard.hh File Reference\n+_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bV_\be_\bc_\bt_\bo_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn \u00bb _\bA_\bp_\bp_\bl_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b _\bD_\be_\bv_\be_\bl_\bo_\bp_\be_\br_\b'_\bs_\b _\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be \u00bb _\bS_\bI_\bM_\bD_\b _\bA_\bb_\bs_\bt_\br_\ba_\bc_\bt_\bi_\bo_\bn\n+_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bs_\bt_\ba_\bn_\bd_\ba_\br_\bd_\b _\bt_\by_\bp_\be_\bs\n+SIMD abstractions for the standard built-in types. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n+#include \n #include \n-#include \"_\bb_\bo_\bu_\bn_\bd_\bs_\bc_\bh_\be_\bc_\bk_\bi_\bn_\bg_\b._\bh_\bh\"\n-#include \"_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n-#include \"_\bg_\be_\bn_\be_\br_\bi_\bc_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b._\bh_\bh\"\n-#include \n-#include \"_\bd_\be_\bn_\bs_\be_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bb_\ba_\bs_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bd_\be_\bf_\ba_\bu_\bl_\bt_\bs_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\b<_\b _\bV_\b,_\b _\bc_\bl_\ba_\bs_\bs_\b _\b>\n+\u00a0 should have a member type type _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be_\b<_\b _\bS_\b,_\b _\bc_\bl_\ba_\bs_\bs_\b,_\b _\bc_\bl_\ba_\bs_\bs_\b _\b>\n+\u00a0 should have a member type type _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>\n-\u00a0 Construct a vector with a dynamic size. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt_\b<_\b _\bc_\bl_\ba_\bs_\bs_\b,_\b _\bc_\bl_\ba_\bs_\bs_\b _\b>\n+\u00a0 should be derived from a _\bD_\bu_\bn_\be_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b__\bc_\bo_\bn_\bs_\bt_\ba_\bn_\bt _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0 _\bD_\bu_\bn_\be namespace.\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd\n+\u00a0 Namespace for vectorization interface functions used by library\n+ developers.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs\n+\u00a0 Namespace for the overloads and specializations that make up a SIMD\n+ implementation.\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+Specialized classes and overloaded functions\n+template\n+ V\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 2 >, std::size_t, V v)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\b(_\b)\n+\u00a0\n+template\n+ V &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 3 >, std::size_t, V &v)\n+\u00a0\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 2 >, bool _\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be_\b(_\b)\n+\u00a0\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 2 >, bool _\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be_\b(_\b)\n+\u00a0\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 2 >, bool _\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be_\b(_\b)\n+\u00a0\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 2 >, bool _\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be_\b(_\b)\n+\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file implements a dense vector with a dynamic size.\n+SIMD abstractions for the standard built-in types.\n+This file should not normally be included by users of the SIMD abstraction\n+(i.e. other _\bD_\bu_\bn_\be headers). Neither should it be included by the translation\n+units passing built-in types to _\bD_\bu_\bn_\be headers that in turn support SIMD types\n+through the SIMD abstraction. Dune-functionality always supports built-in\n+types. Either because that functionality does not support SIMD types and so\n+only supports built-in types, or if it does support SIMD types it must include\n+<_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>, which in turn includes this header.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00011_source.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00011_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: dynvector.hh Source File \n+dune-common: standard.hh Source File \n \n \n \n \n \n \n \n@@ -70,275 +70,102 @@\n \n
\n \n \n \n \n \n This file implements a dense vector with a dynamic size. \n+
SIMD abstractions for the standard built-in types. \n More...
\n-#include <cmath>\n-
#include <cstddef>\n-
#include <cstdlib>\n-
#include <complex>\n-
#include <cstring>\n-
#include <initializer_list>\n-
#include <limits>\n+
#include <cstddef>\n+
#include <type_traits>\n
#include <utility>\n-
#include "boundschecking.hh"\n-
#include "exceptions.hh"\n-
#include "genericiterator.hh"\n-
#include <vector>\n-
#include "densevector.hh"\n+
#include <dune/common/indices.hh>\n+
#include <dune/common/simd/base.hh>\n+
#include <dune/common/simd/defaults.hh>\n
Go to the source code of this file.
\n\n Classes | |
| struct | Dune::DenseMatVecTraits< DynamicVector< K, Allocator > > |
| struct | Dune::Simd::Overloads::ScalarType< V, class > |
should have a member type type More... | |
| struct | Dune::FieldTraits< DynamicVector< K, Allocator > > |
| struct | Dune::Simd::Overloads::RebindType< S, class, class > |
should have a member type type More... | |
| class | Dune::DynamicVector< K, Allocator > |
| Construct a vector with a dynamic size. More... | |
| struct | Dune::Simd::Overloads::LaneCount< class, class > |
should be derived from a Dune::index_constant More... | |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
| namespace | Dune::Simd::Overloads |
| Namespace for the overloads and specializations that make up a SIMD implementation. | |
\n+Functions | |
Specialized classes and overloaded functions | |
| template<class V > | |
| V | Dune::Simd::Overloads::lane (ADLTag< 2 >, std::size_t, V v) |
| implements Simd::lane() | |
| template<class V > | |
| V & | Dune::Simd::Overloads::lane (ADLTag< 3 >, std::size_t, V &v) |
| bool | Dune::Simd::Overloads::anyTrue (ADLTag< 2 >, bool mask) |
| implements Simd::anyTrue() | |
| bool | Dune::Simd::Overloads::allTrue (ADLTag< 2 >, bool mask) |
| implements Simd::allTrue() | |
| bool | Dune::Simd::Overloads::anyFalse (ADLTag< 2 >, bool mask) |
| implements Simd::anyFalse() | |
| bool | Dune::Simd::Overloads::allFalse (ADLTag< 2 >, bool mask) |
| implements Simd::allFalse() | |
Detailed Description
\n-This file implements a dense vector with a dynamic size.
\n+SIMD abstractions for the standard built-in types.
\n+This file should not normally be included by users of the SIMD abstraction (i.e. other Dune headers). Neither should it be included by the translation units passing built-in types to Dune headers that in turn support SIMD types through the SIMD abstraction. Dune-functionality always supports built-in types. Either because that functionality does not support SIMD types and so only supports built-in types, or if it does support SIMD types it must include <dune/common/simd/simd.hh>, which in turn includes this header.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,40 +1,73 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n+ * _\bs_\bi_\bm_\bd\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-dynvector.hh File Reference\n-_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bD_\be_\bn_\bs_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b _\ba_\bn_\bd_\b _\bV_\be_\bc_\bt_\bo_\br_\b _\bT_\be_\bm_\bp_\bl_\ba_\bt_\be_\b _\bL_\bi_\bb_\br_\ba_\br_\by\n-This file implements a dense vector with a dynamic size. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n dynvector.hh
standard.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,341 +1,124 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-dynvector.hh\n+ * _\bs_\bi_\bm_\bd\n+standard.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_DYNVECTOR_HH\n-6#define DUNE_DYNVECTOR_HH\n-7\n-8#include \n-9#include \n-10#include \n-11#include \n-12#include \n-13#include \n-14#include \n-15#include \n-16\n-17#include \"_\bb_\bo_\bu_\bn_\bd_\bs_\bc_\bh_\be_\bc_\bk_\bi_\bn_\bg_\b._\bh_\bh\"\n-18#include \"_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n-19#include \"_\bg_\be_\bn_\be_\br_\bi_\bc_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b._\bh_\bh\"\n-20\n-21#include \n-22#include \"_\bd_\be_\bn_\bs_\be_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_STANDARD_HH\n+4#define DUNE_COMMON_SIMD_STANDARD_HH\n+5\n+20#include \n+21#include \n+22#include \n 23\n-24namespace _\bD_\bu_\bn_\be {\n-25\n-34 template< class K, class Allocator > class DynamicVector;\n-35 template< class K, class Allocator >\n-_\b3_\b6 struct _\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs< _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br< K, Allocator > >\n-37 {\n-_\b3_\b8 typedef _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b> _\bd_\be_\br_\bi_\bv_\be_\bd_\b__\bt_\by_\bp_\be;\n-_\b3_\b9 typedef std::vector< K, Allocator > _\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br_\b__\bt_\by_\bp_\be;\n-_\b4_\b0 typedef K _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be;\n-_\b4_\b1 typedef typename container_type::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n-42 };\n-43\n-44 template< class K, class Allocator >\n-_\b4_\b5 struct _\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs< _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br< K, Allocator > >\n-46 {\n-_\b4_\b7 typedef typename _\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bK_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b4_\b8 typedef typename _\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bK_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-49 };\n-50\n-57 template< class K, class Allocator = std::allocator< K > >\n-_\b5_\b8 class _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br : public _\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br< DynamicVector< K, Allocator > >\n-59 {\n-60 std::vector< K, Allocator > _data;\n+24#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh>\n+25#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bb_\ba_\bs_\be_\b._\bh_\bh>\n+26#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bd_\be_\bf_\ba_\bu_\bl_\bt_\bs_\b._\bh_\bh>\n+27\n+45namespace _\bD_\bu_\bn_\be {\n+46 namespace Simd {\n+47\n+48 namespace Overloads {\n+49\n+56\n+59 template\n+_\b6_\b0 struct _\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be { using _\bt_\by_\bp_\be = V; };\n 61\n-62 typedef _\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b> > _\bB_\ba_\bs_\be;\n-63 public:\n-_\b6_\b4 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n-_\b6_\b5 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be;\n-66\n-_\b6_\b7 typedef std::vector< K, Allocator > _\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br_\b__\bt_\by_\bp_\be;\n+63\n+66 template\n+_\b6_\b7 struct _\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be { using _\bt_\by_\bp_\be = S; };\n 68\n-_\b6_\b9 typedef Allocator _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be;\n 70\n-_\b7_\b2 explicit _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(const _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be &a = _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be() ) :\n-73 _data( a )\n-74 {}\n+73 template\n+_\b7_\b4 struct _\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt : public _\bi_\bn_\bd_\be_\bx_\b__\bc_\bo_\bn_\bs_\bt_\ba_\bn_\bt<1> { };\n 75\n-_\b7_\b6 explicit _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be n, const _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be &a = _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be\n-() ) :\n-77 _data( n, _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be(), a )\n-78 {}\n-79\n-_\b8_\b1 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br( _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be n, _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be c, const _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be &a =\n-_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be() ) :\n-82 _data( n, c, a )\n-83 {}\n-84\n-_\b8_\b6 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br (std::initializer_list const &l) :\n-87 _data(l)\n-88 {}\n-89\n-_\b9_\b1 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(const _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br & x) :\n-92 _\bB_\ba_\bs_\be(), _data(x._data)\n-93 {}\n-94\n-_\b9_\b6 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br && x) :\n-97 _data(_\bs_\bt_\bd::move(x._data))\n-98 {}\n-99\n-100 template< class T >\n-_\b1_\b0_\b1 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(const _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bT_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b> & x) :\n-102 _data(x._\bb_\be_\bg_\bi_\bn(), x._\be_\bn_\bd(), x.get_allocator())\n-103 {}\n-104\n-106 template< class X >\n-_\b1_\b0_\b7 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br(const _\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bX_\b _\b> & x, const _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be &a =\n-_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be() ) :\n-108 _data(a)\n-109 {\n-110 const _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be n = x._\bs_\bi_\bz_\be();\n-111 _data.reserve(n);\n-112 for( _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i =0; i\n-_\b1_\b8_\b9 inline std::istream &_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b>_\b>_\b ( std::istream &in,\n-190 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b> &v )\n-191 {\n-192 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b> w(v);\n-193 for( typename _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i = 0; i < w._\bs_\bi_\bz_\be();\n-++i )\n-194 in >> w[ i ];\n-195 if(in)\n-196 v = std::move(w);\n-197 return in;\n-198 }\n-199\n-202} // end namespace\n-203\n-204#endif\n-_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\n-A few common exception classes.\n-_\bd_\be_\bn_\bs_\be_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n-Implements the dense vector interface, with an exchangeable storage class.\n-_\bb_\bo_\bu_\bn_\bd_\bs_\bc_\bh_\be_\bc_\bk_\bi_\bn_\bg_\b._\bh_\bh\n-Macro for wrapping boundary checks.\n-_\bg_\be_\bn_\be_\br_\bi_\bc_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b._\bh_\bh\n-Implements a generic iterator class for writing stl conformant iterators.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b>_\b>\n-Stream & operator>>(Stream &stream, std::tuple< Ts... > &t)\n-Read a std::tuple.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn streamoperators.hh:43\n-_\bD_\bU_\bN_\bE_\b__\bA_\bS_\bS_\bE_\bR_\bT_\b__\bB_\bO_\bU_\bN_\bD_\bS\n-#define DUNE_ASSERT_BOUNDS(cond)\n-If DUNE_CHECK_BOUNDS is defined: check if condition cond holds; otherwise, do\n-nothing.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn boundschecking.hh:30\n-_\bs_\bt_\bd\n-STL namespace.\n+77\n+86 template\n+_\b8_\b7 V _\bl_\ba_\bn_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b2_\b>, std::size_t, V v)\n+88 {\n+89 return v;\n+90 }\n+91\n+92 template\n+_\b9_\b3 V &_\bl_\ba_\bn_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b3_\b>, std::size_t, V &v)\n+94 {\n+95 return v;\n+96 }\n+97\n+98 // No Simd::cond() implementation, the overload for bool masks in the\n+99 // interface is sufficient\n+100\n+_\b1_\b0_\b2 inline bool _\ba_\bn_\by_\bT_\br_\bu_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b2_\b>, bool _\bm_\ba_\bs_\bk) { return _\bm_\ba_\bs_\bk; }\n+103\n+_\b1_\b0_\b5 inline bool _\ba_\bl_\bl_\bT_\br_\bu_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b2_\b>, bool _\bm_\ba_\bs_\bk) { return _\bm_\ba_\bs_\bk; }\n+106\n+_\b1_\b0_\b8 inline bool _\ba_\bn_\by_\bF_\ba_\bl_\bs_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b2_\b>, bool _\bm_\ba_\bs_\bk) { return !_\bm_\ba_\bs_\bk; }\n+109\n+_\b1_\b1_\b1 inline bool _\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be(_\bA_\bD_\bL_\bT_\ba_\bg_\b<_\b2_\b>, bool _\bm_\ba_\bs_\bk) { return !_\bm_\ba_\bs_\bk; }\n+112\n+114\n+115 } // namespace Overloads\n+116 } // namespace Simd\n+117} // namespace Dune\n+118\n+119#endif // DUNE_COMMON_SIMD_STANDARD_HH\n+_\bb_\ba_\bs_\be_\b._\bh_\bh\n+Basic definitions for SIMD Implementations.\n+_\bd_\be_\bf_\ba_\bu_\bl_\bt_\bs_\b._\bh_\bh\n+Default implementations for SIMD Implementations.\n+_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh\n+_\bD_\bu_\bn_\be_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b__\bc_\bo_\bn_\bs_\bt_\ba_\bn_\bt\n+std::integral_constant< std::size_t, i > index_constant\n+An index constant with value i.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indices.hh:29\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bs_\bk\n+Mask< V > mask(ADLTag< 0, std::is_same< V, Mask< V > >::value >, const V &v)\n+implements Simd::mask()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn defaults.hh:153\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be\n+bool allFalse(ADLTag< 0 >, const Mask &mask)\n+implements Simd::allFalse()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn defaults.hh:124\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be\n+bool allTrue(ADLTag< 0 >, const Mask &mask)\n+implements Simd::allTrue()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn defaults.hh:104\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be\n+bool anyFalse(ADLTag< 0 >, const Mask &mask)\n+implements Simd::anyFalse()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn defaults.hh:114\n _\bD_\bu_\bn_\be\n Dune namespace.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn alignedallocator.hh:13\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br\n-Interface for a class of dense vectors over a given field.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:229\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be\n-Traits::value_type value_type\n-export the type representing the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:250\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-Iterator begin()\n-begin iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:347\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be\n-size_type size() const\n-size method\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:336\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\be_\bn_\bd\n-Iterator end()\n-end iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:353\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-Traits::size_type size_type\n-The type used for the index access and size operation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densevector.hh:259\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-Construct a vector with a dynamic size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:59\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n-void resize(size_type n, value_type c=value_type())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(const DynamicVector &x)\n-Constructor making vector with identical coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:91\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-Base::size_type size_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:64\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br_\b__\bt_\by_\bp_\be\n-std::vector< K, Allocator > container_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be\n-size_type size() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:151\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-K & operator[](size_type i)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:152\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br\n-container_type & container()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:174\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be\n-Base::value_type value_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bd_\ba_\bt_\ba\n-const K * data() const noexcept\n-return pointer to underlying array\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:168\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be\n-Allocator allocator_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(const allocator_type &a=allocator_type())\n-Constructor making uninitialized vector.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:72\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(DynamicVector &&x)\n-Move constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:96\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bd_\ba_\bt_\ba\n-K * data() noexcept\n-return pointer to underlying array\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:162\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-DynamicVector & operator=(DynamicVector &&other)\n-Move assignment operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:126\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-DynamicVector & operator=(const DynamicVector &other)\n-Copy assignment operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:119\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by\n-size_type capacity() const\n-Number of elements for which memory has been allocated.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:137\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br\n-const container_type & container() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:173\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(size_type n, const allocator_type &a=allocator_type())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:76\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(std::initializer_list< K > const &l)\n-Construct from a std::initializer_list.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(const DynamicVector< T, Allocator > &x)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:101\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-const K & operator[](size_type i) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:156\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be\n-void reserve(size_type n)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:145\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(size_type n, value_type c, const allocator_type &a=allocator_type\n-())\n-Constructor making vector with identical coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:81\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-DynamicVector(const DenseVector< X > &x, const allocator_type &a=allocator_type\n-())\n-Copy constructor from another DenseVector.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:107\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be\n-K value_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:40\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\bd_\be_\br_\bi_\bv_\be_\bd_\b__\bt_\by_\bp_\be\n-DynamicVector< K, Allocator > derived_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:38\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\be_\br_\b__\bt_\by_\bp_\be\n-std::vector< K, Allocator > container_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:39\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-container_type::size_type size_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-FieldTraits< K >::real_type real_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:48\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bK_\b,_\b _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b _\b>_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-FieldTraits< K >::field_type field_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ftraits.hh:26\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-T field_type\n-export the type representing the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ftraits.hh:28\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-T real_type\n-export the type representing the real type of the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ftraits.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bV_\be_\bc_\bT_\br_\ba_\bi_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matvectraits.hh:31\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be\n+bool anyTrue(ADLTag< 5 >, const AlignedNumber< bool, align > &mask)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:556\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be\n+T & lane(ADLTag< 5 >, std::size_t l, AlignedNumber< T, align > &v)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:533\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bA_\bD_\bL_\bT_\ba_\bg\n+Tag used to force late-binding lookup in Dune::Simd::Overloads.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.hh:182\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be\n+should have a member type type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:60\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\b:_\b:_\bt_\by_\bp_\be\n+V type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:60\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be\n+should have a member type type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be_\b:_\b:_\bt_\by_\bp_\be\n+S type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt\n+should be derived from a Dune::index_constant\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:74\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00014.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00014.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: indent.hh File Reference \n+dune-common: simd.hh File Reference \n \n \n \n \n \n \n \n@@ -72,47 +72,94 @@\n dune common \n
\n \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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-\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. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n+\n+\n+\n \n-\n \n-
\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n \n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-A few common exception classes.
Implements the dense vector interface, with an exchangeable storage class.
Macro for wrapping boundary checks.
Implements a generic iterator class for writing stl conformant iterators.
Stream & operator>>(Stream &stream, std::tuple< Ts... > &t)
Read a std::tuple.
Definition streamoperators.hh:43
#define DUNE_ASSERT_BOUNDS(cond)
If DUNE_CHECK_BOUNDS is defined: check if condition cond holds; otherwise, do nothing.
Definition boundschecking.hh:30
STL namespace.
Basic definitions for SIMD Implementations.
Default implementations for SIMD Implementations.
std::integral_constant< std::size_t, i > index_constant
An index constant with value i.
Definition indices.hh:29
Mask< V > mask(ADLTag< 0, std::is_same< V, Mask< V > >::value >, const V &v)
implements Simd::mask()
Definition defaults.hh:153
bool allFalse(ADLTag< 0 >, const Mask &mask)
implements Simd::allFalse()
Definition defaults.hh:124
bool allTrue(ADLTag< 0 >, const Mask &mask)
implements Simd::allTrue()
Definition defaults.hh:104
bool anyFalse(ADLTag< 0 >, const Mask &mask)
implements Simd::anyFalse()
Definition defaults.hh:114
Interface for a class of dense vectors over a given field.
Definition densevector.hh:229
Traits::value_type value_type
export the type representing the field
Definition densevector.hh:250
Traits::size_type size_type
The type used for the index access and size operation.
Definition densevector.hh:259
void resize(size_type n, value_type c=value_type())
Definition dynvector.hh:141
DynamicVector(const DynamicVector &x)
Constructor making vector with identical coordinates.
Definition dynvector.hh:91
std::vector< K, Allocator > container_type
Definition dynvector.hh:67
const K * data() const noexcept
return pointer to underlying array
Definition dynvector.hh:168
DynamicVector(const allocator_type &a=allocator_type())
Constructor making uninitialized vector.
Definition dynvector.hh:72
DynamicVector(DynamicVector &&x)
Move constructor.
Definition dynvector.hh:96
K * data() noexcept
return pointer to underlying array
Definition dynvector.hh:162
DynamicVector & operator=(DynamicVector &&other)
Move assignment operator.
Definition dynvector.hh:126
DynamicVector & operator=(const DynamicVector &other)
Copy assignment operator.
Definition dynvector.hh:119
size_type capacity() const
Number of elements for which memory has been allocated.
Definition dynvector.hh:137
DynamicVector(size_type n, const allocator_type &a=allocator_type())
Definition dynvector.hh:76
DynamicVector(std::initializer_list< K > const &l)
Construct from a std::initializer_list.
Definition dynvector.hh:86
DynamicVector(const DynamicVector< T, Allocator > &x)
Definition dynvector.hh:101
DynamicVector(size_type n, value_type c, const allocator_type &a=allocator_type())
Constructor making vector with identical coordinates.
Definition dynvector.hh:81
DynamicVector(const DenseVector< X > &x, const allocator_type &a=allocator_type())
Copy constructor from another DenseVector.
Definition dynvector.hh:107
K value_type
Definition dynvector.hh:40
DynamicVector< K, Allocator > derived_type
Definition dynvector.hh:38
std::vector< K, Allocator > container_type
Definition dynvector.hh:39
container_type::size_type size_type
Definition dynvector.hh:41
FieldTraits< K >::real_type real_type
Definition dynvector.hh:48
FieldTraits< K >::field_type field_type
Definition dynvector.hh:47
Definition ftraits.hh:26
T field_type
export the type representing the field
Definition ftraits.hh:28
T real_type
export the type representing the real type of the field
Definition ftraits.hh:30
Definition matvectraits.hh:31
bool anyTrue(ADLTag< 5 >, const AlignedNumber< bool, align > &mask)
Definition debugalign.hh:556
T & lane(ADLTag< 5 >, std::size_t l, AlignedNumber< T, align > &v)
Definition debugalign.hh:533
Tag used to force late-binding lookup in Dune::Simd::Overloads.
Definition base.hh:182
should be derived from a Dune::index_constant
Definition standard.hh:74
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,341 +1,124 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-dynvector.hh\n+ * _\bs_\bi_\bm_\bd\n+standard.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_DYNVECTOR_HH\n-6#define DUNE_DYNVECTOR_HH\n-7\n-8#include \n \n- \n+ \n
\n indent.hh File Reference
simd.hh File Reference
\n \n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n
\n+
\n
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,79 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-indent.hh File Reference\n-_\bC_\bo_\bm_\bm_\bo_\bn\n-Utility class for handling nested indentation in output. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+simd.hh File Reference\n+Abstractions for support of dedicated SIMD data types. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\ba_\bl_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bd_\be_\bb_\bu_\bg_\ba_\bl_\bi_\bg_\bn_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bv_\bc_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-\u00a0 Utility class for handling nested indentation in output. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bT_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bA_\bl_\bi_\bg_\bn_\be_\bd_\bN_\bu_\bm_\bb_\be_\br_\b<_\b _\bT_\b,_\b _\ba_\bl_\bi_\bg_\bn_\b _\b>_\b _\b>\n+\u00a0 deduce the underlying scalar data type of an AlignedNumber _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bV_\b,_\b _\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bV_\b,_\b _\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0 _\bD_\bu_\bn_\be namespace.\n \u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br = typename _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs< T >::type\n+\u00a0\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx = typename _\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs< V >::type\n+\u00a0 An simd vector of indices corresponding to a simd vector V.\n+\u00a0\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk = typename _\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs< V >::type\n+\u00a0 A simd vector of truth values corresponding to a simd vector V.\n+\u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-std::ostream &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b< (std::ostream &s, const _\bI_\bn_\bd_\be_\bn_\bt &indent)\n-\u00a0 write indentation to a stream\n+template\n+std::size_t\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bl_\ba_\bn_\be_\bs (const T &)\n+\u00a0 get the number of lanes of a simd vector (scalar version)\n+\u00a0\n+template\n+ T\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bl_\ba_\bn_\be (std::size_t l, const T &v)\n+\u00a0 access a lane of a simd vector (scalar version)\n+\u00a0\n+template\n+ T &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bl_\ba_\bn_\be (std::size_t l, T &v)\n+\u00a0 access a lane of a simd vector (scalar version)\n+\u00a0\n+template\n+ void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn (T &dst, const T &src, bool mask)\n+\u00a0 masked _\bS_\bi_\bm_\bd assignment (scalar version)\n+\u00a0\n+template\n+ void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bs_\bw_\ba_\bp (T &v1, T &v2, bool mask)\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Utility class for handling nested indentation in output.\n- Author\n- J\u00c3\u00b6 Fahlke\n+Abstractions for support of dedicated SIMD data types.\n+Libraries like Vc (_\bh_\bt_\bt_\bp_\bs_\b:_\b/_\b/_\bg_\bi_\bt_\bh_\bu_\bb_\b._\bc_\bo_\bm_\b/_\bV_\bc_\bD_\be_\bv_\be_\bl_\b/_\bV_\bc) add high-level data types for\n+SIMD (or vectorization) support in C++. Most of these operations mimic the\n+behavior of a numerical data type. Some boolean operations can not be\n+implemented in a compatible way to trivial data types.\n+This header contains additional abstractions to help writing code that works\n+with trivial numerical data types (like double) and Vc vectorization data\n+types.\n+See also the _\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\ba_\bl_\b._\bh_\bh and range_utils.hh headers.\n+ _\bD\bD_\be\be_\bp\bp_\br\br_\be\be_\bc\bc_\ba\ba_\bt\bt_\be\be_\bd\bd_\b:\b:\n+ Use the newer simd architecture from _\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh instead.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00014_source.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00014_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: indent.hh Source File \n+dune-common: simd.hh Source File \n \n \n \n \n \n \n \n@@ -74,107 +74,518 @@\n \n \n \n
\n \n \n \n \n \n \n+ Utility class for handling nested indentation in output. \n+
Abstractions for support of dedicated SIMD data types. \n More...
\n-#include <ostream>\n-
#include <string>\n+
#include <cassert>\n+
#include <cstddef>\n+
#include <type_traits>\n+
#include <utility>\n+
#include <dune/common/conditional.hh>\n+
#include <dune/common/debugalign.hh>\n+
#include <dune/common/rangeutilities.hh>\n+
#include <dune/common/typetraits.hh>\n+
#include <dune/common/vc.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::Indent |
| Utility class for handling nested indentation in output. More... | |
| struct | Dune::SimdScalarTypeTraits< T > |
| struct | Dune::SimdScalarTypeTraits< AlignedNumber< T, align > > |
| deduce the underlying scalar data type of an AlignedNumber More... | |
| struct | Dune::SimdIndexTypeTraits< V, typename > |
| struct | Dune::SimdMaskTypeTraits< V, typename > |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
\n+Typedefs | |
| template<typename T > | |
| using | Dune::SimdScalar = typename SimdScalarTypeTraits< T >::type |
| template<typename V > | |
| using | Dune::SimdIndex = typename SimdIndexTypeTraits< V >::type |
| An simd vector of indices corresponding to a simd vector V. | |
| template<typename V > | |
| using | Dune::SimdMask = typename SimdMaskTypeTraits< V >::type |
| A simd vector of truth values corresponding to a simd vector V. | |
\n Functions | |
| std::ostream & | Dune::operator<< (std::ostream &s, const Indent &indent) |
| write indentation to a stream | |
| template<class T > | |
| std::size_t | Dune::lanes (const T &) |
| get the number of lanes of a simd vector (scalar version) | |
| template<class T > | |
| T | Dune::lane (std::size_t l, const T &v) |
| access a lane of a simd vector (scalar version) | |
| template<class T > | |
| T & | Dune::lane (std::size_t l, T &v) |
| access a lane of a simd vector (scalar version) | |
| template<class T > | |
| void | Dune::assign (T &dst, const T &src, bool mask) |
| masked Simd assignment (scalar version) | |
| template<class T > | |
| void | Dune::swap (T &v1, T &v2, bool mask) |
Detailed Description
\n-Utility class for handling nested indentation in output.
\n-- Author
- J\u00f6 Fahlke
Abstractions for support of dedicated SIMD data types.
\n+Libraries like Vc (https://github.com/VcDevel/Vc) add high-level data types for SIMD (or vectorization) support in C++. Most of these operations mimic the behavior of a numerical data type. Some boolean operations can not be implemented in a compatible way to trivial data types.
\n+This header contains additional abstractions to help writing code that works with trivial numerical data types (like double) and Vc vectorization data types.
\n+See also the conditional.hh and range_utils.hh headers.
\n+- Deprecated:
- Use the newer simd architecture from dune/common/simd/simd.hh instead.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,79 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-indent.hh File Reference\n-_\bC_\bo_\bm_\bm_\bo_\bn\n-Utility class for handling nested indentation in output. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n indent.hh
simd.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,119 +1,549 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-indent.hh\n+simd.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_COMMON_INDENT_HH\n-6#define DUNE_COMMON_INDENT_HH\n-7\n-8#include \n-9#include \n-10\n-11namespace _\bD_\bu_\bn_\be {\n-22\n-_\b5_\b2 class _\bI_\bn_\bd_\be_\bn_\bt\n-53 {\n-54 const _\bI_\bn_\bd_\be_\bn_\bt* parent;\n-55 std::string basic_indent;\n-56 unsigned level;\n-57\n-58 public:\n-60\n-_\b6_\b3 inline _\bI_\bn_\bd_\be_\bn_\bt(const std::string& basic_indent_ = \" \", unsigned level_ = 0)\n-64 : parent(0), basic_indent(basic_indent_), level(level_)\n-65 { }\n-66\n-_\b6_\b8 inline _\bI_\bn_\bd_\be_\bn_\bt(unsigned level_)\n-69 : parent(0), basic_indent(\" \"), level(level_)\n-70 { }\n-71\n-73\n-_\b7_\b6 inline _\bI_\bn_\bd_\be_\bn_\bt(const _\bI_\bn_\bd_\be_\bn_\bt* parent_,\n-77 const std::string& basic_indent_ = \" \", unsigned level_ = 1)\n-78 : parent(parent_), basic_indent(basic_indent_), level(level_)\n-79 { }\n-80\n-_\b8_\b2 inline _\bI_\bn_\bd_\be_\bn_\bt(const _\bI_\bn_\bd_\be_\bn_\bt* parent_, unsigned level_)\n-83 : parent(parent_), basic_indent(\" \"), level(level_)\n-84 { }\n-85\n-_\b8_\b7 inline _\bI_\bn_\bd_\be_\bn_\bt _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+(const std::string& newindent) const {\n-88 return _\bI_\bn_\bd_\be_\bn_\bt(this, newindent);\n-89 }\n-_\b9_\b1 inline _\bI_\bn_\bd_\be_\bn_\bt _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+(unsigned morelevel) const {\n-92 return _\bI_\bn_\bd_\be_\bn_\bt(parent, basic_indent, level+morelevel);\n-93 }\n-_\b9_\b5 inline _\bI_\bn_\bd_\be_\bn_\bt& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+() { ++level; return *this; }\n-_\b9_\b7 inline _\bI_\bn_\bd_\be_\bn_\bt& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b-_\b-() { if ( level > 0 ) --level; return *this; }\n-98\n-100 friend inline std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<(std::ostream& s,\n-101 const _\bI_\bn_\bd_\be_\bn_\bt& indent);\n-102 };\n-103\n-_\b1_\b0_\b5 inline std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<(std::ostream& s, const _\bI_\bn_\bd_\be_\bn_\bt& indent) {\n-106 if(indent.parent)\n-107 s << *indent.parent;\n-108 for(unsigned i = 0; i < indent.level; ++i)\n-109 s << indent.basic_indent;\n-110 return s;\n-111 }\n-112\n-115} // namespace Dune\n-116\n-117#endif // DUNE_COMMON_INDENT_HH\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+\n-Indent operator+(const std::string &newindent) const\n-create new indentation object with this one as parent\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:87\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-Indent(unsigned level_)\n-setup without parent and basic_indentation of two spaces\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+\n-Indent operator+(unsigned morelevel) const\n-create a copy of this indentation object with raised level\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:91\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-Indent(const Indent *parent_, unsigned level_)\n-setup with parent\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:82\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+\n-Indent & operator++()\n-raise indentation level\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:95\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-Indent(const std::string &basic_indent_=\" \", unsigned level_=0)\n-setup without parent\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:63\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b-_\b-\n-Indent & operator--()\n-lower indentation level\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:97\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n-friend std::ostream & operator<<(std::ostream &s, const Indent &indent)\n-write indentation to a stream\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:105\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-Indent(const Indent *parent_, const std::string &basic_indent_=\" \", unsigned\n-level_=1)\n-setup with parent\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:76\n-_\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n-std::ostream & operator<<(std::ostream &s, const bigunsignedint< k > &x)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bigunsignedint.hh:278\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_HH\n+4#define DUNE_COMMON_SIMD_HH\n+5\n+6#warning dune/common/simd.hh is deprecated.\n+7#warning Use the new infrastructure from dune/common/simd/simd.h instead.\n+8\n+30#include \n+31#include \n+32#include \n+33#include \n+34\n+35#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\ba_\bl_\b._\bh_\bh>\n+36#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bd_\be_\bb_\bu_\bg_\ba_\bl_\bi_\bg_\bn_\b._\bh_\bh>\n+37#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+38#if HAVE_VC\n+39// include Vc part of new simd interface to provide compatibility for\n+40// functionality that has been switched over.\n+41#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bv_\bc_\b._\bh_\bh>\n+42#endif\n+43#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+44#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bv_\bc_\b._\bh_\bh>\n+45\n+46namespace _\bD_\bu_\bn_\be\n+47{\n+48\n+49#if HAVE_VC\n+50 namespace VcImpl {\n+52\n+61 template\n+62 class Proxy\n+63 {\n+64 static_assert(std::is_same >::value, \"Class Proxy \"\n+65 \"may only be instantiated with unqualified types\");\n+66 public:\n+67 using value_type = typename V::value_type;\n+68\n+69 private:\n+70 static_assert(std::is_arithmetic::value,\n+71 \"Only arithmetic types are supported\");\n+72 V &vec_;\n+73 std::size_t idx_;\n+74\n+75 public:\n+76 Proxy(std::size_t idx, V &vec)\n+77 : vec_(vec), idx_(idx)\n+78 { }\n+79\n+80 operator value_type() const { return vec_[idx_]; }\n+81\n+82 // postfix operators\n+83\n+84 template::value> >\n+86 value_type operator++(int) { return vec_[idx_]++; }\n+87 template::value> >\n+89 value_type operator--(int) { return vec_[idx_]--; }\n+90\n+91 // unary (prefix) operators\n+92 template::value> >\n+94 Proxy &operator++() { ++(vec_[idx_]); return *this; }\n+95 template::value> >\n+97 Proxy &operator--() { --(vec_[idx_]); return *this; }\n+98 decltype(auto) operator!() const { return !(vec_[idx_]); }\n+99 decltype(auto) operator+() const { return +(vec_[idx_]); }\n+100 decltype(auto) operator-() const { return -(vec_[idx_]); }\n+101 template::value> >\n+103 decltype(auto) operator~() const { return ~(vec_[idx_]); }\n+104\n+105 // binary operators\n+106#define DUNE_SIMD_VC_BINARY_OP(OP) \\\n+107 template \\\n+108 auto operator OP(T &&o) const \\\n+109 -> decltype(vec_[idx_] OP valueCast(std::forward(o))) \\\n+110 { \\\n+111 return vec_[idx_] OP valueCast(std::forward(o)); \\\n+112 } \\\n+113 static_assert(true, \"Require semicolon to unconfuse editors\")\n+114\n+115 DUNE_SIMD_VC_BINARY_OP(*);\n+116 DUNE_SIMD_VC_BINARY_OP(/);\n+117 DUNE_SIMD_VC_BINARY_OP(%);\n+118\n+119 DUNE_SIMD_VC_BINARY_OP(+);\n+120 DUNE_SIMD_VC_BINARY_OP(-);\n+121\n+122 DUNE_SIMD_VC_BINARY_OP(<<);\n+123 DUNE_SIMD_VC_BINARY_OP(>>);\n+124\n+125 DUNE_SIMD_VC_BINARY_OP(<);\n+126 DUNE_SIMD_VC_BINARY_OP(>);\n+127 DUNE_SIMD_VC_BINARY_OP(<=);\n+128 DUNE_SIMD_VC_BINARY_OP(>=);\n+129\n+130 DUNE_SIMD_VC_BINARY_OP(==);\n+131 DUNE_SIMD_VC_BINARY_OP(!=);\n+132\n+133 DUNE_SIMD_VC_BINARY_OP(&);\n+134 DUNE_SIMD_VC_BINARY_OP(^);\n+135 DUNE_SIMD_VC_BINARY_OP(|);\n+136\n+137 DUNE_SIMD_VC_BINARY_OP(&&);\n+138 DUNE_SIMD_VC_BINARY_OP(||);\n+139#undef DUNE_SIMD_VC_BINARY_OP\n+140\n+141#define DUNE_SIMD_VC_ASSIGNMENT(OP) \\\n+142 template \\\n+143 auto operator OP(T &&o) \\\n+144 -> std::enable_if_t(o)) \\\n+146 )>::value, Proxy&> \\\n+147 { \\\n+148 vec_[idx_] OP valueCast(std::forward(o)); \\\n+149 return *this; \\\n+150 } \\\n+151 static_assert(true, \"Require semicolon to unconfuse editors\")\n+152\n+153 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(=);\n+154 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(*=);\n+155 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(/=);\n+156 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(%=);\n+157 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(+=);\n+158 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(-=);\n+159 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(<<=);\n+160 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(>>=);\n+161 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(&=);\n+162 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(^=);\n+163 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT(|=);\n+164#undef DUNE_SIMD_VC_ASSIGNMENT\n+165\n+166 // swap on proxies swaps the proxied vector entries. As such, it\n+167 // applies to rvalues of proxies too, not just lvalues\n+168 template\n+169 friend void _\bs_\bw_\ba_\bp(Proxy, Proxy);\n+170\n+171 template\n+172 friend void _\bs_\bw_\ba_\bp(Proxy p1, T& s2)\n+173 {\n+174 // don't use swap() ourselves -- not supported by Vc 1.3.0 (but is\n+175 // supported by Vc 1.3.2)\n+176 T tmp = p1.vec_[p1.idx_];\n+177 p1.vec_[p1.idx_] = s2;\n+178 s2 = tmp;\n+179 }\n+180\n+181 template\n+182 friend void _\bs_\bw_\ba_\bp(T& s1, Proxy p2)\n+183 {\n+184 T tmp = s1;\n+185 s1 = p2.vec_[p2.idx_];\n+186 p2.vec_[p2.idx_] = tmp;\n+187 }\n+188 };\n+189\n+190 template\n+191 void _\bs_\bw_\ba_\bp(Proxy p1, Proxy p2)\n+192 {\n+193 typename V1::value_type tmp = p1.vec_[p1.idx_];\n+194 p1.vec_[p1.idx_] = p2.vec_[p2.idx_];\n+195 p2.vec_[p2.idx_] = tmp;\n+196 }\n+197 } // namespace VcImpl\n+198#endif // HAVE_VC\n+199\n+200 template\n+_\b2_\b0_\b1 struct _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs\n+202 {\n+_\b2_\b0_\b3 using _\bt_\by_\bp_\be = T;\n+204 };\n+205\n+206 template\n+_\b2_\b0_\b7 using _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br = typename _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be;\n+208\n+209#if HAVE_VC\n+210 /*\n+211 Add Vc specializations for the SimdScalarTypeTraits trais class\n+212 */\n+213 template\n+214 struct _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs< Vc::Vector >\n+215 {\n+216 using _\bt_\by_\bp_\be = T;\n+217 };\n+218\n+219 template\n+220 struct SimdScalarTypeTraits< Vc::SimdArray >\n+221 {\n+222 using _\bt_\by_\bp_\be = T;\n+223 };\n+224#endif // HAVE_VC\n+225\n+227 template\n+_\b2_\b2_\b8 struct _\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs< _\bA_\bl_\bi_\bg_\bn_\be_\bd_\bN_\bu_\bm_\bb_\be_\br >\n+229 {\n+_\b2_\b3_\b0 using _\bt_\by_\bp_\be = T;\n+231 };\n+232\n+233 template\n+_\b2_\b3_\b4 struct _\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs {\n+_\b2_\b3_\b5 using _\bt_\by_\bp_\be = std::size_t;\n+236 };\n+237\n+239\n+245 template\n+_\b2_\b4_\b6 using _\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx = typename _\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bV_\b>_\b:_\b:_\bt_\by_\bp_\be;\n+247\n+248#if HAVE_VC\n+249 template\n+250 struct _\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs > {\n+251 using _\bt_\by_\bp_\be = typename Vc::Vector::index_type;\n+252 };\n+253\n+254 template\n+255 struct SimdIndexTypeTraits > {\n+256 using _\bt_\by_\bp_\be = typename Vc::SimdArray::index_type;\n+257 };\n+258#endif // HAVE_VC\n+259\n+260 template\n+_\b2_\b6_\b1 struct _\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs {\n+_\b2_\b6_\b2 using _\bt_\by_\bp_\be = bool;\n+263 };\n+264\n+266\n+269 template\n+_\b2_\b7_\b0 using _\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk = typename _\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bV_\b>_\b:_\b:_\bt_\by_\bp_\be;\n+271\n+272#if HAVE_VC\n+273 template\n+274 struct _\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs > {\n+275 using _\bt_\by_\bp_\be = typename Vc::Vector::mask_type;\n+276 };\n+277\n+278 template\n+279 struct SimdMaskTypeTraits > {\n+280 using _\bt_\by_\bp_\be = typename Vc::SimdArray::mask_type;\n+281 };\n+282#endif // HAVE_VC\n+283\n+284#if HAVE_VC\n+285 /*\n+286 Add Vc specializations for cond(), see conditional.hh\n+287 */\n+288 template\n+289 Vc::Vector _\bc_\bo_\bn_\bd(const Vc::Mask & b,\n+290 const Vc::Vector & v1,\n+291 const Vc::Vector & v2)\n+292 {\n+293 return std::move(Vc::iif(b, v1, v2));\n+294 }\n+295\n+296 template\n+297 Vc::SimdArray _\bc_\bo_\bn_\bd(const typename Vc::SimdArray::\n+mask_type & b,\n+298 const Vc::SimdArray & v1,\n+299 const Vc::SimdArray & v2)\n+300 {\n+301 return std::move(Vc::iif(b, v1, v2));\n+302 }\n+303#endif // HAVE_VC\n+304\n+305#if HAVE_VC\n+306 /*\n+307 Add Vc specializations for several boolean operations, see\n+rangeutitlities.hh:\n+308\n+309 max_value, min_value, any_true, all_true\n+310 */\n+311 template\n+312 T _\bm_\ba_\bx_\b__\bv_\ba_\bl_\bu_\be(const Vc::Vector & v)\n+313 {\n+314 return v.max();\n+315 }\n+316\n+317 template\n+318 double _\bm_\ba_\bx_\b__\bv_\ba_\bl_\bu_\be(const Vc::SimdArray & v)\n+319 {\n+320 return v.max();\n+321 }\n+322\n+323 template\n+324 T _\bm_\bi_\bn_\b__\bv_\ba_\bl_\bu_\be(const Vc::Vector & v)\n+325 {\n+326 return v.min();\n+327 }\n+328\n+329 template\n+330 double _\bm_\bi_\bn_\b__\bv_\ba_\bl_\bu_\be(const Vc::SimdArray & v)\n+331 {\n+332 return v.min();\n+333 }\n+334\n+335 template\n+336 bool _\ba_\bn_\by_\b__\bt_\br_\bu_\be(const Vc::Mask & v)\n+337 {\n+338 return Vc::any_of(v);\n+339 }\n+340\n+341 template\n+342 bool _\ba_\bn_\by_\b__\bt_\br_\bu_\be(const Vc::SimdMaskArray & v)\n+343 {\n+344 return Vc::any_of(v);\n+345 }\n+346\n+347 template\n+348 bool _\ba_\bl_\bl_\b__\bt_\br_\bu_\be(const Vc::Mask & v)\n+349 {\n+350 return Vc::all_of(v);\n+351 }\n+352\n+353 template\n+354 bool _\ba_\bl_\bl_\b__\bt_\br_\bu_\be(const Vc::SimdMaskArray & v)\n+355 {\n+356 return Vc::all_of(v);\n+357 }\n+358#endif // HAVE_VC\n+359\n+361 template\n+_\b3_\b6_\b2 std::size_t _\bl_\ba_\bn_\be_\bs(const T &) { return 1; }\n+363\n+365 template\n+_\b3_\b6_\b6 T _\bl_\ba_\bn_\be(std::size_t l, const T &v)\n+367 {\n+368 assert(l == 0);\n+369 return v;\n+370 }\n+371\n+373 template\n+_\b3_\b7_\b4 T &_\bl_\ba_\bn_\be(std::size_t l, T &v)\n+375 {\n+376 assert(l == 0);\n+377 return v;\n+378 }\n+379\n+380#if HAVE_VC\n+381 template\n+382 std::size_t _\bl_\ba_\bn_\be_\bs(const Vc::Vector &)\n+383 {\n+384 return Vc::Vector::size();\n+385 }\n+386\n+387 template\n+388 T _\bl_\ba_\bn_\be(std::size_t l, const Vc::Vector &v)\n+389 {\n+390 assert(l < _\bl_\ba_\bn_\be_\bs(v));\n+391 return v[l];\n+392 }\n+393\n+394 template\n+395 auto _\bl_\ba_\bn_\be(std::size_t l, Vc::Vector &v)\n+396 {\n+397 assert(l < _\bl_\ba_\bn_\be_\bs(v));\n+398 return VcImpl::Proxy >{l, v};\n+399 }\n+400\n+401 template\n+402 std::size_t _\bl_\ba_\bn_\be_\bs(const Vc::SimdArray &)\n+403 {\n+404 return n;\n+405 }\n+406\n+407 template\n+408 T _\bl_\ba_\bn_\be(std::size_t l, const Vc::SimdArray &v)\n+409 {\n+410 assert(l < n);\n+411 return v[l];\n+412 }\n+413\n+414 template\n+415 auto _\bl_\ba_\bn_\be(std::size_t l, Vc::SimdArray &v)\n+416 {\n+417 assert(l < n);\n+418 return VcImpl::Proxy >{l, v};\n+419 }\n+420\n+421 template\n+422 std::size_t _\bl_\ba_\bn_\be_\bs(const Vc::SimdMaskArray &)\n+423 {\n+424 return n;\n+425 }\n+426\n+427 template\n+428 bool _\bl_\ba_\bn_\be(std::size_t l, const Vc::SimdMaskArray &v)\n+429 {\n+430 assert(l < n);\n+431 return v[l];\n+432 }\n+433\n+434 template\n+435 auto _\bl_\ba_\bn_\be(std::size_t l, Vc::SimdMaskArray &v)\n+436 {\n+437 assert(l < n);\n+438 return VcImpl::Proxy >{l, v};\n+439 }\n+440#endif // HAVE_VC\n+441\n+443\n+446 template\n+_\b4_\b4_\b7 void _\ba_\bs_\bs_\bi_\bg_\bn(T &dst, const T &src, bool mask)\n+448 {\n+449 if(mask) dst = src;\n+450 }\n+451\n+452#if HAVE_VC\n+453 /*\n+454 Add Vc specializations for masked assignment\n+455 */\n+456 template\n+457 void _\ba_\bs_\bs_\bi_\bg_\bn(Vc::Vector &dst, const Vc::Vector &src,\n+458 typename Vc::Vector::mask_type mask)\n+459 {\n+460 dst(mask) = src;\n+461 }\n+462\n+463 template\n+464 void _\ba_\bs_\bs_\bi_\bg_\bn(Vc::SimdArray &dst, const Vc::SimdArray &src,\n+465 typename Vc::SimdArray::mask_type mask)\n+466 {\n+467 dst(mask) = src;\n+468 }\n+469#endif // HAVE_VC\n+470\n+471 template\n+_\b4_\b7_\b2 void _\bs_\bw_\ba_\bp(T &v1, T &v2, bool mask)\n+473 {\n+474 using std::swap;\n+475 if(mask) _\bs_\bw_\ba_\bp(v1, v2);\n+476 }\n+477\n+478#if HAVE_VC\n+479 /*\n+480 Add Vc specializations for masked swap\n+481 */\n+482 template\n+483 void _\bs_\bw_\ba_\bp(Vc::Vector &v1, Vc::Vector &v2,\n+484 typename Vc::Vector::mask_type mask)\n+485 {\n+486 auto tmp = v1;\n+487 v1(mask) = v2;\n+488 v2(mask) = tmp;\n+489 }\n+490\n+491 template\n+492 void _\bs_\bw_\ba_\bp(Vc::SimdArray &v1, Vc::SimdArray &v2,\n+493 typename Vc::SimdArray::mask_type mask)\n+494 {\n+495 auto tmp = v1;\n+496 v1(mask) = v2;\n+497 v2(mask) = tmp;\n+498 }\n+499#endif // HAVE_VC\n+500\n+501} // end namespace Dune\n+502\n+503#endif // DUNE_COMMON_SIMD_HH\n+_\bv_\bc_\b._\bh_\bh\n+Compatibility header for including \n+_\bd_\be_\bb_\bu_\bg_\ba_\bl_\bi_\bg_\bn_\b._\bh_\bh\n+_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh\n+Utilities for reduction like operations on ranges.\n+_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\ba_\bl_\b._\bh_\bh\n+_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh\n+Traits for type conversions and type information.\n _\bD_\bu_\bn_\be\n Dune namespace.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn alignedallocator.hh:13\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bd_\be_\bn_\bt\n-Utility class for handling nested indentation in output.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indent.hh:53\n+_\bD_\bu_\bn_\be_\b:_\b:_\ba_\bn_\by_\b__\bt_\br_\bu_\be\n+bool any_true(const AlignedNumber< bool, align > &val)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:506\n+_\bD_\bu_\bn_\be_\b:_\b:_\ba_\bl_\bl_\b__\bt_\br_\bu_\be\n+bool all_true(const AlignedNumber< bool, align > &val)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:512\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx\n+typename SimdIndexTypeTraits< V >::type SimdIndex\n+An simd vector of indices corresponding to a simd vector V.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:246\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br\n+typename SimdScalarTypeTraits< T >::type SimdScalar\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:207\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk\n+typename SimdMaskTypeTraits< V >::type SimdMask\n+A simd vector of truth values corresponding to a simd vector V.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:270\n+_\bD_\bu_\bn_\be_\b:_\b:_\bl_\ba_\bn_\be\n+T lane(std::size_t l, const T &v)\n+access a lane of a simd vector (scalar version)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:366\n+_\bD_\bu_\bn_\be_\b:_\b:_\bs_\bw_\ba_\bp\n+void swap(T &v1, T &v2, bool mask)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:472\n+_\bD_\bu_\bn_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn\n+void assign(T &dst, const T &src, bool mask)\n+masked Simd assignment (scalar version)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:447\n+_\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bn_\bd\n+const T1 cond(bool b, const T1 &v1, const T2 &v2)\n+conditional evaluate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn conditional.hh:28\n+_\bD_\bu_\bn_\be_\b:_\b:_\bm_\ba_\bx_\b__\bv_\ba_\bl_\bu_\be\n+T max_value(const AlignedNumber< T, align > &val)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:494\n+_\bD_\bu_\bn_\be_\b:_\b:_\bm_\bi_\bn_\b__\bv_\ba_\bl_\bu_\be\n+T min_value(const AlignedNumber< T, align > &val)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:500\n+_\bD_\bu_\bn_\be_\b:_\b:_\bl_\ba_\bn_\be_\bs\n+std::size_t lanes(const T &)\n+get the number of lanes of a simd vector (scalar version)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:362\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bN_\bu_\bm_\bb_\be_\br_\bI_\bm_\bp_\bl_\b:_\b:_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bN_\bu_\bm_\bb_\be_\br\n+aligned wrappers for arithmetic types\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn debugalign.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:202\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\by_\bp_\be\n+T type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:203\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bA_\bl_\bi_\bg_\bn_\be_\bd_\bN_\bu_\bm_\bb_\be_\br_\b<_\b _\bT_\b,_\b _\ba_\bl_\bi_\bg_\bn_\b _\b>_\b _\b>_\b:_\b:_\bt_\by_\bp_\be\n+T type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:230\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:234\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bn_\bd_\be_\bx_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\by_\bp_\be\n+std::size_t type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:235\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:261\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bM_\ba_\bs_\bk_\bT_\by_\bp_\be_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\by_\bp_\be\n+bool type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd.hh:262\n+_\bv_\bc_\b._\bh_\bh\n+SIMD abstractions for Vc.\n+_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bV_\bC_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT\n+#define DUNE_SIMD_VC_ASSIGNMENT(OP)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd/vc.hh:224\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00017.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00017.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: integersequence.hh File Reference \n+dune-common: base.hh File Reference \n \n \n \n \n \n \n \n@@ -65,123 +65,53 @@\n
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+Go to the documentation of this file.\n+\n+\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-Indent operator+(const std::string &newindent) const
create new indentation object with this one as parent
Definition indent.hh:87
Indent(unsigned level_)
setup without parent and basic_indentation of two spaces
Definition indent.hh:68
Indent operator+(unsigned morelevel) const
create a copy of this indentation object with raised level
Definition indent.hh:91
Indent(const Indent *parent_, unsigned level_)
setup with parent
Definition indent.hh:82
Indent(const std::string &basic_indent_=" ", unsigned level_=0)
setup without parent
Definition indent.hh:63
friend std::ostream & operator<<(std::ostream &s, const Indent &indent)
write indentation to a stream
Definition indent.hh:105
Indent(const Indent *parent_, const std::string &basic_indent_=" ", unsigned level_=1)
setup with parent
Definition indent.hh:76
std::ostream & operator<<(std::ostream &s, const bigunsignedint< k > &x)
Definition bigunsignedint.hh:278
1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+Compatibility header for including <Vc/Vc>
Utilities for reduction like operations on ranges.
Traits for type conversions and type information.
typename SimdIndexTypeTraits< V >::type SimdIndex
An simd vector of indices corresponding to a simd vector V.
Definition simd.hh:246
typename SimdMaskTypeTraits< V >::type SimdMask
A simd vector of truth values corresponding to a simd vector V.
Definition simd.hh:270
T lane(std::size_t l, const T &v)
access a lane of a simd vector (scalar version)
Definition simd.hh:366
void assign(T &dst, const T &src, bool mask)
masked Simd assignment (scalar version)
Definition simd.hh:447
const T1 cond(bool b, const T1 &v1, const T2 &v2)
conditional evaluate
Definition conditional.hh:28
std::size_t lanes(const T &)
get the number of lanes of a simd vector (scalar version)
Definition simd.hh:362
aligned wrappers for arithmetic types
Definition debugalign.hh:128
Definition simd.hh:202
Definition simd.hh:234
Definition simd.hh:261
SIMD abstractions for Vc.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,119 +1,549 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-indent.hh\n+simd.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_COMMON_INDENT_HH\n-6#define DUNE_COMMON_INDENT_HH\n-7\n-8#include base.hh File Reference
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-\n+\n+\n+
\n
\n-
\n-
\n+#include <algorithm>\n-
#include <array>\n-
#include <cassert>\n-
#include <functional>\n-
#include <type_traits>\n-
#include <utility>\n-
#include <dune/common/indices.hh>\n-
Basic definitions for SIMD Implementations. \n+More...
\n+\nGo to the source code of this file.
\n\n+Classes | |
| struct | Dune::Simd::Overloads::ADLTag< i > |
| struct | Dune::Simd::Overloads::ADLTag< 0 > |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
\n-Functions | |
| template<std::size_t pos, class T , T... II, std::enable_if_t<(!(pos >=sizeof...(II))), int > = 0> | |
| constexpr auto | Dune::get (std::integer_sequence< T, II... >, std::integral_constant< std::size_t, pos >={}) |
Return the entry at position pos of the given sequence. | |
| template<class T , T... II> | |
| constexpr T | Dune::get (std::integer_sequence< T, II... >, std::size_t pos) |
Return the entry at position pos of the given sequence. | |
| template<class T , T I0, T... II> | |
| constexpr std::integral_constant< T, I0 > | Dune::front (std::integer_sequence< T, I0, II... >) |
| Return the first entry of the sequence. | |
| template<class T , T... II, std::enable_if_t<(sizeof...(II) > 0), int > = 0> | |
| constexpr auto | Dune::back (std::integer_sequence< T, II... > seq) |
| Return the last entry of the sequence. | |
| template<class T , T I0, T... II> | |
| constexpr std::integral_constant< T, I0 > | Dune::head (std::integer_sequence< T, I0, II... >) |
| For a sequence [head,tail...) return the single head element. | |
| template<class T , T I0, T... II> | |
| constexpr std::integer_sequence< T, II... > | Dune::tail (std::integer_sequence< T, I0, II... >) |
| For a sequence [head,tail...) return the tail sequence. | |
| template<auto I0, class T , T... II> | |
| constexpr std::integer_sequence< T, T(I0), II... > | Dune::push_front (std::integer_sequence< T, II... >, std::integral_constant< T, I0 >={}) |
Append an index I0 to the front of the sequence. | |
| template<auto IN, class T , T... II> | |
| constexpr std::integer_sequence< T, II..., T(IN)> | Dune::push_back (std::integer_sequence< T, II... >, std::integral_constant< T, IN >={}) |
Append an index IN to the back of the sequence. | |
| template<class T , T... II> | |
| constexpr std::integral_constant< std::size_t, sizeof...(II)> | Dune::size (std::integer_sequence< T, II... >) |
| Return the size of the sequence. | |
| template<class T , T... II> | |
| constexpr std::bool_constant<(sizeof...(II)==0)> | Dune::empty (std::integer_sequence< T, II... >) |
| Checks whether the sequence is empty. | |
| template<class T , T... II, class Compare > | |
| constexpr auto | Dune::sorted (std::integer_sequence< T, II... > seq, Compare comp) |
Sort a given sequence by the comparator comp. | |
| template<class T , T... II> | |
| constexpr auto | Dune::sorted (std::integer_sequence< T, II... > seq) |
| Sort a given sequence by less-than comparison. | |
| template<class T , T... II, T value> | |
| constexpr std::bool_constant<((II==value)||...)> | Dune::contains (std::integer_sequence< T, II... >, std::integral_constant< T, value >) |
| Checks whether or not a given sequence contains a value. | |
| template<class T , T... II, T... JJ> | |
| constexpr auto | Dune::difference (std::integer_sequence< T, II... > iSeq, std::integer_sequence< T, JJ... > jSeq) |
| Return the elements from the sequence [II...) which are not found in the sequence [JJ...). | |
| template<std::size_t N, class T , T... JJ, std::enable_if_t<(N >=sizeof...(JJ)), int > = 0> | |
| constexpr auto | Dune::difference (std::integer_sequence< T, JJ... > jSeq) |
| Return the elements from the sequence [0,1,...N) which are not found in the sequence [JJ...). | |
| template<class S , S... II, class T , T... JJ, std::enable_if_t<(sizeof...(II)==sizeof...(JJ)), int > = 0, class ST = std::common_type_t<S,T>> | |
| constexpr std::is_same< std::integer_sequence< bool, true,(ST(II)==ST(JJ))... >, std::integer_sequence< bool,(ST(II)==ST(JJ))..., true > > | Dune::equal (std::integer_sequence< S, II... >, std::integer_sequence< T, JJ... >) |
| Checks whether two sequences are identical. | |
| template<class S , S... II, class T , T... JJ, std::enable_if_t<(sizeof...(II) !=sizeof...(JJ)), int > = 0> | |
| constexpr std::bool_constant< false > | Dune::equal (std::integer_sequence< S, II... >, std::integer_sequence< T, JJ... >) |
| Sequences are unequal if not of the same length. | |
| template<template< auto > class Filter, class T > | |
| constexpr auto | Dune::filter (std::integer_sequence< T > jSeq) |
| template<template< auto > class Filter, class T , T J0, T... JJ> | |
| constexpr auto | Dune::filter (std::integer_sequence< T, J0, JJ... > jSeq) |
| template<class Filter , class T > | |
| constexpr auto | Dune::filter (Filter, std::integer_sequence< T > jSeq) |
| template<class Filter , class T , T J0, T... JJ> | |
| constexpr auto | Dune::filter (Filter f, std::integer_sequence< T, J0, JJ... > jSeq) |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
| namespace | Dune::Simd::Overloads |
| Namespace for the overloads and specializations that make up a SIMD implementation. | |
Detailed Description
\n+Basic definitions for SIMD Implementations.
\n+This file provides basic definitions and template declarations that are used to write SIMD abstraction layers.
\n+This file should never be included by users of the SIMD abstraction. Include <dune/common/simd/simd.hh> instead.
\n+\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,152 +1,37 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-integersequence.hh File Reference\n-#include \n- \n+ \n
\n integersequence.hh
base.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,288 +1,67 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-integersequence.hh\n+ * _\bs_\bi_\bm_\bd\n+base.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_COMMON_INTEGERSEQUENCE_HH\n-6#define DUNE_COMMON_INTEGERSEQUENCE_HH\n-7\n-8#include \n-9#include \n-10#include \n-11#include \n-12#include \n-13#include \n-14\n-15#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh>\n-16\n-17namespace _\bD_\bu_\bn_\be {\n-18\n-20template = sizeof...(II))), int> = 0>\n-_\b2_\b2constexpr auto _\bg_\be_\bt (std::integer_sequence, std::\n-integral_constant = {})\n-23{\n-24 constexpr T entry = std::array{II...}[pos];\n-25 return std::integral_constant{};\n-26}\n-27\n-29template \n-_\b3_\b0constexpr T _\bg_\be_\bt (std::integer_sequence, std::size_t pos)\n-31{\n-32 assert(pos < sizeof...(II));\n-33 return std::array{II...}[pos];\n-34}\n-35\n-37template \n-38constexpr std::integral_constant\n-_\b3_\b9_\bf_\br_\bo_\bn_\bt (std::integer_sequence) { return {}; }\n-40\n-42template 0), int> = 0>\n-_\b4_\b4constexpr auto _\bb_\ba_\bc_\bk (std::integer_sequence seq)\n-45{\n-46 return _\bg_\be_\bt(seq);\n-47}\n-48\n-49\n-51template \n-52constexpr std::integral_constant\n-_\b5_\b3_\bh_\be_\ba_\bd (std::integer_sequence) { return {}; }\n-54\n-56template \n-57constexpr std::integer_sequence\n-_\b5_\b8_\bt_\ba_\bi_\bl (std::integer_sequence) { return {}; }\n-59\n-60\n-62template \n-63constexpr std::integer_sequence\n-_\b6_\b4_\bp_\bu_\bs_\bh_\b__\bf_\br_\bo_\bn_\bt (std::integer_sequence, std::integral_constant =\n-{}) { return {}; }\n-65\n-67template \n-68constexpr std::integer_sequence\n-_\b6_\b9_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk (std::integer_sequence, std::integral_constant = {})\n-{ return {}; }\n-70\n-71\n-73template \n-74constexpr std::integral_constant\n-_\b7_\b5_\bs_\bi_\bz_\be (std::integer_sequence) { return {}; }\n-76\n-78template \n-79constexpr std::bool_constant<(sizeof...(II) == 0)>\n-_\b8_\b0_\be_\bm_\bp_\bt_\by (std::integer_sequence) { return {}; }\n-81\n-82namespace Impl {\n-83\n-84// constexpr version of swap for older compilers\n-85template \n-86constexpr void swapImpl (T& a, T& b)\n-87{\n-88 T c = a; a = b; b = c;\n-89}\n-90\n-91// constexpr quick sort implementation\n-92template \n-93constexpr void sortImpl (std::array& array, Compare comp, std::size_t\n-left = 0, std::size_t right = N)\n-94{\n-95 // based on https://stackoverflow.com/a/40030044\n-96 if (left < right) {\n-97 std::size_t m = left;\n-98 for (std::size_t i = left + 1; i < right; ++i)\n-99 if (comp(array[i], array[left]))\n-100 swapImpl(array[++m], array[i]);\n-101 swapImpl(array[left], array[m]);\n-102 sortImpl(array, comp, left, m);\n-103 sortImpl(array, comp, m + 1, right);\n-104 }\n-105}\n-106\n-107// return the sorted array\n-108template \n-109constexpr std::array sortedImpl (std::array array, Compare comp)\n-110{\n-111 sortImpl(array, comp);\n-112 return array;\n-113}\n-114\n-115} // end namespace Impl\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_BASE_HH\n+4#define DUNE_COMMON_SIMD_BASE_HH\n+5\n+92namespace _\bD_\bu_\bn_\be {\n+93 namespace Simd {\n+94\n+97\n+112 namespace Overloads {\n+113\n 116\n-118template \n-_\b1_\b1_\b9constexpr auto _\bs_\bo_\br_\bt_\be_\bd (std::integer_sequence seq, Compare comp)\n-120{\n-121 constexpr auto _\bs_\bo_\br_\bt_\be_\bd = Impl::sortedImpl(std::array\n-{II...}, comp);\n-122 return _\bu_\bn_\bp_\ba_\bc_\bk_\bI_\bn_\bt_\be_\bg_\be_\br_\bS_\be_\bq_\bu_\be_\bn_\bc_\be([&](auto... i) {\n-123 return std::integer_sequence{};\n-124 }, std::make_index_sequence{});\n-125}\n-126\n-128template \n-_\b1_\b2_\b9constexpr auto _\bs_\bo_\br_\bt_\be_\bd (std::integer_sequence seq)\n-130{\n-131 return _\bs_\bo_\br_\bt_\be_\bd(seq, std::less{});\n-132}\n-133\n-135template \n-136constexpr std::bool_constant<((II == value) || ...)>\n-_\b1_\b3_\b7_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\bs (std::integer_sequence, std::integral_constant)\n-{ return {}; }\n-138\n-139\n-141template \n-_\b1_\b4_\b2constexpr auto _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be (std::integer_sequence iSeq, std::\n-integer_sequence jSeq)\n-143{\n-144 if constexpr(iSeq.size() == 0 || jSeq.size() == 0)\n-145 return iSeq;\n-146 else {\n-147 constexpr auto I0 = _\bh_\be_\ba_\bd(iSeq);\n-148 if constexpr(!_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\bs(jSeq,I0))\n-149 return push_front(_\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be(_\bt_\ba_\bi_\bl(iSeq),jSeq));\n-150 else\n-151 return _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be(_\bt_\ba_\bi_\bl(iSeq),jSeq);\n-152 }\n-153}\n-154\n-156template = sizeof...(JJ)), int> = 0>\n-_\b1_\b5_\b8constexpr auto _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be (std::integer_sequence jSeq)\n-159{\n-160 return _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be(std::make_integer_sequence{}, jSeq);\n-161}\n-162\n-163\n-165template = 0,\n-167 class ST = std::common_type_t>\n-168constexpr std::is_same,\n-169 std::integer_sequence>\n-_\b1_\b7_\b0_\be_\bq_\bu_\ba_\bl (std::integer_sequence, std::integer_sequence)\n-{ return {}; }\n-171\n-173template = 0>\n-175constexpr std::bool_constant\n-_\b1_\b7_\b6_\be_\bq_\bu_\ba_\bl (std::integer_sequence, std::integer_sequence)\n-{ return {}; }\n-177\n-178\n-179template class Filter, class T>\n-_\b1_\b8_\b0constexpr auto _\bf_\bi_\bl_\bt_\be_\br (std::integer_sequence jSeq) { return jSeq; }\n-181\n-184template class Filter, class T, T J0, T... JJ>\n-_\b1_\b8_\b5constexpr auto _\bf_\bi_\bl_\bt_\be_\br (std::integer_sequence jSeq)\n-186{\n-187 if constexpr(Filter::value)\n-188 return _\bp_\bu_\bs_\bh_\b__\bf_\br_\bo_\bn_\bt(filter(_\bt_\ba_\bi_\bl(jSeq)), _\bh_\be_\ba_\bd(jSeq));\n-189 else\n-190 return filter(_\bt_\ba_\bi_\bl(jSeq));\n-191}\n-192\n-193template \n-_\b1_\b9_\b4constexpr auto _\bf_\bi_\bl_\bt_\be_\br (Filter, std::integer_sequence jSeq) { return jSeq;\n-}\n-195\n-198template \n-_\b1_\b9_\b9constexpr auto _\bf_\bi_\bl_\bt_\be_\br (Filter f, std::integer_sequence jSeq)\n-200{\n-201 constexpr auto jHead = _\bh_\be_\ba_\bd(jSeq);\n-202 if constexpr(f(jHead))\n-203 return _\bp_\bu_\bs_\bh_\b__\bf_\br_\bo_\bn_\bt(_\bf_\bi_\bl_\bt_\be_\br(f, _\bt_\ba_\bi_\bl(jSeq)), jHead);\n-204 else\n-205 return _\bf_\bi_\bl_\bt_\be_\br(f, _\bt_\ba_\bi_\bl(jSeq));\n-206}\n+118\n+181 template\n+_\b1_\b8_\b2 struct _\bA_\bD_\bL_\bT_\ba_\bg;\n+183\n+184 template\n+_\b1_\b8_\b5 struct _\bA_\bD_\bL_\bT_\ba_\bg : _\bA_\bD_\bL_\bT_\ba_\bg {};\n+186\n+187 template<>\n+_\b1_\b8_\b8 struct _\bA_\bD_\bL_\bT_\ba_\bg<0> {};\n+189\n+191\n+195 template\n+196 struct _\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be;\n+197\n+199\n+203 template\n+204 struct _\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be;\n+205\n 207\n-208} // end namespace Dune\n-209\n-210#endif // DUNE_COMMON_INTEGERSEQUENCE_HH\n-_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh\n-_\bD_\bu_\bn_\be_\b:_\b:_\bu_\bn_\bp_\ba_\bc_\bk_\bI_\bn_\bt_\be_\bg_\be_\br_\bS_\be_\bq_\bu_\be_\bn_\bc_\be\n-decltype(auto) constexpr unpackIntegerSequence(F &&f, std::integer_sequence< I,\n-i... > sequence)\n-Unpack an std::integer_sequence to std::integral_constant...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indices.hh:124\n+211 template\n+212 struct _\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt;\n+213\n+215\n+216 } // namespace Overloads\n+217 } // namespace Simd\n+218} // namespace Dune\n+219\n+220#endif // DUNE_COMMON_SIMD_BASE_HH\n _\bD_\bu_\bn_\be\n Dune namespace.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn alignedallocator.hh:13\n-_\bD_\bu_\bn_\be_\b:_\b:_\bs_\bo_\br_\bt_\be_\bd\n-constexpr auto sorted(std::integer_sequence< T, II... > seq, Compare comp)\n-Sort a given sequence by the comparator comp.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:119\n-_\bD_\bu_\bn_\be_\b:_\b:_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk\n-constexpr std::integer_sequence< T, II..., T(IN)> push_back(std::\n-integer_sequence< T, II... >, std::integral_constant< T, IN >={})\n-Append an index IN to the back of the sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bs_\bi_\bz_\be\n-constexpr std::integral_constant< std::size_t, sizeof...(II)> size(std::\n-integer_sequence< T, II... >)\n-Return the size of the sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bp_\bu_\bs_\bh_\b__\bf_\br_\bo_\bn_\bt\n-constexpr std::integer_sequence< T, T(I0), II... > push_front(std::\n-integer_sequence< T, II... >, std::integral_constant< T, I0 >={})\n-Append an index I0 to the front of the sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:64\n-_\bD_\bu_\bn_\be_\b:_\b:_\be_\bm_\bp_\bt_\by\n-constexpr std::bool_constant<(sizeof...(II)==0)> empty(std::integer_sequence<\n-T, II... >)\n-Checks whether the sequence is empty.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:80\n-_\bD_\bu_\bn_\be_\b:_\b:_\bf_\br_\bo_\bn_\bt\n-constexpr std::integral_constant< T, I0 > front(std::integer_sequence< T, I0,\n-II... >)\n-Return the first entry of the sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:39\n-_\bD_\bu_\bn_\be_\b:_\b:_\bt_\ba_\bi_\bl\n-constexpr std::integer_sequence< T, II... > tail(std::integer_sequence< T, I0,\n-II... >)\n-For a sequence [head,tail...) return the tail sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:58\n-_\bD_\bu_\bn_\be_\b:_\b:_\bf_\bi_\bl_\bt_\be_\br\n-constexpr auto filter(std::integer_sequence< T > jSeq)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:180\n-_\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bn_\bt_\ba_\bi_\bn_\bs\n-constexpr std::bool_constant<((II==value)||...)> contains(std::\n-integer_sequence< T, II... >, std::integral_constant< T, value >)\n-Checks whether or not a given sequence contains a value.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:137\n-_\bD_\bu_\bn_\be_\b:_\b:_\be_\bq_\bu_\ba_\bl\n-constexpr std::is_same< std::integer_sequence< bool, true,(ST(II)==ST(JJ))...\n->, std::integer_sequence< bool,(ST(II)==ST(JJ))..., true > > equal(std::\n-integer_sequence< S, II... >, std::integer_sequence< T, JJ... >)\n-Checks whether two sequences are identical.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:170\n-_\bD_\bu_\bn_\be_\b:_\b:_\bb_\ba_\bc_\bk\n-constexpr auto back(std::integer_sequence< T, II... > seq)\n-Return the last entry of the sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:44\n-_\bD_\bu_\bn_\be_\b:_\b:_\bh_\be_\ba_\bd\n-constexpr std::integral_constant< T, I0 > head(std::integer_sequence< T, I0,\n-II... >)\n-For a sequence [head,tail...) return the single head element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:53\n-_\bD_\bu_\bn_\be_\b:_\b:_\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be\n-constexpr auto difference(std::integer_sequence< T, II... > iSeq, std::\n-integer_sequence< T, JJ... > jSeq)\n-Return the elements from the sequence [II...) which are not found in the\n-sequence [JJ....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:142\n-_\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bt\n-constexpr auto get(std::integer_sequence< T, II... >, std::integral_constant<\n-std::size_t, pos >={})\n-Return the entry at position pos of the given sequence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn integersequence.hh:22\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bA_\bD_\bL_\bT_\ba_\bg\n+Tag used to force late-binding lookup in Dune::Simd::Overloads.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.hh:182\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be\n+should have a member type type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:60\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be\n+should have a member type type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt\n+should be derived from a Dune::index_constant\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn standard.hh:74\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00020.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00020.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: dynmatrixev.hh File Reference \n+dune-common: io.hh File Reference \n \n \n \n \n \n \n \n@@ -65,52 +65,76 @@\n
\n \n \n \n \n \n \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 93constexpr void sortImpl (std::array<T, N>& array, Compare comp, std::size_t left = 0, std::size_t right = 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. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n- 142constexpr auto difference (std::integer_sequence<T,II...> iSeq, std::integer_sequence<T,JJ...> jSeq)
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-decltype(auto) constexpr unpackIntegerSequence(F &&f, std::integer_sequence< I, i... > sequence)
Unpack an std::integer_sequence<I,i...> to std::integral_constant<I,i>...
Definition indices.hh:124
constexpr auto sorted(std::integer_sequence< T, II... > seq, Compare comp)
Sort a given sequence by the comparator comp.
Definition integersequence.hh:119
constexpr std::integer_sequence< T, II..., T(IN)> push_back(std::integer_sequence< T, II... >, std::integral_constant< T, IN >={})
Append an index IN to the back of the sequence.
Definition integersequence.hh:69
constexpr std::integral_constant< std::size_t, sizeof...(II)> size(std::integer_sequence< T, II... >)
Return the size of the sequence.
Definition integersequence.hh:75
constexpr std::integer_sequence< T, T(I0), II... > push_front(std::integer_sequence< T, II... >, std::integral_constant< T, I0 >={})
Append an index I0 to the front of the sequence.
Definition integersequence.hh:64
constexpr std::bool_constant<(sizeof...(II)==0)> empty(std::integer_sequence< T, II... >)
Checks whether the sequence is empty.
Definition integersequence.hh:80
constexpr std::integral_constant< T, I0 > front(std::integer_sequence< T, I0, II... >)
Return the first entry of the sequence.
Definition integersequence.hh:39
constexpr std::integer_sequence< T, II... > tail(std::integer_sequence< T, I0, II... >)
For a sequence [head,tail...) return the tail sequence.
Definition integersequence.hh:58
constexpr std::bool_constant<((II==value)||...)> contains(std::integer_sequence< T, II... >, std::integral_constant< T, value >)
Checks whether or not a given sequence contains a value.
Definition integersequence.hh:137
constexpr std::is_same< std::integer_sequence< bool, true,(ST(II)==ST(JJ))... >, std::integer_sequence< bool,(ST(II)==ST(JJ))..., true > > equal(std::integer_sequence< S, II... >, std::integer_sequence< T, JJ... >)
Checks whether two sequences are identical.
Definition integersequence.hh:170
constexpr auto back(std::integer_sequence< T, II... > seq)
Return the last entry of the sequence.
Definition integersequence.hh:44
constexpr std::integral_constant< T, I0 > head(std::integer_sequence< T, I0, II... >)
For a sequence [head,tail...) return the single head element.
Definition integersequence.hh:53
constexpr auto difference(std::integer_sequence< T, II... > iSeq, std::integer_sequence< T, JJ... > jSeq)
Return the elements from the sequence [II...) which are not found in the sequence [JJ....
Definition integersequence.hh:142
constexpr auto get(std::integer_sequence< T, II... >, std::integral_constant< std::size_t, pos >={})
Return the entry at position pos of the given sequence.
Definition integersequence.hh:22
Tag used to force late-binding lookup in Dune::Simd::Overloads.
Definition base.hh:182
should be derived from a Dune::index_constant
Definition standard.hh:74
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,288 +1,67 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-integersequence.hh\n+ * _\bs_\bi_\bm_\bd\n+base.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_COMMON_INTEGERSEQUENCE_HH\n-6#define DUNE_COMMON_INTEGERSEQUENCE_HH\n-7\n-8#include \n \n- \n+ \n
\n dynmatrixev.hh File Reference
io.hh File Reference
\n \n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n\n \n+
\n
\n
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,56 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-dynmatrixev.hh File Reference\n-utility functions to compute eigenvalues for dense matrices. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include \"_\bd_\by_\bn_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-#include \"_\bf_\bm_\ba_\bt_\br_\bi_\bx_\be_\bv_\b._\bh_\bh\"\n+ * _\bs_\bi_\bm_\bd\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+io.hh File Reference\n+_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bV_\be_\bc_\bt_\bo_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn \u00bb _\bL_\bi_\bb_\br_\ba_\br_\by_\b _\bD_\be_\bv_\be_\bl_\bo_\bp_\be_\br_\b'_\bs_\b _\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+IO interface of the SIMD abstraction. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br_\b<_\b _\bT_\b _\b>\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0 _\bD_\bu_\bn_\be namespace.\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd\n+\u00a0 Namespace for vectorization interface functions used by library\n+ developers.\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-static void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\b:_\b:_\be_\bi_\bg_\be_\bn_\bV_\ba_\bl_\bu_\be_\bs_\bN_\bo_\bn_\bS_\by_\bm (const _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx< K\n- > &matrix, _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br< C > &eigenValues, std::vector<\n- _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br< K > > *eigenVectors=nullptr)\n-\u00a0 calculates the eigenvalues of a symmetric field matrix\n+template() != 1>>\n+ _\bI_\bn_\bs_\be_\br_\bt_\be_\br< V >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bi_\bo (const V &v)\n+\u00a0\n+template() == 1>>\n+_\bS_\bi_\bm_\bd_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br< V >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bi_\bo (const V &v)\n+\u00a0\n+IO interface\n+Templates and functions in this group provide syntactic sugar for IO. They are\n+implemented using the functionality from SimdInterfaceBase, and are not\n+customizable by implementations.\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bv_\bi_\bo (const V &v)\n+\u00a0 construct a stream inserter\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bi_\bo (const V &v)\n+\u00a0 construct a stream inserter\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-utility functions to compute eigenvalues for dense matrices.\n+IO interface of the SIMD abstraction.\n+This file provides IO interface functions of the SIMD abstraction layer.\n+This file is intended for direct inclusion by header making use of the IO\n+interface.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00020_source.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00020_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: dynmatrixev.hh Source File \n+dune-common: io.hh Source File \n \n \n \n \n \n \n \n@@ -70,129 +70,125 @@\n \n
\n \n \n \n \n \n utility functions to compute eigenvalues for dense matrices. \n+
IO interface of the SIMD abstraction. \n More...
\n-#include <algorithm>\n-
#include <memory>\n-
#include <dune-common-config.hh>\n-
#include "dynmatrix.hh"\n-
#include "fmatrixev.hh"\n+
#include <ios>\n+
#include <type_traits>\n+
#include <dune/common/rangeutilities.hh>\n+
#include <dune/common/simd/simd.hh>\n+
#include <dune/common/typetraits.hh>\n
Go to the source code of this file.
\n\n+Classes | |
| class | Dune::SimdImpl::Inserter< T > |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
| namespace | Dune::DynamicMatrixHelp |
| namespace | Dune::SimdImpl |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
\n Functions | |
| template<typename K , class C > | |
| static void | Dune::DynamicMatrixHelp::eigenValuesNonSym (const DynamicMatrix< K > &matrix, DynamicVector< C > &eigenValues, std::vector< DynamicVector< K > > *eigenVectors=nullptr) |
| calculates the eigenvalues of a symmetric field matrix | |
| template<class V , class = std::enable_if_t<Simd::lanes<V>() != 1>> | |
| Inserter< V > | Dune::SimdImpl::io (const V &v) |
| template<class V , class = std::enable_if_t<Simd::lanes<V>() == 1>> | |
| Simd::Scalar< V > | Dune::SimdImpl::io (const V &v) |
IO interface | |
Templates and functions in this group provide syntactic sugar for IO. They are implemented using the functionality from SimdInterfaceBase, and are not customizable by implementations. \n+ | |
| template<class V > | |
| auto | Dune::Simd::vio (const V &v) |
| construct a stream inserter | |
| template<class V > | |
| auto | Dune::Simd::io (const V &v) |
| construct a stream inserter | |
Detailed Description
\n-utility functions to compute eigenvalues for dense matrices.
\n+IO interface of the SIMD abstraction.
\n+This file provides IO interface functions of the SIMD abstraction layer.
\n+This file is intended for direct inclusion by header making use of the IO interface.
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,56 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-dynmatrixev.hh File Reference\n-utility functions to compute eigenvalues for dense matrices. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n dynmatrixev.hh
io.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,142 +1,135 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-dynmatrixev.hh\n+ * _\bs_\bi_\bm_\bd\n+io.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_DYNMATRIXEIGENVALUES_HH\n-6#define DUNE_DYNMATRIXEIGENVALUES_HH\n-7\n-8#include \n-9#include \n-10\n-11#include // HAVE_LAPACK\n-12\n-13#include \"_\bd_\by_\bn_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-14#include \"_\bf_\bm_\ba_\bt_\br_\bi_\bx_\be_\bv_\b._\bh_\bh\"\n-15\n-24namespace _\bD_\bu_\bn_\be {\n-25\n-_\b2_\b6 namespace DynamicMatrixHelp {\n-27\n-28#if HAVE_LAPACK\n-29 using Dune::FMatrixHelp::eigenValuesNonsymLapackCall;\n-30#endif\n-31\n-40 template \n-_\b4_\b1 static void _\be_\bi_\bg_\be_\bn_\bV_\ba_\bl_\bu_\be_\bs_\bN_\bo_\bn_\bS_\by_\bm(const _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b>& matrix,\n-42 _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\bC_\b>& eigenValues,\n-43 std::vector<_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b<_\bK_\b>>* eigenVectors = nullptr\n-44 )\n-45 {\n-46\n-47#if HAVE_LAPACK\n-48 {\n-49 const long int N = matrix._\br_\bo_\bw_\bs();\n-50 const char jobvl = 'n';\n-51 const char jobvr = eigenVectors ? 'v' : 'n';\n-52\n-53\n-54 // matrix to put into dgeev\n-55 auto matrixVector = std::make_unique(N*N);\n-56\n-57 // copy matrix\n-58 int row = 0;\n-59 for(int i=0; i(N);\n-69 auto eigenI = std::make_unique(N);\n-70\n-71 const long int lwork = eigenVectors ? 4*N : 3*N;\n-72 auto work = std::make_unique(lwork);\n-73 auto vr = eigenVectors ? std::make_unique(N*N) : std::\n-unique_ptr{};\n-74\n-75 // return value information\n-76 long int info = 0;\n-77\n-78 // call LAPACK routine (see fmatrixev_ext.cc)\n-79 eigenValuesNonsymLapackCall(&jobvl, &jobvr, &N, matrixVector.get(), &N,\n-80 eigenR.get(), eigenI.get(), nullptr, &N, vr.get(), &N, work.get(),\n-81 &lwork, &info);\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_IO_HH\n+4#define DUNE_COMMON_SIMD_IO_HH\n+5\n+16#include \n+17#include \n+18\n+19#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+20#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>\n+21#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+22\n+23namespace _\bD_\bu_\bn_\be {\n+24\n+_\b2_\b5 namespace SimdImpl {\n+26\n+27 template\n+_\b2_\b8 class _\bI_\bn_\bs_\be_\br_\bt_\be_\br {\n+29 T value_;\n+30\n+31 public:\n+_\b3_\b2 _\bI_\bn_\bs_\be_\br_\bt_\be_\br(const T &value) : value_(value) {}\n+33\n+34 template::value> >\n+_\b3_\b7 friend Stream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<(Stream &out, const _\bI_\bn_\bs_\be_\br_\bt_\be_\br &ins)\n+38 {\n+39 const char *sep = \"<\";\n+40 for(auto l : _\br_\ba_\bn_\bg_\be(_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\bs(ins.value_)))\n+41 {\n+42 out << sep << _\ba_\bu_\bt_\bo_\bC_\bo_\bp_\by(_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be(l, ins.value_));\n+43 sep = \", \";\n+44 }\n+45 out << '>';\n+46 return out;\n+47 }\n+48 };\n+49\n+50 template() != 1> >\n+_\b5_\b1 _\bI_\bn_\bs_\be_\br_\bt_\be_\br_\b<_\bV_\b> _\bi_\bo(const V &v)\n+52 {\n+53 return { v };\n+54 }\n+55\n+56 template() == 1> >\n+_\b5_\b7 _\bS_\bi_\bm_\bd_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\b<_\bV_\b> _\bi_\bo(const V &v)\n+58 {\n+59 return _\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be(0, v);\n+60 }\n+61\n+62 }\n+63\n+64 namespace Simd {\n+65\n 82\n-83 if( info != 0 )\n-84 {\n-85 std::cerr << \"For matrix \" << matrix << \" eigenvalue calculation failed! \"\n-<< std::endl;\n-86 _\bD_\bU_\bN_\bE_\b__\bT_\bH_\bR_\bO_\bW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bt_\ba_\bt_\be_\bE_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn,\"eigenValues: Eigenvalue calculation\n-failed!\");\n-87 }\n-88\n-89 eigenValues._\br_\be_\bs_\bi_\bz_\be(N);\n-90 for (int i=0; i(eigenR[i], eigenI[i]);\n-92\n-93 if (eigenVectors) {\n-94 eigenVectors->_\br_\be_\bs_\bi_\bz_\be(N);\n-95 for (int i = 0; i < N; ++i) {\n-96 auto& v = (*eigenVectors)[i];\n-97 v.resize(N);\n-98 std::copy(vr.get() + N*i, vr.get() + N*(i+1), &v[0]);\n-99 }\n-100 }\n-101 }\n-102#else // #if HAVE_LAPACK\n-103 _\bD_\bU_\bN_\bE_\b__\bT_\bH_\bR_\bO_\bW(_\bN_\bo_\bt_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\be_\bd,\"LAPACK not found!\");\n-104#endif\n-105 }\n-106 }\n-107\n-108}\n-110#endif\n-_\bf_\bm_\ba_\bt_\br_\bi_\bx_\be_\bv_\b._\bh_\bh\n-Eigenvalue computations for the FieldMatrix class.\n-_\bd_\by_\bn_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-This file implements a dense matrix with dynamic numbers of rows and columns.\n-_\bD_\bU_\bN_\bE_\b__\bT_\bH_\bR_\bO_\bW\n-#define DUNE_THROW(E, m)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn exceptions.hh:218\n+89 template\n+_\b9_\b0 auto _\bv_\bi_\bo(const V &v)\n+91 {\n+92 return _\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br_\b<_\bV_\b>{ v };\n+93 }\n+94\n+96\n+105 template\n+_\b1_\b0_\b6 auto _\bi_\bo(const V &v)\n+107 {\n+108 return _\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bi_\bo(v);\n+109 }\n+110\n+112\n+114\n+115 } // namespace Simd\n+116} // namespace Dune\n+117\n+118#endif // DUNE_COMMON_SIMD_IO_HH\n+_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh\n+Utilities for reduction like operations on ranges.\n+_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh\n+Traits for type conversions and type information.\n+_\bD_\bu_\bn_\be_\b:_\b:_\br_\ba_\bn_\bg_\be\n+static StaticIntegralRange< T, to, from > range(std::integral_constant< T, from\n+>, std::integral_constant< T, to >) noexcept\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn rangeutilities.hh:312\n+_\bD_\bu_\bn_\be_\b:_\b:_\ba_\bu_\bt_\bo_\bC_\bo_\bp_\by\n+constexpr AutonomousValue< T > autoCopy(T &&v)\n+Autonomous copy of an expression's value for use in auto type deduction.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typetraits.hh:672\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bi_\bo\n+auto io(const V &v)\n+construct a stream inserter\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:106\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bv_\bi_\bo\n+auto vio(const V &v)\n+construct a stream inserter\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:90\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\bs\n+constexpr std::size_t lanes()\n+Number of lanes in a SIMD type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd/interface.hh:305\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be\n+decltype(auto) lane(std::size_t l, V &&v)\n+Extract an element of a SIMD type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd/interface.hh:324\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br\n+typename Overloads::ScalarType< std::decay_t< V > >::type Scalar\n+Element type of some SIMD type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simd/interface.hh:235\n _\bD_\bu_\bn_\be\n Dune namespace.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn alignedallocator.hh:13\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\b:_\b:_\be_\bi_\bg_\be_\bn_\bV_\ba_\bl_\bu_\be_\bs_\bN_\bo_\bn_\bS_\by_\bm\n-static void eigenValuesNonSym(const DynamicMatrix< K > &matrix, DynamicVector<\n-C > &eigenValues, std::vector< DynamicVector< K > > *eigenVectors=nullptr)\n-calculates the eigenvalues of a symmetric field matrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynmatrixev.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\bo_\bw_\bs\n-constexpr size_type rows() const\n-number of rows\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn densematrix.hh:709\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx\n-Construct a matrix with a dynamic size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynmatrix.hh:61\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br\n-Construct a vector with a dynamic size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:59\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n-void resize(size_type n, value_type c=value_type())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dynvector.hh:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bt_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\be_\bd\n-Default exception for dummy implementations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn exceptions.hh:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bt_\ba_\bt_\be_\bE_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn\n-Default exception if a function was called while the object is not in a valid\n-state for that function...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn exceptions.hh:281\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bi_\bo\n+Inserter< V > io(const V &v)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:28\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br\n+Inserter(const T &value)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:32\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\bI_\bm_\bp_\bl_\b:_\b:_\bI_\bn_\bs_\be_\br_\bt_\be_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n+friend Stream & operator<<(Stream &out, const Inserter &ins)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn io.hh:37\n+_\bs_\bi_\bm_\bd_\b._\bh_\bh\n+Include file for users of the SIMD abstraction layer.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00023.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00023.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: math.hh File Reference \n+dune-common: loop.hh File Reference \n \n \n \n \n \n \n \n@@ -65,199 +65,678 @@\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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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- 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+Eigenvalue computations for the FieldMatrix class.
This file implements a dense matrix with dynamic numbers of rows and columns.
Utilities for reduction like operations on ranges.
Traits for type conversions and type information.
static StaticIntegralRange< T, to, from > range(std::integral_constant< T, from >, std::integral_constant< T, to >) noexcept
Definition rangeutilities.hh:312
constexpr AutonomousValue< T > autoCopy(T &&v)
Autonomous copy of an expression's value for use in auto type deduction.
Definition typetraits.hh:672
constexpr std::size_t lanes()
Number of lanes in a SIMD type.
Definition simd/interface.hh:305
decltype(auto) lane(std::size_t l, V &&v)
Extract an element of a SIMD type.
Definition simd/interface.hh:324
typename Overloads::ScalarType< std::decay_t< V > >::type Scalar
Element type of some SIMD type.
Definition simd/interface.hh:235
static void eigenValuesNonSym(const DynamicMatrix< K > &matrix, DynamicVector< C > &eigenValues, std::vector< DynamicVector< K > > *eigenVectors=nullptr)
calculates the eigenvalues of a symmetric field matrix
Definition dynmatrixev.hh:41
void resize(size_type n, value_type c=value_type())
Definition dynvector.hh:141
Default exception if a function was called while the object is not in a valid state for that function...
Definition exceptions.hh:281
Definition io.hh:28
friend Stream & operator<<(Stream &out, const Inserter &ins)
Definition io.hh:37
Include file for users of the SIMD abstraction layer.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,142 +1,135 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-dynmatrixev.hh\n+ * _\bs_\bi_\bm_\bd\n+io.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_DYNMATRIXEIGENVALUES_HH\n-6#define DUNE_DYNMATRIXEIGENVALUES_HH\n-7\n-8#include \n \n- \n+ \n
\n math.hh File Reference
loop.hh File Reference
\n-\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n
\n
\n
\n-\n
\n \n \n \n \n Some useful basic math stuff. \n-More...
\n-#include <cmath>\n-
#include <complex>\n-
#include <limits>\n-
#include <type_traits>\n-
#include <dune/common/typeutilities.hh>\n+
#include <array>\n+
#include <cmath>\n+
#include <cstddef>\n+
#include <cstdlib>\n+
#include <cstdint>\n+
#include <ostream>\n+
#include <dune/common/math.hh>\n+
#include <dune/common/simd/simd.hh>\n+
#include <dune/common/typetraits.hh>\n
Go to the source code of this file.
\n\n Classes | |
| struct | Dune::StandardMathematicalConstants< T > |
| Standard implementation of MathematicalConstants. More... | |
| struct | Dune::MathematicalConstants< Field > |
| Provides commonly used mathematical constants. More... | |
| class | Dune::LoopSIMD< T, S, A > |
| struct | Dune::Factorial< m > |
| struct | Dune::Simd::Overloads::ScalarType< LoopSIMD< T, S, A > > |
| struct | Dune::Factorial< 0 > |
| end of recursion of factorial via specialization More... | |
| struct | Dune::Simd::Overloads::RebindType< U, LoopSIMD< T, S, A > > |
| struct | Dune::MathOverloads::ADLTag |
| Tag to make sure the functions in this namespace can be found by ADL. More... | |
| struct | Dune::Simd::Overloads::LaneCount< LoopSIMD< T, S, A > > |
| struct | Dune::MathImpl::isUnorderedImpl |
| struct | Dune::IsNumber< LoopSIMD< T, S, A > > |
\n Namespaces | |
| namespace | Dune |
| Dune namespace. | |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
| namespace | Dune::Simd::Overloads |
| Namespace for the overloads and specializations that make up a SIMD implementation. | |
| namespace | Dune::MathOverloads |
| namespace for customization of math functions with Dune-Semantics | |
| namespace | Dune::MathImpl |
\n Macros | |
| #define | DUNE_COMMON_MATH_ISFUNCTION(function, stdfunction) |
| #define | DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR(function) |
| #define | DUNE_PRAGMA_OMP_SIMD |
| #define | DUNE_SIMD_LOOP_PREFIX_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_UNARY_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_POSTFIX_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_ASSIGNMENT_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_BINARY_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_BITSHIFT_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_COMPARISON_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_BOOLEAN_OP(SYMBOL) |
| #define | DUNE_SIMD_LOOP_CMATH_UNARY_OP(expr) |
| #define | DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN(expr, returnType) |
| #define | DUNE_SIMD_LOOP_STD_UNARY_OP(expr) |
| #define | DUNE_SIMD_LOOP_STD_BINARY_OP(expr) |
\n Functions | |
| template<class Base , class Exponent > | |
| constexpr Base | Dune::power (Base m, Exponent p) |
| Power method for integer exponents. | |
| template<class T > | |
| static constexpr T | Dune::factorial (const T &n) noexcept |
| calculate the factorial of n as a constexpr | |
| template<class T , T n> | |
| static constexpr auto | Dune::factorial (std::integral_constant< T, n >) noexcept |
| calculate the factorial of n as a constexpr | |
| template<class T > | |
| static constexpr T | Dune::binomial (const T &n, const T &k) noexcept |
| calculate the binomial coefficient n over k as a constexpr | |
| template<class T , T n, T k> | |
| static constexpr auto | Dune::binomial (std::integral_constant< T, n >, std::integral_constant< T, k >) noexcept |
| calculate the binomial coefficient n over k as a constexpr | |
| template<class T , T n> | |
| static constexpr auto | Dune::binomial (std::integral_constant< T, n >, std::integral_constant< T, n >) noexcept |
| template<class K > | |
| K | Dune::conjugateComplex (const K &x) |
| compute conjugate complex of x | |
| template<class T > | |
| int | Dune::sign (const T &val) |
| Return the sign of the value. | |
| Dune::MathOverloads::DUNE_COMMON_MATH_ISFUNCTION (isNaN, isnan) | |
| Dune::MathOverloads::DUNE_COMMON_MATH_ISFUNCTION (isInf, isinf) | |
| Dune::MathOverloads::DUNE_COMMON_MATH_ISFUNCTION (isFinite, isfinite) | |
| template<class T > | |
| auto | Dune::MathOverloads::isUnordered (const T &t1, const T &t2, PriorityTag< 1 >, ADLTag) -> decltype(isUnordered(t1, t2)) |
| template<class T > | |
| auto | Dune::MathOverloads::isUnordered (const T &t1, const T &t2, PriorityTag< 0 >, ADLTag) |
| Dune::MathImpl::DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR (isNaN) | |
| Dune::MathImpl::DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR (isInf) | |
| Dune::MathImpl::DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR (isFinite) | |
| template<class T , class = std::enable_if_t<Impl::isComplexLike<T>::value>> | |
| auto | Dune::MathOverloads::isNaN (const T &t, PriorityTag< 2 >, ADLTag) |
| template<class T , class = std::enable_if_t<Impl::isComplexLike<T>::value>> | |
| auto | Dune::MathOverloads::isInf (const T &t, PriorityTag< 2 >, ADLTag) |
| template<class T , class = std::enable_if_t<Impl::isComplexLike<T>::value>> | |
| auto | Dune::MathOverloads::isFinite (const T &t, PriorityTag< 2 >, ADLTag) |
| Dune::DUNE_SIMD_LOOP_BINARY_OP (+) | |
| Dune::DUNE_SIMD_LOOP_BINARY_OP (-) | |
| DUNE_SIMD_LOOP_BINARY_OP * | Dune::DUNE_SIMD_LOOP_BINARY_OP (/);DUNE_SIMD_LOOP_BINARY_OP(% |
| DUNE_SIMD_LOOP_BINARY_OP & | Dune::DUNE_SIMD_LOOP_BINARY_OP (|);DUNE_SIMD_LOOP_BINARY_OP(^ |
| Dune::DUNE_SIMD_LOOP_BITSHIFT_OP (<<) | |
| Dune::DUNE_SIMD_LOOP_BITSHIFT_OP (> >) | |
| Dune::DUNE_SIMD_LOOP_COMPARISON_OP (<) | |
| Dune::DUNE_SIMD_LOOP_COMPARISON_OP (<=) | |
| Dune::DUNE_SIMD_LOOP_COMPARISON_OP (>=) | |
| Dune::DUNE_SIMD_LOOP_COMPARISON_OP (!=) | |
| DUNE_SIMD_LOOP_BOOLEAN_OP && | Dune::DUNE_SIMD_LOOP_BOOLEAN_OP (||);template< class T, std::size_t S, std::size_t A > std::ostream &operator<<(std::ostream &os, const LoopSIMD< T, S, A > &v |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::Simd::Overloads::lane (ADLTag< 5 >, std::size_t l, LoopSIMD< T, S, A > &&v) -> decltype(std::move(Simd::lane(l%lanes< T >(), v[l/lanes< T >()]))) |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::Simd::Overloads::lane (ADLTag< 5 >, std::size_t l, const LoopSIMD< T, S, A > &v) -> decltype(Simd::lane(l%lanes< T >(), v[l/lanes< T >()])) |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::Simd::Overloads::lane (ADLTag< 5 >, std::size_t l, LoopSIMD< T, S, A > &v) -> decltype(Simd::lane(l%lanes< T >(), v[l/lanes< T >()])) |
| template<class T , std::size_t S, std::size_t AM, std::size_t AD> | |
| auto | Dune::Simd::Overloads::cond (ADLTag< 5 >, Simd::Mask< LoopSIMD< T, S, AM > > mask, LoopSIMD< T, S, AD > ifTrue, LoopSIMD< T, S, AD > ifFalse) |
| template<class M , class T , std::size_t S, std::size_t A> | |
| auto | Dune::Simd::Overloads::cond (ADLTag< 5, std::is_same< bool, Simd::Scalar< M > >::value &&Simd::lanes< M >()==Simd::lanes< LoopSIMD< T, S, A > >()>, M mask, LoopSIMD< T, S, A > ifTrue, LoopSIMD< T, S, A > ifFalse) |
| template<class M , std::size_t S, std::size_t A> | |
| bool | Dune::Simd::Overloads::anyTrue (ADLTag< 5 >, LoopSIMD< M, S, A > mask) |
| template<class M , std::size_t S, std::size_t A> | |
| bool | Dune::Simd::Overloads::allTrue (ADLTag< 5 >, LoopSIMD< M, S, A > mask) |
| template<class M , std::size_t S, std::size_t A> | |
| bool | Dune::Simd::Overloads::anyFalse (ADLTag< 5 >, LoopSIMD< M, S, A > mask) |
| template<class M , std::size_t S, std::size_t A> | |
| bool | Dune::Simd::Overloads::allFalse (ADLTag< 5 >, LoopSIMD< M, S, A > mask) |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (cos) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (sin) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (tan) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (acos) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (asin) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (atan) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (cosh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (sinh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (tanh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (acosh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (asinh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (atanh) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (exp) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (log) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (log10) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (exp2) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (expm1) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (ilogb, int) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (log1p) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (log2) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (logb) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (sqrt) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (cbrt) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (erf) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (erfc) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (tgamma) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (lgamma) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (ceil) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (floor) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (trunc) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (round) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (lround, long) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (llround, long long) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (rint) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (lrint, long) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (llrint, long long) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (nearbyint) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (fabs) | |
| Dune::DUNE_SIMD_LOOP_CMATH_UNARY_OP (abs) | |
| Dune::DUNE_SIMD_LOOP_STD_UNARY_OP (real) | |
| Dune::DUNE_SIMD_LOOP_STD_UNARY_OP (imag) | |
| Dune::DUNE_SIMD_LOOP_STD_BINARY_OP (max) | |
| Dune::DUNE_SIMD_LOOP_STD_BINARY_OP (min) | |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::MathOverloads::isNaN (const LoopSIMD< T, S, A > &v, PriorityTag< 3 >, ADLTag) |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::MathOverloads::isInf (const LoopSIMD< T, S, A > &v, PriorityTag< 3 >, ADLTag) |
| template<class T , std::size_t S, std::size_t A> | |
| auto | Dune::MathOverloads::isFinite (const LoopSIMD< T, S, A > &v, PriorityTag< 3 >, ADLTag) |
Detailed Description
\n-Some useful basic math stuff.
\n-Macro Definition Documentation
\n-\n-◆ DUNE_COMMON_MATH_ISFUNCTION
\n+Macro Definition Documentation
\n+\n+◆ DUNE_PRAGMA_OMP_SIMD
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_PRAGMA_OMP_SIMD | \n+
\n+\n+
\n+◆ DUNE_SIMD_LOOP_ASSIGNMENT_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_ASSIGNMENT_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ auto operator SYMBOL(const Simd::Scalar<T> s) { \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ (*this)[i] SYMBOL s; \\
\n+ } \\
\n+ return *this; \\
\n+ } \\
\n+ \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v) { \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ (*this)[i] SYMBOL v[i]; \\
\n+ } \\
\n+ return *this; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_BINARY_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_BINARY_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, const Simd::Scalar<T> s) { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL s; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const Simd::Scalar<T> s, const LoopSIMD<T,S,A> &v) { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = s SYMBOL v[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, \\
\n+ const LoopSIMD<T,S,A> &w) { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL w[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_BITSHIFT_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_BITSHIFT_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A, class U> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, const U s) { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL s; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A, class U, std::size_t AU> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, \\
\n+ const LoopSIMD<U,S,AU> &w) { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL w[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_BOOLEAN_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_BOOLEAN_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, const Simd::Scalar<T> s) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL s; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const Simd::Mask<T> s, const LoopSIMD<T,S,A> &v) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = s SYMBOL v[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, \\
\n+ const LoopSIMD<T,S,A> &w) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL w[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_CMATH_UNARY_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_CMATH_UNARY_OP | \n+( | \n+\n+ | expr | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A, typename Sfinae = \\
\n+ typename std::enable_if_t<!std::is_integral<Simd::Scalar<T>>::value> > \\
\n+ auto expr(const LoopSIMD<T,S,A> &v) { \\
\n+ using std::expr; \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ for(std::size_t i=0; i<S; i++) { \\
\n+ out[i] = expr(v[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN
\n \n\n
\n Generated by 1.9.8\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,154 +1,489 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n+ * _\bs_\bi_\bm_\bd\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-math.hh File Reference\n-Some useful basic math stuff. _\bM_\bo_\br_\be_\b._\b._\b.\n+loop.hh File Reference\n+#include \n #include \n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bm_\ba_\bt_\bh_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bn_\bd_\ba_\br_\bd_\bM_\ba_\bt_\bh_\be_\bm_\ba_\bt_\bi_\bc_\ba_\bl_\bC_\bo_\bn_\bs_\bt_\ba_\bn_\bt_\bs_\b<_\b _\bT_\b _\b>\n-\u00a0 Standard implementation of _\bM_\ba_\bt_\bh_\be_\bm_\ba_\bt_\bi_\bc_\ba_\bl_\bC_\bo_\bn_\bs_\bt_\ba_\bn_\bt_\bs. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD_\b<_\b _\bT_\b,_\b _\bS_\b,_\b _\bA_\b _\b>\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\be_\bm_\ba_\bt_\bi_\bc_\ba_\bl_\bC_\bo_\bn_\bs_\bt_\ba_\bn_\bt_\bs_\b<_\b _\bF_\bi_\be_\bl_\bd_\b _\b>\n-\u00a0 Provides commonly used mathematical constants. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bT_\by_\bp_\be_\b<_\b _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD_\b<_\b _\bT_\b,_\b _\bS_\b,_\b _\bA_\b _\b>_\b _\b>\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\ba_\bc_\bt_\bo_\br_\bi_\ba_\bl_\b<_\b _\bm_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bT_\by_\bp_\be_\b<_\b _\bU_\b,_\b _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD_\b<_\b _\bT_\b,_\b _\bS_\b,_\b _\bA_\b _\b>_\b _\b>\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\ba_\bc_\bt_\bo_\br_\bi_\ba_\bl_\b<_\b _\b0_\b _\b>\n-\u00a0 end of recursion of factorial via specialization _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bL_\ba_\bn_\be_\bC_\bo_\bu_\bn_\bt_\b<_\b _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD_\b<_\b _\bT_\b,_\b _\bS_\b,_\b _\bA_\b _\b>_\b _\b>\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bA_\bD_\bL_\bT_\ba_\bg\n-\u00a0 Tag to make sure the functions in this namespace can be found by ADL.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bI_\bm_\bp_\bl_\b:_\b:_\bi_\bs_\bU_\bn_\bo_\br_\bd_\be_\br_\be_\bd_\bI_\bm_\bp_\bl\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bN_\bu_\bm_\bb_\be_\br_\b<_\b _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD_\b<_\b _\bT_\b,_\b _\bS_\b,_\b _\bA_\b _\b>_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0 _\bD_\bu_\bn_\be namespace.\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd\n+\u00a0 Namespace for vectorization interface functions used by library\n+ developers.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs\n+\u00a0 Namespace for the overloads and specializations that make up a SIMD\n+ implementation.\n+\u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs\n \u00a0 namespace for customization of math functions with Dune-Semantics\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bI_\bm_\bp_\bl\n-\u00a0\n M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN(function, stdfunction)\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bP_\bR_\bA_\bG_\bM_\bA_\b__\bO_\bM_\bP_\b__\bS_\bI_\bM_\bD\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bP_\bR_\bE_\bF_\bI_\bX_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bP_\bO_\bS_\bT_\bF_\bI_\bX_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bA_\bS_\bS_\bI_\bG_\bN_\bM_\bE_\bN_\bT_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bT_\bS_\bH_\bI_\bF_\bT_\b__\bO_\bP(SYMBOL)\n \u00a0\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN_\b__\bF_\bU_\bN_\bC_\bT_\bO_\bR(function)\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bO_\bM_\bP_\bA_\bR_\bI_\bS_\bO_\bN_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bO_\bO_\bL_\bE_\bA_\bN_\b__\bO_\bP(SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP(expr)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN(expr, returnType)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP(expr)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP(expr)\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n- constexpr Base\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bp_\bo_\bw_\be_\br (Base m, Exponent p)\n-\u00a0 Power method for integer exponents.\n-\u00a0\n-template\n- static constexpr T\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bf_\ba_\bc_\bt_\bo_\br_\bi_\ba_\bl (const T &n) noexcept\n-\u00a0 calculate the factorial of n as a constexpr\n-\u00a0\n-template\n-static constexpr auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bf_\ba_\bc_\bt_\bo_\br_\bi_\ba_\bl (std::integral_constant< T, n >)\n- noexcept\n-\u00a0 calculate the factorial of n as a constexpr\n-\u00a0\n-template\n- static constexpr T\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bn_\bo_\bm_\bi_\ba_\bl (const T &n, const T &k) noexcept\n-\u00a0 calculate the binomial coefficient n over k as a\n- constexpr\n-\u00a0\n-template\n-static constexpr auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bn_\bo_\bm_\bi_\ba_\bl (std::integral_constant< T, n >, std::\n- integral_constant< T, k >) noexcept\n-\u00a0 calculate the binomial coefficient n over k as a\n- constexpr\n-\u00a0\n-template\n-static constexpr auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bn_\bo_\bm_\bi_\ba_\bl (std::integral_constant< T, n >, std::\n- integral_constant< T, n >) noexcept\n-\u00a0\n-template\n- K\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bn_\bj_\bu_\bg_\ba_\bt_\be_\bC_\bo_\bm_\bp_\bl_\be_\bx (const K &x)\n-\u00a0 compute conjugate complex of x\n-\u00a0\n-template\n- int\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bs_\bi_\bg_\bn (const T &val)\n-\u00a0 Return the sign of the value.\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN (_\bi_\bs_\bN_\ba_\bN,\n- isnan)\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN (_\bi_\bs_\bI_\bn_\bf,\n- isinf)\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN\n- (_\bi_\bs_\bF_\bi_\bn_\bi_\bt_\be, isfinite)\n-\u00a0\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bU_\bn_\bo_\br_\bd_\be_\br_\be_\bd (const T &t1, const T\n- &t2, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 1 >, _\bA_\bD_\bL_\bT_\ba_\bg) -> decltype(isUnordered\n- (t1, t2))\n-\u00a0\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bU_\bn_\bo_\br_\bd_\be_\br_\be_\bd (const T &t1, const T\n- &t2, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 0 >, _\bA_\bD_\bL_\bT_\ba_\bg)\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bI_\bm_\bp_\bl_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN_\b__\bF_\bU_\bN_\bC_\bT_\bO_\bR\n- (isNaN)\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bI_\bm_\bp_\bl_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN_\b__\bF_\bU_\bN_\bC_\bT_\bO_\bR\n- (isInf)\n-\u00a0\n- \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bI_\bm_\bp_\bl_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bM_\bA_\bT_\bH_\b__\bI_\bS_\bF_\bU_\bN_\bC_\bT_\bI_\bO_\bN_\b__\bF_\bU_\bN_\bC_\bT_\bO_\bR\n- (isFinite)\n-\u00a0\n-template::value>>\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bN_\ba_\bN (const T &t, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 2\n- >, _\bA_\bD_\bL_\bT_\ba_\bg)\n-\u00a0\n-template::value>>\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bI_\bn_\bf (const T &t, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 2\n- >, _\bA_\bD_\bL_\bT_\ba_\bg)\n-\u00a0\n-template::value>>\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bF_\bi_\bn_\bi_\bt_\be (const T &t, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg<\n- 2 >, _\bA_\bD_\bL_\bT_\ba_\bg)\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP (+)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP (-)\n+\u00a0\n+ DUNE_SIMD_LOOP_BINARY_OP *\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP (/\n+ );DUNE_SIMD_LOOP_BINARY_OP(%\n+\u00a0\n+ DUNE_SIMD_LOOP_BINARY_OP &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP\n+ (|);DUNE_SIMD_LOOP_BINARY_OP(^\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bT_\bS_\bH_\bI_\bF_\bT_\b__\bO_\bP (<<)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bI_\bT_\bS_\bH_\bI_\bF_\bT_\b__\bO_\bP (> >)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bO_\bM_\bP_\bA_\bR_\bI_\bS_\bO_\bN_\b__\bO_\bP (<)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bO_\bM_\bP_\bA_\bR_\bI_\bS_\bO_\bN_\b__\bO_\bP (<=)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bO_\bM_\bP_\bA_\bR_\bI_\bS_\bO_\bN_\b__\bO_\bP (>=)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bO_\bM_\bP_\bA_\bR_\bI_\bS_\bO_\bN_\b__\bO_\bP (!=)\n+\u00a0\n+DUNE_SIMD_LOOP_BOOLEAN_OP &&\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bB_\bO_\bO_\bL_\bE_\bA_\bN_\b__\bO_\bP (||);template<\n+ class T, std::size_t S, std::size_t A > std::\n+ ostream &operator<<(std::ostream &os, const\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > &v\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >, std::\n+ size_t l, _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > &&v) -> decltype\n+ (std::move(Simd::lane(l%_\bl_\ba_\bn_\be_\bs< T >(), v[l/_\bl_\ba_\bn_\be_\bs<\n+ T >()])))\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >, std::\n+ size_t l, const _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > &v) -\n+ > decltype(Simd::lane(l%_\bl_\ba_\bn_\be_\bs< T >(), v[l/_\bl_\ba_\bn_\be_\bs<\n+ T >()]))\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >, std::\n+ size_t l, _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > &v) -> decltype\n+ (Simd::lane(l%_\bl_\ba_\bn_\be_\bs< T >(), v[l/_\bl_\ba_\bn_\be_\bs< T >()]))\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bc_\bo_\bn_\bd (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >, _\bS_\bi_\bm_\bd_\b:_\b:\n+ _\bM_\ba_\bs_\bk< _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, AM > > _\bm_\ba_\bs_\bk, _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T,\n+ S, AD > ifTrue, _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, AD > ifFalse)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bc_\bo_\bn_\bd (_\bA_\bD_\bL_\bT_\ba_\bg< 5, std::\n+ is_same< bool, _\bS_\bi_\bm_\bd_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br< M > >::value\n+ &&_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\bs< M >()==_\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\bs< _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T,\n+ S, A > >()>, M _\bm_\ba_\bs_\bk, _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > ifTrue,\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S, A > ifFalse)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >,\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< M, S, A > _\bm_\ba_\bs_\bk)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >,\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< M, S, A > _\bm_\ba_\bs_\bk)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >,\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< M, S, A > _\bm_\ba_\bs_\bk)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 5 >,\n+ _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< M, S, A > _\bm_\ba_\bs_\bk)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (cos)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (sin)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (tan)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (acos)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (asin)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (atan)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (cosh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (sinh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (tanh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (acosh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (asinh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (atanh)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (exp)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (log)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (log10)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (exp2)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (expm1)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN\n+ (ilogb, int)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (log1p)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (log2)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (logb)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (sqrt)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (cbrt)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (erf)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (erfc)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (tgamma)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (lgamma)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (ceil)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (floor)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (trunc)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (round)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN\n+ (lround, long)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN\n+ (llround, long long)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (rint)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN\n+ (lrint, long)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP_\b__\bW_\bI_\bT_\bH_\b__\bR_\bE_\bT_\bU_\bR_\bN\n+ (llrint, long long)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (nearbyint)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (fabs)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bC_\bM_\bA_\bT_\bH_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (abs)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (real)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bU_\bN_\bA_\bR_\bY_\b__\bO_\bP (imag)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP (max)\n+\u00a0\n+ \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bL_\bO_\bO_\bP_\b__\bS_\bT_\bD_\b__\bB_\bI_\bN_\bA_\bR_\bY_\b__\bO_\bP (min)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bN_\ba_\bN (const _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S,\n+ A > &v, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 3 >, _\bA_\bD_\bL_\bT_\ba_\bg)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bI_\bn_\bf (const _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T, S,\n+ A > &v, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 3 >, _\bA_\bD_\bL_\bT_\ba_\bg)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\bh_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bs_\bF_\bi_\bn_\bi_\bt_\be (const _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD< T,\n+ S, A > &v, _\bP_\br_\bi_\bo_\br_\bi_\bt_\by_\bT_\ba_\bg< 3 >, _\bA_\bD_\bL_\bT_\ba_\bg)\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Some useful basic math stuff.\n *\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_C\bCO\bOM\bMM\bMO\bON\bN_\b_M\bMA\bAT\bTH\bH_\b_I\bIS\bSF\bFU\bUN\bNC\bCT\bTI\bIO\bON\bN *\b**\b**\b**\b**\b*\n-#define DUNE_COMMON_MATH_ISFUNCTION ( \u00a0 function,\n- \u00a0 stdfunction\u00a0\n- )\n-V\bVa\bal\blu\bue\be:\b:\n-template \\\n-auto function(const T &t, PriorityTag<1>, ADLTag) \\\n--> decltype(function(t)) { \\\n-return function(t); \\\n-} \\\n-template \\\n-auto function(const T &t, PriorityTag<0>, ADLTag) { \\\n-using std::stdfunction; \\\n-return stdfunction(t); \\\n-} \\\n-static_assert(true, \"Require semicolon to unconfuse editors\")\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_C\bCO\bOM\bMM\bMO\bON\bN_\b_M\bMA\bAT\bTH\bH_\b_I\bIS\bSF\bFU\bUN\bNC\bCT\bTI\bIO\bON\bN_\b_F\bFU\bUN\bNC\bCT\bTO\bOR\bR *\b**\b**\b**\b**\b*\n-#define DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR ( \u00a0 function )\n-V\bVa\bal\blu\bue\be:\b:\n-struct function##Impl { \\\n-template \\\n-constexpr auto operator()(const T &t) const { \\\n-return function(t, PriorityTag<10>{}, MathOverloads::ADLTag{}); \\\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_P\bPR\bRA\bAG\bGM\bMA\bA_\b_O\bOM\bMP\bP_\b_S\bSI\bIM\bMD\bD *\b**\b**\b**\b**\b*\n+#define DUNE_PRAGMA_OMP_SIMD\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_L\bLO\bOO\bOP\bP_\b_A\bAS\bSS\bSI\bIG\bGN\bNM\bME\bEN\bNT\bT_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_LOOP_ASSIGNMENT_OP ( \u00a0 SYMBOL )\n+V\bVa\bal\blu\bue\be:\b:\n+auto operator SYMBOL(const Simd::Scalar s) { \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i &v) { \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, const Simd::Scalar s) { \\\n+LoopSIMD out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const Simd::Scalar s, const LoopSIMD &v) { \\\n+LoopSIMD out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, \\\n+const LoopSIMD &w) { \\\n+LoopSIMD out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, const U s) { \\\n+LoopSIMD out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, \\\n+const LoopSIMD &w) { \\\n+LoopSIMD out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, const Simd::Scalar s) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const Simd::Mask s, const LoopSIMD &v) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, \\\n+const LoopSIMD &w) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i>::value> > \\\n+auto expr(const LoopSIMD &v) { \\\n+using std::expr; \\\n+LoopSIMD out; \\\n+for(std::size_t i=0; i>::value> > \\\n+auto expr(const LoopSIMD &v) { \\\n+using std::expr; \\\n+LoopSIMD out; \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, const U s) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const Simd::Scalar s, const LoopSIMD &v) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto operator SYMBOL(const LoopSIMD &v, \\\n+const LoopSIMD &w) { \\\n+Simd::Mask> out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i out = *this; \\\n+SYMBOL(*this); \\\n+return out; \\\n+} \\\n+static_assert(true, \"expecting ;\")\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_L\bLO\bOO\bOP\bP_\b_P\bPR\bRE\bEF\bFI\bIX\bX_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_LOOP_PREFIX_OP ( \u00a0 SYMBOL )\n+V\bVa\bal\blu\bue\be:\b:\n+auto operator SYMBOL() { \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i \\\n+auto expr(const LoopSIMD &v, const LoopSIMD &w) { \\\n+using std::expr; \\\n+LoopSIMD out; \\\n+for(std::size_t i=0; i \\\n+auto expr(const LoopSIMD &v) { \\\n+using std::expr; \\\n+LoopSIMD out; \\\n+for(std::size_t i=0; i \\\n+auto expr(const LoopSIMD,S,A> &v) { \\\n+using std::expr; \\\n+LoopSIMD out; \\\n+for(std::size_t i=0; i out; \\\n+DUNE_PRAGMA_OMP_SIMD \\\n+for(std::size_t i=0; i\n \n \n \n \n \n \n-dune-common: math.hh Source File \n+dune-common: loop.hh Source File \n \n \n \n \n \n \n \n@@ -70,377 +70,766 @@\n
\n \n \n
\n
| #define DUNE_COMMON_MATH_ISFUNCTION | \n+#define DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN | \n( | \n\n- | function, | \n+expr, | \n
| \n | \n | \n- | stdfunction | \n+returnType | \n|
| \n | ) | \n\n |
\n-Value:\n+\n+
\n+\n+ template<class T> \\
\n- auto function(const T &t, PriorityTag<1>, ADLTag) \\
\n- -> decltype(function(t)) { \\
\n- return function(t); \\
\n- } \\
\n- template<class T> \\
\n- auto function(const T &t, PriorityTag<0>, ADLTag) { \\
\n- using std::stdfunction; \\
\n- return stdfunction(t); \\
\n- } \\
\n- static_assert(true, "Require semicolon to unconfuse editors")
\n+Value: template<class T, std::size_t S, std::size_t A, typename Sfinae = \\
\n+ typename std::enable_if_t<!std::is_integral<Simd::Scalar<T>>::value> > \\
\n+ auto expr(const LoopSIMD<T,S,A> &v) { \\
\n+ using std::expr; \\
\n+ LoopSIMD<returnType,S> out; \\
\n+ for(std::size_t i=0; i<S; i++) { \\
\n+ out[i] = expr(v[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_COMPARISON_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_COMPARISON_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A, class U> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, const U s) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL s; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const Simd::Scalar<T> s, const LoopSIMD<T,S,A> &v) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = s SYMBOL v[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto operator SYMBOL(const LoopSIMD<T,S,A> &v, \\
\n+ const LoopSIMD<T,S,A> &w) { \\
\n+ Simd::Mask<LoopSIMD<T,S,A>> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = v[i] SYMBOL w[i]; \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_POSTFIX_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_POSTFIX_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ auto operator SYMBOL(int){ \\
\n+ LoopSIMD<T,S,A> out = *this; \\
\n+ SYMBOL(*this); \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_PREFIX_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_PREFIX_OP | \n+( | \n+\n+ | SYMBOL | ) | \n+\n+ |
\n+Value:\n+
\n+ auto operator SYMBOL() { \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ SYMBOL(*this)[i]; \\
\n+ } \\
\n+ return *this; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_STD_BINARY_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_STD_BINARY_OP | \n+( | \n+\n+ | expr | ) | \n+\n+ |
\n+Value:\n+
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto expr(const LoopSIMD<T,S,A> &v, const LoopSIMD<T,S,A> &w) { \\
\n+ using std::expr; \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ for(std::size_t i=0; i<S; i++) { \\
\n+ out[i] = expr(v[i],w[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n+◆ DUNE_SIMD_LOOP_STD_UNARY_OP
\n+\n+\n+
\n-\n-\n+ \n+
\n+
| #define DUNE_SIMD_LOOP_STD_UNARY_OP | \n+( | \n+\n+ | expr | ) | \n+\n+ |
\n+Value:\n
\n template<class T, std::size_t S, std::size_t A> \\
\n+ auto expr(const LoopSIMD<T,S,A> &v) { \\
\n+ using std::expr; \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ for(std::size_t i=0; i<S; i++) { \\
\n+ out[i] = expr(v[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ \\
\n+ template<class T, std::size_t S, std::size_t A> \\
\n+ auto expr(const LoopSIMD<std::complex<T>,S,A> &v) { \\
\n+ using std::expr; \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ for(std::size_t i=0; i<S; i++) { \\
\n+ out[i] = expr(v[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n ◆ DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR
\n+\n+◆ DUNE_SIMD_LOOP_UNARY_OP
\n \n\n
\n \n \n \n
\n
| #define DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR | \n+#define DUNE_SIMD_LOOP_UNARY_OP | \n( | \n\n- | function | ) | \n+SYMBOL | ) | \n\n |
\n-Value:\n \n
\n struct function##Impl { \\
\n- template<class T> \\
\n- constexpr auto operator()(const T &t) const { \\
\n- return function(t, PriorityTag<10>{}, MathOverloads::ADLTag{}); \\
\n- } \\
\n- }; \\
\n- static_assert(true, "Require semicolon to unconfuse editors")
\n+Value: auto operator SYMBOL() const { \\
\n+ LoopSIMD<T,S,A> out; \\
\n+ DUNE_PRAGMA_OMP_SIMD \\
\n+ for(std::size_t i=0; i<S; i++){ \\
\n+ out[i] = SYMBOL((*this)[i]); \\
\n+ } \\
\n+ return out; \\
\n+ } \\
\n+ static_assert(true, "expecting ;")
\n \n Generated by
1.9.8\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,154 +1,489 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n+ * _\bs_\bi_\bm_\bd\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-math.hh File Reference\n-Some useful basic math stuff. _\bM_\bo_\br_\be_\b._\b._\b.\n+loop.hh File Reference\n+#include \n- \n+ \n
\n math.hh
loop.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
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n-\n-\n-\n-\n-\n-\n-\n-\n+Go to the documentation of this file. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n \n-\n-\n+\n+\n+\n+
\n+\n+\n 71 assert(reinterpret_cast<uintptr_t>(this) % std::min(alignof(LoopSIMD<T,S,A>),alignof(std::max_align_t)) == 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- 83 assert(reinterpret_cast<uintptr_t>(this) % std::min(alignof(LoopSIMD<T,S,A>),alignof(std::max_align_t)) == 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-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-#define DUNE_COMMON_MATH_ISFUNCTION_FUNCTOR(function)
Definition math.hh:269
#define DUNE_COMMON_MATH_ISFUNCTION(function, stdfunction)
Definition math.hh:232
Utilities for type computations, constraining overloads, ...
\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+#define DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN(expr, returnType)
Definition loop.hh:459
Some useful basic math stuff.
Traits for type conversions and type information.
std::integral_constant< std::size_t, i > index_constant
An index constant with value i.
Definition indices.hh:29
static StaticIntegralRange< T, to, from > range(std::integral_constant< T, from >, std::integral_constant< T, to >) noexcept
Definition rangeutilities.hh:312
std::ostream & operator<<(std::ostream &s, const bigunsignedint< k > &x)
Definition bigunsignedint.hh:278
bool anyTrue(const Mask &mask)
Whether any entry is true
Definition simd/interface.hh:429
V cond(M &&mask, const V &ifTrue, const V &ifFalse)
Like the ?: operator.
Definition simd/interface.hh:386
bool allTrue(const Mask &mask)
Whether all entries are true
Definition simd/interface.hh:439
bool anyFalse(const Mask &mask)
Whether any entry is false
Definition simd/interface.hh:449
constexpr std::size_t lanes()
Number of lanes in a SIMD type.
Definition simd/interface.hh:305
decltype(auto) lane(std::size_t l, V &&v)
Extract an element of a SIMD type.
Definition simd/interface.hh:324
Rebind< bool, V > Mask
Mask type type of some SIMD type.
Definition simd/interface.hh:289
bool allFalse(const Mask &mask)
Whether all entries are false
Definition simd/interface.hh:459
typename Overloads::ScalarType< std::decay_t< V > >::type Scalar
Element type of some SIMD type.
Definition simd/interface.hh:235
Mask< V > mask(ADLTag< 0, std::is_same< V, Mask< V > >::value >, const V &v)
implements Simd::mask()
Definition defaults.hh:153
bool allFalse(ADLTag< 0 >, const Mask &mask)
implements Simd::allFalse()
Definition defaults.hh:124
bool allTrue(ADLTag< 0 >, const Mask &mask)
implements Simd::allTrue()
Definition defaults.hh:104
bool anyFalse(ADLTag< 0 >, const Mask &mask)
implements Simd::anyFalse()
Definition defaults.hh:114
STL namespace.
static constexpr T binomial(const T &n, const T &k) noexcept
calculate the binomial coefficient n over k as a constexpr
Definition math.hh:131
constexpr Base power(Base m, Exponent p)
Power method for integer exponents.
Definition math.hh:75
static constexpr T factorial(const T &n) noexcept
calculate the factorial of n as a constexpr
Definition math.hh:111
K conjugateComplex(const K &x)
compute conjugate complex of x
Definition math.hh:164
DUNE_SIMD_LOOP_COMPARISON_OP(<)
bool anyTrue(ADLTag< 5 >, const AlignedNumber< bool, align > &mask)
Definition debugalign.hh:556
const AlignedNumber< T, align > & cond(ADLTag< 5 >, AlignedNumber< bool, align > mask, const AlignedNumber< T, align > &ifTrue, const AlignedNumber< T, align > &ifFalse)
Definition debugalign.hh:548
T & lane(ADLTag< 5 >, std::size_t l, AlignedNumber< T, align > &v)
Definition debugalign.hh:533
bool isNaN(const FieldVector< K, SIZE > &b, PriorityTag< 2 >, ADLTag)
Returns whether any entry is NaN.
Definition fvector.hh:627
bool isInf(const FieldVector< K, SIZE > &b, PriorityTag< 2 >, ADLTag)
Returns whether any entry is infinite.
Definition fvector.hh:615
auto isFinite(const FieldVector< K, SIZE > &b, PriorityTag< 2 >, ADLTag)
Returns whether all entries are finite.
Definition fvector.hh:604
bool isUnordered(const FieldVector< K, 1 > &b, const FieldVector< K, 1 > &c, PriorityTag< 2 >, ADLTag)
Returns true if either b or c is NaN.
Definition fvector.hh:639
Standard implementation of MathematicalConstants.
Definition math.hh:34
static const T pi()
Archimedes' constant.
Definition math.hh:48
Definition math.hh:94
Whether this type acts as a scalar in the context of (hierarchically blocked) containers.
Definition typetraits.hh:194
Tag to make sure the functions in this namespace can be found by ADL.
Definition math.hh:230
Definition math.hh:283
constexpr auto operator()(const T &t1, const T &t2) const
Definition math.hh:285
Tag used to force late-binding lookup in Dune::Simd::Overloads.
Definition base.hh:182
should be derived from a Dune::index_constant
Definition standard.hh:74
Definition loop.hh:65
DUNE_SIMD_LOOP_PREFIX_OP(++)
DUNE_SIMD_LOOP_POSTFIX_OP(--)
DUNE_SIMD_LOOP_ASSIGNMENT_OP * DUNE_SIMD_LOOP_ASSIGNMENT_OP(/=);DUNE_SIMD_LOOP_ASSIGNMENT_OP(%=
DUNE_SIMD_LOOP_ASSIGNMENT_OP & DUNE_SIMD_LOOP_ASSIGNMENT_OP(|=);DUNE_SIMD_LOOP_ASSIGNMENT_OP(^=
DUNE_SIMD_LOOP_UNARY_OP(-)
DUNE_SIMD_LOOP_PREFIX_OP(--)
DUNE_SIMD_LOOP_POSTFIX_OP(++)
DUNE_SIMD_LOOP_ASSIGNMENT_OP(-=)
DUNE_SIMD_LOOP_UNARY_OP(~)
DUNE_SIMD_LOOP_ASSIGNMENT_OP(+=)
DUNE_SIMD_LOOP_UNARY_OP(+)
DUNE_SIMD_LOOP_ASSIGNMENT_OP(<<=)
DUNE_SIMD_LOOP_ASSIGNMENT_OP(> >=)
Simd::Scalar< T > type
Definition loop.hh:345
Include file for users of the SIMD abstraction layer.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,385 +1,824 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-math.hh\n+ * _\bs_\bi_\bm_\bd\n+loop.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_MATH_HH\n-6#define DUNE_MATH_HH\n-7\n-12#include \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+\n+\n+
\n+
\n+\n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,19 +1,126 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-parametertree.cc File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+ * _\bs_\bi_\bm_\bd\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+defaults.hh File Reference\n+_\bC_\bo_\bm_\bm_\bo_\bn \u00bb _\bV_\be_\bc_\bt_\bo_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn \u00bb _\bA_\bb_\bs_\bt_\br_\ba_\bc_\bt_\bi_\bo_\bn_\b _\bD_\be_\bv_\be_\bl_\bo_\bp_\be_\br_\b'_\bs_\b _\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+Default implementations for SIMD Implementations. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bt_\br_\be_\be_\b._\bh_\bh>\n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bb_\ba_\bs_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bl_\bi_\bs_\bt_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+_\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bD_\bu_\bn_\be\n+\u00a0 _\bD_\bu_\bn_\be namespace.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd\n+\u00a0 Namespace for vectorization interface functions used by library\n+ developers.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs\n+\u00a0 Namespace for the overloads and specializations that make up a SIMD\n+ implementation.\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+Overloadable and default functions\n+This group contains functions that you, as an abstraction developer, must\n+implement. All functions that are deleted must be provided, functions that have\n+a default implementation may be left unimplemented if the default behaviour is\n+satisfactory.\n+template\n+decltype(auto)\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bl_\ba_\bn_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, std::size_t l, V\n+ v)=delete\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bl_\ba_\bn_\be_\b(_\b)\n+\u00a0\n+template\n+ constexpr V\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bm_\bp_\bl_\bC_\ba_\bs_\bt (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, _\bM_\be_\bt_\ba_\bT_\by_\bp_\be< V >,\n+ const V &u)\n+\u00a0 implements Simd::implCast(V)\n+\u00a0\n+template\n+ constexpr V\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bi_\bm_\bp_\bl_\bC_\ba_\bs_\bt (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, _\bM_\be_\bt_\ba_\bT_\by_\bp_\be< V >,\n+ const U &u)\n+\u00a0 implements Simd::implCast(U)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bb_\br_\bo_\ba_\bd_\bc_\ba_\bs_\bt (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, _\bM_\be_\bt_\ba_\bT_\by_\bp_\be< V >, S\n+ s)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bb_\br_\bo_\ba_\bd_\bc_\ba_\bs_\bt_\b<_\bV_\b>_\b(_\b)\n+\u00a0\n+template\n+ V\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bc_\bo_\bn_\bd (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const _\bM_\ba_\bs_\bk< V >\n+ &_\bm_\ba_\bs_\bk, const V &ifTrue, const V &ifFalse)=delete\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bc_\bo_\bn_\bd_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bx (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V &v1, const V\n+ &v2)\n+\u00a0 implements binary _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\ba_\bx_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\bi_\bn (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V &v1, const V\n+ &v2)\n+\u00a0 implements binary _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\bi_\bn_\b(_\b)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const _\bM_\ba_\bs_\bk\n+ &_\bm_\ba_\bs_\bk)=delete\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bn_\by_\bT_\br_\bu_\be_\b(_\b)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const _\bM_\ba_\bs_\bk &_\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bl_\bl_\bT_\br_\bu_\be_\b(_\b)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const _\bM_\ba_\bs_\bk &_\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bn_\by_\bF_\ba_\bl_\bs_\be_\b(_\b)\n+\u00a0\n+template\n+ bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const _\bM_\ba_\bs_\bk &_\bm_\ba_\bs_\bk)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\ba_\bl_\bl_\bF_\ba_\bl_\bs_\be_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bx (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V &v)\n+\u00a0 implements Simd::maxValue()\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\bi_\bn (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V &v)\n+\u00a0 implements Simd::minValue()\n+\u00a0\n+template\n+ _\bM_\ba_\bs_\bk< V >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bs_\bk (_\bA_\bD_\bL_\bT_\ba_\bg< 0, std::is_same< V, _\bM_\ba_\bs_\bk<\n+ V > >::value >, const V &v)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\ba_\bs_\bk_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bs_\bk (_\bA_\bD_\bL_\bT_\ba_\bg< 0, !std::is_same< V, _\bM_\ba_\bs_\bk<\n+ V > >::value >, const V &v)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\ba_\bs_\bk_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bs_\bk_\bO_\br (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V1 &v1, const\n+ V2 &v2)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\ba_\bs_\bk_\bO_\br_\b(_\b)\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bO_\bv_\be_\br_\bl_\bo_\ba_\bd_\bs_\b:_\b:_\bm_\ba_\bs_\bk_\bA_\bn_\bd (_\bA_\bD_\bL_\bT_\ba_\bg< 0 >, const V1 &v1,\n+ const V2 &v2)\n+\u00a0 implements _\bS_\bi_\bm_\bd_\b:_\b:_\bm_\ba_\bs_\bk_\bA_\bn_\bd_\b(_\b)\n+\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+Default implementations for SIMD Implementations.\n+This file provides default overloads for SIMD implementation functions, and\n+deleted placeholders where there are no default implementations.\n+This file should never be included by users of the SIMD abstraction. Include\n+<_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh> instead.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00029.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00029.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: filledarray.hh File Reference \n+dune-common: vc.hh File Reference \n \n \n \n \n \n \n \n@@ -69,45 +69,25 @@\n \n \n
\n \n #include <cstdlib>\n-
#include <iostream>\n-
#include <ostream>\n-
#include <string>\n-
#include <sstream>\n-
#include <fstream>\n-
#include <set>\n-
#include <algorithm>\n-
#include <dune/common/exceptions.hh>\n-
#include <dune/common/parametertree.hh>\n+\n+
Default implementations for SIMD Implementations. \n+More...
\n+#include <algorithm>\n+
#include <cstddef>\n+
#include <type_traits>\n+
#include <dune/common/rangeutilities.hh>\n+
#include <dune/common/simd/base.hh>\n+
#include <dune/common/simd/interface.hh>\n+
#include <dune/common/typelist.hh>\n+
#include <dune/common/typetraits.hh>\n+
Go to the source code of this file.
\n+\n+Namespaces | |
| namespace | Dune |
| Dune namespace. | |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
| namespace | Dune::Simd::Overloads |
| Namespace for the overloads and specializations that make up a SIMD implementation. | |
\n+Functions | |
Overloadable and default functions | |
This group contains functions that you, as an abstraction developer, must implement. All functions that are deleted must be provided, functions that have a default implementation may be left unimplemented if the default behaviour is satisfactory. \n+ | |
| template<class V > | |
| decltype(auto) | Dune::Simd::Overloads::lane (ADLTag< 0 >, std::size_t l, V v)=delete |
| implements Simd::lane() | |
| template<class V > | |
| constexpr V | Dune::Simd::Overloads::implCast (ADLTag< 0 >, MetaType< V >, const V &u) |
| implements Simd::implCast<V>(V) | |
| template<class V , class U > | |
| constexpr V | Dune::Simd::Overloads::implCast (ADLTag< 0 >, MetaType< V >, const U &u) |
| implements Simd::implCast<V>(U) | |
| template<class V , class S > | |
| auto | Dune::Simd::Overloads::broadcast (ADLTag< 0 >, MetaType< V >, S s) |
| implements Simd::broadcast<V>() | |
| template<class V > | |
| V | Dune::Simd::Overloads::cond (ADLTag< 0 >, const Mask< V > &mask, const V &ifTrue, const V &ifFalse)=delete |
| implements Simd::cond() | |
| template<class V > | |
| auto | Dune::Simd::Overloads::max (ADLTag< 0 >, const V &v1, const V &v2) |
| implements binary Simd::max() | |
| template<class V > | |
| auto | Dune::Simd::Overloads::min (ADLTag< 0 >, const V &v1, const V &v2) |
| implements binary Simd::min() | |
| template<class Mask > | |
| bool | Dune::Simd::Overloads::anyTrue (ADLTag< 0 >, const Mask &mask)=delete |
| implements Simd::anyTrue() | |
| template<class Mask > | |
| bool | Dune::Simd::Overloads::allTrue (ADLTag< 0 >, const Mask &mask) |
| implements Simd::allTrue() | |
| template<class Mask > | |
| bool | Dune::Simd::Overloads::anyFalse (ADLTag< 0 >, const Mask &mask) |
| implements Simd::anyFalse() | |
| template<class Mask > | |
| bool | Dune::Simd::Overloads::allFalse (ADLTag< 0 >, const Mask &mask) |
| implements Simd::allFalse() | |
| template<class V > | |
| auto | Dune::Simd::Overloads::max (ADLTag< 0 >, const V &v) |
| implements Simd::maxValue() | |
| template<class V > | |
| auto | Dune::Simd::Overloads::min (ADLTag< 0 >, const V &v) |
| implements Simd::minValue() | |
| template<class V > | |
| Mask< V > | Dune::Simd::Overloads::mask (ADLTag< 0, std::is_same< V, Mask< V > >::value >, const V &v) |
| implements Simd::mask() | |
| template<class V > | |
| auto | Dune::Simd::Overloads::mask (ADLTag< 0, !std::is_same< V, Mask< V > >::value >, const V &v) |
| implements Simd::mask() | |
| template<class V1 , class V2 > | |
| auto | Dune::Simd::Overloads::maskOr (ADLTag< 0 >, const V1 &v1, const V2 &v2) |
| implements Simd::maskOr() | |
| template<class V1 , class V2 > | |
| auto | Dune::Simd::Overloads::maskAnd (ADLTag< 0 >, const V1 &v1, const V2 &v2) |
| implements Simd::maskAnd() | |
Detailed Description
\n+Default implementations for SIMD Implementations.
\n+This file provides default overloads for SIMD implementation functions, and deleted placeholders where there are no default implementations.
\n+This file should never be included by users of the SIMD abstraction. Include <dune/common/simd/simd.hh> instead.
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,19 +1,126 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-parametertree.cc File Reference\n-#include \n \n-\n-
\n-
\n \n \n
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,15 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-filledarray.hh File Reference\n-Utility to generate an array with a certain value. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh>\n+vc.hh File Reference\n+Compatibility header for including _\bM_\bo_\br_\be_\b._\b._\b.\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\n-\u00a0 _\bD_\bu_\bn_\be namespace.\n-\u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-constexpr std::array< T, n >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bf_\bi_\bl_\bl_\be_\bd_\bA_\br_\br_\ba_\by (const T &t)\n-\u00a0 Return an array filled with the provided value.\n-\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Utility to generate an array with a certain value.\n+Compatibility header for including \n+Certain versions (1.3.2) of Vc (_\bh_\bt_\bt_\bp_\bs_\b:_\b/_\b/_\bg_\bi_\bt_\bh_\bu_\bb_\b._\bc_\bo_\bm_\b/_\bV_\bc_\bD_\be_\bv_\be_\bl_\b/_\bV_\bc) have a problem\n+with certain compiler versions (g++ 7.2.0) in c++17 mode, see #88.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00029_source.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00029_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: filledarray.hh Source File \n+dune-common: vc.hh Source File \n \n \n \n \n \n \n \n@@ -74,51 +74,38 @@\n \n \n
\n Utility to generate an array with a certain value. \n+
Compatibility header for including <Vc/Vc> \n More...
\n-\n+\nGo to the source code of this file.
\n-\n-Namespaces | |
| namespace | Dune |
| Dune namespace. | |
\n-Functions | |
| template<std::size_t n, class T > | |
| constexpr std::array< T, n > | Dune::filledArray (const T &t) |
| Return an array filled with the provided value. | |
Detailed Description
\n-Utility to generate an array with a certain value.
\n+Compatibility header for including <Vc/Vc>
\n+Certain versions (1.3.2) of Vc (https://github.com/VcDevel/Vc) have a problem with certain compiler versions (g++ 7.2.0) in c++17 mode, see #88.
\n\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,15 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-filledarray.hh File Reference\n-Utility to generate an array with a certain value. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n- \n+ \n
\n filledarray.hh
vc.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,52 +1,32 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-filledarray.hh\n+vc.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_VC_HH\n+4#define DUNE_COMMON_VC_HH\n 5\n-6#ifndef DUNE_COMMON_FILLED_ARRAY_HH\n-7#define DUNE_COMMON_FILLED_ARRAY_HH\n-8\n-13#include \n-14#include \n-15#include \n+15#if HAVE_VC\n 16\n-17#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh>\n-18\n-19namespace _\bD_\bu_\bn_\be\n-20{\n+17// include Vc's macro definitions\n+18#include \n+19\n+20// undefine the macro that signals C++17 support, if set\n+21#ifdef Vc_CXX17\n+22#undef Vc_CXX17\n+23#endif\n+24\n+25// include the rest of Vc\n+26#include \n 27\n-32 template\n-_\b3_\b3 constexpr std::array _\bf_\bi_\bl_\bl_\be_\bd_\bA_\br_\br_\ba_\by(const T& t)\n-34 {\n-35 return _\bu_\bn_\bp_\ba_\bc_\bk_\bI_\bn_\bt_\be_\bg_\be_\br_\bS_\be_\bq_\bu_\be_\bn_\bc_\be([&](auto... i) {\n-36 return std::array{((void)(i),t)...};\n-37 }, std::make_index_sequence{});\n-38 }\n-39\n-42} // end namespace Dune\n-43\n-44#endif // DUNE_COMMON_FILLED_ARRAY_HH\n-_\bi_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\bh\n-_\bD_\bu_\bn_\be_\b:_\b:_\bf_\bi_\bl_\bl_\be_\bd_\bA_\br_\br_\ba_\by\n-constexpr std::array< T, n > filledArray(const T &t)\n-Return an array filled with the provided value.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn filledarray.hh:33\n-_\bD_\bu_\bn_\be_\b:_\b:_\bu_\bn_\bp_\ba_\bc_\bk_\bI_\bn_\bt_\be_\bg_\be_\br_\bS_\be_\bq_\bu_\be_\bn_\bc_\be\n-decltype(auto) constexpr unpackIntegerSequence(F &&f, std::integer_sequence< I,\n-i... > sequence)\n-Unpack an std::integer_sequence to std::integral_constant...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn indices.hh:124\n-_\bD_\bu_\bn_\be\n-Dune namespace.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn alignedallocator.hh:13\n+28#endif // HAVE_VC\n+29\n+30#endif // DUNE_COMMON_VC_HH\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00032.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00032.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: bartonnackmanifcheck.hh File Reference \n+dune-common: test.hh File Reference \n \n \n \n \n \n \n \n@@ -65,78 +65,494 @@\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-\n+Go to the documentation of this file. 1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n+\n \n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-constexpr std::array< T, n > filledArray(const T &t)
Return an array filled with the provided value.
Definition filledarray.hh:33
decltype(auto) constexpr unpackIntegerSequence(F &&f, std::integer_sequence< I, i... > sequence)
Unpack an std::integer_sequence<I,i...> to std::integral_constant<I,i>...
Definition indices.hh:124
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,52 +1,32 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-filledarray.hh\n+vc.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_VC_HH\n+4#define DUNE_COMMON_VC_HH\n 5\n-6#ifndef DUNE_COMMON_FILLED_ARRAY_HH\n-7#define DUNE_COMMON_FILLED_ARRAY_HH\n-8\n-13#include \n \n+Classes |\n+Namespaces |\n+Macros |\n+Typedefs
\n+ \n-Macros
\n- bartonnackmanifcheck.hh File Reference
test.hh File Reference
\n \n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n\n \n+
\n+
\n
\n+
\n \n \n
\n Generated by 1.9.8\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,47 +1,203 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bM_\ba_\bc_\br_\bo_\bs\n-bartonnackmanifcheck.hh File Reference\n-Provides check for implementation of interface methods when using static\n-polymorphism, i.e. the Barton-Nackman trick. This is purely for debugging\n-purposes. To check the correct implementation of interface methods (and pick up\n-possible infinite loops) NDEBUG must be undefined and DUNE_INTERFACECHECK has\n-to be defined. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh>\n+ * _\bs_\bi_\bm_\bd\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n+test.hh File Reference\n+Common tests for simd abstraction implementations. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\bl_\ba_\bs_\bs_\bn_\ba_\bm_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bh_\by_\bb_\br_\bi_\bd_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bi_\bo_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bl_\bo_\bo_\bp_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bt_\bd_\b/_\bt_\by_\bp_\be_\b__\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bl_\bi_\bs_\bt_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bE_\bn_\bd_\bM_\ba_\br_\bk\n+\u00a0 final element marker for RebindList _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bU_\bn_\bi_\bt_\bT_\be_\bs_\bt\n+\u00a0\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bD_\bu_\bn_\be\n+\u00a0 _\bD_\bu_\bn_\be namespace.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd\n+\u00a0 Namespace for vectorization interface functions used by library\n+ developers.\n+\u00a0\n M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bC_\bH_\bE_\bC_\bK_\b__\bI_\bN_\bT_\bE_\bR_\bF_\bA_\bC_\bE_\b__\bI_\bM_\bP_\bL_\bE_\bM_\bE_\bN_\bT_\bA_\bT_\bI_\bO_\bN(dummy)\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bC_\bH_\bE_\bC_\bK(expr)\u00a0\u00a0\u00a0 ((expr) ? void() : complain(__FILE__,\n+ __LINE__, __func__, #expr))\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bC_\bH_\bE_\bC_\bK_\b__\bO_\bP(expr)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bP_\bO_\bS_\bT_\bF_\bI_\bX_\b__\bO_\bP(NAME, SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bP_\bR_\bE_\bF_\bI_\bX_\b__\bO_\bP(NAME, SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bI_\bN_\bF_\bI_\bX_\b__\bO_\bP(NAME, SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bA_\bS_\bS_\bI_\bG_\bN_\b__\bO_\bP(NAME, SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bR_\bE_\bP_\bL_\b__\bO_\bP(NAME, REPLFN, SYMBOL)\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\u00a0\u00a0\u00a0(className())\n+\u00a0\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bD_\bO(M1, M2, M3, V1, V2, V3, NAME)\n+\u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bR_\be_\bb_\bi_\bn_\bd_\bL_\bi_\bs_\bt = typename Impl::RemoveEnd< _\bE_\bn_\bd_\bM_\ba_\br_\bk, _\bT_\by_\bp_\be_\bL_\bi_\bs_\bt<\n+ Types... > >::type\n+\u00a0 A list of types with the final element removed.\n \u00a0\n-#define\u00a0 _\bC_\bH_\bE_\bC_\bK_\b__\bA_\bN_\bD_\b__\bC_\bA_\bL_\bL_\b__\bI_\bN_\bT_\bE_\bR_\bF_\bA_\bC_\bE_\b__\bI_\bM_\bP_\bL_\bE_\bM_\bE_\bN_\bT_\bA_\bT_\bI_\bO_\bN\n- (__interface_method_to_call__)\u00a0\u00a0\u00a0 (__interface_method_to_call__)\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bi_\bm_\bd_\b:_\b:_\bI_\bs_\bL_\bo_\bo_\bp = typename Impl::IsLoop< T >::type\n+\u00a0 check whether a type is an instance of _\bL_\bo_\bo_\bp_\bS_\bI_\bM_\bD\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Provides check for implementation of interface methods when using static\n-polymorphism, i.e. the Barton-Nackman trick. This is purely for debugging\n-purposes. To check the correct implementation of interface methods (and pick up\n-possible infinite loops) NDEBUG must be undefined and DUNE_INTERFACECHECK has\n-to be defined.\n- Author\n- Robert Kloefkorn\n-Use by invoking CHECK_INTERFACE_IMPLEMENTATION(asImp().methodToCheck()) and for\n-template methods double (CHECK_INTERFACE_IMPLEMENTATION((asImp().template\n-methodToCheck ())). If either NDEBUG is defined or DUNE_INTERFACECHECK\n-is undefined the CHECK_INTERFACE_IMPLEMENTATION macro is empty.\n-Note: adding the interface check to a method will cause the implementation of\n-the method to be called twice, so before use make sure that this will not cause\n-problems e.g. if internal counters are updated.\n+Common tests for simd abstraction implementations.\n+This file is an interface header and may be included without restrictions.\n *\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0C\bCH\bHE\bEC\bCK\bK_\b_A\bAN\bND\bD_\b_C\bCA\bAL\bLL\bL_\b_I\bIN\bNT\bTE\bER\bRF\bFA\bAC\bCE\bE_\b_I\bIM\bMP\bPL\bLE\bEM\bME\bEN\bNT\bTA\bAT\bTI\bIO\bON\bN *\b**\b**\b**\b**\b*\n-#define ( \u00a0 __interface_method_to_call__ ) \u00a0\u00a0\u00a0\n-CHECK_AND_CALL_INTERFACE_IMPLEMENTATION (__interface_method_to_call__)\n-The macro CHECK_AND_CALL_INTERFACE_IMPLEMENTATION throws an exception, if the\n-interface method is not implemented and just calls the method otherwise. If\n-NDEBUG is defined no checking is done and the method is just called.\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0C\bCH\bHE\bEC\bCK\bK_\b_I\bIN\bNT\bTE\bER\bRF\bFA\bAC\bCE\bE_\b_I\bIM\bMP\bPL\bLE\bEM\bME\bEN\bNT\bTA\bAT\bTI\bIO\bON\bN *\b**\b**\b**\b**\b*\n-#define CHECK_INTERFACE_IMPLEMENTATION ( \u00a0 dummy )\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_A\bAS\bSS\bSI\bIG\bGN\bN_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_ASSIGN_OP ( \u00a0 NAME,\n+ \u00a0 SYMBOL\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+struct OpInfix##NAME \\\n+{ \\\n+template \\\n+decltype(auto) operator()(V1&& v1, V2&& v2) const \\\n+{ \\\n+return std::forward(v1) SYMBOL std::forward(v2); \\\n+} \\\n+template \\\n+auto scalar(S1& s1, S2&& s2) const \\\n+-> decltype(s1 SYMBOL std::forward(s2)); \\\n+}\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_C\bCH\bHE\bEC\bCK\bK *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_CHECK ( \u00a0 expr ) \u00a0\u00a0\u00a0 ((expr) ? void() : complain(__FILE__,\n+ __LINE__, __func__, #expr))\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_C\bCH\bHE\bEC\bCK\bK_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_CHECK_OP ( \u00a0 expr )\n+V\bVa\bal\blu\bue\be:\b:\n+((expr) ? void() : complain(__FILE__, __LINE__, __func__, \\\n+_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE, #expr))\n+_\bD_\bU_\bN_\bE_\b__\bS_\bI_\bM_\bD_\b__\bO_\bP_\bN_\bA_\bM_\bE\n+#define DUNE_SIMD_OPNAME\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_D\bDO\bO *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_DO ( \u00a0 M1,\n+ \u00a0 M2,\n+ \u00a0 M3,\n+ \u00a0 V1,\n+ \u00a0 V2,\n+ \u00a0 V3,\n+ \u00a0 NAME\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+checker(bool_constant{}, \\\n+bool_constant{}, \\\n+bool_constant{}, \\\n+Op##NAME{})\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_I\bIN\bNF\bFI\bIX\bX_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_INFIX_OP ( \u00a0 NAME,\n+ \u00a0 SYMBOL\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+struct OpInfix##NAME \\\n+{ \\\n+template \\\n+decltype(auto) operator()(V1&& v1, V2&& v2) const \\\n+{ \\\n+return std::forward(v1) SYMBOL std::forward(v2); \\\n+} \\\n+template \\\n+auto scalar(S1&& s1, S2&& s2) const \\\n+-> decltype(std::forward(s1) SYMBOL std::forward(s2)); \\\n+}\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[1\b1/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[2\b2/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[3\b3/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[4\b4/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[5\b5/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_O\bOP\bPN\bNA\bAM\bME\bE [\b[6\b6/\b/6\b6]\b] *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_OPNAME\u00a0\u00a0\u00a0(className())\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_P\bPO\bOS\bST\bTF\bFI\bIX\bX_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_POSTFIX_OP ( \u00a0 NAME,\n+ \u00a0 SYMBOL\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+struct OpPostfix##NAME \\\n+{ \\\n+template \\\n+auto operator()(V&& v) const \\\n+-> decltype(std::forward(v) SYMBOL) \\\n+{ \\\n+return std::forward(v) SYMBOL; \\\n+} \\\n+}\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_P\bPR\bRE\bEF\bFI\bIX\bX_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_PREFIX_OP ( \u00a0 NAME,\n+ \u00a0 SYMBOL\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+struct OpPrefix##NAME \\\n+{ \\\n+template \\\n+auto operator()(V&& v) const \\\n+-> decltype(SYMBOL std::forward(v)) \\\n+{ \\\n+return SYMBOL std::forward(v); \\\n+} \\\n+}\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_S\bSI\bIM\bMD\bD_\b_R\bRE\bEP\bPL\bL_\b_O\bOP\bP *\b**\b**\b**\b**\b*\n+#define DUNE_SIMD_REPL_OP ( \u00a0 NAME,\n+ \u00a0 REPLFN,\n+ \u00a0 SYMBOL\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+struct OpInfix##NAME \\\n+{ \\\n+template \\\n+decltype(auto) operator()(V1&& v1, V2&& v2) const \\\n+{ \\\n+return Simd::REPLFN(std::forward(v1), std::forward(v2)); \\\n+} \\\n+template \\\n+auto scalar(S1&& s1, S2&& s2) const \\\n+-> decltype(std::forward(s1) SYMBOL std::forward(s2)); \\\n+}\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-common-doc/doxygen/a00032_source.html", "source2": "./usr/share/doc/libdune-common-doc/doxygen/a00032_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-common: bartonnackmanifcheck.hh Source File \n+dune-common: test.hh Source File \n \n \n \n \n \n \n \n@@ -70,66 +70,2027 @@\n \n
\n \n \n \n \n \n Provides check for implementation of interface methods when using static polymorphism, i.e. the Barton-Nackman trick. This is purely for debugging purposes. To check the correct implementation of interface methods (and pick up possible infinite loops) NDEBUG must be undefined and DUNE_INTERFACECHECK has to be defined. \n+
Common tests for simd abstraction implementations. \n More...
\n-#include <dune/common/exceptions.hh>\n+
#include <algorithm>\n+
#include <cstddef>\n+
#include <iostream>\n+
#include <sstream>\n+
#include <string>\n+
#include <type_traits>\n+
#include <typeindex>\n+
#include <typeinfo>\n+
#include <unordered_set>\n+
#include <utility>\n+
#include <dune/common/classname.hh>\n+
#include <dune/common/hybridutilities.hh>\n+
#include <dune/common/rangeutilities.hh>\n+
#include <dune/common/simd/io.hh>\n+
#include <dune/common/simd/loop.hh>\n+
#include <dune/common/simd/simd.hh>\n+
#include <dune/common/std/type_traits.hh>\n+
#include <dune/common/typelist.hh>\n+
#include <dune/common/typetraits.hh>\n
Go to the source code of this file.
\n\n+Classes | |
| struct | Dune::Simd::EndMark |
final element marker for RebindList More... | |
| class | Dune::Simd::UnitTest |
\n+Namespaces | |
| namespace | Dune |
| Dune namespace. | |
| namespace | Dune::Simd |
| Namespace for vectorization interface functions used by library developers. | |
\n Macros | |
| #define | CHECK_INTERFACE_IMPLEMENTATION(dummy) |
| #define | CHECK_AND_CALL_INTERFACE_IMPLEMENTATION(__interface_method_to_call__) (__interface_method_to_call__) |
| #define | DUNE_SIMD_CHECK(expr) ((expr) ? void() : complain(__FILE__, __LINE__, __func__, #expr)) |
| #define | DUNE_SIMD_CHECK_OP(expr) |
| #define | DUNE_SIMD_POSTFIX_OP(NAME, SYMBOL) |
| #define | DUNE_SIMD_PREFIX_OP(NAME, SYMBOL) |
| #define | DUNE_SIMD_OPNAME (className<Op(V)>()) |
| #define | DUNE_SIMD_INFIX_OP(NAME, SYMBOL) |
| #define | DUNE_SIMD_ASSIGN_OP(NAME, SYMBOL) |
| #define | DUNE_SIMD_REPL_OP(NAME, REPLFN, SYMBOL) |
| #define | DUNE_SIMD_OPNAME (className<OpInfixComma(T1, T2)>()) |
| #define | DUNE_SIMD_OPNAME (className<Op(V1, V2)>()) |
| #define | DUNE_SIMD_OPNAME (className<Op(V1, T2)>()) |
| #define | DUNE_SIMD_OPNAME (className<Op(V1, T2)>()) |
| #define | DUNE_SIMD_OPNAME (className<Op(V1, P2)>()) |
| #define | DUNE_SIMD_DO(M1, M2, M3, V1, V2, V3, NAME) |
\n+Typedefs | |
| template<class... Types> | |
| using | Dune::Simd::RebindList = typename Impl::RemoveEnd< EndMark, TypeList< Types... > >::type |
| A list of types with the final element removed. | |
| template<class T > | |
| using | Dune::Simd::IsLoop = typename Impl::IsLoop< T >::type |
| check whether a type is an instance of LoopSIMD | |
Detailed Description
\n-Provides check for implementation of interface methods when using static polymorphism, i.e. the Barton-Nackman trick. This is purely for debugging purposes. To check the correct implementation of interface methods (and pick up possible infinite loops) NDEBUG must be undefined and DUNE_INTERFACECHECK has to be defined.
\n-- Author
- Robert Kloefkorn
Use by invoking CHECK_INTERFACE_IMPLEMENTATION(asImp().methodToCheck()) and for template methods double (CHECK_INTERFACE_IMPLEMENTATION((asImp().template methodToCheck<param> ())). If either NDEBUG is defined or DUNE_INTERFACECHECK is undefined the CHECK_INTERFACE_IMPLEMENTATION macro is empty.
\n-Note: adding the interface check to a method will cause the implementation of the method to be called twice, so before use make sure that this will not cause problems e.g. if internal counters are updated.
\n+Common tests for simd abstraction implementations.
\n+This file is an interface header and may be included without restrictions.
\nMacro Definition Documentation
\n-\n-◆ CHECK_AND_CALL_INTERFACE_IMPLEMENTATION
\n+\n+◆ DUNE_SIMD_ASSIGN_OP
\n \n\n
\n+\n+\n \n
\n+
| #define CHECK_AND_CALL_INTERFACE_IMPLEMENTATION | \n+#define DUNE_SIMD_ASSIGN_OP | \n( | \n\n- | __interface_method_to_call__ | ) | \n-(__interface_method_to_call__) | \n+NAME, | \n+
| \n+ | \n+ | \n+ | SYMBOL | \n+||||
| \n+ | ) | \n+\n+ |
\n+Value:\n+
\n+ struct OpInfix##NAME \\
\n+ { \\
\n+ template<class V1, class V2> \\
\n+ decltype(auto) operator()(V1&& v1, V2&& v2) const \\
\n+ { \\
\n+ return std::forward<V1>(v1) SYMBOL std::forward<V2>(v2); \\
\n+ } \\
\n+ template<class S1, class S2> \\
\n+ auto scalar(S1& s1, S2&& s2) const \\
\n+ -> decltype(s1 SYMBOL std::forward<S2>(s2)); \\
\n+ }
\n+◆ DUNE_SIMD_CHECK
\n+\n+\n+
\n-\n-\n+ \n+
\n
| #define DUNE_SIMD_CHECK | \n+( | \n+\n+ | expr | ) | \n+((expr) ? void() : complain(__FILE__, __LINE__, __func__, #expr)) | \n
\n-
\n The macro CHECK_AND_CALL_INTERFACE_IMPLEMENTATION throws an exception, if the interface method is not implemented and just calls the method otherwise. If NDEBUG is defined no checking is done and the method is just called.
\n \n◆ CHECK_INTERFACE_IMPLEMENTATION
\n+\n+◆ DUNE_SIMD_CHECK_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_CHECK_OP | \n+( | \n+\n+ | expr | ) | \n+\n+ |
\n+Value:\n+\n+
\n+ ((expr) ? void() : complain(__FILE__, __LINE__, __func__, \\
\n+ DUNE_SIMD_OPNAME, #expr))
\n+#define DUNE_SIMD_OPNAME
◆ DUNE_SIMD_DO
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_DO | \n+( | \n+\n+ | M1, | \n+
| \n+ | \n+ | \n+ | M2, | \n+
| \n+ | \n+ | \n+ | M3, | \n+
| \n+ | \n+ | \n+ | V1, | \n+
| \n+ | \n+ | \n+ | V2, | \n+
| \n+ | \n+ | \n+ | V3, | \n+
| \n+ | \n+ | \n+ | NAME | \n+
| \n+ | ) | \n+\n+ |
\n+Value:\n+
\n+ checker(bool_constant<isMask ? do_##M1 : do_##V1>{}, \\
\n+ bool_constant<isMask ? do_##M2 : do_##V2>{}, \\
\n+ bool_constant<isMask ? do_##M3 : do_##V3>{}, \\
\n+ Op##NAME{})
\n+◆ DUNE_SIMD_INFIX_OP
\n \n\n
\n+\n+\n \n
\n
| #define CHECK_INTERFACE_IMPLEMENTATION | \n+#define DUNE_SIMD_INFIX_OP | \n( | \n\n- | dummy | ) | \n+NAME, | \n+
| \n+ | \n+ | \n+ | SYMBOL | \n+|||
| \n+ | ) | \n+\n |
\n+Value:\n+
\n+ struct OpInfix##NAME \\
\n+ { \\
\n+ template<class V1, class V2> \\
\n+ decltype(auto) operator()(V1&& v1, V2&& v2) const \\
\n+ { \\
\n+ return std::forward<V1>(v1) SYMBOL std::forward<V2>(v2); \\
\n+ } \\
\n+ template<class S1, class S2> \\
\n+ auto scalar(S1&& s1, S2&& s2) const \\
\n+ -> decltype(std::forward<S1>(s1) SYMBOL std::forward<S2>(s2)); \\
\n+ }
\n+◆ DUNE_SIMD_OPNAME [1/6]
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<Op(V)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_OPNAME [2/6]
\n \n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<OpInfixComma(T1, T2)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_OPNAME [3/6]
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<Op(V1, V2)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_OPNAME [4/6]
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<Op(V1, T2)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_OPNAME [5/6]
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<Op(V1, T2)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_OPNAME [6/6]
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_OPNAME (className<Op(V1, P2)>()) | \n+
\n+\n+
\n+◆ DUNE_SIMD_POSTFIX_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_POSTFIX_OP | \n+( | \n+\n+ | NAME, | \n+
| \n+ | \n+ | \n+ | SYMBOL | \n+
| \n+ | ) | \n+\n+ |
\n+Value:\n+
\n+ struct OpPostfix##NAME \\
\n+ { \\
\n+ template<class V> \\
\n+ auto operator()(V&& v) const \\
\n+ -> decltype(std::forward<V>(v) SYMBOL) \\
\n+ { \\
\n+ return std::forward<V>(v) SYMBOL; \\
\n+ } \\
\n+ }
\n+◆ DUNE_SIMD_PREFIX_OP
\n+\n+\n+
\n+\n+\n+ \n+
\n+
| #define DUNE_SIMD_PREFIX_OP | \n+( | \n+\n+ | NAME, | \n+
| \n+ | \n+ | \n+ | SYMBOL | \n+
| \n+ | ) | \n+\n+ |
\n+Value:\n+
\n+ struct OpPrefix##NAME \\
\n+ { \\
\n+ template<class V> \\
\n+ auto operator()(V&& v) const \\
\n+ -> decltype(SYMBOL std::forward<V>(v)) \\
\n+ { \\
\n+ return SYMBOL std::forward<V>(v); \\
\n+ } \\
\n+ }
\n+◆ DUNE_SIMD_REPL_OP
\n+\n+\n+
\n \n+ \n+
\n+
| #define DUNE_SIMD_REPL_OP | \n+( | \n+\n+ | NAME, | \n+
| \n+ | \n+ | \n+ | REPLFN, | \n+
| \n+ | \n+ | \n+ | SYMBOL | \n+
| \n+ | ) | \n+\n+ |
\n+Value:\n
\n struct OpInfix##NAME \\
\n+ { \\
\n+ template<class V1, class V2> \\
\n+ decltype(auto) operator()(V1&& v1, V2&& v2) const \\
\n+ { \\
\n+ return Simd::REPLFN(std::forward<V1>(v1), std::forward<V2>(v2)); \\
\n+ } \\
\n+ template<class S1, class S2> \\
\n+ auto scalar(S1&& s1, S2&& s2) const \\
\n+ -> decltype(std::forward<S1>(s1) SYMBOL std::forward<S2>(s2)); \\
\n+ }
\n+\n Generated by
1.9.8\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,47 +1,203 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bM_\ba_\bc_\br_\bo_\bs\n-bartonnackmanifcheck.hh File Reference\n-Provides check for implementation of interface methods when using static\n-polymorphism, i.e. the Barton-Nackman trick. This is purely for debugging\n-purposes. To check the correct implementation of interface methods (and pick up\n-possible infinite loops) NDEBUG must be undefined and DUNE_INTERFACECHECK has\n-to be defined. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh>\n+ * _\bs_\bi_\bm_\bd\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n+test.hh File Reference\n+Common tests for simd abstraction implementations. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n- \n+ \n
\n bartonnackmanifcheck.hh
test.hh
\n-Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,57 +1,2101 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-bartonnackmanifcheck.hh\n+ * _\bs_\bi_\bm_\bd\n+test.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-24//- Dune includes\n-25#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh>\n-26\n-27#ifdef CHECK_INTERFACE_IMPLEMENTATION\n-28#undef CHECK_INTERFACE_IMPLEMENTATION\n-29#endif\n-30#ifdef CHECK_AND_CALL_INTERFACE_IMPLEMENTATION\n-31#undef CHECK_AND_CALL_INTERFACE_IMPLEMENTATION\n-32#endif\n-33\n-34#if defined NDEBUG || !defined DUNE_INTERFACECHECK\n-_\b3_\b5#define CHECK_INTERFACE_IMPLEMENTATION(dummy)\n-36#else\n-37#define CHECK_INTERFACE_IMPLEMENTATION(__interface_method_to_call__) \\\n-38 {\\\n-39 static bool call = false; \\\n-40 if( call == true ) \\\n-41 DUNE_THROW(NotImplemented,\"Interface method not implemented!\");\\\n-42 call = true; \\\n-43 try { \\\n-44 (__interface_method_to_call__); \\\n-45 call = false; \\\n-46 } \\\n-47 catch ( ... ) \\\n-48 { \\\n-49 call = false; \\\n-50 throw; \\\n-51 } \\\n-52 }\n-53#endif\n-54\n-60#if defined NDEBUG || !defined DUNE_INTERFACECHECK\n-_\b6_\b1#define CHECK_AND_CALL_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-\\\n-62 (__interface_method_to_call__)\n-63#else\n-64#define CHECK_AND_CALL_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-\\\n-65 CHECK_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-66#endif\n-_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\n-A few common exception classes.\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_TEST_HH\n+4#define DUNE_COMMON_SIMD_TEST_HH\n+5\n+12#include \n+13#include \n+14#include \n+15#include \n+16#include \n+17#include \n+18#include \n+19#include \n+20#include \n+21#include \n+22\n+23#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bc_\bl_\ba_\bs_\bs_\bn_\ba_\bm_\be_\b._\bh_\bh>\n+24#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bh_\by_\bb_\br_\bi_\bd_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+25#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\br_\ba_\bn_\bg_\be_\bu_\bt_\bi_\bl_\bi_\bt_\bi_\be_\bs_\b._\bh_\bh>\n+26#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bi_\bo_\b._\bh_\bh>\n+27#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bl_\bo_\bo_\bp_\b._\bh_\bh>\n+28#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bi_\bm_\bd_\b/_\bs_\bi_\bm_\bd_\b._\bh_\bh>\n+29#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bs_\bt_\bd_\b/_\bt_\by_\bp_\be_\b__\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+30#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bl_\bi_\bs_\bt_\b._\bh_\bh>\n+31#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n+32\n+33namespace _\bD_\bu_\bn_\be {\n+34 namespace Simd {\n+35\n+36 namespace Impl {\n+37\n+38 template\n+39 struct LessThenComparable : std::false_type {};\n+40 template\n+41 struct LessThenComparable()\n+42 < std::declval())> > :\n+43 std::true_type\n+44 {};\n+45\n+46 template\n+47 struct CopyConstHelper\n+48 {\n+49 using type = Dst;\n+50 };\n+51 template\n+52 struct CopyConstHelper\n+53 {\n+54 using type = std::add_const_t;\n+55 };\n+56\n+57 template\n+58 struct CopyVolatileHelper\n+59 {\n+60 using type = Dst;\n+61 };\n+62 template\n+63 struct CopyVolatileHelper\n+64 {\n+65 using type = std::add_volatile_t;\n+66 };\n+67\n+68 template\n+69 struct CopyReferenceHelper\n+70 {\n+71 using type = Dst;\n+72 };\n+73 template\n+74 struct CopyReferenceHelper\n+75 {\n+76 using type = std::add_lvalue_reference_t;\n+77 };\n+78\n+79 template\n+80 struct CopyReferenceHelper\n+81 {\n+82 using type = std::add_rvalue_reference_t;\n+83 };\n+84\n+85 template\n+86 using CopyRefQual = typename CopyReferenceHelper<\n+87 typename CopyVolatileHelper<\n+88 typename CopyConstHelper<\n+89 std::decay_t,\n+90 std::remove_reference_t\n+91 >::type,\n+92 std::remove_reference_t\n+93 >::type,\n+94 Src\n+95 >::type;\n+96\n+97 template::value - 1> >\n+100 struct RemoveEnd;\n+101 template\n+102 struct RemoveEnd>\n+103 {\n+104 using Back = TypeListEntry_t::value - 1, Types>;\n+105 static_assert(std::is_same::value,\n+106 \"TypeList not terminated by proper EndMark\");\n+107 using type = TypeList...>;\n+108 };\n+109\n+110 template\n+111 struct TypeInList;\n+112\n+113 template\n+114 struct TypeInList > : std::false_type {};\n+115\n+116 template\n+117 struct TypeInList > : std::true_type {};\n+118\n+119 template\n+120 struct TypeInList,\n+121 _\bs_\bt_\bd::enable_if_t::value> > :\n+122 TypeInList >::type\n+123 {};\n+124\n+125 template\n+126 struct _\bI_\bs_\bL_\bo_\bo_\bp : std::false_type {};\n+127 template\n+128 struct _\bI_\bs_\bL_\bo_\bo_\bp > : std::true_type {};\n+129\n+130 // used inside static_assert to trick the compiler into printing a list\n+131 // of types:\n+132 //\n+133 // static_assert(debugTypes(Std::bool_constant{}), \"msg\");\n+134 //\n+135 // Should include what the type `V` expands to in the error message.\n+136 template\n+137 constexpr bool debugTypes(std::true_type) { return true; }\n+138 template\n+139 [[deprecated]]\n+140 constexpr bool debugTypes(std::false_type) { return false; }\n+141\n+142 } // namespace Impl\n+143\n+_\b1_\b4_\b5 struct _\bE_\bn_\bd_\bM_\ba_\br_\bk {};\n+147\n+156 template\n+_\b1_\b5_\b7 using _\bR_\be_\bb_\bi_\bn_\bd_\bL_\bi_\bs_\bt =\n+158 typename Impl::RemoveEnd<_\bE_\bn_\bd_\bM_\ba_\br_\bk, _\bT_\by_\bp_\be_\bL_\bi_\bs_\bt
\n-\n-\n+Go to the documentation of this file.\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-A few common exception classes.
1// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+IO interface of the SIMD abstraction.
#define DUNE_SIMD_DO(M1, M2, M3, V1, V2, V3, NAME)
Utilities for reduction like operations on ranges.
A free function to provide the demangled class name of a given object or type as a string.
Traits for type conversions and type information.
static StaticIntegralRange< T, to, from > range(std::integral_constant< T, from >, std::integral_constant< T, to >) noexcept
Definition rangeutilities.hh:312
constexpr void forEach(Range &&range, F &&f)
Range based for loop.
Definition hybridutilities.hh:256
constexpr AutonomousValue< T > autoCopy(T &&v)
Autonomous copy of an expression's value for use in auto type deduction.
Definition typetraits.hh:672
typename Impl::voider< Types... >::type void_t
Is void for all valid input types. The workhorse for C++11 SFINAE-techniques.
Definition typetraits.hh:40
bool anyTrue(const Mask &mask)
Whether any entry is true
Definition simd/interface.hh:429
auto maskOr(const V1 &v1, const V2 &v2)
Logic or of masks.
Definition simd/interface.hh:499
V cond(M &&mask, const V &ifTrue, const V &ifFalse)
Like the ?: operator.
Definition simd/interface.hh:386
bool allTrue(const Mask &mask)
Whether all entries are true
Definition simd/interface.hh:439
auto max(const V &v1, const V &v2)
The binary maximum value over two simd objects.
Definition simd/interface.hh:409
bool anyFalse(const Mask &mask)
Whether any entry is false
Definition simd/interface.hh:449
constexpr std::size_t lanes()
Number of lanes in a SIMD type.
Definition simd/interface.hh:305
decltype(auto) lane(std::size_t l, V &&v)
Extract an element of a SIMD type.
Definition simd/interface.hh:324
bool allFalse(const Mask &mask)
Whether all entries are false
Definition simd/interface.hh:459
auto maskAnd(const V1 &v1, const V2 &v2)
Logic and of masks.
Definition simd/interface.hh:509
typename Overloads::ScalarType< std::decay_t< V > >::type Scalar
Element type of some SIMD type.
Definition simd/interface.hh:235
auto min(const V &v1, const V &v2)
The binary minimum value over two simd objects.
Definition simd/interface.hh:419
STL namespace.
constexpr std::integral_constant< std::size_t, sizeof...(II)> size(std::integer_sequence< T, II... >)
Return the size of the sequence.
Definition integersequence.hh:75
typename Impl::RemoveEnd< EndMark, TypeList< Types... > >::type RebindList
A list of types with the final element removed.
Definition test.hh:158
typename Impl::IsLoop< T >::type IsLoop
check whether a type is an instance of LoopSIMD
Definition test.hh:162
Definition loop.hh:65
Definition test.hh:164
void checkBinaryOpsScalarVector()
Definition test.hh:1970
void checkBinaryOpsVectorScalar()
Definition test.hh:1985
void checkBinaryOpsVectorVector()
Definition test.hh:1960
void checkBinaryOpsVectorProxy()
Definition test.hh:2010
void checkBinaryOpsProxyVector()
Definition test.hh:2000
Include file for users of the SIMD abstraction layer.
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,57 +1,2101 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-bartonnackmanifcheck.hh\n+ * _\bs_\bi_\bm_\bd\n+test.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-2// vi: set et ts=4 sw=2 sts=2:\n-3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n+1// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n-4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-24//- Dune includes\n-25#include <_\bd_\bu_\bn_\be_\b/_\bc_\bo_\bm_\bm_\bo_\bn_\b/_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh>\n-26\n-27#ifdef CHECK_INTERFACE_IMPLEMENTATION\n-28#undef CHECK_INTERFACE_IMPLEMENTATION\n-29#endif\n-30#ifdef CHECK_AND_CALL_INTERFACE_IMPLEMENTATION\n-31#undef CHECK_AND_CALL_INTERFACE_IMPLEMENTATION\n-32#endif\n-33\n-34#if defined NDEBUG || !defined DUNE_INTERFACECHECK\n-_\b3_\b5#define CHECK_INTERFACE_IMPLEMENTATION(dummy)\n-36#else\n-37#define CHECK_INTERFACE_IMPLEMENTATION(__interface_method_to_call__) \\\n-38 {\\\n-39 static bool call = false; \\\n-40 if( call == true ) \\\n-41 DUNE_THROW(NotImplemented,\"Interface method not implemented!\");\\\n-42 call = true; \\\n-43 try { \\\n-44 (__interface_method_to_call__); \\\n-45 call = false; \\\n-46 } \\\n-47 catch ( ... ) \\\n-48 { \\\n-49 call = false; \\\n-50 throw; \\\n-51 } \\\n-52 }\n-53#endif\n-54\n-60#if defined NDEBUG || !defined DUNE_INTERFACECHECK\n-_\b6_\b1#define CHECK_AND_CALL_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-\\\n-62 (__interface_method_to_call__)\n-63#else\n-64#define CHECK_AND_CALL_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-\\\n-65 CHECK_INTERFACE_IMPLEMENTATION(__interface_method_to_call__)\n-66#endif\n-_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\n-A few common exception classes.\n+2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n+3#ifndef DUNE_COMMON_SIMD_TEST_HH\n+4#define DUNE_COMMON_SIMD_TEST_HH\n+5\n+12#include