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

⊟

3.28 MB

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

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

⊟

310 B

Files ¶

⊟

3.28 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.28 MB

data.tar.xz ¶

⊟

3.28 MB

data.tar ¶

⊟

19.6 KB

file list ¶

⊟

13.8 KB

⊟

2.72 KB

⊟

70.3 KB

⊟

12.5 KB

⊟

20.3 KB

⊟

3.88 KB

⊟

90.1 KB

⊟

15.6 KB

⊟

12.2 KB

⊟

1.92 KB

⊟

37.5 KB

⊟

6.25 KB

⊟

6.98 KB

⊟

1.27 KB

⊟

132 KB

⊟

23.0 KB

⊟

10.5 KB

⊟

2.03 KB

⊟

44.8 KB

⊟

8.43 KB

⊟

9.86 KB

⊟

2.05 KB

⊟

120 KB

⊟

24.5 KB

⊟

5.49 KB

⊟

1020 B

⊟

54.1 KB

⊟

8.94 KB

⊟

15.5 KB

⊟

3.13 KB

⊟

97.9 KB

⊟

18.0 KB

⊟

9.46 KB

⊟

1.99 KB

⊟

78.7 KB

⊟

15.1 KB

⊟

51.7 KB

⊟

11.4 KB

⊟

168 KB

⊟

28.0 KB

⊟

20.0 KB

⊟

3.81 KB

⊟

119 KB

⊟

19.5 KB

⊟

1.76 KB

⊟

7.58 KB

⊟

478 B

⊟

12.1 KB

⊟

2.22 KB

⊟

80.7 KB

⊟

13.0 KB

⊟

7.01 KB

⊟

1.37 KB

⊟

57.9 KB

⊟

9.46 KB

⊟

9.46 KB

⊟

1.99 KB

⊟

78.7 KB

⊟

15.1 KB

⊟

24.7 KB

⊟

4.83 KB

⊟

113 KB

⊟

20.2 KB

⊟

12.8 KB

⊟

2.43 KB

⊟

89.2 KB

⊟

15.4 KB

⊟

53.5 KB

⊟

12.0 KB

⊟

171 KB

⊟

29.6 KB

⊟

10.8 KB

⊟

1.92 KB

⊟

82.7 KB

⊟

13.8 KB

⊟

11.4 KB

⊟

2.08 KB

⊟

125 KB

⊟

25.2 KB

⊟

17.9 KB

⊟

3.31 KB

⊟

156 KB

⊟

27.9 KB

⊟

15.5 KB

⊟

2.78 KB

⊟

79.4 KB

⊟

13.9 KB

⊟

8.71 KB

⊟

1.68 KB

⊟

52.9 KB

⊟

10.1 KB

⊟

22.2 KB

⊟

3.86 KB

⊟

136 KB

⊟

22.6 KB

⊟

6.19 KB

⊟

1.12 KB

⊟

81.9 KB

⊟

14.0 KB

⊟

18.3 KB

⊟

3.35 KB

⊟

122 KB

⊟

21.8 KB

⊟

9.36 KB

⊟

1.74 KB

⊟

85.0 KB

⊟

15.6 KB

⊟

1.96 KB

⊟

2.05 KB

⊟

2.11 KB

⊟

2.07 KB

⊟

2.12 KB

⊟

2.05 KB

⊟

2.11 KB

⊟

2.06 KB

⊟

2.11 KB

⊟

2.06 KB

⊟

2.11 KB

⊟

2.09 KB

⊟

2.19 KB

⊟

2.09 KB

⊟

2.19 KB

⊟

5.89 KB

⊟

2.62 KB

⊟

2.4 KB

⊟

2.54 KB

⊟

1.92 KB

⊟

2.15 KB

⊟

2.32 KB

⊟

1.61 KB

⊟

1.85 KB

⊟

2.53 KB

⊟

1.48 KB

⊟

1.5 KB

⊟

1.96 KB

⊟

2.07 KB

⊟

2.16 KB

⊟

2.03 KB

⊟

2.05 KB

⊟

2.23 KB

⊟

2.59 KB

⊟

1.95 KB

⊟

2.02 KB

⊟

2.02 KB

⊟

2.67 KB

⊟

2.5 KB

⊟

2.53 KB

⊟

15.5 KB

⊟

2.54 KB

⊟

2.51 KB

⊟

12.3 KB

⊟

2.52 KB

⊟

2.51 KB

⊟

12.1 KB

⊟

2.3 KB

⊟

2.49 KB

⊟

1.34 KB

⊟

1.35 KB

⊟

1.39 KB

⊟

1.36 KB

⊟

1.85 KB

⊟

2.21 KB

⊟

1.86 KB

⊟

2.1 KB

⊟

1.86 KB

⊟

2.1 KB

⊟

2.08 KB

⊟

2.22 KB

⊟

2.03 KB

⊟

2.11 KB

⊟

2.31 KB

⊟

2.11 KB

⊟

1.14 KB

⊟

1.92 KB

⊟

2.28 KB

⊟

2.25 KB

⊟

2.31 KB

⊟

2.66 KB

⊟

2.13 KB

⊟

2.61 KB

⊟

2.14 KB

⊟

2.47 KB

⊟

2.14 KB

⊟

2.47 KB

⊟

2.61 KB

⊟

2.21 KB

⊟

2.33 KB

⊟

2.03 KB

⊟

2.35 KB

⊟

1000 B

⊟

1010 B

⊟

1010 B

⊟

970 B

⊟

1000 B

⊟

970 B

⊟

1000 B

⊟

1010 B

⊟

2.08 KB

⊟

2.14 KB

⊟

2.14 KB

⊟

2.05 KB

⊟

2.54 KB

⊟

2.23 KB

⊟

2.11 KB

⊟

2.61 KB

⊟

2.14 KB

⊟

2.19 KB

⊟

853 B

⊟

1.85 KB

⊟

1.98 KB

⊟

1.86 KB

⊟

1.86 KB

⊟

2.0 KB

⊟

1.89 KB

⊟

1.87 KB

⊟

1.87 KB

⊟

2.0 KB

⊟

1.87 KB

⊟

1.87 KB

⊟

2.02 KB

⊟

1.9 KB

⊟

1.88 KB

⊟

1.88 KB

⊟

1.86 KB

⊟

1.3 KB

⊟

1.86 KB

⊟

1.83 KB

⊟

2.22 KB

⊟

1.89 KB

⊟

2.53 KB

⊟

1.96 KB

⊟

1.98 KB

⊟

1.99 KB

⊟

2.89 KB

⊟

2.04 KB

⊟

2.41 KB

⊟

2.01 KB

⊟

1.96 KB

⊟

2.35 KB

⊟

1.89 KB

⊟

1.97 KB

⊟

1.94 KB

⊟

2.02 KB

⊟

1.94 KB

⊟

1.94 KB

⊟

1.97 KB

⊟

16.2 KB

⊟

33.8 KB

⊟

33.6 KB

⊟

33.6 KB

⊟

16.5 KB

⊟

2.04 KB

⊟

2.05 KB


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

1	·e65520bfb7524215cd23fd6b70f80f5c·38688·libdevel·optional·libdune-typetree-dev_2.9.0-2_armhf.deb	1	·e65520bfb7524215cd23fd6b70f80f5c·38688·libdevel·optional·libdune-typetree-dev_2.9.0-2_armhf.deb
2	·e6da~~7af3~~b~~601ff~~3~~2066~~03e261595781e·9~~9001~~6·doc·optional·libdune-typetree-doc_2.9.0-2_all.deb	2	·0cd95a04074ba2ade309330632611b7b·989556·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·····9628·2023-01-12·22:23:12.000000·control.tar.xz	2	-rw-r--r--···0········0········0·····9628·2023-01-12·22:23:12.000000·control.tar.xz
3	-rw-r--r--···0········0········0···9~~8019~~6·2023-01-12·22:23:12.000000·data.tar.xz	3	-rw-r--r--···0········0········0···979736·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)·····3047·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)·····3047·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)·····3045·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)·····3045·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)····~~11110~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008.html	12	-rw-r--r--···0·root·········(0)·root·········(0)·····4849·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)····~~55685~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html	13	-rw-r--r--···0·root·········(0)·root·········(0)·····8864·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)····17252·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html	14	-rw-r--r--···0·root·········(0)·root·········(0)·····5211·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)····~~74924~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011_source.html	15	-rw-r--r--···0·root·········(0)·root·········(0)·····6649·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)·····~~8711~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014.html	16	-rw-r--r--···0·root·········(0)·root·········(0)·····7478·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)····1~~9928~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014_source.html	17	-rw-r--r--···0·root·········(0)·root·········(0)····17536·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)·····6~~194~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017.html	18	-rw-r--r--···0·root·········(0)·root·········(0)·····6049·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)····69~~306~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017_source.html	19	-rw-r--r--···0·root·········(0)·root·········(0)····49440·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)·····7208·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)····27369·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)·····6910·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023.html	20	-rw-r--r--···0·root·········(0)·root·········(0)·····6910·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020.html
23	-rw-r--r--···0·root·········(0)·root·········(0)····15552·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023_source.html	21	-rw-r--r--···0·root·········(0)·root·········(0)····15552·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)·····6859·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)····87085·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)·····5600·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026.html	24	-rw-r--r--···0·root·········(0)·root·········(0)·····3694·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)····~~46149~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026_source.html	25	-rw-r--r--···0·root·········(0)·root·········(0)·····5507·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)····~~106~~95·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029.html	26	-rw-r--r--···0·root·········(0)·root·········(0)·····7398·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)····4~~6415~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029_source.html	27	-rw-r--r--···0·root·········(0)·root·········(0)····41083·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)·····~~8736~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032.html	28	-rw-r--r--···0·root·········(0)·root·········(0)·····5125·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)····57016·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)····15417·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)····~~530~~82·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035_source.html	29	-rw-r--r--···0·root·········(0)·root·········(0)····14382·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)····32652·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)····96059·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)····~~·5149~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038.html	32	-rw-r--r--···0·root·········(0)·root·········(0)····17252·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)····~~32272~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038_source.html	33	-rw-r--r--···0·root·········(0)·root·········(0)····74924·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)·····5909·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041.html	34	-rw-r--r--···0·root·········(0)·root·········(0)·····5909·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)····49270·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html	35	-rw-r--r--···0·root·········(0)·root·········(0)····49270·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)·····5149·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)····32272·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)·····5600·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)····46149·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)·····8736·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)····57016·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)····10695·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)····46415·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_source.html
36	-rw-r--r--···0·root·········(0)·root·········(0)····11230·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044.html	44	-rw-r--r--···0·root·········(0)·root·········(0)····11230·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html
37	-rw-r--r--···0·root·········(0)·root·········(0)····43051·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044_source.html	45	-rw-r--r--···0·root·········(0)·root·········(0)····43051·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html
38	-rw-r--r--···0·root·········(0)·root·········(0)·····4849·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)·····8864·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)·····5125·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)····14382·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)····15770·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053.html	46	-rw-r--r--···0·root·········(0)·root·········(0)····15770·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html
43	-rw-r--r--···0·root·········(0)·root·········(0)····56207·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_source.html	47	-rw-r--r--···0·root·········(0)·root·········(0)····56207·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)·····9727·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)····69137·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)·····8711·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)····19928·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html
44	-rw-r--r--···0·root·········(0)·root·········(0)·····5603·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html	52	-rw-r--r--···0·root·········(0)·root·········(0)·····5603·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html
45	-rw-r--r--···0·root·········(0)·root·········(0)····39037·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html	53	-rw-r--r--···0·root·········(0)·root·········(0)····39037·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html
46	-rw-r--r--···0·root·········(0)·root·········(0)····~~32652~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html	54	-rw-r--r--···0·root·········(0)·root·········(0)····11110·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071.html
47	-rw-r--r--···0·root·········(0)·root·········(0)····96059·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059_source.html	55	-rw-r--r--···0·root·········(0)·root·········(0)····55685·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071_source.html
48	-rw-r--r--···0·root·········(0)·root·········(0)·····5211·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062.html	56	-rw-r--r--···0·root·········(0)·root·········(0)·····6233·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074.html
49	-rw-r--r--···0·root·········(0)·root·········(0)·····~~6649~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062_source.html	57	-rw-r--r--···0·root·········(0)·root·········(0)·····8874·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)····15417·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)····53082·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html
50	-rw-r--r--···0·root·········(0)·root·········(0)·····6~~859~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065.html	60	-rw-r--r--···0·root·········(0)·root·········(0)·····6194·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html
51	-rw-r--r--···0·root·········(0)·root·········(0)····~~87085~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html	61	-rw-r--r--···0·root·········(0)·root·········(0)····69306·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html
52	-rw-r--r--···0·root·········(0)·root·········(0)····15004·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html	62	-rw-r--r--···0·root·········(0)·root·········(0)····15004·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html
53	-rw-r--r--···0·root·········(0)·root·········(0)····98929·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html	63	-rw-r--r--···0·root·········(0)·root·········(0)····98929·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083_source.html
54	-rw-r--r--···0·root·········(0)·root·········(0)·····7478·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)····17536·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)·····7398·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)····41083·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)·····9727·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)····69137·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)·····3694·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)·····5507·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)·····6233·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)·····8874·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)·····~~6049~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086.html	64	-rw-r--r--···0·root·········(0)·root·········(0)·····7208·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)····~~49440~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086_source.html	65	-rw-r--r--···0·root·········(0)·root·········(0)····27369·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)·····4235·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)·····4235·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)····16499·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)····16499·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)····11643·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)····11643·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)····40169·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)····40169·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)·····4364·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)·····4364·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)····21433·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)····21433·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)·····3530·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)·····3530·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00092.png

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces·|·Typedefs·|·Functions
+typetree.hh·File·Reference
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/typetree/utility.hh>
+#include·<dune/typetree/leafnode.hh>
+#include·<dune/typetree/powernode.hh>
+#include·<dune/typetree/dynamicpowernode.hh>
+#include·<dune/typetree/compositenode.hh>
+#include·<type_traits>
+#include·<utility>
+#include·<functional>
+#include·<array>
+#include·<dune/common/indices.hh>
+#include·<dune/common/hybridutilities.hh>
+#include·<dune/common/rangeutilities.hh>
+#include·<dune/common/tuplevector.hh>
+#include·<dune/typetree/traversal.hh>
+#include·<dune/typetree/pairtraversal.hh>
+#include·<dune/typetree/traversalutilities.hh>
+#include·<dune/typetree/transformation.hh>
+#include·<dune/typetree/transformationutilities.hh>
+#include·<dune/typetree/accumulate_static.hh>
+#include·<dune/typetree/childextraction.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+·class· Dune::TypeTree::Detail::ContainerFactory<_LeafToValue_>
+·class· Dune::TypeTree::Detail::TreeContainerVectorBackend<_Container_>
+struct· Dune::TypeTree::Detail::LeafToDefaultConstructibleValue<_LeafToValue_>
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+namespace· Dune::TypeTree::Detail
+·Typedefs
+template<class·Value·,·class·Tree·>
+using Dune::TypeTree::UniformTreeContainer·=·std::decay_t<·decltype
+·······(makeTreeContainer<·Value·>(std::declval<·const·Tree·&·>()))>
+ ·····Alias·to·container·type·generated·by·makeTreeContainer·for·given·tree
+·······type·and·uniform·value·type.
+template<template<·class·Node·>·class·LeafToValue,·class·Tree·>
+using Dune::TypeTree::TreeContainer·=·std::decay_t<·decltype(makeTreeContainer
+·······(std::declval<·const·Tree·&·>(),·std::declval<·Detail::
+·······LeafToDefaultConstructibleValue<·LeafToValue·>·>()))>
+ ·····Alias·to·container·type·generated·by·makeTreeContainer·for·give·tree
+·······type·and·when·using·LeafToValue·to·create·values.
+·Functions
+template<class·Container·>
+auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
+······&&container)
+template<class·Tree·,·class·LeafToValue·>
+auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree,·LeafToValue
+······&&leafToValue)
+ ····Create·container·havin·the·same·structure·as·the·given·tree.
+template<class·Value·,·class·Tree·>
+auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
+ ····Create·container·havin·the·same·structure·as·the·given·tree.
+===============================================================================
+·····Generated·by [doxygen]·1.9.8


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"·lang="en-US">	2	<html·xmlns="http://www.w3.org/1999/xhtml"·lang="en-US">
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.8"/>	6	<meta·name="generator"·content="Doxygen·1.9.8"/>
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:·tree~~con~~tainer.hh·File·Reference</title>	8	<title>dune-typetree:·typetree.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"·/>

