/usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/dune-typetree_2.9.0-2.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/dune-typetree_2.9.0-2.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/dune-typetree_2.9.0-2.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/b1/dune-typetree_2.9.0-2_i386.changes /srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/b2/dune-typetree_2.9.0-2

⊟

3.37 MB

/srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/b1/dune-typetree_2.9.0-2_i386.changes vs.

/srv/reproducible-results/rbuild-debian/r-b-build.vGuytCpu/b2/dune-typetree_2.9.0-2_i386.changes ¶

⊟

309 B

Files ¶

⊟

3.37 MB

libdune-typetree-doc_2.9.0-2_all.deb ¶

⊟

367 B

file list ¶

⊟

98.0 B

control.tar.xz ¶

⊟

70.0 B

control.tar ¶

⊟

48.0 B

./md5sums ¶

⊟

30.0 B

./md5sums ¶

Files differ

⊟

3.37 MB

data.tar.xz ¶

⊟

3.37 MB

data.tar ¶

⊟

19.8 KB

file list ¶

⊟

17.7 KB

⊟

3.38 KB

⊟

129 KB

⊟

22.4 KB

⊟

21.4 KB

⊟

4.19 KB

⊟

160 KB

⊟

28.3 KB

⊟

23.8 KB

⊟

4.35 KB

⊟

119 KB

⊟

20.9 KB

⊟

14.7 KB

⊟

3.07 KB

⊟

76.8 KB

⊟

14.2 KB

⊟

7.02 KB

⊟

1.3 KB

⊟

108 KB

⊟

22.4 KB

⊟

17.1 KB

⊟

3.11 KB

⊟

150 KB

⊟

25.9 KB

⊟

6.05 KB

⊟

1.01 KB

⊟

95.3 KB

⊟

17.1 KB

⊟

9.45 KB

⊟

1.49 KB

⊟

51.9 KB

⊟

7.99 KB

⊟

18.3 KB

⊟

3.45 KB

⊟

125 KB

⊟

22.3 KB

⊟

8.23 KB

⊟

1.64 KB

⊟

98.0 KB

⊟

17.6 KB

⊟

9.13 KB

⊟

1.64 KB

⊟

105 KB

⊟

19.0 KB

⊟

40.3 KB

⊟

9.73 KB

⊟

112 KB

⊟

19.2 KB

⊟

18.1 KB

⊟

3.07 KB

⊟

112 KB

⊟

19.8 KB

⊟

12.8 KB

⊟

2.47 KB

⊟

98.9 KB

⊟

16.8 KB

⊟

5.98 KB

⊟

926 B

⊟

10.1 KB

⊟

1.62 KB

⊟

16.0 KB

⊟

2.96 KB

⊟

72.3 KB

⊟

12.5 KB

⊟

9.52 KB

⊟

1.39 KB

⊟

23.6 KB

⊟

3.77 KB

⊟

18.4 KB

⊟

3.76 KB

⊟

71.4 KB

⊟

13.2 KB

⊟

44.3 KB

⊟

11.0 KB

⊟

170 KB

⊟

31.6 KB

⊟

10.8 KB

⊟

2.11 KB

⊟

73.8 KB

⊟

14.6 KB

⊟

9.41 KB

⊟

1.98 KB

⊟

77.0 KB

⊟

15.1 KB

⊟

5.76 KB

⊟

1.01 KB

⊟

67.7 KB

⊟

12.0 KB

⊟

26.7 KB

⊟

5.41 KB

⊟

130 KB

⊟

23.2 KB

⊟

7.87 KB

⊟

1.46 KB

⊟

145 KB

⊟

28.9 KB

⊟

23.1 KB

⊟

4.53 KB

⊟

140 KB

⊟

25.3 KB

⊟

9.54 KB

⊟

1.6 KB

⊟

71.8 KB

⊟

12.8 KB

⊟

7.63 KB

⊟

1.5 KB

⊟

19.2 KB

⊟

3.5 KB

⊟

1.96 KB

⊟

2.02 KB

⊟

1.92 KB

⊟

2.04 KB

⊟

1.93 KB

⊟

2.02 KB

⊟

1.92 KB

⊟

2.02 KB

⊟

1.93 KB

⊟

2.03 KB

⊟

1.93 KB

⊟

2.05 KB

⊟

1.94 KB

⊟

2.05 KB

⊟

1.94 KB

⊟

2.3 KB

⊟

2.54 KB

⊟

2.42 KB

⊟

2.08 KB

⊟

2.53 KB

⊟

2.52 KB

⊟

1.85 KB

⊟

2.15 KB

⊟

2.31 KB

⊟

1.61 KB

⊟

1.85 KB

⊟

2.45 KB

⊟

1.48 KB

⊟

1.5 KB

⊟

1.96 KB

⊟

2.1 KB

⊟

2.16 KB

⊟

2.05 KB

⊟

2.08 KB

⊟

2.23 KB

⊟

2.59 KB

⊟

1.91 KB

⊟

2.02 KB

⊟

2.02 KB

⊟

2.59 KB

⊟

2.5 KB

⊟

6.21 KB

⊟

15.1 KB

⊟

2.54 KB

⊟

4.8 KB

⊟

11.9 KB

⊟

2.52 KB

⊟

4.66 KB

⊟

11.7 KB

⊟

2.32 KB

⊟

2.48 KB

⊟

1.34 KB

⊟

1.35 KB

⊟

1.39 KB

⊟

1.36 KB

⊟

1.85 KB

⊟

3.31 KB

⊟

1.86 KB

⊟

2.99 KB

⊟

1.86 KB

⊟

2.99 KB

⊟

2.08 KB

⊟

2.21 KB

⊟

2.03 KB

⊟

2.18 KB

⊟

2.29 KB

⊟

2.11 KB

⊟

1.21 KB

⊟

1.92 KB

⊟

2.28 KB

⊟

2.25 KB

⊟

2.31 KB

⊟

2.58 KB

⊟

2.13 KB

⊟

6.36 KB

⊟

2.14 KB

⊟

4.65 KB

⊟

2.14 KB

⊟

4.5 KB

⊟

2.6 KB

⊟

2.2 KB

⊟

2.32 KB

⊟

1.99 KB

⊟

2.37 KB

⊟

1000 B

⊟

1010 B

⊟

1010 B

⊟

1.01 KB

⊟

1000 B

⊟

1.04 KB

⊟

1000 B

⊟

1010 B

⊟

2.01 KB

⊟

2.1 KB

⊟

2.1 KB

⊟

1.98 KB

⊟

2.4 KB

⊟

2.16 KB

⊟

2.07 KB

⊟

2.46 KB

⊟

2.1 KB

⊟

2.15 KB

⊟

853 B

⊟

1.8 KB

⊟

1.98 KB

⊟

1.82 KB

⊟

1.82 KB

⊟

2.0 KB

⊟

1.85 KB

⊟

1.83 KB

⊟

1.83 KB

⊟

2.0 KB

⊟

1.83 KB

⊟

1.83 KB

⊟

2.02 KB

⊟

1.86 KB

⊟

1.84 KB

⊟

1.83 KB

⊟

1.82 KB

⊟

1.31 KB

⊟

1.82 KB

⊟

1.79 KB

⊟

2.18 KB

⊟

1.89 KB

⊟

2.51 KB

⊟

1.96 KB

⊟

1.98 KB

⊟

1.99 KB

⊟

2.89 KB

⊟

2.06 KB

⊟

2.41 KB

⊟

2.04 KB

⊟

1.96 KB

⊟

2.37 KB

⊟

1.89 KB

⊟

1.97 KB

⊟

1.94 KB

⊟

2.02 KB

⊟

1.94 KB

⊟

1.94 KB

⊟

1.97 KB

⊟

15.6 KB

⊟

33.7 KB

⊟

33.6 KB

⊟

33.5 KB

⊟

16.5 KB

⊟

2.13 KB

⊟

2.04 KB


Offset 1, 3 lines modified		Offset 1, 3 lines modified

1	·800eb722c270d1f75624a663298f0ff5·38684·libdevel·optional·libdune-typetree-dev_2.9.0-2_i386.deb	1	·800eb722c270d1f75624a663298f0ff5·38684·libdevel·optional·libdune-typetree-dev_2.9.0-2_i386.deb
2	·~~c61b775c1~~f8~~1ee5e325fd~~ca1~~4e64f7~~b1·81~~1880~~·doc·optional·libdune-typetree-doc_2.9.0-2_all.deb	2	·8bd90d0b9fcb99dfd194c12abd2db911·812096·doc·optional·libdune-typetree-doc_2.9.0-2_all.deb


Offset 1, 3 lines modified		Offset 1, 3 lines modified
1	-rw-r--r--···0········0········0········4·2023-01-12·22:23:12.000000·debian-binary	1	-rw-r--r--···0········0········0········4·2023-01-12·22:23:12.000000·debian-binary
2	-rw-r--r--···0········0········0·····9580·2023-01-12·22:23:12.000000·control.tar.xz	2	-rw-r--r--···0········0········0·····9580·2023-01-12·22:23:12.000000·control.tar.xz
3	-rw-r--r--···0········0········0···802~~108~~·2023-01-12·22:23:12.000000·data.tar.xz	3	-rw-r--r--···0········0········0···802324·2023-01-12·22:23:12.000000·data.tar.xz


Offset 5, 68 lines modified		Offset 5, 68 lines modified
5	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/	5	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/
6	-rw-r--r--···0·root·········(0)·root·········(0)······758·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/changelog.Debian.gz	6	-rw-r--r--···0·root·········(0)·root·········(0)······758·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/changelog.Debian.gz
7	-rw-r--r--···0·root·········(0)·root·········(0)·····2362·2022-11-16·12:31:04.000000·./usr/share/doc/libdune-typetree-doc/changelog.gz	7	-rw-r--r--···0·root·········(0)·root·········(0)·····2362·2022-11-16·12:31:04.000000·./usr/share/doc/libdune-typetree-doc/changelog.gz
8	-rw-r--r--···0·root·········(0)·root·········(0)·····3031·2023-01-12·15:07:35.000000·./usr/share/doc/libdune-typetree-doc/copyright	8	-rw-r--r--···0·root·········(0)·root·········(0)·····3031·2023-01-12·15:07:35.000000·./usr/share/doc/libdune-typetree-doc/copyright
9	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/	9	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/
10	-rw-r--r--···0·root·········(0)·root·········(0)·····2877·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00002.html	10	-rw-r--r--···0·root·········(0)·root·········(0)·····2877·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00002.html
11	-rw-r--r--···0·root·········(0)·root·········(0)·····2875·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00005.html	11	-rw-r--r--···0·root·········(0)·root·········(0)·····2875·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00005.html
12	-rw-r--r--···0·root·········(0)·root·········(0)····10332·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008.html
13	-rw-r--r--···0·root·········(0)·root·········(0)····47176·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html
14	-rw-r--r--···0·root·········(0)·root·········(0)·····5996·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html
15	-rw-r--r--···0·root·········(0)·root·········(0)····67112·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011_source.html
16	-rw-r--r--···0·root·········(0)·root·········(0)····15101·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014.html
17	-rw-r--r--···0·root·········(0)·root·········(0)····51659·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014_source.html
18	-rw-r--r--···0·root·········(0)·root·········(0)····10780·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017.html
19	-rw-r--r--···0·root·········(0)·root·········(0)····54148·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017_source.html
20	-rw-r--r--···0·root·········(0)·root·········(0)·····3524·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020.html
21	-rw-r--r--···0·root·········(0)·root·········(0)·····5126·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020_source.html
22	-rw-r--r--···0·root·········(0)·root·········(0)····14818·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023.html
23	-rw-r--r--···0·root·········(0)·root·········(0)···100891·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023_source.html
24	-rw-r--r--···0·root·········(0)·root·········(0)·····5405·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026.html
25	-rw-r--r--···0·root·········(0)·root·········(0)····37677·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026_source.html
26	-rw-r--r--···0·root·········(0)·root·········(0)·····4951·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029.html
27	-rw-r--r--···0·root·········(0)·root·········(0)····30674·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029_source.html
28	-rw-r--r--···0·root·········(0)·root·········(0)·····4679·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032.html
29	-rw-r--r--···0·root·········(0)·root·········(0)·····8483·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032_source.html
30	-rw-r--r--···0·root·········(0)·root·········(0)·····5402·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035.html
31	-rw-r--r--···0·root·········(0)·root·········(0)····47700·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035_source.html
32	-rw-r--r--···0·root·········(0)·root·········(0)·····6765·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038.html
33	-rw-r--r--···0·root·········(0)·root·········(0)····26765·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038_source.html
34	-rw-r--r--···0·root·········(0)·root·········(0)·····5014·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041.html
35	-rw-r--r--···0·root·········(0)·root·········(0)·····6192·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html
36	-rw-r--r--···0·root·········(0)·root·········(0)·····5711·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044.html
37	-rw-r--r--···0·root·········(0)·root·········(0)····48067·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044_source.html
38	-rw-r--r--···0·root·········(0)·root·········(0)····11032·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047.html
39	-rw-r--r--···0·root·········(0)·root·········(0)····42298·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047_source.html
40	-rw-r--r--···0·root·········(0)·root·········(0)·····6035·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050.html
41	-rw-r--r--···0·root·········(0)·root·········(0)·····8498·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050_source.html
42	-rw-r--r--···0·root·········(0)·root·········(0)·····8617·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053.html
43	-rw-r--r--···0·root·········(0)·root·········(0)····19660·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_source.html
44	-rw-r--r--···0·root·········(0)·root·········(0)·····7306·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html
45	-rw-r--r--···0·root·········(0)·root·········(0)····17090·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html
46	-rw-r--r--···0·root·········(0)·root·········(0)····14575·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html
47	-rw-r--r--···0·root·········(0)·root·········(0)····55719·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059_source.html
48	-rw-r--r--···0·root·········(0)·root·········(0)····31519·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062.html
49	-rw-r--r--···0·root·········(0)·root·········(0)····92477·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062_source.html
50	-rw-r--r--···0·root·········(0)·root·········(0)·····7200·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065.html
51	-rw-r--r--···0·root·········(0)·root·········(0)····39570·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html
52	-rw-r--r--···0·root·········(0)·root·········(0)·····8538·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html
53	-rw-r--r--···0·root·········(0)·root·········(0)····54968·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html
54	-rw-r--r--···0·root·········(0)·root·········(0)·····4927·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071.html
55	-rw-r--r--···0·root·········(0)·root·········(0)····13856·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071_source.html
56	-rw-r--r--···0·root·········(0)·root·········(0)····17085·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074.html
57	-rw-r--r--···0·root·········(0)·root·········(0)····72652·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074_source.html
58	-rw-r--r--···0·root·········(0)·root·········(0)·····6687·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077.html
59	-rw-r--r--···0·root·········(0)·root·········(0)····86739·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html
60	-rw-r--r--···0·root·········(0)·root·········(0)·····9529·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html	12	-rw-r--r--···0·root·········(0)·root·········(0)·····9529·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008.html
61	-rw-r--r--···0·root·········(0)·root·········(0)····67275·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html	13	-rw-r--r--···0·root·········(0)·root·········(0)····67275·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html
62	-rw-r--r--···0·root·········(0)·root·········(0)·····5851·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html	14	-rw-r--r--···0·root·········(0)·root·········(0)····17085·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html
63	-rw-r--r--···0·root·········(0)·root·········(0)····~~48376~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083_source.html	15	-rw-r--r--···0·root·········(0)·root·········(0)····72652·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011_source.html
		16	-rw-r--r--···0·root·········(0)·root·········(0)····10780·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014.html
		17	-rw-r--r--···0·root·········(0)·root·········(0)····54148·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014_source.html
64	-rw-r--r--···0·root·········(0)·root·········(0)·····6712·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086.html	18	-rw-r--r--···0·root·········(0)·root·········(0)·····6712·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017.html
65	-rw-r--r--···0·root·········(0)·root·········(0)····14713·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086_source.html	19	-rw-r--r--···0·root·········(0)·root·········(0)····14713·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017_source.html
		20	-rw-r--r--···0·root·········(0)·root·········(0)·····6687·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020.html
		21	-rw-r--r--···0·root·········(0)·root·········(0)····86739·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020_source.html
		22	-rw-r--r--···0·root·········(0)·root·········(0)·····4951·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023.html
		23	-rw-r--r--···0·root·········(0)·root·········(0)····30674·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023_source.html
		24	-rw-r--r--···0·root·········(0)·root·········(0)·····5711·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026.html
		25	-rw-r--r--···0·root·········(0)·root·········(0)····48067·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026_source.html
		26	-rw-r--r--···0·root·········(0)·root·········(0)·····8617·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029.html
		27	-rw-r--r--···0·root·········(0)·root·········(0)····19660·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029_source.html
		28	-rw-r--r--···0·root·········(0)·root·········(0)····14818·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032.html
		29	-rw-r--r--···0·root·········(0)·root·········(0)···100891·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032_source.html
		30	-rw-r--r--···0·root·········(0)·root·········(0)·····7200·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035.html
		31	-rw-r--r--···0·root·········(0)·root·········(0)····39570·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035_source.html
		32	-rw-r--r--···0·root·········(0)·root·········(0)·····5996·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038.html
		33	-rw-r--r--···0·root·········(0)·root·········(0)····67112·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038_source.html
		34	-rw-r--r--···0·root·········(0)·root·········(0)····31519·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041.html
		35	-rw-r--r--···0·root·········(0)·root·········(0)····92477·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html
		36	-rw-r--r--···0·root·········(0)·root·········(0)····15101·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044.html
		37	-rw-r--r--···0·root·········(0)·root·········(0)····51659·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044_source.html
		38	-rw-r--r--···0·root·········(0)·root·········(0)·····5402·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047.html
		39	-rw-r--r--···0·root·········(0)·root·········(0)····47700·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047_source.html
		40	-rw-r--r--···0·root·········(0)·root·········(0)·····3524·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050.html
		41	-rw-r--r--···0·root·········(0)·root·········(0)·····5126·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050_source.html
		42	-rw-r--r--···0·root·········(0)·root·········(0)····10332·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053.html
		43	-rw-r--r--···0·root·········(0)·root·········(0)····47176·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_source.html
		44	-rw-r--r--···0·root·········(0)·root·········(0)·····6035·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html
		45	-rw-r--r--···0·root·········(0)·root·········(0)·····8498·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html
		46	-rw-r--r--···0·root·········(0)·root·········(0)·····4679·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html
		47	-rw-r--r--···0·root·········(0)·root·········(0)·····8483·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059_source.html
		48	-rw-r--r--···0·root·········(0)·root·········(0)·····8538·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062.html
		49	-rw-r--r--···0·root·········(0)·root·········(0)····54968·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062_source.html
		50	-rw-r--r--···0·root·········(0)·root·········(0)·····6765·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065.html
		51	-rw-r--r--···0·root·········(0)·root·········(0)····26765·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html
		52	-rw-r--r--···0·root·········(0)·root·········(0)·····4927·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html
		53	-rw-r--r--···0·root·········(0)·root·········(0)····13856·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html
		54	-rw-r--r--···0·root·········(0)·root·········(0)·····5851·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071.html
		55	-rw-r--r--···0·root·········(0)·root·········(0)····48376·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071_source.html
		56	-rw-r--r--···0·root·········(0)·root·········(0)····11032·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074.html
		57	-rw-r--r--···0·root·········(0)·root·········(0)····42298·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074_source.html
		58	-rw-r--r--···0·root·········(0)·root·········(0)·····5405·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077.html
		59	-rw-r--r--···0·root·········(0)·root·········(0)····37677·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html
		60	-rw-r--r--···0·root·········(0)·root·········(0)····14575·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html
		61	-rw-r--r--···0·root·········(0)·root·········(0)····55719·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html
		62	-rw-r--r--···0·root·········(0)·root·········(0)·····7306·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html
		63	-rw-r--r--···0·root·········(0)·root·········(0)····17090·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083_source.html
		64	-rw-r--r--···0·root·········(0)·root·········(0)·····5014·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086.html
		65	-rw-r--r--···0·root·········(0)·root·········(0)·····6192·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086_source.html
