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

⊟

3.4 MB

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

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

⊟

309 B

Files ¶

⊟

3.39 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.39 MB

data.tar.xz ¶

⊟

3.39 MB

data.tar ¶

⊟

19.9 KB

file list ¶

⊟

17.9 KB

⊟

3.37 KB

⊟

129 KB

⊟

22.1 KB

⊟

21.4 KB

⊟

4.17 KB

⊟

163 KB

⊟

28.3 KB

⊟

24.1 KB

⊟

4.33 KB

⊟

121 KB

⊟

20.9 KB

⊟

14.9 KB

⊟

3.07 KB

⊟

78.5 KB

⊟

14.2 KB

⊟

7.06 KB

⊟

1.33 KB

⊟

108 KB

⊟

22.3 KB

⊟

17.2 KB

⊟

3.14 KB

⊟

148 KB

⊟

25.4 KB

⊟

6.1 KB

⊟

1.02 KB

⊟

96.7 KB

⊟

17.1 KB

⊟

9.39 KB

⊟

1.49 KB

⊟

53.0 KB

⊟

7.98 KB

⊟

18.4 KB

⊟

3.47 KB

⊟

122 KB

⊟

21.9 KB

⊟

8.28 KB

⊟

1.65 KB

⊟

96.9 KB

⊟

17.4 KB

⊟

9.44 KB

⊟

1.67 KB

⊟

107 KB

⊟

19.0 KB

⊟

41.0 KB

⊟

9.51 KB

⊟

115 KB

⊟

19.2 KB

⊟

18.2 KB

⊟

3.09 KB

⊟

114 KB

⊟

19.7 KB

⊟

12.9 KB

⊟

2.48 KB

⊟

97.4 KB

⊟

16.5 KB

⊟

6.05 KB

⊟

958 B

⊟

10.1 KB

⊟

1.63 KB

⊟

16.0 KB

⊟

2.92 KB

⊟

71.3 KB

⊟

12.3 KB

⊟

9.56 KB

⊟

1.42 KB

⊟

23.7 KB

⊟

3.77 KB

⊟

19.3 KB

⊟

3.74 KB

⊟

71.4 KB

⊟

13.1 KB

⊟

45.0 KB

⊟

10.8 KB

⊟

175 KB

⊟

31.5 KB

⊟

11.1 KB

⊟

2.13 KB

⊟

75.1 KB

⊟

14.6 KB

⊟

9.46 KB

⊟

1.99 KB

⊟

78.7 KB

⊟

15.1 KB

⊟

5.8 KB

⊟

1.01 KB

⊟

68.4 KB

⊟

11.9 KB

⊟

26.7 KB

⊟

5.38 KB

⊟

133 KB

⊟

23.2 KB

⊟

7.91 KB

⊟

1.48 KB

⊟

146 KB

⊟

28.7 KB

⊟

24.1 KB

⊟

4.51 KB

⊟

142 KB

⊟

25.1 KB

⊟

9.58 KB

⊟

1.62 KB

⊟

72.8 KB

⊟

12.8 KB

⊟

7.68 KB

⊟

1.52 KB

⊟

19.7 KB

⊟

3.5 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	·b93~~ecfd2399~~b~~4af7def~~6fa~~80c674ff57~~·989~~872~~·doc·optional·libdune-typetree-doc_2.9.0-2_all.deb	2	·df63650f5d0fbd3b07a06ff4d79552cc·989664·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·····9~~700~~·2023-01-12·22:23:12.000000·control.tar.xz	2	-rw-r--r--···0········0········0·····9644·2023-01-12·22:23:12.000000·control.tar.xz
3	-rw-r--r--···0········0········0···979~~980~~·2023-01-12·22:23:12.000000·data.tar.xz	3	-rw-r--r--···0········0········0···979828·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)····~~·9727~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008.html	12	-rw-r--r--···0·root·········(0)·root·········(0)····10695·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)····69137·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html	13	-rw-r--r--···0·root·········(0)·root·········(0)····46415·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00008_source.html
14	-rw-r--r--···0·root·········(0)·root·········(0)····17252·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011.html
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
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
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
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
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
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	14	-rw-r--r--···0·root·········(0)·root·········(0)·····6194·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011.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	15	-rw-r--r--···0·root·········(0)·root·········(0)····69306·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00011_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
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
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	16	-rw-r--r--···0·root·········(0)·root·········(0)····15417·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014.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	17	-rw-r--r--···0·root·········(0)·root·········(0)····53082·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00014_source.html
38	-rw-r--r--···0·root·········(0)·root·········(0)····~~·560~~0·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047.html	18	-rw-r--r--···0·root·········(0)·root·········(0)····11110·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017.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	19	-rw-r--r--···0·root·········(0)·root·········(0)····55685·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00017_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	20	-rw-r--r--···0·root·········(0)·root·········(0)·····3694·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020.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	21	-rw-r--r--···0·root·········(0)·root·········(0)·····5507·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00020_source.html
42	-rw-r--r--···0·root·········(0)·root·········(0)····1~~0695~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053.html	22	-rw-r--r--···0·root·········(0)·root·········(0)····15004·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023.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	23	-rw-r--r--···0·root·········(0)·root·········(0)····98929·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00023_source.html
44	-rw-r--r--···0·root·········(0)·root·········(0)·····~~623~~3·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.html	24	-rw-r--r--···0·root·········(0)·root·········(0)·····5603·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00026.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	25	-rw-r--r--···0·root·········(0)·root·········(0)····39037·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)·····5149·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)····32272·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00029_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	28	-rw-r--r--···0·root·········(0)·root·········(0)·····4849·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032.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	29	-rw-r--r--···0·root·········(0)·root·········(0)·····8864·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00032_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	30	-rw-r--r--···0·root·········(0)·root·········(0)·····5600·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035.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	31	-rw-r--r--···0·root·········(0)·root·········(0)····46149·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00035_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	32	-rw-r--r--···0·root·········(0)·root·········(0)·····7208·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038.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	33	-rw-r--r--···0·root·········(0)·root·········(0)····27369·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00038_source.html
52	-rw-r--r--···0·root·········(0)·root·········(0)·····5~~125~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00068.html	34	-rw-r--r--···0·root·········(0)·root·········(0)·····5211·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041.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)····~~494~~40·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00071_source.html	35	-rw-r--r--···0·root·········(0)·root·········(0)·····6649·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00041_source.html
		36	-rw-r--r--···0·root·········(0)·root·········(0)·····5909·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)····49270·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00044_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	38	-rw-r--r--···0·root·········(0)·root·········(0)····11230·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047.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	39	-rw-r--r--···0·root·········(0)·root·········(0)····43051·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00047_source.html
58	-rw-r--r--···0·root·········(0)·root·········(0)·····~~560~~3·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077.html	40	-rw-r--r--···0·root·········(0)·root·········(0)·····6233·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00050.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
60	-rw-r--r--···0·root·········(0)·root·········(0)····15770·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html
61	-rw-r--r--···0·root·········(0)·root·········(0)····~~56207~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html	41	-rw-r--r--···0·root·········(0)·root·········(0)·····8874·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)·····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)····19928·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00053_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	44	-rw-r--r--···0·root·········(0)·root·········(0)·····7478·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00056.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	45	-rw-r--r--···0·root·········(0)·root·········(0)····17536·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)····15770·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)····56207·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00059_source.html
		48	-rw-r--r--···0·root·········(0)·root·········(0)····32652·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)····96059·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)·····7398·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)····41083·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00065_source.html
		52	-rw-r--r--···0·root·········(0)·root·········(0)·····8736·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)····57016·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)·····5125·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)····14382·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)····17252·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)····74924·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)·····6859·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)····87085·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00077_source.html
		60	-rw-r--r--···0·root·········(0)·root·········(0)·····9727·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080.html
		61	-rw-r--r--···0·root·········(0)·root·········(0)····69137·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00080_source.html
		62	-rw-r--r--···0·root·········(0)·root·········(0)·····6049·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00083.html
		63	-rw-r--r--···0·root·········(0)·root·········(0)····49440·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)·····5211·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086.html	64	-rw-r--r--···0·root·········(0)·root·········(0)·····6910·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)····~~·6649~~·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/a00086_source.html	65	-rw-r--r--···0·root·········(0)·root·········(0)····15552·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 372, 15 lines modified		Offset 372, 15 lines modified
372	-rw-r--r--···0·root·········(0)·root·········(0)·····3902·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3.html	372	-rw-r--r--···0·root·········(0)·root·········(0)·····3902·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3.html
373	-rw-r--r--···0·root·········(0)·root·········(0)·····2277·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3_dep.png	373	-rw-r--r--···0·root·········(0)·root·········(0)·····2277·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_04f2ecc425faf0d475a3caf484e551f3_dep.png
374	-rw-r--r--···0·root·········(0)·root·········(0)·····3675·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e69be5995c9f5d42bf491ae6f29600e.html	374	-rw-r--r--···0·root·········(0)·root·········(0)·····3675·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e69be5995c9f5d42bf491ae6f29600e.html
375	-rw-r--r--···0·root·········(0)·root·········(0)····13066·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9.html	375	-rw-r--r--···0·root·········(0)·root·········(0)····13066·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9.html
376	-rw-r--r--···0·root·········(0)·root·········(0)·····2105·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9_dep.png	376	-rw-r--r--···0·root·········(0)·root·········(0)·····2105·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_5e74c06688912037f4b476b8dc05fab9_dep.png
377	-rw-r--r--···0·root·········(0)·root·········(0)·····3671·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_e68e8157741866f444e17edd764ebbae.html	377	-rw-r--r--···0·root·········(0)·root·········(0)·····3671·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dir_e68e8157741866f444e17edd764ebbae.html
378	-rw-r--r--···0·root·········(0)·root·········(0)····45631·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doxygen.css	378	-rw-r--r--···0·root·········(0)·root·········(0)····45631·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/doxygen.css
379	-rw-r--r--···0·root·········(0)·root·········(0)····23460·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dune-typetree.tag.gz	379	-rw-r--r--···0·root·········(0)·root·········(0)····23462·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dune-typetree.tag.gz
380	-rw-r--r--···0·root·········(0)·root·········(0)·····7704·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dynsections.js	380	-rw-r--r--···0·root·········(0)·root·········(0)·····7704·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/dynsections.js
381	-rw-r--r--···0·root·········(0)·root·········(0)····12258·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/files.html	381	-rw-r--r--···0·root·········(0)·root·········(0)····12258·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/files.html
382	-rw-r--r--···0·root·········(0)·root·········(0)·····3440·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions.html	382	-rw-r--r--···0·root·········(0)·root·········(0)·····3440·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions.html
383	-rw-r--r--···0·root·········(0)·root·········(0)·····3959·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_b.html	383	-rw-r--r--···0·root·········(0)·root·········(0)·····3959·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_b.html
384	-rw-r--r--···0·root·········(0)·root·········(0)·····7406·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_c.html	384	-rw-r--r--···0·root·········(0)·root·········(0)·····7406·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_c.html
385	-rw-r--r--···0·root·········(0)·root·········(0)·····6084·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_d.html	385	-rw-r--r--···0·root·········(0)·root·········(0)·····6084·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_d.html
386	-rw-r--r--···0·root·········(0)·root·········(0)·····3514·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_e.html	386	-rw-r--r--···0·root·········(0)·root·········(0)·····3514·2023-01-12·22:23:12.000000·./usr/share/doc/libdune-typetree-doc/doxygen/functions_e.html


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:·~~pro~~x~~ynode~~.hh·File·Reference</title>	8	<title>dune-typetree:·childextraction.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 70, 61 lines modified		Offset 70, 66 lines modified
70	<div·id="nav-path"·class="navpath">	70	<div·id="nav-path"·class="navpath">
71	··<ul>	71	··<ul>
72	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	72	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
73	</div>	73	</div>
74	</div><!--·top·-->	74	</div><!--·top·-->
75	<div·class="header">	75	<div·class="header">
76	··<div·class="summary">	76	··<div·class="summary">
77	<a·href="#nested-classes">Classes</a>·\|
78	<a·href="#namespaces">Namespaces</a>··~~</div>~~	77	<a·href="#namespaces">Namespaces</a>·\|
		78	<a·href="#typedef-members">Typedefs</a>·\|
		79	<a·href="#func-members">Functions</a>··</div>
79	··<div·class="headertitle"><div·class="title">~~pro~~x~~ynode~~.hh·File·Reference</div></div>	80	··<div·class="headertitle"><div·class="title">childextraction.hh·File·Reference</div></div>
80	</div><!--header-->	81	</div><!--header-->
81	<div·class="contents">	82	<div·class="contents">
82	<div·class="textblock"><code>#include·<type_traits></code><br·/>	83	<div·class="textblock"><code>#include·<type_traits></code><br·/>
83	<code>#include·<<a·class="el"·href="a00029_source.html">dune/typetree/nodeinterface.hh</a>></code><br·/>
84	<code>#include·<~~<a·class="el"·href="a00056_so~~u~~rce.h~~tml~~">dune~~/ty~~petree/nodetags.hh</a>~~></code><br·/>	84	<code>#include·<utility></code><br·/>
		85	<code>#include·<dune/common/concept.hh></code><br·/>
		86	<code>#include·<dune/common/documentation.hh></code><br·/>
		87	<code>#include·<dune/common/typetraits.hh></code><br·/>
85	<code>#include·<dune/common/shared_ptr.hh></code><br·/>	88	<code>#include·<dune/common/shared_ptr.hh></code><br·/>
86	<code>#include·<dune/common/indices.hh></code><br·/>
87	<code>#include·<~~dun~~e/co~~mmon/s~~td/type_traits.hh></code><br·/>	89	<code>#include·<<a·class="el"·href="a00053_source.html">dune/typetree/nodeinterface.hh</a>></code><br·/>
		90	<code>#include·<<a·class="el"·href="a00062_source.html">dune/typetree/treepath.hh</a>></code><br·/>
