#include <dune/common/typetraits.hh>\n-
#include <dune/typetree/nodeinterface.hh>\n-
#include <dune/typetree/nodetags.hh>\n-
#include <dune/typetree/treepath.hh>\n-
#include <dune/typetree/utility.hh>\n+
#include <dune/typetree/traversal.hh>\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
| namespace | Dune::TypeTree::Experimental |
\n Functions | |
| template<typename Tree , typename Visitor , typename Init > | |
| auto | Dune::TypeTree::Experimental::hybridApplyToTree (Tree &&tree, Visitor &&visitor, Init &&init) |
| Apply hybrid visitor to TypeTree. | |
| template<typename ResultType , typename Tree , typename F , typename R > | |
| ResultType | Dune::TypeTree::reduceOverLeafs (const Tree &tree, F functor, R reduction, ResultType startValue) |
| Calculate a quantity as a reduction over the leaf nodes of a TypeTree. | |
Variable Documentation
\n-\n-◆ child_result
\n+\n+◆ _functor
\n \n\n
\n-\n-\n-\n-
\n
\n
\n+\n+ \n+\n+\n+◆ _reduction\n+\n+\n+ \n+\n+\n+
\n+\n+ \n+◆ _value\n+\n+\n+ \n+
| \n- \n-static | \n-
\n \n
\n ◆ result
\n+\n+◆ treePathType
\n \n\n
\n \n \n
\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,84 +1,33 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-accumulate_static.hh File Reference\n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bt_\ba_\bg_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\br_\be_\be_\bp_\ba_\bt_\bh_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b._\bh_\bh>\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+traversalutilities.hh File Reference\n+#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\br_\ba_\bv_\be_\br_\bs_\ba_\bl_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bo_\br_\b__\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type using ||. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bo_\br_\b__\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bn_\bd_\b__\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type using &&. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bn_\bd_\b__\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bl_\bu_\bs_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type using +. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bl_\bu_\bs_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\bu_\bs_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type using -. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\bu_\bs_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type using *. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type by returning their\n- minimum. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\ba_\bx_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>\n-\u00a0 Statically combine two values of type result_type by returning their\n- maximum. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\ba_\bx_\b<_\b _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be_\b _\b>_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b<_\b _\br_\b1_\b,_\b _\br_\b2_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\b<_\b _\bT_\br_\be_\be_\b,_\b _\bF_\bu_\bn_\bc_\bt_\bo_\br_\b,_\b _\bR_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b,_\b _\bs_\bt_\ba_\br_\bt_\bV_\ba_\bl_\bu_\be_\b,\n- _\bP_\ba_\br_\be_\bn_\bt_\bC_\bh_\bi_\bl_\bd_\bR_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b _\b>\n-\u00a0 Statically accumulate a value over the nodes of a _\bT_\by_\bp_\be_\bT_\br_\be_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b<_\b _\bF_\bu_\bn_\bc_\bt_\bo_\br_\b,_\b _\bR_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b,_\b _\bS_\bt_\ba_\br_\bt_\bT_\by_\bp_\be_\b,\n- _\bP_\ba_\br_\be_\bn_\bt_\bC_\bh_\bi_\bl_\bd_\bR_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b,_\b _\bR_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\bA_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bT_\by_\bp_\be_\b<_\b _\bT_\br_\be_\be_\b,_\b _\bP_\bo_\bl_\bi_\bc_\by_\b _\b>\n-\u00a0 Statically accumulate a type over the nodes of a _\bT_\by_\bp_\be_\bT_\br_\be_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bE_\bx_\bp_\be_\br_\bi_\bm_\be_\bn_\bt_\ba_\bl\n-\u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bE_\bx_\bp_\be_\br_\bi_\bm_\be_\bn_\bt_\ba_\bl_\b:_\b:_\bh_\by_\bb_\br_\bi_\bd_\bA_\bp_\bp_\bl_\by_\bT_\bo_\bT_\br_\be_\be (Tree &&tree, Visitor\n- &&visitor, Init &&init)\n-\u00a0 Apply hybrid visitor to _\bT_\by_\bp_\be_\bT_\br_\be_\be.\n+template\n+ResultType\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\bO_\bv_\be_\br_\bL_\be_\ba_\bf_\bs (const Tree &tree, F functor, R\n+ reduction, ResultType startValue)\n+\u00a0 Calculate a quantity as a reduction over the leaf nodes of a\n+ _\bT_\by_\bp_\be_\bT_\br_\be_\be.\n \u00a0\n *\b**\b**\b**\b**\b* V\bVa\bar\bri\bia\bab\bbl\ble\be 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\bhi\bil\bld\bd_\b_r\bre\bes\bsu\bul\blt\bt *\b**\b**\b**\b**\b*\n-const result_type child_result =\n-accumulate_value>_\b:_\b: static\n-_\br_\be_\bs_\bu_\bl_\bt\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0r\bre\bes\bsu\bul\blt\bt *\b**\b**\b**\b**\b*\n-const result_type result = current_value static\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0_\b_f\bfu\bun\bnc\bct\bto\bor\br *\b**\b**\b**\b**\b*\n+F _functor\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0_\b_r\bre\bed\bdu\buc\bct\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+R _reduction\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0_\b_v\bva\bal\blu\bue\be *\b**\b**\b**\b**\b*\n+ResultType _value\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0t\btr\bre\bee\beP\bPa\bat\bth\bhT\bTy\byp\bpe\be *\b**\b**\b**\b**\b*\n+const TreePathType::Type treePathType = TreePathType::dynamic static\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html", "source2": "./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-typetree: accumulate_static.hh Source File \n+dune-typetree: traversalutilities.hh Source File \n \n \n \n \n \n \n \n@@ -74,595 +74,90 @@\n \n \n
\n \n
| \n \n static | \n
\n- \n+ \n
\n accumulate_static.hh
traversalutilities.hh
\n Go to the documentation of this file.
\n Generated by![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,698 +1,109 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-accumulate_static.hh\n+traversalutilities.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n 5\n-6#ifndef DUNE_TYPETREE_ACCUMULATE_STATIC_HH\n-7#define DUNE_TYPETREE_ACCUMULATE_STATIC_HH\n+6#ifndef DUNE_TYPETREE_TRAVERSALUTILITIES_HH\n+7#define DUNE_TYPETREE_TRAVERSALUTILITIES_HH\n 8\n-9#include \n-10#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh>\n-11#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bt_\ba_\bg_\bs_\b._\bh_\bh>\n-12#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\br_\be_\be_\bp_\ba_\bt_\bh_\b._\bh_\bh>\n-13#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b._\bh_\bh>\n-14\n-15\n-_\b1_\b6namespace _\bD_\bu_\bn_\be {\n-_\b1_\b7 namespace TypeTree {\n-18\n-25 template\n-_\b2_\b6 struct _\bo_\br_\b_\n-27 {\n-28 template\n-_\b2_\b9 struct _\br_\be_\bd_\bu_\bc_\be\n+9#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\br_\ba_\bv_\be_\br_\bs_\ba_\bl_\b._\bh_\bh>\n+10\n+11namespace _\bD_\bu_\bn_\be {\n+12 namespace TypeTree {\n+13\n+19 namespace {\n+20\n+22\n+27 template\n+28 struct LeafReductionVisitor\n+29 : public TypeTree::TreeVisitor\n 30 {\n-_\b3_\b1 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 || r2;\n-32 };\n-33 };\n-34\n-36 template\n-_\b3_\b7 struct _\ba_\bn_\bd_\b_\n-38 {\n-39 template\n-_\b4_\b0 struct _\br_\be_\bd_\bu_\bc_\be\n-41 {\n-_\b4_\b2 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 && r2;\n-43 };\n-44 };\n+31\n+_\b3_\b2 static const _\bT_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be_\b:_\b:_\bT_\by_\bp_\be _\bt_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be = _\bT_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be_\b:_\b:_\bd_\by_\bn_\ba_\bm_\bi_\bc;\n+33\n+34 template\n+35 void leaf(const Node& node, TreePath _\bt_\br_\be_\be_\bP_\ba_\bt_\bh)\n+36 {\n+37 _\b__\bv_\ba_\bl_\bu_\be = _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn(_\b__\bv_\ba_\bl_\bu_\be,_\b__\bf_\bu_\bn_\bc_\bt_\bo_\br(node,_\bt_\br_\be_\be_\bP_\ba_\bt_\bh));\n+38 }\n+39\n+40 LeafReductionVisitor(F functor, R reduction, ResultType startValue)\n+41 : _\b__\bf_\bu_\bn_\bc_\bt_\bo_\br(functor)\n+42 , _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn(reduction)\n+43 , _\b__\bv_\ba_\bl_\bu_\be(startValue)\n+44 {}\n 45\n-47 template\n-_\b4_\b8 struct _\bp_\bl_\bu_\bs\n-49 {\n-50 template\n-_\b5_\b1 struct _\br_\be_\bd_\bu_\bc_\be\n-52 {\n-_\b5_\b3 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 + r2;\n-54 };\n-55 };\n-56\n-58 template\n-_\b5_\b9 struct _\bm_\bi_\bn_\bu_\bs\n-60 {\n-61 template\n-_\b6_\b2 struct _\br_\be_\bd_\bu_\bc_\be\n-63 {\n-_\b6_\b4 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 - r2;\n-65 };\n-66 };\n-67\n-69 template\n-_\b7_\b0 struct _\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by\n-71 {\n-72 template\n-_\b7_\b3 struct _\br_\be_\bd_\bu_\bc_\be\n-74 {\n-_\b7_\b5 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 * r2;\n-76 };\n-77 };\n-78\n-80 template\n-_\b8_\b1 struct _\bm_\bi_\bn\n-82 {\n-83 template\n-_\b8_\b4 struct _\br_\be_\bd_\bu_\bc_\be\n-85 {\n-_\b8_\b6 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 < r2 ? r1 : r2;\n-87 };\n-88 };\n+46 ResultType _\br_\be_\bs_\bu_\bl_\bt() { return _\b__\bv_\ba_\bl_\bu_\be; }\n+47\n+_\b4_\b8 F _\b__\bf_\bu_\bn_\bc_\bt_\bo_\br;\n+_\b4_\b9 R _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n+_\b5_\b0 ResultType _\b__\bv_\ba_\bl_\bu_\be;\n+51\n+52 };\n+53\n+54 } // anonymous namespace\n+55\n+57\n+82 template\n+_\b8_\b3 ResultType _\br_\be_\bd_\bu_\bc_\be_\bO_\bv_\be_\br_\bL_\be_\ba_\bf_\bs(const Tree& tree, F functor, R reduction,\n+ResultType startValue)\n+84 {\n+85 LeafReductionVisitor visitor(functor,reduction,startValue);\n+86 _\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bp_\bp_\bl_\by_\bT_\bo_\bT_\br_\be_\be(tree,visitor);\n+87 return visitor.result();\n+88 }\n 89\n-91 template\n-_\b9_\b2 struct _\bm_\ba_\bx\n-93 {\n-94 template\n-_\b9_\b5 struct _\br_\be_\bd_\bu_\bc_\be\n-96 {\n-_\b9_\b7 static const result_type _\br_\be_\bs_\bu_\bl_\bt = r1 > r2 ? r1 : r2;\n-98 };\n-99 };\n-100\n-101\n-102 namespace {\n-103\n-104 // implementation of the traversal algorithm\n-105\n-107 template\n-108 struct accumulate_node_helper\n-109 {\n-110\n-111 typedef typename Functor::result_type result_type;\n-112\n-_\b1_\b1_\b3 static const result_type _\br_\be_\bs_\bu_\bl_\bt = current_value;\n-114\n-115 };\n-116\n-118 template\n-119 struct\n-accumulate_node_helper\n-120 {\n-121\n-122 typedef typename Functor::result_type result_type;\n-123\n-124 static const result_type _\br_\be_\bs_\bu_\bl_\bt = Reduction::template\n-reduce::result>::result;\n-125\n-126 };\n-127\n-129 template\n-130 struct accumulate_value;\n-131\n-133 template\n-134 struct\n-accumulate_value\n-135 {\n-136\n-137 typedef typename Functor::result_type result_type;\n-138\n-139 static const result_type _\br_\be_\bs_\bu_\bl_\bt =\n-140\n-141\n-accumulate_node_helper::value>_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt;\n-142\n-143 };\n-144\n-146 template\n-147 struct accumulate_over_children\n-148 {\n-149\n-150 typedef typename Functor::result_type result_type;\n-151\n-152 typedef decltype(_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk(TreePath{},index_constant{}))\n-child_tree_path;\n-153\n-154 typedef typename Node::template _\bC_\bh_\bi_\bl_\bd::Type child;\n-155\n-_\b1_\b5_\b6 static const result_type child_result =\n-accumulate_value>::\n-result;\n-157\n-158 static const result_type result =\n-accumulate_over_children::\n-result;\n-159\n-160 };\n-161\n-163 template\n-164 struct\n-accumulate_over_children\n-165 {\n-166\n-167 typedef typename Functor::result_type result_type;\n-168\n-169 static const result_type _\br_\be_\bs_\bu_\bl_\bt = current_value;\n-170\n-171 };\n-172\n-175 template\n-176 struct accumulate_value_generic_composite_node\n-177 {\n-178\n-179 typedef typename Functor::result_type result_type;\n-180\n-181 static const result_type _\bc_\bh_\bi_\bl_\bd_\b__\br_\be_\bs_\bu_\bl_\bt =\n-accumulate_over_children::\n-value>_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt;\n-182\n-183 static const result_type _\br_\be_\bs_\bu_\bl_\bt =\n-184\n-accumulate_node_helper::value>_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt;\n-185\n-186\n-187 };\n-188\n-190 template\n-191 struct\n-accumulate_value\n-192 : public\n-accumulate_value_generic_composite_node\n-193 {};\n-194\n-196 template\n-197 struct\n-accumulate_value\n-198 : public\n-accumulate_value_generic_composite_node\n-199 {};\n-200\n-201 } // anonymous namespace\n-202\n-204\n-260 template\n-_\b2_\b6_\b1 struct _\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be\n-262 {\n-263\n-_\b2_\b6_\b5 typedef typename Functor::result_type _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be;\n-266\n-_\b2_\b6_\b8 static const _\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be _\br_\be_\bs_\bu_\bl_\bt =\n-accumulate_value,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bT_\br_\be_\be_\b>>_\b:_\b:\n-_\br_\be_\bs_\bu_\bl_\bt;\n-269\n-270 };\n-271\n-274 struct flattened_reduction;\n-275\n-278 struct bottom_up_reduction;\n-279\n-280 namespace {\n-281\n-282 // implementation of the traversal algorithm\n-283\n-286 template\n-287 struct accumulate_type_node_helper\n-288 {\n-289\n-290 typedef current_type type;\n-291\n-292 };\n-293\n-295 template\n-296 struct\n-accumulate_type_node_helper\n-297 {\n-298\n-299 typedef typename Reduction::template reduce<\n-300 current_type,\n-301 typename Functor::template visit<\n-302 Node,\n-303 TreePath\n-304 >::type\n-305 >::type type;\n-306\n-307 };\n-308\n-310 template\n-311 struct accumulate_type;\n-312\n-314 template\n-315 struct accumulate_type\n-316 {\n-317\n-318 typedef typename accumulate_type_node_helper<\n-319 LeafNode,\n-320 typename Policy::functor,\n-321 typename Policy::sibling_reduction,\n-322 current_type,\n-323 TreePath,\n-324 Policy::functor::template doVisit<\n-325 LeafNode,\n-326 TreePath>::value\n-327 >::type type;\n-328\n-329 };\n-330\n-331\n-334 template\n-335 struct propagate_type_down_tree;\n-336\n-338 template\n-339 struct propagate_type_down_tree<\n-340 current_type,\n-341 tree_path,\n-342 start_type,\n-343 bottom_up_reduction\n-344 >\n-345 {\n-346 typedef current_type type;\n-347 };\n-348\n-350 template\n-351 struct propagate_type_down_tree<\n-352 current_type,\n-353 tree_path,\n-354 start_type,\n-355 flattened_reduction\n-356 >\n-357 {\n-358 typedef typename std::conditional<\n-359 TreePathBack::value == 0,\n-360 start_type,\n-361 current_type\n-362 >::type type;\n-363 };\n-364\n-365\n-367 template\n-368 struct accumulate_type_over_children\n-369 {\n-370\n-371 typedef decltype(_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk(TreePath{},index_constant{}))\n-child_tree_path;\n-372\n-373 typedef typename Node::template Child::Type child;\n-374\n-375 typedef typename accumulate_type<\n-376 child,\n-377 Policy,\n-378 // apply reduction choice (flat / hierarchic)\n-379 typename propagate_type_down_tree<\n-380 current_type,\n-381 child_tree_path,\n-382 typename Policy::start_type,\n-383 typename Policy::reduction_strategy\n-384 >::type,\n-385 child_tree_path,\n-386 NodeTag\n-387 >::type child_result_type;\n-388\n-389 typedef typename accumulate_type_over_children<\n-390 Node,\n-391 Policy,\n-392 child_result_type,\n-393 TreePath,\n-394 i+1,\n-395 n\n-396 >::type type;\n-397\n-398 };\n-399\n-401 template\n-402 struct accumulate_type_over_children\n-403 {\n-404\n-405 typedef current_type type;\n-406\n-407 };\n-408\n-409\n-412 template\n-413 struct accumulate_type_generic_composite_node\n-414 {\n-415\n-416 typedef typename accumulate_type_over_children<\n-417 Node,\n-418 Policy,\n-419 current_type,\n-420 TreePath,\n-421 0,\n-422 StaticDegree::value\n-423 >::type children_result_type;\n-424\n-425 typedef typename accumulate_type_node_helper<\n-426 Node,\n-427 typename Policy::functor,\n-428 typename Policy::parent_child_reduction,\n-429 children_result_type,\n-430 TreePath,\n-431 Policy::functor::template doVisit<\n-432 Node,\n-433 TreePath\n-434 >::value\n-435 >::type type;\n-436\n-437 };\n-438\n-440 template\n-441 struct accumulate_type\n-442 : public\n-accumulate_type_generic_composite_node\n-443 {};\n-444\n-446 template\n-447 struct\n-accumulate_type\n-448 : public\n-accumulate_type_generic_composite_node\n-449 {};\n-450\n-451 } // anonymous namespace\n-452\n-453\n-461 template<\n-462 typename Functor,\n-463 typename Reduction,\n-464 typename StartType,\n-465 typename ParentChildReduction = Reduction,\n-466 typename ReductionAlgorithm = flattened_reduction\n-467 >\n-_\b4_\b6_\b8 struct _\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by\n-469 {\n-470\n-_\b4_\b9_\b8 typedef Functor _\bf_\bu_\bn_\bc_\bt_\bo_\br;\n-499\n-_\b5_\b1_\b9 typedef Reduction _\bs_\bi_\bb_\bl_\bi_\bn_\bg_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n-520\n-_\b5_\b2_\b7 typedef ParentChildReduction _\bp_\ba_\br_\be_\bn_\bt_\b__\bc_\bh_\bi_\bl_\bd_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n-528\n-_\b5_\b3_\b5 typedef StartType _\bs_\bt_\ba_\br_\bt_\b__\bt_\by_\bp_\be;\n-536\n-_\b5_\b4_\b1 typedef ReductionAlgorithm _\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b__\bs_\bt_\br_\ba_\bt_\be_\bg_\by;\n-542 };\n-543\n-544\n-546\n-554 template\n-_\b5_\b5_\b5 struct _\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bT_\by_\bp_\be\n-556 {\n-557\n-559 typedef typename accumulate_type<\n-560 Tree,\n-561 Policy,\n-562 typename Policy::start_type,\n-563 _\bH_\by_\bb_\br_\bi_\bd_\bT_\br_\be_\be_\bP_\ba_\bt_\bh_\b<_\b>,\n-564 _\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bT_\br_\be_\be_\b>\n-_\b5_\b6_\b5 >::type _\bt_\by_\bp_\be;\n-566\n-567 };\n-568\n-569\n-570\n-571\n-572\n-573 /***************************************************/\n-574\n-_\b5_\b7_\b5 namespace Experimental {\n-576 namespace Impl {\n-577\n-579 template::isLeaf, int> = 0>\n-581 auto hybridApplyToTree(T&& tree, TreePath _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, V&& visitor, U&&\n-current_val)\n-582 {\n-583 return visitor.leaf(tree, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, std::forward(current_val));\n-584 }\n-585\n-587 template::isLeaf, int> = 0>\n-589 auto hybridApplyToTree(T&& tree, TreePath _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, V&& visitor, U&&\n-current_val)\n-590 {\n-591 using Tree = std::remove_reference_t;\n-592 using Visitor = std::remove_reference_t;\n-593 auto pre_val = visitor.pre(tree, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, std::forward(current_val));\n-594\n-595 // check which type of traversal is supported by the tree\n-596 using allowDynamicTraversal = Dune::Std::is_detected;\n-597 using allowStaticTraversal = Dune::Std::is_detected;\n-598\n-599 // the tree must support either dynamic or static traversal\n-600 static_assert(allowDynamicTraversal::value || allowStaticTraversal::value);\n-601\n-602 // the visitor may specify preferred dynamic traversal\n-603 using preferDynamicTraversal = std::bool_constant;\n-604\n-605 // declare rule that applies visitor and current value to a child i.\n-Returns next value\n-606 auto apply_i = [&](auto&& value, const auto& i){\n-607 auto&& _\bc_\bh_\bi_\bl_\bd = tree.child(i);\n-608 using _\bC_\bh_\bi_\bl_\bd = std::decay_t;\n-609\n-610 auto val_before = visitor.beforeChild(tree, _\bc_\bh_\bi_\bl_\bd, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, i, std::move\n-(value));\n-611\n-612 // visits between children\n-613 auto val_in = Hybrid::ifElse(\n-614 Hybrid::equal_to(i,Indices::_0),\n-615 [&](auto id){return std::move(val_before);},\n-616 [&](auto id){return visitor.in(tree, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, std::move(val_before));}\n-617 );\n-618\n-619 constexpr bool visitChild = Visitor::template\n-VisitChild::value;\n-620 auto val_visit = [&](){\n-621 if constexpr (visitChild) {\n-622 auto childTreePath = _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk(_\bt_\br_\be_\be_\bP_\ba_\bt_\bh, i);\n-623 return hybridApplyToTree(_\bc_\bh_\bi_\bl_\bd, childTreePath, visitor, std::move(val_in));\n-624 }\n-625 else\n-626 return std::move(val_in);\n-627 }();\n-628\n-629 return visitor.afterChild(tree, _\bc_\bh_\bi_\bl_\bd, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, i, std::move(val_visit));\n-630 };\n-631\n-632 // apply visitor to children\n-633 auto in_val = [&](){\n-634 if constexpr (allowStaticTraversal::value && not preferDynamicTraversal::\n-value) {\n-635 // get list of static indices\n-636 auto indices = std::make_index_sequence{};\n-637\n-638 // unfold apply_i left to right\n-639 return unpackIntegerSequence([&](auto... i) {\n-659 return left_fold(std::move(apply_i),std::move(pre_val), i...);\n-660 }, indices);\n-661\n-662 } else {\n-663 // unfold first child to get type\n-664 auto i_val = apply_i(std::move(pre_val),std::size_t{0});\n-665 // dynamically loop rest of the children to accumulate remindng values\n-666 for(std::size_t i = 1; i < tree.degree(); i++)\n-667 i_val = apply_i(i_val,i);\n-668 return i_val;\n-669 }\n-670 }();\n-671\n-672 return visitor.post(tree, _\bt_\br_\be_\be_\bP_\ba_\bt_\bh, in_val);\n-673 }\n-674\n-675 }\n-676\n-700 template\n-_\b7_\b0_\b1 auto hybridApplyToTree(Tree&& tree, Visitor&& visitor, Init&& init)\n-702 {\n-703 return Impl::hybridApplyToTree(tree, _\bh_\by_\bb_\br_\bi_\bd_\bT_\br_\be_\be_\bP_\ba_\bt_\bh(), visitor, init);\n-704 }\n-705\n-706 } // namespace Experimental\n-707\n-709 } // namespace TypeTree\n-710} //namespace Dune\n-711\n-712#endif // DUNE_TYPETREE_ACCUMULATE_STATIC_HH\n-_\bc_\bh_\bi_\bl_\bd_\b__\br_\be_\bs_\bu_\bl_\bt\n-static const result_type child_result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:156\n+91\n+92 } // namespace TypeTree\n+93} //namespace Dune\n+94\n+95#endif // DUNE_TYPETREE_TRAVERSALUTILITIES_HH\n+_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn\n+R _reduction\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversalutilities.hh:49\n+_\b__\bf_\bu_\bn_\bc_\bt_\bo_\br\n+F _functor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversalutilities.hh:48\n+_\bt_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be\n+static const TreePathType::Type treePathType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversalutilities.hh:32\n+_\b__\bv_\ba_\bl_\bu_\be\n+ResultType _value\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversalutilities.hh:50\n _\br_\be_\bs_\bu_\bl_\bt\n static const result_type result\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:113\n-_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b._\bh_\bh\n-_\bn_\bo_\bd_\be_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh\n-_\bn_\bo_\bd_\be_\bt_\ba_\bg_\bs_\b._\bh_\bh\n-_\bt_\br_\be_\be_\bp_\ba_\bt_\bh_\b._\bh_\bh\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd\n-typename impl::_Child< Node, indices... >::type Child\n-Template alias for the type of a child node given by a list of child indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn childextraction.hh:225\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bc_\bh_\bi_\bl_\bd\n-ImplementationDefined child(Node &&node, Indices... indices)\n-Extracts the child of a node given by a sequence of compile-time and run-time\n-indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn childextraction.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bN_\bo_\bd_\be_\bT_\ba_\bg\n-typename std::decay_t< Node >::NodeTag NodeTag\n-Returns the node tag of the given Node.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn nodeinterface.hh:70\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bu_\bs_\bh_\b__\bb_\ba_\bc_\bk\n-constexpr HybridTreePath< T..., std::size_t > push_back(const HybridTreePath<\n-T... > &tp, std::size_t i)\n-Appends a run time index to a HybridTreePath.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:416\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bh_\by_\bb_\br_\bi_\bd_\bT_\br_\be_\be_\bP_\ba_\bt_\bh\n-constexpr auto hybridTreePath(const T &... t)\n-Constructs a new HybridTreePath from the given indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:312\n+_\bt_\br_\ba_\bv_\be_\br_\bs_\ba_\bl_\b._\bh_\bh\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\bO_\bv_\be_\br_\bL_\be_\ba_\bf_\bs\n+ResultType reduceOverLeafs(const Tree &tree, F functor, R reduction, ResultType\n+startValue)\n+Calculate a quantity as a reduction over the leaf nodes of a TypeTree.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversalutilities.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bp_\bp_\bl_\by_\bT_\bo_\bT_\br_\be_\be\n+void applyToTree(Tree &&tree, Visitor &&visitor)\n+Apply visitor to TypeTree.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn traversal.hh:239\n _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bt_\br_\be_\be_\bP_\ba_\bt_\bh\n constexpr auto treePath(const T &... t)\n Constructs a new HybridTreePath from the given indices.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:326\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:16\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bo_\br_\b_\n-Statically combine two values of type result_type using ||.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:27\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bo_\br_\b__\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bo_\br_\b__\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:31\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bn_\bd_\b_\n-Statically combine two values of type result_type using &&.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:38\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bn_\bd_\b__\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:41\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\ba_\bn_\bd_\b__\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:42\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bl_\bu_\bs\n-Statically combine two values of type result_type using +.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:49\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bl_\bu_\bs_\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bp_\bl_\bu_\bs_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:53\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\bu_\bs\n-Statically combine two values of type result_type using -.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:60\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\bu_\bs_\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:63\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\bu_\bs_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:64\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by\n-Statically combine two values of type result_type using *.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by_\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:74\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\by_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn\n-Statically combine two values of type result_type by returning their minimum.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:82\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\bi_\bn_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\ba_\bx\n-Statically combine two values of type result_type by returning their maximum.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:93\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\ba_\bx_\b:_\b:_\br_\be_\bd_\bu_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:96\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bm_\ba_\bx_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:97\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be\n-Statically accumulate a value over the nodes of a TypeTree.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt_\b__\bt_\by_\bp_\be\n-Functor::result_type result_type\n-The result type of the computation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:265\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\b:_\b:_\br_\be_\bs_\bu_\bl_\bt\n-static const result_type result\n-The accumulated result of the computation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:268\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:469\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b:_\b:_\bp_\ba_\br_\be_\bn_\bt_\b__\bc_\bh_\bi_\bl_\bd_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn\n-ParentChildReduction parent_child_reduction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:527\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b:_\b:_\bf_\bu_\bn_\bc_\bt_\bo_\br\n-Functor functor\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:498\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b:_\b:_\bs_\bt_\ba_\br_\bt_\b__\bt_\by_\bp_\be\n-StartType start_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:535\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b:_\b:_\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn_\b__\bs_\bt_\br_\ba_\bt_\be_\bg_\by\n-ReductionAlgorithm reduction_strategy\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:541\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\by_\bp_\be_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bP_\bo_\bl_\bi_\bc_\by_\b:_\b:_\bs_\bi_\bb_\bl_\bi_\bn_\bg_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn\n-Reduction sibling_reduction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:519\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bT_\by_\bp_\be\n-Statically accumulate a type over the nodes of a TypeTree.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:556\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\be_\bT_\by_\bp_\be_\b:_\b:_\bt_\by_\bp_\be\n-accumulate_type< Tree, Policy, typenamePolicy::start_type, HybridTreePath<>,\n-NodeTag< Tree > >::type type\n-The accumulated result of the computation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn accumulate_static.hh:565\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bH_\by_\bb_\br_\bi_\bd_\bT_\br_\be_\be_\bP_\ba_\bt_\bh\n-A hybrid version of TreePath that supports both compile time and run time\n-indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:158\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:106\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bT_\br_\be_\be_\bP_\ba_\bt_\bh_\bT_\by_\bp_\be_\b:_\b:_\bd_\by_\bn_\ba_\bm_\bi_\bc\n+@ dynamic\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn treepath.hh:106\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html", "source2": "./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-typetree: filteredcompositenode.hh File Reference \n+dune-typetree: exceptions.hh File Reference \n \n \n \n \n \n \n \n@@ -72,44 +72,39 @@\n dune typetree \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+\n+\n \n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n-\n-\n+\n+\n+\n+\n+\n+\n
\n \n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n- 107 template<typename Node, typename Functor, typename Reduction, typename Functor::result_type current_value, typename TreePath, bool doVisit>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 118 template<typename Node, typename Functor, typename Reduction, typename Functor::result_type current_value, typename TreePath>
\n-\n-\n-\n-\n-\n- 124 static const result_type result = Reduction::template reduce<current_value,Functor::template visit<Node,TreePath>::result>::result;
\n-\n-\n-\n- 129 template<typename Tree, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath, typename Tag>
\n-\n-\n- 133 template<typename LeafNode, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath>
\n- 134 struct accumulate_value<LeafNode,Functor,Reduction,ParentChildReduction,current_value,TreePath,LeafNodeTag>
\n-\n-\n-\n-\n-\n-\n- 141 accumulate_node_helper<LeafNode,Functor,Reduction,current_value,TreePath,Functor::template doVisit<LeafNode,TreePath>::value>::result;
\n-\n-\n-\n- 146 template<typename Node, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath, std::size_t i, std::size_t n>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 156 static const result_type child_result = accumulate_value<child,Functor,Reduction,ParentChildReduction,current_value,child_tree_path,NodeTag<child>>::result;
\n-\n- 158 static const result_type result = accumulate_over_children<Node,Functor,Reduction,ParentChildReduction,child_result,TreePath,i+1,n>::result;
\n-\n-\n-\n- 163 template<typename Node, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath, std::size_t n>
\n- 164 struct accumulate_over_children<Node,Functor,Reduction,ParentChildReduction,current_value,TreePath,n,n>
\n-\n-\n-\n-\n-\n-\n-\n-\n- 175 template<typename Node, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath>
\n-\n-\n-\n-\n-\n- 181 static const result_type child_result = accumulate_over_children<Node,Functor,Reduction,ParentChildReduction,current_value,TreePath,0,StaticDegree<Node>::value>::result;
\n-\n-\n- 184 accumulate_node_helper<Node,Functor,ParentChildReduction,child_result,TreePath,Functor::template doVisit<Node,TreePath>::value>::result;
\n-\n-\n-\n-\n- 190 template<typename PowerNode, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath>
\n- 191 struct accumulate_value<PowerNode,Functor,Reduction,ParentChildReduction,current_value,TreePath,PowerNodeTag>
\n- 192 : public accumulate_value_generic_composite_node<PowerNode,Functor,Reduction,ParentChildReduction,current_value,TreePath>
\n-\n-\n- 196 template<typename CompositeNode, typename Functor, typename Reduction, typename ParentChildReduction, typename Functor::result_type current_value, typename TreePath>
\n- 197 struct accumulate_value<CompositeNode,Functor,Reduction,ParentChildReduction,current_value,TreePath,CompositeNodeTag>
\n- 198 : public accumulate_value_generic_composite_node<CompositeNode,Functor,Reduction,ParentChildReduction,current_value,TreePath>
\n-\n-\n-\n-\n-\n- 260 template<typename Tree, typename Functor, typename Reduction, typename Functor::result_type startValue, typename ParentChildReduction = Reduction>
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 268 static const result_type result = accumulate_value<Tree,Functor,Reduction,ParentChildReduction,startValue,HybridTreePath<>,NodeTag<Tree>>::result;
\n-\n-\n- 286 template<typename Node, typename Functor, typename Reduction, typename current_type, typename TreePath, bool doVisit>
\n-\n-\n-\n-\n-\n-\n-\n- 295 template<typename Node, typename Functor, typename Reduction, typename current_type, typename TreePath>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 310 template<typename Tree, typename Policy, typename current_type, typename TreePath, typename Tag>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 334 template<typename current_type, typename tree_path, typename start_type, typename reduction_strategy>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 367 template<typename Node, typename Policy, typename current_type, typename TreePath, std::size_t i, std::size_t n>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 401 template<typename Node, typename Policy, typename current_type, typename TreePath, std::size_t n>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n- 603 using preferDynamicTraversal = std::bool_constant<Visitor::treePathType == TreePathType::dynamic>;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-typename impl::_Child< Node, indices... >::type Child
Template alias for the type of a child node given by a list of child indices.
Definition childextraction.hh:225
ImplementationDefined child(Node &&node, Indices... indices)
Extracts the child of a node given by a sequence of compile-time and run-time indices.
Definition childextraction.hh:128
typename std::decay_t< Node >::NodeTag NodeTag
Returns the node tag of the given Node.
Definition nodeinterface.hh:70
constexpr HybridTreePath< T..., std::size_t > push_back(const HybridTreePath< T... > &tp, std::size_t i)
Appends a run time index to a HybridTreePath.
Definition treepath.hh:416
constexpr auto hybridTreePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:312
ResultType reduceOverLeafs(const Tree &tree, F functor, R reduction, ResultType startValue)
Calculate a quantity as a reduction over the leaf nodes of a TypeTree.
Definition traversalutilities.hh:83
void applyToTree(Tree &&tree, Visitor &&visitor)
Apply visitor to TypeTree.
Definition traversal.hh:239
constexpr auto treePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:326
Definition accumulate_static.hh:16
Statically combine two values of type result_type using ||.
Definition accumulate_static.hh:27
Definition accumulate_static.hh:30
static const result_type result
Definition accumulate_static.hh:31
Statically combine two values of type result_type using &&.
Definition accumulate_static.hh:38
Definition accumulate_static.hh:41
static const result_type result
Definition accumulate_static.hh:42
Statically combine two values of type result_type using +.
Definition accumulate_static.hh:49
Definition accumulate_static.hh:52
static const result_type result
Definition accumulate_static.hh:53
Statically combine two values of type result_type using -.
Definition accumulate_static.hh:60
Definition accumulate_static.hh:63
static const result_type result
Definition accumulate_static.hh:64
Statically combine two values of type result_type using *.
Definition accumulate_static.hh:71
Definition accumulate_static.hh:74
static const result_type result
Definition accumulate_static.hh:75
Statically combine two values of type result_type by returning their minimum.
Definition accumulate_static.hh:82
Definition accumulate_static.hh:85
static const result_type result
Definition accumulate_static.hh:86
Statically combine two values of type result_type by returning their maximum.
Definition accumulate_static.hh:93
Definition accumulate_static.hh:96
static const result_type result
Definition accumulate_static.hh:97
Statically accumulate a value over the nodes of a TypeTree.
Definition accumulate_static.hh:262
Functor::result_type result_type
The result type of the computation.
Definition accumulate_static.hh:265
static const result_type result
The accumulated result of the computation.
Definition accumulate_static.hh:268
Definition accumulate_static.hh:469
ParentChildReduction parent_child_reduction
Definition accumulate_static.hh:527
StartType start_type
Definition accumulate_static.hh:535
ReductionAlgorithm reduction_strategy
Definition accumulate_static.hh:541
Reduction sibling_reduction
Definition accumulate_static.hh:519
Statically accumulate a type over the nodes of a TypeTree.
Definition accumulate_static.hh:556
accumulate_type< Tree, Policy, typenamePolicy::start_type, HybridTreePath<>, NodeTag< Tree > >::type type
The accumulated result of the computation.
Definition accumulate_static.hh:565
A hybrid version of TreePath that supports both compile time and run time indices.
Definition treepath.hh:158
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,698 +1,109 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-accumulate_static.hh\n+traversalutilities.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n 5\n-6#ifndef DUNE_TYPETREE_ACCUMULATE_STATIC_HH\n-7#define DUNE_TYPETREE_ACCUMULATE_STATIC_HH\n+6#ifndef DUNE_TYPETREE_TRAVERSALUTILITIES_HH\n+7#define DUNE_TYPETREE_TRAVERSALUTILITIES_HH\n 8\n-9#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- filteredcompositenode.hh File Reference
exceptions.hh File Reference
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+\n+
\n\n \n
\n
\n-\n+
\n \n #include <memory>\n-
#include <tuple>\n-
#include <type_traits>\n-
#include <dune/typetree/nodetags.hh>\n-
#include <dune/typetree/filters.hh>\n-
#include <dune/common/shared_ptr.hh>\n-
#include <dune/common/typetraits.hh>\n-
#include <dune/common/indices.hh>\n+\n+
TypeTree-specific exceptions. \n+More...
\n+#include <dune/common/exceptions.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::TypeTree::FilteredCompositeNode< Node, Filter > |
| Base class for composite nodes representing a filtered view on an underlying composite node. More... | |
| struct | Dune::TypeTree::FilteredCompositeNode< Node, Filter >::Child< k > |
| Access to the type and storage type of the i-th child. More... | |
| class | Dune::TypeTree::Exception |
| Base class for all TypeTree exceptions. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
Detailed Description
\n+TypeTree-specific exceptions.
\n+\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,24 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-filteredcompositenode.hh File Reference\n-#include \n- \n+ \n
\n filteredcompositenode.hh
exceptions.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
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+\n 89 static const bool nodeIsConst = std::is_const<typename std::remove_reference<Node>::type>::value;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-Definition accumulate_static.hh:16
Base class for composite nodes representing a filtered view on an underlying composite node.
Definition filteredcompositenode.hh:83
auto childStorage(index_constant< k >={}) const
Returns the storage of the k-th child (const version).
Definition filteredcompositenode.hh:181
static constexpr auto degree()
Definition filteredcompositenode.hh:117
mapped_children::NodeStorage NodeStorage
The type used for storing the children.
Definition filteredcompositenode.hh:103
void setChild(ChildType &&child, typename std::enable_if< lazy_enable< k >::value, void * >::type=0)
Sets the k-th child to the passed-in value.
Definition filteredcompositenode.hh:188
static const bool isLeaf
Mark this class as non leaf in the dune-typetree.
Definition filteredcompositenode.hh:109
const Node & unfiltered() const
Returns the unfiltered node (const version).
Definition filteredcompositenode.hh:215
static const bool isComposite
Mark this class as a composite in the dune-typetree.
Definition filteredcompositenode.hh:115
std::enable_if< enabled, std::shared_ptr< Node > >::type unfilteredStorage()
Returns the storage object of the unfiltered node.
Definition filteredcompositenode.hh:226
static const bool isPower
Mark this class as a non power in the dune-typetree.
Definition filteredcompositenode.hh:112
FilteredCompositeNode(Node &node)
Initialize the CompositeNode with a copy of the passed-in storage type.
Definition filteredcompositenode.hh:253
FilteredCompositeNode(std::shared_ptr< Node > node)
Initialize the CompositeNode with copies of the passed in Storage objects.
Definition filteredcompositenode.hh:248
auto childStorage(index_constant< k >={})
Returns the storage of the k-th child.
Definition filteredcompositenode.hh:171
const auto & child(index_constant< k >={}) const
Returns the k-th child (const version).
Definition filteredcompositenode.hh:160
auto & child(index_constant< k >={})
Returns the k-th child.
Definition filteredcompositenode.hh:150
CompositeNodeTag NodeTag
The type tag that describes a CompositeNode.
Definition filteredcompositenode.hh:100
mapped_children::ChildTypes ChildTypes
A tuple storing the types of all children.
Definition filteredcompositenode.hh:106
std::enable_if< enabled, Node & >::type unfiltered()
Returns the unfiltered node.
Definition filteredcompositenode.hh:206
std::shared_ptr< const Node > unfilteredStorage() const
Returns the storage object of the unfiltered node (const version).
Definition filteredcompositenode.hh:235
Access to the type and storage type of the i-th child.
Definition filteredcompositenode.hh:124
OriginalChild::type type
The type of the child.
Definition filteredcompositenode.hh:138
OriginalChild::Type Type
The type of the child.
Definition filteredcompositenode.hh:135
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,333 +1,37 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-filteredcompositenode.hh\n+exceptions.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n-5\n-6#ifndef DUNE_TYPETREE_FILTEREDCOMPOSITENODE_HH\n-7#define DUNE_TYPETREE_FILTEREDCOMPOSITENODE_HH\n-8\n-9#include