66	-rw-r--r--···0·root·········(0)·root·········(0)·····4066·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00089.html	66	-rw-r--r--···0·root·········(0)·root·········(0)·····4066·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00089.html
67	-rw-r--r--···0·root·········(0)·root·········(0)····16365·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00090.html	67	-rw-r--r--···0·root·········(0)·root·········(0)····16365·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00090.html
68	-rw-r--r--···0·root·········(0)·root·········(0)····11848·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00090.png	68	-rw-r--r--···0·root·········(0)·root·········(0)····11848·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00090.png
69	-rw-r--r--···0·root·········(0)·root·········(0)····40666·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00091.html	69	-rw-r--r--···0·root·········(0)·root·········(0)····40666·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00091.html
70	-rw-r--r--···0·root·········(0)·root·········(0)·····4072·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00091.png	70	-rw-r--r--···0·root·········(0)·root·········(0)·····4072·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00091.png
71	-rw-r--r--···0·root·········(0)·root·········(0)····21362·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00092.html	71	-rw-r--r--···0·root·········(0)·root·········(0)····21362·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00092.html
72	-rw-r--r--···0·root·········(0)·root·········(0)·····3049·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00092.png	72	-rw-r--r--···0·root·········(0)·root·········(0)·····3049·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00092.png
Offset 373, 15 lines modified		Offset 373, 15 lines modified
373	-rw-r--r--···0·root·········(0)·root·········(0)·····2364·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3_dep.png	373	-rw-r--r--···0·root·········(0)·root·········(0)·····2364·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3_dep.png
374	-rw-r--r--···0·root·········(0)·root·········(0)·····3482·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e69be5995c9f5d42bf491ae6f29600e.html	374	-rw-r--r--···0·root·········(0)·root·········(0)·····3482·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e69be5995c9f5d42bf491ae6f29600e.html
375	-rw-r--r--···0·root·········(0)·root·········(0)····12439·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9.html	375	-rw-r--r--···0·root·········(0)·root·········(0)····12439·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9.html
376	-rw-r--r--···0·root·········(0)·root·········(0)·····2095·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9_dep.png	376	-rw-r--r--···0·root·········(0)·root·········(0)·····2095·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9_dep.png
377	-rw-r--r--···0·root·········(0)·root·········(0)·····3478·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_e68e8157741866f444e17edd764ebbae.html	377	-rw-r--r--···0·root·········(0)·root·········(0)·····3478·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_e68e8157741866f444e17edd764ebbae.html
378	-rw-r--r--···0·root·········(0)·root·········(0)······746·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doc.png	378	-rw-r--r--···0·root·········(0)·root·········(0)······746·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doc.png
379	-rw-r--r--···0·root·········(0)·root·········(0)····33676·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doxygen.css	379	-rw-r--r--···0·root·········(0)·root·········(0)····33676·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doxygen.css
380	-rw-r--r--···0·root·········(0)·root·········(0)····26144·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dune-typetree.tag.gz	380	-rw-r--r--···0·root·········(0)·root·········(0)····26141·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dune-typetree.tag.gz
381	-rw-r--r--···0·root·········(0)·root·········(0)·····4452·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dynsections.js	381	-rw-r--r--···0·root·········(0)·root·········(0)·····4452·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dynsections.js
382	-rw-r--r--···0·root·········(0)·root·········(0)····11908·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/files.html	382	-rw-r--r--···0·root·········(0)·root·········(0)····11908·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/files.html
Max diff block lines reached; 588/20295 bytes (2.90%) of diff not shown.


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml">	2	<html·xmlns="http://www.w3.org/1999/xhtml">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.4"/>	6	<meta·name="generator"·content="Doxygen·1.9.4"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>dune-typetree:·~~childe~~x~~traction~~.hh·File·Reference</title>	8	<title>dune-typetree:·proxynode.hh·File·Reference</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 63, 66 lines modified		Offset 63, 61 lines modified
63	<div·id="nav-path"·class="navpath">	63	<div·id="nav-path"·class="navpath">
64	··<ul>	64	··<ul>
65	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	65	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
66	</div>	66	</div>
67	</div><!--·top·-->	67	</div><!--·top·-->
68	<div·class="header">	68	<div·class="header">
69	··<div·class="summary">	69	··<div·class="summary">
		70	<a·href="#nested-classes">Classes</a>·\|
70	<a·href="#namespaces">Namespaces</a>·~~\|~~	71	<a·href="#namespaces">Namespaces</a>··</div>
71	<a·href="#typedef-members">Typedefs</a>·\|
72	<a·href="#func-members">Functions</a>··</div>
73	··<div·class="headertitle"><div·class="title">~~childe~~x~~traction~~.hh·File·Reference</div></div>	72	··<div·class="headertitle"><div·class="title">proxynode.hh·File·Reference</div></div>
74	</div><!--header-->	73	</div><!--header-->
75	<div·class="contents">	74	<div·class="contents">
76	<div·class="textblock"><code>#include·<type_traits></code><br·/>	75	<div·class="textblock"><code>#include·<type_traits></code><br·/>
		76	<code>#include·<<a·class="el"·href="a00029_source.html">dune/typetree/nodeinterface.hh</a>></code><br·/>
		77	<code>#include·<<a·class="el"·href="a00056_source.html">dune/typetree/nodetags.hh</a>></code><br·/>
77	<code>#include·<utility></code><br·/>
78	<code>#include·<dune/common/concept.hh></code><br·/>
79	<code>#include·<dune/common/documentation.hh></code><br·/>
80	<code>#include·<dune/common/typetraits.hh></code><br·/>
81	<code>#include·<dune/common/shared_ptr.hh></code><br·/>	78	<code>#include·<dune/common/shared_ptr.hh></code><br·/>
82	<code>#include·<<a·class="el"·href="a00053_source.html">dune/typetree/nodeinterface.hh</a>></code><br·/>
83	<code>#include·<~~<a·class="el"·href="a00062_source.html">~~dune/ty~~petree~~/t~~reepath~~.hh~~</a>~~></code><br·/>	79	<code>#include·<dune/common/indices.hh></code><br·/>
		80	<code>#include·<dune/common/std/type_traits.hh></code><br·/>
84	</div>	81	</div>
85	<p><a·href="a00008_source.html">Go·to·the·source·code·of·this·file.</a></p>	82	<p><a·href="a00008_source.html">Go·to·the·source·code·of·this·file.</a></p>
86	<table·class="memberdecls">	83	<table·class="memberdecls">
		84	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>
		85	Classes</h2></td></tr>
		86	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01299.html">Dune::TypeTree::StaticChildAccessors<·ProxiedNode·></a></td></tr>
		87	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Mixin·class·providing·methods·for·child·access·with·compile-time·parameter.··<a·href="a01299.html#details">More...</a><br·/></td></tr>
		88	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		89	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01307.html">Dune::TypeTree::StaticChildAccessors<·ProxiedNode·>::Child<·k·></a></td></tr>
		90	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Access·to·the·type·and·storage·type·of·the·i-th·child.··<a·href="a01307.html#details">More...</a><br·/></td></tr>
		91	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		92	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01311.html">Dune::TypeTree::DynamicChildAccessors<·ProxiedNode·></a></td></tr>
		93	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Mixin·class·providing·methods·for·child·access·with·run-time·parameter.··<a·href="a01311.html#details">More...</a><br·/></td></tr>
		94	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		95	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01319.html">Dune::TypeTree::ProxyNodeBase<·Node,·LeafNodeTag·></a></td></tr>
		96	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01239.html"·title="Base·class·for·leaf·nodes·in·a·dune-typetree.">LeafNode</a>.··<a·href="a01319.html#details">More...</a><br·/></td></tr>
		97	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		98	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01323.html">Dune::TypeTree::ProxyNodeBase<·Node,·CompositeNodeTag·></a></td></tr>
		99	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01075.html"·title="Base·class·for·composite·nodes·based·on·variadic·templates.">CompositeNode</a>.··<a·href="a01323.html#details">More...</a><br·/></td></tr>
		100	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		101	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01327.html">Dune::TypeTree::ProxyNodeBase<·Node,·PowerNodeTag·></a></td></tr>
		102	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01287.html"·title="Collect·k·instances·of·type·T·within·a·dune-typetree.">PowerNode</a>.··<a·href="a01327.html#details">More...</a><br·/></td></tr>
		103	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		104	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01331.html">Dune::TypeTree::ProxyNodeBase<·Node,·DynamicPowerNodeTag·></a></td></tr>
		105	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01083.html"·title="Collect·multiple·instances·of·type·T·within·a·dune-typetree.">DynamicPowerNode</a>.··<a·href="a01331.html#details">More...</a><br·/></td></tr>
		106	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		107	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01295.html">Dune::TypeTree::ProxyNode<·Node·></a></td></tr>
		108	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.··<a·href="a01295.html#details">More...</a><br·/></td></tr>
		109	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		110	</table><table·class="memberdecls">
87	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="namespaces"·name="namespaces"></a>	111	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="namespaces"·name="namespaces"></a>
88	Namespaces</h2></td></tr>	112	Namespaces</h2></td></tr>
89	<tr·class="memitem:a00097"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00097.html">Dune</a></td></tr>	113	<tr·class="memitem:a00097"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00097.html">Dune</a></td></tr>
90	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>	114	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
91	<tr·class="memitem:a00098"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00098.html">Dune::TypeTree</a></td></tr>	115	<tr·class="memitem:a00098"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00098.html">Dune::TypeTree</a></td></tr>
92	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>	116	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
93	</table><table·class="memberdecls">
94	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="typedef-members"·name="typedef-members"></a>
95	Typedefs</h2></td></tr>
96	<tr·class="memitem:ga8136d392450f4308b90a04a143e20feb"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·std::size_t...·indices>·</td></tr>
97	<tr·class="memitem:ga8136d392450f4308b90a04a143e20feb"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga8136d392450f4308b90a04a143e20feb">Dune::TypeTree::Child</a>·=·typename·impl::_Child<·Node,·indices...·>::type</td></tr>
98	<tr·class="memdesc:ga8136d392450f4308b90a04a143e20feb"><td·class="mdescLeft"> </td><td·class="mdescRight">Template·alias·for·the·type·of·a·child·node·given·by·a·list·of·child·indices.··<a·href="a00092.html#ga8136d392450f4308b90a04a143e20feb">More...</a><br·/></td></tr>
99	<tr·class="separator:ga8136d392450f4308b90a04a143e20feb"><td·class="memSeparator"·colspan="2"> </td></tr>
100	<tr·class="memitem:gac7126c2c9df855877ce3e71c77738398"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename·TreePath·>·</td></tr>
101	<tr·class="memitem:gac7126c2c9df855877ce3e71c77738398"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gac7126c2c9df855877ce3e71c77738398">Dune::TypeTree::ChildForTreePath</a>·=·typename·impl::_ChildForTreePath<·Node,·TreePath·>::type</td></tr>
102	<tr·class="memdesc:gac7126c2c9df855877ce3e71c77738398"><td·class="mdescLeft"> </td><td·class="mdescRight">Template·alias·for·the·type·of·a·child·node·given·by·a·TreePath·or·a·<a·class="el"·href="a01383.html"·title="A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run·time·indices.">HybridTreePath</a>·type.··<a·href="a00092.html#gac7126c2c9df855877ce3e71c77738398">More...</a><br·/></td></tr>
103	<tr·class="separator:gac7126c2c9df855877ce3e71c77738398"><td·class="memSeparator"·colspan="2"> </td></tr>
104	<tr·class="memitem:ga5832a3bb33ab6b058aee3b201699584a"><td·class="memTemplParams"·colspan="2">template<typename·T·>·</td></tr>
105	<tr·class="memitem:ga5832a3bb33ab6b058aee3b201699584a"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga5832a3bb33ab6b058aee3b201699584a">Dune::TypeTree::is_flat_index</a>·=·typename·impl::_is_flat_index<·std::decay_t<·T·>·>::type</td></tr>
106	<tr·class="memdesc:ga5832a3bb33ab6b058aee3b201699584a"><td·class="mdescLeft"> </td><td·class="mdescRight">Type·trait·that·determines·whether·T·is·a·flat·index·in·the·context·of·child·extraction.··<a·href="a00092.html#ga5832a3bb33ab6b058aee3b201699584a">More...</a><br·/></td></tr>
107	<tr·class="separator:ga5832a3bb33ab6b058aee3b201699584a"><td·class="memSeparator"·colspan="2"> </td></tr>
108	</table><table·class="memberdecls">
109	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="func-members"·name="func-members"></a>
110	Functions</h2></td></tr>
111	<tr·class="memitem:gab8f2fef526363564e7bbe91daad49b9b"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
112	<tr·class="memitem:gab8f2fef526363564e7bbe91daad49b9b"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gab8f2fef526363564e7bbe91daad49b9b">Dune::TypeTree::child</a>·(Node·&&node,·Indices...·indices)</td></tr>
113	<tr·class="memdesc:gab8f2fef526363564e7bbe91daad49b9b"><td·class="mdescLeft"> </td><td·class="mdescRight">Extracts·the·child·of·a·node·given·by·a·sequence·of·compile-time·and·run-time·indices.··<a·href="a00092.html#gab8f2fef526363564e7bbe91daad49b9b">More...</a><br·/></td></tr>
114	<tr·class="separator:gab8f2fef526363564e7bbe91daad49b9b"><td·class="memSeparator"·colspan="2"> </td></tr>
115	<tr·class="memitem:ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
116	<tr·class="memitem:ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga6d60a84ddd0be65b0cae4a5e6032a52a">Dune::TypeTree::childStorage</a>·(Node·&&node,·Indices...·indices)</td></tr>
117	<tr·class="separator:ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memSeparator"·colspan="2"> </td></tr>
118	<tr·class="memitem:gae4133f4dba113143455fcab49d8a103e"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
119	<tr·class="memitem:gae4133f4dba113143455fcab49d8a103e"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gae4133f4dba113143455fcab49d8a103e">Dune::TypeTree::child</a>·(Node·&&node,·HybridTreePath<·Indices...·>·treePath)</td></tr>
120	<tr·class="memdesc:gae4133f4dba113143455fcab49d8a103e"><td·class="mdescLeft"> </td><td·class="mdescRight">Extracts·the·child·of·a·node·given·by·a·<a·class="el"·href="a01383.html"·title="A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run·time·indices.">HybridTreePath</a>·object.··<a·href="a00092.html#gae4133f4dba113143455fcab49d8a103e">More...</a><br·/></td></tr>
121	<tr·class="separator:gae4133f4dba113143455fcab49d8a103e"><td·class="memSeparator"·colspan="2"> </td></tr>
122	</table>	117	</table>
123	</div><!--·contents·-->	118	</div><!--·contents·-->
124	<!--·start·footer·part·-->	119	<!--·start·footer·part·-->
125	<hr·class="footer"/><address·class="footer"><small>	120	<hr·class="footer"/><address·class="footer"><small>
126	Generated·by <a·href="https://www.doxygen.org/index.html"><img·class="footer"·src="doxygen.svg"·width="104"·height="31"·alt="doxygen"/></a>·1.9.4	121	Generated·by <a·href="https://www.doxygen.org/index.html"><img·class="footer"·src="doxygen.svg"·width="104"·height="31"·alt="doxygen"/></a>·1.9.4
127	</small></address>	122	</small></address>
128	</body>	123	</body>

+dune-typetree 2.9
+····*·dune
+····*·typetree
+Namespaces·|·Typedefs·|·Functions
+Classes·|·Namespaces
+proxynode.hh·File·Reference
+#include·<type_traits>
+#include·<utility>
+#include·<dune/common/concept.hh>
+#include·<dune/common/documentation.hh>
+#include·<dune/common/typetraits.hh>
+#include·<dune/common/shared_ptr.hh>
+#include·<dune/typetree/nodeinterface.hh>
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/common/shared_ptr.hh>
+#include·<dune/common/indices.hh>
+#include·<dune/common/std/type_traits.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+·class· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>
+ ·······Mixin·class·providing·methods·for·child·access·with·compile-time
+·········parameter.·More...
+struct· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>::Child<_k_>
+ ·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
+·class· Dune::TypeTree::DynamicChildAccessors<_ProxiedNode_>
+ ·······Mixin·class·providing·methods·for·child·access·with·run-time
+·········parameter.·More...
+struct· Dune::TypeTree::ProxyNodeBase<_Node,_LeafNodeTag_>
+ ·······ProxyNode·base·class·for·LeafNode.·More...
+struct· Dune::TypeTree::ProxyNodeBase<_Node,_CompositeNodeTag_>
+ ·······ProxyNode·base·class·for·CompositeNode.·More...
+struct· Dune::TypeTree::ProxyNodeBase<_Node,_PowerNodeTag_>
+ ·······ProxyNode·base·class·for·PowerNode.·More...
+struct· Dune::TypeTree::ProxyNodeBase<_Node,_DynamicPowerNodeTag_>
+ ·······ProxyNode·base·class·for·DynamicPowerNode.·More...
+·class· Dune::TypeTree::ProxyNode<_Node_>
+ ·······Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.·More...
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+·Typedefs
+template<typename·Node·,·std::size_t...·indices>
+using Dune::TypeTree::Child·=·typename·impl::_Child<·Node,·indices...·>::type
+ ·····Template·alias·for·the·type·of·a·child·node·given·by·a·list·of·child
+·······indices.·More...
+template<typename·Node·,·typename·TreePath·>
+using Dune::TypeTree::ChildForTreePath·=·typename·impl::_ChildForTreePath<
+·······Node,·TreePath·>::type
+ ·····Template·alias·for·the·type·of·a·child·node·given·by·a·TreePath·or·a
+·······HybridTreePath·type.·More...
+template<typename·T·>
+using Dune::TypeTree::is_flat_index·=·typename·impl::_is_flat_index<·std::
+·······decay_t<·T·>·>::type
+ ·····Type·trait·that·determines·whether·T·is·a·flat·index·in·the·context·of
+·······child·extraction.·More...
+·Functions
+template<typename·Node·,·typename...·Indices>
+ImplementationDefined Dune::TypeTree::child·(Node·&&node,·Indices...·indices)
+ ·····················Extracts·the·child·of·a·node·given·by·a·sequence·of
+·······················compile-time·and·run-time·indices.·More...
+template<typename·Node·,·typename...·Indices>
+ImplementationDefined Dune::TypeTree::childStorage·(Node·&&node,·Indices...
+·······················indices)
+template<typename·Node·,·typename...·Indices>
+ImplementationDefined Dune::TypeTree::child·(Node·&&node,·HybridTreePath<
+·······················Indices...·>·treePath)
+ ·····················Extracts·the·child·of·a·node·given·by·a·HybridTreePath
+·······················object.·More...
+===============================================================================
+·····Generated·by [doxygen]·1.9.4


Offset 4, 329 lines modified		Offset 4, 466 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	~~childe~~x~~traction~~.hh	7	proxynode.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=8·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_HH
13	·5#define·DUNE_TYPETREE_~~CHILDE~~X~~TRACTION~~_HH	12	·4#ifndef·DUNE_TYPETREE_PROXYNODE_HH
		13	·5#define·DUNE_TYPETREE_PROXYNODE_HH
14	·6	14	·6
15	·7#include·<type_traits>	15	·7#include·<type_traits>
		16	·8#include·<dune/typetree/nodeinterface.hh>
		17	·9#include·<dune/typetree/nodetags.hh>
16	·8#include·<utility>
17	·9
18	·10#include·<dune/common/concept.hh>
19	·11#include·<dune/common/documentation.hh>
20	·12#include·<dune/common/typetraits.hh>
21	·13#include·<dune/common/shared_ptr.hh>	18	·10#include·<dune/common/shared_ptr.hh>
		19	·11#include·<dune/common/indices.hh>
		20	·12#include·<dune/common/std/type_traits.hh>
		21	·13