88	</div>	91	</div>
89	<p><a·href="a00008_source.html">Go·to·the·source·code·of·this·file.</a></p>	92	<p><a·href="a00008_source.html">Go·to·the·source·code·of·this·file.</a></p>
90	<table·class="memberdecls">	93	<table·class="memberdecls">
91	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>
92	Classes</h2></td></tr>
93	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01299.html">Dune::TypeTree::StaticChildAccessors<·ProxiedNode·></a></td></tr>
94	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Mixin·class·providing·methods·for·child·access·with·compile-time·parameter.··<a·href="a01299.html#details">More...</a><br·/></td></tr>
95	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
96	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01307.html">Dune::TypeTree::StaticChildAccessors<·ProxiedNode·>::Child<·k·></a></td></tr>
97	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Access·to·the·type·and·storage·type·of·the·i-th·child.··<a·href="a01307.html#details">More...</a><br·/></td></tr>
98	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
99	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01311.html">Dune::TypeTree::DynamicChildAccessors<·ProxiedNode·></a></td></tr>
100	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Mixin·class·providing·methods·for·child·access·with·run-time·parameter.··<a·href="a01311.html#details">More...</a><br·/></td></tr>
101	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
102	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01319.html">Dune::TypeTree::ProxyNodeBase<·Node,·LeafNodeTag·></a></td></tr>
103	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01239.html"·title="Base·class·for·leaf·nodes·in·a·dune-typetree.">LeafNode</a>.··<a·href="a01319.html#details">More...</a><br·/></td></tr>
104	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
105	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01323.html">Dune::TypeTree::ProxyNodeBase<·Node,·CompositeNodeTag·></a></td></tr>
106	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01075.html"·title="Base·class·for·composite·nodes·based·on·variadic·templates.">CompositeNode</a>.··<a·href="a01323.html#details">More...</a><br·/></td></tr>
107	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
108	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01327.html">Dune::TypeTree::ProxyNodeBase<·Node,·PowerNodeTag·></a></td></tr>
109	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01287.html"·title="Collect·k·instances·of·type·T·within·a·dune-typetree.">PowerNode</a>.··<a·href="a01327.html#details">More...</a><br·/></td></tr>
110	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
111	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">struct· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01331.html">Dune::TypeTree::ProxyNodeBase<·Node,·DynamicPowerNodeTag·></a></td></tr>
112	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a01295.html"·title="Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.">ProxyNode</a>·base·class·for·<a·class="el"·href="a01083.html"·title="Collect·multiple·instances·of·type·T·within·a·dune-typetree.">DynamicPowerNode</a>.··<a·href="a01331.html#details">More...</a><br·/></td></tr>
113	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
114	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a01295.html">Dune::TypeTree::ProxyNode<·Node·></a></td></tr>
115	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight">Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.··<a·href="a01295.html#details">More...</a><br·/></td></tr>
116	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
117	</table><table·class="memberdecls">
118	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="namespaces"·name="namespaces"></a>	94	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="namespaces"·name="namespaces"></a>
119	Namespaces</h2></td></tr>	95	Namespaces</h2></td></tr>
120	<tr·class="memitem:a00097"·id="r_a00097"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00097.html">Dune</a></td></tr>	96	<tr·class="memitem:a00097"·id="r_a00097"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00097.html">Dune</a></td></tr>
121	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>	97	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
122	<tr·class="memitem:a00098"·id="r_a00098"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00098.html">Dune::TypeTree</a></td></tr>	98	<tr·class="memitem:a00098"·id="r_a00098"><td·class="memItemLeft"·align="right"·valign="top">namespace· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a00098.html">Dune::TypeTree</a></td></tr>
123	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>	99	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>
		100	</table><table·class="memberdecls">
		101	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="typedef-members"·name="typedef-members"></a>
		102	Typedefs</h2></td></tr>
		103	<tr·class="memitem:ga8136d392450f4308b90a04a143e20feb"·id="r_ga8136d392450f4308b90a04a143e20feb"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·std::size_t...·indices>·</td></tr>
		104	<tr·class="memitem:ga8136d392450f4308b90a04a143e20feb"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga8136d392450f4308b90a04a143e20feb">Dune::TypeTree::Child</a>·=·typename·impl::_Child<·Node,·indices...·>::type</td></tr>
		105	<tr·class="memdesc:ga8136d392450f4308b90a04a143e20feb"><td·class="mdescLeft"> </td><td·class="mdescRight">Template·alias·for·the·type·of·a·child·node·given·by·a·list·of·child·indices.··<br·/></td></tr>
		106	<tr·class="separator:ga8136d392450f4308b90a04a143e20feb"><td·class="memSeparator"·colspan="2"> </td></tr>
		107	<tr·class="memitem:gac7126c2c9df855877ce3e71c77738398"·id="r_gac7126c2c9df855877ce3e71c77738398"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename·<a·class="el"·href="a00094.html#gae8b7332de9e11aaed628b9b1e52384d3">TreePath</a>·>·</td></tr>
		108	<tr·class="memitem:gac7126c2c9df855877ce3e71c77738398"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gac7126c2c9df855877ce3e71c77738398">Dune::TypeTree::ChildForTreePath</a>·=·typename·impl::_ChildForTreePath<·Node,·<a·class="el"·href="a00094.html#gae8b7332de9e11aaed628b9b1e52384d3">TreePath</a>·>::type</td></tr>
		109	<tr·class="memdesc:gac7126c2c9df855877ce3e71c77738398"><td·class="mdescLeft"> </td><td·class="mdescRight">Template·alias·for·the·type·of·a·child·node·given·by·a·TreePath·or·a·<a·class="el"·href="a01383.html"·title="A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run·time·indices.">HybridTreePath</a>·type.··<br·/></td></tr>
		110	<tr·class="separator:gac7126c2c9df855877ce3e71c77738398"><td·class="memSeparator"·colspan="2"> </td></tr>
		111	<tr·class="memitem:ga5832a3bb33ab6b058aee3b201699584a"·id="r_ga5832a3bb33ab6b058aee3b201699584a"><td·class="memTemplParams"·colspan="2">template<typename·T·>·</td></tr>
		112	<tr·class="memitem:ga5832a3bb33ab6b058aee3b201699584a"><td·class="memTemplItemLeft"·align="right"·valign="top">using </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga5832a3bb33ab6b058aee3b201699584a">Dune::TypeTree::is_flat_index</a>·=·typename·impl::_is_flat_index<·std::decay_t<·T·>·>::type</td></tr>
		113	<tr·class="memdesc:ga5832a3bb33ab6b058aee3b201699584a"><td·class="mdescLeft"> </td><td·class="mdescRight">Type·trait·that·determines·whether·T·is·a·flat·index·in·the·context·of·child·extraction.··<br·/></td></tr>
		114	<tr·class="separator:ga5832a3bb33ab6b058aee3b201699584a"><td·class="memSeparator"·colspan="2"> </td></tr>
		115	</table><table·class="memberdecls">
		116	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="func-members"·name="func-members"></a>
		117	Functions</h2></td></tr>
		118	<tr·class="memitem:gab8f2fef526363564e7bbe91daad49b9b"·id="r_gab8f2fef526363564e7bbe91daad49b9b"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
		119	<tr·class="memitem:gab8f2fef526363564e7bbe91daad49b9b"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gab8f2fef526363564e7bbe91daad49b9b">Dune::TypeTree::child</a>·(Node·&&node,·Indices...·indices)</td></tr>
		120	<tr·class="memdesc:gab8f2fef526363564e7bbe91daad49b9b"><td·class="mdescLeft"> </td><td·class="mdescRight">Extracts·the·child·of·a·node·given·by·a·sequence·of·compile-time·and·run-time·indices.··<br·/></td></tr>
		121	<tr·class="separator:gab8f2fef526363564e7bbe91daad49b9b"><td·class="memSeparator"·colspan="2"> </td></tr>
		122	<tr·class="memitem:ga6d60a84ddd0be65b0cae4a5e6032a52a"·id="r_ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
		123	<tr·class="memitem:ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#ga6d60a84ddd0be65b0cae4a5e6032a52a">Dune::TypeTree::childStorage</a>·(Node·&&node,·Indices...·indices)</td></tr>
		124	<tr·class="separator:ga6d60a84ddd0be65b0cae4a5e6032a52a"><td·class="memSeparator"·colspan="2"> </td></tr>
		125	<tr·class="memitem:gae4133f4dba113143455fcab49d8a103e"·id="r_gae4133f4dba113143455fcab49d8a103e"><td·class="memTemplParams"·colspan="2">template<typename·Node·,·typename...·Indices>·</td></tr>
		126	<tr·class="memitem:gae4133f4dba113143455fcab49d8a103e"><td·class="memTemplItemLeft"·align="right"·valign="top">ImplementationDefined </td><td·class="memTemplItemRight"·valign="bottom"><a·class="el"·href="a00092.html#gae4133f4dba113143455fcab49d8a103e">Dune::TypeTree::child</a>·(Node·&&node,·<a·class="el"·href="a01383.html">HybridTreePath</a><·Indices...·>·<a·class="el"·href="a00094.html#gabaa23047e2968add67b9fdb146142217">treePath</a>)</td></tr>
		127	<tr·class="memdesc:gae4133f4dba113143455fcab49d8a103e"><td·class="mdescLeft"> </td><td·class="mdescRight">Extracts·the·child·of·a·node·given·by·a·<a·class="el"·href="a01383.html"·title="A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run·time·indices.">HybridTreePath</a>·object.··<br·/></td></tr>
		128	<tr·class="separator:gae4133f4dba113143455fcab49d8a103e"><td·class="memSeparator"·colspan="2"> </td></tr>
124	</table>	129	</table>
125	</div><!--·contents·-->	130	</div><!--·contents·-->
126	<!--·start·footer·part·-->	131	<!--·start·footer·part·-->
127	<hr·class="footer"/><address·class="footer"><small>	132	<hr·class="footer"/><address·class="footer"><small>
128	Generated·by <a·href="https://www.doxygen.org/index.html"><img·class="footer"·src="doxygen.svg"·width="104"·height="31"·alt="doxygen"/></a>·1.9.8	133	Generated·by <a·href="https://www.doxygen.org/index.html"><img·class="footer"·src="doxygen.svg"·width="104"·height="31"·alt="doxygen"/></a>·1.9.8
129	</small></address>	134	</small></address>
130	</body>	135	</body>


Offset 6, 51 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
13	~~proxynod~~e~~.hh~~·~~Fil~~e·Ref~~ere~~nce	12	Namespaces·\|·Typedefs·\|·Functions
		13	childextraction.hh·File·Reference
14	#include·<type_traits>	14	#include·<type_traits>
15	#include·<du~~ne/type~~t~~ree/no~~deint~~erface.h~~h>	15	#include·<utility>
		16	#include·<dune/common/concept.hh>
		17	#include·<dune/common/documentation.hh>
16	#include·<dune/ty~~petree~~/~~nod~~etags.hh>	18	#include·<dune/common/typetraits.hh>
17	#include·<dune/common/shared_ptr.hh>	19	#include·<dune/common/shared_ptr.hh>
18	#include·<dune/common/indices.hh>
19	#include·<dune/~~common~~/std~~/typ~~e_tr~~aits~~.hh>	20	#include·<dune/typetree/nodeinterface.hh>
		21	#include·<dune/typetree/treepath.hh>
20	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
21	·Classes
22	·class· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>
23	·······Mixin·class·providing·methods·for·child·access·with·compile-time
24	·········parameter.·More...
25
26	struct· Dune::TypeTree::StaticChildAccessors<_ProxiedNode_>::Child<_k_>
27	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
28
29	·class· Dune::TypeTree::DynamicChildAccessors<_ProxiedNode_>
30	·······Mixin·class·providing·methods·for·child·access·with·run-time
31	·········parameter.·More...
32
33	struct· Dune::TypeTree::ProxyNodeBase<_Node,_LeafNodeTag_>
34	·······ProxyNode·base·class·for·LeafNode.·More...
35
36	struct· Dune::TypeTree::ProxyNodeBase<_Node,_CompositeNodeTag_>
37	·······ProxyNode·base·class·for·CompositeNode.·More...
38
39	struct· Dune::TypeTree::ProxyNodeBase<_Node,_PowerNodeTag_>
40	·······ProxyNode·base·class·for·PowerNode.·More...
41
42	struct· Dune::TypeTree::ProxyNodeBase<_Node,_DynamicPowerNodeTag_>
43	·······ProxyNode·base·class·for·DynamicPowerNode.·More...
44
45	·class· Dune::TypeTree::ProxyNode<_Node_>
46	·······Base·class·for·nodes·acting·as·a·proxy·for·an·existing·node.·More...
47
48	·Namespaces	23	·Namespaces
49	namespace· Dune	24	namespace· Dune
50		25
51	namespace· Dune::TypeTree	26	namespace· Dune::TypeTree
52		27
		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.
		33
		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.
		45
		46	·Functions
		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.
		51
		52	template<typename·Node·,·typename...·Indices>
		53	ImplementationDefined Dune::TypeTree::childStorage·(Node·&&node,·Indices...
		54	·······················indices)
		55
		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.
		61

53	===============================================================================	62	===============================================================================
54	·····Generated·by [doxygen]·1.9.8	63	·····Generated·by [doxygen]·1.9.8


Offset 7, 462 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	~~pro~~x~~ynode~~.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_PROXYNODE_HH
18	·5#define·DUNE_TYPETREE_~~PRO~~X~~YNODE~~_HH	17	·4#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_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·<dune/typetree/nodeinterface.hh>
22	·9#include·<du~~ne/type~~t~~ree/node~~t~~ags.h~~h>	21	·8#include·<utility>
		22	·9
		23	·10#include·<dune/common/concept.hh>
		24	·11#include·<dune/common/documentation.hh>
		25	·12#include·<dune/common/typetraits.hh>
23	·10#include·<dune/common/shared_ptr.hh>	26	·13#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	·14
		28	·15#include·<dune/typetree/nodeinterface.hh>
		29	·16#include·<dune/typetree/treepath.hh>
		30	·17
		31	·18
