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

⊟

3.38 MB

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

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

⊟

309 B

Files ¶

⊟

3.38 MB

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

⊟

452 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.38 MB

data.tar.xz ¶

⊟

3.38 MB

data.tar ¶

⊟

19.9 KB

file list ¶

⊟

22.2 KB

⊟

3.86 KB

⊟

136 KB

⊟

22.6 KB

⊟

21.1 KB

⊟

4.02 KB

⊟

92.4 KB

⊟

15.9 KB

⊟

19.2 KB

⊟

3.79 KB

⊟

113 KB

⊟

19.9 KB

⊟

7.01 KB

⊟

1.33 KB

⊟

27.8 KB

⊟

4.86 KB

⊟

7.86 KB

⊟

1.49 KB

⊟

153 KB

⊟

29.7 KB

⊟

10.1 KB

⊟

1.73 KB

⊟

111 KB

⊟

17.8 KB

⊟

6.64 KB

⊟

1.06 KB

⊟

131 KB

⊟

22.5 KB

⊟

12.5 KB

⊟

2.35 KB

⊟

65.6 KB

⊟

12.3 KB

⊟

30.3 KB

⊟

5.72 KB

⊟

174 KB

⊟

31.4 KB

⊟

22.7 KB

⊟

4.65 KB

⊟

131 KB

⊟

23.9 KB

⊟

6.98 KB

⊟

1.27 KB

⊟

132 KB

⊟

23.0 KB

⊟

40.4 KB

⊟

9.39 KB

⊟

114 KB

⊟

19.1 KB

⊟

24.1 KB

⊟

4.33 KB

⊟

121 KB

⊟

20.9 KB

⊟

7.72 KB

⊟

1.57 KB

⊟

65.9 KB

⊟

11.2 KB

⊟

40.4 KB

⊟

9.39 KB

⊟

114 KB

⊟

19.1 KB

⊟

16.0 KB

⊟

2.92 KB

⊟

71.3 KB

⊟

12.3 KB

⊟

10.6 KB

⊟

2.22 KB

⊟

72.8 KB

⊟

14.1 KB

⊟

7.27 KB

⊟

1.34 KB

⊟

62.7 KB

⊟

11.2 KB

⊟

12.1 KB

⊟

2.66 KB

⊟

170 KB

⊟

34.6 KB

⊟

19.7 KB

⊟

3.59 KB

⊟

141 KB

⊟

25.5 KB

⊟

8.04 KB

⊟

1.33 KB

⊟

42.8 KB

⊟

7.69 KB

⊟

6.4 KB

⊟

1.2 KB

⊟

97.3 KB

⊟

17.0 KB

⊟

12.1 KB

⊟

2.22 KB

⊟

80.7 KB

⊟

13.0 KB

⊟

6.94 KB

⊟

1.3 KB

⊟

49.7 KB

⊟

8.24 KB

⊟

21.0 KB

⊟

3.84 KB

⊟

78.7 KB

⊟

14.1 KB

⊟

8.43 KB

⊟

1.27 KB

⊟

21.5 KB

⊟

3.39 KB

⊟

12.8 KB

⊟

2.41 KB

⊟

52.2 KB

⊟

9.0 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.08 KB

⊟

2.54 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.5 KB

⊟

33.9 KB

⊟

33.8 KB

⊟

33.8 KB

⊟

16.8 KB

⊟

2.04 KB

⊟

2.05 KB


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

1	·800eb722c270d1f75624a663298f0ff5·38684·libdevel·optional·libdune-typetree-dev_2.9.0-2_i386.deb	1	·800eb722c270d1f75624a663298f0ff5·38684·libdevel·optional·libdune-typetree-dev_2.9.0-2_i386.deb
2	·b93ecfd2~~399b4af7def6~~f~~a80c6~~7~~4ff57~~·9~~89872~~·doc·optional·libdune-typetree-doc_2.9.0-2_all.deb	2	·590ffa2f4701b131668ef27c997a921a·990100·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·····9700·2023-01-12·22:23:12.000000·control.tar.xz	2	-rw-r--r--···0········0········0·····9740·2023-01-12·22:23:12.000000·control.tar.xz
3	-rw-r--r--···0········0········0···9~~79980~~·2023-01-12·22:23:12.000000·data.tar.xz	3	-rw-r--r--···0········0········0···980168·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)····15417·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)····53082·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)·····6233·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)·····8874·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)····10695·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)····46415·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)·····5125·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)····14382·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)·····5600·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)····46149·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020_source.html
12	-rw-r--r--···0·root·········(0)·root·········(0)·····9727·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008.html	22	-rw-r--r--···0·root·········(0)·root·········(0)·····9727·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023.html
13	-rw-r--r--···0·root·········(0)·root·········(0)····69137·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html	23	-rw-r--r--···0·root·········(0)·root·········(0)····69137·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)·····6194·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)····69306·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)·····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)····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)····15770·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)····56207·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032_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	30	-rw-r--r--···0·root·········(0)·root·········(0)····17252·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035.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	31	-rw-r--r--···0·root·········(0)·root·········(0)····74924·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)·····6049·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)····49440·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)·····3694·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)·····5507·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html
16	-rw-r--r--···0·root·········(0)·root·········(0)····11110·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014.html	36	-rw-r--r--···0·root·········(0)·root·········(0)····11110·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044.html
17	-rw-r--r--···0·root·········(0)·root·········(0)····55685·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014_source.html	37	-rw-r--r--···0·root·········(0)·root·········(0)····55685·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044_source.html
18	-rw-r--r--···0·root·········(0)·root·········(0)·····6910·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017.html	38	-rw-r--r--···0·root·········(0)·root·········(0)·····6910·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047.html
19	-rw-r--r--···0·root·········(0)·root·········(0)····15552·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017_source.html	39	-rw-r--r--···0·root·········(0)·root·········(0)····15552·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047_source.html
20	-rw-r--r--···0·root·········(0)·root·········(0)·····6859·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)····87085·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)·····5149·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)····32272·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)·····5909·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)····49270·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)·····8711·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)····19928·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)····15004·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)····98929·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)·····7398·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)····41083·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)·····6194·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)····69306·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)····32652·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041.html	40	-rw-r--r--···0·root·········(0)·root·········(0)····32652·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050.html
35	-rw-r--r--···0·root·········(0)·root·········(0)····96059·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html	41	-rw-r--r--···0·root·········(0)·root·········(0)····96059·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050_source.html
36	-rw-r--r--···0·root·········(0)·root·········(0)····15417·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)····53082·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)·····3694·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)·····5507·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	42	-rw-r--r--···0·root·········(0)·root·········(0)·····8711·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	43	-rw-r--r--···0·root·········(0)·root·········(0)····19928·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_source.html
44	-rw-r--r--···0·root·········(0)·root·········(0)·····6233·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html
45	-rw-r--r--···0·root·········(0)·root·········(0)·····8874·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html
46	-rw-r--r--···0·root·········(0)·root·········(0)·····4849·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html
47	-rw-r--r--···0·root·········(0)·root·········(0)·····8864·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)·····8736·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062.html	44	-rw-r--r--···0·root·········(0)·root·········(0)·····8736·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html
49	-rw-r--r--···0·root·········(0)·root·········(0)····57016·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00062_source.html	45	-rw-r--r--···0·root·········(0)·root·········(0)····57016·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056_source.html
		46	-rw-r--r--···0·root·········(0)·root·········(0)·····5909·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059.html
		47	-rw-r--r--···0·root·········(0)·root·········(0)····49270·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)·····6859·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)····87085·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)····15004·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)····98929·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html
50	-rw-r--r--···0·root·········(0)·root·········(0)·····7208·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065.html	52	-rw-r--r--···0·root·········(0)·root·········(0)·····7208·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html
51	-rw-r--r--···0·root·········(0)·root·········(0)····27369·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html	53	-rw-r--r--···0·root·········(0)·root·········(0)····27369·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html
52	-rw-r--r--···0·root·········(0)·root·········(0)·····5125·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html
53	-rw-r--r--···0·root·········(0)·root·········(0)····14382·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068_source.html
54	-rw-r--r--···0·root·········(0)·root·········(0)·····6049·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)····49440·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)····11230·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)····43051·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)·····5603·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077.html	54	-rw-r--r--···0·root·········(0)·root·········(0)·····5603·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071.html
59	-rw-r--r--···0·root·········(0)·root·········(0)····39037·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html	55	-rw-r--r--···0·root·········(0)·root·········(0)····39037·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071_source.html
60	-rw-r--r--···0·root·········(0)·root·········(0)····15~~770~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html	56	-rw-r--r--···0·root·········(0)·root·········(0)·····5149·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00074.html
61	-rw-r--r--···0·root·········(0)·root·········(0)····56207·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html	57	-rw-r--r--···0·root·········(0)·root·········(0)····32272·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)·····4849·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)·····8864·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html
62	-rw-r--r--···0·root·········(0)·root·········(0)·····7478·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html	60	-rw-r--r--···0·root·········(0)·root·········(0)·····7478·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html
63	-rw-r--r--···0·root·········(0)·root·········(0)····17536·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083_source.html	61	-rw-r--r--···0·root·········(0)·root·········(0)····17536·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html
64	-rw-r--r--···0·root·········(0)·root·········(0)·····5211·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086.html	62	-rw-r--r--···0·root·········(0)·root·········(0)·····5211·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html
65	-rw-r--r--···0·root·········(0)·root·········(0)·····6649·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086_source.html	63	-rw-r--r--···0·root·········(0)·root·········(0)·····6649·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)····11230·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)····43051·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


Offset 6, 51 lines modified		Offset 6, 89 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	~~proxynode~~.hh·File·Reference	13	typetraits.hh·File·Reference
14	#include·<type_traits>	14	#include·<type_traits>
		15	#include·<dune/common/typetraits.hh>
		16	#include·<dune/typetree/treepath.hh>
15	#include·<dune/typetree/nodeinterface.hh>	17	#include·<dune/typetree/nodeinterface.hh>
16	#include·<dune/typetree/nodetags.hh>
17	#include·<dune/common/shared_ptr.hh>
18	#include·<dune/common/indices.hh>
19	#include·<dune/common/std/type_traits.hh>
20	Go_to_the_source_code_of_this_file.	18	Go_to_the_source_code_of_this_file.
21	·Classes	19	·Classes
		20	struct· Dune::first_type<_T0,_T..._>
22	·class· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>
23	·······Mixin·class·providing·methods·for·child·access·with·compile-time
24	·········parameter.·More...
25		21
		22	struct· Dune::TypeTree::has_node_tag<_T_>
26	struct· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>::Child<_k_>
27	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
28		23
		24	struct· Dune::TypeTree::has_node_tag<_T_>::yes
29	·class· Dune::TypeTree::DynamicChildAccessors<_ProxiedNode_>
30	·······Mixin·class·providing·methods·for·child·access·with·run-time
31	·········parameter.·More...
32		25
		26	struct· Dune::TypeTree::has_node_tag<_T_>::no
33	struct· Dune::TypeTree::ProxyNodeBase<_Node,_LeafNodeTag_>
34	·······ProxyNode·base·class·for·LeafNode.·More...
35		27
		28	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>
36	struct· Dune::TypeTree::ProxyNodeBase<_Node,_CompositeNodeTag_>
37	·······ProxyNode·base·class·for·CompositeNode.·More...
38		29
		30	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::maybe<_N_>
39	struct· Dune::TypeTree::ProxyNodeBase<_Node,_PowerNodeTag_>
40	·······ProxyNode·base·class·for·PowerNode.·More...
41		31
		32	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::yes