22	·14
23	·15#include·<dune/typetree/nodeinterface.hh>
24	·16#include·<dune/typetree/treepath.hh>
25	·17
26	·18
27	·19namespace·Dune·{	22	·14namespace·Dune·{
28	·20·namespace·TypeTree·{	23	·15·namespace·TypeTree·{
29	·21
30	·26
31	·~~27#ifndef·DOXYG~~EN	24	·16
		25	·22·template<typename·Node>
		26	·23·class·ProxyNode;
		27	·24
		28	·26·template<typename·ProxiedNode>
		29	27·class·StaticChildAccessors
32	·28	30	·28·{
33	·29·namespace·Impl·{
34	·30
35	·31·//·check·at·run·time·whether·index·is·a·valid·child·index
36	·32·template·<class·Node,·class·Index>
37	·~~33·std::true_type·checkChildIndex·(Node·const&·node,·Index·~~i)	31	·29
		32	·30·static·const·bool·proxiedNodeIsConst·=·std::is_const<typename·std::
		33	remove_reference<ProxiedNode>::type>::value;
		34	·31
		35	·32·template<std::size_t·k>
		36	·33·struct·lazy_enabled
38	·34·{	37	·34·{
39	·35·assert(std::size_t(i)·<·node.degree()·&&·"Child·index·out·of·range");
40	·36·retur~~n·{}~~;	38	·35·static·const·bool·value·=·!proxiedNodeIsConst;
		39	·36·};
41	·37·}	40	·37
42	·38
43	·39·//·check·at·compile·time·whether·index·is·a·valid·index
44	·40·template·<class·Node,·std::size_t·i>
45	·41·std::bool_constant<(i·<·Node::degree())>·checkChildIndex·(Node·const&·node,
46	index_co~~nstant<~~i>)	41	·38·typedef·ProxyNode<ProxiedNode>·Node;
		42	·39
		43	·40·template<bool·enabled·=·!proxiedNodeIsConst>
		44	·41·typename·std::enable_if<enabled,Node&>::type
		45	·42·node·()
47	·42·{	46	·43·{
		47	·44·return·static_cast<Node&>(*this);
48	·43·static_assert(i·<·Node::degree(),·"Child·index·out·of·range");
49	·44·return·{};
50	·45·}	48	·45·}
51	·46	49	·46
		50	·47·const·Node&·node·()·const
52	·47·//·finally·return·the·node·itself·if·no·further·indices·are·provided.·Break
53	condition
54	·48·//·for·the·recursion·over·the·node·childs.
55	·49·template<class·Node>
56	·50·decltype(auto)·childImpl·(Node&&·node)
57	·51·{
58	·52·return·std::forward<Node>(node);
59	·53·}
60	·54
61	·55·template<class·NodePtr>
62	·56·auto·childStorageImpl·(NodePtr&&·nodePtr)
63	·57·{
64	·58·return·std::forward<NodePtr>(nodePtr);
65	·59·}
66	·60
67	·61·//·recursively·call·`node.child(...)`·with·the·given·indices
68	·62·template<class·Node,·class·I0,·class...·I>
69	·63·decltype(auto)·childImpl·(Node&&·node,·I0·i0,·[[maybe_unused]]·I...·i)
70	·64·{	51	·48·{
		52	·49·return·static_cast<const·Node&>(*this);
71	·65·auto·valid·=·checkChildIndex(node,i0);
72	·66·if·constexpr·(valid)
73	·67·return·childImpl(node.child(i0),i...);
74	·68·else
75	·69·return;
76	·70·}	53	·50·}
77	·71
78	·72·//·recursively·call·`node.childStorage(...)`·with·the·given·indices
79	·73·template<class·NodePtr,·class·I0,·class...·I>
80	·74·decltype(auto)·childStorageImpl·(NodePtr&&·nodePtr,·I0·i0,·[[maybe_unused]]
81	~~I...~~·i)	54	·51
		55	·52·public:
		56	·53
		57	·55·template<std::size_t·k>
		58	56·struct·Child
		59	·57·:·public·ProxiedNode::template·Child<k>
		60	·58·{};
		61	·59
		62	·62
		63	·64
		64	·67·template<std::size_t·k,
		65	·68·typename·std::enable_if<lazy_enabled<k>::value,·int>::type·=·0>
		66	69·auto&·child·(index_constant<k>·=·{})
82	·75·{	67	·70·{
		68	·71·return·node().proxiedNode().template·child<k>();
		69	·72·}
		70	·73
		71	·75
		72	·78·template<std::size_t·k>
		73	79·const·auto&·child·(index_constant<k>·=·{})·const
83	·76·auto·valid·=·checkChildIndex(*nodePtr,i0);
84	·77·if·constexpr·(valid)
Max diff block lines reached; 17856/22949 bytes (77.81%) of diff not shown.

+dune-typetree 2.9
+····*·dune
+····*·typetree
+Classes·|·Namespaces·|·Functions·|·Variables
+visitor.hh·File·Reference
+#include·<cassert>
+#include·<array>
+#include·<memory>
+#include·<type_traits>
+#include·<dune/common/typetraits.hh>
+#include·<dune/common/std/type_traits.hh>
+#include·<dune/typetree/treepath.hh>
+#include·<dune/typetree/utility.hh>
+#include·<dune/typetree/childextraction.hh>
+#include·<dune/typetree/typetraits.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+·class· Dune::TypeTree::PowerNode<_T,_k_>
+struct· Dune::TypeTree::DefaultVisitor
+ ·······Visitor·interface·and·base·class·for·TypeTree·visitors.·More...
+struct· Dune::TypeTree::PowerNode<_T,_k_>::Child<_i_>
+struct· Dune::TypeTree::DefaultPairVisitor
+ ·······Visitor·interface·and·base·class·for·visitors·of·pairs·of·TypeTrees.
+·········More...
+struct· Dune::TypeTree::Experimental::DefaultHybridVisitor
+ ·······Hybrid·visitor·interface·and·base·class·for·TypeTree·hybrid·visitors.
+·········More...
+struct· Dune::TypeTree::VisitDirectChildren
+ ·······Mixin·base·class·for·visitors·that·only·want·to·visit·the·direct
+·········children·of·a·node.·More...
+struct· Dune::TypeTree::VisitDirectChildren::VisitChild<_Node1,_Child1,_Node2,
+·········Child2,_TreePath_>
+ ·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
+·········More...
+struct· Dune::TypeTree::VisitTree
+ ·······Mixin·base·class·for·visitors·that·want·to·visit·the·complete·tree.
+·········More...
+struct· Dune::TypeTree::VisitTree::VisitChild<_Node1,_Child1,_Node2,_Child2,
+·········TreePath_>
+ ·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
+·········More...
+struct· Dune::TypeTree::StaticTraversal
+ ·······Mixin·base·class·for·visitors·that·require·a·static·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::DynamicTraversal
+ ·······Mixin·base·class·for·visitors·that·only·need·a·dynamic·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::TreeVisitor
+ ·······Convenience·base·class·for·visiting·the·entire·tree.·More...
+struct· Dune::TypeTree::DirectChildrenVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node.
+·········More...
+struct· Dune::TypeTree::TreePairVisitor
+ ·······Convenience·base·class·for·visiting·an·entire·tree·pair.·More...
+struct· Dune::TypeTree::DirectChildrenPairVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node
+·········pair.·More...
+struct· Dune::TypeTree::Experimental::Info::LeafCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::NodeCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::DepthVisitor
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+namespace· Dune::TypeTree::Experimental
+namespace· Dune::TypeTree::Experimental::Info
+·Functions
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::depth·(const·Tree·&tree)
+ ··············The·depth·of·the·TypeTree.·More...
+template<typename·Tree·>
+constexpr·auto Dune::TypeTree::Experimental::Info::depth·()
+ ··············The·depth·of·the·Tree.·More...
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::nodeCount·(const·Tree
+················&tree)
+ ··············The·total·number·of·nodes·in·the·Tree.·More...
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::leafCount·(const·Tree
+················&tree)
+ ··············The·number·of·leaf·nodes·in·the·Tree.·More...
+·Variables
+template<typename·Tree·>
+constexpr·bool Dune::TypeTree::Experimental::Info::isDynamic·=·std::
+················is_same<std::size_t,·decltype(leafCount(std::declval<Tree>()))>
+················{}
+ ··············true·if·any·of·the·nodes·in·the·tree·only·has·dynamic·degree.
+················More...
+===============================================================================
+·····Generated·by [doxygen]·1.9.4

+dune-typetree 2.9
+····*·dune
+····*·typetree
+visitor.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_VISITOR_HH
+·5#define·DUNE_TYPETREE_VISITOR_HH
+·6
+·7#include·<cassert>
+·8#include·<array>
+·9#include·<memory>
+·10#include·<type_traits>
+·11
+·12#include·<dune/common/typetraits.hh>
+·13#include·<dune/common/std/type_traits.hh>
+·14
+·7#include·<dune/typetree/treepath.hh>
+·8#include·<dune/typetree/utility.hh>
+·17#include·<dune/typetree/childextraction.hh>
+·9
+·10namespace·Dune·{
+·11·namespace·TypeTree·{
+·12
+·19
+·struct·DefaultVisitor
+·47·{
+·48
+·20namespace·Dune·{
+·21·namespace·TypeTree·{
+·22
+·29#ifndef·DOXYGEN
+·30
+·32·template<typename·PowerNode,·typename·T,·std::size_t·k>
+·33·struct·AssertPowerNodeChildCount
+·34·:·public·std::enable_if<std::is_same<
+·35·typename·PowerNode::ChildType,
+·36·T>::value·&&
+·37·PowerNode::degree()·==·k,
+·38·T>
+·39·{};
+·40
+·41#endif
+·42
+·48·template<typename·T,·std::size_t·k>
+·class·PowerNode
+·50
+·57·template<typename·T,·typename·TreePath>
+·void·pre(T&&,·TreePath)·const·{}
+·51
+·52·public:
+·53
+·static·const·bool·isLeaf·=·false;
+·56
+·static·const·bool·isPower·=·true;
+·59
+·61
+·69·template<typename·T,·typename·TreePath>
+·void·in(T&&,·TreePath)·const·{}
+·static·const·bool·isComposite·=·false;
+·62
+·64·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
+·static·const·std::size_t·CHILDREN·=·k;
+·66
+·static·constexpr·auto·degree·()
+·68·{
+·69·return·std::integral_constant<std::size_t,k>{};
+·70·}
+·71
+·73
+·80·template<typename·T,·typename·TreePath>
+·void·post(T&&,·TreePath)·const·{}
+·82
+·84
+·90·template<typename·T,·typename·TreePath>
+·void·leaf(T&&,·TreePath)·const·{}
+·92
+·94
+·104·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex>
+·void·beforeChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
+·typedef·PowerNodeTag·NodeTag;
+·74
+·typedef·T·ChildType;
+·77
+·typedef·std::array<std::shared_ptr<T>,k>·NodeStorage;
+·80
+·81
+·83·template<std::size_t·i>
+·struct·Child
+·85·{
+·86
+·87·static_assert((i·<·degree()),·"child·index·out·of·range");
+·88
+·typedef·T·Type;
+·91
+·typedef·T·type;
+·94·};
+·95
+·98
+·106
+·103·template<std::size_t·i>
+·T&·child·(index_constant<i>·=·{})
+·105·{
+·106·static_assert((i·<·degree()),·"child·index·out·of·range");
+·107·return·*_children[i];
+·108
+·119·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex>
+·void·afterChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
+·121
+·122·};
+·114·template<std::size_t·i>
+·const·T&·child·(index_constant<i>·=·{})·const
+·116·{
+·117·static_assert((i·<·degree()),·"child·index·out·of·range");
+·118·return·*_children[i];
+·119·}
+·123
+·124
+·125·template<std::size_t·i>


Offset 4, 89 lines modified		Offset 4, 64 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	Classes·\|·Namespaces·\|·Functions	7	Classes·\|·Namespaces·\|·Typedefs·\|·Functions
8	typetraits.hh·File·Reference	8	treecontainer.hh·File·Reference
9	#include·<type_traits>	9	#include·<type_traits>
		10	#include·<utility>
		11	#include·<functional>
		12	#include·<array>
		13	#include·<dune/common/indices.hh>
		14	#include·<dune/common/hybridutilities.hh>
		15	#include·<dune/common/rangeutilities.hh>
10	#include·<dune/common/type~~traits~~.hh>	16	#include·<dune/common/tuplevector.hh>
11	#include·<dune/typetree/treepath.hh>	17	#include·<dune/typetree/treepath.hh>
12	#include·<dune/typetree/nodeinterface.hh>
13	Go_to_the_source_code_of_this_file.	18	Go_to_the_source_code_of_this_file.
14	·Classes	19	·Classes
15	~~struct~~· Dune::first_type<_~~T0,_~~T~~...~~_>	20	·class· Dune::TypeTree::Detail::ContainerFactory<_LeafToValue_>
16		21
17	~~struct~~· Dune::TypeTree::has_node_ta~~g<_T~~_>	22	·class· Dune::TypeTree::Detail::TreeContainerVectorBackend<_Container_>
18		23
		24	struct· Dune::TypeTree::Detail::LeafToDefaultConstructibleValue<_LeafToValue_>
19	struct· Dune::TypeTree::has_node_tag<_T_>::yes
20
21	struct· Dune::TypeTree::has_node_tag<_T_>::no
22
23	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>
24
25	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::maybe<_N_>
26
27	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::yes
28
29	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::no
30
31	struct· Dune::TypeTree::has_implementation_tag<_T_>
32
33	struct· Dune::TypeTree::has_implementation_tag<_T_>::yes
34
35	struct· Dune::TypeTree::has_implementation_tag<_T_>::no
36
37	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>
38
39	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::maybe<_N_>
40
41	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::yes
42
43	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::no
44
45	struct· Dune::TypeTree::AlwaysVoid<_typename_>
46
47	struct· Dune::TypeTree::meta_function
48	·······Marker·tag·declaring·a·meta·function.·More...
49
50	struct· Dune::TypeTree::lazy_evaluate<_F_>
51	·······Helper·meta·function·to·delay·evaluation·of·F.·More...
52
53	struct· Dune::TypeTree::lazy_identity<_F_>
54	·······Identity·function.·More...
55
56	struct· Dune::TypeTree::evaluate_if_meta_function<_F_>
57	·······Meta·function·that·evaluates·its·argument·iff·it·inherits·from
58	·········meta_function.·More...
59
60	struct· Dune::TypeTree::IsTreePath<_T_>
61	·······Check·if·type·represents·a·tree·path.·More...
62		25
63	·Namespaces	26	·Namespaces
64	namespace· Dune	27	namespace· Dune
65		28
66	namespace· Dune::TypeTree	29	namespace· Dune::TypeTree
67		30
68	namespace· Dune::TypeTree::~~imp~~l	31	namespace· Dune::TypeTree::Detail
		32
		33	·Typedefs
		34	template<class·Value·,·class·Tree·>
		35	using Dune::TypeTree::UniformTreeContainer·=·std::decay_t<·decltype
		36	·······(makeTreeContainer<·Value·>(std::declval<·const·Tree·&·>()))>
		37	·····Alias·to·container·type·generated·by·makeTreeContainer·for·given·tree
		38	·······type·and·uniform·value·type.·More...
		39
		40	template<template<·class·Node·>·class·LeafToValue,·class·Tree·>
		41	using Dune::TypeTree::TreeContainer·=·std::decay_t<·decltype(makeTreeContainer
		42	·······(std::declval<·const·Tree·&·>(),·std::declval<·Detail::
		43	·······LeafToDefaultConstructibleValue<·LeafToValue·>·>()))>
		44	·····Alias·to·container·type·generated·by·makeTreeContainer·for·give·tree
		45	·······type·and·when·using·LeafToValue·to·create·values.·More...
69		46
70	·Functions	47	·Functions
		48	template<class·Container·>
		49	auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
		50	······&&container)
71	template<typename·T·>
72	···········T·* Dune::TypeTree::declptr·()
73	··············Helper·function·for·generating·a·pointer·to·a·value·of·type·T
74	················in·an·unevaluated·operand·setting.·More...
75		51
76	~~cons~~texpr·aut~~o Dune::Type~~Tree:~~:imp~~l::is~~Tre~~ePa~~th·~~(vo~~id·*)·->·std::~~false~~_ty~~pe	52	template<class·Tree·,·class·LeafToValue·>
		53	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree,·LeafToValue
		54	······&&leafToValue)
		55	····Create·container·havin·the·same·structure·as·the·given·tree.·More...
77		56
		57	template<class·Value·,·class·Tree·>
		58	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
		59	····Create·container·havin·the·same·structure·as·the·given·tree.·More...
78	template<class...·I>
79	constexpr·auto Dune::TypeTree::impl::isTreePath·(const·HybridTreePath<·I...·>
80	················*)·->·std::true_type
81
82	template<class·T·>
83	constexpr·auto Dune::TypeTree::isTreePath·(const·T·&)·->·IsTreePath<·T·>
84	··············Check·if·given·object·represents·a·tree·path.·More...
85		60

86	===============================================================================	61	===============================================================================
87	·····Generated·by [doxygen]·1.9.4	62	·····Generated·by [doxygen]·1.9.4


Offset 4, 346 lines modified		Offset 4, 365 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	typetraits.hh	7	treecontainer.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=4·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_TYPETRAITS_HH	12	·4#ifndef·DUNE_TYPETREE_TREECONTAINER_HH
13	·5#define·DUNE_TYPETREE_TYPETRAITS_HH	13	·5#define·DUNE_TYPETREE_TREECONTAINER_HH
14	·6	14	·6
15	·7#include·<type_traits>	15	·7#include·<type_traits>
		16	·8#include·<utility>
		17	·9#include·<functional>
		18	·10#include·<array>
		19	·11
		20	·12#include·<dune/common/indices.hh>
		21	·13#include·<dune/common/hybridutilities.hh>
		22	·14#include·<dune/common/rangeutilities.hh>
16	·8#include·<dune/common/type~~traits~~.hh>	23	·15#include·<dune/common/tuplevector.hh>
17	·9	24	·16
18	·10#include·<dune/typetree/treepath.hh>	25	·17#include·<dune/typetree/treepath.hh>
		26	·18
19	·11#include·<dune/typetree/nodeinterface.hh>
20	·12
21	·13namespace·Dune·{	27	·19namespace·Dune·{
22	·14
23	·15·//·Provide·some·more·C++11·TMP·helpers.
24	·16·//·These·should·be·upstreamed·to·dune-common·ASAP.
25	·17
26	·18·template<typename...·T>
27	19·struct·first_type;
28	·20
29	·21·template<typename·T0,·typename...·T>
30	22·struct·first_type<T0,T...>
31	·23·{
32	24·typedef·T0·type;
33	·25·};
34	·26
35	·27·namespace·TypeTree·{	28	·20·namespace·TypeTree·{
36	·28
37	·29·template<typename·T>
38	~~30·struct~~·~~has_node_t~~ag	29	·21
		30	·22·namespace·Detail·{
		31	·23
		32	·24·/*
		33	·25·*·\brief·A·factory·class·creating·a·hybrid·container·compatible·with·a·type
		34	tree
		35	·26·*
		36	·27·*·This·class·allows·to·create·a·nested·hybrid·container·having·the·same
		37	structure
		38	·28·*·as·a·given·type·tree.·Power·nodes·are·represented·as·std::array's·while
		39	composite
		40	·29·*·nodes·are·represented·as·Dune::TupleVector's.·The·stored·values·for·the
		41	leaf·nodes
		42	·30·*·are·creating·using·a·given·predicate.·Once·created,·the·factory·provides
		43	an
		44	·31·*·operator()·creating·the·container·for·the·tree·given·as·argument.
		45	·32·*
		46	·33·*·\tparam·LeafToValue·Type·of·a·predicate·that·determines·the·stored·values
		47	at·the·leafs
		48	·34·*/
		49	·35·template<class·LeafToValue>
		50	36·class·ContainerFactory
39	·31·{	51	·37·{
		52	·38·template<class·N>
		53	·39·using·DynamicDegreeConcept·=·decltype((std::size_t(std::declval<N>().degree
		54	()),·true));
		55	·40
		56	·41·template<class·N>
		57	·42·using·StaticDegreeConcept·=·decltype((std::integral_constant<std::size_t,
		58	N::degree()>{},·true));
40	32·struct·yes·{·char·dummy[1];·};
41	33·struct·no·{·char·dummy[2];·};
42	·34
43	·35·template<typename·X>
44	36·static·yes·test(NodeTag<X>·*);
45	·37·template<typename·X>
46	38·static·no·test(...);
47	·39
48	41·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
49	·42·};
50	·43	59	·43
51	·44·template<typename·T,·typename·V>
52	45·stru~~ct·h~~a~~s_no~~de_~~tag_value~~	60	·44·template<class·N>
		61	·45·using·DynamicChildAccessConcept·=·decltype((std::declval<N>().child(0u),
		62	true));
		63	·46
		64	·47·public:
		65	·48
		66	56·ContainerFactory(LeafToValue·leafToValue)·:
		67	·57·leafToValue_(leafToValue)
		68	·58·{}
		69	·59
		70	·60·template<class·Node>
		71	61·auto·operator()(const·Node&·node)
53	·46·{	72	·62·{
		73	·63·return·(*this)(node,·Dune::PriorityTag<5>{});
54	·47·template<int·N>
55	48·struct·maybe·{·char·dummy[N+1];·};
56	49·struct·yes·{·char·dummy[2];·};
57	50·struct·no·{·char·dummy[1];·};
58	·51
59	·52·template<typename·X>
60	·53·static·maybe<std::is_base_of<V,_NodeTag<X>>::value>
61	54·test(NodeTag<X>·*·a);
62	·55·template<typename·X>
63	56·static·no·test(...);
64	·57
65	59·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
66	·60·};
67	·61
68	·62·template<typename·T>
69	63·struct·has_implementation_tag
70	·64·{	74	·64·}
71	65·struct·yes·{·char·dummy[1];·};
72	~~66·struct·no·{·char·dummy[2];~~·};	75	·65
		76	·66·private:
73	·67	77	·67
74	·68·template<typename·X>
75	69·static·yes·test(ImplementationTag<X>·*);
76	·70·template<typename·X>
77	71·static·no·test(...);
Max diff block lines reached; 17166/21366 bytes (80.34%) of diff not shown.


Offset 4, 64 lines modified		Offset 4, 39 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
		7	Classes·\|·Namespaces
		8	powercompositenodetransformationtemplates.hh·File·Reference
		9	#include·<cstddef>
7	Classes·\|·Namespaces·\|·Typedefs·\|·Functions
8	treecontainer.hh·File·Reference
9	#include·<type_traits>
10	#include·<utility>
11	#include·<functional>
12	#include·<array>
13	#include·<dune/common/indices.hh>
14	#include·<dune/common/hybridutilities.hh>
15	#include·<dune/common/rangeutilities.hh>
16	#include·<dune/common/tuplevector.hh>
17	#include·<dune/typetree/treepath.hh>	10	#include·<dune/typetree/nodeinterface.hh>
18	Go_to_the_source_code_of_this_file.	11	Go_to_the_source_code_of_this_file.
19	·Classes	12	·Classes
20	~~·class~~· Dune::TypeTree::Detai~~l::C~~onta~~ine~~rFacto~~ry<_Le~~a~~fToVal~~ue_>	13	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
		14	·········Transformation,_TransformedNode_>
21		15
22	~~·class~~· Dune::TypeTree::Detai~~l::T~~r~~eeCont~~a~~ine~~r~~Vect~~o~~rBackend~~<_Co~~ntainer_>~~	16	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
		17	·········Transformation,_TransformedNode_>::result<_TC_>
23		18
24	struct· Dune::TypeTree::De~~tail::~~Lea~~fTo~~Defa~~ultC~~onstr~~uctibleValue<_Leaf~~T~~oVa~~l~~ue_>~~	19	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
		20	·········SourceNode,_Transformation,_TransformedNode_>
		21
		22	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
		23	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
		24
		25	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
		26	·········SourceNode,_Transformation,_TransformedNode_>
		27
		28	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
		29	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
25		30
26	·Namespaces	31	·Namespaces
27	namespace· Dune	32	namespace· Dune
28		33
29	namespace· Dune::TypeTree	34	namespace· Dune::TypeTree
30		35
31	namespace· Dune::TypeTree::Detail
32
33	·Typedefs
34	template<class·Value·,·class·Tree·>
35	using Dune::TypeTree::UniformTreeContainer·=·std::decay_t<·decltype
36	·······(makeTreeContainer<·Value·>(std::declval<·const·Tree·&·>()))>
37	·····Alias·to·container·type·generated·by·makeTreeContainer·for·given·tree
38	·······type·and·uniform·value·type.·More...
39
40	template<template<·class·Node·>·class·LeafToValue,·class·Tree·>
41	using Dune::TypeTree::TreeContainer·=·std::decay_t<·decltype(makeTreeContainer
42	·······(std::declval<·const·Tree·&·>(),·std::declval<·Detail::
43	·······LeafToDefaultConstructibleValue<·LeafToValue·>·>()))>
44	·····Alias·to·container·type·generated·by·makeTreeContainer·for·give·tree
45	·······type·and·when·using·LeafToValue·to·create·values.·More...
46
47	·Functions
48	template<class·Container·>
49	auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
50	······&&container)
51
52	template<class·Tree·,·class·LeafToValue·>
53	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree,·LeafToValue
54	······&&leafToValue)
55	····Create·container·havin·the·same·structure·as·the·given·tree.·More...
56
57	template<class·Value·,·class·Tree·>
58	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
59	····Create·container·havin·the·same·structure·as·the·given·tree.·More...
60

61	===============================================================================	36	===============================================================================
62	·····Generated·by [doxygen]·1.9.4	37	·····Generated·by [doxygen]·1.9.4

+dune-typetree 2.9
+····*·dune
+····*·typetree
+powercompositenodetransformationtemplates.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_TREECONTAINER_HH
+·4#ifndef·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
+·5#define·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
+·6
+·7#include·<cstddef>
+·7#include·<type_traits>
+·8#include·<utility>
+·9#include·<functional>
+·10#include·<array>
+·11
+·12#include·<dune/common/indices.hh>
+·13#include·<dune/common/hybridutilities.hh>
+·14#include·<dune/common/rangeutilities.hh>
+·15#include·<dune/common/tuplevector.hh>
+·16
+·17#include·<dune/typetree/treepath.hh>
+·8
+·9#include·<dune/typetree/nodeinterface.hh>
+·10
+·11namespace·Dune·{
+·12·namespace·TypeTree·{
+·21
+·22·namespace·Detail·{
+·23
+·24·/*
+·25·*·\brief·A·factory·class·creating·a·hybrid·container·compatible·with·a·type
+tree
+·26·*
+·27·*·This·class·allows·to·create·a·nested·hybrid·container·having·the·same
+structure
+·28·*·as·a·given·type·tree.·Power·nodes·are·represented·as·std::array's·while
+composite
+·29·*·nodes·are·represented·as·Dune::TupleVector's.·The·stored·values·for·the
+leaf·nodes
+·30·*·are·creating·using·a·given·predicate.·Once·created,·the·factory·provides
+an
+·31·*·operator()·creating·the·container·for·the·tree·given·as·argument.
+·32·*
+·33·*·\tparam·LeafToValue·Type·of·a·predicate·that·determines·the·stored·values
+at·the·leafs
+·34·*/
+·35·template<class·LeafToValue>
+·class·ContainerFactory
+·37·{
+·38·template<class·N>
+·39·using·DynamicDegreeConcept·=·decltype((std::size_t(std::declval<N>().degree
+()),·true));
+·40
+·41·template<class·N>
+·42·using·StaticDegreeConcept·=·decltype((std::integral_constant<std::size_t,
+N::degree()>{},·true));
+·43
+·44·template<class·N>
+·45·using·DynamicChildAccessConcept·=·decltype((std::declval<N>().child(0u),
+true));
+·46
+·47·public:
+·48
+·ContainerFactory(LeafToValue·leafToValue)·:
+·57·leafToValue_(leafToValue)
+·58·{}
+·59
+·60·template<class·Node>
+·auto·operator()(const·Node&·node)
+·62·{
+·63·return·(*this)(node,·Dune::PriorityTag<5>{});
+·64·}
+·65
+·66·private:
+·67
+·68·template<class·Node,
+·69·std::enable_if_t<Node::isLeaf,·bool>·=·true>
+·70·auto·operator()(const·Node&·node,·Dune::PriorityTag<4>)
+·71·{
+·72·return·leafToValue_(node);
+·73·}
+·74
+·75·template<class·Node,
+·76·StaticDegreeConcept<Node>·=·true,
+·77·DynamicChildAccessConcept<Node>·=·true>
+·78·auto·operator()(const·Node&·node,·Dune::PriorityTag<3>)
+·79·{
+·80·return·Dune::unpackIntegerSequence([&](auto...·indices)·{
+·81·return·std::array{(*this)(node.child(indices))...};
+·82·},·std::make_index_sequence<std::size_t(Node::degree())>());
+·83·}
+·84
+·85·template<class·Node,
+·86·DynamicDegreeConcept<Node>·=·true,
+·87·DynamicChildAccessConcept<Node>·=·true>
+·88·auto·operator()(const·Node&·node,·Dune::PriorityTag<2>)
+·89·{
+·90·using·TransformedChild·=·decltype((*this)(node.child(0)));
+·91·std::vector<TransformedChild>·container;
+·92·container.reserve(node.degree());
+·93·for·(std::size_t·i·=·0;·i·<·node.degree();·++i)
+·94·container.emplace_back((*this)(node.child(i)));
+·95·return·container;
+·96·}
+·97
+·98·template<class·Node,
+·99·StaticDegreeConcept<Node>·=·true>
+·100·auto·operator()(const·Node&·node,·Dune::PriorityTag<1>)
+·101·{
+·102·return·Dune::unpackIntegerSequence([&](auto...·indices)·{
+·103·return·Dune::makeTupleVector((*this)(node.child(indices))...);
+·104·},·std::make_index_sequence<std::size_t(Node::degree())>());
+·105·}
+·106
+·107·private:
+·108·LeafToValue·leafToValue_;
+·109·};
+·110
+·111
+·112·/*


Offset 4, 14 lines modified		Offset 4, 41 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
		7	Classes·\|·Namespaces·\|·Functions
7	transformation~~utilities~~.hh·File·Reference	8	transformation.hh·File·Reference
8	#include·<dune/typetree/simpletransformationdescriptors.hh>
9	#include·<~~dune/typetree/generictransform~~a~~tiondesc~~r~~ipto~~rs.hh>	9	#include·<array>
		10	#include·<tuple>
		11	#include·<memory>
		12	#include·<utility>
		13	#include·<dune/common/hybridutilities.hh>
		14	#include·<dune/common/exceptions.hh>
		15	#include·<dune/common/typetraits.hh>
		16	#include·<dune/typetree/typetraits.hh>
		17	#include·<dune/typetree/nodeinterface.hh>
		18	#include·<dune/typetree/nodetags.hh>
		19	#include·<dune/typetree/utility.hh>
10	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
		21	·Classes
		22	struct· Dune::TypeTree::TransformTree<_SourceTree,_Transformation,_Tag,
		23	·········recursive_>
		24	·······Transform·a·TypeTree.·More...
		25
		26	·Namespaces
		27	namespace· Dune
		28
		29	namespace· Dune::TypeTree
		30
		31	·Functions
		32	template<typename·SourceNode·,·typename·Transformation·,·typename·Tag·>
		33	void Dune::TypeTree::registerNodeTransformation·(SourceNode·*,·Transformation
		34	······,·Tag·)
		35	····Register·transformation·descriptor·to·transform·SourceNode·with
		36	······Transformation.·More...
		37

11	===============================================================================	38	===============================================================================
12	·····Generated·by [doxygen]·1.9.4	39	·····Generated·by [doxygen]·1.9.4

+dune-typetree 2.9
+····*·dune
+····*·typetree
+transformation.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_TRANSFORMATION_HH
+·5#define·DUNE_TYPETREE_TRANSFORMATION_HH
+·6
+·7#include·<dune/typetree/simpletransformationdescriptors.hh>
+·7#include·<array>
+·8#include·<tuple>
+·9#include·<memory>
+·10#include·<utility>
+·11
+·12#include·<dune/common/hybridutilities.hh>
+·13#include·<dune/common/exceptions.hh>
+·14#include·<dune/common/typetraits.hh>
+·15#include·<dune/typetree/typetraits.hh>
+·16#include·<dune/typetree/nodeinterface.hh>
+·17#include·<dune/typetree/nodetags.hh>
+·18#include·<dune/typetree/utility.hh>
+·19
+·20
+·21namespace·Dune·{
+·22·namespace·TypeTree·{
+·23
+·29#ifdef·DOXYGEN
+·30
+·32
+·51·template<typename·SourceNode,·typename·Transformation,·typename·Tag>
+·void·registerNodeTransformation(SourceNode*,·Transformation*,·Tag*);
+·53
+·54#else·//·DOXYGEN
+·55
+·66·template<typename·S,·typename·T,·typename·Tag>
+·67·struct·LookupNodeTransformation
+·68·{
+·69
+·70·typedef·decltype(registerNodeTransformation(declptr<S>(),declptr<T>
+(),declptr<Tag>()))·lookup_type;
+·71
+·72·typedef·typename·evaluate_if_meta_function<
+·73·lookup_type
+·74·>::type·type;
+·75
+·76·static_assert((!std::is_same<type,void>::value),·"Unable·to·find·valid
+transformation·descriptor");
+·77·};
+·78
+·79#endif·//·DOXYGEN
+·80
+·81
+·83
+·92·template<typename·SourceTree,·typename·Transformation,·typename·Tag·=
+StartTag,·bool·recursive·=·true>
+·struct·TransformTree
+·94·{
+·95
+·96#ifndef·DOXYGEN
+·97
+·98·typedef·typename
+LookupNodeTransformation<SourceTree,Transformation,typename·SourceTree::
+ImplementationTag>::type·NodeTransformation;
+·99
+·100·//·the·type·of·the·new·tree·that·will·result·from·this·transformation
+·101·typedef·typename
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transformed_type·transformed_type;
+·102
+·103·//·the·storage·type·of·the·new·tree·that·will·result·from·this
+transformation
+·104·typedef·typename
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transformed_storage_type·transformed_storage_type;
+·105
+·106#endif·//·DOXYGEN
+·107
+·typedef·transformed_type·type;
+·110
+·typedef·type·Type;
+·112
+·static·transformed_type·transform(const·SourceTree&·s,·const
+Transformation&·t·=·Transformation())
+·115·{
+·116·return
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transform(s,t);
+·117·}
+·118
+·static·transformed_type·transform(const·SourceTree&·s,·Transformation&·t)
+·121·{
+·122·return
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transform(s,t);
+·123·}
+·124
+·static·transformed_type·transform(std::shared_ptr<const·SourceTree>·sp,
+const·Transformation&·t·=·Transformation())
+·127·{
+·128·return
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transform(sp,t);
+·129·}
+·130
+·static·transformed_type·transform(std::shared_ptr<const·SourceTree>·sp,
+Transformation&·t)
+·133·{
+·134·return
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transform(sp,t);
+·135·}
+·136
+·static·transformed_storage_type·transform_storage(std::shared_ptr<const
+SourceTree>·sp,·const·Transformation&·t·=·Transformation())
+·140·{
+·141·return
+TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
+recursive>::transform_storage(sp,t);
+·142·}
+·143

+dune-typetree 2.9
+····*·dune
+····*·typetree
+Classes·|·Namespaces
+fixedcapacitystack.hh·File·Reference
+#include·<array>
+#include·<cassert>
+accumulate_static.hh·File·Reference
+#include·<dune/common/typetraits.hh>
+#include·<dune/typetree/nodeinterface.hh>
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/typetree/treepath.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+class· Dune::TypeTree::FixedCapacityStackView<_T_>
+struct· Dune::TypeTree::or_<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·||.·More...
+class· Dune::TypeTree::FixedCapacityStack<_T,_capacity_>
+struct· Dune::TypeTree::or_<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::and_<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·&&.·More...
+struct· Dune::TypeTree::and_<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::plus<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·+.·More...
+struct· Dune::TypeTree::plus<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::minus<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·-.·More...
+struct· Dune::TypeTree::minus<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::multiply<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·*.·More...
+struct· Dune::TypeTree::multiply<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::min<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·by·returning·their
+·········minimum.·More...
+struct· Dune::TypeTree::min<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::max<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·by·returning·their
+·········maximum.·More...
+struct· Dune::TypeTree::max<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::AccumulateValue<_Tree,_Functor,_Reduction,_startValue,
+·········ParentChildReduction_>
+ ·······Statically·accumulate·a·value·over·the·nodes·of·a·TypeTree.·More...
+struct· Dune::TypeTree::TypeAccumulationPolicy<_Functor,_Reduction,_StartType,
+·········ParentChildReduction,_ReductionAlgorithm_>
+struct· Dune::TypeTree::AccumulateType<_Tree,_Policy_>
+ ·······Statically·accumulate·a·type·over·the·nodes·of·a·TypeTree.·More...
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+namespace· Dune::TypeTree::Experimental
+·Functions
+template<typename·Tree·,·typename·Visitor·,·typename·Init·>
+auto Dune::TypeTree::Experimental::hybridApplyToTree·(Tree·&&tree,·Visitor
+······&&visitor,·Init·&&init)
+ ····Apply·hybrid·visitor·to·TypeTree.·More...
+*****·Variable·Documentation·*****
+*****·◆ child_result·*****
+const·result_type·child_result·=
+accumulate_value<child,Functor,Reduction,ParentChildReduction,current_value,child_tree_path,NodeTag<child>>::·static
+result
+*****·◆ result·*****
+const·result_type·result·=·current_value·static
+===============================================================================
+·····Generated·by [doxygen]·1.9.4


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml">	2	<html·xmlns="http://www.w3.org/1999/xhtml">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.4"/>	6	<meta·name="generator"·content="Doxygen·1.9.4"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>dune-typetree:·~~childe~~x~~traction~~.hh·Source·File</title>	8	<title>dune-typetree:·proxynode.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 62, 284 lines modified		Offset 62, 351 lines modified

62	<div·id="nav-path"·class="navpath">	62	<div·id="nav-path"·class="navpath">
63	··<ul>	63	··<ul>
64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
65	</div>	65	</div>
66	</div><!--·top·-->	66	</div><!--·top·-->
67	<div·class="header">	67	<div·class="header">
68	··<div·class="headertitle"><div·class="title">~~childe~~x~~traction~~.hh</div></div>	68	··<div·class="headertitle"><div·class="title">proxynode.hh</div></div>
69	</div><!--header-->	69	</div><!--header-->
70	<div·class="contents">	70	<div·class="contents">
71	<a·href="a00008.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	71	<a·href="a00008.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=8·sw=2·sts=2:</span></div>	72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_~~CHILDE~~X~~TRACTION~~_HH</span></div>	74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_PROXYNODE_HH</span></div>
75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_~~CHILDE~~X~~TRACTION~~_HH</span></div>	75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_PROXYNODE_HH</span></div>
76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>	77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>
78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>	78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<<a·class="code"·href="a00029.html">dune/typetree/nodeinterface.hh</a>></span></div>
79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>	79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<<a·class="code"·href="a00056.html">dune/typetree/nodetags.hh</a>></span></div>
80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<dune/common/~~conc~~ept.hh></span></div>	80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<dune/common/shared_ptr.hh></span></div>
81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<dune/common/~~docum~~ent~~ation~~.hh></span></div>	81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<dune/common/indices.hh></span></div>
82	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/typetraits.hh></span></div>	82	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/std/type_traits.hh></span></div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml">	2	<html·xmlns="http://www.w3.org/1999/xhtml">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.4"/>	6	<meta·name="generator"·content="Doxygen·1.9.4"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>dune-typetree:·p~~owern~~ode.hh·Source·File</title>	8	<title>dune-typetree:·visitor.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 62, 355 lines modified		Offset 62, 333 lines modified

62	<div·id="nav-path"·class="navpath">	62	<div·id="nav-path"·class="navpath">
63	··<ul>	63	··<ul>
64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
65	</div>	65	</div>
66	</div><!--·top·-->	66	</div><!--·top·-->
67	<div·class="header">	67	<div·class="header">
68	··<div·class="headertitle"><div·class="title">p~~owern~~ode.hh</div></div>	68	··<div·class="headertitle"><div·class="title">visitor.hh</div></div>
69	</div><!--header-->	69	</div><!--header-->
70	<div·class="contents">	70	<div·class="contents">
71	<a·href="a00011.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	71	<a·href="a00011.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_P~~OWERN~~ODE_HH</span></div>	74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_VISITOR_HH</span></div>
75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_P~~OWERN~~ODE_HH</span></div>	75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_VISITOR_HH</span></div>
76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<cassert></span></div>	77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<<a·class="code"·href="a00041.html">dune/typetree/treepath.hh</a>></span></div>
78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<array></span></div>	78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<<a·class="code"·href="a00047.html">dune/typetree/utility.hh</a>></span></div>
79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>~~<span·class="preprocessor">#include~~·~~<memory></span>~~</div>	79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>
		80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="keyword">namespace·</span><a·class="code·hl_namespace"·href="a00097.html">Dune</a>·{</div>
80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="prepro~~cess~~or">#include~~·<typ~~e~~_traits></span>~~</div>	81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>··<span·class="keyword">namespace·</span>TypeTree·{</div>
81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>	82	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span>·</div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml">	2	<html·xmlns="http://www.w3.org/1999/xhtml">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.4"/>	6	<meta·name="generator"·content="Doxygen·1.9.4"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>dune-typetree:·typetraits.hh·Source·File</title>	8	<title>dune-typetree:·treecontainer.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 62, 248 lines modified		Offset 62, 297 lines modified

62	<div·id="nav-path"·class="navpath">	62	<div·id="nav-path"·class="navpath">
63	··<ul>	63	··<ul>
64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
65	</div>	65	</div>
66	</div><!--·top·-->	66	</div><!--·top·-->
67	<div·class="header">	67	<div·class="header">
68	··<div·class="headertitle"><div·class="title">typetraits.hh</div></div>	68	··<div·class="headertitle"><div·class="title">treecontainer.hh</div></div>
69	</div><!--header-->	69	</div><!--header-->
70	<div·class="contents">	70	<div·class="contents">
71	<a·href="a00014.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	71	<a·href="a00014.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TYPETRAITS_HH</span></div>	74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TREECONTAINER_HH</span></div>
75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TYPETRAITS_HH</span></div>	75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TREECONTAINER_HH</span></div>
76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>	77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>
78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<du~~ne/common/type~~trait~~s.h~~h></span></div>	78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>
79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>	79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<functional></span></div>
80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<~~<a·class="code"·href="~~a~~00062.html">dune/typet~~r~~ee/t~~r~~eepath.hh</~~a>></span></div>	80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<array></span></div>
81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<<a·class="code"·href="a00053.html">dune/typetree/nodeinterface.hh</a>></span></div>
82	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span>·</div>	81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml">	2	<html·xmlns="http://www.w3.org/1999/xhtml">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.4"/>	6	<meta·name="generator"·content="Doxygen·1.9.4"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>dune-typetree:·treecontainer.hh·Source·File</title>	8	<title>dune-typetree:·powercompositenodetransformationtemplates.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 62, 297 lines modified		Offset 62, 77 lines modified

62	<div·id="nav-path"·class="navpath">	62	<div·id="nav-path"·class="navpath">
63	··<ul>	63	··<ul>
64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	64	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
65	</div>	65	</div>
66	</div><!--·top·-->	66	</div><!--·top·-->
67	<div·class="header">	67	<div·class="header">
68	··<div·class="headertitle"><div·class="title">treecontainer.hh</div></div>	68	··<div·class="headertitle"><div·class="title">powercompositenodetransformationtemplates.hh</div></div>
69	</div><!--header-->	69	</div><!--header-->
70	<div·class="contents">	70	<div·class="contents">
71	<a·href="a00017.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	71	<a·href="a00017.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	72	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	73	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TREECONTAINER_HH</span></div>	74	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH</span></div>
75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TREECONTAINER_HH</span></div>	75	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH</span></div>
76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	76	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<~~typ~~e_tr~~aits~~></span></div>	77	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<cstddef></span></div>
78	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>
79	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<functional></span></div>
80	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<array></span></div>
81	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>
82	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/indices.hh></span></div>


Offset 4, 712 lines modified		Offset 4, 209 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	~~accumul~~a~~te_~~static.hh	7	fixedcapacitystack.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=4·sw=2·sts=2:	10	·2//·vi:·set·et·ts=8·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_~~ACCUMUL~~A~~TE_~~STATIC_HH	12	·4#ifndef·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
13	·5#define·DUNE_TYPETREE_~~ACCUMUL~~A~~TE_~~STATIC_HH	13	·5#define·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
14	·6	14	·6
15	·7#include·<dune/common/typetraits.hh>
16	·8#include·<dune/typetree/nodeinterface.hh>
17	·9#include·<dune/typetree/nodetags.hh>
18	·10#include·<dune/typetree/treepath.hh>
19	·11	15	·7#include·<array>
		16	·8#include·<cassert>
		17	·9
		18	·10namespace·Dune·{
		19	·11·namespace·TypeTree·{
20	·12	20	·12
		21	·13
		22	·17
		23	·18·template<typename·T>
		24	19·class·FixedCapacityStackView
21	13namespace·Dune·{
22	14·namespace·TypeTree·{
23	·15
24	·22·template<typename·result_type>
25	23·struct·or_
26	·24·{	25	·20·{
27	·25·template<result_type·r1,·result_type·r2>
28	~~26·struct~~·~~redu~~ce	26	·21
		27	·22·public:
		28	·23
		29	·24·struct·Impl
29	·27·{	30	·25·{
30	28·static·const·result_type·result·=·r1·\|\|·r2;
31	·2~~9·}~~;	31	·26
		32	·27·Impl(T*·data,·std::size_t·capacity)
		33	·28·:·_data(data)
		34	·29·,·_size(0)
		35	·30·,·_capacity(capacity)
		36	·31·{}
		37	·32
		38	·33·T·*·const·_data;
		39	·34·std::size_t·_size;
		40	·35·const·std::size_t·_capacity;
32	·30·};	41	·36·};
		42	·37
		43	38·FixedCapacityStackView(Impl&·impl)
		44	·39·:·_impl(impl)
33	·31
34	·33·template<typename·result_type>
35	34·struct·and_
36	·35·{
37	·36·template<result_type·r1,·result_type·r2>
38	37·struct·reduce
39	·38·{
40	39·static·const·result_type·result·=·r1·&&·r2;
41	·40·};	45	·40·{}
42	·41·};
43	·42
44	·44·template<typename·result_type>
45	~~45·struct~~·plus	46	·41
		47	·42·public:
		48	·43
		49	44·std::size_t·size()·const
46	·46·{	50	·45·{
47	·47·template<result_type·r1,·result_type·r2>
48	48·struct·reduce
49	·49·{
50	50·static·const·result_type·result·=·r1·+·r2;
51	·51·};	51	·46·return·_impl._size;
		52	·47·}
		53	·48
		54	49·std::size_t·capacity()·const
		55	·50·{
		56	·51·return·_impl._capacity;
52	·52·};	57	·52·}
53	·53	58	·53
		59	54·bool·empty()·const
54	·55·template<typename·result_type>
55	56·struct·minus
56	·57·{	60	·55·{
57	·58·template<result_type·r1,·result_type·r2>
58	59·str~~uct·r~~e~~duce~~	61	·56·return·_impl._size·==·0;
		62	·57·}
		63	·58
		64	59·bool·full()·const
59	·60·{	65	·60·{
60	61·stat~~ic·~~const·~~resu~~lt_~~typ~~e·~~result·=·r1·-·r2~~;	66	·61·return·_impl._size·==·_impl._capacity;
61	·62·};	67	·62·}
		68	·63
		69	64·void·push_back(const·T&·t)
62	·63·};
63	·64
64	·66·template<typename·result_type>
65	67·struct·multiply
66	·68·{	70	·65·{
67	·69·template<result_type·r1,·result_type·r2>
68	70·str~~uct·reduce~~	71	·66·assert(!full());
		72	·67·_impl._data[_impl._size++]·=·t;
		73	·68·}
		74	·69
		75	70·void·pop_back()
69	·71·{	76	·71·{
70	72·static·const·result_type·result·=·r1·*·r2;
71	·73·};	77	·72·assert(!empty());
		78	·73·--_impl._size;
72	·74·};	79	·74·}
73	·75	80	·75
		81	76·T&·back()
74	·77·template<typename·result_type>
75	78·struct·min
76	·79·{	82	·77·{
77	·80·template<result_type·r1,·result_type·r2>
78	81·st~~ruct·reduce~~	83	·78·assert(!empty());
		84	·79·return·_impl._data[_impl._size-1];
		85	·80·}
		86	·81
		87	82·const·T&·back()·const
79	·82·{	88	·83·{
Max diff block lines reached; 22264/26485 bytes (84.06%) of diff not shown.


Offset 5, 28 lines modified		Offset 5, 28 lines modified

5	dune-typetree 2.9	5	dune-typetree 2.9


6	····*·dune	6	····*·dune
7	····*·typetree	7	····*·typetree
8	Classes·\|·Namespaces	8	Classes·\|·Namespaces
9	dynamicpo~~wer~~node.hh·File·Reference	9	compositenode.hh·File·Reference
		10	#include·<tuple>
10	#include·<cassert>
11	#include·<vector>
12	#include·<memory>	11	#include·<memory>
13	#include·<type_traits>	12	#include·<type_traits>
14	#include·<dune/common/typetraits.hh>
15	#include·<dune/common/std/type_traits.hh>
16	#include·<dune/typetree/nodetags.hh>	13	#include·<dune/typetree/nodetags.hh>
17	#include·<dune/typetree/utility.hh>	14	#include·<dune/typetree/childextraction.hh>
18	#include·<dune/typetree/typetraits.hh>	15	#include·<dune/typetree/typetraits.hh>
19	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
20	·Classes	17	·Classes
21	class· Dune::TypeTree::DynamicPowerNode<_T_>
22	~~·····~~·~~Colle~~c~~t·mu~~lti~~ple~~·in~~sta~~nce~~s·of·t~~ype·T~~·within·a·dun~~e-~~typ~~et~~ree.·Mo~~re~~...~~	18	·class· Dune::TypeTree::CompositeNode<_Children_>
		19	·······Base·class·for·composite·nodes·based·on·variadic·templates.·More...
		20
		21	struct· Dune::TypeTree::CompositeNode<_Children_>::Child<_k_>
		22	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
23		23
24	·Namespaces	24	·Namespaces
25	namespace· Dune	25	namespace· Dune
26		26
27	namespace· Dune::TypeTree	27	namespace· Dune::TypeTree
28		28


Offset 4, 255 lines modified		Offset 4, 331 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	dynamicpo~~wer~~node.hh	7	compositenode.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=4·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_DYNAMICPO~~WER~~NODE_HH	12	·4#ifndef·DUNE_TYPETREE_COMPOSITENODE_HH
13	·5#define·DUNE_TYPETREE_DYNAMICPO~~WER~~NODE_HH	13	·5#define·DUNE_TYPETREE_COMPOSITENODE_HH
14	·6	14	·6
		15	·7#include·<tuple>
15	·7#include·<cassert>
16	·8#include·<vector>
17	·9#include·<memory>	16	·8#include·<memory>
18	·10#include·<type_traits>	17	·9#include·<type_traits>
19	·11	18	·10
		19	·11#include·<dune/typetree/nodetags.hh>
		20	·12#include·<dune/typetree/childextraction.hh>
20	·12#include·<dune/~~common~~/typetraits.hh>	21	·13#include·<dune/typetree/typetraits.hh>
21	·13#include·<dune/common/std/type_traits.hh>
22	·14	22	·14
23	·15#include·<dune/typetree/nodetags.hh>
24	·16#include·<dune/typetree/utility.hh>
25	·17#include·<dune/typetree/typetraits.hh>
26	·18
27	·19namespace·Dune·{	23	·15namespace·Dune·{
28	·20·namespace·TypeTree·{	24	·16·namespace·TypeTree·{
29	·21
30	·31·template<typename·T>
31	32·class·DynamicPowerNode
32	·33·{
33	·34	25	·17
		26	·24·template<typename...·Children>
		27	25·class·CompositeNode
		28	·26·{
		29	·27
34	·35·public:	30	·28·public:
35	·36	31	·29
		32	31·typedef·CompositeNodeTag·NodeTag;
		33	·32
		34	34·typedef·std::tuple<std::shared_ptr<Children>...·>·NodeStorage;
		35	·35
		36	37·typedef·std::tuple<Children...>·ChildTypes;
		37	·38
36	38·static·const·bool·isLeaf·=·false;	38	40·static·const·bool·isLeaf·=·false;
37	·39	39	·41
38	41·static·const·bool·isPower·=·~~tru~~e;	40	43·static·const·bool·isPower·=·false;
39	·42	41	·44
40	44·static·const·bool·isComposite·=·f~~als~~e;	42	46·static·const·bool·isComposite·=·true;
		43	·47
		44	·49·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
		45	50·static·const·std::size_t·CHILDREN·=·sizeof...(Children);
41	·45
42	47·std::size_t·degree()·const
43	·48·{
44	·49·return·_children.size();
45	·50·}
46	·51	46	·51
47	53·typedef·DynamicPowerNodeTag·NodeTag;
48	·54
49	56·typedef·T·ChildType;
50	·57
51	59·t~~ypedef~~·st~~d::~~shared_ptr~~<T>~~·~~Chil~~dStorag~~eType;~~	47	52·static·constexpr·auto·degree·()
		48	·53·{
		49	·54·return·std::integral_constant<std::size_t,sizeof...(Children)>{};
		50	·55·}
		51	·56
		52	·58·template<std::size_t·k>
		53	59·struct·Child·{
52	·60	54	·60
53	62·typedef·std::shared_ptr<const·T>·ChildConstStorageType;
54	·63
55	65·typedef·std::vector<ChildStorageType>·NodeStorage;
56	·66
57	·67
58	·70	55	·61·static_assert((k·<·degree()),·"child·index·out·of·range");
		56	·62
		57	64·typedef·typename·std::tuple_element<k,ChildTypes>::type·Type;
		58	·65
		59	67·typedef·typename·std::tuple_element<k,ChildTypes>::type·type;
		60	·68·};
		61	·69
59	·72	62	·72
60	~~75·ChildType&·child·(std::size_t~~·i)	63	·74
		64	·77·template<std::size_t·k>
		65	78·typename·Child<k>::Type&·child·(index_constant<k>·=·{})
61	·76·{	66	·79·{
		67	·80·return·*std::get<k>(_children);
		68	·81·}
62	·77·assert(i·<·degree()·&&·"child·index·out·of·range");
63	·78·return·*_children[i];
64	·79·}
65	·80
66	·82	69	·82
67	~~85·const·ChildType&·child·(std::size_t·i)~~·~~con~~st	70	·84
		71	·87·template<std::size_t·k>
		72	88·const·typename·Child<k>::Type&·child·(index_constant<k>·=·{})·const
68	·86·{	73	·89·{
		74	·90·return·*std::get<k>(_children);
69	·87·assert(i·<·degree()·&&·"child·index·out·of·range");
70	·88·return·*_children[i];
71	·89·}	75	·91·}
72	·90
73	·92	76	·92
74	~~95·ChildStorageType·childStorage·(std::size_t~~·i)	77	·94
		78	·97·template<std::size_t·k>
		79	98·std::shared_ptr<typename_Child<k>::Type>·childStorage·(index_constant<k>·=
		80	{})
75	·96·{	81	·99·{
		82	·100·return·std::get<k>(_children);
		83	·101·}
76	·97·assert(i·<·degree()·&&·"child·index·out·of·range");
77	·98·return·_children[i];
78	·99·}
79	·100
80	·102	84	·102
81	~~108·ChildConstStorageType·childStorage·(std::size_t·i)~~·co~~nst~~	85	·104
		86	·107·template<std::size_t·k>
		87	108·std::shared_ptr<const_typename_Child<k>::Type>·childStorage
		88	(index_constant<k>·=·{})·const
82	·109·{	89	·109·{
		90	·110·return·std::get<k>(_children);
Max diff block lines reached; 13540/17536 bytes (77.21%) of diff not shown.


Offset 4, 25 lines modified		Offset 4, 45 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
		7	Classes·\|·Namespaces·\|·Typedefs·\|·Functions
		8	nodeinterface.hh·File·Reference
7	Classes·\|·Namespaces
8	fixedcapacitystack.hh·File·Reference
9	#include·<array>
10	#include·<c~~assert~~>	9	#include·<cstddef>
		10	#include·<type_traits>
		11	#include·<dune/common/documentation.hh>
11	Go_to_the_source_code_of_this_file.	12	Go_to_the_source_code_of_this_file.
12	·Classes	13	·Classes
		14	struct· Dune::TypeTree::NodeInterface
		15	·······Interface·for·nodes·in·a·dune-typetree.·More...
13	class· Dune::TypeTree::FixedCapacityStackView<_T_>
14
15	class· Dune::TypeTree::FixedCapacityStack<_T,_capacity_>
16		16
17	·Namespaces	17	·Namespaces
18	namespace· Dune	18	namespace· Dune
19		19
20	namespace· Dune::TypeTree	20	namespace· Dune::TypeTree
21		21
		22	·Typedefs
		23	template<typename·Node·>
		24	using Dune::TypeTree::NodeTag·=·typename·std::decay_t<·Node·>::NodeTag
		25	·····Returns·the·node·tag·of·the·given·Node.·More...
		26
		27	template<typename·T·>
		28	using Dune::TypeTree::ImplementationTag·=·typename·std::decay_t<·T·>::
		29	·······ImplementationTag
		30	·····Returns·the·implementation·tag·of·the·given·Node.·More...
		31
		32	template<typename·Node·>
		33	using Dune::TypeTree::StaticDegree·=·decltype(Node::degree())
		34	·····Returns·the·statically·known·degree·of·the·given·Node·type·as·a·std::
		35	·······integral_constant.·More...
		36
		37	·Functions
		38	template<typename·Node·>
		39	std::size_t Dune::TypeTree::degree·(const·Node·&node)
		40	···········Returns·the·degree·of·node·as·run·time·information.·More...
		41

22	===============================================================================	42	===============================================================================
23	·····Generated·by [doxygen]·1.9.4	43	·····Generated·by [doxygen]·1.9.4


Offset 4, 209 lines modified		Offset 4, 129 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	fixed~~capaci~~t~~yst~~ack.hh	7	nodeinterface.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=8·sw=2·sts=2:	10	·2//·vi:·set·et·ts=8·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
13	·5#define·DUNE_TYPETREE_FIXED~~CAPACI~~T~~YST~~ACK_HH	12	·4#ifndef·DUNE_TYPETREE_NODEINTERFACE_HH
		13	·5#define·DUNE_TYPETREE_NODEINTERFACE_HH
14	·6	14	·6
15	·7#include·<array>
16	·8#include·<c~~assert~~>	15	·7#include·<cstddef>
		16	·8#include·<type_traits>
17	·9	17	·9
		18	·10#include·<dune/common/documentation.hh>
		19	·11
18	·10namespace·Dune·{	20	·12namespace·Dune·{
19	·11·namespace·TypeTree·{	21	·13·namespace·TypeTree·{
		22	·14
		23	32·struct·NodeInterface
		24	·33·{
		25	35·static·const·bool·isLeaf·=·implementationDefined;
		26	·36
		27	38·static·const·bool·isPower·=·implementationDefined;
		28	·39
		29	41·static·const·bool·isComposite·=·implementationDefined;
		30	·42
		31	·44
		32	49·static·const·std::size_t·CHILDREN·=·implementationDefined;
20	·12
21	·13
22	·17
23	·18·template<typename·T>
24	19·class·FixedCapacityStackView
25	·20·{
26	·21
27	·22·public:
28	·23
29	·24·struct·Impl
30	·25·{
31	·26
32	·27·Impl(T*·data,·std::size_t·capacity)
33	·28·:·_data(data)
34	·29·,·_size(0)
35	·30·,·_capacity(capacity)
36	·31·{}
37	·32
38	·33·T·*·const·_data;
39	·34·std::size_t·_size;
40	·35·const·std::size_t·_capacity;
41	·36·};
42	·37
43	38·FixedCapacityStackView(Impl&·impl)
44	·39·:·_impl(impl)
45	·40·{}
46	·41
47	·42·public:
48	·43
49	44·std::size_t·size()·const
50	·45·{
51	·46·return·_impl._size;
52	·47·}
53	·48
54	49·std::size_t·capacity()·const
55	·50·{	33	·50
56	·51·return·_impl._capacity;
57	·52·}	34	·52
		35	57·static·auto·degree();
58	·53
59	54·bool·empty()·const
60	·55·{
61	·56·return·_impl._size·==·0;
62	·57·}
63	·58	36	·58
64	59·bool·full()·const
65	·60·{	37	·60
		38	65·typedef·ImplementationDefined·NodeTag;
		39	·66
66	·61·return·_impl._size·==·_impl._capacity;
67	·62·}
68	·63
69	64·void·push_back(const·T&·t)
70	·65·{
71	·66·assert(!full());
72	·67·_impl._data[_impl._size++]·=·t;
73	·68·}	40	·68
		41	71·typedef·ImplementationDefined·NodeStorage;
		42	·72·};
		43	·73
		44	·75·template<typename·Node>
		45	76·using·NodeTag·=·typename·std::decay_t<Node>::NodeTag;
74	·69
75	70·void·pop_back()
76	·71·{
77	·72·assert(!empty());
78	·73·--_impl._size;
79	·74·}
80	·75
81	76·T&·back()
82	·77·{	46	·77
		47	·79·template<typename·T>
		48	80·using·ImplementationTag·=·typename·std::decay_t<T>::ImplementationTag;
83	·78·assert(!empty());
84	·79·return·_impl._data[_impl._size-1];
85	·80·}
86	·81	49	·81
87	~~82·const·T&·back()~~·~~con~~st	50	·82
		51	·84·template<typename·Node>
		52	85·std::size_t·degree(const·Node&·node)
88	·83·{	53	·86·{
		54	·87·return·degree(&node,NodeTag<Node>());
89	·84·assert(!empty());
90	·85·return·_impl._data[_impl._size-1];
91	·86·}	55	·88·}
92	·87
93	88·T&·front()
94	·89·{	56	·89
		57	·90#ifndef·DOXYGEN
		58	·91
95	·90·assert(!empty());
96	·91·return·_impl._data[0];
Max diff block lines reached; 5457/8157 bytes (66.90%) of diff not shown.

+dune-typetree 2.9
+····*·dune
+····*·typetree
+accumulate_static.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_HH
+·4#ifndef·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
+·5#define·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
+·6
+·7#include·<dune/common/typetraits.hh>
+·8#include·<dune/typetree/nodeinterface.hh>
+·9#include·<dune/typetree/nodetags.hh>
+·8#include·<dune/typetree/utility.hh>
+·9#include·<dune/typetree/leafnode.hh>
+·10#include·<dune/typetree/powernode.hh>
+·11#include·<dune/typetree/dynamicpowernode.hh>
+·12#include·<dune/typetree/compositenode.hh>
+·10#include·<dune/typetree/treepath.hh>
+·14#include·<dune/typetree/pairtraversal.hh>
+·15#include·<dune/typetree/traversalutilities.hh>
+·16#include·<dune/typetree/transformation.hh>
+·17#include·<dune/typetree/transformationutilities.hh>
+·18#include·<dune/typetree/accumulate_static.hh>
+·11
+·12
+namespace·Dune·{
+·namespace·TypeTree·{
+·15
+·22·template<typename·result_type>
+·struct·or_
+·24·{
+·25·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·27·{
+·static·const·result_type·result·=·r1·||·r2;
+·29·};
+·30·};
+·31
+·33·template<typename·result_type>
+·struct·and_
+·35·{
+·36·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·38·{
+·static·const·result_type·result·=·r1·&&·r2;
+·40·};
+·41·};
+·42
+·44·template<typename·result_type>
+·struct·plus
+·46·{
+·47·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·49·{
+·static·const·result_type·result·=·r1·+·r2;
+·51·};
+·52·};
+·53
+·55·template<typename·result_type>
+·struct·minus
+·57·{
+·58·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·60·{
+·static·const·result_type·result·=·r1·-·r2;
+·62·};
+·63·};
+·64
+·66·template<typename·result_type>
+·struct·multiply
+·68·{
+·69·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·71·{
+·static·const·result_type·result·=·r1·*·r2;
+·73·};
+·74·};
+·75
+·77·template<typename·result_type>
+·struct·min
+·79·{
+·80·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·82·{
+·static·const·result_type·result·=·r1·<·r2·?·r1·:·r2;
+·84·};
+·85·};
+·86
+·88·template<typename·result_type>
+·struct·max
+·90·{
+·91·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·93·{
+·static·const·result_type·result·=·r1·>·r2·?·r1·:·r2;
+·95·};
+·96·};
+·97
+·98
+·99·namespace·{
+·100
+·101·//·implementation·of·the·traversal·algorithm
+·102
+·104·template<typename·Node,·typename·Functor,·typename·Reduction,·typename
+Functor::result_type·current_value,·typename·TreePath,·bool·doVisit>
+·105·struct·accumulate_node_helper
+·106·{
+·107
+·108·typedef·typename·Functor::result_type·result_type;
+·109
+·static·const·result_type·result·=·current_value;
+·111
+·112·};
+·113
+·115·template<typename·Node,·typename·Functor,·typename·Reduction,·typename
+Functor::result_type·current_value,·typename·TreePath>
+·116·struct
+accumulate_node_helper<Node,Functor,Reduction,current_value,TreePath,true>
+·117·{
+·118


Offset 5, 30 lines modified		Offset 5, 42 lines modified

5	dune-typetree 2.9	5	dune-typetree 2.9


6	····*·dune	6	····*·dune
7	····*·typetree	7	····*·typetree
8	Classes·\|·Namespaces	8	Classes·\|·Namespaces
9	utility.hh·File·Reference	9	simpletransformationdescriptors.hh·File·Reference
		10	#include·<array>
10	#include·<memory>	11	#include·<memory>
11	#include·<tuple>
12	#include·<type_traits>
13	#include·<utility>
14	#include·<algorithm>
15	#include·<dune/common/shared_ptr.hh>
16	#include·<dune/common/indices.hh>
17	#include·<dune/common/hybridutilities.hh>
18	#include·<dune/typetree/nodeinterface.hh>	12	#include·<dune/typetree/nodeinterface.hh>
19	#include·<dune/typetree/nodetags.hh>	13	#include·<dune/typetree/nodetags.hh>
		14	#include·<dune/common/exceptions.hh>
20	Go_to_the_source_code_of_this_file.	15	Go_to_the_source_code_of_this_file.
21	·Classes	16	·Classes
22	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
23	·······Struct·for·obtaining·some·basic·structural·information·about·a
24	··~~·······~~TypeTree~~.·M~~ore~~...~~	17	struct· Dune::TypeTree::SimpleLeafNodeTransformation<_SourceNode,
		18	·········Transformation,_TransformedNode_>
		19
		20	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
		21	·········Transformation,_TransformedNode_>
		22
		23	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
		24	·········Transformation,_TransformedNode_>::result<_TC_>
		25
		26	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
		27	·········Transformation,_TransformedNode_>
		28
		29	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
		30	·········Transformation,_TransformedNode_>::result<_TC_>
		31
		32	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
		33	·········Transformation,_TransformedNode_>
		34
		35	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
		36	·········Transformation,_TransformedNode_>::result<_TC_>
25		37
26	·Namespaces	38	·Namespaces
27	namespace· Dune	39	namespace· Dune
28		40
29	namespace· Dune::TypeTree	41	namespace· Dune::TypeTree
30		42


Offset 4, 321 lines modified		Offset 4, 251 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	utility.hh	7	simpletransformationdescriptors.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=4·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_UTILITY_HH
13	·5#define·DUNE_TYPETREE_UTILITY_HH	12	·4#ifndef·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
		13	·5#define·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
14	·6	14	·6
		15	·7#include·<array>
15	·7#include·<memory>	16	·8#include·<memory>
		17	·9
16	·8#include·<tuple>
17	·9#include·<type_traits>
18	·10#include·<utility>
19	·11#include·<algorithm>
20	·12
21	·13#include·<dune/common/shared_ptr.hh>
22	·14#include·<dune/common/indices.hh>
23	·15#include·<dune/common/hybridutilities.hh>
24	·16#include·<dune/typetree/nodeinterface.hh>	18	·10#include·<dune/typetree/nodeinterface.hh>
25	·17#include·<dune/typetree/nodetags.hh>	19	·11#include·<dune/typetree/nodetags.hh>
26	·18	20	·12#include·<dune/common/exceptions.hh>
		21	·13
		22	·14
27	·19namespace·Dune·{	23	·15namespace·Dune·{
28	·20·namespace·TypeTree·{	24	·16·namespace·TypeTree·{
		25	·17
		26	·23·template<typename·SourceNode,·typename·Transformation,·typename
		27	TransformedNode>
		28	24·struct·SimpleLeafNodeTransformation
29	·21
30	·26#ifndef·DOXYGEN
31	·27
32	·28·template<typename·T>
33	·29·std::shared_ptr<T>·convert_arg(const·T&·t)
34	·30·{
35	·31·return·std::make_shared<T>(t);
36	·32·}
37	·33
38	·34·template<typename·T>
39	·35·std::shared_ptr<T>·convert_arg(T&·t)
40	·36·{
41	·37·return·stackobject_to_shared_ptr(t);
42	·38·}
43	·39
44	·40·template<typename·BaseType,·typename·T>
45	·41·T&·assertGridViewType(T&·t)
46	·42·{	29	·25·{
47	·43·static_assert((std::is_same<typename·BaseType::Traits::GridViewType,
48	·44·typename·T::Traits::GridViewType>::value),
49	·45·"GridViewType·must·be·equal·in·all·components·of·composite·type");
50	·46~~·return·t;~~	30	·26
		31	27·static·const·bool·recursive·=·false;
		32	·28
		33	29·typedef·TransformedNode·transformed_type;
		34	30·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
		35	·31
		36	32·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
		37	t)
		38	·33·{
		39	·34·return·transformed_type();
		40	·35·}
		41	·36
		42	37·static·transformed_storage_type·transform_storage(std::shared_ptr<const
		43	SourceNode>·s,·const·Transformation&·t)
		44	·38·{
		45	·39·return·std::make_shared<transformed_type>();
51	·47·}	46	·40·}
		47	·41
		48	·42·};
		49	·43
		50	·44
		51	·45·template<typename·SourceNode,·typename·Transformation,·template<typename
		52	Child,·std::size_t>·class·TransformedNode>
		53	46·struct·SimplePowerNodeTransformation
		54	·47·{
52	·48	55	·48
53	·49·//·only·b~~ind~~·~~to·~~r~~eal~~·~~rval~~ues	56	49·static·const·bool·recursive·=·true;
		57	·50
54	·50·template<typename·T>	58	·51·template<typename·TC>
		59	52·struct·result
55	·51·typename·std::enable_if<!std::is_lvalue_reference<T>::value,std::
56	shared_ptr<T>·>::type·convert_arg(T&&·t)
57	·52·{	60	·53·{
		61	54·typedef·TransformedNode<TC,·StaticDegree<SourceNode>::value>·type;
		62	55·typedef·std::shared_ptr<type>·storage_type;
		63	56·static·const·std::size_t·degree·=·StaticDegree<type>::value;
		64	·57·};
58	·53·return·std::make_shared<T>(std::forward<T>(t));
59	·54·}
60	·55
61	·56
62	·57·namespace·Experimental·{
63	·58	65	·58
64	·67·template<class·BinaryOp,·class·Arg>
65	·68·constexpr·decltype(auto)
66	·69·~~lef~~t~~_fo~~ld(~~Binar~~yOp~~&&·b~~ina~~ry_op,·Arg~~&&·a~~rg)~~	66	·59·template<typename·TC>
		67	60·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
		68	Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
		69	children)
		70	·61·{
		71	·62·return·typename·result<TC>::type(children);
		72	·63·}
		73	·64
		74	·65·template<typename·TC>
		75	66·static·typename·result<TC>::storage_type·transform_storage(std::
		76	shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
		77	shared_ptr<TC>,result<TC>::degree>&·children)
67	·70·{	78	·67·{
68	·71·return·std::~~forw~~ard<Arg>(arg);	79	·68·return·std::make_shared<typename·result<TC>::type>(children);
		80	·69·}
		81	·70
		82	·71·};
69	·72·}	83	·72
70	·73	84	·73
71	·95·template<class·BinaryOp,·class·Init,·class·Arg0,·class...·Args>
72	·96·constexpr·decltype(auto)
73	·97·left~~_fo~~l~~d(BinaryOp&&~~·~~binary_~~op,·~~Ini~~t&~~&·i~~n~~it,~~·Ar~~g0&&·~~a~~rg_0~~,·~~Args&&...·args)~~	85	·74·template<typename·SourceNode,·typename·Transformation,·template<typename
		86	Child>·class·TransformedNode>
Max diff block lines reached; 12769/18047 bytes (70.75%) of diff not shown.


Offset 4, 37 lines modified		Offset 4, 35 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	Namespaces·\|·Functions
8	~~pair~~tra~~ver~~sal~~.hh~~·~~Fil~~e·~~Ref~~e~~ren~~ce	7	Classes·\|·Namespaces
		8	powernode.hh·File·Reference
		9	#include·<cassert>
		10	#include·<array>
		11	#include·<memory>
		12	#include·<type_traits>
		13	#include·<dune/common/typetraits.hh>
9	#include·<dune/common/std/type_traits.hh>	14	#include·<dune/common/std/type_traits.hh>
10	#include·<dune/typetree/nodeinterface.hh>
11	#include·<dune/typetree/nodetags.hh>	15	#include·<dune/typetree/nodetags.hh>
12	#include·<dune/typetree/treepath.hh>
13	#include·<dune/typetree/visitor.hh>	16	#include·<dune/typetree/utility.hh>
		17	#include·<dune/typetree/childextraction.hh>
14	#include·<dune/typetree/t~~rave~~r~~sal~~.hh>	18	#include·<dune/typetree/typetraits.hh>
15	Go_to_the_source_code_of_this_file.	19	Go_to_the_source_code_of_this_file.
		20	·Classes
		21	·class· Dune::TypeTree::PowerNode<_T,_k_>
		22	·······Collect·k·instances·of·type·T·within·a·dune-typetree.·More...
		23
		24	struct· Dune::TypeTree::PowerNode<_T,_k_>::Child<_i_>
		25	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
		26
16	·Namespaces	27	·Namespaces
17	namespace· Dune	28	namespace· Dune
18		29
19	namespace· Dune::TypeTree	30	namespace· Dune::TypeTree
20		31
21	namespace· Dune::TypeTree::Detail
22
23	·Functions
24	template<class·T1·,·class·T2·,·class·TreePath·,·class·V·,·std::enable_if_t<
25	(std::decay_t<·T1·>::isLeaf·or·std::decay_t<·T2·>::isLeaf),·int·>·=·0>
26	void Dune::TypeTree::Detail::applyToTreePair·(T1·&&tree1,·T2·&&tree2,·TreePath
27	······treePath,·V·&&visitor)
28
29	template<typename·Tree1·,·typename·Tree2·,·typename·Visitor·>
30	void Dune::TypeTree::applyToTreePair·(Tree1·&&tree1,·Tree2·&&tree2,·Visitor
31	······&&visitor)
32	····Apply·visitor·to·a·pair·of·TypeTrees.·More...
33

34	===============================================================================	32	===============================================================================
35	·····Generated·by [doxygen]·1.9.4	33	·····Generated·by [doxygen]·1.9.4

+dune-typetree 2.9
+····*·dune
+····*·typetree
+Classes·|·Namespaces·|·Typedefs·|·Enumerations·|·Functions
+treepath.hh·File·Reference
+#include·<cstddef>
+#include·<iostream>
+#include·<dune/common/documentation.hh>
+#include·<dune/common/typetraits.hh>
+#include·<dune/common/indices.hh>
+#include·<dune/common/hybridutilities.hh>
+#include·<dune/typetree/fixedcapacitystack.hh>
+#include·<dune/typetree/utility.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+class· Dune::TypeTree::Exception
+·class· Dune::TypeTree::HybridTreePath<_T_>
+ ·······A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run
+·········time·indices.·More...
+struct· Dune::TypeTree::TreePathSize<_HybridTreePath<_index_constant<_i_>..._>
+·········>
+struct· Dune::TypeTree::TreePathPushBack<_HybridTreePath<_index_constant<_i
+·········>..._>,_k_>
+struct· Dune::TypeTree::TreePathPushFront<_HybridTreePath<_index_constant<_i
+·········>..._>,_k_>
+struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_k_>_>_>
+struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_j_>,
+·········index_constant<_k_>,_index_constant<_l_>..._>_>
+struct· Dune::TypeTree::TreePathFront<_HybridTreePath<_index_constant<_k_>,
+·········index_constant<_i_>..._>_>
+struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_k_>
+·········>,_i..._>
+struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_j_>,
+·········index_constant<_k_>,_index_constant<_l_>..._>,_i..._>
+struct· Dune::TypeTree::TreePathPopFront<_HybridTreePath<_index_constant<_k_>,
+·········index_constant<_i_>..._>_>
+struct· Dune::TypeTree::TreePathConcat<_HybridTreePath<_index_constant<_i_>...
+·········>,_HybridTreePath<_index_constant<_k_>..._>_>
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+*****·Detailed·Description·*****
+namespace· Dune::TypeTree::TreePathType
+·Typedefs
+template<std::size_t...·i>
+using Dune::TypeTree::TreePath·=·HybridTreePath<·Dune::index_constant<·i·>...
+·······>
+template<std::size_t...·i>
+using Dune::TypeTree::StaticTreePath·=·HybridTreePath<·Dune::index_constant<·i
+·······>...·>
+·Enumerations
+enum· Dune::TypeTree::TreePathType::Type·{·Dune::TypeTree::TreePathType::
+·······fullyStatic·,·Dune::TypeTree::TreePathType::dynamic·}
+·Functions
+template<std::size_t...·i>
+·································void Dune::TypeTree::print_tree_path·(std::
+·······································ostream·&os)
+template<std::size_t·k,·std::size_t...·i>
+·································void Dune::TypeTree::print_tree_path·(std::
+·······································ostream·&os)
+template<typename...·T>
+·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::hybridTreePath·(const·T
+·······································&...·t)
+ ·····································Constructs·a·new·HybridTreePath·from·the
+·······································given·indices.·More...
+template<typename...·T>
+·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::treePath·(const·T·&...
+·······································t)
+ ·····································Constructs·a·new·HybridTreePath·from·the
+·······································given·indices.·More...
+template<typename...·T>
+················constexpr·std::size_t Dune::TypeTree::treePathSize·(const
+·······································HybridTreePath<·T...·>·&)
+ ·····································Returns·the·size·(number·of·components)
+·······································of·the·given·HybridTreePath.·More...
+template<std::size_t·i,·typename...·T>
+·······················constexpr·auto Dune::TypeTree::treePathEntry·(const
+·······································HybridTreePath<·T...·>·&tp,
+·······································index_constant<·i·>={})·->·typename
+·······································std::decay<·decltype(std::get<·i·>
+·······································(tp._data))>::type
+ ·····································Returns·a·copy·of·the·i-th·element·of
+·······································the·HybridTreePath.·More...
+template<std::size_t·i,·typename...·T>
+················constexpr·std::size_t Dune::TypeTree::treePathIndex·(const
+·······································HybridTreePath<·T...·>·&tp,
+·······································index_constant<·i·>={})
+ ·····································Returns·the·index·value·of·the·i-th
+·······································element·of·the·HybridTreePath.·More...
+template<typename...·T,·typename·std::enable_if<(sizeof...(T)·>·0),·bool·>::
+type·=·true>
+·······················constexpr·auto Dune::TypeTree::back·(const
+·······································HybridTreePath<·T...·>·&tp)·->·decltype
+·······································(treePathEntry<·sizeof...(T)·-1·>(tp))
+ ·····································Returns·a·copy·of·the·last·element·of
+·······································the·HybridTreePath.·More...
+template<typename...·T>
+·······················constexpr·auto Dune::TypeTree::front·(const

+dune-typetree 2.9
+····*·dune
+····*·typetree
+treepath.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=8·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_TREEPATH_HH
+·5#define·DUNE_TYPETREE_TREEPATH_HH
+·6
+·7#include·<cstddef>
+·8#include·<iostream>
+·9
+·10#include·<dune/common/documentation.hh>
+·11#include·<dune/common/typetraits.hh>
+·12#include·<dune/common/indices.hh>
+·13#include·<dune/common/hybridutilities.hh>
+·14
+·15#include·<dune/typetree/fixedcapacitystack.hh>
+·16#include·<dune/typetree/utility.hh>
+·17
+·18
+·19namespace·Dune·{
+·20·namespace·TypeTree·{
+·21
+·22·template<typename...·T>
+·23·class·HybridTreePath;
+·24
+·28
+·namespace·TreePathType·{
+·enum·Type·{·fullyStatic,·dynamic·};
+·31·}
+·32
+·33·template<typename>
+·struct·TreePathSize;
+·35
+·36·template<typename,std::size_t>
+·struct·TreePathPushBack;
+·38
+·39·template<typename,std::size_t>
+·struct·TreePathPushFront;
+·41
+·42·template<typename>
+·struct·TreePathBack;
+·44
+·45·template<typename>
+·struct·TreePathFront;
+·47
+·48·template<typename,·std::size_t...>
+·struct·TreePathPopBack;
+·50
+·51·template<typename>
+·struct·TreePathPopFront;
+·53
+·54·template<typename,·typename>
+·struct·TreePathConcat;
+·56
+·57·template<std::size_t...·i>
+·void·print_tree_path(std::ostream&·os)
+·59·{}
+·60
+·61·template<std::size_t·k,·std::size_t...·i>
+·void·print_tree_path(std::ostream&·os)
+·63·{
+·64·os·<<·k·<<·"·";
+·65·print_tree_path<i...>(os);
+·66·}
+·67
+·69
+·77·template<typename...·T>
+·class·HybridTreePath
+·79·{
+·80
+·81·public:
+·82
+·using·index_sequence·=·std::index_sequence_for<T...>;
+·85
+·constexpr·HybridTreePath()
+·88·{}
+·89
+·constexpr·HybridTreePath(const·HybridTreePath&·tp)·=·default;
+·constexpr·HybridTreePath(HybridTreePath&&·tp)·=·default;
+·92
+·constexpr·HybridTreePath&·operator=(const·HybridTreePath&·tp)·=·default;
+·constexpr·HybridTreePath&·operator=(HybridTreePath&&·tp)·=·default;
+·95
+·explicit·constexpr·HybridTreePath(std::tuple<T...>·t)
+·98·:·_data(t)
+·99·{}
+·100
+·102·template<typename...·U,·typename·std::enable_if<(sizeof...(T)·>·0·&&
+sizeof...(U)·==·sizeof...(T)),bool>::type·=·true>
+·explicit·constexpr·HybridTreePath(U...·t)
+·104·:·_data(t...)
+·105·{}
+·106
+·constexpr·static·index_sequence·enumerate()
+·109·{
+·110·return·{};
+·111·}
+·112
+·constexpr·static·std::size_t·size()
+·115·{
+·116·return·sizeof...(T);
+·117·}
+·118
+·120·template<std::size_t·i>
+·constexpr·auto·operator[](Dune::index_constant<i>)·const
+·122·{
+·123·return·std::get<i>(_data);
+·124·}
+·125
+·class·Exception
+·constexpr·std::size_t·operator[](std::size_t·pos)·const
+·128·{
+·129·std::size_t·entry·=·0;
+·130·Dune::Hybrid::forEach(enumerate(),·[&]·(auto·i)·{
+·131·if·(i==pos)
+·132·entry·=·this->element(i);
+·133·});
+·134·return·entry;
+·135·}


Offset 4, 31 lines modified		Offset 4, 89 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	Classes·\|·Namespaces	7	Classes·\|·Namespaces·\|·Functions
		8	typetraits.hh·File·Reference
8	compositenode.hh·File·Reference
9	#include·<tuple>
10	#include·<memory>
11	#include·<type_traits>	9	#include·<type_traits>
		10	#include·<dune/common/typetraits.hh>
		11	#include·<dune/typetree/treepath.hh>
12	#include·<dune/typetree/nodetags.hh>	12	#include·<dune/typetree/nodeinterface.hh>
13	#include·<dune/typetree/childextraction.hh>
14	#include·<dune/typetree/typetraits.hh>
15	Go_to_the_source_code_of_this_file.	13	Go_to_the_source_code_of_this_file.
16	·Classes	14	·Classes
		15	struct· Dune::first_type<_T0,_T..._>
17	·class· Dune::TypeTree::CompositeNode<_Children_>
18	·······Base·class·for·composite·nodes·based·on·variadic·templates.·More...
19		16
20	struct· Dune::TypeTree::CompositeNode<_Children_>::Child<_k_>
21	~~·······Ac~~cess·~~to·the·t~~ype~~·and·st~~orage~~·typ~~e~~·of~~·th~~e·i-th·child.·More...~~	17	struct· Dune::TypeTree::has_node_tag<_T_>
		18
		19	struct· Dune::TypeTree::has_node_tag<_T_>::yes
		20
		21	struct· Dune::TypeTree::has_node_tag<_T_>::no
		22
		23	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>
		24
		25	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::maybe<_N_>
		26
		27	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::yes
		28
		29	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::no
		30
		31	struct· Dune::TypeTree::has_implementation_tag<_T_>
		32
		33	struct· Dune::TypeTree::has_implementation_tag<_T_>::yes
		34
		35	struct· Dune::TypeTree::has_implementation_tag<_T_>::no
		36
		37	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>
		38
		39	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::maybe<_N_>
		40
		41	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::yes
		42
		43	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::no
		44
		45	struct· Dune::TypeTree::AlwaysVoid<_typename_>
		46
		47	struct· Dune::TypeTree::meta_function
		48	·······Marker·tag·declaring·a·meta·function.·More...
		49
		50	struct· Dune::TypeTree::lazy_evaluate<_F_>
		51	·······Helper·meta·function·to·delay·evaluation·of·F.·More...
		52
		53	struct· Dune::TypeTree::lazy_identity<_F_>
		54	·······Identity·function.·More...
		55
		56	struct· Dune::TypeTree::evaluate_if_meta_function<_F_>
		57	·······Meta·function·that·evaluates·its·argument·iff·it·inherits·from
		58	·········meta_function.·More...
		59
		60	struct· Dune::TypeTree::IsTreePath<_T_>
		61	·······Check·if·type·represents·a·tree·path.·More...
22		62
23	·Namespaces	63	·Namespaces
24	namespace· Dune	64	namespace· Dune
25		65
26	namespace· Dune::TypeTree	66	namespace· Dune::TypeTree
27		67
		68	namespace· Dune::TypeTree::impl
		69
		70	·Functions
		71	template<typename·T·>
		72	···········T·* Dune::TypeTree::declptr·()
		73	··············Helper·function·for·generating·a·pointer·to·a·value·of·type·T
		74	················in·an·unevaluated·operand·setting.·More...
		75
		76	constexpr·auto Dune::TypeTree::impl::isTreePath·(void·*)·->·std::false_type
		77
		78	template<class...·I>
		79	constexpr·auto Dune::TypeTree::impl::isTreePath·(const·HybridTreePath<·I...·>
		80	················*)·->·std::true_type
		81
		82	template<class·T·>
		83	constexpr·auto Dune::TypeTree::isTreePath·(const·T·&)·->·IsTreePath<·T·>
		84	··············Check·if·given·object·represents·a·tree·path.·More...
		85

28	===============================================================================	86	===============================================================================
29	·····Generated·by [doxygen]·1.9.4	87	·····Generated·by [doxygen]·1.9.4


Offset 5, 62 lines modified		Offset 5, 30 lines modified

5	dune-typetree 2.9	5	dune-typetree 2.9


6	····*·dune	6	····*·dune
7	····*·typetree	7	····*·typetree
8	Classes·\|·Namespaces	8	Classes·\|·Namespaces
9	filt~~ers~~.hh·File·Reference	9	utility.hh·File·Reference
		10	#include·<memory>
10	#include·<tuple>	11	#include·<tuple>
		12	#include·<type_traits>
		13	#include·<utility>
		14	#include·<algorithm>
		15	#include·<dune/common/shared_ptr.hh>
11	#include·<dune/common/~~typetrait~~s.hh>	16	#include·<dune/common/indices.hh>
		17	#include·<dune/common/hybridutilities.hh>
		18	#include·<dune/typetree/nodeinterface.hh>
		19	#include·<dune/typetree/nodetags.hh>
12	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
13	·Classes	21	·Classes
14	struct· Dune::TypeTree::FilterEntry<_new_k,_old_k_>
15	··~~·····A~~·~~filter·~~e~~ntr~~y·describ~~ing·th~~e~~·map~~pin~~g·o~~f·o~~ne·child·in·th~~e·~~filtered~~	22	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
		23	·······Struct·for·obtaining·some·basic·structural·information·about·a
16	·········~~nod~~e.·More...	24	·········TypeTree.·More...
17
18	struct· Dune::TypeTree::FilterResult<_FilterEntries_>
19	·······The·result·of·a·filter.·More...
20
21	struct· Dune::TypeTree::FilterResult<_FilterEntries_>::apply<_Node_>
22
23	struct· Dune::TypeTree::SimpleFilterTag
24	·······Tag·describing·a·simple·filter·that·can·only·decide·whether·or·not·to
25	·········include·a·single·given·child.·More...
26
27	struct· Dune::TypeTree::AdvancedFilterTag
28	·······Tag·describing·an·advanced·filter·that·has·full·control·over·the
29	·········construction·of·the·list·of·FilterEntries.·More...
30
31	struct· Dune::TypeTree::AdvancedFilter
32	·······Base·class·for·advanced·filters.·More...
33
34	struct· Dune::TypeTree::AdvancedFilter::apply<_Node,_Children_>
35	·······Apply·this·filter·to·the·given·node·and·children.·More...
36
37	struct· Dune::TypeTree::SimpleFilter
38	·······Default·simple·filter·that·accepts·any·node·and·leaves·its·child
39	·········structure·unchanged.·More...
40
41	struct· Dune::TypeTree::SimpleFilter::validate<_Node_>
42	·······Validates·the·combination·of·filter·and·node.·More...
43
44	struct· Dune::TypeTree::SimpleFilter::apply<_Child,_new_index,_old_index_>
45	·······Applies·the·filter·to·the·given·child·node.·More...
46
47	struct· Dune::TypeTree::IndexFilter<_indices_>
48	·······Filter·class·for·FilteredCompositeNode·that·selects·the·children·with
49	·········the·given·indices.·More...
50
51	struct· Dune::TypeTree::filter<_Filter_>
52	·······Adapter·class·that·takes·a·SimpleFilter,·validated·it·and·turns·it
53	·········into·an·AdvancedFilter.·More...
54
55	struct· Dune::TypeTree::filter<_Filter_>::apply<_Node,_Children_>
56	·······Apply·the·filter.·More...
57		25
58	·Namespaces	26	·Namespaces
59	namespace· Dune	27	namespace· Dune
60		28
61	namespace· Dune::TypeTree	29	namespace· Dune::TypeTree
62		30

+dune-typetree 2.9
+····*·dune
+····*·typetree
+utility.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_UTILITY_HH
+·5#define·DUNE_TYPETREE_UTILITY_HH
+·6
+·7#include·<memory>
+·8#include·<tuple>
+·9#include·<type_traits>
+·10#include·<utility>
+·11#include·<algorithm>
+·12
+·13#include·<dune/common/shared_ptr.hh>
+·14#include·<dune/common/indices.hh>
+·15#include·<dune/common/hybridutilities.hh>
+·16#include·<dune/typetree/nodeinterface.hh>
+·17#include·<dune/typetree/nodetags.hh>
+·18
+·9#include·<dune/common/typetraits.hh>
+·10
+·19namespace·Dune·{
+·20·namespace·TypeTree·{
+·21
+·13
+·20·template<std::size_t·new_k,·std::size_t·old_k>
+·struct·FilterEntry
+·22·{
+·23
+·26#ifndef·DOXYGEN
+·25
+·26·//·The·precise·contents·of·this·class·is·an·implementation·detail.
+·27
+·28·template<typename·T>
+·29·std::shared_ptr<T>·convert_arg(const·T&·t)
+·28·static·const·std::size_t·filtered_index·=·new_k;
+·29·static·const·std::size_t·original_index·=·old_k;
+·30
+·31#endif·//·DOXYGEN
+·32
+·33·};
+·34
+·36·template<typename...·FilterEntries>
+·struct·FilterResult
+·30·{
+·31·return·std::make_shared<T>(t);
+·32·}
+·33
+·34·template<typename·T>
+·35·std::shared_ptr<T>·convert_arg(T&·t)
+·36·{
+·37·return·stackobject_to_shared_ptr(t);
+·38·}
+·39
+·static·const·std::size_t·size·=·sizeof...(FilterEntries);
+·41
+·typedef·std::tuple<FilterEntries...>·IndexMap;
+·40·template<typename·BaseType,·typename·T>
+·41·T&·assertGridViewType(T&·t)
+·42·{
+·43·static_assert((std::is_same<typename·BaseType::Traits::GridViewType,
+·44·typename·T::Traits::GridViewType>::value),
+·45·"GridViewType·must·be·equal·in·all·components·of·composite·type");
+·46·return·t;
+·47·}
+·48
+·49·//·only·bind·to·real·rvalues
+·50·template<typename·T>
+·51·typename·std::enable_if<!std::is_lvalue_reference<T>::value,std::
+shared_ptr<T>·>::type·convert_arg(T&&·t)
+·52·{
+·53·return·std::make_shared<T>(std::forward<T>(t));
+·54·}
+·55
+·struct·apply
+·46·{
+·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
+original_index>...>·Children;
+·typedef·std::tuple<typename_Node::template_Child<FilterEntries::
+original_index>::Type...>·ChildTypes;
+·typedef·std::tuple<std::shared_ptr<typename_Node::template
+Child<FilterEntries::original_index>::Type>...>·NodeStorage;
+·50·};
+·51
+·52·};
+·53
+·struct·SimpleFilterTag·{};
+·56
+·57·namespace·Experimental·{
+·58
+·67·template<class·BinaryOp,·class·Arg>
+·68·constexpr·decltype(auto)
+·69·left_fold(BinaryOp&&·binary_op,·Arg&&·arg)
+·struct·AdvancedFilterTag·{};
+·59
+·60
+·struct·AdvancedFilter
+·63·{
+·64
+·typedef·AdvancedFilterTag·FilterTag;
+·67
+·68#ifdef·DOXYGEN
+·69
+·71·template<typename·Node,·typename...·Children>
+·struct·apply
+·70·{
+·71·return·std::forward<Arg>(arg);
+·72·}
+·73
+·95·template<class·BinaryOp,·class·Init,·class·Arg0,·class...·Args>
+·96·constexpr·decltype(auto)
+·97·left_fold(BinaryOp&&·binary_op,·Init&&·init,·Arg0&&·arg_0,·Args&&...·args)
+·75
+·typedef·implementation-defined·type;
+·79·};
+·80
+·81#endif·//·DOXYGEN
+·82
+·83·};


Offset 4, 56 lines modified		Offset 4, 24 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	nodetags.hh	7	transformationutilities.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=4·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_NODETAGS_HH
13	·5#define·DUNE_TYPETREE_NODETAGS_HH	12	·4#ifndef·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
		13	·5#define·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
14	·6	14	·6
15	·7namespace·Dune·{
16	·8·namespace~~·Ty~~peTr~~ee·{~~	15	·7#include·<dune/typetree/simpletransformationdescriptors.hh>
		16	·8#include·<dune/typetree/generictransformationdescriptors.hh>
17	·9	17	·9
		18	·10#endif·//·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
		19	simpletransformationdescriptors.hh
		20	generictransformationdescriptors.hh
18	16·struct·LeafNodeTag·{};
19	·17
20	19·struct·PowerNodeTag·{};
21	·20
22	22·struct·DynamicPowerNodeTag·{};
23	·23
24	25·struct·CompositeNodeTag·{};
25	·26
26	·27#ifndef·DOXYGEN
27	·28
28	·30·struct·StartTag·{};
29	·31
30	·32
31	·33
32	·34#endif·//·DOXYGEN
33	·35
34	·37
35	·38·}·//·namespace·TypeTree
36	·39}·//namespace·Dune
37	·40
38	·41#endif·//·DUNE_TYPETREE_NODETAGS_HH
39	Dune
40	Definition:·accumulate_static.hh:13
41	Dune::TypeTree::LeafNodeTag
42	Tag·designating·a·leaf·node.
43	Definition:·nodetags.hh:16
44	Dune::TypeTree::PowerNodeTag
45	Tag·designating·a·power·node.
46	Definition:·nodetags.hh:19
47	Dune::TypeTree::DynamicPowerNodeTag
48	Tag·designating·a·power·node·with·runtime·degree.
49	Definition:·nodetags.hh:22
50	Dune::TypeTree::CompositeNodeTag
51	Tag·designating·a·composite·node.
52	Definition:·nodetags.hh:25

53	===============================================================================	21	===============================================================================
54	·····Generated·by [doxygen]·1.9.4	22	·····Generated·by [doxygen]·1.9.4


Offset 4, 45 lines modified		Offset 4, 60 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	~~Classes·\|·~~Namespaces·\|·Typedefs·\|·Functions	7	Namespaces·\|·Typedefs·\|·Functions
8	nodeinterface.hh·File·Reference	8	childextraction.hh·File·Reference
9	#include·<cstddef>
10	#include·<type_traits>	9	#include·<type_traits>
		10	#include·<utility>
		11	#include·<dune/common/concept.hh>
11	#include·<dune/common/documentation.hh>	12	#include·<dune/common/documentation.hh>
		13	#include·<dune/common/typetraits.hh>
		14	#include·<dune/common/shared_ptr.hh>
		15	#include·<dune/typetree/nodeinterface.hh>
		16	#include·<dune/typetree/treepath.hh>
12	Go_to_the_source_code_of_this_file.	17	Go_to_the_source_code_of_this_file.
13	·Classes
14	struct· Dune::TypeTree::NodeInterface
15	·······Interface·for·nodes·in·a·dune-typetree.·More...
16
17	·Namespaces	18	·Namespaces
18	namespace· Dune	19	namespace· Dune
19		20
20	namespace· Dune::TypeTree	21	namespace· Dune::TypeTree
21		22
22	·Typedefs	23	·Typedefs
23	template<typename·Node·>
24	using Dune::TypeTree::NodeTag·=·typename·std::decay_t<·Node·>::NodeTag
25	~~·····R~~e~~turns·th~~e·node·tag·of·t~~he·g~~iven·~~Node~~.·~~More...~~	24	template<typename·Node·,·std::size_t...·indices>
		25	using Dune::TypeTree::Child·=·typename·impl::_Child<·Node,·indices...·>::type
		26	·····Template·alias·for·the·type·of·a·child·node·given·by·a·list·of·child
		27	·······indices.·More...
		28
		29	template<typename·Node·,·typename·TreePath·>
		30	using Dune::TypeTree::ChildForTreePath·=·typename·impl::_ChildForTreePath<
		31	·······Node,·TreePath·>::type
		32	·····Template·alias·for·the·type·of·a·child·node·given·by·a·TreePath·or·a
		33	·······HybridTreePath·type.·More...
26		34
27	template<typename·T·>	35	template<typename·T·>
		36	using Dune::TypeTree::is_flat_index·=·typename·impl::_is_flat_index<·std::
		37	·······decay_t<·T·>·>::type
		38	·····Type·trait·that·determines·whether·T·is·a·flat·index·in·the·context·of
		39	·······child·extraction.·More...
28	using Dune::TypeTree::ImplementationTag·=·typename·std::decay_t<·T·>::
29	·······ImplementationTag
30	·····Returns·the·implementation·tag·of·the·given·Node.·More...
31
32	template<typename·Node·>
33	using Dune::TypeTree::StaticDegree·=·decltype(Node::degree())
34	·····Returns·the·statically·known·degree·of·the·given·Node·type·as·a·std::
35	·······integral_constant.·More...
36		40
37	·Functions	41	·Functions
38	template<typename·Node·>
39	std::size_t Dune::TypeTree::degree·(const·Node·&node)
40	~~···········Re~~t~~urns·~~the·~~degr~~e~~e·of~~·node~~·as~~·run·time·in~~form~~a~~tion~~.·~~More...~~	42	template<typename·Node·,·typename...·Indices>
		43	ImplementationDefined Dune::TypeTree::child·(Node·&&node,·Indices...·indices)
		44	·····················Extracts·the·child·of·a·node·given·by·a·sequence·of
		45	·······················compile-time·and·run-time·indices.·More...
		46
		47	template<typename·Node·,·typename...·Indices>
		48	ImplementationDefined Dune::TypeTree::childStorage·(Node·&&node,·Indices...
		49	·······················indices)
		50
		51	template<typename·Node·,·typename...·Indices>
		52	ImplementationDefined Dune::TypeTree::child·(Node·&&node,·HybridTreePath<
		53	·······················Indices...·>·treePath)
		54	·····················Extracts·the·child·of·a·node·given·by·a·HybridTreePath
		55	·······················object.·More...
41		56

42	===============================================================================	57	===============================================================================
43	·····Generated·by [doxygen]·1.9.4	58	·····Generated·by [doxygen]·1.9.4

+dune-typetree 2.9
+····*·dune
+····*·typetree
+nodetags.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_NODETAGS_HH
+·5#define·DUNE_TYPETREE_NODETAGS_HH
+·6
+·7#include·<dune/typetree/traversal.hh>
+·8
+·7namespace·Dune·{
+·8·namespace·TypeTree·{
+·11
+·17·namespace·{
+·9
+·struct·LeafNodeTag·{};
+·17
+·struct·PowerNodeTag·{};
+·20
+·25·template<typename·F,·typename·R,·typename·ResultType>
+·26·struct·LeafReductionVisitor
+·struct·DynamicPowerNodeTag·{};
+·23
+·struct·CompositeNodeTag·{};
+·26
+·27#ifndef·DOXYGEN
+·28
+·30·struct·StartTag·{};
+·29
+·static·const·TreePathType::Type·treePathType·=·TreePathType::dynamic;
+·31
+·32
+·33
+·34#endif·//·DOXYGEN
+·35
+·32·template<typename·Node,·typename·TreePath>
+·33·void·leaf(const·Node&·node,·TreePath·treePath)
+·34·{
+·35·_value·=·_reduction(_value,_functor(node,treePath));
+·36·}
+·37
+·38·LeafReductionVisitor(F·functor,·R·reduction,·ResultType·startValue)
+·39·:·_functor(functor)
+·40·,·_reduction(reduction)
+·41·,·_value(startValue)
+·42·{}
+·43
+·44·ResultType·result()·{·return·_value;·}
+·45
+·F·_functor;
+·R·_reduction;
+·ResultType·_value;
+·49
+·50·};
+·51
+·52·}·//·anonymous·namespace
+·53
+·55
+·80·template<typename·ResultType,·typename·Tree,·typename·F,·typename·R>
+·ResultType·reduceOverLeafs(const·Tree&·tree,·F·functor,·R·reduction,
+ResultType·startValue)
+·82·{
+·83·LeafReductionVisitor<F,R,ResultType>·visitor(functor,reduction,startValue);
+·84·TypeTree::applyToTree(tree,visitor);
+·85·return·visitor.result();
+·86·}
+·87
+·89
+·38·}·//·namespace·TypeTree
+·39}·//namespace·Dune
+·40
+·41#endif·//·DUNE_TYPETREE_NODETAGS_HH
+·92
+·93#endif·//·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
+result
+static·const·result_type·result
+Definition:·accumulate_static.hh:110
+_reduction
+R·_reduction
+Definition:·traversalutilities.hh:47
+_functor
+F·_functor
+Definition:·traversalutilities.hh:46
+treePathType
+static·const·TreePathType::Type·treePathType
+Definition:·traversalutilities.hh:30
+_value
+ResultType·_value
+Definition:·traversalutilities.hh:48
+traversal.hh
+Dune::TypeTree::reduceOverLeafs
+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:81
+Dune::TypeTree::applyToTree
+void·applyToTree(Tree·&&tree,·Visitor·&&visitor)
+Apply·visitor·to·TypeTree.
+Definition:·traversal.hh:237
+Dune::TypeTree::treePath
+constexpr·HybridTreePath<·T...·>·treePath(const·T·&...·t)
+Constructs·a·new·HybridTreePath·from·the·given·indices.
+Definition:·treepath.hh:191
+Dune::TypeTree::TreePath
+HybridTreePath<·Dune::index_constant<·i·>...·>·TreePath
+Definition:·treepath.hh:521
+Dune
+Definition:·accumulate_static.hh:13
+Dune::TypeTree::TreePathType::Type
+Type
+Definition:·treepath.hh:30
+Dune::TypeTree::TreePathType::dynamic
+@·dynamic
+Dune::TypeTree::LeafNodeTag
+Tag·designating·a·leaf·node.
+Definition:·nodetags.hh:16
+Dune::TypeTree::PowerNodeTag
+Tag·designating·a·power·node.
+Definition:·nodetags.hh:19
+Dune::TypeTree::DynamicPowerNodeTag

+dune-typetree 2.9
+····*·dune
+····*·typetree
+typetree.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_HH
+·5#define·DUNE_TYPETREE_HH
+·6
+·7#include·<utility>
+·8
+·9#include·<dune/common/hybridutilities.hh>
+·10#include·<dune/common/std/type_traits.hh>
+·7#include·<dune/typetree/nodetags.hh>
+·8#include·<dune/typetree/utility.hh>
+·9#include·<dune/typetree/leafnode.hh>
+·10#include·<dune/typetree/powernode.hh>
+·11#include·<dune/typetree/dynamicpowernode.hh>
+·12#include·<dune/typetree/compositenode.hh>
+·13#include·<dune/typetree/traversal.hh>
+·14#include·<dune/typetree/pairtraversal.hh>
+·15#include·<dune/typetree/traversalutilities.hh>
+·16#include·<dune/typetree/transformation.hh>
+·17#include·<dune/typetree/transformationutilities.hh>
+·18#include·<dune/typetree/accumulate_static.hh>
+·19#include·<dune/typetree/childextraction.hh>
+·13#include·<dune/typetree/nodetags.hh>
+·14#include·<dune/typetree/treepath.hh>
+·15#include·<dune/typetree/visitor.hh>
+·16
+·17namespace·Dune·{
+·18·namespace·TypeTree·{
+·19
+·25#ifndef·DOXYGEN
+·27·struct·NoOp
+·28·{
+·29·template<class...·T>
+·30·constexpr·void·operator()(T&&...)·const·{·/*·do·nothing·*/·}
+·31·};
+·32#endif
+·33
+·34·namespace·Detail·{
+·35
+·36·//·SFINAE·template·check·that·Tree·has·a·degree()·function·and·a·child()
+function·accepting·integer·indices
+·37·template<class·Tree>
+·using·DynamicTraversalConcept·=·decltype((
+·39·std::declval<Tree>().degree(),
+·40·std::declval<Tree>().child(0u)
+·41·));
+·42
+·43·//·SFINAE·template·check·that·Tree·has·static·(constexpr)·function·Tree::
+degree()
+·44·template<class·Tree>
+·using·StaticTraversalConcept·=·decltype((
+·46·std::integral_constant<std::size_t,·Tree::degree()>{}
+·47·));
+·48
+·49
+·50·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,
+·51·std::enable_if_t<Tree::isLeaf,·int>·=·0>
+·constexpr·auto·leafTreePathTuple(Prefix·prefix)
+·53·{
+·54·return·std::make_tuple(prefix);
+·55·}
+·56
+·57·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,
+·58·std::enable_if_t<not·Tree::isLeaf,·int>·=·0>
+·59·constexpr·auto·leafTreePathTuple(Prefix·prefix);
+·60
+·61·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,·std::
+size_t...·indices,
+·62·std::enable_if_t<(Tree::isComposite·or·(Tree::isPower·and
+(pathType!=TreePathType::dynamic))),·int>·=·0>
+·constexpr·auto·leafTreePathTuple(Prefix·prefix,·std::
+index_sequence<indices...>)
+·64·{
+·65·return·std::tuple_cat(Detail::leafTreePathTuple<TypeTree::
+Child<Tree,indices>,·pathType>(Dune::TypeTree::push_back(prefix,·Dune::
+index_constant<indices>{}))...);
+·66·}
+·67
+·68·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,·std::
+size_t...·indices,
+·69·std::enable_if_t<(Tree::isPower·and·(pathType==TreePathType::dynamic)),
+int>·=·0>
+·70·constexpr·auto·leafTreePathTuple(Prefix·prefix,·std::
+index_sequence<indices...>)
+·71·{
+·72·return·std::tuple_cat(Detail::leafTreePathTuple<TypeTree::
+Child<Tree,indices>,·pathType>(Dune::TypeTree::push_back(prefix,·indices))...);
+·73·}
+·74
+·75·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,
+·76·std::enable_if_t<not·Tree::isLeaf,·int>>
+·77·constexpr·auto·leafTreePathTuple(Prefix·prefix)
+·78·{
+·79·return·Detail::leafTreePathTuple<Tree,·pathType>(prefix,·std::
+make_index_sequence<Tree::degree()>{});
+·80·}
+·81
+·82·/*·The·signature·is·the·same·as·for·the·public·applyToTree
+·83·*·function·in·Dune::Typetree,·despite·the·additionally·passed
+·84·*·treePath·argument.·The·path·passed·here·is·associated·to
+·85·*·the·tree·and·the·relative·paths·of·the·children·(wrt.·to·tree)
+·86·*·are·appended·to·this.·Hence·the·behavior·of·the·public·function
+·87·*·is·resembled·by·passing·an·empty·treePath.
+·88·*/
+·89
+·90·/*
+·91·*·This·is·the·overload·for·leaf·traversal
+·92·*/
+·93·template<class·T,·class·TreePath,·class·V,
+·94·std::enable_if_t<std::decay_t<T>::isLeaf,·int>·=·0>
+·void·applyToTree(T&&·tree,·TreePath·treePath,·V&&·visitor)
+·96·{
+·97·visitor.leaf(tree,·treePath);
+·98·}
+·99
+·100·/*
+·101·*·This·is·the·general·overload·doing·child·traversal.


Offset 4, 613 lines modified		Offset 4, 345 lines modified


4	dune-typetree 2.9	4	dune-typetree 2.9


5	····*·dune	5	····*·dune
6	····*·typetree	6	····*·typetree
7	treep~~ath~~.hh	7	generictransformationdescriptors.hh
8	Go_to_the_documentation_of_this_file.	8	Go_to_the_documentation_of_this_file.
9	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	9	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
10	·2//·vi:·set·et·ts=8·sw=2·sts=2:	10	·2//·vi:·set·et·ts=4·sw=2·sts=2:
11	·3	11	·3
12	·4#ifndef·DUNE_TYPETREE_TREEPATH_HH
13	·5#define·DUNE_TYPETREE_TREEP~~ATH~~_HH	12	·4#ifndef·DUNE_TYPETREE_GENERICTRANSFORMATIONDESCRIPTORS_HH
		13	·5#define·DUNE_TYPETREE_GENERICTRANSFORMATIONDESCRIPTORS_HH
14	·6	14	·6
15	·7#include·<cs~~tddef~~>	15	·7#include·<array>
16	·8#include·<~~iost~~ream>	16	·8#include·<memory>
17	·9	17	·9
		18	·10#include·<dune/typetree/nodeinterface.hh>
		19	·11#include·<dune/typetree/nodetags.hh>
		20	·12#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
18	·10#include·<dune/common/documentation.hh>	21	·13#include·<dune/common/exceptions.hh>
19	·11#include·<dune/common/typetraits.hh>
20	·12#include·<dune/common/indices.hh>
21	·13#include·<dune/common/hybridutilities.hh>
22	·14	22	·14
23	·15#include·<dune/typetree/fixedcapacitystack.hh>
24	·16#include·<dune/typetree/utility.hh>
25	·17	23	·15
		24	·16namespace·Dune·{
		25	·17·namespace·TypeTree·{
26	·18	26	·18
		27	·24·template<typename·SourceNode,·typename·Transformation,·typename
		28	TransformedNode>
		29	25·struct·GenericLeafNodeTransformation
		30	·26·{
		31	·27
		32	28·static·const·bool·recursive·=·false;
		33	·29
		34	30·typedef·TransformedNode·transformed_type;
		35	31·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
27	·19namespace·Dune·{
28	·20·namespace·TypeTree·{
29	·21
30	·22·template<typename...·T>
31	·23·class·HybridTreePath;
32	·24
33	·28
34	29·namespace·TreePathType·{
35	30·enum·Type·{·fullyStatic,·dynamic·};
36	·31·}
37	·32	36	·32
38	·33·template<typename>
39	34·struct·TreePathSize;
40	·35
41	·36·template<typename,std::size_t>
42	37·struct·TreePathPushBack;
43	·38
44	·39·template<typename,std::size_t>
45	40·struct·TreePathPushFront;	37	33·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
		38	t)
		39	·34·{
		40	·35·return·transformed_type(s,t);
		41	·36·}
		42	·37
		43	38·static·transformed_type·transform(std::shared_ptr<const·SourceNode>·s,·const
		44	Transformation&·t)
		45	·39·{
		46	·40·return·transformed_type(s,t);
46	·41	47	·41·}
47	·42·template<typename>
48	~~43·struct~~·~~TreePathBac~~k;	48	·42
		49	43·static·transformed_storage_type·transform_storage(std::shared_ptr<const
		50	SourceNode>·s,·const·Transformation&·t)
49	·44	51	·44·{
50	·45·template<typename>
51	46·struct·TreePat~~hFron~~t;	52	·45·return·std::make_shared<transformed_type>(s,t);
		53	·46·}
52	·47	54	·47
53	·48·template<typename,·std::size_t...>
54	49·~~stru~~ct·~~TreePathPopBac~~k;	55	·48·};
		56	·49
55	·50	57	·50
56	·51·template<typename>
57	52·struct·Tr~~eeP~~at~~hPo~~p~~Fro~~nt;	58	·51·template<typename·SourceNode,·typename·Transformation,·template<typename
		59	Child>·class·TransformedNodeTemplate>
		60	52·struct·TemplatizedGenericPowerNodeTransformation
58	·53	61	·53·{
59	·54·template<typename,·typename>
60	~~55·struct~~·~~TreePathConca~~t;	62	·54
		63	55·static·const·bool·recursive·=·true;
61	·56	64	·56
62	·57·template<std::size_t...·i>
63	58·void·~~print_~~tre~~e_p~~ath(st~~d::ostre~~am&·~~os)~~	65	·57·template<typename·TC>
		66	58·struct·result
64	·59·{}	67	·59·{
65	·60
66	·61·template<std::size_t·k,·std::size_t...·i>
67	62·~~voi~~d·prin~~t_t~~ree_pat~~h(std~~::ost~~ream&·os)~~	68	60·typedef·typename·TransformedNodeTemplate<TC>::type·type;
		69	61·typedef·std::shared_ptr<type>·storage_type;
		70	62·static·const·std::size_t·degree·=·StaticDegree<type>::value;
		71	·63·};
		72	·64
		73	·65·template<typename·TC>
		74	66·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
		75	Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
		76	children)
68	·63·{	77	·67·{
		78	·68·return·typename·result<TC>::type(s,t,children);
69	·64·os·<<·k·<<·"·";
70	·65·print_tree_path<i...>(os);
71	·66·}	79	·69·}
72	·67
73	·69	80	·70
		81	·71·template<typename·TC>
		82	72·static·typename·result<TC>::type·transform(std::shared_ptr<const·SourceNode>
		83	s,·const·Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::
		84	degree>&·children)
		85	·73·{
		86	·74·return·typename·result<TC>::type(s,t,children);
		87	·75·}
		88	·76
74	·77·template<typename~~...~~·T>	89	·77·template<typename·TC>
75	78·class·HybridTreePath	90	78·static·typename·result<TC>::storage_type·transform_storage(std::
		91	shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
		92	shared_ptr<TC>,result<TC>::degree>&·children)
Max diff block lines reached; 28072/32302 bytes (86.90%) of diff not shown.

+dune-typetree 2.9
+····*·dune
+····*·typetree
+pairtraversal.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
+·4#ifndef·DUNE_TYPETREE_PAIRTRAVERSAL_HH
+·5#define·DUNE_TYPETREE_PAIRTRAVERSAL_HH
+·6
+·7#include·<dune/common/std/type_traits.hh>
+·8
+·7#include·<array>
+·8#include·<memory>
+·9
+·9#include·<dune/typetree/nodeinterface.hh>
+·10#include·<dune/typetree/nodetags.hh>
+·12#include·<dune/common/exceptions.hh>
+·11#include·<dune/typetree/treepath.hh>
+·12#include·<dune/typetree/visitor.hh>
+·13#include·<dune/typetree/traversal.hh>
+·14
+·15namespace·Dune·{
+·16·namespace·TypeTree·{
+·17
+·23·template<typename·SourceNode,·typename·Transformation,·typename
+TransformedNode>
+·struct·SimpleLeafNodeTransformation
+·25·{
+·26
+·static·const·bool·recursive·=·false;
+·28
+·typedef·TransformedNode·transformed_type;
+·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
+·31
+·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
+·namespace·Detail·{
+·24
+·25·/*·The·signature·is·the·same·as·for·the·public·applyToTreePair
+·26·*·function·in·Dune::Typtree,·despite·the·additionally·passed
+·27·*·treePath·argument.·The·path·passed·here·is·associated·to
+·28·*·the·tree·and·the·relative·paths·of·the·children·(wrt.·to·tree)
+·29·*·are·appended·to·this.·Hence·the·behavior·of·the·public·function
+·30·*·is·resembled·by·passing·an·empty·treePath.
+·31·*/
+·32
+·33·/*
+·34·*·This·is·the·overload·for·leaf·traversal
+·35·*/
+·36·template<class·T1,·class·T2,·class·TreePath,·class·V,
+·37·std::enable_if_t<(std::decay_t<T1>::isLeaf·or·std::decay_t<T2>::isLeaf),
+int>·=·0>
+·void·applyToTreePair(T1&&·tree1,·T2&&·tree2,·TreePath·treePath,·V&&·visitor)
+·39·{
+·40·visitor.leaf(tree1,·tree2,·treePath);
+·34·return·transformed_type();
+·35·}
+·36
+·static·transformed_storage_type·transform_storage(std::shared_ptr<const
+SourceNode>·s,·const·Transformation&·t)
+·38·{
+·39·return·std::make_shared<transformed_type>();
+·41·}
+·41
+·42·};
+·43
+·44
+·45·template<typename·SourceNode,·typename·Transformation,·template<typename
+Child,·std::size_t>·class·TransformedNode>
+·42
+·43·/*
+·44·*·This·is·the·general·overload·doing·static·child·traversal.
+·45·*/
+·46·template<class·T1,·class·T2,·class·TreePath,·class·V,
+·47·std::enable_if_t<not(std::decay_t<T1>::isLeaf·or·std::decay_t<T2>::isLeaf),
+int>·=·0>
+·48·void·applyToTreePair(T1&&·tree1,·T2&&·tree2,·TreePath·treePath,·V&&
+visitor)
+·49·{
+·50·//·Do·we·really·want·to·take·care·for·const-ness·of·the·Tree
+·51·//·when·instanciating·VisitChild·below?·I'd·rather·expect·this:
+·52·//·using·Tree1·=·std::decay_t<T1>;
+·53·//·using·Tree2·=·std::decay_t<T2>;
+·54·//·using·Visitor·=·std::decay_t<V>;
+·55·using·Tree1·=·std::remove_reference_t<T1>;
+·56·using·Tree2·=·std::remove_reference_t<T2>;
+·57·using·Visitor·=·std::remove_reference_t<V>;
+·58·visitor.pre(tree1,·tree2,·treePath);
+·59
+·60·//·check·which·type·of·traversal·is·supported·by·the·trees
+·61·using·allowDynamicTraversal·=·std::conjunction<
+·62·Dune::Std::is_detected<DynamicTraversalConcept,Tree1>,
+·63·Dune::Std::is_detected<DynamicTraversalConcept,Tree2>>;
+·64·using·allowStaticTraversal·=·std::conjunction<
+·65·Dune::Std::is_detected<StaticTraversalConcept,Tree1>,
+·66·Dune::Std::is_detected<StaticTraversalConcept,Tree2>>;
+·48
+·static·const·bool·recursive·=·true;
+·50
+·51·template<typename·TC>
+·struct·result
+·53·{
+·typedef·TransformedNode<TC,·StaticDegree<SourceNode>::value>·type;
+·typedef·std::shared_ptr<type>·storage_type;
+·static·const·std::size_t·degree·=·StaticDegree<type>::value;
+·57·};
+·58
+·59·template<typename·TC>
+·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
+Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
+children)
+·61·{
+·62·return·typename·result<TC>::type(children);
+·63·}
+·64
+·65·template<typename·TC>
+·static·typename·result<TC>::storage_type·transform_storage(std::
+shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
+shared_ptr<TC>,result<TC>::degree>&·children)
+·67
+·68·return·std::make_shared<typename·result<TC>::type>(children);