+Loading...
+Searching...
+No·Matches
+····*·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·<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>
+·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
+·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>
+·18
+·19namespace·Dune·{
+·20·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())>());

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces
+exceptions.hh·File·Reference
+#include·<dune/typetree/treepath.hh>
+TypeTree-specific·exceptions.·More...
+#include·<dune/common/exceptions.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+class· Dune::TypeTree::Exception
+ ······Base·class·for·all·TypeTree·exceptions.·More...
+struct· Dune::TypeTree::DefaultVisitor
+ ·······Visitor·interface·and·base·class·for·TypeTree·visitors.·More...
+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
+*****·Detailed·Description·*****
+TypeTree-specific·exceptions.
+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.
+template<typename·Tree·>
+constexpr·auto Dune::TypeTree::Experimental::Info::depth·()
+ ··············The·depth·of·the·Tree.
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::nodeCount·(const·Tree
+················&tree)
+ ··············The·total·number·of·nodes·in·the·Tree.
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::leafCount·(const·Tree
+················&tree)
+ ··············The·number·of·leaf·nodes·in·the·Tree.
+·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.
+===============================================================================
+·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+exceptions.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
+·3#ifndef·DUNE_TYPETREE_EXCEPTIONS_HH
+·4#define·DUNE_TYPETREE_EXCEPTIONS_HH
+·5
+·6#include·<dune/common/exceptions.hh>
+·7
+·6
+·7#include·<dune/typetree/treepath.hh>
+·8#include·<dune/typetree/utility.hh>
+·9
+·13namespace·Dune·{
+·14·namespace·TypeTree·{
+·12
+·19
+·struct·DefaultVisitor
+·47·{
+·48
+·50
+·57·template<typename·T,·typename·TreePath>
+·void·pre(T&&,·TreePath)·const·{}
+·59
+·61
+·69·template<typename·T,·typename·TreePath>
+·void·in(T&&,·TreePath)·const·{}
+·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·{}
+·106
+·108
+·119·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex>
+·void·afterChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
+·121
+·122·};
+·123
+·124
+·126
+·struct·DefaultPairVisitor
+·162·{
+·163
+·15
+·class·Exception
+·18·:·public·Dune::Exception
+·19·{};
+·173·template<typename·T1,·typename·T2,·typename·TreePath>
+·void·pre(T1&&,·T2&&,·TreePath)·const·{}
+·175
+·177
+·186·template<typename·T1,·typename·T2,·typename·TreePath>
+·void·in(T1&&,·T2&&,·TreePath)·const·{}
+·188
+·190
+·198·template<typename·T1,·typename·T2,·typename·TreePath>
+·void·post(T1&&,·T2&&,·TreePath)·const·{}
+·20
+·202
+·213·template<typename·T1,·typename·T2,·typename·TreePath>
+·void·leaf(T1&&,·T2&&,·TreePath)·const·{}
+·215
+·217
+·229·template<typename·T1,·typename·Child1,·typename·T2,·typename·Child2,
+typename·TreePath,·typename·ChildIndex>
+·void·beforeChild(T1&&,·Child1&&,·T2&&,·Child2&&,·TreePath,·ChildIndex)
+const·{}
+·231
+·233
+·245·template<typename·T1,·typename·Child1,·typename·T2,·typename·Child2,
+typename·TreePath,·typename·ChildIndex>
+·void·afterChild(T1&&,·Child1&&,·T2&&,·Child2&&,·TreePath,·ChildIndex)·const
+{}
+·247
+·248·};
+·249
+·250
+·251·namespace·Experimental·{
+·252
+·struct·DefaultHybridVisitor
+·284·{
+·285
+·293·template<typename·T,·typename·TreePath,·typename·U>
+·auto·pre(T&&,·TreePath,·const·U&·u)·const·{·return·u;}
+·295
+·303·template<typename·T,·typename·TreePath,·typename·U>
+·auto·in(T&&,·TreePath,·const·U&·u)·const·{return·u;}
+·305
+·313·template<typename·T,·typename·TreePath,·typename·U>
+·auto·post(T&&,·TreePath,·const·U&·u)·const·{return·u;}
+·315
+·323·template<typename·T,·typename·TreePath,·typename·U>
+·auto·leaf(T&&,·TreePath,·const·U&·u)·const·{·return·u;}
+·325
+·333·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex,·typename·U>
+·auto·beforeChild(T&&,·Child&&,·TreePath,·ChildIndex,·const·U&·u)·const
+{return·u;}
+·335
+·343·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex,·typename·U>
+·auto·afterChild(T&&,·Child&&,·TreePath,·ChildIndex,·const·U&·u)·const
+{return·u;}
+·345
+·346·};
+·347·}·//·namespace·Experimental
+·348
+·350
+·struct·VisitDirectChildren


Offset 6, 45 lines modified		Offset 6, 35 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
		12	Namespaces·\|·Functions
		13	traversalutilities.hh·File·Reference
		14	#include·<dune/typetree/traversal.hh>
12	Classes·\|·Namespaces·\|·Typedefs·\|·Functions
13	nodeinterface.hh·File·Reference
14	#include·<cstddef>
15	#include·<type_traits>
16	#include·<dune/common/documentation.hh>
17	Go_to_the_source_code_of_this_file.	15	Go_to_the_source_code_of_this_file.
18	·Classes
19	struct· Dune::TypeTree::NodeInterface
20	·······Interface·for·nodes·in·a·dune-typetree.·More...
21
22	·Namespaces	16	·Namespaces
23	namespace· Dune	17	namespace· Dune
24		18
25	namespace· Dune::TypeTree	19	namespace· Dune::TypeTree
26		20
27	·Typedefs
28	template<typename·Node·>
29	using Dune::TypeTree::NodeTag·=·typename·std::decay_t<·Node·>::NodeTag
30	·····Returns·the·node·tag·of·the·given·Node.
31
32	template<typename·T·>
33	using Dune::TypeTree::ImplementationTag·=·typename·std::decay_t<·T·>::
34	·······ImplementationTag
35	·····Returns·the·implementation·tag·of·the·given·Node.
36
37	template<typename·Node·>
38	using Dune::TypeTree::StaticDegree·=·decltype(Node::degree())
39	·····Returns·the·statically·known·degree·of·the·given·Node·type·as·a·std::
40	·······integral_constant.
41
42	·Functions	21	·Functions
43	template<typename·Node·>
44	std::size_t Dune::TypeTree::degree·(const·Node·&node)
45	~~··········~~·Ret~~urns~~·the·degree·of·~~nod~~e·as·~~run~~·time·informa~~tion.~~	22	template<typename·ResultType·,·typename·Tree·,·typename·F·,·typename·R·>
		23	ResultType Dune::TypeTree::reduceOverLeafs·(const·Tree·&tree,·F·functor,·R
		24	············reduction,·ResultType·startValue)
		25	··········Calculate·a·quantity·as·a·reduction·over·the·leaf·nodes·of·a
		26	············TypeTree.
46		27
		28	***·Variable·Documentation·***
		29	***·◆ _functor·***
		30	F·_functor
		31	***·◆ _reduction·***
		32	R·_reduction
		33	***·◆ _value·***
		34	ResultType·_value
		35	***·◆ treePathType·***
		36	const·TreePathType::Type·treePathType·=·TreePathType::dynamic·static

47	===============================================================================	37	===============================================================================
48	·····Generated·by [doxygen]·1.9.8	38	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+traversalutilities.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_TRAVERSALUTILITIES_HH
+·5#define·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
+·6
+·7#include·<cstddef>
+·8#include·<type_traits>
+·9
+·7#include·<dune/typetree/traversal.hh>
+·8
+·9namespace·Dune·{
+·10·namespace·TypeTree·{
+·11
+·17·namespace·{
+·18
+·20
+·25·template<typename·F,·typename·R,·typename·ResultType>
+·26·struct·LeafReductionVisitor
+·27·:·public·TypeTree::TreeVisitor
+·13·namespace·TypeTree·{
+·14
+·struct·NodeInterface
+·33·{
+·static·const·bool·isLeaf·=·implementationDefined;
+·36
+·static·const·bool·isPower·=·implementationDefined;
+·39
+·static·const·bool·isComposite·=·implementationDefined;
+·42
+·44
+·static·const·std::size_t·CHILDREN·=·implementationDefined;
+·50
+·52
+·static·auto·degree();
+·58
+·60
+·typedef·ImplementationDefined·NodeTag;
+·66
+·68
+·typedef·ImplementationDefined·NodeStorage;
+·72·};
+·73
+·75·template<typename·Node>
+·using·NodeTag·=·typename·std::decay_t<Node>::NodeTag;
+·77
+·79·template<typename·T>
+·using·ImplementationTag·=·typename·std::decay_t<T>::ImplementationTag;
+·81
+·82
+·84·template<typename·Node>
+·std::size_t·degree(const·Node&·node)
+·28·{
+·29
+·static·const·TreePathType::Type·treePathType·=·TreePathType::dynamic;
+·31
+·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
+·90#ifndef·DOXYGEN
+·91
+·93
+·99·template<typename·Node,·typename·NodeTag>
+·100·std::size_t·degree(const·Node*·node,·NodeTag)
+·101·{
+·102·return·node->degree();
+·103·}
+·104
+·105#endif·//·DOXYGEN
+·106
+·108
+·112·template<typename·Node>
+·using·StaticDegree·=·decltype(Node::degree());
+·114
+·116
+·90·}·//·namespace·TypeTree
+·91}·//namespace·Dune
+·119
+·92
+·93#endif·//·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
+_reduction
+R·_reduction
+Definition·traversalutilities.hh:47
+_functor
+F·_functor
+Definition·traversalutilities.hh:46
+treePathType
+static·const·TreePathType::Type·treePathType


Offset 7, 31 lines modified		Offset 7, 30 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces
13	po~~wer~~node.hh·File·Reference	13	filteredcompositenode.hh·File·Reference
14	#include·<cassert>
15	#include·<array>
16	#include·<memory>	14	#include·<memory>
		15	#include·<tuple>
17	#include·<type_traits>	16	#include·<type_traits>
18	#include·<dune/common/typetraits.hh>
19	#include·<dune/common/std/type_traits.hh>
20	#include·<dune/typetree/nodetags.hh>	17	#include·<dune/typetree/nodetags.hh>
21	#include·<dune/typetree/util~~ity~~.hh>	18	#include·<dune/typetree/filters.hh>
22	#include·<dune/ty~~petree~~/childext~~rac~~tion.hh>	19	#include·<dune/common/shared_ptr.hh>
23	#include·<dune/ty~~petree~~/typetraits.hh>	20	#include·<dune/common/typetraits.hh>
		21	#include·<dune/common/indices.hh>
24	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
25	·Classes	23	·Classes
26	·class· Dune::TypeTree::PowerNode<_T,_k_>
27	·~~·····~~·~~Coll~~e~~ct·k·instanc~~e~~s·of·~~type~~·T·with~~i~~n·a·~~dune-t~~ypetr~~e~~e.·Mor~~e~~...~~	24	·class· Dune::TypeTree::FilteredCompositeNode<_Node,_Filter_>
		25	·······Base·class·for·composite·nodes·representing·a·filtered·view·on·an
		26	·········underlying·composite·node.·More...
28		27
29	struct· Dune::TypeTree::~~Pow~~erNode<_T,_k_>::Child<_i_>	28	struct· Dune::TypeTree::FilteredCompositeNode<_Node,_Filter_>::Child<_k_>
30	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...	29	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
31		30
32	·Namespaces	31	·Namespaces
33	namespace· Dune	32	namespace· Dune
34		33
35	namespace· Dune::TypeTree	34	namespace· Dune::TypeTree
36		35


Offset 7, 469 lines modified		Offset 7, 339 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	po~~wer~~node.hh	12	filteredcompositenode.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=4·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_PO~~WER~~NODE_HH	17	·4#ifndef·DUNE_TYPETREE_FILTEREDCOMPOSITENODE_HH
18	·5#define·DUNE_TYPETREE_PO~~WER~~NODE_HH	18	·5#define·DUNE_TYPETREE_FILTEREDCOMPOSITENODE_HH
19	·6	19	·6
20	·7#include·<cassert>
21	·8#include·<array>
22	·9#include·<memory>	20	·7#include·<memory>
		21	·8#include·<tuple>
23	·10#include·<type_traits>	22	·9#include·<type_traits>
		23	·10
24	·11
25	·12#include·<dune/common/typetraits.hh>
26	·13#include·<dune/common/std/type_traits.hh>
27	·14
28	·15#include·<dune/typetree/nodetags.hh>	24	·11#include·<dune/typetree/nodetags.hh>
29	·16#include·<dune/typetree/util~~ity~~.hh>	25	·12#include·<dune/typetree/filters.hh>
		26	·13#include·<dune/common/shared_ptr.hh>
		27	·14#include·<dune/common/typetraits.hh>
		28	·15#include·<dune/common/indices.hh>
		29	·16
30	·17#include·<dune/typetree/childextr~~actio~~n.hh>	30	·17#include·<dune/typetree/filters.hh>
31	·18#include·<dune/typetree/~~typ~~etraits.hh>	31	·18#include·<dune/typetree/nodetags.hh>
32	·19	32	·19
33	·20namespace·Dune·{	33	·20namespace·Dune·{
34	·21·namespace·TypeTree·{	34	·21·namespace·TypeTree·{
35	·22	35	·22
36	·29#ifndef·DOXYGEN	36	·28#ifndef·DOXYGEN
		37	·29·namespace·{
37	·30	38	·30
38	·32·template<typename·PowerNode,·typename·T,·std::size_t·k>
39	·33·struct·AssertPowerNodeChildCount
40	·34·:·public·std::enable_if<std::is_same<
41	·35·typename·PowerNode::ChildType,
42	·36·T>::value·&&
43	·37·PowerNode::degree()·==·k,
44	·38·T>
45	·39·{};
46	·40
47	·41~~#end~~if	39	·31·/
		40	/
		41	********************************************************************************
		42	·32·//·Utility·structs·for·filter·construction·and·application
		43	·33·/
		44	/
		45	********************************************************************************
		46	·34
		47	·35·//·Gets·the·filter·and·wraps·it·in·case·of·a·SimpleFilter.
		48	·36·template<typename·Filter,·typename·Tag>
		49	·37·struct·get_filter;
		50	·38
		51	·39·//·Helper·struct·to·extract·the·child·template·parameter·pack·from·the
		52	ChildTypes·tuple.
		53	·40·template<typename·Filter,·typename·Node,·typename·ChildTypes>
		54	·41·struct·apply_filter_wrapper;
48	·42	55	·42
49	·48·template<typename·T,·std::size_t·k>
50	49·class·~~Pow~~erNode	56	·43·template<typename·Filter,·typename·Node,·typename...·Children>
		57	·44·struct·apply_filter_wrapper<Filter,Node,std::tuple<Children...>·>
		58	·45·:·public·Filter::template·apply<Node,Children...>
		59	·46·{};
		60	·47
		61	·48·//·specialization·for·SimpleFilter
		62	·49·template<typename·Filter>
		63	·50·struct·get_filter<Filter,SimpleFilterTag>
51	·50·{	64	·51·{
		65	·52·struct·type
52	·51
53	·52·public:
54	·53	66	·53·{
55	55·static·const·bool·isLeaf·=·false;
56	·56
57	58·static·const·bool·isPower·=·true;
58	·59
59	61·static·const·bool·isComposite·=·false;
60	·62
61	·64·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
62	65·static·const·std::size_t·CHILDREN·=·k;
63	·66
64	67·stat~~ic·co~~nste~~xpr·auto·d~~e~~gre~~e·()	67	·54·template<typename·Node,·typename·ChildTypes>
		68	·55·struct·apply
		69	·56·:·public·apply_filter_wrapper<filter<Filter>,Node,ChildTypes>
		70	·57·{};
		71	·58·};
		72	·59·};
		73	·60
		74	·61·//·specialization·for·AdvancedFilter
		75	·62·template<typename·Filter>
		76	·63·struct·get_filter<Filter,AdvancedFilterTag>
65	·68·{	77	·64·{
66	·6~~9·retur~~n·s~~td::in~~tegral_c~~onstan~~t<st~~d::s~~ize~~_t,k>{};~~	78	·65·struct·type
		79	·66·{
		80	·67·template<typename·Node,·typename·ChildTypes>
		81	·68·struct·apply
		82	·69·:·public·apply_filter_wrapper<Filter,Node,ChildTypes>
67	·70·}	83	·70·{};
68	·71
69	73·typedef·PowerNodeTag·NodeTag;
70	·74
71	76·~~typedef~~·T·~~ChildTyp~~e;	84	·71·};
		85	·72·};
		86	·73
		87	·74·}·//·anonymous·namespace
		88	·75#endif·//·DOXYGEN
		89	·76
72	·77	90	·77
		91	·79·template<typename·Node,·typename·Filter>
		92	80·class·FilteredCompositeNode
73	79·typedef·std::array<std::shared_ptr<T>,k>·NodeStorage;
74	·80
75	·81
76	·83·template<std::size_t·i>
77	84·struct·Child
78	·85·{	93	·81·{
		94	·82
		95	·83·typedef·typename·get_filter<Filter,typename·Filter::FilterTag>::type
		96	filter;
Max diff block lines reached; 19521/23550 bytes (82.89%) of diff not shown.


Offset 6, 37 lines modified		Offset 6, 39 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Namespaces·\|·Functions
13	pairtraversal.hh·File·Reference
14	~~#in~~cl~~ude·<dun~~e~~/common/~~s~~td/typ~~e_traits~~.hh>~~	12	Classes·\|·Namespaces
		13	powercompositenodetransformationtemplates.hh·File·Reference
		14	#include·<cstddef>
15	#include·<dune/typetree/nodeinterface.hh>	15	#include·<dune/typetree/nodeinterface.hh>
16	#include·<dune/typetree/nodetags.hh>
17	#include·<dune/typetree/treepath.hh>
18	#include·<dune/typetree/visitor.hh>
19	#include·<dune/typetree/traversal.hh>
20	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
		17	·Classes
		18	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
		19	·········Transformation,_TransformedNode_>
		20
		21	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
		22	·········Transformation,_TransformedNode_>::result<_TC_>
		23
		24	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
		25	·········SourceNode,_Transformation,_TransformedNode_>
		26
		27	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
		28	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
		29
		30	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
		31	·········SourceNode,_Transformation,_TransformedNode_>
		32
		33	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
		34	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
		35
21	·Namespaces	36	·Namespaces
22	namespace· Dune	37	namespace· Dune
23		38
24	namespace· Dune::TypeTree	39	namespace· Dune::TypeTree
25		40
26	namespace· Dune::TypeTree::Detail
27
28	·Functions
29	template<class·T1·,·class·T2·,·class·TreePath·,·class·V·,·std::enable_if_t<
30	(std::decay_t<·T1·>::isLeaf·or·std::decay_t<·T2·>::isLeaf),·int·>·=·0>
31	void Dune::TypeTree::Detail::applyToTreePair·(T1·&&tree1,·T2·&&tree2,·TreePath
32	······treePath,·V·&&visitor)
33
34	template<typename·Tree1·,·typename·Tree2·,·typename·Visitor·>
35	void Dune::TypeTree::applyToTreePair·(Tree1·&&tree1,·Tree2·&&tree2,·Visitor
36	······&&visitor)
37	····Apply·visitor·to·a·pair·of·TypeTrees.
38

39	===============================================================================	41	===============================================================================
40	·····Generated·by [doxygen]·1.9.8	42	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·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_PAIRTRAVERSAL_HH
+·4#ifndef·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
+·5#define·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
+·6
+·7#include·<cstddef>
+·8
+·9#include·<dune/typetree/nodeinterface.hh>
+·10
+·10#include·<dune/typetree/nodetags.hh>
+·11#include·<dune/typetree/treepath.hh>
+·12#include·<dune/typetree/visitor.hh>
+·13#include·<dune/typetree/traversal.hh>
+·14
+·11namespace·Dune·{
+·12·namespace·TypeTree·{
+·17
+·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);
+·41·}
+·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>>;
+·67
+·68·//·both·trees·must·support·either·dynamic·or·static·traversal
+·69·static_assert(allowDynamicTraversal::value·||·allowStaticTraversal::value);
+·70
+·71·//·the·visitor·may·specify·preferred·dynamic·traversal
+·72·using·preferDynamicTraversal·=·std::bool_constant<Visitor::treePathType·==
+TreePathType::dynamic>;
+·73
+·74·//·create·a·dynamic·or·static·index·range
+·75·auto·indices·=·[&]{
+·76·if·constexpr(preferDynamicTraversal::value·&&·allowDynamicTraversal::value)
+·77·return·Dune::range(std::size_t(tree1.degree()));
+·78·else
+·79·return·Dune::range(tree1.degree());
+·80·}();
+·81
+·82·if·constexpr(allowDynamicTraversal::value·||·allowStaticTraversal::value)·{
+·83·Dune::Hybrid::forEach(indices,·[&](auto·i)·{
+·84·auto&&·child1·=·tree1.child(i);
+·85·auto&&·child2·=·tree2.child(i);
+·86·using·Child1·=·std::decay_t<decltype(child1)>;
+·87·using·Child2·=·std::decay_t<decltype(child2)>;
+·88
+·89·visitor.beforeChild(tree1,·child1,·tree2,·child2,·treePath,·i);
+·90
+·91·//·This·requires·that·visitor.in(...)·can·always·be·instantiated,
+·92·//·even·if·there's·a·single·child·only.
+·93·if·(i>0)
+·94·visitor.in(tree1,·tree2,·treePath);
+·95
+·96·constexpr·bool·visitChild·=·Visitor::template
+VisitChild<Tree1,Child1,Tree2,Child2,TreePath>::value;
+·97·if·constexpr(visitChild)·{
+·98·auto·childTreePath·=·Dune::TypeTree::push_back(treePath,·i);
+·99·applyToTreePair(child1,·child2,·childTreePath,·visitor);
+·100·}
+·101
+·102·visitor.afterChild(tree1,·child1,·tree2,·child2,·treePath,·i);
+·103·});
+·104·}
+·105·visitor.post(tree1,·tree2,·treePath);
+·106·}
+·107
+·108·}·//·namespace·Detail
+·109
+·111
+·125·template<typename·Tree1,·typename·Tree2,·typename·Visitor>
+·void·applyToTreePair(Tree1&&·tree1,·Tree2&&·tree2,·Visitor&&·visitor)
+·127·{
+·128·Detail::applyToTreePair(tree1,·tree2,·hybridTreePath(),·visitor);
+·129·}
+·13


Offset 7, 321 lines modified		Offset 7, 251 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	chi~~ldex~~traction.hh	12	simpletransformationdescriptors.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=8·sw=2·sts=2:	15	·2//·vi:·set·et·ts=4·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_HH
18	·5#define·DUNE_TYPETREE_CHI~~LDEX~~TRACTION_HH	17	·4#ifndef·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
		18	·5#define·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
19	·6	19	·6
20	·7#include·<type_traits>
21	·8#include·<ut~~ilit~~y>	20	·7#include·<array>
		21	·8#include·<memory>
22	·9	22	·9
		23	·10#include·<dune/typetree/nodeinterface.hh>
		24	·11#include·<dune/typetree/nodetags.hh>
23	·10#include·<dune/common/concept.hh>	25	·12#include·<dune/common/exceptions.hh>
		26	·13
24	·11#include·<dune/common/documentation.hh>
25	·12#include·<dune/common/typetraits.hh>
26	·13#include·<dune/common/shared_ptr.hh>
27	·14	27	·14
28	·15#include·<dune/typetree/nodeinterface.hh>
29	·16#in~~clude·<d~~une/typetree~~/tre~~e~~path.h~~h>	28	·15namespace·Dune·{
		29	·16·namespace·TypeTree·{
30	·17	30	·17
31	·18
32	·19namespace·Dune·{
33	·20·namespace·TypeTree·{
34	·21	31	·23·template<typename·SourceNode,·typename·Transformation,·typename
		32	TransformedNode>
		33	24·struct·SimpleLeafNodeTransformation


Offset 7, 345 lines modified		Offset 7, 93 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	gene~~rictr~~ansf~~ormat~~ionde~~scriptors~~.hh	12	leafnode.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=4·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_GENERICTRANSFORMATIONDESCRIPTORS_HH
18	·5#define·DUNE_TYPETREE_GENE~~RICTR~~ANSF~~ORMAT~~IONDE~~SCRIPTORS~~_HH	17	·4#ifndef·DUNE_TYPETREE_LEAFNODE_HH
		18	·5#define·DUNE_TYPETREE_LEAFNODE_HH
19	·6	19	·6
20	·7#include·<array>
21	·8#include·<memory>
22	·9
23	·10#include·<dune/typetree/nodeinterface.hh>
24	·11#include·<dune/typetree/nodetags.hh>	20	·7#include·<dune/typetree/nodetags.hh>
		21	·8#include·<cstddef>
		22	·9#include·<type_traits>
		23	·10
25	·12#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
26	·13#include·<dune/common/exceptions.hh>
27	·14
28	·15
29	·16namespace·Dune·{	24	·11namespace·Dune·{
30	·17·namespace·TypeTree·{	25	·12·namespace·TypeTree·{
		26	·13
		27	25·class·LeafNode
31	·18
32	·24·template<typename·SourceNode,·typename·Transformation,·typename
33	TransformedNode>
34	25·struct·GenericLeafNodeTransformation
35	·26·{	28	·26·{
36	·27	29	·27


Offset 6, 39 lines modified		Offset 6, 41 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces·\|·Functions
13	~~powercompositenode~~transformation~~templates~~.hh·File·Reference	13	transformation.hh·File·Reference
		14	#include·<array>
14	#include·<cst~~ddef~~>	15	#include·<tuple>
		16	#include·<memory>
		17	#include·<utility>
		18	#include·<dune/common/hybridutilities.hh>
		19	#include·<dune/common/exceptions.hh>
		20	#include·<dune/common/typetraits.hh>
		21	#include·<dune/typetree/typetraits.hh>
15	#include·<dune/typetree/nodeinterface.hh>	22	#include·<dune/typetree/nodeinterface.hh>
		23	#include·<dune/typetree/nodetags.hh>
		24	#include·<dune/typetree/utility.hh>
16	Go_to_the_source_code_of_this_file.	25	Go_to_the_source_code_of_this_file.
17	·Classes	26	·Classes
		27	struct· Dune::TypeTree::TransformTree<_SourceTree,_Transformation,_Tag,
		28	·········recursive_>
		29	·······Transform·a·TypeTree.·More...
18	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
19	·········Transformation,_TransformedNode_>
20
21	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
22	·········Transformation,_TransformedNode_>::result<_TC_>
23
24	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
25	·········SourceNode,_Transformation,_TransformedNode_>
26
27	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
28	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
29
30	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
31	·········SourceNode,_Transformation,_TransformedNode_>
32
33	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
34	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
35		30
36	·Namespaces	31	·Namespaces
37	namespace· Dune	32	namespace· Dune
38		33
39	namespace· Dune::TypeTree	34	namespace· Dune::TypeTree
40		35
		36	·Functions
		37	template<typename·SourceNode·,·typename·Transformation·,·typename·Tag·>
		38	void Dune::TypeTree::registerNodeTransformation·(SourceNode·*,·Transformation
		39	······,·Tag·)
		40	····Register·transformation·descriptor·to·transform·SourceNode·with
		41	······Transformation.
		42

41	===============================================================================	43	===============================================================================
42	·····Generated·by [doxygen]·1.9.8	44	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·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·<cstddef>
+·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>
+template<typename,typename,std::size_t>·class·TransformedNode>
+·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·{
+·22·template<typename·TC>
+·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);


Offset 6, 33 lines modified		Offset 6, 14 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
		12	transformationutilities.hh·File·Reference
		13	#include·<dune/typetree/simpletransformationdescriptors.hh>
		14	#include·<dune/typetree/generictransformationdescriptors.hh>
12	Classes·\|·Namespaces
13	utility.hh·File·Reference
14	#include·<memory>
15	#include·<tuple>
16	#include·<type_traits>
17	#include·<utility>
18	#include·<algorithm>
19	#include·<dune/common/shared_ptr.hh>
20	#include·<dune/common/indices.hh>
21	#include·<dune/common/hybridutilities.hh>
22	#include·<dune/typetree/nodeinterface.hh>
23	#include·<dune/typetree/nodetags.hh>
24	Go_to_the_source_code_of_this_file.	15	Go_to_the_source_code_of_this_file.
25	·Classes
26	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
27	·······Struct·for·obtaining·some·basic·structural·information·about·a
28	·········TypeTree.·More...
29
30	·Namespaces
31	namespace· Dune
32
33	namespace· Dune::TypeTree
34

35	===============================================================================	16	===============================================================================
36	·····Generated·by [doxygen]·1.9.8	17	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+transformationutilities.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_TRANSFORMATIONUTILITIES_HH
+·5#define·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
+·6
+·7#include·<dune/typetree/simpletransformationdescriptors.hh>
+·8#include·<dune/typetree/generictransformationdescriptors.hh>
+·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
+·19namespace·Dune·{
+·20·namespace·TypeTree·{
+·21
+·26#ifndef·DOXYGEN
+·27
+·28·template<typename·T>
+·29·std::shared_ptr<T>·convert_arg(const·T&·t)
+·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·}
+·9
+·10#endif·//·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
+simpletransformationdescriptors.hh
+generictransformationdescriptors.hh
+·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
+·56
+·57·namespace·Experimental·{
+·58
+·67·template<class·BinaryOp,·class·Arg>
+·68·constexpr·decltype(auto)
+·69·left_fold(BinaryOp&&·binary_op,·Arg&&·arg)
+·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)
+·98·{
+·99·return·left_fold(
+·100·std::forward<BinaryOp>(binary_op),
+·101·binary_op(std::forward<Init>(init),·std::forward<Arg0>(arg_0)),
+·102·std::forward<Args>(args)...);
+·103·}
+·104
+·105
+·106·namespace·Hybrid·{
+·107·using·namespace·Dune::Hybrid;
+·108
+·109·namespace·Detail·{
+·110·template<class·Op,·class...·Args>
+·111·constexpr·auto·applyOperator(Op&&·op,·Args&&...·args)
+·112·{
+·113·using·T·=·std::common_type_t<Args...>;
+·114·return·op(static_cast<T>(args)...);
+·115·}
+·116
+·117·template<class·Op,·class·T,·T...·Args>
+·118·constexpr·auto·applyOperator(Op,·std::integral_constant<T,Args>...)
+·119·{
+·120·static_assert(std::is_default_constructible_v<Op>,
+·121·"Operator·in·integral·expressions·shall·be·default·constructible");
+·122·constexpr·auto·result·=·Op{}(T{Args}...);
+·123·return·std::integral_constant<std::decay_t<decltype(result)>,result>{};
+·124·}
+·125
+·126·//·FIXME:·use·lambda·when·we·adpot·c++20
+·127·struct·Max·{
+·128·template<class...·Args>
+·129·constexpr·auto·operator()(Args&&...·args)·const
+·130·{
+·131·using·T·=·std::common_type_t<Args...>;
+·132·return·std::max({static_cast<T>(args)...});
+·133·}
+·134·};
+·135·}
+·136
+·137·static·constexpr·auto·max·=·[](const·auto&·a,·const·auto&·b)
+·138·{
+·139·return·Detail::applyOperator(Detail::Max{},·a,·b);
+·140·};
+·141
+·142·static·constexpr·auto·plus·=·[](const·auto&·a,·const·auto&·b)
+·143·{
+·144·return·Detail::applyOperator(std::plus<>{},·a,·b);
+·145·};


Offset 7, 52 lines modified		Offset 7, 22 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces
		13	leafnode.hh·File·Reference
13	generictransformationdescriptors.hh·File·Reference
14	#include·<array>
15	#include·<memory>
16	#include·<dune/typetree/nodeinterface.hh>
17	#include·<dune/typetree/nodetags.hh>	14	#include·<dune/typetree/nodetags.hh>
18	#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
19	#include·<~~dune/common/ex~~cept~~ions.hh~~>	15	#include·<cstddef>
		16	#include·<type_traits>
20	Go_to_the_source_code_of_this_file.	17	Go_to_the_source_code_of_this_file.
21	·Classes	18	·Classes
		19	class· Dune::TypeTree::LeafNode
		20	······Base·class·for·leaf·nodes·in·a·dune-typetree.·More...
22	struct· Dune::TypeTree::GenericLeafNodeTransformation<_SourceNode,
23	·········Transformation,_TransformedNode_>
24
25	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
26	·········Transformation,_TransformedNodeTemplate_>
27
28	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
29	·········Transformation,_TransformedNodeTemplate_>::result<_TC_>
30
31	struct· Dune::TypeTree::GenericPowerNodeTransformation<_SourceNode,
32	·········Transformation,_TransformedNode_>
33
34	struct· Dune::TypeTree::TemplatizedGenericDynamicPowerNodeTransformation<
35	·········SourceNode,_Transformation,_TransformedNodeTemplate_>
36
37	struct· Dune::TypeTree::TemplatizedGenericDynamicPowerNodeTransformation<
38	·········SourceNode,_Transformation,_TransformedNodeTemplate_>::result<_TC_>
39
40	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformation<_SourceNode,
41	·········Transformation,_TransformedNode_>
42
43	struct· Dune::TypeTree::TemplatizedGenericCompositeNodeTransformation<
44	·········SourceNode,_Transformation,_TransformedNodeTemplate_>
45
46	struct· Dune::TypeTree::TemplatizedGenericCompositeNodeTransformation<
47	·········SourceNode,_Transformation,_TransformedNodeTemplate_>::result<_TC_>
48
49	struct· Dune::TypeTree::GenericCompositeNodeTransformation<_SourceNode,
50	·········Transformation,_TransformedNode_>
51		21
52	·Namespaces	22	·Namespaces
53	namespace· Dune	23	namespace· Dune
54		24
55	namespace· Dune::TypeTree	25	namespace· Dune::TypeTree
56		26


Offset 6, 89 lines modified		Offset 6, 207 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces·\|·Functions	12	Classes·\|·Namespaces·\|·Typedefs·\|·Enumerations·\|·Functions
13	typetraits.hh·File·Reference	13	treepath.hh·File·Reference
14	#include·<~~typ~~e_tr~~aits~~>	14	#include·<cstddef>
		15	#include·<iostream>
		16	#include·<dune/common/documentation.hh>
15	#include·<dune/common/typetraits.hh>	17	#include·<dune/common/typetraits.hh>
		18	#include·<dune/common/indices.hh>
		19	#include·<dune/common/hybridutilities.hh>
		20	#include·<dune/typetree/fixedcapacitystack.hh>
16	#include·<dune/typetree/t~~reepa~~th.hh>	21	#include·<dune/typetree/utility.hh>
17	#include·<dune/typetree/nodeinterface.hh>
18	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
19	·Classes	23	·Classes
20	~~struct~~· Dune::fir~~st_t~~y~~pe<_~~T~~0,_T...~~_>	24	·class· Dune::TypeTree::HybridTreePath<_T_>
		25	·······A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run
		26	·········time·indices.·More...
21		27
22	struct· Dune::TypeTree::has_node_tag<_T_>	28	struct· Dune::TypeTree::TreePathSize<_HybridTreePath<_index_constant<_i_>..._>
		29	·········>
23		30
24	struct· Dune::TypeTree::has_node_tag<_T_~~>::yes~~	31	struct· Dune::TypeTree::TreePathPushBack<_HybridTreePath<_index_constant<_i
		32	·········>..._>,_k_>
25		33
26	struct· Dune::TypeTree::has_node_tag<_T_~~>::~~no	34	struct· Dune::TypeTree::TreePathPushFront<_HybridTreePath<_index_constant<_i
		35	·········>..._>,_k_>
27		36
28	struct· Dune::TypeTree::has_node_~~tag~~_~~value~~<_T,_V_>	37	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_k_>_>_>
29		38
30	struct· Dune::TypeTree::has_~~node_tag_value~~<_~~T,_V~~_~~>::maybe~~<_N_>	39	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_j_>,
		40	·········index_constant<_k_>,_index_constant<_l_>..._>_>
31		41
32	struct· Dune::TypeTree::has_node_ta~~g_valu~~e<_~~T,_V_>::yes~~	42	struct· Dune::TypeTree::TreePathFront<_HybridTreePath<_index_constant<_k_>,
		43	·········index_constant<_i_>..._>_>
33		44
34	struct· Dune::TypeTree::has_node_ta~~g_valu~~e<_~~T,_V_>::no~~	45	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_k_>
		46	·········>,_i..._>
35		47
36	struct· Dune::TypeTree::has_i~~mpl~~e~~men~~tation_tag<_T_>	48	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_j_>,
		49	·········index_constant<_k_>,_index_constant<_l_>..._>,_i..._>
37		50
38	struct· Dune::TypeTree::has_i~~mpl~~e~~men~~tation_tag<_T_>~~::ye~~s	51	struct· Dune::TypeTree::TreePathPopFront<_HybridTreePath<_index_constant<_k_>,
		52	·········index_constant<_i_>..._>_>
39		53
		54	struct· Dune::TypeTree::TreePathConcat<_HybridTreePath<_index_constant<_i_>...
		55	·········>,_HybridTreePath<_index_constant<_k_>..._>_>
40	struct· Dune::TypeTree::has_implementation_tag<_T_>::no
41
42	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>
43
44	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::maybe<_N_>
45
46	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::yes
47
48	struct· Dune::TypeTree::has_implementation_tag_value<_T,_V_>::no
49
50	struct· Dune::TypeTree::AlwaysVoid<_typename_>
51
52	struct· Dune::TypeTree::meta_function
53	·······Marker·tag·declaring·a·meta·function.·More...
54
55	struct· Dune::TypeTree::lazy_evaluate<_F_>
56	·······Helper·meta·function·to·delay·evaluation·of·F.·More...
57
58	struct· Dune::TypeTree::lazy_identity<_F_>
59	·······Identity·function.·More...
60
61	struct· Dune::TypeTree::evaluate_if_meta_function<_F_>
62	·······Meta·function·that·evaluates·its·argument·iff·it·inherits·from
63	·········meta_function.·More...
64
65	struct· Dune::TypeTree::IsTreePath<_T_>
66	·······Check·if·type·represents·a·tree·path.·More...
67		56
68	·Namespaces	57	·Namespaces
69	namespace· Dune	58	namespace· Dune
70		59
71	namespace· Dune::TypeTree	60	namespace· Dune::TypeTree
72		61
73	namespace· Dune::TypeTree::impl	62	namespace· Dune::TypeTree::TreePathType
		63
		64	·Typedefs
		65	template<std::size_t...·i>
		66	using Dune::TypeTree::TreePath·=·HybridTreePath<·Dune::index_constant<·i·>...
		67	·······>
		68
		69	template<std::size_t...·i>
		70	using Dune::TypeTree::StaticTreePath·=·HybridTreePath<·Dune::index_constant<·i
		71	·······>...·>
		72
		73	·Enumerations
		74	enum· Dune::TypeTree::TreePathType::Type·{·Dune::TypeTree::TreePathType::
		75	·······fullyStatic·,·Dune::TypeTree::TreePathType::dynamic·}
74		76
75	·Functions	77	·Functions
		78	template<std::size_t...·i>
		79	·································void Dune::TypeTree::print_tree_path·(std::
		80	·······································ostream·&os)
76	template<typename·T·>
77	···········T·* Dune::TypeTree::declptr·()
78	··············Helper·function·for·generating·a·pointer·to·a·value·of·type·T
79	················in·an·unevaluated·operand·setting.
80		81
81	~~cons~~texpr·aut~~o Dune::TypeTre~~e::~~impl~~::isTreePat~~h·(void·*)~~·->·std::f~~als~~e_t~~ype~~	82	template<std::size_t·k,·std::size_t...·i>
		83	·································void Dune::TypeTree::print_tree_path·(std::
		84	·······································ostream·&os)
82		85
83	template<class...·I>
84	constexpr·auto Dune::TypeTree::impl::isTreePath·(const·HybridTreePath<·I...·>
85	~~················*)·->·s~~t~~d::tru~~e~~_type~~	86	template<typename...·T>
		87	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::hybridTreePath·(const·T
		88	·······································&...·t)
		89	·····································Constructs·a·new·HybridTreePath·from·the
		90	·······································given·indices.
86		91
		92	template<typename...·T>
		93	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::treePath·(const·T·&...
		94	·······································t)
		95	·····································Constructs·a·new·HybridTreePath·from·the
		96	·······································given·indices.
		97
Max diff block lines reached; 118/11668 bytes (1.01%) of diff not shown.


Offset 7, 346 lines modified		Offset 7, 613 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	typetraits.hh	12	treepath.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=8·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_TYPETRAITS_HH	17	·4#ifndef·DUNE_TYPETREE_TREEPATH_HH
18	·5#define·DUNE_TYPETREE_TYPETRAITS_HH	18	·5#define·DUNE_TYPETREE_TREEPATH_HH
19	·6	19	·6
20	·7#include·<type_traits>
21	·8#include·<~~dune/~~c~~ommon~~/type~~traits.h~~h>	20	·7#include·<cstddef>
		21	·8#include·<iostream>
22	·9	22	·9
23	·10#include·<dune/typetree/treepath.hh>
24	·11#include·<dune/typetree/nodeinterface.hh>
25	·12
26	·13nam~~espa~~ce~~·Du~~n~~e·{~~	23	·10#include·<dune/common/documentation.hh>
		24	·11#include·<dune/common/typetraits.hh>
		25	·12#include·<dune/common/indices.hh>
		26	·13#include·<dune/common/hybridutilities.hh>
27	·14	27	·14
28	·15·//·Provide·some·more·C++11·TMP·helpers.
29	·16~~·//·Thes~~e·should~~·be·u~~pstreame~~d·to·~~d~~une-~~c~~ommon·ASAP.~~	28	·15#include·<dune/typetree/fixedcapacitystack.hh>
		29	·16#include·<dune/typetree/utility.hh>
30	·17	30	·17
		31	·18
		32	·19namespace·Dune·{
31	·18·template<typename...·T>
32	19·struct·first_type;
33	·20
34	·21·template<typename·T0,·typename...·T>
35	22·struct·first_type<T0,T...>
36	·23·{
37	24·typedef·T0·type;
38	·25·};
39	·26
40	·27·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
		34	·21
		35	·22·template<typename...·T>
		36	·23·class·HybridTreePath;
		37	·24
41	·28	38	·28
42	·29·template<typename·T>
43	30·~~stru~~ct·~~has_node_tag~~	39	29·namespace·TreePathType·{
		40	30·enum·Type·{·fullyStatic,·dynamic·};
44	·31·{	41	·31·}
		42	·32
45	32·struct·yes·{·char·dummy[1];·};
46	33·struct·no·{·char·dummy[2];·};
47	·34
48	·35·template<typename·X>	43	·33·template<typename>
		44	34·struct·TreePathSize;
		45	·35
		46	·36·template<typename,std::size_t>
		47	37·struct·TreePathPushBack;
		48	·38
		49	·39·template<typename,std::size_t>
		50	40·struct·TreePathPushFront;
		51	·41
49	36·static·yes·test(NodeTag<X>·*);
50	·37·template<typename·X>
51	38·static·no·test(...);
52	·39
53	41·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
54	·42·};
55	·43
56	·44·template<typename·T,·typename·V>
57	45·struct·has_node_tag_value
58	·46·{
59	·47·template<int·N>
60	48·struct·maybe·{·char·dummy[N+1];·};
61	49·struct·yes·{·char·dummy[2];·};
62	50·struct·no·{·char·dummy[1];·};
63	·51
64	·52·template<typename·X>	52	·42·template<typename>
65	·53·static·maybe<std::is_base_of<V,_NodeTag<X>>::value>
66	54·test~~(Node~~T~~ag<X>·*·~~a);	53	43·struct·TreePathBack;
		54	·44
67	·55·template<typename·X>	55	·45·template<typename>
68	56·static·no·test(...);
69	·57
70	59·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
71	·60·};
72	·61	56	46·struct·TreePathFront;
		57	·47
		58	·48·template<typename,·std::size_t...>
		59	49·struct·TreePathPopBack;
		60	·50
73	·62·template<typename·T>	61	·51·template<typename>
74	63·struct·~~has_implementati~~on_tag	62	52·struct·TreePathPopFront;
		63	·53
		64	·54·template<typename,·typename>
		65	55·struct·TreePathConcat;
		66	·56
		67	·57·template<std::size_t...·i>
		68	58·void·print_tree_path(std::ostream&·os)
		69	·59·{}
		70	·60
		71	·61·template<std::size_t·k,·std::size_t...·i>
		72	62·void·print_tree_path(std::ostream&·os)
75	·64·{	73	·63·{
76	65·struct·yes·{·char·dummy[1];·};
77	66·~~stru~~ct·no·{·char·~~dummy[2];~~·};	74	·64·os·<<·k·<<·"·";
		75	·65·print_tree_path<i...>(os);
		76	·66·}
78	·67	77	·67
		78	·69
79	·68·template<typename·X>
80	69·static·yes·test(ImplementationTag<X>·*);
81	·70·template<typename·X>	79	·77·template<typename...·T>
		80	78·class·HybridTreePath
82	71·static·no·test(...);
83	·72
84	74·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
85	·75·};
86	·76
87	·77·template<typename·T,·typename·V>
88	78·struct·has_implementation_tag_value
89	·79·{	81	·79·{
		82	·80
		83	·81·public:
Max diff block lines reached; 24143/28681 bytes (84.18%) of diff not shown.

+Loading...
+Searching...
+No·Matches
+····*·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·<array>
+·7#include·<dune/typetree/treepath.hh>
+·8#include·<dune/typetree/utility.hh>
+·9
+·10namespace·Dune·{
+·11·namespace·TypeTree·{
+·12
+·19
+·struct·DefaultVisitor
+·13
+·17
+·18·template<typename·T>
+·class·FixedCapacityStackView
+·20·{
+·21
+·22·public:
+·23
+·24·struct·Impl
+·25·{
+·26
+·27·Impl(T*·data,·std::size_t·capacity)
+·28·:·_data(data)
+·29·,·_size(0)
+·30·,·_capacity(capacity)
+·31·{}
+·32
+·33·T·*·const·_data;
+·34·std::size_t·_size;
+·35·const·std::size_t·_capacity;
+·36·};
+·37
+·FixedCapacityStackView(Impl&·impl)
+·39·:·_impl(impl)
+·40·{}
+·41
+·42·public:
+·43
+·std::size_t·size()·const
+·47·{
+·46·return·_impl._size;
+·47·}
+·48
+·std::size_t·capacity()·const
+·50
+·57·template<typename·T,·typename·TreePath>
+·void·pre(T&&,·TreePath)·const·{}
+·59
+·61
+·69·template<typename·T,·typename·TreePath>
+·void·in(T&&,·TreePath)·const·{}
+·51·return·_impl._capacity;
+·52·}
+·53
+·bool·empty()·const
+·55·{
+·56·return·_impl._size·==·0;
+·57·}
+·58
+·bool·full()·const
+·60·{
+·61·return·_impl._size·==·_impl._capacity;
+·62·}
+·63
+·void·push_back(const·T&·t)
+·65·{
+·66·assert(!full());
+·67·_impl._data[_impl._size++]·=·t;
+·68·}
+·69
+·void·pop_back()
+·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·{}
+·72·assert(!empty());
+·73·--_impl._size;
+·74·}
+·75
+·T&·back()
+·77·{
+·78·assert(!empty());
+·79·return·_impl._data[_impl._size-1];
+·80·}
+·81
+·const·T&·back()·const
+·83·{
+·84·assert(!empty());
+·85·return·_impl._data[_impl._size-1];
+·86·}
+·87
+·T&·front()
+·89·{
+·90·assert(!empty());
+·91·return·_impl._data[0];
+·92
+·94
+·104·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex>
+·void·beforeChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
+·93
+·const·T&·front()·const
+·95·{
+·96·assert(!empty());
+·97·return·_impl._data[0];
+·98·}
+·99
+·T&·operator[](std::size_t·k)
+·101·{


Offset 78, 17 lines modified		Offset 78, 17 lines modified
78	<a·href="#namespaces">Namespaces</a>··</div>	78	<a·href="#namespaces">Namespaces</a>··</div>
79	··<div·class="headertitle"><div·class="title">compositenode.hh·File·Reference</div></div>	79	··<div·class="headertitle"><div·class="title">compositenode.hh·File·Reference</div></div>
80	</div><!--header-->	80	</div><!--header-->
81	<div·class="contents">	81	<div·class="contents">
82	<div·class="textblock"><code>#include·<tuple></code><br·/>	82	<div·class="textblock"><code>#include·<tuple></code><br·/>
83	<code>#include·<memory></code><br·/>	83	<code>#include·<memory></code><br·/>
84	<code>#include·<type_traits></code><br·/>	84	<code>#include·<type_traits></code><br·/>
85	<code>#include·<<a·class="el"·href="a00083_source.html">dune/typetree/nodetags.hh</a>></code><br·/>	85	<code>#include·<<a·class="el"·href="a00074_source.html">dune/typetree/nodetags.hh</a>></code><br·/>
86	<code>#include·<<a·class="el"·href="a00029_source.html">dune/typetree/childextraction.hh</a>></code><br·/>	86	<code>#include·<<a·class="el"·href="a00053_source.html">dune/typetree/childextraction.hh</a>></code><br·/>
87	<code>#include·<<a·class="el"·href="a00035_source.html">dune/typetree/typetraits.hh</a>></code><br·/>	87	<code>#include·<<a·class="el"·href="a00077_source.html">dune/typetree/typetraits.hh</a>></code><br·/>
88	</div>	88	</div>
89	<p><a·href="a00041_source.html">Go·to·the·source·code·of·this·file.</a></p>	89	<p><a·href="a00041_source.html">Go·to·the·source·code·of·this·file.</a></p>
90	<table·class="memberdecls">	90	<table·class="memberdecls">
91	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>	91	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>
92	Classes</h2></td></tr>	92	Classes</h2></td></tr>
93	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01075.html">Dune::TypeTree::CompositeNode<·Children·></a></td></tr>	93	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01075.html">Dune::TypeTree::CompositeNode<·Children·></a></td></tr>
94	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Base·class·for·composite·nodes·based·on·variadic·templates.··<a·href="a01075.html#details">More...</a><br·/></td></tr>	94	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Base·class·for·composite·nodes·based·on·variadic·templates.··<a·href="a01075.html#details">More...</a><br·/></td></tr>


Offset 87, 17 lines modified		Offset 87, 17 lines modified
87	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_COMPOSITENODE_HH</span></div>	87	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_COMPOSITENODE_HH</span></div>
88	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_COMPOSITENODE_HH</span></div>	88	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_COMPOSITENODE_HH</span></div>
89	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	89	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
90	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<tuple></span></div>	90	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<tuple></span></div>
91	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<memory></span></div>	91	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<memory></span></div>
92	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<type_traits></span></div>	92	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<type_traits></span></div>
93	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span>·</div>	93	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span>·</div>
94	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<<a·class="code"·href="a00083.html">dune/typetree/nodetags.hh</a>></span></div>	94	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<<a·class="code"·href="a00074.html">dune/typetree/nodetags.hh</a>></span></div>
95	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<<a·class="code"·href="a00029.html">dune/typetree/childextraction.hh</a>></span></div>	95	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<<a·class="code"·href="a00053.html">dune/typetree/childextraction.hh</a>></span></div>
96	<div·class="line"><a·id="l00013"·name="l00013"></a><span·class="lineno">···13</span><span·class="preprocessor">#include·<<a·class="code"·href="a00035.html">dune/typetree/typetraits.hh</a>></span></div>	96	<div·class="line"><a·id="l00013"·name="l00013"></a><span·class="lineno">···13</span><span·class="preprocessor">#include·<<a·class="code"·href="a00077.html">dune/typetree/typetraits.hh</a>></span></div>
97	<div·class="line"><a·id="l00014"·name="l00014"></a><span·class="lineno">···14</span>·</div>	97	<div·class="line"><a·id="l00014"·name="l00014"></a><span·class="lineno">···14</span>·</div>
98	<div·class="line"><a·id="l00015"·name="l00015"></a><span·class="lineno">···15</span><span·class="keyword">namespace·</span><a·class="code·hl_namespace"·href="a00097.html">Dune</a>·{</div>	98	<div·class="line"><a·id="l00015"·name="l00015"></a><span·class="lineno">···15</span><span·class="keyword">namespace·</span><a·class="code·hl_namespace"·href="a00097.html">Dune</a>·{</div>
99	<div·class="line"><a·id="l00016"·name="l00016"></a><span·class="lineno">···16</span>··<span·class="keyword">namespace·</span>TypeTree·{</div>	99	<div·class="line"><a·id="l00016"·name="l00016"></a><span·class="lineno">···16</span>··<span·class="keyword">namespace·</span>TypeTree·{</div>
100	<div·class="line"><a·id="l00017"·name="l00017"></a><span·class="lineno">···17</span>·</div>	100	<div·class="line"><a·id="l00017"·name="l00017"></a><span·class="lineno">···17</span>·</div>
101	<div·class="line"><a·id="l00024"·name="l00024"></a><span·class="lineno">···24</span>····<span·class="keyword">template</span><<span·class="keyword">typename</span>...·Children></div>	101	<div·class="line"><a·id="l00024"·name="l00024"></a><span·class="lineno">···24</span>····<span·class="keyword">template</span><<span·class="keyword">typename</span>...·Children></div>
102	<div·class="foldopen"·id="foldopen00025"·data-start="{"·data-end="};">	102	<div·class="foldopen"·id="foldopen00025"·data-start="{"·data-end="};">
103	<div·class="line"><a·id="l00025"·name="l00025"></a><span·class="lineno"><a·class="line"·href="a01075.html">···25</a></span>····<span·class="keyword">class·</span><a·class="code·hl_class"·href="a01075.html">CompositeNode</a></div>	103	<div·class="line"><a·id="l00025"·name="l00025"></a><span·class="lineno"><a·class="line"·href="a01075.html">···25</a></span>····<span·class="keyword">class·</span><a·class="code·hl_class"·href="a01075.html">CompositeNode</a></div>


Offset 211, 16 lines modified		Offset 211, 16 lines modified
211	·240	211	·240
212	·242	212	·242
213	·243·}·//·namespace·TypeTree	213	·243·}·//·namespace·TypeTree
214	·244}·//namespace·Dune	214	·244}·//namespace·Dune
215	·245	215	·245
216	·246#endif·//·DUNE_TYPETREE_COMPOSITENODE_HH	216	·246#endif·//·DUNE_TYPETREE_COMPOSITENODE_HH
217	childextraction.hh	217	childextraction.hh
218	typetraits.hh
219	nodetags.hh	218	nodetags.hh
		219	typetraits.hh
220	Dune::TypeTree::child	220	Dune::TypeTree::child
221	ImplementationDefined·child(Node·&&node,·Indices...·indices)	221	ImplementationDefined·child(Node·&&node,·Indices...·indices)
222	Extracts·the·child·of·a·node·given·by·a·sequence·of·compile-time·and·run-time	222	Extracts·the·child·of·a·node·given·by·a·sequence·of·compile-time·and·run-time
223	indices.	223	indices.
224	Definition·childextraction.hh:126	224	Definition·childextraction.hh:126
225	Dune	225	Dune
226	Definition·accumulate_static.hh:13	226	Definition·accumulate_static.hh:13


Offset 7, 62 lines modified		Offset 7, 22 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces
13	filters.hh·File·Reference
14	#include·<tuple>
15	#i~~nclude·<dune/common/typ~~e~~traits.hh>~~	13	fixedcapacitystack.hh·File·Reference
		14	#include·<array>
		15	#include·<cassert>
16	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
17	·Classes	17	·Classes
		18	class· Dune::TypeTree::FixedCapacityStackView<_T_>
18	struct· Dune::TypeTree::FilterEntry<_new_k,_old_k_>
19	·······A·filter·entry·describing·the·mapping·of·one·child·in·the·filtered
20	·········node.·More...
21		19
		20	class· Dune::TypeTree::FixedCapacityStack<_T,_capacity_>
22	struct· Dune::TypeTree::FilterResult<_FilterEntries_>
23	·······The·result·of·a·filter.·More...
24
25	struct· Dune::TypeTree::FilterResult<_FilterEntries_>::apply<_Node_>
26
27	struct· Dune::TypeTree::SimpleFilterTag
28	·······Tag·describing·a·simple·filter·that·can·only·decide·whether·or·not·to
29	·········include·a·single·given·child.·More...
30
31	struct· Dune::TypeTree::AdvancedFilterTag
32	·······Tag·describing·an·advanced·filter·that·has·full·control·over·the
33	·········construction·of·the·list·of·FilterEntries.·More...
34
35	struct· Dune::TypeTree::AdvancedFilter
36	·······Base·class·for·advanced·filters.·More...
37
38	struct· Dune::TypeTree::AdvancedFilter::apply<_Node,_Children_>
39	·······Apply·this·filter·to·the·given·node·and·children.·More...
40
41	struct· Dune::TypeTree::SimpleFilter
42	·······Default·simple·filter·that·accepts·any·node·and·leaves·its·child
43	·········structure·unchanged.·More...
44
45	struct· Dune::TypeTree::SimpleFilter::validate<_Node_>
46	·······Validates·the·combination·of·filter·and·node.·More...
47
48	struct· Dune::TypeTree::SimpleFilter::apply<_Child,_new_index,_old_index_>
49	·······Applies·the·filter·to·the·given·child·node.·More...
50
51	struct· Dune::TypeTree::IndexFilter<_indices_>
52	·······Filter·class·for·FilteredCompositeNode·that·selects·the·children·with
53	·········the·given·indices.·More...
54
55	struct· Dune::TypeTree::filter<_Filter_>
56	·······Adapter·class·that·takes·a·SimpleFilter,·validated·it·and·turns·it
57	·········into·an·AdvancedFilter.·More...
58
59	struct· Dune::TypeTree::filter<_Filter_>::apply<_Node,_Children_>
60	·······Apply·the·filter.·More...
61		21
62	·Namespaces	22	·Namespaces
63	namespace· Dune	23	namespace· Dune
64		24
65	namespace· Dune::TypeTree	25	namespace· Dune::TypeTree
66		26


Offset 7, 319 lines modified		Offset 7, 209 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	filt~~ers~~.hh	12	fixedcapacitystack.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=8·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_FILT~~ERS~~_HH	17	·4#ifndef·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
18	·5#define·DUNE_TYPETREE_FILT~~ERS~~_HH	18	·5#define·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
19	·6	19	·6
		20	·7#include·<array>
		21	·8#include·<cassert>
		22	·9
20	·7#include·<tuple>
21	·8
22	·9#include·<dune/common/typetraits.hh>
23	·10
24	·11namespace·Dune·{	23	·10namespace·Dune·{
25	·12·namespace·TypeTree·{	24	·11·namespace·TypeTree·{
		25	·12
26	·13	26	·13
27	·20·template<std::size_t·new_k,·std::size_t·old_k>
28	~~21·struct~~·~~FilterEnt~~ry	27	·17
		28	·18·template<typename·T>
		29	19·class·FixedCapacityStackView
29	·22·{	30	·20·{
		31	·21
		32	·22·public:
30	·23	33	·23
31	·24~~#ifndef~~·~~DOXYGEN~~	34	·24·struct·Impl
32	·25	35	·25·{
33	·26·//·The·precise·contents·of·this·class·is·an·implementation·detail.
34	·27
35	·28·static·const·std::size_t·filtered_index·=·new_k;
36	·29·static·const·std::size_t·original_index·=·old_k;
37	·30
38	·~~31#endif·//·DOXYG~~EN	36	·26
		37	·27·Impl(T*·data,·std::size_t·capacity)
		38	·28·:·_data(data)
		39	·29·,·_size(0)
		40	·30·,·_capacity(capacity)
		41	·31·{}
39	·32	42	·32
		43	·33·T·*·const·_data;
		44	·34·std::size_t·_size;
		45	·35·const·std::size_t·_capacity;
40	·33·};	46	·36·};
		47	·37
		48	38·FixedCapacityStackView(Impl&·impl)
		49	·39·:·_impl(impl)
		50	·40·{}
41	·34
42	·36·template<typename...·FilterEntries>
43	37·struct·FilterResult
44	·38·{
45	·39
46	40·static·const·std::size_t·size·=·sizeof...(FilterEntries);
47	·41	51	·41
48	42·typ~~edef·std::t~~u~~ple<F~~il~~terEntr~~i~~es...>·IndexMa~~p;	52	·42·public:
49	·43	53	·43
		54	44·std::size_t·size()·const
50	·44·template<typename·Node>
51	45·struct·apply
52	·46·{	55	·45·{
		56	·46·return·_impl._size;
		57	·47·}
		58	·48
		59	49·std::size_t·capacity()·const
		60	·50·{
		61	·51·return·_impl._capacity;
53	47·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
54	original_index>...>·Children;
55	48·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
56	original_index>::Type...>·ChildTypes;
57	49·typedef·std::tuple<std::shared_ptr<typename·Node::template
58	Child<FilterEntries::original_index>::Type>...>·NodeStorage;
59	·50·};
60	·51
61	·52·};	62	·52·}
62	·53	63	·53
63	55·struct·SimpleFilterTag·{};
64	·56
65	58·struct·AdvancedFilterTag·{};
66	·59
67	·60
68	62·st~~ruct~~·A~~dvancedFilter~~	64	54·bool·empty()·const
		65	·55·{
		66	·56·return·_impl._size·==·0;
		67	·57·}
		68	·58
		69	59·bool·full()·const
69	·63·{	70	·60·{
70	·64
71	66·typedef·AdvancedFilterTag·FilterTag;
72	·67
73	·68#ifdef·~~DOXYGEN~~	71	·61·return·_impl._size·==·_impl._capacity;
		72	·62·}
		73	·63
		74	64·void·push_back(const·T&·t)
		75	·65·{
		76	·66·assert(!full());
		77	·67·_impl._data[_impl._size++]·=·t;
		78	·68·}
74	·69	79	·69
		80	70·void·pop_back()
75	·71·template<typename·Node,·typename...·Children>
76	72·struct·apply
77	·73·{	81	·71·{
		82	·72·assert(!empty());
		83	·73·--_impl._size;
		84	·74·}
78	·75	85	·75
79	78·typedef·implementation-defined·type;
80	·79·};	86	76·T&·back()
		87	·77·{
		88	·78·assert(!empty());
		89	·79·return·_impl._data[_impl._size-1];
81	·80	90	·80·}
82	·81#endif·//·DOXYGEN
83	·82
84	·83·};
85	·84	91	·81
Max diff block lines reached; 9994/13285 bytes (75.23%) of diff not shown.


Offset 6, 25 lines modified		Offset 6, 33 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
		12	Classes·\|·Namespaces
12	t~~ype~~tree.hh·File·Reference	13	utility.hh·File·Reference
		14	#include·<memory>
		15	#include·<tuple>
		16	#include·<type_traits>
		17	#include·<utility>
		18	#include·<algorithm>
		19	#include·<dune/common/shared_ptr.hh>
		20	#include·<dune/common/indices.hh>
		21	#include·<dune/common/hybridutilities.hh>
		22	#include·<dune/typetree/nodeinterface.hh>
13	#include·<dune/typetree/nodetags.hh>	23	#include·<dune/typetree/nodetags.hh>
14	#include·<dune/typetree/utility.hh>
15	#include·<dune/typetree/leafnode.hh>
16	#include·<dune/typetree/powernode.hh>
17	#include·<dune/typetree/dynamicpowernode.hh>
18	#include·<dune/typetree/compositenode.hh>
19	#include·<dune/typetree/traversal.hh>
20	#include·<dune/typetree/pairtraversal.hh>
21	#include·<dune/typetree/traversalutilities.hh>
22	#include·<dune/typetree/transformation.hh>
23	#include·<dune/typetree/transformationutilities.hh>
24	#include·<dune/typetree/accumulate_static.hh>
25	#include·<dune/typetree/childextraction.hh>
26	Go_to_the_source_code_of_this_file.	24	Go_to_the_source_code_of_this_file.
		25	·Classes
		26	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
		27	·······Struct·for·obtaining·some·basic·structural·information·about·a
		28	·········TypeTree.·More...
		29
		30	·Namespaces
		31	namespace· Dune
		32
		33	namespace· Dune::TypeTree
		34

27	===============================================================================	35	===============================================================================
28	·····Generated·by [doxygen]·1.9.8	36	·····Generated·by [doxygen]·1.9.8


Offset 7, 84 lines modified		Offset 7, 59 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Namespaces·\|·Typedefs·\|·Functions	12	Namespaces·\|·Typedefs·\|·Functions
13	trav~~ersal~~.hh·File·Reference	13	childextraction.hh·File·Reference
		14	#include·<type_traits>
14	#include·<utility>	15	#include·<utility>
		16	#include·<dune/common/concept.hh>
15	#include·<dune/common/~~hybridu~~tilities.hh>	17	#include·<dune/common/documentation.hh>
16	#include·<dune/common/~~std/~~type_traits.hh>	18	#include·<dune/common/typetraits.hh>
17	#include·<dune/ty~~petree~~/childext~~rac~~tion.hh>	19	#include·<dune/common/shared_ptr.hh>
18	#include·<dune/typetree/nodetags.hh>	20	#include·<dune/typetree/nodeinterface.hh>
19	#include·<dune/typetree/treepath.hh>	21	#include·<dune/typetree/treepath.hh>
20	#include·<dune/typetree/visitor.hh>
21	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
22	·Namespaces	23	·Namespaces
23	namespace· Dune	24	namespace· Dune
24		25
25	namespace· Dune::TypeTree	26	namespace· Dune::TypeTree
26		27
27	namespace· Dune::TypeTree::Detail
28
29	·Typedefs	28	·Typedefs
30	template<class·Tree·>
31	using Dune::TypeTree::Detail::DynamicTraversalConcept·=·decltype((std::
32	·~~······d~~ecl~~val<·Tre~~e·>().d~~egre~~e(),·std::~~declval<·Tre~~e·~~>()~~.child(~~0u)))~~	29	template<typename·Node·,·std::size_t...·indices>
		30	using Dune::TypeTree::Child·=·typename·impl::_Child<·Node,·indices...·>::type
		31	·····Template·alias·for·the·type·of·a·child·node·given·by·a·list·of·child
		32	·······indices.
33		33
34	template<class·Tree·>
35	using Dune::TypeTree::Detail::StaticTraversalConcept·=·decltype((std::
36	~~·······in~~tegr~~al_co~~nstant<·std~~::siz~~e_t,·~~Tre~~e~~::d~~egree(~~)>{}))~~	34	template<typename·Node·,·typename·TreePath·>
		35	using Dune::TypeTree::ChildForTreePath·=·typename·impl::_ChildForTreePath<
		36	·······Node,·TreePath·>::type
		37	·····Template·alias·for·the·type·of·a·child·node·given·by·a·TreePath·or·a
		38	·······HybridTreePath·type.
		39
		40	template<typename·T·>
		41	using Dune::TypeTree::is_flat_index·=·typename·impl::_is_flat_index<·std::
		42	·······decay_t<·T·>·>::type
		43	·····Type·trait·that·determines·whether·T·is·a·flat·index·in·the·context·of
		44	·······child·extraction.
37		45
38	·Functions	46	·Functions
39	template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
40	enable_if_t<·Tree::isLeaf,·int·>·=·0>
41	~~cons~~texpr·aut~~o Dun~~e::Typ~~eTree::D~~eta~~il::~~le~~afTr~~e~~ePa~~thTuple·~~(Pr~~e~~fix~~·~~prefix)~~	47	template<typename·Node·,·typename...·Indices>
		48	ImplementationDefined Dune::TypeTree::child·(Node·&&node,·Indices...·indices)
		49	·····················Extracts·the·child·of·a·node·given·by·a·sequence·of
		50	·······················compile-time·and·run-time·indices.
42		51
		52	template<typename·Node·,·typename...·Indices>
		53	ImplementationDefined Dune::TypeTree::childStorage·(Node·&&node,·Indices...
		54	·······················indices)
43	template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
44	size_t...·indices,·std::enable_if_t<(Tree::isComposite·or(Tree::isPower·and
45	(pathType!=TreePathType::dynamic))),·int·>·=·0>
46	constexpr·auto Dune::TypeTree::Detail::leafTreePathTuple·(Prefix·prefix,·std::
47	················index_sequence<·indices...·>)
48		55
49	template<class·T·,·class·TreePath·,·class·V·,·std::enable_if_t<·std::decay_t<·T
50	>::isLeaf,·int·>·=·0>
51	··········void Dune::TypeTree::Detail::applyToTree·(T·&&tree,·TreePath
52	················treePath,·V·&&visitor)
53
54	template<class·T·,·class·TreePath·,·class·PreFunc·,·class·LeafFunc·,·class
55	PostFunc·>
56	··········void Dune::TypeTree::Detail::forEachNode·(T·&&tree,·TreePath
57	················treePath,·PreFunc·&&preFunc,·LeafFunc·&&leafFunc,·PostFunc
58	················&&postFunc)
59
60	template<class·Tree·,·TreePathType::Type·pathType·=·TreePathType::dynamic>
61	constexpr·auto Dune::TypeTree::leafTreePathTuple·()
62	··············Create·tuple·of·tree·paths·to·leafs.
63
64	template<typename·~~Tre~~e·,·typename·~~Vis~~it~~or·~~>	56	template<typename·Node·,·typename...·Indices>
		57	ImplementationDefined Dune::TypeTree::child·(Node·&&node,·HybridTreePath<
		58	·······················Indices...·>·treePath)
		59	·····················Extracts·the·child·of·a·node·given·by·a·HybridTreePath
		60	·······················object.
65	··········void Dune::TypeTree::applyToTree·(Tree·&&tree,·Visitor·&&visitor)
66	··············Apply·visitor·to·TypeTree.
67
68	template<class·Tree·,·class·PreFunc·,·class·LeafFunc·,·class·PostFunc·>
69	··········void Dune::TypeTree::forEachNode·(Tree·&&tree,·PreFunc·&&preFunc,
70	················LeafFunc·&&leafFunc,·PostFunc·&&postFunc)
71	··············Traverse·tree·and·visit·each·node.
72
73	template<class·Tree·,·class·InnerFunc·,·class·LeafFunc·>
74	··········void Dune::TypeTree::forEachNode·(Tree·&&tree,·InnerFunc
75	················&&innerFunc,·LeafFunc·&&leafFunc)
76	··············Traverse·tree·and·visit·each·node.
77
78	template<class·Tree·,·class·NodeFunc·>
79	··········void Dune::TypeTree::forEachNode·(Tree·&&tree,·NodeFunc·&&nodeFunc)
80	··············Traverse·tree·and·visit·each·node.
81
82	template<class·Tree·,·class·LeafFunc·>
83	··········void Dune::TypeTree::forEachLeafNode·(Tree·&&tree,·LeafFunc
84	················&&leafFunc)
85	··············Traverse·tree·and·visit·each·leaf·node.
86		61

87	===============================================================================	62	===============================================================================
88	·····Generated·by [doxygen]·1.9.8	63	·····Generated·by [doxygen]·1.9.8


Offset 7, 357 lines modified		Offset 7, 321 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	trav~~ersal~~.hh	12	childextraction.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=8·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_TRAV~~ERSAL~~_HH	17	·4#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_HH
18	·5#define·DUNE_TYPETREE_TRAV~~ERSAL~~_HH	18	·5#define·DUNE_TYPETREE_CHILDEXTRACTION_HH
19	·6	19	·6
		20	·7#include·<type_traits>
20	·7#include·<utility>	21	·8#include·<utility>
21	·8
22	·9~~#include·<dune/common/hybridutilities.hh>~~	22	·9
		23	·10#include·<dune/common/concept.hh>
		24	·11#include·<dune/common/documentation.hh>
23	·10#include·<dune/common~~/std~~/type_traits.hh>	25	·12#include·<dune/common/typetraits.hh>
24	·11
25	·12#include·<dune/ty~~petree~~/childext~~rac~~tion.hh>	26	·13#include·<dune/common/shared_ptr.hh>
		27	·14
26	·13#include·<dune/typetree/nodetags.hh>	28	·15#include·<dune/typetree/nodeinterface.hh>
27	·14#include·<dune/typetree/treepath.hh>	29	·16#include·<dune/typetree/treepath.hh>
28	·15#include·<dune/typetree/visitor.hh>
29	·16	30	·17
		31	·18
30	·17namespace·Dune·{	32	·19namespace·Dune·{
31	·18·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
32	·19	34	·21
		35	·26
33	·25#ifndef·DOXYGEN	36	·27#ifndef·DOXYGEN
34	·2~~7·struct·NoO~~p	37	·28
		38	·29·namespace·Impl·{
		39	·30
		40	·31·//·check·at·run·time·whether·index·is·a·valid·child·index
		41	·32·template·<class·Node,·class·Index>
		42	·33·std::true_type·checkChildIndex·(Node·const&·node,·Index·i)
		43	·34·{
		44	·35·assert(std::size_t(i)·<·node.degree()·&&·"Child·index·out·of·range");
		45	·36·return·{};
		46	·37·}
		47	·38
		48	·39·//·check·at·compile·time·whether·index·is·a·valid·index
		49	·40·template·<class·Node,·std::size_t·i>
		50	·41·std::bool_constant<(i·<·Node::degree())>·checkChildIndex·(Node·const&·node,
		51	index_constant<i>)
35	·28·{	52	·42·{
		53	·43·static_assert(i·<·Node::degree(),·"Child·index·out·of·range");
		54	·44·return·{};
		55	·45·}
		56	·46
		57	·47·//·finally·return·the·node·itself·if·no·further·indices·are·provided.·Break
		58	condition
		59	·48·//·for·the·recursion·over·the·node·childs.
36	·29·template<class...·T>
37	·30·constexpr·void·operator()(T&&...)·const·{·/·do·nothing·/·}
38	·31·};
39	·32#endif
40	·33
41	·34·namespace·Detail·{
42	·35
43	·36·//·SFINAE·template·check·that·Tree·has·a·degree()·function·and·a·child()
44	function·accepting·integer·indices
45	·37·template<class·Tree>
46	38·using·DynamicTraversalConcept·=·decltype((
47	·39·std::declval<Tree>().degree(),
48	·40·std::declval<Tree>().child(0u)
49	·41·));
50	·42
51	·43·//·SFINAE·template·check·that·Tree·has·static·(constexpr)·function·Tree::
52	degree()
53	·44·template<class·~~Tre~~e>	60	·49·template<class·Node>
		61	·50·decltype(auto)·childImpl·(Node&&·node)
54	45·using·StaticTraversalConcept·=·decltype((
55	·46·std::integral_constant<std::size_t,·Tree::degree()>{}
56	·47·));
57	·48
58	·49
59	·50·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,
60	·51·std::enable_if_t<Tree::isLeaf,·int>·=·0>
61	52·constexpr·auto·leafTreePathTuple(Prefix·prefix)
62	·53·{	62	·51·{
63	·54·return·std::~~make_tuple(prefix~~);	63	·52·return·std::forward<Node>(node);
64	·55·}	64	·53·}
65	·56
66	·57·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,
67	·58·std::enable_if_t<not·Tree::isLeaf,·int>·=·0>
68	·5~~9·constexpr·auto·leafTreePathTuple(Prefix·prefix)~~;	65	·54
		66	·55·template<class·NodePtr>
		67	·56·auto·childStorageImpl·(NodePtr&&·nodePtr)
		68	·57·{
		69	·58·return·std::forward<NodePtr>(nodePtr);
		70	·59·}
69	·60	71	·60
		72	·61·//·recursively·call·`node.child(...)`·with·the·given·indices
		73	·62·template<class·Node,·class·I0,·class...·I>
		74	·63·decltype(auto)·childImpl·(Node&&·node,·I0·i0,·[[maybe_unused]]·I...·i)
70	·61·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,·std::
71	size_t...·indices,
72	·62·std::enable_if_t<(Tree::isComposite·or·(Tree::isPower·and
73	(pathType!=TreePathType::dynamic))),·int>·=·0>
74	63·constexpr·auto·leafTreePathTuple(Prefix·prefix,·std::
75	index_sequence<indices...>)
76	·64·{	75	·64·{
		76	·65·auto·valid·=·checkChildIndex(node,i0);
		77	·66·if·constexpr·(valid)
		78	·67·return·childImpl(node.child(i0),i...);
		79	·68·else
		80	·69·return;
77	·65·return·std::tuple_cat(Detail::leafTreePathTuple<TypeTree::
78	Child<Tree,indices>,·pathType>(Dune::TypeTree::push_back(prefix,·Dune::
79	index_constant<indices>{}))...);
80	·66·}
81	·67
82	·68·template<class·Tree,·TreePathType::Type·pathType,·class·Prefix,·std::
83	size_t...·indices,
84	·69·std::enable_if_t<(Tree::isPower·and·(pathType==TreePathType::dynamic)),
85	int>·=·0>
86	·70·constexpr·auto·leafTreePathTuple(Prefix·prefix,·std::
87	index_sequence<indices...>)
88	·71·{
89	·72·return·std::tuple_cat(Detail::leafTreePathTuple<TypeTree::
90	Child<Tree,indices>,·pathType>(Dune::TypeTree::push_back(prefix,·indices))...);
Max diff block lines reached; 14600/20693 bytes (70.56%) of diff not shown.


Offset 7, 28 lines modified		Offset 7, 62 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces
		13	filters.hh·File·Reference
		14	#include·<tuple>
13	dynamicpowernode.hh·File·Reference
14	#include·<cassert>
15	#include·<vector>
16	#include·<memory>
17	#include·<type_traits>
18	#include·<dune/common/typetraits.hh>	15	#include·<dune/common/typetraits.hh>
19	#include·<dune/common/std/type_traits.hh>
20	#include·<dune/typetree/nodetags.hh>
21	#include·<dune/typetree/utility.hh>
22	#include·<dune/typetree/typetraits.hh>
23	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
24	·Classes	17	·Classes
25	class· Dune::TypeTree::DynamicPowerNode<_T_>
26	~~······Colle~~ct·mult~~iple~~·in~~sta~~nce~~s·of·t~~ype·T~~·within·a·du~~ne-ty~~petree.·M~~o~~re...~~	18	struct· Dune::TypeTree::FilterEntry<_new_k,_old_k_>
		19	·······A·filter·entry·describing·the·mapping·of·one·child·in·the·filtered
		20	·········node.·More...
		21
		22	struct· Dune::TypeTree::FilterResult<_FilterEntries_>
		23	·······The·result·of·a·filter.·More...
		24
		25	struct· Dune::TypeTree::FilterResult<_FilterEntries_>::apply<_Node_>
		26
		27	struct· Dune::TypeTree::SimpleFilterTag
		28	·······Tag·describing·a·simple·filter·that·can·only·decide·whether·or·not·to
		29	·········include·a·single·given·child.·More...
		30
		31	struct· Dune::TypeTree::AdvancedFilterTag
		32	·······Tag·describing·an·advanced·filter·that·has·full·control·over·the
		33	·········construction·of·the·list·of·FilterEntries.·More...
		34
		35	struct· Dune::TypeTree::AdvancedFilter
		36	·······Base·class·for·advanced·filters.·More...
		37
		38	struct· Dune::TypeTree::AdvancedFilter::apply<_Node,_Children_>
		39	·······Apply·this·filter·to·the·given·node·and·children.·More...
		40
		41	struct· Dune::TypeTree::SimpleFilter
		42	·······Default·simple·filter·that·accepts·any·node·and·leaves·its·child
		43	·········structure·unchanged.·More...
		44
		45	struct· Dune::TypeTree::SimpleFilter::validate<_Node_>
		46	·······Validates·the·combination·of·filter·and·node.·More...
		47
		48	struct· Dune::TypeTree::SimpleFilter::apply<_Child,_new_index,_old_index_>
		49	·······Applies·the·filter·to·the·given·child·node.·More...
		50
		51	struct· Dune::TypeTree::IndexFilter<_indices_>
		52	·······Filter·class·for·FilteredCompositeNode·that·selects·the·children·with
		53	·········the·given·indices.·More...
		54
		55	struct· Dune::TypeTree::filter<_Filter_>
		56	·······Adapter·class·that·takes·a·SimpleFilter,·validated·it·and·turns·it
		57	·········into·an·AdvancedFilter.·More...
		58
		59	struct· Dune::TypeTree::filter<_Filter_>::apply<_Node,_Children_>
		60	·······Apply·the·filter.·More...
27		61
28	·Namespaces	62	·Namespaces
29	namespace· Dune	63	namespace· Dune
30		64
31	namespace· Dune::TypeTree	65	namespace· Dune::TypeTree
32		66


Offset 7, 255 lines modified		Offset 7, 319 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	~~dyna~~micpower~~nod~~e.hh	12	filters.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=4·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_~~DYNA~~MICPOWER~~NOD~~E_HH	17	·4#ifndef·DUNE_TYPETREE_FILTERS_HH
18	·5#define·DUNE_TYPETREE_~~DYNA~~MICPOWER~~NOD~~E_HH	18	·5#define·DUNE_TYPETREE_FILTERS_HH
19	·6	19	·6
		20	·7#include·<tuple>
		21	·8
20	·7#include·<cassert>
21	·8#include·<vector>
22	·9#include·<memory>
23	·10#include·<type_traits>
24	·11
25	·12#include·<dune/common/typetraits.hh>	22	·9#include·<dune/common/typetraits.hh>
		23	·10
26	·13#include·<dune/common/std/type_traits.hh>
27	·14
28	·15#include·<dune/typetree/nodetags.hh>
29	·16#include·<dune/typetree/utility.hh>
30	·17#include·<dune/typetree/typetraits.hh>
31	·18
32	·19namespace·Dune·{	24	·11namespace·Dune·{
33	·20·namespace·TypeTree·{	25	·12·namespace·TypeTree·{
34	·21
35	·31·template<typename·T>
36	32·class·DynamicPowerNode
37	·33·{	26	·13
		27	·20·template<std::size_t·new_k,·std::size_t·old_k>
		28	21·struct·FilterEntry
		29	·22·{
		30	·23
		31	·24#ifndef·DOXYGEN
		32	·25
		33	·26·//·The·precise·contents·of·this·class·is·an·implementation·detail.
		34	·27
		35	·28·static·const·std::size_t·filtered_index·=·new_k;
		36	·29·static·const·std::size_t·original_index·=·old_k;
		37	·30
		38	·31#endif·//·DOXYGEN
		39	·32
		40	·33·};
38	·34	41	·34
39	·35·public:
40	·36
41	38·stat~~ic·co~~n~~st·bool·~~isLea~~f·=·fal~~se;	42	·36·template<typename...·FilterEntries>
		43	37·struct·FilterResult
		44	·38·{
42	·39	45	·39
43	41·static·const·bool·isPower·=·true;
44	·42
45	44·static·const·bool·isComposite·=·false;
46	·45
47	47·std::size_t·degree(~~)·co~~nst	46	40·static·const·std::size_t·size·=·sizeof...(FilterEntries);
		47	·41
		48	42·typedef·std::tuple<FilterEntries...>·IndexMap;
		49	·43
		50	·44·template<typename·Node>
		51	45·struct·apply
48	·48·{	52	·46·{
49	·49·return·_children.size~~();~~	53	47·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
		54	original_index>...>·Children;
		55	48·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
		56	original_index>::Type...>·ChildTypes;
		57	49·typedef·std::tuple<std::shared_ptr<typename·Node::template
		58	Child<FilterEntries::original_index>::Type>...>·NodeStorage;
50	·50·}	59	·50·};
51	·51	60	·51
52	53·typedef·DynamicPowerNodeTag·NodeTag;
53	·54
54	56·typedef·T·ChildType;
55	·57
56	~~59·typedef~~·~~std::shared_ptr<~~T>·~~ChildStorageTyp~~e;	61	·52·};
		62	·53
		63	55·struct·SimpleFilterTag·{};
		64	·56
		65	58·struct·AdvancedFilterTag·{};
		66	·59
57	·60	67	·60
58	62·~~typedef·std::~~s~~hared_p~~tr<c~~ons~~t~~·T>~~·~~Chi~~ldCon~~stStorageTyp~~e;	68	62·struct·AdvancedFilter
59	·63	69	·63·{
60	65·typedef·std::vector<ChildStorageType>·NodeStorage;
61	·66	70	·64
		71	66·typedef·AdvancedFilterTag·FilterTag;
62	·67	72	·67
63	·70
64	·72
65	7~~5·Ch~~ild~~Typ~~e~~&·chil~~d·~~(std::size_t·i)~~	73	·68#ifdef·DOXYGEN
		74	·69
		75	·71·template<typename·Node,·typename...·Children>
		76	72·struct·apply
66	·76·{	77	·73·{
67	·77·assert(i·<·degree()·&&·"child·index·out·of·range");
68	·7~~8·return·*_children[i]~~;	78	·75
		79	78·typedef·implementation-defined·type;
69	·79·}	80	·79·};
70	·80	81	·80
		82	·81#endif·//·DOXYGEN
71	·82	83	·82
72	~~85·const·ChildType&·child·(std::size_t~~·i)·~~con~~st	84	·83·};
		85	·84
73	·86·{	86	·86
		87	91·struct·SimpleFilter
74	·87·assert(i·<·degree()·&&·"child·index·out·of·range");
75	·88·return·*_children[i];
76	·89·}
77	·90
78	·92
79	95·ChildStorageType·childStorage·(std::size_t·i)
80	·96·{	88	·92·{
81	·97·assert(i·<·degree()·&&·"child·index·out·of·range");
82	·98·return·_children[i];
83	·99·}
84	·100
85	·102
86	~~108·ChildConstStorageType·childStorage·(std::size_t·i)~~·~~con~~st	89	·93
		90	95·typedef·SimpleFilterTag·FilterTag;
		91	·96
		92	·97
Max diff block lines reached; 10870/15770 bytes (68.93%) of diff not shown.


Offset 6, 207 lines modified		Offset 6, 85 lines modified
6	dune-typetree 2.9	6	dune-typetree 2.9

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	~~Classes·\|·~~Namespaces·\|·Typedef~~s·\|·Enumeration~~s·\|·Functions	12	Namespaces·\|·Typedefs·\|·Functions
13	tree~~path~~.hh·File·Reference	13	traversal.hh·File·Reference
		14	#include·<utility>
14	#include·<cstddef>
15	#include·<iostream>
16	#include·<dune/common/documentation.hh>
17	#include·<dune/common/typetraits.hh>
18	#include·<dune/common/indices.hh>
19	#include·<dune/common/hybridutilities.hh>	15	#include·<dune/common/hybridutilities.hh>
		16	#include·<dune/common/std/type_traits.hh>
		17	#include·<dune/typetree/childextraction.hh>
		18	#include·<dune/typetree/nodetags.hh>
20	#include·<dune/typetree/fixedcapa~~citys~~tack.hh>	19	#include·<dune/typetree/treepath.hh>
21	#include·<dune/typetree/utility.hh>	20	#include·<dune/typetree/visitor.hh>
22	Go_to_the_source_code_of_this_file.	21	Go_to_the_source_code_of_this_file.
23	·Classes
24	·class· Dune::TypeTree::HybridTreePath<_T_>
25	·······A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run
26	·········time·indices.·More...
27
28	struct· Dune::TypeTree::TreePathSize<_HybridTreePath<_index_constant<_i_>..._>
29	·········>
30
31	struct· Dune::TypeTree::TreePathPushBack<_HybridTreePath<_index_constant<_i
32	·········>..._>,_k_>
33
34	struct· Dune::TypeTree::TreePathPushFront<_HybridTreePath<_index_constant<_i
35	·········>..._>,_k_>
36
37	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_k_>_>_>
38
39	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_j_>,
40	·········index_constant<_k_>,_index_constant<_l_>..._>_>
41
42	struct· Dune::TypeTree::TreePathFront<_HybridTreePath<_index_constant<_k_>,
43	·········index_constant<_i_>..._>_>
44
45	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_k_>
46	·········>,_i..._>
47
48	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_j_>,
49	·········index_constant<_k_>,_index_constant<_l_>..._>,_i..._>
50
51	struct· Dune::TypeTree::TreePathPopFront<_HybridTreePath<_index_constant<_k_>,
52	·········index_constant<_i_>..._>_>
53
54	struct· Dune::TypeTree::TreePathConcat<_HybridTreePath<_index_constant<_i_>...
55	·········>,_HybridTreePath<_index_constant<_k_>..._>_>
56
57	·Namespaces	22	·Namespaces
58	namespace· Dune	23	namespace· Dune
59		24
60	namespace· Dune::TypeTree	25	namespace· Dune::TypeTree
61		26
62	namespace· Dune::TypeTree::TreePathT~~ype~~	27	namespace· Dune::TypeTree::Detail
63		28
64	·Typedefs	29	·Typedefs
65	template<std::size_t...·i>
66	using Dune::TypeTree::TreePath·=·HybridTreePath<·Dune::index_constant<·i·>...
67	··~~····~~·>	30	template<class·Tree·>
		31	using Dune::TypeTree::Detail::DynamicTraversalConcept·=·decltype((std::
		32	·······declval<·Tree·>().degree(),·std::declval<·Tree·>().child(0u)))
68		33
		34	template<class·Tree·>
		35	using Dune::TypeTree::Detail::StaticTraversalConcept·=·decltype((std::
		36	·······integral_constant<·std::size_t,·Tree::degree()>{}))
69	template<std::size_t...·i>
70	using Dune::TypeTree::StaticTreePath·=·HybridTreePath<·Dune::index_constant<·i
71	·······>...·>
72
73	·Enumerations
74	enum· Dune::TypeTree::TreePathType::Type·{·Dune::TypeTree::TreePathType::
75	·······fullyStatic·,·Dune::TypeTree::TreePathType::dynamic·}
76		37
77	·Functions	38	·Functions
78	template<std::size_t...·i>
79	·································void Dune::TypeTree::print_tree_path·(std::
80	·~~···~~···~~··················~~·~~·········~~·~~···o~~stream·&os)	39	template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
		40	enable_if_t<·Tree::isLeaf,·int·>·=·0>
		41	constexpr·auto Dune::TypeTree::Detail::leafTreePathTuple·(Prefix·prefix)
81		42
82	template<std::size_t·k,·std::size_t...·i>
83	·································void Dune::TypeTree::print_tree_path·(std::
84	·~~···~~···~~··················~~·~~·········~~·~~···o~~stream·&os)	43	template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
		44	size_t...·indices,·std::enable_if_t<(Tree::isComposite·or(Tree::isPower·and
		45	(pathType!=TreePathType::dynamic))),·int·>·=·0>
		46	constexpr·auto Dune::TypeTree::Detail::leafTreePathTuple·(Prefix·prefix,·std::
		47	················index_sequence<·indices...·>)
85		48
		49	template<class·T·,·class·TreePath·,·class·V·,·std::enable_if_t<·std::decay_t<·T
		50	>::isLeaf,·int·>·=·0>
		51	··········void Dune::TypeTree::Detail::applyToTree·(T·&&tree,·TreePath
		52	················treePath,·V·&&visitor)
86	template<typename...·T>
87	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::hybridTreePath·(const·T
88	·······································&...·t)
89	·····································Constructs·a·new·HybridTreePath·from·the
90	·······································given·indices.
91		53
92	template<typename...·T>
93	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::treePath·(const·T·&...
94	·······································t)
95	·····································Constructs·a·new·HybridTreePath·from·the
96	···~~····~~·~~········~~···~~·····~~·~~·······~~···~~····giv~~e~~n·i~~ndices.	54	template<class·T·,·class·TreePath·,·class·PreFunc·,·class·LeafFunc·,·class
		55	PostFunc·>
		56	··········void Dune::TypeTree::Detail::forEachNode·(T·&&tree,·TreePath
		57	················treePath,·PreFunc·&&preFunc,·LeafFunc·&&leafFunc,·PostFunc
		58	················&&postFunc)
97		59
		60	template<class·Tree·,·TreePathType::Type·pathType·=·TreePathType::dynamic>
		61	constexpr·auto Dune::TypeTree::leafTreePathTuple·()
		62	··············Create·tuple·of·tree·paths·to·leafs.
98	template<typename...·T>
99	················constexpr·std::size_t Dune::TypeTree::treePathSize·(const
100	·······································HybridTreePath<·T...·>·&)
101	·····································Returns·the·size·(number·of·components)
102	·······································of·the·given·HybridTreePath.
103		63
		64	template<typename·Tree·,·typename·Visitor·>
		65	··········void Dune::TypeTree::applyToTree·(Tree·&&tree,·Visitor·&&visitor)
Max diff block lines reached; 118/12296 bytes (0.96%) of diff not shown.


Offset 7, 25 lines modified		Offset 7, 50 lines modified

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces
13	exceptions.hh·File·Reference
14	TypeTr~~ee-specific·~~e~~xcept~~i~~ons.·Mo~~re~~...~~	13	proxynode.hh·File·Reference
		14	#include·<type_traits>
		15	#include·<dune/typetree/nodeinterface.hh>
		16	#include·<dune/typetree/nodetags.hh>
		17	#include·<dune/common/shared_ptr.hh>
15	#include·<dune/common/~~except~~ions.hh>	18	#include·<dune/common/indices.hh>
		19	#include·<dune/common/std/type_traits.hh>
16	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
17	·Classes	21	·Classes
18	class· Dune::TypeTree::Exception
19	~~······Base~~·class·f~~or·all·~~TypeTree~~·ex~~c~~epti~~ons~~.·M~~ore~~...~~	22	·class· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>
		23	·······Mixin·class·providing·methods·for·child·access·with·compile-time
		24	·········parameter.·More...
		25
		26	struct· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>::Child<_k_>
		27	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
		28
		29	·class· Dune::TypeTree::DynamicChildAccessors<_ProxiedNode_>
		30	·······Mixin·class·providing·methods·for·child·access·with·run-time
		31	·········parameter.·More...
		32
		33	struct· Dune::TypeTree::ProxyNodeBase<_Node,_LeafNodeTag_>
		34	·······ProxyNode·base·class·for·LeafNode.·More...
		35
		36	struct· Dune::TypeTree::ProxyNodeBase<_Node,_CompositeNodeTag_>
		37	·······ProxyNode·base·class·for·CompositeNode.·More...
		38
		39	struct· Dune::TypeTree::ProxyNodeBase<_Node,_PowerNodeTag_>
		40	·······ProxyNode·base·class·for·PowerNode.·More...
		41
		42	struct· Dune::TypeTree::ProxyNodeBase<_Node,_DynamicPowerNodeTag_>
		43	·······ProxyNode·base·class·for·DynamicPowerNode.·More...
		44
		45	·class· Dune::TypeTree::ProxyNode<_Node_>
		46	·······Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.·More...
20		47
21	·Namespaces	48	·Namespaces
22	namespace· Dune	49	namespace· Dune
23		50
24	namespace· Dune::TypeTree	51	namespace· Dune::TypeTree
25		52
26	***·Detailed·Description·***
27	TypeTree-specific·exceptions.

28	===============================================================================	53	===============================================================================
29	·····Generated·by [doxygen]·1.9.8	54	·····Generated·by [doxygen]·1.9.8