42	struct· Dune::TypeTree::ProxyNodeBase<_Node,_DynamicPowerNodeTag_>
43	·······ProxyNode·base·class·for·DynamicPowerNode.·More...
44		33
45	·class· Dune::TypeTree::ProxyNode<_Node_>
46	~~·····~~·~~·Bas~~e·c~~lass·fo~~r~~·nod~~e~~s·acting·~~as~~·a·~~pro~~xy·for·~~a~~n·existing·node.·M~~o~~re...~~	34	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::no
		35
		36	struct· Dune::TypeTree::has_implementation_tag<_T_>
		37
		38	struct· Dune::TypeTree::has_implementation_tag<_T_>::yes
		39
		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...
47		67
48	·Namespaces	68	·Namespaces
49	namespace· Dune	69	namespace· Dune
50		70
51	namespace· Dune::TypeTree	71	namespace· Dune::TypeTree
52		72
		73	namespace· Dune::TypeTree::impl
		74
		75	·Functions
		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	constexpr·auto Dune::TypeTree::impl::isTreePath·(void·*)·->·std::false_type
		82
		83	template<class...·I>
		84	constexpr·auto Dune::TypeTree::impl::isTreePath·(const·HybridTreePath<·I...·>
		85	················*)·->·std::true_type
		86
		87	template<class·T·>
		88	constexpr·auto Dune::TypeTree::isTreePath·(const·T·&)·->·IsTreePath<·T·>
		89	··············Check·if·given·object·represents·a·tree·path.
		90

53	===============================================================================	91	===============================================================================
54	·····Generated·by [doxygen]·1.9.8	92	·····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:·~~proxynode~~.hh·File·Reference</title>	8	<title>dune-typetree:·typetraits.hh·File·Reference</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>


Offset 7, 462 lines modified		Offset 7, 346 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	~~proxynode~~.hh	12	typetraits.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_~~PROXYNODE~~_HH	17	·4#ifndef·DUNE_TYPETREE_TYPETRAITS_HH
18	·5#define·DUNE_TYPETREE_~~PROXYNODE~~_HH	18	·5#define·DUNE_TYPETREE_TYPETRAITS_HH
19	·6	19	·6
20	·7#include·<type_traits>	20	·7#include·<type_traits>
		21	·8#include·<dune/common/typetraits.hh>
		22	·9
		23	·10#include·<dune/typetree/treepath.hh>
21	·8#include·<dune/typetree/nodeinterface.hh>	24	·11#include·<dune/typetree/nodeinterface.hh>
		25	·12