27	·14namespace·Dune·{	32	·19namespace·Dune·{
28	·15·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
		34	·21
		35	·26
		36	·27#ifndef·DOXYGEN
29	·16
30	·22·template<typename·Node>
31	·23·class·ProxyNode;
32	·24
33	·26·template<typename·ProxiedNode>
34	27·class·StaticChildAccessors
35	·28·{	37	·28
		38	·29·namespace·Impl·{
		39	·30
		40	·31·//·check·at·run·time·whether·index·is·a·valid·child·index
		41	·32·template·<class·Node,·class·Index>
		42	·33·std::true_type·checkChildIndex·(Node·const&·node,·Index·i)
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	·34·{
43	·35·static·const·bool·value·=·!proxiedNodeIsConst;
44	·36·};	44	·35·assert(std::size_t(i)·<·node.degree()·&&·"Child·index·out·of·range");
		45	·36·return·{};
45	·37	46	·37·}
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·~~()	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>)
51	·43·{	52	·42·{
52	·4~~4·retur~~n·static_cast<Node&>(*this);	53	·43·static_assert(i·<·Node::degree(),·"Child·index·out·of·range");
		54	·44·return·{};
53	·45·}	55	·45·}
54	·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.
		60	·49·template<class·Node>
		61	·50·decltype(auto)·childImpl·(Node&&·node)
55	·47·const·Node&·node·()·const
56	·48·{
57	·49·return·static_cast<const·Node&>(*this);
58	·50·}
59	·51
60	·52·public:
61	·53
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>·=·{})
72	·70·{
73	·71·return·node().proxiedNode().template·child<k>();
74	·72·}
75	·73
76	·75
77	·78·template<std::size_t·k>
78	79·const·auto&·child·(index_constant<k>·=·{})·const
79	·80·{
80	·81·return·node().proxiedNode().template·child<k>();
81	·82·}
82	·83
83	·85
84	·88·template<std::size_t·k,
85	·89·typename·std::enable_if<lazy_enabled<k>::value,·int>::type·=·0>
86	90·auto·childStorage·(index_constant<k>·=·{})
87	·91·{	62	·51·{
88	·92·return·node~~().p~~r~~oxied~~Nod~~e().templat~~e~~·childSt~~orage~~<k>(~~);	63	·52·return·std::forward<Node>(node);
89	·93·}	64	·53·}
90	·94	65	·54
		66	·55·template<class·NodePtr>
		67	·56·auto·childStorageImpl·(NodePtr&&·nodePtr)
		68	·57·{
		69	·58·return·std::forward<NodePtr>(nodePtr);
		70	·59·}
		71	·60
		72	·61·//·recursively·call·`node.child(...)`·with·the·given·indices
		73	·62·template<class·Node,·class·I0,·class...·I>
		74	·63·decltype(auto)·childImpl·(Node&&·node,·I0·i0,·[[maybe_unused]]·I...·i)
		75	·64·{
		76	·65·auto·valid·=·checkChildIndex(node,i0);
		77	·66·if·constexpr·(valid)
		78	·67·return·childImpl(node.child(i0),i...);
Max diff block lines reached; 17453/22561 bytes (77.36%) of diff not shown.

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces
+powernode.hh·File·Reference
+#include·<cassert>
+#include·<array>
+#include·<memory>
+#include·<type_traits>
+#include·<dune/common/typetraits.hh>
+#include·<dune/common/std/type_traits.hh>
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/typetree/utility.hh>
+#include·<dune/typetree/childextraction.hh>
+#include·<dune/typetree/typetraits.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+struct· Dune::TypeTree::DefaultVisitor
+·class· Dune::TypeTree::PowerNode<_T,_k_>
+ ·······Collect·k·instances·of·type·T·within·a·dune-typetree.·More...
+struct· Dune::TypeTree::PowerNode<_T,_k_>::Child<_i_>
+ ·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
+struct· Dune::TypeTree::DefaultPairVisitor
+ ·······Visitor·interface·and·base·class·for·visitors·of·pairs·of·TypeTrees.
+·········More...
+struct· Dune::TypeTree::Experimental::DefaultHybridVisitor
+ ·······Hybrid·visitor·interface·and·base·class·for·TypeTree·hybrid·visitors.
+·········More...
+struct· Dune::TypeTree::VisitDirectChildren
+ ·······Mixin·base·class·for·visitors·that·only·want·to·visit·the·direct
+·········children·of·a·node.·More...
+struct· Dune::TypeTree::VisitDirectChildren::VisitChild<_Node1,_Child1,_Node2,
+·········Child2,_TreePath_>
+ ·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
+·········More...
+struct· Dune::TypeTree::VisitTree
+ ·······Mixin·base·class·for·visitors·that·want·to·visit·the·complete·tree.
+·········More...
+struct· Dune::TypeTree::VisitTree::VisitChild<_Node1,_Child1,_Node2,_Child2,
+·········TreePath_>
+ ·······Template·struct·for·determining·whether·or·not·to·visit·a·given·child.
+·········More...
+struct· Dune::TypeTree::StaticTraversal
+ ·······Mixin·base·class·for·visitors·that·require·a·static·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::DynamicTraversal
+ ·······Mixin·base·class·for·visitors·that·only·need·a·dynamic·TreePath·during
+·········traversal.·More...
+struct· Dune::TypeTree::TreeVisitor
+ ·······Convenience·base·class·for·visiting·the·entire·tree.·More...
+struct· Dune::TypeTree::DirectChildrenVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node.
+·········More...
+struct· Dune::TypeTree::TreePairVisitor
+ ·······Convenience·base·class·for·visiting·an·entire·tree·pair.·More...
+struct· Dune::TypeTree::DirectChildrenPairVisitor
+ ·······Convenience·base·class·for·visiting·the·direct·children·of·a·node
+·········pair.·More...
+struct· Dune::TypeTree::Experimental::Info::LeafCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::NodeCounterVisitor
+struct· Dune::TypeTree::Experimental::Info::DepthVisitor
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+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


Offset 7, 484 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	~~visit~~or.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_~~VISIT~~OR_HH	17	·4#ifndef·DUNE_TYPETREE_POWERNODE_HH
18	·5#define·DUNE_TYPETREE_~~VISIT~~OR_HH	18	·5#define·DUNE_TYPETREE_POWERNODE_HH
19	·6	19	·6
		20	·7#include·<cassert>
		21	·8#include·<array>
		22	·9#include·<memory>
		23	·10#include·<type_traits>
		24	·11
		25	·12#include·<dune/common/typetraits.hh>
		26	·13#include·<dune/common/std/type_traits.hh>
		27	·14
20	·7#include·<dune/typetree/~~tre~~epath.hh>	28	·15#include·<dune/typetree/nodetags.hh>
21	·8#include·<dune/typetree/utility.hh>	29	·16#include·<dune/typetree/utility.hh>
		30	·17#include·<dune/typetree/childextraction.hh>
		31	·18#include·<dune/typetree/typetraits.hh>
22	·9
23	·10namespace·Dune·{
24	·11·namespace·TypeTree·{
25	·12
26	·19	32	·19
27	46·struct·DefaultVisitor
28	·47·{
29	·48	33	·20namespace·Dune·{
		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
		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#endif
		48	·42
		49	·48·template<typename·T,·std::size_t·k>
		50	49·class·PowerNode
30	·50	51	·50·{
31	·57·template<typename·T,·typename·TreePath>
32	~~58·void·pre(T&&,·TreePath)·const~~·{}	52	·51
		53	·52·public:
		54	·53
		55	55·static·const·bool·isLeaf·=·false;
		56	·56
		57	58·static·const·bool·isPower·=·true;
33	·59	58	·59
34	·61
35	·69·template<typename·T,·typename·TreePath>
36	70·void·in~~(T&&,~~·~~TreePath)~~·~~const·{}~~	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·static·constexpr·auto·degree·()
		65	·68·{
		66	·69·return·std::integral_constant<std::size_t,k>{};
		67	·70·}
37	·71	68	·71
38	·73
39	·80·template<typename·T,·typename·TreePath>
40	81·void·post(T&&,·TreePath)·const·{}
41	·82
42	·84
43	·90·template<typename·T,·typename·TreePath>
44	91·void·leaf(T&&,·TreePath)·const·{}
45	·92
46	·94
47	·104·template<typename·T,·typename·Child,·typename·TreePath,·typename
48	ChildIndex>
49	~~105·vo~~id·be~~for~~e~~Chil~~d~~(T&~~&,·~~Child&&,·Tre~~ePath,·~~Child~~Inde~~x)·const·{}~~	69	73·typedef·PowerNodeTag·NodeTag;
		70	·74
		71	76·typedef·T·ChildType;
		72	·77
		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·{
		79	·86
		80	·87·static_assert((i·<·degree()),·"child·index·out·of·range");
		81	·88
		82	90·typedef·T·Type;
		83	·91
		84	93·typedef·T·type;
		85	·94·};
		86	·95
		87	·98
50	·106	88	·100
		89	·103·template<std::size_t·i>
		90	104·T&·child·(index_constant<i>·=·{})
		91	·105·{
		92	·106·static_assert((i·<·degree()),·"child·index·out·of·range");
		93	·107·return·*_children[i];
51	·108	94	·108·}
		95	·109
52	·119·template<typename·T,·typename·Child,·typename·TreePath,·typename
53	ChildIndex>
54	120·void·afterChild(T&&,·Child&&,·TreePath,·ChildIndex)·const·{}
55	·121	96	·111
56	·122·};	97	·114·template<std::size_t·i>
		98	115·const·T&·child·(index_constant<i>·=·{})·const
		99	·116·{
		100	·117·static_assert((i·<·degree()),·"child·index·out·of·range");
		101	·118·return·*_children[i];
		102	·119·}
57	·123	103	·120
58	·124	104	·122
		105	·125·template<std::size_t·i>
		106	126·std::shared_ptr<T>·childStorage·(index_constant<i>·=·{})
		107	·127·{
		108	·128·static_assert((i·<·degree()),·"child·index·out·of·range");
Max diff block lines reached; 24725/28905 bytes (85.54%) of diff not shown.


Offset 6, 64 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·\|·~~Typedefs·\|·~~Functions	12	Classes·\|·Namespaces·\|·Functions
13	treecontainer.hh·File·Reference	13	typetraits.hh·File·Reference
14	#include·<type_traits>	14	#include·<type_traits>
15	#include·<utility>
16	#include·<functional>
17	#include·<array>
18	#include·<dune/common/indices.hh>
19	#include·<dune/common/hybridutilities.hh>
20	#include·<dune/common/rangeutilities.hh>
21	#include·<dune/common/tuple~~vector~~.hh>	15	#include·<dune/common/typetraits.hh>
22	#include·<dune/typetree/treepath.hh>	16	#include·<dune/typetree/treepath.hh>
		17	#include·<dune/typetree/nodeinterface.hh>
23	Go_to_the_source_code_of_this_file.	18	Go_to_the_source_code_of_this_file.
24	·Classes	19	·Classes
25	~~·class~~· Dune::~~Typ~~eTr~~ee::D~~et~~ail::Co~~ntaine~~rFactory~~<_~~Leaf~~T~~oValue~~_>	20	struct· Dune::first_type<_T0,_T..._>
26		21
27	~~·class~~· Dune::TypeTree::Deta~~il::TreeCont~~ain~~erVect~~o~~rBacken~~d<_~~Con~~ta~~iner~~_>	22	struct· Dune::TypeTree::has_node_tag<_T_>
28		23
29	struct· Dune::TypeTree::Deta~~il::LeafT~~oDe~~faultConstru~~ct~~ibleV~~alue<_~~Leaf~~T~~oValu~~e_>	24	struct· Dune::TypeTree::has_node_tag<_T_>::yes
		25
		26	struct· Dune::TypeTree::has_node_tag<_T_>::no
		27
		28	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>
		29
		30	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::maybe<_N_>
		31
		32	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::yes
		33
		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...
30		67
31	·Namespaces	68	·Namespaces
32	namespace· Dune	69	namespace· Dune
33		70
34	namespace· Dune::TypeTree	71	namespace· Dune::TypeTree
35		72
36	namespace· Dune::TypeTree::De~~tai~~l	73	namespace· Dune::TypeTree::impl
37
38	·Typedefs
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
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·using·LeafToValue·to·create·values.
51		74
52	·Functions	75	·Functions
53	template<class·Container·>
54	auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
55	~~······&&co~~n~~tainer)~~	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.
56		80
		81	constexpr·auto Dune::TypeTree::impl::isTreePath·(void·*)·->·std::false_type
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		82
62	template<class·Value·,·class·Tree·>
63	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
64	~~····Create·con~~t~~ain~~e~~r·h~~a~~vin·~~t~~he·sam~~e~~·str~~uc~~ture~~·as~~·the·given~~·~~tre~~e.	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.
65		90

66	===============================================================================	91	===============================================================================
67	·····Generated·by [doxygen]·1.9.8	92	·····Generated·by [doxygen]·1.9.8


Offset 7, 365 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	treecontainer.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_TREECONTAINER_HH	17	·4#ifndef·DUNE_TYPETREE_TYPETRAITS_HH
18	·5#define·DUNE_TYPETREE_TREECONTAINER_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·<utility>
22	·9#include·<functional>
23	·10#include·<array>
24	·11
25	·12#include·<dune/common/indices.hh>
26	·13#include·<dune/common/hybridutilities.hh>
27	·14#include·<dune/common/rangeutilities.hh>
28	·15#include·<dune/common/tuple~~vector~~.hh>	21	·8#include·<dune/common/typetraits.hh>
29	·16	22	·9
30	·17#include·<dune/typetree/treepath.hh>	23	·10#include·<dune/typetree/treepath.hh>
31	·18	24	·11#include·<dune/typetree/nodeinterface.hh>
		25	·12
32	·19namespace·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
33	·20·namespace·TypeTree·{	40	·27·namespace·TypeTree·{
		41	·28
		42	·29·template<typename·T>
		43	30·struct·has_node_tag
34	·21
35	·22·namespace·Detail·{
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·{	44	·31·{
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()>~~{~~},·t~~ru~~e))~~;	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(...);
		52	·39
		53	41·constexpr·static·bool·value·=·sizeof(test<T>(0))·==·sizeof(yes);
		54	·42·};
64	·43	55	·43
		56	·44·template<typename·T,·typename·V>
		57	45·struct·has_node_tag_value
65	·44·template<class·N>
66	·45·using·DynamicChildAccessConcept·=·decltype((std::declval<N>().child(0u),
67	true));
68	·46
69	·47·public:
70	·48
71	56·ContainerFactory(LeafToValue·leafToValue)·:
72	·57·leafToValue_(leafToValue)
73	·58·{}
74	·59
75	·60·template<class·Node>
76	61·auto·operator()(const·Node&·node)
77	·62·{	58	·46·{
78	·~~63·retu~~rn·(*t~~his)(nod~~e~~,·Dun~~e~~::P~~riorit~~yTag~~<5>~~{});~~	59	·47·template<int·N>
		60	48·struct·maybe·{·char·dummy[N+1];·};
		61	49·struct·yes·{·char·dummy[2];·};
		62	50·struct·no·{·char·dummy[1];·};
		63	·51
		64	·52·template<typename·X>
		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
79	·64·}	75	·64·{
80	·65
81	·66·pr~~ivate:~~	76	65·struct·yes·{·char·dummy[1];·};
		77	66·struct·no·{·char·dummy[2];·};
82	·67	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
Max diff block lines reached; 17129/21344 bytes (80.25%) of diff not shown.


Offset 6, 39 lines modified		Offset 6, 64 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
13	powercompositenodetransformationtemplates.hh·File·Reference
14	~~#includ~~e·<cstddef>	12	Classes·\|·Namespaces·\|·Typedefs·\|·Functions
		13	treecontainer.hh·File·Reference
		14	#include·<type_traits>
		15	#include·<utility>
		16	#include·<functional>
		17	#include·<array>
		18	#include·<dune/common/indices.hh>
		19	#include·<dune/common/hybridutilities.hh>
		20	#include·<dune/common/rangeutilities.hh>
		21	#include·<dune/common/tuplevector.hh>
15	#include·<dune/typetree/node~~int~~erface.hh>	22	#include·<dune/typetree/treepath.hh>
16	Go_to_the_source_code_of_this_file.	23	Go_to_the_source_code_of_this_file.
17	·Classes	24	·Classes
		25	·class· Dune::TypeTree::Detail::ContainerFactory<_LeafToValue_>
18	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
19	·········Transformation,_TransformedNode_>
20		26
		27	·class· Dune::TypeTree::Detail::TreeContainerVectorBackend<_Container_>
21	struct· Dune::TypeTree::GenericPowerNodeTransformationTemplate<_SourceNode,
22	·········Transformation,_TransformedNode_>::result<_TC_>
23		28
		29	struct· Dune::TypeTree::Detail::LeafToDefaultConstructibleValue<_LeafToValue_>
24	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
25	·········SourceNode,_Transformation,_TransformedNode_>
26
27	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformationTemplate<
28	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
29
30	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
31	·········SourceNode,_Transformation,_TransformedNode_>
32
33	struct· Dune::TypeTree::GenericCompositeNodeTransformationTemplate<
34	·········SourceNode,_Transformation,_TransformedNode_>::result<_TC_>
35		30
36	·Namespaces	31	·Namespaces
37	namespace· Dune	32	namespace· Dune
38		33
39	namespace· Dune::TypeTree	34	namespace· Dune::TypeTree
40		35
		36	namespace· Dune::TypeTree::Detail
		37
		38	·Typedefs
		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
		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·using·LeafToValue·to·create·values.
		51
		52	·Functions
		53	template<class·Container·>
		54	auto Dune::TypeTree::Detail::makeTreeContainerVectorBackend·(Container
		55	······&&container)
		56
		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
		62	template<class·Value·,·class·Tree·>
		63	auto Dune::TypeTree::makeTreeContainer·(const·Tree·&tree)
		64	····Create·container·havin·the·same·structure·as·the·given·tree.
		65

41	===============================================================================	66	===============================================================================
42	·····Generated·by [doxygen]·1.9.8	67	·····Generated·by [doxygen]·1.9.8

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


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

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces·\|·Functions
13	transformation.hh·File·Reference	12	transformationutilities.hh·File·Reference
		13	#include·<dune/typetree/simpletransformationdescriptors.hh>
		14	#include·<dune/typetree/generictransformationdescriptors.hh>
14	#include·<array>
15	#include·<tuple>
16	#include·<memory>
17	#include·<utility>
18	#include·<dune/common/hybridutilities.hh>
19	#include·<dune/common/exceptions.hh>
20	#include·<dune/common/typetraits.hh>
21	#include·<dune/typetree/typetraits.hh>
22	#include·<dune/typetree/nodeinterface.hh>
23	#include·<dune/typetree/nodetags.hh>
24	#include·<dune/typetree/utility.hh>
25	Go_to_the_source_code_of_this_file.	15	Go_to_the_source_code_of_this_file.
26	·Classes
27	struct· Dune::TypeTree::TransformTree<_SourceTree,_Transformation,_Tag,
28	·········recursive_>
29	·······Transform·a·TypeTree.·More...
30
31	·Namespaces
32	namespace· Dune
33
34	namespace· Dune::TypeTree
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

43	===============================================================================	16	===============================================================================
44	·····Generated·by [doxygen]·1.9.8	17	·····Generated·by [doxygen]·1.9.8

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


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

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces	12	Classes·\|·Namespaces·\|·Functions
13	fixedcapacitystack.hh·File·Reference
14	#include·<array>
15	~~#inc~~lude·~~<cass~~ert>	13	accumulate_static.hh·File·Reference
		14	#include·<dune/common/typetraits.hh>
		15	#include·<dune/typetree/nodeinterface.hh>
		16	#include·<dune/typetree/nodetags.hh>
		17	#include·<dune/typetree/treepath.hh>
16	Go_to_the_source_code_of_this_file.	18	Go_to_the_source_code_of_this_file.
17	·Classes	19	·Classes
18	~~class~~· Dune::TypeTree::F~~ixedCapaci~~tySt~~ack~~Vie~~w<_T~~_>	20	struct· Dune::TypeTree::or_<_result_type_>
		21	·······Statically·combine·two·values·of·type·result_type·using·\|\|.·More...
19		22
20	~~class~~· Dune::TypeTree::~~FixedCapaci~~ty~~Stack<_T,_~~c~~apacity~~_>	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...
21		66
22	·Namespaces	67	·Namespaces
23	namespace· Dune	68	namespace· Dune
24		69
25	namespace· Dune::TypeTree	70	namespace· Dune::TypeTree
26		71
		72	namespace· Dune::TypeTree::Experimental
		73
		74	·Functions
		75	template<typename·Tree·,·typename·Visitor·,·typename·Init·>
		76	auto Dune::TypeTree::Experimental::hybridApplyToTree·(Tree·&&tree,·Visitor
		77	······&&visitor,·Init·&&init)
		78	····Apply·hybrid·visitor·to·TypeTree.
		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

27	===============================================================================	87	===============================================================================
28	·····Generated·by [doxygen]·1.9.8	88	·····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:·~~pro~~x~~ynode~~.hh·Source·File</title>	8	<title>dune-typetree:·childextraction.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 74, 404 lines modified		Offset 74, 288 lines modified

74	<div·id="nav-path"·class="navpath">	74	<div·id="nav-path"·class="navpath">
75	··<ul>	75	··<ul>
76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
77	</div>	77	</div>
78	</div><!--·top·-->	78	</div><!--·top·-->
79	<div·class="header">	79	<div·class="header">
80	··<div·class="headertitle"><div·class="title">~~pro~~x~~ynode~~.hh</div></div>	80	··<div·class="headertitle"><div·class="title">childextraction.hh</div></div>
81	</div><!--header-->	81	</div><!--header-->
82	<div·class="contents">	82	<div·class="contents">
83	<a·href="a00008.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	83	<a·href="a00008.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=8·sw=2·sts=2:</span></div>
85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_~~PRO~~X~~YNODE~~_HH</span></div>	86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_CHILDEXTRACTION_HH</span></div>
87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_~~PRO~~X~~YNODE~~_HH</span></div>	87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_CHILDEXTRACTION_HH</span></div>
88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>	89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>
90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<~~<a·class="code"·href="a00029.html">d~~u~~ne/type~~t~~ree/no~~deint~~erface.hh</a~~>></span></div>	90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>
91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>~~<span·class="preprocessor">#include·<<a·class="code"~~·~~href="a00056.html">dune/typetree/nodetags.hh</a>></span>~~</div>	91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>
92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<dune/common/~~shar~~ed_ptr.hh></span></div>	92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<dune/common/concept.hh></span></div>
93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<dune/common/in~~dices~~.hh></span></div>	93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span><span·class="preprocessor">#include·<dune/common/documentation.hh></span></div>
94	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/~~std/~~type_traits.hh></span></div>	94	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/typetraits.hh></span></div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml"·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:·~~visit~~or.hh·Source·File</title>	8	<title>dune-typetree:·powernode.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 74, 385 lines modified		Offset 74, 403 lines modified

74	<div·id="nav-path"·class="navpath">	74	<div·id="nav-path"·class="navpath">
75	··<ul>	75	··<ul>
76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
77	</div>	77	</div>
78	</div><!--·top·-->	78	</div><!--·top·-->
79	<div·class="header">	79	<div·class="header">
80	··<div·class="headertitle"><div·class="title">~~visit~~or.hh</div></div>	80	··<div·class="headertitle"><div·class="title">powernode.hh</div></div>
81	</div><!--header-->	81	</div><!--header-->
82	<div·class="contents">	82	<div·class="contents">
83	<a·href="a00011.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	83	<a·href="a00011.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_~~VISIT~~OR_HH</span></div>	86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_POWERNODE_HH</span></div>
87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_~~VISIT~~OR_HH</span></div>	87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_POWERNODE_HH</span></div>
88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<~~<a·~~class~~="code"·href="a00041.html">dune/typetre~~e/tr~~eepa~~t~~h.hh</a>~~></span></div>	89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<cassert></span></div>
90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<~~<a·cl~~a~~ss="code"·h~~r~~ef="a00047.html">dune/typet~~r~~ee/utility.hh</~~a>></span></div>	90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<array></span></div>
91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>	91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<memory></span></div>
92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="keyword">namespace·</span><a·class="code·hl_namespace"·href="a00097.html">Dune</a>·{</div>
93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>··<span·class="keyword">name~~spac~~e~~·</span>TypeTree·{~~</div>	92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<type_traits></span></div>
94	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span>·</div>	93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml"·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:·treecontainer.hh·Source·File</title>	8	<title>dune-typetree:·typetraits.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 74, 331 lines modified		Offset 74, 276 lines modified

74	<div·id="nav-path"·class="navpath">	74	<div·id="nav-path"·class="navpath">
75	··<ul>	75	··<ul>
76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
77	</div>	77	</div>
78	</div><!--·top·-->	78	</div><!--·top·-->
79	<div·class="header">	79	<div·class="header">
80	··<div·class="headertitle"><div·class="title">treecontainer.hh</div></div>	80	··<div·class="headertitle"><div·class="title">typetraits.hh</div></div>
81	</div><!--header-->	81	</div><!--header-->
82	<div·class="contents">	82	<div·class="contents">
83	<a·href="a00014.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	83	<a·href="a00014.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TREECONTAINER_HH</span></div>	86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TYPETRAITS_HH</span></div>
87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TREECONTAINER_HH</span></div>	87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TYPETRAITS_HH</span></div>
88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>	89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>
90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>	90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<dune/common/typetraits.hh></span></div>
91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<functional></span></div>
92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<array></span></div>
93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>	91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span>·</div>
94	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/indices.hh></span></div>


Offset 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:·powerc~~omp~~o~~site~~n~~ode~~t~~ransform~~ation~~templat~~es.hh·Source·File</title>	8	<title>dune-typetree:·treecontainer.hh·Source·File</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>
Offset 74, 89 lines modified		Offset 74, 331 lines modified

74	<div·id="nav-path"·class="navpath">	74	<div·id="nav-path"·class="navpath">
75	··<ul>	75	··<ul>
76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>	76	<li·class="navelem"><a·class="el"·href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li·class="navelem"><a·class="el"·href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li>··</ul>
77	</div>	77	</div>
78	</div><!--·top·-->	78	</div><!--·top·-->
79	<div·class="header">	79	<div·class="header">
80	··<div·class="headertitle"><div·class="title">powerc~~omp~~o~~site~~n~~ode~~t~~ransform~~ation~~templat~~es.hh</div></div>	80	··<div·class="headertitle"><div·class="title">treecontainer.hh</div></div>
81	</div><!--header-->	81	</div><!--header-->
82	<div·class="contents">	82	<div·class="contents">
83	<a·href="a00017.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>	83	<a·href="a00017.html">Go·to·the·documentation·of·this·file.</a><div·class="fragment"><div·class="line"><a·id="l00001"·name="l00001"></a><span·class="lineno">····1</span><span·class="comment">//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--</span></div>
84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>	84	<div·class="line"><a·id="l00002"·name="l00002"></a><span·class="lineno">····2</span><span·class="comment">//·vi:·set·et·ts=4·sw=2·sts=2:</span></div>
85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>	85	<div·class="line"><a·id="l00003"·name="l00003"></a><span·class="lineno">····3</span>·</div>
86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_POWERC~~OMP~~O~~SITE~~N~~ODE~~T~~RANSFORM~~ATION~~TEMPLAT~~ES_HH</span></div>	86	<div·class="line"><a·id="l00004"·name="l00004"></a><span·class="lineno">····4</span><span·class="preprocessor">#ifndef·DUNE_TYPETREE_TREECONTAINER_HH</span></div>
87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_POWERC~~OMP~~O~~SITE~~N~~ODE~~T~~RANSFORM~~ATION~~TEMPLAT~~ES_HH</span></div>	87	<div·class="line"><a·id="l00005"·name="l00005"></a><span·class="lineno">····5</span><span·class="preprocessor">#define·DUNE_TYPETREE_TREECONTAINER_HH</span></div>
88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>	88	<div·class="line"><a·id="l00006"·name="l00006"></a><span·class="lineno">····6</span>·</div>
89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<cst~~ddef~~></span></div>	89	<div·class="line"><a·id="l00007"·name="l00007"></a><span·class="lineno">····7</span><span·class="preprocessor">#include·<type_traits></span></div>
90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span>·</div>	90	<div·class="line"><a·id="l00008"·name="l00008"></a><span·class="lineno">····8</span><span·class="preprocessor">#include·<utility></span></div>
91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<~~<a·class="code"·hre~~f~~="a00029.html">d~~un~~e/typ~~et~~ree/~~no~~dei~~n~~terface.hh</~~a>></span></div>	91	<div·class="line"><a·id="l00009"·name="l00009"></a><span·class="lineno">····9</span><span·class="preprocessor">#include·<functional></span></div>
		92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span><span·class="preprocessor">#include·<array></span></div>
92	<div·class="line"><a·id="l00010"·name="l00010"></a><span·class="lineno">···10</span>·</div>	93	<div·class="line"><a·id="l00011"·name="l00011"></a><span·class="lineno">···11</span>·</div>
		94	<div·class="line"><a·id="l00012"·name="l00012"></a><span·class="lineno">···12</span><span·class="preprocessor">#include·<dune/common/indices.hh></span></div>


Offset 7, 209 lines modified		Offset 7, 701 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	f~~ixedcap~~ac~~ity~~stack.hh	12	accumulate_static.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_F~~IXEDCAP~~AC~~ITY~~STACK_HH	17	·4#ifndef·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
18	·5#define·DUNE_TYPETREE_F~~IXEDCAP~~AC~~ITY~~STACK_HH	18	·5#define·DUNE_TYPETREE_ACCUMULATE_STATIC_HH
19	·6	19	·6
20	·7#include·<array>
21	·8#include·<cassert>
22	·9
23	·10namespace·Dune·{
24	·~~11·~~name~~spa~~c~~e·T~~ypeTr~~ee·{~~	20	·7#include·<dune/common/typetraits.hh>
		21	·8#include·<dune/typetree/nodeinterface.hh>
		22	·9#include·<dune/typetree/nodetags.hh>
		23	·10#include·<dune/typetree/treepath.hh>
		24	·11
25	·12	25	·12
26	·13
27	·17
28	·18·template<typename·T>
29	19·cla~~ss·Fi~~xedCapac~~ityStackView~~	26	13namespace·Dune·{
		27	14·namespace·TypeTree·{
		28	·15
		29	·22·template<typename·result_type>
		30	23·struct·or_
30	·20·{	31	·24·{
		32	·25·template<result_type·r1,·result_type·r2>
		33	26·struct·reduce
31	·21
32	·22·public:
33	·23
34	·24·struct·Impl
35	·25·{	34	·27·{
		35	28·static·const·result_type·result·=·r1·\|\|·r2;
		36	·29·};
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·};	37	·30·};
47	·37
48	38·FixedCapacityStackView(Impl&·impl)
49	·3~~9·:·_impl(impl~~)	38	·31
		39	·33·template<typename·result_type>
		40	34·struct·and_
		41	·35·{
		42	·36·template<result_type·r1,·result_type·r2>
		43	37·struct·reduce
		44	·38·{
		45	39·static·const·result_type·result·=·r1·&&·r2;
50	·40·{}	46	·40·};
51	·41
52	·42·public:
53	·43
54	~~44·std::size_t~~·~~size~~()·~~con~~st	47	·41·};
		48	·42
		49	·44·template<typename·result_type>
		50	45·struct·plus
55	·45·{	51	·46·{
		52	·47·template<result_type·r1,·result_type·r2>
		53	48·struct·reduce
		54	·49·{
		55	50·static·const·result_type·result·=·r1·+·r2;
		56	·51·};
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·}	57	·52·};
63	·53	58	·53
64	54·~~boo~~l·emp~~ty()~~·~~cons~~t	59	·55·template<typename·result_type>
		60	56·struct·minus
65	·55·{	61	·57·{
		62	·58·template<result_type·r1,·result_type·r2>
		63	59·struct·reduce
66	·56·return·_impl._size·==·0;
67	·57·}
68	·58
69	59·bool·full()·const
70	·60·{	64	·60·{
71	·61·return·~~_imp~~l._~~siz~~e·==~~·_impl._capacity~~;	65	61·static·const·result_type·result·=·r1·-·r2;
72	·62·}	66	·62·};
73	·63
74	~~64·void·push_back(const~~·T&·t)	67	·63·};
		68	·64
		69	·66·template<typename·result_type>
		70	67·struct·multiply
75	·65·{	71	·68·{
		72	·69·template<result_type·r1,·result_type·r2>
		73	70·struct·reduce
76	·66·assert(!full());
77	·67·_impl._data[_impl._size++]·=·t;
78	·68·}
79	·69
80	70·void·pop_back()
81	·71·{	74	·71·{
82	·72·assert(!empty());
83	·73·--_impl~~._size~~;	75	72·static·const·result_type·result·=·r1·*·r2;
		76	·73·};
84	·74·}	77	·74·};
85	·75	78	·75
86	76·T&·~~back()~~	79	·77·template<typename·result_type>
		80	78·struct·min
87	·77·{	81	·79·{
		82	·80·template<result_type·r1,·result_type·r2>
		83	81·struct·reduce
88	·78·assert(!empty());
89	·79·return·_impl._data[_impl._size-1];
90	·80·}
91	·81
92	82·const·T&·back()·const
Max diff block lines reached; 21796/26032 bytes (83.73%) of diff not shown.


Offset 7, 28 lines modified		Offset 7, 28 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	compos~~ite~~node.hh·File·Reference	13	dynamicpowernode.hh·File·Reference
14	#include·<~~tupl~~e>	14	#include·<cassert>
		15	#include·<vector>
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>
18	#include·<dune/typetree/chil~~dextract~~ion.hh>	21	#include·<dune/typetree/utility.hh>
19	#include·<dune/typetree/typetraits.hh>	22	#include·<dune/typetree/typetraits.hh>
20	Go_to_the_source_code_of_this_file.	23	Go_to_the_source_code_of_this_file.
21	·Classes	24	·Classes
		25	class· Dune::TypeTree::DynamicPowerNode<_T_>
		26	······Collect·multiple·instances·of·type·T·within·a·dune-typetree.·More...
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		27
28	·Namespaces	28	·Namespaces
29	namespace· Dune	29	namespace· Dune
30		30
31	namespace· Dune::TypeTree	31	namespace· Dune::TypeTree
32		32


Offset 7, 328 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	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_COMPOS~~ITE~~NODE_HH	17	·4#ifndef·DUNE_TYPETREE_DYNAMICPOWERNODE_HH
18	·5#define·DUNE_TYPETREE_COMPOS~~ITE~~NODE_HH	18	·5#define·DUNE_TYPETREE_DYNAMICPOWERNODE_HH
19	·6	19	·6
20	·7#include·<~~tupl~~e>	20	·7#include·<cassert>
		21	·8#include·<vector>
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/typetraits.hh>
		31	·18
28	·15namespace·Dune·{	32	·19namespace·Dune·{
29	·16·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
30	·17
31	·24·template<typename...·Children>
32	25·class·CompositeNode
33	·26·{
34	·27	34	·21
		35	·31·template<typename·T>
		36	32·class·DynamicPowerNode
		37	·33·{
		38	·34
35	·28·public:	39	·35·public:
		40	·36
36	·29
37	31·typedef·CompositeNodeTag·NodeTag;
38	·32
39	34·typedef·std::tuple<std::shared_ptr<Children>...·>·NodeStorage;
40	·35
41	37·typedef·std::tuple<Children...>·ChildTypes;
42	·38
43	40·static·const·bool·isLeaf·=·false;	41	38·static·const·bool·isLeaf·=·false;
44	·41	42	·39
45	43·static·const·bool·isPower·=·f~~als~~e;	43	41·static·const·bool·isPower·=·true;
46	·44	44	·42
47	46·static·const·bool·isComposite·=·~~tru~~e;	45	44·static·const·bool·isComposite·=·false;
48	·47
49	·49·[[deprecated("Will·be·removed·after·release·2.9.·Use·degree()")]]
50	~~50·static·const·std::size_t·CHILDREN·=~~·~~sizeof...(Children~~);	46	·45
		47	47·std::size_t·degree()·const
		48	·48·{
		49	·49·return·_children.size();
		50	·50·}
51	·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;
52	52·static·constexpr·auto·degree·()
53	·53·{
54	·54·return·std::integral_constant<std::size_t,sizeof...(Children)>{};
55	·55·}
56	·56
57	·58·template<std::size_t·k>
58	59·struct·Child·{
59	·60	57	·60
		58	62·typedef·std::shared_ptr<const·T>·ChildConstStorageType;
		59	·63
		60	65·typedef·std::vector<ChildStorageType>·NodeStorage;
		61	·66
		62	·67
		63	·70
60	·61·static_assert((k·<·degree()),·"child·index·out·of·range");
61	·62
62	64·typedef·typename·std::tuple_element<k,ChildTypes>::type·Type;
63	·65
64	67·typedef·typename·std::tuple_element<k,ChildTypes>::type·type;
65	·68·};
66	·69
67	·72	64	·72
		65	75·ChildType&·child·(std::size_t·i)
68	·74
69	·77·template<std::size_t·k>
70	78·typename·Child<k>::Type&·child·(index_constant<k>·=·{})
71	·79·{	66	·76·{
72	·80·return·*std::get<k>(_children);
73	·81·}	67	·77·assert(i·<·degree()·&&·"child·index·out·of·range");
		68	·78·return·*_children[i];
		69	·79·}
		70	·80
74	·82	71	·82
		72	85·const·ChildType&·child·(std::size_t·i)·const
75	·84
76	·87·template<std::size_t·k>
77	88·const·typename·Child<k>::Type&·child·(index_constant<k>·=·{})·const
78	·89·{	73	·86·{
79	·90·re~~turn~~·*std::ge~~t<k>(_~~children);	74	·87·assert(i·<·degree()·&&·"child·index·out·of·range");
		75	·88·return·*_children[i];
80	·91·}	76	·89·}
		77	·90
81	·92	78	·92
		79	95·ChildStorageType·childStorage·(std::size_t·i)
82	·94
83	·97·template<std::size_t·k>
84	98·std::shared_ptr<typename·Child<k>::Type>·childStorage·(index_constant<k>·=
85	{})
86	·99·{	80	·96·{
87	·100·return·std::get<k>(_children);
88	·~~101~~·}	81	·97·assert(i·<·degree()·&&·"child·index·out·of·range");
		82	·98·return·_children[i];
		83	·99·}
		84	·100
89	·102	85	·102
		86	108·ChildConstStorageType·childStorage·(std::size_t·i)·const
90	·104
91	·107·template<std::size_t·k>
92	108·std::shared_ptr<const·typename·Child<k>::Type>·childStorage
Max diff block lines reached; 13741/17439 bytes (78.79%) of diff not shown.


Offset 6, 45 lines modified		Offset 6, 25 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	~~nodeinte~~rfac~~e.hh~~·~~Fil~~e·~~Ref~~e~~ren~~ce	12	Classes·\|·Namespaces
		13	fixedcapacitystack.hh·File·Reference
		14	#include·<array>
14	#include·<c~~stddef~~>	15	#include·<cassert>
15	#include·<type_traits>
16	#include·<dune/common/documentation.hh>
17	Go_to_the_source_code_of_this_file.	16	Go_to_the_source_code_of_this_file.
18	·Classes	17	·Classes
19	struct· Dune::TypeTree::NodeInterface
20	~~····~~·~~··I~~nter~~face·fo~~r·n~~odes·~~i~~n·a·dune-~~typet~~ree.·More...~~	18	class· Dune::TypeTree::FixedCapacityStackView<_T_>
		19
		20	class· Dune::TypeTree::FixedCapacityStack<_T,_capacity_>
21		21
22	·Namespaces	22	·Namespaces
23	namespace· Dune	23	namespace· Dune
24		24
25	namespace· Dune::TypeTree	25	namespace· Dune::TypeTree
26		26
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	===============================================================================	27	===============================================================================
48	·····Generated·by [doxygen]·1.9.8	28	·····Generated·by [doxygen]·1.9.8


Offset 7, 129 lines modified		Offset 7, 209 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	nod~~ein~~t~~erf~~ace.hh	12	fixedcapacitystack.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:·8;·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=8·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_NODEINTERFACE_HH
18	·5#define·DUNE_TYPETREE_NOD~~EIN~~T~~ERF~~ACE_HH	17	·4#ifndef·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
		18	·5#define·DUNE_TYPETREE_FIXEDCAPACITYSTACK_HH
19	·6	19	·6
		20	·7#include·<array>
20	·7#include·<c~~stddef~~>	21	·8#include·<cassert>
21	·8#include·<type_traits>
22	·9	22	·9
23	·10#include·<dune/common/documentation.hh>
24	·11
25	·12namespace·Dune·{	23	·10namespace·Dune·{
26	·13·namespace·TypeTree·{	24	·11·namespace·TypeTree·{
27	·14
28	32·struct·NodeInterface
29	·33·{
30	35·static·const·bool·isLeaf·=·implementationDefined;
31	·36
32	38·static·const·bool·isPower·=·implementationDefined;
33	·39
34	41·static·const·bool·isComposite·=·implementationDefined;
35	·42
36	·44
37	~~49·static·const·std::size_t·CHILDREN·=~~·~~implementationDefine~~d;	25	·12
		26	·13
		27	·17
		28	·18·template<typename·T>
		29	19·class·FixedCapacityStackView
		30	·20·{
		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·};
		47	·37
		48	38·FixedCapacityStackView(Impl&·impl)
		49	·39·:·_impl(impl)
		50	·40·{}
		51	·41
		52	·42·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
38	·50	60	·50·{
		61	·51·return·_impl._capacity;
39	·52	62	·52·}
40	~~57·static·auto~~·~~degree(~~);	63	·53
		64	54·bool·empty()·const
		65	·55·{
		66	·56·return·_impl._size·==·0;
		67	·57·}
41	·58	68	·58
		69	59·bool·full()·const
42	·60	70	·60·{
43	65·typedef·ImplementationDefined·NodeTag;
44	·66	71	·61·return·_impl._size·==·_impl._capacity;
		72	·62·}
		73	·63
		74	64·void·push_back(const·T&·t)
		75	·65·{
		76	·66·assert(!full());
		77	·67·_impl._data[_impl._size++]·=·t;
45	·68	78	·68·}
46	71·typedef·ImplementationDefined·NodeStorage;
47	·72·};
48	·73
49	·75·template<typename·Node>
50	~~76·using·NodeTag·=·typename~~·~~std::decay_t<Node>::NodeTa~~g;	79	·69
		80	70·void·pop_back()
		81	·71·{
		82	·72·assert(!empty());
		83	·73·--_impl._size;
		84	·74·}
		85	·75
		86	76·T&·back()
51	·77	87	·77·{
52	·79·template<typename·T>
53	~~80·using~~·~~ImplementationTag~~·=·~~typen~~a~~me·~~s~~td::~~de~~cay~~_t~~<T>::Im~~plem~~ent~~atio~~nTag~~;	88	·78·assert(!empty());
		89	·79·return·_impl._data[_impl._size-1];
		90	·80·}
54	·81	91	·81
		92	82·const·T&·back()·const
55	·82
56	·84·template<typename·Node>
57	85·std::size_t·degree(const·Node&·node)
58	·86·{	93	·83·{
59	·87·~~return·d~~egree(~~&node,No~~de~~Tag<Node>~~());	94	·84·assert(!empty());
		95	·85·return·_impl._data[_impl._size-1];
60	·88·}	96	·86·}
		97	·87
		98	88·T&·front()
61	·89	99	·89·{
62	·90#ifndef·DOXYGEN
63	·91	100	·90·assert(!empty());
		101	·91·return·_impl._data[0];
		102	·92·}
64	·93	103	·93
65	·99·template<typename·Node,·typename·NodeTag>
66	~~·100·std::size~~_t·~~degree(~~const·~~Node*·~~no~~de,~~·No~~deTag)~~	104	94·const·T&·front()·const
		105	·95·{
		106	·96·assert(!empty());
Max diff block lines reached; 5191/8144 bytes (63.74%) of diff not shown.

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+typetree.hh·File·Reference
+Classes·|·Namespaces·|·Functions
+accumulate_static.hh·File·Reference
+#include·<dune/common/typetraits.hh>
+#include·<dune/typetree/nodeinterface.hh>
+#include·<dune/typetree/nodetags.hh>
+#include·<dune/typetree/utility.hh>
+#include·<dune/typetree/leafnode.hh>
+#include·<dune/typetree/powernode.hh>
+#include·<dune/typetree/dynamicpowernode.hh>
+#include·<dune/typetree/compositenode.hh>
+#include·<dune/typetree/traversal.hh>
+#include·<dune/typetree/pairtraversal.hh>
+#include·<dune/typetree/traversalutilities.hh>
+#include·<dune/typetree/transformation.hh>
+#include·<dune/typetree/transformationutilities.hh>
+#include·<dune/typetree/accumulate_static.hh>
+#include·<dune/typetree/childextraction.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+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::Experimental
+·Functions
+template<typename·Tree·,·typename·Visitor·,·typename·Init·>
+auto Dune::TypeTree::Experimental::hybridApplyToTree·(Tree·&&tree,·Visitor
+······&&visitor,·Init·&&init)
+ ····Apply·hybrid·visitor·to·TypeTree.
+*****·Variable·Documentation·*****
+*****·◆ child_result·*****
+const·result_type·child_result·=
+accumulate_value<child,Functor,Reduction,ParentChildReduction,current_value,child_tree_path,NodeTag<child>>::·static
+result
+*****·◆ result·*****
+const·result_type·result·=·current_value·static
+===============================================================================
+·····Generated·by [doxygen]·1.9.8

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


Offset 7, 42 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	utility.hh·File·Reference
13	simpletransformationdescriptors.hh·File·Reference
14	#include·<array>
15	#include·<memory>	14	#include·<memory>
		15	#include·<tuple>
		16	#include·<type_traits>
		17	#include·<utility>
		18	#include·<algorithm>
		19	#include·<dune/common/shared_ptr.hh>
		20	#include·<dune/common/indices.hh>
		21	#include·<dune/common/hybridutilities.hh>
16	#include·<dune/typetree/nodeinterface.hh>	22	#include·<dune/typetree/nodeinterface.hh>
17	#include·<dune/typetree/nodetags.hh>	23	#include·<dune/typetree/nodetags.hh>
18	#include·<dune/common/exceptions.hh>
19	Go_to_the_source_code_of_this_file.	24	Go_to_the_source_code_of_this_file.
20	·Classes	25	·Classes
		26	struct· Dune::TypeTree::TreeInfo<_Tree,_Tag_>
		27	·······Struct·for·obtaining·some·basic·structural·information·about·a
		28	·········TypeTree.·More...
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_>
41		29
42	·Namespaces	30	·Namespaces
43	namespace· Dune	31	namespace· Dune
44		32
45	namespace· Dune::TypeTree	33	namespace· Dune::TypeTree
46		34


Offset 7, 251 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	~~simpletransform~~ati~~ondesc~~riptors.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_SIMPLETRANSFORMATIONDESCRIPTORS_HH
18	·5#define·DUNE_TYPETREE_~~SIMPLETRANSFORM~~ATI~~ONDESC~~RIPTORS_HH	17	·4#ifndef·DUNE_TYPETREE_UTILITY_HH
		18	·5#define·DUNE_TYPETREE_UTILITY_HH
19	·6	19	·6
20	·7#include·<array>
21	·8#include·<memory>	20	·7#include·<memory>
22	·9	21	·8#include·<tuple>
		22	·9#include·<type_traits>
		23	·10#include·<utility>
		24	·11#include·<algorithm>
		25	·12
		26	·13#include·<dune/common/shared_ptr.hh>
		27	·14#include·<dune/common/indices.hh>
		28	·15#include·<dune/common/hybridutilities.hh>
23	·10#include·<dune/typetree/nodeinterface.hh>	29	·16#include·<dune/typetree/nodeinterface.hh>
24	·11#include·<dune/typetree/nodetags.hh>	30	·17#include·<dune/typetree/nodetags.hh>
		31	·18
25	·12#include·<dune/common/exceptions.hh>
26	·13
27	·14
28	·15namespace·Dune·{	32	·19namespace·Dune·{
29	·16·namespace·TypeTree·{	33	·20·namespace·TypeTree·{
		34	·21
		35	·26#ifndef·DOXYGEN
		36	·27
		37	·28·template<typename·T>
		38	·29·std::shared_ptr<T>·convert_arg(const·T&·t)
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
38	29·typedef·TransformedNode·transformed_type;
39	30·typedef·std::shared_ptr<transformed_type>·transformed_storage_type;
40	·31
41	32·static·transformed_type·transform(const·SourceNode&·s,·const·Transformation&
42	t)
43	·33·{	39	·30·{
44	·34·return·transformed_~~type(~~);	40	·31·return·std::make_shared<T>(t);
45	·35·}	41	·32·}
46	·36
47	37·static·transformed_storage_type·transform_storage(std::shared_ptr<const
48	~~SourceNode>·s,·const·Transformation&~~·t)	42	·33
		43	·34·template<typename·T>
		44	·35·std::shared_ptr<T>·convert_arg(T&·t)
49	·38·{	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)
50	·39·return·std::make_shared<transformed_type>();
51	·40·}
52	·41
53	·42·};
54	·43
55	·44
56	·45·template<typename·SourceNode,·typename·Transformation,·template<typename
57	Child,·std::size_t>·class·TransformedNode>
58	46·struct·SimplePowerNodeTransformation
59	·47·{	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·}
60	·48	57	·48
		58	·49·//·only·bind·to·real·rvalues
61	49·static·const·bool·recursive·=·true;
62	·50
63	·51·template<typename·TC>	59	·50·template<typename·T>
64	52·stru~~ct·~~result	60	·51·typename·std::enable_if<!std::is_lvalue_reference<T>::value,std::
		61	shared_ptr<T>·>::type·convert_arg(T&&·t)
65	·53·{	62	·52·{
66	54·typedef·TransformedNode<TC,·StaticDegree<SourceNode>::value>·type;
67	55·typedef·std::shared_ptr<type>·storage_type;
68	56·static·const·std::size_t·degree·=·StaticDegree<type>::value;
69	·57·};	63	·53·return·std::make_shared<T>(std::forward<T>(t));
		64	·54·}
		65	·55
		66	·56
		67	·57·namespace·Experimental·{
70	·58	68	·58
		69	·67·template<class·BinaryOp,·class·Arg>
		70	·68·constexpr·decltype(auto)
		71	·69·left_fold(BinaryOp&&·binary_op,·Arg&&·arg)
71	·59·template<typename·TC>
72	60·static·typename·result<TC>::type·transform(const·SourceNode&·s,·const
73	Transformation&·t,·const·std::array<std::shared_ptr<TC>,result<TC>::degree>&
74	children)
75	·61·{
76	·62·return·typename·result<TC>::type(children);
77	·63·}
78	·64
79	·65·template<typename·TC>
80	66·static·typename·result<TC>::storage_type·transform_storage(std::
81	shared_ptr<const·SourceNode>·s,·const·Transformation&·t,·const·std::array<std::
82	shared_ptr<TC>,result<TC>::degree>&·children)
83	·67·{	72	·70·{
		73	·71·return·std::forward<Arg>(arg);
84	·68·return·std::make_shared<typename·result<TC>::type>(children);
85	·69·}
86	·70
87	·71·};
88	·72	74	·72·}
89	·73	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)
90	·74·template<typename·SourceNode,·typename·Transformation,·template<typename
91	Child>·class·TransformedNode>
92	75·struct·SimpleDynamicPowerNodeTransformation
Max diff block lines reached; 12472/17765 bytes (70.21%) of diff not shown.


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

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

37	===============================================================================	39	===============================================================================
38	·····Generated·by [doxygen]·1.9.8	40	·····Generated·by [doxygen]·1.9.8


Offset 7, 469 lines modified		Offset 7, 167 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	p~~owe~~r~~node~~.hh	12	pairtraversal.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_P~~OWE~~R~~NODE~~_HH	17	·4#ifndef·DUNE_TYPETREE_PAIRTRAVERSAL_HH
18	·5#define·DUNE_TYPETREE_P~~OWE~~R~~NODE~~_HH	18	·5#define·DUNE_TYPETREE_PAIRTRAVERSAL_HH
19	·6	19	·6
20	·7#include·<cassert>
21	·8#include·<array>
22	·9#include·<memory>
23	·10#include·<type_traits>
24	·11
25	·12#include·<dune/common/typetraits.hh>
26	·13#include·<dune/common/std/type_traits.hh>	20	·7#include·<dune/common/std/type_traits.hh>
		21	·8
		22	·9#include·<dune/typetree/nodeinterface.hh>
		23	·10#include·<dune/typetree/nodetags.hh>
		24	·11#include·<dune/typetree/treepath.hh>
		25	·12#include·<dune/typetree/visitor.hh>
		26	·13#include·<dune/typetree/traversal.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
33	·20namespace·Dune·{	28	·15namespace·Dune·{
34	·21·namespace·TypeTree·{	29	·16·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
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>	30	·17
		31	23·namespace·Detail·{
		32	·24
		33	·25·/*·The·signature·is·the·same·as·for·the·public·applyToTreePair
		34	·26·*·function·in·Dune::Typtree,·despite·the·additionally·passed
		35	·27·*·treePath·argument.·The·path·passed·here·is·associated·to
		36	·28·*·the·tree·and·the·relative·paths·of·the·children·(wrt.·to·tree)
		37	·29·*·are·appended·to·this.·Hence·the·behavior·of·the·public·function
		38	·30·*·is·resembled·by·passing·an·empty·treePath.
		39	·31·*/
		40	·32
		41	·33·/*
		42	·34·*·This·is·the·overload·for·leaf·traversal
		43	·35·*/
		44	·36·template<class·T1,·class·T2,·class·TreePath,·class·V,
		45	·37·std::enable_if_t<(std::decay_t<T1>::isLeaf·or·std::decay_t<T2>::isLeaf),
		46	int>·=·0>
		47	38·void·applyToTreePair(T1&&·tree1,·T2&&·tree2,·TreePath·treePath,·V&&·visitor)
45	·39·{};	48	·39·{
46	·40
47	·41#e~~ndif~~	49	·40·visitor.leaf(tree1,·tree2,·treePath);
		50	·41·}
48	·42	51	·42
49	·48·template<typename·T,·std::size_t·k>
50	49·class·PowerNode
51	·50·{
52	·51
53	·52·public:
54	·53
55	55·static·const·bool·isLeaf·=·false;
56	·56
57	~~58·static·const·bool~~·~~isPower~~·=·~~tru~~e;	52	·43·/*
		53	·44·*·This·is·the·general·overload·doing·static·child·traversal.
		54	·45·*/
		55	·46·template<class·T1,·class·T2,·class·TreePath,·class·V,
		56	·47·std::enable_if_t<not(std::decay_t<T1>::isLeaf·or·std::decay_t<T2>::isLeaf),
		57	int>·=·0>
		58	·48·void·applyToTreePair(T1&&·tree1,·T2&&·tree2,·TreePath·treePath,·V&&
		59	visitor)
		60	·49·{
		61	·50·//·Do·we·really·want·to·take·care·for·const-ness·of·the·Tree
		62	·51·//·when·instanciating·VisitChild·below?·I'd·rather·expect·this:
		63	·52·//·using·Tree1·=·std::decay_t<T1>;
		64	·53·//·using·Tree2·=·std::decay_t<T2>;
		65	·54·//·using·Visitor·=·std::decay_t<V>;
		66	·55·using·Tree1·=·std::remove_reference_t<T1>;
		67	·56·using·Tree2·=·std::remove_reference_t<T2>;
		68	·57·using·Visitor·=·std::remove_reference_t<V>;
		69	·58·visitor.pre(tree1,·tree2,·treePath);
58	·59	70	·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·static·constexpr·auto·degree·()
65	·68·{
66	·69·re~~turn~~·~~std::in~~tegral~~_con~~s~~tant<st~~d~~::siz~~e_t,k~~>{};~~	71	·60·//·check·which·type·of·traversal·is·supported·by·the·trees
		72	·61·using·allowDynamicTraversal·=·std::conjunction<
		73	·62·Dune::Std::is_detected<DynamicTraversalConcept,Tree1>,
		74	·63·Dune::Std::is_detected<DynamicTraversalConcept,Tree2>>;
		75	·64·using·allowStaticTraversal·=·std::conjunction<
		76	·65·Dune::Std::is_detected<StaticTraversalConcept,Tree1>,
		77	·66·Dune::Std::is_detected<StaticTraversalConcept,Tree2>>;
		78	·67
		79	·68·//·both·trees·must·support·either·dynamic·or·static·traversal
		80	·69·static_assert(allowDynamicTraversal::value·\|\|·allowStaticTraversal::value);
67	·70·}	81	·70
68	·71
69	73·typedef·PowerNodeTag·NodeTag;
70	·74
71	76·typedef·T·ChildType;
72	·77
73	79·typedef·std::array<std::shared_ptr<T>,k>·NodeStorage;
74	·80	82	·71·//·the·visitor·may·specify·preferred·dynamic·traversal
		83	·72·using·preferDynamicTraversal·=·std::bool_constant<Visitor::treePathType·==
		84	TreePathType::dynamic>;
		85	·73
		86	·74·//·create·a·dynamic·or·static·index·range
		87	·75·auto·indices·=·[&]{
		88	·76·if·constexpr(preferDynamicTraversal::value·&&·allowDynamicTraversal::value)
		89	·77·return·Dune::range(std::size_t(tree1.degree()));
Max diff block lines reached; 14856/19443 bytes (76.41%) of diff not shown.

+dune-typetree 2.9
+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+Classes·|·Namespaces
+exceptions.hh·File·Reference
+TypeTree-specific·exceptions.·More...
+#include·<cstddef>
+#include·<iostream>
+#include·<dune/common/exceptions.hh>
+#include·<dune/common/typetraits.hh>
+#include·<dune/common/indices.hh>
+#include·<dune/common/hybridutilities.hh>
+#include·<dune/typetree/fixedcapacitystack.hh>
+#include·<dune/typetree/utility.hh>
+Go_to_the_source_code_of_this_file.
+·Classes
+class· Dune::TypeTree::Exception
+ ······Base·class·for·all·TypeTree·exceptions.·More...
+·class· Dune::TypeTree::HybridTreePath<_T_>
+ ·······A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run
+·········time·indices.·More...
+struct· Dune::TypeTree::TreePathSize<_HybridTreePath<_index_constant<_i_>..._>
+·········>
+struct· Dune::TypeTree::TreePathPushBack<_HybridTreePath<_index_constant<_i
+·········>..._>,_k_>
+struct· Dune::TypeTree::TreePathPushFront<_HybridTreePath<_index_constant<_i
+·········>..._>,_k_>
+struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_k_>_>_>
+struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_j_>,
+·········index_constant<_k_>,_index_constant<_l_>..._>_>
+struct· Dune::TypeTree::TreePathFront<_HybridTreePath<_index_constant<_k_>,
+·········index_constant<_i_>..._>_>
+struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_k_>
+·········>,_i..._>
+struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_j_>,
+·········index_constant<_k_>,_index_constant<_l_>..._>,_i..._>
+struct· Dune::TypeTree::TreePathPopFront<_HybridTreePath<_index_constant<_k_>,
+·········index_constant<_i_>..._>_>
+struct· Dune::TypeTree::TreePathConcat<_HybridTreePath<_index_constant<_i_>...
+·········>,_HybridTreePath<_index_constant<_k_>..._>_>
+·Namespaces
+namespace· Dune
+namespace· Dune::TypeTree
+*****·Detailed·Description·*****
+TypeTree-specific·exceptions.
+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.

+Loading...
+Searching...
+No·Matches
+····*·dune
+····*·typetree
+exceptions.hh
+Go_to_the_documentation_of_this_file.
+·1//·-*-·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·-*-
+·2//·vi:·set·et·ts=4·sw=2·sts=2:
+·3
+·3#ifndef·DUNE_TYPETREE_EXCEPTIONS_HH
+·4#define·DUNE_TYPETREE_EXCEPTIONS_HH
+·5
+·6
+·7#include·<cstddef>
+·8#include·<iostream>
+·9
+·6#include·<dune/common/exceptions.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>
+·7
+·18
+·13namespace·Dune·{
+·14·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·}
+·15
+·class·Exception
+·18·:·public·Dune::Exception
+·constexpr·std::size_t·operator[](std::size_t·pos)·const
+·128·{
+·129·std::size_t·entry·=·0;
+·130·Dune::Hybrid::forEach(enumerate(),·[&]·(auto·i)·{
+·131·if·(i==pos)
+·132·entry·=·this->element(i);
+·133·});


Offset 6, 89 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	Classes·\|·Namespaces~~·\|·Functions~~	12	Classes·\|·Namespaces
13	typet~~raits~~.hh·File·Reference	13	compositenode.hh·File·Reference
		14	#include·<tuple>
		15	#include·<memory>
14	#include·<type_traits>	16	#include·<type_traits>
15	#include·<dune/common/typetraits.hh>
16	#include·<dune/typetree/treepath.hh>
17	#include·<dune/typetree/nodeint~~erf~~ace.hh>	17	#include·<dune/typetree/nodetags.hh>
		18	#include·<dune/typetree/childextraction.hh>
		19	#include·<dune/typetree/typetraits.hh>
18	Go_to_the_source_code_of_this_file.	20	Go_to_the_source_code_of_this_file.
19	·Classes	21	·Classes
20	~~struct~~· Dune::first~~_typ~~e<_~~T0,_T...~~_>	22	·class· Dune::TypeTree::CompositeNode<_Children_>
		23	·······Base·class·for·composite·nodes·based·on·variadic·templates.·More...
21		24
		25	struct· Dune::TypeTree::CompositeNode<_Children_>::Child<_k_>
		26	·······Access·to·the·type·and·storage·type·of·the·i-th·child.·More...
22	struct· Dune::TypeTree::has_node_tag<_T_>
23
24	struct· Dune::TypeTree::has_node_tag<_T_>::yes
25
26	struct· Dune::TypeTree::has_node_tag<_T_>::no
27
28	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>
29
30	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::maybe<_N_>
31
32	struct· Dune::TypeTree::has_node_tag_value<_T,_V_>::yes
33
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...
67		27
68	·Namespaces	28	·Namespaces
69	namespace· Dune	29	namespace· Dune
70		30
71	namespace· Dune::TypeTree	31	namespace· Dune::TypeTree
72		32
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

91	===============================================================================	33	===============================================================================
92	·····Generated·by [doxygen]·1.9.8	34	·····Generated·by [doxygen]·1.9.8


Offset 7, 30 lines modified		Offset 7, 62 lines modified

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


Offset 7, 314 lines modified		Offset 7, 319 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	util~~ity~~.hh	12	filters.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=4·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_UTIL~~ITY~~_HH	17	·4#ifndef·DUNE_TYPETREE_FILTERS_HH
18	·5#define·DUNE_TYPETREE_UTIL~~ITY~~_HH	18	·5#define·DUNE_TYPETREE_FILTERS_HH
19	·6	19	·6
20	·7#include·<memory>
21	·8#include·<tuple>	20	·7#include·<tuple>
22	·9#include·<type_traits>
23	·10#include·<utility>
24	·11#include·<algorithm>
25	·12
26	·13#include·<dune/common/shared_ptr.hh>
27	·14#include·<dune/common/indices.hh>
28	·15#include·<dune/common/hybridutilities.hh>
29	·16#include·<dune/typetree/nodeinterface.hh>
30	·17#include·<dune/typetree/nodetags.hh>
31	·18	21	·8
		22	·9#include·<dune/common/typetraits.hh>
		23	·10
32	·19namespace·Dune·{	24	·11namespace·Dune·{
33	·20·namespace·TypeTree·{	25	·12·namespace·TypeTree·{
34	·21	26	·13
		27	·20·template<std::size_t·new_k,·std::size_t·old_k>
		28	21·struct·FilterEntry
		29	·22·{
		30	·23
35	·26#ifndef·DOXYGEN	31	·24#ifndef·DOXYGEN
		32	·25
		33	·26·//·The·precise·contents·of·this·class·is·an·implementation·detail.
36	·27	34	·27
37	·28·template<typename·T>
38	·29·st~~d::~~s~~hare~~d~~_ptr<T>~~·~~conv~~er~~t_arg(const·T&·t)~~	35	·28·static·const·std::size_t·filtered_index·=·new_k;
		36	·29·static·const·std::size_t·original_index·=·old_k;
		37	·30
		38	·31#endif·//·DOXYGEN
		39	·32
		40	·33·};
		41	·34
		42	·36·template<typename...·FilterEntries>
		43	37·struct·FilterResult
39	·30·{	44	·38·{
40	·31·return·std::make_shared<T>(t);
41	·32·}
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	45	·39
		46	40·static·const·std::size_t·size·=·sizeof...(FilterEntries);
		47	·41
		48	42·typedef·std::tuple<FilterEntries...>·IndexMap;
		49	·43
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>	50	·44·template<typename·Node>
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·}
65	·55	51	45·struct·apply
		52	·46·{
		53	47·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
		54	original_index>...>·Children;
		55	48·typedef·std::tuple<typename·Node::template·Child<FilterEntries::
		56	original_index>::Type...>·ChildTypes;
		57	49·typedef·std::tuple<std::shared_ptr<typename·Node::template
		58	Child<FilterEntries::original_index>::Type>...>·NodeStorage;
		59	·50·};
		60	·51
		61	·52·};
		62	·53
		63	55·struct·SimpleFilterTag·{};
66	·56	64	·56
67	·57·namespace·Experimental·{
68	·58
69	·67·template<class·BinaryOp,·class·Arg>
70	·68·constexpr·decltype(auto)
71	·69·left~~_fold(Bina~~r~~yOp&&·bi~~na~~ry_op,·A~~r~~g&&~~·a~~rg)~~	65	58·struct·AdvancedFilterTag·{};
		66	·59
		67	·60
		68	62·struct·AdvancedFilter
		69	·63·{
		70	·64
		71	66·typedef·AdvancedFilterTag·FilterTag;
		72	·67
		73	·68#ifdef·DOXYGEN
		74	·69
		75	·71·template<typename·Node,·typename...·Children>
		76	72·struct·apply
72	·70·{	77	·73·{
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~~)	78	·75
		79	78·typedef·implementation-defined·type;
		80	·79·};
		81	·80
		82	·81#endif·//·DOXYGEN
		83	·82
		84	·83·};
		85	·84
		86	·86
		87	91·struct·SimpleFilter
79	·98·{	88	·92·{
Max diff block lines reached; 13011/16847 bytes (77.23%) of diff not shown.


Offset 7, 24 lines modified		Offset 7, 56 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	~~tra~~n~~sformati~~o~~nuti~~lities.hh	12	nodetags.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_TRANSFORMATIONUTILITIES_HH
18	·5#define·DUNE_TYPETREE_~~TRA~~N~~SFORMATI~~O~~NUTI~~LITIES_HH	17	·4#ifndef·DUNE_TYPETREE_NODETAGS_HH
		18	·5#define·DUNE_TYPETREE_NODETAGS_HH
19	·6	19	·6
20	·7#include·<dune/typetree/simpletransformationdescriptors.hh>
21	·8#in~~clude·<d~~une/typ~~etree/generictr~~a~~nsformatio~~nde~~scriptors.h~~h>	20	·7namespace·Dune·{
		21	·8·namespace·TypeTree·{
22	·9	22	·9
23	·10#endif·//·DUNE_TYPETREE_TRANSFORMATIONUTILITIES_HH
24	simpletransformationdescriptors.hh
25	~~generic~~tra~~nsform~~ationde~~scriptors.hh~~	23	16·struct·LeafNodeTag·{};
		24	·17
		25	19·struct·PowerNodeTag·{};
		26	·20
		27	22·struct·DynamicPowerNodeTag·{};
		28	·23
		29	25·struct·CompositeNodeTag·{};
		30	·26
		31	·27#ifndef·DOXYGEN
		32	·28
		33	·30·struct·StartTag·{};
		34	·31
		35	·32
		36	·33
		37	·34#endif·//·DOXYGEN
		38	·35
		39	·37
		40	·38·}·//·namespace·TypeTree
		41	·39}·//namespace·Dune
		42	·40
		43	·41#endif·//·DUNE_TYPETREE_NODETAGS_HH
		44	Dune
		45	Definition·accumulate_static.hh:13
		46	Dune::TypeTree::LeafNodeTag
		47	Tag·designating·a·leaf·node.
		48	Definition·nodetags.hh:16
		49	Dune::TypeTree::PowerNodeTag
		50	Tag·designating·a·power·node.
		51	Definition·nodetags.hh:19
		52	Dune::TypeTree::DynamicPowerNodeTag
		53	Tag·designating·a·power·node·with·runtime·degree.
		54	Definition·nodetags.hh:22
		55	Dune::TypeTree::CompositeNodeTag
		56	Tag·designating·a·composite·node.
		57	Definition·nodetags.hh:25

26	===============================================================================	58	===============================================================================
27	·····Generated·by [doxygen]·1.9.8	59	·····Generated·by [doxygen]·1.9.8


Offset 7, 56 lines modified		Offset 7, 110 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	~~nod~~etags.hh	12	traversalutilities.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_~~NOD~~ETAGS_HH	17	·4#ifndef·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
18	·5#define·DUNE_TYPETREE_~~NOD~~ETAGS_HH	18	·5#define·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
19	·6	19	·6
		20	·7#include·<dune/typetree/traversal.hh>
		21	·8
20	·7namespace·Dune·{	22	·9namespace·Dune·{
21	·8·namespace·TypeTree·{	23	·10·namespace·TypeTree·{
		24	·11
		25	·17·namespace·{
		26	·18
22	·9
23	16·struct·LeafNodeTag·{};
24	·17
25	19·struct·PowerNodeTag·{};
26	·20	27	·20
		28	·25·template<typename·F,·typename·R,·typename·ResultType>
		29	·26·struct·LeafReductionVisitor
		30	·27·:·public·TypeTree::TreeVisitor
27	22·struct·DynamicPowerNodeTag·{};
28	·23
29	25·struct·CompositeNodeTag·{};
30	·26
31	·27#ifndef·DOXYGEN
32	·28	31	·28·{
33	·~~30·struct·StartTag·{~~};	32	·29
		33	30·static·const·TreePathType::Type·treePathType·=·TreePathType::dynamic;
34	·31	34	·31
35	·32
36	·33
37	·34#endif·//·DOXYGEN
38	·35	35	·32·template<typename·Node,·typename·TreePath>
		36	·33·void·leaf(const·Node&·node,·TreePath·treePath)
		37	·34·{
		38	·35·_value·=·_reduction(_value,_functor(node,treePath));
		39	·36·}
39	·37	40	·37
		41	·38·LeafReductionVisitor(F·functor,·R·reduction,·ResultType·startValue)
		42	·39·:·_functor(functor)
		43	·40·,·_reduction(reduction)
		44	·41·,·_value(startValue)
		45	·42·{}
		46	·43
		47	·44·ResultType·result()·{·return·_value;·}
		48	·45
		49	46·F·_functor;
		50	47·R·_reduction;
		51	48·ResultType·_value;
		52	·49
		53	·50·};
		54	·51
		55	·52·}·//·anonymous·namespace
		56	·53
		57	·55
		58	·80·template<typename·ResultType,·typename·Tree,·typename·F,·typename·R>
		59	81·ResultType·reduceOverLeafs(const·Tree&·tree,·F·functor,·R·reduction,
		60	ResultType·startValue)
		61	·82·{
		62	·83·LeafReductionVisitor<F,R,ResultType>·visitor(functor,reduction,startValue);
		63	·84·TypeTree::applyToTree(tree,visitor);
		64	·85·return·visitor.result();
		65	·86·}
		66	·87
		67	·89
40	·38·}·//·namespace·TypeTree	68	·90·}·//·namespace·TypeTree
41	·39}·//namespace·Dune	69	·91}·//namespace·Dune
42	·40
43	·~~41#endif·//·DUNE_TYPETREE_NODETAGS_~~HH	70	·92
		71	·93#endif·//·DUNE_TYPETREE_TRAVERSALUTILITIES_HH
		72	result
		73	static·const·result_type·result
		74	Definition·accumulate_static.hh:110
		75	_reduction
		76	R·_reduction
		77	Definition·traversalutilities.hh:47
		78	_functor
		79	F·_functor
		80	Definition·traversalutilities.hh:46
		81	treePathType
		82	static·const·TreePathType::Type·treePathType
		83	Definition·traversalutilities.hh:30
		84	_value
		85	ResultType·_value
		86	Definition·traversalutilities.hh:48
		87	traversal.hh
		88	Dune::TypeTree::reduceOverLeafs
		89	ResultType·reduceOverLeafs(const·Tree·&tree,·F·functor,·R·reduction,·ResultType
		90	startValue)
		91	Calculate·a·quantity·as·a·reduction·over·the·leaf·nodes·of·a·TypeTree.
		92	Definition·traversalutilities.hh:81
		93	Dune::TypeTree::applyToTree
		94	void·applyToTree(Tree·&&tree,·Visitor·&&visitor)
		95	Apply·visitor·to·TypeTree.
		96	Definition·traversal.hh:237
		97	Dune::TypeTree::treePath
		98	constexpr·HybridTreePath<·T...·>·treePath(const·T·&...·t)
		99	Constructs·a·new·HybridTreePath·from·the·given·indices.
		100	Definition·treepath.hh:191
		101	Dune::TypeTree::TreePath
		102	HybridTreePath<·Dune::index_constant<·i·>...·>·TreePath
		103	Definition·treepath.hh:521
44	Dune	104	Dune
45	Definition·accumulate_static.hh:13	105	Definition·accumulate_static.hh:13
		106	Dune::TypeTree::TreePathType::Type
		107	Type
		108	Definition·treepath.hh:30
		109	Dune::TypeTree::TreePathType::dynamic
		110	@·dynamic
		111	Definition·treepath.hh:30
46	Dune::TypeTree::LeafNodeTag
47	Tag·designating·a·leaf·node.
48	Definition·nodetags.hh:16
49	Dune::TypeTree::PowerNodeTag
50	Tag·designating·a·power·node.
51	Definition·nodetags.hh:19
52	Dune::TypeTree::DynamicPowerNodeTag
Max diff block lines reached; 116/3836 bytes (3.02%) of diff not shown.


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

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	Classes·\|·Namespaces
13	generictransformationdescriptors.hh·File·Reference
14	#include·<array>
15	#include·<memory>
16	~~#include~~·~~<dun~~e/type~~tree/~~nodein~~terfa~~c~~e.hh>~~	12	Classes·\|·Namespaces·\|·Typedefs·\|·Enumerations·\|·Functions
		13	treepath.hh·File·Reference
		14	#include·<cstddef>
		15	#include·<iostream>
		16	#include·<dune/common/documentation.hh>
17	#include·<dune/ty~~petree~~/~~nod~~etags.hh>	17	#include·<dune/common/typetraits.hh>
18	#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
19	#include·<dune/common/~~except~~ions.hh>	18	#include·<dune/common/indices.hh>
		19	#include·<dune/common/hybridutilities.hh>
		20	#include·<dune/typetree/fixedcapacitystack.hh>
		21	#include·<dune/typetree/utility.hh>
20	Go_to_the_source_code_of_this_file.	22	Go_to_the_source_code_of_this_file.
21	·Classes	23	·Classes
22	struct· Dune::TypeTree::GenericLeafNodeTransformation<_SourceNode,
23	·~~····~~·~~···Transformation,_T~~r~~ansformedNode~~_>	24	·class· Dune::TypeTree::HybridTreePath<_T_>
		25	·······A·hybrid·version·of·TreePath·that·supports·both·compile·time·and·run
		26	·········time·indices.·More...
24		27
25	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
26	·~~········~~Tr~~ansfo~~rmati~~on,~~_~~Transfo~~rme~~dNo~~de~~Templ~~ate_>	28	struct· Dune::TypeTree::TreePathSize<_HybridTreePath<_index_constant<_i_>..._>
		29	·········>
27		30
28	struct· Dune::TypeTree::TemplatizedGenericPowerNodeTransformation<_SourceNode,
29	·~~········~~Tr~~ansfo~~rmati~~on,_Tr~~an~~sformedNo~~deT~~empl~~ate_~~>::resul~~t~~<_TC~~_>	31	struct· Dune::TypeTree::TreePathPushBack<_HybridTreePath<_index_constant<_i
		32	·········>..._>,_k_>
30		33
31	struct· Dune::TypeTree::GenericPowerNodeTransformation<_SourceNode,
32	·~~········~~Tr~~ansfo~~rmation,_Tra~~nsform~~edNode_>	34	struct· Dune::TypeTree::TreePathPushFront<_HybridTreePath<_index_constant<_i
		35	·········>..._>,_k_>
33		36
		37	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_k_>_>_>
34	struct· Dune::TypeTree::TemplatizedGenericDynamicPowerNodeTransformation<
35	·········SourceNode,_Transformation,_TransformedNodeTemplate_>
36		38
37	struct· Dune::TypeTree::TemplatizedGenericDynamicPowerNodeTransformation<
38	··~~······~~·Source~~Node,_~~Tr~~ansfo~~rmat~~ion,~~_~~Transfo~~rmedN~~odeTemplat~~e~~_>::resul~~t<_TC_>	39	struct· Dune::TypeTree::TreePathBack<_HybridTreePath<_index_constant<_j_>,
		40	·········index_constant<_k_>,_index_constant<_l_>..._>_>
39		41
40	struct· Dune::TypeTree::GenericDynamicPowerNodeTransformation<_SourceNode,
41	·~~········~~Tr~~ansfo~~rmation,_Transfo~~rmedNode~~_>	42	struct· Dune::TypeTree::TreePathFront<_HybridTreePath<_index_constant<_k_>,
		43	·········index_constant<_i_>..._>_>
42		44
43	struct· Dune::TypeTree::TemplatizedGenericCompositeNodeTransformation<
44	~~···~~·~~·····Sourc~~e~~Nod~~e,_Tra~~nsf~~orma~~tion,_T~~r~~ansformedNo~~de~~Templ~~ate_>	45	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_k_>
		46	·········>,_i..._>
45		47
46	struct· Dune::TypeTree::TemplatizedGenericCompositeNodeTransformation<
47	··~~······~~·Source~~Node,_~~Tr~~ansfo~~rmatio~~n,_Transfo~~rmed~~Nod~~e~~Templat~~e~~_>::resul~~t<_TC_>	48	struct· Dune::TypeTree::TreePathPopBack<_HybridTreePath<_index_constant<_j_>,
		49	·········index_constant<_k_>,_index_constant<_l_>..._>,_i..._>
48		50
49	struct· Dune::TypeTree::GenericCompositeNodeTransformation<_SourceNode,
50	·~~········~~Tr~~ansfo~~rmation,_Transfo~~rmedNode~~_>	51	struct· Dune::TypeTree::TreePathPopFront<_HybridTreePath<_index_constant<_k_>,
		52	·········index_constant<_i_>..._>_>
		53
		54	struct· Dune::TypeTree::TreePathConcat<_HybridTreePath<_index_constant<_i_>...
		55	·········>,_HybridTreePath<_index_constant<_k_>..._>_>
51		56
52	·Namespaces	57	·Namespaces
53	namespace· Dune	58	namespace· Dune
54		59
55	namespace· Dune::TypeTree	60	namespace· Dune::TypeTree
56		61
		62	namespace· Dune::TypeTree::TreePathType
		63
		64	·Typedefs
		65	template<std::size_t...·i>
		66	using Dune::TypeTree::TreePath·=·HybridTreePath<·Dune::index_constant<·i·>...
		67	·······>
		68
		69	template<std::size_t...·i>
		70	using Dune::TypeTree::StaticTreePath·=·HybridTreePath<·Dune::index_constant<·i
		71	·······>...·>
		72
		73	·Enumerations
		74	enum· Dune::TypeTree::TreePathType::Type·{·Dune::TypeTree::TreePathType::
		75	·······fullyStatic·,·Dune::TypeTree::TreePathType::dynamic·}
		76
		77	·Functions
		78	template<std::size_t...·i>
		79	·································void Dune::TypeTree::print_tree_path·(std::
		80	·······································ostream·&os)
		81
		82	template<std::size_t·k,·std::size_t...·i>
		83	·································void Dune::TypeTree::print_tree_path·(std::
		84	·······································ostream·&os)
		85
		86	template<typename...·T>
		87	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::hybridTreePath·(const·T
		88	·······································&...·t)
		89	·····································Constructs·a·new·HybridTreePath·from·the
		90	·······································given·indices.
		91
		92	template<typename...·T>
		93	·····constexpr·HybridTreePath<·T...·> Dune::TypeTree::treePath·(const·T·&...
		94	·······································t)
		95	·····································Constructs·a·new·HybridTreePath·from·the
		96	·······································given·indices.
		97
		98	template<typename...·T>
		99	················constexpr·std::size_t Dune::TypeTree::treePathSize·(const
		100	·······································HybridTreePath<·T...·>·&)
		101	·····································Returns·the·size·(number·of·components)
		102	·······································of·the·given·HybridTreePath.
		103
		104	template<std::size_t·i,·typename...·T>
		105	·······················constexpr·auto Dune::TypeTree::treePathEntry·(const
		106	·······································HybridTreePath<·T...·>·&tp,
		107	·······································index_constant<·i·>={})·->·typename
		108	·······································std::decay<·decltype(std::get<·i·>
		109	·······································(tp._data))>::type
		110	·····································Returns·a·copy·of·the·i-th·element·of
		111	·······································the·HybridTreePath.
		112
		113	template<std::size_t·i,·typename...·T>
		114	················constexpr·std::size_t Dune::TypeTree::treePathIndex·(const
		115	·······································HybridTreePath<·T...·>·&tp,
Max diff block lines reached; 116/11049 bytes (1.05%) of diff not shown.


Offset 7, 345 lines modified		Offset 7, 613 lines modified


7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·dune	10	····*·dune
11	····*·typetree	11	····*·typetree
12	~~generic~~t~~ransfo~~r~~mationd~~e~~scr~~ipt~~ors~~.hh	12	treepath.hh
13	Go_to_the_documentation_of_this_file.	13	Go_to_the_documentation_of_this_file.
14	·1//·--·tab-width:·4;·indent-tabs-mode:·nil;·c-basic-offset:·2·--	14	·1//·--·tab-width:·8;·indent-tabs-mode:·nil;·c-basic-offset:·2·--
15	·2//·vi:·set·et·ts=4·sw=2·sts=2:	15	·2//·vi:·set·et·ts=8·sw=2·sts=2:
16	·3	16	·3
17	·4#ifndef·DUNE_TYPETREE_GENERICTRANSFORMATIONDESCRIPTORS_HH
18	·5#define·DUNE_TYPETREE_~~GENERIC~~T~~RANSFO~~R~~MATIOND~~E~~SCR~~IPT~~ORS~~_HH	17	·4#ifndef·DUNE_TYPETREE_TREEPATH_HH
		18	·5#define·DUNE_TYPETREE_TREEPATH_HH
19	·6	19	·6
20	·7#include·<array>
21	·8#include·<~~memory~~>	20	·7#include·<cstddef>
		21	·8#include·<iostream>
22	·9	22	·9
23	·10#include·<dune/ty~~petree~~/no~~dei~~nte~~rface~~.hh>	23	·10#include·<dune/common/documentation.hh>
24	·11#include·<dune/ty~~petree~~/~~nod~~etags.hh>	24	·11#include·<dune/common/typetraits.hh>
25	·12#include·<dune/typetree/powercompositenodetransformationtemplates.hh>
26	·13#include·<dune/common/~~except~~ions.hh>	25	·12#include·<dune/common/indices.hh>
		26	·13#include·<dune/common/hybridutilities.hh>
27	·14	27	·14
28	·15
29	·16namespace·Dune·{
30	·17·name~~spac~~e·TypeTree·{	28	·15#include·<dune/typetree/fixedcapacitystack.hh>
		29	·16#include·<dune/typetree/utility.hh>
		30	·17
31	·18	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::sh~~ared_p~~tr<tr~~a~~nsformed_ty~~pe>·tran~~sformed_storag~~e~~_typ~~e;	32	·19namespace·Dune·{
		33	·20·namespace·TypeTree·{
		34	·21
		35	·22·template<typename...·T>
		36	·23·class·HybridTreePath;
		37	·24
		38	·28
		39	29·namespace·TreePathType·{
		40	30·enum·Type·{·fullyStatic,·dynamic·};
		41	·31·}
41	·32	42	·32
		43	·33·template<typename>
		44	34·struct·TreePathSize;
		45	·35
		46	·36·template<typename,std::size_t>
		47	37·struct·TreePathPushBack;
		48	·38
		49	·39·template<typename,std::size_t>
		50	40·struct·TreePathPushFront;
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·}	51	·41
		52	·42·template<typename>
		53	43·struct·TreePathBack;
53	·42
54	43·static·transformed_storage_type·transform_storage(std::shared_ptr<const
55	SourceNode>·s,·const·Transformation&·t)
56	·44·{	54	·44
57	·45·return·std::make_shared<transformed_type>(s,t);
58	·46·}	55	·45·template<typename>
		56	46·struct·TreePathFront;
59	·47	57	·47
60	·48·};
61	·49	58	·48·template<typename,·std::size_t...>
		59	49·struct·TreePathPopBack;
62	·50	60	·50
		61	·51·template<typename>
		62	52·struct·TreePathPopFront;
63	·51·template<typename·SourceNode,·typename·Transformation,·template<typename
64	Child>·class·TransformedNodeTemplate>
65	52·struct·TemplatizedGenericPowerNodeTransformation
66	·53·{	63	·53
67	·54
68	55·sta~~tic·cons~~t·~~bool·r~~ec~~ursiv~~e~~·=·tru~~e;	64	·54·template<typename,·typename>
		65	55·struct·TreePathConcat;
69	·56	66	·56
70	·57·template<typename·TC>
71	58·st~~ruc~~t~~·re~~sult	67	·57·template<std::size_t...·i>
		68	58·void·print_tree_path(std::ostream&·os)
72	·59·{	69	·59·{}
		70	·60
		71	·61·template<std::size_t·k,·std::size_t...·i>
		72	62·void·print_tree_path(std::ostream&·os)
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·{	73	·63·{
83	·68·~~retu~~rn·~~typena~~me·~~resu~~lt<~~TC>::type(s,t,children)~~;	74	·64·os·<<·k·<<·"·";
		75	·65·print_tree_path<i...>(os);
84	·69·}	76	·66·}
		77	·67
		78	·69
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·}
93	·76
94	·77·template<typename·TC>	79	·77·template<typename...·T>
		80	78·class·HybridTreePath
Max diff block lines reached; 27992/32237 bytes (86.83%) of diff not shown.