22	·9#include·<dune/typetree/nodetags.hh>
23	·10#include·<dune/common/shared_ptr.hh>
24	·11#include·<dune/common/indices.hh>
25	·12#include·<dune/common/std/type_traits.hh>
26	·13
27	·14namespace·Dune·{	26	·13namespace·Dune·{
		27	·14
		28	·15·//·Provide·some·more·C++11·TMP·helpers.
		29	·16·//·These·should·be·upstreamed·to·dune-common·ASAP.
		30	·17
		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
28	·15·namespace·TypeTree·{	40	·27·namespace·TypeTree·{
29	·16	41	·28
30	·22·template<typename·~~Nod~~e>	42	·29·template<typename·T>
		43	30·struct·has_node_tag
31	·23·class·ProxyNode;
32	·24
33	·26·template<typename·ProxiedNode>
34	27·class·StaticChildAccessors
35	·28·{
36	·29
37	·30·static·const·bool·proxiedNodeIsConst·=·std::is_const<typename·std::
38	remove_reference<ProxiedNode>::type>::value;
39	·31
40	·32·template<std::size_t·k>
41	·33·struct·lazy_enabled
42	·34·{	44	·31·{
43	·35·static·const·bool·value·=·!proxiedNodeIsConst;
44	·36·};
45	·37
46	·38·t~~ypedef~~·~~Prox~~yN~~ode<Proxie~~d~~Node>·Node~~;	45	32·struct·yes·{·char·dummy[1];·};
		46	33·struct·no·{·char·dummy[2];·};
		47	·34
		48	·35·template<typename·X>
		49	36·static·yes·test(NodeTag<X>·*);
		50	·37·template<typename·X>
		51	38·static·no·test(...);
47	·39	52	·39
48	·40·template<bool·enabled·=·!proxiedNodeIsConst>
49	·41·typename·std::enable_if<enabled,Node&>::type
50	·42·node·()	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
51	·43·{	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];·};
52	·44·return·static_cast<Node&>(*this);
53	·45·}
54	·46
55	·47·const·Node&·node·()·const
56	·48·{
57	·49·return·static_cast<const·Node&>(*this);
58	·50·}
59	·51	63	·51
60	·52·public:
61	·53
62	·55·template<std::size_t·k>
63	56·struct·Child
64	·57·:~~·pub~~l~~ic·ProxiedN~~ode::t~~empl~~ate·~~Child<~~k>	64	·52·template<typename·X>
		65	·53·static·maybe<std::is_base_of<V,_NodeTag<X>>::value>
		66	54·test(NodeTag<X>·*·a);
		67	·55·template<typename·X>
		68	56·static·no·test(...);
		69	·57
		70	59·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
		71	·60·};
		72	·61
		73	·62·template<typename·T>
		74	63·struct·has_implementation_tag
		75	·64·{
		76	65·struct·yes·{·char·dummy[1];·};
		77	66·struct·no·{·char·dummy[2];·};
		78	·67
		79	·68·template<typename·X>
		80	69·static·yes·test(ImplementationTag<X>·*);
		81	·70·template<typename·X>
		82	71·static·no·test(...);
		83	·72
		84	74·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
65	·58·{};	85	·75·};
		86	·76
		87	·77·template<typename·T,·typename·V>
		88	78·struct·has_implementation_tag_value
66	·59
67	·62
68	·64
69	·67·template<std::size_t·k,
70	·68·typename·std::enable_if<lazy_enabled<k>::value,·int>::type·=·0>
71	69·auto&·child·(index_constant<k>·=·{})
72	·70·{	89	·79·{
		90	·80·template<int·N>
		91	81·struct·maybe·{·char·dummy[N+1];·};
		92	82·struct·yes·{·char·dummy[2];·};
		93	83·struct·no·{·char·dummy[1];·};
Max diff block lines reached; 18931/23157 bytes (81.75%) of diff not shown.

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces
+nodetags.hh·File·Reference
+Classes·|·Namespaces·|·Functions·|·Variables
+visitor.hh·File·Reference
+#include·<dune/typetree/treepath.hh>
+#include·<dune/typetree/utility.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+struct· Dune::TypeTree::DefaultVisitor
+struct· Dune::TypeTree::LeafNodeTag
+ ·······Tag·designating·a·leaf·node.·More...
+struct· Dune::TypeTree::PowerNodeTag
+ ·······Tag·designating·a·power·node.·More...
+struct· Dune::TypeTree::DefaultPairVisitor
+ ·······Visitor·interface·and·base·class·for·visitors·of·pairs·of·TypeTrees.
+·········More...
+struct· Dune::TypeTree::DynamicPowerNodeTag
+ ·······Tag·designating·a·power·node·with·runtime·degree.·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::CompositeNodeTag
+ ·······Tag·designating·a·composite·node.·More...
+ ·······Mixin·base·class·for·visitors·that·want·to·visit·the·complete·tree.
+·········More...
+struct· Dune::TypeTree::VisitTree::VisitChild<_Node1,_Child1,_Node2,_Child2,
+·········TreePath_>
+ ·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
+·········More...
+struct· Dune::TypeTree::StaticTraversal
+ ·······Mixin·base·class·for·visitors·that·require·a·static·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::DynamicTraversal
+ ·······Mixin·base·class·for·visitors·that·only·need·a·dynamic·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::TreeVisitor
+ ·······Convenience·base·class·for·visiting·the·entire·tree.·More...
+struct· Dune::TypeTree::DirectChildrenVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node.
+·········More...
+struct· Dune::TypeTree::TreePairVisitor
+ ·······Convenience·base·class·for·visiting·an·entire·tree·pair.·More...
+struct· Dune::TypeTree::DirectChildrenPairVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node
+·········pair.·More...
+struct· Dune::TypeTree::Experimental::Info::LeafCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::NodeCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::DepthVisitor
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+namespace· Dune::TypeTree::Experimental
+namespace· Dune::TypeTree::Experimental::Info
+·Functions
+template<typename·Tree·>
+··········auto Dune::TypeTree::Experimental::Info::depth·(const·Tree·&tree)
+ ··············The·depth·of·the·TypeTree.
+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
+nodetags.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_NODETAGS_HH
+·5#define·DUNE_TYPETREE_NODETAGS_HH
+·6
+·7#include·<dune/typetree/treepath.hh>
+·7namespace·Dune·{
+·8·namespace·TypeTree·{
+·9
+·struct·LeafNodeTag·{};
+·10namespace·Dune·{
+·11·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
+·165
+·173·template<typename·T1,·typename·T2,·typename·TreePath>
+·void·pre(T1&&,·T2&&,·TreePath)·const·{}
+·17
+·struct·PowerNodeTag·{};
+·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
+·struct·DynamicPowerNodeTag·{};
+·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·{}
+·23
+·struct·CompositeNodeTag·{};
+·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
+·356·{


Offset 6, 64 lines modified		Offset 6, 60 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·\|·Typedefs·\|·Functions	12	Namespaces·\|·Typedefs·\|·Functions
13	~~treecon~~ta~~iner~~.hh·File·Reference	13	childextraction.hh·File·Reference
14	#include·<type_traits>	14	#include·<type_traits>
15	#include·<utility>	15	#include·<utility>
16	#include·<functional>
17	#include·<array>
18	#include·<dune/common/i~~ndi~~ces.hh>	16	#include·<dune/common/concept.hh>
19	#include·<dune/common/~~hybridu~~tilities.hh>	17	#include·<dune/common/documentation.hh>
20	#include·<dune/common/rangeutilities.hh>
21	#include·<dune/common/tuple~~vector~~.hh>	18	#include·<dune/common/typetraits.hh>
		19	#include·<dune/common/shared_ptr.hh>
		20	#include·<dune/typetree/nodeinterface.hh>
22	#include·<dune/typetree/treepath.hh>	21	#include·<dune/typetree/treepath.hh>
23	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
24	·Classes
25	·class· Dune::TypeTree::Detail::ContainerFactory<_LeafToValue_>
26
27	·class· Dune::TypeTree::Detail::TreeContainerVectorBackend<_Container_>
28
29	struct· Dune::TypeTree::Detail::LeafToDefaultConstructibleValue<_LeafToValue_>
30
31	·Namespaces	23	·Namespaces
32	namespace· Dune	24	namespace· Dune
33		25
34	namespace· Dune::TypeTree	26	namespace· Dune::TypeTree
35		27
36	namespace· Dune::TypeTree::Detail
37
38	·Typedefs	28	·Typedefs
		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.
39	template<class·Value·,·class·Tree·>
40	using Dune::TypeTree::UniformTreeContainer·=·std::decay_t<·decltype
41	·······(makeTreeContainer<·Value·>(std::declval<·const·Tree·&·>()))>
42	·····Alias·to·container·type·generated·by·makeTreeContainer·for·given·tree
43	·······type·and·uniform·value·type.
44		33
45	template<template<·class·Node·>·class·LeafToValue,·class·Tree·>
46	using Dune::TypeTree::TreeContainer·=·std::decay_t<·decltype(makeTreeContainer
47	·······(std::declval<·const·Tree·&·>(),·std::declval<·Detail::
48	·······LeafToDefaultConstructibleValue<·LeafToValue·>·>()))>
49	·····Alias·to·container·type·generated·by·makeTreeContainer·for·give·tree
50	~~·······~~type·and·when·u~~sing~~·~~LeafToV~~alue~~·to~~·create·val~~ues.~~	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.
51		45
52	·Functions	46	·Functions
53	template<class·Container·>
54	auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
55	······~~&&co~~ntainer)	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.
56		51
		52	template<typename·Node·,·typename...·Indices>
		53	ImplementationDefined Dune::TypeTree::childStorage·(Node·&&node,·Indices...
		54	·······················indices)
57	template<class·Tree·,·class·LeafToValue·>
58	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree,·LeafToValue
59	······&&leafToValue)
60	····Create·container·havin·the·same·structure·as·the·given·tree.
61		55
62	template<class·Value·,·class·Tree·>
63	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
64	··~~··Cre~~ate~~·co~~ntaine~~r·havi~~n·the·~~sam~~e·~~str~~ucture·a~~s·t~~he~~·give~~n~~·tr~~ee.	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		61

66	===============================================================================	62	===============================================================================
67	·····Generated·by [doxygen]·1.9.8	63	·····Generated·by [doxygen]·1.9.8


Offset 7, 365 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	~~treecon~~ta~~iner~~.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_~~TREECON~~TA~~INER~~_HH	17	·4#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_HH
18	·5#define·DUNE_TYPETREE_~~TREECON~~TA~~INER~~_HH	18	·5#define·DUNE_TYPETREE_CHILDEXTRACTION_HH
19	·6	19	·6
20	·7#include·<type_traits>	20	·7#include·<type_traits>
21	·8#include·<utility>	21	·8#include·<utility>
		22	·9
22	·9#include·<functional>
23	·10#include·<array>
24	·11
25	·12#include·<dune/common/i~~ndi~~ces.hh>	23	·10#include·<dune/common/concept.hh>
		24	·11#include·<dune/common/documentation.hh>
26	·13#include·<dune/common/hybridutilities.hh>
27	·14#include·<dune/common/rangeutilities.hh>
28	·15#include·<dune/common/tuple~~vector~~.hh>	25	·12#include·<dune/common/typetraits.hh>
29	·16	26	·13#include·<dune/common/shared_ptr.hh>
		27	·14
		28	·15#include·<dune/typetree/nodeinterface.hh>
30	·17#include·<dune/typetree/treepath.hh>	29	·16#include·<dune/typetree/treepath.hh>
		30	·17
31	·18	31	·18
32	·19namespace·Dune·{	32	·19namespace·Dune·{
33	·20·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
34	·21	34	·21
		35	·26
		36	·27#ifndef·DOXYGEN
		37	·28
35	·22·namespace·De~~tai~~l·{	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)
36	·23
37	·24·/*
38	·25·*·\brief·A·factory·class·creating·a·hybrid·container·compatible·with·a·type
39	tree
40	·26·*
41	·27·*·This·class·allows·to·create·a·nested·hybrid·container·having·the·same
42	structure
43	·28·*·as·a·given·type·tree.·Power·nodes·are·represented·as·std::array's·while
44	composite
45	·29·*·nodes·are·represented·as·Dune::TupleVector's.·The·stored·values·for·the
46	leaf·nodes
47	·30·*·are·creating·using·a·given·predicate.·Once·created,·the·factory·provides
48	an
49	·31·*·operator()·creating·the·container·for·the·tree·given·as·argument.
50	·32·*
51	·33·*·\tparam·LeafToValue·Type·of·a·predicate·that·determines·the·stored·values
52	at·the·leafs
53	·34·*/
54	·35·template<class·LeafToValue>
55	36·class·ContainerFactory
56	·37·{	43	·34·{
57	·38·template<class·N>
58	·39·using·DynamicDegreeConcept·=·decltype((std::size_t(std::declval<N>().degree
59	()),·true));
60	·40
61	·41·template<class·N>
62	·42·using·StaticDegreeConcept·=·decltype((std::integral_constant<std::size_t,
63	N::degree()>{},·true));
64	·43
65	·44·template<class·N>
66	·45·using·DynamicChildAccessConcept·=·decltype((std::declval<N>().child(0u),
67	true));	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>)
		52	·42·{
		53	·43·static_assert(i·<·Node::degree(),·"Child·index·out·of·range");
		54	·44·return·{};
		55	·45·}
68	·46	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.
69	·47·public:
70	·48
71	56·ContainerFactory(LeafToValue·leafToValue)·:
72	·57·leafToValue_(leafToValue)
73	·58·{}
74	·59
75	·60·template<class·Node>	60	·49·template<class·Node>
		61	·50·decltype(auto)·childImpl·(Node&&·node)
76	61·auto·operator()(const·Node&·node)
77	·62·{
78	·63·return·(*this)(node,·Dune::PriorityTag<5>{});
79	·64·}
80	·65
81	·66·private:
82	·67
83	·68·template<class·Node,
84	·69·std::enable_if_t<Node::isLeaf,·bool>·=·true>
85	·70·auto·operator()(const·Node&·node,·Dune::PriorityTag<4>)
86	·71·{	62	·51·{
87	·72·return·~~lea~~f~~ToV~~alue_(node);	63	·52·return·std::forward<Node>(node);
88	·73·}	64	·53·}
89	·74	65	·54
90	·75·template<class·Node,	66	·55·template<class·NodePtr>
		67	·56·auto·childStorageImpl·(NodePtr&&·nodePtr)
91	·76·StaticDegreeConcept<Node>·=·true,
92	·77·DynamicChildAccessConcept<Node>·=·true>
93	·78·auto·operator()(const·Node&·node,·Dune::PriorityTag<3>)
94	·79·{	68	·57·{
		69	·58·return·std::forward<NodePtr>(nodePtr);
95	·80·return·Dune::unpackIntegerSequence([&](auto...·indices)·{
96	·81·return·std::array{(*this)(node.child(indices))...};
97	·82·},·std::make_index_sequence<std::size_t(Node::degree())>());
98	·83·}
99	·84
100	·85·template<class·Node,
101	·86·DynamicDegreeConcept<Node>·=·true,
102	·87·DynamicChildAccessConcept<Node>·=·true>
Max diff block lines reached; 12699/20353 bytes (62.39%) of diff not shown.


Offset 7, 36 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	~~powercompositeno~~detransf~~ormatio~~n~~templ~~ates.hh·File·Reference	13	leafnode.hh·File·Reference
		14	#include·<dune/typetree/nodetags.hh>
14	#include·<cstddef>	15	#include·<cstddef>
15	#include·<~~dune/~~typ~~etree/nod~~einterface~~.hh~~>	16	#include·<type_traits>
16	Go_to_the_source_code_of_this_file.	17	Go_to_the_source_code_of_this_file.
17	·Classes	18	·Classes
		19	class· Dune::TypeTree::LeafNode
		20	······Base·class·for·leaf·nodes·in·a·dune-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		21
36	·Namespaces	22	·Namespaces
37	namespace· Dune	23	namespace· Dune
38		24
39	namespace· Dune::TypeTree	25	namespace· Dune::TypeTree
40		26


Offset 7, 88 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	~~powercompositeno~~detransf~~ormatio~~n~~templ~~ates.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_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
18	·5#define·DUNE_TYPETREE_~~POWERCOMPOSITENO~~DETRANSF~~ORMATIO~~N~~TEMPL~~ATES_HH	17	·4#ifndef·DUNE_TYPETREE_LEAFNODE_HH
		18	·5#define·DUNE_TYPETREE_LEAFNODE_HH
19	·6	19	·6
		20	·7#include·<dune/typetree/nodetags.hh>
20	·7#include·<cstddef>	21	·8#include·<cstddef>
		22	·9#include·<type_traits>
21	·8
22	·9#include·<dune/typetree/nodeinterface.hh>
23	·10	23	·10
24	·11namespace·Dune·{	24	·11namespace·Dune·{
25	·12·namespace·TypeTree·{	25	·12·namespace·TypeTree·{
26	·13	26	·13
		27	25·class·LeafNode
27	·19·template<typename·SourceNode,·typename·Transformation,
28	template<typename,typename,std::size_t>·class·TransformedNode>
29	20·struct·GenericPowerNodeTransformationTemplate
30	·21·{	28	·26·{
		29	·27
		30	·28·public:
31	·22·template<typename·TC>
32	23·struct·result
33	·24·{
34	25·typedef·TransformedNode<SourceNode,TC,StaticDegree<SourceNode>::value>·type;
35	·26·};
36	·27·};
37	·28
38	·29	31	·29
		32	31·static·const·bool·isLeaf·=·true;
39	·30·template<typename·SourceNode,·typename·Transformation,
40	template<typename,typename>·class·TransformedNode>
41	31·struct·GenericDynamicPowerNodeTransformationTemplate
42	·32·{	33	·32
		34	34·static·const·bool·isPower·=·false;
43	·33·template<typename·TC>
44	34·struct·result
45	·35·{	35	·35
46	36·typedef·TransformedNode<SourceNode,TC>·type;
47	·37·};
48	·38·};
49	·39
50	·40·template<typename·SourceNode,·typename·Transformation,
51	template<typename,typename...>·class·TransformedNode>
52	41·struct·~~Gener~~icComposit~~eNod~~eTr~~ans~~f~~orm~~a~~tionTemp~~l~~ate~~	36	37·static·const·bool·isComposite·=·false;
		37	·38
		38	·40·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
		39	41·static·const·std::size_t·CHILDREN·=·0;
		40	·42
		41	44·typedef·LeafNodeTag·NodeTag;
		42	·45
		43	46·static·constexpr·auto·degree()
53	·42·{	44	·47·{
		45	·48·return·std::integral_constant<std::size_t,0>{};
54	·43·template<typename...·TC>
55	44·struct·result
56	·45·{
57	46·typedef·TransformedNode<SourceNode,TC...>·type;
58	·47·};
59	·48·};
60	·49	46	·49·}
61	·51
62	·52·}·//·namespace·TypeTree
63	·5~~3}·//namespace·Dun~~e	47	·50
		48	·51·protected:
		49	·52
64	·54	50	·54
65	·55#endif·//·DUNE_TYPETREE_POWERCOMPOSITENODETRANSFORMATIONTEMPLATES_HH
66	~~nodeinterface.hh~~	51	59·LeafNode()·{}
		52	·60·};
		53	·61
		54	·63
		55	·64·}·//·namespace·TypeTree
		56	·65}·//namespace·Dune
		57	·66
		58	·67#endif·//·DUNE_TYPETREE_POWERNODE_HH
		59	nodetags.hh
67	Dune	60	Dune
68	Definition·accumulate_static.hh:13	61	Definition·accumulate_static.hh:13
69	Dune::TypeTree::GenericPowerNodeTransformationTemplate
70	Definition·powercompositenodetransformationtemplates.hh:21
71	Dune::TypeTree::GenericPowerNodeTransformationTemplate::result
72	Definition·powercompositenodetransformationtemplates.hh:24
73	Dune::TypeTree::GenericPowerNodeTransformationTemplate::result::type
74	TransformedNode<·SourceNode,·TC,·StaticDegree<·SourceNode·>::value·>·type
75	Definition·powercompositenodetransformationtemplates.hh:25
76	Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate
77	Definition·powercompositenodetransformationtemplates.hh:32
78	Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate::result
79	Definition·powercompositenodetransformationtemplates.hh:35
80	Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate::result::type
81	TransformedNode<·SourceNode,·TC·>·type
82	Definition·powercompositenodetransformationtemplates.hh:36
83	Dune::TypeTree::GenericCompositeNodeTransformationTemplate
84	Definition·powercompositenodetransformationtemplates.hh:42
85	Dune::TypeTree::GenericCompositeNodeTransformationTemplate::result
86	Definition·powercompositenodetransformationtemplates.hh:45
87	Dune::TypeTree::GenericCompositeNodeTransformationTemplate::result::type
88	TransformedNode<·SourceNode,·TC...·>·type
89	D~~efiniti~~on~~·pow~~e~~rcom~~p~~osit~~e~~nod~~etransf~~ormat~~io~~ntempla~~te~~s.hh:46~~	62	Dune::TypeTree::LeafNode
		63	Base·class·for·leaf·nodes·in·a·dune-typetree.
		64	Definition·leafnode.hh:26
		65	Dune::TypeTree::LeafNode::NodeTag
		66	LeafNodeTag·NodeTag
		67	The·type·tag·that·describes·a·LeafNode.
		68	Definition·leafnode.hh:44
		69	Dune::TypeTree::LeafNode::isLeaf
		70	static·const·bool·isLeaf
		71	Mark·this·class·as·a·leaf·in·a·dune-typetree.
		72	Definition·leafnode.hh:31
		73	Dune::TypeTree::LeafNode::CHILDREN
		74	static·const·std::size_t·CHILDREN
		75	Leafs·have·no·children.
		76	Definition·leafnode.hh:41
		77	Dune::TypeTree::LeafNode::isPower
		78	static·const·bool·isPower
Max diff block lines reached; 116/4948 bytes (2.34%) of diff not shown.


Offset 6, 41 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~~·\|·Functions~~	12	Classes·\|·Namespaces
		13	utility.hh·File·Reference
13	transformation.hh·File·Reference
14	#include·<array>
15	#include·<tuple>
16	#include·<memory>	14	#include·<memory>
		15	#include·<tuple>
		16	#include·<type_traits>
17	#include·<utility>	17	#include·<utility>
		18	#include·<algorithm>
		19	#include·<dune/common/shared_ptr.hh>
		20	#include·<dune/common/indices.hh>
18	#include·<dune/common/hybridutilities.hh>	21	#include·<dune/common/hybridutilities.hh>
19	#include·<dune/common/exceptions.hh>
20	#include·<dune/common/typetraits.hh>
21	#include·<dune/typetree/typetraits.hh>
22	#include·<dune/typetree/nodeinterface.hh>	22	#include·<dune/typetree/nodeinterface.hh>
23	#include·<dune/typetree/nodetags.hh>	23	#include·<dune/typetree/nodetags.hh>
24	#include·<dune/typetree/utility.hh>
25	Go_to_the_source_code_of_this_file.	24	Go_to_the_source_code_of_this_file.
26	·Classes	25	·Classes
27	struct· Dune::TypeTree::TransformTree<_SourceTree,_Transformation,_Tag,
28	·~~········~~recur~~siv~~e_>	26	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
		27	·······Struct·for·obtaining·some·basic·structural·information·about·a
29	·······~~Transform~~·a·TypeTree.·More...	28	·········TypeTree.·More...
30		29
31	·Namespaces	30	·Namespaces
32	namespace· Dune	31	namespace· Dune
33		32
34	namespace· Dune::TypeTree	33	namespace· Dune::TypeTree
35		34
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

43	===============================================================================	35	===============================================================================
44	·····Generated·by [doxygen]·1.9.8	36	·····Generated·by [doxygen]·1.9.8


Offset 7, 633 lines modified		Offset 7, 314 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	~~transformat~~ion.hh	12	utility.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_~~TRANSFORMAT~~ION_HH	17	·4#ifndef·DUNE_TYPETREE_UTILITY_HH
18	·5#define·DUNE_TYPETREE_~~TRANSFORMAT~~ION_HH	18	·5#define·DUNE_TYPETREE_UTILITY_HH
19	·6	19	·6
20	·7#include·<~~arra~~y>	20	·7#include·<memory>
21	·8#include·<tuple>	21	·8#include·<tuple>
22	·9#include·<memory>	22	·9#include·<type_traits>
23	·10#include·<utility>	23	·10#include·<utility>
24	·11	24	·11#include·<algorithm>
		25	·12
		26	·13#include·<dune/common/shared_ptr.hh>
		27	·14#include·<dune/common/indices.hh>
25	·12#include·<dune/common/hybridutilities.hh>	28	·15#include·<dune/common/hybridutilities.hh>
26	·13#include·<dune/common/exceptions.hh>
27	·14#include·<dune/common/typetraits.hh>
28	·15#include·<dune/typetree/typetraits.hh>
29	·16#include·<dune/typetree/nodeinterface.hh>	29	·16#include·<dune/typetree/nodeinterface.hh>
30	·17#include·<dune/typetree/nodetags.hh>	30	·17#include·<dune/typetree/nodetags.hh>
		31	·18
31	·18#include·<dune/typetree/utility.hh>
32	·19
33	·20
34	·21namespace·Dune·{	32	·19namespace·Dune·{
35	·22·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
36	·23	34	·21
37	·29#ifdef·DOXYGEN	35	·26#ifndef·DOXYGEN
		36	·27
		37	·28·template<typename·T>
		38	·29·std::shared_ptr<T>·convert_arg(const·T&·t)
38	·30	39	·30·{
		40	·31·return·std::make_shared<T>(t);
39	·32	41	·32·}
40	·51·template<typename·SourceNode,·typename·Transformation,·typename·Tag>
41	52·void·registerNodeTransformation(SourceNode,·Transformation,·Tag*);
42	·53
43	·~~54#else·//·DOXYG~~EN	42	·33
		43	·34·template<typename·T>
		44	·35·std::shared_ptr<T>·convert_arg(T&·t)
		45	·36·{
		46	·37·return·stackobject_to_shared_ptr(t);
		47	·38·}
		48	·39
		49	·40·template<typename·BaseType,·typename·T>
		50	·41·T&·assertGridViewType(T&·t)
		51	·42·{
		52	·43·static_assert((std::is_same<typename·BaseType::Traits::GridViewType,
		53	·44·typename·T::Traits::GridViewType>::value),
		54	·45·"GridViewType·must·be·equal·in·all·components·of·composite·type");
		55	·46·return·t;
		56	·47·}
		57	·48
		58	·49·//·only·bind·to·real·rvalues
		59	·50·template<typename·T>
		60	·51·typename·std::enable_if<!std::is_lvalue_reference<T>::value,std::
		61	shared_ptr<T>·>::type·convert_arg(T&&·t)
		62	·52·{
		63	·53·return·std::make_shared<T>(std::forward<T>(t));
		64	·54·}
44	·55	65	·55
45	·66·template<typename·S,·typename·T,·typename·Tag>
46	·~~67·struct·LookupNodeTransformati~~on	66	·56
		67	·57·namespace·Experimental·{
		68	·58
		69	·67·template<class·BinaryOp,·class·Arg>
		70	·68·constexpr·decltype(auto)
		71	·69·left_fold(BinaryOp&&·binary_op,·Arg&&·arg)
		72	·70·{
		73	·71·return·std::forward<Arg>(arg);
		74	·72·}
		75	·73
		76	·95·template<class·BinaryOp,·class·Init,·class·Arg0,·class...·Args>
		77	·96·constexpr·decltype(auto)
		78	·97·left_fold(BinaryOp&&·binary_op,·Init&&·init,·Arg0&&·arg_0,·Args&&...·args)
47	·68·{	79	·98·{
		80	·99·return·left_fold(
		81	·100·std::forward<BinaryOp>(binary_op),
		82	·101·binary_op(std::forward<Init>(init),·std::forward<Arg0>(arg_0)),
		83	·102·std::forward<Args>(args)...);
		84	·103·}
48	·69
49	·70·typedef·decltype(registerNodeTransformation(declptr<S>(),declptr<T>
50	(),declptr<Tag>()))·lookup_type;
51	·71
52	·72·typedef·typename·evaluate_if_meta_function<
53	·73·lookup_type
54	·74·>::type·type;
55	·75
56	·76·static_assert((!std::is_same<type,void>::value),·"Unable·to·find·valid
57	transformation·descriptor");
58	·77·};
59	·78
60	·79#endif·//·DOXYGEN
61	·80
62	·81
63	·83
64	·92·template<typename·SourceTree,·typename·Transformation,·typename·Tag·=
65	StartTag,·bool·recursive·=·true>
66	93·struct·TransformTree
67	·94·{
68	·95
69	·96#ifndef·DOXYGEN
70	·97
71	·98·typedef·typename
72	LookupNodeTransformation<SourceTree,Transformation,typename·SourceTree::
73	ImplementationTag>::type·NodeTransformation;
74	·99
75	·100·//·the·type·of·the·new·tree·that·will·result·from·this·transformation
76	·101·typedef·typename
77	TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
78	recursive>::transformed_type·transformed_type;
79	·102	85	·104
80	·103·//·the·storage·type·of·the·new·tree·that·will·result·from·this
81	transformation
82	·104·typedef·typename
83	TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::
84	recursive>::transformed_storage_type·transformed_storage_type;
Max diff block lines reached; 26388/30417 bytes (86.75%) of diff not shown.


Offset 7, 328 lines modified		Offset 7, 469 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	~~com~~pos~~ite~~node.hh	12	powernode.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_~~COM~~POS~~ITE~~NODE_HH	17	·4#ifndef·DUNE_TYPETREE_POWERNODE_HH
18	·5#define·DUNE_TYPETREE_~~COM~~POS~~ITE~~NODE_HH	18	·5#define·DUNE_TYPETREE_POWERNODE_HH
19	·6	19	·6
20	·7#include·<~~tupl~~e>	20	·7#include·<cassert>
		21	·8#include·<array>
21	·8#include·<memory>	22	·9#include·<memory>
22	·9#include·<type_traits>	23	·10#include·<type_traits>
		24	·11
23	·10
24	·11#include·<dune/typetree/nodetags.hh>
25	·12#include·<dune/typetree/childextraction.hh>
26	·13#include·<dune/ty~~petree~~/typetraits.hh>	25	·12#include·<dune/common/typetraits.hh>
		26	·13#include·<dune/common/std/type_traits.hh>
27	·14	27	·14
		28	·15#include·<dune/typetree/nodetags.hh>
		29	·16#include·<dune/typetree/utility.hh>
		30	·17#include·<dune/typetree/childextraction.hh>
		31	·18#include·<dune/typetree/typetraits.hh>
		32	·19
28	·15namespace·Dune·{	33	·20namespace·Dune·{
29	·16·namespace·TypeTree·{	34	·21·namespace·TypeTree·{
		35	·22
		36	·29#ifndef·DOXYGEN
		37	·30
		38	·32·template<typename·PowerNode,·typename·T,·std::size_t·k>
		39	·33·struct·AssertPowerNodeChildCount


Offset 7, 129 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	nodeinter~~face~~.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_NODEINTERFACE_HH
18	·5#define·DUNE_TYPETREE_NODEINTER~~FACE~~_HH	17	·4#ifndef·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
		18	·5#define·DUNE_TYPETREE_SIMPLETRANSFORMATIONDESCRIPTORS_HH
19	·6	19	·6
20	·7#include·<cstddef>
21	·8#include·<~~type~~_traits>	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/documentation.hh>	25	·12#include·<dune/common/exceptions.hh>
		26	·13
24	·11
25	·12namespace·Dune·{
26	·13·namespace·TypeTree·{
27	·14	27	·14
28	32·~~struct·Nod~~eIn~~terface~~	28	·15namespace·Dune·{
		29	·16·namespace·TypeTree·{
		30	·17
		31	·23·template<typename·SourceNode,·typename·Transformation,·typename
		32	TransformedNode>
		33	24·struct·SimpleLeafNodeTransformation
		34	·25·{
		35	·26
		36	27·static·const·bool·recursive·=·false;
		37	·28


Offset 7, 591 lines modified		Offset 7, 315 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	~~accum~~ulate_static.hh	12	traversal.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_ACCUMULATE_STATIC_HH
18	·5#define·DUNE_TYPETREE_~~ACCUM~~ULATE_STATIC_HH	17	·4#ifndef·DUNE_TYPETREE_TRAVERSAL_HH
		18	·5#define·DUNE_TYPETREE_TRAVERSAL_HH
19	·6	19	·6
		20	·7#include·<utility>
		21	·8
		22	·9#include·<dune/common/hybridutilities.hh>
20	·7#include·<dune/common/typetraits.hh>	23	·10#include·<dune/common/std/type_traits.hh>
21	·8#include·<dune/typetree/nodeinterface.hh>
22	·9#include·<dune/typetree/nodetags.hh>
23	·10#include·<dune/typetree/treepath.hh>
24	·11	24	·11
25	·12	25	·12#include·<dune/typetree/childextraction.hh>
		26	·13#include·<dune/typetree/nodetags.hh>
		27	·14#include·<dune/typetree/treepath.hh>
		28	·15#include·<dune/typetree/visitor.hh>
		29	·16
26	13namespace·Dune·{	30	·17namespace·Dune·{
27	14·namespace·TypeTree·{	31	·18·namespace·TypeTree·{
28	·15
29	·22·template<typename·result_type>
30	~~23·struct~~·or_	32	·19
		33	·25#ifndef·DOXYGEN
		34	·27·struct·NoOp
31	·24·{	35	·28·{
		36	·29·template<class...·T>


Offset 7, 22 lines modified		Offset 7, 48 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	fixedcapacitystack.hh·File·Reference
14	#include·<array>
15	~~#inclu~~de·~~<cass~~ert>	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>
		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::Fixed~~CapacityStackV~~ie~~w<_T~~_>	22	·class· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>
		23	·······Mixin·class·providing·methods·for·child·access·with·compile-time
		24	·········parameter.·More...
19		25
20	~~class~~· Dune::TypeTree::~~Fixed~~C~~apacityStack~~<_T,_~~capac~~ity_>	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...
21		47
22	·Namespaces	48	·Namespaces
23	namespace· Dune	49	namespace· Dune
24		50
25	namespace· Dune::TypeTree	51	namespace· Dune::TypeTree
26		52


Offset 7, 209 lines modified		Offset 7, 462 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	~~fixedca~~pa~~cit~~ys~~tack~~.hh	12	proxynode.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_FIXEDCAPACITYSTACK_HH
18	·5#define·DUNE_TYPETREE_~~FIXEDCA~~PA~~CIT~~YS~~TACK~~_HH	17	·4#ifndef·DUNE_TYPETREE_PROXYNODE_HH
		18	·5#define·DUNE_TYPETREE_PROXYNODE_HH
19	·6	19	·6
20	·7#include·<array>
21	·8#include·<cassert>
22	·9
23	·10namespace·Dune·{
24	·11·namespace·TypeTree·{
25	·12	20	·7#include·<type_traits>
		21	·8#include·<dune/typetree/nodeinterface.hh>
		22	·9#include·<dune/typetree/nodetags.hh>
		23	·10#include·<dune/common/shared_ptr.hh>
		24	·11#include·<dune/common/indices.hh>
		25	·12#include·<dune/common/std/type_traits.hh>
26	·13	26	·13
27	·17	27	·14namespace·Dune·{
		28	·15·namespace·TypeTree·{
		29	·16
28	·18·template<typename·T>	30	·22·template<typename·Node>
29	19·class·~~FixedCapacit~~y~~StackVi~~ew	31	·23·class·ProxyNode;
		32	·24
		33	·26·template<typename·ProxiedNode>
		34	27·class·StaticChildAccessors
30	·20·{	35	·28·{
		36	·29
		37	·30·static·const·bool·proxiedNodeIsConst·=·std::is_const<typename·std::
		38	remove_reference<ProxiedNode>::type>::value;
		39	·31
		40	·32·template<std::size_t·k>
		41	·33·struct·lazy_enabled
		42	·34·{
		43	·35·static·const·bool·value·=·!proxiedNodeIsConst;
31	·21
32	·22·public:
33	·23
34	·24·struct·Impl
35	·25·{
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·{}
42	·32
43	·33·T·*·const·_data;
44	·34·std::size_t·_size;
45	·35·const·std::size_t·_capacity;
46	·36·};	44	·36·};
47	·37	45	·37
48	38·FixedCapacityStackView(Impl&·impl)
49	·39·:·_impl(impl)
50	·40·{}
51	·41	46	·38·typedef·ProxyNode<ProxiedNode>·Node;
		47	·39
		48	·40·template<bool·enabled·=·!proxiedNodeIsConst>
		49	·41·typename·std::enable_if<enabled,Node&>::type
		50	·42·node·()
		51	·43·{
		52	·44·return·static_cast<Node&>(*this);
		53	·45·}
		54	·46
		55	·47·const·Node&·node·()·const
		56	·48·{
		57	·49·return·static_cast<const·Node&>(*this);
		58	·50·}
		59	·51
52	·42·public:	60	·52·public:
53	·43
54	44·std::size_t·size()·const
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;
62	·52·}
63	·53	61	·53
64	54·bool·empty()·const
65	·55·{
66	·56·return·_impl._size·==·0;
67	·57·}
68	·58
69	59·~~boo~~l~~·full()·cons~~t	62	·55·template<std::size_t·k>
		63	56·struct·Child
		64	·57·:·public·ProxiedNode::template·Child<k>
		65	·58·{};
		66	·59
		67	·62
		68	·64
		69	·67·template<std::size_t·k,
		70	·68·typename·std::enable_if<lazy_enabled<k>::value,·int>::type·=·0>
		71	69·auto&·child·(index_constant<k>·=·{})
70	·60·{	72	·70·{
71	·61·return·~~_impl~~._si~~ze·==·_i~~mpl._c~~apacity~~;	73	·71·return·node().proxiedNode().template·child<k>();
72	·62·}	74	·72·}
		75	·73
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·}
79	·69
80	70·void·pop_back()
81	·71·{
82	·72·assert(!empty());
83	·73·--_impl._size;
84	·74·}
85	·75	76	·75
		77	·78·template<std::size_t·k>
		78	79·const·auto&·child·(index_constant<k>·=·{})·const
86	76·T&·back()
87	·77·{
Max diff block lines reached; 13833/18205 bytes (75.98%) of diff not shown.


Offset 7, 27 lines modified		Offset 7, 31 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	~~com~~pos~~ite~~node.hh·File·Reference	13	powernode.hh·File·Reference
14	#include·<~~tupl~~e>	14	#include·<cassert>
		15	#include·<array>
15	#include·<memory>	16	#include·<memory>
16	#include·<type_traits>	17	#include·<type_traits>
		18	#include·<dune/common/typetraits.hh>
		19	#include·<dune/common/std/type_traits.hh>
17	#include·<dune/typetree/nodetags.hh>	20	#include·<dune/typetree/nodetags.hh>
		21	#include·<dune/typetree/utility.hh>
18	#include·<dune/typetree/childextraction.hh>	22	#include·<dune/typetree/childextraction.hh>
19	#include·<dune/typetree/typetraits.hh>	23	#include·<dune/typetree/typetraits.hh>
20	Go_to_the_source_code_of_this_file.	24	Go_to_the_source_code_of_this_file.
21	·Classes	25	·Classes
22	·class· Dune::TypeTree::~~Com~~pos~~ite~~Node<_~~Children~~_>	26	·class· Dune::TypeTree::PowerNode<_T,_k_>
23	·······~~Base·~~cl~~ass~~·f~~or·compo~~s~~ite~~·~~nod~~es·~~based·o~~n·variad~~ic·tem~~p~~lat~~es.·More...	27	·······Collect·k·instances·of·type·T·within·a·dune-typetree.·More...
24		28
25	struct· Dune::TypeTree::~~Com~~pos~~ite~~Node<_~~Children~~_>::Child<_k_>	29	struct· Dune::TypeTree::PowerNode<_T,_k_>::Child<_i_>
26	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...	30	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
27		31
28	·Namespaces	32	·Namespaces
29	namespace· Dune	33	namespace· Dune
30		34
31	namespace· Dune::TypeTree	35	namespace· Dune::TypeTree
32		36


Offset 6, 45 lines modified		Offset 6, 45 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·\|·Typedefs·\|·Functions
13	nodeinterface.hh·File·Reference
14	#include·<cstddef>
15	#~~include~~·~~<type_tr~~aits>	12	Classes·\|·Namespaces
		13	simpletransformationdescriptors.hh·File·Reference
		14	#include·<array>
		15	#include·<memory>
		16	#include·<dune/typetree/nodeinterface.hh>
		17	#include·<dune/typetree/nodetags.hh>
16	#include·<dune/common/documentation.hh>	18	#include·<dune/common/exceptions.hh>
17	Go_to_the_source_code_of_this_file.	19	Go_to_the_source_code_of_this_file.
18	·Classes	20	·Classes
19	struct· Dune::TypeTree::NodeInterface
20	~~····~~·~~··I~~n~~terfac~~e~~·for·nodes·in·~~a·dun~~e-type~~t~~ree.·M~~ore~~...~~	21	struct· Dune::TypeTree::SimpleLeafNodeTransformation<_SourceNode,
		22	·········Transformation,_TransformedNode_>
		23
		24	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
		25	·········Transformation,_TransformedNode_>
		26
		27	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
		28	·········Transformation,_TransformedNode_>::result<_TC_>
		29
		30	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
		31	·········Transformation,_TransformedNode_>
		32
		33	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
		34	·········Transformation,_TransformedNode_>::result<_TC_>
		35
		36	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
		37	·········Transformation,_TransformedNode_>
		38
		39	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
		40	·········Transformation,_TransformedNode_>::result<_TC_>
21		41
22	·Namespaces	42	·Namespaces
23	namespace· Dune	43	namespace· Dune
24		44
25	namespace· Dune::TypeTree	45	namespace· Dune::TypeTree
26		46
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
43	template<typename·Node·>
44	std::size_t Dune::TypeTree::degree·(const·Node·&node)
45	···········Returns·the·degree·of·node·as·run·time·information.
46

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

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces·|·Functions
+Namespaces·|·Typedefs·|·Functions
+traversal.hh·File·Reference
+#include·<utility>
+#include·<dune/common/hybridutilities.hh>
+#include·<dune/common/std/type_traits.hh>
+#include·<dune/typetree/childextraction.hh>
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/typetree/treepath.hh>
+#include·<dune/typetree/visitor.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+struct· Dune::TypeTree::or_<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·||.·More...
+struct· Dune::TypeTree::or_<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::and_<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·&&.·More...
+struct· Dune::TypeTree::and_<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::plus<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·+.·More...
+struct· Dune::TypeTree::plus<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::minus<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·-.·More...
+struct· Dune::TypeTree::minus<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::multiply<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·using·*.·More...
+struct· Dune::TypeTree::multiply<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::min<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·by·returning·their
+·········minimum.·More...
+struct· Dune::TypeTree::min<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::max<_result_type_>
+ ·······Statically·combine·two·values·of·type·result_type·by·returning·their
+·········maximum.·More...
+struct· Dune::TypeTree::max<_result_type_>::reduce<_r1,_r2_>
+struct· Dune::TypeTree::AccumulateValue<_Tree,_Functor,_Reduction,_startValue,
+·········ParentChildReduction_>
+ ·······Statically·accumulate·a·value·over·the·nodes·of·a·TypeTree.·More...
+struct· Dune::TypeTree::TypeAccumulationPolicy<_Functor,_Reduction,_StartType,
+·········ParentChildReduction,_ReductionAlgorithm_>
+struct· Dune::TypeTree::AccumulateType<_Tree,_Policy_>
+ ·······Statically·accumulate·a·type·over·the·nodes·of·a·TypeTree.·More...
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+namespace· Dune::TypeTree::Detail
+·Typedefs
+template<class·Tree·>
+using Dune::TypeTree::Detail::DynamicTraversalConcept·=·decltype((std::
+·······declval<·Tree·>().degree(),·std::declval<·Tree·>().child(0u)))
+template<class·Tree·>
+using Dune::TypeTree::Detail::StaticTraversalConcept·=·decltype((std::
+·······integral_constant<·std::size_t,·Tree::degree()>{}))
+·Functions
+template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
+enable_if_t<·Tree::isLeaf,·int·>·=·0>
+constexpr·auto Dune::TypeTree::Detail::leafTreePathTuple·(Prefix·prefix)
+template<typename·Tree·,·typename·Visitor·,·typename·Init·>
+auto Dune::TypeTree::Experimental::hybridApplyToTree·(Tree·&&tree,·Visitor
+······&&visitor,·Init·&&init)
+ ····Apply·hybrid·visitor·to·TypeTree.
+*****·Variable·Documentation·*****
+*****·◆ child_result·*****
+const·result_type·child_result·=
+accumulate_value<child,Functor,Reduction,ParentChildReduction,current_value,child_tree_path,NodeTag<child>>::·static
+result
+*****·◆ result·*****
+template<class·Tree·,·TreePathType::Type·pathType,·class·Prefix·,·std::
+size_t...·indices,·std::enable_if_t<(Tree::isComposite·or(Tree::isPower·and
+(pathType!=TreePathType::dynamic))),·int·>·=·0>
+constexpr·auto Dune::TypeTree::Detail::leafTreePathTuple·(Prefix·prefix,·std::
+················index_sequence<·indices...·>)
+template<class·T·,·class·TreePath·,·class·V·,·std::enable_if_t<·std::decay_t<·T
+>::isLeaf,·int·>·=·0>
+··········void Dune::TypeTree::Detail::applyToTree·(T·&&tree,·TreePath
+················treePath,·V·&&visitor)
+template<class·T·,·class·TreePath·,·class·PreFunc·,·class·LeafFunc·,·class
+PostFunc·>
+··········void Dune::TypeTree::Detail::forEachNode·(T·&&tree,·TreePath
+················treePath,·PreFunc·&&preFunc,·LeafFunc·&&leafFunc,·PostFunc
+················&&postFunc)
+template<class·Tree·,·TreePathType::Type·pathType·=·TreePathType::dynamic>
+constexpr·auto Dune::TypeTree::leafTreePathTuple·()
+ ··············Create·tuple·of·tree·paths·to·leafs.
+template<typename·Tree·,·typename·Visitor·>
+··········void Dune::TypeTree::applyToTree·(Tree·&&tree,·Visitor·&&visitor)
+ ··············Apply·visitor·to·TypeTree.
+template<class·Tree·,·class·PreFunc·,·class·LeafFunc·,·class·PostFunc·>
+··········void Dune::TypeTree::forEachNode·(Tree·&&tree,·PreFunc·&&preFunc,
+················LeafFunc·&&leafFunc,·PostFunc·&&postFunc)
+ ··············Traverse·tree·and·visit·each·node.


Offset 6, 45 lines modified		Offset 6, 108 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·\|·Variables
		13	visitor.hh·File·Reference
12	Classes·\|·Namespaces
13	simpletransformationdescriptors.hh·File·Reference
14	#include·<array>
15	#include·<memory>
16	#include·<dune/typetree/nodeinterface.hh>
17	#include·<dune/typetree/~~nod~~etags.hh>	14	#include·<dune/typetree/treepath.hh>
18	#include·<dune/c~~ommon/~~ex~~cep~~ti~~ons~~.hh>	15	#include·<dune/typetree/utility.hh>
19	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
20	·Classes	17	·Classes
21	struct· Dune::TypeTree::SimpleLeafNodeTransformation<_SourceNode,
22	··~~······~~·~~Tra~~nsf~~ormation,_Trans~~f~~ormedNode_>~~	18	struct· Dune::TypeTree::DefaultVisitor
		19	·······Visitor·interface·and·base·class·for·TypeTree·visitors.·More...
23		20
24	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
25	~~······~~·~~··Transformation,_Tr~~a~~nsformedNode_>~~	21	struct· Dune::TypeTree::DefaultPairVisitor
		22	·······Visitor·interface·and·base·class·for·visitors·of·pairs·of·TypeTrees.
		23	·········More...
26		24
27	struct· Dune::TypeTree::SimplePowerNodeTransformation<_SourceNode,
28	··~~······~~·~~Tra~~n~~sformation,_~~Tr~~ansform~~e~~dNode_>~~::result~~<_TC_>~~	25	struct· Dune::TypeTree::Experimental::DefaultHybridVisitor
		26	·······Hybrid·visitor·interface·and·base·class·for·TypeTree·hybrid·visitors.
		27	·········More...
29		28
30	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
31	~~·····~~·~~···Transformation,_TransformedNo~~d~~e_>~~	29	struct· Dune::TypeTree::VisitDirectChildren
		30	·······Mixin·base·class·for·visitors·that·only·want·to·visit·the·direct
		31	·········children·of·a·node.·More...
32		32
33	struct· Dune::TypeTree::SimpleDynamicPowerNodeTransformation<_SourceNode,
34	·~~········~~Transformati~~on,_Tran~~s~~forme~~dNode~~_>::result<_TC_>~~	33	struct· Dune::TypeTree::VisitDirectChildren::VisitChild<_Node1,_Child1,_Node2,
		34	·········Child2,_TreePath_>
		35	·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
		36	·········More...
35		37
36	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
37	··~~······~~·~~Tra~~n~~sformation,_~~Tra~~nsformedNod~~e_>	38	struct· Dune::TypeTree::VisitTree
		39	·······Mixin·base·class·for·visitors·that·want·to·visit·the·complete·tree.
		40	·········More...
38		41
39	struct· Dune::TypeTree::SimpleCompositeNodeTransformation<_SourceNode,
40	~~···~~·~~·····Transfo~~r~~mation,_~~Trans~~forme~~dNode_~~>::r~~e~~sult<_TC_>~~	42	struct· Dune::TypeTree::VisitTree::VisitChild<_Node1,_Child1,_Node2,_Child2,
		43	·········TreePath_>
		44	·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
		45	·········More...
		46
		47	struct· Dune::TypeTree::StaticTraversal
		48	·······Mixin·base·class·for·visitors·that·require·a·static·TreePath·during
		49	·········traversal.·More...
		50
		51	struct· Dune::TypeTree::DynamicTraversal
		52	·······Mixin·base·class·for·visitors·that·only·need·a·dynamic·TreePath·during
		53	·········traversal.·More...
		54
		55	struct· Dune::TypeTree::TreeVisitor
		56	·······Convenience·base·class·for·visiting·the·entire·tree.·More...
		57
		58	struct· Dune::TypeTree::DirectChildrenVisitor
		59	·······Convenience·base·class·for·visiting·the·direct·children·of·a·node.
		60	·········More...
		61
		62	struct· Dune::TypeTree::TreePairVisitor
		63	·······Convenience·base·class·for·visiting·an·entire·tree·pair.·More...
		64
		65	struct· Dune::TypeTree::DirectChildrenPairVisitor
		66	·······Convenience·base·class·for·visiting·the·direct·children·of·a·node
		67	·········pair.·More...
		68
		69	struct· Dune::TypeTree::Experimental::Info::LeafCounterVisitor
		70
		71	struct· Dune::TypeTree::Experimental::Info::NodeCounterVisitor
		72
		73	struct· Dune::TypeTree::Experimental::Info::DepthVisitor
41		74
42	·Namespaces	75	·Namespaces
43	namespace· Dune	76	namespace· Dune
44		77
45	namespace· Dune::TypeTree	78	namespace· Dune::TypeTree
46		79
		80	namespace· Dune::TypeTree::Experimental
		81
		82	namespace· Dune::TypeTree::Experimental::Info
		83
		84	·Functions
		85	template<typename·Tree·>
		86	··········auto Dune::TypeTree::Experimental::Info::depth·(const·Tree·&tree)
		87	··············The·depth·of·the·TypeTree.
		88
		89	template<typename·Tree·>
		90	constexpr·auto Dune::TypeTree::Experimental::Info::depth·()
		91	··············The·depth·of·the·Tree.
		92
		93	template<typename·Tree·>
		94	··········auto Dune::TypeTree::Experimental::Info::nodeCount·(const·Tree
		95	················&tree)
		96	··············The·total·number·of·nodes·in·the·Tree.
		97
		98	template<typename·Tree·>
		99	··········auto Dune::TypeTree::Experimental::Info::leafCount·(const·Tree
		100	················&tree)
		101	··············The·number·of·leaf·nodes·in·the·Tree.
		102
		103	·Variables
		104	template<typename·Tree·>
		105	constexpr·bool Dune::TypeTree::Experimental::Info::isDynamic·=·std::
		106	················is_same<std::size_t,·decltype(leafCount(std::declval<Tree>()))>
		107	················{}
		108	··············true·if·any·of·the·nodes·in·the·tree·only·has·dynamic·degree.
		109

47	===============================================================================	110	===============================================================================
48	·····Generated·by [doxygen]·1.9.8	111	·····Generated·by [doxygen]·1.9.8

+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_SIMPLETRANSFORMATIONDESCRIPTORS_HH
+·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
+·10#include·<dune/typetree/nodeinterface.hh>
+·11#include·<dune/typetree/nodetags.hh>
+·12#include·<dune/common/exceptions.hh>
+·13
+·14
+·10namespace·Dune·{
+·11·namespace·TypeTree·{
+·12
+·19
+·struct·DefaultVisitor
+·17
+·23·template<typename·SourceNode,·typename·Transformation,·typename
+TransformedNode>
+·struct·SimpleLeafNodeTransformation
+·25·{
+·26
+·static·const·bool·recursive·=·false;
+·28
+·typedef·TransformedNode·transformed_type;
+·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
+·31
+·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
+t)
+·33·{
+·34·return·transformed_type();
+·35·}
+·36
+·static·transformed_storage_type·transform_storage(std::shared_ptr<const
+SourceNode>·s,·const·Transformation&·t)
+·38·{
+·39·return·std::make_shared<transformed_type>();
+·40·}
+·41
+·42·};
+·43
+·44
+·45·template<typename·SourceNode,·typename·Transformation,·template<typename
+Child,·std::size_t>·class·TransformedNode>
+·struct·SimplePowerNodeTransformation
+·47·{
+·48
+·static·const·bool·recursive·=·true;
+·50
+·57·template<typename·T,·typename·TreePath>
+·void·pre(T&&,·TreePath)·const·{}
+·59
+·51·template<typename·TC>
+·struct·result
+·53·{
+·typedef·TransformedNode<TC,·StaticDegree<SourceNode>::value>·type;
+·typedef·std::shared_ptr<type>·storage_type;
+·static·const·std::size_t·degree·=·StaticDegree<type>::value;
+·57·};
+·58
+·59·template<typename·TC>
+·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
+Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
+children)
+·61
+·69·template<typename·T,·typename·TreePath>
+·void·in(T&&,·TreePath)·const·{}
+·71
+·62·return·typename·result<TC>::type(children);
+·63·}
+·64
+·65·template<typename·TC>
+·static·typename·result<TC>::storage_type·transform_storage(std::
+shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
+shared_ptr<TC>,result<TC>::degree>&·children)
+·67·{
+·68·return·std::make_shared<typename·result<TC>::type>(children);
+·69·}
+·70
+·71·};
+·72
+·73
+·80·template<typename·T,·typename·TreePath>
+·void·post(T&&,·TreePath)·const·{}
+·74·template<typename·SourceNode,·typename·Transformation,·template<typename
+Child>·class·TransformedNode>
+·struct·SimpleDynamicPowerNodeTransformation
+·76·{
+·77
+·static·const·bool·recursive·=·true;
+·79
+·80·template<typename·TC>
+·struct·result
+·82
+·84
+·90·template<typename·T,·typename·TreePath>
+·void·leaf(T&&,·TreePath)·const·{}
+·typedef·TransformedNode<TC>·type;
+·typedef·std::shared_ptr<type>·storage_type;
+·85·};
+·86
+·87·template<typename·TC>
+·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
+Transformation&·t,·const·std::vector<std::shared_ptr<TC>>&·children)
+·89·{
+·90·return·typename·result<TC>::type(children);
+·91·}
+·92
+·94
+·104·template<typename·T,·typename·Child,·typename·TreePath,·typename
+ChildIndex>
+·void·beforeChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
+·93·template<typename·TC>


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.

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

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


Offset 7, 28 lines modified		Offset 7, 52 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	nodetags.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>
		18	#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
		19	#include·<dune/common/exceptions.hh>
14	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
15	·Classes	21	·Classes
16	struct· Dune::TypeTree::LeafNodeTag
17	·~~······~~T~~ag·d~~e~~sig~~nati~~ng·~~a·leaf·no~~de.·Mo~~re~~...~~	22	struct· Dune::TypeTree::GenericLeafNodeTransformation<_SourceNode,
		23	·········Transformation,_TransformedNode_>
18		24
19	struct· Dune::TypeTree::PowerNodeTag
20	·~~······~~T~~ag·d~~e~~sign~~atin~~g·a·p~~ower·no~~de.·M~~ore~~...~~	25	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
		26	·········Transformation,_TransformedNodeTemplate_>
21		27
22	struct· Dune::TypeTree::DynamicPowerNodeTag
23	·~~······~~T~~ag·d~~e~~sign~~atin~~g·a·p~~ower·node~~·with·~~runti~~me·deg~~ree.·More...	28	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
		29	·········Transformation,_TransformedNodeTemplate_>::result<_TC_>
24		30
25	struct· Dune::TypeTree::CompositeNodeTag
26	·~~······~~T~~ag·d~~e~~sig~~nati~~ng·a·c~~o~~mpo~~s~~ite·n~~o~~de.·Mo~~re~~...~~	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_>
27		51
28	·Namespaces	52	·Namespaces
29	namespace· Dune	53	namespace· Dune
30		54
31	namespace· Dune::TypeTree	55	namespace· Dune::TypeTree
32		56


Offset 6, 25 lines modified		Offset 6, 31 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	ty~~petre~~e.hh·~~Fil~~e·~~Ref~~e~~ren~~ce	12	Classes·\|·Namespaces
		13	compositenode.hh·File·Reference
		14	#include·<tuple>
		15	#include·<memory>
		16	#include·<type_traits>
13	#include·<dune/typetree/nodetags.hh>	17	#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>	18	#include·<dune/typetree/childextraction.hh>
		19	#include·<dune/typetree/typetraits.hh>
26	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
		21	·Classes
		22	·class· Dune::TypeTree::CompositeNode<_Children_>
		23	·······Base·class·for·composite·nodes·based·on·variadic·templates.·More...
		24
		25	struct· Dune::TypeTree::CompositeNode<_Children_>::Child<_k_>
		26	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
		27
		28	·Namespaces
		29	namespace· Dune
		30
		31	namespace· Dune::TypeTree
		32

27	===============================================================================	33	===============================================================================
28	·····Generated·by [doxygen]·1.9.8	34	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+compositenode.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_COMPOSITENODE_HH
+·5#define·DUNE_TYPETREE_COMPOSITENODE_HH
+·6
+·7#include·<tuple>
+·8#include·<memory>
+·9#include·<type_traits>
+·10
+·11#include·<dune/typetree/nodetags.hh>
+·8#include·<dune/typetree/utility.hh>
+·9#include·<dune/typetree/leafnode.hh>
+·10#include·<dune/typetree/powernode.hh>
+·11#include·<dune/typetree/dynamicpowernode.hh>
+·12#include·<dune/typetree/compositenode.hh>
+·13#include·<dune/typetree/traversal.hh>
+·14#include·<dune/typetree/pairtraversal.hh>
+·15#include·<dune/typetree/traversalutilities.hh>
+·16#include·<dune/typetree/transformation.hh>
+·17#include·<dune/typetree/transformationutilities.hh>
+·18#include·<dune/typetree/accumulate_static.hh>
+·12#include·<dune/typetree/childextraction.hh>
+·13#include·<dune/typetree/typetraits.hh>
+·14
+·15namespace·Dune·{
+·16·namespace·TypeTree·{
+·17
+·24·template<typename...·Children>
+·class·CompositeNode
+·26·{
+·27
+·28·public:
+·29
+·typedef·CompositeNodeTag·NodeTag;
+·32
+·typedef·std::tuple<std::shared_ptr<Children>...·>·NodeStorage;
+·35
+·typedef·std::tuple<Children...>·ChildTypes;
+·38
+·static·const·bool·isLeaf·=·false;
+·41
+·static·const·bool·isPower·=·false;
+·44
+·static·const·bool·isComposite·=·true;
+·47
+·49·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
+·static·const·std::size_t·CHILDREN·=·sizeof...(Children);
+·51
+·static·constexpr·auto·degree·()
+·53·{
+·54·return·std::integral_constant<std::size_t,sizeof...(Children)>{};
+·55·}
+·56
+·58·template<std::size_t·k>
+·struct·Child·{
+·60
+·61·static_assert((k·<·degree()),·"child·index·out·of·range");
+·62
+·typedef·typename·std::tuple_element<k,ChildTypes>::type·Type;
+·65
+·typedef·typename·std::tuple_element<k,ChildTypes>::type·type;
+·68·};
+·69
+·72
+·74
+·77·template<std::size_t·k>
+·typename·Child<k>::Type&·child·(index_constant<k>·=·{})
+·79·{
+·80·return·*std::get<k>(_children);
+·81·}
+·82
+·84
+·87·template<std::size_t·k>
+·const·typename·Child<k>::Type&·child·(index_constant<k>·=·{})·const
+·89·{
+·90·return·*std::get<k>(_children);
+·91·}
+·92
+·94
+·97·template<std::size_t·k>
+·std::shared_ptr<typename·Child<k>::Type>·childStorage·(index_constant<k>·=
+{})
+·99·{
+·100·return·std::get<k>(_children);
+·101·}
+·102
+·104
+·107·template<std::size_t·k>
+·std::shared_ptr<const·typename·Child<k>::Type>·childStorage
+(index_constant<k>·=·{})·const
+·109·{
+·110·return·std::get<k>(_children);
+·111·}
+·112
+·114·template<std::size_t·k>
+·void·setChild·(typename·Child<k>::Type&·child,·index_constant<k>·=·{})
+·116·{
+·117·std::get<k>(_children)·=·stackobject_to_shared_ptr(child);
+·118·}
+·119
+·121·template<std::size_t·k>
+·void·setChild·(typename·Child<k>::Type&&·child,·index_constant<k>·=·{})
+·123·{
+·124·std::get<k>(_children)·=·convert_arg(std::move(child));
+·125·}
+·126
+·128·template<std::size_t·k>
+·void·setChild·(std::shared_ptr<typename·Child<k>::Type>·child,
+index_constant<k>·=·{})
+·130·{
+·131·std::get<k>(_children)·=·std::move(child);
+·132·}
+·133
+·const·NodeStorage&·nodeStorage·()·const
+·135·{
+·136·return·_children;
+·137·}


Offset 6, 55 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	~~generic~~transformation~~descriptors~~.hh·File·Reference	13	transformation.hh·File·Reference
14	#include·<array>	14	#include·<array>
		15	#include·<tuple>
15	#include·<memory>	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>
16	#include·<dune/typetree/nodeinterface.hh>	22	#include·<dune/typetree/nodeinterface.hh>
17	#include·<dune/typetree/nodetags.hh>	23	#include·<dune/typetree/nodetags.hh>
		24	#include·<dune/typetree/utility.hh>
18	#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
19	#include·<dune/common/exceptions.hh>
20	Go_to_the_source_code_of_this_file.	25	Go_to_the_source_code_of_this_file.
21	·Classes	26	·Classes
		27	struct· Dune::TypeTree::TransformTree<_SourceTree,_Transformation,_Tag,
		28	·········recursive_>
		29	·······Transform·a·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		30
52	·Namespaces	31	·Namespaces
53	namespace· Dune	32	namespace· Dune
54		33
55	namespace· Dune::TypeTree	34	namespace· Dune::TypeTree
56		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

57	===============================================================================	43	===============================================================================
58	·····Generated·by [doxygen]·1.9.8	44	·····Generated·by [doxygen]·1.9.8


Offset 7, 345 lines modified		Offset 7, 633 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	~~generic~~transformation~~descriptors~~.hh	12	transformation.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_~~GENERIC~~TRANSFORMATION~~DESCRIPTORS~~_HH	17	·4#ifndef·DUNE_TYPETREE_TRANSFORMATION_HH
18	·5#define·DUNE_TYPETREE_~~GENERIC~~TRANSFORMATION~~DESCRIPTORS~~_HH	18	·5#define·DUNE_TYPETREE_TRANSFORMATION_HH
19	·6	19	·6
20	·7#include·<array>	20	·7#include·<array>
		21	·8#include·<tuple>
21	·8#include·<memory>	22	·9#include·<memory>
		23	·10#include·<utility>
		24	·11
		25	·12#include·<dune/common/hybridutilities.hh>
22	·9
23	·10#include·<dune/typetree/nodeinterface.hh>
24	·11#include·<dune/typetree/nodetags.hh>
25	·12#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
26	·13#include·<dune/common/exceptions.hh>	26	·13#include·<dune/common/exceptions.hh>
27	·14
28	·15	27	·14#include·<dune/common/typetraits.hh>
		28	·15#include·<dune/typetree/typetraits.hh>
		29	·16#include·<dune/typetree/nodeinterface.hh>
		30	·17#include·<dune/typetree/nodetags.hh>
		31	·18#include·<dune/typetree/utility.hh>
		32	·19
		33	·20
29	·16namespace·Dune·{	34	·21namespace·Dune·{
30	·17·namespace·TypeTree·{	35	·22·namespace·TypeTree·{
		36	·23
		37	·29#ifdef·DOXYGEN
		38	·30
31	·18
32	·24·template<typename·SourceNode,·typename·Transformation,·typename
33	TransformedNode>
34	25·struct·GenericLeafNodeTransformation
35	·26·{
36	·27
37	28·static·const·bool·recursive·=·false;
38	·29
39	30·typedef·TransformedNode·transformed_type;
40	31·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
41	·32	39	·32
42	33·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
43	t)
44	·34·{
45	·35·return·transformed_type(s,t);
46	·36·}
47	·37
48	38·static·transformed_type·transform(std::shared_ptr<const·SourceNode>·s,·const
49	Transformation&·t)
50	·39·{
51	·40·return·transformed_type(s,t);
52	·41·}
53	·42
54	43·static·transformed_storage_type·transform_storage(std::shared_ptr<const
55	SourceNode>·s,·const·Transformation&·t)
56	·44·{
57	·45·return·std::make_shared<transformed_type>(s,t);
58	·46·}
59	·47
60	·48·};
61	·49
62	·50
63	·51·template<typename·SourceNode,·typename·Transformation,·temp~~lat~~e~~<typen~~ame	40	·51·template<typename·SourceNode,·typename·Transformation,·typename·Tag>
		41	52·void·registerNodeTransformation(SourceNode,·Transformation,·Tag*);
64	Child>·class·TransformedNodeTemplate>
65	52·struct·TemplatizedGenericPowerNodeTransformation
66	·53·{	42	·53
		43	·54#else·//·DOXYGEN
		44	·55
		45	·66·template<typename·S,·typename·T,·typename·Tag>
		46	·67·struct·LookupNodeTransformation
67	·54
68	55·static·const·bool·recursive·=·true;
69	·56
70	·57·template<typename·TC>
71	58·struct·result
72	·59·{
73	60·typedef·typename·TransformedNodeTemplate<TC>::type·type;
74	61·typedef·std::shared_ptr<type>·storage_type;
75	62·static·const·std::size_t·degree·=·StaticDegree<type>::value;
76	·63·};
77	·64
78	·65·template<typename·TC>
79	66·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
80	Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
81	children)
82	·67·{	47	·68·{
83	·68·return·typename·result<TC>::type(s,t,children);
84	·69·}	48	·69
		49	·70·typedef·decltype(registerNodeTransformation(declptr<S>(),declptr<T>
		50	(),declptr<Tag>()))·lookup_type;
		51	·71
		52	·72·typedef·typename·evaluate_if_meta_function<
		53	·73·lookup_type
		54	·74·>::type·type;
85	·70
86	·71·template<typename·TC>
87	72·static·typename·result<TC>::type·transform(std::shared_ptr<const·SourceNode>
88	s,·const·Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::
89	degree>&·children)
90	·73·{
91	·74·return·typename·result<TC>::type(s,t,children);
92	·75·}	55	·75
		56	·76·static_assert((!std::is_same<type,void>::value),·"Unable·to·find·valid
		57	transformation·descriptor");
		58	·77·};
		59	·78
		60	·79#endif·//·DOXYGEN
		61	·80
93	·76
94	·77·template<typename·TC>
95	78·static·typename·result<TC>::storage_type·transform_storage(std::
96	shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
97	shared_ptr<TC>,result<TC>::degree>&·children)
98	·79·{
99	·80·return·std::make_shared<typename·result<TC>::type>(s,t,children);
100	·81·}	62	·81
		63	·83
Max diff block lines reached; 30864/35408 bytes (87.17%) of diff not shown.


Offset 6, 37 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	Namespaces·\|·Functions	12	Classes·\|·Namespaces·\|·Functions
13	~~pairtr~~aversal.hh·File·Reference	13	accumulate_static.hh·File·Reference
14	#include·<dune/common/~~std/~~type_traits.hh>	14	#include·<dune/common/typetraits.hh>
15	#include·<dune/typetree/nodeinterface.hh>	15	#include·<dune/typetree/nodeinterface.hh>
16	#include·<dune/typetree/nodetags.hh>	16	#include·<dune/typetree/nodetags.hh>
17	#include·<dune/typetree/treepath.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.	18	Go_to_the_source_code_of_this_file.
		19	·Classes
		20	struct· Dune::TypeTree::or_<_result_type_>
		21	·······Statically·combine·two·values·of·type·result_type·using·\|\|.·More...
		22
		23	struct· Dune::TypeTree::or_<_result_type_>::reduce<_r1,_r2_>
		24
		25	struct· Dune::TypeTree::and_<_result_type_>
		26	·······Statically·combine·two·values·of·type·result_type·using·&&.·More...
		27
		28	struct· Dune::TypeTree::and_<_result_type_>::reduce<_r1,_r2_>
		29
		30	struct· Dune::TypeTree::plus<_result_type_>
		31	·······Statically·combine·two·values·of·type·result_type·using·+.·More...
		32
		33	struct· Dune::TypeTree::plus<_result_type_>::reduce<_r1,_r2_>
		34
		35	struct· Dune::TypeTree::minus<_result_type_>
		36	·······Statically·combine·two·values·of·type·result_type·using·-.·More...
		37
		38	struct· Dune::TypeTree::minus<_result_type_>::reduce<_r1,_r2_>
		39
		40	struct· Dune::TypeTree::multiply<_result_type_>
		41	·······Statically·combine·two·values·of·type·result_type·using·*.·More...
		42
		43	struct· Dune::TypeTree::multiply<_result_type_>::reduce<_r1,_r2_>
		44
		45	struct· Dune::TypeTree::min<_result_type_>
		46	·······Statically·combine·two·values·of·type·result_type·by·returning·their
		47	·········minimum.·More...
		48
		49	struct· Dune::TypeTree::min<_result_type_>::reduce<_r1,_r2_>
		50
		51	struct· Dune::TypeTree::max<_result_type_>
		52	·······Statically·combine·two·values·of·type·result_type·by·returning·their
		53	·········maximum.·More...
		54
		55	struct· Dune::TypeTree::max<_result_type_>::reduce<_r1,_r2_>
		56
		57	struct· Dune::TypeTree::AccumulateValue<_Tree,_Functor,_Reduction,_startValue,
		58	·········ParentChildReduction_>
		59	·······Statically·accumulate·a·value·over·the·nodes·of·a·TypeTree.·More...
		60
		61	struct· Dune::TypeTree::TypeAccumulationPolicy<_Functor,_Reduction,_StartType,
		62	·········ParentChildReduction,_ReductionAlgorithm_>
		63
		64	struct· Dune::TypeTree::AccumulateType<_Tree,_Policy_>
		65	·······Statically·accumulate·a·type·over·the·nodes·of·a·TypeTree.·More...
		66
21	·Namespaces	67	·Namespaces
22	namespace· Dune	68	namespace· Dune
23		69
24	namespace· Dune::TypeTree	70	namespace· Dune::TypeTree
25		71
26	namespace· Dune::TypeTree::Detail	72	namespace· Dune::TypeTree::Experimental
27		73
28	·Functions	74	·Functions
		75	template<typename·Tree·,·typename·Visitor·,·typename·Init·>
		76	auto Dune::TypeTree::Experimental::hybridApplyToTree·(Tree·&&tree,·Visitor
		77	······&&visitor,·Init·&&init)
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·~~visito~~r~~·to·a·pai~~r·of·TypeTrees.	78	····Apply·hybrid·visitor·to·TypeTree.
38		79
		80	***·Variable·Documentation·***
		81	***·◆ child_result·***
		82	const·result_type·child_result·=
		83	accumulate_value<child,Functor,Reduction,ParentChildReduction,current_value,child_tree_path,NodeTag<child>>::·static
		84	result
		85	***·◆ result·***
		86	const·result_type·result·=·current_value·static

39	===============================================================================	87	===============================================================================
40	·····Generated·by [doxygen]·1.9.8	88	·····Generated·by [doxygen]·1.9.8

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+accumulate_static.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·4#ifndef·DUNE_TYPETREE_PAIRTRAVERSAL_HH
+·4#ifndef·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
+·5#define·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
+·6
+·7#include·<dune/common/typetraits.hh>
+·8
+·8#include·<dune/typetree/nodeinterface.hh>
+·9#include·<dune/typetree/nodetags.hh>
+·10#include·<dune/typetree/treepath.hh>
+·11
+·12
+·12#include·<dune/typetree/visitor.hh>
+·13#include·<dune/typetree/traversal.hh>
+·14
+namespace·Dune·{
+·namespace·TypeTree·{
+·17
+·15
+·22·template<typename·result_type>
+·struct·or_
+·24·{
+·25·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·27·{
+·static·const·result_type·result·=·r1·||·r2;
+·29·};
+·30·};
+·31
+·33·template<typename·result_type>
+·struct·and_
+·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)
+·35·{
+·36·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·38·{
+·static·const·result_type·result·=·r1·&&·r2;
+·40·};
+·41·};
+·42
+·44·template<typename·result_type>
+·struct·plus
+·46·{
+·47·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·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·{
+·static·const·result_type·result·=·r1·+·r2;
+·51·};
+·52·};
+·53
+·55·template<typename·result_type>
+·struct·minus
+·57·{
+·58·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·60·{
+·static·const·result_type·result·=·r1·-·r2;
+·62·};
+·63·};
+·64
+·66·template<typename·result_type>
+·struct·multiply
+·68·{
+·69·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·71·{
+·static·const·result_type·result·=·r1·*·r2;
+·73·};
+·74·};
+·75
+·77·template<typename·result_type>
+·struct·min
+·79·{
+·80·template<result_type·r1,·result_type·r2>
+·struct·reduce
+·82·{
+·static·const·result_type·result·=·r1·<·r2·?·r1·:·r2;
+·84·};
+·85·};
+·86
+·88·template<typename·result_type>
+·struct·max
+·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<


Offset 7, 339 lines modified		Offset 7, 255 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	fi~~ltered~~compos~~ite~~node.hh	12	dynamicpowernode.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_FILTEREDCOMPOSITENODE_HH
18	·5#define·DUNE_TYPETREE_FI~~LTERED~~COMPOS~~ITE~~NODE_HH	17	·4#ifndef·DUNE_TYPETREE_DYNAMICPOWERNODE_HH
		18	·5#define·DUNE_TYPETREE_DYNAMICPOWERNODE_HH
19	·6	19	·6
		20	·7#include·<cassert>
		21	·8#include·<vector>
20	·7#include·<memory>	22	·9#include·<memory>
21	·8#include·<tuple>
22	·9#include·<type_traits>	23	·10#include·<type_traits>
		24	·11
23	·10
24	·11#include·<dune/typetree/nodetags.hh>
25	·12#include·<dune/typetree/filters.hh>
26	·13#include·<dune/common/shared_ptr.hh>
27	·14#include·<dune/common/typetraits.hh>	25	·12#include·<dune/common/typetraits.hh>
28	·15#include·<dune/common/indices.hh>	26	·13#include·<dune/common/std/type_traits.hh>
		27	·14
29	·16
30	·17#include·<dune/typetree/filters.hh>
31	·18#include·<dune/typetree/nodetags.hh>	28	·15#include·<dune/typetree/nodetags.hh>
32	·19	29	·16#include·<dune/typetree/utility.hh>
		30	·17#include·<dune/typetree/typetraits.hh>
		31	·18
33	·20namespace·Dune·{	32	·19namespace·Dune·{
34	·21·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
		34	·21
		35	·31·template<typename·T>
		36	32·class·DynamicPowerNode
35	·22
36	·28#ifndef·DOXYGEN
37	·29·namespace·{
38	·30
39	·31·/
40	/
41	********************************************************************************
42	·32·//·Utility·structs·for·filter·construction·and·application
43	·33·/	37	·33·{
44	/
45	********************************************************************************
46	·34	38	·34
		39	·35·public:
		40	·36
		41	38·static·const·bool·isLeaf·=·false;
		42	·39
		43	41·static·const·bool·isPower·=·true;
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;
55	·42	44	·42
		45	44·static·const·bool·isComposite·=·false;
		46	·45
		47	47·std::size_t·degree()·const
		48	·48·{
		49	·49·return·_children.size();
		50	·50·}
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>
64	·51·{	51	·51
		52	53·typedef·DynamicPowerNodeTag·NodeTag;
		53	·54
		54	56·typedef·T·ChildType;
		55	·57
		56	59·typedef·std::shared_ptr<T>·ChildStorageType;
65	·52·struct·type
66	·53·{
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	57	·60
74	·61·//·specialization·for·AdvancedFilter
75	·62·template<typename·Filter>
76	·63·st~~ruct·g~~et_filter<~~Fil~~t~~er,A~~dvan~~cedFilt~~e~~rTag>~~	58	62·typedef·std::shared_ptr<const·T>·ChildConstStorageType;
		59	·63
		60	65·typedef·std::vector<ChildStorageType>·NodeStorage;
		61	·66
		62	·67
		63	·70
		64	·72
		65	75·ChildType&·child·(std::size_t·i)
77	·64·{	66	·76·{
		67	·77·assert(i·<·degree()·&&·"child·index·out·of·range");
		68	·78·return·*_children[i];
		69	·79·}
		70	·80
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>
83	·70·{};
84	·71·};
85	·72·};
86	·73
87	·74·}·//·anonymous·namespace
88	·75#endif·//·DOXYGEN
89	·76
90	·77
91	·79·template<typename·Node,·typename·Filter>
92	80·class·FilteredCompositeNode
93	·81·{
94	·82	71	·82
Max diff block lines reached; 12868/17372 bytes (74.07%) of diff not shown.


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