{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.olX5YzDP/b1/dune-geometry_2.10.0-1_amd64.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.olX5YzDP/b2/dune-geometry_2.10.0-1_amd64.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,4 +1,4 @@\n \n c54cfe213dfb4bfeb8129a06e575478d 398252 debug optional libdune-geometry-dev-dbgsym_2.10.0-1_amd64.deb\n 0dd282bf67c7b050a197e3080eb1f026 286676 libdevel optional libdune-geometry-dev_2.10.0-1_amd64.deb\n- 23f5cfd89bd8215a394003465c6b891a 1570672 doc optional libdune-geometry-doc_2.10.0-1_all.deb\n+ cafc1c07496c564ecfbf25921b98ef00 1569796 doc optional libdune-geometry-doc_2.10.0-1_all.deb\n"}, {"source1": "libdune-geometry-doc_2.10.0-1_all.deb", "source2": "libdune-geometry-doc_2.10.0-1_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-11-14 18:01:13.000000 debian-binary\n--rw-r--r-- 0 0 0 16592 2024-11-14 18:01:13.000000 control.tar.xz\n--rw-r--r-- 0 0 0 1553888 2024-11-14 18:01:13.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 16528 2024-11-14 18:01:13.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 1553076 2024-11-14 18:01:13.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -12,14 +12,15 @@\n usr/share/doc/libdune-geometry-doc/changelog.Debian.gz\n usr/share/doc/libdune-geometry-doc/changelog.gz\n usr/share/doc/libdune-geometry-doc/copyright\n usr/share/doc/libdune-geometry-doc/doxygen/a00134.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00164.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00167.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00170.html\n+usr/share/doc/libdune-geometry-doc/doxygen/a00170_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00173.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00173_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00176.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00176_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00179.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00179_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00182.html\n@@ -39,15 +40,14 @@\n usr/share/doc/libdune-geometry-doc/doxygen/a00203.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00203_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00206.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00206_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00209.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00209_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00212.html\n-usr/share/doc/libdune-geometry-doc/doxygen/a00212_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00215.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00215_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00218.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00218_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00221.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00221_source.html\n usr/share/doc/libdune-geometry-doc/doxygen/a00224.html\n"}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -19,67 +19,67 @@\n -rw-r--r-- 0 root (0) root (0) 973 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/changelog.Debian.gz\n -rw-r--r-- 0 root (0) root (0) 3700 2024-09-05 07:06:07.000000 ./usr/share/doc/libdune-geometry-doc/changelog.gz\n -rw-r--r-- 0 root (0) root (0) 2567 2023-01-12 15:07:27.000000 ./usr/share/doc/libdune-geometry-doc/copyright\n drwxr-xr-x 0 root (0) root (0) 0 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/\n -rw-r--r-- 0 root (0) root (0) 3074 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00134.html\n -rw-r--r-- 0 root (0) root (0) 3048 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00164.html\n -rw-r--r-- 0 root (0) root (0) 3046 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00167.html\n--rw-r--r-- 0 root (0) root (0) 4306 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00170.html\n--rw-r--r-- 0 root (0) root (0) 9462 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00173.html\n--rw-r--r-- 0 root (0) root (0) 85721 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00173_source.html\n--rw-r--r-- 0 root (0) root (0) 5566 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00176.html\n--rw-r--r-- 0 root (0) root (0) 120510 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00176_source.html\n--rw-r--r-- 0 root (0) root (0) 5591 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00179.html\n--rw-r--r-- 0 root (0) root (0) 45001 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00179_source.html\n--rw-r--r-- 0 root (0) root (0) 4509 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00182.html\n--rw-r--r-- 0 root (0) root (0) 8118 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00182_source.html\n--rw-r--r-- 0 root (0) root (0) 4113 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00185.html\n--rw-r--r-- 0 root (0) root (0) 7061 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00185_source.html\n--rw-r--r-- 0 root (0) root (0) 4602 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00188.html\n--rw-r--r-- 0 root (0) root (0) 18310 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00188_source.html\n--rw-r--r-- 0 root (0) root (0) 5104 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00191.html\n--rw-r--r-- 0 root (0) root (0) 12686 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00191_source.html\n--rw-r--r-- 0 root (0) root (0) 5670 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00194.html\n--rw-r--r-- 0 root (0) root (0) 29348 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00194_source.html\n--rw-r--r-- 0 root (0) root (0) 11782 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00197.html\n--rw-r--r-- 0 root (0) root (0) 156304 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00197_source.html\n--rw-r--r-- 0 root (0) root (0) 14826 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00200.html\n--rw-r--r-- 0 root (0) root (0) 96037 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00200_source.html\n--rw-r--r-- 0 root (0) root (0) 5393 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00203.html\n--rw-r--r-- 0 root (0) root (0) 68218 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00203_source.html\n--rw-r--r-- 0 root (0) root (0) 5298 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00206.html\n--rw-r--r-- 0 root (0) root (0) 112794 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00206_source.html\n+-rw-r--r-- 0 root (0) root (0) 5566 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00170.html\n+-rw-r--r-- 0 root (0) root (0) 120510 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00170_source.html\n+-rw-r--r-- 0 root (0) root (0) 10617 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00173.html\n+-rw-r--r-- 0 root (0) root (0) 34668 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00173_source.html\n+-rw-r--r-- 0 root (0) root (0) 10327 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00176.html\n+-rw-r--r-- 0 root (0) root (0) 99412 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00176_source.html\n+-rw-r--r-- 0 root (0) root (0) 10292 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00179.html\n+-rw-r--r-- 0 root (0) root (0) 99117 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00179_source.html\n+-rw-r--r-- 0 root (0) root (0) 9691 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00182.html\n+-rw-r--r-- 0 root (0) root (0) 96970 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00182_source.html\n+-rw-r--r-- 0 root (0) root (0) 12980 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00185.html\n+-rw-r--r-- 0 root (0) root (0) 110071 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00185_source.html\n+-rw-r--r-- 0 root (0) root (0) 10133 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00188.html\n+-rw-r--r-- 0 root (0) root (0) 86387 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00188_source.html\n+-rw-r--r-- 0 root (0) root (0) 5298 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00191.html\n+-rw-r--r-- 0 root (0) root (0) 112794 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00191_source.html\n+-rw-r--r-- 0 root (0) root (0) 10072 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00194.html\n+-rw-r--r-- 0 root (0) root (0) 51406 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00194_source.html\n+-rw-r--r-- 0 root (0) root (0) 6695 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00197.html\n+-rw-r--r-- 0 root (0) root (0) 83430 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00197_source.html\n+-rw-r--r-- 0 root (0) root (0) 5393 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00200.html\n+-rw-r--r-- 0 root (0) root (0) 68218 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00200_source.html\n+-rw-r--r-- 0 root (0) root (0) 14826 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00203.html\n+-rw-r--r-- 0 root (0) root (0) 96037 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00203_source.html\n+-rw-r--r-- 0 root (0) root (0) 7985 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00206.html\n+-rw-r--r-- 0 root (0) root (0) 171804 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00206_source.html\n -rw-r--r-- 0 root (0) root (0) 7472 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00209.html\n -rw-r--r-- 0 root (0) root (0) 64525 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00209_source.html\n--rw-r--r-- 0 root (0) root (0) 6689 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00212.html\n--rw-r--r-- 0 root (0) root (0) 35005 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00212_source.html\n--rw-r--r-- 0 root (0) root (0) 10327 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00215.html\n--rw-r--r-- 0 root (0) root (0) 99412 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00215_source.html\n--rw-r--r-- 0 root (0) root (0) 10617 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00218.html\n--rw-r--r-- 0 root (0) root (0) 34668 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00218_source.html\n--rw-r--r-- 0 root (0) root (0) 10292 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00221.html\n--rw-r--r-- 0 root (0) root (0) 99117 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00221_source.html\n--rw-r--r-- 0 root (0) root (0) 12980 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00224.html\n--rw-r--r-- 0 root (0) root (0) 110071 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00224_source.html\n--rw-r--r-- 0 root (0) root (0) 9691 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00227.html\n--rw-r--r-- 0 root (0) root (0) 96970 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00227_source.html\n--rw-r--r-- 0 root (0) root (0) 10133 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00230.html\n--rw-r--r-- 0 root (0) root (0) 86387 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00230_source.html\n--rw-r--r-- 0 root (0) root (0) 5861 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00233.html\n--rw-r--r-- 0 root (0) root (0) 36533 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00233_source.html\n--rw-r--r-- 0 root (0) root (0) 7985 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00236.html\n--rw-r--r-- 0 root (0) root (0) 171804 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00236_source.html\n--rw-r--r-- 0 root (0) root (0) 5095 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00239.html\n--rw-r--r-- 0 root (0) root (0) 9366 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00239_source.html\n--rw-r--r-- 0 root (0) root (0) 7239 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00242.html\n--rw-r--r-- 0 root (0) root (0) 29450 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00242_source.html\n--rw-r--r-- 0 root (0) root (0) 10072 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00245.html\n--rw-r--r-- 0 root (0) root (0) 51406 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00245_source.html\n--rw-r--r-- 0 root (0) root (0) 6695 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00248.html\n--rw-r--r-- 0 root (0) root (0) 83430 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00248_source.html\n+-rw-r--r-- 0 root (0) root (0) 4306 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00212.html\n+-rw-r--r-- 0 root (0) root (0) 4113 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00215.html\n+-rw-r--r-- 0 root (0) root (0) 7061 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00215_source.html\n+-rw-r--r-- 0 root (0) root (0) 5104 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00218.html\n+-rw-r--r-- 0 root (0) root (0) 12686 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00218_source.html\n+-rw-r--r-- 0 root (0) root (0) 4602 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00221.html\n+-rw-r--r-- 0 root (0) root (0) 18310 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00221_source.html\n+-rw-r--r-- 0 root (0) root (0) 5095 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00224.html\n+-rw-r--r-- 0 root (0) root (0) 9366 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00224_source.html\n+-rw-r--r-- 0 root (0) root (0) 11782 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00227.html\n+-rw-r--r-- 0 root (0) root (0) 156304 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00227_source.html\n+-rw-r--r-- 0 root (0) root (0) 5670 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00230.html\n+-rw-r--r-- 0 root (0) root (0) 29348 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00230_source.html\n+-rw-r--r-- 0 root (0) root (0) 7239 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00233.html\n+-rw-r--r-- 0 root (0) root (0) 29450 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00233_source.html\n+-rw-r--r-- 0 root (0) root (0) 4509 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00236.html\n+-rw-r--r-- 0 root (0) root (0) 8118 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00236_source.html\n+-rw-r--r-- 0 root (0) root (0) 5861 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00239.html\n+-rw-r--r-- 0 root (0) root (0) 36533 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00239_source.html\n+-rw-r--r-- 0 root (0) root (0) 9462 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00242.html\n+-rw-r--r-- 0 root (0) root (0) 85721 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00242_source.html\n+-rw-r--r-- 0 root (0) root (0) 5591 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00245.html\n+-rw-r--r-- 0 root (0) root (0) 45001 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00245_source.html\n+-rw-r--r-- 0 root (0) root (0) 6689 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00248.html\n+-rw-r--r-- 0 root (0) root (0) 35005 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00248_source.html\n -rw-r--r-- 0 root (0) root (0) 5067 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00252.html\n -rw-r--r-- 0 root (0) root (0) 11280 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00252.png\n -rw-r--r-- 0 root (0) root (0) 5015 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00253.html\n -rw-r--r-- 0 root (0) root (0) 3926 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00253.png\n -rw-r--r-- 0 root (0) root (0) 57623 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00254.html\n -rw-r--r-- 0 root (0) root (0) 3734 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00254.png\n -rw-r--r-- 0 root (0) root (0) 3474 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/a00255.html\n@@ -319,15 +319,15 @@\n -rw-r--r-- 0 root (0) root (0) 3162 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_8c28f2953344a167049ba6db5a27148a_dep.png\n -rw-r--r-- 0 root (0) root (0) 7098 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_b609f53bbb5e26b8e9292001c59476a3.html\n -rw-r--r-- 0 root (0) root (0) 2492 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_b609f53bbb5e26b8e9292001c59476a3_dep.png\n -rw-r--r-- 0 root (0) root (0) 4025 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_de8ef2d1b4283b99fcb86ec9d2fa66db.html\n -rw-r--r-- 0 root (0) root (0) 1994 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_de8ef2d1b4283b99fcb86ec9d2fa66db_dep.png\n -rw-r--r-- 0 root (0) root (0) 3988 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dir_e68e8157741866f444e17edd764ebbae.html\n -rw-r--r-- 0 root (0) root (0) 45631 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/doxygen.css\n--rw-r--r-- 0 root (0) root (0) 29037 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dune-geometry.tag.gz\n+-rw-r--r-- 0 root (0) root (0) 29039 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dune-geometry.tag.gz\n -rw-r--r-- 0 root (0) root (0) 7704 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/dynsections.js\n -rw-r--r-- 0 root (0) root (0) 14807 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/files.html\n -rw-r--r-- 0 root (0) root (0) 836 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/form_0.png\n -rw-r--r-- 0 root (0) root (0) 929 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/form_0_dark.png\n -rw-r--r-- 0 root (0) root (0) 2566 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/form_1.png\n -rw-r--r-- 0 root (0) root (0) 1385 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/form_10.png\n -rw-r--r-- 0 root (0) root (0) 354 2024-11-14 18:01:13.000000 ./usr/share/doc/libdune-geometry-doc/doxygen/form_100.png\n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00170.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00170.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelementimplementation.cc File Reference\n+dune-geometry: affinegeometry.hh File Reference\n \n \n \n \n \n \n \n@@ -70,27 +70,45 @@\n
\n \n
\n \n
\n
\n+Classes |\n Namespaces
\n-
referenceelementimplementation.cc File Reference
\n+
affinegeometry.hh File Reference
\n
\n
\n-
#include <dune/geometry/referenceelementimplementation.hh>
\n-
\n+\n+

An implementation of the Geometry interface for affine geometries. \n+More...

\n+
#include <cmath>
\n+#include <dune/common/fmatrix.hh>
\n+#include <dune/common/fvector.hh>
\n+#include <dune/geometry/type.hh>
\n+
\n+

Go to the source code of this file.

\n+
\n+\n+\n+\n+\n+

\n+Classes

class  Dune::AffineGeometry< ct, mydim, cdim >
 Implementation of the Geometry interface for affine geometries. More...
 
\n \n \n \n \n \n

\n Namespaces

namespace  Dune
 
namespace  Dune::Geo
 
\n-
\n+

Detailed Description

\n+

An implementation of the Geometry interface for affine geometries.

\n+
Author
Martin Nolte
\n+
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,16 +1,29 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-referenceelementimplementation.cc File Reference\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+affinegeometry.hh File Reference\n+An implementation of the Geometry interface for affine geometries. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+_\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n+\u00a0 Implementation of the Geometry interface for affine geometries. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n \u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+An implementation of the Geometry interface for affine geometries.\n+ Author\n+ Martin Nolte\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00173.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00173.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: localfiniteelementgeometry.hh File Reference\n+dune-geometry: base.cc File Reference\n \n \n \n \n \n \n \n@@ -65,70 +65,87 @@\n \n \n \n \n \n \n \n
\n \n-
localfiniteelementgeometry.hh File Reference
\n+
base.cc File Reference
\n
\n
\n-
#include <cassert>
\n-#include <functional>
\n-#include <limits>
\n-#include <type_traits>
\n-#include <vector>
\n-#include <dune/common/fmatrix.hh>
\n-#include <dune/common/fvector.hh>
\n-#include <dune/common/math.hh>
\n-#include <dune/common/typetraits.hh>
\n-#include <dune/common/std/type_traits.hh>
\n-#include <dune/geometry/affinegeometry.hh>
\n-#include <dune/geometry/quadraturerules.hh>
\n-#include <dune/geometry/referenceelements.hh>
\n-#include <dune/geometry/type.hh>
\n-#include <dune/geometry/utility/algorithms.hh>
\n-#include <dune/geometry/utility/convergence.hh>
\n+\n+

This file contains the parts independent of a particular Refinement implementation. \n+More...

\n+
#include <dune/geometry/type.hh>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

class  Dune::LocalFiniteElementGeometry< LFE, cdim >
 Geometry implementation based on local-basis function parametrization. More...
struct  Dune::RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension, Dummy >
 Mapping from geometryType, CoordType and coerceTo to a particular Refinement implementation. More...
 
class  Dune::RefinementIntervals
 Holds the number of refined intervals per axis needed for virtual and static refinement. More...
 
class  Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension_ >
 Wrap each Refinement implementation to get a consistent interface. More...
 
struct  Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension_ >::Codim< codimension >
 The Codim struct inherited from the Refinement implementation. More...
 
\n \n \n \n+\n+\n+\n+

\n Namespaces

namespace  Dune
 
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
\n+\n+\n+\n

\n+Macros

#define DUNE_GEOMETRY_REFINEMENT_BASE_CC
 
\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n

\n Functions

template<class I , class LFE , class GlobalCoordinate >
 Dune::LocalFiniteElementGeometry (Geo::ReferenceElement< I >, const LFE &, std::vector< GlobalCoordinate >) -> LocalFiniteElementGeometry< LFE, GlobalCoordinate::dimension >
 
template<class I , class LFE , class F , class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
 Dune::LocalFiniteElementGeometry (Geo::ReferenceElement< I >, const LFE &, const F &) -> LocalFiniteElementGeometry< LFE, Range::dimension >
 
template<class LFE , class GlobalCoordinate >
 Dune::LocalFiniteElementGeometry (GeometryType, const LFE &localFE, std::vector< GlobalCoordinate >) -> LocalFiniteElementGeometry< LFE, GlobalCoordinate::dimension >
 
template<class LFE , class F , class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
 Dune::LocalFiniteElementGeometry (GeometryType, const LFE &, const F &) -> LocalFiniteElementGeometry< LFE, Range::dimension >
 
RefinementIntervals Dune::refinementIntervals (int intervals)
 Creates a RefinementIntervals object.
 
RefinementIntervals Dune::refinementLevels (int levels)
 Creates a RefinementIntervals object.
 
\n+

Detailed Description

\n+

This file contains the parts independent of a particular Refinement implementation.

\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GEOMETRY_REFINEMENT_BASE_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GEOMETRY_REFINEMENT_BASE_CC
\n+
\n+\n+
\n+
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,56 +1,56 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-localfiniteelementgeometry.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+base.cc File Reference\n+This file contains the parts independent of a particular _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bL_\bF_\bE_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n-\u00a0 Geometry implementation based on local-basis function parametrization.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bD_\bu_\bm_\bm_\by_\b _\b>\n+\u00a0 Mapping from g\bge\beo\bom\bme\bet\btr\bry\byT\bTy\byp\bpe\be, C\bCo\boo\bor\brd\bdT\bTy\byp\bpe\be and c\bco\boe\ber\brc\bce\beT\bTo\bo to a particular\n+ _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+\u00a0 Holds the number of refined intervals per axis needed for virtual and\n+ static refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b_\n+ _\b>\n+\u00a0 Wrap each _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation to get a consistent interface.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b_\n+ _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0 The _\bC_\bo_\bd_\bi_\bm struct inherited from the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bB_\bA_\bS_\bE_\b__\bC_\bC\n+\u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt< I >, const LFE &,\n- std::vector< GlobalCoordinate >) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE,\n- GlobalCoordinate::dimension >\n-\u00a0\n-template>>\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt< I >, const LFE &,\n- const F &) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE, Range::dimension >\n-\u00a0\n-template\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE &localFE, std::\n- vector< GlobalCoordinate >) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE,\n- GlobalCoordinate::dimension >\n-\u00a0\n-template>>\n-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE &, const F &) -\n- > _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE, Range::dimension >\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs (int intervals)\n+\u00a0 Creates a _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs object.\n+\u00a0\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs (int levels)\n+\u00a0 Creates a _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs object.\n \u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+This file contains the parts independent of a particular _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+implementation.\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_B\bBA\bAS\bSE\bE_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_REFINEMENT_BASE_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00173_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00173_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: localfiniteelementgeometry.hh Source File\n+dune-geometry: base.cc Source File\n \n \n \n \n \n \n \n@@ -70,439 +70,199 @@\n
\n \n \n \n \n \n \n
\n-
localfiniteelementgeometry.hh
\n+
base.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
\n-
6#define DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
\n+
5#ifndef DUNE_GEOMETRY_REFINEMENT_BASE_CC
\n+
6#define DUNE_GEOMETRY_REFINEMENT_BASE_CC
\n
7
\n-
8#include <cassert>
\n-
9#include <functional>
\n-
10#include <limits>
\n-
11#include <type_traits>
\n-
12#include <vector>
\n-
13
\n-
14#include <dune/common/fmatrix.hh>
\n-
15#include <dune/common/fvector.hh>
\n-
16#include <dune/common/math.hh>
\n-
17#include <dune/common/typetraits.hh>
\n-
18#include <dune/common/std/type_traits.hh>
\n-
19
\n-
20#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
\n-\n-\n-
23#include <dune/geometry/type.hh>
\n-\n-\n-
26
\n-
27namespace Dune {
\n-
28
\n-
38template <class LFE, int cdim>
\n-
\n-\n-
40{
\n-
41 using LocalFiniteElement = LFE;
\n-
42 using LocalBasis = typename LFE::Traits::LocalBasisType;
\n-
43 using LocalBasisTraits = typename LocalBasis::Traits;
\n-
44
\n-
45public:
\n-
47 using ctype = typename LocalBasisTraits::DomainFieldType;
\n-
48
\n-
50 static const int mydimension = LocalBasisTraits::dimDomain;
\n-
51
\n-
53 static const int coorddimension = cdim;
\n-
54
\n-
56 using LocalCoordinate = FieldVector<ctype, mydimension>;
\n-
57
\n-
59 using GlobalCoordinate = FieldVector<ctype, coorddimension>;
\n-
60
\n-
62 using Volume = decltype(power(std::declval<ctype>(),mydimension));
\n-
63
\n-
65 using Jacobian = FieldMatrix<ctype, coorddimension, mydimension>;
\n-
66
\n-
68 using JacobianTransposed = FieldMatrix<ctype, mydimension, coorddimension>;
\n-
69
\n-
71 using JacobianInverse = FieldMatrix<ctype, mydimension, coorddimension>;
\n-
72
\n-
74 using JacobianInverseTransposed = FieldMatrix<ctype, coorddimension, mydimension>;
\n-
75
\n-
76public:
\n-\n-\n-
80
\n-
81protected:
\n-
82 using MatrixHelper = Impl::FieldMatrixHelper<ctype>;
\n-
83
\n-
84public:
\n-\n-
87
\n-
\n-\n-
104 const LocalFiniteElement& localFE,
\n-
105 std::vector<GlobalCoordinate> vertices)
\n-
106 : refElement_(refElement)
\n-
107 , localFE_(localFE)
\n-
108 , vertices_(std::move(vertices))
\n+
15#include <dune/geometry/type.hh>
\n+
16
\n+
17namespace Dune
\n+
18{
\n+
\n+
28 namespace RefinementImp
\n+
29 {
\n+
30 // /////////////////////////////////
\n+
31 //
\n+
32 // Declaration of RefinementImp::Traits
\n+
33 //
\n+
34
\n+
35#ifdef DOXYGEN
\n+
36 // This is just for Doxygen
\n+
67 template<unsigned topologyId, class CoordType,
\n+
68 unsigned coerceToId, int dimension, class Dummy = void>
\n+
\n+
69 struct Traits
\n+
70 {
\n+
72 typedef SquaringTheCircle::Refinement Imp;
\n+
73 };
\n+
\n+
74
\n+
75#else // !DOXYGEN
\n+
76
\n+
77 // Doxygen won't see this
\n+
78
\n+
79 template<unsigned topologyId, class CoordType,
\n+
80 unsigned coerceToId, int dimension, class = void>
\n+
81 struct Traits;
\n+
82
\n+
83#endif // !DOXYGEN
\n+
84 } // namespace RefinementImp
\n+
\n+
85
\n+
86
\n+
\n+\n+
95 int intervals_=1;
\n+
96
\n+
97 public:
\n+
98 explicit RefinementIntervals(int i) : intervals_(i) {}
\n+
99
\n+
100 int intervals() const { return intervals_; }
\n+
101 };
\n+
\n+
102
\n+
\n+\n
109 {
\n-
110 assert(localFE_.size() == vertices_.size());
\n+
110 return RefinementIntervals{intervals};
\n
111 }
\n
\n-
112
\n-
126 template <class Param,
\n-
127 std::enable_if_t<std::is_invocable_r_v<GlobalCoordinate,Param,LocalCoordinate>, int> = 0>
\n-
\n-\n-
129 const LocalFiniteElement& localFE,
\n-
130 Param&& parametrization)
\n-
131 : refElement_(refElement)
\n-
132 , localFE_(localFE)
\n-
133 {
\n-
134 localFE_.localInterpolation().interpolate(parametrization, vertices_);
\n-
135 }
\n-
\n-
136
\n-
143 template <class... Args>
\n-
\n-
144 explicit LocalFiniteElementGeometry (GeometryType gt, Args&&... args)
\n-
145 : LocalFiniteElementGeometry(ReferenceElements::general(gt), std::forward<Args>(args)...)
\n-
146 {}
\n-
\n-
147
\n-
\n-
149 int order () const
\n-
150 {
\n-
151 return localBasis().order();
\n-
152 }
\n-
\n-
153
\n-
\n-
159 bool affine () const
\n-
160 {
\n-
161 if (!affine_)
\n-
162 affine_.emplace(affineImpl());
\n-
163 return *affine_;
\n-
164 }
\n-
\n-
165
\n-
\n-\n-
168 {
\n-
169 return refElement_.type();
\n-
170 }
\n-
\n+
\n+\n+
118 {
\n+
119 return RefinementIntervals{1<<levels};
\n+
120 }
\n+
\n+
121
\n+
122 // ///////////////
\n+
123 //
\n+
124 // Static Refinement
\n+
125 //
\n+
126
\n+
136 template<unsigned topologyId, class CoordType,
\n+
137 unsigned coerceToId, int dimension_>
\n+
\n+\n+
139 : public RefinementImp::Traits<topologyId, CoordType,
\n+
140 coerceToId, dimension_ >::Imp
\n+
141 {
\n+
142 public:
\n+
143#ifdef DOXYGEN
\n+
149 template<int codimension>
\n+
\n+
150 struct Codim
\n+
151 {
\n+\n+
158 };
\n+
\n+
159
\n+\n+\n+
164
\n+
170 typedef CoordVector;
\n
171
\n-
\n-
173 int corners () const
\n-
174 {
\n-
175 return refElement_.size(mydimension);
\n-
176 }
\n-
\n-
177
\n-
\n-\n-
180 {
\n-
181 assert( (i >= 0) && (i < corners()) );
\n-
182 return global(refElement_.position(i, mydimension));
\n-
183 }
\n-
\n-
184
\n-
\n-\n-
187 {
\n-
188 return global(refElement_.position(0, 0));
\n-
189 }
\n-
\n-
190
\n-
\n-\n-
203 {
\n-
204 thread_local std::vector<typename LocalBasisTraits::RangeType> shapeValues;
\n-
205 localBasis().evaluateFunction(local, shapeValues);
\n-
206 assert(shapeValues.size() == vertices_.size());
\n-
207
\n-
208 GlobalCoordinate out(0);
\n-
209 for (std::size_t i = 0; i < shapeValues.size(); ++i)
\n-
210 out.axpy(shapeValues[i], vertices_[i]);
\n-
211
\n-
212 return out;
\n-
213 }
\n+
177 typedef IndexVector;
\n+
178#endif
\n+
179
\n+
180 typedef typename RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_>::Imp RefinementImp;
\n+
181
\n+
182 using RefinementImp::dimension;
\n+
183
\n+
184 using RefinementImp::Codim;
\n+
185
\n+
186 using typename RefinementImp::VertexIterator;
\n+
187 using typename RefinementImp::CoordVector;
\n+
188
\n+
189 using typename RefinementImp::ElementIterator;
\n+
190 using typename RefinementImp::IndexVector;
\n+
191
\n+
\n+\n+
198 {
\n+
199 return RefinementImp::nVertices(tag.intervals());
\n+
200 }
\n+
\n+
201
\n+
\n+\n+
208 {
\n+
209 return RefinementImp::vBegin(tag.intervals());
\n+
210 }
\n
\n-
214
\n-
\n-
232 LocalCoordinate local (const GlobalCoordinate& y, Impl::GaussNewtonOptions<ctype> opts = {}) const
\n-
233 {
\n-
234 LocalCoordinate x = refElement_.position(0,0);
\n-
235 Impl::GaussNewtonErrorCode err = Impl::gaussNewton(
\n-
236 [&](const LocalCoordinate& local) { return this->global(local); },
\n-
237 [&](const LocalCoordinate& local) { return this->jacobianTransposed(local); },
\n-
238 y, x, opts
\n-
239 );
\n-
240
\n-
241 if (err != Impl::GaussNewtonErrorCode::OK)
\n-
242 DUNE_THROW(Dune::Exception,
\n-
243 "Local coordinate can not be recovered from global coordinate, error code = " << int(err) << "\\n"
\n-
244 << " (global(x) - y).two_norm() = " << (global(x) - y).two_norm()
\n-
245 << " > tol = " << opts.absTol);
\n-
246
\n-
247 return x;
\n-
248 }
\n-
\n-
249
\n-
\n-\n-
261 {
\n-
262 return MatrixHelper::sqrtDetAAT(jacobianTransposed(local));
\n-
263 }
\n-
\n-
264
\n-
\n-
276 Volume volume (Impl::ConvergenceOptions<ctype> opts = {}) const
\n-
277 {
\n-\n-
279 if (affine())
\n-
280 return vol0;
\n-
281
\n-
282 using std::abs;
\n-
283 for (int p = 2; p < opts.maxIt; ++p) {
\n-\n-
285 if (abs(vol1 - vol0) < opts.absTol)
\n-
286 return vol1;
\n-
287
\n-
288 vol0 = vol1;
\n-
289 }
\n-
290 return vol0;
\n-
291 }
\n-
\n-
292
\n-
\n-\n-
295 {
\n-
296 Volume vol(0);
\n-
297 for (const auto& qp : quadRule)
\n-
298 vol += integrationElement(qp.position()) * qp.weight();
\n-
299 return vol;
\n-
300 }
\n-
\n-
301
\n-
\n-\n-
308 {
\n-
309 thread_local std::vector<typename LocalBasisTraits::JacobianType> shapeJacobians;
\n-
310 localBasis().evaluateJacobian(local, shapeJacobians);
\n-
311 assert(shapeJacobians.size() == vertices_.size());
\n-
312
\n-
313 Jacobian out(0);
\n-
314 for (std::size_t i = 0; i < shapeJacobians.size(); ++i) {
\n-
315 for (int j = 0; j < Jacobian::rows; ++j) {
\n-
316 shapeJacobians[i].umtv(vertices_[i][j], out[j]);
\n-
317 }
\n-
318 }
\n-
319 return out;
\n-
320 }
\n-
\n-
321
\n-
\n-\n-
328 {
\n-
329 return jacobian(local).transposed();
\n-
330 }
\n-
\n-
331
\n-
\n-\n-
340 {
\n-
341 JacobianInverse out;
\n-
342 MatrixHelper::leftInvA(jacobian(local), out);
\n-
343 return out;
\n-
344 }
\n-
\n-
345
\n-
\n-\n-
354 {
\n-
355 return jacobianInverse(local).transposed();
\n-
356 }
\n-
\n-
357
\n-
\n-\n-
360 {
\n-
361 return geometry.refElement_;
\n-
362 }
\n-
\n-
363
\n-
\n-
365 const LocalFiniteElement& finiteElement () const
\n-
366 {
\n-
367 return localFE_;
\n-
368 }
\n-
\n-
369
\n-
\n-
371 const std::vector<GlobalCoordinate>& coefficients () const
\n-
372 {
\n-
373 return vertices_;
\n-
374 }
\n-
\n-
375
\n-
\n-
377 const LocalBasis& localBasis () const
\n-
378 {
\n-
379 return localFE_.localBasis();
\n-
380 }
\n-
\n-
381
\n-
382private:
\n-
383
\n-
384 bool affineImpl () const
\n-
385 {
\n-
386 if constexpr(mydimension == 0)
\n-
387 // point geometries are always affine mappings
\n-
388 return true;
\n-
389 else {
\n-
390 if (order() > 1)
\n-
391 // higher-order parametrizations are by definition not affine
\n-
392 return false;
\n-
393 if constexpr(mydimension == 1)
\n-
394 // linear line geometries are affine mappings
\n-
395 return true;
\n-
396 else {
\n-
397 if (type().isSimplex())
\n-
398 // linear simplex geometries are affine mappings
\n-
399 return true;
\n-
400
\n-
401 // multi-linear mappings on non-simplex geometries might be affine
\n-
402 // as well. This is tested explicitly for all vertices by constructing
\n-
403 // an affine mapping from dim+1 affine-independent corners and evaluating
\n-
404 // at the other corners.
\n-
405 auto refSimplex = referenceElement<ctype,mydimension>(GeometryTypes::simplex(mydimension));
\n-
406 auto simplexIndices = Dune::range(refSimplex.size(mydimension));
\n-
407 auto simplexCorners = Dune::transformedRangeView(simplexIndices,
\n-
408 [&](int i) { return this->global(refSimplex.position(i,mydimension)); });
\n-
409 AffineGeometry<ctype,mydimension,coorddimension> affineGeo(refSimplex,simplexCorners);
\n-
410 using std::sqrt;
\n-
411 const ctype tol = sqrt(std::numeric_limits<ctype>::epsilon());
\n-
412 for (int i = 0; i < corners(); ++i) {
\n-
413 const auto corner = refElement_.position(i,mydimension);
\n-
414 if ((affineGeo.global(corner) - global(corner)).two_norm() > tol)
\n-
415 return false;
\n-
416 }
\n-
417 return true;
\n-
418 }
\n-
419 }
\n-
420 }
\n-
421
\n-
422private:
\n-
424 ReferenceElement refElement_{};
\n-
425
\n-
427 LocalFiniteElement localFE_{};
\n-
428
\n-
430 std::vector<GlobalCoordinate> vertices_{};
\n-
431
\n-
432 mutable std::optional<bool> affine_ = std::nullopt;
\n-
433};
\n-
\n-
434
\n-
435namespace Impl {
\n-
436
\n-
437// extract the LocalCoordinate type from a LocalFiniteElement
\n-
438template <class LFE>
\n-
439using LocalCoordinate_t
\n-
440 = FieldVector<typename LFE::Traits::LocalBasisType::Traits::DomainFieldType,
\n-
441 LFE::Traits::LocalBasisType::Traits::dimDomain>;
\n-
442
\n-
443} // end namespace Impl
\n-
444
\n-
445
\n-
446// deduction guides
\n-
447template <class I, class LFE, class GlobalCoordinate>
\n-
448LocalFiniteElementGeometry (Geo::ReferenceElement<I>, const LFE&, std::vector<GlobalCoordinate>)
\n-\n-
450
\n-
451template <class I, class LFE, class F,
\n-
452 class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
\n-\n-\n-
455
\n-
456template <class LFE, class GlobalCoordinate>
\n-
457LocalFiniteElementGeometry (GeometryType, const LFE& localFE, std::vector<GlobalCoordinate>)
\n-\n-
459
\n-
460template <class LFE, class F,
\n-
461 class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
\n-\n-\n-
464
\n-
465} // namespace Dune
\n-
466
\n-
467#endif // DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
\n-
An implementation of the Geometry interface for affine geometries.
\n-\n-\n-\n-\n-
A unique label for each type of element that can occur in a grid.
\n-
STL namespace.
\n+
211
\n+
\n+\n+
218 {
\n+
219 return RefinementImp::vEnd(tag.intervals());
\n+
220 }
\n+
\n+
221
\n+
\n+\n+
228 {
\n+
229 return RefinementImp::nElements(tag.intervals());
\n+
230 }
\n+
\n+
231
\n+
\n+\n+
238 {
\n+
239 return RefinementImp::eBegin(tag.intervals());
\n+
240 }
\n+
\n+
241
\n+
\n+\n+
248 {
\n+
249 return RefinementImp::eEnd(tag.intervals());
\n+
250 }
\n+
\n+
251 };
\n+
\n+
252
\n+
254} // namespace Dune
\n+
255
\n+
256#endif // DUNE_GEOMETRY_REFINEMENT_BASE_CC
\n+
A unique label for each type of element that can occur in a grid.
\n+
RefinementIntervals refinementIntervals(int intervals)
Creates a RefinementIntervals object.
Definition base.cc:108
\n+
RefinementIntervals refinementLevels(int levels)
Creates a RefinementIntervals object.
Definition base.cc:117
\n
Definition affinegeometry.hh:21
\n-
This class provides access to geometric and topological properties of a reference element.
Definition referenceelement.hh:52
\n-
Class providing access to the singletons of the reference elements.
Definition referenceelements.hh:128
\n-
typename Container::ReferenceElement ReferenceElement
The reference element type.
Definition referenceelements.hh:146
\n-
Geometry implementation based on local-basis function parametrization.
Definition localfiniteelementgeometry.hh:40
\n-
GeometryType type() const
Obtain the name of the reference element.
Definition localfiniteelementgeometry.hh:167
\n-
decltype(power(std::declval< ctype >(), mydimension)) Volume
type of volume
Definition localfiniteelementgeometry.hh:62
\n-
LocalCoordinate local(const GlobalCoordinate &y, Impl::GaussNewtonOptions< ctype > opts={}) const
Evaluate the inverse coordinate mapping.
Definition localfiniteelementgeometry.hh:232
\n-
LocalFiniteElementGeometry(const ReferenceElement &refElement, const LocalFiniteElement &localFE, std::vector< GlobalCoordinate > vertices)
Constructor from a vector of coefficients of the LocalBasis parametrizing the geometry.
Definition localfiniteelementgeometry.hh:103
\n-
JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
Obtain the transposed of the Jacobian.
Definition localfiniteelementgeometry.hh:327
\n-
const LocalBasis & localBasis() const
The local basis of the stored local finite-element.
Definition localfiniteelementgeometry.hh:377
\n-
typename LocalBasisTraits::DomainFieldType ctype
coordinate type
Definition localfiniteelementgeometry.hh:47
\n-
JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
Obtain the transposed of the Jacobian's inverse.
Definition localfiniteelementgeometry.hh:353
\n-
friend ReferenceElement referenceElement(const LocalFiniteElementGeometry &geometry)
Obtain the reference-element related to this geometry.
Definition localfiniteelementgeometry.hh:359
\n-
LocalFiniteElementGeometry()=default
Default constructed geometry results in an empty/invalid representation.
\n-
bool affine() const
Is this mapping affine? Geometries of order 1 might be affine, but it needs to be checked on non-simp...
Definition localfiniteelementgeometry.hh:159
\n-
Jacobian jacobian(const LocalCoordinate &local) const
Obtain the Jacobian.
Definition localfiniteelementgeometry.hh:307
\n-
Volume volume(const QuadratureRule< ctype, mydimension > &quadRule) const
Obtain the volume of the mapping's image by given quadrature rules.
Definition localfiniteelementgeometry.hh:294
\n-
const std::vector< GlobalCoordinate > & coefficients() const
Obtain the coefficients of the parametrization.
Definition localfiniteelementgeometry.hh:371
\n-
LocalFiniteElementGeometry(GeometryType gt, Args &&... args)
Constructor, forwarding to the other constructors that take a reference-element.
Definition localfiniteelementgeometry.hh:144
\n-
static const int coorddimension
coordinate dimension
Definition localfiniteelementgeometry.hh:53
\n-
int corners() const
Obtain number of corners of the corresponding reference element.
Definition localfiniteelementgeometry.hh:173
\n-
GlobalCoordinate center() const
Obtain the centroid of the mapping's image.
Definition localfiniteelementgeometry.hh:186
\n-
const LocalFiniteElement & finiteElement() const
Obtain the local finite-element.
Definition localfiniteelementgeometry.hh:365
\n-
GlobalCoordinate global(const LocalCoordinate &local) const
Evaluate the coordinate mapping.
Definition localfiniteelementgeometry.hh:202
\n-
Impl::FieldMatrixHelper< ctype > MatrixHelper
Definition localfiniteelementgeometry.hh:82
\n-
typename ReferenceElements::ReferenceElement ReferenceElement
Definition localfiniteelementgeometry.hh:79
\n-
GlobalCoordinate corner(int i) const
Obtain coordinates of the i-th corner.
Definition localfiniteelementgeometry.hh:179
\n-
Volume volume(Impl::ConvergenceOptions< ctype > opts={}) const
Obtain the volume of the mapping's image.
Definition localfiniteelementgeometry.hh:276
\n-
static const int mydimension
geometry dimension
Definition localfiniteelementgeometry.hh:50
\n-
JacobianInverse jacobianInverse(const LocalCoordinate &local) const
Obtain the Jacobian's inverse.
Definition localfiniteelementgeometry.hh:339
\n-
FieldVector< ctype, coorddimension > GlobalCoordinate
type of global coordinates
Definition localfiniteelementgeometry.hh:59
\n-
FieldMatrix< ctype, coorddimension, mydimension > Jacobian
type of jacobian
Definition localfiniteelementgeometry.hh:65
\n-
FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed
type of jacobian inverse transposed
Definition localfiniteelementgeometry.hh:74
\n-
FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse
type of jacobian inverse
Definition localfiniteelementgeometry.hh:71
\n-
ctype integrationElement(const LocalCoordinate &local) const
Obtain the integration element.
Definition localfiniteelementgeometry.hh:260
\n-
int order() const
Obtain the (highest) polynomial order of the parametrization.
Definition localfiniteelementgeometry.hh:149
\n-
FieldVector< ctype, mydimension > LocalCoordinate
type of local coordinates
Definition localfiniteelementgeometry.hh:56
\n-
FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed
type of jacobian transposed
Definition localfiniteelementgeometry.hh:68
\n-
LocalFiniteElementGeometry(const ReferenceElement &refElement, const LocalFiniteElement &localFE, Param &&parametrization)
Constructor from a local parametrization function, mapping local to (curved) global coordinates.
Definition localfiniteelementgeometry.hh:128
\n-
Abstract base class for quadrature rules.
Definition quadraturerules.hh:214
\n-
A container for all quadrature rules of dimension dim
Definition quadraturerules.hh:260
\n-
Unique label for each type of entities that can occur in DUNE grids.
Definition type.hh:114
\n-
constexpr bool isSimplex() const
Return true if entity is a simplex of any dimension.
Definition type.hh:319
\n+
Mapping from geometryType, CoordType and coerceTo to a particular Refinement implementation.
Definition base.cc:70
\n+
Holds the number of refined intervals per axis needed for virtual and static refinement.
Definition base.cc:94
\n+
RefinementIntervals(int i)
Definition base.cc:98
\n+
int intervals() const
Definition base.cc:100
\n+
Wrap each Refinement implementation to get a consistent interface.
Definition base.cc:141
\n+
static ElementIterator eEnd(Dune::RefinementIntervals tag)
Get an ElementIterator.
Definition base.cc:247
\n+
static ElementIterator eBegin(Dune::RefinementIntervals tag)
Get an ElementIterator.
Definition base.cc:237
\n+
static int nElements(Dune::RefinementIntervals tag)
Get the number of Elements.
Definition base.cc:227
\n+
Codim< 0 >::SubEntityIterator ElementIterator
The ElementIterator of the Refinement.
Definition base.cc:163
\n+
static int nVertices(Dune::RefinementIntervals tag)
Get the number of Vertices.
Definition base.cc:197
\n+
static VertexIterator vBegin(Dune::RefinementIntervals tag)
Get a VertexIterator.
Definition base.cc:207
\n+
Codim< dimension >::SubEntityIterator VertexIterator
The VertexIterator of the Refinement.
Definition base.cc:161
\n+
typedef CoordVector
The CoordVector of the Refinement.
Definition base.cc:170
\n+
typedef IndexVector
The IndexVector of the Refinement.
Definition base.cc:177
\n+
RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_ >::Imp RefinementImp
Definition base.cc:180
\n+
static VertexIterator vEnd(Dune::RefinementIntervals tag)
Get a VertexIterator.
Definition base.cc:217
\n+
The Codim struct inherited from the Refinement implementation.
Definition base.cc:151
\n+
typedef SubEntityIterator
The SubEntityIterator for each codim.
Definition base.cc:157
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,531 +1,223 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-localfiniteelementgeometry.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+base.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n-6#define DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_BASE_CC\n+_\b6#define DUNE_GEOMETRY_REFINEMENT_BASE_CC\n 7\n-8#include \n-9#include \n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17#include \n-18#include \n-19\n-20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh> // for FieldMatrixHelper\n-21#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh>\n-22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-24#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh>\n-25#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh>\n-26\n-27namespace _\bD_\bu_\bn_\be {\n-28\n-38template \n-_\b3_\b9class _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-40{\n-41 using LocalFiniteElement = LFE;\n-42 using LocalBasis = typename LFE::Traits::LocalBasisType;\n-43 using LocalBasisTraits = typename LocalBasis::Traits;\n-44\n-45public:\n-_\b4_\b7 using _\bc_\bt_\by_\bp_\be = typename LocalBasisTraits::DomainFieldType;\n-48\n-_\b5_\b0 static const int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = LocalBasisTraits::dimDomain;\n-51\n-_\b5_\b3 static const int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = cdim;\n-54\n-_\b5_\b6 using _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = FieldVector;\n-57\n-_\b5_\b9 using _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = FieldVector;\n-60\n-_\b6_\b2 using _\bV_\bo_\bl_\bu_\bm_\be = decltype(power(std::declval(),_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n-63\n-_\b6_\b5 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn = FieldMatrix;\n-66\n-_\b6_\b8 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd = FieldMatrix;\n-69\n-_\b7_\b1 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be = FieldMatrix;\n-72\n-_\b7_\b4 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd = FieldMatrix;\n-75\n-76public:\n-_\b7_\b8 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs = _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n-_\b7_\b9 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-80\n-81protected:\n-_\b8_\b2 using _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br = Impl::FieldMatrixHelper;\n-83\n-84public:\n-_\b8_\b6 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by () = default;\n-87\n-_\b1_\b0_\b3 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& refElement,\n-104 const LocalFiniteElement& localFE,\n-105 std::vector vertices)\n-106 : refElement_(refElement)\n-107 , localFE_(localFE)\n-108 , vertices_(_\bs_\bt_\bd::move(vertices))\n+15#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+16\n+17namespace _\bD_\bu_\bn_\be\n+18{\n+_\b2_\b8 namespace RefinementImp\n+29 {\n+30 // /////////////////////////////////\n+31 //\n+32 // Declaration of RefinementImp::Traits\n+33 //\n+34\n+35#ifdef DOXYGEN\n+36 // This is just for Doxygen\n+67 template\n+_\b6_\b9 struct _\bT_\br_\ba_\bi_\bt_\bs\n+70 {\n+72 typedef SquaringTheCircle::Refinement Imp;\n+73 };\n+74\n+75#else // !DOXYGEN\n+76\n+77 // Doxygen won't see this\n+78\n+79 template\n+81 struct _\bT_\br_\ba_\bi_\bt_\bs;\n+82\n+83#endif // !DOXYGEN\n+84 } // namespace RefinementImp\n+85\n+86\n+_\b9_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{\n+95 int intervals_=1;\n+96\n+97 public:\n+_\b9_\b8 explicit _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs(int i) : intervals_(i) {}\n+99\n+_\b1_\b0_\b0 int _\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs() const { return intervals_; }\n+101 };\n+102\n+_\b1_\b0_\b8 inline _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs(int intervals)\n 109 {\n-110 assert(localFE_.size() == vertices_.size());\n+110 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{intervals};\n 111 }\n-112\n-126 template , int> = 0>\n-_\b1_\b2_\b8 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& refElement,\n-129 const LocalFiniteElement& localFE,\n-130 Param&& parametrization)\n-131 : refElement_(refElement)\n-132 , localFE_(localFE)\n-133 {\n-134 localFE_.localInterpolation().interpolate(parametrization, vertices_);\n-135 }\n-136\n-143 template \n-_\b1_\b4_\b4 explicit _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, Args&&... args)\n-145 : _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general(gt), _\bs_\bt_\bd::\n-forward(args)...)\n-146 {}\n-147\n-_\b1_\b4_\b9 int _\bo_\br_\bd_\be_\br () const\n-150 {\n-151 return _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().order();\n-152 }\n-153\n-_\b1_\b5_\b9 bool _\ba_\bf_\bf_\bi_\bn_\be () const\n-160 {\n-161 if (!affine_)\n-162 affine_.emplace(affineImpl());\n-163 return *affine_;\n-164 }\n-165\n-_\b1_\b6_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const\n-168 {\n-169 return refElement_.type();\n-170 }\n+_\b1_\b1_\b7 inline _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs(int levels)\n+118 {\n+119 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{1<\n+_\b1_\b3_\b8 class _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+139 : public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs::Imp\n+141 {\n+142 public:\n+143#ifdef DOXYGEN\n+149 template\n+_\b1_\b5_\b0 struct _\bC_\bo_\bd_\bi_\bm\n+151 {\n+_\b1_\b5_\b7 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+158 };\n+159\n+_\b1_\b6_\b1 typedef _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b1_\b6_\b3 typedef _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+164\n+_\b1_\b7_\b0 typedef _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n 171\n-_\b1_\b7_\b3 int _\bc_\bo_\br_\bn_\be_\br_\bs () const\n-174 {\n-175 return refElement_.size(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n-176 }\n-177\n-_\b1_\b7_\b9 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br (int i) const\n-180 {\n-181 assert( (i >= 0) && (i < _\bc_\bo_\br_\bn_\be_\br_\bs()) );\n-182 return _\bg_\bl_\bo_\bb_\ba_\bl(refElement_.position(i, _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n-183 }\n-184\n-_\b1_\b8_\b6 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const\n-187 {\n-188 return _\bg_\bl_\bo_\bb_\ba_\bl(refElement_.position(0, 0));\n-189 }\n-190\n-_\b2_\b0_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-203 {\n-204 thread_local std::vector shapeValues;\n-205 _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().evaluateFunction(_\bl_\bo_\bc_\ba_\bl, shapeValues);\n-206 assert(shapeValues.size() == vertices_.size());\n-207\n-208 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be out(0);\n-209 for (std::size_t i = 0; i < shapeValues.size(); ++i)\n-210 out.axpy(shapeValues[i], vertices_[i]);\n+_\b1_\b7_\b7 typedef _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+178#endif\n+179\n+_\b1_\b8_\b0 typedef typename RefinementImp::Traits< topologyId, CoordType, coerceToId,\n+dimension_>::Imp _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp;\n+181\n+182 using RefinementImp::dimension;\n+183\n+184 using RefinementImp::Codim;\n+185\n+186 using typename RefinementImp::VertexIterator;\n+187 using typename RefinementImp::CoordVector;\n+188\n+189 using typename RefinementImp::ElementIterator;\n+190 using typename RefinementImp::IndexVector;\n+191\n+_\b1_\b9_\b7 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+198 {\n+199 return RefinementImp::nVertices(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+200 }\n+201\n+_\b2_\b0_\b7 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+208 {\n+209 return RefinementImp::vBegin(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+210 }\n 211\n-212 return out;\n-213 }\n-214\n-_\b2_\b3_\b2 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl (const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& y, Impl::\n-GaussNewtonOptions opts = {}) const\n-233 {\n-234 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be x = refElement_.position(0,0);\n-235 Impl::GaussNewtonErrorCode err = Impl::gaussNewton(\n-236 [&](const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) { return this->_\bg_\bl_\bo_\bb_\ba_\bl(local); },\n-237 [&](const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) { return this->_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(local);\n-},\n-238 y, x, opts\n-239 );\n-240\n-241 if (err != Impl::GaussNewtonErrorCode::OK)\n-242 DUNE_THROW(Dune::Exception,\n-243 \"Local coordinate can not be recovered from global coordinate, error code =\n-\" << int(err) << \"\\n\"\n-244 << \" (global(x) - y).two_norm() = \" << (_\bg_\bl_\bo_\bb_\ba_\bl(x) - y).two_norm()\n-245 << \" > tol = \" << opts.absTol);\n-246\n-247 return x;\n-248 }\n-249\n-_\b2_\b6_\b0 _\bc_\bt_\by_\bp_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-261 {\n-262 return MatrixHelper::sqrtDetAAT(_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl));\n-263 }\n-264\n-_\b2_\b7_\b6 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be (Impl::ConvergenceOptions opts = {}) const\n-277 {\n-278 _\bV_\bo_\bl_\bu_\bm_\be vol0 = _\bv_\bo_\bl_\bu_\bm_\be(_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\br_\bu_\bl_\be(_\bt_\by_\bp_\be(), 1));\n-279 if (_\ba_\bf_\bf_\bi_\bn_\be())\n-280 return vol0;\n-281\n-282 using std::abs;\n-283 for (int p = 2; p < opts.maxIt; ++p) {\n-284 _\bV_\bo_\bl_\bu_\bm_\be vol1 = _\bv_\bo_\bl_\bu_\bm_\be(_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\br_\bu_\bl_\be(_\bt_\by_\bp_\be(), p));\n-285 if (abs(vol1 - vol0) < opts.absTol)\n-286 return vol1;\n-287\n-288 vol0 = vol1;\n-289 }\n-290 return vol0;\n-291 }\n-292\n-_\b2_\b9_\b4 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be (const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>& quadRule) const\n-295 {\n-296 _\bV_\bo_\bl_\bu_\bm_\be vol(0);\n-297 for (const auto& qp : quadRule)\n-298 vol += _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt(qp.position()) * qp.weight();\n-299 return vol;\n-300 }\n-301\n-_\b3_\b0_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-308 {\n-309 thread_local std::vector\n-shapeJacobians;\n-310 _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().evaluateJacobian(_\bl_\bo_\bc_\ba_\bl, shapeJacobians);\n-311 assert(shapeJacobians.size() == vertices_.size());\n-312\n-313 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn out(0);\n-314 for (std::size_t i = 0; i < shapeJacobians.size(); ++i) {\n-315 for (int j = 0; j < Jacobian::rows; ++j) {\n-316 shapeJacobians[i].umtv(vertices_[i][j], out[j]);\n-317 }\n-318 }\n-319 return out;\n-320 }\n-321\n-_\b3_\b2_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-328 {\n-329 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn(_\bl_\bo_\bc_\ba_\bl).transposed();\n-330 }\n-331\n-_\b3_\b3_\b9 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-340 {\n-341 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be out;\n-342 MatrixHelper::leftInvA(_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn(_\bl_\bo_\bc_\ba_\bl), out);\n-343 return out;\n-344 }\n-345\n-_\b3_\b5_\b3 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be&\n-_\bl_\bo_\bc_\ba_\bl) const\n-354 {\n-355 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be(_\bl_\bo_\bc_\ba_\bl).transposed();\n-356 }\n-357\n-_\b3_\b5_\b9 friend _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by&\n-geometry)\n-360 {\n-361 return geometry.refElement_;\n-362 }\n-363\n-_\b3_\b6_\b5 const LocalFiniteElement& _\bf_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt () const\n-366 {\n-367 return localFE_;\n-368 }\n-369\n-_\b3_\b7_\b1 const std::vector& _\bc_\bo_\be_\bf_\bf_\bi_\bc_\bi_\be_\bn_\bt_\bs () const\n-372 {\n-373 return vertices_;\n-374 }\n-375\n-_\b3_\b7_\b7 const LocalBasis& _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs () const\n-378 {\n-379 return localFE_.localBasis();\n-380 }\n-381\n-382private:\n-383\n-384 bool affineImpl () const\n-385 {\n-386 if constexpr(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn == 0)\n-387 // point geometries are always affine mappings\n-388 return true;\n-389 else {\n-390 if (_\bo_\br_\bd_\be_\br() > 1)\n-391 // higher-order parametrizations are by definition not affine\n-392 return false;\n-393 if constexpr(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn == 1)\n-394 // linear line geometries are affine mappings\n-395 return true;\n-396 else {\n-397 if (_\bt_\by_\bp_\be()._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n-398 // linear simplex geometries are affine mappings\n-399 return true;\n-400\n-401 // multi-linear mappings on non-simplex geometries might be affine\n-402 // as well. This is tested explicitly for all vertices by constructing\n-403 // an affine mapping from dim+1 affine-independent corners and evaluating\n-404 // at the other corners.\n-405 auto refSimplex = referenceElement(GeometryTypes::\n-simplex(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n-406 auto simplexIndices = Dune::range(refSimplex.size(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n-407 auto simplexCorners = Dune::transformedRangeView(simplexIndices,\n-408 [&](int i) { return this->_\bg_\bl_\bo_\bb_\ba_\bl(refSimplex.position(i,_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn)); });\n-409 AffineGeometry affineGeo\n-(refSimplex,simplexCorners);\n-410 using std::sqrt;\n-411 const _\bc_\bt_\by_\bp_\be tol = sqrt(std::numeric_limits::epsilon());\n-412 for (int i = 0; i < _\bc_\bo_\br_\bn_\be_\br_\bs(); ++i) {\n-413 const auto _\bc_\bo_\br_\bn_\be_\br = refElement_.position(i,_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n-414 if ((affineGeo.global(_\bc_\bo_\br_\bn_\be_\br) - _\bg_\bl_\bo_\bb_\ba_\bl(_\bc_\bo_\br_\bn_\be_\br)).two_norm() > tol)\n-415 return false;\n-416 }\n-417 return true;\n-418 }\n-419 }\n-420 }\n-421\n-422private:\n-424 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt refElement_{};\n-425\n-427 LocalFiniteElement localFE_{};\n-428\n-430 std::vector vertices_{};\n-431\n-432 mutable std::optional affine_ = std::nullopt;\n-433};\n-434\n-435namespace Impl {\n-436\n-437// extract the LocalCoordinate type from a LocalFiniteElement\n-438template \n-439using LocalCoordinate_t\n-440 = FieldVector;\n-442\n-443} // end namespace Impl\n-444\n-445\n-446// deduction guides\n-447template \n-_\b4_\b4_\b8_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\bI_\b>, const LFE&, std::\n-vector)\n-449 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n-450\n-451template >>\n-_\b4_\b5_\b3_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\bI_\b>, const LFE&, const F&)\n-454 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bR_\ba_\bn_\bg_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n-455\n-456template \n-_\b4_\b5_\b7_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE& localFE, std::\n-vector)\n-458 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n-459\n-460template >>\n-_\b4_\b6_\b2_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE&, const F&)\n-463 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bR_\ba_\bn_\bg_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n-464\n-465} // namespace Dune\n-466\n-467#endif // DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n-_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n-An implementation of the Geometry interface for affine geometries.\n-_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh\n-_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh\n-_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\b2_\b1_\b7 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+218 {\n+219 return RefinementImp::vEnd(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+220 }\n+221\n+_\b2_\b2_\b7 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+228 {\n+229 return RefinementImp::nElements(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+230 }\n+231\n+_\b2_\b3_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+238 {\n+239 return RefinementImp::eBegin(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+240 }\n+241\n+_\b2_\b4_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+248 {\n+249 return RefinementImp::eEnd(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n+250 }\n+251 };\n+252\n+254} // namespace Dune\n+255\n+256#endif // DUNE_GEOMETRY_REFINEMENT_BASE_CC\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n+_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+RefinementIntervals refinementIntervals(int intervals)\n+Creates a RefinementIntervals object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:108\n+_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs\n+RefinementIntervals refinementLevels(int levels)\n+Creates a RefinementIntervals object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:117\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-This class provides access to geometric and topological properties of a\n-reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Class providing access to the singletons of the reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-typename Container::ReferenceElement ReferenceElement\n-The reference element type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Geometry implementation based on local-basis function parametrization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:40\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n-GeometryType type() const\n-Obtain the name of the reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:167\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-decltype(power(std::declval< ctype >(), mydimension)) Volume\n-type of volume\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:62\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-LocalCoordinate local(const GlobalCoordinate &y, Impl::GaussNewtonOptions<\n-ctype > opts={}) const\n-Evaluate the inverse coordinate mapping.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:232\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-LocalFiniteElementGeometry(const ReferenceElement &refElement, const\n-LocalFiniteElement &localFE, std::vector< GlobalCoordinate > vertices)\n-Constructor from a vector of coefficients of the LocalBasis parametrizing the\n-geometry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:103\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n-Obtain the transposed of the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:327\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs\n-const LocalBasis & localBasis() const\n-The local basis of the stored local finite-element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:377\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n-typename LocalBasisTraits::DomainFieldType ctype\n-coordinate type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n-&local) const\n-Obtain the transposed of the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:353\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-friend ReferenceElement referenceElement(const LocalFiniteElementGeometry\n-&geometry)\n-Obtain the reference-element related to this geometry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:359\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-LocalFiniteElementGeometry()=default\n-Default constructed geometry results in an empty/invalid representation.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine() const\n-Is this mapping affine? Geometries of order 1 might be affine, but it needs to\n-be checked on non-simp...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:159\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Jacobian jacobian(const LocalCoordinate &local) const\n-Obtain the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:307\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume(const QuadratureRule< ctype, mydimension > &quadRule) const\n-Obtain the volume of the mapping's image by given quadrature rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:294\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\be_\bf_\bf_\bi_\bc_\bi_\be_\bn_\bt_\bs\n-const std::vector< GlobalCoordinate > & coefficients() const\n-Obtain the coefficients of the parametrization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:371\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-LocalFiniteElementGeometry(GeometryType gt, Args &&... args)\n-Constructor, forwarding to the other constructors that take a reference-\n-element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:144\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int coorddimension\n-coordinate dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:53\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n-int corners() const\n-Obtain number of corners of the corresponding reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:173\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n-GlobalCoordinate center() const\n-Obtain the centroid of the mapping's image.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:186\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bf_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-const LocalFiniteElement & finiteElement() const\n-Obtain the local finite-element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:365\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-GlobalCoordinate global(const LocalCoordinate &local) const\n-Evaluate the coordinate mapping.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:202\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n-Impl::FieldMatrixHelper< ctype > MatrixHelper\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:82\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-typename ReferenceElements::ReferenceElement ReferenceElement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:79\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-GlobalCoordinate corner(int i) const\n-Obtain coordinates of the i-th corner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:179\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume(Impl::ConvergenceOptions< ctype > opts={}) const\n-Obtain the volume of the mapping's image.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:276\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int mydimension\n-geometry dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:50\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n-Obtain the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:339\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, coorddimension > GlobalCoordinate\n-type of global coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:59\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-FieldMatrix< ctype, coorddimension, mydimension > Jacobian\n-type of jacobian\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed\n-type of jacobian inverse transposed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:74\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse\n-type of jacobian inverse\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ctype integrationElement(const LocalCoordinate &local) const\n-Obtain the integration element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:260\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bo_\br_\bd_\be_\br\n-int order() const\n-Obtain the (highest) polynomial order of the parametrization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:149\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, mydimension > LocalCoordinate\n-type of local coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:56\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed\n-type of jacobian transposed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-LocalFiniteElementGeometry(const ReferenceElement &refElement, const\n-LocalFiniteElement &localFE, Param &¶metrization)\n-Constructor from a local parametrization function, mapping local to (curved)\n-global coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-Abstract base class for quadrature rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs\n-A container for all quadrature rules of dimension dim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:260\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-Unique label for each type of entities that can occur in DUNE grids.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n-constexpr bool isSimplex() const\n-Return true if entity is a simplex of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs\n+Mapping from geometryType, CoordType and coerceTo to a particular Refinement\n+implementation.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:70\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+Holds the number of refined intervals per axis needed for virtual and static\n+refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+RefinementIntervals(int i)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:98\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b:_\b:_\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+int intervals() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:100\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Wrap each Refinement implementation to get a consistent interface.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:141\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(Dune::RefinementIntervals tag)\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:247\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(Dune::RefinementIntervals tag)\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:237\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(Dune::RefinementIntervals tag)\n+Get the number of Elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:227\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+The ElementIterator of the Refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:163\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(Dune::RefinementIntervals tag)\n+Get the number of Vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:197\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(Dune::RefinementIntervals tag)\n+Get a VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:207\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+The VertexIterator of the Refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:161\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+typedef CoordVector\n+The CoordVector of the Refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:170\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+typedef IndexVector\n+The IndexVector of the Refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:177\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_ >::Imp\n+RefinementImp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:180\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(Dune::RefinementIntervals tag)\n+Get a VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+The Codim struct inherited from the Refinement implementation.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:151\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+typedef SubEntityIterator\n+The SubEntityIterator for each codim.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:157\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00176.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00176.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: affinegeometry.hh File Reference\n+dune-geometry: pyramidtriangulation.cc File Reference\n \n \n \n \n \n \n \n@@ -65,50 +65,86 @@\n
\n
\n \n \n \n \n \n
\n \n-
affinegeometry.hh File Reference
\n+Namespaces |\n+Macros |\n+Functions
\n+
pyramidtriangulation.cc File Reference
\n \n
\n-\n-

An implementation of the Geometry interface for affine geometries. \n-More...

\n-
#include <cmath>
\n-#include <dune/common/fmatrix.hh>
\n-#include <dune/common/fvector.hh>
\n-#include <dune/geometry/type.hh>
\n+
#include <dune/common/fvector.hh>
\n+#include <dune/common/typetraits.hh>
\n+#include <dune/geometry/referenceelements.hh>
\n+#include <dune/geometry/type.hh>
\n+#include "base.cc"
\n+#include "simplex.cc"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

class  Dune::AffineGeometry< ct, mydim, cdim >
 Implementation of the Geometry interface for affine geometries. More...
class  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >
 Implementation of the refinement of a pyramid into simplices. More...
 
struct  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
class  Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
 
class  Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
 
class  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
\n \n \n \n-\n+\n+\n+\n+\n+\n \n+

\n Namespaces

namespace  Dune
 
namespace  Dune::Geo
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
namespace  Dune::RefinementImp::PyramidTriangulation
 This namespace contains the Refinement implementation for triangulating pyramids (GeometryType::pyramid -> GeometryType::simplex)
 
\n+\n+\n+\n+

\n+Macros

#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
 
\n+\n+\n+\n+\n

\n+Functions

template<int dimension, class CoordType >
FieldVector< CoordType, dimension > Dune::RefinementImp::PyramidTriangulation::transformCoordinate (FieldVector< CoordType, dimension > point)
 
\n-

Detailed Description

\n-

An implementation of the Geometry interface for affine geometries.

\n-
Author
Martin Nolte
\n-
\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
\n+
\n+\n+
\n+
\n+
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,29 +1,59 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-affinegeometry.hh File Reference\n-An implementation of the Geometry interface for affine geometries. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+pyramidtriangulation.cc File Reference\n #include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n-\u00a0 Implementation of the Geometry interface for affine geometries. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0 Implementation of the refinement of a pyramid into simplices. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n+ This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n+\u00a0 triangulating pyramids (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\by_\br_\ba_\bm_\bi_\bd -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:\n+ _\bs_\bi_\bm_\bp_\bl_\be_\bx)\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bP_\bY_\bR_\bA_\bM_\bI_\bD_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:\n+ _\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+ (FieldVector< CoordType, dimension >\n+ point)\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-An implementation of the Geometry interface for affine geometries.\n- Author\n- Martin Nolte\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_P\bPY\bYR\bRA\bAM\bMI\bID\bDT\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00176_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00176_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: affinegeometry.hh Source File\n+dune-geometry: pyramidtriangulation.cc Source File\n \n \n \n \n \n \n \n@@ -70,710 +70,524 @@\n \n \n \n \n \n \n \n
\n-
affinegeometry.hh
\n+
pyramidtriangulation.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_AFFINEGEOMETRY_HH
\n-
6#define DUNE_GEOMETRY_AFFINEGEOMETRY_HH
\n+
5#ifndef DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
\n+
6#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
\n
7
\n-
13#include <cmath>
\n-
14
\n-
15#include <dune/common/fmatrix.hh>
\n-
16#include <dune/common/fvector.hh>
\n-
17
\n-
18#include <dune/geometry/type.hh>
\n-
19
\n-
\n-
20namespace Dune
\n-
21{
\n-
22
\n-
23 // External Forward Declarations
\n-
24 // -----------------------------
\n-
25
\n+
8#include <dune/common/fvector.hh>
\n+
9#include <dune/common/typetraits.hh>
\n+
10
\n+\n+
12#include <dune/geometry/type.hh>
\n+
13
\n+
14#include "base.cc"
\n+
15#include "simplex.cc"
\n+
16
\n+
17namespace Dune
\n+
18{
\n+
19 namespace RefinementImp
\n+
20 {
\n
\n-
26 namespace Geo
\n-
27 {
\n-
28
\n-
29 template< typename Implementation >
\n-
30 class ReferenceElement;
\n-
31
\n-
32 template< class ctype, int dim >
\n-\n-
34
\n-
35 template< class ctype, int dim >
\n-
36 struct ReferenceElements;
\n-
37
\n-
38 }
\n-
\n-
39
\n+
26 namespace PyramidTriangulation
\n+
27 {
\n+
28 // ////////////
\n+
29 //
\n+
30 // Utilities
\n+
31 //
\n+
32
\n+\n+\n+
35
\n+
36 // ////////////////////////////////////
\n+
37 //
\n+
38 // Refine a pyramid with simplices
\n+
39 //
\n
40
\n-
41 namespace Impl
\n-
42 {
\n-
43
\n-
44 // FieldMatrixHelper
\n-
45 // -----------------
\n-
46
\n-
47 template< class ct >
\n-
48 struct FieldMatrixHelper
\n-
49 {
\n-
50 typedef ct ctype;
\n-
51
\n-
52 template< int m, int n >
\n-
53 static void Ax ( const FieldMatrix< ctype, m, n > &A, const FieldVector< ctype, n > &x, FieldVector< ctype, m > &ret )
\n-
54 {
\n-
55 for( int i = 0; i < m; ++i )
\n-
56 {
\n-
57 ret[ i ] = ctype( 0 );
\n-
58 for( int j = 0; j < n; ++j )
\n-
59 ret[ i ] += A[ i ][ j ] * x[ j ];
\n-
60 }
\n-
61 }
\n-
62
\n-
63 template< int m, int n >
\n-
64 static void ATx ( const FieldMatrix< ctype, m, n > &A, const FieldVector< ctype, m > &x, FieldVector< ctype, n > &ret )
\n-
65 {
\n-
66 for( int i = 0; i < n; ++i )
\n-
67 {
\n-
68 ret[ i ] = ctype( 0 );
\n-
69 for( int j = 0; j < m; ++j )
\n-
70 ret[ i ] += A[ j ][ i ] * x[ j ];
\n-
71 }
\n-
72 }
\n+
41 // forward declaration of the iterator base
\n+
42 template<int dimension, class CoordType, int codimension>
\n+\n+
44
\n+
45 /*
\n+
46 * The permutations 0 and 1 of the Kuhn-decomposition of a cube into simplices form a pyramid.
\n+
47 * The resulting pyramid is not oriented the same as the reference pyramid and so the Kuhn-coordinates
\n+
48 * have to be transformed using the method below.
\n+
49 */
\n+
50 template<int dimension, class CoordType> FieldVector<CoordType, dimension>
\n+
\n+
51 transformCoordinate( FieldVector<CoordType, dimension> point)
\n+
52 {
\n+
53 FieldVector<CoordType, dimension> transform;
\n+
54 transform[0]=1-point[0];
\n+
55 transform[1]=1-point[1];
\n+
56 transform[2]=point[2];
\n+
57 return transform;
\n+
58 }
\n+
\n+
59
\n+
66 template<int dimension_, class CoordType>
\n+
\n+\n+
68 {
\n+
69 public:
\n+
70 constexpr static int dimension = dimension_;
\n+
71
\n+
72 typedef CoordType ctype;
\n
73
\n-
74 template< int m, int n, int p >
\n-
75 static void AB ( const FieldMatrix< ctype, m, n > &A, const FieldMatrix< ctype, n, p > &B, FieldMatrix< ctype, m, p > &ret )
\n-
76 {
\n-
77 for( int i = 0; i < m; ++i )
\n-
78 {
\n-
79 for( int j = 0; j < p; ++j )
\n-
80 {
\n-
81 ret[ i ][ j ] = ctype( 0 );
\n-
82 for( int k = 0; k < n; ++k )
\n-
83 ret[ i ][ j ] += A[ i ][ k ] * B[ k ][ j ];
\n-
84 }
\n-
85 }
\n-
86 }
\n-
87
\n-
88 template< int m, int n, int p >
\n-
89 static void ATBT ( const FieldMatrix< ctype, m, n > &A, const FieldMatrix< ctype, p, m > &B, FieldMatrix< ctype, n, p > &ret )
\n-
90 {
\n-
91 for( int i = 0; i < n; ++i )
\n-
92 {
\n-
93 for( int j = 0; j < p; ++j )
\n-
94 {
\n-
95 ret[ i ][ j ] = ctype( 0 );
\n-
96 for( int k = 0; k < m; ++k )
\n-
97 ret[ i ][ j ] += A[ k ][ i ] * B[ j ][ k ];
\n-
98 }
\n-
99 }
\n-
100 }
\n-
101
\n-
102 template< int m, int n >
\n-
103 static void ATA_L ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, n, n > &ret )
\n-
104 {
\n-
105 for( int i = 0; i < n; ++i )
\n-
106 {
\n-
107 for( int j = 0; j <= i; ++j )
\n-
108 {
\n-
109 ret[ i ][ j ] = ctype( 0 );
\n-
110 for( int k = 0; k < m; ++k )
\n-
111 ret[ i ][ j ] += A[ k ][ i ] * A[ k ][ j ];
\n-
112 }
\n-
113 }
\n-
114 }
\n-
115
\n-
116 template< int m, int n >
\n-
117 static void ATA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, n, n > &ret )
\n+
74 template<int codimension>
\n+
75 struct Codim;
\n+\n+
77 typedef FieldVector<CoordType, dimension> CoordVector;
\n+\n+
79 typedef FieldVector<int, dimension+1> IndexVector;
\n+
80
\n+
81 static int nVertices(int nIntervals);
\n+
82 static VertexIterator vBegin(int nIntervals);
\n+
83 static VertexIterator vEnd(int nIntervals);
\n+
84
\n+
85 static int nElements(int nIntervals);
\n+
86 static ElementIterator eBegin(int nIntervals);
\n+
87 static ElementIterator eEnd(int nIntervals);
\n+
88
\n+
89 private:
\n+
90 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
\n+
91 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
\n+
92
\n+\n+
94
\n+
95 constexpr static int nKuhnSimplices = 2;
\n+
96 };
\n+
\n+
97
\n+
98 template<int dimension, class CoordType>
\n+
99 template<int codimension>
\n+
\n+
100 struct RefinementImp<dimension, CoordType>::Codim
\n+
101 {
\n+
102 class SubEntityIterator;
\n+\n+
104 };
\n+
\n+
105
\n+
106 template<int dimension, class CoordType>
\n+
107 int
\n+
\n+\n+
109 nVertices(int nIntervals)
\n+
110 {
\n+
111 return BackendRefinement::nVertices(nIntervals) * nKuhnSimplices;
\n+
112 }
\n+
\n+
113
\n+
114 template<int dimension, class CoordType>
\n+\n+
\n+\n+
117 vBegin(int nIntervals)
\n
118 {
\n-
119 for( int i = 0; i < n; ++i )
\n-
120 {
\n-
121 for( int j = 0; j <= i; ++j )
\n-
122 {
\n-
123 ret[ i ][ j ] = ctype( 0 );
\n-
124 for( int k = 0; k < m; ++k )
\n-
125 ret[ i ][ j ] += A[ k ][ i ] * A[ k ][ j ];
\n-
126 ret[ j ][ i ] = ret[ i ][ j ];
\n-
127 }
\n-
128
\n-
129 ret[ i ][ i ] = ctype( 0 );
\n-
130 for( int k = 0; k < m; ++k )
\n-
131 ret[ i ][ i ] += A[ k ][ i ] * A[ k ][ i ];
\n-
132 }
\n-
133 }
\n-
134
\n-
135 template< int m, int n >
\n-
136 static void AAT_L ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, m, m > &ret )
\n-
137 {
\n-
138 /*
\n-
139 if (m==2) {
\n-
140 ret[0][0] = A[0]*A[0];
\n-
141 ret[1][1] = A[1]*A[1];
\n-
142 ret[1][0] = A[0]*A[1];
\n-
143 }
\n-
144 else
\n-
145 */
\n-
146 for( int i = 0; i < m; ++i )
\n-
147 {
\n-
148 for( int j = 0; j <= i; ++j )
\n-
149 {
\n-
150 ctype &retij = ret[ i ][ j ];
\n-
151 retij = A[ i ][ 0 ] * A[ j ][ 0 ];
\n-
152 for( int k = 1; k < n; ++k )
\n-
153 retij += A[ i ][ k ] * A[ j ][ k ];
\n-
154 }
\n-
155 }
\n-
156 }
\n-
157
\n-
158 template< int m, int n >
\n-
159 static void AAT ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, m, m > &ret )
\n-
160 {
\n-
161 for( int i = 0; i < m; ++i )
\n-
162 {
\n-
163 for( int j = 0; j < i; ++j )
\n-
164 {
\n-
165 ret[ i ][ j ] = ctype( 0 );
\n-
166 for( int k = 0; k < n; ++k )
\n-
167 ret[ i ][ j ] += A[ i ][ k ] * A[ j ][ k ];
\n-
168 ret[ j ][ i ] = ret[ i ][ j ];
\n-
169 }
\n-
170 ret[ i ][ i ] = ctype( 0 );
\n-
171 for( int k = 0; k < n; ++k )
\n-
172 ret[ i ][ i ] += A[ i ][ k ] * A[ i ][ k ];
\n-
173 }
\n-
174 }
\n+
119 return VertexIterator(nIntervals);
\n+
120 }
\n+
\n+
121
\n+
122 template<int dimension, class CoordType>
\n+\n+
\n+\n+
125 vEnd(int nIntervals)
\n+
126 {
\n+
127 return VertexIterator(nIntervals, true);
\n+
128 }
\n+
\n+
129
\n+
130 template<int dimension, class CoordType>
\n+
131 int
\n+
\n+\n+
133 nElements(int nIntervals)
\n+
134 {
\n+
135 return BackendRefinement::nElements(nIntervals) * nKuhnSimplices;
\n+
136 }
\n+
\n+
137
\n+
138 template<int dimension, class CoordType>
\n+\n+
\n+\n+
141 eBegin(int nIntervals)
\n+
142 {
\n+
143 return ElementIterator(nIntervals);
\n+
144 }
\n+
\n+
145
\n+
146 template<int dimension, class CoordType>
\n+\n+
\n+\n+
149 eEnd(int nIntervals)
\n+
150 {
\n+
151 return ElementIterator(nIntervals, true);
\n+
152 }
\n+
\n+
153
\n+
154 // //////////////
\n+
155 //
\n+
156 // The iterator
\n+
157 //
\n+
158
\n+
159 // vertices
\n+
160 template<int dimension, class CoordType>
\n+
\n+
161 class RefinementIteratorSpecial<dimension, CoordType, dimension>
\n+
162 {
\n+
163 public:
\n+\n+
165 typedef typename Refinement::CoordVector CoordVector;
\n+
166 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
\n+
167
\n+
168 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
169
\n+
170 void increment();
\n+
171
\n+
172 CoordVector coords() const;
\n+
173
\n+
174 Geometry geometry() const;
\n
175
\n-
176 template< int n >
\n-
177 static void Lx ( const FieldMatrix< ctype, n, n > &L, const FieldVector< ctype, n > &x, FieldVector< ctype, n > &ret )
\n-
178 {
\n-
179 for( int i = 0; i < n; ++i )
\n-
180 {
\n-
181 ret[ i ] = ctype( 0 );
\n-
182 for( int j = 0; j <= i; ++j )
\n-
183 ret[ i ] += L[ i ][ j ] * x[ j ];
\n-
184 }
\n-
185 }
\n-
186
\n-
187 template< int n >
\n-
188 static void LTx ( const FieldMatrix< ctype, n, n > &L, const FieldVector< ctype, n > &x, FieldVector< ctype, n > &ret )
\n-
189 {
\n-
190 for( int i = 0; i < n; ++i )
\n-
191 {
\n-
192 ret[ i ] = ctype( 0 );
\n-
193 for( int j = i; j < n; ++j )
\n-
194 ret[ i ] += L[ j ][ i ] * x[ j ];
\n-
195 }
\n-
196 }
\n-
197
\n-
198 template< int n >
\n-
199 static void LTL ( const FieldMatrix< ctype, n, n > &L, FieldMatrix< ctype, n, n > &ret )
\n-
200 {
\n-
201 for( int i = 0; i < n; ++i )
\n-
202 {
\n-
203 for( int j = 0; j < i; ++j )
\n-
204 {
\n-
205 ret[ i ][ j ] = ctype( 0 );
\n-
206 for( int k = i; k < n; ++k )
\n-
207 ret[ i ][ j ] += L[ k ][ i ] * L[ k ][ j ];
\n-
208 ret[ j ][ i ] = ret[ i ][ j ];
\n-
209 }
\n-
210 ret[ i ][ i ] = ctype( 0 );
\n-
211 for( int k = i; k < n; ++k )
\n-
212 ret[ i ][ i ] += L[ k ][ i ] * L[ k ][ i ];
\n-
213 }
\n-
214 }
\n-
215
\n-
216 template< int n >
\n-
217 static void LLT ( const FieldMatrix< ctype, n, n > &L, FieldMatrix< ctype, n, n > &ret )
\n-
218 {
\n-
219 for( int i = 0; i < n; ++i )
\n-
220 {
\n-
221 for( int j = 0; j < i; ++j )
\n-
222 {
\n-
223 ret[ i ][ j ] = ctype( 0 );
\n-
224 for( int k = 0; k <= j; ++k )
\n-
225 ret[ i ][ j ] += L[ i ][ k ] * L[ j ][ k ];
\n-
226 ret[ j ][ i ] = ret[ i ][ j ];
\n-
227 }
\n-
228 ret[ i ][ i ] = ctype( 0 );
\n-
229 for( int k = 0; k <= i; ++k )
\n-
230 ret[ i ][ i ] += L[ i ][ k ] * L[ i ][ k ];
\n-
231 }
\n-
232 }
\n-
233
\n-
234 template< int n >
\n-
235 static bool cholesky_L ( const FieldMatrix< ctype, n, n > &A, FieldMatrix< ctype, n, n > &ret, const bool checkSingular = false )
\n-
236 {
\n-
237 using std::sqrt;
\n-
238 for( int i = 0; i < n; ++i )
\n-
239 {
\n-
240 ctype &rii = ret[ i ][ i ];
\n-
241
\n-
242 ctype xDiag = A[ i ][ i ];
\n-
243 for( int j = 0; j < i; ++j )
\n-
244 xDiag -= ret[ i ][ j ] * ret[ i ][ j ];
\n-
245
\n-
246 // in some cases A can be singular, e.g. when checking local for
\n-
247 // outside points during checkInside
\n-
248 if( checkSingular && ! ( xDiag > ctype( 0 )) )
\n-
249 return false ;
\n+
176 int index() const;
\n+
177 protected:
\n+
178 typedef typename Refinement::BackendRefinement BackendRefinement;
\n+
179 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
\n+
180 constexpr static int nKuhnSimplices = 2;
\n+
181
\n+\n+
183
\n+\n+\n+\n+
187 };
\n+
\n+
188
\n+
189 template<int dimension, class CoordType>
\n+
\n+\n+
191 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
192 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
193 backend(BackendRefinement::vBegin(nIntervals_)),
\n+
194 backendEnd(BackendRefinement::vEnd(nIntervals_))
\n+
195 {
\n+
196 if (end)
\n+
197 kuhnIndex = nKuhnSimplices;
\n+
198 }
\n+
\n+
199
\n+
200 template<int dimension, class CoordType>
\n+
201 void
\n+
\n+\n+\n+
204 {
\n+
205 ++backend;
\n+
206 if(backend == backendEnd)
\n+
207 {
\n+
208 backend = BackendRefinement::vBegin(nIntervals_);
\n+
209 ++kuhnIndex;
\n+
210 }
\n+
211 }
\n+
\n+
212
\n+
213 template<int dimension, class CoordType>
\n+\n+
\n+\n+
216 coords() const
\n+
217 {
\n+
218 return transformCoordinate(referenceToKuhn(backend.coords(),
\n+
219 getPermutation<dimension>(kuhnIndex)));
\n+
220 }
\n+
\n+
221
\n+
222 template<int dimension, class CoordType>
\n+\n+
\n+\n+
225 {
\n+
226 std::vector<CoordVector> corners(1);
\n+
227 corners[0] = referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
\n+
228 return Geometry(GeometryTypes::vertex, corners);
\n+
229 }
\n+
\n+
230
\n+
231 template<int dimension, class CoordType>
\n+
232 int
\n+
\n+\n+
234 index() const
\n+
235 {
\n+
236 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
\n+
237 }
\n+
\n+
238
\n+
239 // elements
\n+
240 template<int dimension, class CoordType>
\n+
\n+
241 class RefinementIteratorSpecial<dimension, CoordType, 0>
\n+
242 {
\n+
243 public:
\n+\n+\n+\n+
247 typedef typename Refinement::template Codim<0>::Geometry Geometry;
\n+
248
\n+
249 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n
250
\n-
251 // otherwise this should be true always
\n-
252 assert( xDiag > ctype( 0 ) );
\n-
253 rii = sqrt( xDiag );
\n-
254
\n-
255 ctype invrii = ctype( 1 ) / rii;
\n-
256 for( int k = i+1; k < n; ++k )
\n-
257 {
\n-
258 ctype x = A[ k ][ i ];
\n-
259 for( int j = 0; j < i; ++j )
\n-
260 x -= ret[ i ][ j ] * ret[ k ][ j ];
\n-
261 ret[ k ][ i ] = invrii * x;
\n-
262 }
\n-
263 }
\n-
264
\n-
265 // return true for meaning A is non-singular
\n-
266 return true;
\n-
267 }
\n+
251 void increment();
\n+
252
\n+
253 IndexVector vertexIndices() const;
\n+
254 int index() const;
\n+
255 CoordVector coords() const;
\n+
256
\n+
257 Geometry geometry() const;
\n+
258
\n+
259 private:
\n+
260 CoordVector global(const CoordVector &local) const;
\n+
261
\n+
262 protected:
\n+\n+
264 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
\n+
265 constexpr static int nKuhnSimplices = 2;
\n+
266
\n+\n
268
\n-
269 template< int n >
\n-
270 static ctype detL ( const FieldMatrix< ctype, n, n > &L )
\n-
271 {
\n-
272 ctype det( 1 );
\n-
273 for( int i = 0; i < n; ++i )
\n-
274 det *= L[ i ][ i ];
\n-
275 return det;
\n-
276 }
\n-
277
\n-
278 template< int n >
\n-
279 static ctype invL ( FieldMatrix< ctype, n, n > &L )
\n+\n+\n+\n+
272 };
\n+
\n+
273
\n+
274 template<int dimension, class CoordType>
\n+
\n+\n+
276 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
277 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
278 backend(BackendRefinement::eBegin(nIntervals_)),
\n+
279 backendEnd(BackendRefinement::eEnd(nIntervals_))
\n
280 {
\n-
281 ctype det( 1 );
\n-
282 for( int i = 0; i < n; ++i )
\n-
283 {
\n-
284 ctype &lii = L[ i ][ i ];
\n-
285 det *= lii;
\n-
286 lii = ctype( 1 ) / lii;
\n-
287 for( int j = 0; j < i; ++j )
\n-
288 {
\n-
289 ctype &lij = L[ i ][ j ];
\n-
290 ctype x = lij * L[ j ][ j ];
\n-
291 for( int k = j+1; k < i; ++k )
\n-
292 x += L[ i ][ k ] * L[ k ][ j ];
\n-
293 lij = (-lii) * x;
\n-
294 }
\n+
281 if (end)
\n+
282 kuhnIndex = nKuhnSimplices;
\n+
283 }
\n+
\n+
284
\n+
285 template<int dimension, class CoordType>
\n+
286 void
\n+
\n+\n+\n+
289 {
\n+
290 ++backend;
\n+
291 if (backend == backendEnd)
\n+
292 {
\n+
293 backend = BackendRefinement::eBegin(nIntervals_);
\n+
294 ++kuhnIndex;
\n
295 }
\n-
296 return det;
\n-
297 }
\n-
298
\n-
299 // calculates x := L^{-1} x
\n-
300 template< int n >
\n-
301 static void invLx ( FieldMatrix< ctype, n, n > &L, FieldVector< ctype, n > &x )
\n-
302 {
\n-
303 for( int i = 0; i < n; ++i )
\n-
304 {
\n-
305 for( int j = 0; j < i; ++j )
\n-
306 x[ i ] -= L[ i ][ j ] * x[ j ];
\n-
307 x[ i ] /= L[ i ][ i ];
\n-
308 }
\n+
296 }
\n+
\n+
297
\n+
298 template<int dimension, class CoordType>
\n+\n+
\n+\n+
301 vertexIndices() const
\n+
302 {
\n+
303 IndexVector indices = backend.vertexIndices();
\n+
304
\n+
305 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
\n+
306 indices += base;
\n+
307
\n+
308 return indices;
\n
309 }
\n+
\n
310
\n-
311 // calculates x := L^{-T} x
\n-
312 template< int n >
\n-
313 static void invLTx ( FieldMatrix< ctype, n, n > &L, FieldVector< ctype, n > &x )
\n-
314 {
\n-
315 for( int i = n; i > 0; --i )
\n-
316 {
\n-
317 for( int j = i; j < n; ++j )
\n-
318 x[ i-1 ] -= L[ j ][ i-1 ] * x[ j ];
\n-
319 x[ i-1 ] /= L[ i-1 ][ i-1 ];
\n-
320 }
\n-
321 }
\n-
322
\n-
323 template< int n >
\n-
324 static ctype spdDetA ( const FieldMatrix< ctype, n, n > &A )
\n-
325 {
\n-
326 // return A[0][0]*A[1][1]-A[1][0]*A[1][0];
\n-
327 FieldMatrix< ctype, n, n > L;
\n-
328 cholesky_L( A, L );
\n-
329 return detL( L );
\n-
330 }
\n-
331
\n-
332 template< int n >
\n-
333 static ctype spdInvA ( FieldMatrix< ctype, n, n > &A )
\n-
334 {
\n-
335 FieldMatrix< ctype, n, n > L;
\n-
336 cholesky_L( A, L );
\n-
337 const ctype det = invL( L );
\n-
338 LTL( L, A );
\n-
339 return det;
\n-
340 }
\n-
341
\n-
342 // calculate x := A^{-1} x
\n-
343 template< int n >
\n-
344 static bool spdInvAx ( FieldMatrix< ctype, n, n > &A, FieldVector< ctype, n > &x, const bool checkSingular = false )
\n-
345 {
\n-
346 FieldMatrix< ctype, n, n > L;
\n-
347 const bool invertible = cholesky_L( A, L, checkSingular );
\n-
348 if( ! invertible ) return invertible ;
\n-
349 invLx( L, x );
\n-
350 invLTx( L, x );
\n-
351 return invertible;
\n-
352 }
\n-
353
\n-
354 template< int m, int n >
\n-
355 static ctype detATA ( const FieldMatrix< ctype, m, n > &A )
\n-
356 {
\n-
357 if( m >= n )
\n-
358 {
\n-
359 FieldMatrix< ctype, n, n > ata;
\n-
360 ATA_L( A, ata );
\n-
361 return spdDetA( ata );
\n-
362 }
\n-
363 else
\n-
364 return ctype( 0 );
\n-
365 }
\n-
366
\n-
372 template< int m, int n >
\n-
373 static ctype sqrtDetAAT ( const FieldMatrix< ctype, m, n > &A )
\n-
374 {
\n-
375 using std::abs;
\n-
376 using std::sqrt;
\n-
377 // These special cases are here not only for speed reasons:
\n-
378 // The general implementation aborts if the matrix is almost singular,
\n-
379 // and the special implementation provide a stable way to handle that case.
\n-
380 if( (n == 2) && (m == 2) )
\n-
381 {
\n-
382 // Special implementation for 2x2 matrices: faster and more stable
\n-
383 return abs( A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ] );
\n-
384 }
\n-
385 else if( (n == 3) && (m == 3) )
\n-
386 {
\n-
387 // Special implementation for 3x3 matrices
\n-
388 const ctype v0 = A[ 0 ][ 1 ] * A[ 1 ][ 2 ] - A[ 1 ][ 1 ] * A[ 0 ][ 2 ];
\n-
389 const ctype v1 = A[ 0 ][ 2 ] * A[ 1 ][ 0 ] - A[ 1 ][ 2 ] * A[ 0 ][ 0 ];
\n-
390 const ctype v2 = A[ 0 ][ 0 ] * A[ 1 ][ 1 ] - A[ 1 ][ 0 ] * A[ 0 ][ 1 ];
\n-
391 return abs( v0 * A[ 2 ][ 0 ] + v1 * A[ 2 ][ 1 ] + v2 * A[ 2 ][ 2 ] );
\n-
392 }
\n-
393 else if ( (n == 3) && (m == 2) )
\n-
394 {
\n-
395 // Special implementation for 2x3 matrices
\n-
396 const ctype v0 = A[ 0 ][ 0 ] * A[ 1 ][ 1 ] - A[ 0 ][ 1 ] * A[ 1 ][ 0 ];
\n-
397 const ctype v1 = A[ 0 ][ 0 ] * A[ 1 ][ 2 ] - A[ 1 ][ 0 ] * A[ 0 ][ 2 ];
\n-
398 const ctype v2 = A[ 0 ][ 1 ] * A[ 1 ][ 2 ] - A[ 0 ][ 2 ] * A[ 1 ][ 1 ];
\n-
399 return sqrt( v0*v0 + v1*v1 + v2*v2);
\n-
400 }
\n-
401 else if( n >= m )
\n-
402 {
\n-
403 // General case
\n-
404 FieldMatrix< ctype, m, m > aat;
\n-
405 AAT_L( A, aat );
\n-
406 return spdDetA( aat );
\n-
407 }
\n-
408 else
\n-
409 return ctype( 0 );
\n-
410 }
\n+
311 template<int dimension, class CoordType>
\n+
312 int
\n+
\n+\n+
314 index() const
\n+
315 {
\n+
316 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
\n+
317 }
\n+
\n+
318
\n+
319 template<int dimension, class CoordType>
\n+\n+
\n+\n+
322 coords() const
\n+
323 {
\n+
324 return global(backend.coords());
\n+
325 }
\n+
\n+
326
\n+
327 template<int dimension, class CoordType>
\n+\n+
\n+\n+
330 geometry() const
\n+
331 {
\n+
332 const typename BackendIterator::Geometry &
\n+
333 bgeo = backend.geometry();
\n+
334 std::vector<CoordVector> corners(dimension+1);
\n+
335 for(int i = 0; i <= dimension; ++i)
\n+
336 corners[i] = global(bgeo.corner(i));
\n+
337
\n+
338 return Geometry(bgeo.type(), corners);
\n+
339 }
\n+
\n+
340
\n+
341 template<int dimension, class CoordType>
\n+\n+
343 CoordVector
\n+\n+
345 global(const CoordVector &local) const
\n+
346 {
\n+
347 return transformCoordinate(referenceToKuhn(local,
\n+
348 getPermutation<dimension>(kuhnIndex)));
\n+
349 }
\n+
350
\n+
351 // common
\n+
352 template<int dimension, class CoordType>
\n+
353 template<int codimension>
\n+
\n+
354 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
\n+
355 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
\n+
356 public RefinementIteratorSpecial<dimension, CoordType, codimension>
\n+
357 {
\n+
358 public:
\n+\n+
360 typedef SubEntityIterator This;
\n+
361
\n+
362 SubEntityIterator(int nIntervals, bool end = false);
\n+
363
\n+
364 bool equals(const This &other) const;
\n+
365 protected:
\n+
366 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
\n+
367 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
\n+
368 };
\n+
\n+
369
\n+
370#ifndef DOXYGEN
\n+
371 template<int dimension, class CoordType>
\n+
372 template<int codimension>
\n+\n+
374 SubEntityIterator(int nIntervals, bool end)
\n+
375 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
\n+
376 {}
\n+
377
\n+
378 template<int dimension, class CoordType>
\n+
379 template<int codimension>
\n+
380 bool
\n+\n+
382 equals(const This &other) const
\n+
383 {
\n+
384 return kuhnIndex == other.kuhnIndex && backend == other.backend;
\n+
385 }
\n+
386#endif
\n+
387
\n+
388 } // namespace PyramidTriangulation
\n+
\n+
389 } // namespace RefinementImp
\n+
390
\n+
391 namespace RefinementImp
\n+
392 {
\n+
393 // ///////////////////////
\n+
394 //
\n+
395 // The refinement traits
\n+
396 //
\n+
397#ifndef DOXYGEN
\n+
398 template<unsigned topologyId, class CoordType, unsigned coerceToId>
\n+
399 struct Traits<
\n+
400 topologyId, CoordType, coerceToId, 3,
\n+
401 typename std::enable_if<
\n+
402 (GeometryTypes::pyramid.id() >> 1) ==
\n+
403 (topologyId >> 1) &&
\n+
404 (GeometryTypes::simplex(3).id() >> 1) ==
\n+
405 (coerceToId >> 1)
\n+
406 >::type>
\n+
407 {
\n+
408 typedef PyramidTriangulation::RefinementImp<3, CoordType> Imp;
\n+
409 };
\n+
410#endif
\n
411
\n-
412 // A^{-1}_L = (A^T A)^{-1} A^T
\n-
413 // => A^{-1}_L A = I
\n-
414 template< int m, int n >
\n-
415 static ctype leftInvA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, n, m > &ret )
\n-
416 {
\n-
417 static_assert((m >= n), "Matrix has no left inverse.");
\n-
418 using std::abs;
\n-
419 if constexpr( (n == 2) && (m == 2) )
\n-
420 {
\n-
421 const ctype det = (A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ]);
\n-
422 const ctype detInv = ctype( 1 ) / det;
\n-
423 ret[ 0 ][ 0 ] = A[ 1 ][ 1 ] * detInv;
\n-
424 ret[ 1 ][ 1 ] = A[ 0 ][ 0 ] * detInv;
\n-
425 ret[ 1 ][ 0 ] = -A[ 1 ][ 0 ] * detInv;
\n-
426 ret[ 0 ][ 1 ] = -A[ 0 ][ 1 ] * detInv;
\n-
427 return abs( det );
\n-
428 }
\n-
429 else
\n-
430 {
\n-
431 FieldMatrix< ctype, n, n > ata;
\n-
432 ATA_L( A, ata );
\n-
433 const ctype det = spdInvA( ata );
\n-
434 ATBT( ata, A, ret );
\n-
435 return det;
\n-
436 }
\n-
437 }
\n-
438
\n-
439 template< int m, int n >
\n-
440 static bool leftInvAx ( const FieldMatrix< ctype, m, n > &A, const FieldVector< ctype, m > &x, FieldVector< ctype, n > &y )
\n-
441 {
\n-
442 static_assert((m >= n), "Matrix has no left inverse.");
\n-
443 FieldMatrix< ctype, n, n > ata;
\n-
444 ATx( A, x, y );
\n-
445 ATA_L( A, ata );
\n-
446 return spdInvAx( ata, y, true );
\n-
447 }
\n-
448
\n-
450 template< int m, int n >
\n-
451 static ctype rightInvA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype, n, m > &ret )
\n-
452 {
\n-
453 static_assert((n >= m), "Matrix has no right inverse.");
\n-
454 using std::abs;
\n-
455 if constexpr( (n == 2) && (m == 2) )
\n-
456 {
\n-
457 const ctype det = (A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ]);
\n-
458 const ctype detInv = ctype( 1 ) / det;
\n-
459 ret[ 0 ][ 0 ] = A[ 1 ][ 1 ] * detInv;
\n-
460 ret[ 1 ][ 1 ] = A[ 0 ][ 0 ] * detInv;
\n-
461 ret[ 1 ][ 0 ] = -A[ 1 ][ 0 ] * detInv;
\n-
462 ret[ 0 ][ 1 ] = -A[ 0 ][ 1 ] * detInv;
\n-
463 return abs( det );
\n-
464 }
\n-
465 else
\n-
466 {
\n-
467 FieldMatrix< ctype, m , m > aat;
\n-
468 AAT_L( A, aat );
\n-
469 const ctype det = spdInvA( aat );
\n-
470 ATBT( A , aat , ret );
\n-
471 return det;
\n-
472 }
\n-
473 }
\n-
474
\n-
475 template< int m, int n >
\n-
476 static bool xTRightInvA ( const FieldMatrix< ctype, m, n > &A, const FieldVector< ctype, n > &x, FieldVector< ctype, m > &y )
\n-
477 {
\n-
478 static_assert((n >= m), "Matrix has no right inverse.");
\n-
479 FieldMatrix< ctype, m, m > aat;
\n-
480 Ax( A, x, y );
\n-
481 AAT_L( A, aat );
\n-
482 // check whether aat is singular and return true if non-singular
\n-
483 return spdInvAx( aat, y, true );
\n-
484 }
\n-
485 };
\n-
486
\n-
487 } // namespace Impl
\n-
488
\n-
489
\n-
490
\n-
496 template< class ct, int mydim, int cdim>
\n-
\n-\n-
498 {
\n-
499 public:
\n-
500
\n-
502 typedef ct ctype;
\n-
503
\n-
505 static const int mydimension= mydim;
\n-
506
\n-
508 static const int coorddimension = cdim;
\n-
509
\n-
511 typedef FieldVector< ctype, mydimension > LocalCoordinate;
\n-
512
\n-
514 typedef FieldVector< ctype, coorddimension > GlobalCoordinate;
\n-
515
\n-
517 typedef ctype Volume;
\n-
518
\n-
520 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed;
\n-
521
\n-
523 typedef FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed;
\n-
524
\n-
526 typedef FieldMatrix< ctype, coorddimension, mydimension > Jacobian;
\n-
527
\n-
529 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse;
\n-
530
\n-
531 private:
\n-\n-
534
\n-\n-
536
\n-
537 // Helper class to compute a matrix pseudo inverse
\n-
538 typedef Impl::FieldMatrixHelper< ct > MatrixHelper;
\n-
539
\n-
540 public:
\n-
547 AffineGeometry () = default;
\n-
548
\n-
\n-
550 AffineGeometry ( const ReferenceElement &refElement, const GlobalCoordinate &origin,
\n-
551 const JacobianTransposed &jt )
\n-
552 : refElement_(refElement), origin_(origin), jacobianTransposed_(jt)
\n-
553 {
\n-
554 integrationElement_ = MatrixHelper::template rightInvA< mydimension, coorddimension >( jacobianTransposed_, jacobianInverseTransposed_ );
\n-
555 }
\n-
\n-
556
\n-
\n-\n-
559 const JacobianTransposed &jt )
\n-
560 : AffineGeometry(ReferenceElements::general( gt ), origin, jt)
\n-
561 { }
\n-
\n-
562
\n-
564 template< class CoordVector >
\n-
\n-
565 AffineGeometry ( const ReferenceElement &refElement, const CoordVector &coordVector )
\n-
566 : refElement_(refElement), origin_(coordVector[0])
\n-
567 {
\n-
568 for( int i = 0; i < mydimension; ++i )
\n-
569 jacobianTransposed_[ i ] = coordVector[ i+1 ] - origin_;
\n-
570 integrationElement_ = MatrixHelper::template rightInvA< mydimension, coorddimension >( jacobianTransposed_, jacobianInverseTransposed_ );
\n-
571 }
\n-
\n-
572
\n-
574 template< class CoordVector >
\n-
\n-
575 AffineGeometry ( Dune::GeometryType gt, const CoordVector &coordVector )
\n-
576 : AffineGeometry(ReferenceElements::general( gt ), coordVector)
\n-
577 { }
\n-
\n-
578
\n-
580 bool affine () const { return true; }
\n-
581
\n-
583 Dune::GeometryType type () const { return refElement_.type(); }
\n-
584
\n-
586 int corners () const { return refElement_.size( mydimension ); }
\n-
587
\n-
\n-
589 GlobalCoordinate corner ( int i ) const
\n-
590 {
\n-
591 return global( refElement_.position( i, mydimension ) );
\n-
592 }
\n-
\n-
593
\n-
595 GlobalCoordinate center () const { return global( refElement_.position( 0, 0 ) ); }
\n-
596
\n-
\n-\n-
604 {
\n-
605 GlobalCoordinate global( origin_ );
\n-
606 jacobianTransposed_.umtv( local, global );
\n-
607 return global;
\n-
608 }
\n-
\n-
609
\n-
\n-\n-
624 {
\n-\n-
626 jacobianInverseTransposed_.mtv( global - origin_, local );
\n-
627 return local;
\n-
628 }
\n-
\n-
629
\n-
\n-
640 ctype integrationElement ([[maybe_unused]] const LocalCoordinate &local) const
\n-
641 {
\n-
642 return integrationElement_;
\n-
643 }
\n-
\n-
644
\n-
\n-
646 Volume volume () const
\n-
647 {
\n-
648 return integrationElement_ * refElement_.volume();
\n-
649 }
\n-
\n-
650
\n-
\n-
657 const JacobianTransposed &jacobianTransposed ([[maybe_unused]] const LocalCoordinate &local) const
\n-
658 {
\n-
659 return jacobianTransposed_;
\n-
660 }
\n-
\n-
661
\n-
\n-\n-
669 {
\n-
670 return jacobianInverseTransposed_;
\n-
671 }
\n-
\n-
672
\n-
\n-
679 Jacobian jacobian ([[maybe_unused]] const LocalCoordinate &local) const
\n-
680 {
\n-
681 return jacobianTransposed_.transposed();
\n-
682 }
\n-
\n-
683
\n-
\n-
690 JacobianInverse jacobianInverse ([[maybe_unused]] const LocalCoordinate &local) const
\n-
691 {
\n-
692 return jacobianInverseTransposed_.transposed();
\n-
693 }
\n-
\n-
694
\n-
\n-\n-
696 {
\n-
697 return geometry.refElement_;
\n-
698 }
\n-
\n-
699
\n-
700 private:
\n-
701 ReferenceElement refElement_;
\n-
702 GlobalCoordinate origin_;
\n-
703 JacobianTransposed jacobianTransposed_;
\n-
704 JacobianInverseTransposed jacobianInverseTransposed_;
\n-
705 ctype integrationElement_;
\n-
706 };
\n-
\n-
707
\n-
708} // namespace Dune
\n-
\n-
709
\n-
710#endif // #ifndef DUNE_GEOMETRY_AFFINEGEOMETRY_HH
\n-
A unique label for each type of element that can occur in a grid.
\n+
412 } // namespace RefinementImp
\n+
413} // namespace Dune
\n+
414
\n+
415#endif // DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
\n+
This file contains the parts independent of a particular Refinement implementation.
\n+
This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
\n+\n+
A unique label for each type of element that can occur in a grid.
\n+
STL namespace.
\n
Definition affinegeometry.hh:21
\n-
decltype(referenceElement(std::declval< T >()...)) ReferenceElement
Definition referenceelements.hh:347
\n-
This class provides access to geometric and topological properties of a reference element.
Definition referenceelement.hh:52
\n-
CoordinateField volume() const
obtain the volume of the reference element
Definition referenceelement.hh:228
\n-
GeometryType type(int i, int c) const
obtain the type of subentity (i,c)
Definition referenceelement.hh:167
\n-
Coordinate position(int i, int c) const
position of the barycenter of entity (i,c)
Definition referenceelement.hh:190
\n-
int size(int c) const
number of subentities of codimension c
Definition referenceelement.hh:94
\n-
Definition affinegeometry.hh:33
\n-
Class providing access to the singletons of the reference elements.
Definition referenceelements.hh:128
\n-
Implementation of the Geometry interface for affine geometries.
Definition affinegeometry.hh:498
\n-
AffineGeometry(const ReferenceElement &refElement, const CoordVector &coordVector)
Create affine geometry from reference element and a vector of vertex coordinates.
Definition affinegeometry.hh:565
\n-
AffineGeometry()=default
Constructs an empty geometry.
\n-
AffineGeometry(Dune::GeometryType gt, const GlobalCoordinate &origin, const JacobianTransposed &jt)
Create affine geometry from GeometryType, one vertex, and the Jacobian matrix.
Definition affinegeometry.hh:558
\n-
FieldVector< ctype, mydimension > LocalCoordinate
Type for local coordinate vector.
Definition affinegeometry.hh:511
\n-
Dune::GeometryType type() const
Obtain the type of the reference element.
Definition affinegeometry.hh:583
\n-
static const int mydimension
Dimension of the geometry.
Definition affinegeometry.hh:505
\n-
AffineGeometry(const ReferenceElement &refElement, const GlobalCoordinate &origin, const JacobianTransposed &jt)
Create affine geometry from reference element, one vertex, and the Jacobian matrix.
Definition affinegeometry.hh:550
\n-
ctype Volume
Type used for volume.
Definition affinegeometry.hh:517
\n-
JacobianInverse jacobianInverse(const LocalCoordinate &local) const
Obtain the Jacobian's inverse.
Definition affinegeometry.hh:690
\n-
friend ReferenceElement referenceElement(const AffineGeometry &geometry)
Definition affinegeometry.hh:695
\n-
AffineGeometry(Dune::GeometryType gt, const CoordVector &coordVector)
Create affine geometry from GeometryType and a vector of vertex coordinates.
Definition affinegeometry.hh:575
\n-
ctype integrationElement(const LocalCoordinate &local) const
Obtain the integration element.
Definition affinegeometry.hh:640
\n-
FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse
Type for the inverse Jacobian matrix.
Definition affinegeometry.hh:529
\n-
FieldMatrix< ctype, coorddimension, mydimension > Jacobian
Type for the Jacobian matrix.
Definition affinegeometry.hh:526
\n-
const JacobianInverseTransposed & jacobianInverseTransposed(const LocalCoordinate &local) const
Obtain the transposed of the Jacobian's inverse.
Definition affinegeometry.hh:668
\n-
FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed
Type for the transposed Jacobian matrix.
Definition affinegeometry.hh:520
\n-
GlobalCoordinate corner(int i) const
Obtain coordinates of the i-th corner.
Definition affinegeometry.hh:589
\n-
int corners() const
Obtain number of corners of the corresponding reference element.
Definition affinegeometry.hh:586
\n-
LocalCoordinate local(const GlobalCoordinate &global) const
Evaluate the inverse mapping.
Definition affinegeometry.hh:623
\n-
FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed
Type for the transposed inverse Jacobian matrix.
Definition affinegeometry.hh:523
\n-
static const int coorddimension
Dimension of the world space.
Definition affinegeometry.hh:508
\n-
GlobalCoordinate global(const LocalCoordinate &local) const
Evaluate the mapping.
Definition affinegeometry.hh:603
\n-
GlobalCoordinate center() const
Obtain the centroid of the mapping's image.
Definition affinegeometry.hh:595
\n-
Jacobian jacobian(const LocalCoordinate &local) const
Obtain the Jacobian.
Definition affinegeometry.hh:679
\n-
ct ctype
Type used for coordinates.
Definition affinegeometry.hh:502
\n-
FieldVector< ctype, coorddimension > GlobalCoordinate
Type for coordinate vector in world space.
Definition affinegeometry.hh:514
\n-
bool affine() const
Always true: this is an affine geometry.
Definition affinegeometry.hh:580
\n-
const JacobianTransposed & jacobianTransposed(const LocalCoordinate &local) const
Obtain the transposed of the Jacobian.
Definition affinegeometry.hh:657
\n-
Volume volume() const
Obtain the volume of the element.
Definition affinegeometry.hh:646
\n-
Unique label for each type of entities that can occur in DUNE grids.
Definition type.hh:114
\n+
FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType, dimension > point)
Definition pyramidtriangulation.cc:51
\n+
FieldVector< int, n > getPermutation(int m)
Calculate permutation from it's index.
Definition simplex.cc:293
\n+
FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
Map from the reference simplex to some Kuhn simplex.
Definition simplex.cc:322
\n+
Static tag representing a codimension.
Definition dimension.hh:24
\n+
generic geometry implementation based on corner coordinates
Definition multilineargeometry.hh:181
\n+\n+
Implementation of the refinement of a pyramid into simplices.
Definition pyramidtriangulation.cc:68
\n+
FieldVector< CoordType, dimension > CoordVector
Definition pyramidtriangulation.cc:77
\n+
static int nVertices(int nIntervals)
Definition pyramidtriangulation.cc:109
\n+
static int nElements(int nIntervals)
Definition pyramidtriangulation.cc:133
\n+
CoordType ctype
Definition pyramidtriangulation.cc:72
\n+
Codim< dimension >::SubEntityIterator VertexIterator
Definition pyramidtriangulation.cc:76
\n+
Codim< 0 >::SubEntityIterator ElementIterator
Definition pyramidtriangulation.cc:78
\n+
static constexpr int dimension
Definition pyramidtriangulation.cc:70
\n+
static ElementIterator eBegin(int nIntervals)
Definition pyramidtriangulation.cc:141
\n+
static ElementIterator eEnd(int nIntervals)
Definition pyramidtriangulation.cc:149
\n+
FieldVector< int, dimension+1 > IndexVector
Definition pyramidtriangulation.cc:79
\n+
static VertexIterator vBegin(int nIntervals)
Definition pyramidtriangulation.cc:117
\n+
static VertexIterator vEnd(int nIntervals)
Definition pyramidtriangulation.cc:125
\n+\n+
Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
Definition pyramidtriangulation.cc:103
\n+
RefinementImp< dimension, CoordType > Refinement
Definition pyramidtriangulation.cc:164
\n+
Refinement::template Codim< dimension >::Geometry Geometry
Definition pyramidtriangulation.cc:166
\n+
Refinement::BackendRefinement BackendRefinement
Definition pyramidtriangulation.cc:178
\n+\n+
BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
Definition pyramidtriangulation.cc:179
\n+\n+\n+\n+\n+\n+
Refinement::CoordVector CoordVector
Definition pyramidtriangulation.cc:246
\n+\n+
Refinement::template Codim< 0 >::Geometry Geometry
Definition pyramidtriangulation.cc:247
\n+
Refinement::IndexVector IndexVector
Definition pyramidtriangulation.cc:245
\n+
BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
Definition pyramidtriangulation.cc:264
\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition pyramidtriangulation.cc:244
\n+
Refinement::BackendRefinement BackendRefinement
Definition pyramidtriangulation.cc:263
\n+\n+
SubEntityIterator This
Definition pyramidtriangulation.cc:360
\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition pyramidtriangulation.cc:359
\n+\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,816 +1,606 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-affinegeometry.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+pyramidtriangulation.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_AFFINEGEOMETRY_HH\n-6#define DUNE_GEOMETRY_AFFINEGEOMETRY_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n+_\b6#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n 7\n-13#include \n-14\n-15#include \n-16#include \n-17\n-18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-19\n-_\b2_\b0namespace _\bD_\bu_\bn_\be\n-21{\n-22\n-23 // External Forward Declarations\n-24 // -----------------------------\n-25\n-_\b2_\b6 namespace Geo\n+8#include \n+9#include \n+10\n+11#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+12#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+13\n+14#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+15#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+16\n+17namespace _\bD_\bu_\bn_\be\n+18{\n+19 namespace RefinementImp\n+20 {\n+_\b2_\b6 namespace PyramidTriangulation\n 27 {\n-28\n-29 template< typename Implementation >\n-30 class _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-31\n-32 template< class ctype, int dim >\n-_\b3_\b3 class _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn;\n-34\n-35 template< class ctype, int dim >\n-36 struct _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs;\n-37\n-38 }\n-39\n+28 // ////////////\n+29 //\n+30 // Utilities\n+31 //\n+32\n+33 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n+34 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n+35\n+36 // ////////////////////////////////////\n+37 //\n+38 // Refine a pyramid with simplices\n+39 //\n 40\n-41 namespace Impl\n-42 {\n-43\n-44 // FieldMatrixHelper\n-45 // -----------------\n-46\n-47 template< class ct >\n-48 struct FieldMatrixHelper\n-49 {\n-50 typedef ct ctype;\n-51\n-52 template< int m, int n >\n-53 static void Ax ( const FieldMatrix< ctype, m, n > &A, const FieldVector<\n-ctype, n > &x, FieldVector< ctype, m > &ret )\n-54 {\n-55 for( int i = 0; i < m; ++i )\n-56 {\n-57 ret[ i ] = ctype( 0 );\n-58 for( int j = 0; j < n; ++j )\n-59 ret[ i ] += A[ i ][ j ] * x[ j ];\n-60 }\n-61 }\n-62\n-63 template< int m, int n >\n-64 static void ATx ( const FieldMatrix< ctype, m, n > &A, const FieldVector<\n-ctype, m > &x, FieldVector< ctype, n > &ret )\n-65 {\n-66 for( int i = 0; i < n; ++i )\n-67 {\n-68 ret[ i ] = ctype( 0 );\n-69 for( int j = 0; j < m; ++j )\n-70 ret[ i ] += A[ j ][ i ] * x[ j ];\n-71 }\n-72 }\n+41 // forward declaration of the iterator base\n+42 template\n+_\b4_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+44\n+45 /*\n+46 * The permutations 0 and 1 of the Kuhn-decomposition of a cube into\n+simplices form a pyramid.\n+47 * The resulting pyramid is not oriented the same as the reference pyramid\n+and so the Kuhn-coordinates\n+48 * have to be transformed using the method below.\n+49 */\n+50 template FieldVector\n+_\b5_\b1 _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be( FieldVector point)\n+52 {\n+53 FieldVector transform;\n+54 transform[0]=1-point[0];\n+55 transform[1]=1-point[1];\n+56 transform[2]=point[2];\n+57 return transform;\n+58 }\n+59\n+66 template\n+_\b6_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+68 {\n+69 public:\n+_\b7_\b0 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+71\n+_\b7_\b2 typedef CoordType _\bc_\bt_\by_\bp_\be;\n 73\n-74 template< int m, int n, int p >\n-75 static void AB ( const FieldMatrix< ctype, m, n > &A, const FieldMatrix<\n-ctype, n, p > &B, FieldMatrix< ctype, m, p > &ret )\n-76 {\n-77 for( int i = 0; i < m; ++i )\n-78 {\n-79 for( int j = 0; j < p; ++j )\n-80 {\n-81 ret[ i ][ j ] = ctype( 0 );\n-82 for( int k = 0; k < n; ++k )\n-83 ret[ i ][ j ] += A[ i ][ k ] * B[ k ][ j ];\n-84 }\n-85 }\n-86 }\n-87\n-88 template< int m, int n, int p >\n-89 static void ATBT ( const FieldMatrix< ctype, m, n > &A, const FieldMatrix<\n-ctype, p, m > &B, FieldMatrix< ctype, n, p > &ret )\n-90 {\n-91 for( int i = 0; i < n; ++i )\n-92 {\n-93 for( int j = 0; j < p; ++j )\n-94 {\n-95 ret[ i ][ j ] = ctype( 0 );\n-96 for( int k = 0; k < m; ++k )\n-97 ret[ i ][ j ] += A[ k ][ i ] * B[ j ][ k ];\n-98 }\n-99 }\n-100 }\n-101\n-102 template< int m, int n >\n-103 static void ATA_L ( const FieldMatrix< ctype, m, n > &A, FieldMatrix<\n-ctype, n, n > &ret )\n-104 {\n-105 for( int i = 0; i < n; ++i )\n-106 {\n-107 for( int j = 0; j <= i; ++j )\n-108 {\n-109 ret[ i ][ j ] = ctype( 0 );\n-110 for( int k = 0; k < m; ++k )\n-111 ret[ i ][ j ] += A[ k ][ i ] * A[ k ][ j ];\n+74 template\n+75 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b7_\b6 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b7 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b7_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b9 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+80\n+81 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n+82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+83 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n+84\n+85 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n+86 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+_\b8_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n+88\n+89 private:\n+90 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n+91 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n+92\n+93 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+94\n+95 constexpr static int nKuhnSimplices = 2;\n+96 };\n+97\n+98 template\n+99 template\n+_\b1_\b0_\b0 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n+101 {\n+102 class SubEntityIterator;\n+_\b1_\b0_\b3 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+104 };\n+105\n+106 template\n+107 int\n+_\b1_\b0_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+109_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n+110 {\n+111 return BackendRefinement::nVertices(nIntervals) * nKuhnSimplices;\n 112 }\n-113 }\n-114 }\n-115\n-116 template< int m, int n >\n-117 static void ATA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype,\n-n, n > &ret )\n+113\n+114 template\n+115 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+117_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n 118 {\n-119 for( int i = 0; i < n; ++i )\n-120 {\n-121 for( int j = 0; j <= i; ++j )\n-122 {\n-123 ret[ i ][ j ] = ctype( 0 );\n-124 for( int k = 0; k < m; ++k )\n-125 ret[ i ][ j ] += A[ k ][ i ] * A[ k ][ j ];\n-126 ret[ j ][ i ] = ret[ i ][ j ];\n-127 }\n-128\n-129 ret[ i ][ i ] = ctype( 0 );\n-130 for( int k = 0; k < m; ++k )\n-131 ret[ i ][ i ] += A[ k ][ i ] * A[ k ][ i ];\n-132 }\n-133 }\n-134\n-135 template< int m, int n >\n-136 static void AAT_L ( const FieldMatrix< ctype, m, n > &A, FieldMatrix<\n-ctype, m, m > &ret )\n-137 {\n-138 /*\n-139 if (m==2) {\n-140 ret[0][0] = A[0]*A[0];\n-141 ret[1][1] = A[1]*A[1];\n-142 ret[1][0] = A[0]*A[1];\n-143 }\n-144 else\n-145 */\n-146 for( int i = 0; i < m; ++i )\n-147 {\n-148 for( int j = 0; j <= i; ++j )\n-149 {\n-150 ctype &retij = ret[ i ][ j ];\n-151 retij = A[ i ][ 0 ] * A[ j ][ 0 ];\n-152 for( int k = 1; k < n; ++k )\n-153 retij += A[ i ][ k ] * A[ j ][ k ];\n-154 }\n-155 }\n-156 }\n-157\n-158 template< int m, int n >\n-159 static void AAT ( const FieldMatrix< ctype, m, n > &A, FieldMatrix< ctype,\n-m, m > &ret )\n-160 {\n-161 for( int i = 0; i < m; ++i )\n+119 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+120 }\n+121\n+122 template\n+123 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+125_\b _\bv_\bE_\bn_\bd(int nIntervals)\n+126 {\n+127 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+128 }\n+129\n+130 template\n+131 int\n+_\b1_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+133_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n+134 {\n+135 return BackendRefinement::nElements(nIntervals) * nKuhnSimplices;\n+136 }\n+137\n+138 template\n+139 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b4_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+141_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+142 {\n+143 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+144 }\n+145\n+146 template\n+147 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b4_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+149_\b _\be_\bE_\bn_\bd(int nIntervals)\n+150 {\n+151 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+152 }\n+153\n+154 // //////////////\n+155 //\n+156 // The iterator\n+157 //\n+158\n+159 // vertices\n+160 template\n+_\b1_\b6_\b1 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n 162 {\n-163 for( int j = 0; j < i; ++j )\n-164 {\n-165 ret[ i ][ j ] = ctype( 0 );\n-166 for( int k = 0; k < n; ++k )\n-167 ret[ i ][ j ] += A[ i ][ k ] * A[ j ][ k ];\n-168 ret[ j ][ i ] = ret[ i ][ j ];\n-169 }\n-170 ret[ i ][ i ] = ctype( 0 );\n-171 for( int k = 0; k < n; ++k )\n-172 ret[ i ][ i ] += A[ i ][ k ] * A[ i ][ k ];\n-173 }\n-174 }\n+163 public:\n+_\b1_\b6_\b4 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b6_\b5 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b1_\b6_\b6 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+167\n+168 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+169\n+170 void increment();\n+171\n+172 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+173\n+174 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n 175\n-176 template< int n >\n-177 static void Lx ( const FieldMatrix< ctype, n, n > &L, const FieldVector<\n-ctype, n > &x, FieldVector< ctype, n > &ret )\n-178 {\n-179 for( int i = 0; i < n; ++i )\n-180 {\n-181 ret[ i ] = ctype( 0 );\n-182 for( int j = 0; j <= i; ++j )\n-183 ret[ i ] += L[ i ][ j ] * x[ j ];\n-184 }\n-185 }\n-186\n-187 template< int n >\n-188 static void LTx ( const FieldMatrix< ctype, n, n > &L, const FieldVector<\n-ctype, n > &x, FieldVector< ctype, n > &ret )\n-189 {\n-190 for( int i = 0; i < n; ++i )\n-191 {\n-192 ret[ i ] = ctype( 0 );\n-193 for( int j = i; j < n; ++j )\n-194 ret[ i ] += L[ j ][ i ] * x[ j ];\n-195 }\n-196 }\n-197\n-198 template< int n >\n-199 static void LTL ( const FieldMatrix< ctype, n, n > &L, FieldMatrix< ctype,\n-n, n > &ret )\n-200 {\n-201 for( int i = 0; i < n; ++i )\n-202 {\n-203 for( int j = 0; j < i; ++j )\n+176 int index() const;\n+177 protected:\n+_\b1_\b7_\b8 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b7_\b9 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b1_\b8_\b0 constexpr static int nKuhnSimplices = 2;\n+181\n+_\b1_\b8_\b2 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n+183\n+_\b1_\b8_\b4 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b1_\b8_\b5 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b1_\b8_\b6 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+187 };\n+188\n+189 template\n+_\b1_\b9_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+191_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+192 : nIntervals_(nIntervals), kuhnIndex(0),\n+193 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n+194 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n+195 {\n+196 if (end)\n+197 kuhnIndex = nKuhnSimplices;\n+198 }\n+199\n+200 template\n+201 void\n+_\b2_\b0_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+203_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n 204 {\n-205 ret[ i ][ j ] = ctype( 0 );\n-206 for( int k = i; k < n; ++k )\n-207 ret[ i ][ j ] += L[ k ][ i ] * L[ k ][ j ];\n-208 ret[ j ][ i ] = ret[ i ][ j ];\n-209 }\n-210 ret[ i ][ i ] = ctype( 0 );\n-211 for( int k = i; k < n; ++k )\n-212 ret[ i ][ i ] += L[ k ][ i ] * L[ k ][ i ];\n-213 }\n-214 }\n-215\n-216 template< int n >\n-217 static void LLT ( const FieldMatrix< ctype, n, n > &L, FieldMatrix< ctype,\n-n, n > &ret )\n-218 {\n-219 for( int i = 0; i < n; ++i )\n-220 {\n-221 for( int j = 0; j < i; ++j )\n-222 {\n-223 ret[ i ][ j ] = ctype( 0 );\n-224 for( int k = 0; k <= j; ++k )\n-225 ret[ i ][ j ] += L[ i ][ k ] * L[ j ][ k ];\n-226 ret[ j ][ i ] = ret[ i ][ j ];\n-227 }\n-228 ret[ i ][ i ] = ctype( 0 );\n-229 for( int k = 0; k <= i; ++k )\n-230 ret[ i ][ i ] += L[ i ][ k ] * L[ i ][ k ];\n-231 }\n-232 }\n-233\n-234 template< int n >\n-235 static bool cholesky_L ( const FieldMatrix< ctype, n, n > &A, FieldMatrix<\n-ctype, n, n > &ret, const bool checkSingular = false )\n-236 {\n-237 using std::sqrt;\n-238 for( int i = 0; i < n; ++i )\n-239 {\n-240 ctype &rii = ret[ i ][ i ];\n-241\n-242 ctype xDiag = A[ i ][ i ];\n-243 for( int j = 0; j < i; ++j )\n-244 xDiag -= ret[ i ][ j ] * ret[ i ][ j ];\n-245\n-246 // in some cases A can be singular, e.g. when checking local for\n-247 // outside points during checkInside\n-248 if( checkSingular && ! ( xDiag > ctype( 0 )) )\n-249 return false ;\n+205 ++backend;\n+206 if(backend == backendEnd)\n+207 {\n+208 backend = BackendRefinement::vBegin(nIntervals_);\n+209 ++kuhnIndex;\n+210 }\n+211 }\n+212\n+213 template\n+214 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b2_\b1_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+216_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+217 {\n+218 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n+219 getPermutation(kuhnIndex)));\n+220 }\n+221\n+222 template\n+223 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b2_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n+const\n+225 {\n+226 std::vector corners(1);\n+227 corners[0] = referenceToKuhn(backend.coords(), getPermutation\n+(kuhnIndex));\n+228 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n+229 }\n+230\n+231 template\n+232 int\n+_\b2_\b3_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+234_\b _\bi_\bn_\bd_\be_\bx() const\n+235 {\n+236 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n+();\n+237 }\n+238\n+239 // elements\n+240 template\n+_\b2_\b4_\b1 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+242 {\n+243 public:\n+_\b2_\b4_\b4 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b4_\b5 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b6 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b7 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+248\n+249 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n 250\n-251 // otherwise this should be true always\n-252 assert( xDiag > ctype( 0 ) );\n-253 rii = sqrt( xDiag );\n-254\n-255 ctype invrii = ctype( 1 ) / rii;\n-256 for( int k = i+1; k < n; ++k )\n-257 {\n-258 ctype x = A[ k ][ i ];\n-259 for( int j = 0; j < i; ++j )\n-260 x -= ret[ i ][ j ] * ret[ k ][ j ];\n-261 ret[ k ][ i ] = invrii * x;\n-262 }\n-263 }\n-264\n-265 // return true for meaning A is non-singular\n-266 return true;\n-267 }\n+251 void increment();\n+252\n+253 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+254 int index() const;\n+255 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+256\n+257 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n+258\n+259 private:\n+260 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n+261\n+262 protected:\n+_\b2_\b6_\b3 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b6_\b4 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b2_\b6_\b5 constexpr static int nKuhnSimplices = 2;\n+266\n+_\b2_\b6_\b7 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n 268\n-269 template< int n >\n-270 static ctype detL ( const FieldMatrix< ctype, n, n > &L )\n-271 {\n-272 ctype det( 1 );\n-273 for( int i = 0; i < n; ++i )\n-274 det *= L[ i ][ i ];\n-275 return det;\n-276 }\n-277\n-278 template< int n >\n-279 static ctype invL ( FieldMatrix< ctype, n, n > &L )\n+_\b2_\b6_\b9 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b2_\b7_\b0 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b2_\b7_\b1 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+272 };\n+273\n+274 template\n+_\b2_\b7_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+276_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+277 : nIntervals_(nIntervals), kuhnIndex(0),\n+278 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n+279 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n 280 {\n-281 ctype det( 1 );\n-282 for( int i = 0; i < n; ++i )\n-283 {\n-284 ctype &lii = L[ i ][ i ];\n-285 det *= lii;\n-286 lii = ctype( 1 ) / lii;\n-287 for( int j = 0; j < i; ++j )\n-288 {\n-289 ctype &lij = L[ i ][ j ];\n-290 ctype x = lij * L[ j ][ j ];\n-291 for( int k = j+1; k < i; ++k )\n-292 x += L[ i ][ k ] * L[ k ][ j ];\n-293 lij = (-lii) * x;\n-294 }\n+281 if (end)\n+282 kuhnIndex = nKuhnSimplices;\n+283 }\n+284\n+285 template\n+286 void\n+_\b2_\b8_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+288_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+289 {\n+290 ++backend;\n+291 if (backend == backendEnd)\n+292 {\n+293 backend = BackendRefinement::eBegin(nIntervals_);\n+294 ++kuhnIndex;\n 295 }\n-296 return det;\n-297 }\n-298\n-299 // calculates x := L^{-1} x\n-300 template< int n >\n-301 static void invLx ( FieldMatrix< ctype, n, n > &L, FieldVector< ctype, n >\n-&x )\n+296 }\n+297\n+298 template\n+299 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b0_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+301_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n 302 {\n-303 for( int i = 0; i < n; ++i )\n-304 {\n-305 for( int j = 0; j < i; ++j )\n-306 x[ i ] -= L[ i ][ j ] * x[ j ];\n-307 x[ i ] /= L[ i ][ i ];\n-308 }\n+303 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n+304\n+305 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n+306 indices += base;\n+307\n+308 return indices;\n 309 }\n 310\n-311 // calculates x := L^{-T} x\n-312 template< int n >\n-313 static void invLTx ( FieldMatrix< ctype, n, n > &L, FieldVector< ctype, n >\n-&x )\n-314 {\n-315 for( int i = n; i > 0; --i )\n-316 {\n-317 for( int j = i; j < n; ++j )\n-318 x[ i-1 ] -= L[ j ][ i-1 ] * x[ j ];\n-319 x[ i-1 ] /= L[ i-1 ][ i-1 ];\n-320 }\n-321 }\n-322\n-323 template< int n >\n-324 static ctype spdDetA ( const FieldMatrix< ctype, n, n > &A )\n-325 {\n-326 // return A[0][0]*A[1][1]-A[1][0]*A[1][0];\n-327 FieldMatrix< ctype, n, n > L;\n-328 cholesky_L( A, L );\n-329 return detL( L );\n-330 }\n-331\n-332 template< int n >\n-333 static ctype spdInvA ( FieldMatrix< ctype, n, n > &A )\n-334 {\n-335 FieldMatrix< ctype, n, n > L;\n-336 cholesky_L( A, L );\n-337 const ctype det = invL( L );\n-338 LTL( L, A );\n-339 return det;\n-340 }\n-341\n-342 // calculate x := A^{-1} x\n-343 template< int n >\n-344 static bool spdInvAx ( FieldMatrix< ctype, n, n > &A, FieldVector< ctype, n\n-> &x, const bool checkSingular = false )\n-345 {\n-346 FieldMatrix< ctype, n, n > L;\n-347 const bool invertible = cholesky_L( A, L, checkSingular );\n-348 if( ! invertible ) return invertible ;\n-349 invLx( L, x );\n-350 invLTx( L, x );\n-351 return invertible;\n-352 }\n-353\n-354 template< int m, int n >\n-355 static ctype detATA ( const FieldMatrix< ctype, m, n > &A )\n-356 {\n-357 if( m >= n )\n-358 {\n-359 FieldMatrix< ctype, n, n > ata;\n-360 ATA_L( A, ata );\n-361 return spdDetA( ata );\n-362 }\n-363 else\n-364 return ctype( 0 );\n-365 }\n-366\n-372 template< int m, int n >\n-373 static ctype sqrtDetAAT ( const FieldMatrix< ctype, m, n > &A )\n-374 {\n-375 using std::abs;\n-376 using std::sqrt;\n-377 // These special cases are here not only for speed reasons:\n-378 // The general implementation aborts if the matrix is almost singular,\n-379 // and the special implementation provide a stable way to handle that case.\n-380 if( (n == 2) && (m == 2) )\n-381 {\n-382 // Special implementation for 2x2 matrices: faster and more stable\n-383 return abs( A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ] );\n-384 }\n-385 else if( (n == 3) && (m == 3) )\n-386 {\n-387 // Special implementation for 3x3 matrices\n-388 const ctype v0 = A[ 0 ][ 1 ] * A[ 1 ][ 2 ] - A[ 1 ][ 1 ] * A[ 0 ][ 2 ];\n-389 const ctype v1 = A[ 0 ][ 2 ] * A[ 1 ][ 0 ] - A[ 1 ][ 2 ] * A[ 0 ][ 0 ];\n-390 const ctype v2 = A[ 0 ][ 0 ] * A[ 1 ][ 1 ] - A[ 1 ][ 0 ] * A[ 0 ][ 1 ];\n-391 return abs( v0 * A[ 2 ][ 0 ] + v1 * A[ 2 ][ 1 ] + v2 * A[ 2 ][ 2 ] );\n-392 }\n-393 else if ( (n == 3) && (m == 2) )\n-394 {\n-395 // Special implementation for 2x3 matrices\n-396 const ctype v0 = A[ 0 ][ 0 ] * A[ 1 ][ 1 ] - A[ 0 ][ 1 ] * A[ 1 ][ 0 ];\n-397 const ctype v1 = A[ 0 ][ 0 ] * A[ 1 ][ 2 ] - A[ 1 ][ 0 ] * A[ 0 ][ 2 ];\n-398 const ctype v2 = A[ 0 ][ 1 ] * A[ 1 ][ 2 ] - A[ 0 ][ 2 ] * A[ 1 ][ 1 ];\n-399 return sqrt( v0*v0 + v1*v1 + v2*v2);\n-400 }\n-401 else if( n >= m )\n-402 {\n-403 // General case\n-404 FieldMatrix< ctype, m, m > aat;\n-405 AAT_L( A, aat );\n-406 return spdDetA( aat );\n-407 }\n-408 else\n-409 return ctype( 0 );\n-410 }\n+311 template\n+312 int\n+_\b3_\b1_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+314_\b _\bi_\bn_\bd_\be_\bx() const\n+315 {\n+316 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n+();\n+317 }\n+318\n+319 template\n+320 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+322_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+323 {\n+324 return global(backend.coords());\n+325 }\n+326\n+327 template\n+328 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b3_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+330_\b _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n+331 {\n+332 const typename BackendIterator::Geometry &\n+333 bgeo = backend.geometry();\n+334 std::vector corners(dimension+1);\n+335 for(int i = 0; i <= dimension; ++i)\n+336 corners[i] = global(bgeo.corner(i));\n+337\n+338 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n+339 }\n+340\n+341 template\n+342 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>::\n+343 CoordVector\n+344 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+345_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n+346 {\n+347 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(local,\n+348 getPermutation(kuhnIndex)));\n+349 }\n+350\n+351 // common\n+352 template\n+353 template\n+_\b3_\b5_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+355 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+356 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+357 {\n+358 public:\n+_\b3_\b5_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b3_\b6_\b0 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n+361\n+_\b3_\b6_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n+363\n+_\b3_\b6_\b4 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n+365 protected:\n+366 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+kuhnIndex;\n+367 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+backend;\n+368 };\n+369\n+370#ifndef DOXYGEN\n+371 template\n+372 template\n+373 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+374_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n+375 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n+end)\n+376 {}\n+377\n+378 template\n+379 template\n+380 bool\n+381 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+382_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n+383 {\n+384 return kuhnIndex == other.kuhnIndex && backend == other.backend;\n+385 }\n+386#endif\n+387\n+388 } // namespace PyramidTriangulation\n+389 } // namespace RefinementImp\n+390\n+391 namespace RefinementImp\n+392 {\n+393 // ///////////////////////\n+394 //\n+395 // The refinement traits\n+396 //\n+397#ifndef DOXYGEN\n+398 template\n+399 struct Traits<\n+400 topologyId, CoordType, coerceToId, 3,\n+401 typename _\bs_\bt_\bd::enable_if<\n+402 (GeometryTypes::pyramid.id() >> 1) ==\n+403 (topologyId >> 1) &&\n+404 (GeometryTypes::simplex(3).id() >> 1) ==\n+405 (coerceToId >> 1)\n+406 >::type>\n+407 {\n+408 typedef PyramidTriangulation::RefinementImp<3, CoordType> Imp;\n+409 };\n+410#endif\n 411\n-412 // A^{-1}_L = (A^T A)^{-1} A^T\n-413 // => A^{-1}_L A = I\n-414 template< int m, int n >\n-415 static ctype leftInvA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix<\n-ctype, n, m > &ret )\n-416 {\n-417 static_assert((m >= n), \"Matrix has no left inverse.\");\n-418 using std::abs;\n-419 if constexpr( (n == 2) && (m == 2) )\n-420 {\n-421 const ctype det = (A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ]);\n-422 const ctype detInv = ctype( 1 ) / det;\n-423 ret[ 0 ][ 0 ] = A[ 1 ][ 1 ] * detInv;\n-424 ret[ 1 ][ 1 ] = A[ 0 ][ 0 ] * detInv;\n-425 ret[ 1 ][ 0 ] = -A[ 1 ][ 0 ] * detInv;\n-426 ret[ 0 ][ 1 ] = -A[ 0 ][ 1 ] * detInv;\n-427 return abs( det );\n-428 }\n-429 else\n-430 {\n-431 FieldMatrix< ctype, n, n > ata;\n-432 ATA_L( A, ata );\n-433 const ctype det = spdInvA( ata );\n-434 ATBT( ata, A, ret );\n-435 return det;\n-436 }\n-437 }\n-438\n-439 template< int m, int n >\n-440 static bool leftInvAx ( const FieldMatrix< ctype, m, n > &A, const\n-FieldVector< ctype, m > &x, FieldVector< ctype, n > &y )\n-441 {\n-442 static_assert((m >= n), \"Matrix has no left inverse.\");\n-443 FieldMatrix< ctype, n, n > ata;\n-444 ATx( A, x, y );\n-445 ATA_L( A, ata );\n-446 return spdInvAx( ata, y, true );\n-447 }\n-448\n-450 template< int m, int n >\n-451 static ctype rightInvA ( const FieldMatrix< ctype, m, n > &A, FieldMatrix<\n-ctype, n, m > &ret )\n-452 {\n-453 static_assert((n >= m), \"Matrix has no right inverse.\");\n-454 using std::abs;\n-455 if constexpr( (n == 2) && (m == 2) )\n-456 {\n-457 const ctype det = (A[ 0 ][ 0 ]*A[ 1 ][ 1 ] - A[ 1 ][ 0 ]*A[ 0 ][ 1 ]);\n-458 const ctype detInv = ctype( 1 ) / det;\n-459 ret[ 0 ][ 0 ] = A[ 1 ][ 1 ] * detInv;\n-460 ret[ 1 ][ 1 ] = A[ 0 ][ 0 ] * detInv;\n-461 ret[ 1 ][ 0 ] = -A[ 1 ][ 0 ] * detInv;\n-462 ret[ 0 ][ 1 ] = -A[ 0 ][ 1 ] * detInv;\n-463 return abs( det );\n-464 }\n-465 else\n-466 {\n-467 FieldMatrix< ctype, m , m > aat;\n-468 AAT_L( A, aat );\n-469 const ctype det = spdInvA( aat );\n-470 ATBT( A , aat , ret );\n-471 return det;\n-472 }\n-473 }\n-474\n-475 template< int m, int n >\n-476 static bool xTRightInvA ( const FieldMatrix< ctype, m, n > &A, const\n-FieldVector< ctype, n > &x, FieldVector< ctype, m > &y )\n-477 {\n-478 static_assert((n >= m), \"Matrix has no right inverse.\");\n-479 FieldMatrix< ctype, m, m > aat;\n-480 Ax( A, x, y );\n-481 AAT_L( A, aat );\n-482 // check whether aat is singular and return true if non-singular\n-483 return spdInvAx( aat, y, true );\n-484 }\n-485 };\n-486\n-487 } // namespace Impl\n-488\n-489\n-490\n-496 template< class ct, int mydim, int cdim>\n-_\b4_\b9_\b7 class _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-498 {\n-499 public:\n-500\n-_\b5_\b0_\b2 typedef ct _\bc_\bt_\by_\bp_\be;\n-503\n-_\b5_\b0_\b5 static const int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn= mydim;\n-506\n-_\b5_\b0_\b8 static const int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = cdim;\n-509\n-_\b5_\b1_\b1 typedef FieldVector< ctype, mydimension > _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-512\n-_\b5_\b1_\b4 typedef FieldVector< ctype, coorddimension > _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-515\n-_\b5_\b1_\b7 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n-518\n-_\b5_\b2_\b0 typedef FieldMatrix< ctype, mydimension, coorddimension >\n-_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-521\n-_\b5_\b2_\b3 typedef FieldMatrix< ctype, coorddimension, mydimension >\n-_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-524\n-_\b5_\b2_\b6 typedef FieldMatrix< ctype, coorddimension, mydimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn;\n-527\n-_\b5_\b2_\b9 typedef FieldMatrix< ctype, mydimension, coorddimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be;\n-530\n-531 private:\n-533 typedef _\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b<_\b _\bc_\bt_\by_\bp_\be_\b,\n-_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b> > _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-534\n-535 typedef _\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b> _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs;\n-536\n-537 // Helper class to compute a matrix pseudo inverse\n-538 typedef Impl::FieldMatrixHelper< ct > MatrixHelper;\n-539\n-540 public:\n-_\b5_\b4_\b7 _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by () = default;\n-548\n-_\b5_\b5_\b0 _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &refElement, const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-&origin,\n-551 const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n-552 : refElement_(refElement), origin_(origin), jacobianTransposed_(jt)\n-553 {\n-554 integrationElement_ = MatrixHelper::template rightInvA< mydimension,\n-coorddimension >( jacobianTransposed_, jacobianInverseTransposed_ );\n-555 }\n-556\n-_\b5_\b5_\b8 _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &origin,\n-559 const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n-560 : _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general( gt ), origin, jt)\n-561 { }\n-562\n-564 template< class CoordVector >\n-_\b5_\b6_\b5 _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &refElement, const CoordVector\n-&coordVector )\n-566 : refElement_(refElement), origin_(coordVector[0])\n-567 {\n-568 for( int i = 0; i < _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; ++i )\n-569 jacobianTransposed_[ i ] = coordVector[ i+1 ] - origin_;\n-570 integrationElement_ = MatrixHelper::template rightInvA< mydimension,\n-coorddimension >( jacobianTransposed_, jacobianInverseTransposed_ );\n-571 }\n-572\n-574 template< class CoordVector >\n-_\b5_\b7_\b5 _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, const CoordVector &coordVector )\n-576 : _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general( gt ), coordVector)\n-577 { }\n-578\n-_\b5_\b8_\b0 bool _\ba_\bf_\bf_\bi_\bn_\be () const { return true; }\n-581\n-_\b5_\b8_\b3 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const { return refElement_._\bt_\by_\bp_\be(); }\n-584\n-_\b5_\b8_\b6 int _\bc_\bo_\br_\bn_\be_\br_\bs () const { return refElement_._\bs_\bi_\bz_\be( _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ); }\n-587\n-_\b5_\b8_\b9 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br ( int i ) const\n-590 {\n-591 return _\bg_\bl_\bo_\bb_\ba_\bl( refElement_._\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn( i, _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ) );\n-592 }\n-593\n-_\b5_\b9_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const { return _\bg_\bl_\bo_\bb_\ba_\bl( refElement_._\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn( 0,\n-0 ) ); }\n-596\n-_\b6_\b0_\b3 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n-604 {\n-605 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl( origin_ );\n-606 jacobianTransposed_.umtv( _\bl_\bo_\bc_\ba_\bl, _\bg_\bl_\bo_\bb_\ba_\bl );\n-607 return _\bg_\bl_\bo_\bb_\ba_\bl;\n-608 }\n-609\n-_\b6_\b2_\b3 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl ( const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bg_\bl_\bo_\bb_\ba_\bl ) const\n-624 {\n-625 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl;\n-626 jacobianInverseTransposed_.mtv( _\bg_\bl_\bo_\bb_\ba_\bl - origin_, _\bl_\bo_\bc_\ba_\bl );\n-627 return _\bl_\bo_\bc_\ba_\bl;\n-628 }\n-629\n-_\b6_\b4_\b0 _\bc_\bt_\by_\bp_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt ([[maybe_unused]] const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl)\n-const\n-641 {\n-642 return integrationElement_;\n-643 }\n-644\n-_\b6_\b4_\b6 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be () const\n-647 {\n-648 return integrationElement_ * refElement_._\bv_\bo_\bl_\bu_\bm_\be();\n-649 }\n-650\n-_\b6_\b5_\b7 const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ([[maybe_unused]] const\n-_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-658 {\n-659 return jacobianTransposed_;\n-660 }\n-661\n-_\b6_\b6_\b8 const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ([\n-[maybe_unused]] const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-669 {\n-670 return jacobianInverseTransposed_;\n-671 }\n-672\n-_\b6_\b7_\b9 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn ([[maybe_unused]] const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-680 {\n-681 return jacobianTransposed_.transposed();\n-682 }\n-683\n-_\b6_\b9_\b0 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be ([[maybe_unused]] const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-&_\bl_\bo_\bc_\ba_\bl) const\n-691 {\n-692 return jacobianInverseTransposed_.transposed();\n-693 }\n-694\n-_\b6_\b9_\b5 friend _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by &geometry )\n-696 {\n-697 return geometry.refElement_;\n-698 }\n-699\n-700 private:\n-701 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt refElement_;\n-702 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be origin_;\n-703 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianTransposed_;\n-704 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianInverseTransposed_;\n-705 _\bc_\bt_\by_\bp_\be integrationElement_;\n-706 };\n-707\n-708} // namespace Dune\n-709\n-710#endif // #ifndef DUNE_GEOMETRY_AFFINEGEOMETRY_HH\n+412 } // namespace RefinementImp\n+413} // namespace Dune\n+414\n+415#endif // DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n+_\bb_\ba_\bs_\be_\b._\bc_\bc\n+This file contains the parts independent of a particular Refinement\n+implementation.\n+_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n+This file contains the Refinement implementation for simplices (triangles,\n+tetrahedrons....\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-decltype(referenceElement(std::declval< T >()...)) ReferenceElement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:347\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-This class provides access to geometric and topological properties of a\n-reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-CoordinateField volume() const\n-obtain the volume of the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:228\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bt_\by_\bp_\be\n-GeometryType type(int i, int c) const\n-obtain the type of subentity (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:167\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n-Coordinate position(int i, int c) const\n-position of the barycenter of entity (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:190\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bi_\bz_\be\n-int size(int c) const\n-number of subentities of codimension c\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:33\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Class providing access to the singletons of the reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Implementation of the Geometry interface for affine geometries.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:498\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry(const ReferenceElement &refElement, const CoordVector\n-&coordVector)\n-Create affine geometry from reference element and a vector of vertex\n-coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:565\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry()=default\n-Constructs an empty geometry.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry(Dune::GeometryType gt, const GlobalCoordinate &origin, const\n-JacobianTransposed &jt)\n-Create affine geometry from GeometryType, one vertex, and the Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:558\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, mydimension > LocalCoordinate\n-Type for local coordinate vector.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:511\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n-Dune::GeometryType type() const\n-Obtain the type of the reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:583\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int mydimension\n-Dimension of the geometry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:505\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry(const ReferenceElement &refElement, const GlobalCoordinate\n-&origin, const JacobianTransposed &jt)\n-Create affine geometry from reference element, one vertex, and the Jacobian\n-matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:550\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-ctype Volume\n-Type used for volume.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:517\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n-Obtain the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:690\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-friend ReferenceElement referenceElement(const AffineGeometry &geometry)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:695\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AffineGeometry(Dune::GeometryType gt, const CoordVector &coordVector)\n-Create affine geometry from GeometryType and a vector of vertex coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:575\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ctype integrationElement(const LocalCoordinate &local) const\n-Obtain the integration element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:640\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse\n-Type for the inverse Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:529\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-FieldMatrix< ctype, coorddimension, mydimension > Jacobian\n-Type for the Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:526\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-const JacobianInverseTransposed & jacobianInverseTransposed(const\n-LocalCoordinate &local) const\n-Obtain the transposed of the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:668\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed\n-Type for the transposed Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:520\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-GlobalCoordinate corner(int i) const\n-Obtain coordinates of the i-th corner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:589\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n-int corners() const\n-Obtain number of corners of the corresponding reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:586\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-LocalCoordinate local(const GlobalCoordinate &global) const\n-Evaluate the inverse mapping.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:623\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed\n-Type for the transposed inverse Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:523\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int coorddimension\n-Dimension of the world space.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:508\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-GlobalCoordinate global(const LocalCoordinate &local) const\n-Evaluate the mapping.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:603\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n-GlobalCoordinate center() const\n-Obtain the centroid of the mapping's image.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:595\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Jacobian jacobian(const LocalCoordinate &local) const\n-Obtain the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:679\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n-ct ctype\n-Type used for coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:502\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, coorddimension > GlobalCoordinate\n-Type for coordinate vector in world space.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:514\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine() const\n-Always true: this is an affine geometry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:580\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-const JacobianTransposed & jacobianTransposed(const LocalCoordinate &local)\n-const\n-Obtain the transposed of the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:657\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bf_\bf_\bi_\bn_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume() const\n-Obtain the volume of the element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:646\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-Unique label for each type of entities that can occur in DUNE grids.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType,\n+dimension > point)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n+FieldVector< int, n > getPermutation(int m)\n+Calculate permutation from it's index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n+FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n+dimension > point, const FieldVector< int, dimension > &kuhn)\n+Map from the reference simplex to some Kuhn simplex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Static tag representing a codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+generic geometry implementation based on corner coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:43\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+Implementation of the refinement of a pyramid into simplices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:109\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:133\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n+CoordType ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:76\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:70\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:141\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< int, dimension+1 > IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:117\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:125\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:101\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n+Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:103\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:164\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< dimension >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:166\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:178\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:185\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< dimension >::SubEntityIterator\n+BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:179\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:184\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:165\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:186\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:182\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:271\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:246\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< 0 >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:247\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:245\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:264\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:270\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:244\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const This &other) const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\b>_\b:_\b:_\bT_\bh_\bi_\bs\n+SubEntityIterator This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(int nIntervals, bool end=false)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:359\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00179.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00179.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelement.hh File Reference\n+dune-geometry: prismtriangulation.cc File Reference\n \n \n \n \n \n \n \n@@ -65,44 +65,86 @@\n \n \n \n \n \n \n \n
\n \n-
referenceelement.hh File Reference
\n+Namespaces |\n+Macros |\n+Functions
\n+
prismtriangulation.cc File Reference
\n \n
\n-
#include <dune/geometry/type.hh>
\n+
#include <dune/common/fvector.hh>
\n+#include <dune/common/typetraits.hh>
\n+#include <dune/geometry/referenceelements.hh>
\n+#include <dune/geometry/type.hh>
\n+#include "base.cc"
\n+#include "simplex.cc"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

class  Dune::Geo::ReferenceElement< Implementation >
 This class provides access to geometric and topological properties of a reference element. More...
class  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >
 Implementation of the refinement of a prism into simplices. More...
 
struct  Dune::Geo::ReferenceElement< Implementation >::Codim< codim >
 Collection of types depending on the codimension. More...
struct  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
class  Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
 
class  Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
 
class  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
\n \n \n \n-\n+\n+\n \n+\n+\n+\n+

\n Namespaces

namespace  Dune
 
namespace  Dune::Geo
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
namespace  Dune::RefinementImp::PrismTriangulation
 This namespace contains the Refinement implementation for triangulating prisms (GeometryType::prism -> GeometryType::simplex)
 
\n+\n+\n+\n+

\n+Macros

#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
 
\n+\n+\n+\n+\n

\n+Functions

template<int dimension, class CoordType >
FieldVector< CoordType, dimension > Dune::RefinementImp::PrismTriangulation::transformCoordinate (FieldVector< CoordType, dimension > point)
 
\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
\n+
\n+\n+
\n+
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,57 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-referenceelement.hh File Reference\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+prismtriangulation.cc File Reference\n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>\n-\u00a0 This class provides access to geometric and topological properties of\n- a reference element. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0 Implementation of the refinement of a prism into simplices. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\b _\b>\n-\u00a0 Collection of types depending on the codimension. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n+\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n+ triangulating prisms (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\br_\bi_\bs_\bm -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx)\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bP_\bR_\bI_\bS_\bM_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+ _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be (FieldVector<\n+ CoordType, dimension > point)\n \u00a0\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_P\bPR\bRI\bIS\bSM\bMT\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00179_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00179_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelement.hh Source File\n+dune-geometry: prismtriangulation.cc Source File\n \n \n \n \n \n \n \n@@ -70,265 +70,521 @@\n
\n \n \n \n \n \n \n
\n-
referenceelement.hh
\n+
prismtriangulation.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_REFERENCEELEMENT_HH
\n-
6#define DUNE_GEOMETRY_REFERENCEELEMENT_HH
\n+
5#ifndef DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
\n+
6#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
\n
7
\n-\n-
9
\n-
10namespace Dune {
\n-
11 namespace Geo {
\n-
12
\n-
13 namespace Impl {
\n-
14
\n-
15 // forward declaration for friend declaration
\n-
16 template<typename ctype, int dim>
\n-
17 class ReferenceElementContainer;
\n-
18
\n-
19 }
\n-
20
\n-
21 // forward declaration for constructing default reference element type
\n-
22 template<typename ctype, int dim>
\n-
23 class ReferenceElementImplementation;
\n-
24
\n-
25 // forward declaration for backwards compatibility conversion
\n-
26 template<typename ctype, int dim>
\n-
27 struct ReferenceElements;
\n-
28
\n-
29 // ReferenceElement
\n-
30 // ----------------
\n-
31
\n-
50 template<typename Implementation>
\n-
\n-\n-
52 {
\n-
53
\n-
54 public:
\n-
55
\n-
56#ifndef DOXYGEN
\n-
57
\n-
59 template<int codim>
\n-
60 using Codim = typename Implementation::template Codim<codim>;
\n-
61
\n-
62#else
\n-
63
\n-
65 template< int codim >
\n+
8#include <dune/common/fvector.hh>
\n+
9#include <dune/common/typetraits.hh>
\n+
10
\n+\n+
12#include <dune/geometry/type.hh>
\n+
13
\n+
14#include "base.cc"
\n+
15#include "simplex.cc"
\n+
16
\n+
17namespace Dune
\n+
18{
\n+
19 namespace RefinementImp
\n+
20 {
\n+
\n+
26 namespace PrismTriangulation
\n+
27 {
\n+
28 // ////////////
\n+
29 //
\n+
30 // Utilities
\n+
31 //
\n+
32
\n+\n+\n+
35
\n+
36 // ////////////////////////////////////
\n+
37 //
\n+
38 // Refine a prism with simplices
\n+
39 //
\n+
40
\n+
41 // forward declaration of the iterator base
\n+
42 template<int dimension, class CoordType, int codimension>
\n+\n+
44 /*
\n+
45 * The permutations 0,2 and 3 of the Kuhn-decomposition of a cube into simplices form a prism.
\n+
46 * The resulting prism is not oriented the same as the reference prism and so the Kuhn-coordinates
\n+
47 * have to be transformed using the method below.
\n+
48 */
\n+
49 template<int dimension, class CoordType> FieldVector<CoordType, dimension>
\n+
\n+
50 transformCoordinate(FieldVector<CoordType, dimension> point)
\n+
51 {
\n+
52 FieldVector<CoordType, dimension> transform;
\n+
53 transform[0] = point[1];
\n+
54 transform[1] = 1 - point[0];
\n+
55 transform[2] = point[2];
\n+
56 return transform;
\n+
57 }
\n+
\n+
58
\n+
65 template<int dimension_, class CoordType>
\n
\n-
66 struct Codim
\n+\n
67 {
\n-
69 using Geometry = implementation-defined;
\n-
70 };
\n-
\n-
71
\n-
72#endif // DOXYGEN
\n-
73
\n-
75 using ctype = typename Implementation::ctype;
\n-
76
\n-\n+
68 public:
\n+
69 constexpr static int dimension = dimension_;
\n+
70
\n+
71 typedef CoordType ctype;
\n+
72
\n+
73 template<int codimension>
\n+
74 struct Codim;
\n+\n+
76 typedef FieldVector<CoordType, dimension> CoordVector;
\n+\n+
78 typedef FieldVector<int, dimension+1> IndexVector;
\n
79
\n-
81 using Coordinate = typename Implementation::Coordinate;
\n-
82
\n-
84 typedef ctype Volume;
\n-
85
\n-
87 static constexpr int dimension = Implementation::dimension;
\n-
88
\n-
89
\n-
\n-
94 int size(int c) const
\n-
95 {
\n-
96 return _impl->size(c);
\n-
97 }
\n-
\n-
98
\n-
99
\n-
\n-
111 int size(int i, int c, int cc) const
\n-
112 {
\n-
113 return _impl->size(i,c,cc);
\n-
114 }
\n-
\n-
115
\n-
116
\n-
\n-
130 int subEntity(int i, int c, int ii, int cc) const
\n-
131 {
\n-
132 return _impl->subEntity(i,c,ii,cc);
\n+
80 static int nVertices(int nIntervals);
\n+
81 static VertexIterator vBegin(int nIntervals);
\n+
82 static VertexIterator vEnd(int nIntervals);
\n+
83
\n+
84 static int nElements(int nIntervals);
\n+
85 static ElementIterator eBegin(int nIntervals);
\n+
86 static ElementIterator eEnd(int nIntervals);
\n+
87
\n+
88 private:
\n+
89 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
\n+
90 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
\n+
91
\n+\n+
93 };
\n+
\n+
94
\n+
95 template<int dimension, class CoordType>
\n+
96 template<int codimension>
\n+
\n+
97 struct RefinementImp<dimension, CoordType>::Codim
\n+
98 {
\n+
99 class SubEntityIterator;
\n+\n+
101 };
\n+
\n+
102
\n+
103 template<int dimension, class CoordType>
\n+
104 int
\n+
\n+\n+
106 nVertices(int nIntervals)
\n+
107 {
\n+
108 return BackendRefinement::nVertices(nIntervals) * 3;
\n+
109 }
\n+
\n+
110
\n+
111 template<int dimension, class CoordType>
\n+\n+
\n+\n+
114 vBegin(int nIntervals)
\n+
115 {
\n+
116 return VertexIterator(nIntervals);
\n+
117 }
\n+
\n+
118
\n+
119 template<int dimension, class CoordType>
\n+\n+
\n+\n+
122 vEnd(int nIntervals)
\n+
123 {
\n+
124 return VertexIterator(nIntervals, true);
\n+
125 }
\n+
\n+
126
\n+
127 template<int dimension, class CoordType>
\n+
128 int
\n+
\n+\n+
130 nElements(int nIntervals)
\n+
131 {
\n+
132 return BackendRefinement::nElements(nIntervals) * 3;
\n
133 }
\n
\n
134
\n-
\n-
153 auto subEntities ( int i, int c, int cc ) const
\n-
154 {
\n-
155 return _impl->subEntities(i,c,cc);
\n-
156 }
\n-
\n-
157
\n-
158
\n-
\n-
167 GeometryType type(int i, int c) const
\n-
168 {
\n-
169 return _impl->type(i,c);
\n-
170 }
\n-
\n+
135 template<int dimension, class CoordType>
\n+\n+
\n+\n+
138 eBegin(int nIntervals)
\n+
139 {
\n+
140 return ElementIterator(nIntervals);
\n+
141 }
\n+
\n+
142
\n+
143 template<int dimension, class CoordType>
\n+\n+
\n+\n+
146 eEnd(int nIntervals)
\n+
147 {
\n+
148 return ElementIterator(nIntervals, true);
\n+
149 }
\n+
\n+
150
\n+
151 // //////////////
\n+
152 //
\n+
153 // The iterator
\n+
154 //
\n+
155
\n+
156 // vertices
\n+
157 template<int dimension, class CoordType>
\n+
\n+
158 class RefinementIteratorSpecial<dimension, CoordType, dimension>
\n+
159 {
\n+
160 public:
\n+\n+
162 typedef typename Refinement::CoordVector CoordVector;
\n+
163 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
\n+
164
\n+
165 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
166
\n+
167 void increment();
\n+
168
\n+
169 CoordVector coords() const;
\n+
170 Geometry geometry () const;
\n
171
\n-
172
\n-
\n-\n-
176 {
\n-
177 return _impl->type();
\n-
178 }
\n-
\n+
172 int index() const;
\n+
173 protected:
\n+
174 typedef typename Refinement::BackendRefinement BackendRefinement;
\n+
175 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
\n+
176 constexpr static int nKuhnSimplices = 3;
\n+
177
\n+\n
179
\n-
180
\n-
\n-
190 Coordinate position(int i, int c) const
\n-
191 {
\n-
192 return _impl->position(i,c);
\n-
193 }
\n+\n+\n+\n+
183 };
\n+
\n+
184
\n+
185 template<int dimension, class CoordType>
\n+
\n+\n+
187 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
188 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
189 backend(BackendRefinement::vBegin(nIntervals_)),
\n+
190 backendEnd(BackendRefinement::vEnd(nIntervals_))
\n+
191 {
\n+
192 if (end)
\n+
193 kuhnIndex = nKuhnSimplices;
\n+
194 }
\n
\n-
194
\n
195
\n-
\n-
203 bool checkInside(const Coordinate& local) const
\n-
204 {
\n-
205 return _impl->checkInside(local);
\n-
206 }
\n+
196 template<int dimension, class CoordType>
\n+
197 void
\n+
\n+\n+\n+
200 {
\n+
201 ++backend;
\n+
202 if (backend == backendEnd)
\n+
203 {
\n+
204 backend = BackendRefinement::vBegin(nIntervals_);
\n+
205 ++kuhnIndex;
\n+
206 }
\n+
207 }
\n
\n-
207
\n
208
\n-
220 template<int codim>
\n+
209 template<int dimension, class CoordType>
\n+\n+
\n+\n+
212 coords() const
\n+
213 {
\n+
214 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are 0,2,3
\n+
215 return transformCoordinate(referenceToKuhn(backend.coords(),
\n+
216 getPermutation<dimension>((kuhnIndex + 2) % 4)));
\n+
217 }
\n+
\n+
218
\n+
219 template<int dimension, class CoordType>
\n+\n
\n-
221 typename Codim<codim>::Geometry geometry(int i) const
\n+\n
222 {
\n-
223 return _impl->template geometry<codim>(i);
\n-
224 }
\n-
\n-
225
\n-
226
\n-
\n-\n-
229 {
\n-
230 return _impl->volume();
\n-
231 }
\n-
\n-
232
\n-
233
\n-
\n-\n-
242 {
\n-
243 return _impl->integrationOuterNormal(face);
\n-
244 }
\n-
\n-
245
\n+
223 std::vector<CoordVector> corners(1);
\n+
224 corners[0] = transformCoordinate(referenceToKuhn(backend.coords(),
\n+
225 getPermutation<dimension>((kuhnIndex + 2) % 4)));
\n+
226 return Geometry(GeometryTypes::vertex, corners);
\n+
227 }
\n+
\n+
228
\n+
229 template<int dimension, class CoordType>
\n+
230 int
\n+
\n+\n+
232 index() const
\n+
233 {
\n+
234 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
\n+
235 }
\n+
\n+
236
\n+
237 // elements
\n+
238 template<int dimension, class CoordType>
\n+
\n+
239 class RefinementIteratorSpecial<dimension, CoordType, 0>
\n+
240 {
\n+
241 public:
\n+\n+\n+\n+
245 typedef typename Refinement::template Codim<0>::Geometry Geometry;
\n
246
\n-
\n-\n-
255 : _impl(nullptr)
\n-
256 {}
\n-
\n-
257
\n-
\n-
263 const Implementation& impl() const
\n-
264 {
\n-
265 return *_impl;
\n-
266 }
\n-
\n-
267
\n-
\n-
269 bool operator==(const ReferenceElement& r) const
\n-
270 {
\n-
271 return _impl == r._impl;
\n-
272 }
\n-
\n-
273
\n-
\n-
275 bool operator!=(const ReferenceElement& r) const
\n-
276 {
\n-
277 return not (*this == r);
\n-
278 }
\n-
\n-
279
\n-
\n-
281 friend std::size_t hash_value(const ReferenceElement& r)
\n-
282 {
\n-
283 return reinterpret_cast<std::size_t>(r._impl);
\n-
284 }
\n-
\n-
285
\n-
286 private:
\n-
287
\n-
288 // The implementation must be a friend to construct a wrapper around itself.
\n-
289 friend Implementation;
\n-
290
\n-
291 // The reference container is a friend to be able to call setImplementation.
\n-
292 friend class Impl::ReferenceElementContainer<ctype,dimension>;
\n-
293
\n-
294 // Constructor for wrapping an implementation reference (required internally by the default implementation)
\n-
295 ReferenceElement(const Implementation& impl)
\n-
296 : _impl(&impl)
\n-
297 {}
\n-
298
\n-
299 void setImplementation(const Implementation& impl)
\n-
300 {
\n-
301 _impl = &impl;
\n-
302 }
\n-
303
\n-
304 const Implementation* _impl;
\n+
247 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
248
\n+
249 void increment();
\n+
250
\n+
251 IndexVector vertexIndices() const;
\n+
252 int index() const;
\n+
253 CoordVector coords() const;
\n+
254
\n+
255 Geometry geometry () const;
\n+
256
\n+
257 private:
\n+
258 CoordVector global(const CoordVector &local) const;
\n+
259
\n+
260 protected:
\n+\n+
262 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
\n+
263 constexpr static int nKuhnSimplices = 3;
\n+
264
\n+\n+
266
\n+\n+\n+\n+
270 };
\n+
\n+
271
\n+
272 template<int dimension, class CoordType>
\n+
\n+\n+
274 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
275 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
276 backend(BackendRefinement::eBegin(nIntervals_)),
\n+
277 backendEnd(BackendRefinement::eEnd(nIntervals_))
\n+
278 {
\n+
279 if (end)
\n+
280 kuhnIndex = nKuhnSimplices;
\n+
281 }
\n+
\n+
282
\n+
283 template<int dimension, class CoordType>
\n+
284 void
\n+
\n+\n+\n+
287 {
\n+
288 ++backend;
\n+
289 if (backend == backendEnd)
\n+
290 {
\n+
291 backend = BackendRefinement::eBegin(nIntervals_);
\n+
292 ++kuhnIndex;
\n+
293 }
\n+
294 }
\n+
\n+
295
\n+
296 template<int dimension, class CoordType>
\n+\n+
\n+\n+
299 vertexIndices() const
\n+
300 {
\n+
301 IndexVector indices = backend.vertexIndices();
\n+
302
\n+
303 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
\n+
304 indices += base;
\n
305
\n-
306 };
\n+
306 return indices;
\n+
307 }
\n
\n-
307
\n-
308 }
\n-
309
\n-
310}
\n-
311
\n-
312
\n-
313#endif // DUNE_GEOMETRY_REFERENCEELEMENT_HH
\n-
A unique label for each type of element that can occur in a grid.
\n+
308
\n+
309 template<int dimension, class CoordType>
\n+
310 int
\n+
\n+\n+
312 index() const
\n+
313 {
\n+
314 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
\n+
315 }
\n+
\n+
316
\n+
317 template<int dimension, class CoordType>
\n+\n+
\n+\n+
320 coords() const
\n+
321 {
\n+
322 return global(backend.coords());
\n+
323 }
\n+
\n+
324
\n+
325 template<int dimension, class CoordType>
\n+\n+
\n+\n+
328 {
\n+
329 const typename BackendIterator::Geometry &bgeo =
\n+
330 backend.geometry();
\n+
331 std::vector<CoordVector> corners(dimension+1);
\n+
332 for(int i = 0; i <= dimension; ++i)
\n+
333 corners[i] = global(bgeo.corner(i));
\n+
334
\n+
335 return Geometry(bgeo.type(), corners);
\n+
336 }
\n+
\n+
337
\n+
338 template<int dimension, class CoordType>
\n+\n+\n+
341 global(const CoordVector &local) const
\n+
342 {
\n+
343 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are 0,2,3
\n+
344 return transformCoordinate(referenceToKuhn(local, getPermutation<dimension>((kuhnIndex+2)%4)));
\n+
345 }
\n+
346
\n+
347 // common
\n+
348 template<int dimension, class CoordType>
\n+
349 template<int codimension>
\n+
\n+
350 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
\n+
351 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
\n+
352 public RefinementIteratorSpecial<dimension, CoordType, codimension>
\n+
353 {
\n+
354 public:
\n+\n+
356 typedef SubEntityIterator This;
\n+
357
\n+
358 SubEntityIterator(int nIntervals, bool end = false);
\n+
359
\n+
360 bool equals(const This &other) const;
\n+
361 protected:
\n+
362 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
\n+
363 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
\n+
364 };
\n+
\n+
365
\n+
366#ifndef DOXYGEN
\n+
367 template<int dimension, class CoordType>
\n+
368 template<int codimension>
\n+\n+
370 SubEntityIterator(int nIntervals, bool end)
\n+
371 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
\n+
372 {}
\n+
373
\n+
374 template<int dimension, class CoordType>
\n+
375 template<int codimension>
\n+
376 bool
\n+\n+
378 equals(const This &other) const
\n+
379 {
\n+
380 return ((kuhnIndex == other.kuhnIndex) && (backend == other.backend));
\n+
381 }
\n+
382#endif
\n+
383
\n+
384 } // namespace PrismTriangulation
\n+
\n+
385 } // namespace RefinementImp
\n+
386
\n+
387 namespace RefinementImp
\n+
388 {
\n+
389 // ///////////////////////
\n+
390 //
\n+
391 // The refinement traits
\n+
392 //
\n+
393
\n+
394#ifndef DOXYGEN
\n+
395 template<unsigned topologyId, class CoordType, unsigned coerceToId>
\n+
396 struct Traits<
\n+
397 topologyId, CoordType, coerceToId, 3,
\n+
398 typename std::enable_if<
\n+
399 (GeometryTypes::prism.id() >> 1) ==
\n+
400 (topologyId >> 1) &&
\n+
401 (GeometryTypes::simplex(3).id() >> 1) ==
\n+
402 (coerceToId >> 1)
\n+
403 >::type>
\n+
404 {
\n+
405 typedef PrismTriangulation::RefinementImp<3, CoordType> Imp;
\n+
406 };
\n+
407#endif
\n+
408
\n+
409 } // namespace RefinementImp
\n+
410} // namespace Dune
\n+
411
\n+
412#endif // DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
\n+
This file contains the parts independent of a particular Refinement implementation.
\n+
This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
\n+\n+
A unique label for each type of element that can occur in a grid.
\n+
STL namespace.
\n
Definition affinegeometry.hh:21
\n-
This class provides access to geometric and topological properties of a reference element.
Definition referenceelement.hh:52
\n-
CoordinateField volume() const
obtain the volume of the reference element
Definition referenceelement.hh:228
\n-
GeometryType type(int i, int c) const
obtain the type of subentity (i,c)
Definition referenceelement.hh:167
\n-
ReferenceElement()
Constructs an empty reference element.
Definition referenceelement.hh:254
\n-
bool operator!=(const ReferenceElement &r) const
Compares for inequality with another reference element.
Definition referenceelement.hh:275
\n-
Coordinate position(int i, int c) const
position of the barycenter of entity (i,c)
Definition referenceelement.hh:190
\n-
typename Implementation::Coordinate Coordinate
The coordinate type.
Definition referenceelement.hh:81
\n-
Codim< codim >::Geometry geometry(int i) const
obtain the embedding of subentity (i,codim) into the reference element
Definition referenceelement.hh:221
\n-
static constexpr int dimension
The dimension of the reference element.
Definition referenceelement.hh:87
\n-
int size(int i, int c, int cc) const
number of subentities of codimension cc of subentity (i,c)
Definition referenceelement.hh:111
\n-
int subEntity(int i, int c, int ii, int cc) const
obtain number of ii-th subentity with codim cc of (i,c)
Definition referenceelement.hh:130
\n-
typename Implementation::ctype ctype
The coordinate field type.
Definition referenceelement.hh:75
\n-
int size(int c) const
number of subentities of codimension c
Definition referenceelement.hh:94
\n-
GeometryType type() const
obtain the type of this reference element
Definition referenceelement.hh:175
\n-
const Implementation & impl() const
Returns a reference to the internal implementation object.
Definition referenceelement.hh:263
\n-
bool checkInside(const Coordinate &local) const
check if a coordinate is in the reference element
Definition referenceelement.hh:203
\n-
Coordinate integrationOuterNormal(int face) const
obtain the integration outer normal of the reference element
Definition referenceelement.hh:241
\n-
ctype CoordinateField
The coordinate field type.
Definition referenceelement.hh:78
\n-
bool operator==(const ReferenceElement &r) const
Compares for equality with another reference element.
Definition referenceelement.hh:269
\n-
friend std::size_t hash_value(const ReferenceElement &r)
Yields a hash value suitable for storing the reference element a in hash table.
Definition referenceelement.hh:281
\n-
auto subEntities(int i, int c, int cc) const
Obtain the range of numbers of subentities with codim cc of (i,c)
Definition referenceelement.hh:153
\n-
ctype Volume
Type used for volume.
Definition referenceelement.hh:84
\n-
Collection of types depending on the codimension.
Definition referenceelement.hh:67
\n-
implementation-defined Geometry
type of geometry embedding a subentity into the reference element
Definition referenceelement.hh:69
\n-
Unique label for each type of entities that can occur in DUNE grids.
Definition type.hh:114
\n+
FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType, dimension > point)
Definition prismtriangulation.cc:50
\n+
FieldVector< int, n > getPermutation(int m)
Calculate permutation from it's index.
Definition simplex.cc:293
\n+
FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
Map from the reference simplex to some Kuhn simplex.
Definition simplex.cc:322
\n+
Static tag representing a codimension.
Definition dimension.hh:24
\n+
generic geometry implementation based on corner coordinates
Definition multilineargeometry.hh:181
\n+\n+
Implementation of the refinement of a prism into simplices.
Definition prismtriangulation.cc:67
\n+
static constexpr int dimension
Definition prismtriangulation.cc:69
\n+
CoordType ctype
Definition prismtriangulation.cc:71
\n+
static VertexIterator vEnd(int nIntervals)
Definition prismtriangulation.cc:122
\n+
FieldVector< int, dimension+1 > IndexVector
Definition prismtriangulation.cc:78
\n+
static ElementIterator eEnd(int nIntervals)
Definition prismtriangulation.cc:146
\n+
static int nVertices(int nIntervals)
Definition prismtriangulation.cc:106
\n+
FieldVector< CoordType, dimension > CoordVector
Definition prismtriangulation.cc:76
\n+
static int nElements(int nIntervals)
Definition prismtriangulation.cc:130
\n+
Codim< 0 >::SubEntityIterator ElementIterator
Definition prismtriangulation.cc:77
\n+
Codim< dimension >::SubEntityIterator VertexIterator
Definition prismtriangulation.cc:75
\n+
static ElementIterator eBegin(int nIntervals)
Definition prismtriangulation.cc:138
\n+
static VertexIterator vBegin(int nIntervals)
Definition prismtriangulation.cc:114
\n+\n+
Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
Definition prismtriangulation.cc:100
\n+\n+
Refinement::template Codim< dimension >::Geometry Geometry
Definition prismtriangulation.cc:163
\n+
Refinement::BackendRefinement BackendRefinement
Definition prismtriangulation.cc:174
\n+
BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
Definition prismtriangulation.cc:175
\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition prismtriangulation.cc:161
\n+\n+\n+\n+
Refinement::template Codim< 0 >::Geometry Geometry
Definition prismtriangulation.cc:245
\n+\n+
Refinement::IndexVector IndexVector
Definition prismtriangulation.cc:243
\n+
BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
Definition prismtriangulation.cc:262
\n+\n+
Refinement::CoordVector CoordVector
Definition prismtriangulation.cc:244
\n+
RefinementImp< dimension, CoordType > Refinement
Definition prismtriangulation.cc:242
\n+\n+
Refinement::BackendRefinement BackendRefinement
Definition prismtriangulation.cc:261
\n+
SubEntityIterator This
Definition prismtriangulation.cc:356
\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition prismtriangulation.cc:355
\n+\n+\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,297 +1,605 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-referenceelement.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+prismtriangulation.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFERENCEELEMENT_HH\n-6#define DUNE_GEOMETRY_REFERENCEELEMENT_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n+_\b6#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n 7\n-8#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-9\n-10namespace _\bD_\bu_\bn_\be {\n-11 namespace Geo {\n-12\n-13 namespace Impl {\n-14\n-15 // forward declaration for friend declaration\n-16 template\n-17 class ReferenceElementContainer;\n-18\n-19 }\n-20\n-21 // forward declaration for constructing default reference element type\n-22 template\n-23 class ReferenceElementImplementation;\n-24\n-25 // forward declaration for backwards compatibility conversion\n-26 template\n-27 struct ReferenceElements;\n-28\n-29 // ReferenceElement\n-30 // ----------------\n-31\n-50 template\n-_\b5_\b1 class _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-52 {\n-53\n-54 public:\n-55\n-56#ifndef DOXYGEN\n-57\n-59 template\n-60 using _\bC_\bo_\bd_\bi_\bm = typename Implementation::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\b>;\n-61\n-62#else\n-63\n-65 template< int codim >\n-_\b6_\b6 struct _\bC_\bo_\bd_\bi_\bm\n+8#include \n+9#include \n+10\n+11#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+12#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+13\n+14#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+15#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+16\n+17namespace _\bD_\bu_\bn_\be\n+18{\n+19 namespace RefinementImp\n+20 {\n+_\b2_\b6 namespace PrismTriangulation\n+27 {\n+28 // ////////////\n+29 //\n+30 // Utilities\n+31 //\n+32\n+33 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n+34 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n+35\n+36 // ////////////////////////////////////\n+37 //\n+38 // Refine a prism with simplices\n+39 //\n+40\n+41 // forward declaration of the iterator base\n+42 template\n+_\b4_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+44 /*\n+45 * The permutations 0,2 and 3 of the Kuhn-decomposition of a cube into\n+simplices form a prism.\n+46 * The resulting prism is not oriented the same as the reference prism and so\n+the Kuhn-coordinates\n+47 * have to be transformed using the method below.\n+48 */\n+49 template FieldVector\n+_\b5_\b0 _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(FieldVector point)\n+51 {\n+52 FieldVector transform;\n+53 transform[0] = point[1];\n+54 transform[1] = 1 - point[0];\n+55 transform[2] = point[2];\n+56 return transform;\n+57 }\n+58\n+65 template\n+_\b6_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n 67 {\n-_\b6_\b9 using _\bG_\be_\bo_\bm_\be_\bt_\br_\by = implementation-defined;\n-70 };\n-71\n-72#endif // DOXYGEN\n-73\n-_\b7_\b5 using _\bc_\bt_\by_\bp_\be = typename Implementation::ctype;\n-76\n-_\b7_\b8 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd = _\bc_\bt_\by_\bp_\be;\n+68 public:\n+_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+70\n+_\b7_\b1 typedef CoordType _\bc_\bt_\by_\bp_\be;\n+72\n+73 template\n+74 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b7_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b6 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b7_\b7 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b8 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n 79\n-_\b8_\b1 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = typename Implementation::Coordinate;\n-82\n-_\b8_\b4 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n-85\n-_\b8_\b7 static constexpr int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Implementation::dimension;\n-88\n-89\n-_\b9_\b4 int _\bs_\bi_\bz_\be(int c) const\n-95 {\n-96 return _impl->size(c);\n-97 }\n-98\n-99\n-_\b1_\b1_\b1 int _\bs_\bi_\bz_\be(int i, int c, int cc) const\n-112 {\n-113 return _impl->size(i,c,cc);\n-114 }\n-115\n-116\n-_\b1_\b3_\b0 int _\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by(int i, int c, int ii, int cc) const\n+80 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n+81 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n+83\n+84 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n+85 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+_\b8_\b6 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n+87\n+88 private:\n+89 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n+90 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n+91\n+92 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+93 };\n+94\n+95 template\n+96 template\n+_\b9_\b7 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n+98 {\n+99 class SubEntityIterator;\n+_\b1_\b0_\b0 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+101 };\n+102\n+103 template\n+104 int\n+_\b1_\b0_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+106_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n+107 {\n+108 return BackendRefinement::nVertices(nIntervals) * 3;\n+109 }\n+110\n+111 template\n+112 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b1_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+114_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+115 {\n+116 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+117 }\n+118\n+119 template\n+120 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+122_\b _\bv_\bE_\bn_\bd(int nIntervals)\n+123 {\n+124 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+125 }\n+126\n+127 template\n+128 int\n+_\b1_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+130_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n 131 {\n-132 return _impl->subEntity(i,c,ii,cc);\n+132 return BackendRefinement::nElements(nIntervals) * 3;\n 133 }\n 134\n-_\b1_\b5_\b3 auto _\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\bi_\be_\bs ( int i, int c, int cc ) const\n-154 {\n-155 return _impl->subEntities(i,c,cc);\n-156 }\n-157\n-158\n-_\b1_\b6_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be(int i, int c) const\n-168 {\n-169 return _impl->type(i,c);\n-170 }\n+135 template\n+136 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b3_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+138_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+139 {\n+140 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+141 }\n+142\n+143 template\n+144 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b4_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+146_\b _\be_\bE_\bn_\bd(int nIntervals)\n+147 {\n+148 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+149 }\n+150\n+151 // //////////////\n+152 //\n+153 // The iterator\n+154 //\n+155\n+156 // vertices\n+157 template\n+_\b1_\b5_\b8 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+159 {\n+160 public:\n+_\b1_\b6_\b1 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b6_\b2 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b1_\b6_\b3 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+164\n+165 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+166\n+167 void increment();\n+168\n+169 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+170 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n 171\n-172\n-_\b1_\b7_\b5 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be() const\n-176 {\n-177 return _impl->type();\n-178 }\n+172 int index() const;\n+173 protected:\n+_\b1_\b7_\b4 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b7_\b5 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b1_\b7_\b6 constexpr static int nKuhnSimplices = 3;\n+177\n+_\b1_\b7_\b8 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n 179\n-180\n-_\b1_\b9_\b0 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn(int i, int c) const\n+_\b1_\b8_\b0 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b1_\b8_\b1 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b1_\b8_\b2 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+183 };\n+184\n+185 template\n+_\b1_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+187_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+188 : nIntervals_(nIntervals), kuhnIndex(0),\n+189 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n+190 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n 191 {\n-192 return _impl->position(i,c);\n-193 }\n-194\n+192 if (end)\n+193 kuhnIndex = nKuhnSimplices;\n+194 }\n 195\n-_\b2_\b0_\b3 bool _\bc_\bh_\be_\bc_\bk_\bI_\bn_\bs_\bi_\bd_\be(const _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& local) const\n-204 {\n-205 return _impl->checkInside(local);\n+196 template\n+197 void\n+_\b1_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+199_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+200 {\n+201 ++backend;\n+202 if (backend == backendEnd)\n+203 {\n+204 backend = BackendRefinement::vBegin(nIntervals_);\n+205 ++kuhnIndex;\n 206 }\n-207\n+207 }\n 208\n-220 template\n-_\b2_\b2_\b1 typename _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bg_\be_\bo_\bm_\be_\bt_\br_\by(int i) const\n+209 template\n+210 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b2_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+212_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+213 {\n+214 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are\n+0,2,3\n+215 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n+216 getPermutation((kuhnIndex + 2) % 4)));\n+217 }\n+218\n+219 template\n+220 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b2_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n+const\n 222 {\n-223 return _impl->template geometry(i);\n-224 }\n-225\n-226\n-_\b2_\b2_\b8 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd _\bv_\bo_\bl_\bu_\bm_\be() const\n-229 {\n-230 return _impl->volume();\n-231 }\n-232\n-233\n-_\b2_\b4_\b1 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(int face) const\n-242 {\n-243 return _impl->integrationOuterNormal(face);\n-244 }\n-245\n+223 std::vector corners(1);\n+224 corners[0] = _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n+225 getPermutation((kuhnIndex + 2) % 4)));\n+226 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n+227 }\n+228\n+229 template\n+230 int\n+_\b2_\b3_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+232_\b _\bi_\bn_\bd_\be_\bx() const\n+233 {\n+234 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n+();\n+235 }\n+236\n+237 // elements\n+238 template\n+_\b2_\b3_\b9 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+240 {\n+241 public:\n+_\b2_\b4_\b2 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b4_\b3 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b4 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n 246\n-_\b2_\b5_\b4 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt()\n-255 : _impl(nullptr)\n-256 {}\n-257\n-_\b2_\b6_\b3 const Implementation& _\bi_\bm_\bp_\bl() const\n-264 {\n-265 return *_impl;\n-266 }\n-267\n-_\b2_\b6_\b9 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r) const\n-270 {\n-271 return _impl == r._impl;\n-272 }\n-273\n-_\b2_\b7_\b5 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r) const\n-276 {\n-277 return not (*this == r);\n-278 }\n-279\n-_\b2_\b8_\b1 friend std::size_t _\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r)\n-282 {\n-283 return reinterpret_cast(r._impl);\n-284 }\n-285\n-286 private:\n-287\n-288 // The implementation must be a friend to construct a wrapper around\n-itself.\n-289 friend Implementation;\n-290\n-291 // The reference container is a friend to be able to call\n-setImplementation.\n-292 friend class Impl::ReferenceElementContainer<_\bc_\bt_\by_\bp_\be,_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n-293\n-294 // Constructor for wrapping an implementation reference (required\n-internally by the default implementation)\n-295 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const Implementation& _\bi_\bm_\bp_\bl)\n-296 : _impl(&_\bi_\bm_\bp_\bl)\n-297 {}\n-298\n-299 void setImplementation(const Implementation& _\bi_\bm_\bp_\bl)\n+247 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+248\n+249 void increment();\n+250\n+251 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+252 int index() const;\n+253 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+254\n+255 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n+256\n+257 private:\n+258 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n+259\n+260 protected:\n+_\b2_\b6_\b1 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b6_\b2 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b2_\b6_\b3 constexpr static int nKuhnSimplices = 3;\n+264\n+_\b2_\b6_\b5 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n+266\n+_\b2_\b6_\b7 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b2_\b6_\b8 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b2_\b6_\b9 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+270 };\n+271\n+272 template\n+_\b2_\b7_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+274_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+275 : nIntervals_(nIntervals), kuhnIndex(0),\n+276 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n+277 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n+278 {\n+279 if (end)\n+280 kuhnIndex = nKuhnSimplices;\n+281 }\n+282\n+283 template\n+284 void\n+_\b2_\b8_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+286_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+287 {\n+288 ++backend;\n+289 if (backend == backendEnd)\n+290 {\n+291 backend = BackendRefinement::eBegin(nIntervals_);\n+292 ++kuhnIndex;\n+293 }\n+294 }\n+295\n+296 template\n+297 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b2_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+299_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n 300 {\n-301 _impl = &_\bi_\bm_\bp_\bl;\n-302 }\n-303\n-304 const Implementation* _impl;\n+301 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n+302\n+303 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n+304 indices += base;\n 305\n-306 };\n-307\n-308 }\n-309\n-310}\n-311\n-312\n-313#endif // DUNE_GEOMETRY_REFERENCEELEMENT_HH\n+306 return indices;\n+307 }\n+308\n+309 template\n+310 int\n+_\b3_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+312_\b _\bi_\bn_\bd_\be_\bx() const\n+313 {\n+314 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n+();\n+315 }\n+316\n+317 template\n+318 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b1_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+320_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+321 {\n+322 return global(backend.coords());\n+323 }\n+324\n+325 template\n+326 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b3_\b2_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n+328 {\n+329 const typename BackendIterator::Geometry &bgeo =\n+330 backend.geometry();\n+331 std::vector corners(dimension+1);\n+332 for(int i = 0; i <= dimension; ++i)\n+333 corners[i] = global(bgeo.corner(i));\n+334\n+335 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n+336 }\n+337\n+338 template\n+339 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+340 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+341_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n+342 {\n+343 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are\n+0,2,3\n+344 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(local, getPermutation\n+((kuhnIndex+2)%4)));\n+345 }\n+346\n+347 // common\n+348 template\n+349 template\n+_\b3_\b5_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+351 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+352 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+353 {\n+354 public:\n+_\b3_\b5_\b5 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b3_\b5_\b6 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n+357\n+_\b3_\b5_\b8 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n+359\n+_\b3_\b6_\b0 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n+361 protected:\n+362 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+kuhnIndex;\n+363 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+backend;\n+364 };\n+365\n+366#ifndef DOXYGEN\n+367 template\n+368 template\n+369 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+370_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n+371 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n+end)\n+372 {}\n+373\n+374 template\n+375 template\n+376 bool\n+377 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+378_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n+379 {\n+380 return ((kuhnIndex == other.kuhnIndex) && (backend == other.backend));\n+381 }\n+382#endif\n+383\n+384 } // namespace PrismTriangulation\n+385 } // namespace RefinementImp\n+386\n+387 namespace RefinementImp\n+388 {\n+389 // ///////////////////////\n+390 //\n+391 // The refinement traits\n+392 //\n+393\n+394#ifndef DOXYGEN\n+395 template\n+396 struct Traits<\n+397 topologyId, CoordType, coerceToId, 3,\n+398 typename _\bs_\bt_\bd::enable_if<\n+399 (GeometryTypes::prism.id() >> 1) ==\n+400 (topologyId >> 1) &&\n+401 (GeometryTypes::simplex(3).id() >> 1) ==\n+402 (coerceToId >> 1)\n+403 >::type>\n+404 {\n+405 typedef PrismTriangulation::RefinementImp<3, CoordType> Imp;\n+406 };\n+407#endif\n+408\n+409 } // namespace RefinementImp\n+410} // namespace Dune\n+411\n+412#endif // DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n+_\bb_\ba_\bs_\be_\b._\bc_\bc\n+This file contains the parts independent of a particular Refinement\n+implementation.\n+_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n+This file contains the Refinement implementation for simplices (triangles,\n+tetrahedrons....\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-This class provides access to geometric and topological properties of a\n-reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-CoordinateField volume() const\n-obtain the volume of the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:228\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bt_\by_\bp_\be\n-GeometryType type(int i, int c) const\n-obtain the type of subentity (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:167\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ReferenceElement()\n-Constructs an empty reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:254\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n-bool operator!=(const ReferenceElement &r) const\n-Compares for inequality with another reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n-Coordinate position(int i, int c) const\n-position of the barycenter of entity (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:190\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-typename Implementation::Coordinate Coordinate\n-The coordinate type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:81\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-Codim< codim >::Geometry geometry(int i) const\n-obtain the embedding of subentity (i,codim) into the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:221\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType,\n+dimension > point)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n+FieldVector< int, n > getPermutation(int m)\n+Calculate permutation from it's index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n+FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n+dimension > point, const FieldVector< int, dimension > &kuhn)\n+Map from the reference simplex to some Kuhn simplex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Static tag representing a codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+generic geometry implementation based on corner coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:43\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+Implementation of the refinement of a prism into simplices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n static constexpr int dimension\n-The dimension of the reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:87\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bi_\bz_\be\n-int size(int i, int c, int cc) const\n-number of subentities of codimension cc of subentity (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:111\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by\n-int subEntity(int i, int c, int ii, int cc) const\n-obtain number of ii-th subentity with codim cc of (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:130\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bc_\bt_\by_\bp_\be\n-typename Implementation::ctype ctype\n-The coordinate field type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bi_\bz_\be\n-int size(int c) const\n-number of subentities of codimension c\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bt_\by_\bp_\be\n-GeometryType type() const\n-obtain the type of this reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bi_\bm_\bp_\bl\n-const Implementation & impl() const\n-Returns a reference to the internal implementation object.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bc_\bh_\be_\bc_\bk_\bI_\bn_\bs_\bi_\bd_\be\n-bool checkInside(const Coordinate &local) const\n-check if a coordinate is in the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:203\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n-Coordinate integrationOuterNormal(int face) const\n-obtain the integration outer normal of the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:241\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd\n-ctype CoordinateField\n-The coordinate field type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-bool operator==(const ReferenceElement &r) const\n-Compares for equality with another reference element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be\n-friend std::size_t hash_value(const ReferenceElement &r)\n-Yields a hash value suitable for storing the reference element a in hash table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\bi_\be_\bs\n-auto subEntities(int i, int c, int cc) const\n-Obtain the range of numbers of subentities with codim cc of (i,c)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:153\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-ctype Volume\n-Type used for volume.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:84\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Collection of types depending on the codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-implementation-defined Geometry\n-type of geometry embedding a subentity into the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-Unique label for each type of entities that can occur in DUNE grids.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:69\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n+CoordType ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:122\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< int, dimension+1 > IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:106\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:76\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:130\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:75\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:138\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:98\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n+Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:100\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:178\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< dimension >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:163\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:174\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< dimension >::SubEntityIterator\n+BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:175\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:162\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:182\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:161\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:180\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:265\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< 0 >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:245\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:268\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:243\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:262\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:244\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:242\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:261\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bT_\bh_\bi_\bs\n+SubEntityIterator This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:356\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const This &other) const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:355\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(int nIntervals, bool end=false)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00182.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00182.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: refinement.hh File Reference\n+dune-geometry: hcubetriangulation.cc File Reference\n \n \n \n \n \n \n \n@@ -65,34 +65,82 @@\n
\n
\n \n \n \n \n \n
\n-
refinement.hh File Reference
\n+ \n+
hcubetriangulation.cc File Reference
\n
\n
\n \n-

This file simply includes all Refinement implementations so you don't have to do them separately. \n+

This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron) \n More...

\n-
#include "refinement/base.cc"
\n-#include "refinement/hcube.cc"
\n-#include "refinement/simplex.cc"
\n-#include "refinement/hcubetriangulation.cc"
\n-#include "refinement/prismtriangulation.cc"
\n-#include "refinement/pyramidtriangulation.cc"
\n+
#include <dune/geometry/referenceelements.hh>
\n+#include <dune/geometry/type.hh>
\n+#include "base.cc"
\n+#include "simplex.cc"
\n
\n

Go to the source code of this file.

\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

\n+Classes

class  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >
 
struct  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
class  Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
 
class  Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
 
class  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

\n+Namespaces

namespace  Dune
 
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
namespace  Dune::RefinementImp::HCubeTriangulation
 This namespace contains the Refinement implementation for triangulating hypercubes (GeometryType::cube -> GeometryType::simplex)
 
\n+\n+\n+\n+

\n+Macros

#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
 
\n

Detailed Description

\n-

This file simply includes all Refinement implementations so you don't have to do them separately.

\n-
\n+

This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron)

\n+

See Refinement implementation for triangulating hypercubes.

\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
\n+
\n+\n+
\n+
\n+
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,21 +1,55 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-refinement.hh File Reference\n-This file simply includes all _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementations so you don't have to\n-do them separately. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n+hcubetriangulation.cc File Reference\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for triangulating hypercubes\n+(quadrilateral -> triangle, hexahedron -> tetrahedron) _\bM_\bo_\br_\be_\b._\b._\b.\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bD_\bu_\bn_\be\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n+ This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n+\u00a0 triangulating hypercubes (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:\n+ _\bs_\bi_\bm_\bp_\bl_\be_\bx)\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bH_\bC_\bU_\bB_\bE_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n+\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file simply includes all _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementations so you don't have to\n-do them separately.\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for triangulating hypercubes\n+(quadrilateral -> triangle, hexahedron -> tetrahedron)\n+See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bn_\bg_\b _\bh_\by_\bp_\be_\br_\bc_\bu_\bb_\be_\bs.\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_H\bHC\bCU\bUB\bBE\bET\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00182_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00182_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: refinement.hh Source File\n+dune-geometry: hcubetriangulation.cc Source File\n \n \n \n \n \n \n \n@@ -70,46 +70,509 @@\n \n \n \n \n \n \n \n
\n-
refinement.hh
\n+
hcubetriangulation.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_REFINEMENT_HH
\n-
6#define DUNE_GEOMETRY_REFINEMENT_HH
\n+
5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
\n+
6#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
\n
7
\n-
239// The interface (template<...> class StaticRefinement) is not included here
\n-
240// since it derives from parts which I consider implementation. Look
\n-
241// into refinement/base.cc if the documentation is above is not enough.
\n-
242#include "refinement/base.cc"
\n+\n+
30#include <dune/geometry/type.hh>
\n+
31
\n+
32#include "base.cc"
\n+
33#include "simplex.cc"
\n+
34
\n+
35namespace Dune
\n+
36{
\n+
37 namespace RefinementImp
\n+
38 {
\n+
\n+
46 namespace HCubeTriangulation {
\n+
47
\n+
48 // ////////////
\n+
49 //
\n+
50 // Utilities
\n+
51 //
\n+
52
\n+\n+\n+
55
\n+
56 // ////////////////////////////////////
\n+
57 //
\n+
58 // Refine a hypercube with simplices
\n+
59 //
\n+
60
\n+
61 // forward declaration of the iterator base
\n+
62 template<int dimension, class CoordType, int codimension>
\n+\n+
64
\n+
65 template<int dimension_, class CoordType>
\n+
\n+\n+
67 {
\n+
68 public:
\n+
69 constexpr static int dimension = dimension_;
\n+
70
\n+
71 typedef CoordType ctype;
\n+
72
\n+
73 template<int codimension>
\n+
74 struct Codim;
\n+\n+
76 typedef FieldVector<CoordType, dimension> CoordVector;
\n+\n+
78 typedef FieldVector<int, dimension+1> IndexVector;
\n+
79
\n+
80 static int nVertices(int nIntervals);
\n+
81 static VertexIterator vBegin(int nIntervals);
\n+
82 static VertexIterator vEnd(int nIntervals);
\n+
83
\n+
84 static int nElements(int nIntervals);
\n+
85 static ElementIterator eBegin(int nIntervals);
\n+
86 static ElementIterator eEnd(int nIntervals);
\n+
87 private:
\n+
88 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
\n+
89 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
\n+
90
\n+\n+
92 };
\n+
\n+
93
\n+
94 template<int dimension, class CoordType>
\n+
95 template<int codimension>
\n+
\n+
96 struct RefinementImp<dimension, CoordType>::Codim
\n+
97 {
\n+
98 class SubEntityIterator;
\n+
99 typedef Dune::MultiLinearGeometry<CoordType,dimension-codimension,dimension> Geometry;
\n+
100 };
\n+
\n+
101
\n+
102 template<int dimension, class CoordType>
\n+
103 int
\n+
\n+\n+
105 nVertices(int nIntervals)
\n+
106 {
\n+
107 return BackendRefinement::nVertices(nIntervals) * factorial(int(dimension));
\n+
108 }
\n+
\n+
109
\n+
110 template<int dimension, class CoordType>
\n+\n+
\n+\n+
113 vBegin(int nIntervals)
\n+
114 {
\n+
115 return VertexIterator(nIntervals);
\n+
116 }
\n+
\n+
117
\n+
118 template<int dimension, class CoordType>
\n+\n+
\n+\n+
121 vEnd(int nIntervals)
\n+
122 {
\n+
123 return VertexIterator(nIntervals, true);
\n+
124 }
\n+
\n+
125
\n+
126 template<int dimension, class CoordType>
\n+
127 int
\n+
\n+\n+
129 nElements(int nIntervals)
\n+
130 {
\n+
131 return BackendRefinement::nElements(nIntervals) * factorial(int(dimension));
\n+
132 }
\n+
\n+
133
\n+
134 template<int dimension, class CoordType>
\n+\n+
\n+\n+
137 eBegin(int nIntervals)
\n+
138 {
\n+
139 return ElementIterator(nIntervals);
\n+
140 }
\n+
\n+
141
\n+
142 template<int dimension, class CoordType>
\n+\n+
\n+\n+
145 eEnd(int nIntervals)
\n+
146 {
\n+
147 return ElementIterator(nIntervals, true);
\n+
148 }
\n+
\n+
149
\n+
150 // //////////////
\n+
151 //
\n+
152 // The iterator
\n+
153 //
\n+
154
\n+
155 // vertices
\n+
156 template<int dimension, class CoordType>
\n+
\n+
157 class RefinementIteratorSpecial<dimension, CoordType, dimension>
\n+
158 {
\n+
159 public:
\n+\n+
161 typedef typename Refinement::CoordVector CoordVector;
\n+
162 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
\n+
163
\n+
164 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
165
\n+
166 void increment();
\n+
167
\n+
168 CoordVector coords() const;
\n+
169
\n+
170 Geometry geometry() const;
\n+
171
\n+
172 int index() const;
\n+
173 protected:
\n+
174 typedef typename Refinement::BackendRefinement BackendRefinement;
\n+
175 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
\n+
176 constexpr static int nKuhnSimplices = factorial(int(dimension));
\n+
177
\n+\n+
179
\n+\n+\n+\n+
183 };
\n+
\n+
184
\n+
185 template<int dimension, class CoordType>
\n+
\n+\n+
187 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
188 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
189 backend(BackendRefinement::vBegin(nIntervals_)),
\n+
190 backendEnd(BackendRefinement::vEnd(nIntervals_))
\n+
191 {
\n+
192 if (end)
\n+
193 kuhnIndex = nKuhnSimplices;
\n+
194 }
\n+
\n+
195
\n+
196 template<int dimension, class CoordType>
\n+
197 void
\n+
\n+\n+\n+
200 {
\n+
201 ++backend;
\n+
202 if (backend == backendEnd)
\n+
203 {
\n+
204 backend = BackendRefinement::vBegin(nIntervals_);
\n+
205 ++kuhnIndex;
\n+
206 }
\n+
207 }
\n+
\n+
208
\n+
209 template<int dimension, class CoordType>
\n+\n+
\n+\n+
212 coords() const
\n+
213 {
\n+
214 return referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
\n+
215 }
\n+
\n+
216
\n+
217 template<int dimension, class CoordType>
\n+\n+
\n+\n+
220 {
\n+
221 std::vector<CoordVector> corners(1);
\n+
222 corners[0] = referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
\n+
223 return Geometry(GeometryTypes::vertex, corners);
\n+
224 }
\n+
\n+
225
\n+
226 template<int dimension, class CoordType>
\n+
227 int
\n+
\n+\n+
229 index() const
\n+
230 {
\n+
231 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
\n+
232 }
\n+
\n+
233
\n+
234 // elements
\n+
235 template<int dimension, class CoordType>
\n+
\n+
236 class RefinementIteratorSpecial<dimension, CoordType, 0>
\n+
237 {
\n+
238 public:
\n+\n+\n+\n+
242 typedef typename Refinement::template Codim<0>::Geometry Geometry;
\n
243
\n-
244#include "refinement/hcube.cc"
\n-
245#include "refinement/simplex.cc"
\n-\n-\n-\n-
249
\n-
250#endif // DUNE_GEOMETRY_REFINEMENT_HH
\n-\n-
This file contains the parts independent of a particular Refinement implementation.
\n-\n-
This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
\n-
This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> trian...
\n-
This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons,...
\n+
244 RefinementIteratorSpecial(int nIntervals_, bool end = false);
\n+\n+
246
\n+
247 void increment();
\n+
248
\n+
249 IndexVector vertexIndices() const;
\n+
250 int index() const;
\n+
251 CoordVector coords() const;
\n+
252
\n+
253 Geometry geometry() const;
\n+
254
\n+
255 private:
\n+
256 CoordVector global(const CoordVector &local) const;
\n+
257
\n+
258 protected:
\n+\n+
260 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
\n+
261 constexpr static int nKuhnSimplices = factorial(dimension);
\n+
262
\n+\n+
264
\n+\n+\n+\n+
268 };
\n+
\n+
269
\n+
270 template<int dimension, class CoordType>
\n+
\n+\n+
272 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
273 : nIntervals_(nIntervals), kuhnIndex(0),
\n+
274 backend(BackendRefinement::eBegin(nIntervals_)),
\n+
275 backendEnd(BackendRefinement::eEnd(nIntervals_))
\n+
276 {
\n+
277 if (end)
\n+
278 kuhnIndex = nKuhnSimplices;
\n+
279 }
\n+
\n+
280 template<int dimension, class CoordType>
\n+
\n+\n+\n+
283 : nIntervals_(other.nIntervals_), kuhnIndex(other.kuhnIndex),
\n+
284 backend(other.backend),
\n+
285 backendEnd(other.backendEnd)
\n+
286 {}
\n+
\n+
287
\n+
288 template<int dimension, class CoordType>
\n+
289 void
\n+
\n+\n+\n+
292 {
\n+
293 ++backend;
\n+
294 if (backend == backendEnd)
\n+
295 {
\n+
296 backend = BackendRefinement::eBegin(nIntervals_);
\n+
297 ++kuhnIndex;
\n+
298 }
\n+
299 }
\n+
\n+
300
\n+
301 template<int dimension, class CoordType>
\n+\n+
\n+\n+
304 vertexIndices() const
\n+
305 {
\n+
306 IndexVector indices = backend.vertexIndices();
\n+
307
\n+
308 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
\n+
309 indices += base;
\n+
310
\n+
311 return indices;
\n+
312 }
\n+
\n+
313
\n+
314 template<int dimension, class CoordType>
\n+
315 int
\n+
\n+\n+
317 index() const
\n+
318 {
\n+
319 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
\n+
320 }
\n+
\n+
321
\n+
322 template<int dimension, class CoordType>
\n+\n+
\n+\n+
325 coords() const
\n+
326 {
\n+
327 return global(backend.coords());
\n+
328 }
\n+
\n+
329
\n+
330 template<int dimension, class CoordType>
\n+\n+
\n+\n+
333 {
\n+
334 const typename BackendIterator::Geometry &bgeo =
\n+
335 backend.geometry();
\n+
336 std::vector<CoordVector> corners(dimension+1);
\n+
337 for(int i = 0; i <= dimension; ++i)
\n+
338 corners[i] = global(bgeo.corner(i));
\n+
339
\n+
340 return Geometry(bgeo.type(), corners);
\n+
341 }
\n+
\n+
342
\n+
343 template<int dimension, class CoordType>
\n+\n+\n+
346 global(const CoordVector &local) const
\n+
347 {
\n+
348 return referenceToKuhn(local, getPermutation<dimension>(kuhnIndex));
\n+
349 }
\n+
350
\n+
351 // common
\n+
352 template<int dimension, class CoordType>
\n+
353 template<int codimension>
\n+
\n+
354 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
\n+
355 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
\n+
356 public RefinementIteratorSpecial<dimension, CoordType, codimension>
\n+
357 {
\n+
358 public:
\n+\n+
360 typedef SubEntityIterator This;
\n+
361
\n+
362 SubEntityIterator(int nIntervals, bool end = false);
\n+
363
\n+
364 bool equals(const This &other) const;
\n+
365 protected:
\n+
366 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
\n+
367 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
\n+
368 };
\n+
\n+
369
\n+
370#ifndef DOXYGEN
\n+
371 template<int dimension, class CoordType>
\n+
372 template<int codimension>
\n+\n+
374 SubEntityIterator(int nIntervals, bool end)
\n+
375 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
\n+
376 {}
\n+
377
\n+
378 template<int dimension, class CoordType>
\n+
379 template<int codimension>
\n+
380 bool
\n+\n+
382 equals(const This &other) const
\n+
383 { return kuhnIndex == other.kuhnIndex && backend == other.backend; }
\n+
384
\n+
385#endif // DOXYGEN
\n+
386
\n+
387 } // namespace HCubeTriangulation
\n+
\n+
388 } // namespace RefinementImp
\n+
389
\n+
390 namespace RefinementImp
\n+
391 {
\n+
392 // ///////////////////////
\n+
393 //
\n+
394 // The refinement traits
\n+
395 //
\n+
396
\n+
397#ifndef DOXYGEN
\n+
398 template<unsigned topologyId, class CoordType, unsigned coerceToId,
\n+
399 int dim>
\n+
400 struct Traits<
\n+
401 topologyId, CoordType, coerceToId, dim,
\n+
402 typename std::enable_if<
\n+
403 (dim >= 2 &&
\n+
404 (GeometryTypes::cube(dim).id() >> 1) ==
\n+
405 (topologyId >> 1) &&
\n+
406 (GeometryTypes::simplex(dim).id() >> 1) ==
\n+
407 (coerceToId >> 1)
\n+
408 )>::type
\n+
409 >
\n+
410 {
\n+
411 typedef HCubeTriangulation::RefinementImp<dim, CoordType> Imp;
\n+
412 };
\n+
413#endif
\n+
414
\n+
415 } // namespace RefinementImp
\n+
416} // namespace Dune
\n+
417
\n+
418#endif // DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
\n+
This file contains the parts independent of a particular Refinement implementation.
\n+
This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
\n+\n+
A unique label for each type of element that can occur in a grid.
\n+
STL namespace.
\n+
Definition affinegeometry.hh:21
\n+
FieldVector< int, n > getPermutation(int m)
Calculate permutation from it's index.
Definition simplex.cc:293
\n+
FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
Map from the reference simplex to some Kuhn simplex.
Definition simplex.cc:322
\n+
Static tag representing a codimension.
Definition dimension.hh:24
\n+
generic geometry implementation based on corner coordinates
Definition multilineargeometry.hh:181
\n+\n+\n+
static VertexIterator vEnd(int nIntervals)
Definition hcubetriangulation.cc:121
\n+
static VertexIterator vBegin(int nIntervals)
Definition hcubetriangulation.cc:113
\n+
static int nElements(int nIntervals)
Definition hcubetriangulation.cc:129
\n+
FieldVector< CoordType, dimension > CoordVector
Definition hcubetriangulation.cc:76
\n+
CoordType ctype
Definition hcubetriangulation.cc:71
\n+
Codim< 0 >::SubEntityIterator ElementIterator
Definition hcubetriangulation.cc:77
\n+
FieldVector< int, dimension+1 > IndexVector
Definition hcubetriangulation.cc:78
\n+
static ElementIterator eBegin(int nIntervals)
Definition hcubetriangulation.cc:137
\n+
static ElementIterator eEnd(int nIntervals)
Definition hcubetriangulation.cc:145
\n+
static constexpr int dimension
Definition hcubetriangulation.cc:69
\n+
Codim< dimension >::SubEntityIterator VertexIterator
Definition hcubetriangulation.cc:75
\n+
static int nVertices(int nIntervals)
Definition hcubetriangulation.cc:105
\n+\n+
Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
Definition hcubetriangulation.cc:99
\n+\n+\n+\n+
Refinement::template Codim< dimension >::Geometry Geometry
Definition hcubetriangulation.cc:162
\n+
BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
Definition hcubetriangulation.cc:175
\n+
Refinement::BackendRefinement BackendRefinement
Definition hcubetriangulation.cc:174
\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcubetriangulation.cc:160
\n+\n+
BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
Definition hcubetriangulation.cc:260
\n+\n+
Refinement::CoordVector CoordVector
Definition hcubetriangulation.cc:241
\n+\n+\n+
Refinement::BackendRefinement BackendRefinement
Definition hcubetriangulation.cc:259
\n+\n+
Refinement::IndexVector IndexVector
Definition hcubetriangulation.cc:240
\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcubetriangulation.cc:239
\n+
Refinement::template Codim< 0 >::Geometry Geometry
Definition hcubetriangulation.cc:242
\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcubetriangulation.cc:359
\n+
SubEntityIterator This
Definition hcubetriangulation.cc:360
\n+\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,44 +1,590 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-refinement.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+hcubetriangulation.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_HH\n-6#define DUNE_GEOMETRY_REFINEMENT_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n+_\b6#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n 7\n-239// The interface (template<...> class StaticRefinement) is not included here\n-240// since it derives from parts which I consider implementation. Look\n-241// into refinement/base.cc if the documentation is above is not enough.\n-242#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+29#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+30#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+31\n+32#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+33#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+34\n+35namespace _\bD_\bu_\bn_\be\n+36{\n+37 namespace RefinementImp\n+38 {\n+_\b4_\b6 namespace HCubeTriangulation {\n+47\n+48 // ////////////\n+49 //\n+50 // Utilities\n+51 //\n+52\n+53 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n+54 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n+55\n+56 // ////////////////////////////////////\n+57 //\n+58 // Refine a hypercube with simplices\n+59 //\n+60\n+61 // forward declaration of the iterator base\n+62 template\n+_\b6_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+64\n+65 template\n+_\b6_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+67 {\n+68 public:\n+_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+70\n+_\b7_\b1 typedef CoordType _\bc_\bt_\by_\bp_\be;\n+72\n+73 template\n+74 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b7_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b6 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b7_\b7 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b7_\b8 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+79\n+80 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n+81 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n+83\n+84 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n+85 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+_\b8_\b6 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n+87 private:\n+88 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n+89 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n+90\n+91 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+92 };\n+93\n+94 template\n+95 template\n+_\b9_\b6 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n+97 {\n+98 class SubEntityIterator;\n+_\b9_\b9 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+100 };\n+101\n+102 template\n+103 int\n+_\b1_\b0_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+105_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n+106 {\n+107 return BackendRefinement::nVertices(nIntervals) * factorial(int\n+(dimension));\n+108 }\n+109\n+110 template\n+111 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b1_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+113_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+114 {\n+115 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+116 }\n+117\n+118 template\n+119 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b2_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+121_\b _\bv_\bE_\bn_\bd(int nIntervals)\n+122 {\n+123 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+124 }\n+125\n+126 template\n+127 int\n+_\b1_\b2_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+129_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n+130 {\n+131 return BackendRefinement::nElements(nIntervals) * factorial(int\n+(dimension));\n+132 }\n+133\n+134 template\n+135 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b3_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+137_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+138 {\n+139 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+140 }\n+141\n+142 template\n+143 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b4_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+145_\b _\be_\bE_\bn_\bd(int nIntervals)\n+146 {\n+147 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+148 }\n+149\n+150 // //////////////\n+151 //\n+152 // The iterator\n+153 //\n+154\n+155 // vertices\n+156 template\n+_\b1_\b5_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+158 {\n+159 public:\n+_\b1_\b6_\b0 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b6_\b1 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b1_\b6_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+163\n+164 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+165\n+166 void increment();\n+167\n+168 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+169\n+170 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n+171\n+172 int index() const;\n+173 protected:\n+_\b1_\b7_\b4 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b7_\b5 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b1_\b7_\b6 constexpr static int nKuhnSimplices = factorial(int(dimension));\n+177\n+_\b1_\b7_\b8 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n+179\n+_\b1_\b8_\b0 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b1_\b8_\b1 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b1_\b8_\b2 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+183 };\n+184\n+185 template\n+_\b1_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+187_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+188 : nIntervals_(nIntervals), kuhnIndex(0),\n+189 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n+190 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n+191 {\n+192 if (end)\n+193 kuhnIndex = nKuhnSimplices;\n+194 }\n+195\n+196 template\n+197 void\n+_\b1_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+199_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+200 {\n+201 ++backend;\n+202 if (backend == backendEnd)\n+203 {\n+204 backend = BackendRefinement::vBegin(nIntervals_);\n+205 ++kuhnIndex;\n+206 }\n+207 }\n+208\n+209 template\n+210 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b2_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+212_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+213 {\n+214 return referenceToKuhn(backend.coords(), getPermutation\n+(kuhnIndex));\n+215 }\n+216\n+217 template\n+218 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b2_\b1_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n+const\n+220 {\n+221 std::vector corners(1);\n+222 corners[0] = referenceToKuhn(backend.coords(), getPermutation\n+(kuhnIndex));\n+223 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n+224 }\n+225\n+226 template\n+227 int\n+_\b2_\b2_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+229_\b _\bi_\bn_\bd_\be_\bx() const\n+230 {\n+231 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n+();\n+232 }\n+233\n+234 // elements\n+235 template\n+_\b2_\b3_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+237 {\n+238 public:\n+_\b2_\b3_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b4_\b0 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b1 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b4_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n 243\n-244#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\"\n-245#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n-246#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-247#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-248#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n-249\n-250#endif // DUNE_GEOMETRY_REFINEMENT_HH\n-_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n+244 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals_, bool end = false);\n+245 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(const _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> &other);\n+246\n+247 void increment();\n+248\n+249 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+250 int index() const;\n+251 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+252\n+253 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n+254\n+255 private:\n+256 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n+257\n+258 protected:\n+_\b2_\b5_\b9 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b6_\b0 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b2_\b6_\b1 constexpr static int nKuhnSimplices = factorial(dimension);\n+262\n+_\b2_\b6_\b3 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n+264\n+_\b2_\b6_\b5 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b2_\b6_\b6 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n+_\b2_\b6_\b7 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n+268 };\n+269\n+270 template\n+_\b2_\b7_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+272_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+273 : nIntervals_(nIntervals), kuhnIndex(0),\n+274 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n+275 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n+276 {\n+277 if (end)\n+278 kuhnIndex = nKuhnSimplices;\n+279 }\n+280 template\n+_\b2_\b8_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+282_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(const _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> &other)\n+283 : nIntervals_(other.nIntervals_), kuhnIndex(other.kuhnIndex),\n+284 backend(other.backend),\n+285 backendEnd(other.backendEnd)\n+286 {}\n+287\n+288 template\n+289 void\n+_\b2_\b9_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+291_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+292 {\n+293 ++backend;\n+294 if (backend == backendEnd)\n+295 {\n+296 backend = BackendRefinement::eBegin(nIntervals_);\n+297 ++kuhnIndex;\n+298 }\n+299 }\n+300\n+301 template\n+302 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b0_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+304_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+305 {\n+306 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n+307\n+308 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n+309 indices += base;\n+310\n+311 return indices;\n+312 }\n+313\n+314 template\n+315 int\n+_\b3_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+317_\b _\bi_\bn_\bd_\be_\bx() const\n+318 {\n+319 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n+();\n+320 }\n+321\n+322 template\n+323 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+325_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+326 {\n+327 return global(backend.coords());\n+328 }\n+329\n+330 template\n+331 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b3_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n+333 {\n+334 const typename BackendIterator::Geometry &bgeo =\n+335 backend.geometry();\n+336 std::vector corners(dimension+1);\n+337 for(int i = 0; i <= dimension; ++i)\n+338 corners[i] = global(bgeo.corner(i));\n+339\n+340 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n+341 }\n+342\n+343 template\n+344 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+345 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+346_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n+347 {\n+348 return referenceToKuhn(local, getPermutation(kuhnIndex));\n+349 }\n+350\n+351 // common\n+352 template\n+353 template\n+_\b3_\b5_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+355 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+356 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+357 {\n+358 public:\n+_\b3_\b5_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b3_\b6_\b0 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n+361\n+_\b3_\b6_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n+363\n+_\b3_\b6_\b4 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n+365 protected:\n+366 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+kuhnIndex;\n+367 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n+backend;\n+368 };\n+369\n+370#ifndef DOXYGEN\n+371 template\n+372 template\n+373 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+374_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n+375 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n+end)\n+376 {}\n+377\n+378 template\n+379 template\n+380 bool\n+381 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+382_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n+383 { return kuhnIndex == other.kuhnIndex && backend == other.backend; }\n+384\n+385#endif // DOXYGEN\n+386\n+387 } // namespace HCubeTriangulation\n+388 } // namespace RefinementImp\n+389\n+390 namespace RefinementImp\n+391 {\n+392 // ///////////////////////\n+393 //\n+394 // The refinement traits\n+395 //\n+396\n+397#ifndef DOXYGEN\n+398 template\n+400 struct Traits<\n+401 topologyId, CoordType, coerceToId, dim,\n+402 typename _\bs_\bt_\bd::enable_if<\n+403 (dim >= 2 &&\n+404 (GeometryTypes::cube(dim).id() >> 1) ==\n+405 (topologyId >> 1) &&\n+406 (GeometryTypes::simplex(dim).id() >> 1) ==\n+407 (coerceToId >> 1)\n+408 )>::type\n+409 >\n+410 {\n+411 typedef HCubeTriangulation::RefinementImp Imp;\n+412 };\n+413#endif\n+414\n+415 } // namespace RefinementImp\n+416} // namespace Dune\n+417\n+418#endif // DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n _\bb_\ba_\bs_\be_\b._\bc_\bc\n This file contains the parts independent of a particular Refinement\n implementation.\n-_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n _\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n This file contains the Refinement implementation for simplices (triangles,\n tetrahedrons....\n-_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n-This file contains the Refinement implementation for triangulating hypercubes\n-(quadrilateral -> trian...\n-_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\n-This file contains the Refinement implementation for hypercubes\n-(quadrilaterals, hexahedrons,...\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\bt_\by_\bp_\be_\b._\bh_\bh\n+A unique label for each type of element that can occur in a grid.\n+_\bs_\bt_\bd\n+STL namespace.\n+_\bD_\bu_\bn_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n+FieldVector< int, n > getPermutation(int m)\n+Calculate permutation from it's index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n+FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n+dimension > point, const FieldVector< int, dimension > &kuhn)\n+Map from the reference simplex to some Kuhn simplex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Static tag representing a codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+generic geometry implementation based on corner coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:63\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:121\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:113\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:129\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:76\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n+CoordType ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< int, dimension+1 > IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:137\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:145\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:69\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:75\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:105\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:97\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n+Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:99\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:178\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:180\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:161\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< dimension >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:162\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< dimension >::SubEntityIterator\n+BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:175\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:174\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:160\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:182\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:260\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n+BackendIterator backend\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:266\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:241\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n+const BackendIterator backendEnd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:265\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Refinement::BackendRefinement BackendRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:259\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n+int nIntervals_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:240\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:239\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< 0 >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:242\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const This &other) const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(int nIntervals, bool end=false)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:359\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bT_\bh_\bi_\bs\n+SubEntityIterator This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00185.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00185.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: convergence.hh File Reference\n+dune-geometry: simplex.cc File Reference\n \n \n \n \n \n \n \n@@ -65,33 +65,105 @@\n \n \n \n \n \n \n \n
\n \n-
convergence.hh File Reference
\n+Classes |\n+Namespaces |\n+Macros
\n+
simplex.cc File Reference
\n \n
\n-
#include <cmath>
\n-#include <limits>
\n+\n+

This file contains the Refinement implementation for simplices (triangles, tetrahedrons...) \n+More...

\n+
#include <algorithm>
\n+#include <dune/common/fvector.hh>
\n+#include <dune/common/math.hh>
\n+#include <dune/geometry/multilineargeometry.hh>
\n+#include <dune/geometry/referenceelements.hh>
\n+#include <dune/geometry/type.hh>
\n+#include "base.cc"
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

\n+Classes

class  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >
 
struct  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
class  Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, dimension >
 
class  Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, 0 >
 
class  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
\n \n \n \n+\n+\n+\n+\n+\n+\n+

\n Namespaces

namespace  Dune
 
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
namespace  Dune::RefinementImp::Simplex
 This namespace contains the Refinement implementation for simplices (triangles, tetrahedrons...)
 
\n+\n+\n+\n+

\n+Macros

#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
 
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

\n+Functions

Utilities
template<int dimension>
int Dune::RefinementImp::Simplex::pointIndex (const FieldVector< int, dimension > &point)
 calculate the index of a given gridpoint within a Kuhn0 simplex
 
template<int n>
FieldVector< int, n > Dune::RefinementImp::Simplex::getPermutation (int m)
 Calculate permutation from it's index.
 
template<int dimension, class CoordType >
FieldVector< CoordType, dimension > Dune::RefinementImp::Simplex::referenceToKuhn (FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
 Map from the reference simplex to some Kuhn simplex.
 
template<int dimension, class CoordType >
FieldVector< CoordType, dimension > Dune::RefinementImp::Simplex::kuhnToReference (FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
 Map from some Kuhn simplex to the reference simplex.
 
\n+

Detailed Description

\n+

This file contains the Refinement implementation for simplices (triangles, tetrahedrons...)

\n+

See Refinement implementation for simplices.

\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
\n+
\n+\n+
\n+
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,17 +1,86 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-convergence.hh File Reference\n-#include \n-#include \n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n+simplex.cc File Reference\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices (triangles,\n+tetrahedrons...) _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n+ _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n+ _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx\n+\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices\n+ (triangles, tetrahedrons...)\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bR_\bI_\bD_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bS_\bI_\bM_\bP_\bL_\bE_\bX_\b__\bC_\bC\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+Utilities\n+template\n+ int\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx\n+ (const FieldVector< int, dimension >\n+ &point)\n+\u00a0 calculate the index of a given gridpoint\n+ within a Kuhn0 simplex\n+\u00a0\n+template\n+ FieldVector< int, n >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n+ _\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn (int m)\n+\u00a0 Calculate permutation from it's index.\n+\u00a0\n+template\n+FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n+ _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn (FieldVector< CoordType,\n+ dimension > point, const FieldVector< int,\n+ dimension > &kuhn)\n+\u00a0 Map from the reference simplex to some\n+ Kuhn simplex.\n+\u00a0\n+template\n+FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n+ _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be (FieldVector< CoordType,\n+ dimension > point, const FieldVector< int,\n+ dimension > &kuhn)\n+\u00a0 Map from some Kuhn simplex to the\n+ reference simplex.\n+\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices (triangles,\n+tetrahedrons...)\n+See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bs_\bi_\bm_\bp_\bl_\bi_\bc_\be_\bs.\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGR\bRI\bID\bD_\b_C\bCO\bOM\bMM\bMO\bON\bN_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_S\bSI\bIM\bMP\bPL\bLE\bEX\bX_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00185_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00185_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: convergence.hh Source File\n+dune-geometry: simplex.cc Source File\n \n \n \n \n \n \n \n@@ -70,44 +70,621 @@\n
\n \n \n \n \n \n \n
\n-
convergence.hh
\n+
simplex.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
\n-
6#define DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
\n+
5#ifndef DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
\n+
6#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
\n
7
\n-
8#include <cmath>
\n-
9#include <limits>
\n-
10
\n-
11namespace Dune::Impl {
\n-
12
\n-
13template <class R = double>
\n-
14struct ConvergenceOptions
\n-
15{
\n-
17 int maxIt = 100;
\n-
18
\n-
20 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits<R>::epsilon()); }();
\n-
21};
\n-
22
\n-
23} // end namespace Dune::Impl
\n-
24
\n-
25#endif // DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
\n+
8// This file is part of DUNE, a Distributed and Unified Numerics Environment
\n+
9// This file is copyright (C) 2005 Jorrit Fahlke <jorrit@jorrit.de>
\n+
10// This file is licensed under version 2 of the GNU General Public License,
\n+
11// with a special "runtime exception." See COPYING at the top of the source
\n+
12// tree for the full licence.
\n+
13
\n+
243#include <algorithm>
\n+
244
\n+
245#include <dune/common/fvector.hh>
\n+
246#include <dune/common/math.hh>
\n+
247
\n+\n+\n+
250#include <dune/geometry/type.hh>
\n+
251
\n+
252#include "base.cc"
\n+
253
\n+
254namespace Dune {
\n+
255
\n+
256 namespace RefinementImp {
\n+
257
\n+
\n+
264 namespace Simplex {
\n+
265
\n+
266 // //////////////////
\n+
267 //
\n+
269 //
\n+
270
\n+
272
\n+
279 template<int dimension>
\n+
\n+
280 int pointIndex(const FieldVector<int, dimension> &point)
\n+
281 {
\n+
282 int index = 0;
\n+
283 for(int i = 0; i < dimension; ++i)
\n+
284 index += Dune::binomial(dimension-i + point[i]-1, dimension-i);
\n+
285 return index;
\n+
286 }
\n+
\n+
287
\n+
292 template<int n>
\n+
\n+
293 FieldVector<int, n> getPermutation(int m)
\n+
294 {
\n+
295 FieldVector<int, n> perm;
\n+
296 for(int i = 0; i < n; ++i)
\n+
297 perm[i] = i;
\n+
298
\n+
299 int base = 1;
\n+
300 for(int i = 1; i <= n; ++i)
\n+
301 base *= i;
\n+
302
\n+
303 for(int i = n; i > 0; --i) {
\n+
304 base /= i;
\n+
305 int d = m / base;
\n+
306 m %= base;
\n+
307 int t = perm[i-1]; perm[i-1] = perm[i-1-d]; perm[i-1-d] = t;
\n+
308 }
\n+
309 return perm;
\n+
310 }
\n+
\n+
311
\n+
312 // map between the reference simplex and some arbitrary kuhn simplex (denoted by it's permutation)
\n+
320 template<int dimension, class CoordType>
\n+
321 FieldVector<CoordType, dimension>
\n+
\n+\n+
323 FieldVector<CoordType, dimension> point,
\n+
325 const FieldVector<int, dimension> &kuhn)
\n+
326 {
\n+
327 for(int i = dimension - 1; i > 0; --i)
\n+
328 point[kuhn[i-1]] += point[kuhn[i]];
\n+
329 return point;
\n+
330 }
\n+
\n+
331
\n+
339 template<int dimension, class CoordType>
\n+
340 FieldVector<CoordType, dimension>
\n+
\n+\n+
342 FieldVector<CoordType, dimension> point,
\n+
344 const FieldVector<int, dimension> &kuhn)
\n+
345 {
\n+
346 for(int i = 0; i < dimension - 1; ++i)
\n+
347 point[kuhn[i]] -= point[kuhn[i+1]];
\n+
348 return point;
\n+
349 }
\n+
\n+
350
\n+
351
\n+
353
\n+
354 // /////////////////////////////////////////
\n+
355 //
\n+
356 // refinement implementation for simplices
\n+
357 //
\n+
358
\n+
359 template<int dimension_, class CoordType>
\n+
\n+\n+
361 {
\n+
362 public:
\n+
363 constexpr static int dimension = dimension_;
\n+
364 typedef CoordType ctype;
\n+
365
\n+
366 template<int codimension>
\n+
367 struct Codim;
\n+\n+
369 typedef FieldVector<CoordType, dimension> CoordVector;
\n+\n+
371 typedef FieldVector<int, dimension+1> IndexVector;
\n+
372
\n+
373 static int nVertices(int nIntervals);
\n+
374 static VertexIterator vBegin(int nIntervals);
\n+
375 static VertexIterator vEnd(int nIntervals);
\n+
376
\n+
377 static int nElements(int nIntervals);
\n+
378 static ElementIterator eBegin(int nIntervals);
\n+
379 static ElementIterator eEnd(int nIntervals);
\n+
380 };
\n+
\n+
381
\n+
382 template<int dimension, class CoordType>
\n+
383 template<int codimension>
\n+
\n+
384 struct RefinementImp<dimension, CoordType>::Codim
\n+
385 {
\n+
386 class SubEntityIterator;
\n+
387 // We don't need the caching, but the uncached MultiLinearGeometry has bug FS#1209
\n+\n+
389 };
\n+
\n+
390
\n+
391 template<int dimension, class CoordType>
\n+
392 int
\n+
\n+\n+
394 nVertices(int nIntervals)
\n+
395 {
\n+
396 return Dune::binomial(dimension + nIntervals, (int)dimension);
\n+
397 }
\n+
\n+
398
\n+
399 template<int dimension, class CoordType>
\n+\n+
\n+\n+
402 vBegin(int nIntervals)
\n+
403 {
\n+
404 return VertexIterator(nIntervals);
\n+
405 }
\n+
\n+
406
\n+
407 template<int dimension, class CoordType>
\n+\n+
\n+\n+
410 vEnd(int nIntervals)
\n+
411 {
\n+
412 return VertexIterator(nIntervals, true);
\n+
413 }
\n+
\n+
414
\n+
415 template<int dimension, class CoordType>
\n+
416 int
\n+
\n+\n+
418 nElements(int nIntervals)
\n+
419 {
\n+
420 return Dune::power(nIntervals, int(dimension));
\n+
421 }
\n+
\n+
422
\n+
423 template<int dimension, class CoordType>
\n+\n+
\n+\n+
426 eBegin(int nIntervals)
\n+
427 {
\n+
428 return ElementIterator(nIntervals);
\n+
429 }
\n+
\n+
430
\n+
431 template<int dimension, class CoordType>
\n+\n+
\n+\n+
434 eEnd(int nIntervals)
\n+
435 {
\n+
436 return ElementIterator(nIntervals, true);
\n+
437 }
\n+
\n+
438
\n+
439 // //////////////
\n+
440 //
\n+
441 // The iterator
\n+
442 //
\n+
443
\n+
444 template<int dimension, class CoordType, int codimension>
\n+\n+
446
\n+
447 // vertices
\n+
448
\n+
449 template<int dimension, class CoordType>
\n+
\n+
450 class RefinementIteratorSpecial<dimension, CoordType, dimension>
\n+
451 {
\n+
452 public:
\n+\n+
454 typedef typename Refinement::CoordVector CoordVector;
\n+
455 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
\n+\n+
457
\n+
458 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
459
\n+
460 void increment();
\n+
461 bool equals(const This &other) const;
\n+
462
\n+
463 CoordVector coords() const;
\n+
464 Geometry geometry () const;
\n+
465
\n+
466 int index() const;
\n+
467 protected:
\n+
468 typedef FieldVector<int, dimension> Vertex;
\n+
469
\n+
470 int size;
\n+\n+
472 };
\n+
\n+
473
\n+
474 template<int dimension, class CoordType>
\n+
\n+\n+
476 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
477 : size(nIntervals)
\n+
478 {
\n+
479 vertex[0] = (end) ? size + 1 : 0;
\n+
480 for(int i = 1; i < dimension; ++ i)
\n+
481 vertex[i] = 0;
\n+
482 }
\n+
\n+
483
\n+
484 template<int dimension, class CoordType>
\n+
485 void
\n+
\n+\n+\n+
488 {
\n+
489 assert(vertex[0] <= size);
\n+
490 for(int i = dimension - 1; i >= 0; --i) {
\n+
491 ++vertex[i];
\n+
492 if(i == 0 || vertex[i] <= vertex[i-1])
\n+
493 break;
\n+
494 else
\n+
495 vertex[i] = 0;
\n+
496 }
\n+
497 }
\n+
\n+
498
\n+
499 template<int dimension, class CoordType>
\n+
500 bool
\n+
\n+\n+
502 equals(const This &other) const
\n+
503 {
\n+
504 return size == other.size && vertex == other.vertex;
\n+
505 }
\n+
\n+
506
\n+
507 template<int dimension, class CoordType>
\n+\n+
\n+\n+
510 coords() const
\n+
511 {
\n+
512 Vertex ref = kuhnToReference(vertex, getPermutation<dimension>(0));
\n+
513
\n+
514 CoordVector coords;
\n+
515 for(int i = 0; i < dimension; ++i)
\n+
516 coords[i] = CoordType(ref[i]) / size;
\n+
517 return coords;
\n+
518 }
\n+
\n+
519
\n+
520 template<int dimension, class CoordType>
\n+\n+
\n+\n+
523 {
\n+
524 std::vector<CoordVector> corners(1);
\n+
525 corners[0] = (CoordVector)vertex;
\n+
526 return Geometry(GeometryTypes::vertex, corners);
\n+
527 }
\n+
\n+
528
\n+
529 template<int dimension, class CoordType>
\n+
530 int
\n+
\n+\n+
532 index() const
\n+
533 {
\n+
534 return pointIndex(vertex);
\n+
535 }
\n+
\n+
536
\n+
537 // elements
\n+
538
\n+
539 template<int dimension, class CoordType>
\n+
\n+
540 class RefinementIteratorSpecial<dimension, CoordType, 0>
\n+
541 {
\n+
542 public:
\n+\n+\n+\n+
546 typedef typename Refinement::template Codim<0>::Geometry Geometry;
\n+\n+
548
\n+
549 RefinementIteratorSpecial(int nIntervals, bool end = false);
\n+
550
\n+
551 void increment();
\n+
552 bool equals(const This &other) const;
\n+
553
\n+
554 IndexVector vertexIndices() const;
\n+
555 int index() const;
\n+
556 CoordVector coords() const;
\n+
557
\n+
558 Geometry geometry () const;
\n+
559
\n+
560 private:
\n+
561 CoordVector global(const CoordVector &local) const;
\n+
562
\n+
563 protected:
\n+
564 typedef FieldVector<int, dimension> Vertex;
\n+
565 constexpr static int nKuhnIntervals = Dune::factorial(dimension);
\n+
566
\n+\n+\n+
569 int size;
\n+\n+
571 };
\n+
\n+
572
\n+
573 template<int dimension, class CoordType>
\n+
\n+\n+
575 RefinementIteratorSpecial(int nIntervals, bool end)
\n+
576 : kuhnIndex(0), size(nIntervals), index_(0)
\n+
577 {
\n+
578 for(int i = 0; i < dimension; ++i)
\n+
579 origin[i] = 0;
\n+
580 if(end) {
\n+
581 index_ = Refinement::nElements(nIntervals);
\n+
582 origin[0] = size;
\n+
583 }
\n+
584 }
\n+
\n+
585
\n+
586 template<int dimension, class CoordType>
\n+
587 void
\n+
\n+\n+\n+
590 {
\n+
591 assert(origin[0] < size);
\n+
592
\n+
593 ++index_;
\n+
594
\n+
595 while(1) {
\n+
596 ++kuhnIndex;
\n+
597 if(kuhnIndex == nKuhnIntervals) {
\n+
598 kuhnIndex = 0;
\n+
599 // increment origin
\n+
600 for(int i = dimension - 1; i >= 0; --i) {
\n+
601 ++origin[i];
\n+
602 if(i == 0 || origin[i] <= origin[i-1])
\n+
603 break;
\n+
604 else
\n+
605 origin[i] = 0;
\n+
606 }
\n+
607 }
\n+
608
\n+
609 // test whether the current simplex has any corner outside the kuhn0 simplex
\n+
610 FieldVector<int, dimension> perm = getPermutation<dimension>(kuhnIndex);
\n+
611 Vertex corner = origin;
\n+
612 bool outside = false;
\n+
613 for(int i = 0; i < dimension; ++i) {
\n+
614 // next corner
\n+
615 ++corner[perm[i]];
\n+
616 if(perm[i] > 0)
\n+
617 if(corner[perm[i]] > corner[perm[i]-1]) {
\n+
618 outside = true;
\n+
619 break;
\n+
620 }
\n+
621 }
\n+
622 if(!outside)
\n+
623 return;
\n+
624 }
\n+
625 }
\n+
\n+
626
\n+
627 template<int dimension, class CoordType>
\n+
628 bool
\n+
\n+\n+
630 equals(const This &other) const
\n+
631 {
\n+
632 return size == other.size && index_ == other.index_;
\n+
633 }
\n+
\n+
634
\n+
635 template<int dimension, class CoordType>
\n+\n+
\n+\n+
638 vertexIndices() const
\n+
639 {
\n+
640 IndexVector indices;
\n+
641 FieldVector<int, dimension> perm = getPermutation<dimension>(kuhnIndex);
\n+
642 Vertex vertex = origin;
\n+
643 indices[0] = pointIndex(vertex);
\n+
644 for(int i = 0; i < dimension; ++i) {
\n+
645 ++vertex[perm[i]];
\n+
646 indices[i+1] = pointIndex(vertex);
\n+
647 }
\n+
648 if (kuhnIndex%2 == 1)
\n+
649 for(int i = 0; i < (dimension+1)/2; ++i) {
\n+
650 int t = indices[i];
\n+
651 indices[i] = indices[dimension-i];
\n+
652 indices[dimension-i] = t;
\n+
653 }
\n+
654 return indices;
\n+
655 }
\n+
\n+
656
\n+
657 template<int dimension, class CoordType>
\n+
658 int
\n+
\n+\n+
660 index() const
\n+
661 {
\n+
662 return index_;
\n+
663 }
\n+
\n+
664
\n+
665 template<int dimension, class CoordType>
\n+\n+
\n+\n+
668 coords() const
\n+
669 {
\n+\n+
671 ::simplex().position(0,0));
\n+
672 }
\n+
\n+
673
\n+
674 template<int dimension, class CoordType>
\n+\n+
\n+\n+
677 {
\n+
678 std::vector<CoordVector> corners(dimension+1);
\n+\n+
680 for(int i = 0; i <= dimension; ++i)
\n+
681 corners[i] = global(refelem.position(i, dimension));
\n+
682 return Geometry(refelem.type(), corners);
\n+
683 }
\n+
\n+
684
\n+
685 template<int dimension, class CoordType>
\n+\n+\n+
688 global(const CoordVector &local) const {
\n+
689 CoordVector v =
\n+
690 referenceToKuhn(local, getPermutation<dimension>(kuhnIndex));
\n+
691 v += origin;
\n+
692 v /= (typename CoordVector::value_type)size;
\n+
693 return kuhnToReference(v, getPermutation<dimension>(0));
\n+
694 }
\n+
695
\n+
696 // common
\n+
697
\n+
698 template<int dimension, class CoordType>
\n+
699 template<int codimension>
\n+
\n+
700 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
\n+
701 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
\n+
702 public RefinementIteratorSpecial<dimension, CoordType, codimension>
\n+
703 {
\n+
704 public:
\n+\n+
706
\n+
707 SubEntityIterator(int nIntervals, bool end = false);
\n+
708 };
\n+
\n+
709
\n+
710#ifndef DOXYGEN
\n+
711
\n+
712 template<int dimension, class CoordType>
\n+
713 template<int codimension>
\n+\n+
715 SubEntityIterator(int nIntervals, bool end)
\n+
716 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
\n+
717 {}
\n+
718
\n+
719#endif
\n+
720
\n+
721 } // namespace Simplex
\n+
\n+
722
\n+
723 } // namespace RefinementImp
\n+
724
\n+
725
\n+
726 namespace RefinementImp {
\n+
727
\n+
728 // ///////////////////////
\n+
729 //
\n+
730 // The refinement traits
\n+
731 //
\n+
732
\n+
733#ifndef DOXYGEN
\n+
734 template<unsigned topologyId, class CoordType, unsigned coerceToId,
\n+
735 int dim>
\n+
736 struct Traits<
\n+
737 topologyId, CoordType, coerceToId, dim,
\n+
738 typename std::enable_if<
\n+
739 ((GeometryTypes::simplex(dim).id() >> 1) ==
\n+
740 (topologyId >> 1) &&
\n+
741 (GeometryTypes::simplex(dim).id() >> 1) ==
\n+
742 (coerceToId >> 1)
\n+
743 )>::type
\n+
744 >
\n+
745 {
\n+
746 typedef Simplex::RefinementImp<dim, CoordType> Imp;
\n+
747 };
\n+
748#endif
\n+
749
\n+
750
\n+
751 } // namespace RefinementImp
\n+
752
\n+
753} // namespace Dune
\n+
754
\n+
755#endif //DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
\n+
This file contains the parts independent of a particular Refinement implementation.
\n+\n+
A unique label for each type of element that can occur in a grid.
\n+\n+
STL namespace.
\n+
Definition affinegeometry.hh:21
\n+
int pointIndex(const FieldVector< int, dimension > &point)
calculate the index of a given gridpoint within a Kuhn0 simplex
Definition simplex.cc:280
\n+
FieldVector< int, n > getPermutation(int m)
Calculate permutation from it's index.
Definition simplex.cc:293
\n+
FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
Map from the reference simplex to some Kuhn simplex.
Definition simplex.cc:322
\n+
FieldVector< CoordType, dimension > kuhnToReference(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
Map from some Kuhn simplex to the reference simplex.
Definition simplex.cc:341
\n+
Class providing access to the singletons of the reference elements.
Definition referenceelements.hh:128
\n+
static const ReferenceElement & simplex()
get simplex reference elements
Definition referenceelements.hh:162
\n+
Static tag representing a codimension.
Definition dimension.hh:24
\n+
Implement a MultiLinearGeometry with additional caching.
Definition multilineargeometry.hh:526
\n+\n+
Codim< dimension >::SubEntityIterator VertexIterator
Definition simplex.cc:368
\n+
FieldVector< int, dimension+1 > IndexVector
Definition simplex.cc:371
\n+
CoordType ctype
Definition simplex.cc:364
\n+
static int nVertices(int nIntervals)
Definition simplex.cc:394
\n+
static int nElements(int nIntervals)
Definition simplex.cc:418
\n+
static ElementIterator eEnd(int nIntervals)
Definition simplex.cc:434
\n+
static VertexIterator vEnd(int nIntervals)
Definition simplex.cc:410
\n+
Codim< 0 >::SubEntityIterator ElementIterator
Definition simplex.cc:370
\n+
static VertexIterator vBegin(int nIntervals)
Definition simplex.cc:402
\n+
static ElementIterator eBegin(int nIntervals)
Definition simplex.cc:426
\n+
FieldVector< CoordType, dimension > CoordVector
Definition simplex.cc:369
\n+
static constexpr int dimension
Definition simplex.cc:363
\n+\n+
Dune::CachedMultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
Definition simplex.cc:388
\n+\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition simplex.cc:453
\n+\n+
Refinement::template Codim< dimension >::Geometry Geometry
Definition simplex.cc:455
\n+
RefinementIteratorSpecial< dimension, CoordType, dimension > This
Definition simplex.cc:456
\n+\n+\n+\n+\n+
FieldVector< int, dimension > Vertex
Definition simplex.cc:564
\n+\n+\n+
Refinement::template Codim< 0 >::Geometry Geometry
Definition simplex.cc:546
\n+\n+\n+
RefinementIteratorSpecial< dimension, CoordType, 0 > This
Definition simplex.cc:547
\n+
RefinementImp< dimension, CoordType > Refinement
Definition simplex.cc:543
\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition simplex.cc:705
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,36 +1,682 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-convergence.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+simplex.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n-6#define DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n+5#ifndef DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n+_\b6#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n 7\n-8#include \n-9#include \n-10\n-11namespace Dune::Impl {\n-12\n-13template \n-14struct ConvergenceOptions\n-15{\n-17 int maxIt = 100;\n-18\n-20 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits::epsilon\n-()); }();\n-21};\n-22\n-23} // end namespace Dune::Impl\n-24\n-25#endif // DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n+8// This file is part of DUNE, a Distributed and Unified Numerics Environment\n+9// This file is copyright (C) 2005 Jorrit Fahlke \n+10// This file is licensed under version 2 of the GNU General Public License,\n+11// with a special \"runtime exception.\" See COPYING at the top of the source\n+12// tree for the full licence.\n+13\n+243#include \n+244\n+245#include \n+246#include \n+247\n+248#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+249#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+250#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+251\n+252#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+253\n+254namespace _\bD_\bu_\bn_\be {\n+255\n+256 namespace RefinementImp {\n+257\n+_\b2_\b6_\b4 namespace Simplex {\n+265\n+266 // //////////////////\n+267 //\n+269 //\n+270\n+272\n+279 template\n+_\b2_\b8_\b0 int _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(const FieldVector &point)\n+281 {\n+282 int index = 0;\n+283 for(int i = 0; i < dimension; ++i)\n+284 index += Dune::binomial(dimension-i + point[i]-1, dimension-i);\n+285 return index;\n+286 }\n+287\n+292 template\n+_\b2_\b9_\b3 FieldVector _\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn(int m)\n+294 {\n+295 FieldVector perm;\n+296 for(int i = 0; i < n; ++i)\n+297 perm[i] = i;\n+298\n+299 int base = 1;\n+300 for(int i = 1; i <= n; ++i)\n+301 base *= i;\n+302\n+303 for(int i = n; i > 0; --i) {\n+304 base /= i;\n+305 int d = m / base;\n+306 m %= base;\n+307 int t = perm[i-1]; perm[i-1] = perm[i-1-d]; perm[i-1-d] = t;\n+308 }\n+309 return perm;\n+310 }\n+311\n+312 // map between the reference simplex and some arbitrary kuhn simplex\n+(denoted by it's permutation)\n+320 template\n+321 FieldVector\n+_\b3_\b2_\b2 _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn(\n+323 FieldVector point,\n+325 const FieldVector &kuhn)\n+326 {\n+327 for(int i = dimension - 1; i > 0; --i)\n+328 point[kuhn[i-1]] += point[kuhn[i]];\n+329 return point;\n+330 }\n+331\n+339 template\n+340 FieldVector\n+_\b3_\b4_\b1 _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(\n+342 FieldVector point,\n+344 const FieldVector &kuhn)\n+345 {\n+346 for(int i = 0; i < dimension - 1; ++i)\n+347 point[kuhn[i]] -= point[kuhn[i+1]];\n+348 return point;\n+349 }\n+350\n+351\n+353\n+354 // /////////////////////////////////////////\n+355 //\n+356 // refinement implementation for simplices\n+357 //\n+358\n+359 template\n+_\b3_\b6_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+361 {\n+362 public:\n+_\b3_\b6_\b3 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+_\b3_\b6_\b4 typedef CoordType _\bc_\bt_\by_\bp_\be;\n+365\n+366 template\n+367 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b3_\b6_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b3_\b6_\b9 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b3_\b7_\b0 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b3_\b7_\b1 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+372\n+373 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n+374 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+375 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n+376\n+377 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n+378 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n+379 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n+380 };\n+381\n+382 template\n+383 template\n+_\b3_\b8_\b4 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n+385 {\n+386 class SubEntityIterator;\n+387 // We don't need the caching, but the uncached MultiLinearGeometry has bug\n+FS#1209\n+_\b3_\b8_\b8 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+389 };\n+390\n+391 template\n+392 int\n+_\b3_\b9_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+394_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n+395 {\n+396 return Dune::binomial(dimension + nIntervals, (int)dimension);\n+397 }\n+398\n+399 template\n+400 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b4_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+402_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+403 {\n+404 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+405 }\n+406\n+407 template\n+408 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b4_\b0_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+410_\b _\bv_\bE_\bn_\bd(int nIntervals)\n+411 {\n+412 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+413 }\n+414\n+415 template\n+416 int\n+_\b4_\b1_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+418_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n+419 {\n+420 return Dune::power(nIntervals, int(dimension));\n+421 }\n+422\n+423 template\n+424 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b4_\b2_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+426_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n+427 {\n+428 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n+429 }\n+430\n+431 template\n+432 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b4_\b3_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+434_\b _\be_\bE_\bn_\bd(int nIntervals)\n+435 {\n+436 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n+437 }\n+438\n+439 // //////////////\n+440 //\n+441 // The iterator\n+442 //\n+443\n+444 template\n+_\b4_\b4_\b5 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+446\n+447 // vertices\n+448\n+449 template\n+_\b4_\b5_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+451 {\n+452 public:\n+_\b4_\b5_\b3 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b4_\b5_\b4 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b4_\b5_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+_\b4_\b5_\b6 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bT_\bh_\bi_\bs;\n+457\n+458 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+459\n+460 void increment();\n+461 bool equals(const _\bT_\bh_\bi_\bs &other) const;\n+462\n+463 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+464 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n+465\n+466 int index() const;\n+467 protected:\n+_\b4_\b6_\b8 typedef FieldVector _\bV_\be_\br_\bt_\be_\bx;\n+469\n+_\b4_\b7_\b0 int _\bs_\bi_\bz_\be;\n+_\b4_\b7_\b1 _\bV_\be_\br_\bt_\be_\bx _\bv_\be_\br_\bt_\be_\bx;\n+472 };\n+473\n+474 template\n+_\b4_\b7_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+476_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+477 : size(nIntervals)\n+478 {\n+479 vertex[0] = (end) ? size + 1 : 0;\n+480 for(int i = 1; i < dimension; ++ i)\n+481 vertex[i] = 0;\n+482 }\n+483\n+484 template\n+485 void\n+_\b4_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+487_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+488 {\n+489 assert(vertex[0] <= size);\n+490 for(int i = dimension - 1; i >= 0; --i) {\n+491 ++vertex[i];\n+492 if(i == 0 || vertex[i] <= vertex[i-1])\n+493 break;\n+494 else\n+495 vertex[i] = 0;\n+496 }\n+497 }\n+498\n+499 template\n+500 bool\n+_\b5_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+502_\b _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const\n+503 {\n+504 return size == other._\bs_\bi_\bz_\be && vertex == other._\bv_\be_\br_\bt_\be_\bx;\n+505 }\n+506\n+507 template\n+508 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b5_\b0_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+510_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+511 {\n+512 _\bV_\be_\br_\bt_\be_\bx ref = _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(vertex, getPermutation(0));\n+513\n+514 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords;\n+515 for(int i = 0; i < dimension; ++i)\n+516 coords[i] = CoordType(ref[i]) / size;\n+517 return coords;\n+518 }\n+519\n+520 template\n+521 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b5_\b2_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n+const\n+523 {\n+524 std::vector corners(1);\n+525 corners[0] = (_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br)vertex;\n+526 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n+527 }\n+528\n+529 template\n+530 int\n+_\b5_\b3_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+532_\b _\bi_\bn_\bd_\be_\bx() const\n+533 {\n+534 return _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n+535 }\n+536\n+537 // elements\n+538\n+539 template\n+_\b5_\b4_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+541 {\n+542 public:\n+_\b5_\b4_\b3 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b5_\b4_\b4 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+_\b5_\b4_\b5 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b5_\b4_\b6 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+_\b5_\b4_\b7 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> _\bT_\bh_\bi_\bs;\n+548\n+549 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n+550\n+551 void increment();\n+552 bool equals(const _\bT_\bh_\bi_\bs &other) const;\n+553\n+554 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+555 int index() const;\n+556 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+557\n+558 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n+559\n+560 private:\n+561 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n+562\n+563 protected:\n+_\b5_\b6_\b4 typedef FieldVector _\bV_\be_\br_\bt_\be_\bx;\n+_\b5_\b6_\b5 constexpr static int nKuhnIntervals = Dune::factorial(dimension);\n+566\n+_\b5_\b6_\b7 _\bV_\be_\br_\bt_\be_\bx _\bo_\br_\bi_\bg_\bi_\bn;\n+_\b5_\b6_\b8 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n+_\b5_\b6_\b9 int _\bs_\bi_\bz_\be;\n+_\b5_\b7_\b0 int _\bi_\bn_\bd_\be_\bx_\b_;\n+571 };\n+572\n+573 template\n+_\b5_\b7_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+575_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n+576 : kuhnIndex(0), size(nIntervals), index_(0)\n+577 {\n+578 for(int i = 0; i < dimension; ++i)\n+579 origin[i] = 0;\n+580 if(end) {\n+581 index_ = Refinement::nElements(nIntervals);\n+582 origin[0] = size;\n+583 }\n+584 }\n+585\n+586 template\n+587 void\n+_\b5_\b8_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+589_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n+590 {\n+591 assert(origin[0] < size);\n+592\n+593 ++index_;\n+594\n+595 while(1) {\n+596 ++kuhnIndex;\n+597 if(kuhnIndex == nKuhnIntervals) {\n+598 kuhnIndex = 0;\n+599 // increment origin\n+600 for(int i = dimension - 1; i >= 0; --i) {\n+601 ++origin[i];\n+602 if(i == 0 || origin[i] <= origin[i-1])\n+603 break;\n+604 else\n+605 origin[i] = 0;\n+606 }\n+607 }\n+608\n+609 // test whether the current simplex has any corner outside the kuhn0\n+simplex\n+610 FieldVector perm = getPermutation(kuhnIndex);\n+611 _\bV_\be_\br_\bt_\be_\bx corner = origin;\n+612 bool outside = false;\n+613 for(int i = 0; i < dimension; ++i) {\n+614 // next corner\n+615 ++corner[perm[i]];\n+616 if(perm[i] > 0)\n+617 if(corner[perm[i]] > corner[perm[i]-1]) {\n+618 outside = true;\n+619 break;\n+620 }\n+621 }\n+622 if(!outside)\n+623 return;\n+624 }\n+625 }\n+626\n+627 template\n+628 bool\n+_\b6_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+630_\b _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const\n+631 {\n+632 return size == other._\bs_\bi_\bz_\be && index_ == other._\bi_\bn_\bd_\be_\bx_\b_;\n+633 }\n+634\n+635 template\n+636 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b6_\b3_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+638_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+639 {\n+640 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices;\n+641 FieldVector perm = getPermutation(kuhnIndex);\n+642 _\bV_\be_\br_\bt_\be_\bx vertex = origin;\n+643 indices[0] = _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n+644 for(int i = 0; i < dimension; ++i) {\n+645 ++vertex[perm[i]];\n+646 indices[i+1] = _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n+647 }\n+648 if (kuhnIndex%2 == 1)\n+649 for(int i = 0; i < (dimension+1)/2; ++i) {\n+650 int t = indices[i];\n+651 indices[i] = indices[dimension-i];\n+652 indices[dimension-i] = t;\n+653 }\n+654 return indices;\n+655 }\n+656\n+657 template\n+658 int\n+_\b6_\b5_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+660_\b _\bi_\bn_\bd_\be_\bx() const\n+661 {\n+662 return index_;\n+663 }\n+664\n+665 template\n+666 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b6_\b6_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+668_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+669 {\n+670 return global(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n+671 ::simplex().position(0,0));\n+672 }\n+673\n+674 template\n+675 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+_\b6_\b7_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n+677 {\n+678 std::vector corners(dimension+1);\n+679 auto refelem = _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx();\n+680 for(int i = 0; i <= dimension; ++i)\n+681 corners[i] = global(refelem.position(i, dimension));\n+682 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(refelem.type(), corners);\n+683 }\n+684\n+685 template\n+686 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+687 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+688_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const {\n+689 CoordVector v =\n+690 _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn(local, getPermutation(kuhnIndex));\n+691 v += origin;\n+692 v /= (typename CoordVector::value_type)size;\n+693 return _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(v, getPermutation(0));\n+694 }\n+695\n+696 // common\n+697\n+698 template\n+699 template\n+_\b7_\b0_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+701 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+702 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+703 {\n+704 public:\n+_\b7_\b0_\b5 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+706\n+_\b7_\b0_\b7 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n+708 };\n+709\n+710#ifndef DOXYGEN\n+711\n+712 template\n+713 template\n+714 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+715_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n+716 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n+end)\n+717 {}\n+718\n+719#endif\n+720\n+721 } // namespace Simplex\n+722\n+723 } // namespace RefinementImp\n+724\n+725\n+726 namespace RefinementImp {\n+727\n+728 // ///////////////////////\n+729 //\n+730 // The refinement traits\n+731 //\n+732\n+733#ifndef DOXYGEN\n+734 template\n+736 struct Traits<\n+737 topologyId, CoordType, coerceToId, dim,\n+738 typename _\bs_\bt_\bd::enable_if<\n+739 ((GeometryTypes::simplex(dim).id() >> 1) ==\n+740 (topologyId >> 1) &&\n+741 (GeometryTypes::simplex(dim).id() >> 1) ==\n+742 (coerceToId >> 1)\n+743 )>::type\n+744 >\n+745 {\n+746 typedef Simplex::RefinementImp Imp;\n+747 };\n+748#endif\n+749\n+750\n+751 } // namespace RefinementImp\n+752\n+753} // namespace Dune\n+754\n+755#endif //DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n+_\bb_\ba_\bs_\be_\b._\bc_\bc\n+This file contains the parts independent of a particular Refinement\n+implementation.\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\bt_\by_\bp_\be_\b._\bh_\bh\n+A unique label for each type of element that can occur in a grid.\n+_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n+_\bs_\bt_\bd\n+STL namespace.\n+_\bD_\bu_\bn_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx\n+int pointIndex(const FieldVector< int, dimension > &point)\n+calculate the index of a given gridpoint within a Kuhn0 simplex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:280\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n+FieldVector< int, n > getPermutation(int m)\n+Calculate permutation from it's index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n+FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n+dimension > point, const FieldVector< int, dimension > &kuhn)\n+Map from the reference simplex to some Kuhn simplex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be\n+FieldVector< CoordType, dimension > kuhnToReference(FieldVector< CoordType,\n+dimension > point, const FieldVector< int, dimension > &kuhn)\n+Map from some Kuhn simplex to the reference simplex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:341\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Class providing access to the singletons of the reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n+static const ReferenceElement & simplex()\n+get simplex reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:162\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Static tag representing a codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Implement a MultiLinearGeometry with additional caching.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:526\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:368\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< int, dimension+1 > IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:371\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n+CoordType ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:364\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:394\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:418\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:434\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:410\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:370\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:402\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(int nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:426\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:369\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:363\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:385\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Dune::CachedMultiLinearGeometry< CoordType, dimension-codimension, dimension >\n+Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:388\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:445\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:451\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:454\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:453\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bv_\be_\br_\bt_\be_\bx\n+Vertex vertex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:471\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< dimension >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:455\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n+RefinementIteratorSpecial< dimension, CoordType, dimension > This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:456\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n+FieldVector< int, dimension > Vertex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:468\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be\n+int size\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:470\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:541\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n+int kuhnIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:568\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n+FieldVector< int, dimension > Vertex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:564\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bo_\br_\bi_\bg_\bi_\bn\n+Vertex origin\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:567\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n+int index_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:570\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Refinement::template Codim< 0 >::Geometry Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:546\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:544\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:545\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n+RefinementIteratorSpecial< dimension, CoordType, 0 > This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:547\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:543\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be\n+int size\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:569\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(int nIntervals, bool end=false)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:705\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00188.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00188.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: algorithms.hh File Reference\n+dune-geometry: hcube.cc File Reference\n \n \n \n \n \n \n \n@@ -65,41 +65,88 @@\n \n \n \n \n \n \n \n
\n \n-
algorithms.hh File Reference
\n+Classes |\n+Namespaces |\n+Macros
\n+
hcube.cc File Reference
\n \n
\n-
#include <algorithm>
\n-#include <cmath>
\n-#include <limits>
\n-#include <optional>
\n-#include <type_traits>
\n-#include <dune/common/debugstream.hh>
\n-#include <dune/common/fmatrix.hh>
\n-#include <dune/common/ftraits.hh>
\n+\n+

This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.). \n+More...

\n+
#include <cassert>
\n #include <dune/common/fvector.hh>
\n-#include <dune/geometry/affinegeometry.hh>
\n+#include <dune/common/iteratorfacades.hh>
\n+#include <dune/geometry/referenceelements.hh>
\n+#include <dune/geometry/axisalignedcubegeometry.hh>
\n+#include "base.cc"
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

\n+Classes

class  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >
 Refinement implementation for hypercubes More...
 
struct  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, codimension >
 SubEntityIterator base class for hypercube refinement. More...
 
class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >
 
class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >
 
class  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >::Codim< codimension >
 
\n \n \n \n+\n+\n+\n+\n+\n+\n+

\n Namespaces

namespace  Dune
 
namespace  Dune::RefinementImp
 This namespace contains the implementation of Refinement.
 
namespace  Dune::RefinementImp::HCube
 This namespace contains the Refinement implementation for hypercubes (GeometryType::cube).
 
\n+\n+\n+\n

\n+Macros

#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
 
\n+

Detailed Description

\n+

This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.).

\n+

See Refinement implementation for hypercubes.

\n+

Macro Definition Documentation

\n+\n+

◆ DUNE_GEOMETRY_REFINEMENT_HCUBE_CC

\n+\n+
\n+
\n+ \n+ \n+ \n+ \n+
#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
\n+
\n+\n+
\n+
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,60 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-algorithms.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n+hcube.cc File Reference\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes\n+(quadrilaterals, hexahedrons, etc.). _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n #include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n+ _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0 SubEntityIterator base class for hypercube refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n+ _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be\n+\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n+ hypercubes (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be).\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bH_\bC_\bU_\bB_\bE_\b__\bC_\bC\n+\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes\n+(quadrilaterals, hexahedrons, etc.).\n+See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bh_\by_\bp_\be_\br_\bc_\bu_\bb_\be_\bs.\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_H\bHC\bCU\bUB\bBE\bE_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00188_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00188_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: algorithms.hh Source File\n+dune-geometry: hcube.cc Source File\n \n \n \n \n \n \n \n@@ -70,124 +70,478 @@\n
\n \n \n \n \n \n \n
\n-
algorithms.hh
\n+
hcube.cc
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
\n-
6#define DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
\n+
5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
\n+
6#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
\n
7
\n-
8#include <algorithm>
\n-
9#include <cmath>
\n-
10#include <limits>
\n-
11#include <optional>
\n-
12#include <type_traits>
\n-
13
\n-
14#include <dune/common/debugstream.hh>
\n-
15#include <dune/common/fmatrix.hh>
\n-
16#include <dune/common/ftraits.hh>
\n-
17#include <dune/common/fvector.hh>
\n-
18#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
\n-
19
\n-
20namespace Dune {
\n-
21namespace Impl {
\n-
22
\n-
23template <class R = double>
\n-
24struct GaussNewtonOptions
\n-
25{
\n-
27 int maxIt = 100;
\n-
28
\n-
30 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits<R>::epsilon()); }();
\n-
31
\n-
33 int maxInnerIt = 10;
\n-
34
\n-
36 R theta = 0.5;
\n-
37};
\n-
38
\n-
39
\n-
41enum class GaussNewtonErrorCode
\n-
42{
\n-
43 OK = 0, //< A solution is found
\n-
44 JACOBIAN_NOT_INVERTIBLE, //< The Jacobian is not invertible at the current point
\n-
45 STAGNATION, //< No reduction of the residul norm possible
\n-
46 TOLERANCE_NOT_REACHED //< The break tolerance for the resodual norm is not reached
\n-
47};
\n+
41#include <cassert>
\n+
42
\n+
43#include <dune/common/fvector.hh>
\n+
44#include <dune/common/iteratorfacades.hh>
\n+
45
\n+\n+\n
48
\n-
49
\n-
62template <class F, class DF, class Domain,
\n-
63 class Range = std::invoke_result_t<F, Domain>,
\n-
64 class R = typename Dune::FieldTraits<Domain>::real_type>
\n-
65GaussNewtonErrorCode gaussNewton (const F& f, const DF& df, Range y, Domain& x0,
\n-
66 GaussNewtonOptions<R> opts = {})
\n-
67{
\n-
68 Domain x = x0;
\n-
69 Domain dx{};
\n-
70 Range dy = f(x0) - y;
\n-
71 R resNorm0 = dy.two_norm();
\n-
72 R resNorm = 0;
\n-
73
\n-
74 for (int i = 0; i < opts.maxIt; ++i)
\n-
75 {
\n-
76 // Get descent direction dx: (J^T*J)dx = J^T*dy
\n-
77 const bool invertible = FieldMatrixHelper<R>::xTRightInvA(df(x), dy, dx);
\n-
78
\n-
79 // break if jacobian is not invertible
\n-
80 if (!invertible)
\n-
81 return GaussNewtonErrorCode::JACOBIAN_NOT_INVERTIBLE;
\n-
82
\n-
83 // line-search procedure to update x with correction dx
\n-
84 R alpha = 1;
\n-
85 for (int j = 0; j < opts.maxInnerIt; ++j) {
\n-
86 x = x0 - alpha * dx;
\n-
87 dy = f(x) - y;
\n-
88 resNorm = dy.two_norm();
\n-
89
\n-
90 if (resNorm < resNorm0)
\n-
91 break;
\n-
92
\n-
93 alpha *= opts.theta;
\n-
94 }
\n-
95
\n-
96 // cannot reduce the residual
\n-
97 if (!(resNorm < resNorm0))
\n-
98 return GaussNewtonErrorCode::STAGNATION;
\n-
99
\n-
100 x0 = x;
\n-
101 resNorm0 = resNorm;
\n-
102
\n-
103 // break if tolerance is reached.
\n-
104 if (resNorm < opts.absTol)
\n-
105 return GaussNewtonErrorCode::OK;
\n-
106 }
\n-
107
\n-
108 // tolerance could not be reached
\n-
109 if (!(resNorm < opts.absTol))
\n-
110 return GaussNewtonErrorCode::TOLERANCE_NOT_REACHED;
\n-
111
\n-
112 return GaussNewtonErrorCode::OK;
\n-
113}
\n-
114
\n-
115} // end namespace Impl
\n-
116} // end namespace Dune
\n-
117
\n-
118#endif // DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
\n-
An implementation of the Geometry interface for affine geometries.
\n+
49#include "base.cc" // for RefinementTraits
\n+
50
\n+
51namespace Dune
\n+
52{
\n+
53 namespace RefinementImp
\n+
54 {
\n+
\n+
61 namespace HCube
\n+
62 {
\n+
72 template<int dimension_, class CoordType>
\n+
\n+\n+
74 {
\n+
75 public:
\n+
77 constexpr static int dimension = dimension_;
\n+
78 //- Know yourself
\n+\n+
80
\n+
81 template<int codimension>
\n+
82 struct Codim;
\n+\n+
84 typedef FieldVector<CoordType, dimension> CoordVector;
\n+\n+
86 typedef FieldVector<int, (1<<dimension)> IndexVector;
\n+
87
\n+
88 static unsigned nVertices(unsigned nIntervals);
\n+
89 static VertexIterator vBegin(unsigned nIntervals);
\n+
90 static VertexIterator vEnd(unsigned nIntervals);
\n+
91
\n+
92 static unsigned nElements(unsigned nIntervals);
\n+
93 static ElementIterator eBegin(unsigned nIntervals);
\n+
94 static ElementIterator eEnd(unsigned nIntervals);
\n+
95 };
\n+
\n+
96
\n+
97 template<int dimension, class CoordType>
\n+
98 template<int codimension>
\n+
\n+
99 struct RefinementImp<dimension, CoordType>::Codim
\n+
100 {
\n+
101 class SubEntityIterator;
\n+\n+
103 };
\n+
\n+
104
\n+
105 template<int dimension, class CoordType>
\n+
106 unsigned
\n+
\n+\n+
108 nVertices(unsigned nIntervals)
\n+
109 {
\n+
110 // return (nIntervals + 1)^dim
\n+
111 return Dune::power(nIntervals+1u, static_cast<unsigned>(dimension));
\n+
112 }
\n+
\n+
113
\n+
114 template<int dimension, class CoordType>
\n+\n+
\n+\n+
117 vBegin(unsigned nIntervals)
\n+
118 {
\n+
119 return VertexIterator(0,nIntervals);
\n+
120 }
\n+
\n+
121
\n+
122 template<int dimension, class CoordType>
\n+\n+
\n+\n+
125 vEnd(unsigned nIntervals)
\n+
126 {
\n+
127 return VertexIterator(nVertices(nIntervals),nIntervals);
\n+
128 }
\n+
\n+
129
\n+
130 template<int dimension, class CoordType>
\n+
131 unsigned
\n+
\n+\n+
133 nElements(unsigned nIntervals)
\n+
134 {
\n+
135 static_assert(dimension >= 0,
\n+
136 "Negative dimension given, what the heck is that supposed to mean?");
\n+
137 // return nIntervals^dim
\n+
138 return Dune::power(nIntervals, static_cast<unsigned>(dimension));
\n+
139 }
\n+
\n+
140
\n+
141 template<int dimension, class CoordType>
\n+\n+
\n+\n+
144 eBegin(unsigned nIntervals)
\n+
145 {
\n+
146 return ElementIterator(0,nIntervals);
\n+
147 }
\n+
\n+
148
\n+
149 template<int dimension, class CoordType>
\n+\n+
\n+\n+
152 eEnd(unsigned nIntervals)
\n+
153 {
\n+
154 return ElementIterator(nElements(nIntervals),nIntervals);
\n+
155 }
\n+
\n+
156
\n+
157 //
\n+
158 // The iterators
\n+
159 //
\n+
160
\n+
161#ifdef DOXYGEN
\n+
173 template<int dimension, class CoordType, int codimension>
\n+\n+
175#else
\n+
176 template<int dimension, class CoordType, int codimension>
\n+\n+
178#endif //DOXYGEN
\n+
179
\n+
180 // for vertices
\n+
181
\n+
182 template<int dimension, class CoordType>
\n+
\n+
183 class RefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>
\n+
184 {
\n+
185 public:
\n+\n+
187 typedef typename Refinement::template Codim<dimension>::SubEntityIterator Common;
\n+
188 typedef typename Refinement::CoordVector CoordVector;
\n+
189
\n+
190 CoordVector coords() const;
\n+
191
\n+
192 private:
\n+
193 const Common & asCommon() const
\n+
194 {
\n+
195 return *static_cast<const Common*>(this);
\n+
196 }
\n+
197 };
\n+
\n+
198
\n+
199 template<int dimension, class CoordType>
\n+
200 typename RefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>::CoordVector
\n+
\n+\n+
202 coords() const
\n+
203 {
\n+
204 std::array<unsigned int, dimension> v(asCommon().vertexCoord());
\n+
205 CoordVector c;
\n+
206 for (int d = 0; d < dimension; d++)
\n+
207 {
\n+
208 c[d] = v[d]*1.0 / asCommon()._nIntervals;
\n+
209 }
\n+
210 return c;
\n+
211 }
\n+
\n+
212
\n+
213 // for elements
\n+
214
\n+
215 template<int dimension, class CoordType>
\n+
\n+
216 class RefinementSubEntityIteratorSpecial<dimension, CoordType, 0>
\n+
217 {
\n+
218 public:
\n+\n+
220 typedef typename Refinement::template Codim<0>::SubEntityIterator Common;
\n+
221 typedef typename Refinement::IndexVector IndexVector;
\n+
222 typedef typename Refinement::CoordVector CoordVector;
\n+
223
\n+
224 IndexVector vertexIndices() const;
\n+
225 CoordVector coords() const;
\n+
226
\n+
227 private:
\n+
228 const Common & asCommon() const
\n+
229 {
\n+
230 return *static_cast<const Common*>(this);
\n+
231 }
\n+
232 };
\n+
\n+
233
\n+
234 template<int dimension, class CoordType>
\n+
235 typename RefinementSubEntityIteratorSpecial<dimension, CoordType, 0>::IndexVector
\n+
\n+\n+
237 vertexIndices() const
\n+
238 {
\n+
239 constexpr static int nIndices = 1 << dimension;
\n+
240
\n+
241 // cell index tuple
\n+
242 std::array<unsigned int, dimension> e(asCommon().cellCoord());
\n+
243
\n+
244 // vertices
\n+
245 IndexVector vec;
\n+
246 for(int i = 0; i < nIndices; ++i)
\n+
247 {
\n+
248 int base = 1;
\n+
249 std::array<unsigned int, dimension> alpha(asCommon().idx2multiidx(i));
\n+
250 for (int d = 0; d < dimension; d++) {
\n+
251 vec[i] += (alpha[d] + e[d]) * base;
\n+
252 base *= asCommon()._nIntervals+1;
\n+
253 }
\n+
254 }
\n+
255 return vec;
\n+
256 }
\n+
\n+
257
\n+
258 template<int dimension, class CoordType>
\n+\n+
\n+\n+
261 coords() const
\n+
262 {
\n+
263 std::array<unsigned int, dimension> v(asCommon().cellCoord());
\n+
264 CoordVector c;
\n+
265 for (int d=0; d<dimension; d++)
\n+
266 {
\n+
267 c[d] = (v[d]*1.0 + 0.5) / asCommon()._nIntervals;
\n+
268 }
\n+
269 return c;
\n+
270 }
\n+
\n+
271
\n+
272 // common
\n+
273 template<int dimension, class CoordType>
\n+
274 template<int codimension>
\n+
\n+
275 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
\n+
276 : public ForwardIteratorFacade<typename RefinementImp<dimension,
\n+
277 CoordType>::template Codim<codimension>::SubEntityIterator, int>,
\n+
278 public RefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>
\n+
279 {
\n+
280 public:
\n+\n+
282 typedef typename Refinement::template Codim<codimension>::SubEntityIterator This;
\n+
283
\n+
284 SubEntityIterator(unsigned int index, unsigned int nIntervals);
\n+
285
\n+
286 bool equals(const This &other) const;
\n+
287 void increment();
\n+
288
\n+
289 int index() const;
\n+
290 Geometry geometry () const;
\n+
291 private:
\n+
292 friend class RefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>;
\n+
293 unsigned int _index;
\n+
294 unsigned int _nIntervals;
\n+
295
\n+
296 std::array<unsigned int, dimension>
\n+
297 cellCoord(unsigned int idx) const
\n+
298 {
\n+
299 return idx2coord(idx, _nIntervals);
\n+
300 }
\n+
301
\n+
302 std::array<unsigned int, dimension>
\n+
303 vertexCoord(unsigned int idx) const
\n+
304 {
\n+
305 return idx2coord(idx, _nIntervals+1u);
\n+
306 }
\n+
307
\n+
308 std::array<unsigned int, dimension>
\n+
309 cellCoord() const
\n+
310 {
\n+
311 return cellCoord(_index);
\n+
312 }
\n+
313
\n+
314 std::array<unsigned int, dimension>
\n+
315 vertexCoord() const
\n+
316 {
\n+
317 return vertexCoord(_index);
\n+
318 }
\n+
319
\n+
320 std::array<unsigned int, dimension>
\n+
321 idx2coord(unsigned int idx, unsigned int w) const
\n+
322 {
\n+
323 std::array<unsigned int, dimension> c;
\n+
324 for (unsigned int d = 0; d < dimension; d++)
\n+
325 {
\n+
326 c[d] = idx%w;
\n+
327 idx = idx/w;
\n+
328 }
\n+
329 return c;
\n+
330 }
\n+
331
\n+
332 unsigned int
\n+
333 coord2idx(std::array<unsigned int, dimension> c, unsigned int w) const
\n+
334 {
\n+
335 unsigned int i = 0;
\n+
336 for (unsigned int d = dimension; d > 0; d--)
\n+
337 {
\n+
338 i *= w;
\n+
339 i += c[d-1];
\n+
340 }
\n+
341 return i;
\n+
342 }
\n+
343
\n+
344 std::array<unsigned int, dimension>
\n+
345 idx2multiidx(unsigned int idx) const
\n+
346 {
\n+
347 std::array<unsigned int, dimension> alpha;
\n+
348 for (unsigned int i = 0; i < dimension; ++i)
\n+
349 alpha[i] = (idx >> i) & 1u;
\n+
350 return alpha;
\n+
351 }
\n+
352 };
\n+
\n+
353
\n+
354#ifndef DOXYGEN
\n+
355 template<int dimension, class CoordType>
\n+
356 template<int codimension>
\n+
357 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
\n+
358 SubEntityIterator(unsigned int index, unsigned int nIntervals)
\n+
359 : _index(index), _nIntervals(nIntervals)
\n+
360 {}
\n+
361
\n+
362 template<int dimension, class CoordType>
\n+
363 template<int codimension>
\n+
364 bool
\n+
365 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
\n+
366 equals(const This &other) const
\n+
367 {
\n+
368 return ((_index == other._index) && (_nIntervals == other._nIntervals));
\n+
369 }
\n+
370
\n+
371 template<int dimension, class CoordType>
\n+
372 template<int codimension>
\n+
373 void
\n+
374 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
\n+
375 increment()
\n+
376 {
\n+
377 ++_index;
\n+
378 }
\n+
379
\n+
380 template<int dimension, class CoordType>
\n+
381 template<int codimension>
\n+
382 int
\n+
383 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
\n+
384 index() const
\n+
385 {
\n+
386 return _index;
\n+
387 }
\n+
388
\n+
389 template<int dimension, class CoordType>
\n+
390 template<int codimension>
\n+
391 typename RefinementImp<dimension, CoordType>::template Codim<codimension>::Geometry
\n+
392 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::geometry () const
\n+
393 {
\n+
394 std::array<unsigned int,dimension> intCoords = idx2coord(_index,_nIntervals);
\n+
395
\n+
396 Dune::FieldVector<CoordType,dimension> lower;
\n+
397 Dune::FieldVector<CoordType,dimension> upper;
\n+
398
\n+
399 assert(codimension == 0 or codimension == dimension);
\n+
400
\n+
401 if constexpr (codimension == 0) {
\n+
402 for (size_t j = 0; j < dimension; j++)
\n+
403 {
\n+
404 lower[j] = double(intCoords[j]) / double(_nIntervals);
\n+
405 upper[j] = double(intCoords[j] + 1) / double(_nIntervals);
\n+
406 }
\n+
407
\n+
408 return typename RefinementImp<dimension,
\n+
409 CoordType>::template Codim<codimension>::Geometry(lower,upper);
\n+
410 } else {
\n+
411 for (size_t j = 0; j < dimension; j++)
\n+
412 lower[j] = upper[j] = double(intCoords[j]) / double(_nIntervals);
\n+
413
\n+
414 return typename RefinementImp<dimension,
\n+
415 CoordType>::template Codim<codimension>::Geometry(lower,upper,std::bitset<dimension>(0));
\n+
416 }
\n+
417 }
\n+
418
\n+
419#endif // DOXYGEN
\n+
420
\n+
421 } // namespace HCube
\n+
\n+
422
\n+
423 // ///////////////////////
\n+
424 //
\n+
425 // The refinement traits
\n+
426 //
\n+
427
\n+
428#ifndef DOXYGEN
\n+
429 template<unsigned topologyId, class CoordType, unsigned coerceToId,
\n+
430 int dim>
\n+
431 struct Traits<
\n+
432 topologyId, CoordType, coerceToId, dim,
\n+
433 typename std::enable_if<
\n+
434 (dim >= 2 &&
\n+
435 (GeometryTypes::cube(dim).id() >> 1) ==
\n+
436 (topologyId >> 1) &&
\n+
437 (GeometryTypes::cube(dim).id() >> 1) ==
\n+
438 (coerceToId >> 1)
\n+
439 )>::type
\n+
440 >
\n+
441 {
\n+
442 typedef HCube::RefinementImp<dim, CoordType> Imp;
\n+
443 };
\n+
444#endif
\n+
445
\n+
446 } // namespace RefinementImp
\n+
447
\n+
448} // namespace Dune
\n+
449
\n+
450#endif // DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
\n+
This file contains the parts independent of a particular Refinement implementation.
\n+\n+
A geometry implementation for axis-aligned hypercubes.
\n+
STL namespace.
\n
Definition affinegeometry.hh:21
\n+
A geometry implementation for axis-aligned hypercubes.
Definition axisalignedcubegeometry.hh:50
\n+
Static tag representing a codimension.
Definition dimension.hh:24
\n+
Refinement implementation for hypercubes
Definition hcube.cc:74
\n+
Codim< 0 >::SubEntityIterator ElementIterator
Definition hcube.cc:85
\n+
static ElementIterator eEnd(unsigned nIntervals)
Definition hcube.cc:152
\n+
static unsigned nVertices(unsigned nIntervals)
Definition hcube.cc:108
\n+
static VertexIterator vEnd(unsigned nIntervals)
Definition hcube.cc:125
\n+
FieldVector< int,(1<< dimension)> IndexVector
Definition hcube.cc:86
\n+
Codim< dimension >::SubEntityIterator VertexIterator
Definition hcube.cc:83
\n+
FieldVector< CoordType, dimension > CoordVector
Definition hcube.cc:84
\n+
static unsigned nElements(unsigned nIntervals)
Definition hcube.cc:133
\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcube.cc:79
\n+
static ElementIterator eBegin(unsigned nIntervals)
Definition hcube.cc:144
\n+
static constexpr int dimension
Know your own dimension.
Definition hcube.cc:77
\n+
static VertexIterator vBegin(unsigned nIntervals)
Definition hcube.cc:117
\n+\n+
Dune::AxisAlignedCubeGeometry< CoordType, dimension-codimension, dimension > Geometry
Definition hcube.cc:102
\n+
SubEntityIterator base class for hypercube refinement.
Definition hcube.cc:174
\n+\n+
Refinement::template Codim< dimension >::SubEntityIterator Common
Definition hcube.cc:187
\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcube.cc:219
\n+
Refinement::template Codim< 0 >::SubEntityIterator Common
Definition hcube.cc:220
\n+\n+\n+
SubEntityIterator(unsigned int index, unsigned int nIntervals)
\n+\n+\n+
RefinementImp< dimension, CoordType > Refinement
Definition hcube.cc:281
\n+\n+\n+
Refinement::template Codim< codimension >::SubEntityIterator This
Definition hcube.cc:282
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,121 +1,529 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-algorithms.hh\n+ * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+hcube.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n-6#define DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n+_\b6#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n 7\n-8#include \n-9#include \n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17#include \n-18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh> // for FieldMatrixHelper\n-19\n-20namespace _\bD_\bu_\bn_\be {\n-21namespace Impl {\n-22\n-23template \n-24struct GaussNewtonOptions\n-25{\n-27 int maxIt = 100;\n-28\n-30 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits::epsilon\n-()); }();\n-31\n-33 int maxInnerIt = 10;\n-34\n-36 R theta = 0.5;\n-37};\n-38\n-39\n-41enum class GaussNewtonErrorCode\n-42{\n-43 OK = 0, //< A solution is found\n-44 JACOBIAN_NOT_INVERTIBLE, //< The Jacobian is not invertible at the current\n-point\n-45 STAGNATION, //< No reduction of the residul norm possible\n-46 TOLERANCE_NOT_REACHED //< The break tolerance for the resodual norm is not\n-reached\n-47};\n+41#include \n+42\n+43#include \n+44#include \n+45\n+46#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+47#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n 48\n-49\n-62template ,\n-64 class R = typename Dune::FieldTraits::real_type>\n-65GaussNewtonErrorCode gaussNewton (const F& f, const DF& df, Range y, Domain&\n-x0,\n-66 GaussNewtonOptions opts = {})\n-67{\n-68 Domain x = x0;\n-69 Domain dx{};\n-70 Range dy = f(x0) - y;\n-71 R resNorm0 = dy.two_norm();\n-72 R resNorm = 0;\n-73\n-74 for (int i = 0; i < opts.maxIt; ++i)\n-75 {\n-76 // Get descent direction dx: (J^T*J)dx = J^T*dy\n-77 const bool invertible = FieldMatrixHelper::xTRightInvA(df(x), dy, dx);\n-78\n-79 // break if jacobian is not invertible\n-80 if (!invertible)\n-81 return GaussNewtonErrorCode::JACOBIAN_NOT_INVERTIBLE;\n-82\n-83 // line-search procedure to update x with correction dx\n-84 R alpha = 1;\n-85 for (int j = 0; j < opts.maxInnerIt; ++j) {\n-86 x = x0 - alpha * dx;\n-87 dy = f(x) - y;\n-88 resNorm = dy.two_norm();\n-89\n-90 if (resNorm < resNorm0)\n-91 break;\n-92\n-93 alpha *= opts.theta;\n-94 }\n-95\n-96 // cannot reduce the residual\n-97 if (!(resNorm < resNorm0))\n-98 return GaussNewtonErrorCode::STAGNATION;\n-99\n-100 x0 = x;\n-101 resNorm0 = resNorm;\n-102\n-103 // break if tolerance is reached.\n-104 if (resNorm < opts.absTol)\n-105 return GaussNewtonErrorCode::OK;\n-106 }\n-107\n-108 // tolerance could not be reached\n-109 if (!(resNorm < opts.absTol))\n-110 return GaussNewtonErrorCode::TOLERANCE_NOT_REACHED;\n-111\n-112 return GaussNewtonErrorCode::OK;\n-113}\n-114\n-115} // end namespace Impl\n-116} // end namespace Dune\n-117\n-118#endif // DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n-_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n-An implementation of the Geometry interface for affine geometries.\n+49#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\" // for RefinementTraits\n+50\n+51namespace _\bD_\bu_\bn_\be\n+52{\n+53 namespace RefinementImp\n+54 {\n+_\b6_\b1 namespace HCube\n+62 {\n+72 template\n+_\b7_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+74 {\n+75 public:\n+_\b7_\b7 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+78 //- Know yourself\n+_\b7_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+80\n+81 template\n+82 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b8_\b3 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b8_\b4 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b8_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b8_\b6 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+87\n+88 static unsigned _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(unsigned nIntervals);\n+89 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(unsigned nIntervals);\n+90 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(unsigned nIntervals);\n+91\n+92 static unsigned _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(unsigned nIntervals);\n+93 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(unsigned nIntervals);\n+94 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(unsigned nIntervals);\n+95 };\n+96\n+97 template\n+98 template\n+_\b9_\b9 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n+100 {\n+101 class SubEntityIterator;\n+_\b1_\b0_\b2 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+103 };\n+104\n+105 template\n+106 unsigned\n+_\b1_\b0_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+108_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(unsigned nIntervals)\n+109 {\n+110 // return (nIntervals + 1)^dim\n+111 return Dune::power(nIntervals+1u, static_cast(dimension));\n+112 }\n+113\n+114 template\n+115 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+117_\b _\bv_\bB_\be_\bg_\bi_\bn(unsigned nIntervals)\n+118 {\n+119 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(0,nIntervals);\n+120 }\n+121\n+122 template\n+123 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+125_\b _\bv_\bE_\bn_\bd(unsigned nIntervals)\n+126 {\n+127 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nVertices(nIntervals),nIntervals);\n+128 }\n+129\n+130 template\n+131 unsigned\n+_\b1_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+133_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(unsigned nIntervals)\n+134 {\n+135 static_assert(dimension >= 0,\n+136 \"Negative dimension given, what the heck is that supposed to mean?\");\n+137 // return nIntervals^dim\n+138 return Dune::power(nIntervals, static_cast(dimension));\n+139 }\n+140\n+141 template\n+142 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b4_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+144_\b _\be_\bB_\be_\bg_\bi_\bn(unsigned nIntervals)\n+145 {\n+146 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(0,nIntervals);\n+147 }\n+148\n+149 template\n+150 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b1_\b5_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+152_\b _\be_\bE_\bn_\bd(unsigned nIntervals)\n+153 {\n+154 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nElements(nIntervals),nIntervals);\n+155 }\n+156\n+157 //\n+158 // The iterators\n+159 //\n+160\n+161#ifdef DOXYGEN\n+173 template\n+_\b1_\b7_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl {};\n+175#else\n+176 template\n+177 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+178#endif //DOXYGEN\n+179\n+180 // for vertices\n+181\n+182 template\n+_\b1_\b8_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+184 {\n+185 public:\n+_\b1_\b8_\b6 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b8_\b7 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bC_\bo_\bm_\bm_\bo_\bn;\n+_\b1_\b8_\b8 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+189\n+190 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+191\n+192 private:\n+193 const _\bC_\bo_\bm_\bm_\bo_\bn & asCommon() const\n+194 {\n+195 return *static_cast(this);\n+196 }\n+197 };\n+198\n+199 template\n+200 typename RefinementSubEntityIteratorSpecial::CoordVector\n+_\b2_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+202_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+203 {\n+204 std::array v(asCommon().vertexCoord());\n+205 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br c;\n+206 for (int d = 0; d < dimension; d++)\n+207 {\n+208 c[d] = v[d]*1.0 / asCommon()._nIntervals;\n+209 }\n+210 return c;\n+211 }\n+212\n+213 // for elements\n+214\n+215 template\n+_\b2_\b1_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+217 {\n+218 public:\n+_\b2_\b1_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b2_\b0 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bC_\bo_\bm_\bm_\bo_\bn;\n+_\b2_\b2_\b1 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+_\b2_\b2_\b2 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+223\n+224 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+225 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+226\n+227 private:\n+228 const _\bC_\bo_\bm_\bm_\bo_\bn & asCommon() const\n+229 {\n+230 return *static_cast(this);\n+231 }\n+232 };\n+233\n+234 template\n+235 typename RefinementSubEntityIteratorSpecial::\n+IndexVector\n+_\b2_\b3_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+237_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+238 {\n+239 constexpr static int nIndices = 1 << dimension;\n+240\n+241 // cell index tuple\n+242 std::array e(asCommon().cellCoord());\n+243\n+244 // vertices\n+245 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vec;\n+246 for(int i = 0; i < nIndices; ++i)\n+247 {\n+248 int base = 1;\n+249 std::array alpha(asCommon().idx2multiidx(i));\n+250 for (int d = 0; d < dimension; d++) {\n+251 vec[i] += (alpha[d] + e[d]) * base;\n+252 base *= asCommon()._nIntervals+1;\n+253 }\n+254 }\n+255 return vec;\n+256 }\n+257\n+258 template\n+259 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b2_\b6_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+261_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+262 {\n+263 std::array v(asCommon().cellCoord());\n+264 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br c;\n+265 for (int d=0; d\n+274 template\n+_\b2_\b7_\b5 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+276 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+278 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+279 {\n+280 public:\n+_\b2_\b8_\b1 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b8_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bT_\bh_\bi_\bs;\n+283\n+_\b2_\b8_\b4 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(unsigned int index, unsigned int nIntervals);\n+285\n+_\b2_\b8_\b6 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n+_\b2_\b8_\b7 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt();\n+288\n+_\b2_\b8_\b9 int _\bi_\bn_\bd_\be_\bx() const;\n+_\b2_\b9_\b0 Geometry _\bg_\be_\bo_\bm_\be_\bt_\br_\by () const;\n+291 private:\n+292 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType,\n+codimension>;\n+293 unsigned int _index;\n+294 unsigned int _nIntervals;\n+295\n+296 std::array\n+297 cellCoord(unsigned int idx) const\n+298 {\n+299 return idx2coord(idx, _nIntervals);\n+300 }\n+301\n+302 std::array\n+303 vertexCoord(unsigned int idx) const\n+304 {\n+305 return idx2coord(idx, _nIntervals+1u);\n+306 }\n+307\n+308 std::array\n+309 cellCoord() const\n+310 {\n+311 return cellCoord(_index);\n+312 }\n+313\n+314 std::array\n+315 vertexCoord() const\n+316 {\n+317 return vertexCoord(_index);\n+318 }\n+319\n+320 std::array\n+321 idx2coord(unsigned int idx, unsigned int w) const\n+322 {\n+323 std::array c;\n+324 for (unsigned int d = 0; d < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; d++)\n+325 {\n+326 c[d] = idx%w;\n+327 idx = idx/w;\n+328 }\n+329 return c;\n+330 }\n+331\n+332 unsigned int\n+333 coord2idx(std::array c, unsigned int w) const\n+334 {\n+335 unsigned int i = 0;\n+336 for (unsigned int d = _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; d > 0; d--)\n+337 {\n+338 i *= w;\n+339 i += c[d-1];\n+340 }\n+341 return i;\n+342 }\n+343\n+344 std::array\n+345 idx2multiidx(unsigned int idx) const\n+346 {\n+347 std::array alpha;\n+348 for (unsigned int i = 0; i < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; ++i)\n+349 alpha[i] = (idx >> i) & 1u;\n+350 return alpha;\n+351 }\n+352 };\n+353\n+354#ifndef DOXYGEN\n+355 template\n+356 template\n+357 RefinementImp::Codim::\n+SubEntityIterator::\n+358 SubEntityIterator(unsigned int index, unsigned int nIntervals)\n+359 : _index(index), _nIntervals(nIntervals)\n+360 {}\n+361\n+362 template\n+363 template\n+364 bool\n+365 RefinementImp::Codim::\n+SubEntityIterator::\n+366 equals(const This &other) const\n+367 {\n+368 return ((_index == other._index) && (_nIntervals == other._nIntervals));\n+369 }\n+370\n+371 template\n+372 template\n+373 void\n+374 RefinementImp::Codim::\n+SubEntityIterator::\n+375 increment()\n+376 {\n+377 ++_index;\n+378 }\n+379\n+380 template\n+381 template\n+382 int\n+383 RefinementImp::Codim::\n+SubEntityIterator::\n+384 index() const\n+385 {\n+386 return _index;\n+387 }\n+388\n+389 template\n+390 template\n+391 typename RefinementImp::template Codim::\n+Geometry\n+392 RefinementImp::Codim::\n+SubEntityIterator::geometry () const\n+393 {\n+394 std::array intCoords = idx2coord\n+(_index,_nIntervals);\n+395\n+396 Dune::FieldVector lower;\n+397 Dune::FieldVector upper;\n+398\n+399 assert(codimension == 0 or codimension == _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n+400\n+401 if constexpr (codimension == 0) {\n+402 for (size_t j = 0; j < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; j++)\n+403 {\n+404 lower[j] = double(intCoords[j]) / double(_nIntervals);\n+405 upper[j] = double(intCoords[j] + 1) / double(_nIntervals);\n+406 }\n+407\n+408 return typename RefinementImp<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn,\n+409 CoordType>::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by(lower,upper);\n+410 } else {\n+411 for (size_t j = 0; j < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; j++)\n+412 lower[j] = upper[j] = double(intCoords[j]) / double(_nIntervals);\n+413\n+414 return typename RefinementImp<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn,\n+415 CoordType>::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by(lower,upper,std::\n+bitset(0));\n+416 }\n+417 }\n+418\n+419#endif // DOXYGEN\n+420\n+421 } // namespace HCube\n+422\n+423 // ///////////////////////\n+424 //\n+425 // The refinement traits\n+426 //\n+427\n+428#ifndef DOXYGEN\n+429 template\n+431 struct Traits<\n+432 topologyId, CoordType, coerceToId, dim,\n+433 typename _\bs_\bt_\bd::enable_if<\n+434 (dim >= 2 &&\n+435 (GeometryTypes::cube(dim).id() >> 1) ==\n+436 (topologyId >> 1) &&\n+437 (GeometryTypes::cube(dim).id() >> 1) ==\n+438 (coerceToId >> 1)\n+439 )>::type\n+440 >\n+441 {\n+442 typedef HCube::RefinementImp Imp;\n+443 };\n+444#endif\n+445\n+446 } // namespace RefinementImp\n+447\n+448} // namespace Dune\n+449\n+450#endif // DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n+_\bb_\ba_\bs_\be_\b._\bc_\bc\n+This file contains the parts independent of a particular Refinement\n+implementation.\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n+A geometry implementation for axis-aligned hypercubes.\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+A geometry implementation for axis-aligned hypercubes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Static tag representing a codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+Refinement implementation for hypercubes\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:74\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:152\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static unsigned nVertices(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:108\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:125\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< int,(1<< dimension)> IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:86\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:84\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static unsigned nElements(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:133\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:144\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+Know your own dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(unsigned nIntervals)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:117\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:100\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Dune::AxisAlignedCubeGeometry< CoordType, dimension-codimension, dimension >\n+Geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:102\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+SubEntityIterator base class for hypercube refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:174\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:188\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n+Refinement::template Codim< dimension >::SubEntityIterator Common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:187\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:186\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:219\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n+Refinement::template Codim< 0 >::SubEntityIterator Common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:220\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:222\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:221\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(unsigned int index, unsigned int nIntervals)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const This &other) const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n+Geometry geometry() const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+RefinementImp< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:281\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+int index() const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n+void increment()\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n+Refinement::template Codim< codimension >::SubEntityIterator This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:282\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00191.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00191.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: typefromvertexcount.hh File Reference\n+dune-geometry: referenceelementimplementation.hh File Reference\n \n \n \n \n \n \n \n@@ -65,38 +65,49 @@\n \n \n \n \n \n \n \n
\n \n-
typefromvertexcount.hh File Reference
\n+Namespaces
\n+
referenceelementimplementation.hh File Reference
\n \n
\n-
#include <dune/geometry/type.hh>
\n+
#include <cassert>
\n+#include <algorithm>
\n+#include <limits>
\n+#include <tuple>
\n+#include <utility>
\n+#include <vector>
\n+#include <array>
\n+#include <bitset>
\n+#include <dune/common/fmatrix.hh>
\n+#include <dune/common/fvector.hh>
\n+#include <dune/common/hybridutilities.hh>
\n+#include <dune/common/typetraits.hh>
\n+#include <dune/common/iteratorrange.hh>
\n+#include <dune/common/math.hh>
\n+#include <dune/geometry/referenceelement.hh>
\n+#include <dune/geometry/affinegeometry.hh>
\n+#include <dune/geometry/type.hh>
\n
\n

Go to the source code of this file.

\n \n \n \n \n-

\n Namespaces

namespace  Dune
 
\n-\n-\n-\n-\n+\n+\n

\n-Functions

GeometryType Dune::geometryTypeFromVertexCount (unsigned int dim, unsigned int vertices)
 Utility function to construct the correct geometry type given the dimension and the number of vertices.
 
namespace  Dune::Geo
 
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,22 +1,33 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-typefromvertexcount.hh File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+referenceelementimplementation.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt (unsigned int dim, unsigned int\n- vertices)\n-\u00a0 Utility function to construct the correct geometry type given the\n- dimension and the number of vertices.\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00191_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00191_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: typefromvertexcount.hh Source File\n+dune-geometry: referenceelementimplementation.hh Source File\n \n \n \n \n \n \n \n@@ -70,77 +70,728 @@\n
\n \n \n \n \n \n \n
\n-
typefromvertexcount.hh
\n+
referenceelementimplementation.hh
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
\n-
6#define DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
\n+
5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
\n+
6#define DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
\n
7
\n-\n+
8#include <cassert>
\n
9
\n-
10namespace Dune {
\n-
11
\n-
16 inline
\n-
\n-
17 GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int vertices)
\n-
18 {
\n-
19 switch (dim)
\n-
20 {
\n-
21 case 0 :
\n-
22 return GeometryTypes::vertex;
\n-
23 case 1 :
\n-
24 return GeometryTypes::line;
\n-
25 case 2 :
\n-
26 switch (vertices) {
\n-
27 case 3 :
\n-
28 return GeometryTypes::triangle;
\n-
29 case 4 :
\n-
30 return GeometryTypes::quadrilateral;
\n-
31 default :
\n-
32 DUNE_THROW(NotImplemented, "2d elements with " << vertices << " corners are not supported!");
\n-
33 }
\n-
34 case 3 :
\n-
35 switch (vertices) {
\n-
36 case 4 :
\n-
37 return GeometryTypes::tetrahedron;
\n-
38 case 5 :
\n-
39 return GeometryTypes::pyramid;
\n-
40 case 6 :
\n-
41 return GeometryTypes::prism;
\n-
42 case 8 :
\n-
43 return GeometryTypes::hexahedron;
\n-
44 default :
\n-
45 DUNE_THROW(NotImplemented, "3d elements with " << vertices << " corners are not supported!");
\n-
46 }
\n-
47 default :
\n-
48 DUNE_THROW(NotImplemented, "geometryTypeFromVertexCount works only up to dim=3");
\n-
49 }
\n-
50 }
\n-
\n-
51
\n-
52}
\n+
10#include <algorithm>
\n+
11#include <limits>
\n+
12#include <tuple>
\n+
13#include <utility>
\n+
14#include <vector>
\n+
15#include <array>
\n+
16#include <bitset>
\n+
17
\n+
18#include <dune/common/fmatrix.hh>
\n+
19#include <dune/common/fvector.hh>
\n+
20#include <dune/common/hybridutilities.hh>
\n+
21#include <dune/common/typetraits.hh>
\n+
22#include <dune/common/iteratorrange.hh>
\n+
23#include <dune/common/math.hh>
\n+
24
\n+\n+\n+
27#include <dune/geometry/type.hh>
\n+
28
\n+
29namespace Dune
\n+
30{
\n+
31
\n+
32 namespace Geo
\n+
33 {
\n+
34
\n+
35#ifndef DOXYGEN
\n+
36
\n+
37 // Internal Forward Declarations
\n+
38 // -----------------------------
\n+
39
\n+
40 namespace Impl
\n+
41 {
\n+
42 template< class ctype, int dim >
\n+
43 class ReferenceElementContainer;
\n+
44 }
\n+
45
\n+
46 template< class ctype, int dim >
\n+
47 struct ReferenceElements;
\n+
48
\n+
49
\n+
50
\n+
51 namespace Impl
\n+
52 {
\n
53
\n-
54#endif // DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
\n-
A unique label for each type of element that can occur in a grid.
\n+
54 using Dune::Impl::isPrism;
\n+
55 using Dune::Impl::isPyramid;
\n+
56 using Dune::Impl::baseTopologyId;
\n+
57 using Dune::Impl::prismConstruction;
\n+
58 using Dune::Impl::pyramidConstruction;
\n+
59 using Dune::Impl::numTopologies;
\n+
60
\n+
62 unsigned int size ( unsigned int topologyId, int dim, int codim );
\n+
63
\n+
64
\n+
65
\n+
73 unsigned int subTopologyId ( unsigned int topologyId, int dim, int codim, unsigned int i );
\n+
74
\n+
75
\n+
76
\n+
77 // subTopologyNumbering
\n+
78 // --------------------
\n+
79
\n+
80 void subTopologyNumbering ( unsigned int topologyId, int dim, int codim, unsigned int i, int subcodim,
\n+
81 unsigned int *beginOut, unsigned int *endOut );
\n+
82
\n+
83
\n+
84
\n+
85
\n+
86 // checkInside
\n+
87 // -----------
\n+
88
\n+
89 template< class ct, int cdim >
\n+
90 inline bool
\n+
91 checkInside ( unsigned int topologyId, int dim, const FieldVector< ct, cdim > &x, ct tolerance, ct factor = ct( 1 ) )
\n+
92 {
\n+
93 assert( (dim >= 0) && (dim <= cdim) );
\n+
94 assert( topologyId < numTopologies( dim ) );
\n+
95
\n+
96 if( dim > 0 )
\n+
97 {
\n+
98 const ct baseFactor = (isPrism( topologyId, dim ) ? factor : factor - x[ dim-1 ]);
\n+
99 if( (x[ dim-1 ] > -tolerance) && (factor - x[ dim-1 ] > -tolerance) )
\n+
100 return checkInside< ct, cdim >( baseTopologyId( topologyId, dim ), dim-1, x, tolerance, baseFactor );
\n+
101 else
\n+
102 return false;
\n+
103 }
\n+
104 else
\n+
105 return true;
\n+
106 }
\n+
107
\n+
108
\n+
109
\n+
110 // referenceCorners
\n+
111 // ----------------
\n+
112
\n+
113 template< class ct, int cdim >
\n+
114 inline unsigned int
\n+
115 referenceCorners ( unsigned int topologyId, int dim, FieldVector< ct, cdim > *corners )
\n+
116 {
\n+
117 assert( (dim >= 0) && (dim <= cdim) );
\n+
118 assert( topologyId < numTopologies( dim ) );
\n+
119
\n+
120 if( dim > 0 )
\n+
121 {
\n+
122 const unsigned int nBaseCorners
\n+
123 = referenceCorners( baseTopologyId( topologyId, dim ), dim-1, corners );
\n+
124 assert( nBaseCorners == size( baseTopologyId( topologyId, dim ), dim-1, dim-1 ) );
\n+
125 if( isPrism( topologyId, dim ) )
\n+
126 {
\n+
127 std::copy( corners, corners + nBaseCorners, corners + nBaseCorners );
\n+
128 for( unsigned int i = 0; i < nBaseCorners; ++i )
\n+
129 corners[ i+nBaseCorners ][ dim-1 ] = ct( 1 );
\n+
130 return 2*nBaseCorners;
\n+
131 }
\n+
132 else
\n+
133 {
\n+
134 corners[ nBaseCorners ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
135 corners[ nBaseCorners ][ dim-1 ] = ct( 1 );
\n+
136 return nBaseCorners+1;
\n+
137 }
\n+
138 }
\n+
139 else
\n+
140 {
\n+
141 *corners = FieldVector< ct, cdim >( ct( 0 ) );
\n+
142 return 1;
\n+
143 }
\n+
144 }
\n+
145
\n+
146
\n+
147
\n+
148 // referenceVolume
\n+
149 // ---------------
\n+
150
\n+
151 unsigned long referenceVolumeInverse ( unsigned int topologyId, int dim );
\n+
152
\n+
153 template< class ct >
\n+
154 inline ct referenceVolume ( unsigned int topologyId, int dim )
\n+
155 {
\n+
156 return ct( 1 ) / ct( referenceVolumeInverse( topologyId, dim ) );
\n+
157 }
\n+
158
\n+
159
\n+
160
\n+
161 // referenceOrigins
\n+
162 // ----------------
\n+
163
\n+
164 template< class ct, int cdim >
\n+
165 inline unsigned int
\n+
166 referenceOrigins ( unsigned int topologyId, int dim, int codim, FieldVector< ct, cdim > *origins )
\n+
167 {
\n+
168 assert( (dim >= 0) && (dim <= cdim) );
\n+
169 assert( topologyId < numTopologies( dim ) );
\n+
170 assert( (codim >= 0) && (codim <= dim) );
\n+
171
\n+
172 if( codim > 0 )
\n+
173 {
\n+
174 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
175 if( isPrism( topologyId, dim ) )
\n+
176 {
\n+
177 const unsigned int n = (codim < dim ? referenceOrigins( baseId, dim-1, codim, origins ) : 0);
\n+
178 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins+n );
\n+
179 for( unsigned int i = 0; i < m; ++i )
\n+
180 {
\n+
181 origins[ n+m+i ] = origins[ n+i ];
\n+
182 origins[ n+m+i ][ dim-1 ] = ct( 1 );
\n+
183 }
\n+
184 return n+2*m;
\n+
185 }
\n+
186 else
\n+
187 {
\n+
188 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins );
\n+
189 if( codim == dim )
\n+
190 {
\n+
191 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
192 origins[ m ][ dim-1 ] = ct( 1 );
\n+
193 return m+1;
\n+
194 }
\n+
195 else
\n+
196 return m+referenceOrigins( baseId, dim-1, codim, origins+m );
\n+
197 }
\n+
198 }
\n+
199 else
\n+
200 {
\n+
201 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
202 return 1;
\n+
203 }
\n+
204 }
\n+
205
\n+
206
\n+
207
\n+
208 // referenceEmbeddings
\n+
209 // -------------------
\n+
210
\n+
211 template< class ct, int cdim, int mydim >
\n+
212 inline unsigned int
\n+
213 referenceEmbeddings ( unsigned int topologyId, int dim, int codim,
\n+
214 FieldVector< ct, cdim > *origins,
\n+
215 FieldMatrix< ct, mydim, cdim > *jacobianTransposeds )
\n+
216 {
\n+
217 assert( (0 <= codim) && (codim <= dim) && (dim <= cdim) );
\n+
218 assert( (dim - codim <= mydim) && (mydim <= cdim) );
\n+
219 assert( topologyId < numTopologies( dim ) );
\n+
220
\n+
221 if( (0 < codim) && (codim <= dim) )
\n+
222 {
\n+
223 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
224 if( isPrism( topologyId, dim ) )
\n+
225 {
\n+
226 const unsigned int n = (codim < dim ? referenceEmbeddings( baseId, dim-1, codim, origins, jacobianTransposeds ) : 0);
\n+
227 for( unsigned int i = 0; i < n; ++i )
\n+
228 jacobianTransposeds[ i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
\n+
229
\n+
230 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins+n, jacobianTransposeds+n );
\n+
231 std::copy( origins+n, origins+n+m, origins+n+m );
\n+
232 std::copy( jacobianTransposeds+n, jacobianTransposeds+n+m, jacobianTransposeds+n+m );
\n+
233 for( unsigned int i = 0; i < m; ++i )
\n+
234 origins[ n+m+i ][ dim-1 ] = ct( 1 );
\n+
235
\n+
236 return n+2*m;
\n+
237 }
\n+
238 else // !isPrism
\n+
239 {
\n+
240 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins, jacobianTransposeds );
\n+
241 if( codim == dim )
\n+
242 {
\n+
243 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
244 origins[ m ][ dim-1 ] = ct( 1 );
\n+
245 jacobianTransposeds[ m ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
\n+
246 return m+1;
\n+
247 }
\n+
248 else if( codim < dim )
\n+
249 {
\n+
250 const unsigned int n = referenceEmbeddings( baseId, dim-1, codim, origins+m, jacobianTransposeds+m );
\n+
251 for( unsigned int i = 0; i < n; ++i )
\n+
252 {
\n+
253 for( int k = 0; k < dim-1; ++k )
\n+
254 jacobianTransposeds[ m+i ][ dim-codim-1 ][ k ] = -origins[ m+i ][ k ];
\n+
255 jacobianTransposeds[ m+i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
\n+
256 }
\n+
257 return m+n;
\n+
258 }
\n+
259 }
\n+
260 }
\n+
261 else if( codim == 0 )
\n+
262 {
\n+
263 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
264 jacobianTransposeds[ 0 ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
\n+
265 for( int k = 0; k < dim; ++k )
\n+
266 jacobianTransposeds[ 0 ][ k ][ k ] = ct( 1 );
\n+
267 return 1;
\n+
268 }
\n+
269
\n+
270 // this point should not be reached since all cases are handled before.
\n+
271 std::abort();
\n+
272 return 0;
\n+
273 }
\n+
274
\n+
275
\n+
276
\n+
277 // referenceIntegrationOuterNormals
\n+
278 // --------------------------------
\n+
279
\n+
280 template< class ct, int cdim >
\n+
281 inline unsigned int
\n+
282 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,
\n+
283 const FieldVector< ct, cdim > *origins,
\n+
284 FieldVector< ct, cdim > *normals )
\n+
285 {
\n+
286 assert( (dim > 0) && (dim <= cdim) );
\n+
287 assert( topologyId < numTopologies( dim ) );
\n+
288
\n+
289 if( dim > 1 )
\n+
290 {
\n+
291 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
292 if( isPrism( topologyId, dim ) )
\n+
293 {
\n+
294 const unsigned int numBaseFaces
\n+
295 = referenceIntegrationOuterNormals( baseId, dim-1, origins, normals );
\n+
296
\n+
297 for( unsigned int i = 0; i < 2; ++i )
\n+
298 {
\n+
299 normals[ numBaseFaces+i ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
300 normals[ numBaseFaces+i ][ dim-1 ] = ct( 2*int( i )-1 );
\n+
301 }
\n+
302
\n+
303 return numBaseFaces+2;
\n+
304 }
\n+
305 else
\n+
306 {
\n+
307 normals[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
308 normals[ 0 ][ dim-1 ] = ct( -1 );
\n+
309
\n+
310 const unsigned int numBaseFaces
\n+
311 = referenceIntegrationOuterNormals( baseId, dim-1, origins+1, normals+1 );
\n+
312 for( unsigned int i = 1; i <= numBaseFaces; ++i )
\n+
313 normals[ i ][ dim-1 ] = normals[ i ]*origins[ i ];
\n+
314
\n+
315 return numBaseFaces+1;
\n+
316 }
\n+
317 }
\n+
318 else
\n+
319 {
\n+
320 for( unsigned int i = 0; i < 2; ++i )
\n+
321 {
\n+
322 normals[ i ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
323 normals[ i ][ 0 ] = ct( 2*int( i )-1 );
\n+
324 }
\n+
325
\n+
326 return 2;
\n+
327 }
\n+
328 }
\n+
329
\n+
330 template< class ct, int cdim >
\n+
331 inline unsigned int
\n+
332 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,
\n+
333 FieldVector< ct, cdim > *normals )
\n+
334 {
\n+
335 assert( (dim > 0) && (dim <= cdim) );
\n+
336
\n+
337 FieldVector< ct, cdim > *origins
\n+
338 = new FieldVector< ct, cdim >[ size( topologyId, dim, 1 ) ];
\n+
339 referenceOrigins( topologyId, dim, 1, origins );
\n+
340
\n+
341 const unsigned int numFaces
\n+
342 = referenceIntegrationOuterNormals( topologyId, dim, origins, normals );
\n+
343 assert( numFaces == size( topologyId, dim, 1 ) );
\n+
344
\n+
345 delete[] origins;
\n+
346
\n+
347 return numFaces;
\n+
348 }
\n+
349
\n+
350 } // namespace Impl
\n+
351
\n+
352
\n+
353
\n+
354 // ReferenceElement
\n+
355 // ----------------
\n+
356
\n+
375 template< class ctype_, int dim >
\n+
376 class ReferenceElementImplementation
\n+
377 {
\n+
378
\n+
379 public:
\n+
380
\n+
382 using ctype = ctype_;
\n+
383
\n+
385 using CoordinateField = ctype;
\n+
386
\n+
388 using Coordinate = Dune::FieldVector<ctype,dim>;
\n+
389
\n+
391 static constexpr int dimension = dim;
\n+
392
\n+
394 typedef ctype Volume;
\n+
395
\n+
396 private:
\n+
397
\n+
398 friend class Impl::ReferenceElementContainer< ctype, dim >;
\n+
399
\n+
400 struct SubEntityInfo;
\n+
401
\n+
402 template< int codim > struct CreateGeometries;
\n+
403
\n+
404 public:
\n+
406 template< int codim >
\n+
407 struct Codim
\n+
408 {
\n+
410 typedef AffineGeometry< ctype, dim-codim, dim > Geometry;
\n+
411 };
\n+
412
\n+
413 // ReferenceElement cannot be copied.
\n+
414 ReferenceElementImplementation ( const ReferenceElementImplementation& ) = delete;
\n+
415
\n+
416 // ReferenceElementImplementation cannot be copied.
\n+
417 ReferenceElementImplementation& operator= ( const ReferenceElementImplementation& ) = delete;
\n+
418
\n+
419 // ReferenceElementImplementation is default-constructible (required for storage in std::array)
\n+
420 ReferenceElementImplementation () = default;
\n+
421
\n+
426 int size ( int c ) const
\n+
427 {
\n+
428 assert( (c >= 0) && (c <= dim) );
\n+
429 return info_[ c ].size();
\n+
430 }
\n+
431
\n+
443 int size ( int i, int c, int cc ) const
\n+
444 {
\n+
445 assert( (i >= 0) && (i < size( c )) );
\n+
446 return info_[ c ][ i ].size( cc );
\n+
447 }
\n+
448
\n+
462 int subEntity ( int i, int c, int ii, int cc ) const
\n+
463 {
\n+
464 assert( (i >= 0) && (i < size( c )) );
\n+
465 return info_[ c ][ i ].number( ii, cc );
\n+
466 }
\n+
467
\n+
483 auto subEntities ( int i, int c, int cc ) const
\n+
484 {
\n+
485 assert( (i >= 0) && (i < size( c )) );
\n+
486 return info_[ c ][ i ].numbers( cc );
\n+
487 }
\n+
488
\n+
497 const GeometryType &type ( int i, int c ) const
\n+
498 {
\n+
499 assert( (i >= 0) && (i < size( c )) );
\n+
500 return info_[ c ][ i ].type();
\n+
501 }
\n+
502
\n+
504 const GeometryType &type () const { return type( 0, 0 ); }
\n+
505
\n+
515 const Coordinate &position( int i, int c ) const
\n+
516 {
\n+
517 assert( (c >= 0) && (c <= dim) );
\n+
518 return baryCenters_[ c ][ i ];
\n+
519 }
\n+
520
\n+
528 bool checkInside ( const Coordinate &local ) const
\n+
529 {
\n+
530 const ctype tolerance = ctype( 64 ) * std::numeric_limits< ctype >::epsilon();
\n+
531 return Impl::template checkInside< ctype, dim >( type().id(), dim, local, tolerance );
\n+
532 }
\n+
533
\n+
545 template< int codim >
\n+
546 typename Codim< codim >::Geometry geometry ( int i ) const
\n+
547 {
\n+
548 return std::get< codim >( geometries_ )[ i ];
\n+
549 }
\n+
550
\n+
552 Volume volume () const
\n+
553 {
\n+
554 return volume_;
\n+
555 }
\n+
556
\n+
564 const Coordinate &integrationOuterNormal ( int face ) const
\n+
565 {
\n+
566 assert( (face >= 0) && (face < int( integrationNormals_.size() )) );
\n+
567 return integrationNormals_[ face ];
\n+
568 }
\n+
569
\n+
570 private:
\n+
571 void initialize ( unsigned int topologyId )
\n+
572 {
\n+
573 assert( topologyId < Impl::numTopologies( dim ) );
\n+
574
\n+
575 // set up subentities
\n+
576 for( int codim = 0; codim <= dim; ++codim )
\n+
577 {
\n+
578 const unsigned int size = Impl::size( topologyId, dim, codim );
\n+
579 info_[ codim ].resize( size );
\n+
580 for( unsigned int i = 0; i < size; ++i )
\n+
581 info_[ codim ][ i ].initialize( topologyId, codim, i );
\n+
582 }
\n+
583
\n+
584 // compute corners
\n+
585 const unsigned int numVertices = size( dim );
\n+
586 baryCenters_[ dim ].resize( numVertices );
\n+
587 Impl::referenceCorners( topologyId, dim, &(baryCenters_[ dim ][ 0 ]) );
\n+
588
\n+
589 // compute barycenters
\n+
590 for( int codim = 0; codim < dim; ++codim )
\n+
591 {
\n+
592 baryCenters_[ codim ].resize( size(codim) );
\n+
593 for( int i = 0; i < size( codim ); ++i )
\n+
594 {
\n+
595 baryCenters_[ codim ][ i ] = Coordinate( ctype( 0 ) );
\n+
596 const unsigned int numCorners = size( i, codim, dim );
\n+
597 for( unsigned int j = 0; j < numCorners; ++j )
\n+
598 baryCenters_[ codim ][ i ] += baryCenters_[ dim ][ subEntity( i, codim, j, dim ) ];
\n+
599 baryCenters_[ codim ][ i ] *= ctype( 1 ) / ctype( numCorners );
\n+
600 }
\n+
601 }
\n+
602
\n+
603 // compute reference element volume
\n+
604 volume_ = Impl::template referenceVolume< ctype >( topologyId, dim );
\n+
605
\n+
606 // compute integration outer normals
\n+
607 if( dim > 0 )
\n+
608 {
\n+
609 integrationNormals_.resize( size( 1 ) );
\n+
610 Impl::referenceIntegrationOuterNormals( topologyId, dim, &(integrationNormals_[ 0 ]) );
\n+
611 }
\n+
612
\n+
613 // set up geometries
\n+
614 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ]( auto i ){ CreateGeometries< i >::apply( *this, geometries_ ); } );
\n+
615 }
\n+
616
\n+
617 template< int... codim >
\n+
618 static std::tuple< std::vector< typename Codim< codim >::Geometry >... >
\n+
619 makeGeometryTable ( std::integer_sequence< int, codim... > );
\n+
620
\n+
622 typedef decltype( makeGeometryTable( std::make_integer_sequence< int, dim+1 >() ) ) GeometryTable;
\n+
623
\n+
625 ctype volume_;
\n+
626
\n+
627 std::vector< Coordinate > baryCenters_[ dim+1 ];
\n+
628 std::vector< Coordinate > integrationNormals_;
\n+
629
\n+
631 GeometryTable geometries_;
\n+
632
\n+
633 std::vector< SubEntityInfo > info_[ dim+1 ];
\n+
634 };
\n+
635
\n+
637 template< class ctype, int dim >
\n+
638 struct ReferenceElementImplementation< ctype, dim >::SubEntityInfo
\n+
639 {
\n+
640 // Compute upper bound for the number of subsentities.
\n+
641 // If someone knows an explicit formal feel free to
\n+
642 // implement it here.
\n+
643 static constexpr std::size_t maxSubEntityCount()
\n+
644 {
\n+
645 std::size_t maxCount=0;
\n+
646 for(std::size_t codim=0; codim<=dim; ++codim)
\n+
647 maxCount = std::max(maxCount, binomial(std::size_t(dim),codim)*(1 << codim));
\n+
648 return maxCount;
\n+
649 }
\n+
650
\n+
651 using SubEntityFlags = std::bitset<maxSubEntityCount()>;
\n+
652
\n+
653 class SubEntityRange
\n+
654 : public Dune::IteratorRange<const unsigned int*>
\n+
655 {
\n+
656 using Base = typename Dune::IteratorRange<const unsigned int*>;
\n+
657
\n+
658 public:
\n+
659
\n+
660 using iterator = Base::iterator;
\n+
661 using const_iterator = Base::const_iterator;
\n+
662
\n+
663 SubEntityRange(const iterator& begin, const iterator& end, const SubEntityFlags& contains) :
\n+
664 Base(begin, end),
\n+
665 containsPtr_(&contains),
\n+
666 size_(end-begin)
\n+
667 {}
\n+
668
\n+
669 SubEntityRange() :
\n+
670 Base(),
\n+
671 containsPtr_(nullptr),
\n+
672 size_(0)
\n+
673 {}
\n+
674
\n+
675 std::size_t size() const
\n+
676 {
\n+
677 return size_;
\n+
678 }
\n+
679
\n+
680 bool contains(std::size_t i) const
\n+
681 {
\n+
682 return (*containsPtr_)[i];
\n+
683 }
\n+
684
\n+
685 private:
\n+
686 const SubEntityFlags* containsPtr_;
\n+
687 std::size_t size_;
\n+
688 std::size_t offset_;
\n+
689 };
\n+
690
\n+
691 using NumberRange = typename Dune::IteratorRange<const unsigned int*>;
\n+
692
\n+
693 SubEntityInfo ()
\n+
694 : numbering_( nullptr )
\n+
695 {
\n+
696 std::fill( offset_.begin(), offset_.end(), 0 );
\n+
697 }
\n+
698
\n+
699 SubEntityInfo ( const SubEntityInfo &other )
\n+
700 : offset_( other.offset_ ),
\n+
701 type_( other.type_ ),
\n+
702 containsSubentity_( other.containsSubentity_ )
\n+
703 {
\n+
704 numbering_ = allocate();
\n+
705 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
\n+
706 }
\n+
707
\n+
708 ~SubEntityInfo () { deallocate( numbering_ ); }
\n+
709
\n+
710 const SubEntityInfo &operator= ( const SubEntityInfo &other )
\n+
711 {
\n+
712 type_ = other.type_;
\n+
713 offset_ = other.offset_;
\n+
714
\n+
715 deallocate( numbering_ );
\n+
716 numbering_ = allocate();
\n+
717 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
\n+
718
\n+
719 containsSubentity_ = other.containsSubentity_;
\n+
720
\n+
721 return *this;
\n+
722 }
\n+
723
\n+
724 int size ( int cc ) const
\n+
725 {
\n+
726 assert( (cc >= 0) && (cc <= dim) );
\n+
727 return (offset_[ cc+1 ] - offset_[ cc ]);
\n+
728 }
\n+
729
\n+
730 int number ( int ii, int cc ) const
\n+
731 {
\n+
732 assert( (ii >= 0) && (ii < size( cc )) );
\n+
733 return numbering_[ offset_[ cc ] + ii ];
\n+
734 }
\n+
735
\n+
736 auto numbers ( int cc ) const
\n+
737 {
\n+
738 return SubEntityRange( numbering_ + offset_[ cc ], numbering_ + offset_[ cc+1 ], containsSubentity_[cc]);
\n+
739 }
\n+
740
\n+
741 const GeometryType &type () const { return type_; }
\n+
742
\n+
743 void initialize ( unsigned int topologyId, int codim, unsigned int i )
\n+
744 {
\n+
745 const unsigned int subId = Impl::subTopologyId( topologyId, dim, codim, i );
\n+
746 type_ = GeometryType( subId, dim-codim );
\n+
747
\n+
748 // compute offsets
\n+
749 for( int cc = 0; cc <= codim; ++cc )
\n+
750 offset_[ cc ] = 0;
\n+
751 for( int cc = codim; cc <= dim; ++cc )
\n+
752 offset_[ cc+1 ] = offset_[ cc ] + Impl::size( subId, dim-codim, cc-codim );
\n+
753
\n+
754 // compute subnumbering
\n+
755 deallocate( numbering_ );
\n+
756 numbering_ = allocate();
\n+
757 for( int cc = codim; cc <= dim; ++cc )
\n+
758 Impl::subTopologyNumbering( topologyId, dim, codim, i, cc-codim, numbering_+offset_[ cc ], numbering_+offset_[ cc+1 ] );
\n+
759
\n+
760 // initialize containsSubentity lookup-table
\n+
761 for(std::size_t cc=0; cc<= dim; ++cc)
\n+
762 {
\n+
763 containsSubentity_[cc].reset();
\n+
764 for(std::size_t idx=0; idx<std::size_t(size(cc)); ++idx)
\n+
765 containsSubentity_[cc][number(idx,cc)] = true;
\n+
766 }
\n+
767 }
\n+
768
\n+
769 protected:
\n+
770 int codim () const { return dim - type().dim(); }
\n+
771
\n+
772 unsigned int *allocate () { return (capacity() != 0 ? new unsigned int[ capacity() ] : nullptr); }
\n+
773 void deallocate ( unsigned int *ptr ) { delete[] ptr; }
\n+
774 unsigned int capacity () const { return offset_[ dim+1 ]; }
\n+
775
\n+
776 private:
\n+
777 unsigned int *numbering_;
\n+
778 std::array< unsigned int, dim+2 > offset_;
\n+
779 GeometryType type_;
\n+
780 std::array< SubEntityFlags, dim+1> containsSubentity_;
\n+
781 };
\n+
782
\n+
783
\n+
784 template< class ctype, int dim >
\n+
785 template< int codim >
\n+
786 struct ReferenceElementImplementation< ctype, dim >::CreateGeometries
\n+
787 {
\n+
788 template< int cc >
\n+
789 static typename ReferenceElements< ctype, dim-cc >::ReferenceElement
\n+
790 subRefElement( const ReferenceElementImplementation< ctype, dim > &refElement, int i, std::integral_constant< int, cc > )
\n+
791 {
\n+
792 return ReferenceElements< ctype, dim-cc >::general( refElement.type( i, cc ) );
\n+
793 }
\n+
794
\n+\n+
796 subRefElement(const ReferenceElementImplementation< ctype, dim > &refElement,
\n+
797 [[maybe_unused]] int i, std::integral_constant<int, 0>)
\n+
798 {
\n+
799 return refElement;
\n+
800 }
\n+
801
\n+
802 static void apply ( const ReferenceElementImplementation< ctype, dim > &refElement, GeometryTable &geometries )
\n+
803 {
\n+
804 const int size = refElement.size( codim );
\n+
805 std::vector< FieldVector< ctype, dim > > origins( size );
\n+
806 std::vector< FieldMatrix< ctype, dim - codim, dim > > jacobianTransposeds( size );
\n+
807 Impl::referenceEmbeddings( refElement.type().id(), dim, codim, &(origins[ 0 ]), &(jacobianTransposeds[ 0 ]) );
\n+
808
\n+
809 std::get< codim >( geometries ).reserve( size );
\n+
810 for( int i = 0; i < size; ++i )
\n+
811 {
\n+
812 typename Codim< codim >::Geometry geometry( subRefElement( refElement, i, std::integral_constant< int, codim >() ), origins[ i ], jacobianTransposeds[ i ] );
\n+
813 std::get< codim >( geometries ).push_back( geometry );
\n+
814 }
\n+
815 }
\n+
816 };
\n+
817
\n+
818#endif // DOXYGEN
\n+
819
\n+
820 } // namespace Geo
\n+
821
\n+
822} // namespace Dune
\n+
823
\n+
824#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
\n+
An implementation of the Geometry interface for affine geometries.
\n+
A unique label for each type of element that can occur in a grid.
\n+\n
Definition affinegeometry.hh:21
\n-
GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int vertices)
Utility function to construct the correct geometry type given the dimension and the number of vertice...
Definition typefromvertexcount.hh:17
\n-
Unique label for each type of entities that can occur in DUNE grids.
Definition type.hh:114
\n+
@ size
Definition quadraturerules.hh:194
\n+
typename Container::ReferenceElement ReferenceElement
The reference element type.
Definition referenceelements.hh:146
\n+
static const ReferenceElement & general(const GeometryType &type)
get general reference elements
Definition referenceelements.hh:156
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,79 +1,767 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n-typefromvertexcount.hh\n+referenceelementimplementation.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n-6#define DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n+5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n+6#define DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n 7\n-8#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+8#include \n 9\n-10namespace _\bD_\bu_\bn_\be {\n-11\n-16 inline\n-_\b1_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt(unsigned int dim, unsigned int\n-vertices)\n-18 {\n-19 switch (dim)\n-20 {\n-21 case 0 :\n-22 return GeometryTypes::vertex;\n-23 case 1 :\n-24 return GeometryTypes::line;\n-25 case 2 :\n-26 switch (vertices) {\n-27 case 3 :\n-28 return GeometryTypes::triangle;\n-29 case 4 :\n-30 return GeometryTypes::quadrilateral;\n-31 default :\n-32 DUNE_THROW(NotImplemented, \"2d elements with \" << vertices << \" corners are\n-not supported!\");\n-33 }\n-34 case 3 :\n-35 switch (vertices) {\n-36 case 4 :\n-37 return GeometryTypes::tetrahedron;\n-38 case 5 :\n-39 return GeometryTypes::pyramid;\n-40 case 6 :\n-41 return GeometryTypes::prism;\n-42 case 8 :\n-43 return GeometryTypes::hexahedron;\n-44 default :\n-45 DUNE_THROW(NotImplemented, \"3d elements with \" << vertices << \" corners are\n-not supported!\");\n-46 }\n-47 default :\n-48 DUNE_THROW(NotImplemented, \"geometryTypeFromVertexCount works only up to\n-dim=3\");\n-49 }\n-50 }\n-51\n-52}\n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15#include \n+16#include \n+17\n+18#include \n+19#include \n+20#include \n+21#include \n+22#include \n+23#include \n+24\n+25#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n+26#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+27#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+28\n+29namespace _\bD_\bu_\bn_\be\n+30{\n+31\n+32 namespace Geo\n+33 {\n+34\n+35#ifndef DOXYGEN\n+36\n+37 // Internal Forward Declarations\n+38 // -----------------------------\n+39\n+40 namespace Impl\n+41 {\n+42 template< class ctype, int dim >\n+43 class ReferenceElementContainer;\n+44 }\n+45\n+46 template< class ctype, int dim >\n+47 struct ReferenceElements;\n+48\n+49\n+50\n+51 namespace Impl\n+52 {\n 53\n-54#endif // DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n+54 using Dune::Impl::isPrism;\n+55 using Dune::Impl::isPyramid;\n+56 using Dune::Impl::baseTopologyId;\n+57 using Dune::Impl::prismConstruction;\n+58 using Dune::Impl::pyramidConstruction;\n+59 using Dune::Impl::numTopologies;\n+60\n+62 unsigned int _\bs_\bi_\bz_\be ( unsigned int topologyId, int dim, int codim );\n+63\n+64\n+65\n+73 unsigned int subTopologyId ( unsigned int topologyId, int dim, int codim,\n+unsigned int i );\n+74\n+75\n+76\n+77 // subTopologyNumbering\n+78 // --------------------\n+79\n+80 void subTopologyNumbering ( unsigned int topologyId, int dim, int codim,\n+unsigned int i, int subcodim,\n+81 unsigned int *beginOut, unsigned int *endOut );\n+82\n+83\n+84\n+85\n+86 // checkInside\n+87 // -----------\n+88\n+89 template< class ct, int cdim >\n+90 inline bool\n+91 checkInside ( unsigned int topologyId, int dim, const FieldVector< ct, cdim\n+> &x, ct tolerance, ct factor = ct( 1 ) )\n+92 {\n+93 assert( (dim >= 0) && (dim <= cdim) );\n+94 assert( topologyId < numTopologies( dim ) );\n+95\n+96 if( dim > 0 )\n+97 {\n+98 const ct baseFactor = (isPrism( topologyId, dim ) ? factor : factor - x\n+[ dim-1 ]);\n+99 if( (x[ dim-1 ] > -tolerance) && (factor - x[ dim-1 ] > -tolerance) )\n+100 return checkInside< ct, cdim >( baseTopologyId( topologyId, dim ), dim-1,\n+x, tolerance, baseFactor );\n+101 else\n+102 return false;\n+103 }\n+104 else\n+105 return true;\n+106 }\n+107\n+108\n+109\n+110 // referenceCorners\n+111 // ----------------\n+112\n+113 template< class ct, int cdim >\n+114 inline unsigned int\n+115 referenceCorners ( unsigned int topologyId, int dim, FieldVector< ct, cdim\n+> *corners )\n+116 {\n+117 assert( (dim >= 0) && (dim <= cdim) );\n+118 assert( topologyId < numTopologies( dim ) );\n+119\n+120 if( dim > 0 )\n+121 {\n+122 const unsigned int nBaseCorners\n+123 = referenceCorners( baseTopologyId( topologyId, dim ), dim-1, corners );\n+124 assert( nBaseCorners == _\bs_\bi_\bz_\be( baseTopologyId( topologyId, dim ), dim-1,\n+dim-1 ) );\n+125 if( isPrism( topologyId, dim ) )\n+126 {\n+127 std::copy( corners, corners + nBaseCorners, corners + nBaseCorners );\n+128 for( unsigned int i = 0; i < nBaseCorners; ++i )\n+129 corners[ i+nBaseCorners ][ dim-1 ] = ct( 1 );\n+130 return 2*nBaseCorners;\n+131 }\n+132 else\n+133 {\n+134 corners[ nBaseCorners ] = FieldVector< ct, cdim >( ct( 0 ) );\n+135 corners[ nBaseCorners ][ dim-1 ] = ct( 1 );\n+136 return nBaseCorners+1;\n+137 }\n+138 }\n+139 else\n+140 {\n+141 *corners = FieldVector< ct, cdim >( ct( 0 ) );\n+142 return 1;\n+143 }\n+144 }\n+145\n+146\n+147\n+148 // referenceVolume\n+149 // ---------------\n+150\n+151 unsigned long referenceVolumeInverse ( unsigned int topologyId, int dim );\n+152\n+153 template< class ct >\n+154 inline ct referenceVolume ( unsigned int topologyId, int dim )\n+155 {\n+156 return ct( 1 ) / ct( referenceVolumeInverse( topologyId, dim ) );\n+157 }\n+158\n+159\n+160\n+161 // referenceOrigins\n+162 // ----------------\n+163\n+164 template< class ct, int cdim >\n+165 inline unsigned int\n+166 referenceOrigins ( unsigned int topologyId, int dim, int codim,\n+FieldVector< ct, cdim > *origins )\n+167 {\n+168 assert( (dim >= 0) && (dim <= cdim) );\n+169 assert( topologyId < numTopologies( dim ) );\n+170 assert( (codim >= 0) && (codim <= dim) );\n+171\n+172 if( codim > 0 )\n+173 {\n+174 const unsigned int baseId = baseTopologyId( topologyId, dim );\n+175 if( isPrism( topologyId, dim ) )\n+176 {\n+177 const unsigned int n = (codim < dim ? referenceOrigins( baseId, dim-1,\n+codim, origins ) : 0);\n+178 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins+n\n+);\n+179 for( unsigned int i = 0; i < m; ++i )\n+180 {\n+181 origins[ n+m+i ] = origins[ n+i ];\n+182 origins[ n+m+i ][ dim-1 ] = ct( 1 );\n+183 }\n+184 return n+2*m;\n+185 }\n+186 else\n+187 {\n+188 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins );\n+189 if( codim == dim )\n+190 {\n+191 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );\n+192 origins[ m ][ dim-1 ] = ct( 1 );\n+193 return m+1;\n+194 }\n+195 else\n+196 return m+referenceOrigins( baseId, dim-1, codim, origins+m );\n+197 }\n+198 }\n+199 else\n+200 {\n+201 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n+202 return 1;\n+203 }\n+204 }\n+205\n+206\n+207\n+208 // referenceEmbeddings\n+209 // -------------------\n+210\n+211 template< class ct, int cdim, int mydim >\n+212 inline unsigned int\n+213 referenceEmbeddings ( unsigned int topologyId, int dim, int codim,\n+214 FieldVector< ct, cdim > *origins,\n+215 FieldMatrix< ct, mydim, cdim > *jacobianTransposeds )\n+216 {\n+217 assert( (0 <= codim) && (codim <= dim) && (dim <= cdim) );\n+218 assert( (dim - codim <= mydim) && (mydim <= cdim) );\n+219 assert( topologyId < numTopologies( dim ) );\n+220\n+221 if( (0 < codim) && (codim <= dim) )\n+222 {\n+223 const unsigned int baseId = baseTopologyId( topologyId, dim );\n+224 if( isPrism( topologyId, dim ) )\n+225 {\n+226 const unsigned int n = (codim < dim ? referenceEmbeddings( baseId, dim-1,\n+codim, origins, jacobianTransposeds ) : 0);\n+227 for( unsigned int i = 0; i < n; ++i )\n+228 jacobianTransposeds[ i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );\n+229\n+230 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1,\n+origins+n, jacobianTransposeds+n );\n+231 std::copy( origins+n, origins+n+m, origins+n+m );\n+232 std::copy( jacobianTransposeds+n, jacobianTransposeds+n+m,\n+jacobianTransposeds+n+m );\n+233 for( unsigned int i = 0; i < m; ++i )\n+234 origins[ n+m+i ][ dim-1 ] = ct( 1 );\n+235\n+236 return n+2*m;\n+237 }\n+238 else // !isPrism\n+239 {\n+240 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1,\n+origins, jacobianTransposeds );\n+241 if( codim == dim )\n+242 {\n+243 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );\n+244 origins[ m ][ dim-1 ] = ct( 1 );\n+245 jacobianTransposeds[ m ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );\n+246 return m+1;\n+247 }\n+248 else if( codim < dim )\n+249 {\n+250 const unsigned int n = referenceEmbeddings( baseId, dim-1, codim,\n+origins+m, jacobianTransposeds+m );\n+251 for( unsigned int i = 0; i < n; ++i )\n+252 {\n+253 for( int k = 0; k < dim-1; ++k )\n+254 jacobianTransposeds[ m+i ][ dim-codim-1 ][ k ] = -origins[ m+i ][ k ];\n+255 jacobianTransposeds[ m+i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );\n+256 }\n+257 return m+n;\n+258 }\n+259 }\n+260 }\n+261 else if( codim == 0 )\n+262 {\n+263 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n+264 jacobianTransposeds[ 0 ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );\n+265 for( int k = 0; k < dim; ++k )\n+266 jacobianTransposeds[ 0 ][ k ][ k ] = ct( 1 );\n+267 return 1;\n+268 }\n+269\n+270 // this point should not be reached since all cases are handled before.\n+271 std::abort();\n+272 return 0;\n+273 }\n+274\n+275\n+276\n+277 // referenceIntegrationOuterNormals\n+278 // --------------------------------\n+279\n+280 template< class ct, int cdim >\n+281 inline unsigned int\n+282 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,\n+283 const FieldVector< ct, cdim > *origins,\n+284 FieldVector< ct, cdim > *normals )\n+285 {\n+286 assert( (dim > 0) && (dim <= cdim) );\n+287 assert( topologyId < numTopologies( dim ) );\n+288\n+289 if( dim > 1 )\n+290 {\n+291 const unsigned int baseId = baseTopologyId( topologyId, dim );\n+292 if( isPrism( topologyId, dim ) )\n+293 {\n+294 const unsigned int numBaseFaces\n+295 = referenceIntegrationOuterNormals( baseId, dim-1, origins, normals );\n+296\n+297 for( unsigned int i = 0; i < 2; ++i )\n+298 {\n+299 normals[ numBaseFaces+i ] = FieldVector< ct, cdim >( ct( 0 ) );\n+300 normals[ numBaseFaces+i ][ dim-1 ] = ct( 2*int( i )-1 );\n+301 }\n+302\n+303 return numBaseFaces+2;\n+304 }\n+305 else\n+306 {\n+307 normals[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n+308 normals[ 0 ][ dim-1 ] = ct( -1 );\n+309\n+310 const unsigned int numBaseFaces\n+311 = referenceIntegrationOuterNormals( baseId, dim-1, origins+1, normals+1 );\n+312 for( unsigned int i = 1; i <= numBaseFaces; ++i )\n+313 normals[ i ][ dim-1 ] = normals[ i ]*origins[ i ];\n+314\n+315 return numBaseFaces+1;\n+316 }\n+317 }\n+318 else\n+319 {\n+320 for( unsigned int i = 0; i < 2; ++i )\n+321 {\n+322 normals[ i ] = FieldVector< ct, cdim >( ct( 0 ) );\n+323 normals[ i ][ 0 ] = ct( 2*int( i )-1 );\n+324 }\n+325\n+326 return 2;\n+327 }\n+328 }\n+329\n+330 template< class ct, int cdim >\n+331 inline unsigned int\n+332 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,\n+333 FieldVector< ct, cdim > *normals )\n+334 {\n+335 assert( (dim > 0) && (dim <= cdim) );\n+336\n+337 FieldVector< ct, cdim > *origins\n+338 = new FieldVector< ct, cdim >[ _\bs_\bi_\bz_\be( topologyId, dim, 1 ) ];\n+339 referenceOrigins( topologyId, dim, 1, origins );\n+340\n+341 const unsigned int numFaces\n+342 = referenceIntegrationOuterNormals( topologyId, dim, origins, normals );\n+343 assert( numFaces == _\bs_\bi_\bz_\be( topologyId, dim, 1 ) );\n+344\n+345 delete[] origins;\n+346\n+347 return numFaces;\n+348 }\n+349\n+350 } // namespace Impl\n+351\n+352\n+353\n+354 // ReferenceElement\n+355 // ----------------\n+356\n+375 template< class ctype_, int dim >\n+376 class ReferenceElementImplementation\n+377 {\n+378\n+379 public:\n+380\n+382 using ctype = ctype_;\n+383\n+385 using CoordinateField = ctype;\n+386\n+388 using Coordinate = Dune::FieldVector;\n+389\n+391 static constexpr int dimension = dim;\n+392\n+394 typedef ctype Volume;\n+395\n+396 private:\n+397\n+398 friend class Impl::ReferenceElementContainer< ctype, dim >;\n+399\n+400 struct SubEntityInfo;\n+401\n+402 template< int codim > struct CreateGeometries;\n+403\n+404 public:\n+406 template< int codim >\n+407 struct Codim\n+408 {\n+410 typedef AffineGeometry< ctype, dim-codim, dim > Geometry;\n+411 };\n+412\n+413 // ReferenceElement cannot be copied.\n+414 ReferenceElementImplementation ( const ReferenceElementImplementation& ) =\n+delete;\n+415\n+416 // ReferenceElementImplementation cannot be copied.\n+417 ReferenceElementImplementation& operator= ( const\n+ReferenceElementImplementation& ) = delete;\n+418\n+419 // ReferenceElementImplementation is default-constructible (required for\n+storage in std::array)\n+420 ReferenceElementImplementation () = default;\n+421\n+426 int _\bs_\bi_\bz_\be ( int c ) const\n+427 {\n+428 assert( (c >= 0) && (c <= dim) );\n+429 return info_[ c ].size();\n+430 }\n+431\n+443 int _\bs_\bi_\bz_\be ( int i, int c, int cc ) const\n+444 {\n+445 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n+446 return info_[ c ][ i ].size( cc );\n+447 }\n+448\n+462 int subEntity ( int i, int c, int ii, int cc ) const\n+463 {\n+464 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n+465 return info_[ c ][ i ].number( ii, cc );\n+466 }\n+467\n+483 auto subEntities ( int i, int c, int cc ) const\n+484 {\n+485 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n+486 return info_[ c ][ i ].numbers( cc );\n+487 }\n+488\n+497 const GeometryType &type ( int i, int c ) const\n+498 {\n+499 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n+500 return info_[ c ][ i ].type();\n+501 }\n+502\n+504 const GeometryType &type () const { return type( 0, 0 ); }\n+505\n+515 const Coordinate &position( int i, int c ) const\n+516 {\n+517 assert( (c >= 0) && (c <= dim) );\n+518 return baryCenters_[ c ][ i ];\n+519 }\n+520\n+528 bool checkInside ( const Coordinate &local ) const\n+529 {\n+530 const ctype tolerance = ctype( 64 ) * std::numeric_limits< ctype >::epsilon\n+();\n+531 return Impl::template checkInside< ctype, dim >( type().id(), dim, local,\n+tolerance );\n+532 }\n+533\n+545 template< int codim >\n+546 typename Codim< codim >::Geometry geometry ( int i ) const\n+547 {\n+548 return std::get< codim >( geometries_ )[ i ];\n+549 }\n+550\n+552 Volume volume () const\n+553 {\n+554 return volume_;\n+555 }\n+556\n+564 const Coordinate &integrationOuterNormal ( int face ) const\n+565 {\n+566 assert( (face >= 0) && (face < int( integrationNormals_.size() )) );\n+567 return integrationNormals_[ face ];\n+568 }\n+569\n+570 private:\n+571 void initialize ( unsigned int topologyId )\n+572 {\n+573 assert( topologyId < Impl::numTopologies( dim ) );\n+574\n+575 // set up subentities\n+576 for( int codim = 0; codim <= dim; ++codim )\n+577 {\n+578 const unsigned int _\bs_\bi_\bz_\be = Impl::size( topologyId, dim, codim );\n+579 info_[ codim ].resize( size );\n+580 for( unsigned int i = 0; i < _\bs_\bi_\bz_\be; ++i )\n+581 info_[ codim ][ i ].initialize( topologyId, codim, i );\n+582 }\n+583\n+584 // compute corners\n+585 const unsigned int numVertices = _\bs_\bi_\bz_\be( dim );\n+586 baryCenters_[ dim ].resize( numVertices );\n+587 Impl::referenceCorners( topologyId, dim, &(baryCenters_[ dim ][ 0 ]) );\n+588\n+589 // compute barycenters\n+590 for( int codim = 0; codim < dim; ++codim )\n+591 {\n+592 baryCenters_[ codim ].resize( _\bs_\bi_\bz_\be(codim) );\n+593 for( int i = 0; i < _\bs_\bi_\bz_\be( codim ); ++i )\n+594 {\n+595 baryCenters_[ codim ][ i ] = Coordinate( ctype( 0 ) );\n+596 const unsigned int numCorners = _\bs_\bi_\bz_\be( i, codim, dim );\n+597 for( unsigned int j = 0; j < numCorners; ++j )\n+598 baryCenters_[ codim ][ i ] += baryCenters_[ dim ][ subEntity( i, codim, j,\n+dim ) ];\n+599 baryCenters_[ codim ][ i ] *= ctype( 1 ) / ctype( numCorners );\n+600 }\n+601 }\n+602\n+603 // compute reference element volume\n+604 volume_ = Impl::template referenceVolume< ctype >( topologyId, dim );\n+605\n+606 // compute integration outer normals\n+607 if( dim > 0 )\n+608 {\n+609 integrationNormals_.resize( _\bs_\bi_\bz_\be( 1 ) );\n+610 Impl::referenceIntegrationOuterNormals( topologyId, dim, &\n+(integrationNormals_[ 0 ]) );\n+611 }\n+612\n+613 // set up geometries\n+614 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ]( auto i )\n+{ CreateGeometries< i >::apply( *this, geometries_ ); } );\n+615 }\n+616\n+617 template< int... codim >\n+618 static std::tuple< std::vector< typename Codim< codim >::Geometry >... >\n+619 makeGeometryTable ( std::integer_sequence< int, codim... > );\n+620\n+622 typedef decltype( makeGeometryTable( std::make_integer_sequence< int, dim+1\n+>() ) ) GeometryTable;\n+623\n+625 ctype volume_;\n+626\n+627 std::vector< Coordinate > baryCenters_[ dim+1 ];\n+628 std::vector< Coordinate > integrationNormals_;\n+629\n+631 GeometryTable geometries_;\n+632\n+633 std::vector< SubEntityInfo > info_[ dim+1 ];\n+634 };\n+635\n+637 template< class ctype, int dim >\n+638 struct ReferenceElementImplementation< ctype, dim >::SubEntityInfo\n+639 {\n+640 // Compute upper bound for the number of subsentities.\n+641 // If someone knows an explicit formal feel free to\n+642 // implement it here.\n+643 static constexpr std::size_t maxSubEntityCount()\n+644 {\n+645 std::size_t maxCount=0;\n+646 for(std::size_t codim=0; codim<=dim; ++codim)\n+647 maxCount = std::max(maxCount, binomial(std::size_t(dim),codim)*(1 <<\n+codim));\n+648 return maxCount;\n+649 }\n+650\n+651 using SubEntityFlags = std::bitset;\n+652\n+653 class SubEntityRange\n+654 : public Dune::IteratorRange\n+655 {\n+656 using Base = typename Dune::IteratorRange;\n+657\n+658 public:\n+659\n+660 using iterator = Base::iterator;\n+661 using const_iterator = Base::const_iterator;\n+662\n+663 SubEntityRange(const iterator& begin, const iterator& end, const\n+SubEntityFlags& contains) :\n+664 Base(begin, end),\n+665 containsPtr_(&contains),\n+666 size_(end-begin)\n+667 {}\n+668\n+669 SubEntityRange() :\n+670 Base(),\n+671 containsPtr_(nullptr),\n+672 size_(0)\n+673 {}\n+674\n+675 std::size_t _\bs_\bi_\bz_\be() const\n+676 {\n+677 return size_;\n+678 }\n+679\n+680 bool contains(std::size_t i) const\n+681 {\n+682 return (*containsPtr_)[i];\n+683 }\n+684\n+685 private:\n+686 const SubEntityFlags* containsPtr_;\n+687 std::size_t size_;\n+688 std::size_t offset_;\n+689 };\n+690\n+691 using NumberRange = typename Dune::IteratorRange;\n+692\n+693 SubEntityInfo ()\n+694 : numbering_( nullptr )\n+695 {\n+696 std::fill( offset_.begin(), offset_.end(), 0 );\n+697 }\n+698\n+699 SubEntityInfo ( const SubEntityInfo &other )\n+700 : offset_( other.offset_ ),\n+701 type_( other.type_ ),\n+702 containsSubentity_( other.containsSubentity_ )\n+703 {\n+704 numbering_ = allocate();\n+705 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );\n+706 }\n+707\n+708 ~SubEntityInfo () { deallocate( numbering_ ); }\n+709\n+710 const SubEntityInfo &operator= ( const SubEntityInfo &other )\n+711 {\n+712 type_ = other.type_;\n+713 offset_ = other.offset_;\n+714\n+715 deallocate( numbering_ );\n+716 numbering_ = allocate();\n+717 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );\n+718\n+719 containsSubentity_ = other.containsSubentity_;\n+720\n+721 return *this;\n+722 }\n+723\n+724 int _\bs_\bi_\bz_\be ( int cc ) const\n+725 {\n+726 assert( (cc >= 0) && (cc <= dim) );\n+727 return (offset_[ cc+1 ] - offset_[ cc ]);\n+728 }\n+729\n+730 int number ( int ii, int cc ) const\n+731 {\n+732 assert( (ii >= 0) && (ii < _\bs_\bi_\bz_\be( cc )) );\n+733 return numbering_[ offset_[ cc ] + ii ];\n+734 }\n+735\n+736 auto numbers ( int cc ) const\n+737 {\n+738 return SubEntityRange( numbering_ + offset_[ cc ], numbering_ + offset_\n+[ cc+1 ], containsSubentity_[cc]);\n+739 }\n+740\n+741 const GeometryType &type () const { return type_; }\n+742\n+743 void initialize ( unsigned int topologyId, int codim, unsigned int i )\n+744 {\n+745 const unsigned int subId = Impl::subTopologyId( topologyId, dim, codim, i\n+);\n+746 type_ = GeometryType( subId, dim-codim );\n+747\n+748 // compute offsets\n+749 for( int cc = 0; cc <= codim; ++cc )\n+750 offset_[ cc ] = 0;\n+751 for( int cc = codim; cc <= dim; ++cc )\n+752 offset_[ cc+1 ] = offset_[ cc ] + Impl::size( subId, dim-codim, cc-codim );\n+753\n+754 // compute subnumbering\n+755 deallocate( numbering_ );\n+756 numbering_ = allocate();\n+757 for( int cc = codim; cc <= dim; ++cc )\n+758 Impl::subTopologyNumbering( topologyId, dim, codim, i, cc-codim,\n+numbering_+offset_[ cc ], numbering_+offset_[ cc+1 ] );\n+759\n+760 // initialize containsSubentity lookup-table\n+761 for(std::size_t cc=0; cc<= dim; ++cc)\n+762 {\n+763 containsSubentity_[cc].reset();\n+764 for(std::size_t idx=0; idx offset_;\n+779 GeometryType type_;\n+780 std::array< SubEntityFlags, dim+1> containsSubentity_;\n+781 };\n+782\n+783\n+784 template< class ctype, int dim >\n+785 template< int codim >\n+786 struct ReferenceElementImplementation< ctype, dim >::CreateGeometries\n+787 {\n+788 template< int cc >\n+789 static typename ReferenceElements< ctype, dim-cc >::ReferenceElement\n+790 subRefElement( const ReferenceElementImplementation< ctype, dim >\n+&refElement, int i, std::integral_constant< int, cc > )\n+791 {\n+792 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b-_\bc_\bc_\b _\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl( refElement.type( i, cc\n+) );\n+793 }\n+794\n+795 static typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+796 subRefElement(const ReferenceElementImplementation< ctype, dim >\n+&refElement,\n+797 [[maybe_unused]] int i, std::integral_constant)\n+798 {\n+799 return refElement;\n+800 }\n+801\n+802 static void apply ( const ReferenceElementImplementation< ctype, dim >\n+&refElement, GeometryTable &geometries )\n+803 {\n+804 const int _\bs_\bi_\bz_\be = refElement.size( codim );\n+805 std::vector< FieldVector< ctype, dim > > origins( size );\n+806 std::vector< FieldMatrix< ctype, dim - codim, dim > > jacobianTransposeds\n+( size );\n+807 Impl::referenceEmbeddings( refElement.type().id(), dim, codim, &(origins[ 0\n+]), &(jacobianTransposeds[ 0 ]) );\n+808\n+809 std::get< codim >( geometries ).reserve( size );\n+810 for( int i = 0; i < _\bs_\bi_\bz_\be; ++i )\n+811 {\n+812 typename Codim< codim >::Geometry geometry( subRefElement( refElement, i,\n+std::integral_constant< int, codim >() ), origins[ i ], jacobianTransposeds[ i\n+] );\n+813 std::get< codim >( geometries ).push_back( geometry );\n+814 }\n+815 }\n+816 };\n+817\n+818#endif // DOXYGEN\n+819\n+820 } // namespace Geo\n+821\n+822} // namespace Dune\n+823\n+824#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n+_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n+An implementation of the Geometry interface for affine geometries.\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt\n-GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int\n-vertices)\n-Utility function to construct the correct geometry type given the dimension and\n-the number of vertice...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typefromvertexcount.hh:17\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-Unique label for each type of entities that can occur in DUNE grids.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bz_\be\n+@ size\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:194\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename Container::ReferenceElement ReferenceElement\n+The reference element type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl\n+static const ReferenceElement & general(const GeometryType &type)\n+get general reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:156\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00194.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00194.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: typeindex.hh File Reference\n+dune-geometry: referenceelements.hh File Reference\n \n \n \n \n \n \n \n@@ -71,44 +71,73 @@\n \n \n \n
\n \n-
typeindex.hh File Reference
\n+Namespaces |\n+Typedefs |\n+Functions
\n+
referenceelements.hh File Reference
\n \n
\n-\n-

Helper classes to provide indices for geometrytypes for use in a vector. \n-More...

\n-
#include <cstddef>
\n-#include <dune/common/indices.hh>
\n-#include <dune/common/hybridutilities.hh>
\n-#include "type.hh"
\n+
#include <cassert>
\n+#include <algorithm>
\n+#include <limits>
\n+#include <tuple>
\n+#include <utility>
\n+#include <vector>
\n+#include <array>
\n+#include <dune/common/typetraits.hh>
\n+#include <dune/common/std/type_traits.hh>
\n+#include <dune/common/visibility.hh>
\n+#include <dune/geometry/dimension.hh>
\n+#include <dune/geometry/type.hh>
\n+#include <dune/geometry/referenceelement.hh>
\n+#include <dune/geometry/referenceelementimplementation.hh>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  Dune::LocalGeometryTypeIndex
 Compute per-dimension indices for geometry types. More...
 
class  Dune::GlobalGeometryTypeIndex
 Compute indices for geometry types, taking the dimension into account. More...
struct  Dune::Geo::ReferenceElements< ctype_, dim >
 Class providing access to the singletons of the reference elements. More...
 
\n \n \n \n+\n+\n+\n+\n+

\n Namespaces

namespace  Dune
 
namespace  Dune::Geo
 
namespace  Dune::Transitional
 
\n+\n+\n+\n+\n+

\n+Typedefs

template<typename... T>
using Dune::ReferenceElement = decltype(referenceElement(std::declval< T >()...))
 
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

\n+Functions

template<typename... T>
unspecified value type Dune::referenceElement (T &&... t)
 Returns a reference element for the objects t....
 
template<typename T , int dim>
auto Dune::referenceElement (const Dune::GeometryType &gt, Dune::Dim< dim >={})
 Returns a reference element of dimension dim for the given geometry type and coordinate field type.
 
template<typename T , int dim, std::enable_if_t< IsNumber< std::decay_t< T > >::value, int > = 0>
auto Dune::referenceElement (const T &, const Dune::GeometryType &gt, Dune::Dim< dim >)
 Returns a reference element of dimension dim for the given geometry type and coordinate field type.
 
\n-

Detailed Description

\n-

Helper classes to provide indices for geometrytypes for use in a vector.

\n-
\n+
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,60 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-typeindex.hh File Reference\n-Helper classes to provide indices for geometrytypes for use in a vector.\n-_\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+referenceelements.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n-\u00a0 Compute per-dimension indices for geometry types. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n-\u00a0 Compute indices for geometry types, taking the dimension into account.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b__\b,_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 Class providing access to the singletons of the reference elements.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Helper classes to provide indices for geometrytypes for use in a vector.\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\ba_\bl\n+\u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval< T >\n+ ()...))\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+unspecified value type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (T &&... t)\n+\u00a0 Returns a reference element for the objects t....\n+\u00a0\n+template\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >,\n+ _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm< dim >={})\n+\u00a0 Returns a reference element of dimension dim for the\n+ given geometry type and coordinate field type.\n+\u00a0\n+template\n+>::value, int > = 0>\n+ auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const T &, const _\bD_\bu_\bn_\be_\b:_\b:\n+ _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm< dim >)\n+\u00a0 Returns a reference element of dimension dim for the\n+ given geometry type and coordinate field type.\n+\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00194_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00194_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: typeindex.hh Source File\n+dune-geometry: referenceelements.hh Source File\n \n \n \n \n \n \n \n@@ -74,161 +74,317 @@\n \n
\n \n
\n \n
\n-
typeindex.hh
\n+
referenceelements.hh
\n
\n
\n Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
\n
2// vi: set et ts=4 sw=2 sts=2:
\n
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n
4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
\n-
5#ifndef DUNE_GEOMETRY_TYPEINDEX_HH
\n-
6#define DUNE_GEOMETRY_TYPEINDEX_HH
\n+
5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH
\n+
6#define DUNE_GEOMETRY_REFERENCEELEMENTS_HH
\n
7
\n-
14#include <cstddef>
\n-
15
\n-
16#include <dune/common/indices.hh>
\n-
17#include <dune/common/hybridutilities.hh>
\n-
18
\n-
19#include "type.hh"
\n+
8#include <cassert>
\n+
9
\n+
10#include <algorithm>
\n+
11#include <limits>
\n+
12#include <tuple>
\n+
13#include <utility>
\n+
14#include <vector>
\n+
15#include <array>
\n+
16
\n+
17#include <dune/common/typetraits.hh>
\n+
18#include <dune/common/std/type_traits.hh>
\n+
19#include <dune/common/visibility.hh>
\n
20
\n-
21namespace Dune
\n-
22{
\n-
\n-\n-
25 {
\n-
32 inline static constexpr std::size_t regular_size(std::size_t dim)
\n-
33 {
\n-
34 // The following expression is derived from the expression for
\n-
35 // GlobalGeometryTypeIndex::regular_offset(). Subtracting
\n-
36 // regular_offset(dim+1)-regular_offset(dim) we get:
\n-
37 //
\n-
38 // ((1 << dim+1) >> 1) - ((1 << dim) >> 1)
\n-
39 //
\n-
40 // We always have
\n-
41 //
\n-
42 // dim >= 0,
\n-
43 //
\n-
44 // so
\n-
45 //
\n-
46 // (1 << dim+1) >= 2 and (1 << dim+2) % 2 == 0.
\n-
47 //
\n-
48 // So if we apply a single right-shift to that, we will never lose any
\n-
49 // set bits, thus
\n-
50 //
\n-
51 // ((1 << dim+1) >> 1) == (1 << dim)
\n-
52 return (1 << dim) - ((1 << dim) >> 1);
\n-
53 }
\n-
54
\n-
55 public:
\n-
\n-
61 inline static constexpr std::size_t size(std::size_t dim)
\n-
62 {
\n-
63 // one for "none"
\n-
64 return regular_size(dim) + 1;
\n-
65 }
\n-
\n-
66
\n-
\n-
73 inline static constexpr std::size_t index(const GeometryType &gt)
\n-
74 {
\n-
75 return gt.isNone() ? regular_size(gt.dim()) : (gt.id() >> 1);
\n-
76 }
\n-
\n-
77
\n-
\n-
79 inline static constexpr GeometryType type(std::size_t dim, std::size_t index) {
\n-
80 return (index == regular_size(dim)) ?
\n-
81 GeometryTypes::none(dim) :
\n-
82 // the cast to unsigned makes sure this is interpreted as the topology
\n-
83 // ID constructor
\n-
84 GeometryType(static_cast< unsigned int >(index << 1), dim);
\n-
85 }
\n-
\n-
86 };
\n-
\n-
87
\n-
\n-\n-
90 {
\n-
98 inline static constexpr std::size_t regular_offset(std::size_t dim)
\n-
99 {
\n-
100 // The number of regular geometry types in a given dimension is
\n-
101 // 2^(dim-1). For dim==0 this would yield 1/2 geometry types (which is
\n-
102 // obviously bogus, dim==0 has one regular geometry type, the point).
\n-
103 // The following expression relies on 1 >> 1 == 0 to treat dim==0
\n-
104 // specially.
\n-
105 return (1 << dim) >> 1;
\n-
106 }
\n-
107
\n-
108 public:
\n-
\n-
113 inline static constexpr std::size_t offset(std::size_t dim)
\n-
114 {
\n-
115 // dim times "none"
\n-
116 return regular_offset(dim) + dim;
\n-
117 }
\n-
\n-
118
\n-
\n-
125 inline static constexpr std::size_t size(std::size_t maxdim)
\n-
126 {
\n-
127 return offset(maxdim+1);
\n-
128 }
\n-
\n+\n+
22#include <dune/geometry/type.hh>
\n+\n+\n+
25
\n+
26namespace Dune
\n+
27{
\n+
28
\n+
29 namespace Geo
\n+
30 {
\n+
31
\n+
32#ifndef DOXYGEN
\n+
33
\n+
34
\n+
35 namespace Impl
\n+
36 {
\n+
37
\n+
38 // ReferenceElementContainer
\n+
39 // -------------------------
\n+
40
\n+
41 template< class ctype, int dim >
\n+
42 class ReferenceElementContainer
\n+
43 {
\n+
44 static const unsigned int numTopologies = dim >= 0 ? (1u << dim) : 0;
\n+
45
\n+
46 using Implementation = ReferenceElementImplementation< ctype, dim >;
\n+
47
\n+
48 public:
\n+
49
\n+
50 using ReferenceElement = Dune::Geo::ReferenceElement< Implementation >;
\n+
51 using value_type = ReferenceElement;
\n+
52 using const_iterator = const value_type*;
\n+
53
\n+
54 ReferenceElementContainer ()
\n+
55 {
\n+
56 for( unsigned int topologyId = 0; topologyId < numTopologies; ++topologyId )
\n+
57 {
\n+
58 implementations_[ topologyId ].initialize( topologyId );
\n+
59 reference_elements_[ topologyId ].setImplementation( implementations_[ topologyId ] );
\n+
60 }
\n+
61 }
\n+
62
\n+
63 const ReferenceElement& operator() ( const GeometryType &type ) const
\n+
64 {
\n+
65 assert( type.dim() == dim );
\n+
66 return reference_elements_[ type.id() ];
\n+
67 }
\n+
68
\n+
69 const ReferenceElement& simplex () const
\n+
70 {
\n+
71 return reference_elements_[ Dune::GeometryTypes::simplex(dim).id() ];
\n+
72 }
\n+
73
\n+
74 const ReferenceElement& cube () const
\n+
75 {
\n+
76 return reference_elements_[ Dune::GeometryTypes::cube(dim).id() ];
\n+
77 }
\n+
78
\n+
79 const ReferenceElement& pyramid () const
\n+
80 {
\n+
81 return reference_elements_[ Dune::GeometryTypes::pyramid.id() ];
\n+
82 }
\n+
83
\n+
84 const ReferenceElement& prism () const
\n+
85 {
\n+
86 return reference_elements_[ Dune::GeometryTypes::prism.id() ];
\n+
87 }
\n+
88
\n+
89 const_iterator begin () const
\n+
90 {
\n+
91 return reference_elements_.data();
\n+
92 }
\n+
93
\n+
94 const_iterator end () const
\n+
95 {
\n+
96 return reference_elements_.data() + numTopologies;
\n+
97 }
\n+
98
\n+
99 private:
\n+
100
\n+
101 std::array<Implementation,numTopologies> implementations_;
\n+
102 std::array<ReferenceElement,numTopologies> reference_elements_;
\n+
103
\n+
104 };
\n+
105
\n+
106
\n+
107 } // namespace Impl
\n+
108
\n+
109
\n+
110#endif // DOXYGEN
\n+
111
\n+
112
\n+
113 // ReferenceElements
\n+
114 // ------------------------
\n+
115
\n+
126 template< class ctype_, int dim >
\n+
\n+\n+
128 {
\n
129
\n-
\n-
138 inline static constexpr std::size_t index(const GeometryType &gt)
\n-
139 {
\n-
140 return offset(gt.dim()) + LocalGeometryTypeIndex::index(gt);
\n-
141 }
\n-
\n-
142 };
\n-
\n-
143
\n-
144 namespace Impl {
\n-
145
\n-
146 // Map a dynamic GeometryType to a static integral_constant<GeometryType::Id, ...>
\n-
147 template<int dim, class F>
\n-
148 static auto toGeometryTypeIdConstant(const GeometryType& gt, F&& f) {
\n-
149 // Transform LocalGeometryTypeIndex to GeometryType::Id
\n-
150 auto callWithId = [&](auto index) {
\n-
151 static constexpr auto id = LocalGeometryTypeIndex::type(dim, decltype(index)::value).toId();
\n-
152 return f(std::integral_constant<GeometryType::Id, id>{});
\n-
153 };
\n-
154 // switchCases needs a fallback to determine the return type.
\n-
155 auto fallBack = [&]() { return callWithId(Dune::Indices::_0); };
\n-
156 // Iterate over all _regular_ GeometryType indices for given dimension
\n-
157 auto allIndices = std::make_index_sequence<LocalGeometryTypeIndex::size(dim)-1>{};
\n-
158 return Dune::Hybrid::switchCases(allIndices, LocalGeometryTypeIndex::index(gt), callWithId, fallBack);
\n-
159 }
\n+
131 using ctype = ctype_;
\n+
132
\n+\n+
135
\n+
137 static constexpr int dimension = dim;
\n+
138
\n+
139 private:
\n+
140
\n+
141 using Container = Impl::ReferenceElementContainer< ctype, dim >;
\n+
142
\n+
143 public:
\n+
144
\n+
146 using ReferenceElement = typename Container::ReferenceElement;
\n+
147
\n+
149 using Iterator = typename Container::const_iterator;
\n+
150
\n+\n+
153
\n+
155 static const ReferenceElement&
\n+
\n+
156 general ( const GeometryType& type )
\n+
157 {
\n+
158 return container() ( type );
\n+
159 }
\n+
\n
160
\n-
161 } // namespace Impl
\n-
162} // namespace Dune
\n-
163
\n-
164#endif // DUNE_GEOMETRY_TYPEINDEX_HH
\n-
A unique label for each type of element that can occur in a grid.
\n+
\n+
162 static const ReferenceElement& simplex ()
\n+
163 {
\n+
164 return container().simplex();
\n+
165 }
\n+
\n+
166
\n+
\n+
168 static const ReferenceElement& cube ()
\n+
169 {
\n+
170 return container().cube();
\n+
171 }
\n+
\n+
172
\n+
\n+
173 static Iterator begin ()
\n+
174 {
\n+
175 return container().begin();
\n+
176 }
\n+
\n+
177
\n+
\n+
178 static Iterator end ()
\n+
179 {
\n+
180 return container().end();
\n+
181 }
\n+
\n+
182
\n+
183 private:
\n+
184
\n+
185 DUNE_EXPORT static const Container& container ()
\n+
186 {
\n+
187 static Container container;
\n+
188 return container;
\n+
189 }
\n+
190 };
\n+
\n+
191
\n+
192 } // namespace Geo
\n+
193
\n+
195 using Geo::ReferenceElements;
\n+
196
\n+
197
\n+
198#ifdef DOXYGEN
\n+
199
\n+
201
\n+
244 template<typename... T>
\n+
245 unspecified-value-type referenceElement(T&&... t);
\n+
246
\n+
247#endif
\n+
248
\n+
249
\n+
251
\n+
264 template<typename T, int dim>
\n+
\n+\n+
266 {
\n+\n+
268 }
\n+
\n+
269
\n+
270
\n+
272
\n+
284 template<typename T, int dim, std::enable_if_t<IsNumber<std::decay_t<T>>::value, int> = 0>
\n+
\n+\n+
286 {
\n+\n+
288 }
\n+
\n+
289
\n+
290
\n+
291#ifndef DOXYGEN
\n+
292
\n+
293 // helpers for the ReferenceElement<> meta function
\n+
294 // the complete Impl block can be removed together with deprecated Transitional::ReferenceElement
\n+
295
\n+
296 namespace Impl {
\n+
297
\n+
298 // Evaluates to the correct reference element iff <T...> matches the pattern <number_type,Dim<int>>
\n+
299 // otherwise, it's ill-formed. Should be used with detected_or and friends.
\n+
300
\n+
301 template<typename... T>
\n+
302 struct DefaultReferenceElementExtractor;
\n+
303
\n+
304 template<typename T, typename std::enable_if<IsNumber<T>::value,int>::type dim>
\n+
305 struct DefaultReferenceElementExtractor<T,Dim<dim>>
\n+
306 {
\n+\n+
308 };
\n+
309
\n+
310 template<typename... T>
\n+
311 using DefaultReferenceElement = typename DefaultReferenceElementExtractor<T...>::type;
\n+
312
\n+
313 }
\n+
314
\n+
315 // looks up the type of a reference element by trying to instantiate the correct overload
\n+
316 // of referenceElement() for the given arguments. This will fail if there is no valid
\n+
317 // overload and should be used with detected_or or some other utility that places the
\n+
318 // instantiation in SFINAE context.
\n+
319 //
\n+
320 // this is placed directly in namespace Dune to avoid any weird surprises
\n+
321
\n+
322 template<typename... T>
\n+
323 using LookupReferenceElement = decltype(referenceElement(std::declval<T>()...));
\n+
324
\n+
325#endif // DOXYGEN
\n+
326
\n+
\n+
327 namespace [[deprecated]] Transitional {
\n+
328
\n+
329 // this abomination checks whether the template signature matches the special case
\n+
330 // ReferenceElement<number_type,Dune::Dim<int>> and otherwise defers the type lookup
\n+
331 // to a decltype on a call to referenceElement(std::declval<T>())
\n+
332
\n+
337 template<typename... T>
\n+
338 using ReferenceElement = detected_or_fallback_t<
\n+
339 Impl::DefaultReferenceElement,
\n+
340 LookupReferenceElement,
\n+
341 T...
\n+
342 >;
\n+
343
\n+
344 }
\n+
\n+
345
\n+
346 template<typename... T>
\n+
347 using ReferenceElement = decltype(referenceElement(std::declval<T>()...));
\n+
348
\n+
349} // namespace Dune
\n+
350
\n+
351#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH
\n+\n+
A unique label for each type of element that can occur in a grid.
\n+\n+\n+
unspecified value type referenceElement(T &&... t)
Returns a reference element for the objects t....
\n
Definition affinegeometry.hh:21
\n+
decltype(referenceElement(std::declval< T >()...)) ReferenceElement
Definition referenceelements.hh:347
\n+
This class provides access to geometric and topological properties of a reference element.
Definition referenceelement.hh:52
\n+
Class providing access to the singletons of the reference elements.
Definition referenceelements.hh:128
\n+
static Iterator begin()
Definition referenceelements.hh:173
\n+
Iterator iterator
Iterator over available reference elements.
Definition referenceelements.hh:152
\n+
typename Container::ReferenceElement ReferenceElement
The reference element type.
Definition referenceelements.hh:146
\n+
static const ReferenceElement & cube()
get hypercube reference elements
Definition referenceelements.hh:168
\n+
static Iterator end()
Definition referenceelements.hh:178
\n+
ctype_ ctype
The coordinate field type of the contained reference elements.
Definition referenceelements.hh:131
\n+
static const ReferenceElement & general(const GeometryType &type)
get general reference elements
Definition referenceelements.hh:156
\n+
static const ReferenceElement & simplex()
get simplex reference elements
Definition referenceelements.hh:162
\n+
typename Container::const_iterator Iterator
Iterator over available reference elements.
Definition referenceelements.hh:149
\n+
static constexpr int dimension
The dimension of the contained reference elements.
Definition referenceelements.hh:137
\n+
ctype CoordinateField
The coordinate field type of the contained reference elements.
Definition referenceelements.hh:134
\n+
Static tag representing a dimension.
Definition dimension.hh:16
\n
Unique label for each type of entities that can occur in DUNE grids.
Definition type.hh:114
\n-
constexpr Id toId() const
Create an Id representation of this GeometryType.
Definition type.hh:210
\n-
constexpr unsigned int dim() const
Return dimension of the type.
Definition type.hh:360
\n
constexpr unsigned int id() const
Return the topology id of the type.
Definition type.hh:365
\n-
constexpr bool isNone() const
Return true if entity is a singular of any dimension.
Definition type.hh:355
\n-
Compute per-dimension indices for geometry types.
Definition typeindex.hh:25
\n-
static constexpr std::size_t size(std::size_t dim)
Compute total number of geometry types for the given dimension.
Definition typeindex.hh:61
\n-
static constexpr GeometryType type(std::size_t dim, std::size_t index)
compute the geometry type for the given local index and dimension
Definition typeindex.hh:79
\n-
static constexpr std::size_t index(const GeometryType &gt)
Compute the index for the given geometry type within its dimension.
Definition typeindex.hh:73
\n-
Compute indices for geometry types, taking the dimension into account.
Definition typeindex.hh:90
\n-
static constexpr std::size_t index(const GeometryType &gt)
Compute the index for the given geometry type over all dimensions.
Definition typeindex.hh:138
\n-
static constexpr std::size_t offset(std::size_t dim)
Compute the starting index for a given dimension including irregular geometry types.
Definition typeindex.hh:113
\n-
static constexpr std::size_t size(std::size_t maxdim)
Compute total number of geometry types up to and including the given dimension.
Definition typeindex.hh:125
\n
\n \n
\n Generated by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,183 +1,356 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-typeindex.hh\n+referenceelements.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_TYPEINDEX_HH\n-6#define DUNE_GEOMETRY_TYPEINDEX_HH\n+5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n+6#define DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n 7\n-14#include \n-15\n-16#include \n-17#include \n-18\n-19#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+8#include \n+9\n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15#include \n+16\n+17#include \n+18#include \n+19#include \n 20\n-21namespace _\bD_\bu_\bn_\be\n-22{\n-_\b2_\b4 class _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n-25 {\n-32 inline static constexpr std::size_t regular_size(std::size_t dim)\n-33 {\n-34 // The following expression is derived from the expression for\n-35 // GlobalGeometryTypeIndex::regular_offset(). Subtracting\n-36 // regular_offset(dim+1)-regular_offset(dim) we get:\n-37 //\n-38 // ((1 << dim+1) >> 1) - ((1 << dim) >> 1)\n-39 //\n-40 // We always have\n-41 //\n-42 // dim >= 0,\n-43 //\n-44 // so\n-45 //\n-46 // (1 << dim+1) >= 2 and (1 << dim+2) % 2 == 0.\n-47 //\n-48 // So if we apply a single right-shift to that, we will never lose any\n-49 // set bits, thus\n-50 //\n-51 // ((1 << dim+1) >> 1) == (1 << dim)\n-52 return (1 << dim) - ((1 << dim) >> 1);\n-53 }\n-54\n-55 public:\n-_\b6_\b1 inline static constexpr std::size_t _\bs_\bi_\bz_\be(std::size_t dim)\n-62 {\n-63 // one for \"none\"\n-64 return regular_size(dim) + 1;\n-65 }\n-66\n-_\b7_\b3 inline static constexpr std::size_t _\bi_\bn_\bd_\be_\bx(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >)\n-74 {\n-75 return gt._\bi_\bs_\bN_\bo_\bn_\be() ? regular_size(gt._\bd_\bi_\bm()) : (gt._\bi_\bd() >> 1);\n-76 }\n-77\n-_\b7_\b9 inline static constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be(std::size_t dim, std::size_t\n-_\bi_\bn_\bd_\be_\bx) {\n-80 return (_\bi_\bn_\bd_\be_\bx == regular_size(dim)) ?\n-81 GeometryTypes::none(dim) :\n-82 // the cast to unsigned makes sure this is interpreted as the topology\n-83 // ID constructor\n-84 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(static_cast< unsigned int >(_\bi_\bn_\bd_\be_\bx << 1), dim);\n-85 }\n-86 };\n-87\n-_\b8_\b9 class _\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+21#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh>\n+22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n+24#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+25\n+26namespace _\bD_\bu_\bn_\be\n+27{\n+28\n+29 namespace Geo\n+30 {\n+31\n+32#ifndef DOXYGEN\n+33\n+34\n+35 namespace Impl\n+36 {\n+37\n+38 // ReferenceElementContainer\n+39 // -------------------------\n+40\n+41 template< class ctype, int dim >\n+42 class ReferenceElementContainer\n+43 {\n+44 static const unsigned int numTopologies = dim >= 0 ? (1u << dim) : 0;\n+45\n+46 using Implementation = ReferenceElementImplementation< ctype, dim >;\n+47\n+48 public:\n+49\n+50 using ReferenceElement = _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>;\n+51 using value_type = ReferenceElement;\n+52 using const_iterator = const value_type*;\n+53\n+54 ReferenceElementContainer ()\n+55 {\n+56 for( unsigned int topologyId = 0; topologyId < numTopologies; ++topologyId )\n+57 {\n+58 implementations_[ topologyId ].initialize( topologyId );\n+59 reference_elements_[ topologyId ].setImplementation( implementations_\n+[ topologyId ] );\n+60 }\n+61 }\n+62\n+63 const ReferenceElement& operator() ( const GeometryType &type ) const\n+64 {\n+65 assert( type.dim() == dim );\n+66 return reference_elements_[ type.id() ];\n+67 }\n+68\n+69 const ReferenceElement& simplex () const\n+70 {\n+71 return reference_elements_[ Dune::GeometryTypes::simplex(dim)._\bi_\bd() ];\n+72 }\n+73\n+74 const ReferenceElement& cube () const\n+75 {\n+76 return reference_elements_[ Dune::GeometryTypes::cube(dim)._\bi_\bd() ];\n+77 }\n+78\n+79 const ReferenceElement& pyramid () const\n+80 {\n+81 return reference_elements_[ Dune::GeometryTypes::pyramid._\bi_\bd() ];\n+82 }\n+83\n+84 const ReferenceElement& prism () const\n+85 {\n+86 return reference_elements_[ Dune::GeometryTypes::prism._\bi_\bd() ];\n+87 }\n+88\n+89 const_iterator begin () const\n 90 {\n-98 inline static constexpr std::size_t regular_offset(std::size_t dim)\n-99 {\n-100 // The number of regular geometry types in a given dimension is\n-101 // 2^(dim-1). For dim==0 this would yield 1/2 geometry types (which is\n-102 // obviously bogus, dim==0 has one regular geometry type, the point).\n-103 // The following expression relies on 1 >> 1 == 0 to treat dim==0\n-104 // specially.\n-105 return (1 << dim) >> 1;\n-106 }\n-107\n-108 public:\n-_\b1_\b1_\b3 inline static constexpr std::size_t _\bo_\bf_\bf_\bs_\be_\bt(std::size_t dim)\n-114 {\n-115 // dim times \"none\"\n-116 return regular_offset(dim) + dim;\n-117 }\n-118\n-_\b1_\b2_\b5 inline static constexpr std::size_t _\bs_\bi_\bz_\be(std::size_t maxdim)\n-126 {\n-127 return _\bo_\bf_\bf_\bs_\be_\bt(maxdim+1);\n-128 }\n+91 return reference_elements_.data();\n+92 }\n+93\n+94 const_iterator end () const\n+95 {\n+96 return reference_elements_.data() + numTopologies;\n+97 }\n+98\n+99 private:\n+100\n+101 std::array implementations_;\n+102 std::array reference_elements_;\n+103\n+104 };\n+105\n+106\n+107 } // namespace Impl\n+108\n+109\n+110#endif // DOXYGEN\n+111\n+112\n+113 // ReferenceElements\n+114 // ------------------------\n+115\n+126 template< class ctype_, int dim >\n+_\b1_\b2_\b7 struct _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+128 {\n 129\n-_\b1_\b3_\b8 inline static constexpr std::size_t _\bi_\bn_\bd_\be_\bx(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >)\n-139 {\n-140 return _\bo_\bf_\bf_\bs_\be_\bt(gt._\bd_\bi_\bm()) + _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx(gt);\n-141 }\n-142 };\n-143\n-144 namespace Impl {\n-145\n-146 // Map a dynamic GeometryType to a static integral_constant\n-147 template\n-148 static auto toGeometryTypeIdConstant(const GeometryType& gt, F&& f) {\n-149 // Transform LocalGeometryTypeIndex to GeometryType::Id\n-150 auto callWithId = [&](auto index) {\n-151 static constexpr auto id = _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bt_\by_\bp_\be(dim, decltype\n-(index)::value)._\bt_\bo_\bI_\bd();\n-152 return f(std::integral_constant{});\n-153 };\n-154 // switchCases needs a fallback to determine the return type.\n-155 auto fallBack = [&]() { return callWithId(Dune::Indices::_0); };\n-156 // Iterate over all _regular_ GeometryType indices for given dimension\n-157 auto allIndices = std::make_index_sequence<_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n-(dim)-1>{};\n-158 return Dune::Hybrid::switchCases(allIndices, _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-(gt), callWithId, fallBack);\n+_\b1_\b3_\b1 using _\bc_\bt_\by_\bp_\be = ctype_;\n+132\n+_\b1_\b3_\b4 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd = _\bc_\bt_\by_\bp_\be;\n+135\n+_\b1_\b3_\b7 static constexpr int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n+138\n+139 private:\n+140\n+141 using Container = Impl::ReferenceElementContainer< ctype, dim >;\n+142\n+143 public:\n+144\n+_\b1_\b4_\b6 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = typename Container::ReferenceElement;\n+147\n+_\b1_\b4_\b9 using _\bI_\bt_\be_\br_\ba_\bt_\bo_\br = typename Container::const_iterator;\n+150\n+_\b1_\b5_\b2 using _\bi_\bt_\be_\br_\ba_\bt_\bo_\br = _\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+153\n+155 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt&\n+_\b1_\b5_\b6 _\bg_\be_\bn_\be_\br_\ba_\bl ( const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& type )\n+157 {\n+158 return container() ( type );\n 159 }\n 160\n-161 } // namespace Impl\n-162} // namespace Dune\n-163\n-164#endif // DUNE_GEOMETRY_TYPEINDEX_HH\n+_\b1_\b6_\b2 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& _\bs_\bi_\bm_\bp_\bl_\be_\bx ()\n+163 {\n+164 return container().simplex();\n+165 }\n+166\n+_\b1_\b6_\b8 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& _\bc_\bu_\bb_\be ()\n+169 {\n+170 return container().cube();\n+171 }\n+172\n+_\b1_\b7_\b3 static _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn ()\n+174 {\n+175 return container().begin();\n+176 }\n+177\n+_\b1_\b7_\b8 static _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd ()\n+179 {\n+180 return container().end();\n+181 }\n+182\n+183 private:\n+184\n+185 DUNE_EXPORT static const Container& container ()\n+186 {\n+187 static Container container;\n+188 return container;\n+189 }\n+190 };\n+191\n+192 } // namespace Geo\n+193\n+195 using Geo::ReferenceElements;\n+196\n+197\n+198#ifdef DOXYGEN\n+199\n+201\n+244 template\n+_\b2_\b4_\b5 unspecified-value-type _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(T&&... t);\n+246\n+247#endif\n+248\n+249\n+251\n+264 template\n+_\b2_\b6_\b5 auto _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt, _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b<_\bd_\bi_\bm_\b> = {})\n+266 {\n+267 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl(gt);\n+268 }\n+269\n+270\n+272\n+284 template>::\n+value, int> = 0>\n+_\b2_\b8_\b5 auto _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const T&, const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt, _\bD_\bu_\bn_\be_\b:_\b:\n+_\bD_\bi_\bm_\b<_\bd_\bi_\bm_\b>)\n+286 {\n+287 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl(gt);\n+288 }\n+289\n+290\n+291#ifndef DOXYGEN\n+292\n+293 // helpers for the ReferenceElement<> meta function\n+294 // the complete Impl block can be removed together with deprecated\n+Transitional::ReferenceElement\n+295\n+296 namespace Impl {\n+297\n+298 // Evaluates to the correct reference element iff matches the\n+pattern >\n+299 // otherwise, it's ill-formed. Should be used with detected_or and friends.\n+300\n+301 template\n+302 struct DefaultReferenceElementExtractor;\n+303\n+304 template::value,int>::type\n+dim>\n+305 struct DefaultReferenceElementExtractor>\n+306 {\n+307 using type = typename _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:\n+_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n+308 };\n+309\n+310 template\n+311 using DefaultReferenceElement = typename\n+DefaultReferenceElementExtractor::type;\n+312\n+313 }\n+314\n+315 // looks up the type of a reference element by trying to instantiate the\n+correct overload\n+316 // of referenceElement() for the given arguments. This will fail if there\n+is no valid\n+317 // overload and should be used with detected_or or some other utility that\n+places the\n+318 // instantiation in SFINAE context.\n+319 //\n+320 // this is placed directly in namespace Dune to avoid any weird surprises\n+321\n+322 template\n+323 using LookupReferenceElement = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval\n+()...));\n+324\n+325#endif // DOXYGEN\n+326\n+_\b3_\b2_\b7 namespace [[deprecated]] Transitional {\n+328\n+329 // this abomination checks whether the template signature matches the\n+special case\n+330 // ReferenceElement> and otherwise defers the\n+type lookup\n+331 // to a decltype on a call to referenceElement(std::declval())\n+332\n+337 template\n+338 using ReferenceElement = detected_or_fallback_t<\n+339 Impl::DefaultReferenceElement,\n+340 LookupReferenceElement,\n+341 T...\n+342 >;\n+343\n+344 }\n+345\n+346 template\n+_\b3_\b4_\b7 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval()...));\n+348\n+349} // namespace Dune\n+350\n+351#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n+_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+unspecified value type referenceElement(T &&... t)\n+Returns a reference element for the objects t....\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+decltype(referenceElement(std::declval< T >()...)) ReferenceElement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:347\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+This class provides access to geometric and topological properties of a\n+reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Class providing access to the singletons of the reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bb_\be_\bg_\bi_\bn\n+static Iterator begin()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:173\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n+Iterator iterator\n+Iterator over available reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:152\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename Container::ReferenceElement ReferenceElement\n+The reference element type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bu_\bb_\be\n+static const ReferenceElement & cube()\n+get hypercube reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:168\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\be_\bn_\bd\n+static Iterator end()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:178\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be\n+ctype_ ctype\n+The coordinate field type of the contained reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:131\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl\n+static const ReferenceElement & general(const GeometryType &type)\n+get general reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:156\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n+static const ReferenceElement & simplex()\n+get simplex reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:162\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+typename Container::const_iterator Iterator\n+Iterator over available reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+The dimension of the contained reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:137\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd\n+ctype CoordinateField\n+The coordinate field type of the contained reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:134\n+_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm\n+Static tag representing a dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:16\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bI_\bd\n-constexpr Id toId() const\n-Create an Id representation of this GeometryType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:210\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n-constexpr unsigned int dim() const\n-Return dimension of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n constexpr unsigned int id() const\n Return the topology id of the type.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bN_\bo_\bn_\be\n-constexpr bool isNone() const\n-Return true if entity is a singular of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:355\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n-Compute per-dimension indices for geometry types.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:25\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n-static constexpr std::size_t size(std::size_t dim)\n-Compute total number of geometry types for the given dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:61\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bt_\by_\bp_\be\n-static constexpr GeometryType type(std::size_t dim, std::size_t index)\n-compute the geometry type for the given local index and dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:79\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-static constexpr std::size_t index(const GeometryType >)\n-Compute the index for the given geometry type within its dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:73\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n-Compute indices for geometry types, taking the dimension into account.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:90\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-static constexpr std::size_t index(const GeometryType >)\n-Compute the index for the given geometry type over all dimensions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:138\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bo_\bf_\bf_\bs_\be_\bt\n-static constexpr std::size_t offset(std::size_t dim)\n-Compute the starting index for a given dimension including irregular geometry\n-types.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:113\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n-static constexpr std::size_t size(std::size_t maxdim)\n-Compute total number of geometry types up to and including the given dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:125\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00197.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00197.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: virtualrefinement.cc File Reference\n+dune-geometry: type.hh File Reference\n \n \n \n \n \n \n \n@@ -72,95 +72,53 @@\n
  • dune
  • geometry
  • \n \n \n
    \n \n-
    virtualrefinement.cc File Reference
    \n+
    type.hh File Reference
    \n
    \n
    \n \n-

    This file contains the virtual wrapper around refinement. \n+

    A unique label for each type of element that can occur in a grid. \n More...

    \n
    #include <cassert>
    \n-#include <typeinfo>
    \n+#include <cstdint>
    \n+#include <string>
    \n+#include <type_traits>
    \n #include <dune/common/exceptions.hh>
    \n-#include <dune/common/fvector.hh>
    \n-#include <dune/common/iteratorfacades.hh>
    \n-#include "type.hh"
    \n-#include "refinement.hh"
    \n+#include <dune/common/typetraits.hh>
    \n+#include <dune/common/unused.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >
     
    class  Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension >
     
    class  Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, dimension >
     
    class  Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, 0 >
     
    class  Dune::VirtualRefinement< dimension, CoordType >::SubEntityIteratorBack< dimension, CoordType >
     
    class  Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >
     
    class  Dune::VirtualRefinementImpSubEntityIteratorBackSpecial< topologyId, CoordType, coerceToId, dimension, dimension >
     
    class  Dune::VirtualRefinementImpSubEntityIteratorBackSpecial< topologyId, CoordType, coerceToId, dimension, 0 >
     
    class  Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::SubEntityIteratorBack< codimension >
     
    class  Dune::RefinementBuilder< dimension, CoordType >
     
    class  Dune::RefinementBuilder< 1, CoordType >
     
    class  Dune::RefinementBuilder< 3, CoordType >
    class  Dune::GeometryType
     Unique label for each type of entities that can occur in DUNE grids. More...
     
    \n \n \n \n-

    \n Namespaces

    namespace  Dune
     
    \n-\n-\n-\n+\n+\n+\n

    \n-Macros

    #define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
     
    namespace  Dune::GeometryTypes
     Predefined GeometryTypes for common geometries.
     
    \n \n-\n-\n-\n-\n+\n+\n+\n

    \n Functions

    template<int dimension, class CoordType >
    VirtualRefinement< dimension, CoordType > & Dune::buildRefinement (GeometryType geometryType, GeometryType coerceTo)
     return a reference to the VirtualRefinement according to the parameters
     
    std::ostream & Dune::operator<< (std::ostream &s, const GeometryType &a)
     Prints the type to an output stream.
     
    \n

    Detailed Description

    \n-

    This file contains the virtual wrapper around refinement.

    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_VIRTUALREFINEMENT_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n-
    \n-\n-
    \n-
    \n-
    \n+

    A unique label for each type of element that can occur in a grid.

    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,74 +1,36 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-virtualrefinement.cc File Reference\n-This file contains the virtual wrapper around refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+type.hh File Reference\n+A unique label for each type of element that can occur in a grid. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n-#include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n- _\b0_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b1_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b3_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+\u00a0 Unique label for each type of entities that can occur in DUNE grids.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bV_\bI_\bR_\bT_\bU_\bA_\bL_\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bC_\bC\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bs\n+\u00a0 Predefined _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bs for common geometries.\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt< dimension, CoordType > _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n- &\u00a0 geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n- return a reference to the\n-\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt according to the\n- parameters\n+std::ostream &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b< (std::ostream &s, const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &a)\n+\u00a0 Prints the type to an output stream.\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the virtual wrapper around refinement.\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_V\bVI\bIR\bRT\bTU\bUA\bAL\bLR\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n+A unique label for each type of element that can occur in a grid.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00197_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00197_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: virtualrefinement.cc Source File\n+dune-geometry: type.hh Source File\n \n \n \n \n \n \n \n@@ -74,817 +74,477 @@\n \n
    \n \n
    \n \n
    \n-
    virtualrefinement.cc
    \n+
    type.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5
    \n-
    6#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n-
    7#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n-
    8
    \n-
    14#include <cassert>
    \n-
    15#include <typeinfo>
    \n-
    16
    \n-
    17#include <dune/common/exceptions.hh>
    \n-
    18#include <dune/common/fvector.hh>
    \n-
    19#include <dune/common/iteratorfacades.hh>
    \n-
    20
    \n-
    21#include "type.hh"
    \n-
    22#include "refinement.hh"
    \n-
    23
    \n-
    24namespace Dune
    \n-
    25{
    \n-
    26 // //////////////////////////////////////////
    \n-
    27 //
    \n-
    28 // The virtual base class and its iterators
    \n-
    29 //
    \n-
    30
    \n-
    31 //
    \n-
    32 // Refinement
    \n-
    33 //
    \n-
    34
    \n-
    35 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-\n-
    39 {
    \n-
    40 return VertexIterator(vBeginBack(tag));
    \n-
    41 }
    \n-
    \n-
    42
    \n-
    43 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-\n-
    47 {
    \n-
    48 return VertexIterator(vEndBack(tag));
    \n-
    49 }
    \n-
    \n-
    50
    \n-
    51 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-\n-
    55 {
    \n-
    56 return ElementIterator(eBeginBack(tag));
    \n-
    57 }
    \n-
    \n-
    58
    \n-
    59 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-\n-
    63 {
    \n-
    64 return ElementIterator(eEndBack(tag));
    \n-
    65 }
    \n-
    \n-
    66
    \n-
    67 //
    \n-
    68 // The iterators
    \n-
    69 //
    \n-
    70
    \n-
    71 template<int dimension, class CoordType, int codimension>
    \n-\n-
    73
    \n-
    74 // The iterator for vertices
    \n-
    75 template<int dimension, class CoordType>
    \n-
    \n-
    76 class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>
    \n-
    77 {};
    \n-
    \n-
    78
    \n-
    79 // The iterator for elements
    \n-
    80 template<int dimension, class CoordType>
    \n-
    \n-
    81 class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, 0>
    \n-
    82 {
    \n-
    83 public:
    \n-\n-
    85 typedef typename Refinement::template Codim<0>::SubEntityIterator Common;
    \n-
    86 typedef typename Refinement::IndexVector IndexVector;
    \n-
    87
    \n-
    88 IndexVector vertexIndices() const;
    \n-
    89 };
    \n-
    \n-
    90
    \n-
    91 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    94 vertexIndices() const
    \n-
    95 {
    \n-
    96 return static_cast<const Common *>(this)->backend->vertexIndices();
    \n-
    97 }
    \n-
    \n-
    98
    \n-
    99 // The iterator common stuff
    \n-
    100 template<int dimension, class CoordType>
    \n-
    101 template<int codimension>
    \n-
    \n-
    102 class VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    103 : public ForwardIteratorFacade<typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    104 public VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>
    \n-
    105 {
    \n-
    106 public:
    \n-\n-
    108 typedef typename Refinement::template Codim<codimension>::SubEntityIterator This;
    \n-
    109 typedef typename Refinement::template SubEntityIteratorBack<codimension> IteratorBack;
    \n-
    110 typedef typename Refinement::CoordVector CoordVector;
    \n-
    111
    \n-\n-
    113 SubEntityIterator(const This &other);
    \n-\n-
    115
    \n-
    116 This &operator=(const This &other);
    \n-
    117
    \n-
    118 bool equals(const This &other) const;
    \n-
    119 void increment();
    \n-
    120
    \n-
    121 int index() const;
    \n-
    122
    \n-
    123 // If you simply use an unqualified CoordVector here g++-4.2 chokes
    \n-\n-
    125 CoordVector coords() const;
    \n-
    126 private:
    \n-
    127 friend class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>;
    \n-
    128 IteratorBack *backend;
    \n-
    129 };
    \n+
    5#ifndef DUNE_GEOMETRY_TYPE_HH
    \n+
    6#define DUNE_GEOMETRY_TYPE_HH
    \n+
    7
    \n+
    12#include <cassert>
    \n+
    13#include <cstdint>
    \n+
    14
    \n+
    15#include <string>
    \n+
    16#include <type_traits>
    \n+
    17
    \n+
    18#include <dune/common/exceptions.hh>
    \n+
    19#include <dune/common/typetraits.hh>
    \n+
    20#include <dune/common/unused.hh>
    \n+
    21
    \n+
    22namespace Dune
    \n+
    23{
    \n+
    24
    \n+
    25 namespace Impl
    \n+
    26 {
    \n+
    27
    \n+
    28 enum TopologyConstruction { pyramidConstruction = 0, prismConstruction = 1 };
    \n+
    29
    \n+
    30 // Dynamic Topology Properties
    \n+
    31 // ---------------------------
    \n+
    32
    \n+
    41 inline static unsigned int numTopologies ( int dim ) noexcept
    \n+
    42 {
    \n+
    43 return (1u << dim);
    \n+
    44 }
    \n+
    45
    \n+
    57 inline bool static isPyramid ( unsigned int topologyId, int dim, int codim = 0 ) noexcept
    \n+
    58 {
    \n+
    59 assert( (dim > 0) && (topologyId < numTopologies( dim )) );
    \n+
    60 assert( (0 <= codim) && (codim < dim) );
    \n+
    61 return (((topologyId & ~1) & (1u << (dim-codim-1))) == 0);
    \n+
    62 }
    \n+
    63
    \n+
    75 inline static bool isPrism ( unsigned int topologyId, int dim, int codim = 0 ) noexcept
    \n+
    76 {
    \n+
    77 assert( (dim > 0) && (topologyId < numTopologies( dim )) );
    \n+
    78 assert( (0 <= codim) && (codim < dim) );
    \n+
    79 return (( (topologyId | 1) & (1u << (dim-codim-1))) != 0);
    \n+
    80 }
    \n+
    81
    \n+
    89 inline static unsigned int baseTopologyId ( unsigned int topologyId, int dim, int codim = 1 ) noexcept
    \n+
    90 {
    \n+
    91 assert( (dim >= 0) && (topologyId < numTopologies( dim )) );
    \n+
    92 assert( (0 <= codim) && (codim <= dim) );
    \n+
    93 return topologyId & ((1u << (dim-codim)) - 1);
    \n+
    94 }
    \n+
    95
    \n+
    96 } // namespace Impl
    \n+
    97
    \n+
    98 // GeometryType
    \n+
    99 // -------------
    \n+
    100
    \n+
    \n+\n+
    114 {
    \n+
    115 public:
    \n+
    116
    \n+
    \n+
    119 enum
    \n+
    120 BasicType {
    \n+\n+\n+\n+\n+\n+
    126 none
    \n+
    127 };
    \n
    \n+
    128
    \n+
    129 private:
    \n
    130
    \n-
    131#ifndef DOXYGEN
    \n-
    132 template<int dimension, class CoordType>
    \n-
    133 template<int codimension>
    \n-\n-
    135 SubEntityIterator(IteratorBack *backend_)
    \n-
    136 : backend(backend_)
    \n-
    137 {}
    \n-
    138
    \n-
    139 template<int dimension, class CoordType>
    \n-
    140 template<int codimension>
    \n-\n-
    142 SubEntityIterator(const This &other)
    \n-
    143 : backend(other.backend->clone())
    \n-
    144 {}
    \n-
    145
    \n-
    146 template<int dimension, class CoordType>
    \n-
    147 template<int codimension>
    \n-
    148 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    149 ~SubEntityIterator()
    \n-
    150 {
    \n-
    151 delete backend;
    \n-
    152 }
    \n-
    153
    \n-
    154 template<int dimension, class CoordType>
    \n-
    155 template<int codimension>
    \n-
    156 typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator &
    \n-
    157 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    158 operator=(const This &other)
    \n-
    159 {
    \n-
    160 delete backend;
    \n-
    161 backend = other.backend->clone();
    \n-
    162 }
    \n-
    163
    \n-
    164 template<int dimension, class CoordType>
    \n-
    165 template<int codimension>
    \n-
    166 bool
    \n-
    167 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    168 equals(const This &other) const
    \n-
    169 { return *backend == *(other.backend); }
    \n-
    170
    \n-
    171 template<int dimension, class CoordType>
    \n-
    172 template<int codimension>
    \n-
    173 void
    \n-
    174 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    175 increment()
    \n-
    176 {
    \n-
    177 ++*backend;
    \n-
    178 }
    \n-
    179
    \n-
    180 template<int dimension, class CoordType>
    \n-
    181 template<int codimension>
    \n-
    182 int
    \n-
    183 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    184 index() const
    \n-
    185 { return backend->index(); }
    \n-
    186
    \n-
    187 template<int dimension, class CoordType>
    \n-
    188 template<int codimension>
    \n-
    189 typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator::CoordVector
    \n-
    190 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    191 coords() const
    \n-
    192 { return backend->coords(); }
    \n-
    193#endif // DOXYGEN
    \n-
    194
    \n-
    195 //
    \n-
    196 // The iterator backend
    \n-
    197 //
    \n-
    198
    \n-
    199 template<int dimension, class CoordType, int codimension>
    \n-\n-
    201
    \n-
    202 // The iterator backend for vertices
    \n-
    203 template<int dimension, class CoordType>
    \n-
    \n-
    204 class VirtualRefinementSubEntityIteratorBackSpecial<dimension, CoordType, dimension>
    \n-
    205 {
    \n-
    206 public:
    \n-
    207
    \n-\n-
    210 };
    \n-
    \n-
    211
    \n-
    212 // The iterator backend for elements
    \n-
    213 template<int dimension, class CoordType>
    \n-
    \n-\n-
    215 {
    \n-
    216 public:
    \n-\n-
    218 typedef typename Refinement::IndexVector IndexVector;
    \n-
    219
    \n-
    220 virtual IndexVector vertexIndices() const = 0;
    \n-
    221
    \n-
    \n-\n-
    223 {}
    \n+
    132 unsigned char dim_;
    \n+
    133
    \n+
    135 bool none_;
    \n+
    136
    \n+
    138 unsigned int topologyId_;
    \n+
    139
    \n+
    140 // Internal type used for the Id. The exact nature of this type is kept
    \n+
    141 // as an implementation detail on purpose. We use a scoped enum here because scoped enums
    \n+
    142 // can be used as template parameters, but are not implicitly converted to other integral
    \n+
    143 // types by the compiler. That way, we avoid unfortunate implicit conversion chains, e.g.
    \n+
    144 // people trying to work with GlobalGeometryTypeIndex, but forgetting to actually call
    \n+
    145 // GlobalGeometryTypeIndex::index(gt) and just using gt directly.
    \n+
    146 enum class IdType : std::uint64_t
    \n+
    147 {};
    \n+
    148
    \n+
    149 public:
    \n+
    150
    \n+
    181 using Id = IdType;
    \n+
    182
    \n+
    \n+
    190 constexpr operator Id() const
    \n+
    191 {
    \n+
    192 // recreate the exact storage layout that this class is using, making conversion
    \n+
    193 // extremely cheap
    \n+
    194 std::uint64_t id = dim_ | (std::uint64_t(none_) << 8) | (std::uint64_t(topologyId_) << 32);
    \n+
    195 return static_cast<Id>(id);
    \n+
    196 }
    \n+
    \n+
    197
    \n+
    \n+
    210 constexpr Id toId() const
    \n+
    211 {
    \n+
    212 return static_cast<Id>(*this);
    \n+
    213 }
    \n
    \n-
    224 };
    \n+
    214
    \n+
    \n+
    222 constexpr GeometryType(Id id)
    \n+
    223 : dim_(static_cast<std::uint64_t>(id) & 0xFF)
    \n+
    224 , none_(static_cast<std::uint64_t>(id) & 0x100)
    \n+
    225 , topologyId_(static_cast<std::uint64_t>(id) >> 32)
    \n+
    226 {}
    \n+
    \n+
    227
    \n+
    230
    \n+
    \n+
    232 constexpr GeometryType ()
    \n+
    233 : dim_(0), none_(true), topologyId_(0)
    \n+
    234 {}
    \n+
    \n+
    235
    \n+
    \n+
    242 constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)
    \n+
    243 : dim_(dim), none_(isNone), topologyId_(topologyId)
    \n+
    244 {}
    \n+
    \n+
    245
    \n+
    \n+
    251 constexpr GeometryType(unsigned int topologyId, unsigned int dim)
    \n+
    252 : dim_(dim), none_(false), topologyId_(topologyId)
    \n+
    253 {}
    \n+
    \n+
    254
    \n+
    265 template<class TopologyType,
    \n+
    266 class = std::void_t<decltype(TopologyType::dimension), decltype(TopologyType::id)>>
    \n+
    \n+
    267 explicit GeometryType(TopologyType t)
    \n+
    268 : dim_(TopologyType::dimension), none_(false), topologyId_(TopologyType::id)
    \n+
    269 {
    \n+
    270 DUNE_UNUSED_PARAMETER(t);
    \n+
    271 }
    \n
    \n-
    225
    \n-
    226 // The iterator backend common stuff
    \n-
    227 template<int dimension, class CoordType>
    \n-
    228 template<int codimension>
    \n-
    \n-
    229 class VirtualRefinement<dimension, CoordType>::SubEntityIteratorBack
    \n-
    230 : public VirtualRefinementSubEntityIteratorBackSpecial<dimension, CoordType, codimension>
    \n-
    231 {
    \n-
    232 public:
    \n-\n-
    234 typedef typename Refinement::template SubEntityIteratorBack<codimension> This;
    \n-
    235 typedef typename Refinement::CoordVector CoordVector;
    \n-
    236
    \n-\n-
    238
    \n-
    239 virtual This *clone() const = 0;
    \n-
    240
    \n-
    241 virtual bool operator==(const This &other) const = 0;
    \n-
    242 virtual This &operator++() = 0;
    \n-
    243
    \n-
    244 virtual int index() const = 0;
    \n-
    245 virtual CoordVector coords() const = 0;
    \n-
    246 };
    \n-
    \n-
    247
    \n-
    248 // /////////////////////////////////////////////////
    \n-
    249 //
    \n-
    250 // The derived classes and their iterator backends
    \n-
    251 //
    \n-
    252
    \n-
    253 //
    \n-
    254 // The refinement implementation
    \n-
    255 //
    \n-
    256
    \n-
    257 template<unsigned topologyId, class CoordType,
    \n-
    258 unsigned coerceToId, int dimension>
    \n-
    \n-\n-
    260 : public Dune::VirtualRefinement<dimension, CoordType>
    \n-
    261 {
    \n-
    262 public:
    \n-\n-\n-
    265
    \n-
    266 template<int codimension>
    \n-\n-
    268
    \n-
    269 int nVertices(Dune::RefinementIntervals tag) const override;
    \n-
    270
    \n-
    271 int nElements(Dune::RefinementIntervals tag) const override;
    \n
    272
    \n-\n-
    274 private:
    \n-\n-
    276
    \n-
    277 typename VirtualRefinement::VertexIteratorBack *vBeginBack(Dune::RefinementIntervals tag) const override;
    \n-
    278 typename VirtualRefinement::VertexIteratorBack *vEndBack(Dune::RefinementIntervals tag) const override;
    \n-
    279 typename VirtualRefinement::ElementIteratorBack *eBeginBack(Dune::RefinementIntervals tag) const override;
    \n-
    280 typename VirtualRefinement::ElementIteratorBack *eEndBack(Dune::RefinementIntervals tag) const override;
    \n-
    281 };
    \n+
    \n+
    279 constexpr bool isVertex() const {
    \n+
    280 return dim_==0;
    \n+
    281 }
    \n
    \n
    282
    \n-
    283 template<unsigned topologyId, class CoordType,
    \n-
    284 unsigned coerceToId, int dimension>
    \n-
    285 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension> &
    \n-
    \n-\n-
    287 {
    \n-
    288 static VirtualRefinementImp instance_{};
    \n-
    289 return instance_;
    \n-
    290 }
    \n-
    \n-
    291
    \n-
    292 template<unsigned topologyId, class CoordType,
    \n-
    293 unsigned coerceToId, int dimension>
    \n+
    \n+
    284 constexpr bool isLine() const {
    \n+
    285 return dim_==1;
    \n+
    286 }
    \n+
    \n+
    287
    \n+
    \n+
    289 constexpr bool isTriangle() const {
    \n+
    290 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0001;
    \n+
    291 }
    \n+
    \n+
    292
    \n \n-
    299
    \n-
    300 template<unsigned topologyId, class CoordType,
    \n-
    301 unsigned coerceToId, int dimension>
    \n-\n-\n-\n-
    305 {
    \n-
    306 return new SubEntityIteratorBack<dimension>(StaticRefinement::vBegin(tag));
    \n-
    307 }
    \n-
    308
    \n-
    309 template<unsigned topologyId, class CoordType,
    \n-
    310 unsigned coerceToId, int dimension>
    \n-\n-
    312 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::
    \n-
    313 vEndBack(Dune::RefinementIntervals tag) const
    \n-
    314 {
    \n-
    315 return new SubEntityIteratorBack<dimension>(StaticRefinement::vEnd(tag));
    \n-
    316 }
    \n+
    294 constexpr bool isQuadrilateral() const {
    \n+
    295 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0011;
    \n+
    296 }
    \n+
    \n+
    297
    \n+
    \n+
    299 constexpr bool isTetrahedron() const {
    \n+
    300 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0001;
    \n+
    301 }
    \n+
    \n+
    302
    \n+
    \n+
    304 constexpr bool isPyramid() const {
    \n+
    305 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0011;
    \n+
    306 }
    \n+
    \n+
    307
    \n+
    \n+
    309 constexpr bool isPrism() const {
    \n+
    310 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0101;
    \n+
    311 }
    \n+
    \n+
    312
    \n+
    \n+
    314 constexpr bool isHexahedron() const {
    \n+
    315 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0111;
    \n+
    316 }
    \n+
    \n
    317
    \n-
    318 template<unsigned topologyId, class CoordType,
    \n-
    319 unsigned coerceToId, int dimension>
    \n-\n-
    324
    \n-
    325 template<unsigned topologyId, class CoordType,
    \n-
    326 unsigned coerceToId, int dimension>
    \n-\n-\n-\n-
    330 {
    \n-
    331 return new SubEntityIteratorBack<0>(StaticRefinement::eBegin(tag));
    \n-
    332 }
    \n-
    333
    \n-
    334 template<unsigned topologyId, class CoordType,
    \n-
    335 unsigned coerceToId, int dimension>
    \n-\n-
    337 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::
    \n-
    338 eEndBack(Dune::RefinementIntervals tag) const
    \n-
    339 {
    \n-
    340 return new SubEntityIteratorBack<0>(StaticRefinement::eEnd(tag));
    \n-
    341 }
    \n-
    342
    \n-
    343 //
    \n-
    344 // The iterator backend implementation
    \n-
    345 //
    \n-
    346
    \n-
    347 // The iterator backend implementation specialties
    \n-
    348 template<unsigned topologyId, class CoordType,
    \n-
    349 unsigned coerceToId, int dimension, int codimension>
    \n-\n-
    351
    \n-
    352 // The iterator backend implementation specialties for vertices
    \n-
    353 template<unsigned topologyId, class CoordType,
    \n-
    354 unsigned coerceToId, int dimension>
    \n-
    \n-
    355 class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, dimension>
    \n-
    356 : public VirtualRefinement<dimension, CoordType>::template SubEntityIteratorBack<dimension>
    \n-
    357 {};
    \n+
    \n+
    319 constexpr bool isSimplex() const {
    \n+
    320 return ! none_ && (topologyId_ | 1) == 1;
    \n+
    321 }
    \n+
    \n+
    322
    \n+
    \n+
    324 constexpr bool isCube() const {
    \n+
    325 return ! none_ && ((topologyId_ ^ ((1 << dim_)-1)) >> 1 == 0);
    \n+
    326 }
    \n+
    \n+
    327
    \n+
    \n+
    329 constexpr bool isConical() const {
    \n+
    330 return ! none_ && (((topologyId_ & ~1) & (1u << (dim_-1))) == 0);
    \n+
    331 }
    \n+
    \n+
    332
    \n+
    \n+
    337 constexpr bool isConical(const int& step) const {
    \n+
    338 return ! none_ && (((topologyId_ & ~1) & (1u << step)) == 0);
    \n+
    339 }
    \n+
    \n+
    340
    \n+
    \n+
    342 constexpr bool isPrismatic() const {
    \n+
    343 return ! none_ && (( (topologyId_ | 1) & (1u << (dim_-1))) != 0);
    \n+
    344 }
    \n+
    \n+
    345
    \n+
    \n+
    350 constexpr bool isPrismatic(const int& step) const {
    \n+
    351 return ! none_ && (( (topologyId_ | 1) & (1u << step)) != 0);
    \n+
    352 }
    \n+
    \n+
    353
    \n+
    \n+
    355 constexpr bool isNone() const {
    \n+
    356 return none_;
    \n+
    357 }
    \n
    \n
    358
    \n-
    359 // The iterator backend implementation specialties for elements
    \n-
    360
    \n-
    361 template<unsigned topologyId, class CoordType,
    \n-
    362 unsigned coerceToId, int dimension>
    \n-
    \n-
    363 class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, 0>
    \n-
    364 : public VirtualRefinement<dimension, CoordType>::template SubEntityIteratorBack<0>
    \n-
    365 {
    \n-
    366 public:
    \n-\n-
    368 typedef typename VirtualRefinementImp::template SubEntityIteratorBack<0> Common;
    \n-\n-\n-
    371 typedef typename RefinementBase::IndexVector IndexVector;
    \n-
    372
    \n-
    373 IndexVector vertexIndices() const;
    \n-
    374 };
    \n-
    \n-
    375
    \n-
    376 template<unsigned topologyId, class CoordType,
    \n-
    377 unsigned coerceToId, int dimension>
    \n-\n-
    \n-\n-
    380 vertexIndices() const
    \n-
    381 {
    \n-
    382 IndexVector vIndices;
    \n-
    383 vIndices.reserve(StaticRefinement::IndexVector::dimension);
    \n-
    384
    \n-
    385 typename StaticRefinement::IndexVector sIndices = static_cast<const Common *>(this)->backend.vertexIndices();
    \n-
    386 for(int i = 0; i < StaticRefinement::IndexVector::dimension; ++i)
    \n-
    387 vIndices.push_back(sIndices[i]);
    \n-
    388 return vIndices;
    \n-
    389 }
    \n-
    \n-
    390
    \n-
    391 // The shared iterator backend implementation
    \n-
    392 template<unsigned topologyId, class CoordType,
    \n-
    393 unsigned coerceToId, int dimension>
    \n-
    394 template<int codimension>
    \n-
    \n-
    395 class VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::SubEntityIteratorBack
    \n-
    396 : public VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>
    \n-
    397 {
    \n-
    398 public:
    \n-
    399 typedef typename StaticRefinement::template Codim<codimension>::SubEntityIterator BackendIterator;
    \n-\n-
    401 typedef typename VirtualRefinement::template SubEntityIteratorBack<codimension> Base;
    \n-\n-
    403
    \n-\n-
    405 SubEntityIteratorBack(const This &other);
    \n-
    406
    \n-
    407 Base *clone() const;
    \n+
    \n+
    360 constexpr unsigned int dim() const {
    \n+
    361 return dim_;
    \n+
    362 }
    \n+
    \n+
    363
    \n+
    \n+
    365 constexpr unsigned int id() const {
    \n+
    366 return topologyId_;
    \n+
    367 }
    \n+
    \n+
    368
    \n+
    373
    \n+
    \n+
    377 constexpr bool operator==(const GeometryType& other) const {
    \n+
    378 return ( ( none_ == other.none_ )
    \n+
    379 && ( ( none_ == true )
    \n+
    380 || ( ( dim_ == other.dim_ )
    \n+
    381 && ( (topologyId_ >> 1) == (other.topologyId_ >> 1) )
    \n+
    382 )
    \n+
    383 )
    \n+
    384 );
    \n+
    385 }
    \n+
    \n+
    386
    \n+
    \n+
    388 constexpr bool operator!=(const GeometryType& other) const {
    \n+
    389 return ! ((*this)==other);
    \n+
    390 }
    \n+
    \n+
    391
    \n+
    \n+
    393 constexpr bool operator < (const GeometryType& other) const {
    \n+
    394 return ( ( none_ < other.none_ )
    \n+
    395 || ( !( other.none_ < none_ )
    \n+
    396 && ( ( dim_ < other.dim_ )
    \n+
    397 || ( (other.dim_ == dim_)
    \n+
    398 && ((topologyId_ >> 1) < (other.topologyId_ >> 1) )
    \n+
    399 )
    \n+
    400 )
    \n+
    401 )
    \n+
    402 );
    \n+
    403 }
    \n+
    \n+
    404
    \n+
    407 };
    \n+
    \n
    408
    \n-
    409 bool operator==(const Base &other) const;
    \n-
    410 Base &operator++();
    \n-
    411
    \n-
    412 int index() const;
    \n-
    413 CoordVector coords() const;
    \n-
    414
    \n-
    415 private:
    \n-
    416 friend class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>;
    \n-
    417 BackendIterator backend;
    \n-
    418 };
    \n-
    \n-
    419
    \n-
    420 template<unsigned topologyId, class CoordType,
    \n-
    421 unsigned coerceToId, int dimension>
    \n-
    422 template<int codimension>
    \n-\n-
    427
    \n-
    428 template<unsigned topologyId, class CoordType,
    \n-
    429 unsigned coerceToId, int dimension>
    \n-
    430 template<int codimension>
    \n-
    \n-\n-
    432 SubEntityIteratorBack(const This &other)
    \n-
    433 : VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>(other),
    \n-
    434 backend(other.backend)
    \n-
    435 {}
    \n-
    \n-
    436
    \n-
    437 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n-
    438 template<int codimension>
    \n-\n-
    \n-\n-
    441 clone() const
    \n-
    442 { return new This(*this); }
    \n+
    \n+
    410 inline std::ostream& operator<< (std::ostream& s, const GeometryType& a)
    \n+
    411 {
    \n+
    412 if (a.isSimplex())
    \n+
    413 {
    \n+
    414 s << "(simplex, " << a.dim() << ")";
    \n+
    415 return s;
    \n+
    416 }
    \n+
    417 if (a.isCube())
    \n+
    418 {
    \n+
    419 s << "(cube, " << a.dim() << ")";
    \n+
    420 return s;
    \n+
    421 }
    \n+
    422 if (a.isPyramid())
    \n+
    423 {
    \n+
    424 s << "(pyramid, 3)";
    \n+
    425 return s;
    \n+
    426 }
    \n+
    427 if (a.isPrism())
    \n+
    428 {
    \n+
    429 s << "(prism, 3)";
    \n+
    430 return s;
    \n+
    431 }
    \n+
    432 if (a.isNone())
    \n+
    433 {
    \n+
    434 s << "(none, " << a.dim() << ")";
    \n+
    435 return s;
    \n+
    436 }
    \n+
    437 s << "(other [" << a.id() << "], " << a.dim() << ")";
    \n+
    438 return s;
    \n+
    439 }
    \n
    \n+
    440
    \n+
    441
    \n
    443
    \n-
    444 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n-
    445 template<int codimension>
    \n-
    446 bool
    \n
    \n-\n-
    448 operator==(const Base &other) const
    \n-
    449 {
    \n-
    450 try {
    \n-
    451 return backend == dynamic_cast<const This &>(other).backend;
    \n-
    452 }
    \n-
    453 catch(const std::bad_cast&)
    \n+
    447 namespace GeometryTypes {
    \n+
    448
    \n+
    450
    \n+
    453 inline constexpr GeometryType simplex(unsigned int dim)
    \n
    454 {
    \n-
    455 return false;
    \n+
    455 return GeometryType(0,dim,false);
    \n
    456 }
    \n-
    457 }
    \n-
    \n-
    458
    \n-
    459 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n-
    460 template<int codimension>
    \n-\n-\n+
    457
    \n+
    459
    \n+
    462 inline constexpr GeometryType cube(unsigned int dim)
    \n+
    463 {
    \n+
    464 return GeometryType(((dim>1) ? ((1 << dim) - 1) : 0),dim,false);
    \n+
    465 }
    \n+
    466
    \n
    468
    \n-
    469 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n-
    470 template<int codimension>
    \n-
    471 int
    \n-\n+
    471 inline constexpr GeometryType none(unsigned int dim)
    \n+
    472 {
    \n+
    473 return GeometryType(0,dim,true);
    \n+
    474 }
    \n
    475
    \n-
    476 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n-
    477 template<int codimension>
    \n-\n-\n-
    482
    \n-
    483 // ////////////////////////
    \n-
    484 //
    \n-
    485 // The refinement builder
    \n-
    486 //
    \n+
    477 inline constexpr GeometryType conicalExtension(const GeometryType& gt)
    \n+
    478 {
    \n+
    479 return GeometryType(gt.id(), gt.dim()+1, gt.isNone());
    \n+
    480 }
    \n+
    481
    \n+
    483 inline constexpr GeometryType prismaticExtension(const GeometryType& gt)
    \n+
    484 {
    \n+
    485 return GeometryType(gt.id() | ((1 << gt.dim())), gt.dim()+1, gt.isNone());
    \n+
    486 }
    \n
    487
    \n-
    488 template<int dimension, class CoordType>
    \n-
    489 class RefinementBuilder;
    \n-
    490
    \n-
    501 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    504 GeometryType geometryType,
    \n-
    506 GeometryType coerceTo)
    \n-
    507 {
    \n-
    508 // Check that the user used valid geometry types
    \n-
    509 assert(geometryType.dim() == dimension && coerceTo.dim() == dimension);
    \n-
    510 return RefinementBuilder<dimension, CoordType>::build( geometryType.id(), coerceTo.id() );
    \n-
    511 }
    \n-
    \n-
    512
    \n-
    513 // In principle the trick with the class is no longer necessary,
    \n-
    514 // but I'm keeping it in here so it will be easier to specialize
    \n-
    515 // buildRefinement when someone implements pyramids and prisms
    \n-
    516 template<int dimension, class CoordType>
    \n-
    \n-\n-
    518 {
    \n-
    519 public:
    \n-
    520 static
    \n-\n-
    \n-
    522 build(unsigned topologyId, unsigned coerceToId)
    \n-
    523 {
    \n-
    524 topologyId &= ~1;
    \n-
    525 coerceToId &= ~1;
    \n-
    526
    \n-
    527 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n-
    528 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;
    \n+
    489
    \n+
    492 inline constexpr GeometryType vertex = GeometryType(0,0,false);
    \n+
    493
    \n+
    495
    \n+
    498 inline constexpr GeometryType line = GeometryType(0,1,false);
    \n+
    499
    \n+
    501
    \n+
    504 inline constexpr GeometryType triangle = simplex(2);
    \n+
    505
    \n+
    507
    \n+
    510 inline constexpr GeometryType quadrilateral = cube(2);
    \n+
    511
    \n+
    513
    \n+
    516 inline constexpr GeometryType tetrahedron = simplex(3);
    \n+
    517
    \n+
    519
    \n+
    522 inline constexpr GeometryType pyramid = GeometryType(0b0011,3,false);
    \n+
    523
    \n+
    525
    \n+
    528 inline constexpr GeometryType prism = GeometryType(0b0101,3,false);
    \n
    529
    \n-
    530 switch( topologyId )
    \n-
    531 {
    \n-
    532 //case GeometryType::simplex:
    \n-
    533 case idSimplex :
    \n-
    534 //switch( coerceTo )
    \n-
    535 switch( coerceToId )
    \n-
    536 {
    \n-
    537 //case GeometryType::simplex:
    \n-
    538 case idSimplex :
    \n-\n-
    540 default :
    \n-
    541 break;
    \n-
    542 }
    \n-
    543 break;
    \n-
    544
    \n-
    545 //case GeometryType::cube:
    \n-
    546 case idCube :
    \n-
    547 switch( coerceToId )
    \n-
    548 {
    \n-
    549 case idSimplex :
    \n-\n-
    551 case idCube :
    \n-\n-
    553 default :
    \n-
    554 break;
    \n-
    555 }
    \n-
    556 break;
    \n-
    557
    \n-
    558 default :
    \n-
    559 break;
    \n-
    560 }
    \n-
    561 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n-
    562 << coerceToId << " >.");
    \n-
    563 }
    \n-
    \n-
    564 };
    \n-
    \n+
    531
    \n+
    534 inline constexpr GeometryType hexahedron = cube(3);
    \n+
    535
    \n+
    536 }
    \n+
    \n+
    537
    \n+
    538 namespace Impl
    \n+
    539 {
    \n+
    540
    \n+
    542 inline constexpr GeometryType getBase(const GeometryType& gt) {
    \n+
    543 return GeometryType(gt.id() & ((1 << (gt.dim()-1))-1), gt.dim()-1, gt.isNone());
    \n+
    544 }
    \n+
    545
    \n+
    546
    \n+
    547 // IfGeometryType
    \n+
    548 // ----------
    \n+
    549
    \n+
    550 template< template< GeometryType::Id > class Operation, int dim, GeometryType::Id geometryId = GeometryTypes::vertex >
    \n+
    551 struct IfGeometryType
    \n+
    552 {
    \n+
    553 static constexpr GeometryType geometry = geometryId;
    \n+
    554 template< class... Args >
    \n+
    555 static auto apply ( GeometryType gt, Args &&... args )
    \n+
    556 {
    \n+
    557 GeometryType lowerGeometry(gt.id() >>1 , gt.dim()-1, gt.isNone());
    \n+
    558
    \n+
    559 if( gt.id() & 1 )
    \n+
    560 return IfGeometryType< Operation, dim-1, GeometryTypes::prismaticExtension(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );
    \n+
    561 else
    \n+
    562 return IfGeometryType< Operation, dim-1, GeometryTypes::conicalExtension(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );
    \n+
    563 }
    \n+
    564 };
    \n
    565
    \n-
    566 template<class CoordType>
    \n-
    \n-
    567 class RefinementBuilder<1, CoordType>
    \n-
    568 {
    \n-
    569 static const std::size_t dimension = 1;
    \n-
    570 public:
    \n-
    571 static
    \n-\n-
    \n-
    573 build(unsigned topologyId, unsigned coerceToId)
    \n-
    574 {
    \n-
    575 topologyId &= ~1;
    \n-
    576 coerceToId &= ~1;
    \n+
    566 template< template< GeometryType::Id > class Operation, GeometryType::Id geometryId >
    \n+
    567 struct IfGeometryType< Operation, 0, geometryId>
    \n+
    568 {
    \n+
    569 template< class... Args >
    \n+
    570 static auto apply ([[maybe_unused]] GeometryType gt, Args &&... args )
    \n+
    571 {
    \n+
    572 return Operation< geometryId >::apply( std::forward< Args >( args )... );
    \n+
    573 }
    \n+
    574 };
    \n+
    575 } // namespace Impl
    \n+
    576} // namespace Dune
    \n
    577
    \n-
    578 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n-
    579
    \n-
    580 if (topologyId == 0 && coerceToId == 0)
    \n-\n-
    582
    \n-
    583 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n-
    584 << coerceToId << " >.");
    \n-
    585 }
    \n-
    \n-
    586 };
    \n-
    \n-
    587
    \n-
    588 template<class CoordType>
    \n-
    \n-
    589 class RefinementBuilder<3, CoordType>
    \n-
    590 {
    \n-
    591 static const std::size_t dimension = 3;
    \n-
    592 public:
    \n-
    593 static
    \n-\n-
    \n-
    595 build(unsigned topologyId, unsigned coerceToId)
    \n-
    596 {
    \n-
    597 topologyId &= ~1;
    \n-
    598 coerceToId &= ~1;
    \n-
    599
    \n-
    600 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n-
    601 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;
    \n-
    602 constexpr unsigned idPrism = GeometryTypes::prism.id() & ~1;
    \n-
    603 constexpr unsigned idPyramid = GeometryTypes::pyramid.id() & ~1;
    \n-
    604
    \n-
    605 switch( topologyId )
    \n-
    606 {
    \n-
    607 //case GeometryType::simplex:
    \n-
    608 case idSimplex :
    \n-
    609 //switch( coerceTo )
    \n-
    610 switch( coerceToId )
    \n-
    611 {
    \n-
    612 //case GeometryType::simplex:
    \n-
    613 case idSimplex :
    \n-\n-
    615 default :
    \n-
    616 break;
    \n-
    617 }
    \n-
    618 break;
    \n-
    619
    \n-
    620 //case GeometryType::cube:
    \n-
    621 case idCube :
    \n-
    622 switch( coerceToId )
    \n-
    623 {
    \n-
    624 case idSimplex :
    \n-\n-
    626 case idCube :
    \n-\n-
    628 default :
    \n-
    629 break;
    \n-
    630 }
    \n-
    631 break;
    \n-
    632
    \n-
    633 //case GeometryType::prism:
    \n-
    634 case idPrism :
    \n-
    635 switch( coerceToId )
    \n-
    636 {
    \n-
    637 case idSimplex :
    \n-\n-
    639 default :
    \n-
    640 break;
    \n-
    641 }
    \n-
    642 break;
    \n-
    643
    \n-
    644 //case GeometryType::pyramid:
    \n-
    645 case idPyramid :
    \n-
    646 switch( coerceToId )
    \n-
    647 {
    \n-
    648 case idSimplex :
    \n-\n-
    650 default :
    \n-
    651 break;
    \n-
    652 }
    \n-
    653 break;
    \n-
    654
    \n-
    655 default :
    \n-
    656 break;
    \n-
    657 }
    \n-
    658 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n-
    659 << coerceToId << " >.");
    \n-
    660 }
    \n-
    \n-
    661 };
    \n-
    \n-
    662
    \n-
    663} // namespace Dune
    \n-
    664
    \n-
    665#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n-
    This file simply includes all Refinement implementations so you don't have to do them separately.
    \n-
    A unique label for each type of element that can occur in a grid.
    \n+
    578#endif // DUNE_GEOMETRY_TYPE_HH
    \n+
    STL namespace.
    \n
    Definition affinegeometry.hh:21
    \n-
    VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType geometryType, GeometryType coerceTo)
    return a reference to the VirtualRefinement according to the parameters
    Definition virtualrefinement.cc:503
    \n-
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    Holds the number of refined intervals per axis needed for virtual and static refinement.
    Definition base.cc:94
    \n-
    Wrap each Refinement implementation to get a consistent interface.
    Definition base.cc:141
    \n-
    static ElementIterator eEnd(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:247
    \n-
    static ElementIterator eBegin(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:237
    \n-
    static int nElements(Dune::RefinementIntervals tag)
    Get the number of Elements.
    Definition base.cc:227
    \n-
    static int nVertices(Dune::RefinementIntervals tag)
    Get the number of Vertices.
    Definition base.cc:197
    \n-
    static VertexIterator vBegin(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:207
    \n-
    typedef IndexVector
    The IndexVector of the Refinement.
    Definition base.cc:177
    \n-
    static VertexIterator vEnd(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:217
    \n+
    std::ostream & operator<<(std::ostream &s, const GeometryType &a)
    Prints the type to an output stream.
    Definition type.hh:410
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    constexpr GeometryType(unsigned int topologyId, unsigned int dim)
    Constructor, using the topologyId (integer) and the dimension.
    Definition type.hh:251
    \n+
    constexpr bool operator<(const GeometryType &other) const
    less-than operation for use with maps
    Definition type.hh:393
    \n+
    constexpr bool operator!=(const GeometryType &other) const
    Check for inequality.
    Definition type.hh:388
    \n+
    constexpr bool isPyramid() const
    Return true if entity is a pyramid.
    Definition type.hh:304
    \n+
    constexpr bool isTetrahedron() const
    Return true if entity is a tetrahedron.
    Definition type.hh:299
    \n+
    constexpr bool isPrism() const
    Return true if entity is a prism.
    Definition type.hh:309
    \n+
    constexpr bool isVertex() const
    Return true if entity is a vertex.
    Definition type.hh:279
    \n+
    constexpr bool operator==(const GeometryType &other) const
    Check for equality. This method knows that in dimension 0 and 1 all BasicTypes are equal.
    Definition type.hh:377
    \n+
    constexpr Id toId() const
    Create an Id representation of this GeometryType.
    Definition type.hh:210
    \n+
    constexpr bool isConical(const int &step) const
    Return true if entity was constructed with a conical product in the chosen step.
    Definition type.hh:337
    \n
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n+
    constexpr bool isPrismatic(const int &step) const
    Return true if entity was constructed with a prismatic product in the chosen step.
    Definition type.hh:350
    \n+
    constexpr bool isTriangle() const
    Return true if entity is a triangle.
    Definition type.hh:289
    \n+
    GeometryType(TopologyType t)
    Constructor from static TopologyType class.
    Definition type.hh:267
    \n+
    constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)
    Constructor, using the topologyId (integer), the dimension and a flag for type none.
    Definition type.hh:242
    \n+
    BasicType
    Each entity can be tagged by one of these basic types plus its space dimension.
    Definition type.hh:120
    \n+
    @ cube
    Cube element in any nonnegative dimension.
    Definition type.hh:122
    \n+
    @ simplex
    Simplicial element in any nonnegative dimension.
    Definition type.hh:121
    \n+
    @ pyramid
    Four sided pyramid in three dimensions.
    Definition type.hh:123
    \n+
    @ extended
    Other, more general topology, representable as topologyId.
    Definition type.hh:125
    \n+
    @ none
    Even more general topology, cannot be specified by a topologyId. Two GeometryTypes with 'none' type a...
    Definition type.hh:126
    \n+
    @ prism
    Prism element in three dimensions.
    Definition type.hh:124
    \n+
    constexpr GeometryType(Id id)
    Reconstruct a Geometry type from a GeometryType::Id.
    Definition type.hh:222
    \n+
    constexpr bool isCube() const
    Return true if entity is a cube of any dimension.
    Definition type.hh:324
    \n+
    constexpr GeometryType()
    Default constructor, not initializing anything.
    Definition type.hh:232
    \n+
    constexpr bool isConical() const
    Return true if entity was constructed with a conical product in the last step.
    Definition type.hh:329
    \n+
    constexpr bool isLine() const
    Return true if entity is a line segment.
    Definition type.hh:284
    \n+
    constexpr bool isQuadrilateral() const
    Return true if entity is a quadrilateral.
    Definition type.hh:294
    \n+
    constexpr bool isPrismatic() const
    Return true if entity was constructed with a prismatic product in the last step.
    Definition type.hh:342
    \n
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n-
    Definition virtualrefinement.cc:72
    \n-
    Refinement::template Codim< 0 >::SubEntityIterator Common
    Definition virtualrefinement.cc:85
    \n-
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:84
    \n-
    Refinement::IndexVector IndexVector
    Definition virtualrefinement.cc:86
    \n-
    VirtualRefinement< dimension, CoordType >::template Codim< codimension >::SubEntityIterator::CoordVector coords() const
    \n-\n-\n-\n-\n-\n-
    Refinement::template SubEntityIteratorBack< codimension > IteratorBack
    Definition virtualrefinement.cc:109
    \n-
    Refinement::CoordVector CoordVector
    Definition virtualrefinement.cc:110
    \n-
    Refinement::template Codim< codimension >::SubEntityIterator This
    Definition virtualrefinement.cc:108
    \n-
    bool equals(const This &other) const
    \n-
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:107
    \n-\n-
    Definition virtualrefinement.cc:200
    \n-
    virtual ~VirtualRefinementSubEntityIteratorBackSpecial()
    Definition virtualrefinement.cc:208
    \n-\n-
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:217
    \n-
    Refinement::IndexVector IndexVector
    Definition virtualrefinement.cc:218
    \n-
    virtual ~VirtualRefinementSubEntityIteratorBackSpecial()
    Definition virtualrefinement.cc:222
    \n-
    Definition virtualrefinement.cc:231
    \n-\n-
    Refinement::template SubEntityIteratorBack< codimension > This
    Definition virtualrefinement.cc:234
    \n-\n-
    Refinement::CoordVector CoordVector
    Definition virtualrefinement.cc:235
    \n-
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:233
    \n-
    virtual bool operator==(const This &other) const =0
    \n-
    virtual CoordVector coords() const =0
    \n-
    virtual ~SubEntityIteratorBack()
    Definition virtualrefinement.cc:237
    \n-\n-
    Definition virtualrefinement.cc:261
    \n-
    int nVertices(Dune::RefinementIntervals tag) const override
    Get the number of Vertices.
    Definition virtualrefinement.cc:295
    \n-
    int nElements(Dune::RefinementIntervals tag) const override
    Get the number of Elements.
    Definition virtualrefinement.cc:320
    \n-
    Dune::VirtualRefinement< dimension, CoordType > VirtualRefinement
    Definition virtualrefinement.cc:264
    \n-
    static VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > & instance()
    Definition virtualrefinement.cc:286
    \n-
    Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension > StaticRefinement
    Definition virtualrefinement.cc:263
    \n-
    Definition virtualrefinement.cc:397
    \n-
    VirtualRefinement::template SubEntityIteratorBack< codimension > Base
    Definition virtualrefinement.cc:401
    \n-
    VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::template SubEntityIteratorBack< codimension > This
    Definition virtualrefinement.cc:400
    \n-
    StaticRefinement::template Codim< codimension >::SubEntityIterator BackendIterator
    Definition virtualrefinement.cc:399
    \n-
    VirtualRefinement::CoordVector CoordVector
    Definition virtualrefinement.cc:402
    \n-\n-
    VirtualRefinementImp::template SubEntityIteratorBack< 0 > Common
    Definition virtualrefinement.cc:368
    \n-\n-
    VirtualRefinement< dimension, CoordType > RefinementBase
    Definition virtualrefinement.cc:370
    \n-
    Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > VirtualRefinementImp
    Definition virtualrefinement.cc:367
    \n-
    VirtualRefinementImp::StaticRefinement StaticRefinement
    Definition virtualrefinement.cc:369
    \n-
    Definition virtualrefinement.cc:518
    \n-
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:522
    \n-
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:573
    \n-
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:595
    \n-
    VirtualRefinement base class.
    Definition virtualrefinement.hh:283
    \n-
    SubEntityIteratorBack< dimension > VertexIteratorBack
    Definition virtualrefinement.hh:307
    \n-
    VertexIterator vBegin(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:38
    \n-
    ElementIterator eBegin(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:54
    \n-
    ElementIterator eEnd(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:62
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    The ElementIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:290
    \n-
    VertexIterator vEnd(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:46
    \n-
    FieldVector< CoordType, dimension > CoordVector
    The CoordVector of the VirtualRefinement.
    Definition virtualrefinement.hh:297
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    The VertexIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:288
    \n-
    SubEntityIteratorBack< 0 > ElementIteratorBack
    Definition virtualrefinement.hh:308
    \n-
    codim database of VirtualRefinement
    Definition virtualrefinement.hh:367
    \n+
    constexpr bool isNone() const
    Return true if entity is a singular of any dimension.
    Definition type.hh:355
    \n+
    constexpr bool isHexahedron() const
    Return true if entity is a hexahedron.
    Definition type.hh:314
    \n+
    constexpr bool isSimplex() const
    Return true if entity is a simplex of any dimension.
    Definition type.hh:319
    \n+
    IdType Id
    An integral id representing a GeometryType.
    Definition type.hh:181
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,1002 +1,542 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-virtualrefinement.cc\n+type.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5\n-6#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n-_\b7#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n-8\n-14#include \n-15#include \n-16\n-17#include \n-18#include \n-19#include \n-20\n-21#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-22#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n-23\n-24namespace _\bD_\bu_\bn_\be\n-25{\n-26 // //////////////////////////////////////////\n-27 //\n-28 // The virtual base class and its iterators\n-29 //\n-30\n-31 //\n-32 // Refinement\n-33 //\n-34\n-35 template\n-36 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b3_\b7 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-38_\b _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-39 {\n-40 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(vBeginBack(tag));\n-41 }\n-42\n-43 template\n-44 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b4_\b5 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-46_\b _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-47 {\n-48 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(vEndBack(tag));\n-49 }\n-50\n-51 template\n-52 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b5_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-54_\b _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-55 {\n-56 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(eBeginBack(tag));\n-57 }\n-58\n-59 template\n-60 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b6_\b1 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-62_\b _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-63 {\n-64 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(eEndBack(tag));\n-65 }\n-66\n-67 //\n-68 // The iterators\n-69 //\n-70\n-71 template\n-_\b7_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-73\n-74 // The iterator for vertices\n-75 template\n-_\b7_\b6 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-77 {};\n-78\n-79 // The iterator for elements\n-80 template\n-_\b8_\b1 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-82 {\n-83 public:\n-_\b8_\b4 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b8_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bC_\bo_\bm_\bm_\bo_\bn;\n-_\b8_\b6 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-87\n-88 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-89 };\n-90\n-91 template\n-92 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b9_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-94_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-95 {\n-96 return static_cast(this)->backend->vertexIndices();\n-97 }\n-98\n-99 // The iterator common stuff\n-100 template\n-101 template\n-_\b1_\b0_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-103 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-104 public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-105 {\n-106 public:\n-_\b1_\b0_\b7 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b0_\b8 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bT_\bh_\bi_\bs;\n-_\b1_\b0_\b9 typedef typename Refinement::template _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n-_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n-_\b1_\b1_\b0 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-111\n-_\b1_\b1_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *backend);\n-_\b1_\b1_\b3 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const _\bT_\bh_\bi_\bs &other);\n-_\b1_\b1_\b4 _\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br();\n-115\n-_\b1_\b1_\b6 _\bT_\bh_\bi_\bs &_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(const _\bT_\bh_\bi_\bs &other);\n-117\n-_\b1_\b1_\b8 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n-_\b1_\b1_\b9 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt();\n-120\n-_\b1_\b2_\b1 int _\bi_\bn_\bd_\be_\bx() const;\n-122\n-123 // If you simply use an unqualified CoordVector here g++-4.2 chokes\n-124 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be\n-_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br::\n-_\b1_\b2_\b5 CoordVector _\bc_\bo_\bo_\br_\bd_\bs() const;\n-126 private:\n-127 friend class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-128 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *backend;\n-129 };\n+5#ifndef DUNE_GEOMETRY_TYPE_HH\n+6#define DUNE_GEOMETRY_TYPE_HH\n+7\n+12#include \n+13#include \n+14\n+15#include \n+16#include \n+17\n+18#include \n+19#include \n+20#include \n+21\n+22namespace _\bD_\bu_\bn_\be\n+23{\n+24\n+25 namespace Impl\n+26 {\n+27\n+28 enum TopologyConstruction { pyramidConstruction = 0, prismConstruction = 1\n+};\n+29\n+30 // Dynamic Topology Properties\n+31 // ---------------------------\n+32\n+41 inline static unsigned int numTopologies ( int dim ) noexcept\n+42 {\n+43 return (1u << dim);\n+44 }\n+45\n+57 inline bool static isPyramid ( unsigned int topologyId, int dim, int codim =\n+0 ) noexcept\n+58 {\n+59 assert( (dim > 0) && (topologyId < numTopologies( dim )) );\n+60 assert( (0 <= codim) && (codim < dim) );\n+61 return (((topologyId & ~1) & (1u << (dim-codim-1))) == 0);\n+62 }\n+63\n+75 inline static bool isPrism ( unsigned int topologyId, int dim, int codim = 0\n+) noexcept\n+76 {\n+77 assert( (dim > 0) && (topologyId < numTopologies( dim )) );\n+78 assert( (0 <= codim) && (codim < dim) );\n+79 return (( (topologyId | 1) & (1u << (dim-codim-1))) != 0);\n+80 }\n+81\n+89 inline static unsigned int baseTopologyId ( unsigned int topologyId, int\n+dim, int codim = 1 ) noexcept\n+90 {\n+91 assert( (dim >= 0) && (topologyId < numTopologies( dim )) );\n+92 assert( (0 <= codim) && (codim <= dim) );\n+93 return topologyId & ((1u << (dim-codim)) - 1);\n+94 }\n+95\n+96 } // namespace Impl\n+97\n+98 // GeometryType\n+99 // -------------\n+100\n+_\b1_\b1_\b3 class _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+114 {\n+115 public:\n+116\n+_\b1_\b1_\b9 enum\n+120 _\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be {\n+_\b1_\b2_\b1 _\bs_\bi_\bm_\bp_\bl_\be_\bx,\n+_\b1_\b2_\b2 _\bc_\bu_\bb_\be,\n+_\b1_\b2_\b3 _\bp_\by_\br_\ba_\bm_\bi_\bd,\n+_\b1_\b2_\b4 _\bp_\br_\bi_\bs_\bm,\n+_\b1_\b2_\b5 _\be_\bx_\bt_\be_\bn_\bd_\be_\bd,\n+126 _\bn_\bo_\bn_\be\n+_\b1_\b2_\b7 };\n+128\n+129 private:\n 130\n-131#ifndef DOXYGEN\n-132 template\n-133 template\n-134 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-135_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(IteratorBack *backend_)\n-136 : backend(backend_)\n-137 {}\n-138\n-139 template\n-140 template\n-141 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-142_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const This &other)\n-143 : backend(other.backend->clone())\n-144 {}\n-145\n-146 template\n-147 template\n-148 VirtualRefinement::Codim::\n-SubEntityIterator::\n-149 ~SubEntityIterator()\n-150 {\n-151 delete backend;\n-152 }\n-153\n-154 template\n-155 template\n-156 typename VirtualRefinement::template\n-Codim::SubEntityIterator &\n-157 VirtualRefinement::Codim::\n-SubEntityIterator::\n-158 operator=(const This &other)\n-159 {\n-160 delete backend;\n-161 backend = other.backend->clone();\n-162 }\n-163\n-164 template\n-165 template\n-166 bool\n-167 VirtualRefinement::Codim::\n-SubEntityIterator::\n-168 equals(const This &other) const\n-169 { return *backend == *(other.backend); }\n-170\n-171 template\n-172 template\n-173 void\n-174 VirtualRefinement::Codim::\n-SubEntityIterator::\n-175 increment()\n-176 {\n-177 ++*backend;\n-178 }\n-179\n-180 template\n-181 template\n-182 int\n-183 VirtualRefinement::Codim::\n-SubEntityIterator::\n-184 index() const\n-185 { return backend->index(); }\n-186\n-187 template\n-188 template\n-189 typename VirtualRefinement::template\n-Codim::SubEntityIterator::CoordVector\n-190 VirtualRefinement::Codim::\n-SubEntityIterator::\n-191 coords() const\n-192 { return backend->coords(); }\n-193#endif // DOXYGEN\n-194\n-195 //\n-196 // The iterator backend\n-197 //\n-198\n-199 template\n-_\b2_\b0_\b0 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-201\n-202 // The iterator backend for vertices\n-203 template\n-_\b2_\b0_\b4 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-205 {\n-206 public:\n-207\n-_\b2_\b0_\b8 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl()\n-209 {}\n-210 };\n-211\n-212 // The iterator backend for elements\n-213 template\n-_\b2_\b1_\b4 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-215 {\n-216 public:\n-_\b2_\b1_\b7 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b1_\b8 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-219\n-_\b2_\b2_\b0 virtual _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const = 0;\n-221\n-_\b2_\b2_\b2 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl()\n-223 {}\n-224 };\n-225\n-226 // The iterator backend common stuff\n-227 template\n-228 template\n-_\b2_\b2_\b9 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-230 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-231 {\n-232 public:\n-_\b2_\b3_\b3 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b3_\b4 typedef typename Refinement::template _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n-_\bT_\bh_\bi_\bs;\n-_\b2_\b3_\b5 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-236\n-_\b2_\b3_\b7 virtual _\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk() {}\n-238\n-_\b2_\b3_\b9 virtual _\bT_\bh_\bi_\bs *_\bc_\bl_\bo_\bn_\be() const = 0;\n-240\n-_\b2_\b4_\b1 virtual bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bT_\bh_\bi_\bs &other) const = 0;\n-_\b2_\b4_\b2 virtual _\bT_\bh_\bi_\bs &_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+() = 0;\n-243\n-_\b2_\b4_\b4 virtual int _\bi_\bn_\bd_\be_\bx() const = 0;\n-_\b2_\b4_\b5 virtual _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bc_\bo_\bo_\br_\bd_\bs() const = 0;\n-246 };\n-247\n-248 // /////////////////////////////////////////////////\n-249 //\n-250 // The derived classes and their iterator backends\n-251 //\n-252\n-253 //\n-254 // The refinement implementation\n-255 //\n-256\n-257 template\n-_\b2_\b5_\b9 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-260 : public _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-261 {\n-262 public:\n-_\b2_\b6_\b3 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b6_\b4 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-265\n-266 template\n-267 class _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n-268\n-269 int nVertices(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n-270\n-271 int nElements(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+132 unsigned char dim_;\n+133\n+135 bool none_;\n+136\n+138 unsigned int topologyId_;\n+139\n+140 // Internal type used for the Id. The exact nature of this type is kept\n+141 // as an implementation detail on purpose. We use a scoped enum here\n+because scoped enums\n+142 // can be used as template parameters, but are not implicitly converted to\n+other integral\n+143 // types by the compiler. That way, we avoid unfortunate implicit\n+conversion chains, e.g.\n+144 // people trying to work with GlobalGeometryTypeIndex, but forgetting to\n+actually call\n+145 // GlobalGeometryTypeIndex::index(gt) and just using gt directly.\n+146 enum class IdType : std::uint64_t\n+147 {};\n+148\n+149 public:\n+150\n+_\b1_\b8_\b1 using Id = IdType;\n+182\n+_\b1_\b9_\b0 constexpr operator _\bI_\bd() const\n+191 {\n+192 // recreate the exact storage layout that this class is using, making\n+conversion\n+193 // extremely cheap\n+194 std::uint64_t id = dim_ | (std::uint64_t(none_) << 8) | (std::uint64_t\n+(topologyId_) << 32);\n+195 return static_cast(_\bi_\bd);\n+196 }\n+197\n+_\b2_\b1_\b0 constexpr Id _\bt_\bo_\bI_\bd() const\n+211 {\n+212 return static_cast(*this);\n+213 }\n+214\n+_\b2_\b2_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(Id id)\n+223 : dim_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) & 0xFF)\n+224 , none_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) & 0x100)\n+225 , topologyId_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) >> 32)\n+226 {}\n+227\n+230\n+_\b2_\b3_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be ()\n+233 : dim_(0), none_(true), topologyId_(0)\n+234 {}\n+235\n+_\b2_\b4_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(unsigned int topologyId, unsigned int _\bd_\bi_\bm, bool\n+_\bi_\bs_\bN_\bo_\bn_\be)\n+243 : dim_(_\bd_\bi_\bm), none_(_\bi_\bs_\bN_\bo_\bn_\be), topologyId_(topologyId)\n+244 {}\n+245\n+_\b2_\b5_\b1 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(unsigned int topologyId, unsigned int _\bd_\bi_\bm)\n+252 : dim_(_\bd_\bi_\bm), none_(false), topologyId_(topologyId)\n+253 {}\n+254\n+265 template>\n+_\b2_\b6_\b7 explicit _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(TopologyType t)\n+268 : dim_(TopologyType::dimension), none_(false), topologyId_(TopologyType::\n+_\bi_\bd)\n+269 {\n+270 DUNE_UNUSED_PARAMETER(t);\n+271 }\n 272\n-273 static _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n-&instance();\n-274 private:\n-275 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp() {}\n-276\n-277 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *vBeginBack(_\bD_\bu_\bn_\be_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n-278 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *vEndBack(_\bD_\bu_\bn_\be_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n-279 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *eBeginBack(_\bD_\bu_\bn_\be_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n-280 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *eEndBack(_\bD_\bu_\bn_\be_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n-281 };\n+_\b2_\b7_\b9 constexpr bool _\bi_\bs_\bV_\be_\br_\bt_\be_\bx() const {\n+280 return dim_==0;\n+281 }\n 282\n-283 template\n-285 VirtualRefinementImp &\n-_\b2_\b8_\b6 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be()\n-287 {\n-288 static _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp instance_{};\n-289 return instance_;\n-290 }\n-291\n-292 template\n-_\b2_\b9_\b4 int _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-295_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-296 {\n-297 return _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(tag);\n-298 }\n-299\n-300 template\n-302 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n-303 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-304_\b _\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-305 {\n-306 return new SubEntityIteratorBack(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn(tag));\n-307 }\n-308\n-309 template\n-311 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n-312 VirtualRefinementImp::\n-313 vEndBack(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-314 {\n-315 return new SubEntityIteratorBack(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd(tag));\n+_\b2_\b8_\b4 constexpr bool _\bi_\bs_\bL_\bi_\bn_\be() const {\n+285 return dim_==1;\n+286 }\n+287\n+_\b2_\b8_\b9 constexpr bool _\bi_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be() const {\n+290 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0001;\n+291 }\n+292\n+_\b2_\b9_\b4 constexpr bool _\bi_\bs_\bQ_\bu_\ba_\bd_\br_\bi_\bl_\ba_\bt_\be_\br_\ba_\bl() const {\n+295 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0011;\n+296 }\n+297\n+_\b2_\b9_\b9 constexpr bool _\bi_\bs_\bT_\be_\bt_\br_\ba_\bh_\be_\bd_\br_\bo_\bn() const {\n+300 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0001;\n+301 }\n+302\n+_\b3_\b0_\b4 constexpr bool _\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd() const {\n+305 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0011;\n+306 }\n+307\n+_\b3_\b0_\b9 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm() const {\n+310 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0101;\n+311 }\n+312\n+_\b3_\b1_\b4 constexpr bool _\bi_\bs_\bH_\be_\bx_\ba_\bh_\be_\bd_\br_\bo_\bn() const {\n+315 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0111;\n 316 }\n 317\n-318 template\n-_\b3_\b2_\b0 int _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-321 {\n-322 return _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(tag);\n-323 }\n-324\n-325 template\n-327 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n-328 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-329_\b _\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-330 {\n-331 return new SubEntityIteratorBack<0>(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn(tag));\n-332 }\n-333\n-334 template\n-336 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n-337 VirtualRefinementImp::\n-338 eEndBack(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-339 {\n-340 return new SubEntityIteratorBack<0>(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd(tag));\n-341 }\n-342\n-343 //\n-344 // The iterator backend implementation\n-345 //\n-346\n-347 // The iterator backend implementation specialties\n-348 template\n-_\b3_\b5_\b0 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-351\n-352 // The iterator backend implementation specialties for vertices\n-353 template\n-_\b3_\b5_\b5 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-356 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::template\n-SubEntityIteratorBack\n-357 {};\n+_\b3_\b1_\b9 constexpr bool _\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx() const {\n+320 return ! none_ && (topologyId_ | 1) == 1;\n+321 }\n+322\n+_\b3_\b2_\b4 constexpr bool _\bi_\bs_\bC_\bu_\bb_\be() const {\n+325 return ! none_ && ((topologyId_ ^ ((1 << dim_)-1)) >> 1 == 0);\n+326 }\n+327\n+_\b3_\b2_\b9 constexpr bool _\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl() const {\n+330 return ! none_ && (((topologyId_ & ~1) & (1u << (dim_-1))) == 0);\n+331 }\n+332\n+_\b3_\b3_\b7 constexpr bool _\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl(const int& step) const {\n+338 return ! none_ && (((topologyId_ & ~1) & (1u << step)) == 0);\n+339 }\n+340\n+_\b3_\b4_\b2 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc() const {\n+343 return ! none_ && (( (topologyId_ | 1) & (1u << (dim_-1))) != 0);\n+344 }\n+345\n+_\b3_\b5_\b0 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc(const int& step) const {\n+351 return ! none_ && (( (topologyId_ | 1) & (1u << step)) != 0);\n+352 }\n+353\n+_\b3_\b5_\b5 constexpr bool _\bi_\bs_\bN_\bo_\bn_\be() const {\n+356 return none_;\n+357 }\n 358\n-359 // The iterator backend implementation specialties for elements\n-360\n-361 template\n-_\b3_\b6_\b3 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-364 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::template\n-SubEntityIteratorBack<0>\n-365 {\n-366 public:\n-_\b3_\b6_\b7 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp;\n-_\b3_\b6_\b8 typedef typename VirtualRefinementImp::template SubEntityIteratorBack<0>\n-_\bC_\bo_\bm_\bm_\bo_\bn;\n-_\b3_\b6_\b9 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b3_\b7_\b0 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\ba_\bs_\be;\n-_\b3_\b7_\b1 typedef typename RefinementBase::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-372\n-373 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-374 };\n-375\n-376 template\n-378 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b7_\b9 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b>_\b:_\b:\n-380_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-381 {\n-382 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vIndices;\n-383 vIndices.reserve(StaticRefinement::IndexVector::dimension);\n-384\n-385 typename _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br sIndices = static_cast(this)->backend.vertexIndices();\n-386 for(int i = 0; i < StaticRefinement::IndexVector::dimension; ++i)\n-387 vIndices.push_back(sIndices[i]);\n-388 return vIndices;\n-389 }\n-390\n-391 // The shared iterator backend implementation\n-392 template\n-394 template\n-_\b3_\b9_\b5 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-396 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-397 {\n-398 public:\n-_\b3_\b9_\b9 typedef typename StaticRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b4_\b0_\b0 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bT_\bh_\bi_\bs;\n-_\b4_\b0_\b1 typedef typename VirtualRefinement::template\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bB_\ba_\bs_\be;\n-_\b4_\b0_\b2 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-403\n-404 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br &backend);\n-405 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bT_\bh_\bi_\bs &other);\n-406\n-407 _\bB_\ba_\bs_\be *clone() const;\n+_\b3_\b6_\b0 constexpr unsigned int _\bd_\bi_\bm() const {\n+361 return dim_;\n+362 }\n+363\n+_\b3_\b6_\b5 constexpr unsigned int _\bi_\bd() const {\n+366 return topologyId_;\n+367 }\n+368\n+373\n+_\b3_\b7_\b7 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n+378 return ( ( none_ == other.none_ )\n+379 && ( ( none_ == true )\n+380 || ( ( dim_ == other.dim_ )\n+381 && ( (topologyId_ >> 1) == (other.topologyId_ >> 1) )\n+382 )\n+383 )\n+384 );\n+385 }\n+386\n+_\b3_\b8_\b8 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n+389 return ! ((*this)==other);\n+390 }\n+391\n+_\b3_\b9_\b3 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b (const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n+394 return ( ( none_ < other.none_ )\n+395 || ( !( other.none_ < none_ )\n+396 && ( ( dim_ < other.dim_ )\n+397 || ( (other.dim_ == dim_)\n+398 && ((topologyId_ >> 1) < (other.topologyId_ >> 1) )\n+399 )\n+400 )\n+401 )\n+402 );\n+403 }\n+404\n+407 };\n 408\n-409 bool operator==(const _\bB_\ba_\bs_\be &other) const;\n-410 _\bB_\ba_\bs_\be &operator++();\n-411\n-412 int index() const;\n-_\b4_\b1_\b3 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-414\n-415 private:\n-416 friend class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-417 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br backend;\n-418 };\n-419\n-420 template\n-422 template\n-_\b4_\b2_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-424_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br &backend_)\n-425 : backend(backend_)\n-426 {}\n-427\n-428 template\n-430 template\n-_\b4_\b3_\b1 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-432_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bT_\bh_\bi_\bs &other)\n-433 : _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl(other),\n-434 backend(other.backend)\n-435 {}\n-436\n-437 template\n-438 template\n-439 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bB_\ba_\bs_\be *\n-_\b4_\b4_\b0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-441_\b _\bc_\bl_\bo_\bn_\be() const\n-442 { return new _\bT_\bh_\bi_\bs(*this); }\n+_\b4_\b1_\b0 inline std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b (std::ostream& s, const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& a)\n+411 {\n+412 if (a._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n+413 {\n+414 s << \"(simplex, \" << a._\bd_\bi_\bm() << \")\";\n+415 return s;\n+416 }\n+417 if (a._\bi_\bs_\bC_\bu_\bb_\be())\n+418 {\n+419 s << \"(cube, \" << a._\bd_\bi_\bm() << \")\";\n+420 return s;\n+421 }\n+422 if (a._\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd())\n+423 {\n+424 s << \"(pyramid, 3)\";\n+425 return s;\n+426 }\n+427 if (a._\bi_\bs_\bP_\br_\bi_\bs_\bm())\n+428 {\n+429 s << \"(prism, 3)\";\n+430 return s;\n+431 }\n+432 if (a._\bi_\bs_\bN_\bo_\bn_\be())\n+433 {\n+434 s << \"(none, \" << a._\bd_\bi_\bm() << \")\";\n+435 return s;\n+436 }\n+437 s << \"(other [\" << a._\bi_\bd() << \"], \" << a._\bd_\bi_\bm() << \")\";\n+438 return s;\n+439 }\n+440\n+441\n 443\n-444 template\n-445 template\n-446 bool\n-_\b4_\b4_\b7 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-448_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bB_\ba_\bs_\be &other) const\n-449 {\n-450 try {\n-451 return backend == dynamic_cast(other).backend;\n-452 }\n-453 catch(const std::bad_cast&)\n+_\b4_\b4_\b7 namespace GeometryTypes {\n+448\n+450\n+453 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be simplex(unsigned int dim)\n 454 {\n-455 return false;\n+455 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,dim,false);\n 456 }\n-457 }\n-458\n-459 template\n-460 template\n-461 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bB_\ba_\bs_\be &\n-_\b4_\b6_\b2 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-463_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+()\n-464 {\n-465 ++backend;\n-466 return *this;\n-467 }\n+457\n+459\n+462 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be cube(unsigned int dim)\n+463 {\n+464 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(((dim>1) ? ((1 << dim) - 1) : 0),dim,false);\n+465 }\n+466\n 468\n-469 template\n-470 template\n-471 int\n-_\b4_\b7_\b2 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-473_\b _\bi_\bn_\bd_\be_\bx() const\n-474 { return backend.index(); }\n+471 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be none(unsigned int dim)\n+472 {\n+473 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,dim,true);\n+474 }\n 475\n-476 template\n-477 template\n-478 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b4_\b7_\b9 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-480_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-481 { return backend.coords(); }\n-482\n-483 // ////////////////////////\n-484 //\n-485 // The refinement builder\n-486 //\n+477 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be conicalExtension(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt)\n+478 {\n+479 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd(), gt._\bd_\bi_\bm()+1, gt._\bi_\bs_\bN_\bo_\bn_\be());\n+480 }\n+481\n+483 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be prismaticExtension(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt)\n+484 {\n+485 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd() | ((1 << gt._\bd_\bi_\bm())), gt._\bd_\bi_\bm()+1, gt._\bi_\bs_\bN_\bo_\bn_\be());\n+486 }\n 487\n-488 template\n-489 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br;\n-490\n-501 template\n-502 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n-_\b5_\b0_\b3 _\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(\n-504 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be geometryType,\n-506 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n-507 {\n-508 // Check that the user used valid geometry types\n-509 assert(geometryType._\bd_\bi_\bm() == dimension && coerceTo._\bd_\bi_\bm() == dimension);\n-510 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd( geometryType._\bi_\bd(),\n-coerceTo._\bi_\bd() );\n-511 }\n-512\n-513 // In principle the trick with the class is no longer necessary,\n-514 // but I'm keeping it in here so it will be easier to specialize\n-515 // buildRefinement when someone implements pyramids and prisms\n-516 template\n-_\b5_\b1_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br\n-518 {\n-519 public:\n-520 static\n-521 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n-_\b5_\b2_\b2 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n-523 {\n-524 topologyId &= ~1;\n-525 coerceToId &= ~1;\n-526\n-527 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n-528 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;\n+489\n+492 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be vertex = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,0,false);\n+493\n+495\n+498 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be line = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,1,false);\n+499\n+501\n+504 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be triangle = simplex(2);\n+505\n+507\n+510 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be quadrilateral = cube(2);\n+511\n+513\n+516 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be tetrahedron = simplex(3);\n+517\n+519\n+522 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be pyramid = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0b0011,3,false);\n+523\n+525\n+528 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be prism = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0b0101,3,false);\n 529\n-530 switch( topologyId )\n-531 {\n-532 //case GeometryType::simplex:\n-533 case idSimplex :\n-534 //switch( coerceTo )\n-535 switch( coerceToId )\n-536 {\n-537 //case GeometryType::simplex:\n-538 case idSimplex :\n-539 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-540 default :\n-541 break;\n-542 }\n-543 break;\n-544\n-545 //case GeometryType::cube:\n-546 case idCube :\n-547 switch( coerceToId )\n-548 {\n-549 case idSimplex :\n-550 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-551 case idCube :\n-552 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-553 default :\n-554 break;\n-555 }\n-556 break;\n-557\n-558 default :\n-559 break;\n-560 }\n-561 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n-\"\n-562 << coerceToId << \" >.\");\n+531\n+534 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be hexahedron = cube(3);\n+535\n+536 }\n+537\n+538 namespace Impl\n+539 {\n+540\n+542 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be getBase(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt) {\n+543 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd() & ((1 << (gt._\bd_\bi_\bm()-1))-1), gt._\bd_\bi_\bm()-1,\n+gt._\bi_\bs_\bN_\bo_\bn_\be());\n+544 }\n+545\n+546\n+547 // IfGeometryType\n+548 // ----------\n+549\n+550 template< template< GeometryType::Id > class Operation, int dim,\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd geometryId = GeometryTypes::vertex >\n+551 struct IfGeometryType\n+552 {\n+553 static constexpr GeometryType geometry = geometryId;\n+554 template< class... Args >\n+555 static auto apply ( GeometryType gt, Args &&... args )\n+556 {\n+557 GeometryType lowerGeometry(gt.id() >>1 , gt.dim()-1, gt.isNone());\n+558\n+559 if( gt.id() & 1 )\n+560 return IfGeometryType< Operation, dim-1, GeometryTypes::prismaticExtension\n+(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );\n+561 else\n+562 return IfGeometryType< Operation, dim-1, GeometryTypes::conicalExtension\n+(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );\n 563 }\n 564 };\n 565\n-566 template\n-_\b5_\b6_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br<1, CoordType>\n+566 template< template< GeometryType::Id > class Operation, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd\n+geometryId >\n+567 struct IfGeometryType< Operation, 0, geometryId>\n 568 {\n-569 static const std::size_t dimension = 1;\n-570 public:\n-571 static\n-572 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n-_\b5_\b7_\b3 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n-574 {\n-575 topologyId &= ~1;\n-576 coerceToId &= ~1;\n+569 template< class... Args >\n+570 static auto apply ([[maybe_unused]] GeometryType gt, Args &&... args )\n+571 {\n+572 return Operation< geometryId >::apply( std::forward< Args >( args )... );\n+573 }\n+574 };\n+575 } // namespace Impl\n+576} // namespace Dune\n 577\n-578 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n-579\n-580 if (topologyId == 0 && coerceToId == 0)\n-581 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-582\n-583 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n-\"\n-584 << coerceToId << \" >.\");\n-585 }\n-586 };\n-587\n-588 template\n-_\b5_\b8_\b9 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br<3, CoordType>\n-590 {\n-591 static const std::size_t dimension = 3;\n-592 public:\n-593 static\n-594 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n-_\b5_\b9_\b5 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n-596 {\n-597 topologyId &= ~1;\n-598 coerceToId &= ~1;\n-599\n-600 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n-601 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;\n-602 constexpr unsigned idPrism = GeometryTypes::prism.id() & ~1;\n-603 constexpr unsigned idPyramid = GeometryTypes::pyramid.id() & ~1;\n-604\n-605 switch( topologyId )\n-606 {\n-607 //case GeometryType::simplex:\n-608 case idSimplex :\n-609 //switch( coerceTo )\n-610 switch( coerceToId )\n-611 {\n-612 //case GeometryType::simplex:\n-613 case idSimplex :\n-614 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-615 default :\n-616 break;\n-617 }\n-618 break;\n-619\n-620 //case GeometryType::cube:\n-621 case idCube :\n-622 switch( coerceToId )\n-623 {\n-624 case idSimplex :\n-625 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-626 case idCube :\n-627 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-628 default :\n-629 break;\n-630 }\n-631 break;\n-632\n-633 //case GeometryType::prism:\n-634 case idPrism :\n-635 switch( coerceToId )\n-636 {\n-637 case idSimplex :\n-638 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bP_\br_\bi_\bs_\bm_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-639 default :\n-640 break;\n-641 }\n-642 break;\n-643\n-644 //case GeometryType::pyramid:\n-645 case idPyramid :\n-646 switch( coerceToId )\n-647 {\n-648 case idSimplex :\n-649 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bP_\by_\br_\ba_\bm_\bi_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n-650 default :\n-651 break;\n-652 }\n-653 break;\n-654\n-655 default :\n-656 break;\n-657 }\n-658 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n-\"\n-659 << coerceToId << \" >.\");\n-660 }\n-661 };\n-662\n-663} // namespace Dune\n-664\n-665#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n-_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n-This file simply includes all Refinement implementations so you don't have to\n-do them separately.\n-_\bt_\by_\bp_\be_\b._\bh_\bh\n-A unique label for each type of element that can occur in a grid.\n+578#endif // DUNE_GEOMETRY_TYPE_HH\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType\n-geometryType, GeometryType coerceTo)\n-return a reference to the VirtualRefinement according to the parameters\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:503\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Static tag representing a codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-Holds the number of refined intervals per axis needed for virtual and static\n-refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Wrap each Refinement implementation to get a consistent interface.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(Dune::RefinementIntervals tag)\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:247\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(Dune::RefinementIntervals tag)\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(Dune::RefinementIntervals tag)\n-Get the number of Elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:227\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(Dune::RefinementIntervals tag)\n-Get the number of Vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:197\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(Dune::RefinementIntervals tag)\n-Get a VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:207\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-typedef IndexVector\n-The IndexVector of the Refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:177\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(Dune::RefinementIntervals tag)\n-Get a VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n+std::ostream & operator<<(std::ostream &s, const GeometryType &a)\n+Prints the type to an output stream.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:410\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+constexpr GeometryType(unsigned int topologyId, unsigned int dim)\n+Constructor, using the topologyId (integer) and the dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:251\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<\n+constexpr bool operator<(const GeometryType &other) const\n+less-than operation for use with maps\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:393\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n+constexpr bool operator!=(const GeometryType &other) const\n+Check for inequality.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:388\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd\n+constexpr bool isPyramid() const\n+Return true if entity is a pyramid.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:304\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bT_\be_\bt_\br_\ba_\bh_\be_\bd_\br_\bo_\bn\n+constexpr bool isTetrahedron() const\n+Return true if entity is a tetrahedron.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:299\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm\n+constexpr bool isPrism() const\n+Return true if entity is a prism.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:309\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bV_\be_\br_\bt_\be_\bx\n+constexpr bool isVertex() const\n+Return true if entity is a vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:279\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n+constexpr bool operator==(const GeometryType &other) const\n+Check for equality. This method knows that in dimension 0 and 1 all BasicTypes\n+are equal.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:377\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bI_\bd\n+constexpr Id toId() const\n+Create an Id representation of this GeometryType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:210\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl\n+constexpr bool isConical(const int &step) const\n+Return true if entity was constructed with a conical product in the chosen\n+step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:337\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n constexpr unsigned int dim() const\n Return dimension of the type.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc\n+constexpr bool isPrismatic(const int &step) const\n+Return true if entity was constructed with a prismatic product in the chosen\n+step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:350\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n+constexpr bool isTriangle() const\n+Return true if entity is a triangle.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:289\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+GeometryType(TopologyType t)\n+Constructor from static TopologyType class.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)\n+Constructor, using the topologyId (integer), the dimension and a flag for type\n+none.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:242\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be\n+BasicType\n+Each entity can be tagged by one of these basic types plus its space dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:120\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be\n+@ cube\n+Cube element in any nonnegative dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:122\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n+@ simplex\n+Simplicial element in any nonnegative dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:121\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\by_\br_\ba_\bm_\bi_\bd\n+@ pyramid\n+Four sided pyramid in three dimensions.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:123\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\be_\bx_\bt_\be_\bn_\bd_\be_\bd\n+@ extended\n+Other, more general topology, representable as topologyId.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:125\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bn_\bo_\bn_\be\n+@ none\n+Even more general topology, cannot be specified by a topologyId. Two\n+GeometryTypes with 'none' type a...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:126\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\br_\bi_\bs_\bm\n+@ prism\n+Prism element in three dimensions.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:124\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+constexpr GeometryType(Id id)\n+Reconstruct a Geometry type from a GeometryType::Id.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:222\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bu_\bb_\be\n+constexpr bool isCube() const\n+Return true if entity is a cube of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:324\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+constexpr GeometryType()\n+Default constructor, not initializing anything.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:232\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl\n+constexpr bool isConical() const\n+Return true if entity was constructed with a conical product in the last step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:329\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bL_\bi_\bn_\be\n+constexpr bool isLine() const\n+Return true if entity is a line segment.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:284\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bQ_\bu_\ba_\bd_\br_\bi_\bl_\ba_\bt_\be_\br_\ba_\bl\n+constexpr bool isQuadrilateral() const\n+Return true if entity is a quadrilateral.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:294\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc\n+constexpr bool isPrismatic() const\n+Return true if entity was constructed with a prismatic product in the last\n+step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:342\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n constexpr unsigned int id() const\n Return the topology id of the type.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:72\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n-_\bC_\bo_\bm_\bm_\bo_\bn\n-Refinement::template Codim< 0 >::SubEntityIterator Common\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:84\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n-_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bs\n-VirtualRefinement< dimension, CoordType >::template Codim< codimension >::\n-SubEntityIterator::CoordVector coords() const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(const This &other)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-This & operator=(const This &other)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-int index() const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-~SubEntityIterator()\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(IteratorBack *backend)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-Refinement::template SubEntityIteratorBack< codimension > IteratorBack\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:109\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:110\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n-Refinement::template Codim< codimension >::SubEntityIterator This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:108\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n-bool equals(const This &other) const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:107\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n-void increment()\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:200\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-virtual ~VirtualRefinementSubEntityIteratorBackSpecial()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:208\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n-_\b>_\b:_\b:_\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual IndexVector vertexIndices() const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n-_\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:217\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n-_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:218\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n-_\b>_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-virtual ~VirtualRefinementSubEntityIteratorBackSpecial()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:222\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:231\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-virtual int index() const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bT_\bh_\bi_\bs\n-Refinement::template SubEntityIteratorBack< codimension > This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:234\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bc_\bl_\bo_\bn_\be\n-virtual This * clone() const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:235\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:233\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-virtual bool operator==(const This &other) const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bs\n-virtual CoordVector coords() const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-virtual ~SubEntityIteratorBack()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+\n-virtual This & operator++()=0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:261\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int nVertices(Dune::RefinementIntervals tag) const override\n-Get the number of Vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:295\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int nElements(Dune::RefinementIntervals tag) const override\n-Get the number of Elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:320\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Dune::VirtualRefinement< dimension, CoordType > VirtualRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:264\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be\n-static VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > &\n-instance()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:286\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension >\n-StaticRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:397\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bB_\ba_\bs_\be\n-VirtualRefinement::template SubEntityIteratorBack< codimension > Base\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:401\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bT_\bh_\bi_\bs\n-VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::template\n-SubEntityIteratorBack< codimension > This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:400\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-StaticRefinement::template Codim< codimension >::SubEntityIterator\n-BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:399\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-VirtualRefinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:402\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:350\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n-VirtualRefinementImp::template SubEntityIteratorBack< 0 > Common\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:368\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-RefinementBase::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:371\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\ba_\bs_\be\n-VirtualRefinement< dimension, CoordType > RefinementBase\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:370\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >\n-VirtualRefinementImp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:367\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinementImp::StaticRefinement StaticRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:369\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:518\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n-static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n-unsigned coerceToId)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:522\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b1_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n-static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n-unsigned coerceToId)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:573\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b3_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n-static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n-unsigned coerceToId)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:595\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement base class.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:283\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-SubEntityIteratorBack< dimension > VertexIteratorBack\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:307\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-VertexIterator vBegin(Dune::RefinementIntervals tag) const\n-Get an VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:38\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-ElementIterator eBegin(Dune::RefinementIntervals tag) const\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n-ElementIterator eEnd(Dune::RefinementIntervals tag) const\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:62\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-The ElementIterator of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:290\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n-VertexIterator vEnd(Dune::RefinementIntervals tag) const\n-Get an VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-The CoordVector of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:297\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-The VertexIterator of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:288\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-SubEntityIteratorBack< 0 > ElementIteratorBack\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:308\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-codim database of VirtualRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:367\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bN_\bo_\bn_\be\n+constexpr bool isNone() const\n+Return true if entity is a singular of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:355\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bH_\be_\bx_\ba_\bh_\be_\bd_\br_\bo_\bn\n+constexpr bool isHexahedron() const\n+Return true if entity is a hexahedron.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:314\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n+constexpr bool isSimplex() const\n+Return true if entity is a simplex of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd\n+IdType Id\n+An integral id representing a GeometryType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:181\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00200.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00200.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: quadraturerules.hh File Reference\n+dune-geometry: axisalignedcubegeometry.hh File Reference\n \n \n \n \n \n \n \n@@ -71,128 +71,43 @@\n \n
    \n
    \n
    \n \n-
    quadraturerules.hh File Reference
    \n+Namespaces
    \n+
    axisalignedcubegeometry.hh File Reference
    \n
    \n
    \n-
    #include <algorithm>
    \n-#include <iostream>
    \n-#include <limits>
    \n-#include <mutex>
    \n-#include <utility>
    \n-#include <vector>
    \n+\n+

    A geometry implementation for axis-aligned hypercubes. \n+More...

    \n+
    #include <bitset>
    \n #include <dune/common/fvector.hh>
    \n-#include <dune/common/exceptions.hh>
    \n-#include <dune/common/stdstreams.hh>
    \n-#include <dune/common/stdthread.hh>
    \n-#include <dune/common/visibility.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include <dune/geometry/typeindex.hh>
    \n-#include "quadraturerules/pointquadrature.hh"
    \n-#include "quadraturerules/gausslobattoquadrature.hh"
    \n-#include "quadraturerules/gaussquadrature.hh"
    \n-#include "quadraturerules/gaussradauleftquadrature.hh"
    \n-#include "quadraturerules/gaussradaurightquadrature.hh"
    \n-#include "quadraturerules/jacobi1quadrature.hh"
    \n-#include "quadraturerules/jacobi2quadrature.hh"
    \n-#include "quadraturerules/jacobiNquadrature.hh"
    \n-#include "quadraturerules/prismquadrature.hh"
    \n-#include "quadraturerules/simplexquadrature.hh"
    \n-#include "quadraturerules/tensorproductquadrature.hh"
    \n+#include <dune/common/fmatrix.hh>
    \n+#include <dune/common/diagonalmatrix.hh>
    \n+#include <dune/geometry/referenceelements.hh>
    \n+#include <dune/geometry/type.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  std::tuple_size< Dune::QuadraturePoint< ct, dim > >
     
    struct  std::tuple_element< 0, Dune::QuadraturePoint< ct, dim > >
     
    struct  std::tuple_element< 1, Dune::QuadraturePoint< ct, dim > >
     
    class  Dune::QuadratureOrderOutOfRange
     Exception thrown if a desired QuadratureRule is not available, because the requested order is to high. More...
     
    class  Dune::QuadraturePoint< ct, dim >
     Single evaluation point in a quadrature rule. More...
     
    class  Dune::QuadratureRule< ct, dim >
     Abstract base class for quadrature rules. More...
     
    class  Dune::QuadratureRules< ctype, dim >
     A container for all quadrature rules of dimension dim More...
     
    class  Dune::QuadratureRuleFactory< ctype, dim >
     Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType. More...
     
    class  Dune::QuadratureRuleFactory< ctype, 0 >
     
    class  Dune::QuadratureRuleFactory< ctype, 1 >
     
    class  Dune::QuadratureRuleFactory< ctype, 2 >
     
    class  Dune::QuadratureRuleFactory< ctype, 3 >
    class  Dune::AxisAlignedCubeGeometry< CoordType, dim, coorddim >
     A geometry implementation for axis-aligned hypercubes. More...
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  std
     STL namespace.
     
    namespace  Dune::QuadratureType
     Defines an enum for currently available quadrature rules.
     
    \n-\n-\n-\n-

    \n-Macros

    #define DUNE_INCLUDING_IMPLEMENTATION
     
    \n-\n-\n-\n

    \n-Enumerations

    enum  Dune::QuadratureType::Enum {
    \n-  Dune::QuadratureType::GaussLegendre = 0\n-, Dune::QuadratureType::GaussJacobi_1_0 = 1\n-, Dune::QuadratureType::GaussJacobi_2_0 = 2\n-, Dune::QuadratureType::GaussJacobi_n_0 = 3\n-,
    \n-  Dune::QuadratureType::GaussLobatto = 4\n-, Dune::QuadratureType::GaussRadauLeft = 5\n-, Dune::QuadratureType::GaussRadauRight = 6\n-, Dune::QuadratureType::size\n-
    \n- }
     
    \n

    Detailed Description

    \n-

    Interface for quadrature points and rules

    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_INCLUDING_IMPLEMENTATION

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_INCLUDING_IMPLEMENTATION
    \n-
    \n-\n-
    \n-
    \n-
    \n+

    A geometry implementation for axis-aligned hypercubes.

    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,94 +1,27 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bE_\bn_\bu_\bm_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs\n-quadraturerules.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+axisalignedcubegeometry.hh File Reference\n+A geometry implementation for axis-aligned hypercubes. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n-#include \"quadraturerules/pointquadrature.hh\"\n-#include \"quadraturerules/gausslobattoquadrature.hh\"\n-#include \"quadraturerules/gaussquadrature.hh\"\n-#include \"quadraturerules/gaussradauleftquadrature.hh\"\n-#include \"quadraturerules/gaussradaurightquadrature.hh\"\n-#include \"quadraturerules/jacobi1quadrature.hh\"\n-#include \"quadraturerules/jacobi2quadrature.hh\"\n-#include \"quadraturerules/jacobiNquadrature.hh\"\n-#include \"quadraturerules/prismquadrature.hh\"\n-#include \"quadraturerules/simplexquadrature.hh\"\n-#include \"quadraturerules/tensorproductquadrature.hh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\bs_\bi_\bz_\be_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n-\u00a0\n-struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b0_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n-\u00a0\n-struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b1_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be\n-\u00a0 Exception thrown if a desired _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be is not available, because\n- the requested order is to high. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 Single evaluation point in a quadrature rule. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 Abstract base class for quadrature rules. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 A container for all quadrature rules of dimension dim _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 Factory class for creation of quadrature rules, depending on\n- _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, order and _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b1_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b2_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b3_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b,_\b _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\b _\b>\n+\u00a0 A geometry implementation for axis-aligned hypercubes. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bs_\bt_\bd\n-\u00a0 STL namespace.\n-\u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be\n-\u00a0 Defines an enum for currently available quadrature rules.\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bI_\bN_\bC_\bL_\bU_\bD_\bI_\bN_\bG_\b__\bI_\bM_\bP_\bL_\bE_\bM_\bE_\bN_\bT_\bA_\bT_\bI_\bO_\bN\n-\u00a0\n-E\bEn\bnu\bum\bme\ber\bra\bat\bti\bio\bon\bns\bs\n-enum \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm {\n- \u00a0\u00a0_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be = 0 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n- _\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 = 1 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 = 2 , _\bD_\bu_\bn_\be_\b:_\b:\n- _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 = 3 ,\n- \u00a0\u00a0_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo = 4 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n- _\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt = 5 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt = 6 , _\bD_\bu_\bn_\be_\b:_\b:\n- _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bz_\be\n- }\n-\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Interface for quadrature points and rules\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_I\bIN\bNC\bCL\bLU\bUD\bDI\bIN\bNG\bG_\b_I\bIM\bMP\bPL\bLE\bEM\bME\bEN\bNT\bTA\bAT\bTI\bIO\bON\bN *\b**\b**\b**\b**\b*\n-#define DUNE_INCLUDING_IMPLEMENTATION\n+A geometry implementation for axis-aligned hypercubes.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00200_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00200_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: quadraturerules.hh Source File\n+dune-geometry: axisalignedcubegeometry.hh Source File\n \n \n \n \n \n \n \n@@ -74,502 +74,360 @@\n \n
    \n \n
    \n
    \n
    \n-
    quadraturerules.hh
    \n+
    axisalignedcubegeometry.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n
    5
    \n-
    6#ifndef DUNE_GEOMETRY_QUADRATURERULES_HH
    \n-
    7#define DUNE_GEOMETRY_QUADRATURERULES_HH
    \n+
    6#ifndef DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH
    \n+
    7#define DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH
    \n
    8
    \n-
    9#include <algorithm>
    \n-
    10#include <iostream>
    \n-
    11#include <limits>
    \n-
    12#include <mutex>
    \n-
    13#include <utility>
    \n-
    14#include <vector>
    \n-
    15
    \n-
    16#include <dune/common/fvector.hh>
    \n-
    17#include <dune/common/exceptions.hh>
    \n-
    18#include <dune/common/stdstreams.hh>
    \n-
    19#include <dune/common/stdthread.hh>
    \n-
    20#include <dune/common/visibility.hh>
    \n+
    13#include <bitset>
    \n+
    14
    \n+
    15#include <dune/common/fvector.hh>
    \n+
    16#include <dune/common/fmatrix.hh>
    \n+
    17#include <dune/common/diagonalmatrix.hh>
    \n+
    18
    \n+\n+
    20#include <dune/geometry/type.hh>
    \n
    21
    \n-
    22#include <dune/geometry/type.hh>
    \n-\n+
    22
    \n+
    23namespace Dune {
    \n
    24
    \n-
    31namespace Dune {
    \n-
    32 // forward declaration
    \n-
    33 template<typename ct, int dim>
    \n-
    34 class QuadraturePoint;
    \n-
    35}
    \n-
    36
    \n-
    37// class specialization of standard classes that allow to use structured bindings on QuadraturePoint
    \n-
    38namespace std {
    \n-
    39 template<typename ct, int dim>
    \n-
    40 struct tuple_size<Dune::QuadraturePoint<ct,dim>> : public std::integral_constant<std::size_t,2> {};
    \n-
    41
    \n-
    42 template<typename ct, int dim>
    \n-
    43 struct tuple_element<0, Dune::QuadraturePoint<ct,dim>> { using type = Dune::FieldVector<ct, dim>; };
    \n-
    44
    \n-
    45 template<typename ct, int dim>
    \n-
    46 struct tuple_element<1, Dune::QuadraturePoint<ct,dim>> { using type = ct; };
    \n-
    47}
    \n-
    48
    \n-
    49namespace Dune {
    \n-
    50
    \n-
    55 class QuadratureOrderOutOfRange : public NotImplemented {};
    \n-
    56
    \n-
    65 template<typename ct, int dim>
    \n-
    \n-\n-
    67 public:
    \n-
    69 constexpr static int dimension = dim;
    \n-
    70
    \n-
    72 typedef ct Field;
    \n-
    73
    \n-
    75 typedef Dune::FieldVector<ct,dim> Vector;
    \n-
    76
    \n-
    \n-
    78 QuadraturePoint (const Vector& x, ct w) : local(x), weight_(w)
    \n-
    79 {}
    \n-
    \n-
    80
    \n-
    \n-
    82 const Vector& position () const
    \n-
    83 {
    \n-
    84 return local;
    \n-
    85 }
    \n-
    \n-
    86
    \n-
    \n-
    88 const ct &weight () const
    \n-
    89 {
    \n-
    90 return weight_;
    \n-
    91 }
    \n-
    \n+
    48 template <class CoordType, unsigned int dim, unsigned int coorddim>
    \n+
    \n+\n+
    50 {
    \n+
    51
    \n+
    52
    \n+
    53 public:
    \n+
    54
    \n+
    56 constexpr static int mydimension = dim;
    \n+
    57
    \n+
    59 constexpr static int coorddimension = coorddim;
    \n+
    60
    \n+
    62 typedef CoordType ctype;
    \n+
    63
    \n+
    65 typedef FieldVector<ctype,dim> LocalCoordinate;
    \n+
    66
    \n+
    68 typedef FieldVector<ctype,coorddim> GlobalCoordinate;
    \n+
    69
    \n+
    71 typedef ctype Volume;
    \n+
    72
    \n+
    79 typedef typename std::conditional<dim==coorddim,
    \n+
    80 DiagonalMatrix<ctype,dim>,
    \n+
    81 FieldMatrix<ctype,dim,coorddim> >::type JacobianTransposed;
    \n+
    82
    \n+
    89 typedef typename std::conditional<dim==coorddim,
    \n+
    90 DiagonalMatrix<ctype,dim>,
    \n+
    91 FieldMatrix<ctype,coorddim,dim> >::type JacobianInverseTransposed;
    \n
    92
    \n-
    111 template<std::size_t index, std::enable_if_t<(index<=1), int> = 0>
    \n-
    \n-
    112 std::tuple_element_t<index, QuadraturePoint<ct, dim>> get() const
    \n-
    113 {
    \n-
    114 if constexpr (index == 0) {
    \n-
    115 return local;
    \n-
    116 }
    \n-
    117 else {
    \n-
    118 return weight_;
    \n-
    119 }
    \n-
    120 }
    \n-
    \n-
    121
    \n-
    122 protected:
    \n-
    123 FieldVector<ct, dim> local;
    \n-
    124 ct weight_;
    \n-
    125 };
    \n-
    \n-
    126
    \n-
    \n-
    130 namespace QuadratureType {
    \n-
    \n-
    131 enum Enum {
    \n-
    141 GaussLegendre = 0,
    \n-
    142
    \n-
    148 GaussJacobi_1_0 = 1,
    \n-
    149
    \n-
    155 GaussJacobi_2_0 = 2,
    \n-
    156
    \n-
    168 GaussJacobi_n_0 = 3,
    \n-
    169
    \n-
    176 GaussLobatto = 4,
    \n-
    177
    \n-
    184 GaussRadauLeft = 5,
    \n-
    185
    \n-
    193 GaussRadauRight = 6,
    \n-
    194 size
    \n-
    195 };
    \n-
    \n-
    196 }
    \n-
    \n-
    197
    \n-
    212 template<typename ct, int dim>
    \n-
    \n-
    213 class QuadratureRule : public std::vector<QuadraturePoint<ct,dim> >
    \n-
    214 {
    \n-
    215 public:
    \n-
    221 QuadratureRule() : delivered_order(-1) {}
    \n-
    222
    \n-
    223 protected:
    \n-
    225 QuadratureRule(GeometryType t) : geometry_type(t), delivered_order(-1) {}
    \n-
    226
    \n-
    228 QuadratureRule(GeometryType t, int order) : geometry_type(t), delivered_order(order) {}
    \n-
    229 public:
    \n-
    231 constexpr static int d = dim;
    \n-
    232
    \n-
    234 typedef ct CoordType;
    \n-
    235
    \n-
    237 virtual int order () const { return delivered_order; }
    \n-
    238
    \n-
    240 virtual GeometryType type () const { return geometry_type; }
    \n-
    241 virtual ~QuadratureRule(){}
    \n-
    242
    \n-
    245 typedef typename std::vector<QuadraturePoint<ct,dim> >::const_iterator iterator;
    \n-
    246
    \n-
    247 protected:
    \n-\n-\n-
    250 };
    \n-
    \n-
    251
    \n-
    252 // Forward declaration of the factory class,
    \n-
    253 // needed internally by the QuadratureRules container class.
    \n-
    254 template<typename ctype, int dim> class QuadratureRuleFactory;
    \n-
    255
    \n-
    259 template<typename ctype, int dim>
    \n-
    \n-\n-
    261
    \n-\n-
    264
    \n-
    265 // indexed by quadrature order
    \n-
    266 using QuadratureOrderVector = std::vector<std::pair<std::once_flag, QuadratureRule> >;
    \n-
    267
    \n-
    268 // indexed by geometry type
    \n-
    269 using GeometryTypeVector = std::vector<std::pair<std::once_flag, QuadratureOrderVector> >;
    \n-
    270
    \n-
    271 // indexed by quadrature type enum
    \n-
    272 using QuadratureCacheVector = std::vector<std::pair<std::once_flag, GeometryTypeVector> >;
    \n-
    273
    \n-
    275 DUNE_EXPORT const QuadratureRule& _rule(const GeometryType& t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre) const
    \n-
    276 {
    \n-
    277 assert(t.dim()==dim);
    \n-
    278
    \n-
    279 DUNE_ASSERT_CALL_ONCE();
    \n-
    280
    \n-
    281 static QuadratureCacheVector quadratureCache(QuadratureType::size);
    \n-
    282
    \n-
    283 auto& [ onceFlagQuadratureType, geometryTypes ] = quadratureCache[qt];
    \n-
    284 // initialize geometry types for this quadrature type once
    \n-
    285 std::call_once(onceFlagQuadratureType, [&types = geometryTypes]{
    \n-
    286 types = GeometryTypeVector(LocalGeometryTypeIndex::size(dim));
    \n-
    287 });
    \n-
    288
    \n-
    289 auto& [ onceFlagGeometryType, quadratureOrders ] = geometryTypes[LocalGeometryTypeIndex::index(t)];
    \n-
    290 // initialize quadrature orders for this geometry type and quadrature type once
    \n-
    291 std::call_once(onceFlagGeometryType, [&, &orders = quadratureOrders]{
    \n-
    292 // we only need one quadrature rule for points, not maxint
    \n-
    293 const auto numRules = dim == 0 ? 1 : QuadratureRuleFactory<ctype,dim>::maxOrder(t, qt)+1;
    \n-
    294 orders = QuadratureOrderVector(numRules);
    \n-
    295 });
    \n-
    296
    \n-
    297 // we only have one quadrature rule for points
    \n-
    298 auto& [ onceFlagQuadratureOrder, quadratureRule ] = quadratureOrders[dim == 0 ? 0 : p];
    \n-
    299 // initialize quadrature rule once
    \n-
    300 std::call_once(onceFlagQuadratureOrder, [&, &rule = quadratureRule]{
    \n-\n-
    302 });
    \n-
    303
    \n-
    304 return quadratureRule;
    \n-
    305 }
    \n-
    306
    \n-
    308 DUNE_EXPORT static QuadratureRules& instance()
    \n-
    309 {
    \n-
    310 static QuadratureRules instance;
    \n-
    311 return instance;
    \n-
    312 }
    \n-
    313
    \n-
    315 QuadratureRules () = default;
    \n-
    316 public:
    \n-
    318 static unsigned
    \n-
    \n-\n-
    320 QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n-
    321 {
    \n-\n-
    323 }
    \n-
    \n-
    324
    \n-
    \n-
    326 static const QuadratureRule& rule(const GeometryType& t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n-
    327 {
    \n-
    328 return instance()._rule(t,p,qt);
    \n-
    329 }
    \n-
    \n-
    330
    \n-
    \n-
    332 static const QuadratureRule& rule(const GeometryType::BasicType t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n-
    333 {
    \n-
    334 GeometryType gt(t,dim);
    \n-
    335 return instance()._rule(gt,p,qt);
    \n-
    336 }
    \n+
    100 using Jacobian = std::conditional_t<dim==coorddim, DiagonalMatrix<ctype,dim>, FieldMatrix<ctype,coorddim,dim> >;
    \n+
    101
    \n+
    109 using JacobianInverse = std::conditional_t<dim==coorddim, DiagonalMatrix<ctype,dim>, FieldMatrix<ctype,dim,coorddim> >;
    \n+
    110
    \n+\n+
    119
    \n+
    \n+
    124 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower,
    \n+
    125 const Dune::FieldVector<ctype,coorddim> upper)
    \n+
    126 : lower_(lower),
    \n+
    127 upper_(upper),
    \n+
    128 axes_()
    \n+
    129 {
    \n+
    130 static_assert(dim==coorddim, "Use this constructor only if dim==coorddim!");
    \n+
    131 // all 'true', but is never actually used
    \n+
    132 axes_ = (1<<coorddim)-1;
    \n+
    133 }
    \n+
    \n+
    134
    \n+
    \n+
    142 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower,
    \n+
    143 const Dune::FieldVector<ctype,coorddim> upper,
    \n+
    144 const std::bitset<coorddim>& axes)
    \n+
    145 : lower_(lower),
    \n+
    146 upper_(upper),
    \n+
    147 axes_(axes)
    \n+
    148 {
    \n+
    149 assert(axes.count()==dim);
    \n+
    150 for (size_t i=0; i<coorddim; i++)
    \n+
    151 if (not axes_[i])
    \n+
    152 upper_[i] = lower_[i];
    \n+
    153 }
    \n+
    \n+
    154
    \n+
    \n+
    159 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower)
    \n+
    160 : lower_(lower)
    \n+
    161 {}
    \n+
    \n+
    162
    \n+
    \n+\n+
    165 {
    \n+
    166 return GeometryTypes::cube(dim);
    \n+
    167 }
    \n+
    \n+
    168
    \n+
    \n+\n+
    171 {
    \n+
    172 GlobalCoordinate result;
    \n+
    173 if (dim == coorddim) { // fast case
    \n+
    174 for (size_t i=0; i<coorddim; i++)
    \n+
    175 result[i] = lower_[i] + local[i]*(upper_[i] - lower_[i]);
    \n+
    176 } else if (dim == 0) { // a vertex -- the other fast case
    \n+
    177 result = lower_; // hope for named-return-type-optimization
    \n+
    178 } else { // slow case
    \n+
    179 size_t lc=0;
    \n+
    180 for (size_t i=0; i<coorddim; i++)
    \n+
    181 result[i] = (axes_[i])
    \n+
    182 ? lower_[i] + local[lc++]*(upper_[i] - lower_[i])
    \n+
    183 : lower_[i];
    \n+
    184 }
    \n+
    185 return result;
    \n+
    186 }
    \n+
    \n+
    187
    \n+
    \n+\n+
    190 {
    \n+
    191 LocalCoordinate result;
    \n+
    192 if (dim == coorddim) { // fast case
    \n+
    193 for (size_t i=0; i<dim; i++)
    \n+
    194 result[i] = (global[i] - lower_[i]) / (upper_[i] - lower_[i]);
    \n+
    195 } else if (dim != 0) { // slow case
    \n+
    196 size_t lc=0;
    \n+
    197 for (size_t i=0; i<coorddim; i++)
    \n+
    198 if (axes_[i])
    \n+
    199 result[lc++] = (global[i] - lower_[i]) / (upper_[i] - lower_[i]);
    \n+
    200 }
    \n+
    201 return result;
    \n+
    202 }
    \n+
    \n+
    203
    \n+
    \n+\n+
    206 {
    \n+
    207 JacobianTransposed result;
    \n+
    208
    \n+
    209 // Actually compute the result. Uses different methods depending
    \n+
    210 // on what kind of matrix JacobianTransposed is.
    \n+
    211 jacobianTransposed(result);
    \n+
    212
    \n+
    213 return result;
    \n+
    214 }
    \n+
    \n+
    215
    \n+
    \n+\n+
    218 {
    \n+\n+
    220
    \n+
    221 // Actually compute the result. Uses different methods depending
    \n+
    222 // on what kind of matrix JacobianTransposed is.
    \n+\n+
    224
    \n+
    225 return result;
    \n+
    226 }
    \n+
    \n+
    227
    \n+
    \n+
    229 Jacobian jacobian([[maybe_unused]] const LocalCoordinate& local) const
    \n+
    230 {
    \n+
    231 return jacobianTransposed(local).transposed();
    \n+
    232 }
    \n+
    \n+
    233
    \n+
    \n+\n+
    236 {
    \n+
    237 return jacobianInverseTransposed(local).transposed();
    \n+
    238 }
    \n+
    \n+
    239
    \n+
    \n+
    243 Volume integrationElement([[maybe_unused]] const LocalCoordinate& local) const
    \n+
    244 {
    \n+
    245 return volume();
    \n+
    246 }
    \n+
    \n+
    247
    \n+
    \n+\n+
    250 {
    \n+
    251 GlobalCoordinate result;
    \n+
    252 if (dim==0)
    \n+
    253 result = lower_;
    \n+
    254 else {
    \n+
    255 // Since lower_==upper_ for unused coordinates, this always does the right thing
    \n+
    256 for (size_t i=0; i<coorddim; i++)
    \n+
    257 result[i] = CoordType(0.5) * (lower_[i] + upper_[i]);
    \n+
    258 }
    \n+
    259 return result;
    \n+
    260 }
    \n
    \n-
    337 };
    \n+
    261
    \n+
    \n+
    263 int corners() const
    \n+
    264 {
    \n+
    265 return 1<<dim;
    \n+
    266 }
    \n
    \n-
    338
    \n-
    339} // end namespace Dune
    \n+
    267
    \n+
    \n+\n+
    270 {
    \n+
    271 GlobalCoordinate result;
    \n+
    272 if (dim == coorddim) { // fast case
    \n+
    273 for (size_t i=0; i<coorddim; i++)
    \n+
    274 result[i] = (k & (1<<i)) ? upper_[i] : lower_[i];
    \n+
    275 } else if (dim == 0) { // vertex
    \n+
    276 result = lower_; // rely on named return-type optimization
    \n+
    277 } else { // slow case
    \n+
    278 unsigned int mask = 1;
    \n+
    279
    \n+
    280 for (size_t i=0; i<coorddim; i++) {
    \n+
    281 if (not axes_[i])
    \n+
    282 result[i] = lower_[i];
    \n+
    283 else {
    \n+
    284 result[i] = (k & mask) ? upper_[i] : lower_[i];
    \n+
    285 mask = (mask<<1);
    \n+
    286 }
    \n+
    287 }
    \n+
    288 }
    \n+
    289
    \n+
    290
    \n+
    291 return result;
    \n+
    292 }
    \n+
    \n+
    293
    \n+
    \n+\n+
    296 {
    \n+
    297 ctype vol = 1;
    \n+
    298 if (dim == coorddim) { // fast case
    \n+
    299 for (size_t i=0; i<dim; i++)
    \n+
    300 vol *= upper_[i] - lower_[i];
    \n+
    301 // do nothing if dim == 0
    \n+
    302 } else if (dim != 0) { // slow case
    \n+
    303 for (size_t i=0; i<coorddim; i++)
    \n+
    304 if (axes_[i])
    \n+
    305 vol *= upper_[i] - lower_[i];
    \n+
    306 }
    \n+
    307 return vol;
    \n+
    308 }
    \n+
    \n+
    309
    \n+
    \n+
    311 bool affine() const
    \n+
    312 {
    \n+
    313 return true;
    \n+
    314 }
    \n+
    \n+
    315
    \n+\n+
    320
    \n+
    321 private:
    \n+
    322 // jacobianTransposed: fast case --> diagonal matrix
    \n+
    323 void jacobianTransposed ( DiagonalMatrix<ctype,dim> &jacobianTransposed ) const
    \n+
    324 {
    \n+
    325 for (size_t i=0; i<dim; i++)
    \n+
    326 jacobianTransposed.diagonal()[i] = upper_[i] - lower_[i];
    \n+
    327 }
    \n+
    328
    \n+
    329 // jacobianTransposed: slow case --> dense matrix
    \n+
    330 void jacobianTransposed ( FieldMatrix<ctype,dim,coorddim> &jacobianTransposed ) const
    \n+
    331 {
    \n+
    332 if (dim==0)
    \n+
    333 return;
    \n+
    334
    \n+
    335 size_t lc = 0;
    \n+
    336 for (size_t i=0; i<coorddim; i++)
    \n+
    337 if (axes_[i])
    \n+
    338 jacobianTransposed[lc++][i] = upper_[i] - lower_[i];
    \n+
    339 }
    \n
    340
    \n-
    341#define DUNE_INCLUDING_IMPLEMENTATION
    \n-
    342
    \n-
    343// 0d rules
    \n-
    344#include "quadraturerules/pointquadrature.hh"
    \n-
    345// 1d rules
    \n-
    346#include "quadraturerules/gausslobattoquadrature.hh"
    \n-
    347#include "quadraturerules/gaussquadrature.hh"
    \n-
    348#include "quadraturerules/gaussradauleftquadrature.hh"
    \n-
    349#include "quadraturerules/gaussradaurightquadrature.hh"
    \n-
    350#include "quadraturerules/jacobi1quadrature.hh"
    \n-
    351#include "quadraturerules/jacobi2quadrature.hh"
    \n-
    352#include "quadraturerules/jacobiNquadrature.hh"
    \n-
    353// 3d rules
    \n-
    354#include "quadraturerules/prismquadrature.hh"
    \n-
    355// general rules
    \n-
    356#include "quadraturerules/simplexquadrature.hh"
    \n-
    357#include "quadraturerules/tensorproductquadrature.hh"
    \n-
    358
    \n-
    359#undef DUNE_INCLUDING_IMPLEMENTATION
    \n-
    360
    \n-
    361namespace Dune {
    \n-
    362
    \n-
    369 template<typename ctype, int dim>
    \n-
    \n-\n-
    371 private:
    \n-
    372 friend class QuadratureRules<ctype, dim>;
    \n-
    373 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n-
    374 {
    \n-
    375 return TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n-
    376 }
    \n-
    377 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n-
    378 {
    \n-
    379 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n-
    380 }
    \n-
    381 };
    \n-
    \n-
    382
    \n-
    383 template<typename ctype>
    \n-
    \n-
    384 class QuadratureRuleFactory<ctype, 0> {
    \n-
    385 private:
    \n-
    386 constexpr static int dim = 0;
    \n-
    387 friend class QuadratureRules<ctype, dim>;
    \n-
    388 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum)
    \n-
    389 {
    \n-
    390 if (t.isVertex())
    \n-
    391 {
    \n-
    392 return std::numeric_limits<int>::max();
    \n-
    393 }
    \n-
    394 DUNE_THROW(Exception, "Unknown GeometryType");
    \n-
    395 }
    \n-
    396 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int , QuadratureType::Enum)
    \n-
    397 {
    \n-
    398 if (t.isVertex())
    \n-
    399 {
    \n-
    400 return PointQuadratureRule<ctype>();
    \n-
    401 }
    \n-
    402 DUNE_THROW(Exception, "Unknown GeometryType");
    \n-
    403 }
    \n-
    404 };
    \n-
    \n-
    405
    \n-
    406 template<typename ctype>
    \n-
    \n-
    407 class QuadratureRuleFactory<ctype, 1> {
    \n-
    408 private:
    \n-
    409 constexpr static int dim = 1;
    \n-
    410 friend class QuadratureRules<ctype, dim>;
    \n-
    411 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n-
    412 {
    \n-
    413 if (t.isLine())
    \n-
    414 {
    \n-
    415 switch (qt) {
    \n-\n-
    417 return GaussQuadratureRule1D<ctype>::highest_order;
    \n-\n-
    419 return Jacobi1QuadratureRule1D<ctype>::highest_order;
    \n-\n-
    421 return Jacobi2QuadratureRule1D<ctype>::highest_order;
    \n-\n-
    423 return GaussLobattoQuadratureRule1D<ctype>::highest_order;
    \n-\n-
    425 return JacobiNQuadratureRule1D<ctype>::maxOrder();
    \n-\n-
    427 return GaussRadauLeftQuadratureRule1D<ctype>::highest_order;
    \n-\n-
    429 return GaussRadauRightQuadratureRule1D<ctype>::highest_order;
    \n-
    430 default :
    \n-
    431 DUNE_THROW(Exception, "Unknown QuadratureType");
    \n-
    432 }
    \n-
    433 }
    \n-
    434 DUNE_THROW(Exception, "Unknown GeometryType");
    \n-
    435 }
    \n-
    436 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n-
    437 {
    \n-
    438 if (t.isLine())
    \n-
    439 {
    \n-
    440 switch (qt) {
    \n-\n-
    442 return GaussQuadratureRule1D<ctype>(p);
    \n-\n-
    444 return Jacobi1QuadratureRule1D<ctype>(p);
    \n-\n-
    446 return Jacobi2QuadratureRule1D<ctype>(p);
    \n-\n-
    448 return GaussLobattoQuadratureRule1D<ctype>(p);
    \n-\n-
    450 return JacobiNQuadratureRule1D<ctype>(p);
    \n-\n-
    452 return GaussRadauLeftQuadratureRule1D<ctype>(p);
    \n-\n-
    454 return GaussRadauRightQuadratureRule1D<ctype>(p);
    \n-
    455 default :
    \n-
    456 DUNE_THROW(Exception, "Unknown QuadratureType");
    \n-
    457 }
    \n-
    458 }
    \n-
    459 DUNE_THROW(Exception, "Unknown GeometryType");
    \n-
    460 }
    \n-
    461 };
    \n-
    \n-
    462
    \n-
    463 template<typename ctype>
    \n-
    \n-
    464 class QuadratureRuleFactory<ctype, 2> {
    \n-
    465 private:
    \n-
    466 constexpr static int dim = 2;
    \n-
    467 friend class QuadratureRules<ctype, dim>;
    \n-
    468 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n-
    469 {
    \n-
    470 unsigned order =
    \n-
    471 TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n-
    472 if (t.isSimplex())
    \n-
    473 order = std::max
    \n-
    474 (order, static_cast<unsigned>(SimplexQuadratureRule<ctype,dim>::highest_order));
    \n-
    475 return order;
    \n-
    476 }
    \n-
    477 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n-
    478 {
    \n-
    479 if (t.isSimplex()
    \n-\n-
    481 && p <= SimplexQuadratureRule<ctype,dim>::highest_order)
    \n-
    482 {
    \n-
    483 return SimplexQuadratureRule<ctype,dim>(p);
    \n-
    484 }
    \n-
    485 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n-
    486 }
    \n-
    487 };
    \n-
    \n-
    488
    \n-
    489 template<typename ctype>
    \n-
    \n-
    490 class QuadratureRuleFactory<ctype, 3> {
    \n-
    491 private:
    \n-
    492 constexpr static int dim = 3;
    \n-
    493 friend class QuadratureRules<ctype, dim>;
    \n-
    494 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n-
    495 {
    \n-
    496 unsigned order =
    \n-
    497 TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n-
    498 if (t.isSimplex())
    \n-
    499 order = std::max
    \n-
    500 (order, static_cast<unsigned>(SimplexQuadratureRule<ctype,dim>::highest_order));
    \n-
    501 if (t.isPrism())
    \n-
    502 order = std::max
    \n-
    503 (order, static_cast<unsigned>(PrismQuadratureRule<ctype,dim>::highest_order));
    \n-
    504 return order;
    \n-
    505 }
    \n-
    506 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n-
    507 {
    \n-
    508
    \n-
    509 if (t.isSimplex()
    \n-\n-
    511 && p <= SimplexQuadratureRule<ctype,dim>::highest_order)
    \n-
    512 {
    \n-
    513 return SimplexQuadratureRule<ctype,dim>(p);
    \n-
    514 }
    \n-
    515 if (t.isPrism()
    \n-\n-
    517 && p <= PrismQuadratureRule<ctype,dim>::highest_order)
    \n-
    518 {
    \n-
    519 return PrismQuadratureRule<ctype,dim>(p);
    \n-
    520 }
    \n-
    521 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n-
    522 }
    \n-
    523 };
    \n-
    \n-
    524
    \n-
    525#ifndef DUNE_NO_EXTERN_QUADRATURERULES
    \n-
    526 extern template class GaussLobattoQuadratureRule<double, 1>;
    \n-
    527 extern template class GaussQuadratureRule<double, 1>;
    \n-
    528 extern template class GaussRadauLeftQuadratureRule<double, 1>;
    \n-
    529 extern template class GaussRadauRightQuadratureRule<double, 1>;
    \n-
    530 extern template class Jacobi1QuadratureRule<double, 1>;
    \n-
    531 extern template class Jacobi2QuadratureRule<double, 1>;
    \n-
    532 extern template class JacobiNQuadratureRule<double, 1>;
    \n-
    533 extern template class PrismQuadratureRule<double, 3>;
    \n-
    534 extern template class SimplexQuadratureRule<double, 2>;
    \n-
    535 extern template class SimplexQuadratureRule<double, 3>;
    \n-
    536#endif // !DUNE_NO_EXTERN_QUADRATURERULES
    \n-
    537
    \n-
    538} // end namespace
    \n-
    539
    \n-
    540#endif // DUNE_GEOMETRY_QUADRATURERULES_HH
    \n-
    Helper classes to provide indices for geometrytypes for use in a vector.
    \n-
    A unique label for each type of element that can occur in a grid.
    \n-
    STL namespace.
    \n+
    341 // jacobianInverseTransposed: fast case --> diagonal matrix
    \n+
    342 void jacobianInverseTransposed ( DiagonalMatrix<ctype,dim> &jacobianInverseTransposed ) const
    \n+
    343 {
    \n+
    344 for (size_t i=0; i<dim; i++)
    \n+
    345 jacobianInverseTransposed.diagonal()[i] = CoordType(1.0) / (upper_[i] - lower_[i]);
    \n+
    346 }
    \n+
    347
    \n+
    348 // jacobianInverseTransposed: slow case --> dense matrix
    \n+
    349 void jacobianInverseTransposed ( FieldMatrix<ctype,coorddim,dim> &jacobianInverseTransposed ) const
    \n+
    350 {
    \n+
    351 if (dim==0)
    \n+
    352 return;
    \n+
    353
    \n+
    354 size_t lc = 0;
    \n+
    355 for (size_t i=0; i<coorddim; i++)
    \n+
    356 if (axes_[i])
    \n+
    357 jacobianInverseTransposed[i][lc++] = CoordType(1.0) / (upper_[i] - lower_[i]);
    \n+
    358 }
    \n+
    359
    \n+
    360 Dune::FieldVector<ctype,coorddim> lower_;
    \n+
    361
    \n+
    362 Dune::FieldVector<ctype,coorddim> upper_;
    \n+
    363
    \n+
    364 std::bitset<coorddim> axes_;
    \n+
    365 };
    \n+
    \n+
    366
    \n+
    367} // namespace Dune
    \n+
    368#endif
    \n+\n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    Enum
    Definition quadraturerules.hh:131
    \n-
    @ GaussJacobi_n_0
    Gauss-Legendre rules with .
    Definition quadraturerules.hh:168
    \n-
    @ GaussJacobi_2_0
    Gauss-Legendre rules with .
    Definition quadraturerules.hh:155
    \n-
    @ GaussRadauRight
    Gauss-Radau rules including the right endpoint.
    Definition quadraturerules.hh:193
    \n-
    @ GaussJacobi_1_0
    Gauss-Jacobi rules with .
    Definition quadraturerules.hh:148
    \n-
    @ GaussLobatto
    Gauss-Lobatto rules.
    Definition quadraturerules.hh:176
    \n-
    @ GaussRadauLeft
    Gauss-Radau rules including the left endpoint.
    Definition quadraturerules.hh:184
    \n-
    @ GaussLegendre
    Gauss-Legendre rules (default)
    Definition quadraturerules.hh:141
    \n-
    Single evaluation point in a quadrature rule.
    Definition quadraturerules.hh:66
    \n-
    const Vector & position() const
    return local coordinates of integration point i
    Definition quadraturerules.hh:82
    \n-
    Dune::FieldVector< ct, dim > Vector
    Type used for the position of a quadrature point.
    Definition quadraturerules.hh:75
    \n-
    ct Field
    Number type used for coordinates and quadrature weights.
    Definition quadraturerules.hh:72
    \n-
    const ct & weight() const
    return weight associated with integration point i
    Definition quadraturerules.hh:88
    \n-
    ct weight_
    Definition quadraturerules.hh:124
    \n-
    static constexpr int dimension
    Dimension of the integration domain.
    Definition quadraturerules.hh:69
    \n-
    QuadraturePoint(const Vector &x, ct w)
    set up quadrature of given order in d dimensions
    Definition quadraturerules.hh:78
    \n-
    FieldVector< ct, dim > local
    Definition quadraturerules.hh:123
    \n-
    Dune::FieldVector< ct, dim > type
    Definition quadraturerules.hh:43
    \n-\n-
    Exception thrown if a desired QuadratureRule is not available, because the requested order is to high...
    Definition quadraturerules.hh:55
    \n-
    Abstract base class for quadrature rules.
    Definition quadraturerules.hh:214
    \n-
    virtual ~QuadratureRule()
    Definition quadraturerules.hh:241
    \n-
    virtual GeometryType type() const
    return type of element
    Definition quadraturerules.hh:240
    \n-
    int delivered_order
    Definition quadraturerules.hh:249
    \n-
    QuadratureRule(GeometryType t, int order)
    Constructor for a given geometry type and a given quadrature order.
    Definition quadraturerules.hh:228
    \n-
    GeometryType geometry_type
    Definition quadraturerules.hh:248
    \n-
    ct CoordType
    The type used for coordinates.
    Definition quadraturerules.hh:234
    \n-
    QuadratureRule()
    Default constructor.
    Definition quadraturerules.hh:221
    \n-
    virtual int order() const
    return order
    Definition quadraturerules.hh:237
    \n-
    QuadratureRule(GeometryType t)
    Constructor for a given geometry type. Leaves the quadrature order invalid
    Definition quadraturerules.hh:225
    \n-
    std::vector< QuadraturePoint< ct, dim > >::const_iterator iterator
    Definition quadraturerules.hh:245
    \n-
    Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType.
    Definition quadraturerules.hh:370
    \n-
    A container for all quadrature rules of dimension dim
    Definition quadraturerules.hh:260
    \n-
    static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    maximum quadrature order for given geometry type and quadrature type
    Definition quadraturerules.hh:319
    \n-
    static const QuadratureRule & rule(const GeometryType::BasicType t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    select the appropriate QuadratureRule for GeometryType t and order p
    Definition quadraturerules.hh:332
    \n-
    static const QuadratureRule & rule(const GeometryType &t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    select the appropriate QuadratureRule for GeometryType t and order p
    Definition quadraturerules.hh:326
    \n+
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n+
    static const ReferenceElement & cube()
    get hypercube reference elements
    Definition referenceelements.hh:168
    \n+
    A geometry implementation for axis-aligned hypercubes.
    Definition axisalignedcubegeometry.hh:50
    \n+
    Volume volume() const
    Return the element volume.
    Definition axisalignedcubegeometry.hh:295
    \n+
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const Dune::FieldVector< ctype, coorddim > upper, const std::bitset< coorddim > &axes)
    Constructor from a lower left and an upper right corner.
    Definition axisalignedcubegeometry.hh:142
    \n+
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const Dune::FieldVector< ctype, coorddim > upper)
    Constructor from a lower left and an upper right corner.
    Definition axisalignedcubegeometry.hh:124
    \n+
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Inverse Jacobian of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:235
    \n+
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    Inverse Jacobian transposed of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:217
    \n+
    std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, dim, coorddim > >::type JacobianTransposed
    Return type of jacobianTransposed.
    Definition axisalignedcubegeometry.hh:81
    \n+
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower)
    Constructor from a single point only.
    Definition axisalignedcubegeometry.hh:159
    \n+
    static constexpr int mydimension
    Dimension of the cube element.
    Definition axisalignedcubegeometry.hh:56
    \n+
    friend Dune::ReferenceElements< ctype, dim >::ReferenceElement referenceElement(const AxisAlignedCubeGeometry &)
    Definition axisalignedcubegeometry.hh:316
    \n+
    static constexpr int coorddimension
    Dimension of the world space that the cube element is embedded in.
    Definition axisalignedcubegeometry.hh:59
    \n+
    GlobalCoordinate corner(int k) const
    Return world coordinates of the k-th corner of the element.
    Definition axisalignedcubegeometry.hh:269
    \n+
    ctype Volume
    Type used for volume.
    Definition axisalignedcubegeometry.hh:71
    \n+
    FieldVector< ctype, dim > LocalCoordinate
    Type used for a vector of element coordinates.
    Definition axisalignedcubegeometry.hh:65
    \n+
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    Jacobian transposed of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:205
    \n+
    FieldVector< ctype, coorddim > GlobalCoordinate
    Type used for a vector of world coordinates.
    Definition axisalignedcubegeometry.hh:68
    \n+
    LocalCoordinate local(const GlobalCoordinate &global) const
    Map a point in global (world) coordinates to element coordinates.
    Definition axisalignedcubegeometry.hh:189
    \n+
    CoordType ctype
    Type used for single coordinate coefficients.
    Definition axisalignedcubegeometry.hh:62
    \n+
    std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, coorddim, dim > > Jacobian
    Return type of jacobian.
    Definition axisalignedcubegeometry.hh:100
    \n+
    GeometryType type() const
    Type of the cube. Here: a hypercube of the correct dimension.
    Definition axisalignedcubegeometry.hh:164
    \n+
    int corners() const
    Return the number of corners of the element.
    Definition axisalignedcubegeometry.hh:263
    \n+
    Jacobian jacobian(const LocalCoordinate &local) const
    Jacobian of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:229
    \n+
    std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, coorddim, dim > >::type JacobianInverseTransposed
    Return type of jacobianInverseTransposed.
    Definition axisalignedcubegeometry.hh:91
    \n+
    Volume integrationElement(const LocalCoordinate &local) const
    Return the integration element, i.e., the determinant term in the integral transformation formula.
    Definition axisalignedcubegeometry.hh:243
    \n+
    GlobalCoordinate center() const
    Return center of mass of the element.
    Definition axisalignedcubegeometry.hh:249
    \n+
    AxisAlignedCubeGeometry()=default
    Constructs an empty geometry.
    \n+
    bool affine() const
    Return if the element is affine. Here: yes.
    Definition axisalignedcubegeometry.hh:311
    \n+
    std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, dim, coorddim > > JacobianInverse
    Return type of jacobianInverse.
    Definition axisalignedcubegeometry.hh:109
    \n+
    GlobalCoordinate global(const LocalCoordinate &local) const
    Map a point in local (element) coordinates to world coordinates.
    Definition axisalignedcubegeometry.hh:170
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n-
    constexpr bool isPrism() const
    Return true if entity is a prism.
    Definition type.hh:309
    \n-
    constexpr bool isVertex() const
    Return true if entity is a vertex.
    Definition type.hh:279
    \n-
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n-
    BasicType
    Each entity can be tagged by one of these basic types plus its space dimension.
    Definition type.hh:120
    \n-
    constexpr bool isLine() const
    Return true if entity is a line segment.
    Definition type.hh:284
    \n-
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n-
    constexpr bool isSimplex() const
    Return true if entity is a simplex of any dimension.
    Definition type.hh:319
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,613 +1,438 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-quadraturerules.hh\n+axisalignedcubegeometry.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n 5\n-6#ifndef DUNE_GEOMETRY_QUADRATURERULES_HH\n-7#define DUNE_GEOMETRY_QUADRATURERULES_HH\n+6#ifndef DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH\n+7#define DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH\n 8\n-9#include \n-10#include \n-11#include \n-12#include \n-13#include \n-14#include \n-15\n-16#include \n-17#include \n-18#include \n-19#include \n-20#include \n+13#include \n+14\n+15#include \n+16#include \n+17#include \n+18\n+19#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n 21\n-22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n+22\n+23namespace _\bD_\bu_\bn_\be {\n 24\n-31namespace _\bD_\bu_\bn_\be {\n-32 // forward declaration\n-33 template\n-34 class QuadraturePoint;\n-35}\n-36\n-37// class specialization of standard classes that allow to use structured\n-bindings on QuadraturePoint\n-38namespace _\bs_\bt_\bd {\n-39 template\n-_\b4_\b0 struct tuple_size<_\bD_\bu_\bn_\be::QuadraturePoint> : public std::\n-integral_constant {};\n-41\n-42 template\n-_\b4_\b3 struct tuple_element<0, _\bD_\bu_\bn_\be::QuadraturePoint> { using _\bt_\by_\bp_\be = Dune::\n-FieldVector; };\n-44\n-45 template\n-_\b4_\b6 struct tuple_element<1, _\bD_\bu_\bn_\be::QuadraturePoint> { using _\bt_\by_\bp_\be = ct; };\n-47}\n-48\n-49namespace _\bD_\bu_\bn_\be {\n-50\n-_\b5_\b5 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be : public NotImplemented {};\n-56\n-65 template\n-_\b6_\b6 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt {\n-67 public:\n-_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n-70\n-_\b7_\b2 typedef ct _\bF_\bi_\be_\bl_\bd;\n-73\n-_\b7_\b5 typedef Dune::FieldVector _\bV_\be_\bc_\bt_\bo_\br;\n-76\n-_\b7_\b8 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt (const _\bV_\be_\bc_\bt_\bo_\br& x, ct w) : _\bl_\bo_\bc_\ba_\bl(x), _\bw_\be_\bi_\bg_\bh_\bt_\b_(w)\n-79 {}\n-80\n-_\b8_\b2 const _\bV_\be_\bc_\bt_\bo_\br& _\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn () const\n-83 {\n-84 return _\bl_\bo_\bc_\ba_\bl;\n-85 }\n-86\n-_\b8_\b8 const ct &_\bw_\be_\bi_\bg_\bh_\bt () const\n-89 {\n-90 return _\bw_\be_\bi_\bg_\bh_\bt_\b_;\n-91 }\n+48 template \n+_\b4_\b9 class _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+50 {\n+51\n+52\n+53 public:\n+54\n+_\b5_\b6 constexpr static int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n+57\n+_\b5_\b9 constexpr static int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = coorddim;\n+60\n+_\b6_\b2 typedef CoordType _\bc_\bt_\by_\bp_\be;\n+63\n+_\b6_\b5 typedef FieldVector _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+66\n+_\b6_\b8 typedef FieldVector _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+69\n+_\b7_\b1 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n+72\n+79 typedef typename std::conditional,\n+_\b8_\b1 FieldMatrix >_\b:_\b:_\bt_\by_\bp_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n+82\n+89 typedef typename std::conditional,\n+_\b9_\b1 FieldMatrix >_\b:_\b:_\bt_\by_\bp_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n 92\n-111 template = 0>\n-_\b1_\b1_\b2 std::tuple_element_t> get() const\n-113 {\n-114 if constexpr (index == 0) {\n-115 return local;\n-116 }\n-117 else {\n-118 return weight_;\n-119 }\n-120 }\n-121\n-122 protected:\n-_\b1_\b2_\b3 FieldVector local;\n-_\b1_\b2_\b4 ct weight_;\n-125 };\n-126\n-_\b1_\b3_\b0 namespace QuadratureType {\n-_\b1_\b3_\b1 enum Enum {\n-_\b1_\b4_\b1 GaussLegendre = 0,\n-142\n-_\b1_\b4_\b8 GaussJacobi_1_0 = 1,\n-149\n-_\b1_\b5_\b5 GaussJacobi_2_0 = 2,\n-156\n-_\b1_\b6_\b8 GaussJacobi_n_0 = 3,\n-169\n-_\b1_\b7_\b6 GaussLobatto = 4,\n-177\n-_\b1_\b8_\b4 GaussRadauLeft = 5,\n-185\n-_\b1_\b9_\b3 GaussRadauRight = 6,\n-194 size\n-_\b1_\b9_\b5 };\n-196 }\n-197\n-212 template\n-_\b2_\b1_\b3 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be : public std::vector >\n-214 {\n-215 public:\n-_\b2_\b2_\b1 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be() : delivered_order(-1) {}\n-222\n-223 protected:\n-_\b2_\b2_\b5 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be t) : geometry_type(t), delivered_order(-1) {}\n-226\n-_\b2_\b2_\b8 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be t, int order) : geometry_type(t),\n-delivered_order(order) {}\n-229 public:\n-_\b2_\b3_\b1 constexpr static int d = dim;\n-232\n-_\b2_\b3_\b4 typedef ct _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be;\n-235\n-_\b2_\b3_\b7 virtual int _\bo_\br_\bd_\be_\br () const { return delivered_order; }\n-238\n-_\b2_\b4_\b0 virtual _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const { return geometry_type; }\n-_\b2_\b4_\b1 virtual _\b~_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(){}\n-242\n-_\b2_\b4_\b5 typedef typename std::vector >::const_iterator\n-_\bi_\bt_\be_\br_\ba_\bt_\bo_\br;\n-246\n-247 protected:\n-_\b2_\b4_\b8 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b__\bt_\by_\bp_\be;\n-_\b2_\b4_\b9 int _\bd_\be_\bl_\bi_\bv_\be_\br_\be_\bd_\b__\bo_\br_\bd_\be_\br;\n-250 };\n-251\n-252 // Forward declaration of the factory class,\n-253 // needed internally by the QuadratureRules container class.\n-254 template class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-255\n-259 template\n-_\b2_\b6_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs {\n+_\b1_\b0_\b0 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn = std::conditional_t, FieldMatrix >;\n+101\n+_\b1_\b0_\b9 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be = std::conditional_t, FieldMatrix >;\n+110\n+_\b1_\b1_\b8 _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by () = default;\n+119\n+_\b1_\b2_\b4 _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by(const Dune::FieldVector lower,\n+125 const Dune::FieldVector upper)\n+126 : lower_(lower),\n+127 upper_(upper),\n+128 axes_()\n+129 {\n+130 static_assert(dim==coorddim, \"Use this constructor only if\n+dim==coorddim!\");\n+131 // all 'true', but is never actually used\n+132 axes_ = (1< lower,\n+143 const Dune::FieldVector upper,\n+144 const std::bitset& axes)\n+145 : lower_(lower),\n+146 upper_(upper),\n+147 axes_(axes)\n+148 {\n+149 assert(axes.count()==dim);\n+150 for (size_t i=0; i lower)\n+160 : lower_(lower)\n+161 {}\n+162\n+_\b1_\b6_\b4 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be() const\n+165 {\n+166 return GeometryTypes::cube(dim);\n+167 }\n+168\n+_\b1_\b7_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+171 {\n+172 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be result;\n+173 if (dim == coorddim) { // fast case\n+174 for (size_t i=0; i;\n-264\n-265 // indexed by quadrature order\n-266 using QuadratureOrderVector = std::vector >;\n+_\b2_\b6_\b3 int _\bc_\bo_\br_\bn_\be_\br_\bs() const\n+264 {\n+265 return 1< >;\n-270\n-271 // indexed by quadrature type enum\n-272 using QuadratureCacheVector = std::vector >;\n-273\n-275 DUNE_EXPORT const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre) const\n-276 {\n-277 assert(t._\bd_\bi_\bm()==dim);\n-278\n-279 DUNE_ASSERT_CALL_ONCE();\n-280\n-281 static QuadratureCacheVector quadratureCache(QuadratureType::size);\n-282\n-283 auto& [ onceFlagQuadratureType, geometryTypes ] = quadratureCache[qt];\n-284 // initialize geometry types for this quadrature type once\n-285 std::call_once(onceFlagQuadratureType, [&types = geometryTypes]{\n-286 types = GeometryTypeVector(LocalGeometryTypeIndex::size(dim));\n-287 });\n-288\n-289 auto& [ onceFlagGeometryType, quadratureOrders ] = geometryTypes\n-[LocalGeometryTypeIndex::index(t)];\n-290 // initialize quadrature orders for this geometry type and quadrature type\n-once\n-291 std::call_once(onceFlagGeometryType, [&, &orders = quadratureOrders]{\n-292 // we only need one quadrature rule for points, not maxint\n-293 const auto numRules = dim == 0 ? 1 : _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:\n-_\bm_\ba_\bx_\bO_\br_\bd_\be_\br(t, qt)+1;\n-294 orders = QuadratureOrderVector(numRules);\n-295 });\n-296\n-297 // we only have one quadrature rule for points\n-298 auto& [ onceFlagQuadratureOrder, quadratureRule ] = quadratureOrders[dim ==\n-0 ? 0 : p];\n-299 // initialize quadrature rule once\n-300 std::call_once(onceFlagQuadratureOrder, [&, &rule = quadratureRule]{\n-301 rule = _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\br_\bu_\bl_\be(t, p, qt);\n-302 });\n-303\n-304 return quadratureRule;\n-305 }\n-306\n-308 DUNE_EXPORT static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs& instance()\n-309 {\n-310 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs instance;\n-311 return instance;\n-312 }\n-313\n-315 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs () = default;\n-316 public:\n-318 static unsigned\n-_\b3_\b1_\b9 _\bm_\ba_\bx_\bO_\br_\bd_\be_\br(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t,\n-320 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n-321 {\n-322 return _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bm_\ba_\bx_\bO_\br_\bd_\be_\br(t,qt);\n-323 }\n-324\n-_\b3_\b2_\b6 static const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _\br_\bu_\bl_\be(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n-327 {\n-328 return instance()._rule(t,p,qt);\n-329 }\n-330\n-_\b3_\b3_\b2 static const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _\br_\bu_\bl_\be(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n-333 {\n-334 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt(t,dim);\n-335 return instance()._rule(gt,p,qt);\n-336 }\n-337 };\n-338\n-339} // end namespace Dune\n+_\b2_\b6_\b9 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br(int k) const\n+270 {\n+271 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be result;\n+272 if (dim == coorddim) { // fast case\n+273 for (size_t i=0; i_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by & /* geometry */ )\n+317 {\n+318 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>_\b:_\b:_\bc_\bu_\bb_\be();\n+319 }\n+320\n+321 private:\n+322 // jacobianTransposed: fast case --> diagonal matrix\n+323 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( DiagonalMatrix &_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd )\n+const\n+324 {\n+325 for (size_t i=0; i dense matrix\n+330 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( FieldMatrix\n+&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n+331 {\n+332 if (dim==0)\n+333 return;\n+334\n+335 size_t lc = 0;\n+336 for (size_t i=0; i\n-_\b3_\b7_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-371 private:\n-372 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n-373 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-374 {\n-375 return TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n-376 }\n-377 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-378 {\n-379 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n-380 }\n-381 };\n-382\n-383 template\n-_\b3_\b8_\b4 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-385 private:\n-_\b3_\b8_\b6 constexpr static int dim = 0;\n-387 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n-388 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm)\n-389 {\n-390 if (t._\bi_\bs_\bV_\be_\br_\bt_\be_\bx())\n-391 {\n-392 return std::numeric_limits::max();\n-393 }\n-394 DUNE_THROW(Exception, \"Unknown GeometryType\");\n-395 }\n-396 static QuadratureRule rule(const GeometryType& t, int ,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm)\n-397 {\n-398 if (t.isVertex())\n-399 {\n-400 return PointQuadratureRule();\n-401 }\n-402 DUNE_THROW(Exception, \"Unknown GeometryType\");\n-403 }\n-404 };\n-405\n-406 template\n-_\b4_\b0_\b7 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-408 private:\n-_\b4_\b0_\b9 constexpr static int dim = 1;\n-410 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n-411 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-412 {\n-413 if (t._\bi_\bs_\bL_\bi_\bn_\be())\n-414 {\n-415 switch (qt) {\n-416 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be :\n-417 return GaussQuadratureRule1D::highest_order;\n-418 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 :\n-419 return Jacobi1QuadratureRule1D::highest_order;\n-420 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 :\n-421 return Jacobi2QuadratureRule1D::highest_order;\n-422 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo :\n-423 return GaussLobattoQuadratureRule1D::highest_order;\n-424 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 :\n-425 return JacobiNQuadratureRule1D::maxOrder();\n-426 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt :\n-427 return GaussRadauLeftQuadratureRule1D::highest_order;\n-428 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt :\n-429 return GaussRadauRightQuadratureRule1D::highest_order;\n-430 default :\n-431 DUNE_THROW(Exception, \"Unknown QuadratureType\");\n-432 }\n-433 }\n-434 DUNE_THROW(Exception, \"Unknown GeometryType\");\n-435 }\n-436 static QuadratureRule rule(const GeometryType& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-437 {\n-438 if (t.isLine())\n-439 {\n-440 switch (qt) {\n-441 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be :\n-442 return GaussQuadratureRule1D(p);\n-443 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 :\n-444 return Jacobi1QuadratureRule1D(p);\n-445 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 :\n-446 return Jacobi2QuadratureRule1D(p);\n-447 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo :\n-448 return GaussLobattoQuadratureRule1D(p);\n-449 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 :\n-450 return JacobiNQuadratureRule1D(p);\n-451 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt :\n-452 return GaussRadauLeftQuadratureRule1D(p);\n-453 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt :\n-454 return GaussRadauRightQuadratureRule1D(p);\n-455 default :\n-456 DUNE_THROW(Exception, \"Unknown QuadratureType\");\n-457 }\n-458 }\n-459 DUNE_THROW(Exception, \"Unknown GeometryType\");\n-460 }\n-461 };\n-462\n-463 template\n-_\b4_\b6_\b4 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-465 private:\n-_\b4_\b6_\b6 constexpr static int dim = 2;\n-467 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n-468 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-469 {\n-470 unsigned order =\n-471 TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n-472 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n-473 order = std::max\n-474 (order, static_cast(SimplexQuadratureRule::\n-highest_order));\n-475 return order;\n-476 }\n-477 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-478 {\n-479 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx()\n-480 && ( qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be || qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n-_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 )\n-481 && p <= SimplexQuadratureRule::highest_order)\n-482 {\n-483 return SimplexQuadratureRule(p);\n-484 }\n-485 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n-486 }\n-487 };\n-488\n-489 template\n-_\b4_\b9_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-491 private:\n-_\b4_\b9_\b2 constexpr static int dim = 3;\n-493 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n-494 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-495 {\n-496 unsigned order =\n-497 TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n-498 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n-499 order = std::max\n-500 (order, static_cast(SimplexQuadratureRule::\n-highest_order));\n-501 if (t._\bi_\bs_\bP_\br_\bi_\bs_\bm())\n-502 order = std::max\n-503 (order, static_cast(PrismQuadratureRule::\n-highest_order));\n-504 return order;\n-505 }\n-506 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n-_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n-507 {\n-508\n-509 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx()\n-510 && ( qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be || qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n-_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 )\n-511 && p <= SimplexQuadratureRule::highest_order)\n-512 {\n-513 return SimplexQuadratureRule(p);\n-514 }\n-515 if (t._\bi_\bs_\bP_\br_\bi_\bs_\bm()\n-516 && qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be\n-517 && p <= PrismQuadratureRule::highest_order)\n-518 {\n-519 return PrismQuadratureRule(p);\n-520 }\n-521 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n-522 }\n-523 };\n-524\n-525#ifndef DUNE_NO_EXTERN_QUADRATURERULES\n-526 extern template class GaussLobattoQuadratureRule;\n-527 extern template class GaussQuadratureRule;\n-528 extern template class GaussRadauLeftQuadratureRule;\n-529 extern template class GaussRadauRightQuadratureRule;\n-530 extern template class Jacobi1QuadratureRule;\n-531 extern template class Jacobi2QuadratureRule;\n-532 extern template class JacobiNQuadratureRule;\n-533 extern template class PrismQuadratureRule;\n-534 extern template class SimplexQuadratureRule;\n-_\b5_\b3_\b5 extern template class SimplexQuadratureRule;\n-536#endif // !DUNE_NO_EXTERN_QUADRATURERULES\n-537\n-538} // end namespace\n-539\n-540#endif // DUNE_GEOMETRY_QUADRATURERULES_HH\n-_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh\n-Helper classes to provide indices for geometrytypes for use in a vector.\n+341 // jacobianInverseTransposed: fast case --> diagonal matrix\n+342 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( DiagonalMatrix\n+&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n+343 {\n+344 for (size_t i=0; i dense matrix\n+349 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( FieldMatrix\n+&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n+350 {\n+351 if (dim==0)\n+352 return;\n+353\n+354 size_t lc = 0;\n+355 for (size_t i=0; i lower_;\n+361\n+362 Dune::FieldVector upper_;\n+363\n+364 std::bitset axes_;\n+365 };\n+366\n+367} // namespace Dune\n+368#endif\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm\n-Enum\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:131\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0\n-@ GaussJacobi_n_0\n-Gauss-Legendre rules with .\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:168\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0\n-@ GaussJacobi_2_0\n-Gauss-Legendre rules with .\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:155\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt\n-@ GaussRadauRight\n-Gauss-Radau rules including the right endpoint.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:193\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0\n-@ GaussJacobi_1_0\n-Gauss-Jacobi rules with .\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:148\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo\n-@ GaussLobatto\n-Gauss-Lobatto rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:176\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt\n-@ GaussRadauLeft\n-Gauss-Radau rules including the left endpoint.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:184\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be\n-@ GaussLegendre\n-Gauss-Legendre rules (default)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt\n-Single evaluation point in a quadrature rule.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:66\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n-const Vector & position() const\n-return local coordinates of integration point i\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:82\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bV_\be_\bc_\bt_\bo_\br\n-Dune::FieldVector< ct, dim > Vector\n-Type used for the position of a quadrature point.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bF_\bi_\be_\bl_\bd\n-ct Field\n-Number type used for coordinates and quadrature weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:72\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bw_\be_\bi_\bg_\bh_\bt\n-const ct & weight() const\n-return weight associated with integration point i\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:88\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bw_\be_\bi_\bg_\bh_\bt_\b_\n-ct weight_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:124\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-Dimension of the integration domain.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt\n-QuadraturePoint(const Vector &x, ct w)\n-set up quadrature of given order in d dimensions\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-FieldVector< ct, dim > local\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:123\n-_\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b0_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>_\b:_\b:_\bt_\by_\bp_\be\n-Dune::FieldVector< ct, dim > type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:43\n-_\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b1_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>_\b:_\b:_\bt_\by_\bp_\be\n-ct type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be\n-Exception thrown if a desired QuadratureRule is not available, because the\n-requested order is to high...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:55\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-Abstract base class for quadrature rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\b~_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-virtual ~QuadratureRule()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:241\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bt_\by_\bp_\be\n-virtual GeometryType type() const\n-return type of element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:240\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bd_\be_\bl_\bi_\bv_\be_\br_\be_\bd_\b__\bo_\br_\bd_\be_\br\n-int delivered_order\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:249\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-QuadratureRule(GeometryType t, int order)\n-Constructor for a given geometry type and a given quadrature order.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:228\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b__\bt_\by_\bp_\be\n-GeometryType geometry_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:248\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be\n-ct CoordType\n-The type used for coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:234\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-QuadratureRule()\n-Default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:221\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bo_\br_\bd_\be_\br\n-virtual int order() const\n-return order\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n-QuadratureRule(GeometryType t)\n-Constructor for a given geometry type. Leaves the quadrature order invalid\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:225\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-std::vector< QuadraturePoint< ct, dim > >::const_iterator iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:245\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Factory class for creation of quadrature rules, depending on GeometryType,\n-order and QuadratureType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:370\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs\n-A container for all quadrature rules of dimension dim\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:260\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\bm_\ba_\bx_\bO_\br_\bd_\be_\br\n-static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum\n-qt=QuadratureType::GaussLegendre)\n-maximum quadrature order for given geometry type and quadrature type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:319\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\br_\bu_\bl_\be\n-static const QuadratureRule & rule(const GeometryType::BasicType t, int p,\n-QuadratureType::Enum qt=QuadratureType::GaussLegendre)\n-select the appropriate QuadratureRule for GeometryType t and order p\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:332\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\br_\bu_\bl_\be\n-static const QuadratureRule & rule(const GeometryType &t, int p,\n-QuadratureType::Enum qt=QuadratureType::GaussLegendre)\n-select the appropriate QuadratureRule for GeometryType t and order p\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:326\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename Container::ReferenceElement ReferenceElement\n+The reference element type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bu_\bb_\be\n+static const ReferenceElement & cube()\n+get hypercube reference elements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:168\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+A geometry implementation for axis-aligned hypercubes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+Volume volume() const\n+Return the element volume.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:295\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const\n+Dune::FieldVector< ctype, coorddim > upper, const std::bitset< coorddim >\n+&axes)\n+Constructor from a lower left and an upper right corner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:142\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const\n+Dune::FieldVector< ctype, coorddim > upper)\n+Constructor from a lower left and an upper right corner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:124\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n+Inverse Jacobian of the transformation from local to global coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:235\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n+&local) const\n+Inverse Jacobian transposed of the transformation from local to global\n+coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n+ctype, dim, coorddim > >::type JacobianTransposed\n+Return type of jacobianTransposed.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower)\n+Constructor from a single point only.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:159\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int mydimension\n+Dimension of the cube element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+friend Dune::ReferenceElements< ctype, dim >::ReferenceElement referenceElement\n+(const AxisAlignedCubeGeometry &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:316\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int coorddimension\n+Dimension of the world space that the cube element is embedded in.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:59\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n+GlobalCoordinate corner(int k) const\n+Return world coordinates of the k-th corner of the element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n+ctype Volume\n+Type used for volume.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, dim > LocalCoordinate\n+Type used for a vector of element coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:65\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n+Jacobian transposed of the transformation from local to global coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:205\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, coorddim > GlobalCoordinate\n+Type used for a vector of world coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+LocalCoordinate local(const GlobalCoordinate &global) const\n+Map a point in global (world) coordinates to element coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:189\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n+CoordType ctype\n+Type used for single coordinate coefficients.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n+ctype, coorddim, dim > > Jacobian\n+Return type of jacobian.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:100\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n+GeometryType type() const\n+Type of the cube. Here: a hypercube of the correct dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:164\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n+int corners() const\n+Return the number of corners of the element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+Jacobian jacobian(const LocalCoordinate &local) const\n+Jacobian of the transformation from local to global coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:229\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n+ctype, coorddim, dim > >::type JacobianInverseTransposed\n+Return type of jacobianInverseTransposed.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:91\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n+Volume integrationElement(const LocalCoordinate &local) const\n+Return the integration element, i.e., the determinant term in the integral\n+transformation formula.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:243\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n+GlobalCoordinate center() const\n+Return center of mass of the element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:249\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+AxisAlignedCubeGeometry()=default\n+Constructs an empty geometry.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+bool affine() const\n+Return if the element is affine. Here: yes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:311\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n+ctype, dim, coorddim > > JacobianInverse\n+Return type of jacobianInverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:109\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+GlobalCoordinate global(const LocalCoordinate &local) const\n+Map a point in local (element) coordinates to world coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:170\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm\n-constexpr bool isPrism() const\n-Return true if entity is a prism.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:309\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bV_\be_\br_\bt_\be_\bx\n-constexpr bool isVertex() const\n-Return true if entity is a vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:279\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n-constexpr unsigned int dim() const\n-Return dimension of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be\n-BasicType\n-Each entity can be tagged by one of these basic types plus its space dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:120\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bL_\bi_\bn_\be\n-constexpr bool isLine() const\n-Return true if entity is a line segment.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:284\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n-constexpr unsigned int id() const\n-Return the topology id of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n-constexpr bool isSimplex() const\n-Return true if entity is a simplex of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00203.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00203.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: axisalignedcubegeometry.hh File Reference\n+dune-geometry: quadraturerules.hh File Reference\n \n \n \n \n \n \n \n@@ -71,43 +71,128 @@\n \n
    \n
    \n
    \n \n-
    axisalignedcubegeometry.hh File Reference
    \n+Namespaces |\n+Macros |\n+Enumerations
    \n+
    quadraturerules.hh File Reference
    \n \n
    \n-\n-

    A geometry implementation for axis-aligned hypercubes. \n-More...

    \n-
    #include <bitset>
    \n+
    #include <algorithm>
    \n+#include <iostream>
    \n+#include <limits>
    \n+#include <mutex>
    \n+#include <utility>
    \n+#include <vector>
    \n #include <dune/common/fvector.hh>
    \n-#include <dune/common/fmatrix.hh>
    \n-#include <dune/common/diagonalmatrix.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n+#include <dune/common/exceptions.hh>
    \n+#include <dune/common/stdstreams.hh>
    \n+#include <dune/common/stdthread.hh>
    \n+#include <dune/common/visibility.hh>
    \n+#include <dune/geometry/type.hh>
    \n+#include <dune/geometry/typeindex.hh>
    \n+#include "quadraturerules/pointquadrature.hh"
    \n+#include "quadraturerules/gausslobattoquadrature.hh"
    \n+#include "quadraturerules/gaussquadrature.hh"
    \n+#include "quadraturerules/gaussradauleftquadrature.hh"
    \n+#include "quadraturerules/gaussradaurightquadrature.hh"
    \n+#include "quadraturerules/jacobi1quadrature.hh"
    \n+#include "quadraturerules/jacobi2quadrature.hh"
    \n+#include "quadraturerules/jacobiNquadrature.hh"
    \n+#include "quadraturerules/prismquadrature.hh"
    \n+#include "quadraturerules/simplexquadrature.hh"
    \n+#include "quadraturerules/tensorproductquadrature.hh"
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Dune::AxisAlignedCubeGeometry< CoordType, dim, coorddim >
     A geometry implementation for axis-aligned hypercubes. More...
    struct  std::tuple_size< Dune::QuadraturePoint< ct, dim > >
     
    struct  std::tuple_element< 0, Dune::QuadraturePoint< ct, dim > >
     
    struct  std::tuple_element< 1, Dune::QuadraturePoint< ct, dim > >
     
    class  Dune::QuadratureOrderOutOfRange
     Exception thrown if a desired QuadratureRule is not available, because the requested order is to high. More...
     
    class  Dune::QuadraturePoint< ct, dim >
     Single evaluation point in a quadrature rule. More...
     
    class  Dune::QuadratureRule< ct, dim >
     Abstract base class for quadrature rules. More...
     
    class  Dune::QuadratureRules< ctype, dim >
     A container for all quadrature rules of dimension dim More...
     
    class  Dune::QuadratureRuleFactory< ctype, dim >
     Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType. More...
     
    class  Dune::QuadratureRuleFactory< ctype, 0 >
     
    class  Dune::QuadratureRuleFactory< ctype, 1 >
     
    class  Dune::QuadratureRuleFactory< ctype, 2 >
     
    class  Dune::QuadratureRuleFactory< ctype, 3 >
     
    \n \n \n \n+\n+\n+\n+\n+\n+\n+

    \n Namespaces

    namespace  Dune
     
    namespace  std
     STL namespace.
     
    namespace  Dune::QuadratureType
     Defines an enum for currently available quadrature rules.
     
    \n+\n+\n+\n+

    \n+Macros

    #define DUNE_INCLUDING_IMPLEMENTATION
     
    \n+\n+\n+\n

    \n+Enumerations

    enum  Dune::QuadratureType::Enum {
    \n+  Dune::QuadratureType::GaussLegendre = 0\n+, Dune::QuadratureType::GaussJacobi_1_0 = 1\n+, Dune::QuadratureType::GaussJacobi_2_0 = 2\n+, Dune::QuadratureType::GaussJacobi_n_0 = 3\n+,
    \n+  Dune::QuadratureType::GaussLobatto = 4\n+, Dune::QuadratureType::GaussRadauLeft = 5\n+, Dune::QuadratureType::GaussRadauRight = 6\n+, Dune::QuadratureType::size\n+
    \n+ }
     
    \n

    Detailed Description

    \n-

    A geometry implementation for axis-aligned hypercubes.

    \n-
    \n+

    Interface for quadrature points and rules

    \n+

    Macro Definition Documentation

    \n+\n+

    ◆ DUNE_INCLUDING_IMPLEMENTATION

    \n+\n+
    \n+
    \n+ \n+ \n+ \n+ \n+
    #define DUNE_INCLUDING_IMPLEMENTATION
    \n+
    \n+\n+
    \n+
    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,94 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-axisalignedcubegeometry.hh File Reference\n-A geometry implementation for axis-aligned hypercubes. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bE_\bn_\bu_\bm_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs\n+quadraturerules.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+#include \n+#include \n+#include \n+#include \n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n+#include \"quadraturerules/pointquadrature.hh\"\n+#include \"quadraturerules/gausslobattoquadrature.hh\"\n+#include \"quadraturerules/gaussquadrature.hh\"\n+#include \"quadraturerules/gaussradauleftquadrature.hh\"\n+#include \"quadraturerules/gaussradaurightquadrature.hh\"\n+#include \"quadraturerules/jacobi1quadrature.hh\"\n+#include \"quadraturerules/jacobi2quadrature.hh\"\n+#include \"quadraturerules/jacobiNquadrature.hh\"\n+#include \"quadraturerules/prismquadrature.hh\"\n+#include \"quadraturerules/simplexquadrature.hh\"\n+#include \"quadraturerules/tensorproductquadrature.hh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b,_\b _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\b _\b>\n-\u00a0 A geometry implementation for axis-aligned hypercubes. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\bs_\bi_\bz_\be_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b0_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b1_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be\n+\u00a0 Exception thrown if a desired _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be is not available, because\n+ the requested order is to high. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 Single evaluation point in a quadrature rule. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 Abstract base class for quadrature rules. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 A container for all quadrature rules of dimension dim _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 Factory class for creation of quadrature rules, depending on\n+ _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, order and _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b1_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b2_\b _\b>\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\b3_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bs_\bt_\bd\n+\u00a0 STL namespace.\n+\u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be\n+\u00a0 Defines an enum for currently available quadrature rules.\n+\u00a0\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bI_\bN_\bC_\bL_\bU_\bD_\bI_\bN_\bG_\b__\bI_\bM_\bP_\bL_\bE_\bM_\bE_\bN_\bT_\bA_\bT_\bI_\bO_\bN\n+\u00a0\n+E\bEn\bnu\bum\bme\ber\bra\bat\bti\bio\bon\bns\bs\n+enum \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm {\n+ \u00a0\u00a0_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be = 0 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n+ _\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 = 1 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 = 2 , _\bD_\bu_\bn_\be_\b:_\b:\n+ _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 = 3 ,\n+ \u00a0\u00a0_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo = 4 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n+ _\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt = 5 , _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt = 6 , _\bD_\bu_\bn_\be_\b:_\b:\n+ _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bz_\be\n+ }\n+\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-A geometry implementation for axis-aligned hypercubes.\n+Interface for quadrature points and rules\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_I\bIN\bNC\bCL\bLU\bUD\bDI\bIN\bNG\bG_\b_I\bIM\bMP\bPL\bLE\bEM\bME\bEN\bNT\bTA\bAT\bTI\bIO\bON\bN *\b**\b**\b**\b**\b*\n+#define DUNE_INCLUDING_IMPLEMENTATION\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00203_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00203_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: axisalignedcubegeometry.hh Source File\n+dune-geometry: quadraturerules.hh Source File\n \n \n \n \n \n \n \n@@ -74,360 +74,502 @@\n \n
    \n \n
    \n \n
    \n-
    axisalignedcubegeometry.hh
    \n+
    quadraturerules.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n
    5
    \n-
    6#ifndef DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH
    \n-
    7#define DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH
    \n+
    6#ifndef DUNE_GEOMETRY_QUADRATURERULES_HH
    \n+
    7#define DUNE_GEOMETRY_QUADRATURERULES_HH
    \n
    8
    \n-
    13#include <bitset>
    \n-
    14
    \n-
    15#include <dune/common/fvector.hh>
    \n-
    16#include <dune/common/fmatrix.hh>
    \n-
    17#include <dune/common/diagonalmatrix.hh>
    \n-
    18
    \n-\n-
    20#include <dune/geometry/type.hh>
    \n+
    9#include <algorithm>
    \n+
    10#include <iostream>
    \n+
    11#include <limits>
    \n+
    12#include <mutex>
    \n+
    13#include <utility>
    \n+
    14#include <vector>
    \n+
    15
    \n+
    16#include <dune/common/fvector.hh>
    \n+
    17#include <dune/common/exceptions.hh>
    \n+
    18#include <dune/common/stdstreams.hh>
    \n+
    19#include <dune/common/stdthread.hh>
    \n+
    20#include <dune/common/visibility.hh>
    \n
    21
    \n-
    22
    \n-
    23namespace Dune {
    \n+
    22#include <dune/geometry/type.hh>
    \n+\n
    24
    \n-
    48 template <class CoordType, unsigned int dim, unsigned int coorddim>
    \n-
    \n-\n-
    50 {
    \n-
    51
    \n-
    52
    \n-
    53 public:
    \n-
    54
    \n-
    56 constexpr static int mydimension = dim;
    \n-
    57
    \n-
    59 constexpr static int coorddimension = coorddim;
    \n-
    60
    \n-
    62 typedef CoordType ctype;
    \n-
    63
    \n-
    65 typedef FieldVector<ctype,dim> LocalCoordinate;
    \n-
    66
    \n-
    68 typedef FieldVector<ctype,coorddim> GlobalCoordinate;
    \n-
    69
    \n-
    71 typedef ctype Volume;
    \n-
    72
    \n-
    79 typedef typename std::conditional<dim==coorddim,
    \n-
    80 DiagonalMatrix<ctype,dim>,
    \n-
    81 FieldMatrix<ctype,dim,coorddim> >::type JacobianTransposed;
    \n-
    82
    \n-
    89 typedef typename std::conditional<dim==coorddim,
    \n-
    90 DiagonalMatrix<ctype,dim>,
    \n-
    91 FieldMatrix<ctype,coorddim,dim> >::type JacobianInverseTransposed;
    \n-
    92
    \n-
    100 using Jacobian = std::conditional_t<dim==coorddim, DiagonalMatrix<ctype,dim>, FieldMatrix<ctype,coorddim,dim> >;
    \n-
    101
    \n-
    109 using JacobianInverse = std::conditional_t<dim==coorddim, DiagonalMatrix<ctype,dim>, FieldMatrix<ctype,dim,coorddim> >;
    \n-
    110
    \n-\n-
    119
    \n-
    \n-
    124 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower,
    \n-
    125 const Dune::FieldVector<ctype,coorddim> upper)
    \n-
    126 : lower_(lower),
    \n-
    127 upper_(upper),
    \n-
    128 axes_()
    \n-
    129 {
    \n-
    130 static_assert(dim==coorddim, "Use this constructor only if dim==coorddim!");
    \n-
    131 // all 'true', but is never actually used
    \n-
    132 axes_ = (1<<coorddim)-1;
    \n-
    133 }
    \n-
    \n-
    134
    \n-
    \n-
    142 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower,
    \n-
    143 const Dune::FieldVector<ctype,coorddim> upper,
    \n-
    144 const std::bitset<coorddim>& axes)
    \n-
    145 : lower_(lower),
    \n-
    146 upper_(upper),
    \n-
    147 axes_(axes)
    \n-
    148 {
    \n-
    149 assert(axes.count()==dim);
    \n-
    150 for (size_t i=0; i<coorddim; i++)
    \n-
    151 if (not axes_[i])
    \n-
    152 upper_[i] = lower_[i];
    \n-
    153 }
    \n-
    \n-
    154
    \n-
    \n-
    159 AxisAlignedCubeGeometry(const Dune::FieldVector<ctype,coorddim> lower)
    \n-
    160 : lower_(lower)
    \n-
    161 {}
    \n-
    \n-
    162
    \n-
    \n-\n-
    165 {
    \n-
    166 return GeometryTypes::cube(dim);
    \n-
    167 }
    \n-
    \n-
    168
    \n-
    \n-\n-
    171 {
    \n-
    172 GlobalCoordinate result;
    \n-
    173 if (dim == coorddim) { // fast case
    \n-
    174 for (size_t i=0; i<coorddim; i++)
    \n-
    175 result[i] = lower_[i] + local[i]*(upper_[i] - lower_[i]);
    \n-
    176 } else if (dim == 0) { // a vertex -- the other fast case
    \n-
    177 result = lower_; // hope for named-return-type-optimization
    \n-
    178 } else { // slow case
    \n-
    179 size_t lc=0;
    \n-
    180 for (size_t i=0; i<coorddim; i++)
    \n-
    181 result[i] = (axes_[i])
    \n-
    182 ? lower_[i] + local[lc++]*(upper_[i] - lower_[i])
    \n-
    183 : lower_[i];
    \n-
    184 }
    \n-
    185 return result;
    \n-
    186 }
    \n-
    \n-
    187
    \n-
    \n-\n-
    190 {
    \n-
    191 LocalCoordinate result;
    \n-
    192 if (dim == coorddim) { // fast case
    \n-
    193 for (size_t i=0; i<dim; i++)
    \n-
    194 result[i] = (global[i] - lower_[i]) / (upper_[i] - lower_[i]);
    \n-
    195 } else if (dim != 0) { // slow case
    \n-
    196 size_t lc=0;
    \n-
    197 for (size_t i=0; i<coorddim; i++)
    \n-
    198 if (axes_[i])
    \n-
    199 result[lc++] = (global[i] - lower_[i]) / (upper_[i] - lower_[i]);
    \n-
    200 }
    \n-
    201 return result;
    \n-
    202 }
    \n-
    \n-
    203
    \n-
    \n-\n-
    206 {
    \n-
    207 JacobianTransposed result;
    \n-
    208
    \n-
    209 // Actually compute the result. Uses different methods depending
    \n-
    210 // on what kind of matrix JacobianTransposed is.
    \n-
    211 jacobianTransposed(result);
    \n-
    212
    \n-
    213 return result;
    \n-
    214 }
    \n-
    \n-
    215
    \n-
    \n-\n-
    218 {
    \n-\n-
    220
    \n-
    221 // Actually compute the result. Uses different methods depending
    \n-
    222 // on what kind of matrix JacobianTransposed is.
    \n-\n-
    224
    \n-
    225 return result;
    \n-
    226 }
    \n-
    \n-
    227
    \n-
    \n-
    229 Jacobian jacobian([[maybe_unused]] const LocalCoordinate& local) const
    \n-
    230 {
    \n-
    231 return jacobianTransposed(local).transposed();
    \n-
    232 }
    \n-
    \n-
    233
    \n-
    \n-\n-
    236 {
    \n-
    237 return jacobianInverseTransposed(local).transposed();
    \n-
    238 }
    \n-
    \n-
    239
    \n-
    \n-
    243 Volume integrationElement([[maybe_unused]] const LocalCoordinate& local) const
    \n-
    244 {
    \n-
    245 return volume();
    \n-
    246 }
    \n-
    \n-
    247
    \n-
    \n-\n-
    250 {
    \n-
    251 GlobalCoordinate result;
    \n-
    252 if (dim==0)
    \n-
    253 result = lower_;
    \n-
    254 else {
    \n-
    255 // Since lower_==upper_ for unused coordinates, this always does the right thing
    \n-
    256 for (size_t i=0; i<coorddim; i++)
    \n-
    257 result[i] = CoordType(0.5) * (lower_[i] + upper_[i]);
    \n-
    258 }
    \n-
    259 return result;
    \n-
    260 }
    \n+
    31namespace Dune {
    \n+
    32 // forward declaration
    \n+
    33 template<typename ct, int dim>
    \n+
    34 class QuadraturePoint;
    \n+
    35}
    \n+
    36
    \n+
    37// class specialization of standard classes that allow to use structured bindings on QuadraturePoint
    \n+
    38namespace std {
    \n+
    39 template<typename ct, int dim>
    \n+
    40 struct tuple_size<Dune::QuadraturePoint<ct,dim>> : public std::integral_constant<std::size_t,2> {};
    \n+
    41
    \n+
    42 template<typename ct, int dim>
    \n+
    43 struct tuple_element<0, Dune::QuadraturePoint<ct,dim>> { using type = Dune::FieldVector<ct, dim>; };
    \n+
    44
    \n+
    45 template<typename ct, int dim>
    \n+
    46 struct tuple_element<1, Dune::QuadraturePoint<ct,dim>> { using type = ct; };
    \n+
    47}
    \n+
    48
    \n+
    49namespace Dune {
    \n+
    50
    \n+
    55 class QuadratureOrderOutOfRange : public NotImplemented {};
    \n+
    56
    \n+
    65 template<typename ct, int dim>
    \n+
    \n+\n+
    67 public:
    \n+
    69 constexpr static int dimension = dim;
    \n+
    70
    \n+
    72 typedef ct Field;
    \n+
    73
    \n+
    75 typedef Dune::FieldVector<ct,dim> Vector;
    \n+
    76
    \n+
    \n+
    78 QuadraturePoint (const Vector& x, ct w) : local(x), weight_(w)
    \n+
    79 {}
    \n+
    \n+
    80
    \n+
    \n+
    82 const Vector& position () const
    \n+
    83 {
    \n+
    84 return local;
    \n+
    85 }
    \n+
    \n+
    86
    \n+
    \n+
    88 const ct &weight () const
    \n+
    89 {
    \n+
    90 return weight_;
    \n+
    91 }
    \n
    \n+
    92
    \n+
    111 template<std::size_t index, std::enable_if_t<(index<=1), int> = 0>
    \n+
    \n+
    112 std::tuple_element_t<index, QuadraturePoint<ct, dim>> get() const
    \n+
    113 {
    \n+
    114 if constexpr (index == 0) {
    \n+
    115 return local;
    \n+
    116 }
    \n+
    117 else {
    \n+
    118 return weight_;
    \n+
    119 }
    \n+
    120 }
    \n+
    \n+
    121
    \n+
    122 protected:
    \n+
    123 FieldVector<ct, dim> local;
    \n+
    124 ct weight_;
    \n+
    125 };
    \n+
    \n+
    126
    \n+
    \n+
    130 namespace QuadratureType {
    \n+
    \n+
    131 enum Enum {
    \n+
    141 GaussLegendre = 0,
    \n+
    142
    \n+
    148 GaussJacobi_1_0 = 1,
    \n+
    149
    \n+
    155 GaussJacobi_2_0 = 2,
    \n+
    156
    \n+
    168 GaussJacobi_n_0 = 3,
    \n+
    169
    \n+
    176 GaussLobatto = 4,
    \n+
    177
    \n+
    184 GaussRadauLeft = 5,
    \n+
    185
    \n+
    193 GaussRadauRight = 6,
    \n+
    194 size
    \n+
    195 };
    \n+
    \n+
    196 }
    \n+
    \n+
    197
    \n+
    212 template<typename ct, int dim>
    \n+
    \n+
    213 class QuadratureRule : public std::vector<QuadraturePoint<ct,dim> >
    \n+
    214 {
    \n+
    215 public:
    \n+
    221 QuadratureRule() : delivered_order(-1) {}
    \n+
    222
    \n+
    223 protected:
    \n+
    225 QuadratureRule(GeometryType t) : geometry_type(t), delivered_order(-1) {}
    \n+
    226
    \n+
    228 QuadratureRule(GeometryType t, int order) : geometry_type(t), delivered_order(order) {}
    \n+
    229 public:
    \n+
    231 constexpr static int d = dim;
    \n+
    232
    \n+
    234 typedef ct CoordType;
    \n+
    235
    \n+
    237 virtual int order () const { return delivered_order; }
    \n+
    238
    \n+
    240 virtual GeometryType type () const { return geometry_type; }
    \n+
    241 virtual ~QuadratureRule(){}
    \n+
    242
    \n+
    245 typedef typename std::vector<QuadraturePoint<ct,dim> >::const_iterator iterator;
    \n+
    246
    \n+
    247 protected:
    \n+\n+\n+
    250 };
    \n+
    \n+
    251
    \n+
    252 // Forward declaration of the factory class,
    \n+
    253 // needed internally by the QuadratureRules container class.
    \n+
    254 template<typename ctype, int dim> class QuadratureRuleFactory;
    \n+
    255
    \n+
    259 template<typename ctype, int dim>
    \n+
    \n+\n
    261
    \n-
    \n-
    263 int corners() const
    \n-
    264 {
    \n-
    265 return 1<<dim;
    \n-
    266 }
    \n-
    \n+\n+
    264
    \n+
    265 // indexed by quadrature order
    \n+
    266 using QuadratureOrderVector = std::vector<std::pair<std::once_flag, QuadratureRule> >;
    \n
    267
    \n-
    \n-\n-
    270 {
    \n-
    271 GlobalCoordinate result;
    \n-
    272 if (dim == coorddim) { // fast case
    \n-
    273 for (size_t i=0; i<coorddim; i++)
    \n-
    274 result[i] = (k & (1<<i)) ? upper_[i] : lower_[i];
    \n-
    275 } else if (dim == 0) { // vertex
    \n-
    276 result = lower_; // rely on named return-type optimization
    \n-
    277 } else { // slow case
    \n-
    278 unsigned int mask = 1;
    \n-
    279
    \n-
    280 for (size_t i=0; i<coorddim; i++) {
    \n-
    281 if (not axes_[i])
    \n-
    282 result[i] = lower_[i];
    \n-
    283 else {
    \n-
    284 result[i] = (k & mask) ? upper_[i] : lower_[i];
    \n-
    285 mask = (mask<<1);
    \n-
    286 }
    \n-
    287 }
    \n-
    288 }
    \n-
    289
    \n-
    290
    \n-
    291 return result;
    \n-
    292 }
    \n-
    \n-
    293
    \n-
    \n-\n-
    296 {
    \n-
    297 ctype vol = 1;
    \n-
    298 if (dim == coorddim) { // fast case
    \n-
    299 for (size_t i=0; i<dim; i++)
    \n-
    300 vol *= upper_[i] - lower_[i];
    \n-
    301 // do nothing if dim == 0
    \n-
    302 } else if (dim != 0) { // slow case
    \n-
    303 for (size_t i=0; i<coorddim; i++)
    \n-
    304 if (axes_[i])
    \n-
    305 vol *= upper_[i] - lower_[i];
    \n-
    306 }
    \n-
    307 return vol;
    \n-
    308 }
    \n-
    \n-
    309
    \n-
    \n-
    311 bool affine() const
    \n-
    312 {
    \n-
    313 return true;
    \n-
    314 }
    \n-
    \n-
    315
    \n-\n-
    320
    \n-
    321 private:
    \n-
    322 // jacobianTransposed: fast case --> diagonal matrix
    \n-
    323 void jacobianTransposed ( DiagonalMatrix<ctype,dim> &jacobianTransposed ) const
    \n-
    324 {
    \n-
    325 for (size_t i=0; i<dim; i++)
    \n-
    326 jacobianTransposed.diagonal()[i] = upper_[i] - lower_[i];
    \n-
    327 }
    \n-
    328
    \n-
    329 // jacobianTransposed: slow case --> dense matrix
    \n-
    330 void jacobianTransposed ( FieldMatrix<ctype,dim,coorddim> &jacobianTransposed ) const
    \n-
    331 {
    \n-
    332 if (dim==0)
    \n-
    333 return;
    \n-
    334
    \n-
    335 size_t lc = 0;
    \n-
    336 for (size_t i=0; i<coorddim; i++)
    \n-
    337 if (axes_[i])
    \n-
    338 jacobianTransposed[lc++][i] = upper_[i] - lower_[i];
    \n-
    339 }
    \n+
    268 // indexed by geometry type
    \n+
    269 using GeometryTypeVector = std::vector<std::pair<std::once_flag, QuadratureOrderVector> >;
    \n+
    270
    \n+
    271 // indexed by quadrature type enum
    \n+
    272 using QuadratureCacheVector = std::vector<std::pair<std::once_flag, GeometryTypeVector> >;
    \n+
    273
    \n+
    275 DUNE_EXPORT const QuadratureRule& _rule(const GeometryType& t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre) const
    \n+
    276 {
    \n+
    277 assert(t.dim()==dim);
    \n+
    278
    \n+
    279 DUNE_ASSERT_CALL_ONCE();
    \n+
    280
    \n+
    281 static QuadratureCacheVector quadratureCache(QuadratureType::size);
    \n+
    282
    \n+
    283 auto& [ onceFlagQuadratureType, geometryTypes ] = quadratureCache[qt];
    \n+
    284 // initialize geometry types for this quadrature type once
    \n+
    285 std::call_once(onceFlagQuadratureType, [&types = geometryTypes]{
    \n+
    286 types = GeometryTypeVector(LocalGeometryTypeIndex::size(dim));
    \n+
    287 });
    \n+
    288
    \n+
    289 auto& [ onceFlagGeometryType, quadratureOrders ] = geometryTypes[LocalGeometryTypeIndex::index(t)];
    \n+
    290 // initialize quadrature orders for this geometry type and quadrature type once
    \n+
    291 std::call_once(onceFlagGeometryType, [&, &orders = quadratureOrders]{
    \n+
    292 // we only need one quadrature rule for points, not maxint
    \n+
    293 const auto numRules = dim == 0 ? 1 : QuadratureRuleFactory<ctype,dim>::maxOrder(t, qt)+1;
    \n+
    294 orders = QuadratureOrderVector(numRules);
    \n+
    295 });
    \n+
    296
    \n+
    297 // we only have one quadrature rule for points
    \n+
    298 auto& [ onceFlagQuadratureOrder, quadratureRule ] = quadratureOrders[dim == 0 ? 0 : p];
    \n+
    299 // initialize quadrature rule once
    \n+
    300 std::call_once(onceFlagQuadratureOrder, [&, &rule = quadratureRule]{
    \n+\n+
    302 });
    \n+
    303
    \n+
    304 return quadratureRule;
    \n+
    305 }
    \n+
    306
    \n+
    308 DUNE_EXPORT static QuadratureRules& instance()
    \n+
    309 {
    \n+
    310 static QuadratureRules instance;
    \n+
    311 return instance;
    \n+
    312 }
    \n+
    313
    \n+
    315 QuadratureRules () = default;
    \n+
    316 public:
    \n+
    318 static unsigned
    \n+
    \n+\n+
    320 QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n+
    321 {
    \n+\n+
    323 }
    \n+
    \n+
    324
    \n+
    \n+
    326 static const QuadratureRule& rule(const GeometryType& t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n+
    327 {
    \n+
    328 return instance()._rule(t,p,qt);
    \n+
    329 }
    \n+
    \n+
    330
    \n+
    \n+
    332 static const QuadratureRule& rule(const GeometryType::BasicType t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    \n+
    333 {
    \n+
    334 GeometryType gt(t,dim);
    \n+
    335 return instance()._rule(gt,p,qt);
    \n+
    336 }
    \n+
    \n+
    337 };
    \n+
    \n+
    338
    \n+
    339} // end namespace Dune
    \n
    340
    \n-
    341 // jacobianInverseTransposed: fast case --> diagonal matrix
    \n-
    342 void jacobianInverseTransposed ( DiagonalMatrix<ctype,dim> &jacobianInverseTransposed ) const
    \n-
    343 {
    \n-
    344 for (size_t i=0; i<dim; i++)
    \n-
    345 jacobianInverseTransposed.diagonal()[i] = CoordType(1.0) / (upper_[i] - lower_[i]);
    \n-
    346 }
    \n-
    347
    \n-
    348 // jacobianInverseTransposed: slow case --> dense matrix
    \n-
    349 void jacobianInverseTransposed ( FieldMatrix<ctype,coorddim,dim> &jacobianInverseTransposed ) const
    \n-
    350 {
    \n-
    351 if (dim==0)
    \n-
    352 return;
    \n-
    353
    \n-
    354 size_t lc = 0;
    \n-
    355 for (size_t i=0; i<coorddim; i++)
    \n-
    356 if (axes_[i])
    \n-
    357 jacobianInverseTransposed[i][lc++] = CoordType(1.0) / (upper_[i] - lower_[i]);
    \n-
    358 }
    \n-
    359
    \n-
    360 Dune::FieldVector<ctype,coorddim> lower_;
    \n-
    361
    \n-
    362 Dune::FieldVector<ctype,coorddim> upper_;
    \n-
    363
    \n-
    364 std::bitset<coorddim> axes_;
    \n-
    365 };
    \n-
    \n-
    366
    \n-
    367} // namespace Dune
    \n-
    368#endif
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n+
    341#define DUNE_INCLUDING_IMPLEMENTATION
    \n+
    342
    \n+
    343// 0d rules
    \n+
    344#include "quadraturerules/pointquadrature.hh"
    \n+
    345// 1d rules
    \n+
    346#include "quadraturerules/gausslobattoquadrature.hh"
    \n+
    347#include "quadraturerules/gaussquadrature.hh"
    \n+
    348#include "quadraturerules/gaussradauleftquadrature.hh"
    \n+
    349#include "quadraturerules/gaussradaurightquadrature.hh"
    \n+
    350#include "quadraturerules/jacobi1quadrature.hh"
    \n+
    351#include "quadraturerules/jacobi2quadrature.hh"
    \n+
    352#include "quadraturerules/jacobiNquadrature.hh"
    \n+
    353// 3d rules
    \n+
    354#include "quadraturerules/prismquadrature.hh"
    \n+
    355// general rules
    \n+
    356#include "quadraturerules/simplexquadrature.hh"
    \n+
    357#include "quadraturerules/tensorproductquadrature.hh"
    \n+
    358
    \n+
    359#undef DUNE_INCLUDING_IMPLEMENTATION
    \n+
    360
    \n+
    361namespace Dune {
    \n+
    362
    \n+
    369 template<typename ctype, int dim>
    \n+
    \n+\n+
    371 private:
    \n+
    372 friend class QuadratureRules<ctype, dim>;
    \n+
    373 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n+
    374 {
    \n+
    375 return TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n+
    376 }
    \n+
    377 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n+
    378 {
    \n+
    379 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n+
    380 }
    \n+
    381 };
    \n+
    \n+
    382
    \n+
    383 template<typename ctype>
    \n+
    \n+
    384 class QuadratureRuleFactory<ctype, 0> {
    \n+
    385 private:
    \n+
    386 constexpr static int dim = 0;
    \n+
    387 friend class QuadratureRules<ctype, dim>;
    \n+
    388 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum)
    \n+
    389 {
    \n+
    390 if (t.isVertex())
    \n+
    391 {
    \n+
    392 return std::numeric_limits<int>::max();
    \n+
    393 }
    \n+
    394 DUNE_THROW(Exception, "Unknown GeometryType");
    \n+
    395 }
    \n+
    396 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int , QuadratureType::Enum)
    \n+
    397 {
    \n+
    398 if (t.isVertex())
    \n+
    399 {
    \n+
    400 return PointQuadratureRule<ctype>();
    \n+
    401 }
    \n+
    402 DUNE_THROW(Exception, "Unknown GeometryType");
    \n+
    403 }
    \n+
    404 };
    \n+
    \n+
    405
    \n+
    406 template<typename ctype>
    \n+
    \n+
    407 class QuadratureRuleFactory<ctype, 1> {
    \n+
    408 private:
    \n+
    409 constexpr static int dim = 1;
    \n+
    410 friend class QuadratureRules<ctype, dim>;
    \n+
    411 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n+
    412 {
    \n+
    413 if (t.isLine())
    \n+
    414 {
    \n+
    415 switch (qt) {
    \n+\n+
    417 return GaussQuadratureRule1D<ctype>::highest_order;
    \n+\n+
    419 return Jacobi1QuadratureRule1D<ctype>::highest_order;
    \n+\n+
    421 return Jacobi2QuadratureRule1D<ctype>::highest_order;
    \n+\n+
    423 return GaussLobattoQuadratureRule1D<ctype>::highest_order;
    \n+\n+
    425 return JacobiNQuadratureRule1D<ctype>::maxOrder();
    \n+\n+
    427 return GaussRadauLeftQuadratureRule1D<ctype>::highest_order;
    \n+\n+
    429 return GaussRadauRightQuadratureRule1D<ctype>::highest_order;
    \n+
    430 default :
    \n+
    431 DUNE_THROW(Exception, "Unknown QuadratureType");
    \n+
    432 }
    \n+
    433 }
    \n+
    434 DUNE_THROW(Exception, "Unknown GeometryType");
    \n+
    435 }
    \n+
    436 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n+
    437 {
    \n+
    438 if (t.isLine())
    \n+
    439 {
    \n+
    440 switch (qt) {
    \n+\n+
    442 return GaussQuadratureRule1D<ctype>(p);
    \n+\n+
    444 return Jacobi1QuadratureRule1D<ctype>(p);
    \n+\n+
    446 return Jacobi2QuadratureRule1D<ctype>(p);
    \n+\n+
    448 return GaussLobattoQuadratureRule1D<ctype>(p);
    \n+\n+
    450 return JacobiNQuadratureRule1D<ctype>(p);
    \n+\n+
    452 return GaussRadauLeftQuadratureRule1D<ctype>(p);
    \n+\n+
    454 return GaussRadauRightQuadratureRule1D<ctype>(p);
    \n+
    455 default :
    \n+
    456 DUNE_THROW(Exception, "Unknown QuadratureType");
    \n+
    457 }
    \n+
    458 }
    \n+
    459 DUNE_THROW(Exception, "Unknown GeometryType");
    \n+
    460 }
    \n+
    461 };
    \n+
    \n+
    462
    \n+
    463 template<typename ctype>
    \n+
    \n+
    464 class QuadratureRuleFactory<ctype, 2> {
    \n+
    465 private:
    \n+
    466 constexpr static int dim = 2;
    \n+
    467 friend class QuadratureRules<ctype, dim>;
    \n+
    468 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n+
    469 {
    \n+
    470 unsigned order =
    \n+
    471 TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n+
    472 if (t.isSimplex())
    \n+
    473 order = std::max
    \n+
    474 (order, static_cast<unsigned>(SimplexQuadratureRule<ctype,dim>::highest_order));
    \n+
    475 return order;
    \n+
    476 }
    \n+
    477 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n+
    478 {
    \n+
    479 if (t.isSimplex()
    \n+\n+
    481 && p <= SimplexQuadratureRule<ctype,dim>::highest_order)
    \n+
    482 {
    \n+
    483 return SimplexQuadratureRule<ctype,dim>(p);
    \n+
    484 }
    \n+
    485 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n+
    486 }
    \n+
    487 };
    \n+
    \n+
    488
    \n+
    489 template<typename ctype>
    \n+
    \n+
    490 class QuadratureRuleFactory<ctype, 3> {
    \n+
    491 private:
    \n+
    492 constexpr static int dim = 3;
    \n+
    493 friend class QuadratureRules<ctype, dim>;
    \n+
    494 static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt)
    \n+
    495 {
    \n+
    496 unsigned order =
    \n+
    497 TensorProductQuadratureRule<ctype,dim>::maxOrder(t.id(), qt);
    \n+
    498 if (t.isSimplex())
    \n+
    499 order = std::max
    \n+
    500 (order, static_cast<unsigned>(SimplexQuadratureRule<ctype,dim>::highest_order));
    \n+
    501 if (t.isPrism())
    \n+
    502 order = std::max
    \n+
    503 (order, static_cast<unsigned>(PrismQuadratureRule<ctype,dim>::highest_order));
    \n+
    504 return order;
    \n+
    505 }
    \n+
    506 static QuadratureRule<ctype, dim> rule(const GeometryType& t, int p, QuadratureType::Enum qt)
    \n+
    507 {
    \n+
    508
    \n+
    509 if (t.isSimplex()
    \n+\n+
    511 && p <= SimplexQuadratureRule<ctype,dim>::highest_order)
    \n+
    512 {
    \n+
    513 return SimplexQuadratureRule<ctype,dim>(p);
    \n+
    514 }
    \n+
    515 if (t.isPrism()
    \n+\n+
    517 && p <= PrismQuadratureRule<ctype,dim>::highest_order)
    \n+
    518 {
    \n+
    519 return PrismQuadratureRule<ctype,dim>(p);
    \n+
    520 }
    \n+
    521 return TensorProductQuadratureRule<ctype,dim>(t.id(), p, qt);
    \n+
    522 }
    \n+
    523 };
    \n+
    \n+
    524
    \n+
    525#ifndef DUNE_NO_EXTERN_QUADRATURERULES
    \n+
    526 extern template class GaussLobattoQuadratureRule<double, 1>;
    \n+
    527 extern template class GaussQuadratureRule<double, 1>;
    \n+
    528 extern template class GaussRadauLeftQuadratureRule<double, 1>;
    \n+
    529 extern template class GaussRadauRightQuadratureRule<double, 1>;
    \n+
    530 extern template class Jacobi1QuadratureRule<double, 1>;
    \n+
    531 extern template class Jacobi2QuadratureRule<double, 1>;
    \n+
    532 extern template class JacobiNQuadratureRule<double, 1>;
    \n+
    533 extern template class PrismQuadratureRule<double, 3>;
    \n+
    534 extern template class SimplexQuadratureRule<double, 2>;
    \n+
    535 extern template class SimplexQuadratureRule<double, 3>;
    \n+
    536#endif // !DUNE_NO_EXTERN_QUADRATURERULES
    \n+
    537
    \n+
    538} // end namespace
    \n+
    539
    \n+
    540#endif // DUNE_GEOMETRY_QUADRATURERULES_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n+
    Helper classes to provide indices for geometrytypes for use in a vector.
    \n+
    STL namespace.
    \n
    Definition affinegeometry.hh:21
    \n-
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n-
    static const ReferenceElement & cube()
    get hypercube reference elements
    Definition referenceelements.hh:168
    \n-
    A geometry implementation for axis-aligned hypercubes.
    Definition axisalignedcubegeometry.hh:50
    \n-
    Volume volume() const
    Return the element volume.
    Definition axisalignedcubegeometry.hh:295
    \n-
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const Dune::FieldVector< ctype, coorddim > upper, const std::bitset< coorddim > &axes)
    Constructor from a lower left and an upper right corner.
    Definition axisalignedcubegeometry.hh:142
    \n-
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const Dune::FieldVector< ctype, coorddim > upper)
    Constructor from a lower left and an upper right corner.
    Definition axisalignedcubegeometry.hh:124
    \n-
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Inverse Jacobian of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:235
    \n-
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    Inverse Jacobian transposed of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:217
    \n-
    std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, dim, coorddim > >::type JacobianTransposed
    Return type of jacobianTransposed.
    Definition axisalignedcubegeometry.hh:81
    \n-
    AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower)
    Constructor from a single point only.
    Definition axisalignedcubegeometry.hh:159
    \n-
    static constexpr int mydimension
    Dimension of the cube element.
    Definition axisalignedcubegeometry.hh:56
    \n-
    friend Dune::ReferenceElements< ctype, dim >::ReferenceElement referenceElement(const AxisAlignedCubeGeometry &)
    Definition axisalignedcubegeometry.hh:316
    \n-
    static constexpr int coorddimension
    Dimension of the world space that the cube element is embedded in.
    Definition axisalignedcubegeometry.hh:59
    \n-
    GlobalCoordinate corner(int k) const
    Return world coordinates of the k-th corner of the element.
    Definition axisalignedcubegeometry.hh:269
    \n-
    ctype Volume
    Type used for volume.
    Definition axisalignedcubegeometry.hh:71
    \n-
    FieldVector< ctype, dim > LocalCoordinate
    Type used for a vector of element coordinates.
    Definition axisalignedcubegeometry.hh:65
    \n-
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    Jacobian transposed of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:205
    \n-
    FieldVector< ctype, coorddim > GlobalCoordinate
    Type used for a vector of world coordinates.
    Definition axisalignedcubegeometry.hh:68
    \n-
    LocalCoordinate local(const GlobalCoordinate &global) const
    Map a point in global (world) coordinates to element coordinates.
    Definition axisalignedcubegeometry.hh:189
    \n-
    CoordType ctype
    Type used for single coordinate coefficients.
    Definition axisalignedcubegeometry.hh:62
    \n-
    std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, coorddim, dim > > Jacobian
    Return type of jacobian.
    Definition axisalignedcubegeometry.hh:100
    \n-
    GeometryType type() const
    Type of the cube. Here: a hypercube of the correct dimension.
    Definition axisalignedcubegeometry.hh:164
    \n-
    int corners() const
    Return the number of corners of the element.
    Definition axisalignedcubegeometry.hh:263
    \n-
    Jacobian jacobian(const LocalCoordinate &local) const
    Jacobian of the transformation from local to global coordinates.
    Definition axisalignedcubegeometry.hh:229
    \n-
    std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, coorddim, dim > >::type JacobianInverseTransposed
    Return type of jacobianInverseTransposed.
    Definition axisalignedcubegeometry.hh:91
    \n-
    Volume integrationElement(const LocalCoordinate &local) const
    Return the integration element, i.e., the determinant term in the integral transformation formula.
    Definition axisalignedcubegeometry.hh:243
    \n-
    GlobalCoordinate center() const
    Return center of mass of the element.
    Definition axisalignedcubegeometry.hh:249
    \n-
    AxisAlignedCubeGeometry()=default
    Constructs an empty geometry.
    \n-
    bool affine() const
    Return if the element is affine. Here: yes.
    Definition axisalignedcubegeometry.hh:311
    \n-
    std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix< ctype, dim, coorddim > > JacobianInverse
    Return type of jacobianInverse.
    Definition axisalignedcubegeometry.hh:109
    \n-
    GlobalCoordinate global(const LocalCoordinate &local) const
    Map a point in local (element) coordinates to world coordinates.
    Definition axisalignedcubegeometry.hh:170
    \n+
    Enum
    Definition quadraturerules.hh:131
    \n+
    @ GaussJacobi_n_0
    Gauss-Legendre rules with .
    Definition quadraturerules.hh:168
    \n+
    @ GaussJacobi_2_0
    Gauss-Legendre rules with .
    Definition quadraturerules.hh:155
    \n+
    @ GaussRadauRight
    Gauss-Radau rules including the right endpoint.
    Definition quadraturerules.hh:193
    \n+
    @ GaussJacobi_1_0
    Gauss-Jacobi rules with .
    Definition quadraturerules.hh:148
    \n+
    @ GaussLobatto
    Gauss-Lobatto rules.
    Definition quadraturerules.hh:176
    \n+
    @ GaussRadauLeft
    Gauss-Radau rules including the left endpoint.
    Definition quadraturerules.hh:184
    \n+
    @ GaussLegendre
    Gauss-Legendre rules (default)
    Definition quadraturerules.hh:141
    \n+
    Single evaluation point in a quadrature rule.
    Definition quadraturerules.hh:66
    \n+
    const Vector & position() const
    return local coordinates of integration point i
    Definition quadraturerules.hh:82
    \n+
    Dune::FieldVector< ct, dim > Vector
    Type used for the position of a quadrature point.
    Definition quadraturerules.hh:75
    \n+
    ct Field
    Number type used for coordinates and quadrature weights.
    Definition quadraturerules.hh:72
    \n+
    const ct & weight() const
    return weight associated with integration point i
    Definition quadraturerules.hh:88
    \n+
    ct weight_
    Definition quadraturerules.hh:124
    \n+
    static constexpr int dimension
    Dimension of the integration domain.
    Definition quadraturerules.hh:69
    \n+
    QuadraturePoint(const Vector &x, ct w)
    set up quadrature of given order in d dimensions
    Definition quadraturerules.hh:78
    \n+
    FieldVector< ct, dim > local
    Definition quadraturerules.hh:123
    \n+
    Dune::FieldVector< ct, dim > type
    Definition quadraturerules.hh:43
    \n+\n+
    Exception thrown if a desired QuadratureRule is not available, because the requested order is to high...
    Definition quadraturerules.hh:55
    \n+
    Abstract base class for quadrature rules.
    Definition quadraturerules.hh:214
    \n+
    virtual ~QuadratureRule()
    Definition quadraturerules.hh:241
    \n+
    virtual GeometryType type() const
    return type of element
    Definition quadraturerules.hh:240
    \n+
    int delivered_order
    Definition quadraturerules.hh:249
    \n+
    QuadratureRule(GeometryType t, int order)
    Constructor for a given geometry type and a given quadrature order.
    Definition quadraturerules.hh:228
    \n+
    GeometryType geometry_type
    Definition quadraturerules.hh:248
    \n+
    ct CoordType
    The type used for coordinates.
    Definition quadraturerules.hh:234
    \n+
    QuadratureRule()
    Default constructor.
    Definition quadraturerules.hh:221
    \n+
    virtual int order() const
    return order
    Definition quadraturerules.hh:237
    \n+
    QuadratureRule(GeometryType t)
    Constructor for a given geometry type. Leaves the quadrature order invalid
    Definition quadraturerules.hh:225
    \n+
    std::vector< QuadraturePoint< ct, dim > >::const_iterator iterator
    Definition quadraturerules.hh:245
    \n+
    Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType.
    Definition quadraturerules.hh:370
    \n+
    A container for all quadrature rules of dimension dim
    Definition quadraturerules.hh:260
    \n+
    static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    maximum quadrature order for given geometry type and quadrature type
    Definition quadraturerules.hh:319
    \n+
    static const QuadratureRule & rule(const GeometryType::BasicType t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    select the appropriate QuadratureRule for GeometryType t and order p
    Definition quadraturerules.hh:332
    \n+
    static const QuadratureRule & rule(const GeometryType &t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
    select the appropriate QuadratureRule for GeometryType t and order p
    Definition quadraturerules.hh:326
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    constexpr bool isPrism() const
    Return true if entity is a prism.
    Definition type.hh:309
    \n+
    constexpr bool isVertex() const
    Return true if entity is a vertex.
    Definition type.hh:279
    \n+
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n+
    BasicType
    Each entity can be tagged by one of these basic types plus its space dimension.
    Definition type.hh:120
    \n+
    constexpr bool isLine() const
    Return true if entity is a line segment.
    Definition type.hh:284
    \n+
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n+
    constexpr bool isSimplex() const
    Return true if entity is a simplex of any dimension.
    Definition type.hh:319
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,438 +1,613 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-axisalignedcubegeometry.hh\n+quadraturerules.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n 5\n-6#ifndef DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH\n-7#define DUNE_GEOMETRY_AXISALIGNED_CUBE_GEOMETRY_HH\n+6#ifndef DUNE_GEOMETRY_QUADRATURERULES_HH\n+7#define DUNE_GEOMETRY_QUADRATURERULES_HH\n 8\n-13#include \n-14\n-15#include \n-16#include \n-17#include \n-18\n-19#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+9#include \n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15\n+16#include \n+17#include \n+18#include \n+19#include \n+20#include \n 21\n-22\n-23namespace _\bD_\bu_\bn_\be {\n+22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n 24\n-48 template \n-_\b4_\b9 class _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-50 {\n-51\n-52\n-53 public:\n-54\n-_\b5_\b6 constexpr static int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n-57\n-_\b5_\b9 constexpr static int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = coorddim;\n-60\n-_\b6_\b2 typedef CoordType _\bc_\bt_\by_\bp_\be;\n-63\n-_\b6_\b5 typedef FieldVector _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-66\n-_\b6_\b8 typedef FieldVector _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-69\n-_\b7_\b1 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n-72\n-79 typedef typename std::conditional,\n-_\b8_\b1 FieldMatrix >_\b:_\b:_\bt_\by_\bp_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-82\n-89 typedef typename std::conditional,\n-_\b9_\b1 FieldMatrix >_\b:_\b:_\bt_\by_\bp_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n+31namespace _\bD_\bu_\bn_\be {\n+32 // forward declaration\n+33 template\n+34 class QuadraturePoint;\n+35}\n+36\n+37// class specialization of standard classes that allow to use structured\n+bindings on QuadraturePoint\n+38namespace _\bs_\bt_\bd {\n+39 template\n+_\b4_\b0 struct tuple_size<_\bD_\bu_\bn_\be::QuadraturePoint> : public std::\n+integral_constant {};\n+41\n+42 template\n+_\b4_\b3 struct tuple_element<0, _\bD_\bu_\bn_\be::QuadraturePoint> { using _\bt_\by_\bp_\be = Dune::\n+FieldVector; };\n+44\n+45 template\n+_\b4_\b6 struct tuple_element<1, _\bD_\bu_\bn_\be::QuadraturePoint> { using _\bt_\by_\bp_\be = ct; };\n+47}\n+48\n+49namespace _\bD_\bu_\bn_\be {\n+50\n+_\b5_\b5 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be : public NotImplemented {};\n+56\n+65 template\n+_\b6_\b6 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt {\n+67 public:\n+_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n+70\n+_\b7_\b2 typedef ct _\bF_\bi_\be_\bl_\bd;\n+73\n+_\b7_\b5 typedef Dune::FieldVector _\bV_\be_\bc_\bt_\bo_\br;\n+76\n+_\b7_\b8 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt (const _\bV_\be_\bc_\bt_\bo_\br& x, ct w) : _\bl_\bo_\bc_\ba_\bl(x), _\bw_\be_\bi_\bg_\bh_\bt_\b_(w)\n+79 {}\n+80\n+_\b8_\b2 const _\bV_\be_\bc_\bt_\bo_\br& _\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn () const\n+83 {\n+84 return _\bl_\bo_\bc_\ba_\bl;\n+85 }\n+86\n+_\b8_\b8 const ct &_\bw_\be_\bi_\bg_\bh_\bt () const\n+89 {\n+90 return _\bw_\be_\bi_\bg_\bh_\bt_\b_;\n+91 }\n 92\n-_\b1_\b0_\b0 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn = std::conditional_t, FieldMatrix >;\n-101\n-_\b1_\b0_\b9 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be = std::conditional_t, FieldMatrix >;\n-110\n-_\b1_\b1_\b8 _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by () = default;\n-119\n-_\b1_\b2_\b4 _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by(const Dune::FieldVector lower,\n-125 const Dune::FieldVector upper)\n-126 : lower_(lower),\n-127 upper_(upper),\n-128 axes_()\n-129 {\n-130 static_assert(dim==coorddim, \"Use this constructor only if\n-dim==coorddim!\");\n-131 // all 'true', but is never actually used\n-132 axes_ = (1< lower,\n-143 const Dune::FieldVector upper,\n-144 const std::bitset& axes)\n-145 : lower_(lower),\n-146 upper_(upper),\n-147 axes_(axes)\n-148 {\n-149 assert(axes.count()==dim);\n-150 for (size_t i=0; i lower)\n-160 : lower_(lower)\n-161 {}\n-162\n-_\b1_\b6_\b4 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be() const\n-165 {\n-166 return GeometryTypes::cube(dim);\n-167 }\n-168\n-_\b1_\b7_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl(const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n-171 {\n-172 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be result;\n-173 if (dim == coorddim) { // fast case\n-174 for (size_t i=0; i = 0>\n+_\b1_\b1_\b2 std::tuple_element_t> get() const\n+113 {\n+114 if constexpr (index == 0) {\n+115 return local;\n+116 }\n+117 else {\n+118 return weight_;\n+119 }\n+120 }\n+121\n+122 protected:\n+_\b1_\b2_\b3 FieldVector local;\n+_\b1_\b2_\b4 ct weight_;\n+125 };\n+126\n+_\b1_\b3_\b0 namespace QuadratureType {\n+_\b1_\b3_\b1 enum Enum {\n+_\b1_\b4_\b1 GaussLegendre = 0,\n+142\n+_\b1_\b4_\b8 GaussJacobi_1_0 = 1,\n+149\n+_\b1_\b5_\b5 GaussJacobi_2_0 = 2,\n+156\n+_\b1_\b6_\b8 GaussJacobi_n_0 = 3,\n+169\n+_\b1_\b7_\b6 GaussLobatto = 4,\n+177\n+_\b1_\b8_\b4 GaussRadauLeft = 5,\n+185\n+_\b1_\b9_\b3 GaussRadauRight = 6,\n+194 size\n+_\b1_\b9_\b5 };\n+196 }\n+197\n+212 template\n+_\b2_\b1_\b3 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be : public std::vector >\n+214 {\n+215 public:\n+_\b2_\b2_\b1 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be() : delivered_order(-1) {}\n+222\n+223 protected:\n+_\b2_\b2_\b5 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be t) : geometry_type(t), delivered_order(-1) {}\n+226\n+_\b2_\b2_\b8 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be t, int order) : geometry_type(t),\n+delivered_order(order) {}\n+229 public:\n+_\b2_\b3_\b1 constexpr static int d = dim;\n+232\n+_\b2_\b3_\b4 typedef ct _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be;\n+235\n+_\b2_\b3_\b7 virtual int _\bo_\br_\bd_\be_\br () const { return delivered_order; }\n+238\n+_\b2_\b4_\b0 virtual _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const { return geometry_type; }\n+_\b2_\b4_\b1 virtual _\b~_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be(){}\n+242\n+_\b2_\b4_\b5 typedef typename std::vector >::const_iterator\n+_\bi_\bt_\be_\br_\ba_\bt_\bo_\br;\n+246\n+247 protected:\n+_\b2_\b4_\b8 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b__\bt_\by_\bp_\be;\n+_\b2_\b4_\b9 int _\bd_\be_\bl_\bi_\bv_\be_\br_\be_\bd_\b__\bo_\br_\bd_\be_\br;\n+250 };\n+251\n+252 // Forward declaration of the factory class,\n+253 // needed internally by the QuadratureRules container class.\n+254 template class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+255\n+259 template\n+_\b2_\b6_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs {\n 261\n-_\b2_\b6_\b3 int _\bc_\bo_\br_\bn_\be_\br_\bs() const\n-264 {\n-265 return 1<;\n+264\n+265 // indexed by quadrature order\n+266 using QuadratureOrderVector = std::vector >;\n 267\n-_\b2_\b6_\b9 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br(int k) const\n-270 {\n-271 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be result;\n-272 if (dim == coorddim) { // fast case\n-273 for (size_t i=0; i_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by & /* geometry */ )\n-317 {\n-318 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>_\b:_\b:_\bc_\bu_\bb_\be();\n-319 }\n-320\n-321 private:\n-322 // jacobianTransposed: fast case --> diagonal matrix\n-323 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( DiagonalMatrix &_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd )\n-const\n-324 {\n-325 for (size_t i=0; i dense matrix\n-330 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( FieldMatrix\n-&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n-331 {\n-332 if (dim==0)\n-333 return;\n-334\n-335 size_t lc = 0;\n-336 for (size_t i=0; i >;\n+270\n+271 // indexed by quadrature type enum\n+272 using QuadratureCacheVector = std::vector >;\n+273\n+275 DUNE_EXPORT const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre) const\n+276 {\n+277 assert(t._\bd_\bi_\bm()==dim);\n+278\n+279 DUNE_ASSERT_CALL_ONCE();\n+280\n+281 static QuadratureCacheVector quadratureCache(QuadratureType::size);\n+282\n+283 auto& [ onceFlagQuadratureType, geometryTypes ] = quadratureCache[qt];\n+284 // initialize geometry types for this quadrature type once\n+285 std::call_once(onceFlagQuadratureType, [&types = geometryTypes]{\n+286 types = GeometryTypeVector(LocalGeometryTypeIndex::size(dim));\n+287 });\n+288\n+289 auto& [ onceFlagGeometryType, quadratureOrders ] = geometryTypes\n+[LocalGeometryTypeIndex::index(t)];\n+290 // initialize quadrature orders for this geometry type and quadrature type\n+once\n+291 std::call_once(onceFlagGeometryType, [&, &orders = quadratureOrders]{\n+292 // we only need one quadrature rule for points, not maxint\n+293 const auto numRules = dim == 0 ? 1 : _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:\n+_\bm_\ba_\bx_\bO_\br_\bd_\be_\br(t, qt)+1;\n+294 orders = QuadratureOrderVector(numRules);\n+295 });\n+296\n+297 // we only have one quadrature rule for points\n+298 auto& [ onceFlagQuadratureOrder, quadratureRule ] = quadratureOrders[dim ==\n+0 ? 0 : p];\n+299 // initialize quadrature rule once\n+300 std::call_once(onceFlagQuadratureOrder, [&, &rule = quadratureRule]{\n+301 rule = _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\br_\bu_\bl_\be(t, p, qt);\n+302 });\n+303\n+304 return quadratureRule;\n+305 }\n+306\n+308 DUNE_EXPORT static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs& instance()\n+309 {\n+310 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs instance;\n+311 return instance;\n+312 }\n+313\n+315 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs () = default;\n+316 public:\n+318 static unsigned\n+_\b3_\b1_\b9 _\bm_\ba_\bx_\bO_\br_\bd_\be_\br(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t,\n+320 _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n+321 {\n+322 return _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bc_\bt_\by_\bp_\be_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bm_\ba_\bx_\bO_\br_\bd_\be_\br(t,qt);\n+323 }\n+324\n+_\b3_\b2_\b6 static const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _\br_\bu_\bl_\be(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n+327 {\n+328 return instance()._rule(t,p,qt);\n+329 }\n+330\n+_\b3_\b3_\b2 static const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be& _\br_\bu_\bl_\be(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt=QuadratureType::GaussLegendre)\n+333 {\n+334 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt(t,dim);\n+335 return instance()._rule(gt,p,qt);\n+336 }\n+337 };\n+338\n+339} // end namespace Dune\n 340\n-341 // jacobianInverseTransposed: fast case --> diagonal matrix\n-342 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( DiagonalMatrix\n-&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n-343 {\n-344 for (size_t i=0; i dense matrix\n-349 void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( FieldMatrix\n-&_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ) const\n-350 {\n-351 if (dim==0)\n-352 return;\n-353\n-354 size_t lc = 0;\n-355 for (size_t i=0; i lower_;\n-361\n-362 Dune::FieldVector upper_;\n-363\n-364 std::bitset axes_;\n-365 };\n-366\n-367} // namespace Dune\n-368#endif\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\b3_\b4_\b1#define DUNE_INCLUDING_IMPLEMENTATION\n+342\n+343// 0d rules\n+344#include \"quadraturerules/pointquadrature.hh\"\n+345// 1d rules\n+346#include \"quadraturerules/gausslobattoquadrature.hh\"\n+347#include \"quadraturerules/gaussquadrature.hh\"\n+348#include \"quadraturerules/gaussradauleftquadrature.hh\"\n+349#include \"quadraturerules/gaussradaurightquadrature.hh\"\n+350#include \"quadraturerules/jacobi1quadrature.hh\"\n+351#include \"quadraturerules/jacobi2quadrature.hh\"\n+352#include \"quadraturerules/jacobiNquadrature.hh\"\n+353// 3d rules\n+354#include \"quadraturerules/prismquadrature.hh\"\n+355// general rules\n+356#include \"quadraturerules/simplexquadrature.hh\"\n+357#include \"quadraturerules/tensorproductquadrature.hh\"\n+358\n+359#undef DUNE_INCLUDING_IMPLEMENTATION\n+360\n+361namespace _\bD_\bu_\bn_\be {\n+362\n+369 template\n+_\b3_\b7_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+371 private:\n+372 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n+373 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+374 {\n+375 return TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n+376 }\n+377 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+378 {\n+379 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n+380 }\n+381 };\n+382\n+383 template\n+_\b3_\b8_\b4 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+385 private:\n+_\b3_\b8_\b6 constexpr static int dim = 0;\n+387 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n+388 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm)\n+389 {\n+390 if (t._\bi_\bs_\bV_\be_\br_\bt_\be_\bx())\n+391 {\n+392 return std::numeric_limits::max();\n+393 }\n+394 DUNE_THROW(Exception, \"Unknown GeometryType\");\n+395 }\n+396 static QuadratureRule rule(const GeometryType& t, int ,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm)\n+397 {\n+398 if (t.isVertex())\n+399 {\n+400 return PointQuadratureRule();\n+401 }\n+402 DUNE_THROW(Exception, \"Unknown GeometryType\");\n+403 }\n+404 };\n+405\n+406 template\n+_\b4_\b0_\b7 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+408 private:\n+_\b4_\b0_\b9 constexpr static int dim = 1;\n+410 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n+411 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+412 {\n+413 if (t._\bi_\bs_\bL_\bi_\bn_\be())\n+414 {\n+415 switch (qt) {\n+416 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be :\n+417 return GaussQuadratureRule1D::highest_order;\n+418 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 :\n+419 return Jacobi1QuadratureRule1D::highest_order;\n+420 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 :\n+421 return Jacobi2QuadratureRule1D::highest_order;\n+422 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo :\n+423 return GaussLobattoQuadratureRule1D::highest_order;\n+424 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 :\n+425 return JacobiNQuadratureRule1D::maxOrder();\n+426 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt :\n+427 return GaussRadauLeftQuadratureRule1D::highest_order;\n+428 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt :\n+429 return GaussRadauRightQuadratureRule1D::highest_order;\n+430 default :\n+431 DUNE_THROW(Exception, \"Unknown QuadratureType\");\n+432 }\n+433 }\n+434 DUNE_THROW(Exception, \"Unknown GeometryType\");\n+435 }\n+436 static QuadratureRule rule(const GeometryType& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+437 {\n+438 if (t.isLine())\n+439 {\n+440 switch (qt) {\n+441 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be :\n+442 return GaussQuadratureRule1D(p);\n+443 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0 :\n+444 return Jacobi1QuadratureRule1D(p);\n+445 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0 :\n+446 return Jacobi2QuadratureRule1D(p);\n+447 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo :\n+448 return GaussLobattoQuadratureRule1D(p);\n+449 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 :\n+450 return JacobiNQuadratureRule1D(p);\n+451 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt :\n+452 return GaussRadauLeftQuadratureRule1D(p);\n+453 case _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt :\n+454 return GaussRadauRightQuadratureRule1D(p);\n+455 default :\n+456 DUNE_THROW(Exception, \"Unknown QuadratureType\");\n+457 }\n+458 }\n+459 DUNE_THROW(Exception, \"Unknown GeometryType\");\n+460 }\n+461 };\n+462\n+463 template\n+_\b4_\b6_\b4 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+465 private:\n+_\b4_\b6_\b6 constexpr static int dim = 2;\n+467 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n+468 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+469 {\n+470 unsigned order =\n+471 TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n+472 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n+473 order = std::max\n+474 (order, static_cast(SimplexQuadratureRule::\n+highest_order));\n+475 return order;\n+476 }\n+477 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+478 {\n+479 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx()\n+480 && ( qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be || qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n+_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 )\n+481 && p <= SimplexQuadratureRule::highest_order)\n+482 {\n+483 return SimplexQuadratureRule(p);\n+484 }\n+485 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n+486 }\n+487 };\n+488\n+489 template\n+_\b4_\b9_\b0 class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+491 private:\n+_\b4_\b9_\b2 constexpr static int dim = 3;\n+493 friend class _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs;\n+494 static unsigned maxOrder(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &t, _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+495 {\n+496 unsigned order =\n+497 TensorProductQuadratureRule::maxOrder(t._\bi_\bd(), qt);\n+498 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n+499 order = std::max\n+500 (order, static_cast(SimplexQuadratureRule::\n+highest_order));\n+501 if (t._\bi_\bs_\bP_\br_\bi_\bs_\bm())\n+502 order = std::max\n+503 (order, static_cast(PrismQuadratureRule::\n+highest_order));\n+504 return order;\n+505 }\n+506 static _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b> rule(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& t, int p,\n+_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm qt)\n+507 {\n+508\n+509 if (t._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx()\n+510 && ( qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be || qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:\n+_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0 )\n+511 && p <= SimplexQuadratureRule::highest_order)\n+512 {\n+513 return SimplexQuadratureRule(p);\n+514 }\n+515 if (t._\bi_\bs_\bP_\br_\bi_\bs_\bm()\n+516 && qt == _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be\n+517 && p <= PrismQuadratureRule::highest_order)\n+518 {\n+519 return PrismQuadratureRule(p);\n+520 }\n+521 return TensorProductQuadratureRule(t._\bi_\bd(), p, qt);\n+522 }\n+523 };\n+524\n+525#ifndef DUNE_NO_EXTERN_QUADRATURERULES\n+526 extern template class GaussLobattoQuadratureRule;\n+527 extern template class GaussQuadratureRule;\n+528 extern template class GaussRadauLeftQuadratureRule;\n+529 extern template class GaussRadauRightQuadratureRule;\n+530 extern template class Jacobi1QuadratureRule;\n+531 extern template class Jacobi2QuadratureRule;\n+532 extern template class JacobiNQuadratureRule;\n+533 extern template class PrismQuadratureRule;\n+534 extern template class SimplexQuadratureRule;\n+_\b5_\b3_\b5 extern template class SimplexQuadratureRule;\n+536#endif // !DUNE_NO_EXTERN_QUADRATURERULES\n+537\n+538} // end namespace\n+539\n+540#endif // DUNE_GEOMETRY_QUADRATURERULES_HH\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh\n+Helper classes to provide indices for geometrytypes for use in a vector.\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-typename Container::ReferenceElement ReferenceElement\n-The reference element type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bu_\bb_\be\n-static const ReferenceElement & cube()\n-get hypercube reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:168\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-A geometry implementation for axis-aligned hypercubes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:50\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume() const\n-Return the element volume.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:295\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const\n-Dune::FieldVector< ctype, coorddim > upper, const std::bitset< coorddim >\n-&axes)\n-Constructor from a lower left and an upper right corner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:142\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower, const\n-Dune::FieldVector< ctype, coorddim > upper)\n-Constructor from a lower left and an upper right corner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:124\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n-Inverse Jacobian of the transformation from local to global coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:235\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n-&local) const\n-Inverse Jacobian transposed of the transformation from local to global\n-coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:217\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n-ctype, dim, coorddim > >::type JacobianTransposed\n-Return type of jacobianTransposed.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:81\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AxisAlignedCubeGeometry(const Dune::FieldVector< ctype, coorddim > lower)\n-Constructor from a single point only.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:159\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int mydimension\n-Dimension of the cube element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:56\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-friend Dune::ReferenceElements< ctype, dim >::ReferenceElement referenceElement\n-(const AxisAlignedCubeGeometry &)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:316\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int coorddimension\n-Dimension of the world space that the cube element is embedded in.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:59\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-GlobalCoordinate corner(int k) const\n-Return world coordinates of the k-th corner of the element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-ctype Volume\n-Type used for volume.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, dim > LocalCoordinate\n-Type used for a vector of element coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n-Jacobian transposed of the transformation from local to global coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:205\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, coorddim > GlobalCoordinate\n-Type used for a vector of world coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-LocalCoordinate local(const GlobalCoordinate &global) const\n-Map a point in global (world) coordinates to element coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:189\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n-CoordType ctype\n-Type used for single coordinate coefficients.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:62\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n-ctype, coorddim, dim > > Jacobian\n-Return type of jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n-GeometryType type() const\n-Type of the cube. Here: a hypercube of the correct dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:164\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n-int corners() const\n-Return the number of corners of the element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Jacobian jacobian(const LocalCoordinate &local) const\n-Jacobian of the transformation from local to global coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:229\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-std::conditional< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n-ctype, coorddim, dim > >::type JacobianInverseTransposed\n-Return type of jacobianInverseTransposed.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:91\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n-Volume integrationElement(const LocalCoordinate &local) const\n-Return the integration element, i.e., the determinant term in the integral\n-transformation formula.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:243\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n-GlobalCoordinate center() const\n-Return center of mass of the element.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:249\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-AxisAlignedCubeGeometry()=default\n-Constructs an empty geometry.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine() const\n-Return if the element is affine. Here: yes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:311\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-std::conditional_t< dim==coorddim, DiagonalMatrix< ctype, dim >, FieldMatrix<\n-ctype, dim, coorddim > > JacobianInverse\n-Return type of jacobianInverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:109\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-GlobalCoordinate global(const LocalCoordinate &local) const\n-Map a point in local (element) coordinates to world coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:170\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bE_\bn_\bu_\bm\n+Enum\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:131\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\bn_\b__\b0\n+@ GaussJacobi_n_0\n+Gauss-Legendre rules with .\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:168\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b2_\b__\b0\n+@ GaussJacobi_2_0\n+Gauss-Legendre rules with .\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:155\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bR_\bi_\bg_\bh_\bt\n+@ GaussRadauRight\n+Gauss-Radau rules including the right endpoint.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:193\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bJ_\ba_\bc_\bo_\bb_\bi_\b__\b1_\b__\b0\n+@ GaussJacobi_1_0\n+Gauss-Jacobi rules with .\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:148\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\bo_\bb_\ba_\bt_\bt_\bo\n+@ GaussLobatto\n+Gauss-Lobatto rules.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:176\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bR_\ba_\bd_\ba_\bu_\bL_\be_\bf_\bt\n+@ GaussRadauLeft\n+Gauss-Radau rules including the left endpoint.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:184\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bG_\ba_\bu_\bs_\bs_\bL_\be_\bg_\be_\bn_\bd_\br_\be\n+@ GaussLegendre\n+Gauss-Legendre rules (default)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:141\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt\n+Single evaluation point in a quadrature rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:66\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n+const Vector & position() const\n+return local coordinates of integration point i\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:82\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bV_\be_\bc_\bt_\bo_\br\n+Dune::FieldVector< ct, dim > Vector\n+Type used for the position of a quadrature point.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:75\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bF_\bi_\be_\bl_\bd\n+ct Field\n+Number type used for coordinates and quadrature weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bw_\be_\bi_\bg_\bh_\bt\n+const ct & weight() const\n+return weight associated with integration point i\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:88\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bw_\be_\bi_\bg_\bh_\bt_\b_\n+ct weight_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:124\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static constexpr int dimension\n+Dimension of the integration domain.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:69\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt\n+QuadraturePoint(const Vector &x, ct w)\n+set up quadrature of given order in d dimensions\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+FieldVector< ct, dim > local\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:123\n+_\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b0_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>_\b:_\b:_\bt_\by_\bp_\be\n+Dune::FieldVector< ct, dim > type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:43\n+_\bs_\bt_\bd_\b:_\b:_\bt_\bu_\bp_\bl_\be_\b__\be_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\b1_\b,_\b _\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bP_\bo_\bi_\bn_\bt_\b<_\b _\bc_\bt_\b,_\b _\bd_\bi_\bm_\b _\b>_\b _\b>_\b:_\b:_\bt_\by_\bp_\be\n+ct type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:46\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bO_\br_\bd_\be_\br_\bO_\bu_\bt_\bO_\bf_\bR_\ba_\bn_\bg_\be\n+Exception thrown if a desired QuadratureRule is not available, because the\n+requested order is to high...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:55\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+Abstract base class for quadrature rules.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:214\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\b~_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+virtual ~QuadratureRule()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:241\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bt_\by_\bp_\be\n+virtual GeometryType type() const\n+return type of element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:240\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bd_\be_\bl_\bi_\bv_\be_\br_\be_\bd_\b__\bo_\br_\bd_\be_\br\n+int delivered_order\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:249\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+QuadratureRule(GeometryType t, int order)\n+Constructor for a given geometry type and a given quadrature order.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:228\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b__\bt_\by_\bp_\be\n+GeometryType geometry_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:248\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be\n+ct CoordType\n+The type used for coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:234\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+QuadratureRule()\n+Default constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:221\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bo_\br_\bd_\be_\br\n+virtual int order() const\n+return order\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:237\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+QuadratureRule(GeometryType t)\n+Constructor for a given geometry type. Leaves the quadrature order invalid\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:225\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n+std::vector< QuadraturePoint< ct, dim > >::const_iterator iterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:245\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Factory class for creation of quadrature rules, depending on GeometryType,\n+order and QuadratureType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:370\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs\n+A container for all quadrature rules of dimension dim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:260\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\bm_\ba_\bx_\bO_\br_\bd_\be_\br\n+static unsigned maxOrder(const GeometryType &t, QuadratureType::Enum\n+qt=QuadratureType::GaussLegendre)\n+maximum quadrature order for given geometry type and quadrature type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:319\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\br_\bu_\bl_\be\n+static const QuadratureRule & rule(const GeometryType::BasicType t, int p,\n+QuadratureType::Enum qt=QuadratureType::GaussLegendre)\n+select the appropriate QuadratureRule for GeometryType t and order p\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:332\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b:_\b:_\br_\bu_\bl_\be\n+static const QuadratureRule & rule(const GeometryType &t, int p,\n+QuadratureType::Enum qt=QuadratureType::GaussLegendre)\n+select the appropriate QuadratureRule for GeometryType t and order p\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:326\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm\n+constexpr bool isPrism() const\n+Return true if entity is a prism.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:309\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bV_\be_\br_\bt_\be_\bx\n+constexpr bool isVertex() const\n+Return true if entity is a vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:279\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n+constexpr unsigned int dim() const\n+Return dimension of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be\n+BasicType\n+Each entity can be tagged by one of these basic types plus its space dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:120\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bL_\bi_\bn_\be\n+constexpr bool isLine() const\n+Return true if entity is a line segment.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:284\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n+constexpr unsigned int id() const\n+Return the topology id of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n+constexpr bool isSimplex() const\n+Return true if entity is a simplex of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00206.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00206.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelementimplementation.hh File Reference\n+dune-geometry: multilineargeometry.hh File Reference\n \n \n \n \n \n \n \n@@ -70,44 +70,57 @@\n
    \n \n
    \n
    \n
    \n \n-
    referenceelementimplementation.hh File Reference
    \n+
    multilineargeometry.hh File Reference
    \n
    \n
    \n
    #include <cassert>
    \n-#include <algorithm>
    \n+#include <functional>
    \n+#include <iterator>
    \n #include <limits>
    \n-#include <tuple>
    \n-#include <utility>
    \n #include <vector>
    \n-#include <array>
    \n-#include <bitset>
    \n #include <dune/common/fmatrix.hh>
    \n #include <dune/common/fvector.hh>
    \n-#include <dune/common/hybridutilities.hh>
    \n #include <dune/common/typetraits.hh>
    \n-#include <dune/common/iteratorrange.hh>
    \n-#include <dune/common/math.hh>
    \n-#include <dune/geometry/referenceelement.hh>
    \n-#include <dune/geometry/affinegeometry.hh>
    \n-#include <dune/geometry/type.hh>
    \n+#include <dune/geometry/affinegeometry.hh>
    \n+#include <dune/geometry/referenceelements.hh>
    \n+#include <dune/geometry/type.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    struct  Dune::MultiLinearGeometryTraits< ct >
     default traits class for MultiLinearGeometry More...
     
    struct  Dune::MultiLinearGeometryTraits< ct >::CornerStorage< mydim, cdim >
     template specifying the storage for the corners More...
     
    struct  Dune::MultiLinearGeometryTraits< ct >::hasSingleGeometryType< dim >
     will there be only one geometry type for a dimension? More...
     
    class  Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >
     generic geometry implementation based on corner coordinates More...
     
    class  Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
     
    class  Dune::CachedMultiLinearGeometry< ct, mydim, cdim, Traits >
     Implement a MultiLinearGeometry with additional caching. More...
     
    \n \n \n \n-\n-\n

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::Geo
     
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,33 +1,44 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-referenceelementimplementation.hh File Reference\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+multilineargeometry.hh File Reference\n #include \n-#include \n+#include \n+#include \n #include \n-#include \n-#include \n #include \n-#include \n-#include \n #include \n #include \n-#include \n #include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>\n+\u00a0 default traits class for _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be_\b<_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n+\u00a0 template specifying the storage for the corners _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b<_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 will there be only one geometry type for a dimension? _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+\u00a0 generic geometry implementation based on corner coordinates _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>_\b:_\b:\n+ _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+\u00a0 Implement a _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by with additional caching. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n-\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00206_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00206_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelementimplementation.hh Source File\n+dune-geometry: multilineargeometry.hh Source File\n \n \n \n \n \n \n \n@@ -74,724 +74,840 @@\n \n
    \n \n
    \n \n
    \n-
    referenceelementimplementation.hh
    \n+
    multilineargeometry.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
    \n-
    6#define DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
    \n+
    5#ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n+
    6#define DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n
    7
    \n
    8#include <cassert>
    \n-
    9
    \n-
    10#include <algorithm>
    \n+
    9#include <functional>
    \n+
    10#include <iterator>
    \n
    11#include <limits>
    \n-
    12#include <tuple>
    \n-
    13#include <utility>
    \n-
    14#include <vector>
    \n-
    15#include <array>
    \n-
    16#include <bitset>
    \n+
    12#include <vector>
    \n+
    13
    \n+
    14#include <dune/common/fmatrix.hh>
    \n+
    15#include <dune/common/fvector.hh>
    \n+
    16#include <dune/common/typetraits.hh>
    \n
    17
    \n-
    18#include <dune/common/fmatrix.hh>
    \n-
    19#include <dune/common/fvector.hh>
    \n-
    20#include <dune/common/hybridutilities.hh>
    \n-
    21#include <dune/common/typetraits.hh>
    \n-
    22#include <dune/common/iteratorrange.hh>
    \n-
    23#include <dune/common/math.hh>
    \n+\n+\n+
    20#include <dune/geometry/type.hh>
    \n+
    21
    \n+
    22namespace Dune
    \n+
    23{
    \n
    24
    \n-\n-\n-
    27#include <dune/geometry/type.hh>
    \n-
    28
    \n-
    29namespace Dune
    \n-
    30{
    \n-
    31
    \n-
    32 namespace Geo
    \n-
    33 {
    \n-
    34
    \n-
    35#ifndef DOXYGEN
    \n-
    36
    \n-
    37 // Internal Forward Declarations
    \n-
    38 // -----------------------------
    \n-
    39
    \n-
    40 namespace Impl
    \n-
    41 {
    \n-
    42 template< class ctype, int dim >
    \n-
    43 class ReferenceElementContainer;
    \n-
    44 }
    \n-
    45
    \n-
    46 template< class ctype, int dim >
    \n-
    47 struct ReferenceElements;
    \n-
    48
    \n-
    49
    \n-
    50
    \n-
    51 namespace Impl
    \n-
    52 {
    \n-
    53
    \n-
    54 using Dune::Impl::isPrism;
    \n-
    55 using Dune::Impl::isPyramid;
    \n-
    56 using Dune::Impl::baseTopologyId;
    \n-
    57 using Dune::Impl::prismConstruction;
    \n-
    58 using Dune::Impl::pyramidConstruction;
    \n-
    59 using Dune::Impl::numTopologies;
    \n-
    60
    \n-
    62 unsigned int size ( unsigned int topologyId, int dim, int codim );
    \n-
    63
    \n-
    64
    \n-
    65
    \n-
    73 unsigned int subTopologyId ( unsigned int topologyId, int dim, int codim, unsigned int i );
    \n-
    74
    \n-
    75
    \n-
    76
    \n-
    77 // subTopologyNumbering
    \n-
    78 // --------------------
    \n-
    79
    \n-
    80 void subTopologyNumbering ( unsigned int topologyId, int dim, int codim, unsigned int i, int subcodim,
    \n-
    81 unsigned int *beginOut, unsigned int *endOut );
    \n-
    82
    \n-
    83
    \n-
    84
    \n-
    85
    \n-
    86 // checkInside
    \n-
    87 // -----------
    \n-
    88
    \n-
    89 template< class ct, int cdim >
    \n-
    90 inline bool
    \n-
    91 checkInside ( unsigned int topologyId, int dim, const FieldVector< ct, cdim > &x, ct tolerance, ct factor = ct( 1 ) )
    \n-
    92 {
    \n-
    93 assert( (dim >= 0) && (dim <= cdim) );
    \n-
    94 assert( topologyId < numTopologies( dim ) );
    \n-
    95
    \n-
    96 if( dim > 0 )
    \n-
    97 {
    \n-
    98 const ct baseFactor = (isPrism( topologyId, dim ) ? factor : factor - x[ dim-1 ]);
    \n-
    99 if( (x[ dim-1 ] > -tolerance) && (factor - x[ dim-1 ] > -tolerance) )
    \n-
    100 return checkInside< ct, cdim >( baseTopologyId( topologyId, dim ), dim-1, x, tolerance, baseFactor );
    \n-
    101 else
    \n-
    102 return false;
    \n-
    103 }
    \n-
    104 else
    \n-
    105 return true;
    \n-
    106 }
    \n-
    107
    \n-
    108
    \n-
    109
    \n-
    110 // referenceCorners
    \n-
    111 // ----------------
    \n-
    112
    \n-
    113 template< class ct, int cdim >
    \n-
    114 inline unsigned int
    \n-
    115 referenceCorners ( unsigned int topologyId, int dim, FieldVector< ct, cdim > *corners )
    \n-
    116 {
    \n-
    117 assert( (dim >= 0) && (dim <= cdim) );
    \n-
    118 assert( topologyId < numTopologies( dim ) );
    \n-
    119
    \n-
    120 if( dim > 0 )
    \n-
    121 {
    \n-
    122 const unsigned int nBaseCorners
    \n-
    123 = referenceCorners( baseTopologyId( topologyId, dim ), dim-1, corners );
    \n-
    124 assert( nBaseCorners == size( baseTopologyId( topologyId, dim ), dim-1, dim-1 ) );
    \n-
    125 if( isPrism( topologyId, dim ) )
    \n-
    126 {
    \n-
    127 std::copy( corners, corners + nBaseCorners, corners + nBaseCorners );
    \n-
    128 for( unsigned int i = 0; i < nBaseCorners; ++i )
    \n-
    129 corners[ i+nBaseCorners ][ dim-1 ] = ct( 1 );
    \n-
    130 return 2*nBaseCorners;
    \n-
    131 }
    \n-
    132 else
    \n-
    133 {
    \n-
    134 corners[ nBaseCorners ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    135 corners[ nBaseCorners ][ dim-1 ] = ct( 1 );
    \n-
    136 return nBaseCorners+1;
    \n-
    137 }
    \n-
    138 }
    \n-
    139 else
    \n-
    140 {
    \n-
    141 *corners = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    142 return 1;
    \n-
    143 }
    \n-
    144 }
    \n-
    145
    \n-
    146
    \n-
    147
    \n-
    148 // referenceVolume
    \n-
    149 // ---------------
    \n-
    150
    \n-
    151 unsigned long referenceVolumeInverse ( unsigned int topologyId, int dim );
    \n-
    152
    \n-
    153 template< class ct >
    \n-
    154 inline ct referenceVolume ( unsigned int topologyId, int dim )
    \n-
    155 {
    \n-
    156 return ct( 1 ) / ct( referenceVolumeInverse( topologyId, dim ) );
    \n-
    157 }
    \n+
    25 // MultiLinearGeometryTraits
    \n+
    26 // -------------------------
    \n+
    27
    \n+
    37 template< class ct >
    \n+
    \n+\n+
    39 {
    \n+
    58 typedef Impl::FieldMatrixHelper< ct > MatrixHelper;
    \n+
    59
    \n+
    61 static ct tolerance () { return ct( 16 ) * std::numeric_limits< ct >::epsilon(); }
    \n+
    62
    \n+
    127 template< int mydim, int cdim >
    \n+
    \n+\n+
    129 {
    \n+
    130 typedef std::vector< FieldVector< ct, cdim > > Type;
    \n+
    131 };
    \n+
    \n+
    132
    \n+
    146 template< int dim >
    \n+
    \n+\n+
    148 {
    \n+
    149 static const bool v = false;
    \n+
    150 static const unsigned int topologyId = ~0u;
    \n+
    151 };
    \n+
    \n+
    152 };
    \n+
    \n+
    153
    \n+
    154
    \n+
    155
    \n+
    156 // MultiLinearGeometry
    \n+
    157 // -------------------
    \n
    158
    \n-
    159
    \n-
    160
    \n-
    161 // referenceOrigins
    \n-
    162 // ----------------
    \n-
    163
    \n-
    164 template< class ct, int cdim >
    \n-
    165 inline unsigned int
    \n-
    166 referenceOrigins ( unsigned int topologyId, int dim, int codim, FieldVector< ct, cdim > *origins )
    \n-
    167 {
    \n-
    168 assert( (dim >= 0) && (dim <= cdim) );
    \n-
    169 assert( topologyId < numTopologies( dim ) );
    \n-
    170 assert( (codim >= 0) && (codim <= dim) );
    \n-
    171
    \n-
    172 if( codim > 0 )
    \n-
    173 {
    \n-
    174 const unsigned int baseId = baseTopologyId( topologyId, dim );
    \n-
    175 if( isPrism( topologyId, dim ) )
    \n-
    176 {
    \n-
    177 const unsigned int n = (codim < dim ? referenceOrigins( baseId, dim-1, codim, origins ) : 0);
    \n-
    178 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins+n );
    \n-
    179 for( unsigned int i = 0; i < m; ++i )
    \n-
    180 {
    \n-
    181 origins[ n+m+i ] = origins[ n+i ];
    \n-
    182 origins[ n+m+i ][ dim-1 ] = ct( 1 );
    \n-
    183 }
    \n-
    184 return n+2*m;
    \n-
    185 }
    \n-
    186 else
    \n-
    187 {
    \n-
    188 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins );
    \n-
    189 if( codim == dim )
    \n-
    190 {
    \n-
    191 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    192 origins[ m ][ dim-1 ] = ct( 1 );
    \n-
    193 return m+1;
    \n-
    194 }
    \n-
    195 else
    \n-
    196 return m+referenceOrigins( baseId, dim-1, codim, origins+m );
    \n-
    197 }
    \n-
    198 }
    \n-
    199 else
    \n-
    200 {
    \n-
    201 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    202 return 1;
    \n-
    203 }
    \n-
    204 }
    \n+
    179 template< class ct, int mydim, int cdim, class Traits = MultiLinearGeometryTraits< ct > >
    \n+
    \n+\n+
    181 {
    \n+\n+
    183
    \n+
    184 public:
    \n+
    186 typedef ct ctype;
    \n+
    187
    \n+
    189 static const int mydimension= mydim;
    \n+
    191 static const int coorddimension = cdim;
    \n+
    192
    \n+
    194 typedef FieldVector< ctype, mydimension > LocalCoordinate;
    \n+
    196 typedef FieldVector< ctype, coorddimension > GlobalCoordinate;
    \n+
    198 typedef ctype Volume;
    \n+
    199
    \n+
    201 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed;
    \n+
    202
    \n+\n
    205
    \n-
    206
    \n-
    207
    \n-
    208 // referenceEmbeddings
    \n-
    209 // -------------------
    \n-
    210
    \n-
    211 template< class ct, int cdim, int mydim >
    \n-
    212 inline unsigned int
    \n-
    213 referenceEmbeddings ( unsigned int topologyId, int dim, int codim,
    \n-
    214 FieldVector< ct, cdim > *origins,
    \n-
    215 FieldMatrix< ct, mydim, cdim > *jacobianTransposeds )
    \n-
    216 {
    \n-
    217 assert( (0 <= codim) && (codim <= dim) && (dim <= cdim) );
    \n-
    218 assert( (dim - codim <= mydim) && (mydim <= cdim) );
    \n-
    219 assert( topologyId < numTopologies( dim ) );
    \n+
    207 typedef FieldMatrix< ctype, coorddimension, mydimension > Jacobian;
    \n+
    208
    \n+
    210 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse;
    \n+
    211
    \n+
    212 protected:
    \n+
    213
    \n+\n+
    215
    \n+
    216 public:
    \n+
    217
    \n+\n
    220
    \n-
    221 if( (0 < codim) && (codim <= dim) )
    \n-
    222 {
    \n-
    223 const unsigned int baseId = baseTopologyId( topologyId, dim );
    \n-
    224 if( isPrism( topologyId, dim ) )
    \n-
    225 {
    \n-
    226 const unsigned int n = (codim < dim ? referenceEmbeddings( baseId, dim-1, codim, origins, jacobianTransposeds ) : 0);
    \n-
    227 for( unsigned int i = 0; i < n; ++i )
    \n-
    228 jacobianTransposeds[ i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
    \n-
    229
    \n-
    230 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins+n, jacobianTransposeds+n );
    \n-
    231 std::copy( origins+n, origins+n+m, origins+n+m );
    \n-
    232 std::copy( jacobianTransposeds+n, jacobianTransposeds+n+m, jacobianTransposeds+n+m );
    \n-
    233 for( unsigned int i = 0; i < m; ++i )
    \n-
    234 origins[ n+m+i ][ dim-1 ] = ct( 1 );
    \n-
    235
    \n-
    236 return n+2*m;
    \n-
    237 }
    \n-
    238 else // !isPrism
    \n-
    239 {
    \n-
    240 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins, jacobianTransposeds );
    \n-
    241 if( codim == dim )
    \n-
    242 {
    \n-
    243 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    244 origins[ m ][ dim-1 ] = ct( 1 );
    \n-
    245 jacobianTransposeds[ m ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
    \n-
    246 return m+1;
    \n-
    247 }
    \n-
    248 else if( codim < dim )
    \n-
    249 {
    \n-
    250 const unsigned int n = referenceEmbeddings( baseId, dim-1, codim, origins+m, jacobianTransposeds+m );
    \n-
    251 for( unsigned int i = 0; i < n; ++i )
    \n-
    252 {
    \n-
    253 for( int k = 0; k < dim-1; ++k )
    \n-
    254 jacobianTransposeds[ m+i ][ dim-codim-1 ][ k ] = -origins[ m+i ][ k ];
    \n-
    255 jacobianTransposeds[ m+i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
    \n-
    256 }
    \n-
    257 return m+n;
    \n-
    258 }
    \n-
    259 }
    \n-
    260 }
    \n-
    261 else if( codim == 0 )
    \n-
    262 {
    \n-
    263 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    264 jacobianTransposeds[ 0 ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
    \n-
    265 for( int k = 0; k < dim; ++k )
    \n-
    266 jacobianTransposeds[ 0 ][ k ][ k ] = ct( 1 );
    \n-
    267 return 1;
    \n-
    268 }
    \n-
    269
    \n-
    270 // this point should not be reached since all cases are handled before.
    \n-
    271 std::abort();
    \n-
    272 return 0;
    \n-
    273 }
    \n-
    274
    \n-
    275
    \n-
    276
    \n-
    277 // referenceIntegrationOuterNormals
    \n-
    278 // --------------------------------
    \n-
    279
    \n-
    280 template< class ct, int cdim >
    \n-
    281 inline unsigned int
    \n-
    282 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,
    \n-
    283 const FieldVector< ct, cdim > *origins,
    \n-
    284 FieldVector< ct, cdim > *normals )
    \n-
    285 {
    \n-
    286 assert( (dim > 0) && (dim <= cdim) );
    \n-
    287 assert( topologyId < numTopologies( dim ) );
    \n-
    288
    \n-
    289 if( dim > 1 )
    \n-
    290 {
    \n-
    291 const unsigned int baseId = baseTopologyId( topologyId, dim );
    \n-
    292 if( isPrism( topologyId, dim ) )
    \n-
    293 {
    \n-
    294 const unsigned int numBaseFaces
    \n-
    295 = referenceIntegrationOuterNormals( baseId, dim-1, origins, normals );
    \n-
    296
    \n-
    297 for( unsigned int i = 0; i < 2; ++i )
    \n-
    298 {
    \n-
    299 normals[ numBaseFaces+i ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    300 normals[ numBaseFaces+i ][ dim-1 ] = ct( 2*int( i )-1 );
    \n-
    301 }
    \n-
    302
    \n-
    303 return numBaseFaces+2;
    \n-
    304 }
    \n-
    305 else
    \n-
    306 {
    \n-
    307 normals[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    308 normals[ 0 ][ dim-1 ] = ct( -1 );
    \n-
    309
    \n-
    310 const unsigned int numBaseFaces
    \n-
    311 = referenceIntegrationOuterNormals( baseId, dim-1, origins+1, normals+1 );
    \n-
    312 for( unsigned int i = 1; i <= numBaseFaces; ++i )
    \n-
    313 normals[ i ][ dim-1 ] = normals[ i ]*origins[ i ];
    \n-
    314
    \n-
    315 return numBaseFaces+1;
    \n-
    316 }
    \n-
    317 }
    \n-
    318 else
    \n-
    319 {
    \n-
    320 for( unsigned int i = 0; i < 2; ++i )
    \n-
    321 {
    \n-
    322 normals[ i ] = FieldVector< ct, cdim >( ct( 0 ) );
    \n-
    323 normals[ i ][ 0 ] = ct( 2*int( i )-1 );
    \n-
    324 }
    \n-
    325
    \n-
    326 return 2;
    \n-
    327 }
    \n-
    328 }
    \n+
    221 private:
    \n+
    222 static const bool hasSingleGeometryType = Traits::template hasSingleGeometryType< mydimension >::v;
    \n+
    223
    \n+
    224 protected:
    \n+
    225 typedef typename Traits::MatrixHelper MatrixHelper;
    \n+
    226 typedef typename std::conditional< hasSingleGeometryType, std::integral_constant< unsigned int, Traits::template hasSingleGeometryType< mydimension >::topologyId >, unsigned int >::type TopologyId;
    \n+
    227
    \n+
    228 public:
    \n+
    238 template< class Corners >
    \n+
    \n+\n+
    240 const Corners &corners )
    \n+
    241 : refElement_( refElement ),
    \n+
    242 corners_( corners )
    \n+
    243 {}
    \n+
    \n+
    244
    \n+
    254 template< class Corners >
    \n+
    \n+\n+
    256 const Corners &corners )
    \n+
    257 : refElement_( ReferenceElements::general( gt ) ),
    \n+
    258 corners_( corners )
    \n+
    259 {}
    \n+
    \n+
    260
    \n+
    \n+
    262 bool affine () const
    \n+
    263 {
    \n+\n+
    265 return affine( jt );
    \n+
    266 }
    \n+
    \n+
    267
    \n+
    269 Dune::GeometryType type () const { return GeometryType( toUnsignedInt(topologyId()), mydimension ); }
    \n+
    270
    \n+
    272 int corners () const { return refElement().size( mydimension ); }
    \n+
    273
    \n+
    \n+
    275 GlobalCoordinate corner ( int i ) const
    \n+
    276 {
    \n+
    277 assert( (i >= 0) && (i < corners()) );
    \n+
    278 return std::cref(corners_).get()[ i ];
    \n+
    279 }
    \n+
    \n+
    280
    \n+
    282 GlobalCoordinate center () const { return global( refElement().position( 0, 0 ) ); }
    \n+
    283
    \n+
    \n+\n+
    291 {
    \n+
    292 using std::begin;
    \n+
    293
    \n+
    294 auto cit = begin(std::cref(corners_).get());
    \n+\n+
    296 global< false >( topologyId(), std::integral_constant< int, mydimension >(), cit, ctype( 1 ), local, ctype( 1 ), y );
    \n+
    297 return y;
    \n+
    298 }
    \n+
    \n+
    299
    \n+
    \n+
    312 LocalCoordinate local ( const GlobalCoordinate &globalCoord ) const
    \n+
    313 {
    \n+
    314 const ctype tolerance = Traits::tolerance();
    \n+
    315 LocalCoordinate x = refElement().position( 0, 0 );
    \n+\n+
    317 const bool affineMapping = this->affine();
    \n+
    318 do
    \n+
    319 {
    \n+
    320 // Newton's method: DF^n dx^n = F^n, x^{n+1} -= dx^n
    \n+
    321 const GlobalCoordinate dglobal = (*this).global( x ) - globalCoord;
    \n+
    322 const bool invertible =
    \n+
    323 MatrixHelper::template xTRightInvA< mydimension, coorddimension >( jacobianTransposed( x ), dglobal, dx );
    \n+
    324 if( ! invertible )
    \n+
    325 return LocalCoordinate( std::numeric_limits< ctype > :: max() );
    \n+
    326
    \n+
    327 // update x with correction
    \n+
    328 x -= dx;
    \n
    329
    \n-
    330 template< class ct, int cdim >
    \n-
    331 inline unsigned int
    \n-
    332 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,
    \n-
    333 FieldVector< ct, cdim > *normals )
    \n-
    334 {
    \n-
    335 assert( (dim > 0) && (dim <= cdim) );
    \n-
    336
    \n-
    337 FieldVector< ct, cdim > *origins
    \n-
    338 = new FieldVector< ct, cdim >[ size( topologyId, dim, 1 ) ];
    \n-
    339 referenceOrigins( topologyId, dim, 1, origins );
    \n-
    340
    \n-
    341 const unsigned int numFaces
    \n-
    342 = referenceIntegrationOuterNormals( topologyId, dim, origins, normals );
    \n-
    343 assert( numFaces == size( topologyId, dim, 1 ) );
    \n-
    344
    \n-
    345 delete[] origins;
    \n-
    346
    \n-
    347 return numFaces;
    \n-
    348 }
    \n-
    349
    \n-
    350 } // namespace Impl
    \n-
    351
    \n-
    352
    \n-
    353
    \n-
    354 // ReferenceElement
    \n-
    355 // ----------------
    \n-
    356
    \n-
    375 template< class ctype_, int dim >
    \n-
    376 class ReferenceElementImplementation
    \n-
    377 {
    \n-
    378
    \n-
    379 public:
    \n+
    330 // for affine mappings only one iteration is needed
    \n+
    331 if ( affineMapping ) break;
    \n+
    332 } while( dx.two_norm2() > tolerance );
    \n+
    333 return x;
    \n+
    334 }
    \n+
    \n+
    335
    \n+
    \n+\n+
    351 {
    \n+
    352 return MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >( jacobianTransposed( local ) );
    \n+
    353 }
    \n+
    \n+
    354
    \n+
    \n+
    363 Volume volume () const
    \n+
    364 {
    \n+
    365 return integrationElement( refElement().position( 0, 0 ) ) * refElement().volume();
    \n+
    366 }
    \n+
    \n+
    367
    \n+
    \n+\n+
    378 {
    \n+
    379 using std::begin;
    \n
    380
    \n-
    382 using ctype = ctype_;
    \n-
    383
    \n-
    385 using CoordinateField = ctype;
    \n+\n+
    382 auto cit = begin(std::cref(corners_).get());
    \n+
    383 jacobianTransposed< false >( topologyId(), std::integral_constant< int, mydimension >(), cit, ctype( 1 ), local, ctype( 1 ), jt );
    \n+
    384 return jt;
    \n+
    385 }
    \n+
    \n
    386
    \n-
    388 using Coordinate = Dune::FieldVector<ctype,dim>;
    \n-
    389
    \n-
    391 static constexpr int dimension = dim;
    \n-
    392
    \n-
    394 typedef ctype Volume;
    \n-
    395
    \n-
    396 private:
    \n-
    397
    \n-
    398 friend class Impl::ReferenceElementContainer< ctype, dim >;
    \n+
    \n+
    393 JacobianInverseTransposed jacobianInverseTransposed ( const LocalCoordinate &local ) const;
    \n+
    394
    \n+
    \n+\n+
    396 {
    \n+
    397 return geometry.refElement();
    \n+
    398 }
    \n+
    \n
    399
    \n-
    400 struct SubEntityInfo;
    \n-
    401
    \n-
    402 template< int codim > struct CreateGeometries;
    \n-
    403
    \n-
    404 public:
    \n-
    406 template< int codim >
    \n-
    407 struct Codim
    \n-
    408 {
    \n-
    410 typedef AffineGeometry< ctype, dim-codim, dim > Geometry;
    \n-
    411 };
    \n-
    412
    \n-
    413 // ReferenceElement cannot be copied.
    \n-
    414 ReferenceElementImplementation ( const ReferenceElementImplementation& ) = delete;
    \n-
    415
    \n-
    416 // ReferenceElementImplementation cannot be copied.
    \n-
    417 ReferenceElementImplementation& operator= ( const ReferenceElementImplementation& ) = delete;
    \n-
    418
    \n-
    419 // ReferenceElementImplementation is default-constructible (required for storage in std::array)
    \n-
    420 ReferenceElementImplementation () = default;
    \n-
    421
    \n-
    426 int size ( int c ) const
    \n-
    427 {
    \n-
    428 assert( (c >= 0) && (c <= dim) );
    \n-
    429 return info_[ c ].size();
    \n-
    430 }
    \n-
    431
    \n-
    443 int size ( int i, int c, int cc ) const
    \n-
    444 {
    \n-
    445 assert( (i >= 0) && (i < size( c )) );
    \n-
    446 return info_[ c ][ i ].size( cc );
    \n-
    447 }
    \n-
    448
    \n-
    462 int subEntity ( int i, int c, int ii, int cc ) const
    \n-
    463 {
    \n-
    464 assert( (i >= 0) && (i < size( c )) );
    \n-
    465 return info_[ c ][ i ].number( ii, cc );
    \n-
    466 }
    \n-
    467
    \n-
    483 auto subEntities ( int i, int c, int cc ) const
    \n-
    484 {
    \n-
    485 assert( (i >= 0) && (i < size( c )) );
    \n-
    486 return info_[ c ][ i ].numbers( cc );
    \n-
    487 }
    \n-
    488
    \n-
    497 const GeometryType &type ( int i, int c ) const
    \n-
    498 {
    \n-
    499 assert( (i >= 0) && (i < size( c )) );
    \n-
    500 return info_[ c ][ i ].type();
    \n-
    501 }
    \n-
    502
    \n-
    504 const GeometryType &type () const { return type( 0, 0 ); }
    \n-
    505
    \n-
    515 const Coordinate &position( int i, int c ) const
    \n-
    516 {
    \n-
    517 assert( (c >= 0) && (c <= dim) );
    \n-
    518 return baryCenters_[ c ][ i ];
    \n-
    519 }
    \n-
    520
    \n-
    528 bool checkInside ( const Coordinate &local ) const
    \n-
    529 {
    \n-
    530 const ctype tolerance = ctype( 64 ) * std::numeric_limits< ctype >::epsilon();
    \n-
    531 return Impl::template checkInside< ctype, dim >( type().id(), dim, local, tolerance );
    \n-
    532 }
    \n-
    533
    \n-
    545 template< int codim >
    \n-
    546 typename Codim< codim >::Geometry geometry ( int i ) const
    \n-
    547 {
    \n-
    548 return std::get< codim >( geometries_ )[ i ];
    \n-
    549 }
    \n-
    550
    \n-
    552 Volume volume () const
    \n-
    553 {
    \n-
    554 return volume_;
    \n-
    555 }
    \n-
    556
    \n-
    564 const Coordinate &integrationOuterNormal ( int face ) const
    \n-
    565 {
    \n-
    566 assert( (face >= 0) && (face < int( integrationNormals_.size() )) );
    \n-
    567 return integrationNormals_[ face ];
    \n-
    568 }
    \n-
    569
    \n-
    570 private:
    \n-
    571 void initialize ( unsigned int topologyId )
    \n-
    572 {
    \n-
    573 assert( topologyId < Impl::numTopologies( dim ) );
    \n-
    574
    \n-
    575 // set up subentities
    \n-
    576 for( int codim = 0; codim <= dim; ++codim )
    \n-
    577 {
    \n-
    578 const unsigned int size = Impl::size( topologyId, dim, codim );
    \n-
    579 info_[ codim ].resize( size );
    \n-
    580 for( unsigned int i = 0; i < size; ++i )
    \n-
    581 info_[ codim ][ i ].initialize( topologyId, codim, i );
    \n-
    582 }
    \n-
    583
    \n-
    584 // compute corners
    \n-
    585 const unsigned int numVertices = size( dim );
    \n-
    586 baryCenters_[ dim ].resize( numVertices );
    \n-
    587 Impl::referenceCorners( topologyId, dim, &(baryCenters_[ dim ][ 0 ]) );
    \n-
    588
    \n-
    589 // compute barycenters
    \n-
    590 for( int codim = 0; codim < dim; ++codim )
    \n-
    591 {
    \n-
    592 baryCenters_[ codim ].resize( size(codim) );
    \n-
    593 for( int i = 0; i < size( codim ); ++i )
    \n-
    594 {
    \n-
    595 baryCenters_[ codim ][ i ] = Coordinate( ctype( 0 ) );
    \n-
    596 const unsigned int numCorners = size( i, codim, dim );
    \n-
    597 for( unsigned int j = 0; j < numCorners; ++j )
    \n-
    598 baryCenters_[ codim ][ i ] += baryCenters_[ dim ][ subEntity( i, codim, j, dim ) ];
    \n-
    599 baryCenters_[ codim ][ i ] *= ctype( 1 ) / ctype( numCorners );
    \n-
    600 }
    \n-
    601 }
    \n-
    602
    \n-
    603 // compute reference element volume
    \n-
    604 volume_ = Impl::template referenceVolume< ctype >( topologyId, dim );
    \n-
    605
    \n-
    606 // compute integration outer normals
    \n-
    607 if( dim > 0 )
    \n-
    608 {
    \n-
    609 integrationNormals_.resize( size( 1 ) );
    \n-
    610 Impl::referenceIntegrationOuterNormals( topologyId, dim, &(integrationNormals_[ 0 ]) );
    \n-
    611 }
    \n-
    612
    \n-
    613 // set up geometries
    \n-
    614 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ]( auto i ){ CreateGeometries< i >::apply( *this, geometries_ ); } );
    \n-
    615 }
    \n-
    616
    \n-
    617 template< int... codim >
    \n-
    618 static std::tuple< std::vector< typename Codim< codim >::Geometry >... >
    \n-
    619 makeGeometryTable ( std::integer_sequence< int, codim... > );
    \n-
    620
    \n-
    622 typedef decltype( makeGeometryTable( std::make_integer_sequence< int, dim+1 >() ) ) GeometryTable;
    \n-
    623
    \n-
    625 ctype volume_;
    \n-
    626
    \n-
    627 std::vector< Coordinate > baryCenters_[ dim+1 ];
    \n-
    628 std::vector< Coordinate > integrationNormals_;
    \n-
    629
    \n-
    631 GeometryTable geometries_;
    \n-
    632
    \n-
    633 std::vector< SubEntityInfo > info_[ dim+1 ];
    \n-
    634 };
    \n-
    635
    \n-
    637 template< class ctype, int dim >
    \n-
    638 struct ReferenceElementImplementation< ctype, dim >::SubEntityInfo
    \n-
    639 {
    \n-
    640 // Compute upper bound for the number of subsentities.
    \n-
    641 // If someone knows an explicit formal feel free to
    \n-
    642 // implement it here.
    \n-
    643 static constexpr std::size_t maxSubEntityCount()
    \n-
    644 {
    \n-
    645 std::size_t maxCount=0;
    \n-
    646 for(std::size_t codim=0; codim<=dim; ++codim)
    \n-
    647 maxCount = std::max(maxCount, binomial(std::size_t(dim),codim)*(1 << codim));
    \n-
    648 return maxCount;
    \n-
    649 }
    \n-
    650
    \n-
    651 using SubEntityFlags = std::bitset<maxSubEntityCount()>;
    \n-
    652
    \n-
    653 class SubEntityRange
    \n-
    654 : public Dune::IteratorRange<const unsigned int*>
    \n-
    655 {
    \n-
    656 using Base = typename Dune::IteratorRange<const unsigned int*>;
    \n-
    657
    \n-
    658 public:
    \n-
    659
    \n-
    660 using iterator = Base::iterator;
    \n-
    661 using const_iterator = Base::const_iterator;
    \n-
    662
    \n-
    663 SubEntityRange(const iterator& begin, const iterator& end, const SubEntityFlags& contains) :
    \n-
    664 Base(begin, end),
    \n-
    665 containsPtr_(&contains),
    \n-
    666 size_(end-begin)
    \n-
    667 {}
    \n-
    668
    \n-
    669 SubEntityRange() :
    \n-
    670 Base(),
    \n-
    671 containsPtr_(nullptr),
    \n-
    672 size_(0)
    \n-
    673 {}
    \n-
    674
    \n-
    675 std::size_t size() const
    \n-
    676 {
    \n-
    677 return size_;
    \n-
    678 }
    \n-
    679
    \n-
    680 bool contains(std::size_t i) const
    \n-
    681 {
    \n-
    682 return (*containsPtr_)[i];
    \n-
    683 }
    \n-
    684
    \n-
    685 private:
    \n-
    686 const SubEntityFlags* containsPtr_;
    \n-
    687 std::size_t size_;
    \n-
    688 std::size_t offset_;
    \n-
    689 };
    \n-
    690
    \n-
    691 using NumberRange = typename Dune::IteratorRange<const unsigned int*>;
    \n-
    692
    \n-
    693 SubEntityInfo ()
    \n-
    694 : numbering_( nullptr )
    \n-
    695 {
    \n-
    696 std::fill( offset_.begin(), offset_.end(), 0 );
    \n-
    697 }
    \n-
    698
    \n-
    699 SubEntityInfo ( const SubEntityInfo &other )
    \n-
    700 : offset_( other.offset_ ),
    \n-
    701 type_( other.type_ ),
    \n-
    702 containsSubentity_( other.containsSubentity_ )
    \n-
    703 {
    \n-
    704 numbering_ = allocate();
    \n-
    705 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
    \n-
    706 }
    \n-
    707
    \n-
    708 ~SubEntityInfo () { deallocate( numbering_ ); }
    \n-
    709
    \n-
    710 const SubEntityInfo &operator= ( const SubEntityInfo &other )
    \n-
    711 {
    \n-
    712 type_ = other.type_;
    \n-
    713 offset_ = other.offset_;
    \n-
    714
    \n-
    715 deallocate( numbering_ );
    \n-
    716 numbering_ = allocate();
    \n-
    717 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
    \n-
    718
    \n-
    719 containsSubentity_ = other.containsSubentity_;
    \n+
    400
    \n+
    \n+\n+
    408 {
    \n+
    409 return jacobianTransposed(local).transposed();
    \n+
    410 }
    \n+
    \n+
    411
    \n+
    \n+\n+
    419 {
    \n+
    420 return jacobianInverseTransposed(local).transposed();
    \n+
    421 }
    \n+
    \n+
    422
    \n+
    423 protected:
    \n+
    424
    \n+
    \n+\n+
    426 {
    \n+
    427 return refElement_;
    \n+
    428 }
    \n+
    \n+
    429
    \n+
    \n+\n+
    431 {
    \n+
    432 return topologyId( std::integral_constant< bool, hasSingleGeometryType >() );
    \n+
    433 }
    \n+
    \n+
    434
    \n+
    435 template< bool add, int dim, class CornerIterator >
    \n+
    \n+
    436 static void global ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n+
    437 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    438 const ctype &rf, GlobalCoordinate &y );
    \n+
    439 template< bool add, class CornerIterator >
    \n+
    \n+
    440 static void global ( TopologyId topologyId, std::integral_constant< int, 0 >,
    \n+
    441 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    442 const ctype &rf, GlobalCoordinate &y );
    \n+
    443
    \n+
    444 template< bool add, int rows, int dim, class CornerIterator >
    \n+
    \n+
    445 static void jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n+
    446 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    447 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt );
    \n+
    448 template< bool add, int rows, class CornerIterator >
    \n+
    \n+
    449 static void jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, 0 >,
    \n+
    450 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    451 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt );
    \n+
    452
    \n+
    453 template< int dim, class CornerIterator >
    \n+
    \n+
    454 static bool affine ( TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt );
    \n+
    455 template< class CornerIterator >
    \n+
    \n+
    456 static bool affine ( TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed &jt );
    \n+
    457
    \n+
    \n+
    458 bool affine ( JacobianTransposed &jacobianT ) const
    \n+
    459 {
    \n+
    460 using std::begin;
    \n+
    461
    \n+
    462 auto cit = begin(std::cref(corners_).get());
    \n+
    463 return affine( topologyId(), std::integral_constant< int, mydimension >(), cit, jacobianT );
    \n+
    464 }
    \n+
    \n+
    465
    \n+
    466 private:
    \n+
    467 // The following methods are needed to convert the return type of topologyId to
    \n+
    468 // unsigned int with g++-4.4. It has problems casting integral_constant to the
    \n+
    469 // integral type.
    \n+
    470 static unsigned int toUnsignedInt(unsigned int i) { return i; }
    \n+
    471 template<unsigned int v>
    \n+
    472 static unsigned int toUnsignedInt(std::integral_constant<unsigned int,v> ) { return v; }
    \n+
    473 TopologyId topologyId ( std::integral_constant< bool, true > ) const { return TopologyId(); }
    \n+
    474 unsigned int topologyId ( std::integral_constant< bool, false > ) const { return refElement().type().id(); }
    \n+
    475
    \n+
    476 ReferenceElement refElement_;
    \n+
    477 typename Traits::template CornerStorage< mydimension, coorddimension >::Type corners_;
    \n+
    478 };
    \n+
    479
    \n+
    480
    \n+
    481
    \n+
    482 // MultiLinearGeometry::JacobianInverseTransposed
    \n+
    483 // ----------------------------------------------
    \n+
    484
    \n+
    485 template< class ct, int mydim, int cdim, class Traits >
    \n+
    \n+
    486 class MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
    \n+
    487 : public FieldMatrix< ctype, coorddimension, mydimension >
    \n+
    488 {
    \n+
    489 typedef FieldMatrix< ctype, coorddimension, mydimension > Base;
    \n+
    490
    \n+
    491 public:
    \n+
    \n+
    492 void setup ( const JacobianTransposed &jt )
    \n+
    493 {
    \n+
    494 detInv_ = MatrixHelper::template rightInvA< mydimension, coorddimension >( jt, static_cast< Base & >( *this ) );
    \n+
    495 }
    \n+
    \n+
    496
    \n+
    \n+\n+
    498 {
    \n+
    499 detInv_ = MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >( jt );
    \n+
    500 }
    \n+
    \n+
    501
    \n+
    502 ctype det () const { return ctype( 1 ) / detInv_; }
    \n+
    503 ctype detInv () const { return detInv_; }
    \n+
    504
    \n+
    505 private:
    \n+
    506 ctype detInv_;
    \n+
    507 };
    \n+
    \n+
    508
    \n+
    509
    \n+
    510
    \n+
    523 template< class ct, int mydim, int cdim, class Traits = MultiLinearGeometryTraits< ct > >
    \n+
    \n+\n+
    525 : public MultiLinearGeometry< ct, mydim, cdim, Traits >
    \n+
    526 {
    \n+\n+\n+
    529
    \n+
    530 protected:
    \n+\n+
    532
    \n+
    533 public:
    \n+\n+
    535
    \n+
    536 typedef typename Base::ctype ctype;
    \n+
    537
    \n+
    538 using Base::mydimension;
    \n+\n+
    540
    \n+\n+\n+
    543 typedef typename Base::Volume Volume;
    \n+
    544
    \n+\n+\n+
    547 typedef typename Base::Jacobian Jacobian;
    \n+\n+
    549
    \n+
    550 template< class CornerStorage >
    \n+
    \n+
    551 CachedMultiLinearGeometry ( const ReferenceElement &referenceElement, const CornerStorage &cornerStorage )
    \n+
    552 : Base( referenceElement, cornerStorage ),
    \n+
    553 affine_( Base::affine( jacobianTransposed_ ) ),
    \n+
    554 jacobianInverseTransposedComputed_( false ),
    \n+
    555 integrationElementComputed_( false )
    \n+
    556 {}
    \n+
    \n+
    557
    \n+
    558 template< class CornerStorage >
    \n+
    \n+
    559 CachedMultiLinearGeometry ( Dune::GeometryType gt, const CornerStorage &cornerStorage )
    \n+
    560 : Base( gt, cornerStorage ),
    \n+
    561 affine_( Base::affine( jacobianTransposed_ ) ),
    \n+
    562 jacobianInverseTransposedComputed_( false ),
    \n+
    563 integrationElementComputed_( false )
    \n+
    564 {}
    \n+
    \n+
    565
    \n+
    567 bool affine () const { return affine_; }
    \n+
    568
    \n+
    569 using Base::corner;
    \n+
    570
    \n+
    572 GlobalCoordinate center () const { return global( refElement().position( 0, 0 ) ); }
    \n+
    573
    \n+
    \n+\n+
    581 {
    \n+
    582 if( affine() )
    \n+
    583 {
    \n+\n+
    585 jacobianTransposed_.umtv( local, global );
    \n+
    586 return global;
    \n+
    587 }
    \n+
    588 else
    \n+
    589 return Base::global( local );
    \n+
    590 }
    \n+
    \n+
    591
    \n+
    \n+\n+
    605 {
    \n+
    606 if( affine() )
    \n+
    607 {
    \n+\n+
    609 if( jacobianInverseTransposedComputed_ )
    \n+
    610 jacobianInverseTransposed_.mtv( global - corner( 0 ), local );
    \n+
    611 else
    \n+
    612 MatrixHelper::template xTRightInvA< mydimension, coorddimension >( jacobianTransposed_, global - corner( 0 ), local );
    \n+
    613 return local;
    \n+
    614 }
    \n+
    615 else
    \n+
    616 return Base::local( global );
    \n+
    617 }
    \n+
    \n+
    618
    \n+
    \n+\n+
    634 {
    \n+
    635 if( affine() )
    \n+
    636 {
    \n+
    637 if( !integrationElementComputed_ )
    \n+
    638 {
    \n+
    639 jacobianInverseTransposed_.setupDeterminant( jacobianTransposed_ );
    \n+
    640 integrationElementComputed_ = true;
    \n+
    641 }
    \n+
    642 return jacobianInverseTransposed_.detInv();
    \n+
    643 }
    \n+
    644 else
    \n+\n+
    646 }
    \n+
    \n+
    647
    \n+
    \n+
    649 Volume volume () const
    \n+
    650 {
    \n+
    651 if( affine() )
    \n+
    652 return integrationElement( refElement().position( 0, 0 ) ) * refElement().volume();
    \n+
    653 else
    \n+
    654 return Base::volume();
    \n+
    655 }
    \n+
    \n+
    656
    \n+
    \n+\n+
    667 {
    \n+
    668 if( affine() )
    \n+
    669 return jacobianTransposed_;
    \n+
    670 else
    \n+\n+
    672 }
    \n+
    \n+
    673
    \n+
    \n+\n+
    681 {
    \n+
    682 if( affine() )
    \n+
    683 {
    \n+
    684 if( !jacobianInverseTransposedComputed_ )
    \n+
    685 {
    \n+
    686 jacobianInverseTransposed_.setup( jacobianTransposed_ );
    \n+
    687 jacobianInverseTransposedComputed_ = true;
    \n+
    688 integrationElementComputed_ = true;
    \n+
    689 }
    \n+
    690 return jacobianInverseTransposed_;
    \n+
    691 }
    \n+
    692 else
    \n+\n+
    694 }
    \n+
    \n+
    695
    \n+
    \n+\n+
    703 {
    \n+
    704 return jacobianTransposed(local).transposed();
    \n+
    705 }
    \n+
    \n+
    706
    \n+
    \n+\n+
    714 {
    \n+
    715 return jacobianInverseTransposed(local).transposed();
    \n+
    716 }
    \n+
    \n+
    717
    \n+
    718 protected:
    \n+
    719 using Base::refElement;
    \n
    720
    \n-
    721 return *this;
    \n-
    722 }
    \n-
    723
    \n-
    724 int size ( int cc ) const
    \n-
    725 {
    \n-
    726 assert( (cc >= 0) && (cc <= dim) );
    \n-
    727 return (offset_[ cc+1 ] - offset_[ cc ]);
    \n-
    728 }
    \n-
    729
    \n-
    730 int number ( int ii, int cc ) const
    \n-
    731 {
    \n-
    732 assert( (ii >= 0) && (ii < size( cc )) );
    \n-
    733 return numbering_[ offset_[ cc ] + ii ];
    \n-
    734 }
    \n+
    721 private:
    \n+
    722 mutable JacobianTransposed jacobianTransposed_;
    \n+
    723 mutable JacobianInverseTransposed jacobianInverseTransposed_;
    \n+
    724
    \n+
    725 mutable bool affine_ : 1;
    \n+
    726
    \n+
    727 mutable bool jacobianInverseTransposedComputed_ : 1;
    \n+
    728 mutable bool integrationElementComputed_ : 1;
    \n+
    729 };
    \n+
    \n+
    730
    \n+
    731
    \n+
    732
    \n+
    733 // Implementation of MultiLinearGeometry
    \n+
    734 // -------------------------------------
    \n
    735
    \n-
    736 auto numbers ( int cc ) const
    \n-
    737 {
    \n-
    738 return SubEntityRange( numbering_ + offset_[ cc ], numbering_ + offset_[ cc+1 ], containsSubentity_[cc]);
    \n-
    739 }
    \n-
    740
    \n-
    741 const GeometryType &type () const { return type_; }
    \n-
    742
    \n-
    743 void initialize ( unsigned int topologyId, int codim, unsigned int i )
    \n-
    744 {
    \n-
    745 const unsigned int subId = Impl::subTopologyId( topologyId, dim, codim, i );
    \n-
    746 type_ = GeometryType( subId, dim-codim );
    \n-
    747
    \n-
    748 // compute offsets
    \n-
    749 for( int cc = 0; cc <= codim; ++cc )
    \n-
    750 offset_[ cc ] = 0;
    \n-
    751 for( int cc = codim; cc <= dim; ++cc )
    \n-
    752 offset_[ cc+1 ] = offset_[ cc ] + Impl::size( subId, dim-codim, cc-codim );
    \n-
    753
    \n-
    754 // compute subnumbering
    \n-
    755 deallocate( numbering_ );
    \n-
    756 numbering_ = allocate();
    \n-
    757 for( int cc = codim; cc <= dim; ++cc )
    \n-
    758 Impl::subTopologyNumbering( topologyId, dim, codim, i, cc-codim, numbering_+offset_[ cc ], numbering_+offset_[ cc+1 ] );
    \n-
    759
    \n-
    760 // initialize containsSubentity lookup-table
    \n-
    761 for(std::size_t cc=0; cc<= dim; ++cc)
    \n-
    762 {
    \n-
    763 containsSubentity_[cc].reset();
    \n-
    764 for(std::size_t idx=0; idx<std::size_t(size(cc)); ++idx)
    \n-
    765 containsSubentity_[cc][number(idx,cc)] = true;
    \n-
    766 }
    \n-
    767 }
    \n-
    768
    \n-
    769 protected:
    \n-
    770 int codim () const { return dim - type().dim(); }
    \n-
    771
    \n-
    772 unsigned int *allocate () { return (capacity() != 0 ? new unsigned int[ capacity() ] : nullptr); }
    \n-
    773 void deallocate ( unsigned int *ptr ) { delete[] ptr; }
    \n-
    774 unsigned int capacity () const { return offset_[ dim+1 ]; }
    \n-
    775
    \n-
    776 private:
    \n-
    777 unsigned int *numbering_;
    \n-
    778 std::array< unsigned int, dim+2 > offset_;
    \n-
    779 GeometryType type_;
    \n-
    780 std::array< SubEntityFlags, dim+1> containsSubentity_;
    \n-
    781 };
    \n-
    782
    \n-
    783
    \n-
    784 template< class ctype, int dim >
    \n-
    785 template< int codim >
    \n-
    786 struct ReferenceElementImplementation< ctype, dim >::CreateGeometries
    \n-
    787 {
    \n-
    788 template< int cc >
    \n-
    789 static typename ReferenceElements< ctype, dim-cc >::ReferenceElement
    \n-
    790 subRefElement( const ReferenceElementImplementation< ctype, dim > &refElement, int i, std::integral_constant< int, cc > )
    \n-
    791 {
    \n-
    792 return ReferenceElements< ctype, dim-cc >::general( refElement.type( i, cc ) );
    \n-
    793 }
    \n-
    794
    \n-\n-
    796 subRefElement(const ReferenceElementImplementation< ctype, dim > &refElement,
    \n-
    797 [[maybe_unused]] int i, std::integral_constant<int, 0>)
    \n-
    798 {
    \n-
    799 return refElement;
    \n-
    800 }
    \n-
    801
    \n-
    802 static void apply ( const ReferenceElementImplementation< ctype, dim > &refElement, GeometryTable &geometries )
    \n-
    803 {
    \n-
    804 const int size = refElement.size( codim );
    \n-
    805 std::vector< FieldVector< ctype, dim > > origins( size );
    \n-
    806 std::vector< FieldMatrix< ctype, dim - codim, dim > > jacobianTransposeds( size );
    \n-
    807 Impl::referenceEmbeddings( refElement.type().id(), dim, codim, &(origins[ 0 ]), &(jacobianTransposeds[ 0 ]) );
    \n-
    808
    \n-
    809 std::get< codim >( geometries ).reserve( size );
    \n-
    810 for( int i = 0; i < size; ++i )
    \n-
    811 {
    \n-
    812 typename Codim< codim >::Geometry geometry( subRefElement( refElement, i, std::integral_constant< int, codim >() ), origins[ i ], jacobianTransposeds[ i ] );
    \n-
    813 std::get< codim >( geometries ).push_back( geometry );
    \n-
    814 }
    \n-
    815 }
    \n-
    816 };
    \n-
    817
    \n-
    818#endif // DOXYGEN
    \n-
    819
    \n-
    820 } // namespace Geo
    \n-
    821
    \n-
    822} // namespace Dune
    \n-
    823
    \n-
    824#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH
    \n-
    An implementation of the Geometry interface for affine geometries.
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n+
    736 template< class ct, int mydim, int cdim, class Traits >
    \n+
    737 inline typename MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
    \n+
    \n+\n+
    739 {
    \n+\n+
    741 jit.setup( jacobianTransposed( local ) );
    \n+
    742 return jit;
    \n+
    743 }
    \n+
    \n+
    744
    \n+
    745
    \n+
    746 template< class ct, int mydim, int cdim, class Traits >
    \n+
    747 template< bool add, int dim, class CornerIterator >
    \n+\n+
    \n+
    749 ::global ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n+
    750 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    751 const ctype &rf, GlobalCoordinate &y )
    \n+
    752 {
    \n+
    753 const ctype xn = df*x[ dim-1 ];
    \n+
    754 const ctype cxn = ctype( 1 ) - xn;
    \n+
    755
    \n+
    756 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n+
    757 {
    \n+
    758 // apply (1-xn) times mapping for bottom
    \n+
    759 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf*cxn, y );
    \n+
    760 // apply xn times mapping for top
    \n+
    761 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf*xn, y );
    \n+
    762 }
    \n+
    763 else
    \n+
    764 {
    \n+
    765 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension, mydimension-dim ) );
    \n+
    766 // apply (1-xn) times mapping for bottom (with argument x/(1-xn))
    \n+
    767 if( cxn > Traits::tolerance() || cxn < -Traits::tolerance() )
    \n+
    768 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df/cxn, x, rf*cxn, y );
    \n+
    769 else
    \n+
    770 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, ctype( 0 ), y );
    \n+
    771 // apply xn times the tip
    \n+
    772 y.axpy( rf*xn, *cit );
    \n+
    773 ++cit;
    \n+
    774 }
    \n+
    775 }
    \n+
    \n+
    776
    \n+
    777 template< class ct, int mydim, int cdim, class Traits >
    \n+
    778 template< bool add, class CornerIterator >
    \n+\n+
    \n+
    780 ::global ( TopologyId, std::integral_constant< int, 0 >,
    \n+
    781 CornerIterator &cit, const ctype &, const LocalCoordinate &,
    \n+
    782 const ctype &rf, GlobalCoordinate &y )
    \n+
    783 {
    \n+
    784 const GlobalCoordinate &origin = *cit;
    \n+
    785 ++cit;
    \n+
    786 for( int i = 0; i < coorddimension; ++i )
    \n+
    787 y[ i ] = (add ? y[ i ] + rf*origin[ i ] : rf*origin[ i ]);
    \n+
    788 }
    \n+
    \n+
    789
    \n+
    790
    \n+
    791 template< class ct, int mydim, int cdim, class Traits >
    \n+
    792 template< bool add, int rows, int dim, class CornerIterator >
    \n+\n+
    \n+
    794 ::jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n+
    795 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n+
    796 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt )
    \n+
    797 {
    \n+
    798 assert( rows >= dim );
    \n+
    799
    \n+
    800 const ctype xn = df*x[ dim-1 ];
    \n+
    801 const ctype cxn = ctype( 1 ) - xn;
    \n+
    802
    \n+
    803 auto cit2( cit );
    \n+
    804 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n+
    805 {
    \n+
    806 // apply (1-xn) times Jacobian for bottom
    \n+
    807 jacobianTransposed< add >( topologyId, std::integral_constant< int, dim-1 >(), cit2, df, x, rf*cxn, jt );
    \n+
    808 // apply xn times Jacobian for top
    \n+
    809 jacobianTransposed< true >( topologyId, std::integral_constant< int, dim-1 >(), cit2, df, x, rf*xn, jt );
    \n+
    810 // compute last row as difference between top value and bottom value
    \n+
    811 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, -rf, jt[ dim-1 ] );
    \n+
    812 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf, jt[ dim-1 ] );
    \n+
    813 }
    \n+
    814 else
    \n+
    815 {
    \n+
    816 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension, mydimension-dim ) );
    \n+
    817 /*
    \n+
    818 * In the pyramid case, we need a transformation Tb: B -> R^n for the
    \n+
    819 * base B \\subset R^{n-1}. The pyramid transformation is then defined as
    \n+
    820 * T: P \\subset R^n -> R^n
    \n+
    821 * (x, xn) |-> (1-xn) Tb(x*) + xn t (x \\in R^{n-1}, xn \\in R)
    \n+
    822 * with the tip of the pyramid mapped to t and x* = x/(1-xn)
    \n+
    823 * the projection of (x,xn) onto the base.
    \n+
    824 *
    \n+
    825 * For the Jacobi matrix DT we get
    \n+
    826 * DT = ( A | b )
    \n+
    827 * with A = DTb(x*) (n x n-1 matrix)
    \n+
    828 * and b = dT/dxn (n-dim column vector).
    \n+
    829 * Furthermore
    \n+
    830 * b = -Tb(x*) + t + \\sum_i dTb/dx_i(x^*) x_i/(1-xn)
    \n+
    831 *
    \n+
    832 * Note that both A and b are not defined in the pyramid tip (x=0, xn=1)!
    \n+
    833 * Indeed for B the unit square, Tb mapping B to the quadrilateral given
    \n+
    834 * by the vertices (0,0,0), (2,0,0), (0,1,0), (1,1,0) and t=(0,0,1), we get
    \n+
    835 *
    \n+
    836 * T(x,y,xn) = ( x(2-y/(1-xn)), y, xn )
    \n+
    837 * / 2-y/(1-xn) -x 0 \\
    \n+
    838 * DT(x,y,xn) = | 0 1 0 |
    \n+
    839 * \\ 0 0 1 /
    \n+
    840 * which is not continuous for xn -> 1, choose for example
    \n+
    841 * x=0, y=1-xn, xn -> 1 --> DT -> diag(1,1,1)
    \n+
    842 * x=1-xn, y=0, xn -> 1 --> DT -> diag(2,1,1)
    \n+
    843 *
    \n+
    844 * However, for Tb affine-linear, Tb(y) = My + y0, DTb = M:
    \n+
    845 * A = M
    \n+
    846 * b = -M x* - y0 + t + \\sum_i M_i x_i/(1-xn)
    \n+
    847 * = -M x* - y0 + t + M x*
    \n+
    848 * = -y0 + t
    \n+
    849 * which is continuous for xn -> 1. Note that this b is also given by
    \n+
    850 * b = -Tb(0) + t + \\sum_i dTb/dx_i(0) x_i/1
    \n+
    851 * that is replacing x* by 1 and 1-xn by 1 in the formular above.
    \n+
    852 *
    \n+
    853 * For xn -> 1, we can thus set x*=0, "1-xn"=1 (or anything != 0) and get
    \n+
    854 * the right result in case Tb is affine-linear.
    \n+
    855 */
    \n+
    856
    \n+
    857 /* The second case effectively results in x* = 0 */
    \n+
    858 ctype dfcxn = (cxn > Traits::tolerance() || cxn < -Traits::tolerance()) ? ctype(df / cxn) : ctype(0);
    \n+
    859
    \n+
    860 // initialize last row
    \n+
    861 // b = -Tb(x*)
    \n+
    862 // (b = -Tb(0) = -y0 in case xn -> 1 and Tb affine-linear)
    \n+
    863 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, dfcxn, x, -rf, jt[ dim-1 ] );
    \n+
    864 // b += t
    \n+
    865 jt[ dim-1 ].axpy( rf, *cit );
    \n+
    866 ++cit;
    \n+
    867 // apply Jacobian for bottom (with argument x/(1-xn)) and correct last row
    \n+
    868 if( add )
    \n+
    869 {
    \n+
    870 FieldMatrix< ctype, dim-1, coorddimension > jt2;
    \n+
    871 // jt2 = dTb/dx_i(x*)
    \n+
    872 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-1 >(), cit2, dfcxn, x, rf, jt2 );
    \n+
    873 // A = dTb/dx_i(x*) (jt[j], j=0..dim-1)
    \n+
    874 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn) (jt[dim-1])
    \n+
    875 // (b += 0 in case xn -> 1)
    \n+
    876 for( int j = 0; j < dim-1; ++j )
    \n+
    877 {
    \n+
    878 jt[ j ] += jt2[ j ];
    \n+
    879 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt2[ j ] );
    \n+
    880 }
    \n+
    881 }
    \n+
    882 else
    \n+
    883 {
    \n+
    884 // jt = dTb/dx_i(x*)
    \n+
    885 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-1 >(), cit2, dfcxn, x, rf, jt );
    \n+
    886 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn)
    \n+
    887 for( int j = 0; j < dim-1; ++j )
    \n+
    888 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt[ j ] );
    \n+
    889 }
    \n+
    890 }
    \n+
    891 }
    \n+
    \n+
    892
    \n+
    893 template< class ct, int mydim, int cdim, class Traits >
    \n+
    894 template< bool add, int rows, class CornerIterator >
    \n+\n+
    \n+
    896 ::jacobianTransposed ( TopologyId, std::integral_constant< int, 0 >,
    \n+
    897 CornerIterator &cit, const ctype &, const LocalCoordinate &,
    \n+
    898 const ctype &, FieldMatrix< ctype, rows, cdim > & )
    \n+
    899 {
    \n+
    900 ++cit;
    \n+
    901 }
    \n+
    \n+
    902
    \n+
    903
    \n+
    904
    \n+
    905 template< class ct, int mydim, int cdim, class Traits >
    \n+
    906 template< int dim, class CornerIterator >
    \n+\n+
    \n+
    908 ::affine ( TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt )
    \n+
    909 {
    \n+
    910 const GlobalCoordinate &orgBottom = *cit;
    \n+
    911 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jt ) )
    \n+
    912 return false;
    \n+
    913 const GlobalCoordinate &orgTop = *cit;
    \n+
    914
    \n+
    915 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n+
    916 {
    \n+
    917 JacobianTransposed jtTop;
    \n+
    918 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jtTop ) )
    \n+
    919 return false;
    \n+
    920
    \n+
    921 // check whether both jacobians are identical
    \n+
    922 ctype norm( 0 );
    \n+
    923 for( int i = 0; i < dim-1; ++i )
    \n+
    924 norm += (jtTop[ i ] - jt[ i ]).two_norm2();
    \n+
    925 if( norm >= Traits::tolerance() )
    \n+
    926 return false;
    \n+
    927 }
    \n+
    928 else
    \n+
    929 ++cit;
    \n+
    930 jt[ dim-1 ] = orgTop - orgBottom;
    \n+
    931 return true;
    \n+
    932 }
    \n+
    \n+
    933
    \n+
    934 template< class ct, int mydim, int cdim, class Traits >
    \n+
    935 template< class CornerIterator >
    \n+\n+
    \n+
    937 ::affine ( TopologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed & )
    \n+
    938 {
    \n+
    939 ++cit;
    \n+
    940 return true;
    \n+
    941 }
    \n+
    \n+
    \n+
    942
    \n+
    943} // namespace Dune
    \n+
    944
    \n+
    945#endif // #ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n+
    \n+
    \n+
    \n+
    \n+
    \n+
    \n+
    \n+
    An implementation of the Geometry interface for affine geometries.
    \n+\n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    @ size
    Definition quadraturerules.hh:194
    \n+
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n-
    static const ReferenceElement & general(const GeometryType &type)
    get general reference elements
    Definition referenceelements.hh:156
    \n+
    default traits class for MultiLinearGeometry
    Definition multilineargeometry.hh:39
    \n+
    Impl::FieldMatrixHelper< ct > MatrixHelper
    helper structure containing some matrix routines
    Definition multilineargeometry.hh:58
    \n+
    static ct tolerance()
    tolerance to numerical algorithms
    Definition multilineargeometry.hh:61
    \n+
    template specifying the storage for the corners
    Definition multilineargeometry.hh:129
    \n+
    std::vector< FieldVector< ct, cdim > > Type
    Definition multilineargeometry.hh:130
    \n+
    will there be only one geometry type for a dimension?
    Definition multilineargeometry.hh:148
    \n+
    static const unsigned int topologyId
    Definition multilineargeometry.hh:150
    \n+
    static const bool v
    Definition multilineargeometry.hh:149
    \n+
    generic geometry implementation based on corner coordinates
    Definition multilineargeometry.hh:181
    \n+
    static void global(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, GlobalCoordinate &y)
    Definition multilineargeometry.hh:749
    \n+
    static const int mydimension
    geometry dimension
    Definition multilineargeometry.hh:189
    \n+
    Dune::GeometryType type() const
    obtain the name of the reference element
    Definition multilineargeometry.hh:269
    \n+
    Traits::MatrixHelper MatrixHelper
    Definition multilineargeometry.hh:225
    \n+
    FieldVector< ctype, coorddimension > GlobalCoordinate
    type of global coordinates
    Definition multilineargeometry.hh:196
    \n+
    static void jacobianTransposed(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)
    Definition multilineargeometry.hh:896
    \n+
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian
    Definition multilineargeometry.hh:377
    \n+
    ReferenceElement refElement() const
    Definition multilineargeometry.hh:425
    \n+
    GlobalCoordinate global(const LocalCoordinate &local) const
    evaluate the mapping
    Definition multilineargeometry.hh:290
    \n+
    GlobalCoordinate center() const
    obtain the centroid of the mapping's image
    Definition multilineargeometry.hh:282
    \n+
    GlobalCoordinate corner(int i) const
    obtain coordinates of the i-th corner
    Definition multilineargeometry.hh:275
    \n+
    Dune::ReferenceElements< ctype, mydimension > ReferenceElements
    Definition multilineargeometry.hh:214
    \n+
    ct ctype
    coordinate type
    Definition multilineargeometry.hh:186
    \n+
    static void jacobianTransposed(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)
    Definition multilineargeometry.hh:794
    \n+
    static const int coorddimension
    coordinate dimension
    Definition multilineargeometry.hh:191
    \n+
    int corners() const
    obtain number of corners of the corresponding reference element
    Definition multilineargeometry.hh:272
    \n+
    TopologyId topologyId() const
    Definition multilineargeometry.hh:430
    \n+
    friend ReferenceElement referenceElement(const MultiLinearGeometry &geometry)
    Definition multilineargeometry.hh:395
    \n+
    LocalCoordinate local(const GlobalCoordinate &globalCoord) const
    evaluate the inverse mapping
    Definition multilineargeometry.hh:312
    \n+
    static void global(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, GlobalCoordinate &y)
    Definition multilineargeometry.hh:780
    \n+
    Volume volume() const
    obtain the volume of the mapping's image
    Definition multilineargeometry.hh:363
    \n+
    FieldVector< ctype, mydimension > LocalCoordinate
    type of local coordinates
    Definition multilineargeometry.hh:194
    \n+
    MultiLinearGeometry(const ReferenceElement &refElement, const Corners &corners)
    constructor
    Definition multilineargeometry.hh:239
    \n+
    static bool affine(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed &jt)
    Definition multilineargeometry.hh:937
    \n+
    std::conditional< hasSingleGeometryType, std::integral_constant< unsignedint, Traits::templatehasSingleGeometryType< mydimension >::topologyId >, unsignedint >::type TopologyId
    Definition multilineargeometry.hh:226
    \n+
    ctype Volume
    type of volume
    Definition multilineargeometry.hh:198
    \n+
    static bool affine(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt)
    Definition multilineargeometry.hh:908
    \n+
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Obtain the Jacobian's inverse.
    Definition multilineargeometry.hh:418
    \n+
    MultiLinearGeometry(Dune::GeometryType gt, const Corners &corners)
    constructor
    Definition multilineargeometry.hh:255
    \n+
    FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed
    type of jacobian transposed
    Definition multilineargeometry.hh:201
    \n+
    ReferenceElements::ReferenceElement ReferenceElement
    type of reference element
    Definition multilineargeometry.hh:219
    \n+
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian's inverse
    Definition multilineargeometry.hh:738
    \n+
    FieldMatrix< ctype, coorddimension, mydimension > Jacobian
    Type for the Jacobian matrix.
    Definition multilineargeometry.hh:207
    \n+
    bool affine() const
    is this mapping affine?
    Definition multilineargeometry.hh:262
    \n+
    FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse
    Type for the inverse Jacobian matrix.
    Definition multilineargeometry.hh:210
    \n+
    bool affine(JacobianTransposed &jacobianT) const
    Definition multilineargeometry.hh:458
    \n+
    Volume integrationElement(const LocalCoordinate &local) const
    obtain the integration element
    Definition multilineargeometry.hh:350
    \n+
    Jacobian jacobian(const LocalCoordinate &local) const
    Obtain the Jacobian.
    Definition multilineargeometry.hh:407
    \n+
    Definition multilineargeometry.hh:488
    \n+
    void setup(const JacobianTransposed &jt)
    Definition multilineargeometry.hh:492
    \n+
    ctype det() const
    Definition multilineargeometry.hh:502
    \n+
    ctype detInv() const
    Definition multilineargeometry.hh:503
    \n+
    void setupDeterminant(const JacobianTransposed &jt)
    Definition multilineargeometry.hh:497
    \n+
    Implement a MultiLinearGeometry with additional caching.
    Definition multilineargeometry.hh:526
    \n+
    GlobalCoordinate global(const LocalCoordinate &local) const
    evaluate the mapping
    Definition multilineargeometry.hh:580
    \n+
    Base::ReferenceElement ReferenceElement
    Definition multilineargeometry.hh:534
    \n+
    bool affine() const
    is this mapping affine?
    Definition multilineargeometry.hh:567
    \n+
    CachedMultiLinearGeometry(const ReferenceElement &referenceElement, const CornerStorage &cornerStorage)
    Definition multilineargeometry.hh:551
    \n+
    ReferenceElement refElement() const
    Definition multilineargeometry.hh:425
    \n+
    LocalCoordinate local(const GlobalCoordinate &global) const
    evaluate the inverse mapping
    Definition multilineargeometry.hh:604
    \n+
    Base::MatrixHelper MatrixHelper
    Definition multilineargeometry.hh:531
    \n+
    Base::LocalCoordinate LocalCoordinate
    Definition multilineargeometry.hh:541
    \n+
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Obtain the Jacobian's inverse.
    Definition multilineargeometry.hh:713
    \n+
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian
    Definition multilineargeometry.hh:666
    \n+
    GlobalCoordinate corner(int i) const
    obtain coordinates of the i-th corner
    Definition multilineargeometry.hh:275
    \n+
    Volume volume() const
    obtain the volume of the mapping's image
    Definition multilineargeometry.hh:649
    \n+
    CachedMultiLinearGeometry(Dune::GeometryType gt, const CornerStorage &cornerStorage)
    Definition multilineargeometry.hh:559
    \n+
    ctype integrationElement(const LocalCoordinate &local) const
    obtain the integration element
    Definition multilineargeometry.hh:633
    \n+
    Base::ctype ctype
    Definition multilineargeometry.hh:536
    \n+
    Jacobian jacobian(const LocalCoordinate &local) const
    Obtain the Jacobian.
    Definition multilineargeometry.hh:702
    \n+
    Base::JacobianInverseTransposed JacobianInverseTransposed
    Definition multilineargeometry.hh:546
    \n+
    Base::JacobianTransposed JacobianTransposed
    Definition multilineargeometry.hh:545
    \n+
    Base::JacobianInverse JacobianInverse
    Definition multilineargeometry.hh:548
    \n+
    Base::Jacobian Jacobian
    Definition multilineargeometry.hh:547
    \n+
    Base::Volume Volume
    Definition multilineargeometry.hh:543
    \n+
    Base::GlobalCoordinate GlobalCoordinate
    Definition multilineargeometry.hh:542
    \n+
    GlobalCoordinate center() const
    obtain the centroid of the mapping's image
    Definition multilineargeometry.hh:572
    \n+
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian's inverse
    Definition multilineargeometry.hh:680
    \n+
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,767 +1,1022 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-referenceelementimplementation.hh\n+multilineargeometry.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n-6#define DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n+5#ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n+6#define DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n 7\n 8#include \n-9\n-10#include \n+9#include \n+10#include \n 11#include \n-12#include \n-13#include \n-14#include \n-15#include \n-16#include \n+12#include \n+13\n+14#include \n+15#include \n+16#include \n 17\n-18#include \n-19#include \n-20#include \n-21#include \n-22#include \n-23#include \n+18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+19#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+21\n+22namespace _\bD_\bu_\bn_\be\n+23{\n 24\n-25#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n-26#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-27#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-28\n-29namespace _\bD_\bu_\bn_\be\n-30{\n-31\n-32 namespace Geo\n-33 {\n-34\n-35#ifndef DOXYGEN\n-36\n-37 // Internal Forward Declarations\n-38 // -----------------------------\n-39\n-40 namespace Impl\n-41 {\n-42 template< class ctype, int dim >\n-43 class ReferenceElementContainer;\n-44 }\n-45\n-46 template< class ctype, int dim >\n-47 struct ReferenceElements;\n-48\n-49\n-50\n-51 namespace Impl\n-52 {\n-53\n-54 using Dune::Impl::isPrism;\n-55 using Dune::Impl::isPyramid;\n-56 using Dune::Impl::baseTopologyId;\n-57 using Dune::Impl::prismConstruction;\n-58 using Dune::Impl::pyramidConstruction;\n-59 using Dune::Impl::numTopologies;\n-60\n-62 unsigned int _\bs_\bi_\bz_\be ( unsigned int topologyId, int dim, int codim );\n-63\n-64\n-65\n-73 unsigned int subTopologyId ( unsigned int topologyId, int dim, int codim,\n-unsigned int i );\n-74\n-75\n-76\n-77 // subTopologyNumbering\n-78 // --------------------\n-79\n-80 void subTopologyNumbering ( unsigned int topologyId, int dim, int codim,\n-unsigned int i, int subcodim,\n-81 unsigned int *beginOut, unsigned int *endOut );\n-82\n-83\n-84\n-85\n-86 // checkInside\n-87 // -----------\n-88\n-89 template< class ct, int cdim >\n-90 inline bool\n-91 checkInside ( unsigned int topologyId, int dim, const FieldVector< ct, cdim\n-> &x, ct tolerance, ct factor = ct( 1 ) )\n-92 {\n-93 assert( (dim >= 0) && (dim <= cdim) );\n-94 assert( topologyId < numTopologies( dim ) );\n-95\n-96 if( dim > 0 )\n-97 {\n-98 const ct baseFactor = (isPrism( topologyId, dim ) ? factor : factor - x\n-[ dim-1 ]);\n-99 if( (x[ dim-1 ] > -tolerance) && (factor - x[ dim-1 ] > -tolerance) )\n-100 return checkInside< ct, cdim >( baseTopologyId( topologyId, dim ), dim-1,\n-x, tolerance, baseFactor );\n-101 else\n-102 return false;\n-103 }\n-104 else\n-105 return true;\n-106 }\n-107\n-108\n-109\n-110 // referenceCorners\n-111 // ----------------\n-112\n-113 template< class ct, int cdim >\n-114 inline unsigned int\n-115 referenceCorners ( unsigned int topologyId, int dim, FieldVector< ct, cdim\n-> *corners )\n-116 {\n-117 assert( (dim >= 0) && (dim <= cdim) );\n-118 assert( topologyId < numTopologies( dim ) );\n-119\n-120 if( dim > 0 )\n-121 {\n-122 const unsigned int nBaseCorners\n-123 = referenceCorners( baseTopologyId( topologyId, dim ), dim-1, corners );\n-124 assert( nBaseCorners == _\bs_\bi_\bz_\be( baseTopologyId( topologyId, dim ), dim-1,\n-dim-1 ) );\n-125 if( isPrism( topologyId, dim ) )\n-126 {\n-127 std::copy( corners, corners + nBaseCorners, corners + nBaseCorners );\n-128 for( unsigned int i = 0; i < nBaseCorners; ++i )\n-129 corners[ i+nBaseCorners ][ dim-1 ] = ct( 1 );\n-130 return 2*nBaseCorners;\n-131 }\n-132 else\n-133 {\n-134 corners[ nBaseCorners ] = FieldVector< ct, cdim >( ct( 0 ) );\n-135 corners[ nBaseCorners ][ dim-1 ] = ct( 1 );\n-136 return nBaseCorners+1;\n-137 }\n-138 }\n-139 else\n-140 {\n-141 *corners = FieldVector< ct, cdim >( ct( 0 ) );\n-142 return 1;\n-143 }\n-144 }\n-145\n-146\n-147\n-148 // referenceVolume\n-149 // ---------------\n-150\n-151 unsigned long referenceVolumeInverse ( unsigned int topologyId, int dim );\n-152\n-153 template< class ct >\n-154 inline ct referenceVolume ( unsigned int topologyId, int dim )\n-155 {\n-156 return ct( 1 ) / ct( referenceVolumeInverse( topologyId, dim ) );\n-157 }\n+25 // MultiLinearGeometryTraits\n+26 // -------------------------\n+27\n+37 template< class ct >\n+_\b3_\b8 struct _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs\n+39 {\n+_\b5_\b8 typedef Impl::FieldMatrixHelper< ct > _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n+59\n+_\b6_\b1 static ct _\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be () { return ct( 16 ) * std::numeric_limits< ct >::\n+epsilon(); }\n+62\n+127 template< int mydim, int cdim >\n+_\b1_\b2_\b8 struct _\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be\n+129 {\n+_\b1_\b3_\b0 typedef std::vector< FieldVector< ct, cdim > > _\bT_\by_\bp_\be;\n+131 };\n+132\n+146 template< int dim >\n+_\b1_\b4_\b7 struct _\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+148 {\n+_\b1_\b4_\b9 static const bool _\bv = false;\n+_\b1_\b5_\b0 static const unsigned int _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd = ~0u;\n+151 };\n+152 };\n+153\n+154\n+155\n+156 // MultiLinearGeometry\n+157 // -------------------\n 158\n-159\n-160\n-161 // referenceOrigins\n-162 // ----------------\n-163\n-164 template< class ct, int cdim >\n-165 inline unsigned int\n-166 referenceOrigins ( unsigned int topologyId, int dim, int codim,\n-FieldVector< ct, cdim > *origins )\n-167 {\n-168 assert( (dim >= 0) && (dim <= cdim) );\n-169 assert( topologyId < numTopologies( dim ) );\n-170 assert( (codim >= 0) && (codim <= dim) );\n-171\n-172 if( codim > 0 )\n-173 {\n-174 const unsigned int baseId = baseTopologyId( topologyId, dim );\n-175 if( isPrism( topologyId, dim ) )\n-176 {\n-177 const unsigned int n = (codim < dim ? referenceOrigins( baseId, dim-1,\n-codim, origins ) : 0);\n-178 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins+n\n-);\n-179 for( unsigned int i = 0; i < m; ++i )\n-180 {\n-181 origins[ n+m+i ] = origins[ n+i ];\n-182 origins[ n+m+i ][ dim-1 ] = ct( 1 );\n-183 }\n-184 return n+2*m;\n-185 }\n-186 else\n-187 {\n-188 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins );\n-189 if( codim == dim )\n-190 {\n-191 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );\n-192 origins[ m ][ dim-1 ] = ct( 1 );\n-193 return m+1;\n-194 }\n-195 else\n-196 return m+referenceOrigins( baseId, dim-1, codim, origins+m );\n-197 }\n-198 }\n-199 else\n-200 {\n-201 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n-202 return 1;\n-203 }\n-204 }\n+179 template< class ct, int mydim, int cdim, class Traits =\n+MultiLinearGeometryTraits< ct > >\n+_\b1_\b8_\b0 class _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+181 {\n+182 typedef _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> This;\n+183\n+184 public:\n+_\b1_\b8_\b6 typedef ct _\bc_\bt_\by_\bp_\be;\n+187\n+_\b1_\b8_\b9 static const int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn= mydim;\n+_\b1_\b9_\b1 static const int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = cdim;\n+192\n+_\b1_\b9_\b4 typedef FieldVector< ctype, mydimension > _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+_\b1_\b9_\b6 typedef FieldVector< ctype, coorddimension > _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+_\b1_\b9_\b8 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n+199\n+_\b2_\b0_\b1 typedef FieldMatrix< ctype, mydimension, coorddimension >\n+_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n+202\n+204 class _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n 205\n-206\n-207\n-208 // referenceEmbeddings\n-209 // -------------------\n-210\n-211 template< class ct, int cdim, int mydim >\n-212 inline unsigned int\n-213 referenceEmbeddings ( unsigned int topologyId, int dim, int codim,\n-214 FieldVector< ct, cdim > *origins,\n-215 FieldMatrix< ct, mydim, cdim > *jacobianTransposeds )\n-216 {\n-217 assert( (0 <= codim) && (codim <= dim) && (dim <= cdim) );\n-218 assert( (dim - codim <= mydim) && (mydim <= cdim) );\n-219 assert( topologyId < numTopologies( dim ) );\n+_\b2_\b0_\b7 typedef FieldMatrix< ctype, coorddimension, mydimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn;\n+208\n+_\b2_\b1_\b0 typedef FieldMatrix< ctype, mydimension, coorddimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be;\n+211\n+212 protected:\n+213\n+_\b2_\b1_\b4 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b> _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs;\n+215\n+216 public:\n+217\n+_\b2_\b1_\b9 typedef typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n 220\n-221 if( (0 < codim) && (codim <= dim) )\n-222 {\n-223 const unsigned int baseId = baseTopologyId( topologyId, dim );\n-224 if( isPrism( topologyId, dim ) )\n-225 {\n-226 const unsigned int n = (codim < dim ? referenceEmbeddings( baseId, dim-1,\n-codim, origins, jacobianTransposeds ) : 0);\n-227 for( unsigned int i = 0; i < n; ++i )\n-228 jacobianTransposeds[ i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );\n-229\n-230 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1,\n-origins+n, jacobianTransposeds+n );\n-231 std::copy( origins+n, origins+n+m, origins+n+m );\n-232 std::copy( jacobianTransposeds+n, jacobianTransposeds+n+m,\n-jacobianTransposeds+n+m );\n-233 for( unsigned int i = 0; i < m; ++i )\n-234 origins[ n+m+i ][ dim-1 ] = ct( 1 );\n-235\n-236 return n+2*m;\n-237 }\n-238 else // !isPrism\n-239 {\n-240 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1,\n-origins, jacobianTransposeds );\n-241 if( codim == dim )\n-242 {\n-243 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );\n-244 origins[ m ][ dim-1 ] = ct( 1 );\n-245 jacobianTransposeds[ m ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );\n-246 return m+1;\n-247 }\n-248 else if( codim < dim )\n-249 {\n-250 const unsigned int n = referenceEmbeddings( baseId, dim-1, codim,\n-origins+m, jacobianTransposeds+m );\n-251 for( unsigned int i = 0; i < n; ++i )\n-252 {\n-253 for( int k = 0; k < dim-1; ++k )\n-254 jacobianTransposeds[ m+i ][ dim-codim-1 ][ k ] = -origins[ m+i ][ k ];\n-255 jacobianTransposeds[ m+i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );\n-256 }\n-257 return m+n;\n-258 }\n-259 }\n-260 }\n-261 else if( codim == 0 )\n-262 {\n-263 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n-264 jacobianTransposeds[ 0 ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );\n-265 for( int k = 0; k < dim; ++k )\n-266 jacobianTransposeds[ 0 ][ k ][ k ] = ct( 1 );\n-267 return 1;\n-268 }\n-269\n-270 // this point should not be reached since all cases are handled before.\n-271 std::abort();\n-272 return 0;\n-273 }\n-274\n-275\n-276\n-277 // referenceIntegrationOuterNormals\n-278 // --------------------------------\n-279\n-280 template< class ct, int cdim >\n-281 inline unsigned int\n-282 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,\n-283 const FieldVector< ct, cdim > *origins,\n-284 FieldVector< ct, cdim > *normals )\n-285 {\n-286 assert( (dim > 0) && (dim <= cdim) );\n-287 assert( topologyId < numTopologies( dim ) );\n-288\n-289 if( dim > 1 )\n-290 {\n-291 const unsigned int baseId = baseTopologyId( topologyId, dim );\n-292 if( isPrism( topologyId, dim ) )\n-293 {\n-294 const unsigned int numBaseFaces\n-295 = referenceIntegrationOuterNormals( baseId, dim-1, origins, normals );\n-296\n-297 for( unsigned int i = 0; i < 2; ++i )\n-298 {\n-299 normals[ numBaseFaces+i ] = FieldVector< ct, cdim >( ct( 0 ) );\n-300 normals[ numBaseFaces+i ][ dim-1 ] = ct( 2*int( i )-1 );\n-301 }\n-302\n-303 return numBaseFaces+2;\n-304 }\n-305 else\n-306 {\n-307 normals[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );\n-308 normals[ 0 ][ dim-1 ] = ct( -1 );\n-309\n-310 const unsigned int numBaseFaces\n-311 = referenceIntegrationOuterNormals( baseId, dim-1, origins+1, normals+1 );\n-312 for( unsigned int i = 1; i <= numBaseFaces; ++i )\n-313 normals[ i ][ dim-1 ] = normals[ i ]*origins[ i ];\n-314\n-315 return numBaseFaces+1;\n-316 }\n-317 }\n-318 else\n+221 private:\n+222 static const bool hasSingleGeometryType = Traits::template\n+hasSingleGeometryType< mydimension >::v;\n+223\n+224 protected:\n+_\b2_\b2_\b5 typedef typename Traits::MatrixHelper _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n+_\b2_\b2_\b6 typedef typename std::conditional< hasSingleGeometryType, std::\n+integral_constant< unsigned int, Traits::template hasSingleGeometryType<\n+mydimension >::topologyId >, unsigned int >_\b:_\b:_\bt_\by_\bp_\be _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd;\n+227\n+228 public:\n+238 template< class Corners >\n+_\b2_\b3_\b9 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt,\n+240 const Corners &_\bc_\bo_\br_\bn_\be_\br_\bs )\n+241 : refElement_( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt ),\n+242 corners_( _\bc_\bo_\br_\bn_\be_\br_\bs )\n+243 {}\n+244\n+254 template< class Corners >\n+_\b2_\b5_\b5 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt,\n+256 const Corners &_\bc_\bo_\br_\bn_\be_\br_\bs )\n+257 : refElement_( _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general( gt ) ),\n+258 corners_( _\bc_\bo_\br_\bn_\be_\br_\bs )\n+259 {}\n+260\n+_\b2_\b6_\b2 bool _\ba_\bf_\bf_\bi_\bn_\be () const\n+263 {\n+264 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jt;\n+265 return _\ba_\bf_\bf_\bi_\bn_\be( jt );\n+266 }\n+267\n+_\b2_\b6_\b9 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const { return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be( toUnsignedInt\n+(_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd()), _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ); }\n+270\n+_\b2_\b7_\b2 int _\bc_\bo_\br_\bn_\be_\br_\bs () const { return _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().size( _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ); }\n+273\n+_\b2_\b7_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br ( int i ) const\n+276 {\n+277 assert( (i >= 0) && (i < _\bc_\bo_\br_\bn_\be_\br_\bs()) );\n+278 return std::cref(corners_).get()[ i ];\n+279 }\n+280\n+_\b2_\b8_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const { return _\bg_\bl_\bo_\bb_\ba_\bl( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0,\n+0 ) ); }\n+283\n+_\b2_\b9_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n+291 {\n+292 using std::begin;\n+293\n+294 auto cit = begin(std::cref(corners_).get());\n+295 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be y;\n+296 global< false >( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int, mydimension >\n+(), cit, _\bc_\bt_\by_\bp_\be( 1 ), _\bl_\bo_\bc_\ba_\bl, _\bc_\bt_\by_\bp_\be( 1 ), y );\n+297 return y;\n+298 }\n+299\n+_\b3_\b1_\b2 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl ( const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &globalCoord ) const\n+313 {\n+314 const _\bc_\bt_\by_\bp_\be tolerance = Traits::tolerance();\n+315 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be x = _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 );\n+316 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be dx;\n+317 const bool affineMapping = this->_\ba_\bf_\bf_\bi_\bn_\be();\n+318 do\n 319 {\n-320 for( unsigned int i = 0; i < 2; ++i )\n-321 {\n-322 normals[ i ] = FieldVector< ct, cdim >( ct( 0 ) );\n-323 normals[ i ][ 0 ] = ct( 2*int( i )-1 );\n-324 }\n-325\n-326 return 2;\n-327 }\n-328 }\n+320 // Newton's method: DF^n dx^n = F^n, x^{n+1} -= dx^n\n+321 const GlobalCoordinate dglobal = (*this).global( x ) - globalCoord;\n+322 const bool invertible =\n+323 MatrixHelper::template xTRightInvA< mydimension, coorddimension >\n+( _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( x ), dglobal, dx );\n+324 if( ! invertible )\n+325 return _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be( std::numeric_limits< ctype > :: max() );\n+326\n+327 // update x with correction\n+328 x -= dx;\n 329\n-330 template< class ct, int cdim >\n-331 inline unsigned int\n-332 referenceIntegrationOuterNormals ( unsigned int topologyId, int dim,\n-333 FieldVector< ct, cdim > *normals )\n-334 {\n-335 assert( (dim > 0) && (dim <= cdim) );\n-336\n-337 FieldVector< ct, cdim > *origins\n-338 = new FieldVector< ct, cdim >[ _\bs_\bi_\bz_\be( topologyId, dim, 1 ) ];\n-339 referenceOrigins( topologyId, dim, 1, origins );\n-340\n-341 const unsigned int numFaces\n-342 = referenceIntegrationOuterNormals( topologyId, dim, origins, normals );\n-343 assert( numFaces == _\bs_\bi_\bz_\be( topologyId, dim, 1 ) );\n-344\n-345 delete[] origins;\n-346\n-347 return numFaces;\n-348 }\n-349\n-350 } // namespace Impl\n-351\n-352\n-353\n-354 // ReferenceElement\n-355 // ----------------\n-356\n-375 template< class ctype_, int dim >\n-376 class ReferenceElementImplementation\n-377 {\n-378\n-379 public:\n+330 // for affine mappings only one iteration is needed\n+331 if ( affineMapping ) break;\n+332 } while( dx.two_norm2() > tolerance );\n+333 return x;\n+334 }\n+335\n+_\b3_\b5_\b0 _\bV_\bo_\bl_\bu_\bm_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n+351 {\n+352 return MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >\n+( _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl ) );\n+353 }\n+354\n+_\b3_\b6_\b3 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be () const\n+364 {\n+365 return _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 ) ) * _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n+().volume();\n+366 }\n+367\n+_\b3_\b7_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl )\n+const\n+378 {\n+379 using std::begin;\n 380\n-382 using ctype = ctype_;\n-383\n-385 using CoordinateField = ctype;\n+381 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jt;\n+382 auto cit = begin(std::cref(corners_).get());\n+383 jacobianTransposed< false >( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int,\n+mydimension >(), cit, _\bc_\bt_\by_\bp_\be( 1 ), _\bl_\bo_\bc_\ba_\bl, _\bc_\bt_\by_\bp_\be( 1 ), jt );\n+384 return jt;\n+385 }\n 386\n-388 using Coordinate = Dune::FieldVector;\n-389\n-391 static constexpr int dimension = dim;\n-392\n-394 typedef ctype Volume;\n-395\n-396 private:\n-397\n-398 friend class Impl::ReferenceElementContainer< ctype, dim >;\n+_\b3_\b9_\b3 JacobianInverseTransposed _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+&_\bl_\bo_\bc_\ba_\bl ) const;\n+394\n+_\b3_\b9_\b5 friend _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+&geometry )\n+396 {\n+397 return geometry._\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt();\n+398 }\n 399\n-400 struct SubEntityInfo;\n-401\n-402 template< int codim > struct CreateGeometries;\n-403\n-404 public:\n-406 template< int codim >\n-407 struct Codim\n+400\n+_\b4_\b0_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n 408 {\n-410 typedef AffineGeometry< ctype, dim-codim, dim > Geometry;\n-411 };\n-412\n-413 // ReferenceElement cannot be copied.\n-414 ReferenceElementImplementation ( const ReferenceElementImplementation& ) =\n-delete;\n-415\n-416 // ReferenceElementImplementation cannot be copied.\n-417 ReferenceElementImplementation& operator= ( const\n-ReferenceElementImplementation& ) = delete;\n-418\n-419 // ReferenceElementImplementation is default-constructible (required for\n-storage in std::array)\n-420 ReferenceElementImplementation () = default;\n-421\n-426 int _\bs_\bi_\bz_\be ( int c ) const\n-427 {\n-428 assert( (c >= 0) && (c <= dim) );\n-429 return info_[ c ].size();\n-430 }\n-431\n-443 int _\bs_\bi_\bz_\be ( int i, int c, int cc ) const\n-444 {\n-445 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n-446 return info_[ c ][ i ].size( cc );\n-447 }\n-448\n-462 int subEntity ( int i, int c, int ii, int cc ) const\n-463 {\n-464 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n-465 return info_[ c ][ i ].number( ii, cc );\n-466 }\n-467\n-483 auto subEntities ( int i, int c, int cc ) const\n-484 {\n-485 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n-486 return info_[ c ][ i ].numbers( cc );\n-487 }\n-488\n-497 const GeometryType &type ( int i, int c ) const\n+409 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n+410 }\n+411\n+_\b4_\b1_\b8 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n+419 {\n+420 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n+421 }\n+422\n+423 protected:\n+424\n+_\b4_\b2_\b5 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt () const\n+426 {\n+427 return refElement_;\n+428 }\n+429\n+_\b4_\b3_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd () const\n+431 {\n+432 return _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd( std::integral_constant< bool, hasSingleGeometryType >()\n+);\n+433 }\n+434\n+435 template< bool add, int dim, class CornerIterator >\n+_\b4_\b3_\b6 static void _\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int,\n+dim >,\n+437 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+438 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y );\n+439 template< bool add, class CornerIterator >\n+_\b4_\b4_\b0 static void _\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0\n+>,\n+441 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+442 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y );\n+443\n+444 template< bool add, int rows, int dim, class CornerIterator >\n+_\b4_\b4_\b5 static void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::\n+integral_constant< int, dim >,\n+446 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+447 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt );\n+448 template< bool add, int rows, class CornerIterator >\n+_\b4_\b4_\b9 static void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::\n+integral_constant< int, 0 >,\n+450 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+451 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt );\n+452\n+453 template< int dim, class CornerIterator >\n+_\b4_\b5_\b4 static bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int,\n+dim >, CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt );\n+455 template< class CornerIterator >\n+_\b4_\b5_\b6 static bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0\n+>, CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt );\n+457\n+_\b4_\b5_\b8 bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jacobianT ) const\n+459 {\n+460 using std::begin;\n+461\n+462 auto cit = begin(std::cref(corners_).get());\n+463 return _\ba_\bf_\bf_\bi_\bn_\be( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int, mydimension >(),\n+cit, jacobianT );\n+464 }\n+465\n+466 private:\n+467 // The following methods are needed to convert the return type of\n+topologyId to\n+468 // unsigned int with g++-4.4. It has problems casting integral_constant to\n+the\n+469 // integral type.\n+470 static unsigned int toUnsignedInt(unsigned int i) { return i; }\n+471 template\n+472 static unsigned int toUnsignedInt(std::integral_constant )\n+{ return v; }\n+473 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd ( std::integral_constant< bool, true > ) const\n+{ return _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(); }\n+474 unsigned int _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd ( std::integral_constant< bool, false > ) const\n+{ return _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().type().id(); }\n+475\n+476 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt refElement_;\n+477 typename Traits::template CornerStorage< mydimension, coorddimension >::\n+Type corners_;\n+478 };\n+479\n+480\n+481\n+482 // MultiLinearGeometry::JacobianInverseTransposed\n+483 // ----------------------------------------------\n+484\n+485 template< class ct, int mydim, int cdim, class Traits >\n+_\b4_\b8_\b6 class _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by< ct, mydim, cdim, Traits >::\n+_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+487 : public FieldMatrix< ctype, coorddimension, mydimension >\n+488 {\n+489 typedef FieldMatrix< ctype, coorddimension, mydimension > Base;\n+490\n+491 public:\n+_\b4_\b9_\b2 void _\bs_\be_\bt_\bu_\bp ( const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n+493 {\n+494 detInv_ = MatrixHelper::template rightInvA< mydimension, coorddimension >\n+( jt, static_cast< Base & >( *this ) );\n+495 }\n+496\n+_\b4_\b9_\b7 void _\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt ( const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n 498 {\n-499 assert( (i >= 0) && (i < _\bs_\bi_\bz_\be( c )) );\n-500 return info_[ c ][ i ].type();\n-501 }\n-502\n-504 const GeometryType &type () const { return type( 0, 0 ); }\n-505\n-515 const Coordinate &position( int i, int c ) const\n-516 {\n-517 assert( (c >= 0) && (c <= dim) );\n-518 return baryCenters_[ c ][ i ];\n-519 }\n-520\n-528 bool checkInside ( const Coordinate &local ) const\n-529 {\n-530 const ctype tolerance = ctype( 64 ) * std::numeric_limits< ctype >::epsilon\n-();\n-531 return Impl::template checkInside< ctype, dim >( type().id(), dim, local,\n-tolerance );\n-532 }\n-533\n-545 template< int codim >\n-546 typename Codim< codim >::Geometry geometry ( int i ) const\n-547 {\n-548 return std::get< codim >( geometries_ )[ i ];\n-549 }\n-550\n-552 Volume volume () const\n-553 {\n-554 return volume_;\n-555 }\n-556\n-564 const Coordinate &integrationOuterNormal ( int face ) const\n-565 {\n-566 assert( (face >= 0) && (face < int( integrationNormals_.size() )) );\n-567 return integrationNormals_[ face ];\n-568 }\n-569\n-570 private:\n-571 void initialize ( unsigned int topologyId )\n-572 {\n-573 assert( topologyId < Impl::numTopologies( dim ) );\n-574\n-575 // set up subentities\n-576 for( int codim = 0; codim <= dim; ++codim )\n-577 {\n-578 const unsigned int _\bs_\bi_\bz_\be = Impl::size( topologyId, dim, codim );\n-579 info_[ codim ].resize( size );\n-580 for( unsigned int i = 0; i < _\bs_\bi_\bz_\be; ++i )\n-581 info_[ codim ][ i ].initialize( topologyId, codim, i );\n-582 }\n-583\n-584 // compute corners\n-585 const unsigned int numVertices = _\bs_\bi_\bz_\be( dim );\n-586 baryCenters_[ dim ].resize( numVertices );\n-587 Impl::referenceCorners( topologyId, dim, &(baryCenters_[ dim ][ 0 ]) );\n-588\n-589 // compute barycenters\n-590 for( int codim = 0; codim < dim; ++codim )\n-591 {\n-592 baryCenters_[ codim ].resize( _\bs_\bi_\bz_\be(codim) );\n-593 for( int i = 0; i < _\bs_\bi_\bz_\be( codim ); ++i )\n-594 {\n-595 baryCenters_[ codim ][ i ] = Coordinate( ctype( 0 ) );\n-596 const unsigned int numCorners = _\bs_\bi_\bz_\be( i, codim, dim );\n-597 for( unsigned int j = 0; j < numCorners; ++j )\n-598 baryCenters_[ codim ][ i ] += baryCenters_[ dim ][ subEntity( i, codim, j,\n-dim ) ];\n-599 baryCenters_[ codim ][ i ] *= ctype( 1 ) / ctype( numCorners );\n-600 }\n-601 }\n-602\n-603 // compute reference element volume\n-604 volume_ = Impl::template referenceVolume< ctype >( topologyId, dim );\n-605\n-606 // compute integration outer normals\n-607 if( dim > 0 )\n-608 {\n-609 integrationNormals_.resize( _\bs_\bi_\bz_\be( 1 ) );\n-610 Impl::referenceIntegrationOuterNormals( topologyId, dim, &\n-(integrationNormals_[ 0 ]) );\n-611 }\n-612\n-613 // set up geometries\n-614 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ]( auto i )\n-{ CreateGeometries< i >::apply( *this, geometries_ ); } );\n-615 }\n-616\n-617 template< int... codim >\n-618 static std::tuple< std::vector< typename Codim< codim >::Geometry >... >\n-619 makeGeometryTable ( std::integer_sequence< int, codim... > );\n-620\n-622 typedef decltype( makeGeometryTable( std::make_integer_sequence< int, dim+1\n->() ) ) GeometryTable;\n-623\n-625 ctype volume_;\n-626\n-627 std::vector< Coordinate > baryCenters_[ dim+1 ];\n-628 std::vector< Coordinate > integrationNormals_;\n-629\n-631 GeometryTable geometries_;\n-632\n-633 std::vector< SubEntityInfo > info_[ dim+1 ];\n-634 };\n-635\n-637 template< class ctype, int dim >\n-638 struct ReferenceElementImplementation< ctype, dim >::SubEntityInfo\n-639 {\n-640 // Compute upper bound for the number of subsentities.\n-641 // If someone knows an explicit formal feel free to\n-642 // implement it here.\n-643 static constexpr std::size_t maxSubEntityCount()\n-644 {\n-645 std::size_t maxCount=0;\n-646 for(std::size_t codim=0; codim<=dim; ++codim)\n-647 maxCount = std::max(maxCount, binomial(std::size_t(dim),codim)*(1 <<\n-codim));\n-648 return maxCount;\n-649 }\n-650\n-651 using SubEntityFlags = std::bitset;\n-652\n-653 class SubEntityRange\n-654 : public Dune::IteratorRange\n-655 {\n-656 using Base = typename Dune::IteratorRange;\n-657\n-658 public:\n-659\n-660 using iterator = Base::iterator;\n-661 using const_iterator = Base::const_iterator;\n-662\n-663 SubEntityRange(const iterator& begin, const iterator& end, const\n-SubEntityFlags& contains) :\n-664 Base(begin, end),\n-665 containsPtr_(&contains),\n-666 size_(end-begin)\n-667 {}\n-668\n-669 SubEntityRange() :\n-670 Base(),\n-671 containsPtr_(nullptr),\n-672 size_(0)\n-673 {}\n-674\n-675 std::size_t _\bs_\bi_\bz_\be() const\n-676 {\n-677 return size_;\n-678 }\n-679\n-680 bool contains(std::size_t i) const\n+499 detInv_ = MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >\n+( jt );\n+500 }\n+501\n+_\b5_\b0_\b2 _\bc_\bt_\by_\bp_\be _\bd_\be_\bt () const { return _\bc_\bt_\by_\bp_\be( 1 ) / detInv_; }\n+_\b5_\b0_\b3 _\bc_\bt_\by_\bp_\be _\bd_\be_\bt_\bI_\bn_\bv () const { return detInv_; }\n+504\n+505 private:\n+506 _\bc_\bt_\by_\bp_\be detInv_;\n+507 };\n+508\n+509\n+510\n+523 template< class ct, int mydim, int cdim, class Traits =\n+MultiLinearGeometryTraits< ct > >\n+_\b5_\b2_\b4 class _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+525 : public _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by< ct, mydim, cdim, Traits >\n+526 {\n+527 typedef _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> This;\n+528 typedef _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> _\bB_\ba_\bs_\be;\n+529\n+530 protected:\n+_\b5_\b3_\b1 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n+532\n+533 public:\n+_\b5_\b3_\b4 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n+535\n+_\b5_\b3_\b6 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bt_\by_\bp_\be _\bc_\bt_\by_\bp_\be;\n+537\n+538 using _\bB_\ba_\bs_\be_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn;\n+539 using _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn;\n+540\n+_\b5_\b4_\b1 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+_\b5_\b4_\b2 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n+_\b5_\b4_\b3 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be _\bV_\bo_\bl_\bu_\bm_\be;\n+544\n+_\b5_\b4_\b5 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n+_\b5_\b4_\b6 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n+_\b5_\b4_\b7 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn;\n+_\b5_\b4_\b8 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be;\n+549\n+550 template< class CornerStorage >\n+_\b5_\b5_\b1 _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt, const\n+CornerStorage &cornerStorage )\n+552 : _\bB_\ba_\bs_\be( _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt, cornerStorage ),\n+553 affine_( _\bB_\ba_\bs_\be::_\ba_\bf_\bf_\bi_\bn_\be( jacobianTransposed_ ) ),\n+554 jacobianInverseTransposedComputed_( false ),\n+555 integrationElementComputed_( false )\n+556 {}\n+557\n+558 template< class CornerStorage >\n+_\b5_\b5_\b9 _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, const CornerStorage\n+&cornerStorage )\n+560 : _\bB_\ba_\bs_\be( gt, cornerStorage ),\n+561 affine_( _\bB_\ba_\bs_\be::_\ba_\bf_\bf_\bi_\bn_\be( jacobianTransposed_ ) ),\n+562 jacobianInverseTransposedComputed_( false ),\n+563 integrationElementComputed_( false )\n+564 {}\n+565\n+_\b5_\b6_\b7 bool _\ba_\bf_\bf_\bi_\bn_\be () const { return affine_; }\n+568\n+569 using _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bo_\br_\bn_\be_\br;\n+570\n+_\b5_\b7_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const { return _\bg_\bl_\bo_\bb_\ba_\bl( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0,\n+0 ) ); }\n+573\n+_\b5_\b8_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n+581 {\n+582 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+583 {\n+584 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl( _\bc_\bo_\br_\bn_\be_\br( 0 ) );\n+585 jacobianTransposed_.umtv( _\bl_\bo_\bc_\ba_\bl, _\bg_\bl_\bo_\bb_\ba_\bl );\n+586 return _\bg_\bl_\bo_\bb_\ba_\bl;\n+587 }\n+588 else\n+589 return _\bB_\ba_\bs_\be_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl( _\bl_\bo_\bc_\ba_\bl );\n+590 }\n+591\n+_\b6_\b0_\b4 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl ( const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bg_\bl_\bo_\bb_\ba_\bl ) const\n+605 {\n+606 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+607 {\n+608 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl;\n+609 if( jacobianInverseTransposedComputed_ )\n+610 jacobianInverseTransposed_.mtv( _\bg_\bl_\bo_\bb_\ba_\bl - _\bc_\bo_\br_\bn_\be_\br( 0 ), _\bl_\bo_\bc_\ba_\bl );\n+611 else\n+612 MatrixHelper::template xTRightInvA< mydimension, coorddimension >\n+( jacobianTransposed_, _\bg_\bl_\bo_\bb_\ba_\bl - _\bc_\bo_\br_\bn_\be_\br( 0 ), _\bl_\bo_\bc_\ba_\bl );\n+613 return _\bl_\bo_\bc_\ba_\bl;\n+614 }\n+615 else\n+616 return _\bB_\ba_\bs_\be_\b:_\b:_\bl_\bo_\bc_\ba_\bl( _\bg_\bl_\bo_\bb_\ba_\bl );\n+617 }\n+618\n+_\b6_\b3_\b3 _\bc_\bt_\by_\bp_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n+634 {\n+635 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+636 {\n+637 if( !integrationElementComputed_ )\n+638 {\n+639 jacobianInverseTransposed_._\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt( jacobianTransposed_ );\n+640 integrationElementComputed_ = true;\n+641 }\n+642 return jacobianInverseTransposed_._\bd_\be_\bt_\bI_\bn_\bv();\n+643 }\n+644 else\n+645 return _\bB_\ba_\bs_\be_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\bl_\bo_\bc_\ba_\bl );\n+646 }\n+647\n+_\b6_\b4_\b9 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be () const\n+650 {\n+651 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+652 return _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 ) ) * _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n+().volume();\n+653 else\n+654 return _\bB_\ba_\bs_\be_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be();\n+655 }\n+656\n+_\b6_\b6_\b6 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl )\n+const\n+667 {\n+668 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+669 return jacobianTransposed_;\n+670 else\n+671 return _\bB_\ba_\bs_\be_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl );\n+672 }\n+673\n+_\b6_\b8_\b0 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+&_\bl_\bo_\bc_\ba_\bl ) const\n 681 {\n-682 return (*containsPtr_)[i];\n-683 }\n-684\n-685 private:\n-686 const SubEntityFlags* containsPtr_;\n-687 std::size_t size_;\n-688 std::size_t offset_;\n-689 };\n-690\n-691 using NumberRange = typename Dune::IteratorRange;\n-692\n-693 SubEntityInfo ()\n-694 : numbering_( nullptr )\n-695 {\n-696 std::fill( offset_.begin(), offset_.end(), 0 );\n-697 }\n-698\n-699 SubEntityInfo ( const SubEntityInfo &other )\n-700 : offset_( other.offset_ ),\n-701 type_( other.type_ ),\n-702 containsSubentity_( other.containsSubentity_ )\n+682 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n+683 {\n+684 if( !jacobianInverseTransposedComputed_ )\n+685 {\n+686 jacobianInverseTransposed_._\bs_\be_\bt_\bu_\bp( jacobianTransposed_ );\n+687 jacobianInverseTransposedComputed_ = true;\n+688 integrationElementComputed_ = true;\n+689 }\n+690 return jacobianInverseTransposed_;\n+691 }\n+692 else\n+693 return _\bB_\ba_\bs_\be_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl );\n+694 }\n+695\n+_\b7_\b0_\b2 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n 703 {\n-704 numbering_ = allocate();\n-705 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );\n-706 }\n-707\n-708 ~SubEntityInfo () { deallocate( numbering_ ); }\n-709\n-710 const SubEntityInfo &operator= ( const SubEntityInfo &other )\n-711 {\n-712 type_ = other.type_;\n-713 offset_ = other.offset_;\n-714\n-715 deallocate( numbering_ );\n-716 numbering_ = allocate();\n-717 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );\n-718\n-719 containsSubentity_ = other.containsSubentity_;\n+704 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n+705 }\n+706\n+_\b7_\b1_\b3 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n+714 {\n+715 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n+716 }\n+717\n+718 protected:\n+719 using _\bB_\ba_\bs_\be_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt;\n 720\n-721 return *this;\n-722 }\n-723\n-724 int _\bs_\bi_\bz_\be ( int cc ) const\n-725 {\n-726 assert( (cc >= 0) && (cc <= dim) );\n-727 return (offset_[ cc+1 ] - offset_[ cc ]);\n-728 }\n-729\n-730 int number ( int ii, int cc ) const\n-731 {\n-732 assert( (ii >= 0) && (ii < _\bs_\bi_\bz_\be( cc )) );\n-733 return numbering_[ offset_[ cc ] + ii ];\n-734 }\n+721 private:\n+722 mutable _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianTransposed_;\n+723 mutable _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianInverseTransposed_;\n+724\n+725 mutable bool affine_ : 1;\n+726\n+727 mutable bool jacobianInverseTransposedComputed_ : 1;\n+728 mutable bool integrationElementComputed_ : 1;\n+729 };\n+730\n+731\n+732\n+733 // Implementation of MultiLinearGeometry\n+734 // -------------------------------------\n 735\n-736 auto numbers ( int cc ) const\n-737 {\n-738 return SubEntityRange( numbering_ + offset_[ cc ], numbering_ + offset_\n-[ cc+1 ], containsSubentity_[cc]);\n-739 }\n-740\n-741 const GeometryType &type () const { return type_; }\n-742\n-743 void initialize ( unsigned int topologyId, int codim, unsigned int i )\n-744 {\n-745 const unsigned int subId = Impl::subTopologyId( topologyId, dim, codim, i\n-);\n-746 type_ = GeometryType( subId, dim-codim );\n-747\n-748 // compute offsets\n-749 for( int cc = 0; cc <= codim; ++cc )\n-750 offset_[ cc ] = 0;\n-751 for( int cc = codim; cc <= dim; ++cc )\n-752 offset_[ cc+1 ] = offset_[ cc ] + Impl::size( subId, dim-codim, cc-codim );\n-753\n-754 // compute subnumbering\n-755 deallocate( numbering_ );\n-756 numbering_ = allocate();\n-757 for( int cc = codim; cc <= dim; ++cc )\n-758 Impl::subTopologyNumbering( topologyId, dim, codim, i, cc-codim,\n-numbering_+offset_[ cc ], numbering_+offset_[ cc+1 ] );\n-759\n-760 // initialize containsSubentity lookup-table\n-761 for(std::size_t cc=0; cc<= dim; ++cc)\n-762 {\n-763 containsSubentity_[cc].reset();\n-764 for(std::size_t idx=0; idx offset_;\n-779 GeometryType type_;\n-780 std::array< SubEntityFlags, dim+1> containsSubentity_;\n-781 };\n-782\n-783\n-784 template< class ctype, int dim >\n-785 template< int codim >\n-786 struct ReferenceElementImplementation< ctype, dim >::CreateGeometries\n-787 {\n-788 template< int cc >\n-789 static typename ReferenceElements< ctype, dim-cc >::ReferenceElement\n-790 subRefElement( const ReferenceElementImplementation< ctype, dim >\n-&refElement, int i, std::integral_constant< int, cc > )\n-791 {\n-792 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b-_\bc_\bc_\b _\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl( refElement.type( i, cc\n-) );\n-793 }\n-794\n-795 static typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\b _\b>_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-796 subRefElement(const ReferenceElementImplementation< ctype, dim >\n-&refElement,\n-797 [[maybe_unused]] int i, std::integral_constant)\n-798 {\n-799 return refElement;\n-800 }\n-801\n-802 static void apply ( const ReferenceElementImplementation< ctype, dim >\n-&refElement, GeometryTable &geometries )\n-803 {\n-804 const int _\bs_\bi_\bz_\be = refElement.size( codim );\n-805 std::vector< FieldVector< ctype, dim > > origins( size );\n-806 std::vector< FieldMatrix< ctype, dim - codim, dim > > jacobianTransposeds\n-( size );\n-807 Impl::referenceEmbeddings( refElement.type().id(), dim, codim, &(origins[ 0\n-]), &(jacobianTransposeds[ 0 ]) );\n-808\n-809 std::get< codim >( geometries ).reserve( size );\n-810 for( int i = 0; i < _\bs_\bi_\bz_\be; ++i )\n-811 {\n-812 typename Codim< codim >::Geometry geometry( subRefElement( refElement, i,\n-std::integral_constant< int, codim >() ), origins[ i ], jacobianTransposeds[ i\n-] );\n-813 std::get< codim >( geometries ).push_back( geometry );\n-814 }\n-815 }\n-816 };\n-817\n-818#endif // DOXYGEN\n-819\n-820 } // namespace Geo\n-821\n-822} // namespace Dune\n-823\n-824#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH\n+736 template< class ct, int mydim, int cdim, class Traits >\n+737 inline typename MultiLinearGeometry< ct, mydim, cdim, Traits >::\n+JacobianInverseTransposed\n+_\b7_\b3_\b8 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local ) const\n+739 {\n+740 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jit;\n+741 jit._\bs_\be_\bt_\bu_\bp( jacobianTransposed( local ) );\n+742 return jit;\n+743 }\n+744\n+745\n+746 template< class ct, int mydim, int cdim, class Traits >\n+747 template< bool add, int dim, class CornerIterator >\n+748 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b7_\b4_\b9_\b _\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int, dim >,\n+750 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+751 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y )\n+752 {\n+753 const _\bc_\bt_\by_\bp_\be xn = df*x[ dim-1 ];\n+754 const _\bc_\bt_\by_\bp_\be cxn = _\bc_\bt_\by_\bp_\be( 1 ) - xn;\n+755\n+756 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n+) )\n+757 {\n+758 // apply (1-xn) times mapping for bottom\n+759 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n+x, rf*cxn, y );\n+760 // apply xn times mapping for top\n+761 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n+df, x, rf*xn, y );\n+762 }\n+763 else\n+764 {\n+765 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension,\n+mydimension-dim ) );\n+766 // apply (1-xn) times mapping for bottom (with argument x/(1-xn))\n+767 if( cxn > Traits::tolerance() || cxn < -Traits::tolerance() )\n+768 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df/\n+cxn, x, rf*cxn, y );\n+769 else\n+770 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n+x, _\bc_\bt_\by_\bp_\be( 0 ), y );\n+771 // apply xn times the tip\n+772 y.axpy( rf*xn, *cit );\n+773 ++cit;\n+774 }\n+775 }\n+776\n+777 template< class ct, int mydim, int cdim, class Traits >\n+778 template< bool add, class CornerIterator >\n+779 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b7_\b8_\b0_\b _\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >,\n+781 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &,\n+782 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y )\n+783 {\n+784 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &origin = *cit;\n+785 ++cit;\n+786 for( int i = 0; i < coorddimension; ++i )\n+787 y[ i ] = (add ? y[ i ] + rf*origin[ i ] : rf*origin[ i ]);\n+788 }\n+789\n+790\n+791 template< class ct, int mydim, int cdim, class Traits >\n+792 template< bool add, int rows, int dim, class CornerIterator >\n+793 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b7_\b9_\b4_\b _\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int,\n+dim >,\n+795 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n+796 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt )\n+797 {\n+798 assert( rows >= dim );\n+799\n+800 const _\bc_\bt_\by_\bp_\be xn = df*x[ dim-1 ];\n+801 const _\bc_\bt_\by_\bp_\be cxn = _\bc_\bt_\by_\bp_\be( 1 ) - xn;\n+802\n+803 auto cit2( cit );\n+804 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n+) )\n+805 {\n+806 // apply (1-xn) times Jacobian for bottom\n+807 jacobianTransposed< add >( topologyId, std::integral_constant< int, dim-1 >\n+(), cit2, df, x, rf*cxn, jt );\n+808 // apply xn times Jacobian for top\n+809 jacobianTransposed< true >( topologyId, std::integral_constant< int, dim-\n+1 >(), cit2, df, x, rf*xn, jt );\n+810 // compute last row as difference between top value and bottom value\n+811 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n+x, -rf, jt[ dim-1 ] );\n+812 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n+df, x, rf, jt[ dim-1 ] );\n+813 }\n+814 else\n+815 {\n+816 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension,\n+mydimension-dim ) );\n+817 /*\n+818 * In the pyramid case, we need a transformation Tb: B -> R^n for the\n+819 * base B \\subset R^{n-1}. The pyramid transformation is then defined as\n+820 * T: P \\subset R^n -> R^n\n+821 * (x, xn) |-> (1-xn) Tb(x*) + xn t (x \\in R^{n-1}, xn \\in R)\n+822 * with the tip of the pyramid mapped to t and x* = x/(1-xn)\n+823 * the projection of (x,xn) onto the base.\n+824 *\n+825 * For the Jacobi matrix DT we get\n+826 * DT = ( A | b )\n+827 * with A = DTb(x*) (n x n-1 matrix)\n+828 * and b = dT/dxn (n-dim column vector).\n+829 * Furthermore\n+830 * b = -Tb(x*) + t + \\sum_i dTb/dx_i(x^*) x_i/(1-xn)\n+831 *\n+832 * Note that both A and b are not defined in the pyramid tip (x=0, xn=1)!\n+833 * Indeed for B the unit square, Tb mapping B to the quadrilateral given\n+834 * by the vertices (0,0,0), (2,0,0), (0,1,0), (1,1,0) and t=(0,0,1), we get\n+835 *\n+836 * T(x,y,xn) = ( x(2-y/(1-xn)), y, xn )\n+837 * / 2-y/(1-xn) -x 0 \\\n+838 * DT(x,y,xn) = | 0 1 0 |\n+839 * \\ 0 0 1 /\n+840 * which is not continuous for xn -> 1, choose for example\n+841 * x=0, y=1-xn, xn -> 1 --> DT -> diag(1,1,1)\n+842 * x=1-xn, y=0, xn -> 1 --> DT -> diag(2,1,1)\n+843 *\n+844 * However, for Tb affine-linear, Tb(y) = My + y0, DTb = M:\n+845 * A = M\n+846 * b = -M x* - y0 + t + \\sum_i M_i x_i/(1-xn)\n+847 * = -M x* - y0 + t + M x*\n+848 * = -y0 + t\n+849 * which is continuous for xn -> 1. Note that this b is also given by\n+850 * b = -Tb(0) + t + \\sum_i dTb/dx_i(0) x_i/1\n+851 * that is replacing x* by 1 and 1-xn by 1 in the formular above.\n+852 *\n+853 * For xn -> 1, we can thus set x*=0, \"1-xn\"=1 (or anything != 0) and get\n+854 * the right result in case Tb is affine-linear.\n+855 */\n+856\n+857 /* The second case effectively results in x* = 0 */\n+858 _\bc_\bt_\by_\bp_\be dfcxn = (cxn > Traits::tolerance() || cxn < -Traits::tolerance()) ?\n+_\bc_\bt_\by_\bp_\be(df / cxn) : _\bc_\bt_\by_\bp_\be(0);\n+859\n+860 // initialize last row\n+861 // b = -Tb(x*)\n+862 // (b = -Tb(0) = -y0 in case xn -> 1 and Tb affine-linear)\n+863 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n+dfcxn, x, -rf, jt[ dim-1 ] );\n+864 // b += t\n+865 jt[ dim-1 ].axpy( rf, *cit );\n+866 ++cit;\n+867 // apply Jacobian for bottom (with argument x/(1-xn)) and correct last row\n+868 if( add )\n+869 {\n+870 FieldMatrix< _\bc_\bt_\by_\bp_\be, dim-1, coorddimension > jt2;\n+871 // jt2 = dTb/dx_i(x*)\n+872 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-\n+1 >(), cit2, dfcxn, x, rf, jt2 );\n+873 // A = dTb/dx_i(x*) (jt[j], j=0..dim-1)\n+874 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn) (jt[dim-1])\n+875 // (b += 0 in case xn -> 1)\n+876 for( int j = 0; j < dim-1; ++j )\n+877 {\n+878 jt[ j ] += jt2[ j ];\n+879 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt2[ j ] );\n+880 }\n+881 }\n+882 else\n+883 {\n+884 // jt = dTb/dx_i(x*)\n+885 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-\n+1 >(), cit2, dfcxn, x, rf, jt );\n+886 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn)\n+887 for( int j = 0; j < dim-1; ++j )\n+888 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt[ j ] );\n+889 }\n+890 }\n+891 }\n+892\n+893 template< class ct, int mydim, int cdim, class Traits >\n+894 template< bool add, int rows, class CornerIterator >\n+895 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b8_\b9_\b6_\b _\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >,\n+897 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &,\n+898 const _\bc_\bt_\by_\bp_\be &, FieldMatrix< ctype, rows, cdim > & )\n+899 {\n+900 ++cit;\n+901 }\n+902\n+903\n+904\n+905 template< class ct, int mydim, int cdim, class Traits >\n+906 template< int dim, class CornerIterator >\n+907 inline bool _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b9_\b0_\b8_\b _\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int, dim >,\n+CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n+909 {\n+910 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &orgBottom = *cit;\n+911 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jt )\n+)\n+912 return false;\n+913 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &orgTop = *cit;\n+914\n+915 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n+) )\n+916 {\n+917 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jtTop;\n+918 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jtTop\n+) )\n+919 return false;\n+920\n+921 // check whether both jacobians are identical\n+922 _\bc_\bt_\by_\bp_\be norm( 0 );\n+923 for( int i = 0; i < dim-1; ++i )\n+924 norm += (jtTop[ i ] - jt[ i ]).two_norm2();\n+925 if( norm >= Traits::tolerance() )\n+926 return false;\n+927 }\n+928 else\n+929 ++cit;\n+930 jt[ dim-1 ] = orgTop - orgBottom;\n+931 return true;\n+932 }\n+933\n+934 template< class ct, int mydim, int cdim, class Traits >\n+935 template< class CornerIterator >\n+936 inline bool _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+_\b9_\b3_\b7_\b _\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >, CornerIterator\n+&cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd & )\n+938 {\n+939 ++cit;\n+940 return true;\n+941 }\n+942\n+943} // namespace Dune\n+944\n+945#endif // #ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n _\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n An implementation of the Geometry interface for affine geometries.\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bz_\be\n-@ size\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:194\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Class providing access to the singletons of the reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n typename Container::ReferenceElement ReferenceElement\n The reference element type.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl\n-static const ReferenceElement & general(const GeometryType &type)\n-get general reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:156\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs\n+default traits class for MultiLinearGeometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:39\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n+Impl::FieldMatrixHelper< ct > MatrixHelper\n+helper structure containing some matrix routines\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:58\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be\n+static ct tolerance()\n+tolerance to numerical algorithms\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be\n+template specifying the storage for the corners\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:129\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be_\b:_\b:_\bT_\by_\bp_\be\n+std::vector< FieldVector< ct, cdim > > Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:130\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+will there be only one geometry type for a dimension?\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:148\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n+static const unsigned int topologyId\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:150\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bv\n+static const bool v\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+generic geometry implementation based on corner coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+static void global(TopologyId topologyId, std::integral_constant< int, dim >,\n+CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype\n+&rf, GlobalCoordinate &y)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:749\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const int mydimension\n+geometry dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:189\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n+Dune::GeometryType type() const\n+obtain the name of the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n+Traits::MatrixHelper MatrixHelper\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:225\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, coorddimension > GlobalCoordinate\n+type of global coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:196\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+static void jacobianTransposed(TopologyId topologyId, std::integral_constant<\n+int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const\n+ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:896\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n+obtain the transposed of the Jacobian\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:377\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ReferenceElement refElement() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:425\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+GlobalCoordinate global(const LocalCoordinate &local) const\n+evaluate the mapping\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:290\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n+GlobalCoordinate center() const\n+obtain the centroid of the mapping's image\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:282\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n+GlobalCoordinate corner(int i) const\n+obtain coordinates of the i-th corner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Dune::ReferenceElements< ctype, mydimension > ReferenceElements\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:214\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n+ct ctype\n+coordinate type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:186\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+static void jacobianTransposed(TopologyId topologyId, std::integral_constant<\n+int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x,\n+const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:794\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const int coorddimension\n+coordinate dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:191\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n+int corners() const\n+obtain number of corners of the corresponding reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:272\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n+TopologyId topologyId() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:430\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+friend ReferenceElement referenceElement(const MultiLinearGeometry &geometry)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:395\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+LocalCoordinate local(const GlobalCoordinate &globalCoord) const\n+evaluate the inverse mapping\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:312\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+static void global(TopologyId topologyId, std::integral_constant< int, 0 >,\n+CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype\n+&rf, GlobalCoordinate &y)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:780\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+Volume volume() const\n+obtain the volume of the mapping's image\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:363\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, mydimension > LocalCoordinate\n+type of local coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:194\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+MultiLinearGeometry(const ReferenceElement &refElement, const Corners &corners)\n+constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:239\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+static bool affine(TopologyId topologyId, std::integral_constant< int, 0 >,\n+CornerIterator &cit, JacobianTransposed &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:937\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n+std::conditional< hasSingleGeometryType, std::integral_constant< unsignedint,\n+Traits::templatehasSingleGeometryType< mydimension >::topologyId >, unsignedint\n+>::type TopologyId\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:226\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n+ctype Volume\n+type of volume\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:198\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+static bool affine(TopologyId topologyId, std::integral_constant< int, dim >,\n+CornerIterator &cit, JacobianTransposed &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:908\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n+Obtain the Jacobian's inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:418\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+MultiLinearGeometry(Dune::GeometryType gt, const Corners &corners)\n+constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:255\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed\n+type of jacobian transposed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:201\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ReferenceElements::ReferenceElement ReferenceElement\n+type of reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:219\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n+&local) const\n+obtain the transposed of the Jacobian's inverse\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:738\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+FieldMatrix< ctype, coorddimension, mydimension > Jacobian\n+Type for the Jacobian matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:207\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+bool affine() const\n+is this mapping affine?\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:262\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse\n+Type for the inverse Jacobian matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:210\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+bool affine(JacobianTransposed &jacobianT) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:458\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n+Volume integrationElement(const LocalCoordinate &local) const\n+obtain the integration element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:350\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+Jacobian jacobian(const LocalCoordinate &local) const\n+Obtain the Jacobian.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:407\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:488\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bs_\be_\bt_\bu_\bp\n+void setup(const JacobianTransposed &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:492\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bd_\be_\bt\n+ctype det() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:502\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bd_\be_\bt_\bI_\bn_\bv\n+ctype detInv() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:503\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt\n+void setupDeterminant(const JacobianTransposed &jt)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:497\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Implement a MultiLinearGeometry with additional caching.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:526\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+GlobalCoordinate global(const LocalCoordinate &local) const\n+evaluate the mapping\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:580\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+Base::ReferenceElement ReferenceElement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:534\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+bool affine() const\n+is this mapping affine?\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:567\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+CachedMultiLinearGeometry(const ReferenceElement &referenceElement, const\n+CornerStorage &cornerStorage)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:551\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ReferenceElement refElement() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:425\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+LocalCoordinate local(const GlobalCoordinate &global) const\n+evaluate the inverse mapping\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:604\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n+Base::MatrixHelper MatrixHelper\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:531\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Base::LocalCoordinate LocalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:541\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n+Obtain the Jacobian's inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:713\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n+obtain the transposed of the Jacobian\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:666\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n+GlobalCoordinate corner(int i) const\n+obtain coordinates of the i-th corner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+Volume volume() const\n+obtain the volume of the mapping's image\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:649\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+CachedMultiLinearGeometry(Dune::GeometryType gt, const CornerStorage\n+&cornerStorage)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:559\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ctype integrationElement(const LocalCoordinate &local) const\n+obtain the integration element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:633\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n+Base::ctype ctype\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:536\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+Jacobian jacobian(const LocalCoordinate &local) const\n+Obtain the Jacobian.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:702\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+Base::JacobianInverseTransposed JacobianInverseTransposed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:546\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+Base::JacobianTransposed JacobianTransposed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:545\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+Base::JacobianInverse JacobianInverse\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:548\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+Base::Jacobian Jacobian\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:547\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n+Base::Volume Volume\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:543\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+Base::GlobalCoordinate GlobalCoordinate\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:542\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n+GlobalCoordinate center() const\n+obtain the centroid of the mapping's image\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:572\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n+&local) const\n+obtain the transposed of the Jacobian's inverse\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:680\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+Unique label for each type of entities that can occur in DUNE grids.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00209.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00209.html", "unified_diff": "@@ -87,20 +87,20 @@\n #include <type_traits>
    \n #include <dune/common/copyableoptional.hh>
    \n #include <dune/common/exceptions.hh>
    \n #include <dune/common/fmatrix.hh>
    \n #include <dune/common/fvector.hh>
    \n #include <dune/common/math.hh>
    \n #include <dune/common/transpose.hh>
    \n-#include <dune/geometry/affinegeometry.hh>
    \n-#include <dune/geometry/quadraturerules.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include <dune/geometry/utility/algorithms.hh>
    \n-#include <dune/geometry/utility/convergence.hh>
    \n+#include <dune/geometry/affinegeometry.hh>
    \n+#include <dune/geometry/quadraturerules.hh>
    \n+#include <dune/geometry/referenceelements.hh>
    \n+#include <dune/geometry/type.hh>
    \n+#include <dune/geometry/utility/algorithms.hh>
    \n+#include <dune/geometry/utility/convergence.hh>
    \n \n

    Go to the source code of this file.

    \n \n \n \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00209_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00209_source.html", "unified_diff": "@@ -96,20 +96,20 @@\n
    13
    \n
    14#include <dune/common/copyableoptional.hh>
    \n
    15#include <dune/common/exceptions.hh>
    \n
    16#include <dune/common/fmatrix.hh>
    \n
    17#include <dune/common/fvector.hh>
    \n
    18#include <dune/common/math.hh>
    \n
    19#include <dune/common/transpose.hh>
    \n-
    20#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
    \n-\n-\n-
    23#include <dune/geometry/type.hh>
    \n-\n-\n+
    20#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
    \n+\n+\n+
    23#include <dune/geometry/type.hh>
    \n+\n+\n
    26
    \n
    27namespace Dune {
    \n
    28
    \n
    63template <class Map, class Geo>
    \n
    \n \n
    65{
    \n@@ -342,20 +342,20 @@\n
    360template <class Map, class Geo>
    \n
    361MappedGeometry (const Map&, const Geo&, bool)
    \n \n
    363
    \n
    364} // end namespace Dune
    \n
    365
    \n
    366#endif // DUNE_GEOMETRY_MAPPEDGEOMETRY_HH
    \n-
    An implementation of the Geometry interface for affine geometries.
    \n-\n-\n-\n-\n-
    A unique label for each type of element that can occur in a grid.
    \n+
    An implementation of the Geometry interface for affine geometries.
    \n+\n+
    A unique label for each type of element that can occur in a grid.
    \n+\n+\n+\n
    STL namespace.
    \n
    Definition affinegeometry.hh:21
    \n
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n
    Geometry parametrized by a LocalFunction and a LocalGeometry.
    Definition mappedgeometry.hh:65
    \n
    std::remove_reference_t< decltype(std::declval< Map >()(std::declval< typename Geo::GlobalCoordinate >()))> GlobalCoordinate
    type of global coordinates
    Definition mappedgeometry.hh:71
    \n
    GlobalCoordinate center() const
    Map the center of the wrapped geometry.
    Definition mappedgeometry.hh:162
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -243,20 +243,20 @@\n 362 -> _\bM_\ba_\bp_\bp_\be_\bd_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bM_\ba_\bp_\b,_\bG_\be_\bo_\b>;\n 363\n 364} // end namespace Dune\n 365\n 366#endif // DUNE_GEOMETRY_MAPPEDGEOMETRY_HH\n _\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n An implementation of the Geometry interface for affine geometries.\n-_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh\n-_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh\n-_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh\n _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh\n+_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh\n+_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh\n _\bs_\bt_\bd\n STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n Class providing access to the singletons of the reference elements.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00212.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00212.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: generalvertexorder.hh File Reference\n+dune-geometry: referenceelementimplementation.cc File Reference\n \n \n \n \n \n \n \n@@ -70,51 +70,26 @@\n
    \n \n
    \n
    \n
    \n \n-
    generalvertexorder.hh File Reference
    \n+Namespaces
    \n+
    referenceelementimplementation.cc File Reference
    \n \n
    \n-
    #include <algorithm>
    \n-#include <cassert>
    \n-#include <cstddef>
    \n-#include <iterator>
    \n-#include <vector>
    \n-#include <dune/common/iteratorfacades.hh>
    \n-#include "type.hh"
    \n-#include <dune/geometry/referenceelements.hh>
    \n-
    \n-

    Go to the source code of this file.

    \n-

    \n Classes

    class  Dune::MappedGeometry< Map, Geo >
     Geometry parametrized by a LocalFunction and a LocalGeometry. More...
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  Dune::GeneralVertexOrder< dim, Index_ >
     Class providing information on the ordering of vertices. More...
     
    class  Dune::GeneralVertexOrder< dim, Index_ >::iterator
     Iterate over the vertex indices of some sub-entity. More...
     
    \n+
    \n \n \n \n-

    \n Namespaces

    namespace  Dune
     
    \n-\n-\n-\n-\n-\n+\n+\n

    \n-Functions

    template<class InIterator , class OutIterator >
    void Dune::reduceOrder (const InIterator &inBegin, const InIterator &inEnd, OutIterator outIt)
     Algorithm to reduce vertex order information.
     
    namespace  Dune::Geo
     
    \n \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,35 +1,16 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-generalvertexorder.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-_\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\b,_\b _\bI_\bn_\bd_\be_\bx_\b__\b _\b>\n-\u00a0 Class providing information on the ordering of vertices. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\b,_\b _\bI_\bn_\bd_\be_\bx_\b__\b _\b>_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-\u00a0 Iterate over the vertex indices of some sub-entity. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+referenceelementimplementation.cc File Reference\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br (const InIterator &inBegin, const InIterator &inEnd,\n- OutIterator outIt)\n-\u00a0 Algorithm to reduce vertex order information.\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00215.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00215.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: pyramidtriangulation.cc File Reference\n+dune-geometry: convergence.hh File Reference\n \n \n \n \n \n \n \n@@ -65,86 +65,33 @@\n \n \n \n \n \n \n \n
    \n \n-
    pyramidtriangulation.cc File Reference
    \n+Namespaces
    \n+
    convergence.hh File Reference
    \n \n
    \n-
    #include <dune/common/fvector.hh>
    \n-#include <dune/common/typetraits.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include "base.cc"
    \n-#include "simplex.cc"
    \n+
    #include <cmath>
    \n+#include <limits>
    \n
    \n

    Go to the source code of this file.

    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >
     Implementation of the refinement of a pyramid into simplices. More...
     
    struct  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    class  Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
     
    class  Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::RefinementImp::PyramidTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    namespace  Dune::RefinementImp::PyramidTriangulation
     This namespace contains the Refinement implementation for triangulating pyramids (GeometryType::pyramid -> GeometryType::simplex)
     
    \n-\n-\n-\n-

    \n-Macros

    #define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
     
    \n-\n-\n-\n-\n

    \n-Functions

    template<int dimension, class CoordType >
    FieldVector< CoordType, dimension > Dune::RefinementImp::PyramidTriangulation::transformCoordinate (FieldVector< CoordType, dimension > point)
     
    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
    \n-
    \n-\n-
    \n-
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,59 +1,17 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-pyramidtriangulation.cc File Reference\n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+convergence.hh File Reference\n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0 Implementation of the refinement of a pyramid into simplices. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n-\u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n- This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n-\u00a0 triangulating pyramids (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\by_\br_\ba_\bm_\bi_\bd -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:\n- _\bs_\bi_\bm_\bp_\bl_\be_\bx)\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bP_\bY_\bR_\bA_\bM_\bI_\bD_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n-\u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:\n- _\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n- (FieldVector< CoordType, dimension >\n- point)\n-\u00a0\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_P\bPY\bYR\bRA\bAM\bMI\bID\bDT\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00215_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00215_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: pyramidtriangulation.cc Source File\n+dune-geometry: convergence.hh Source File\n \n \n \n \n \n \n \n@@ -70,524 +70,44 @@\n
    \n \n \n \n \n \n \n
    \n-
    pyramidtriangulation.cc
    \n+
    convergence.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
    \n-
    6#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
    \n+
    5#ifndef DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
    \n+
    6#define DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
    \n
    7
    \n-
    8#include <dune/common/fvector.hh>
    \n-
    9#include <dune/common/typetraits.hh>
    \n+
    8#include <cmath>
    \n+
    9#include <limits>
    \n
    10
    \n-\n-
    12#include <dune/geometry/type.hh>
    \n-
    13
    \n-
    14#include "base.cc"
    \n-
    15#include "simplex.cc"
    \n-
    16
    \n-
    17namespace Dune
    \n-
    18{
    \n-
    19 namespace RefinementImp
    \n-
    20 {
    \n-
    \n-
    26 namespace PyramidTriangulation
    \n-
    27 {
    \n-
    28 // ////////////
    \n-
    29 //
    \n-
    30 // Utilities
    \n-
    31 //
    \n-
    32
    \n-\n-\n-
    35
    \n-
    36 // ////////////////////////////////////
    \n-
    37 //
    \n-
    38 // Refine a pyramid with simplices
    \n-
    39 //
    \n-
    40
    \n-
    41 // forward declaration of the iterator base
    \n-
    42 template<int dimension, class CoordType, int codimension>
    \n-\n-
    44
    \n-
    45 /*
    \n-
    46 * The permutations 0 and 1 of the Kuhn-decomposition of a cube into simplices form a pyramid.
    \n-
    47 * The resulting pyramid is not oriented the same as the reference pyramid and so the Kuhn-coordinates
    \n-
    48 * have to be transformed using the method below.
    \n-
    49 */
    \n-
    50 template<int dimension, class CoordType> FieldVector<CoordType, dimension>
    \n-
    \n-
    51 transformCoordinate( FieldVector<CoordType, dimension> point)
    \n-
    52 {
    \n-
    53 FieldVector<CoordType, dimension> transform;
    \n-
    54 transform[0]=1-point[0];
    \n-
    55 transform[1]=1-point[1];
    \n-
    56 transform[2]=point[2];
    \n-
    57 return transform;
    \n-
    58 }
    \n-
    \n-
    59
    \n-
    66 template<int dimension_, class CoordType>
    \n-
    \n-\n-
    68 {
    \n-
    69 public:
    \n-
    70 constexpr static int dimension = dimension_;
    \n-
    71
    \n-
    72 typedef CoordType ctype;
    \n-
    73
    \n-
    74 template<int codimension>
    \n-
    75 struct Codim;
    \n-\n-
    77 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-\n-
    79 typedef FieldVector<int, dimension+1> IndexVector;
    \n-
    80
    \n-
    81 static int nVertices(int nIntervals);
    \n-
    82 static VertexIterator vBegin(int nIntervals);
    \n-
    83 static VertexIterator vEnd(int nIntervals);
    \n-
    84
    \n-
    85 static int nElements(int nIntervals);
    \n-
    86 static ElementIterator eBegin(int nIntervals);
    \n-
    87 static ElementIterator eEnd(int nIntervals);
    \n-
    88
    \n-
    89 private:
    \n-
    90 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
    \n-
    91 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
    \n-
    92
    \n-\n-
    94
    \n-
    95 constexpr static int nKuhnSimplices = 2;
    \n-
    96 };
    \n-
    \n-
    97
    \n-
    98 template<int dimension, class CoordType>
    \n-
    99 template<int codimension>
    \n-
    \n-
    100 struct RefinementImp<dimension, CoordType>::Codim
    \n-
    101 {
    \n-
    102 class SubEntityIterator;
    \n-\n-
    104 };
    \n-
    \n-
    105
    \n-
    106 template<int dimension, class CoordType>
    \n-
    107 int
    \n-
    \n-\n-
    109 nVertices(int nIntervals)
    \n-
    110 {
    \n-
    111 return BackendRefinement::nVertices(nIntervals) * nKuhnSimplices;
    \n-
    112 }
    \n-
    \n-
    113
    \n-
    114 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    117 vBegin(int nIntervals)
    \n-
    118 {
    \n-
    119 return VertexIterator(nIntervals);
    \n-
    120 }
    \n-
    \n-
    121
    \n-
    122 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    125 vEnd(int nIntervals)
    \n-
    126 {
    \n-
    127 return VertexIterator(nIntervals, true);
    \n-
    128 }
    \n-
    \n-
    129
    \n-
    130 template<int dimension, class CoordType>
    \n-
    131 int
    \n-
    \n-\n-
    133 nElements(int nIntervals)
    \n-
    134 {
    \n-
    135 return BackendRefinement::nElements(nIntervals) * nKuhnSimplices;
    \n-
    136 }
    \n-
    \n-
    137
    \n-
    138 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    141 eBegin(int nIntervals)
    \n-
    142 {
    \n-
    143 return ElementIterator(nIntervals);
    \n-
    144 }
    \n-
    \n-
    145
    \n-
    146 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    149 eEnd(int nIntervals)
    \n-
    150 {
    \n-
    151 return ElementIterator(nIntervals, true);
    \n-
    152 }
    \n-
    \n-
    153
    \n-
    154 // //////////////
    \n-
    155 //
    \n-
    156 // The iterator
    \n-
    157 //
    \n-
    158
    \n-
    159 // vertices
    \n-
    160 template<int dimension, class CoordType>
    \n-
    \n-
    161 class RefinementIteratorSpecial<dimension, CoordType, dimension>
    \n-
    162 {
    \n-
    163 public:
    \n-\n-
    165 typedef typename Refinement::CoordVector CoordVector;
    \n-
    166 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
    \n-
    167
    \n-
    168 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    169
    \n-
    170 void increment();
    \n-
    171
    \n-
    172 CoordVector coords() const;
    \n-
    173
    \n-
    174 Geometry geometry() const;
    \n-
    175
    \n-
    176 int index() const;
    \n-
    177 protected:
    \n-
    178 typedef typename Refinement::BackendRefinement BackendRefinement;
    \n-
    179 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
    \n-
    180 constexpr static int nKuhnSimplices = 2;
    \n-
    181
    \n-\n-
    183
    \n-\n-\n-\n-
    187 };
    \n-
    \n-
    188
    \n-
    189 template<int dimension, class CoordType>
    \n-
    \n-\n-
    191 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    192 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    193 backend(BackendRefinement::vBegin(nIntervals_)),
    \n-
    194 backendEnd(BackendRefinement::vEnd(nIntervals_))
    \n-
    195 {
    \n-
    196 if (end)
    \n-
    197 kuhnIndex = nKuhnSimplices;
    \n-
    198 }
    \n-
    \n-
    199
    \n-
    200 template<int dimension, class CoordType>
    \n-
    201 void
    \n-
    \n-\n-\n-
    204 {
    \n-
    205 ++backend;
    \n-
    206 if(backend == backendEnd)
    \n-
    207 {
    \n-
    208 backend = BackendRefinement::vBegin(nIntervals_);
    \n-
    209 ++kuhnIndex;
    \n-
    210 }
    \n-
    211 }
    \n-
    \n-
    212
    \n-
    213 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    216 coords() const
    \n-
    217 {
    \n-
    218 return transformCoordinate(referenceToKuhn(backend.coords(),
    \n-
    219 getPermutation<dimension>(kuhnIndex)));
    \n-
    220 }
    \n-
    \n-
    221
    \n-
    222 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    225 {
    \n-
    226 std::vector<CoordVector> corners(1);
    \n-
    227 corners[0] = referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
    \n-
    228 return Geometry(GeometryTypes::vertex, corners);
    \n-
    229 }
    \n-
    \n-
    230
    \n-
    231 template<int dimension, class CoordType>
    \n-
    232 int
    \n-
    \n-\n-
    234 index() const
    \n-
    235 {
    \n-
    236 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
    \n-
    237 }
    \n-
    \n-
    238
    \n-
    239 // elements
    \n-
    240 template<int dimension, class CoordType>
    \n-
    \n-
    241 class RefinementIteratorSpecial<dimension, CoordType, 0>
    \n-
    242 {
    \n-
    243 public:
    \n-\n-\n-\n-
    247 typedef typename Refinement::template Codim<0>::Geometry Geometry;
    \n-
    248
    \n-
    249 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    250
    \n-
    251 void increment();
    \n-
    252
    \n-
    253 IndexVector vertexIndices() const;
    \n-
    254 int index() const;
    \n-
    255 CoordVector coords() const;
    \n-
    256
    \n-
    257 Geometry geometry() const;
    \n-
    258
    \n-
    259 private:
    \n-
    260 CoordVector global(const CoordVector &local) const;
    \n-
    261
    \n-
    262 protected:
    \n-\n-
    264 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
    \n-
    265 constexpr static int nKuhnSimplices = 2;
    \n-
    266
    \n-\n-
    268
    \n-\n-\n-\n-
    272 };
    \n-
    \n-
    273
    \n-
    274 template<int dimension, class CoordType>
    \n-
    \n-\n-
    276 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    277 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    278 backend(BackendRefinement::eBegin(nIntervals_)),
    \n-
    279 backendEnd(BackendRefinement::eEnd(nIntervals_))
    \n-
    280 {
    \n-
    281 if (end)
    \n-
    282 kuhnIndex = nKuhnSimplices;
    \n-
    283 }
    \n-
    \n-
    284
    \n-
    285 template<int dimension, class CoordType>
    \n-
    286 void
    \n-
    \n-\n-\n-
    289 {
    \n-
    290 ++backend;
    \n-
    291 if (backend == backendEnd)
    \n-
    292 {
    \n-
    293 backend = BackendRefinement::eBegin(nIntervals_);
    \n-
    294 ++kuhnIndex;
    \n-
    295 }
    \n-
    296 }
    \n-
    \n-
    297
    \n-
    298 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    301 vertexIndices() const
    \n-
    302 {
    \n-
    303 IndexVector indices = backend.vertexIndices();
    \n-
    304
    \n-
    305 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
    \n-
    306 indices += base;
    \n-
    307
    \n-
    308 return indices;
    \n-
    309 }
    \n-
    \n-
    310
    \n-
    311 template<int dimension, class CoordType>
    \n-
    312 int
    \n-
    \n-\n-
    314 index() const
    \n-
    315 {
    \n-
    316 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
    \n-
    317 }
    \n-
    \n-
    318
    \n-
    319 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    322 coords() const
    \n-
    323 {
    \n-
    324 return global(backend.coords());
    \n-
    325 }
    \n-
    \n-
    326
    \n-
    327 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    330 geometry() const
    \n-
    331 {
    \n-
    332 const typename BackendIterator::Geometry &
    \n-
    333 bgeo = backend.geometry();
    \n-
    334 std::vector<CoordVector> corners(dimension+1);
    \n-
    335 for(int i = 0; i <= dimension; ++i)
    \n-
    336 corners[i] = global(bgeo.corner(i));
    \n-
    337
    \n-
    338 return Geometry(bgeo.type(), corners);
    \n-
    339 }
    \n-
    \n-
    340
    \n-
    341 template<int dimension, class CoordType>
    \n-\n-
    343 CoordVector
    \n-\n-
    345 global(const CoordVector &local) const
    \n-
    346 {
    \n-
    347 return transformCoordinate(referenceToKuhn(local,
    \n-
    348 getPermutation<dimension>(kuhnIndex)));
    \n-
    349 }
    \n-
    350
    \n-
    351 // common
    \n-
    352 template<int dimension, class CoordType>
    \n-
    353 template<int codimension>
    \n-
    \n-
    354 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    355 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    356 public RefinementIteratorSpecial<dimension, CoordType, codimension>
    \n-
    357 {
    \n-
    358 public:
    \n-\n-
    360 typedef SubEntityIterator This;
    \n-
    361
    \n-
    362 SubEntityIterator(int nIntervals, bool end = false);
    \n-
    363
    \n-
    364 bool equals(const This &other) const;
    \n-
    365 protected:
    \n-
    366 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
    \n-
    367 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
    \n-
    368 };
    \n-
    \n-
    369
    \n-
    370#ifndef DOXYGEN
    \n-
    371 template<int dimension, class CoordType>
    \n-
    372 template<int codimension>
    \n-\n-
    374 SubEntityIterator(int nIntervals, bool end)
    \n-
    375 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
    \n-
    376 {}
    \n-
    377
    \n-
    378 template<int dimension, class CoordType>
    \n-
    379 template<int codimension>
    \n-
    380 bool
    \n-\n-
    382 equals(const This &other) const
    \n-
    383 {
    \n-
    384 return kuhnIndex == other.kuhnIndex && backend == other.backend;
    \n-
    385 }
    \n-
    386#endif
    \n-
    387
    \n-
    388 } // namespace PyramidTriangulation
    \n-
    \n-
    389 } // namespace RefinementImp
    \n-
    390
    \n-
    391 namespace RefinementImp
    \n-
    392 {
    \n-
    393 // ///////////////////////
    \n-
    394 //
    \n-
    395 // The refinement traits
    \n-
    396 //
    \n-
    397#ifndef DOXYGEN
    \n-
    398 template<unsigned topologyId, class CoordType, unsigned coerceToId>
    \n-
    399 struct Traits<
    \n-
    400 topologyId, CoordType, coerceToId, 3,
    \n-
    401 typename std::enable_if<
    \n-
    402 (GeometryTypes::pyramid.id() >> 1) ==
    \n-
    403 (topologyId >> 1) &&
    \n-
    404 (GeometryTypes::simplex(3).id() >> 1) ==
    \n-
    405 (coerceToId >> 1)
    \n-
    406 >::type>
    \n-
    407 {
    \n-
    408 typedef PyramidTriangulation::RefinementImp<3, CoordType> Imp;
    \n-
    409 };
    \n-
    410#endif
    \n-
    411
    \n-
    412 } // namespace RefinementImp
    \n-
    413} // namespace Dune
    \n-
    414
    \n-
    415#endif // DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC
    \n-
    This file contains the parts independent of a particular Refinement implementation.
    \n-
    This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    STL namespace.
    \n-
    Definition affinegeometry.hh:21
    \n-
    FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType, dimension > point)
    Definition pyramidtriangulation.cc:51
    \n-
    FieldVector< int, n > getPermutation(int m)
    Calculate permutation from it's index.
    Definition simplex.cc:293
    \n-
    FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
    Map from the reference simplex to some Kuhn simplex.
    Definition simplex.cc:322
    \n-
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    generic geometry implementation based on corner coordinates
    Definition multilineargeometry.hh:181
    \n-\n-
    Implementation of the refinement of a pyramid into simplices.
    Definition pyramidtriangulation.cc:68
    \n-
    FieldVector< CoordType, dimension > CoordVector
    Definition pyramidtriangulation.cc:77
    \n-
    static int nVertices(int nIntervals)
    Definition pyramidtriangulation.cc:109
    \n-
    static int nElements(int nIntervals)
    Definition pyramidtriangulation.cc:133
    \n-
    CoordType ctype
    Definition pyramidtriangulation.cc:72
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    Definition pyramidtriangulation.cc:76
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    Definition pyramidtriangulation.cc:78
    \n-
    static constexpr int dimension
    Definition pyramidtriangulation.cc:70
    \n-
    static ElementIterator eBegin(int nIntervals)
    Definition pyramidtriangulation.cc:141
    \n-
    static ElementIterator eEnd(int nIntervals)
    Definition pyramidtriangulation.cc:149
    \n-
    FieldVector< int, dimension+1 > IndexVector
    Definition pyramidtriangulation.cc:79
    \n-
    static VertexIterator vBegin(int nIntervals)
    Definition pyramidtriangulation.cc:117
    \n-
    static VertexIterator vEnd(int nIntervals)
    Definition pyramidtriangulation.cc:125
    \n-\n-
    Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
    Definition pyramidtriangulation.cc:103
    \n-
    RefinementImp< dimension, CoordType > Refinement
    Definition pyramidtriangulation.cc:164
    \n-
    Refinement::template Codim< dimension >::Geometry Geometry
    Definition pyramidtriangulation.cc:166
    \n-
    Refinement::BackendRefinement BackendRefinement
    Definition pyramidtriangulation.cc:178
    \n-\n-
    BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
    Definition pyramidtriangulation.cc:179
    \n-\n-\n-\n-\n-\n-
    Refinement::CoordVector CoordVector
    Definition pyramidtriangulation.cc:246
    \n-\n-
    Refinement::template Codim< 0 >::Geometry Geometry
    Definition pyramidtriangulation.cc:247
    \n-
    Refinement::IndexVector IndexVector
    Definition pyramidtriangulation.cc:245
    \n-
    BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
    Definition pyramidtriangulation.cc:264
    \n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition pyramidtriangulation.cc:244
    \n-
    Refinement::BackendRefinement BackendRefinement
    Definition pyramidtriangulation.cc:263
    \n-\n-
    SubEntityIterator This
    Definition pyramidtriangulation.cc:360
    \n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition pyramidtriangulation.cc:359
    \n-\n+
    11namespace Dune::Impl {
    \n+
    12
    \n+
    13template <class R = double>
    \n+
    14struct ConvergenceOptions
    \n+
    15{
    \n+
    17 int maxIt = 100;
    \n+
    18
    \n+
    20 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits<R>::epsilon()); }();
    \n+
    21};
    \n+
    22
    \n+
    23} // end namespace Dune::Impl
    \n+
    24
    \n+
    25#endif // DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,606 +1,36 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-pyramidtriangulation.cc\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+convergence.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n-_\b6#define DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n+5#ifndef DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n+6#define DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n 7\n-8#include \n-9#include \n+8#include \n+9#include \n 10\n-11#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-12#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-13\n-14#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-15#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n-16\n-17namespace _\bD_\bu_\bn_\be\n-18{\n-19 namespace RefinementImp\n-20 {\n-_\b2_\b6 namespace PyramidTriangulation\n-27 {\n-28 // ////////////\n-29 //\n-30 // Utilities\n-31 //\n-32\n-33 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n-34 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n-35\n-36 // ////////////////////////////////////\n-37 //\n-38 // Refine a pyramid with simplices\n-39 //\n-40\n-41 // forward declaration of the iterator base\n-42 template\n-_\b4_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-44\n-45 /*\n-46 * The permutations 0 and 1 of the Kuhn-decomposition of a cube into\n-simplices form a pyramid.\n-47 * The resulting pyramid is not oriented the same as the reference pyramid\n-and so the Kuhn-coordinates\n-48 * have to be transformed using the method below.\n-49 */\n-50 template FieldVector\n-_\b5_\b1 _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be( FieldVector point)\n-52 {\n-53 FieldVector transform;\n-54 transform[0]=1-point[0];\n-55 transform[1]=1-point[1];\n-56 transform[2]=point[2];\n-57 return transform;\n-58 }\n-59\n-66 template\n-_\b6_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-68 {\n-69 public:\n-_\b7_\b0 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n-71\n-_\b7_\b2 typedef CoordType _\bc_\bt_\by_\bp_\be;\n-73\n-74 template\n-75 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b7_\b6 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b7 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b7_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b9 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-80\n-81 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n-82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-83 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n-84\n-85 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n-86 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-_\b8_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n-88\n-89 private:\n-90 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n-91 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n-92\n-93 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-94\n-95 constexpr static int nKuhnSimplices = 2;\n-96 };\n-97\n-98 template\n-99 template\n-_\b1_\b0_\b0 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n-101 {\n-102 class SubEntityIterator;\n-_\b1_\b0_\b3 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-104 };\n-105\n-106 template\n-107 int\n-_\b1_\b0_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-109_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n-110 {\n-111 return BackendRefinement::nVertices(nIntervals) * nKuhnSimplices;\n-112 }\n-113\n-114 template\n-115 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-117_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-118 {\n-119 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-120 }\n-121\n-122 template\n-123 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-125_\b _\bv_\bE_\bn_\bd(int nIntervals)\n-126 {\n-127 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-128 }\n-129\n-130 template\n-131 int\n-_\b1_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-133_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n-134 {\n-135 return BackendRefinement::nElements(nIntervals) * nKuhnSimplices;\n-136 }\n-137\n-138 template\n-139 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b4_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-141_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-142 {\n-143 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-144 }\n-145\n-146 template\n-147 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b4_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-149_\b _\be_\bE_\bn_\bd(int nIntervals)\n-150 {\n-151 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-152 }\n-153\n-154 // //////////////\n-155 //\n-156 // The iterator\n-157 //\n-158\n-159 // vertices\n-160 template\n-_\b1_\b6_\b1 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-162 {\n-163 public:\n-_\b1_\b6_\b4 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b6_\b5 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b1_\b6_\b6 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-167\n-168 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-169\n-170 void increment();\n-171\n-172 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-173\n-174 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n-175\n-176 int index() const;\n-177 protected:\n-_\b1_\b7_\b8 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b7_\b9 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b8_\b0 constexpr static int nKuhnSimplices = 2;\n-181\n-_\b1_\b8_\b2 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n-183\n-_\b1_\b8_\b4 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b1_\b8_\b5 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b1_\b8_\b6 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-187 };\n-188\n-189 template\n-_\b1_\b9_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-191_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-192 : nIntervals_(nIntervals), kuhnIndex(0),\n-193 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n-194 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n-195 {\n-196 if (end)\n-197 kuhnIndex = nKuhnSimplices;\n-198 }\n-199\n-200 template\n-201 void\n-_\b2_\b0_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-203_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-204 {\n-205 ++backend;\n-206 if(backend == backendEnd)\n-207 {\n-208 backend = BackendRefinement::vBegin(nIntervals_);\n-209 ++kuhnIndex;\n-210 }\n-211 }\n-212\n-213 template\n-214 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b2_\b1_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-216_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-217 {\n-218 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n-219 getPermutation(kuhnIndex)));\n-220 }\n-221\n-222 template\n-223 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b2_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n-const\n-225 {\n-226 std::vector corners(1);\n-227 corners[0] = referenceToKuhn(backend.coords(), getPermutation\n-(kuhnIndex));\n-228 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n-229 }\n-230\n-231 template\n-232 int\n-_\b2_\b3_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-234_\b _\bi_\bn_\bd_\be_\bx() const\n-235 {\n-236 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n-();\n-237 }\n-238\n-239 // elements\n-240 template\n-_\b2_\b4_\b1 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-242 {\n-243 public:\n-_\b2_\b4_\b4 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b4_\b5 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b6 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b7 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-248\n-249 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-250\n-251 void increment();\n-252\n-253 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-254 int index() const;\n-255 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-256\n-257 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n-258\n-259 private:\n-260 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n-261\n-262 protected:\n-_\b2_\b6_\b3 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b6_\b4 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b2_\b6_\b5 constexpr static int nKuhnSimplices = 2;\n-266\n-_\b2_\b6_\b7 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n-268\n-_\b2_\b6_\b9 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b2_\b7_\b0 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b2_\b7_\b1 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-272 };\n-273\n-274 template\n-_\b2_\b7_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-276_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-277 : nIntervals_(nIntervals), kuhnIndex(0),\n-278 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n-279 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n-280 {\n-281 if (end)\n-282 kuhnIndex = nKuhnSimplices;\n-283 }\n-284\n-285 template\n-286 void\n-_\b2_\b8_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-288_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-289 {\n-290 ++backend;\n-291 if (backend == backendEnd)\n-292 {\n-293 backend = BackendRefinement::eBegin(nIntervals_);\n-294 ++kuhnIndex;\n-295 }\n-296 }\n-297\n-298 template\n-299 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b0_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-301_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-302 {\n-303 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n-304\n-305 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n-306 indices += base;\n-307\n-308 return indices;\n-309 }\n-310\n-311 template\n-312 int\n-_\b3_\b1_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-314_\b _\bi_\bn_\bd_\be_\bx() const\n-315 {\n-316 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n-();\n-317 }\n-318\n-319 template\n-320 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-322_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-323 {\n-324 return global(backend.coords());\n-325 }\n-326\n-327 template\n-328 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b3_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-330_\b _\bg_\be_\bo_\bm_\be_\bt_\br_\by() const\n-331 {\n-332 const typename BackendIterator::Geometry &\n-333 bgeo = backend.geometry();\n-334 std::vector corners(dimension+1);\n-335 for(int i = 0; i <= dimension; ++i)\n-336 corners[i] = global(bgeo.corner(i));\n-337\n-338 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n-339 }\n-340\n-341 template\n-342 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>::\n-343 CoordVector\n-344 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-345_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n-346 {\n-347 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(local,\n-348 getPermutation(kuhnIndex)));\n-349 }\n-350\n-351 // common\n-352 template\n-353 template\n-_\b3_\b5_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-355 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-356 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-357 {\n-358 public:\n-_\b3_\b5_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b3_\b6_\b0 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n-361\n-_\b3_\b6_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n-363\n-_\b3_\b6_\b4 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n-365 protected:\n-366 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-kuhnIndex;\n-367 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-backend;\n-368 };\n-369\n-370#ifndef DOXYGEN\n-371 template\n-372 template\n-373 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-374_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n-375 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n-end)\n-376 {}\n-377\n-378 template\n-379 template\n-380 bool\n-381 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-382_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n-383 {\n-384 return kuhnIndex == other.kuhnIndex && backend == other.backend;\n-385 }\n-386#endif\n-387\n-388 } // namespace PyramidTriangulation\n-389 } // namespace RefinementImp\n-390\n-391 namespace RefinementImp\n-392 {\n-393 // ///////////////////////\n-394 //\n-395 // The refinement traits\n-396 //\n-397#ifndef DOXYGEN\n-398 template\n-399 struct Traits<\n-400 topologyId, CoordType, coerceToId, 3,\n-401 typename _\bs_\bt_\bd::enable_if<\n-402 (GeometryTypes::pyramid.id() >> 1) ==\n-403 (topologyId >> 1) &&\n-404 (GeometryTypes::simplex(3).id() >> 1) ==\n-405 (coerceToId >> 1)\n-406 >::type>\n-407 {\n-408 typedef PyramidTriangulation::RefinementImp<3, CoordType> Imp;\n-409 };\n-410#endif\n-411\n-412 } // namespace RefinementImp\n-413} // namespace Dune\n-414\n-415#endif // DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n-_\bb_\ba_\bs_\be_\b._\bc_\bc\n-This file contains the parts independent of a particular Refinement\n-implementation.\n-_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n-This file contains the Refinement implementation for simplices (triangles,\n-tetrahedrons....\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n-_\bt_\by_\bp_\be_\b._\bh_\bh\n-A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n-_\bD_\bu_\bn_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType,\n-dimension > point)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:51\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n-FieldVector< int, n > getPermutation(int m)\n-Calculate permutation from it's index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n-FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n-dimension > point, const FieldVector< int, dimension > &kuhn)\n-Map from the reference simplex to some Kuhn simplex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Static tag representing a codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-generic geometry implementation based on corner coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-Implementation of the refinement of a pyramid into simplices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:109\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:133\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n-CoordType ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:72\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:76\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:70\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:149\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< int, dimension+1 > IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:79\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:117\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:125\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:101\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n-Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:103\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:164\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< dimension >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:166\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:185\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< dimension >::SubEntityIterator\n-BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:179\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:184\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:165\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:186\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:182\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:271\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:246\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:267\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< 0 >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:247\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:245\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:264\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:270\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:244\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-_\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n-bool equals(const This &other) const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-_\b>_\b:_\b:_\bT_\bh_\bi_\bs\n-SubEntityIterator This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:360\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(int nIntervals, bool end=false)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\by_\br_\ba_\bm_\bi_\bd_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-_\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn pyramidtriangulation.cc:359\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n+11namespace Dune::Impl {\n+12\n+13template \n+14struct ConvergenceOptions\n+15{\n+17 int maxIt = 100;\n+18\n+20 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits::epsilon\n+()); }();\n+21};\n+22\n+23} // end namespace Dune::Impl\n+24\n+25#endif // DUNE_GEOMETRY_UTILITY_CONVERGENCE_HH\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00218.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00218.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: base.cc File Reference\n+dune-geometry: typefromvertexcount.hh File Reference\n \n \n \n \n \n \n \n@@ -65,87 +65,39 @@\n \n \n \n \n \n \n \n
    \n \n-
    base.cc File Reference
    \n+
    typefromvertexcount.hh File Reference
    \n
    \n
    \n-\n-

    This file contains the parts independent of a particular Refinement implementation. \n-More...

    \n-
    #include <dune/geometry/type.hh>
    \n+
    #include <dune/geometry/type.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  Dune::RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension, Dummy >
     Mapping from geometryType, CoordType and coerceTo to a particular Refinement implementation. More...
     
    class  Dune::RefinementIntervals
     Holds the number of refined intervals per axis needed for virtual and static refinement. More...
     
    class  Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension_ >
     Wrap each Refinement implementation to get a consistent interface. More...
     
    struct  Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension_ >::Codim< codimension >
     The Codim struct inherited from the Refinement implementation. More...
     
    \n \n \n \n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    \n-\n-\n-\n

    \n-Macros

    #define DUNE_GEOMETRY_REFINEMENT_BASE_CC
     
    \n \n-\n-\n-\n-\n-\n-\n+\n+\n+\n

    \n Functions

    RefinementIntervals Dune::refinementIntervals (int intervals)
     Creates a RefinementIntervals object.
     
    RefinementIntervals Dune::refinementLevels (int levels)
     Creates a RefinementIntervals object.
     
    GeometryType Dune::geometryTypeFromVertexCount (unsigned int dim, unsigned int vertices)
     Utility function to construct the correct geometry type given the dimension and the number of vertices.
     
    \n-

    Detailed Description

    \n-

    This file contains the parts independent of a particular Refinement implementation.

    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_REFINEMENT_BASE_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GEOMETRY_REFINEMENT_BASE_CC
    \n-
    \n-\n-
    \n-
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,56 +1,22 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-base.cc File Reference\n-This file contains the parts independent of a particular _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+typefromvertexcount.hh File Reference\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bD_\bu_\bm_\bm_\by_\b _\b>\n-\u00a0 Mapping from g\bge\beo\bom\bme\bet\btr\bry\byT\bTy\byp\bpe\be, C\bCo\boo\bor\brd\bdT\bTy\byp\bpe\be and c\bco\boe\ber\brc\bce\beT\bTo\bo to a particular\n- _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-\u00a0 Holds the number of refined intervals per axis needed for virtual and\n- static refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b_\n- _\b>\n-\u00a0 Wrap each _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation to get a consistent interface.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b_\n- _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0 The _\bC_\bo_\bd_\bi_\bm struct inherited from the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bB_\bA_\bS_\bE_\b__\bC_\bC\n-\u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs (int intervals)\n-\u00a0 Creates a _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs object.\n-\u00a0\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs (int levels)\n-\u00a0 Creates a _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs object.\n+_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt (unsigned int dim, unsigned int\n+ vertices)\n+\u00a0 Utility function to construct the correct geometry type given the\n+ dimension and the number of vertices.\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the parts independent of a particular _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-implementation.\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_B\bBA\bAS\bSE\bE_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_REFINEMENT_BASE_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00218_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00218_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: base.cc Source File\n+dune-geometry: typefromvertexcount.hh Source File\n \n \n \n \n \n \n \n@@ -70,199 +70,77 @@\n
    \n \n \n \n \n \n \n
    \n-
    base.cc
    \n+
    typefromvertexcount.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFINEMENT_BASE_CC
    \n-
    6#define DUNE_GEOMETRY_REFINEMENT_BASE_CC
    \n+
    5#ifndef DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
    \n+
    6#define DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
    \n
    7
    \n-
    15#include <dune/geometry/type.hh>
    \n-
    16
    \n-
    17namespace Dune
    \n-
    18{
    \n-
    \n-
    28 namespace RefinementImp
    \n-
    29 {
    \n-
    30 // /////////////////////////////////
    \n-
    31 //
    \n-
    32 // Declaration of RefinementImp::Traits
    \n-
    33 //
    \n-
    34
    \n-
    35#ifdef DOXYGEN
    \n-
    36 // This is just for Doxygen
    \n-
    67 template<unsigned topologyId, class CoordType,
    \n-
    68 unsigned coerceToId, int dimension, class Dummy = void>
    \n-
    \n-
    69 struct Traits
    \n-
    70 {
    \n-
    72 typedef SquaringTheCircle::Refinement Imp;
    \n-
    73 };
    \n-
    \n-
    74
    \n-
    75#else // !DOXYGEN
    \n-
    76
    \n-
    77 // Doxygen won't see this
    \n-
    78
    \n-
    79 template<unsigned topologyId, class CoordType,
    \n-
    80 unsigned coerceToId, int dimension, class = void>
    \n-
    81 struct Traits;
    \n-
    82
    \n-
    83#endif // !DOXYGEN
    \n-
    84 } // namespace RefinementImp
    \n-
    \n-
    85
    \n-
    86
    \n-
    \n-\n-
    95 int intervals_=1;
    \n-
    96
    \n-
    97 public:
    \n-
    98 explicit RefinementIntervals(int i) : intervals_(i) {}
    \n-
    99
    \n-
    100 int intervals() const { return intervals_; }
    \n-
    101 };
    \n-
    \n-
    102
    \n-
    \n-\n-
    109 {
    \n-
    110 return RefinementIntervals{intervals};
    \n-
    111 }
    \n-
    \n-
    \n-\n-
    118 {
    \n-
    119 return RefinementIntervals{1<<levels};
    \n-
    120 }
    \n-
    \n-
    121
    \n-
    122 // ///////////////
    \n-
    123 //
    \n-
    124 // Static Refinement
    \n-
    125 //
    \n-
    126
    \n-
    136 template<unsigned topologyId, class CoordType,
    \n-
    137 unsigned coerceToId, int dimension_>
    \n-
    \n-\n-
    139 : public RefinementImp::Traits<topologyId, CoordType,
    \n-
    140 coerceToId, dimension_ >::Imp
    \n-
    141 {
    \n-
    142 public:
    \n-
    143#ifdef DOXYGEN
    \n-
    149 template<int codimension>
    \n-
    \n-
    150 struct Codim
    \n-
    151 {
    \n-\n-
    158 };
    \n-
    \n-
    159
    \n-\n-\n-
    164
    \n-
    170 typedef CoordVector;
    \n-
    171
    \n-
    177 typedef IndexVector;
    \n-
    178#endif
    \n-
    179
    \n-
    180 typedef typename RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_>::Imp RefinementImp;
    \n-
    181
    \n-
    182 using RefinementImp::dimension;
    \n-
    183
    \n-
    184 using RefinementImp::Codim;
    \n-
    185
    \n-
    186 using typename RefinementImp::VertexIterator;
    \n-
    187 using typename RefinementImp::CoordVector;
    \n-
    188
    \n-
    189 using typename RefinementImp::ElementIterator;
    \n-
    190 using typename RefinementImp::IndexVector;
    \n-
    191
    \n-
    \n-\n-
    198 {
    \n-
    199 return RefinementImp::nVertices(tag.intervals());
    \n-
    200 }
    \n-
    \n-
    201
    \n-
    \n-\n-
    208 {
    \n-
    209 return RefinementImp::vBegin(tag.intervals());
    \n-
    210 }
    \n-
    \n-
    211
    \n-
    \n-\n-
    218 {
    \n-
    219 return RefinementImp::vEnd(tag.intervals());
    \n-
    220 }
    \n-
    \n-
    221
    \n-
    \n-\n-
    228 {
    \n-
    229 return RefinementImp::nElements(tag.intervals());
    \n-
    230 }
    \n-
    \n-
    231
    \n-
    \n-\n-
    238 {
    \n-
    239 return RefinementImp::eBegin(tag.intervals());
    \n-
    240 }
    \n-
    \n-
    241
    \n-
    \n-\n-
    248 {
    \n-
    249 return RefinementImp::eEnd(tag.intervals());
    \n-
    250 }
    \n-
    \n-
    251 };
    \n-
    \n-
    252
    \n-
    254} // namespace Dune
    \n-
    255
    \n-
    256#endif // DUNE_GEOMETRY_REFINEMENT_BASE_CC
    \n-
    A unique label for each type of element that can occur in a grid.
    \n-
    RefinementIntervals refinementIntervals(int intervals)
    Creates a RefinementIntervals object.
    Definition base.cc:108
    \n-
    RefinementIntervals refinementLevels(int levels)
    Creates a RefinementIntervals object.
    Definition base.cc:117
    \n+\n+
    9
    \n+
    10namespace Dune {
    \n+
    11
    \n+
    16 inline
    \n+
    \n+
    17 GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int vertices)
    \n+
    18 {
    \n+
    19 switch (dim)
    \n+
    20 {
    \n+
    21 case 0 :
    \n+
    22 return GeometryTypes::vertex;
    \n+
    23 case 1 :
    \n+
    24 return GeometryTypes::line;
    \n+
    25 case 2 :
    \n+
    26 switch (vertices) {
    \n+
    27 case 3 :
    \n+
    28 return GeometryTypes::triangle;
    \n+
    29 case 4 :
    \n+
    30 return GeometryTypes::quadrilateral;
    \n+
    31 default :
    \n+
    32 DUNE_THROW(NotImplemented, "2d elements with " << vertices << " corners are not supported!");
    \n+
    33 }
    \n+
    34 case 3 :
    \n+
    35 switch (vertices) {
    \n+
    36 case 4 :
    \n+
    37 return GeometryTypes::tetrahedron;
    \n+
    38 case 5 :
    \n+
    39 return GeometryTypes::pyramid;
    \n+
    40 case 6 :
    \n+
    41 return GeometryTypes::prism;
    \n+
    42 case 8 :
    \n+
    43 return GeometryTypes::hexahedron;
    \n+
    44 default :
    \n+
    45 DUNE_THROW(NotImplemented, "3d elements with " << vertices << " corners are not supported!");
    \n+
    46 }
    \n+
    47 default :
    \n+
    48 DUNE_THROW(NotImplemented, "geometryTypeFromVertexCount works only up to dim=3");
    \n+
    49 }
    \n+
    50 }
    \n+
    \n+
    51
    \n+
    52}
    \n+
    53
    \n+
    54#endif // DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    Mapping from geometryType, CoordType and coerceTo to a particular Refinement implementation.
    Definition base.cc:70
    \n-
    Holds the number of refined intervals per axis needed for virtual and static refinement.
    Definition base.cc:94
    \n-
    RefinementIntervals(int i)
    Definition base.cc:98
    \n-
    int intervals() const
    Definition base.cc:100
    \n-
    Wrap each Refinement implementation to get a consistent interface.
    Definition base.cc:141
    \n-
    static ElementIterator eEnd(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:247
    \n-
    static ElementIterator eBegin(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:237
    \n-
    static int nElements(Dune::RefinementIntervals tag)
    Get the number of Elements.
    Definition base.cc:227
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    The ElementIterator of the Refinement.
    Definition base.cc:163
    \n-
    static int nVertices(Dune::RefinementIntervals tag)
    Get the number of Vertices.
    Definition base.cc:197
    \n-
    static VertexIterator vBegin(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:207
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    The VertexIterator of the Refinement.
    Definition base.cc:161
    \n-
    typedef CoordVector
    The CoordVector of the Refinement.
    Definition base.cc:170
    \n-
    typedef IndexVector
    The IndexVector of the Refinement.
    Definition base.cc:177
    \n-
    RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_ >::Imp RefinementImp
    Definition base.cc:180
    \n-
    static VertexIterator vEnd(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:217
    \n-
    The Codim struct inherited from the Refinement implementation.
    Definition base.cc:151
    \n-
    typedef SubEntityIterator
    The SubEntityIterator for each codim.
    Definition base.cc:157
    \n+
    GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int vertices)
    Utility function to construct the correct geometry type given the dimension and the number of vertice...
    Definition typefromvertexcount.hh:17
    \n+
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,223 +1,79 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-base.cc\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+typefromvertexcount.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_BASE_CC\n-_\b6#define DUNE_GEOMETRY_REFINEMENT_BASE_CC\n+5#ifndef DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n+6#define DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n 7\n-15#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-16\n-17namespace _\bD_\bu_\bn_\be\n-18{\n-_\b2_\b8 namespace RefinementImp\n-29 {\n-30 // /////////////////////////////////\n-31 //\n-32 // Declaration of RefinementImp::Traits\n-33 //\n-34\n-35#ifdef DOXYGEN\n-36 // This is just for Doxygen\n-67 template\n-_\b6_\b9 struct _\bT_\br_\ba_\bi_\bt_\bs\n-70 {\n-72 typedef SquaringTheCircle::Refinement Imp;\n-73 };\n-74\n-75#else // !DOXYGEN\n-76\n-77 // Doxygen won't see this\n-78\n-79 template\n-81 struct _\bT_\br_\ba_\bi_\bt_\bs;\n-82\n-83#endif // !DOXYGEN\n-84 } // namespace RefinementImp\n-85\n-86\n-_\b9_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{\n-95 int intervals_=1;\n-96\n-97 public:\n-_\b9_\b8 explicit _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs(int i) : intervals_(i) {}\n-99\n-_\b1_\b0_\b0 int _\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs() const { return intervals_; }\n-101 };\n-102\n-_\b1_\b0_\b8 inline _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs(int intervals)\n-109 {\n-110 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{intervals};\n-111 }\n-_\b1_\b1_\b7 inline _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs(int levels)\n-118 {\n-119 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs{1<\n-_\b1_\b3_\b8 class _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-139 : public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs::Imp\n-141 {\n-142 public:\n-143#ifdef DOXYGEN\n-149 template\n-_\b1_\b5_\b0 struct _\bC_\bo_\bd_\bi_\bm\n-151 {\n-_\b1_\b5_\b7 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-158 };\n-159\n-_\b1_\b6_\b1 typedef _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b6_\b3 typedef _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-164\n-_\b1_\b7_\b0 typedef _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-171\n-_\b1_\b7_\b7 typedef _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-178#endif\n-179\n-_\b1_\b8_\b0 typedef typename RefinementImp::Traits< topologyId, CoordType, coerceToId,\n-dimension_>::Imp _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp;\n-181\n-182 using RefinementImp::dimension;\n-183\n-184 using RefinementImp::Codim;\n-185\n-186 using typename RefinementImp::VertexIterator;\n-187 using typename RefinementImp::CoordVector;\n-188\n-189 using typename RefinementImp::ElementIterator;\n-190 using typename RefinementImp::IndexVector;\n-191\n-_\b1_\b9_\b7 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-198 {\n-199 return RefinementImp::nVertices(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-200 }\n-201\n-_\b2_\b0_\b7 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-208 {\n-209 return RefinementImp::vBegin(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-210 }\n-211\n-_\b2_\b1_\b7 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-218 {\n-219 return RefinementImp::vEnd(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-220 }\n-221\n-_\b2_\b2_\b7 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-228 {\n-229 return RefinementImp::nElements(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-230 }\n-231\n-_\b2_\b3_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-238 {\n-239 return RefinementImp::eBegin(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-240 }\n-241\n-_\b2_\b4_\b7 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-248 {\n-249 return RefinementImp::eEnd(tag._\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs());\n-250 }\n-251 };\n-252\n-254} // namespace Dune\n-255\n-256#endif // DUNE_GEOMETRY_REFINEMENT_BASE_CC\n+8#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+9\n+10namespace _\bD_\bu_\bn_\be {\n+11\n+16 inline\n+_\b1_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt(unsigned int dim, unsigned int\n+vertices)\n+18 {\n+19 switch (dim)\n+20 {\n+21 case 0 :\n+22 return GeometryTypes::vertex;\n+23 case 1 :\n+24 return GeometryTypes::line;\n+25 case 2 :\n+26 switch (vertices) {\n+27 case 3 :\n+28 return GeometryTypes::triangle;\n+29 case 4 :\n+30 return GeometryTypes::quadrilateral;\n+31 default :\n+32 DUNE_THROW(NotImplemented, \"2d elements with \" << vertices << \" corners are\n+not supported!\");\n+33 }\n+34 case 3 :\n+35 switch (vertices) {\n+36 case 4 :\n+37 return GeometryTypes::tetrahedron;\n+38 case 5 :\n+39 return GeometryTypes::pyramid;\n+40 case 6 :\n+41 return GeometryTypes::prism;\n+42 case 8 :\n+43 return GeometryTypes::hexahedron;\n+44 default :\n+45 DUNE_THROW(NotImplemented, \"3d elements with \" << vertices << \" corners are\n+not supported!\");\n+46 }\n+47 default :\n+48 DUNE_THROW(NotImplemented, \"geometryTypeFromVertexCount works only up to\n+dim=3\");\n+49 }\n+50 }\n+51\n+52}\n+53\n+54#endif // DUNE_GEOMETRY_TYPE_FROM_VERTEX_COUNT_HH\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n-_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-RefinementIntervals refinementIntervals(int intervals)\n-Creates a RefinementIntervals object.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:108\n-_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl_\bs\n-RefinementIntervals refinementLevels(int levels)\n-Creates a RefinementIntervals object.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:117\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bT_\br_\ba_\bi_\bt_\bs\n-Mapping from geometryType, CoordType and coerceTo to a particular Refinement\n-implementation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:70\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-Holds the number of refined intervals per axis needed for virtual and static\n-refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-RefinementIntervals(int i)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:98\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b:_\b:_\bi_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-int intervals() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Wrap each Refinement implementation to get a consistent interface.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:141\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(Dune::RefinementIntervals tag)\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:247\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(Dune::RefinementIntervals tag)\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(Dune::RefinementIntervals tag)\n-Get the number of Elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:227\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-The ElementIterator of the Refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:163\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(Dune::RefinementIntervals tag)\n-Get the number of Vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:197\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(Dune::RefinementIntervals tag)\n-Get a VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:207\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-The VertexIterator of the Refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:161\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-typedef CoordVector\n-The CoordVector of the Refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:170\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-typedef IndexVector\n-The IndexVector of the Refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:177\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-RefinementImp::Traits< topologyId, CoordType, coerceToId, dimension_ >::Imp\n-RefinementImp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:180\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(Dune::RefinementIntervals tag)\n-Get a VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:217\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-The Codim struct inherited from the Refinement implementation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:151\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-typedef SubEntityIterator\n-The SubEntityIterator for each codim.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:157\n+_\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bu_\bn_\bt\n+GeometryType geometryTypeFromVertexCount(unsigned int dim, unsigned int\n+vertices)\n+Utility function to construct the correct geometry type given the dimension and\n+the number of vertice...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typefromvertexcount.hh:17\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+Unique label for each type of entities that can occur in DUNE grids.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00221.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00221.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: prismtriangulation.cc File Reference\n+dune-geometry: algorithms.hh File Reference\n \n \n \n \n \n \n \n@@ -65,86 +65,41 @@\n \n \n \n \n \n \n \n
    \n \n-
    prismtriangulation.cc File Reference
    \n+Namespaces
    \n+
    algorithms.hh File Reference
    \n \n
    \n-
    #include <dune/common/fvector.hh>
    \n-#include <dune/common/typetraits.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include "base.cc"
    \n-#include "simplex.cc"
    \n+
    #include <algorithm>
    \n+#include <cmath>
    \n+#include <limits>
    \n+#include <optional>
    \n+#include <type_traits>
    \n+#include <dune/common/debugstream.hh>
    \n+#include <dune/common/fmatrix.hh>
    \n+#include <dune/common/ftraits.hh>
    \n+#include <dune/common/fvector.hh>
    \n+#include <dune/geometry/affinegeometry.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >
     Implementation of the refinement of a prism into simplices. More...
     
    struct  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    class  Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
     
    class  Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::RefinementImp::PrismTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    namespace  Dune::RefinementImp::PrismTriangulation
     This namespace contains the Refinement implementation for triangulating prisms (GeometryType::prism -> GeometryType::simplex)
     
    \n-\n-\n-\n-

    \n-Macros

    #define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
     
    \n-\n-\n-\n-\n

    \n-Functions

    template<int dimension, class CoordType >
    FieldVector< CoordType, dimension > Dune::RefinementImp::PrismTriangulation::transformCoordinate (FieldVector< CoordType, dimension > point)
     
    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
    \n-
    \n-\n-
    \n-
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,57 +1,25 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-prismtriangulation.cc File Reference\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+algorithms.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0 Implementation of the refinement of a prism into simplices. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n-\u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n-\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n- triangulating prisms (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\br_\bi_\bs_\bm -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx)\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bP_\bR_\bI_\bS_\bM_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n-\u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n- _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be (FieldVector<\n- CoordType, dimension > point)\n-\u00a0\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_P\bPR\bRI\bIS\bSM\bMT\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00221_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00221_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: prismtriangulation.cc Source File\n+dune-geometry: algorithms.hh Source File\n \n \n \n \n \n \n \n@@ -70,521 +70,124 @@\n
    \n \n \n \n \n \n \n
    \n-
    prismtriangulation.cc
    \n+
    algorithms.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
    \n-
    6#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
    \n+
    5#ifndef DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
    \n+
    6#define DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
    \n
    7
    \n-
    8#include <dune/common/fvector.hh>
    \n-
    9#include <dune/common/typetraits.hh>
    \n-
    10
    \n-\n-
    12#include <dune/geometry/type.hh>
    \n+
    8#include <algorithm>
    \n+
    9#include <cmath>
    \n+
    10#include <limits>
    \n+
    11#include <optional>
    \n+
    12#include <type_traits>
    \n
    13
    \n-
    14#include "base.cc"
    \n-
    15#include "simplex.cc"
    \n-
    16
    \n-
    17namespace Dune
    \n-
    18{
    \n-
    19 namespace RefinementImp
    \n-
    20 {
    \n-
    \n-
    26 namespace PrismTriangulation
    \n-
    27 {
    \n-
    28 // ////////////
    \n-
    29 //
    \n-
    30 // Utilities
    \n-
    31 //
    \n-
    32
    \n-\n-\n-
    35
    \n-
    36 // ////////////////////////////////////
    \n-
    37 //
    \n-
    38 // Refine a prism with simplices
    \n-
    39 //
    \n-
    40
    \n-
    41 // forward declaration of the iterator base
    \n-
    42 template<int dimension, class CoordType, int codimension>
    \n-\n-
    44 /*
    \n-
    45 * The permutations 0,2 and 3 of the Kuhn-decomposition of a cube into simplices form a prism.
    \n-
    46 * The resulting prism is not oriented the same as the reference prism and so the Kuhn-coordinates
    \n-
    47 * have to be transformed using the method below.
    \n-
    48 */
    \n-
    49 template<int dimension, class CoordType> FieldVector<CoordType, dimension>
    \n-
    \n-
    50 transformCoordinate(FieldVector<CoordType, dimension> point)
    \n-
    51 {
    \n-
    52 FieldVector<CoordType, dimension> transform;
    \n-
    53 transform[0] = point[1];
    \n-
    54 transform[1] = 1 - point[0];
    \n-
    55 transform[2] = point[2];
    \n-
    56 return transform;
    \n-
    57 }
    \n-
    \n-
    58
    \n-
    65 template<int dimension_, class CoordType>
    \n-
    \n-\n-
    67 {
    \n-
    68 public:
    \n-
    69 constexpr static int dimension = dimension_;
    \n-
    70
    \n-
    71 typedef CoordType ctype;
    \n-
    72
    \n-
    73 template<int codimension>
    \n-
    74 struct Codim;
    \n-\n-
    76 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-\n-
    78 typedef FieldVector<int, dimension+1> IndexVector;
    \n-
    79
    \n-
    80 static int nVertices(int nIntervals);
    \n-
    81 static VertexIterator vBegin(int nIntervals);
    \n-
    82 static VertexIterator vEnd(int nIntervals);
    \n-
    83
    \n-
    84 static int nElements(int nIntervals);
    \n-
    85 static ElementIterator eBegin(int nIntervals);
    \n-
    86 static ElementIterator eEnd(int nIntervals);
    \n-
    87
    \n-
    88 private:
    \n-
    89 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
    \n-
    90 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
    \n-
    91
    \n-\n-
    93 };
    \n-
    \n-
    94
    \n-
    95 template<int dimension, class CoordType>
    \n-
    96 template<int codimension>
    \n-
    \n-
    97 struct RefinementImp<dimension, CoordType>::Codim
    \n-
    98 {
    \n-
    99 class SubEntityIterator;
    \n-\n-
    101 };
    \n-
    \n+
    14#include <dune/common/debugstream.hh>
    \n+
    15#include <dune/common/fmatrix.hh>
    \n+
    16#include <dune/common/ftraits.hh>
    \n+
    17#include <dune/common/fvector.hh>
    \n+
    18#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
    \n+
    19
    \n+
    20namespace Dune {
    \n+
    21namespace Impl {
    \n+
    22
    \n+
    23template <class R = double>
    \n+
    24struct GaussNewtonOptions
    \n+
    25{
    \n+
    27 int maxIt = 100;
    \n+
    28
    \n+
    30 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits<R>::epsilon()); }();
    \n+
    31
    \n+
    33 int maxInnerIt = 10;
    \n+
    34
    \n+
    36 R theta = 0.5;
    \n+
    37};
    \n+
    38
    \n+
    39
    \n+
    41enum class GaussNewtonErrorCode
    \n+
    42{
    \n+
    43 OK = 0, //< A solution is found
    \n+
    44 JACOBIAN_NOT_INVERTIBLE, //< The Jacobian is not invertible at the current point
    \n+
    45 STAGNATION, //< No reduction of the residul norm possible
    \n+
    46 TOLERANCE_NOT_REACHED //< The break tolerance for the resodual norm is not reached
    \n+
    47};
    \n+
    48
    \n+
    49
    \n+
    62template <class F, class DF, class Domain,
    \n+
    63 class Range = std::invoke_result_t<F, Domain>,
    \n+
    64 class R = typename Dune::FieldTraits<Domain>::real_type>
    \n+
    65GaussNewtonErrorCode gaussNewton (const F& f, const DF& df, Range y, Domain& x0,
    \n+
    66 GaussNewtonOptions<R> opts = {})
    \n+
    67{
    \n+
    68 Domain x = x0;
    \n+
    69 Domain dx{};
    \n+
    70 Range dy = f(x0) - y;
    \n+
    71 R resNorm0 = dy.two_norm();
    \n+
    72 R resNorm = 0;
    \n+
    73
    \n+
    74 for (int i = 0; i < opts.maxIt; ++i)
    \n+
    75 {
    \n+
    76 // Get descent direction dx: (J^T*J)dx = J^T*dy
    \n+
    77 const bool invertible = FieldMatrixHelper<R>::xTRightInvA(df(x), dy, dx);
    \n+
    78
    \n+
    79 // break if jacobian is not invertible
    \n+
    80 if (!invertible)
    \n+
    81 return GaussNewtonErrorCode::JACOBIAN_NOT_INVERTIBLE;
    \n+
    82
    \n+
    83 // line-search procedure to update x with correction dx
    \n+
    84 R alpha = 1;
    \n+
    85 for (int j = 0; j < opts.maxInnerIt; ++j) {
    \n+
    86 x = x0 - alpha * dx;
    \n+
    87 dy = f(x) - y;
    \n+
    88 resNorm = dy.two_norm();
    \n+
    89
    \n+
    90 if (resNorm < resNorm0)
    \n+
    91 break;
    \n+
    92
    \n+
    93 alpha *= opts.theta;
    \n+
    94 }
    \n+
    95
    \n+
    96 // cannot reduce the residual
    \n+
    97 if (!(resNorm < resNorm0))
    \n+
    98 return GaussNewtonErrorCode::STAGNATION;
    \n+
    99
    \n+
    100 x0 = x;
    \n+
    101 resNorm0 = resNorm;
    \n
    102
    \n-
    103 template<int dimension, class CoordType>
    \n-
    104 int
    \n-
    \n-\n-
    106 nVertices(int nIntervals)
    \n-
    107 {
    \n-
    108 return BackendRefinement::nVertices(nIntervals) * 3;
    \n-
    109 }
    \n-
    \n-
    110
    \n-
    111 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    114 vBegin(int nIntervals)
    \n-
    115 {
    \n-
    116 return VertexIterator(nIntervals);
    \n-
    117 }
    \n-
    \n-
    118
    \n-
    119 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    122 vEnd(int nIntervals)
    \n-
    123 {
    \n-
    124 return VertexIterator(nIntervals, true);
    \n-
    125 }
    \n-
    \n-
    126
    \n-
    127 template<int dimension, class CoordType>
    \n-
    128 int
    \n-
    \n-\n-
    130 nElements(int nIntervals)
    \n-
    131 {
    \n-
    132 return BackendRefinement::nElements(nIntervals) * 3;
    \n-
    133 }
    \n-
    \n-
    134
    \n-
    135 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    138 eBegin(int nIntervals)
    \n-
    139 {
    \n-
    140 return ElementIterator(nIntervals);
    \n-
    141 }
    \n-
    \n-
    142
    \n-
    143 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    146 eEnd(int nIntervals)
    \n-
    147 {
    \n-
    148 return ElementIterator(nIntervals, true);
    \n-
    149 }
    \n-
    \n-
    150
    \n-
    151 // //////////////
    \n-
    152 //
    \n-
    153 // The iterator
    \n-
    154 //
    \n-
    155
    \n-
    156 // vertices
    \n-
    157 template<int dimension, class CoordType>
    \n-
    \n-
    158 class RefinementIteratorSpecial<dimension, CoordType, dimension>
    \n-
    159 {
    \n-
    160 public:
    \n-\n-
    162 typedef typename Refinement::CoordVector CoordVector;
    \n-
    163 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
    \n-
    164
    \n-
    165 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    166
    \n-
    167 void increment();
    \n-
    168
    \n-
    169 CoordVector coords() const;
    \n-
    170 Geometry geometry () const;
    \n-
    171
    \n-
    172 int index() const;
    \n-
    173 protected:
    \n-
    174 typedef typename Refinement::BackendRefinement BackendRefinement;
    \n-
    175 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
    \n-
    176 constexpr static int nKuhnSimplices = 3;
    \n-
    177
    \n-\n-
    179
    \n-\n-\n-\n-
    183 };
    \n-
    \n-
    184
    \n-
    185 template<int dimension, class CoordType>
    \n-
    \n-\n-
    187 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    188 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    189 backend(BackendRefinement::vBegin(nIntervals_)),
    \n-
    190 backendEnd(BackendRefinement::vEnd(nIntervals_))
    \n-
    191 {
    \n-
    192 if (end)
    \n-
    193 kuhnIndex = nKuhnSimplices;
    \n-
    194 }
    \n-
    \n-
    195
    \n-
    196 template<int dimension, class CoordType>
    \n-
    197 void
    \n-
    \n-\n-\n-
    200 {
    \n-
    201 ++backend;
    \n-
    202 if (backend == backendEnd)
    \n-
    203 {
    \n-
    204 backend = BackendRefinement::vBegin(nIntervals_);
    \n-
    205 ++kuhnIndex;
    \n-
    206 }
    \n-
    207 }
    \n-
    \n-
    208
    \n-
    209 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    212 coords() const
    \n-
    213 {
    \n-
    214 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are 0,2,3
    \n-
    215 return transformCoordinate(referenceToKuhn(backend.coords(),
    \n-
    216 getPermutation<dimension>((kuhnIndex + 2) % 4)));
    \n-
    217 }
    \n-
    \n-
    218
    \n-
    219 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    222 {
    \n-
    223 std::vector<CoordVector> corners(1);
    \n-
    224 corners[0] = transformCoordinate(referenceToKuhn(backend.coords(),
    \n-
    225 getPermutation<dimension>((kuhnIndex + 2) % 4)));
    \n-
    226 return Geometry(GeometryTypes::vertex, corners);
    \n-
    227 }
    \n-
    \n-
    228
    \n-
    229 template<int dimension, class CoordType>
    \n-
    230 int
    \n-
    \n-\n-
    232 index() const
    \n-
    233 {
    \n-
    234 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
    \n-
    235 }
    \n-
    \n-
    236
    \n-
    237 // elements
    \n-
    238 template<int dimension, class CoordType>
    \n-
    \n-
    239 class RefinementIteratorSpecial<dimension, CoordType, 0>
    \n-
    240 {
    \n-
    241 public:
    \n-\n-\n-\n-
    245 typedef typename Refinement::template Codim<0>::Geometry Geometry;
    \n-
    246
    \n-
    247 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    248
    \n-
    249 void increment();
    \n-
    250
    \n-
    251 IndexVector vertexIndices() const;
    \n-
    252 int index() const;
    \n-
    253 CoordVector coords() const;
    \n-
    254
    \n-
    255 Geometry geometry () const;
    \n-
    256
    \n-
    257 private:
    \n-
    258 CoordVector global(const CoordVector &local) const;
    \n-
    259
    \n-
    260 protected:
    \n-\n-
    262 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
    \n-
    263 constexpr static int nKuhnSimplices = 3;
    \n-
    264
    \n-\n-
    266
    \n-\n-\n-\n-
    270 };
    \n-
    \n-
    271
    \n-
    272 template<int dimension, class CoordType>
    \n-
    \n-\n-
    274 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    275 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    276 backend(BackendRefinement::eBegin(nIntervals_)),
    \n-
    277 backendEnd(BackendRefinement::eEnd(nIntervals_))
    \n-
    278 {
    \n-
    279 if (end)
    \n-
    280 kuhnIndex = nKuhnSimplices;
    \n-
    281 }
    \n-
    \n-
    282
    \n-
    283 template<int dimension, class CoordType>
    \n-
    284 void
    \n-
    \n-\n-\n-
    287 {
    \n-
    288 ++backend;
    \n-
    289 if (backend == backendEnd)
    \n-
    290 {
    \n-
    291 backend = BackendRefinement::eBegin(nIntervals_);
    \n-
    292 ++kuhnIndex;
    \n-
    293 }
    \n-
    294 }
    \n-
    \n-
    295
    \n-
    296 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    299 vertexIndices() const
    \n-
    300 {
    \n-
    301 IndexVector indices = backend.vertexIndices();
    \n-
    302
    \n-
    303 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
    \n-
    304 indices += base;
    \n-
    305
    \n-
    306 return indices;
    \n-
    307 }
    \n-
    \n-
    308
    \n-
    309 template<int dimension, class CoordType>
    \n-
    310 int
    \n-
    \n-\n-
    312 index() const
    \n-
    313 {
    \n-
    314 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
    \n-
    315 }
    \n-
    \n-
    316
    \n-
    317 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    320 coords() const
    \n-
    321 {
    \n-
    322 return global(backend.coords());
    \n-
    323 }
    \n-
    \n-
    324
    \n-
    325 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    328 {
    \n-
    329 const typename BackendIterator::Geometry &bgeo =
    \n-
    330 backend.geometry();
    \n-
    331 std::vector<CoordVector> corners(dimension+1);
    \n-
    332 for(int i = 0; i <= dimension; ++i)
    \n-
    333 corners[i] = global(bgeo.corner(i));
    \n-
    334
    \n-
    335 return Geometry(bgeo.type(), corners);
    \n-
    336 }
    \n-
    \n-
    337
    \n-
    338 template<int dimension, class CoordType>
    \n-\n-\n-
    341 global(const CoordVector &local) const
    \n-
    342 {
    \n-
    343 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are 0,2,3
    \n-
    344 return transformCoordinate(referenceToKuhn(local, getPermutation<dimension>((kuhnIndex+2)%4)));
    \n-
    345 }
    \n-
    346
    \n-
    347 // common
    \n-
    348 template<int dimension, class CoordType>
    \n-
    349 template<int codimension>
    \n-
    \n-
    350 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    351 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    352 public RefinementIteratorSpecial<dimension, CoordType, codimension>
    \n-
    353 {
    \n-
    354 public:
    \n-\n-
    356 typedef SubEntityIterator This;
    \n-
    357
    \n-
    358 SubEntityIterator(int nIntervals, bool end = false);
    \n-
    359
    \n-
    360 bool equals(const This &other) const;
    \n-
    361 protected:
    \n-
    362 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
    \n-
    363 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
    \n-
    364 };
    \n-
    \n-
    365
    \n-
    366#ifndef DOXYGEN
    \n-
    367 template<int dimension, class CoordType>
    \n-
    368 template<int codimension>
    \n-\n-
    370 SubEntityIterator(int nIntervals, bool end)
    \n-
    371 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
    \n-
    372 {}
    \n-
    373
    \n-
    374 template<int dimension, class CoordType>
    \n-
    375 template<int codimension>
    \n-
    376 bool
    \n-\n-
    378 equals(const This &other) const
    \n-
    379 {
    \n-
    380 return ((kuhnIndex == other.kuhnIndex) && (backend == other.backend));
    \n-
    381 }
    \n-
    382#endif
    \n-
    383
    \n-
    384 } // namespace PrismTriangulation
    \n-
    \n-
    385 } // namespace RefinementImp
    \n-
    386
    \n-
    387 namespace RefinementImp
    \n-
    388 {
    \n-
    389 // ///////////////////////
    \n-
    390 //
    \n-
    391 // The refinement traits
    \n-
    392 //
    \n-
    393
    \n-
    394#ifndef DOXYGEN
    \n-
    395 template<unsigned topologyId, class CoordType, unsigned coerceToId>
    \n-
    396 struct Traits<
    \n-
    397 topologyId, CoordType, coerceToId, 3,
    \n-
    398 typename std::enable_if<
    \n-
    399 (GeometryTypes::prism.id() >> 1) ==
    \n-
    400 (topologyId >> 1) &&
    \n-
    401 (GeometryTypes::simplex(3).id() >> 1) ==
    \n-
    402 (coerceToId >> 1)
    \n-
    403 >::type>
    \n-
    404 {
    \n-
    405 typedef PrismTriangulation::RefinementImp<3, CoordType> Imp;
    \n-
    406 };
    \n-
    407#endif
    \n-
    408
    \n-
    409 } // namespace RefinementImp
    \n-
    410} // namespace Dune
    \n-
    411
    \n-
    412#endif // DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC
    \n-
    This file contains the parts independent of a particular Refinement implementation.
    \n-
    This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    STL namespace.
    \n+
    103 // break if tolerance is reached.
    \n+
    104 if (resNorm < opts.absTol)
    \n+
    105 return GaussNewtonErrorCode::OK;
    \n+
    106 }
    \n+
    107
    \n+
    108 // tolerance could not be reached
    \n+
    109 if (!(resNorm < opts.absTol))
    \n+
    110 return GaussNewtonErrorCode::TOLERANCE_NOT_REACHED;
    \n+
    111
    \n+
    112 return GaussNewtonErrorCode::OK;
    \n+
    113}
    \n+
    114
    \n+
    115} // end namespace Impl
    \n+
    116} // end namespace Dune
    \n+
    117
    \n+
    118#endif // DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH
    \n+
    An implementation of the Geometry interface for affine geometries.
    \n
    Definition affinegeometry.hh:21
    \n-
    FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType, dimension > point)
    Definition prismtriangulation.cc:50
    \n-
    FieldVector< int, n > getPermutation(int m)
    Calculate permutation from it's index.
    Definition simplex.cc:293
    \n-
    FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
    Map from the reference simplex to some Kuhn simplex.
    Definition simplex.cc:322
    \n-
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    generic geometry implementation based on corner coordinates
    Definition multilineargeometry.hh:181
    \n-\n-
    Implementation of the refinement of a prism into simplices.
    Definition prismtriangulation.cc:67
    \n-
    static constexpr int dimension
    Definition prismtriangulation.cc:69
    \n-
    CoordType ctype
    Definition prismtriangulation.cc:71
    \n-
    static VertexIterator vEnd(int nIntervals)
    Definition prismtriangulation.cc:122
    \n-
    FieldVector< int, dimension+1 > IndexVector
    Definition prismtriangulation.cc:78
    \n-
    static ElementIterator eEnd(int nIntervals)
    Definition prismtriangulation.cc:146
    \n-
    static int nVertices(int nIntervals)
    Definition prismtriangulation.cc:106
    \n-
    FieldVector< CoordType, dimension > CoordVector
    Definition prismtriangulation.cc:76
    \n-
    static int nElements(int nIntervals)
    Definition prismtriangulation.cc:130
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    Definition prismtriangulation.cc:77
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    Definition prismtriangulation.cc:75
    \n-
    static ElementIterator eBegin(int nIntervals)
    Definition prismtriangulation.cc:138
    \n-
    static VertexIterator vBegin(int nIntervals)
    Definition prismtriangulation.cc:114
    \n-\n-
    Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
    Definition prismtriangulation.cc:100
    \n-\n-
    Refinement::template Codim< dimension >::Geometry Geometry
    Definition prismtriangulation.cc:163
    \n-
    Refinement::BackendRefinement BackendRefinement
    Definition prismtriangulation.cc:174
    \n-
    BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
    Definition prismtriangulation.cc:175
    \n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition prismtriangulation.cc:161
    \n-\n-\n-\n-
    Refinement::template Codim< 0 >::Geometry Geometry
    Definition prismtriangulation.cc:245
    \n-\n-
    Refinement::IndexVector IndexVector
    Definition prismtriangulation.cc:243
    \n-
    BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
    Definition prismtriangulation.cc:262
    \n-\n-
    Refinement::CoordVector CoordVector
    Definition prismtriangulation.cc:244
    \n-
    RefinementImp< dimension, CoordType > Refinement
    Definition prismtriangulation.cc:242
    \n-\n-
    Refinement::BackendRefinement BackendRefinement
    Definition prismtriangulation.cc:261
    \n-
    SubEntityIterator This
    Definition prismtriangulation.cc:356
    \n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition prismtriangulation.cc:355
    \n-\n-\n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,605 +1,121 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-prismtriangulation.cc\n+ * _\bu_\bt_\bi_\bl_\bi_\bt_\by\n+algorithms.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n-_\b6#define DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n+5#ifndef DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n+6#define DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n 7\n-8#include \n-9#include \n-10\n-11#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-12#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+8#include \n+9#include \n+10#include \n+11#include \n+12#include \n 13\n-14#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-15#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n-16\n-17namespace _\bD_\bu_\bn_\be\n-18{\n-19 namespace RefinementImp\n-20 {\n-_\b2_\b6 namespace PrismTriangulation\n-27 {\n-28 // ////////////\n-29 //\n-30 // Utilities\n-31 //\n-32\n-33 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n-34 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n-35\n-36 // ////////////////////////////////////\n-37 //\n-38 // Refine a prism with simplices\n-39 //\n-40\n-41 // forward declaration of the iterator base\n-42 template\n-_\b4_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-44 /*\n-45 * The permutations 0,2 and 3 of the Kuhn-decomposition of a cube into\n-simplices form a prism.\n-46 * The resulting prism is not oriented the same as the reference prism and so\n-the Kuhn-coordinates\n-47 * have to be transformed using the method below.\n-48 */\n-49 template FieldVector\n-_\b5_\b0 _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(FieldVector point)\n-51 {\n-52 FieldVector transform;\n-53 transform[0] = point[1];\n-54 transform[1] = 1 - point[0];\n-55 transform[2] = point[2];\n-56 return transform;\n-57 }\n-58\n-65 template\n-_\b6_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-67 {\n-68 public:\n-_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n-70\n-_\b7_\b1 typedef CoordType _\bc_\bt_\by_\bp_\be;\n-72\n-73 template\n-74 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b7_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b6 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b7_\b7 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b8 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-79\n-80 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n-81 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n-83\n-84 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n-85 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-_\b8_\b6 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n-87\n-88 private:\n-89 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n-90 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n-91\n-92 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-93 };\n-94\n-95 template\n-96 template\n-_\b9_\b7 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n-98 {\n-99 class SubEntityIterator;\n-_\b1_\b0_\b0 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-101 };\n+14#include \n+15#include \n+16#include \n+17#include \n+18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh> // for FieldMatrixHelper\n+19\n+20namespace _\bD_\bu_\bn_\be {\n+21namespace Impl {\n+22\n+23template \n+24struct GaussNewtonOptions\n+25{\n+27 int maxIt = 100;\n+28\n+30 R absTol = []{ using std::sqrt; return sqrt(std::numeric_limits::epsilon\n+()); }();\n+31\n+33 int maxInnerIt = 10;\n+34\n+36 R theta = 0.5;\n+37};\n+38\n+39\n+41enum class GaussNewtonErrorCode\n+42{\n+43 OK = 0, //< A solution is found\n+44 JACOBIAN_NOT_INVERTIBLE, //< The Jacobian is not invertible at the current\n+point\n+45 STAGNATION, //< No reduction of the residul norm possible\n+46 TOLERANCE_NOT_REACHED //< The break tolerance for the resodual norm is not\n+reached\n+47};\n+48\n+49\n+62template ,\n+64 class R = typename Dune::FieldTraits::real_type>\n+65GaussNewtonErrorCode gaussNewton (const F& f, const DF& df, Range y, Domain&\n+x0,\n+66 GaussNewtonOptions opts = {})\n+67{\n+68 Domain x = x0;\n+69 Domain dx{};\n+70 Range dy = f(x0) - y;\n+71 R resNorm0 = dy.two_norm();\n+72 R resNorm = 0;\n+73\n+74 for (int i = 0; i < opts.maxIt; ++i)\n+75 {\n+76 // Get descent direction dx: (J^T*J)dx = J^T*dy\n+77 const bool invertible = FieldMatrixHelper::xTRightInvA(df(x), dy, dx);\n+78\n+79 // break if jacobian is not invertible\n+80 if (!invertible)\n+81 return GaussNewtonErrorCode::JACOBIAN_NOT_INVERTIBLE;\n+82\n+83 // line-search procedure to update x with correction dx\n+84 R alpha = 1;\n+85 for (int j = 0; j < opts.maxInnerIt; ++j) {\n+86 x = x0 - alpha * dx;\n+87 dy = f(x) - y;\n+88 resNorm = dy.two_norm();\n+89\n+90 if (resNorm < resNorm0)\n+91 break;\n+92\n+93 alpha *= opts.theta;\n+94 }\n+95\n+96 // cannot reduce the residual\n+97 if (!(resNorm < resNorm0))\n+98 return GaussNewtonErrorCode::STAGNATION;\n+99\n+100 x0 = x;\n+101 resNorm0 = resNorm;\n 102\n-103 template\n-104 int\n-_\b1_\b0_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-106_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n-107 {\n-108 return BackendRefinement::nVertices(nIntervals) * 3;\n-109 }\n-110\n-111 template\n-112 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b1_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-114_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-115 {\n-116 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-117 }\n-118\n-119 template\n-120 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-122_\b _\bv_\bE_\bn_\bd(int nIntervals)\n-123 {\n-124 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-125 }\n-126\n-127 template\n-128 int\n-_\b1_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-130_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n-131 {\n-132 return BackendRefinement::nElements(nIntervals) * 3;\n-133 }\n-134\n-135 template\n-136 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b3_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-138_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-139 {\n-140 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-141 }\n-142\n-143 template\n-144 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b4_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-146_\b _\be_\bE_\bn_\bd(int nIntervals)\n-147 {\n-148 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-149 }\n-150\n-151 // //////////////\n-152 //\n-153 // The iterator\n-154 //\n-155\n-156 // vertices\n-157 template\n-_\b1_\b5_\b8 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-159 {\n-160 public:\n-_\b1_\b6_\b1 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b6_\b2 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b1_\b6_\b3 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-164\n-165 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-166\n-167 void increment();\n-168\n-169 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-170 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n-171\n-172 int index() const;\n-173 protected:\n-_\b1_\b7_\b4 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b7_\b5 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b7_\b6 constexpr static int nKuhnSimplices = 3;\n-177\n-_\b1_\b7_\b8 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n-179\n-_\b1_\b8_\b0 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b1_\b8_\b1 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b1_\b8_\b2 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-183 };\n-184\n-185 template\n-_\b1_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-187_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-188 : nIntervals_(nIntervals), kuhnIndex(0),\n-189 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n-190 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n-191 {\n-192 if (end)\n-193 kuhnIndex = nKuhnSimplices;\n-194 }\n-195\n-196 template\n-197 void\n-_\b1_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-199_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-200 {\n-201 ++backend;\n-202 if (backend == backendEnd)\n-203 {\n-204 backend = BackendRefinement::vBegin(nIntervals_);\n-205 ++kuhnIndex;\n-206 }\n-207 }\n-208\n-209 template\n-210 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b2_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-212_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-213 {\n-214 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are\n-0,2,3\n-215 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n-216 getPermutation((kuhnIndex + 2) % 4)));\n-217 }\n-218\n-219 template\n-220 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b2_\b2_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n-const\n-222 {\n-223 std::vector corners(1);\n-224 corners[0] = _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(backend.coords(),\n-225 getPermutation((kuhnIndex + 2) % 4)));\n-226 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n-227 }\n-228\n-229 template\n-230 int\n-_\b2_\b3_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-232_\b _\bi_\bn_\bd_\be_\bx() const\n-233 {\n-234 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n-();\n-235 }\n-236\n-237 // elements\n-238 template\n-_\b2_\b3_\b9 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-240 {\n-241 public:\n-_\b2_\b4_\b2 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b4_\b3 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b4 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-246\n-247 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-248\n-249 void increment();\n-250\n-251 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-252 int index() const;\n-253 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-254\n-255 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n-256\n-257 private:\n-258 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n-259\n-260 protected:\n-_\b2_\b6_\b1 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b6_\b2 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b2_\b6_\b3 constexpr static int nKuhnSimplices = 3;\n-264\n-_\b2_\b6_\b5 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n-266\n-_\b2_\b6_\b7 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b2_\b6_\b8 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b2_\b6_\b9 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-270 };\n-271\n-272 template\n-_\b2_\b7_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-274_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-275 : nIntervals_(nIntervals), kuhnIndex(0),\n-276 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n-277 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n-278 {\n-279 if (end)\n-280 kuhnIndex = nKuhnSimplices;\n-281 }\n-282\n-283 template\n-284 void\n-_\b2_\b8_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-286_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-287 {\n-288 ++backend;\n-289 if (backend == backendEnd)\n-290 {\n-291 backend = BackendRefinement::eBegin(nIntervals_);\n-292 ++kuhnIndex;\n-293 }\n-294 }\n-295\n-296 template\n-297 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b2_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-299_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-300 {\n-301 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n-302\n-303 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n-304 indices += base;\n-305\n-306 return indices;\n-307 }\n-308\n-309 template\n-310 int\n-_\b3_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-312_\b _\bi_\bn_\bd_\be_\bx() const\n-313 {\n-314 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n-();\n-315 }\n-316\n-317 template\n-318 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b1_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-320_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-321 {\n-322 return global(backend.coords());\n-323 }\n-324\n-325 template\n-326 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b3_\b2_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n-328 {\n-329 const typename BackendIterator::Geometry &bgeo =\n-330 backend.geometry();\n-331 std::vector corners(dimension+1);\n-332 for(int i = 0; i <= dimension; ++i)\n-333 corners[i] = global(bgeo.corner(i));\n-334\n-335 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n-336 }\n-337\n-338 template\n-339 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-340 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-341_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n-342 {\n-343 // while the kuhnIndex runs from 0,1,2 the actual permutations we need are\n-0,2,3\n-344 return _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be(referenceToKuhn(local, getPermutation\n-((kuhnIndex+2)%4)));\n-345 }\n-346\n-347 // common\n-348 template\n-349 template\n-_\b3_\b5_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-351 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-352 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-353 {\n-354 public:\n-_\b3_\b5_\b5 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b3_\b5_\b6 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n-357\n-_\b3_\b5_\b8 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n-359\n-_\b3_\b6_\b0 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n-361 protected:\n-362 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-kuhnIndex;\n-363 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-backend;\n-364 };\n-365\n-366#ifndef DOXYGEN\n-367 template\n-368 template\n-369 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-370_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n-371 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n-end)\n-372 {}\n-373\n-374 template\n-375 template\n-376 bool\n-377 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-378_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n-379 {\n-380 return ((kuhnIndex == other.kuhnIndex) && (backend == other.backend));\n-381 }\n-382#endif\n-383\n-384 } // namespace PrismTriangulation\n-385 } // namespace RefinementImp\n-386\n-387 namespace RefinementImp\n-388 {\n-389 // ///////////////////////\n-390 //\n-391 // The refinement traits\n-392 //\n-393\n-394#ifndef DOXYGEN\n-395 template\n-396 struct Traits<\n-397 topologyId, CoordType, coerceToId, 3,\n-398 typename _\bs_\bt_\bd::enable_if<\n-399 (GeometryTypes::prism.id() >> 1) ==\n-400 (topologyId >> 1) &&\n-401 (GeometryTypes::simplex(3).id() >> 1) ==\n-402 (coerceToId >> 1)\n-403 >::type>\n-404 {\n-405 typedef PrismTriangulation::RefinementImp<3, CoordType> Imp;\n-406 };\n-407#endif\n-408\n-409 } // namespace RefinementImp\n-410} // namespace Dune\n-411\n-412#endif // DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n-_\bb_\ba_\bs_\be_\b._\bc_\bc\n-This file contains the parts independent of a particular Refinement\n-implementation.\n-_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n-This file contains the Refinement implementation for simplices (triangles,\n-tetrahedrons....\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n-_\bt_\by_\bp_\be_\b._\bh_\bh\n-A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n+103 // break if tolerance is reached.\n+104 if (resNorm < opts.absTol)\n+105 return GaussNewtonErrorCode::OK;\n+106 }\n+107\n+108 // tolerance could not be reached\n+109 if (!(resNorm < opts.absTol))\n+110 return GaussNewtonErrorCode::TOLERANCE_NOT_REACHED;\n+111\n+112 return GaussNewtonErrorCode::OK;\n+113}\n+114\n+115} // end namespace Impl\n+116} // end namespace Dune\n+117\n+118#endif // DUNE_GEOMETRY_UTILITY_ALGORITHMS_HH\n+_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n+An implementation of the Geometry interface for affine geometries.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< CoordType, dimension > transformCoordinate(FieldVector< CoordType,\n-dimension > point)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:50\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n-FieldVector< int, n > getPermutation(int m)\n-Calculate permutation from it's index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n-FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n-dimension > point, const FieldVector< int, dimension > &kuhn)\n-Map from the reference simplex to some Kuhn simplex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Static tag representing a codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-generic geometry implementation based on corner coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-Implementation of the refinement of a prism into simplices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n-CoordType ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:122\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< int, dimension+1 > IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:106\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:76\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:130\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:138\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:98\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n-Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< dimension >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:163\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:174\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< dimension >::SubEntityIterator\n-BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:162\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:182\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:161\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:180\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:265\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< 0 >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:245\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:268\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:243\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:267\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:244\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:242\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:261\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bT_\bh_\bi_\bs\n-SubEntityIterator This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:356\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\be_\bq_\bu_\ba_\bl_\bs\n-bool equals(const This &other) const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn prismtriangulation.cc:355\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bP_\br_\bi_\bs_\bm_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(int nIntervals, bool end=false)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00224.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00224.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: simplex.cc File Reference\n+dune-geometry: dimension.hh File Reference\n \n \n \n \n \n \n \n@@ -65,105 +65,42 @@\n \n \n \n \n \n \n \n
    \n \n-
    simplex.cc File Reference
    \n+Namespaces
    \n+
    dimension.hh File Reference
    \n \n
    \n-\n-

    This file contains the Refinement implementation for simplices (triangles, tetrahedrons...) \n-More...

    \n-
    #include <algorithm>
    \n-#include <dune/common/fvector.hh>
    \n-#include <dune/common/math.hh>
    \n-#include <dune/geometry/multilineargeometry.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include "base.cc"
    \n+
    #include <type_traits>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n-\n-\n-\n+\n+\n \n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >
     
    struct  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    class  Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, dimension >
    struct  Dune::Dim< dim >
     Static tag representing a dimension. More...
     
    class  Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::RefinementImp::Simplex::RefinementImp< dimension_, CoordType >::Codim< codimension >
    struct  Dune::Codim< codim >
     Static tag representing a codimension. More...
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    namespace  Dune::RefinementImp::Simplex
     This namespace contains the Refinement implementation for simplices (triangles, tetrahedrons...)
     
    \n-\n-\n-\n-

    \n-Macros

    #define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    Utilities
    template<int dimension>
    int Dune::RefinementImp::Simplex::pointIndex (const FieldVector< int, dimension > &point)
     calculate the index of a given gridpoint within a Kuhn0 simplex
     
    template<int n>
    FieldVector< int, n > Dune::RefinementImp::Simplex::getPermutation (int m)
     Calculate permutation from it's index.
     
    template<int dimension, class CoordType >
    FieldVector< CoordType, dimension > Dune::RefinementImp::Simplex::referenceToKuhn (FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
     Map from the reference simplex to some Kuhn simplex.
     
    template<int dimension, class CoordType >
    FieldVector< CoordType, dimension > Dune::RefinementImp::Simplex::kuhnToReference (FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
     Map from some Kuhn simplex to the reference simplex.
     
    \n-

    Detailed Description

    \n-

    This file contains the Refinement implementation for simplices (triangles, tetrahedrons...)

    \n-

    See Refinement implementation for simplices.

    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
    \n-
    \n-\n-
    \n-
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,86 +1,22 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n-simplex.cc File Reference\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices (triangles,\n-tetrahedrons...) _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+dimension.hh File Reference\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b<_\b _\bd_\bi_\bm_\b _\b>\n+\u00a0 Static tag representing a dimension. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n- _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n- _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\b _\b>\n+\u00a0 Static tag representing a codimension. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n-\u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx\n-\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices\n- (triangles, tetrahedrons...)\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bR_\bI_\bD_\b__\bC_\bO_\bM_\bM_\bO_\bN_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bS_\bI_\bM_\bP_\bL_\bE_\bX_\b__\bC_\bC\n-\u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-Utilities\n-template\n- int\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx\n- (const FieldVector< int, dimension >\n- &point)\n-\u00a0 calculate the index of a given gridpoint\n- within a Kuhn0 simplex\n-\u00a0\n-template\n- FieldVector< int, n >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n- _\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn (int m)\n-\u00a0 Calculate permutation from it's index.\n-\u00a0\n-template\n-FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n- _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn (FieldVector< CoordType,\n- dimension > point, const FieldVector< int,\n- dimension > &kuhn)\n-\u00a0 Map from the reference simplex to some\n- Kuhn simplex.\n-\u00a0\n-template\n-FieldVector< CoordType, dimension >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:\n- _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be (FieldVector< CoordType,\n- dimension > point, const FieldVector< int,\n- dimension > &kuhn)\n-\u00a0 Map from some Kuhn simplex to the\n- reference simplex.\n-\u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for simplices (triangles,\n-tetrahedrons...)\n-See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bs_\bi_\bm_\bp_\bl_\bi_\bc_\be_\bs.\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGR\bRI\bID\bD_\b_C\bCO\bOM\bMM\bMO\bON\bN_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_S\bSI\bIM\bMP\bPL\bLE\bEX\bX_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00224_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00224_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: simplex.cc Source File\n+dune-geometry: dimension.hh Source File\n \n \n \n \n \n \n \n@@ -70,621 +70,58 @@\n
    \n \n \n \n \n \n \n
    \n-
    simplex.cc
    \n+
    dimension.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
    \n-
    6#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
    \n+
    5#ifndef DUNE_GEOMETRY_DIMENSION_HH
    \n+
    6#define DUNE_GEOMETRY_DIMENSION_HH
    \n
    7
    \n-
    8// This file is part of DUNE, a Distributed and Unified Numerics Environment
    \n-
    9// This file is copyright (C) 2005 Jorrit Fahlke <jorrit@jorrit.de>
    \n-
    10// This file is licensed under version 2 of the GNU General Public License,
    \n-
    11// with a special "runtime exception." See COPYING at the top of the source
    \n-
    12// tree for the full licence.
    \n-
    13
    \n-
    243#include <algorithm>
    \n-
    244
    \n-
    245#include <dune/common/fvector.hh>
    \n-
    246#include <dune/common/math.hh>
    \n-
    247
    \n-\n-\n-
    250#include <dune/geometry/type.hh>
    \n-
    251
    \n-
    252#include "base.cc"
    \n-
    253
    \n-
    254namespace Dune {
    \n-
    255
    \n-
    256 namespace RefinementImp {
    \n-
    257
    \n-
    \n-
    264 namespace Simplex {
    \n-
    265
    \n-
    266 // //////////////////
    \n-
    267 //
    \n-
    269 //
    \n-
    270
    \n-
    272
    \n-
    279 template<int dimension>
    \n-
    \n-
    280 int pointIndex(const FieldVector<int, dimension> &point)
    \n-
    281 {
    \n-
    282 int index = 0;
    \n-
    283 for(int i = 0; i < dimension; ++i)
    \n-
    284 index += Dune::binomial(dimension-i + point[i]-1, dimension-i);
    \n-
    285 return index;
    \n-
    286 }
    \n-
    \n-
    287
    \n-
    292 template<int n>
    \n-
    \n-
    293 FieldVector<int, n> getPermutation(int m)
    \n-
    294 {
    \n-
    295 FieldVector<int, n> perm;
    \n-
    296 for(int i = 0; i < n; ++i)
    \n-
    297 perm[i] = i;
    \n-
    298
    \n-
    299 int base = 1;
    \n-
    300 for(int i = 1; i <= n; ++i)
    \n-
    301 base *= i;
    \n-
    302
    \n-
    303 for(int i = n; i > 0; --i) {
    \n-
    304 base /= i;
    \n-
    305 int d = m / base;
    \n-
    306 m %= base;
    \n-
    307 int t = perm[i-1]; perm[i-1] = perm[i-1-d]; perm[i-1-d] = t;
    \n-
    308 }
    \n-
    309 return perm;
    \n-
    310 }
    \n-
    \n-
    311
    \n-
    312 // map between the reference simplex and some arbitrary kuhn simplex (denoted by it's permutation)
    \n-
    320 template<int dimension, class CoordType>
    \n-
    321 FieldVector<CoordType, dimension>
    \n-
    \n-\n-
    323 FieldVector<CoordType, dimension> point,
    \n-
    325 const FieldVector<int, dimension> &kuhn)
    \n-
    326 {
    \n-
    327 for(int i = dimension - 1; i > 0; --i)
    \n-
    328 point[kuhn[i-1]] += point[kuhn[i]];
    \n-
    329 return point;
    \n-
    330 }
    \n-
    \n-
    331
    \n-
    339 template<int dimension, class CoordType>
    \n-
    340 FieldVector<CoordType, dimension>
    \n-
    \n-\n-
    342 FieldVector<CoordType, dimension> point,
    \n-
    344 const FieldVector<int, dimension> &kuhn)
    \n-
    345 {
    \n-
    346 for(int i = 0; i < dimension - 1; ++i)
    \n-
    347 point[kuhn[i]] -= point[kuhn[i+1]];
    \n-
    348 return point;
    \n-
    349 }
    \n-
    \n-
    350
    \n-
    351
    \n-
    353
    \n-
    354 // /////////////////////////////////////////
    \n-
    355 //
    \n-
    356 // refinement implementation for simplices
    \n-
    357 //
    \n-
    358
    \n-
    359 template<int dimension_, class CoordType>
    \n-
    \n-\n-
    361 {
    \n-
    362 public:
    \n-
    363 constexpr static int dimension = dimension_;
    \n-
    364 typedef CoordType ctype;
    \n-
    365
    \n-
    366 template<int codimension>
    \n-
    367 struct Codim;
    \n-\n-
    369 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-\n-
    371 typedef FieldVector<int, dimension+1> IndexVector;
    \n-
    372
    \n-
    373 static int nVertices(int nIntervals);
    \n-
    374 static VertexIterator vBegin(int nIntervals);
    \n-
    375 static VertexIterator vEnd(int nIntervals);
    \n-
    376
    \n-
    377 static int nElements(int nIntervals);
    \n-
    378 static ElementIterator eBegin(int nIntervals);
    \n-
    379 static ElementIterator eEnd(int nIntervals);
    \n-
    380 };
    \n-
    \n-
    381
    \n-
    382 template<int dimension, class CoordType>
    \n-
    383 template<int codimension>
    \n-
    \n-
    384 struct RefinementImp<dimension, CoordType>::Codim
    \n-
    385 {
    \n-
    386 class SubEntityIterator;
    \n-
    387 // We don't need the caching, but the uncached MultiLinearGeometry has bug FS#1209
    \n-\n-
    389 };
    \n-
    \n-
    390
    \n-
    391 template<int dimension, class CoordType>
    \n-
    392 int
    \n-
    \n-\n-
    394 nVertices(int nIntervals)
    \n-
    395 {
    \n-
    396 return Dune::binomial(dimension + nIntervals, (int)dimension);
    \n-
    397 }
    \n-
    \n-
    398
    \n-
    399 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    402 vBegin(int nIntervals)
    \n-
    403 {
    \n-
    404 return VertexIterator(nIntervals);
    \n-
    405 }
    \n-
    \n-
    406
    \n-
    407 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    410 vEnd(int nIntervals)
    \n-
    411 {
    \n-
    412 return VertexIterator(nIntervals, true);
    \n-
    413 }
    \n-
    \n-
    414
    \n-
    415 template<int dimension, class CoordType>
    \n-
    416 int
    \n-
    \n-\n-
    418 nElements(int nIntervals)
    \n-
    419 {
    \n-
    420 return Dune::power(nIntervals, int(dimension));
    \n-
    421 }
    \n-
    \n-
    422
    \n-
    423 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    426 eBegin(int nIntervals)
    \n-
    427 {
    \n-
    428 return ElementIterator(nIntervals);
    \n-
    429 }
    \n-
    \n-
    430
    \n-
    431 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    434 eEnd(int nIntervals)
    \n-
    435 {
    \n-
    436 return ElementIterator(nIntervals, true);
    \n-
    437 }
    \n-
    \n-
    438
    \n-
    439 // //////////////
    \n-
    440 //
    \n-
    441 // The iterator
    \n-
    442 //
    \n-
    443
    \n-
    444 template<int dimension, class CoordType, int codimension>
    \n-\n-
    446
    \n-
    447 // vertices
    \n-
    448
    \n-
    449 template<int dimension, class CoordType>
    \n-
    \n-
    450 class RefinementIteratorSpecial<dimension, CoordType, dimension>
    \n-
    451 {
    \n-
    452 public:
    \n-\n-
    454 typedef typename Refinement::CoordVector CoordVector;
    \n-
    455 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
    \n-\n-
    457
    \n-
    458 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    459
    \n-
    460 void increment();
    \n-
    461 bool equals(const This &other) const;
    \n-
    462
    \n-
    463 CoordVector coords() const;
    \n-
    464 Geometry geometry () const;
    \n-
    465
    \n-
    466 int index() const;
    \n-
    467 protected:
    \n-
    468 typedef FieldVector<int, dimension> Vertex;
    \n-
    469
    \n-
    470 int size;
    \n-\n-
    472 };
    \n-
    \n-
    473
    \n-
    474 template<int dimension, class CoordType>
    \n-
    \n-\n-
    476 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    477 : size(nIntervals)
    \n-
    478 {
    \n-
    479 vertex[0] = (end) ? size + 1 : 0;
    \n-
    480 for(int i = 1; i < dimension; ++ i)
    \n-
    481 vertex[i] = 0;
    \n-
    482 }
    \n-
    \n-
    483
    \n-
    484 template<int dimension, class CoordType>
    \n-
    485 void
    \n-
    \n-\n-\n-
    488 {
    \n-
    489 assert(vertex[0] <= size);
    \n-
    490 for(int i = dimension - 1; i >= 0; --i) {
    \n-
    491 ++vertex[i];
    \n-
    492 if(i == 0 || vertex[i] <= vertex[i-1])
    \n-
    493 break;
    \n-
    494 else
    \n-
    495 vertex[i] = 0;
    \n-
    496 }
    \n-
    497 }
    \n-
    \n-
    498
    \n-
    499 template<int dimension, class CoordType>
    \n-
    500 bool
    \n-
    \n-\n-
    502 equals(const This &other) const
    \n-
    503 {
    \n-
    504 return size == other.size && vertex == other.vertex;
    \n-
    505 }
    \n-
    \n-
    506
    \n-
    507 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    510 coords() const
    \n-
    511 {
    \n-
    512 Vertex ref = kuhnToReference(vertex, getPermutation<dimension>(0));
    \n-
    513
    \n-
    514 CoordVector coords;
    \n-
    515 for(int i = 0; i < dimension; ++i)
    \n-
    516 coords[i] = CoordType(ref[i]) / size;
    \n-
    517 return coords;
    \n-
    518 }
    \n-
    \n-
    519
    \n-
    520 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    523 {
    \n-
    524 std::vector<CoordVector> corners(1);
    \n-
    525 corners[0] = (CoordVector)vertex;
    \n-
    526 return Geometry(GeometryTypes::vertex, corners);
    \n-
    527 }
    \n-
    \n-
    528
    \n-
    529 template<int dimension, class CoordType>
    \n-
    530 int
    \n-
    \n-\n-
    532 index() const
    \n-
    533 {
    \n-
    534 return pointIndex(vertex);
    \n-
    535 }
    \n-
    \n-
    536
    \n-
    537 // elements
    \n-
    538
    \n-
    539 template<int dimension, class CoordType>
    \n-
    \n-
    540 class RefinementIteratorSpecial<dimension, CoordType, 0>
    \n-
    541 {
    \n-
    542 public:
    \n-\n-\n-\n-
    546 typedef typename Refinement::template Codim<0>::Geometry Geometry;
    \n-\n-
    548
    \n-
    549 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    550
    \n-
    551 void increment();
    \n-
    552 bool equals(const This &other) const;
    \n-
    553
    \n-
    554 IndexVector vertexIndices() const;
    \n-
    555 int index() const;
    \n-
    556 CoordVector coords() const;
    \n-
    557
    \n-
    558 Geometry geometry () const;
    \n-
    559
    \n-
    560 private:
    \n-
    561 CoordVector global(const CoordVector &local) const;
    \n-
    562
    \n-
    563 protected:
    \n-
    564 typedef FieldVector<int, dimension> Vertex;
    \n-
    565 constexpr static int nKuhnIntervals = Dune::factorial(dimension);
    \n-
    566
    \n-\n-\n-
    569 int size;
    \n-\n-
    571 };
    \n-
    \n-
    572
    \n-
    573 template<int dimension, class CoordType>
    \n-
    \n-\n-
    575 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    576 : kuhnIndex(0), size(nIntervals), index_(0)
    \n-
    577 {
    \n-
    578 for(int i = 0; i < dimension; ++i)
    \n-
    579 origin[i] = 0;
    \n-
    580 if(end) {
    \n-
    581 index_ = Refinement::nElements(nIntervals);
    \n-
    582 origin[0] = size;
    \n-
    583 }
    \n-
    584 }
    \n-
    \n-
    585
    \n-
    586 template<int dimension, class CoordType>
    \n-
    587 void
    \n-
    \n-\n-\n-
    590 {
    \n-
    591 assert(origin[0] < size);
    \n-
    592
    \n-
    593 ++index_;
    \n-
    594
    \n-
    595 while(1) {
    \n-
    596 ++kuhnIndex;
    \n-
    597 if(kuhnIndex == nKuhnIntervals) {
    \n-
    598 kuhnIndex = 0;
    \n-
    599 // increment origin
    \n-
    600 for(int i = dimension - 1; i >= 0; --i) {
    \n-
    601 ++origin[i];
    \n-
    602 if(i == 0 || origin[i] <= origin[i-1])
    \n-
    603 break;
    \n-
    604 else
    \n-
    605 origin[i] = 0;
    \n-
    606 }
    \n-
    607 }
    \n-
    608
    \n-
    609 // test whether the current simplex has any corner outside the kuhn0 simplex
    \n-
    610 FieldVector<int, dimension> perm = getPermutation<dimension>(kuhnIndex);
    \n-
    611 Vertex corner = origin;
    \n-
    612 bool outside = false;
    \n-
    613 for(int i = 0; i < dimension; ++i) {
    \n-
    614 // next corner
    \n-
    615 ++corner[perm[i]];
    \n-
    616 if(perm[i] > 0)
    \n-
    617 if(corner[perm[i]] > corner[perm[i]-1]) {
    \n-
    618 outside = true;
    \n-
    619 break;
    \n-
    620 }
    \n-
    621 }
    \n-
    622 if(!outside)
    \n-
    623 return;
    \n-
    624 }
    \n-
    625 }
    \n-
    \n-
    626
    \n-
    627 template<int dimension, class CoordType>
    \n-
    628 bool
    \n-
    \n-\n-
    630 equals(const This &other) const
    \n-
    631 {
    \n-
    632 return size == other.size && index_ == other.index_;
    \n-
    633 }
    \n-
    \n-
    634
    \n-
    635 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    638 vertexIndices() const
    \n-
    639 {
    \n-
    640 IndexVector indices;
    \n-
    641 FieldVector<int, dimension> perm = getPermutation<dimension>(kuhnIndex);
    \n-
    642 Vertex vertex = origin;
    \n-
    643 indices[0] = pointIndex(vertex);
    \n-
    644 for(int i = 0; i < dimension; ++i) {
    \n-
    645 ++vertex[perm[i]];
    \n-
    646 indices[i+1] = pointIndex(vertex);
    \n-
    647 }
    \n-
    648 if (kuhnIndex%2 == 1)
    \n-
    649 for(int i = 0; i < (dimension+1)/2; ++i) {
    \n-
    650 int t = indices[i];
    \n-
    651 indices[i] = indices[dimension-i];
    \n-
    652 indices[dimension-i] = t;
    \n-
    653 }
    \n-
    654 return indices;
    \n-
    655 }
    \n-
    \n-
    656
    \n-
    657 template<int dimension, class CoordType>
    \n-
    658 int
    \n-
    \n-\n-
    660 index() const
    \n-
    661 {
    \n-
    662 return index_;
    \n-
    663 }
    \n-
    \n-
    664
    \n-
    665 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    668 coords() const
    \n-
    669 {
    \n-\n-
    671 ::simplex().position(0,0));
    \n-
    672 }
    \n-
    \n-
    673
    \n-
    674 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    677 {
    \n-
    678 std::vector<CoordVector> corners(dimension+1);
    \n-\n-
    680 for(int i = 0; i <= dimension; ++i)
    \n-
    681 corners[i] = global(refelem.position(i, dimension));
    \n-
    682 return Geometry(refelem.type(), corners);
    \n-
    683 }
    \n-
    \n-
    684
    \n-
    685 template<int dimension, class CoordType>
    \n-\n-\n-
    688 global(const CoordVector &local) const {
    \n-
    689 CoordVector v =
    \n-
    690 referenceToKuhn(local, getPermutation<dimension>(kuhnIndex));
    \n-
    691 v += origin;
    \n-
    692 v /= (typename CoordVector::value_type)size;
    \n-
    693 return kuhnToReference(v, getPermutation<dimension>(0));
    \n-
    694 }
    \n-
    695
    \n-
    696 // common
    \n-
    697
    \n-
    698 template<int dimension, class CoordType>
    \n-
    699 template<int codimension>
    \n-
    \n-
    700 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    701 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    702 public RefinementIteratorSpecial<dimension, CoordType, codimension>
    \n-
    703 {
    \n-
    704 public:
    \n-\n-
    706
    \n-
    707 SubEntityIterator(int nIntervals, bool end = false);
    \n-
    708 };
    \n-
    \n-
    709
    \n-
    710#ifndef DOXYGEN
    \n-
    711
    \n-
    712 template<int dimension, class CoordType>
    \n-
    713 template<int codimension>
    \n-\n-
    715 SubEntityIterator(int nIntervals, bool end)
    \n-
    716 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
    \n-
    717 {}
    \n-
    718
    \n-
    719#endif
    \n-
    720
    \n-
    721 } // namespace Simplex
    \n-
    \n-
    722
    \n-
    723 } // namespace RefinementImp
    \n-
    724
    \n-
    725
    \n-
    726 namespace RefinementImp {
    \n-
    727
    \n-
    728 // ///////////////////////
    \n-
    729 //
    \n-
    730 // The refinement traits
    \n-
    731 //
    \n-
    732
    \n-
    733#ifndef DOXYGEN
    \n-
    734 template<unsigned topologyId, class CoordType, unsigned coerceToId,
    \n-
    735 int dim>
    \n-
    736 struct Traits<
    \n-
    737 topologyId, CoordType, coerceToId, dim,
    \n-
    738 typename std::enable_if<
    \n-
    739 ((GeometryTypes::simplex(dim).id() >> 1) ==
    \n-
    740 (topologyId >> 1) &&
    \n-
    741 (GeometryTypes::simplex(dim).id() >> 1) ==
    \n-
    742 (coerceToId >> 1)
    \n-
    743 )>::type
    \n-
    744 >
    \n-
    745 {
    \n-
    746 typedef Simplex::RefinementImp<dim, CoordType> Imp;
    \n-
    747 };
    \n-
    748#endif
    \n-
    749
    \n-
    750
    \n-
    751 } // namespace RefinementImp
    \n-
    752
    \n-
    753} // namespace Dune
    \n-
    754
    \n-
    755#endif //DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC
    \n-
    This file contains the parts independent of a particular Refinement implementation.
    \n-\n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    STL namespace.
    \n+
    8#include <type_traits>
    \n+
    9
    \n+
    10namespace Dune {
    \n+
    11
    \n+
    13 template<int dim>
    \n+
    \n+
    14 struct Dim
    \n+
    15 : public std::integral_constant<int,dim>
    \n+
    16 {
    \n+
    17 typedef Dim type;
    \n+
    18 };
    \n+
    \n+
    19
    \n+
    21 template<int codim>
    \n+
    \n+
    22 struct Codim
    \n+
    23 : public std::integral_constant<int,codim>
    \n+
    24 {
    \n+
    25 typedef Codim type;
    \n+
    26 };
    \n+
    \n+
    27
    \n+
    28}
    \n+
    29
    \n+
    30#endif // DUNE_GEOMETRY_DIMENSION_HH
    \n
    Definition affinegeometry.hh:21
    \n-
    int pointIndex(const FieldVector< int, dimension > &point)
    calculate the index of a given gridpoint within a Kuhn0 simplex
    Definition simplex.cc:280
    \n-
    FieldVector< int, n > getPermutation(int m)
    Calculate permutation from it's index.
    Definition simplex.cc:293
    \n-
    FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
    Map from the reference simplex to some Kuhn simplex.
    Definition simplex.cc:322
    \n-
    FieldVector< CoordType, dimension > kuhnToReference(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
    Map from some Kuhn simplex to the reference simplex.
    Definition simplex.cc:341
    \n-
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n-
    static const ReferenceElement & simplex()
    get simplex reference elements
    Definition referenceelements.hh:162
    \n+
    Static tag representing a dimension.
    Definition dimension.hh:16
    \n+
    Dim type
    Definition dimension.hh:17
    \n
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    Implement a MultiLinearGeometry with additional caching.
    Definition multilineargeometry.hh:526
    \n-\n-
    Codim< dimension >::SubEntityIterator VertexIterator
    Definition simplex.cc:368
    \n-
    FieldVector< int, dimension+1 > IndexVector
    Definition simplex.cc:371
    \n-
    CoordType ctype
    Definition simplex.cc:364
    \n-
    static int nVertices(int nIntervals)
    Definition simplex.cc:394
    \n-
    static int nElements(int nIntervals)
    Definition simplex.cc:418
    \n-
    static ElementIterator eEnd(int nIntervals)
    Definition simplex.cc:434
    \n-
    static VertexIterator vEnd(int nIntervals)
    Definition simplex.cc:410
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    Definition simplex.cc:370
    \n-
    static VertexIterator vBegin(int nIntervals)
    Definition simplex.cc:402
    \n-
    static ElementIterator eBegin(int nIntervals)
    Definition simplex.cc:426
    \n-
    FieldVector< CoordType, dimension > CoordVector
    Definition simplex.cc:369
    \n-
    static constexpr int dimension
    Definition simplex.cc:363
    \n-\n-
    Dune::CachedMultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
    Definition simplex.cc:388
    \n-\n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition simplex.cc:453
    \n-\n-
    Refinement::template Codim< dimension >::Geometry Geometry
    Definition simplex.cc:455
    \n-
    RefinementIteratorSpecial< dimension, CoordType, dimension > This
    Definition simplex.cc:456
    \n-\n-\n-\n-\n-
    FieldVector< int, dimension > Vertex
    Definition simplex.cc:564
    \n-\n-\n-
    Refinement::template Codim< 0 >::Geometry Geometry
    Definition simplex.cc:546
    \n-\n-\n-
    RefinementIteratorSpecial< dimension, CoordType, 0 > This
    Definition simplex.cc:547
    \n-
    RefinementImp< dimension, CoordType > Refinement
    Definition simplex.cc:543
    \n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition simplex.cc:705
    \n+
    Codim type
    Definition dimension.hh:25
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,682 +1,53 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-simplex.cc\n+dimension.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n-_\b6#define DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n+5#ifndef DUNE_GEOMETRY_DIMENSION_HH\n+6#define DUNE_GEOMETRY_DIMENSION_HH\n 7\n-8// This file is part of DUNE, a Distributed and Unified Numerics Environment\n-9// This file is copyright (C) 2005 Jorrit Fahlke \n-10// This file is licensed under version 2 of the GNU General Public License,\n-11// with a special \"runtime exception.\" See COPYING at the top of the source\n-12// tree for the full licence.\n-13\n-243#include \n-244\n-245#include \n-246#include \n-247\n-248#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-249#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-250#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-251\n-252#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-253\n-254namespace _\bD_\bu_\bn_\be {\n-255\n-256 namespace RefinementImp {\n-257\n-_\b2_\b6_\b4 namespace Simplex {\n-265\n-266 // //////////////////\n-267 //\n-269 //\n-270\n-272\n-279 template\n-_\b2_\b8_\b0 int _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(const FieldVector &point)\n-281 {\n-282 int index = 0;\n-283 for(int i = 0; i < dimension; ++i)\n-284 index += Dune::binomial(dimension-i + point[i]-1, dimension-i);\n-285 return index;\n-286 }\n-287\n-292 template\n-_\b2_\b9_\b3 FieldVector _\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn(int m)\n-294 {\n-295 FieldVector perm;\n-296 for(int i = 0; i < n; ++i)\n-297 perm[i] = i;\n-298\n-299 int base = 1;\n-300 for(int i = 1; i <= n; ++i)\n-301 base *= i;\n-302\n-303 for(int i = n; i > 0; --i) {\n-304 base /= i;\n-305 int d = m / base;\n-306 m %= base;\n-307 int t = perm[i-1]; perm[i-1] = perm[i-1-d]; perm[i-1-d] = t;\n-308 }\n-309 return perm;\n-310 }\n-311\n-312 // map between the reference simplex and some arbitrary kuhn simplex\n-(denoted by it's permutation)\n-320 template\n-321 FieldVector\n-_\b3_\b2_\b2 _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn(\n-323 FieldVector point,\n-325 const FieldVector &kuhn)\n-326 {\n-327 for(int i = dimension - 1; i > 0; --i)\n-328 point[kuhn[i-1]] += point[kuhn[i]];\n-329 return point;\n-330 }\n-331\n-339 template\n-340 FieldVector\n-_\b3_\b4_\b1 _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(\n-342 FieldVector point,\n-344 const FieldVector &kuhn)\n-345 {\n-346 for(int i = 0; i < dimension - 1; ++i)\n-347 point[kuhn[i]] -= point[kuhn[i+1]];\n-348 return point;\n-349 }\n-350\n-351\n-353\n-354 // /////////////////////////////////////////\n-355 //\n-356 // refinement implementation for simplices\n-357 //\n-358\n-359 template\n-_\b3_\b6_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-361 {\n-362 public:\n-_\b3_\b6_\b3 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n-_\b3_\b6_\b4 typedef CoordType _\bc_\bt_\by_\bp_\be;\n-365\n-366 template\n-367 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b3_\b6_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b3_\b6_\b9 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b3_\b7_\b0 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b3_\b7_\b1 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-372\n-373 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n-374 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-375 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n-376\n-377 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n-378 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-379 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n-380 };\n-381\n-382 template\n-383 template\n-_\b3_\b8_\b4 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n-385 {\n-386 class SubEntityIterator;\n-387 // We don't need the caching, but the uncached MultiLinearGeometry has bug\n-FS#1209\n-_\b3_\b8_\b8 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-389 };\n-390\n-391 template\n-392 int\n-_\b3_\b9_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-394_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n-395 {\n-396 return Dune::binomial(dimension + nIntervals, (int)dimension);\n-397 }\n-398\n-399 template\n-400 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b4_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-402_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-403 {\n-404 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-405 }\n-406\n-407 template\n-408 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b4_\b0_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-410_\b _\bv_\bE_\bn_\bd(int nIntervals)\n-411 {\n-412 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-413 }\n-414\n-415 template\n-416 int\n-_\b4_\b1_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-418_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n-419 {\n-420 return Dune::power(nIntervals, int(dimension));\n-421 }\n-422\n-423 template\n-424 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b4_\b2_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-426_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-427 {\n-428 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-429 }\n-430\n-431 template\n-432 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b4_\b3_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-434_\b _\be_\bE_\bn_\bd(int nIntervals)\n-435 {\n-436 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-437 }\n-438\n-439 // //////////////\n-440 //\n-441 // The iterator\n-442 //\n-443\n-444 template\n-_\b4_\b4_\b5 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-446\n-447 // vertices\n-448\n-449 template\n-_\b4_\b5_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-451 {\n-452 public:\n-_\b4_\b5_\b3 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b4_\b5_\b4 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b4_\b5_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-_\b4_\b5_\b6 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bT_\bh_\bi_\bs;\n-457\n-458 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-459\n-460 void increment();\n-461 bool equals(const _\bT_\bh_\bi_\bs &other) const;\n-462\n-463 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-464 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n-465\n-466 int index() const;\n-467 protected:\n-_\b4_\b6_\b8 typedef FieldVector _\bV_\be_\br_\bt_\be_\bx;\n-469\n-_\b4_\b7_\b0 int _\bs_\bi_\bz_\be;\n-_\b4_\b7_\b1 _\bV_\be_\br_\bt_\be_\bx _\bv_\be_\br_\bt_\be_\bx;\n-472 };\n-473\n-474 template\n-_\b4_\b7_\b5 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-476_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-477 : size(nIntervals)\n-478 {\n-479 vertex[0] = (end) ? size + 1 : 0;\n-480 for(int i = 1; i < dimension; ++ i)\n-481 vertex[i] = 0;\n-482 }\n-483\n-484 template\n-485 void\n-_\b4_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-487_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-488 {\n-489 assert(vertex[0] <= size);\n-490 for(int i = dimension - 1; i >= 0; --i) {\n-491 ++vertex[i];\n-492 if(i == 0 || vertex[i] <= vertex[i-1])\n-493 break;\n-494 else\n-495 vertex[i] = 0;\n-496 }\n-497 }\n-498\n-499 template\n-500 bool\n-_\b5_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-502_\b _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const\n-503 {\n-504 return size == other._\bs_\bi_\bz_\be && vertex == other._\bv_\be_\br_\bt_\be_\bx;\n-505 }\n-506\n-507 template\n-508 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b5_\b0_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-510_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-511 {\n-512 _\bV_\be_\br_\bt_\be_\bx ref = _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(vertex, getPermutation(0));\n-513\n-514 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords;\n-515 for(int i = 0; i < dimension; ++i)\n-516 coords[i] = CoordType(ref[i]) / size;\n-517 return coords;\n-518 }\n-519\n-520 template\n-521 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b5_\b2_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n-const\n-523 {\n-524 std::vector corners(1);\n-525 corners[0] = (_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br)vertex;\n-526 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n-527 }\n-528\n-529 template\n-530 int\n-_\b5_\b3_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-532_\b _\bi_\bn_\bd_\be_\bx() const\n-533 {\n-534 return _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n-535 }\n-536\n-537 // elements\n-538\n-539 template\n-_\b5_\b4_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-541 {\n-542 public:\n-_\b5_\b4_\b3 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b5_\b4_\b4 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-_\b5_\b4_\b5 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b5_\b4_\b6 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-_\b5_\b4_\b7 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> _\bT_\bh_\bi_\bs;\n-548\n-549 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-550\n-551 void increment();\n-552 bool equals(const _\bT_\bh_\bi_\bs &other) const;\n-553\n-554 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-555 int index() const;\n-556 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-557\n-558 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry () const;\n-559\n-560 private:\n-561 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n-562\n-563 protected:\n-_\b5_\b6_\b4 typedef FieldVector _\bV_\be_\br_\bt_\be_\bx;\n-_\b5_\b6_\b5 constexpr static int nKuhnIntervals = Dune::factorial(dimension);\n-566\n-_\b5_\b6_\b7 _\bV_\be_\br_\bt_\be_\bx _\bo_\br_\bi_\bg_\bi_\bn;\n-_\b5_\b6_\b8 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b5_\b6_\b9 int _\bs_\bi_\bz_\be;\n-_\b5_\b7_\b0 int _\bi_\bn_\bd_\be_\bx_\b_;\n-571 };\n-572\n-573 template\n-_\b5_\b7_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-575_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-576 : kuhnIndex(0), size(nIntervals), index_(0)\n-577 {\n-578 for(int i = 0; i < dimension; ++i)\n-579 origin[i] = 0;\n-580 if(end) {\n-581 index_ = Refinement::nElements(nIntervals);\n-582 origin[0] = size;\n-583 }\n-584 }\n-585\n-586 template\n-587 void\n-_\b5_\b8_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-589_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-590 {\n-591 assert(origin[0] < size);\n-592\n-593 ++index_;\n-594\n-595 while(1) {\n-596 ++kuhnIndex;\n-597 if(kuhnIndex == nKuhnIntervals) {\n-598 kuhnIndex = 0;\n-599 // increment origin\n-600 for(int i = dimension - 1; i >= 0; --i) {\n-601 ++origin[i];\n-602 if(i == 0 || origin[i] <= origin[i-1])\n-603 break;\n-604 else\n-605 origin[i] = 0;\n-606 }\n-607 }\n-608\n-609 // test whether the current simplex has any corner outside the kuhn0\n-simplex\n-610 FieldVector perm = getPermutation(kuhnIndex);\n-611 _\bV_\be_\br_\bt_\be_\bx corner = origin;\n-612 bool outside = false;\n-613 for(int i = 0; i < dimension; ++i) {\n-614 // next corner\n-615 ++corner[perm[i]];\n-616 if(perm[i] > 0)\n-617 if(corner[perm[i]] > corner[perm[i]-1]) {\n-618 outside = true;\n-619 break;\n-620 }\n-621 }\n-622 if(!outside)\n-623 return;\n-624 }\n-625 }\n-626\n-627 template\n-628 bool\n-_\b6_\b2_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-630_\b _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const\n-631 {\n-632 return size == other._\bs_\bi_\bz_\be && index_ == other._\bi_\bn_\bd_\be_\bx_\b_;\n-633 }\n-634\n-635 template\n-636 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b6_\b3_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-638_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-639 {\n-640 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices;\n-641 FieldVector perm = getPermutation(kuhnIndex);\n-642 _\bV_\be_\br_\bt_\be_\bx vertex = origin;\n-643 indices[0] = _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n-644 for(int i = 0; i < dimension; ++i) {\n-645 ++vertex[perm[i]];\n-646 indices[i+1] = _\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx(vertex);\n-647 }\n-648 if (kuhnIndex%2 == 1)\n-649 for(int i = 0; i < (dimension+1)/2; ++i) {\n-650 int t = indices[i];\n-651 indices[i] = indices[dimension-i];\n-652 indices[dimension-i] = t;\n-653 }\n-654 return indices;\n-655 }\n-656\n-657 template\n-658 int\n-_\b6_\b5_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-660_\b _\bi_\bn_\bd_\be_\bx() const\n-661 {\n-662 return index_;\n-663 }\n-664\n-665 template\n-666 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b6_\b6_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-668_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-669 {\n-670 return global(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n-671 ::simplex().position(0,0));\n-672 }\n-673\n-674 template\n-675 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b6_\b7_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n-677 {\n-678 std::vector corners(dimension+1);\n-679 auto refelem = _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx();\n-680 for(int i = 0; i <= dimension; ++i)\n-681 corners[i] = global(refelem.position(i, dimension));\n-682 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(refelem.type(), corners);\n-683 }\n-684\n-685 template\n-686 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-687 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-688_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const {\n-689 CoordVector v =\n-690 _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn(local, getPermutation(kuhnIndex));\n-691 v += origin;\n-692 v /= (typename CoordVector::value_type)size;\n-693 return _\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be(v, getPermutation(0));\n-694 }\n-695\n-696 // common\n-697\n-698 template\n-699 template\n-_\b7_\b0_\b0 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-701 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-702 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-703 {\n-704 public:\n-_\b7_\b0_\b5 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-706\n-_\b7_\b0_\b7 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n-708 };\n-709\n-710#ifndef DOXYGEN\n-711\n-712 template\n-713 template\n-714 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-715_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n-716 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n-end)\n-717 {}\n-718\n-719#endif\n-720\n-721 } // namespace Simplex\n-722\n-723 } // namespace RefinementImp\n-724\n-725\n-726 namespace RefinementImp {\n-727\n-728 // ///////////////////////\n-729 //\n-730 // The refinement traits\n-731 //\n-732\n-733#ifndef DOXYGEN\n-734 template\n-736 struct Traits<\n-737 topologyId, CoordType, coerceToId, dim,\n-738 typename _\bs_\bt_\bd::enable_if<\n-739 ((GeometryTypes::simplex(dim).id() >> 1) ==\n-740 (topologyId >> 1) &&\n-741 (GeometryTypes::simplex(dim).id() >> 1) ==\n-742 (coerceToId >> 1)\n-743 )>::type\n-744 >\n-745 {\n-746 typedef Simplex::RefinementImp Imp;\n-747 };\n-748#endif\n-749\n-750\n-751 } // namespace RefinementImp\n-752\n-753} // namespace Dune\n-754\n-755#endif //DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n-_\bb_\ba_\bs_\be_\b._\bc_\bc\n-This file contains the parts independent of a particular Refinement\n-implementation.\n-_\bm_\bu_\bl_\bt_\bi_\bl_\bi_\bn_\be_\ba_\br_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n-_\bt_\by_\bp_\be_\b._\bh_\bh\n-A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n+8#include \n+9\n+10namespace _\bD_\bu_\bn_\be {\n+11\n+13 template\n+_\b1_\b4 struct _\bD_\bi_\bm\n+15 : public std::integral_constant\n+16 {\n+_\b1_\b7 typedef _\bD_\bi_\bm _\bt_\by_\bp_\be;\n+18 };\n+19\n+21 template\n+_\b2_\b2 struct _\bC_\bo_\bd_\bi_\bm\n+23 : public std::integral_constant\n+24 {\n+_\b2_\b5 typedef _\bC_\bo_\bd_\bi_\bm _\bt_\by_\bp_\be;\n+26 };\n+27\n+28}\n+29\n+30#endif // DUNE_GEOMETRY_DIMENSION_HH\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bp_\bo_\bi_\bn_\bt_\bI_\bn_\bd_\be_\bx\n-int pointIndex(const FieldVector< int, dimension > &point)\n-calculate the index of a given gridpoint within a Kuhn0 simplex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:280\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n-FieldVector< int, n > getPermutation(int m)\n-Calculate permutation from it's index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n-FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n-dimension > point, const FieldVector< int, dimension > &kuhn)\n-Map from the reference simplex to some Kuhn simplex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bk_\bu_\bh_\bn_\bT_\bo_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-FieldVector< CoordType, dimension > kuhnToReference(FieldVector< CoordType,\n-dimension > point, const FieldVector< int, dimension > &kuhn)\n-Map from some Kuhn simplex to the reference simplex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:341\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Class providing access to the singletons of the reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n-static const ReferenceElement & simplex()\n-get simplex reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:162\n+_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm\n+Static tag representing a dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:16\n+_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b:_\b:_\bt_\by_\bp_\be\n+Dim type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:17\n _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n Static tag representing a codimension.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Implement a MultiLinearGeometry with additional caching.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:526\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:368\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< int, dimension+1 > IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:371\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n-CoordType ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:364\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:394\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:418\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:434\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:410\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:370\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:402\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:426\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:369\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:363\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:385\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Dune::CachedMultiLinearGeometry< CoordType, dimension-codimension, dimension >\n-Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:388\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:445\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:451\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:454\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:453\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bv_\be_\br_\bt_\be_\bx\n-Vertex vertex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:471\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< dimension >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:455\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n-RefinementIteratorSpecial< dimension, CoordType, dimension > This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:456\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n-FieldVector< int, dimension > Vertex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:468\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be\n-int size\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:470\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:541\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:568\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n-FieldVector< int, dimension > Vertex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:564\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bo_\br_\bi_\bg_\bi_\bn\n-Vertex origin\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:567\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx_\b_\n-int index_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:570\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< 0 >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:546\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:544\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:545\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n-RefinementIteratorSpecial< dimension, CoordType, 0 > This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:547\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:543\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n-_\b0_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be\n-int size\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:569\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(int nIntervals, bool end=false)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:705\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bt_\by_\bp_\be\n+Codim type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:25\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00227.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00227.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: hcubetriangulation.cc File Reference\n+dune-geometry: virtualrefinement.cc File Reference\n \n \n \n \n \n \n \n@@ -65,76 +65,96 @@\n \n \n \n \n \n \n \n
    \n \n-
    hcubetriangulation.cc File Reference
    \n+Macros |\n+Functions
    \n+
    virtualrefinement.cc File Reference
    \n \n
    \n \n-

    This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron) \n+

    This file contains the virtual wrapper around refinement. \n More...

    \n-
    #include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include "base.cc"
    \n-#include "simplex.cc"
    \n+
    #include <cassert>
    \n+#include <typeinfo>
    \n+#include <dune/common/exceptions.hh>
    \n+#include <dune/common/fvector.hh>
    \n+#include <dune/common/iteratorfacades.hh>
    \n+#include "type.hh"
    \n+#include "refinement.hh"
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >
    class  Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >
     
    struct  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
    class  Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >
    class  Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension >
     
    class  Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >
    class  Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, dimension >
     
    class  Dune::RefinementImp::HCubeTriangulation::RefinementImp< dimension_, CoordType >::Codim< codimension >
    class  Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, 0 >
     
    class  Dune::VirtualRefinement< dimension, CoordType >::SubEntityIteratorBack< dimension, CoordType >
     
    class  Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >
     
    class  Dune::VirtualRefinementImpSubEntityIteratorBackSpecial< topologyId, CoordType, coerceToId, dimension, dimension >
     
    class  Dune::VirtualRefinementImpSubEntityIteratorBackSpecial< topologyId, CoordType, coerceToId, dimension, 0 >
     
    class  Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::SubEntityIteratorBack< codimension >
     
    class  Dune::RefinementBuilder< dimension, CoordType >
     
    class  Dune::RefinementBuilder< 1, CoordType >
     
    class  Dune::RefinementBuilder< 3, CoordType >
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    namespace  Dune::RefinementImp::HCubeTriangulation
     This namespace contains the Refinement implementation for triangulating hypercubes (GeometryType::cube -> GeometryType::simplex)
     
    \n \n-\n-\n+\n+\n+

    \n Macros

    #define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
     
    #define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<int dimension, class CoordType >
    VirtualRefinement< dimension, CoordType > & Dune::buildRefinement (GeometryType geometryType, GeometryType coerceTo)
     return a reference to the VirtualRefinement according to the parameters
     
    \n

    Detailed Description

    \n-

    This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron)

    \n-

    See Refinement implementation for triangulating hypercubes.

    \n+

    This file contains the virtual wrapper around refinement.

    \n

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC

    \n+\n+

    ◆ DUNE_GEOMETRY_VIRTUALREFINEMENT_CC

    \n \n
    \n
    \n \n \n- \n+ \n \n
    #define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n
    \n \n
    \n
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,55 +1,74 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n-hcubetriangulation.cc File Reference\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for triangulating hypercubes\n-(quadrilateral -> triangle, hexahedron -> tetrahedron) _\bM_\bo_\br_\be_\b._\b._\b.\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+virtualrefinement.cc File Reference\n+This file contains the virtual wrapper around refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+ _\b0_\b _\b>\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,\n- _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n \u00a0\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n+ _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+ _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn\n- This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n-\u00a0 triangulating hypercubes (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be -> _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:\n- _\bs_\bi_\bm_\bp_\bl_\be_\bx)\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b1_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b3_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bH_\bC_\bU_\bB_\bE_\bT_\bR_\bI_\bA_\bN_\bG_\bU_\bL_\bA_\bT_\bI_\bO_\bN_\b__\bC_\bC\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bV_\bI_\bR_\bT_\bU_\bA_\bL_\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bC_\bC\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt< dimension, CoordType > _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+ &\u00a0 geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n+ return a reference to the\n+\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt according to the\n+ parameters\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for triangulating hypercubes\n-(quadrilateral -> triangle, hexahedron -> tetrahedron)\n-See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bn_\bg_\b _\bh_\by_\bp_\be_\br_\bc_\bu_\bb_\be_\bs.\n+This file contains the virtual wrapper around refinement.\n *\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_H\bHC\bCU\bUB\bBE\bET\bTR\bRI\bIA\bAN\bNG\bGU\bUL\bLA\bAT\bTI\bIO\bON\bN_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_V\bVI\bIR\bRT\bTU\bUA\bAL\bLR\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n+#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00227_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00227_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: hcubetriangulation.cc Source File\n+dune-geometry: virtualrefinement.cc Source File\n \n \n \n \n \n \n \n@@ -70,509 +70,821 @@\n
    \n
    \n \n \n \n \n \n
    \n-
    hcubetriangulation.cc
    \n+
    virtualrefinement.cc
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
    \n-
    6#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
    \n-
    7
    \n-\n-
    30#include <dune/geometry/type.hh>
    \n-
    31
    \n-
    32#include "base.cc"
    \n-
    33#include "simplex.cc"
    \n+
    5
    \n+
    6#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n+
    7#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n+
    8
    \n+
    14#include <cassert>
    \n+
    15#include <typeinfo>
    \n+
    16
    \n+
    17#include <dune/common/exceptions.hh>
    \n+
    18#include <dune/common/fvector.hh>
    \n+
    19#include <dune/common/iteratorfacades.hh>
    \n+
    20
    \n+
    21#include "type.hh"
    \n+
    22#include "refinement.hh"
    \n+
    23
    \n+
    24namespace Dune
    \n+
    25{
    \n+
    26 // //////////////////////////////////////////
    \n+
    27 //
    \n+
    28 // The virtual base class and its iterators
    \n+
    29 //
    \n+
    30
    \n+
    31 //
    \n+
    32 // Refinement
    \n+
    33 //
    \n
    34
    \n-
    35namespace Dune
    \n-
    36{
    \n-
    37 namespace RefinementImp
    \n-
    38 {
    \n-
    \n-
    46 namespace HCubeTriangulation {
    \n-
    47
    \n-
    48 // ////////////
    \n-
    49 //
    \n-
    50 // Utilities
    \n-
    51 //
    \n-
    52
    \n-\n-\n-
    55
    \n-
    56 // ////////////////////////////////////
    \n-
    57 //
    \n-
    58 // Refine a hypercube with simplices
    \n-
    59 //
    \n-
    60
    \n-
    61 // forward declaration of the iterator base
    \n-
    62 template<int dimension, class CoordType, int codimension>
    \n-\n-
    64
    \n-
    65 template<int dimension_, class CoordType>
    \n-
    \n-\n-
    67 {
    \n-
    68 public:
    \n-
    69 constexpr static int dimension = dimension_;
    \n+
    35 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+\n+
    39 {
    \n+
    40 return VertexIterator(vBeginBack(tag));
    \n+
    41 }
    \n+
    \n+
    42
    \n+
    43 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+\n+
    47 {
    \n+
    48 return VertexIterator(vEndBack(tag));
    \n+
    49 }
    \n+
    \n+
    50
    \n+
    51 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+\n+
    55 {
    \n+
    56 return ElementIterator(eBeginBack(tag));
    \n+
    57 }
    \n+
    \n+
    58
    \n+
    59 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+\n+
    63 {
    \n+
    64 return ElementIterator(eEndBack(tag));
    \n+
    65 }
    \n+
    \n+
    66
    \n+
    67 //
    \n+
    68 // The iterators
    \n+
    69 //
    \n
    70
    \n-
    71 typedef CoordType ctype;
    \n-
    72
    \n-
    73 template<int codimension>
    \n-
    74 struct Codim;
    \n-\n-
    76 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-\n-
    78 typedef FieldVector<int, dimension+1> IndexVector;
    \n-
    79
    \n-
    80 static int nVertices(int nIntervals);
    \n-
    81 static VertexIterator vBegin(int nIntervals);
    \n-
    82 static VertexIterator vEnd(int nIntervals);
    \n-
    83
    \n-
    84 static int nElements(int nIntervals);
    \n-
    85 static ElementIterator eBegin(int nIntervals);
    \n-
    86 static ElementIterator eEnd(int nIntervals);
    \n-
    87 private:
    \n-
    88 friend class RefinementIteratorSpecial<dimension, CoordType, 0>;
    \n-
    89 friend class RefinementIteratorSpecial<dimension, CoordType, dimension>;
    \n-
    90
    \n-\n-
    92 };
    \n-
    \n-
    93
    \n-
    94 template<int dimension, class CoordType>
    \n-
    95 template<int codimension>
    \n-
    \n-
    96 struct RefinementImp<dimension, CoordType>::Codim
    \n-
    97 {
    \n-
    98 class SubEntityIterator;
    \n-
    99 typedef Dune::MultiLinearGeometry<CoordType,dimension-codimension,dimension> Geometry;
    \n-
    100 };
    \n-
    \n-
    101
    \n-
    102 template<int dimension, class CoordType>
    \n-
    103 int
    \n-
    \n-\n-
    105 nVertices(int nIntervals)
    \n-
    106 {
    \n-
    107 return BackendRefinement::nVertices(nIntervals) * factorial(int(dimension));
    \n-
    108 }
    \n-
    \n-
    109
    \n-
    110 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    113 vBegin(int nIntervals)
    \n-
    114 {
    \n-
    115 return VertexIterator(nIntervals);
    \n-
    116 }
    \n+
    71 template<int dimension, class CoordType, int codimension>
    \n+\n+
    73
    \n+
    74 // The iterator for vertices
    \n+
    75 template<int dimension, class CoordType>
    \n+
    \n+
    76 class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>
    \n+
    77 {};
    \n+
    \n+
    78
    \n+
    79 // The iterator for elements
    \n+
    80 template<int dimension, class CoordType>
    \n+
    \n+
    81 class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, 0>
    \n+
    82 {
    \n+
    83 public:
    \n+\n+
    85 typedef typename Refinement::template Codim<0>::SubEntityIterator Common;
    \n+
    86 typedef typename Refinement::IndexVector IndexVector;
    \n+
    87
    \n+
    88 IndexVector vertexIndices() const;
    \n+
    89 };
    \n
    \n+
    90
    \n+
    91 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+
    94 vertexIndices() const
    \n+
    95 {
    \n+
    96 return static_cast<const Common *>(this)->backend->vertexIndices();
    \n+
    97 }
    \n+
    \n+
    98
    \n+
    99 // The iterator common stuff
    \n+
    100 template<int dimension, class CoordType>
    \n+
    101 template<int codimension>
    \n+
    \n+
    102 class VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n+
    103 : public ForwardIteratorFacade<typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n+
    104 public VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>
    \n+
    105 {
    \n+
    106 public:
    \n+\n+
    108 typedef typename Refinement::template Codim<codimension>::SubEntityIterator This;
    \n+
    109 typedef typename Refinement::template SubEntityIteratorBack<codimension> IteratorBack;
    \n+
    110 typedef typename Refinement::CoordVector CoordVector;
    \n+
    111
    \n+\n+
    113 SubEntityIterator(const This &other);
    \n+\n+
    115
    \n+
    116 This &operator=(const This &other);
    \n
    117
    \n-
    118 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    121 vEnd(int nIntervals)
    \n-
    122 {
    \n-
    123 return VertexIterator(nIntervals, true);
    \n-
    124 }
    \n-
    \n-
    125
    \n-
    126 template<int dimension, class CoordType>
    \n-
    127 int
    \n-
    \n-\n-
    129 nElements(int nIntervals)
    \n-
    130 {
    \n-
    131 return BackendRefinement::nElements(nIntervals) * factorial(int(dimension));
    \n-
    132 }
    \n-
    \n-
    133
    \n-
    134 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    137 eBegin(int nIntervals)
    \n-
    138 {
    \n-
    139 return ElementIterator(nIntervals);
    \n-
    140 }
    \n-
    \n-
    141
    \n-
    142 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    145 eEnd(int nIntervals)
    \n-
    146 {
    \n-
    147 return ElementIterator(nIntervals, true);
    \n-
    148 }
    \n-
    \n-
    149
    \n-
    150 // //////////////
    \n-
    151 //
    \n-
    152 // The iterator
    \n-
    153 //
    \n-
    154
    \n-
    155 // vertices
    \n-
    156 template<int dimension, class CoordType>
    \n-
    \n-
    157 class RefinementIteratorSpecial<dimension, CoordType, dimension>
    \n-
    158 {
    \n-
    159 public:
    \n-\n-
    161 typedef typename Refinement::CoordVector CoordVector;
    \n-
    162 typedef typename Refinement::template Codim<dimension>::Geometry Geometry;
    \n+
    118 bool equals(const This &other) const;
    \n+
    119 void increment();
    \n+
    120
    \n+
    121 int index() const;
    \n+
    122
    \n+
    123 // If you simply use an unqualified CoordVector here g++-4.2 chokes
    \n+\n+
    125 CoordVector coords() const;
    \n+
    126 private:
    \n+
    127 friend class VirtualRefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>;
    \n+
    128 IteratorBack *backend;
    \n+
    129 };
    \n+
    \n+
    130
    \n+
    131#ifndef DOXYGEN
    \n+
    132 template<int dimension, class CoordType>
    \n+
    133 template<int codimension>
    \n+\n+
    135 SubEntityIterator(IteratorBack *backend_)
    \n+
    136 : backend(backend_)
    \n+
    137 {}
    \n+
    138
    \n+
    139 template<int dimension, class CoordType>
    \n+
    140 template<int codimension>
    \n+\n+
    142 SubEntityIterator(const This &other)
    \n+
    143 : backend(other.backend->clone())
    \n+
    144 {}
    \n+
    145
    \n+
    146 template<int dimension, class CoordType>
    \n+
    147 template<int codimension>
    \n+
    148 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    149 ~SubEntityIterator()
    \n+
    150 {
    \n+
    151 delete backend;
    \n+
    152 }
    \n+
    153
    \n+
    154 template<int dimension, class CoordType>
    \n+
    155 template<int codimension>
    \n+
    156 typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator &
    \n+
    157 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    158 operator=(const This &other)
    \n+
    159 {
    \n+
    160 delete backend;
    \n+
    161 backend = other.backend->clone();
    \n+
    162 }
    \n
    163
    \n-
    164 RefinementIteratorSpecial(int nIntervals, bool end = false);
    \n-
    165
    \n-
    166 void increment();
    \n-
    167
    \n-
    168 CoordVector coords() const;
    \n-
    169
    \n-
    170 Geometry geometry() const;
    \n-
    171
    \n-
    172 int index() const;
    \n-
    173 protected:
    \n-
    174 typedef typename Refinement::BackendRefinement BackendRefinement;
    \n-
    175 typedef typename BackendRefinement::template Codim<dimension>::SubEntityIterator BackendIterator;
    \n-
    176 constexpr static int nKuhnSimplices = factorial(int(dimension));
    \n-
    177
    \n-\n+
    164 template<int dimension, class CoordType>
    \n+
    165 template<int codimension>
    \n+
    166 bool
    \n+
    167 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    168 equals(const This &other) const
    \n+
    169 { return *backend == *(other.backend); }
    \n+
    170
    \n+
    171 template<int dimension, class CoordType>
    \n+
    172 template<int codimension>
    \n+
    173 void
    \n+
    174 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    175 increment()
    \n+
    176 {
    \n+
    177 ++*backend;
    \n+
    178 }
    \n
    179
    \n-\n-\n-\n-
    183 };
    \n-
    \n-
    184
    \n-
    185 template<int dimension, class CoordType>
    \n-
    \n-\n-
    187 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    188 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    189 backend(BackendRefinement::vBegin(nIntervals_)),
    \n-
    190 backendEnd(BackendRefinement::vEnd(nIntervals_))
    \n-
    191 {
    \n-
    192 if (end)
    \n-
    193 kuhnIndex = nKuhnSimplices;
    \n-
    194 }
    \n-
    \n-
    195
    \n-
    196 template<int dimension, class CoordType>
    \n-
    197 void
    \n-
    \n-\n-\n-
    200 {
    \n-
    201 ++backend;
    \n-
    202 if (backend == backendEnd)
    \n-
    203 {
    \n-
    204 backend = BackendRefinement::vBegin(nIntervals_);
    \n-
    205 ++kuhnIndex;
    \n-
    206 }
    \n-
    207 }
    \n-
    \n-
    208
    \n-
    209 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    212 coords() const
    \n-
    213 {
    \n-
    214 return referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
    \n-
    215 }
    \n-
    \n-
    216
    \n-
    217 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    220 {
    \n-
    221 std::vector<CoordVector> corners(1);
    \n-
    222 corners[0] = referenceToKuhn(backend.coords(), getPermutation<dimension>(kuhnIndex));
    \n-
    223 return Geometry(GeometryTypes::vertex, corners);
    \n-
    224 }
    \n+
    180 template<int dimension, class CoordType>
    \n+
    181 template<int codimension>
    \n+
    182 int
    \n+
    183 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    184 index() const
    \n+
    185 { return backend->index(); }
    \n+
    186
    \n+
    187 template<int dimension, class CoordType>
    \n+
    188 template<int codimension>
    \n+
    189 typename VirtualRefinement<dimension, CoordType>::template Codim<codimension>::SubEntityIterator::CoordVector
    \n+
    190 VirtualRefinement<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n+
    191 coords() const
    \n+
    192 { return backend->coords(); }
    \n+
    193#endif // DOXYGEN
    \n+
    194
    \n+
    195 //
    \n+
    196 // The iterator backend
    \n+
    197 //
    \n+
    198
    \n+
    199 template<int dimension, class CoordType, int codimension>
    \n+\n+
    201
    \n+
    202 // The iterator backend for vertices
    \n+
    203 template<int dimension, class CoordType>
    \n+
    \n+
    204 class VirtualRefinementSubEntityIteratorBackSpecial<dimension, CoordType, dimension>
    \n+
    205 {
    \n+
    206 public:
    \n+
    207
    \n+\n+
    210 };
    \n+
    \n+
    211
    \n+
    212 // The iterator backend for elements
    \n+
    213 template<int dimension, class CoordType>
    \n+
    \n+\n+
    215 {
    \n+
    216 public:
    \n+\n+
    218 typedef typename Refinement::IndexVector IndexVector;
    \n+
    219
    \n+
    220 virtual IndexVector vertexIndices() const = 0;
    \n+
    221
    \n+\n+
    224 };
    \n
    \n
    225
    \n-
    226 template<int dimension, class CoordType>
    \n-
    227 int
    \n-
    \n-\n-
    229 index() const
    \n-
    230 {
    \n-
    231 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index();
    \n-
    232 }
    \n-
    \n-
    233
    \n-
    234 // elements
    \n-
    235 template<int dimension, class CoordType>
    \n-
    \n-
    236 class RefinementIteratorSpecial<dimension, CoordType, 0>
    \n-
    237 {
    \n-
    238 public:
    \n-\n-\n-\n-
    242 typedef typename Refinement::template Codim<0>::Geometry Geometry;
    \n+
    226 // The iterator backend common stuff
    \n+
    227 template<int dimension, class CoordType>
    \n+
    228 template<int codimension>
    \n+
    \n+
    229 class VirtualRefinement<dimension, CoordType>::SubEntityIteratorBack
    \n+
    230 : public VirtualRefinementSubEntityIteratorBackSpecial<dimension, CoordType, codimension>
    \n+
    231 {
    \n+
    232 public:
    \n+\n+
    234 typedef typename Refinement::template SubEntityIteratorBack<codimension> This;
    \n+
    235 typedef typename Refinement::CoordVector CoordVector;
    \n+
    236
    \n+\n+
    238
    \n+
    239 virtual This *clone() const = 0;
    \n+
    240
    \n+
    241 virtual bool operator==(const This &other) const = 0;
    \n+
    242 virtual This &operator++() = 0;
    \n
    243
    \n-
    244 RefinementIteratorSpecial(int nIntervals_, bool end = false);
    \n-\n-
    246
    \n-
    247 void increment();
    \n-
    248
    \n-
    249 IndexVector vertexIndices() const;
    \n-
    250 int index() const;
    \n-
    251 CoordVector coords() const;
    \n+
    244 virtual int index() const = 0;
    \n+
    245 virtual CoordVector coords() const = 0;
    \n+
    246 };
    \n+
    \n+
    247
    \n+
    248 // /////////////////////////////////////////////////
    \n+
    249 //
    \n+
    250 // The derived classes and their iterator backends
    \n+
    251 //
    \n
    252
    \n-
    253 Geometry geometry() const;
    \n-
    254
    \n-
    255 private:
    \n-
    256 CoordVector global(const CoordVector &local) const;
    \n-
    257
    \n-
    258 protected:
    \n-\n-
    260 typedef typename BackendRefinement::template Codim<0>::SubEntityIterator BackendIterator;
    \n-
    261 constexpr static int nKuhnSimplices = factorial(dimension);
    \n-
    262
    \n-\n-
    264
    \n-\n-\n-\n-
    268 };
    \n-
    \n-
    269
    \n-
    270 template<int dimension, class CoordType>
    \n-
    \n-\n-
    272 RefinementIteratorSpecial(int nIntervals, bool end)
    \n-
    273 : nIntervals_(nIntervals), kuhnIndex(0),
    \n-
    274 backend(BackendRefinement::eBegin(nIntervals_)),
    \n-
    275 backendEnd(BackendRefinement::eEnd(nIntervals_))
    \n-
    276 {
    \n-
    277 if (end)
    \n-
    278 kuhnIndex = nKuhnSimplices;
    \n-
    279 }
    \n-
    \n-
    280 template<int dimension, class CoordType>
    \n-
    \n-\n-\n-
    283 : nIntervals_(other.nIntervals_), kuhnIndex(other.kuhnIndex),
    \n-
    284 backend(other.backend),
    \n-
    285 backendEnd(other.backendEnd)
    \n-
    286 {}
    \n-
    \n-
    287
    \n-
    288 template<int dimension, class CoordType>
    \n-
    289 void
    \n-
    \n-\n-\n-
    292 {
    \n-
    293 ++backend;
    \n-
    294 if (backend == backendEnd)
    \n-
    295 {
    \n-
    296 backend = BackendRefinement::eBegin(nIntervals_);
    \n-
    297 ++kuhnIndex;
    \n-
    298 }
    \n-
    299 }
    \n-
    \n-
    300
    \n-
    301 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    304 vertexIndices() const
    \n-
    305 {
    \n-
    306 IndexVector indices = backend.vertexIndices();
    \n-
    307
    \n-
    308 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);
    \n-
    309 indices += base;
    \n-
    310
    \n-
    311 return indices;
    \n-
    312 }
    \n-
    \n-
    313
    \n-
    314 template<int dimension, class CoordType>
    \n-
    315 int
    \n-
    \n-\n-
    317 index() const
    \n-
    318 {
    \n-
    319 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index();
    \n-
    320 }
    \n-
    \n-
    321
    \n-
    322 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    325 coords() const
    \n-
    326 {
    \n-
    327 return global(backend.coords());
    \n-
    328 }
    \n-
    \n-
    329
    \n-
    330 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    333 {
    \n-
    334 const typename BackendIterator::Geometry &bgeo =
    \n-
    335 backend.geometry();
    \n-
    336 std::vector<CoordVector> corners(dimension+1);
    \n-
    337 for(int i = 0; i <= dimension; ++i)
    \n-
    338 corners[i] = global(bgeo.corner(i));
    \n-
    339
    \n-
    340 return Geometry(bgeo.type(), corners);
    \n-
    341 }
    \n-
    \n+
    253 //
    \n+
    254 // The refinement implementation
    \n+
    255 //
    \n+
    256
    \n+
    257 template<unsigned topologyId, class CoordType,
    \n+
    258 unsigned coerceToId, int dimension>
    \n+
    \n+\n+
    260 : public Dune::VirtualRefinement<dimension, CoordType>
    \n+
    261 {
    \n+
    262 public:
    \n+\n+\n+
    265
    \n+
    266 template<int codimension>
    \n+\n+
    268
    \n+
    269 int nVertices(Dune::RefinementIntervals tag) const override;
    \n+
    270
    \n+
    271 int nElements(Dune::RefinementIntervals tag) const override;
    \n+
    272
    \n+\n+
    274 private:
    \n+\n+
    276
    \n+
    277 typename VirtualRefinement::VertexIteratorBack *vBeginBack(Dune::RefinementIntervals tag) const override;
    \n+
    278 typename VirtualRefinement::VertexIteratorBack *vEndBack(Dune::RefinementIntervals tag) const override;
    \n+
    279 typename VirtualRefinement::ElementIteratorBack *eBeginBack(Dune::RefinementIntervals tag) const override;
    \n+
    280 typename VirtualRefinement::ElementIteratorBack *eEndBack(Dune::RefinementIntervals tag) const override;
    \n+
    281 };
    \n+
    \n+
    282
    \n+
    283 template<unsigned topologyId, class CoordType,
    \n+
    284 unsigned coerceToId, int dimension>
    \n+
    285 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension> &
    \n+
    \n+\n+
    287 {
    \n+
    288 static VirtualRefinementImp instance_{};
    \n+
    289 return instance_;
    \n+
    290 }
    \n+
    \n+
    291
    \n+
    292 template<unsigned topologyId, class CoordType,
    \n+
    293 unsigned coerceToId, int dimension>
    \n+\n+
    299
    \n+
    300 template<unsigned topologyId, class CoordType,
    \n+
    301 unsigned coerceToId, int dimension>
    \n+\n+\n+\n+
    305 {
    \n+
    306 return new SubEntityIteratorBack<dimension>(StaticRefinement::vBegin(tag));
    \n+
    307 }
    \n+
    308
    \n+
    309 template<unsigned topologyId, class CoordType,
    \n+
    310 unsigned coerceToId, int dimension>
    \n+\n+
    312 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::
    \n+
    313 vEndBack(Dune::RefinementIntervals tag) const
    \n+
    314 {
    \n+
    315 return new SubEntityIteratorBack<dimension>(StaticRefinement::vEnd(tag));
    \n+
    316 }
    \n+
    317
    \n+
    318 template<unsigned topologyId, class CoordType,
    \n+
    319 unsigned coerceToId, int dimension>
    \n+\n+
    324
    \n+
    325 template<unsigned topologyId, class CoordType,
    \n+
    326 unsigned coerceToId, int dimension>
    \n+\n+\n+\n+
    330 {
    \n+
    331 return new SubEntityIteratorBack<0>(StaticRefinement::eBegin(tag));
    \n+
    332 }
    \n+
    333
    \n+
    334 template<unsigned topologyId, class CoordType,
    \n+
    335 unsigned coerceToId, int dimension>
    \n+\n+
    337 VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::
    \n+
    338 eEndBack(Dune::RefinementIntervals tag) const
    \n+
    339 {
    \n+
    340 return new SubEntityIteratorBack<0>(StaticRefinement::eEnd(tag));
    \n+
    341 }
    \n
    342
    \n-
    343 template<int dimension, class CoordType>
    \n-\n-\n-
    346 global(const CoordVector &local) const
    \n-
    347 {
    \n-
    348 return referenceToKuhn(local, getPermutation<dimension>(kuhnIndex));
    \n-
    349 }
    \n-
    350
    \n-
    351 // common
    \n-
    352 template<int dimension, class CoordType>
    \n-
    353 template<int codimension>
    \n-
    \n-
    354 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    355 : public ForwardIteratorFacade<typename RefinementImp<dimension, CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    356 public RefinementIteratorSpecial<dimension, CoordType, codimension>
    \n-
    357 {
    \n-
    358 public:
    \n-\n-
    360 typedef SubEntityIterator This;
    \n-
    361
    \n-
    362 SubEntityIterator(int nIntervals, bool end = false);
    \n-
    363
    \n-
    364 bool equals(const This &other) const;
    \n-
    365 protected:
    \n-
    366 using RefinementIteratorSpecial<dimension, CoordType, codimension>::kuhnIndex;
    \n-
    367 using RefinementIteratorSpecial<dimension, CoordType, codimension>::backend;
    \n-
    368 };
    \n-
    \n-
    369
    \n-
    370#ifndef DOXYGEN
    \n-
    371 template<int dimension, class CoordType>
    \n-
    372 template<int codimension>
    \n-\n-
    374 SubEntityIterator(int nIntervals, bool end)
    \n-
    375 : RefinementIteratorSpecial<dimension, CoordType, codimension>(nIntervals, end)
    \n-
    376 {}
    \n-
    377
    \n-
    378 template<int dimension, class CoordType>
    \n-
    379 template<int codimension>
    \n-
    380 bool
    \n-\n-
    382 equals(const This &other) const
    \n-
    383 { return kuhnIndex == other.kuhnIndex && backend == other.backend; }
    \n+
    343 //
    \n+
    344 // The iterator backend implementation
    \n+
    345 //
    \n+
    346
    \n+
    347 // The iterator backend implementation specialties
    \n+
    348 template<unsigned topologyId, class CoordType,
    \n+
    349 unsigned coerceToId, int dimension, int codimension>
    \n+\n+
    351
    \n+
    352 // The iterator backend implementation specialties for vertices
    \n+
    353 template<unsigned topologyId, class CoordType,
    \n+
    354 unsigned coerceToId, int dimension>
    \n+
    \n+
    355 class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, dimension>
    \n+
    356 : public VirtualRefinement<dimension, CoordType>::template SubEntityIteratorBack<dimension>
    \n+
    357 {};
    \n+
    \n+
    358
    \n+
    359 // The iterator backend implementation specialties for elements
    \n+
    360
    \n+
    361 template<unsigned topologyId, class CoordType,
    \n+
    362 unsigned coerceToId, int dimension>
    \n+
    \n+
    363 class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, 0>
    \n+
    364 : public VirtualRefinement<dimension, CoordType>::template SubEntityIteratorBack<0>
    \n+
    365 {
    \n+
    366 public:
    \n+\n+
    368 typedef typename VirtualRefinementImp::template SubEntityIteratorBack<0> Common;
    \n+\n+\n+
    371 typedef typename RefinementBase::IndexVector IndexVector;
    \n+
    372
    \n+
    373 IndexVector vertexIndices() const;
    \n+
    374 };
    \n+
    \n+
    375
    \n+
    376 template<unsigned topologyId, class CoordType,
    \n+
    377 unsigned coerceToId, int dimension>
    \n+\n+
    \n+\n+
    380 vertexIndices() const
    \n+
    381 {
    \n+
    382 IndexVector vIndices;
    \n+
    383 vIndices.reserve(StaticRefinement::IndexVector::dimension);
    \n
    384
    \n-
    385#endif // DOXYGEN
    \n-
    386
    \n-
    387 } // namespace HCubeTriangulation
    \n-
    \n-
    388 } // namespace RefinementImp
    \n-
    389
    \n-
    390 namespace RefinementImp
    \n-
    391 {
    \n-
    392 // ///////////////////////
    \n-
    393 //
    \n-
    394 // The refinement traits
    \n-
    395 //
    \n-
    396
    \n-
    397#ifndef DOXYGEN
    \n-
    398 template<unsigned topologyId, class CoordType, unsigned coerceToId,
    \n-
    399 int dim>
    \n-
    400 struct Traits<
    \n-
    401 topologyId, CoordType, coerceToId, dim,
    \n-
    402 typename std::enable_if<
    \n-
    403 (dim >= 2 &&
    \n-
    404 (GeometryTypes::cube(dim).id() >> 1) ==
    \n-
    405 (topologyId >> 1) &&
    \n-
    406 (GeometryTypes::simplex(dim).id() >> 1) ==
    \n-
    407 (coerceToId >> 1)
    \n-
    408 )>::type
    \n-
    409 >
    \n-
    410 {
    \n-
    411 typedef HCubeTriangulation::RefinementImp<dim, CoordType> Imp;
    \n-
    412 };
    \n-
    413#endif
    \n+
    385 typename StaticRefinement::IndexVector sIndices = static_cast<const Common *>(this)->backend.vertexIndices();
    \n+
    386 for(int i = 0; i < StaticRefinement::IndexVector::dimension; ++i)
    \n+
    387 vIndices.push_back(sIndices[i]);
    \n+
    388 return vIndices;
    \n+
    389 }
    \n+
    \n+
    390
    \n+
    391 // The shared iterator backend implementation
    \n+
    392 template<unsigned topologyId, class CoordType,
    \n+
    393 unsigned coerceToId, int dimension>
    \n+
    394 template<int codimension>
    \n+
    \n+
    395 class VirtualRefinementImp<topologyId, CoordType, coerceToId, dimension>::SubEntityIteratorBack
    \n+
    396 : public VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>
    \n+
    397 {
    \n+
    398 public:
    \n+
    399 typedef typename StaticRefinement::template Codim<codimension>::SubEntityIterator BackendIterator;
    \n+\n+
    401 typedef typename VirtualRefinement::template SubEntityIteratorBack<codimension> Base;
    \n+\n+
    403
    \n+\n+
    405 SubEntityIteratorBack(const This &other);
    \n+
    406
    \n+
    407 Base *clone() const;
    \n+
    408
    \n+
    409 bool operator==(const Base &other) const;
    \n+
    410 Base &operator++();
    \n+
    411
    \n+
    412 int index() const;
    \n+
    413 CoordVector coords() const;
    \n
    414
    \n-
    415 } // namespace RefinementImp
    \n-
    416} // namespace Dune
    \n-
    417
    \n-
    418#endif // DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC
    \n-
    This file contains the parts independent of a particular Refinement implementation.
    \n-
    This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    STL namespace.
    \n+
    415 private:
    \n+
    416 friend class VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>;
    \n+
    417 BackendIterator backend;
    \n+
    418 };
    \n+
    \n+
    419
    \n+
    420 template<unsigned topologyId, class CoordType,
    \n+
    421 unsigned coerceToId, int dimension>
    \n+
    422 template<int codimension>
    \n+\n+
    427
    \n+
    428 template<unsigned topologyId, class CoordType,
    \n+
    429 unsigned coerceToId, int dimension>
    \n+
    430 template<int codimension>
    \n+
    \n+\n+
    432 SubEntityIteratorBack(const This &other)
    \n+
    433 : VirtualRefinementImpSubEntityIteratorBackSpecial<topologyId, CoordType, coerceToId, dimension, codimension>(other),
    \n+
    434 backend(other.backend)
    \n+
    435 {}
    \n+
    \n+
    436
    \n+
    437 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n+
    438 template<int codimension>
    \n+\n+\n+
    443
    \n+
    444 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n+
    445 template<int codimension>
    \n+
    446 bool
    \n+
    \n+\n+
    448 operator==(const Base &other) const
    \n+
    449 {
    \n+
    450 try {
    \n+
    451 return backend == dynamic_cast<const This &>(other).backend;
    \n+
    452 }
    \n+
    453 catch(const std::bad_cast&)
    \n+
    454 {
    \n+
    455 return false;
    \n+
    456 }
    \n+
    457 }
    \n+
    \n+
    458
    \n+
    459 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n+
    460 template<int codimension>
    \n+\n+\n+
    468
    \n+
    469 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n+
    470 template<int codimension>
    \n+
    471 int
    \n+\n+
    475
    \n+
    476 template<unsigned topologyId, class CoordType, unsigned coerceToId, int dimension>
    \n+
    477 template<int codimension>
    \n+\n+\n+
    482
    \n+
    483 // ////////////////////////
    \n+
    484 //
    \n+
    485 // The refinement builder
    \n+
    486 //
    \n+
    487
    \n+
    488 template<int dimension, class CoordType>
    \n+
    489 class RefinementBuilder;
    \n+
    490
    \n+
    501 template<int dimension, class CoordType>
    \n+\n+
    \n+\n+
    504 GeometryType geometryType,
    \n+
    506 GeometryType coerceTo)
    \n+
    507 {
    \n+
    508 // Check that the user used valid geometry types
    \n+
    509 assert(geometryType.dim() == dimension && coerceTo.dim() == dimension);
    \n+
    510 return RefinementBuilder<dimension, CoordType>::build( geometryType.id(), coerceTo.id() );
    \n+
    511 }
    \n+
    \n+
    512
    \n+
    513 // In principle the trick with the class is no longer necessary,
    \n+
    514 // but I'm keeping it in here so it will be easier to specialize
    \n+
    515 // buildRefinement when someone implements pyramids and prisms
    \n+
    516 template<int dimension, class CoordType>
    \n+
    \n+\n+
    518 {
    \n+
    519 public:
    \n+
    520 static
    \n+\n+
    \n+
    522 build(unsigned topologyId, unsigned coerceToId)
    \n+
    523 {
    \n+
    524 topologyId &= ~1;
    \n+
    525 coerceToId &= ~1;
    \n+
    526
    \n+
    527 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n+
    528 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;
    \n+
    529
    \n+
    530 switch( topologyId )
    \n+
    531 {
    \n+
    532 //case GeometryType::simplex:
    \n+
    533 case idSimplex :
    \n+
    534 //switch( coerceTo )
    \n+
    535 switch( coerceToId )
    \n+
    536 {
    \n+
    537 //case GeometryType::simplex:
    \n+
    538 case idSimplex :
    \n+\n+
    540 default :
    \n+
    541 break;
    \n+
    542 }
    \n+
    543 break;
    \n+
    544
    \n+
    545 //case GeometryType::cube:
    \n+
    546 case idCube :
    \n+
    547 switch( coerceToId )
    \n+
    548 {
    \n+
    549 case idSimplex :
    \n+\n+
    551 case idCube :
    \n+\n+
    553 default :
    \n+
    554 break;
    \n+
    555 }
    \n+
    556 break;
    \n+
    557
    \n+
    558 default :
    \n+
    559 break;
    \n+
    560 }
    \n+
    561 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n+
    562 << coerceToId << " >.");
    \n+
    563 }
    \n+
    \n+
    564 };
    \n+
    \n+
    565
    \n+
    566 template<class CoordType>
    \n+
    \n+
    567 class RefinementBuilder<1, CoordType>
    \n+
    568 {
    \n+
    569 static const std::size_t dimension = 1;
    \n+
    570 public:
    \n+
    571 static
    \n+\n+
    \n+
    573 build(unsigned topologyId, unsigned coerceToId)
    \n+
    574 {
    \n+
    575 topologyId &= ~1;
    \n+
    576 coerceToId &= ~1;
    \n+
    577
    \n+
    578 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n+
    579
    \n+
    580 if (topologyId == 0 && coerceToId == 0)
    \n+\n+
    582
    \n+
    583 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n+
    584 << coerceToId << " >.");
    \n+
    585 }
    \n+
    \n+
    586 };
    \n+
    \n+
    587
    \n+
    588 template<class CoordType>
    \n+
    \n+
    589 class RefinementBuilder<3, CoordType>
    \n+
    590 {
    \n+
    591 static const std::size_t dimension = 3;
    \n+
    592 public:
    \n+
    593 static
    \n+\n+
    \n+
    595 build(unsigned topologyId, unsigned coerceToId)
    \n+
    596 {
    \n+
    597 topologyId &= ~1;
    \n+
    598 coerceToId &= ~1;
    \n+
    599
    \n+
    600 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;
    \n+
    601 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;
    \n+
    602 constexpr unsigned idPrism = GeometryTypes::prism.id() & ~1;
    \n+
    603 constexpr unsigned idPyramid = GeometryTypes::pyramid.id() & ~1;
    \n+
    604
    \n+
    605 switch( topologyId )
    \n+
    606 {
    \n+
    607 //case GeometryType::simplex:
    \n+
    608 case idSimplex :
    \n+
    609 //switch( coerceTo )
    \n+
    610 switch( coerceToId )
    \n+
    611 {
    \n+
    612 //case GeometryType::simplex:
    \n+
    613 case idSimplex :
    \n+\n+
    615 default :
    \n+
    616 break;
    \n+
    617 }
    \n+
    618 break;
    \n+
    619
    \n+
    620 //case GeometryType::cube:
    \n+
    621 case idCube :
    \n+
    622 switch( coerceToId )
    \n+
    623 {
    \n+
    624 case idSimplex :
    \n+\n+
    626 case idCube :
    \n+\n+
    628 default :
    \n+
    629 break;
    \n+
    630 }
    \n+
    631 break;
    \n+
    632
    \n+
    633 //case GeometryType::prism:
    \n+
    634 case idPrism :
    \n+
    635 switch( coerceToId )
    \n+
    636 {
    \n+
    637 case idSimplex :
    \n+\n+
    639 default :
    \n+
    640 break;
    \n+
    641 }
    \n+
    642 break;
    \n+
    643
    \n+
    644 //case GeometryType::pyramid:
    \n+
    645 case idPyramid :
    \n+
    646 switch( coerceToId )
    \n+
    647 {
    \n+
    648 case idSimplex :
    \n+\n+
    650 default :
    \n+
    651 break;
    \n+
    652 }
    \n+
    653 break;
    \n+
    654
    \n+
    655 default :
    \n+
    656 break;
    \n+
    657 }
    \n+
    658 DUNE_THROW( NotImplemented, "No Refinement<" << topologyId << ", CoordType, "
    \n+
    659 << coerceToId << " >.");
    \n+
    660 }
    \n+
    \n+
    661 };
    \n+
    \n+
    662
    \n+
    663} // namespace Dune
    \n+
    664
    \n+
    665#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_CC
    \n+
    A unique label for each type of element that can occur in a grid.
    \n+
    This file simply includes all Refinement implementations so you don't have to do them separately.
    \n
    Definition affinegeometry.hh:21
    \n-
    FieldVector< int, n > getPermutation(int m)
    Calculate permutation from it's index.
    Definition simplex.cc:293
    \n-
    FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)
    Map from the reference simplex to some Kuhn simplex.
    Definition simplex.cc:322
    \n+
    VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType geometryType, GeometryType coerceTo)
    return a reference to the VirtualRefinement according to the parameters
    Definition virtualrefinement.cc:503
    \n
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    generic geometry implementation based on corner coordinates
    Definition multilineargeometry.hh:181
    \n-\n-\n-
    static VertexIterator vEnd(int nIntervals)
    Definition hcubetriangulation.cc:121
    \n-
    static VertexIterator vBegin(int nIntervals)
    Definition hcubetriangulation.cc:113
    \n-
    static int nElements(int nIntervals)
    Definition hcubetriangulation.cc:129
    \n-
    FieldVector< CoordType, dimension > CoordVector
    Definition hcubetriangulation.cc:76
    \n-
    CoordType ctype
    Definition hcubetriangulation.cc:71
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    Definition hcubetriangulation.cc:77
    \n-
    FieldVector< int, dimension+1 > IndexVector
    Definition hcubetriangulation.cc:78
    \n-
    static ElementIterator eBegin(int nIntervals)
    Definition hcubetriangulation.cc:137
    \n-
    static ElementIterator eEnd(int nIntervals)
    Definition hcubetriangulation.cc:145
    \n-
    static constexpr int dimension
    Definition hcubetriangulation.cc:69
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    Definition hcubetriangulation.cc:75
    \n-
    static int nVertices(int nIntervals)
    Definition hcubetriangulation.cc:105
    \n-\n-
    Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension > Geometry
    Definition hcubetriangulation.cc:99
    \n-\n-\n-\n-
    Refinement::template Codim< dimension >::Geometry Geometry
    Definition hcubetriangulation.cc:162
    \n-
    BackendRefinement::template Codim< dimension >::SubEntityIterator BackendIterator
    Definition hcubetriangulation.cc:175
    \n-
    Refinement::BackendRefinement BackendRefinement
    Definition hcubetriangulation.cc:174
    \n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcubetriangulation.cc:160
    \n-\n-
    BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator
    Definition hcubetriangulation.cc:260
    \n-\n-
    Refinement::CoordVector CoordVector
    Definition hcubetriangulation.cc:241
    \n-\n-\n-
    Refinement::BackendRefinement BackendRefinement
    Definition hcubetriangulation.cc:259
    \n-\n-
    Refinement::IndexVector IndexVector
    Definition hcubetriangulation.cc:240
    \n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcubetriangulation.cc:239
    \n-
    Refinement::template Codim< 0 >::Geometry Geometry
    Definition hcubetriangulation.cc:242
    \n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcubetriangulation.cc:359
    \n-
    SubEntityIterator This
    Definition hcubetriangulation.cc:360
    \n-\n+
    Holds the number of refined intervals per axis needed for virtual and static refinement.
    Definition base.cc:94
    \n+
    Wrap each Refinement implementation to get a consistent interface.
    Definition base.cc:141
    \n+
    static ElementIterator eEnd(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:247
    \n+
    static ElementIterator eBegin(Dune::RefinementIntervals tag)
    Get an ElementIterator.
    Definition base.cc:237
    \n+
    static int nElements(Dune::RefinementIntervals tag)
    Get the number of Elements.
    Definition base.cc:227
    \n+
    static int nVertices(Dune::RefinementIntervals tag)
    Get the number of Vertices.
    Definition base.cc:197
    \n+
    static VertexIterator vBegin(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:207
    \n+
    typedef IndexVector
    The IndexVector of the Refinement.
    Definition base.cc:177
    \n+
    static VertexIterator vEnd(Dune::RefinementIntervals tag)
    Get a VertexIterator.
    Definition base.cc:217
    \n+
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n+
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n+
    Definition virtualrefinement.cc:72
    \n+
    Refinement::template Codim< 0 >::SubEntityIterator Common
    Definition virtualrefinement.cc:85
    \n+
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:84
    \n+
    Refinement::IndexVector IndexVector
    Definition virtualrefinement.cc:86
    \n+
    VirtualRefinement< dimension, CoordType >::template Codim< codimension >::SubEntityIterator::CoordVector coords() const
    \n+\n+\n+\n+\n+\n+
    Refinement::template SubEntityIteratorBack< codimension > IteratorBack
    Definition virtualrefinement.cc:109
    \n+
    Refinement::CoordVector CoordVector
    Definition virtualrefinement.cc:110
    \n+
    Refinement::template Codim< codimension >::SubEntityIterator This
    Definition virtualrefinement.cc:108
    \n+
    bool equals(const This &other) const
    \n+
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:107
    \n+\n+
    Definition virtualrefinement.cc:200
    \n+
    virtual ~VirtualRefinementSubEntityIteratorBackSpecial()
    Definition virtualrefinement.cc:208
    \n+\n+
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:217
    \n+
    Refinement::IndexVector IndexVector
    Definition virtualrefinement.cc:218
    \n+
    virtual ~VirtualRefinementSubEntityIteratorBackSpecial()
    Definition virtualrefinement.cc:222
    \n+
    Definition virtualrefinement.cc:231
    \n+\n+
    Refinement::template SubEntityIteratorBack< codimension > This
    Definition virtualrefinement.cc:234
    \n+\n+
    Refinement::CoordVector CoordVector
    Definition virtualrefinement.cc:235
    \n+
    VirtualRefinement< dimension, CoordType > Refinement
    Definition virtualrefinement.cc:233
    \n+
    virtual bool operator==(const This &other) const =0
    \n+
    virtual CoordVector coords() const =0
    \n+
    virtual ~SubEntityIteratorBack()
    Definition virtualrefinement.cc:237
    \n+\n+
    Definition virtualrefinement.cc:261
    \n+
    int nVertices(Dune::RefinementIntervals tag) const override
    Get the number of Vertices.
    Definition virtualrefinement.cc:295
    \n+
    int nElements(Dune::RefinementIntervals tag) const override
    Get the number of Elements.
    Definition virtualrefinement.cc:320
    \n+
    Dune::VirtualRefinement< dimension, CoordType > VirtualRefinement
    Definition virtualrefinement.cc:264
    \n+
    static VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > & instance()
    Definition virtualrefinement.cc:286
    \n+
    Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension > StaticRefinement
    Definition virtualrefinement.cc:263
    \n+
    Definition virtualrefinement.cc:397
    \n+
    VirtualRefinement::template SubEntityIteratorBack< codimension > Base
    Definition virtualrefinement.cc:401
    \n+
    VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::template SubEntityIteratorBack< codimension > This
    Definition virtualrefinement.cc:400
    \n+
    StaticRefinement::template Codim< codimension >::SubEntityIterator BackendIterator
    Definition virtualrefinement.cc:399
    \n+
    VirtualRefinement::CoordVector CoordVector
    Definition virtualrefinement.cc:402
    \n+\n+
    VirtualRefinementImp::template SubEntityIteratorBack< 0 > Common
    Definition virtualrefinement.cc:368
    \n+\n+
    VirtualRefinement< dimension, CoordType > RefinementBase
    Definition virtualrefinement.cc:370
    \n+
    Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > VirtualRefinementImp
    Definition virtualrefinement.cc:367
    \n+
    VirtualRefinementImp::StaticRefinement StaticRefinement
    Definition virtualrefinement.cc:369
    \n+
    Definition virtualrefinement.cc:518
    \n+
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:522
    \n+
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:573
    \n+
    static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId, unsigned coerceToId)
    Definition virtualrefinement.cc:595
    \n+
    VirtualRefinement base class.
    Definition virtualrefinement.hh:283
    \n+
    SubEntityIteratorBack< dimension > VertexIteratorBack
    Definition virtualrefinement.hh:307
    \n+
    VertexIterator vBegin(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:38
    \n+
    ElementIterator eBegin(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:54
    \n+
    ElementIterator eEnd(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:62
    \n+
    Codim< 0 >::SubEntityIterator ElementIterator
    The ElementIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:290
    \n+
    VertexIterator vEnd(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:46
    \n+
    FieldVector< CoordType, dimension > CoordVector
    The CoordVector of the VirtualRefinement.
    Definition virtualrefinement.hh:297
    \n+
    Codim< dimension >::SubEntityIterator VertexIterator
    The VertexIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:288
    \n+
    SubEntityIteratorBack< 0 > ElementIteratorBack
    Definition virtualrefinement.hh:308
    \n+
    codim database of VirtualRefinement
    Definition virtualrefinement.hh:367
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,590 +1,1002 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-hcubetriangulation.cc\n+virtualrefinement.cc\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n-_\b6#define DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n-7\n-29#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-30#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-31\n-32#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n-33#include \"_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+5\n+6#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n+_\b7#define DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n+8\n+14#include \n+15#include \n+16\n+17#include \n+18#include \n+19#include \n+20\n+21#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+22#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n+23\n+24namespace _\bD_\bu_\bn_\be\n+25{\n+26 // //////////////////////////////////////////\n+27 //\n+28 // The virtual base class and its iterators\n+29 //\n+30\n+31 //\n+32 // Refinement\n+33 //\n 34\n-35namespace _\bD_\bu_\bn_\be\n-36{\n-37 namespace RefinementImp\n-38 {\n-_\b4_\b6 namespace HCubeTriangulation {\n-47\n-48 // ////////////\n-49 //\n-50 // Utilities\n-51 //\n-52\n-53 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn;\n-54 using _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn;\n-55\n-56 // ////////////////////////////////////\n-57 //\n-58 // Refine a hypercube with simplices\n-59 //\n-60\n-61 // forward declaration of the iterator base\n-62 template\n-_\b6_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-64\n-65 template\n-_\b6_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-67 {\n-68 public:\n-_\b6_\b9 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n+35 template\n+36 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b3_\b7 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+38_\b _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+39 {\n+40 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(vBeginBack(tag));\n+41 }\n+42\n+43 template\n+44 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b4_\b5 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+46_\b _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+47 {\n+48 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(vEndBack(tag));\n+49 }\n+50\n+51 template\n+52 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b5_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+54_\b _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+55 {\n+56 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(eBeginBack(tag));\n+57 }\n+58\n+59 template\n+60 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\b6_\b1 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n+62_\b _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+63 {\n+64 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(eEndBack(tag));\n+65 }\n+66\n+67 //\n+68 // The iterators\n+69 //\n 70\n-_\b7_\b1 typedef CoordType _\bc_\bt_\by_\bp_\be;\n-72\n-73 template\n-74 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b7_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b6 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b7_\b7 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b7_\b8 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-79\n-80 static int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals);\n-81 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-82 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(int nIntervals);\n-83\n-84 static int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals);\n-85 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(int nIntervals);\n-_\b8_\b6 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(int nIntervals);\n-87 private:\n-88 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, 0>;\n-89 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n+71 template\n+_\b7_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+73\n+74 // The iterator for vertices\n+75 template\n+_\b7_\b6 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+77 {};\n+78\n+79 // The iterator for elements\n+80 template\n+_\b8_\b1 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+82 {\n+83 public:\n+_\b8_\b4 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b8_\b5 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bC_\bo_\bm_\bm_\bo_\bn;\n+_\b8_\b6 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+87\n+88 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+89 };\n 90\n-91 typedef _\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-92 };\n-93\n-94 template\n-95 template\n-_\b9_\b6 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n-97 {\n-98 class SubEntityIterator;\n-_\b9_\b9 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-100 };\n-101\n-102 template\n-103 int\n-_\b1_\b0_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-105_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int nIntervals)\n-106 {\n-107 return BackendRefinement::nVertices(nIntervals) * factorial(int\n-(dimension));\n-108 }\n-109\n-110 template\n-111 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b1_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-113_\b _\bv_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-114 {\n-115 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-116 }\n+91 template\n+92 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b9_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n+94_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+95 {\n+96 return static_cast(this)->backend->vertexIndices();\n+97 }\n+98\n+99 // The iterator common stuff\n+100 template\n+101 template\n+_\b1_\b0_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bC_\bo_\bd_\bi_\bm::\n+SubEntityIterator\n+103 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n+104 public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+105 {\n+106 public:\n+_\b1_\b0_\b7 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b1_\b0_\b8 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+_\bT_\bh_\bi_\bs;\n+_\b1_\b0_\b9 typedef typename Refinement::template _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n+_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n+_\b1_\b1_\b0 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+111\n+_\b1_\b1_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *backend);\n+_\b1_\b1_\b3 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const _\bT_\bh_\bi_\bs &other);\n+_\b1_\b1_\b4 _\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br();\n+115\n+_\b1_\b1_\b6 _\bT_\bh_\bi_\bs &_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(const _\bT_\bh_\bi_\bs &other);\n 117\n-118 template\n-119 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b2_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-121_\b _\bv_\bE_\bn_\bd(int nIntervals)\n-122 {\n-123 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-124 }\n-125\n-126 template\n-127 int\n-_\b1_\b2_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-129_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(int nIntervals)\n-130 {\n-131 return BackendRefinement::nElements(nIntervals) * factorial(int\n-(dimension));\n-132 }\n-133\n-134 template\n-135 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b3_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-137_\b _\be_\bB_\be_\bg_\bi_\bn(int nIntervals)\n-138 {\n-139 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals);\n-140 }\n-141\n-142 template\n-143 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b4_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-145_\b _\be_\bE_\bn_\bd(int nIntervals)\n-146 {\n-147 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nIntervals, true);\n-148 }\n-149\n-150 // //////////////\n-151 //\n-152 // The iterator\n-153 //\n-154\n-155 // vertices\n-156 template\n-_\b1_\b5_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-158 {\n-159 public:\n-_\b1_\b6_\b0 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b6_\b1 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b1_\b6_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+_\b1_\b1_\b8 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n+_\b1_\b1_\b9 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt();\n+120\n+_\b1_\b2_\b1 int _\bi_\bn_\bd_\be_\bx() const;\n+122\n+123 // If you simply use an unqualified CoordVector here g++-4.2 chokes\n+124 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be\n+_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br::\n+_\b1_\b2_\b5 CoordVector _\bc_\bo_\bo_\br_\bd_\bs() const;\n+126 private:\n+127 friend class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+128 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *backend;\n+129 };\n+130\n+131#ifndef DOXYGEN\n+132 template\n+133 template\n+134 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+135_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(IteratorBack *backend_)\n+136 : backend(backend_)\n+137 {}\n+138\n+139 template\n+140 template\n+141 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n+142_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(const This &other)\n+143 : backend(other.backend->clone())\n+144 {}\n+145\n+146 template\n+147 template\n+148 VirtualRefinement::Codim::\n+SubEntityIterator::\n+149 ~SubEntityIterator()\n+150 {\n+151 delete backend;\n+152 }\n+153\n+154 template\n+155 template\n+156 typename VirtualRefinement::template\n+Codim::SubEntityIterator &\n+157 VirtualRefinement::Codim::\n+SubEntityIterator::\n+158 operator=(const This &other)\n+159 {\n+160 delete backend;\n+161 backend = other.backend->clone();\n+162 }\n 163\n-164 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end = false);\n-165\n-166 void increment();\n-167\n-168 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-169\n-170 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n-171\n-172 int index() const;\n-173 protected:\n-_\b1_\b7_\b4 typedef typename Refinement::BackendRefinement _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b7_\b5 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b7_\b6 constexpr static int nKuhnSimplices = factorial(int(dimension));\n-177\n-_\b1_\b7_\b8 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n+164 template\n+165 template\n+166 bool\n+167 VirtualRefinement::Codim::\n+SubEntityIterator::\n+168 equals(const This &other) const\n+169 { return *backend == *(other.backend); }\n+170\n+171 template\n+172 template\n+173 void\n+174 VirtualRefinement::Codim::\n+SubEntityIterator::\n+175 increment()\n+176 {\n+177 ++*backend;\n+178 }\n 179\n-_\b1_\b8_\b0 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b1_\b8_\b1 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b1_\b8_\b2 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-183 };\n-184\n-185 template\n-_\b1_\b8_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-187_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-188 : nIntervals_(nIntervals), kuhnIndex(0),\n-189 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vBegin(nIntervals_)),\n-190 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::vEnd(nIntervals_))\n-191 {\n-192 if (end)\n-193 kuhnIndex = nKuhnSimplices;\n-194 }\n-195\n-196 template\n-197 void\n-_\b1_\b9_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-199_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-200 {\n-201 ++backend;\n-202 if (backend == backendEnd)\n-203 {\n-204 backend = BackendRefinement::vBegin(nIntervals_);\n-205 ++kuhnIndex;\n-206 }\n-207 }\n-208\n-209 template\n-210 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b2_\b1_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-212_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-213 {\n-214 return referenceToKuhn(backend.coords(), getPermutation\n-(kuhnIndex));\n-215 }\n-216\n-217 template\n-218 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b2_\b1_\b9 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by ()\n-const\n-220 {\n-221 std::vector corners(1);\n-222 corners[0] = referenceToKuhn(backend.coords(), getPermutation\n-(kuhnIndex));\n-223 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(GeometryTypes::vertex, corners);\n-224 }\n+180 template\n+181 template\n+182 int\n+183 VirtualRefinement::Codim::\n+SubEntityIterator::\n+184 index() const\n+185 { return backend->index(); }\n+186\n+187 template\n+188 template\n+189 typename VirtualRefinement::template\n+Codim::SubEntityIterator::CoordVector\n+190 VirtualRefinement::Codim::\n+SubEntityIterator::\n+191 coords() const\n+192 { return backend->coords(); }\n+193#endif // DOXYGEN\n+194\n+195 //\n+196 // The iterator backend\n+197 //\n+198\n+199 template\n+_\b2_\b0_\b0 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+201\n+202 // The iterator backend for vertices\n+203 template\n+_\b2_\b0_\b4 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+205 {\n+206 public:\n+207\n+_\b2_\b0_\b8 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl()\n+209 {}\n+210 };\n+211\n+212 // The iterator backend for elements\n+213 template\n+_\b2_\b1_\b4 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+215 {\n+216 public:\n+_\b2_\b1_\b7 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b1_\b8 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+219\n+_\b2_\b2_\b0 virtual _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const = 0;\n+221\n+_\b2_\b2_\b2 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl()\n+223 {}\n+224 };\n 225\n-226 template\n-227 int\n-_\b2_\b2_\b8 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-229_\b _\bi_\bn_\bd_\be_\bx() const\n-230 {\n-231 return kuhnIndex*BackendRefinement::nVertices(nIntervals_) + backend.index\n-();\n-232 }\n-233\n-234 // elements\n-235 template\n-_\b2_\b3_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-237 {\n-238 public:\n-_\b2_\b3_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b4_\b0 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b1 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b4_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n+226 // The iterator backend common stuff\n+227 template\n+228 template\n+_\b2_\b2_\b9 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+230 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+231 {\n+232 public:\n+_\b2_\b3_\b3 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b3_\b4 typedef typename Refinement::template _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n+_\bT_\bh_\bi_\bs;\n+_\b2_\b3_\b5 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+236\n+_\b2_\b3_\b7 virtual _\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk() {}\n+238\n+_\b2_\b3_\b9 virtual _\bT_\bh_\bi_\bs *_\bc_\bl_\bo_\bn_\be() const = 0;\n+240\n+_\b2_\b4_\b1 virtual bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bT_\bh_\bi_\bs &other) const = 0;\n+_\b2_\b4_\b2 virtual _\bT_\bh_\bi_\bs &_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+() = 0;\n 243\n-244 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals_, bool end = false);\n-245 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(const _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> &other);\n-246\n-247 void increment();\n-248\n-249 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-250 int index() const;\n-251 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n+_\b2_\b4_\b4 virtual int _\bi_\bn_\bd_\be_\bx() const = 0;\n+_\b2_\b4_\b5 virtual _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bc_\bo_\bo_\br_\bd_\bs() const = 0;\n+246 };\n+247\n+248 // /////////////////////////////////////////////////\n+249 //\n+250 // The derived classes and their iterator backends\n+251 //\n 252\n-253 _\bG_\be_\bo_\bm_\be_\bt_\br_\by geometry() const;\n-254\n-255 private:\n-256 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br global(const _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br &local) const;\n-257\n-258 protected:\n-_\b2_\b5_\b9 typedef typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b6_\b0 typedef typename BackendRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b2_\b6_\b1 constexpr static int nKuhnSimplices = factorial(dimension);\n-262\n-_\b2_\b6_\b3 int _\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_;\n-264\n-_\b2_\b6_\b5 int _\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx;\n-_\b2_\b6_\b6 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd;\n-_\b2_\b6_\b7 const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd;\n-268 };\n-269\n-270 template\n-_\b2_\b7_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-272_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(int nIntervals, bool end)\n-273 : nIntervals_(nIntervals), kuhnIndex(0),\n-274 backend(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eBegin(nIntervals_)),\n-275 backendEnd(_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::eEnd(nIntervals_))\n-276 {\n-277 if (end)\n-278 kuhnIndex = nKuhnSimplices;\n-279 }\n-280 template\n-_\b2_\b8_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-282_\b _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(const _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b> &other)\n-283 : nIntervals_(other.nIntervals_), kuhnIndex(other.kuhnIndex),\n-284 backend(other.backend),\n-285 backendEnd(other.backendEnd)\n-286 {}\n-287\n-288 template\n-289 void\n-_\b2_\b9_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-291_\b _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt()\n-292 {\n-293 ++backend;\n-294 if (backend == backendEnd)\n-295 {\n-296 backend = BackendRefinement::eBegin(nIntervals_);\n-297 ++kuhnIndex;\n+253 //\n+254 // The refinement implementation\n+255 //\n+256\n+257 template\n+_\b2_\b5_\b9 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+260 : public _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+261 {\n+262 public:\n+_\b2_\b6_\b3 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b2_\b6_\b4 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+265\n+266 template\n+267 class _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n+268\n+269 int nVertices(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+270\n+271 int nElements(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+272\n+273 static _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>\n+&instance();\n+274 private:\n+275 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp() {}\n+276\n+277 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *vBeginBack(_\bD_\bu_\bn_\be_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+278 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *vEndBack(_\bD_\bu_\bn_\be_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+279 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *eBeginBack(_\bD_\bu_\bn_\be_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+280 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *eEndBack(_\bD_\bu_\bn_\be_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const override;\n+281 };\n+282\n+283 template\n+285 VirtualRefinementImp &\n+_\b2_\b8_\b6 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be()\n+287 {\n+288 static _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp instance_{};\n+289 return instance_;\n+290 }\n+291\n+292 template\n+_\b2_\b9_\b4 int _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+295_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+296 {\n+297 return _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(tag);\n 298 }\n-299 }\n-300\n-301 template\n-302 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b0_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-304_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+299\n+300 template\n+302 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n+303 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+304_\b _\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n 305 {\n-306 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br indices = backend.vertexIndices();\n-307\n-308 int base = kuhnIndex * BackendRefinement::nVertices(nIntervals_);\n-309 indices += base;\n-310\n-311 return indices;\n-312 }\n-313\n-314 template\n-315 int\n-_\b3_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-317_\b _\bi_\bn_\bd_\be_\bx() const\n-318 {\n-319 return kuhnIndex*BackendRefinement::nElements(nIntervals_) + backend.index\n-();\n-320 }\n-321\n-322 template\n-323 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b3_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-325_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-326 {\n-327 return global(backend.coords());\n-328 }\n-329\n-330 template\n-331 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-_\b3_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by () const\n-333 {\n-334 const typename BackendIterator::Geometry &bgeo =\n-335 backend.geometry();\n-336 std::vector corners(dimension+1);\n-337 for(int i = 0; i <= dimension; ++i)\n-338 corners[i] = global(bgeo.corner(i));\n-339\n-340 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by(bgeo.type(), corners);\n+306 return new SubEntityIteratorBack(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn(tag));\n+307 }\n+308\n+309 template\n+311 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n+312 VirtualRefinementImp::\n+313 vEndBack(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+314 {\n+315 return new SubEntityIteratorBack(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd(tag));\n+316 }\n+317\n+318 template\n+_\b3_\b2_\b0 int _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+321 {\n+322 return _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(tag);\n+323 }\n+324\n+325 template\n+327 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n+328 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+329_\b _\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+330 {\n+331 return new SubEntityIteratorBack<0>(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn(tag));\n+332 }\n+333\n+334 template\n+336 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *\n+337 VirtualRefinementImp::\n+338 eEndBack(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+339 {\n+340 return new SubEntityIteratorBack<0>(_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd(tag));\n 341 }\n 342\n-343 template\n-344 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-345 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-346_\b _\bg_\bl_\bo_\bb_\ba_\bl(const CoordVector &local) const\n-347 {\n-348 return referenceToKuhn(local, getPermutation(kuhnIndex));\n-349 }\n-350\n-351 // common\n-352 template\n-353 template\n-_\b3_\b5_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-355 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-356 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-357 {\n-358 public:\n-_\b3_\b5_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b3_\b6_\b0 typedef SubEntityIterator _\bT_\bh_\bi_\bs;\n-361\n-_\b3_\b6_\b2 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end = false);\n-363\n-_\b3_\b6_\b4 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n-365 protected:\n-366 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-kuhnIndex;\n-367 using _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType, codimension>::\n-backend;\n-368 };\n-369\n-370#ifndef DOXYGEN\n-371 template\n-372 template\n-373 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-374_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(int nIntervals, bool end)\n-375 : _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl(nIntervals,\n-end)\n-376 {}\n-377\n-378 template\n-379 template\n-380 bool\n-381 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:\n-382_\b _\be_\bq_\bu_\ba_\bl_\bs(const This &other) const\n-383 { return kuhnIndex == other.kuhnIndex && backend == other.backend; }\n+343 //\n+344 // The iterator backend implementation\n+345 //\n+346\n+347 // The iterator backend implementation specialties\n+348 template\n+_\b3_\b5_\b0 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+351\n+352 // The iterator backend implementation specialties for vertices\n+353 template\n+_\b3_\b5_\b5 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+356 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::template\n+SubEntityIteratorBack\n+357 {};\n+358\n+359 // The iterator backend implementation specialties for elements\n+360\n+361 template\n+_\b3_\b6_\b3 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+364 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::template\n+SubEntityIteratorBack<0>\n+365 {\n+366 public:\n+_\b3_\b6_\b7 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp;\n+_\b3_\b6_\b8 typedef typename VirtualRefinementImp::template SubEntityIteratorBack<0>\n+_\bC_\bo_\bm_\bm_\bo_\bn;\n+_\b3_\b6_\b9 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n+_\b3_\b7_\b0 typedef _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\ba_\bs_\be;\n+_\b3_\b7_\b1 typedef typename RefinementBase::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+372\n+373 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n+374 };\n+375\n+376 template\n+378 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,\n+_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\b3_\b7_\b9 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b>_\b:_\b:\n+380_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n+381 {\n+382 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vIndices;\n+383 vIndices.reserve(StaticRefinement::IndexVector::dimension);\n 384\n-385#endif // DOXYGEN\n-386\n-387 } // namespace HCubeTriangulation\n-388 } // namespace RefinementImp\n-389\n-390 namespace RefinementImp\n-391 {\n-392 // ///////////////////////\n-393 //\n-394 // The refinement traits\n-395 //\n-396\n-397#ifndef DOXYGEN\n-398 template\n-400 struct Traits<\n-401 topologyId, CoordType, coerceToId, dim,\n-402 typename _\bs_\bt_\bd::enable_if<\n-403 (dim >= 2 &&\n-404 (GeometryTypes::cube(dim).id() >> 1) ==\n-405 (topologyId >> 1) &&\n-406 (GeometryTypes::simplex(dim).id() >> 1) ==\n-407 (coerceToId >> 1)\n-408 )>::type\n-409 >\n-410 {\n-411 typedef HCubeTriangulation::RefinementImp Imp;\n-412 };\n-413#endif\n+385 typename _\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br sIndices = static_cast(this)->backend.vertexIndices();\n+386 for(int i = 0; i < StaticRefinement::IndexVector::dimension; ++i)\n+387 vIndices.push_back(sIndices[i]);\n+388 return vIndices;\n+389 }\n+390\n+391 // The shared iterator backend implementation\n+392 template\n+394 template\n+_\b3_\b9_\b5 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+396 : public _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+397 {\n+398 public:\n+_\b3_\b9_\b9 typedef typename StaticRefinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b4_\b0_\b0 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bT_\bh_\bi_\bs;\n+_\b4_\b0_\b1 typedef typename VirtualRefinement::template\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bB_\ba_\bs_\be;\n+_\b4_\b0_\b2 typedef typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+403\n+404 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br &backend);\n+405 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bT_\bh_\bi_\bs &other);\n+406\n+407 _\bB_\ba_\bs_\be *clone() const;\n+408\n+409 bool operator==(const _\bB_\ba_\bs_\be &other) const;\n+410 _\bB_\ba_\bs_\be &operator++();\n+411\n+412 int index() const;\n+_\b4_\b1_\b3 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n 414\n-415 } // namespace RefinementImp\n-416} // namespace Dune\n-417\n-418#endif // DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n-_\bb_\ba_\bs_\be_\b._\bc_\bc\n-This file contains the parts independent of a particular Refinement\n-implementation.\n-_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n-This file contains the Refinement implementation for simplices (triangles,\n-tetrahedrons....\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+415 private:\n+416 friend class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n+417 _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br backend;\n+418 };\n+419\n+420 template\n+422 template\n+_\b4_\b2_\b3 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+424_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br &backend_)\n+425 : backend(backend_)\n+426 {}\n+427\n+428 template\n+430 template\n+_\b4_\b3_\b1 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+432_\b _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk(const _\bT_\bh_\bi_\bs &other)\n+433 : _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl(other),\n+434 backend(other.backend)\n+435 {}\n+436\n+437 template\n+438 template\n+439 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bB_\ba_\bs_\be *\n+_\b4_\b4_\b0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+441_\b _\bc_\bl_\bo_\bn_\be() const\n+442 { return new _\bT_\bh_\bi_\bs(*this); }\n+443\n+444 template\n+445 template\n+446 bool\n+_\b4_\b4_\b7 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+448_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bB_\ba_\bs_\be &other) const\n+449 {\n+450 try {\n+451 return backend == dynamic_cast(other).backend;\n+452 }\n+453 catch(const std::bad_cast&)\n+454 {\n+455 return false;\n+456 }\n+457 }\n+458\n+459 template\n+460 template\n+461 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bB_\ba_\bs_\be &\n+_\b4_\b6_\b2 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+463_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+()\n+464 {\n+465 ++backend;\n+466 return *this;\n+467 }\n+468\n+469 template\n+470 template\n+471 int\n+_\b4_\b7_\b2 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+473_\b _\bi_\bn_\bd_\be_\bx() const\n+474 { return backend.index(); }\n+475\n+476 template\n+477 template\n+478 typename _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bt_\be_\bm_\bp_\bl_\ba_\bt_\be _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+_\b4_\b7_\b9 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+480_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n+481 { return backend.coords(); }\n+482\n+483 // ////////////////////////\n+484 //\n+485 // The refinement builder\n+486 //\n+487\n+488 template\n+489 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br;\n+490\n+501 template\n+502 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n+_\b5_\b0_\b3 _\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(\n+504 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be geometryType,\n+506 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n+507 {\n+508 // Check that the user used valid geometry types\n+509 assert(geometryType._\bd_\bi_\bm() == dimension && coerceTo._\bd_\bi_\bm() == dimension);\n+510 return _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd( geometryType._\bi_\bd(),\n+coerceTo._\bi_\bd() );\n+511 }\n+512\n+513 // In principle the trick with the class is no longer necessary,\n+514 // but I'm keeping it in here so it will be easier to specialize\n+515 // buildRefinement when someone implements pyramids and prisms\n+516 template\n+_\b5_\b1_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br\n+518 {\n+519 public:\n+520 static\n+521 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n+_\b5_\b2_\b2 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n+523 {\n+524 topologyId &= ~1;\n+525 coerceToId &= ~1;\n+526\n+527 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n+528 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;\n+529\n+530 switch( topologyId )\n+531 {\n+532 //case GeometryType::simplex:\n+533 case idSimplex :\n+534 //switch( coerceTo )\n+535 switch( coerceToId )\n+536 {\n+537 //case GeometryType::simplex:\n+538 case idSimplex :\n+539 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+540 default :\n+541 break;\n+542 }\n+543 break;\n+544\n+545 //case GeometryType::cube:\n+546 case idCube :\n+547 switch( coerceToId )\n+548 {\n+549 case idSimplex :\n+550 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+551 case idCube :\n+552 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+553 default :\n+554 break;\n+555 }\n+556 break;\n+557\n+558 default :\n+559 break;\n+560 }\n+561 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n+\"\n+562 << coerceToId << \" >.\");\n+563 }\n+564 };\n+565\n+566 template\n+_\b5_\b6_\b7 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br<1, CoordType>\n+568 {\n+569 static const std::size_t dimension = 1;\n+570 public:\n+571 static\n+572 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n+_\b5_\b7_\b3 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n+574 {\n+575 topologyId &= ~1;\n+576 coerceToId &= ~1;\n+577\n+578 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n+579\n+580 if (topologyId == 0 && coerceToId == 0)\n+581 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+582\n+583 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n+\"\n+584 << coerceToId << \" >.\");\n+585 }\n+586 };\n+587\n+588 template\n+_\b5_\b8_\b9 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br<3, CoordType>\n+590 {\n+591 static const std::size_t dimension = 3;\n+592 public:\n+593 static\n+594 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n+_\b5_\b9_\b5 _\bb_\bu_\bi_\bl_\bd(unsigned topologyId, unsigned coerceToId)\n+596 {\n+597 topologyId &= ~1;\n+598 coerceToId &= ~1;\n+599\n+600 constexpr unsigned idSimplex = GeometryTypes::simplex(dimension).id() & ~1;\n+601 constexpr unsigned idCube = GeometryTypes::cube(dimension).id() & ~1;\n+602 constexpr unsigned idPrism = GeometryTypes::prism.id() & ~1;\n+603 constexpr unsigned idPyramid = GeometryTypes::pyramid.id() & ~1;\n+604\n+605 switch( topologyId )\n+606 {\n+607 //case GeometryType::simplex:\n+608 case idSimplex :\n+609 //switch( coerceTo )\n+610 switch( coerceToId )\n+611 {\n+612 //case GeometryType::simplex:\n+613 case idSimplex :\n+614 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+615 default :\n+616 break;\n+617 }\n+618 break;\n+619\n+620 //case GeometryType::cube:\n+621 case idCube :\n+622 switch( coerceToId )\n+623 {\n+624 case idSimplex :\n+625 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+626 case idCube :\n+627 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bC_\bu_\bb_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+628 default :\n+629 break;\n+630 }\n+631 break;\n+632\n+633 //case GeometryType::prism:\n+634 case idPrism :\n+635 switch( coerceToId )\n+636 {\n+637 case idSimplex :\n+638 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bP_\br_\bi_\bs_\bm_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+639 default :\n+640 break;\n+641 }\n+642 break;\n+643\n+644 //case GeometryType::pyramid:\n+645 case idPyramid :\n+646 switch( coerceToId )\n+647 {\n+648 case idSimplex :\n+649 return _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bi_\bd_\bP_\by_\br_\ba_\bm_\bi_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bi_\bd_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n+_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be();\n+650 default :\n+651 break;\n+652 }\n+653 break;\n+654\n+655 default :\n+656 break;\n+657 }\n+658 DUNE_THROW( NotImplemented, \"No Refinement<\" << topologyId << \", CoordType,\n+\"\n+659 << coerceToId << \" >.\");\n+660 }\n+661 };\n+662\n+663} // namespace Dune\n+664\n+665#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n-_\bs_\bt_\bd\n-STL namespace.\n+_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n+This file simply includes all Refinement implementations so you don't have to\n+do them separately.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bg_\be_\bt_\bP_\be_\br_\bm_\bu_\bt_\ba_\bt_\bi_\bo_\bn\n-FieldVector< int, n > getPermutation(int m)\n-Calculate permutation from it's index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bT_\bo_\bK_\bu_\bh_\bn\n-FieldVector< CoordType, dimension > referenceToKuhn(FieldVector< CoordType,\n-dimension > point, const FieldVector< int, dimension > &kuhn)\n-Map from the reference simplex to some Kuhn simplex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType\n+geometryType, GeometryType coerceTo)\n+return a reference to the VirtualRefinement according to the parameters\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:503\n _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n Static tag representing a codimension.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-generic geometry implementation based on corner coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:63\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:67\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:121\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:113\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static int nElements(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:129\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:76\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bc_\bt_\by_\bp_\be\n-CoordType ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< int, dimension+1 > IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:137\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:145\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:69\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:75\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static int nVertices(int nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:105\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:97\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Dune::MultiLinearGeometry< CoordType, dimension-codimension, dimension >\n-Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:99\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:180\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:161\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< dimension >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:162\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< dimension >::SubEntityIterator\n-BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:174\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:160\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:182\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-BackendRefinement::template Codim< 0 >::SubEntityIterator BackendIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:260\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd\n-BackendIterator backend\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:266\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:241\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bb_\ba_\bc_\bk_\be_\bn_\bd_\bE_\bn_\bd\n-const BackendIterator backendEnd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:267\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bk_\bu_\bh_\bn_\bI_\bn_\bd_\be_\bx\n-int kuhnIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:265\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Refinement::BackendRefinement BackendRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:259\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bn_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs_\b_\n-int nIntervals_\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:263\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+Holds the number of refined intervals per axis needed for virtual and static\n+refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Wrap each Refinement implementation to get a consistent interface.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:141\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n+static ElementIterator eEnd(Dune::RefinementIntervals tag)\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:247\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+static ElementIterator eBegin(Dune::RefinementIntervals tag)\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:237\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+static int nElements(Dune::RefinementIntervals tag)\n+Get the number of Elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:227\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int nVertices(Dune::RefinementIntervals tag)\n+Get the number of Vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:197\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+static VertexIterator vBegin(Dune::RefinementIntervals tag)\n+Get a VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:207\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+typedef IndexVector\n+The IndexVector of the Refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:177\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n+static VertexIterator vEnd(Dune::RefinementIntervals tag)\n+Get a VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+Unique label for each type of entities that can occur in DUNE grids.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n+constexpr unsigned int dim() const\n+Return dimension of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n+constexpr unsigned int id() const\n+Return the topology id of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n+_\bC_\bo_\bm_\bm_\bo_\bn\n+Refinement::template Codim< 0 >::SubEntityIterator Common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:84\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:\n+_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:240\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:239\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Refinement::template Codim< 0 >::Geometry Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:242\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\be_\bq_\bu_\ba_\bl_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:86\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bs\n+VirtualRefinement< dimension, CoordType >::template Codim< codimension >::\n+SubEntityIterator::CoordVector coords() const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(const This &other)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+This & operator=(const This &other)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+int index() const\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+~SubEntityIterator()\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+SubEntityIterator(IteratorBack *backend)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+Refinement::template SubEntityIteratorBack< codimension > IteratorBack\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:109\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:110\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n+Refinement::template Codim< codimension >::SubEntityIterator This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:108\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n bool equals(const This &other) const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(int nIntervals, bool end=false)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:359\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\bT_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bT_\bh_\bi_\bs\n-SubEntityIterator This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcubetriangulation.cc:360\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bi_\bm_\bp_\bl_\be_\bx_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn simplex.cc:361\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:107\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n+void increment()\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:200\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+virtual ~VirtualRefinementSubEntityIteratorBackSpecial()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:208\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n+_\b>_\b:_\b:_\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual IndexVector vertexIndices() const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n+_\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n+_\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:218\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0\n+_\b>_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+virtual ~VirtualRefinementSubEntityIteratorBackSpecial()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:222\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:231\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+virtual int index() const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bT_\bh_\bi_\bs\n+Refinement::template SubEntityIteratorBack< codimension > This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:234\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bc_\bl_\bo_\bn_\be\n+virtual This * clone() const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+Refinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:235\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > Refinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:233\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n+virtual bool operator==(const This &other) const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bs\n+virtual CoordVector coords() const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\b~_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+virtual ~SubEntityIteratorBack()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:237\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+\n+virtual This & operator++()=0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:261\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int nVertices(Dune::RefinementIntervals tag) const override\n+Get the number of Vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:295\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int nElements(Dune::RefinementIntervals tag) const override\n+Get the number of Elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:320\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Dune::VirtualRefinement< dimension, CoordType > VirtualRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:264\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bi_\bn_\bs_\bt_\ba_\bn_\bc_\be\n+static VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension > &\n+instance()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:286\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+Dune::StaticRefinement< topologyId, CoordType, coerceToId, dimension >\n+StaticRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:397\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bB_\ba_\bs_\be\n+VirtualRefinement::template SubEntityIteratorBack< codimension > Base\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:401\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bT_\bh_\bi_\bs\n+VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >::template\n+SubEntityIteratorBack< codimension > This\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:400\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bB_\ba_\bc_\bk_\be_\bn_\bd_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+StaticRefinement::template Codim< codimension >::SubEntityIterator\n+BackendIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:399\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+VirtualRefinement::CoordVector CoordVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:402\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:350\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n+VirtualRefinementImp::template SubEntityIteratorBack< 0 > Common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:368\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+RefinementBase::IndexVector IndexVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:371\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\ba_\bs_\be\n+VirtualRefinement< dimension, CoordType > RefinementBase\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:370\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+Dune::VirtualRefinementImp< topologyId, CoordType, coerceToId, dimension >\n+VirtualRefinementImp\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:367\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,\n+_\bc_\bo_\be_\br_\bc_\be_\bT_\bo_\bI_\bd_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\b0_\b _\b>_\b:_\b:_\bS_\bt_\ba_\bt_\bi_\bc_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinementImp::StaticRefinement StaticRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:369\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:518\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n+static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n+unsigned coerceToId)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:522\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b1_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n+static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n+unsigned coerceToId)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:573\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bB_\bu_\bi_\bl_\bd_\be_\br_\b<_\b _\b3_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bb_\bu_\bi_\bl_\bd\n+static VirtualRefinement< dimension, CoordType > & build(unsigned topologyId,\n+unsigned coerceToId)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:595\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement base class.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:283\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+SubEntityIteratorBack< dimension > VertexIteratorBack\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:307\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+VertexIterator vBegin(Dune::RefinementIntervals tag) const\n+Get an VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:38\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+ElementIterator eBegin(Dune::RefinementIntervals tag) const\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n+ElementIterator eEnd(Dune::RefinementIntervals tag) const\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+The ElementIterator of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:290\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n+VertexIterator vEnd(Dune::RefinementIntervals tag) const\n+Get an VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:46\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+The CoordVector of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:297\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+The VertexIterator of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:288\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+SubEntityIteratorBack< 0 > ElementIteratorBack\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:308\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+codim database of VirtualRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:367\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00230.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00230.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: hcube.cc File Reference\n+dune-geometry: typeindex.hh File Reference\n \n \n \n \n \n \n \n@@ -65,88 +65,50 @@\n
    \n
    \n \n \n \n \n \n
    \n \n-
    hcube.cc File Reference
    \n+Namespaces
    \n+
    typeindex.hh File Reference
    \n \n
    \n \n-

    This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.). \n+

    Helper classes to provide indices for geometrytypes for use in a vector. \n More...

    \n-
    #include <cassert>
    \n-#include <dune/common/fvector.hh>
    \n-#include <dune/common/iteratorfacades.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/axisalignedcubegeometry.hh>
    \n-#include "base.cc"
    \n+
    #include <cstddef>
    \n+#include <dune/common/indices.hh>
    \n+#include <dune/common/hybridutilities.hh>
    \n+#include "type.hh"
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >
     Refinement implementation for hypercubes More...
    class  Dune::LocalGeometryTypeIndex
     Compute per-dimension indices for geometry types. More...
     
    struct  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >::Codim< codimension >
     
    class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, codimension >
     SubEntityIterator base class for hypercube refinement. More...
     
    class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >
     
    class  Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >
     
    class  Dune::RefinementImp::HCube::RefinementImp< dimension_, CoordType >::Codim< codimension >
    class  Dune::GlobalGeometryTypeIndex
     Compute indices for geometry types, taking the dimension into account. More...
     
    \n \n \n \n-\n-\n-\n-\n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::RefinementImp
     This namespace contains the implementation of Refinement.
     
    namespace  Dune::RefinementImp::HCube
     This namespace contains the Refinement implementation for hypercubes (GeometryType::cube).
     
    \n-\n-\n-\n

    \n-Macros

    #define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
     
    \n

    Detailed Description

    \n-

    This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.).

    \n-

    See Refinement implementation for hypercubes.

    \n-

    Macro Definition Documentation

    \n-\n-

    ◆ DUNE_GEOMETRY_REFINEMENT_HCUBE_CC

    \n-\n-
    \n-
    \n- \n- \n- \n- \n-
    #define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
    \n-
    \n-\n-
    \n-
    \n-
    \n+

    Helper classes to provide indices for geometrytypes for use in a vector.

    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,60 +1,30 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n-hcube.cc File Reference\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes\n-(quadrilaterals, hexahedrons, etc.). _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+typeindex.hh File Reference\n+Helper classes to provide indices for geometrytypes for use in a vector.\n+_\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+\u00a0 Compute per-dimension indices for geometry types. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n- _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0 SubEntityIterator base class for hypercube refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<\n- _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b__\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:\n- _\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+\u00a0 Compute indices for geometry types, taking the dimension into account.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-\u00a0 This namespace contains the implementation of _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt.\n-\u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be\n-\u00a0 This namespace contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for\n- hypercubes (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be).\n-\u00a0\n-M\bMa\bac\bcr\bro\bos\bs\n-#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bO_\bM_\bE_\bT_\bR_\bY_\b__\bR_\bE_\bF_\bI_\bN_\bE_\bM_\bE_\bN_\bT_\b__\bH_\bC_\bU_\bB_\bE_\b__\bC_\bC\n-\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementation for hypercubes\n-(quadrilaterals, hexahedrons, etc.).\n-See _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bf_\bo_\br_\b _\bh_\by_\bp_\be_\br_\bc_\bu_\bb_\be_\bs.\n-*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bEO\bOM\bME\bET\bTR\bRY\bY_\b_R\bRE\bEF\bFI\bIN\bNE\bEM\bME\bEN\bNT\bT_\b_H\bHC\bCU\bUB\bBE\bE_\b_C\bCC\bC *\b**\b**\b**\b**\b*\n-#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n+Helper classes to provide indices for geometrytypes for use in a vector.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00230_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00230_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: hcube.cc Source File\n+dune-geometry: typeindex.hh Source File\n \n \n \n \n \n \n \n@@ -70,478 +70,165 @@\n \n \n \n \n \n \n \n
    \n-
    hcube.cc
    \n+
    typeindex.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
    \n-
    6#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
    \n+
    5#ifndef DUNE_GEOMETRY_TYPEINDEX_HH
    \n+
    6#define DUNE_GEOMETRY_TYPEINDEX_HH
    \n
    7
    \n-
    41#include <cassert>
    \n-
    42
    \n-
    43#include <dune/common/fvector.hh>
    \n-
    44#include <dune/common/iteratorfacades.hh>
    \n-
    45
    \n-\n-\n-
    48
    \n-
    49#include "base.cc" // for RefinementTraits
    \n-
    50
    \n-
    51namespace Dune
    \n-
    52{
    \n-
    53 namespace RefinementImp
    \n-
    54 {
    \n+
    14#include <cstddef>
    \n+
    15
    \n+
    16#include <dune/common/indices.hh>
    \n+
    17#include <dune/common/hybridutilities.hh>
    \n+
    18
    \n+
    19#include "type.hh"
    \n+
    20
    \n+
    21namespace Dune
    \n+
    22{
    \n+
    \n+\n+
    25 {
    \n+
    32 inline static constexpr std::size_t regular_size(std::size_t dim)
    \n+
    33 {
    \n+
    34 // The following expression is derived from the expression for
    \n+
    35 // GlobalGeometryTypeIndex::regular_offset(). Subtracting
    \n+
    36 // regular_offset(dim+1)-regular_offset(dim) we get:
    \n+
    37 //
    \n+
    38 // ((1 << dim+1) >> 1) - ((1 << dim) >> 1)
    \n+
    39 //
    \n+
    40 // We always have
    \n+
    41 //
    \n+
    42 // dim >= 0,
    \n+
    43 //
    \n+
    44 // so
    \n+
    45 //
    \n+
    46 // (1 << dim+1) >= 2 and (1 << dim+2) % 2 == 0.
    \n+
    47 //
    \n+
    48 // So if we apply a single right-shift to that, we will never lose any
    \n+
    49 // set bits, thus
    \n+
    50 //
    \n+
    51 // ((1 << dim+1) >> 1) == (1 << dim)
    \n+
    52 return (1 << dim) - ((1 << dim) >> 1);
    \n+
    53 }
    \n+
    54
    \n+
    55 public:
    \n
    \n-
    61 namespace HCube
    \n+
    61 inline static constexpr std::size_t size(std::size_t dim)
    \n
    62 {
    \n-
    72 template<int dimension_, class CoordType>
    \n-
    \n-\n-
    74 {
    \n-
    75 public:
    \n-
    77 constexpr static int dimension = dimension_;
    \n-
    78 //- Know yourself
    \n-\n-
    80
    \n-
    81 template<int codimension>
    \n-
    82 struct Codim;
    \n-\n-
    84 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-\n-
    86 typedef FieldVector<int, (1<<dimension)> IndexVector;
    \n+
    63 // one for "none"
    \n+
    64 return regular_size(dim) + 1;
    \n+
    65 }
    \n+
    \n+
    66
    \n+
    \n+
    73 inline static constexpr std::size_t index(const GeometryType &gt)
    \n+
    74 {
    \n+
    75 return gt.isNone() ? regular_size(gt.dim()) : (gt.id() >> 1);
    \n+
    76 }
    \n+
    \n+
    77
    \n+
    \n+
    79 inline static constexpr GeometryType type(std::size_t dim, std::size_t index) {
    \n+
    80 return (index == regular_size(dim)) ?
    \n+
    81 GeometryTypes::none(dim) :
    \n+
    82 // the cast to unsigned makes sure this is interpreted as the topology
    \n+
    83 // ID constructor
    \n+
    84 GeometryType(static_cast< unsigned int >(index << 1), dim);
    \n+
    85 }
    \n+
    \n+
    86 };
    \n+
    \n
    87
    \n-
    88 static unsigned nVertices(unsigned nIntervals);
    \n-
    89 static VertexIterator vBegin(unsigned nIntervals);
    \n-
    90 static VertexIterator vEnd(unsigned nIntervals);
    \n-
    91
    \n-
    92 static unsigned nElements(unsigned nIntervals);
    \n-
    93 static ElementIterator eBegin(unsigned nIntervals);
    \n-
    94 static ElementIterator eEnd(unsigned nIntervals);
    \n-
    95 };
    \n-
    \n-
    96
    \n-
    97 template<int dimension, class CoordType>
    \n-
    98 template<int codimension>
    \n-
    \n-
    99 struct RefinementImp<dimension, CoordType>::Codim
    \n-
    100 {
    \n-
    101 class SubEntityIterator;
    \n-\n-
    103 };
    \n-
    \n-
    104
    \n-
    105 template<int dimension, class CoordType>
    \n-
    106 unsigned
    \n-
    \n-\n-
    108 nVertices(unsigned nIntervals)
    \n-
    109 {
    \n-
    110 // return (nIntervals + 1)^dim
    \n-
    111 return Dune::power(nIntervals+1u, static_cast<unsigned>(dimension));
    \n-
    112 }
    \n-
    \n-
    113
    \n-
    114 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    117 vBegin(unsigned nIntervals)
    \n-
    118 {
    \n-
    119 return VertexIterator(0,nIntervals);
    \n-
    120 }
    \n-
    \n-
    121
    \n-
    122 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    125 vEnd(unsigned nIntervals)
    \n-
    126 {
    \n-
    127 return VertexIterator(nVertices(nIntervals),nIntervals);
    \n-
    128 }
    \n+
    \n+\n+
    90 {
    \n+
    98 inline static constexpr std::size_t regular_offset(std::size_t dim)
    \n+
    99 {
    \n+
    100 // The number of regular geometry types in a given dimension is
    \n+
    101 // 2^(dim-1). For dim==0 this would yield 1/2 geometry types (which is
    \n+
    102 // obviously bogus, dim==0 has one regular geometry type, the point).
    \n+
    103 // The following expression relies on 1 >> 1 == 0 to treat dim==0
    \n+
    104 // specially.
    \n+
    105 return (1 << dim) >> 1;
    \n+
    106 }
    \n+
    107
    \n+
    108 public:
    \n+
    \n+
    113 inline static constexpr std::size_t offset(std::size_t dim)
    \n+
    114 {
    \n+
    115 // dim times "none"
    \n+
    116 return regular_offset(dim) + dim;
    \n+
    117 }
    \n+
    \n+
    118
    \n+
    \n+
    125 inline static constexpr std::size_t size(std::size_t maxdim)
    \n+
    126 {
    \n+
    127 return offset(maxdim+1);
    \n+
    128 }
    \n
    \n
    129
    \n-
    130 template<int dimension, class CoordType>
    \n-
    131 unsigned
    \n-
    \n-\n-
    133 nElements(unsigned nIntervals)
    \n-
    134 {
    \n-
    135 static_assert(dimension >= 0,
    \n-
    136 "Negative dimension given, what the heck is that supposed to mean?");
    \n-
    137 // return nIntervals^dim
    \n-
    138 return Dune::power(nIntervals, static_cast<unsigned>(dimension));
    \n-
    139 }
    \n-
    \n-
    140
    \n-
    141 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    144 eBegin(unsigned nIntervals)
    \n-
    145 {
    \n-
    146 return ElementIterator(0,nIntervals);
    \n-
    147 }
    \n-
    \n-
    148
    \n-
    149 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    152 eEnd(unsigned nIntervals)
    \n-
    153 {
    \n-
    154 return ElementIterator(nElements(nIntervals),nIntervals);
    \n-
    155 }
    \n-
    \n-
    156
    \n-
    157 //
    \n-
    158 // The iterators
    \n-
    159 //
    \n+
    \n+
    138 inline static constexpr std::size_t index(const GeometryType &gt)
    \n+
    139 {
    \n+
    140 return offset(gt.dim()) + LocalGeometryTypeIndex::index(gt);
    \n+
    141 }
    \n+
    \n+
    142 };
    \n+
    \n+
    143
    \n+
    144 namespace Impl {
    \n+
    145
    \n+
    146 // Map a dynamic GeometryType to a static integral_constant<GeometryType::Id, ...>
    \n+
    147 template<int dim, class F>
    \n+
    148 static auto toGeometryTypeIdConstant(const GeometryType& gt, F&& f) {
    \n+
    149 // Transform LocalGeometryTypeIndex to GeometryType::Id
    \n+
    150 auto callWithId = [&](auto index) {
    \n+
    151 static constexpr auto id = LocalGeometryTypeIndex::type(dim, decltype(index)::value).toId();
    \n+
    152 return f(std::integral_constant<GeometryType::Id, id>{});
    \n+
    153 };
    \n+
    154 // switchCases needs a fallback to determine the return type.
    \n+
    155 auto fallBack = [&]() { return callWithId(Dune::Indices::_0); };
    \n+
    156 // Iterate over all _regular_ GeometryType indices for given dimension
    \n+
    157 auto allIndices = std::make_index_sequence<LocalGeometryTypeIndex::size(dim)-1>{};
    \n+
    158 return Dune::Hybrid::switchCases(allIndices, LocalGeometryTypeIndex::index(gt), callWithId, fallBack);
    \n+
    159 }
    \n
    160
    \n-
    161#ifdef DOXYGEN
    \n-
    173 template<int dimension, class CoordType, int codimension>
    \n-\n-
    175#else
    \n-
    176 template<int dimension, class CoordType, int codimension>
    \n-\n-
    178#endif //DOXYGEN
    \n-
    179
    \n-
    180 // for vertices
    \n-
    181
    \n-
    182 template<int dimension, class CoordType>
    \n-
    \n-
    183 class RefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>
    \n-
    184 {
    \n-
    185 public:
    \n-\n-
    187 typedef typename Refinement::template Codim<dimension>::SubEntityIterator Common;
    \n-
    188 typedef typename Refinement::CoordVector CoordVector;
    \n-
    189
    \n-
    190 CoordVector coords() const;
    \n-
    191
    \n-
    192 private:
    \n-
    193 const Common & asCommon() const
    \n-
    194 {
    \n-
    195 return *static_cast<const Common*>(this);
    \n-
    196 }
    \n-
    197 };
    \n-
    \n-
    198
    \n-
    199 template<int dimension, class CoordType>
    \n-
    200 typename RefinementSubEntityIteratorSpecial<dimension, CoordType, dimension>::CoordVector
    \n-
    \n-\n-
    202 coords() const
    \n-
    203 {
    \n-
    204 std::array<unsigned int, dimension> v(asCommon().vertexCoord());
    \n-
    205 CoordVector c;
    \n-
    206 for (int d = 0; d < dimension; d++)
    \n-
    207 {
    \n-
    208 c[d] = v[d]*1.0 / asCommon()._nIntervals;
    \n-
    209 }
    \n-
    210 return c;
    \n-
    211 }
    \n-
    \n-
    212
    \n-
    213 // for elements
    \n-
    214
    \n-
    215 template<int dimension, class CoordType>
    \n-
    \n-
    216 class RefinementSubEntityIteratorSpecial<dimension, CoordType, 0>
    \n-
    217 {
    \n-
    218 public:
    \n-\n-
    220 typedef typename Refinement::template Codim<0>::SubEntityIterator Common;
    \n-
    221 typedef typename Refinement::IndexVector IndexVector;
    \n-
    222 typedef typename Refinement::CoordVector CoordVector;
    \n-
    223
    \n-
    224 IndexVector vertexIndices() const;
    \n-
    225 CoordVector coords() const;
    \n-
    226
    \n-
    227 private:
    \n-
    228 const Common & asCommon() const
    \n-
    229 {
    \n-
    230 return *static_cast<const Common*>(this);
    \n-
    231 }
    \n-
    232 };
    \n-
    \n-
    233
    \n-
    234 template<int dimension, class CoordType>
    \n-
    235 typename RefinementSubEntityIteratorSpecial<dimension, CoordType, 0>::IndexVector
    \n-
    \n-\n-
    237 vertexIndices() const
    \n-
    238 {
    \n-
    239 constexpr static int nIndices = 1 << dimension;
    \n-
    240
    \n-
    241 // cell index tuple
    \n-
    242 std::array<unsigned int, dimension> e(asCommon().cellCoord());
    \n-
    243
    \n-
    244 // vertices
    \n-
    245 IndexVector vec;
    \n-
    246 for(int i = 0; i < nIndices; ++i)
    \n-
    247 {
    \n-
    248 int base = 1;
    \n-
    249 std::array<unsigned int, dimension> alpha(asCommon().idx2multiidx(i));
    \n-
    250 for (int d = 0; d < dimension; d++) {
    \n-
    251 vec[i] += (alpha[d] + e[d]) * base;
    \n-
    252 base *= asCommon()._nIntervals+1;
    \n-
    253 }
    \n-
    254 }
    \n-
    255 return vec;
    \n-
    256 }
    \n-
    \n-
    257
    \n-
    258 template<int dimension, class CoordType>
    \n-\n-
    \n-\n-
    261 coords() const
    \n-
    262 {
    \n-
    263 std::array<unsigned int, dimension> v(asCommon().cellCoord());
    \n-
    264 CoordVector c;
    \n-
    265 for (int d=0; d<dimension; d++)
    \n-
    266 {
    \n-
    267 c[d] = (v[d]*1.0 + 0.5) / asCommon()._nIntervals;
    \n-
    268 }
    \n-
    269 return c;
    \n-
    270 }
    \n-
    \n-
    271
    \n-
    272 // common
    \n-
    273 template<int dimension, class CoordType>
    \n-
    274 template<int codimension>
    \n-
    \n-
    275 class RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator
    \n-
    276 : public ForwardIteratorFacade<typename RefinementImp<dimension,
    \n-
    277 CoordType>::template Codim<codimension>::SubEntityIterator, int>,
    \n-
    278 public RefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>
    \n-
    279 {
    \n-
    280 public:
    \n-\n-
    282 typedef typename Refinement::template Codim<codimension>::SubEntityIterator This;
    \n-
    283
    \n-
    284 SubEntityIterator(unsigned int index, unsigned int nIntervals);
    \n-
    285
    \n-
    286 bool equals(const This &other) const;
    \n-
    287 void increment();
    \n-
    288
    \n-
    289 int index() const;
    \n-
    290 Geometry geometry () const;
    \n-
    291 private:
    \n-
    292 friend class RefinementSubEntityIteratorSpecial<dimension, CoordType, codimension>;
    \n-
    293 unsigned int _index;
    \n-
    294 unsigned int _nIntervals;
    \n-
    295
    \n-
    296 std::array<unsigned int, dimension>
    \n-
    297 cellCoord(unsigned int idx) const
    \n-
    298 {
    \n-
    299 return idx2coord(idx, _nIntervals);
    \n-
    300 }
    \n-
    301
    \n-
    302 std::array<unsigned int, dimension>
    \n-
    303 vertexCoord(unsigned int idx) const
    \n-
    304 {
    \n-
    305 return idx2coord(idx, _nIntervals+1u);
    \n-
    306 }
    \n-
    307
    \n-
    308 std::array<unsigned int, dimension>
    \n-
    309 cellCoord() const
    \n-
    310 {
    \n-
    311 return cellCoord(_index);
    \n-
    312 }
    \n-
    313
    \n-
    314 std::array<unsigned int, dimension>
    \n-
    315 vertexCoord() const
    \n-
    316 {
    \n-
    317 return vertexCoord(_index);
    \n-
    318 }
    \n-
    319
    \n-
    320 std::array<unsigned int, dimension>
    \n-
    321 idx2coord(unsigned int idx, unsigned int w) const
    \n-
    322 {
    \n-
    323 std::array<unsigned int, dimension> c;
    \n-
    324 for (unsigned int d = 0; d < dimension; d++)
    \n-
    325 {
    \n-
    326 c[d] = idx%w;
    \n-
    327 idx = idx/w;
    \n-
    328 }
    \n-
    329 return c;
    \n-
    330 }
    \n-
    331
    \n-
    332 unsigned int
    \n-
    333 coord2idx(std::array<unsigned int, dimension> c, unsigned int w) const
    \n-
    334 {
    \n-
    335 unsigned int i = 0;
    \n-
    336 for (unsigned int d = dimension; d > 0; d--)
    \n-
    337 {
    \n-
    338 i *= w;
    \n-
    339 i += c[d-1];
    \n-
    340 }
    \n-
    341 return i;
    \n-
    342 }
    \n-
    343
    \n-
    344 std::array<unsigned int, dimension>
    \n-
    345 idx2multiidx(unsigned int idx) const
    \n-
    346 {
    \n-
    347 std::array<unsigned int, dimension> alpha;
    \n-
    348 for (unsigned int i = 0; i < dimension; ++i)
    \n-
    349 alpha[i] = (idx >> i) & 1u;
    \n-
    350 return alpha;
    \n-
    351 }
    \n-
    352 };
    \n-
    \n-
    353
    \n-
    354#ifndef DOXYGEN
    \n-
    355 template<int dimension, class CoordType>
    \n-
    356 template<int codimension>
    \n-
    357 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    358 SubEntityIterator(unsigned int index, unsigned int nIntervals)
    \n-
    359 : _index(index), _nIntervals(nIntervals)
    \n-
    360 {}
    \n-
    361
    \n-
    362 template<int dimension, class CoordType>
    \n-
    363 template<int codimension>
    \n-
    364 bool
    \n-
    365 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    366 equals(const This &other) const
    \n-
    367 {
    \n-
    368 return ((_index == other._index) && (_nIntervals == other._nIntervals));
    \n-
    369 }
    \n-
    370
    \n-
    371 template<int dimension, class CoordType>
    \n-
    372 template<int codimension>
    \n-
    373 void
    \n-
    374 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    375 increment()
    \n-
    376 {
    \n-
    377 ++_index;
    \n-
    378 }
    \n-
    379
    \n-
    380 template<int dimension, class CoordType>
    \n-
    381 template<int codimension>
    \n-
    382 int
    \n-
    383 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::
    \n-
    384 index() const
    \n-
    385 {
    \n-
    386 return _index;
    \n-
    387 }
    \n-
    388
    \n-
    389 template<int dimension, class CoordType>
    \n-
    390 template<int codimension>
    \n-
    391 typename RefinementImp<dimension, CoordType>::template Codim<codimension>::Geometry
    \n-
    392 RefinementImp<dimension, CoordType>::Codim<codimension>::SubEntityIterator::geometry () const
    \n-
    393 {
    \n-
    394 std::array<unsigned int,dimension> intCoords = idx2coord(_index,_nIntervals);
    \n-
    395
    \n-
    396 Dune::FieldVector<CoordType,dimension> lower;
    \n-
    397 Dune::FieldVector<CoordType,dimension> upper;
    \n-
    398
    \n-
    399 assert(codimension == 0 or codimension == dimension);
    \n-
    400
    \n-
    401 if constexpr (codimension == 0) {
    \n-
    402 for (size_t j = 0; j < dimension; j++)
    \n-
    403 {
    \n-
    404 lower[j] = double(intCoords[j]) / double(_nIntervals);
    \n-
    405 upper[j] = double(intCoords[j] + 1) / double(_nIntervals);
    \n-
    406 }
    \n-
    407
    \n-
    408 return typename RefinementImp<dimension,
    \n-
    409 CoordType>::template Codim<codimension>::Geometry(lower,upper);
    \n-
    410 } else {
    \n-
    411 for (size_t j = 0; j < dimension; j++)
    \n-
    412 lower[j] = upper[j] = double(intCoords[j]) / double(_nIntervals);
    \n-
    413
    \n-
    414 return typename RefinementImp<dimension,
    \n-
    415 CoordType>::template Codim<codimension>::Geometry(lower,upper,std::bitset<dimension>(0));
    \n-
    416 }
    \n-
    417 }
    \n-
    418
    \n-
    419#endif // DOXYGEN
    \n-
    420
    \n-
    421 } // namespace HCube
    \n-
    \n-
    422
    \n-
    423 // ///////////////////////
    \n-
    424 //
    \n-
    425 // The refinement traits
    \n-
    426 //
    \n-
    427
    \n-
    428#ifndef DOXYGEN
    \n-
    429 template<unsigned topologyId, class CoordType, unsigned coerceToId,
    \n-
    430 int dim>
    \n-
    431 struct Traits<
    \n-
    432 topologyId, CoordType, coerceToId, dim,
    \n-
    433 typename std::enable_if<
    \n-
    434 (dim >= 2 &&
    \n-
    435 (GeometryTypes::cube(dim).id() >> 1) ==
    \n-
    436 (topologyId >> 1) &&
    \n-
    437 (GeometryTypes::cube(dim).id() >> 1) ==
    \n-
    438 (coerceToId >> 1)
    \n-
    439 )>::type
    \n-
    440 >
    \n-
    441 {
    \n-
    442 typedef HCube::RefinementImp<dim, CoordType> Imp;
    \n-
    443 };
    \n-
    444#endif
    \n-
    445
    \n-
    446 } // namespace RefinementImp
    \n-
    447
    \n-
    448} // namespace Dune
    \n-
    449
    \n-
    450#endif // DUNE_GEOMETRY_REFINEMENT_HCUBE_CC
    \n-
    A geometry implementation for axis-aligned hypercubes.
    \n-
    This file contains the parts independent of a particular Refinement implementation.
    \n-\n-
    STL namespace.
    \n+
    161 } // namespace Impl
    \n+
    162} // namespace Dune
    \n+
    163
    \n+
    164#endif // DUNE_GEOMETRY_TYPEINDEX_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    A geometry implementation for axis-aligned hypercubes.
    Definition axisalignedcubegeometry.hh:50
    \n-
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    Refinement implementation for hypercubes
    Definition hcube.cc:74
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    Definition hcube.cc:85
    \n-
    static ElementIterator eEnd(unsigned nIntervals)
    Definition hcube.cc:152
    \n-
    static unsigned nVertices(unsigned nIntervals)
    Definition hcube.cc:108
    \n-
    static VertexIterator vEnd(unsigned nIntervals)
    Definition hcube.cc:125
    \n-
    FieldVector< int,(1<< dimension)> IndexVector
    Definition hcube.cc:86
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    Definition hcube.cc:83
    \n-
    FieldVector< CoordType, dimension > CoordVector
    Definition hcube.cc:84
    \n-
    static unsigned nElements(unsigned nIntervals)
    Definition hcube.cc:133
    \n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcube.cc:79
    \n-
    static ElementIterator eBegin(unsigned nIntervals)
    Definition hcube.cc:144
    \n-
    static constexpr int dimension
    Know your own dimension.
    Definition hcube.cc:77
    \n-
    static VertexIterator vBegin(unsigned nIntervals)
    Definition hcube.cc:117
    \n-\n-
    Dune::AxisAlignedCubeGeometry< CoordType, dimension-codimension, dimension > Geometry
    Definition hcube.cc:102
    \n-
    SubEntityIterator base class for hypercube refinement.
    Definition hcube.cc:174
    \n-\n-
    Refinement::template Codim< dimension >::SubEntityIterator Common
    Definition hcube.cc:187
    \n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcube.cc:219
    \n-
    Refinement::template Codim< 0 >::SubEntityIterator Common
    Definition hcube.cc:220
    \n-\n-\n-
    SubEntityIterator(unsigned int index, unsigned int nIntervals)
    \n-\n-\n-
    RefinementImp< dimension, CoordType > Refinement
    Definition hcube.cc:281
    \n-\n-\n-
    Refinement::template Codim< codimension >::SubEntityIterator This
    Definition hcube.cc:282
    \n+
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    constexpr Id toId() const
    Create an Id representation of this GeometryType.
    Definition type.hh:210
    \n+
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n+
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n+
    constexpr bool isNone() const
    Return true if entity is a singular of any dimension.
    Definition type.hh:355
    \n+
    Compute per-dimension indices for geometry types.
    Definition typeindex.hh:25
    \n+
    static constexpr std::size_t size(std::size_t dim)
    Compute total number of geometry types for the given dimension.
    Definition typeindex.hh:61
    \n+
    static constexpr GeometryType type(std::size_t dim, std::size_t index)
    compute the geometry type for the given local index and dimension
    Definition typeindex.hh:79
    \n+
    static constexpr std::size_t index(const GeometryType &gt)
    Compute the index for the given geometry type within its dimension.
    Definition typeindex.hh:73
    \n+
    Compute indices for geometry types, taking the dimension into account.
    Definition typeindex.hh:90
    \n+
    static constexpr std::size_t index(const GeometryType &gt)
    Compute the index for the given geometry type over all dimensions.
    Definition typeindex.hh:138
    \n+
    static constexpr std::size_t offset(std::size_t dim)
    Compute the starting index for a given dimension including irregular geometry types.
    Definition typeindex.hh:113
    \n+
    static constexpr std::size_t size(std::size_t maxdim)
    Compute total number of geometry types up to and including the given dimension.
    Definition typeindex.hh:125
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,529 +1,183 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n- * _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-hcube.cc\n+typeindex.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n-_\b6#define DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n+5#ifndef DUNE_GEOMETRY_TYPEINDEX_HH\n+6#define DUNE_GEOMETRY_TYPEINDEX_HH\n 7\n-41#include \n-42\n-43#include \n-44#include \n-45\n-46#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-47#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-48\n-49#include \"_\bb_\ba_\bs_\be_\b._\bc_\bc\" // for RefinementTraits\n-50\n-51namespace _\bD_\bu_\bn_\be\n-52{\n-53 namespace RefinementImp\n-54 {\n-_\b6_\b1 namespace HCube\n+14#include \n+15\n+16#include \n+17#include \n+18\n+19#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+20\n+21namespace _\bD_\bu_\bn_\be\n+22{\n+_\b2_\b4 class _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+25 {\n+32 inline static constexpr std::size_t regular_size(std::size_t dim)\n+33 {\n+34 // The following expression is derived from the expression for\n+35 // GlobalGeometryTypeIndex::regular_offset(). Subtracting\n+36 // regular_offset(dim+1)-regular_offset(dim) we get:\n+37 //\n+38 // ((1 << dim+1) >> 1) - ((1 << dim) >> 1)\n+39 //\n+40 // We always have\n+41 //\n+42 // dim >= 0,\n+43 //\n+44 // so\n+45 //\n+46 // (1 << dim+1) >= 2 and (1 << dim+2) % 2 == 0.\n+47 //\n+48 // So if we apply a single right-shift to that, we will never lose any\n+49 // set bits, thus\n+50 //\n+51 // ((1 << dim+1) >> 1) == (1 << dim)\n+52 return (1 << dim) - ((1 << dim) >> 1);\n+53 }\n+54\n+55 public:\n+_\b6_\b1 inline static constexpr std::size_t _\bs_\bi_\bz_\be(std::size_t dim)\n 62 {\n-72 template\n-_\b7_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n+63 // one for \"none\"\n+64 return regular_size(dim) + 1;\n+65 }\n+66\n+_\b7_\b3 inline static constexpr std::size_t _\bi_\bn_\bd_\be_\bx(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >)\n 74 {\n-75 public:\n-_\b7_\b7 constexpr static int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dimension_;\n-78 //- Know yourself\n-_\b7_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-80\n-81 template\n-82 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b8_\b3 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b8_\b4 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b8_\b5 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b8_\b6 typedef FieldVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+75 return gt._\bi_\bs_\bN_\bo_\bn_\be() ? regular_size(gt._\bd_\bi_\bm()) : (gt._\bi_\bd() >> 1);\n+76 }\n+77\n+_\b7_\b9 inline static constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be(std::size_t dim, std::size_t\n+_\bi_\bn_\bd_\be_\bx) {\n+80 return (_\bi_\bn_\bd_\be_\bx == regular_size(dim)) ?\n+81 GeometryTypes::none(dim) :\n+82 // the cast to unsigned makes sure this is interpreted as the topology\n+83 // ID constructor\n+84 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(static_cast< unsigned int >(_\bi_\bn_\bd_\be_\bx << 1), dim);\n+85 }\n+86 };\n 87\n-88 static unsigned _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(unsigned nIntervals);\n-89 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(unsigned nIntervals);\n-90 static _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(unsigned nIntervals);\n-91\n-92 static unsigned _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(unsigned nIntervals);\n-93 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(unsigned nIntervals);\n-94 static _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(unsigned nIntervals);\n-95 };\n-96\n-97 template\n-98 template\n-_\b9_\b9 struct _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm\n-100 {\n-101 class SubEntityIterator;\n-_\b1_\b0_\b2 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bG_\be_\bo_\bm_\be_\bt_\br_\by;\n-103 };\n-104\n-105 template\n-106 unsigned\n-_\b1_\b0_\b7 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-108_\b _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(unsigned nIntervals)\n-109 {\n-110 // return (nIntervals + 1)^dim\n-111 return Dune::power(nIntervals+1u, static_cast(dimension));\n-112 }\n-113\n-114 template\n-115 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b1_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-117_\b _\bv_\bB_\be_\bg_\bi_\bn(unsigned nIntervals)\n-118 {\n-119 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(0,nIntervals);\n-120 }\n-121\n-122 template\n-123 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b2_\b4 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-125_\b _\bv_\bE_\bn_\bd(unsigned nIntervals)\n+_\b8_\b9 class _\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+90 {\n+98 inline static constexpr std::size_t regular_offset(std::size_t dim)\n+99 {\n+100 // The number of regular geometry types in a given dimension is\n+101 // 2^(dim-1). For dim==0 this would yield 1/2 geometry types (which is\n+102 // obviously bogus, dim==0 has one regular geometry type, the point).\n+103 // The following expression relies on 1 >> 1 == 0 to treat dim==0\n+104 // specially.\n+105 return (1 << dim) >> 1;\n+106 }\n+107\n+108 public:\n+_\b1_\b1_\b3 inline static constexpr std::size_t _\bo_\bf_\bf_\bs_\be_\bt(std::size_t dim)\n+114 {\n+115 // dim times \"none\"\n+116 return regular_offset(dim) + dim;\n+117 }\n+118\n+_\b1_\b2_\b5 inline static constexpr std::size_t _\bs_\bi_\bz_\be(std::size_t maxdim)\n 126 {\n-127 return _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nVertices(nIntervals),nIntervals);\n+127 return _\bo_\bf_\bf_\bs_\be_\bt(maxdim+1);\n 128 }\n 129\n-130 template\n-131 unsigned\n-_\b1_\b3_\b2 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-133_\b _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(unsigned nIntervals)\n-134 {\n-135 static_assert(dimension >= 0,\n-136 \"Negative dimension given, what the heck is that supposed to mean?\");\n-137 // return nIntervals^dim\n-138 return Dune::power(nIntervals, static_cast(dimension));\n-139 }\n-140\n-141 template\n-142 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b4_\b3 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-144_\b _\be_\bB_\be_\bg_\bi_\bn(unsigned nIntervals)\n-145 {\n-146 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(0,nIntervals);\n-147 }\n-148\n-149 template\n-150 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\b1_\b5_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b>_\b:_\b:\n-152_\b _\be_\bE_\bn_\bd(unsigned nIntervals)\n-153 {\n-154 return _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(nElements(nIntervals),nIntervals);\n-155 }\n-156\n-157 //\n-158 // The iterators\n-159 //\n+_\b1_\b3_\b8 inline static constexpr std::size_t _\bi_\bn_\bd_\be_\bx(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >)\n+139 {\n+140 return _\bo_\bf_\bf_\bs_\be_\bt(gt._\bd_\bi_\bm()) + _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx(gt);\n+141 }\n+142 };\n+143\n+144 namespace Impl {\n+145\n+146 // Map a dynamic GeometryType to a static integral_constant\n+147 template\n+148 static auto toGeometryTypeIdConstant(const GeometryType& gt, F&& f) {\n+149 // Transform LocalGeometryTypeIndex to GeometryType::Id\n+150 auto callWithId = [&](auto index) {\n+151 static constexpr auto id = _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bt_\by_\bp_\be(dim, decltype\n+(index)::value)._\bt_\bo_\bI_\bd();\n+152 return f(std::integral_constant{});\n+153 };\n+154 // switchCases needs a fallback to determine the return type.\n+155 auto fallBack = [&]() { return callWithId(Dune::Indices::_0); };\n+156 // Iterate over all _regular_ GeometryType indices for given dimension\n+157 auto allIndices = std::make_index_sequence<_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n+(dim)-1>{};\n+158 return Dune::Hybrid::switchCases(allIndices, _\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+(gt), callWithId, fallBack);\n+159 }\n 160\n-161#ifdef DOXYGEN\n-173 template\n-_\b1_\b7_\b4 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl {};\n-175#else\n-176 template\n-177 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl;\n-178#endif //DOXYGEN\n-179\n-180 // for vertices\n-181\n-182 template\n-_\b1_\b8_\b3 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-184 {\n-185 public:\n-_\b1_\b8_\b6 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b1_\b8_\b7 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bC_\bo_\bm_\bm_\bo_\bn;\n-_\b1_\b8_\b8 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-189\n-190 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-191\n-192 private:\n-193 const _\bC_\bo_\bm_\bm_\bo_\bn & asCommon() const\n-194 {\n-195 return *static_cast(this);\n-196 }\n-197 };\n-198\n-199 template\n-200 typename RefinementSubEntityIteratorSpecial::CoordVector\n-_\b2_\b0_\b1 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:\n-202_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-203 {\n-204 std::array v(asCommon().vertexCoord());\n-205 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br c;\n-206 for (int d = 0; d < dimension; d++)\n-207 {\n-208 c[d] = v[d]*1.0 / asCommon()._nIntervals;\n-209 }\n-210 return c;\n-211 }\n-212\n-213 // for elements\n-214\n-215 template\n-_\b2_\b1_\b6 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-217 {\n-218 public:\n-_\b2_\b1_\b9 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b2_\b0 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bC_\bo_\bm_\bm_\bo_\bn;\n-_\b2_\b2_\b1 typedef typename Refinement::IndexVector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-_\b2_\b2_\b2 typedef typename Refinement::CoordVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-223\n-224 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vertexIndices() const;\n-225 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br coords() const;\n-226\n-227 private:\n-228 const _\bC_\bo_\bm_\bm_\bo_\bn & asCommon() const\n-229 {\n-230 return *static_cast(this);\n-231 }\n-232 };\n-233\n-234 template\n-235 typename RefinementSubEntityIteratorSpecial::\n-IndexVector\n-_\b2_\b3_\b6 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-237_\b _\bv_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const\n-238 {\n-239 constexpr static int nIndices = 1 << dimension;\n-240\n-241 // cell index tuple\n-242 std::array e(asCommon().cellCoord());\n-243\n-244 // vertices\n-245 _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br vec;\n-246 for(int i = 0; i < nIndices; ++i)\n-247 {\n-248 int base = 1;\n-249 std::array alpha(asCommon().idx2multiidx(i));\n-250 for (int d = 0; d < dimension; d++) {\n-251 vec[i] += (alpha[d] + e[d]) * base;\n-252 base *= asCommon()._nIntervals+1;\n-253 }\n-254 }\n-255 return vec;\n-256 }\n-257\n-258 template\n-259 typename _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-_\b2_\b6_\b0 _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b>_\b:_\b:\n-261_\b _\bc_\bo_\bo_\br_\bd_\bs() const\n-262 {\n-263 std::array v(asCommon().cellCoord());\n-264 _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br c;\n-265 for (int d=0; d\n-274 template\n-_\b2_\b7_\b5 class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp::_\bC_\bo_\bd_\bi_\bm::\n-SubEntityIterator\n-276 : public ForwardIteratorFacade::template Codim::SubEntityIterator, int>,\n-278 public _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-279 {\n-280 public:\n-_\b2_\b8_\b1 typedef _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt;\n-_\b2_\b8_\b2 typedef typename Refinement::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-_\bT_\bh_\bi_\bs;\n-283\n-_\b2_\b8_\b4 _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(unsigned int index, unsigned int nIntervals);\n-285\n-_\b2_\b8_\b6 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bT_\bh_\bi_\bs &other) const;\n-_\b2_\b8_\b7 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt();\n-288\n-_\b2_\b8_\b9 int _\bi_\bn_\bd_\be_\bx() const;\n-_\b2_\b9_\b0 Geometry _\bg_\be_\bo_\bm_\be_\bt_\br_\by () const;\n-291 private:\n-292 friend class _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, CoordType,\n-codimension>;\n-293 unsigned int _index;\n-294 unsigned int _nIntervals;\n-295\n-296 std::array\n-297 cellCoord(unsigned int idx) const\n-298 {\n-299 return idx2coord(idx, _nIntervals);\n-300 }\n-301\n-302 std::array\n-303 vertexCoord(unsigned int idx) const\n-304 {\n-305 return idx2coord(idx, _nIntervals+1u);\n-306 }\n-307\n-308 std::array\n-309 cellCoord() const\n-310 {\n-311 return cellCoord(_index);\n-312 }\n-313\n-314 std::array\n-315 vertexCoord() const\n-316 {\n-317 return vertexCoord(_index);\n-318 }\n-319\n-320 std::array\n-321 idx2coord(unsigned int idx, unsigned int w) const\n-322 {\n-323 std::array c;\n-324 for (unsigned int d = 0; d < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; d++)\n-325 {\n-326 c[d] = idx%w;\n-327 idx = idx/w;\n-328 }\n-329 return c;\n-330 }\n-331\n-332 unsigned int\n-333 coord2idx(std::array c, unsigned int w) const\n-334 {\n-335 unsigned int i = 0;\n-336 for (unsigned int d = _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; d > 0; d--)\n-337 {\n-338 i *= w;\n-339 i += c[d-1];\n-340 }\n-341 return i;\n-342 }\n-343\n-344 std::array\n-345 idx2multiidx(unsigned int idx) const\n-346 {\n-347 std::array alpha;\n-348 for (unsigned int i = 0; i < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; ++i)\n-349 alpha[i] = (idx >> i) & 1u;\n-350 return alpha;\n-351 }\n-352 };\n-353\n-354#ifndef DOXYGEN\n-355 template\n-356 template\n-357 RefinementImp::Codim::\n-SubEntityIterator::\n-358 SubEntityIterator(unsigned int index, unsigned int nIntervals)\n-359 : _index(index), _nIntervals(nIntervals)\n-360 {}\n-361\n-362 template\n-363 template\n-364 bool\n-365 RefinementImp::Codim::\n-SubEntityIterator::\n-366 equals(const This &other) const\n-367 {\n-368 return ((_index == other._index) && (_nIntervals == other._nIntervals));\n-369 }\n-370\n-371 template\n-372 template\n-373 void\n-374 RefinementImp::Codim::\n-SubEntityIterator::\n-375 increment()\n-376 {\n-377 ++_index;\n-378 }\n-379\n-380 template\n-381 template\n-382 int\n-383 RefinementImp::Codim::\n-SubEntityIterator::\n-384 index() const\n-385 {\n-386 return _index;\n-387 }\n-388\n-389 template\n-390 template\n-391 typename RefinementImp::template Codim::\n-Geometry\n-392 RefinementImp::Codim::\n-SubEntityIterator::geometry () const\n-393 {\n-394 std::array intCoords = idx2coord\n-(_index,_nIntervals);\n-395\n-396 Dune::FieldVector lower;\n-397 Dune::FieldVector upper;\n-398\n-399 assert(codimension == 0 or codimension == _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n-400\n-401 if constexpr (codimension == 0) {\n-402 for (size_t j = 0; j < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; j++)\n-403 {\n-404 lower[j] = double(intCoords[j]) / double(_nIntervals);\n-405 upper[j] = double(intCoords[j] + 1) / double(_nIntervals);\n-406 }\n-407\n-408 return typename RefinementImp<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn,\n-409 CoordType>::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by(lower,upper);\n-410 } else {\n-411 for (size_t j = 0; j < _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn; j++)\n-412 lower[j] = upper[j] = double(intCoords[j]) / double(_nIntervals);\n-413\n-414 return typename RefinementImp<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn,\n-415 CoordType>::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by(lower,upper,std::\n-bitset(0));\n-416 }\n-417 }\n-418\n-419#endif // DOXYGEN\n-420\n-421 } // namespace HCube\n-422\n-423 // ///////////////////////\n-424 //\n-425 // The refinement traits\n-426 //\n-427\n-428#ifndef DOXYGEN\n-429 template\n-431 struct Traits<\n-432 topologyId, CoordType, coerceToId, dim,\n-433 typename _\bs_\bt_\bd::enable_if<\n-434 (dim >= 2 &&\n-435 (GeometryTypes::cube(dim).id() >> 1) ==\n-436 (topologyId >> 1) &&\n-437 (GeometryTypes::cube(dim).id() >> 1) ==\n-438 (coerceToId >> 1)\n-439 )>::type\n-440 >\n-441 {\n-442 typedef HCube::RefinementImp Imp;\n-443 };\n-444#endif\n-445\n-446 } // namespace RefinementImp\n-447\n-448} // namespace Dune\n-449\n-450#endif // DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n-_\ba_\bx_\bi_\bs_\ba_\bl_\bi_\bg_\bn_\be_\bd_\bc_\bu_\bb_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n-A geometry implementation for axis-aligned hypercubes.\n-_\bb_\ba_\bs_\be_\b._\bc_\bc\n-This file contains the parts independent of a particular Refinement\n-implementation.\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n-_\bs_\bt_\bd\n-STL namespace.\n+161 } // namespace Impl\n+162} // namespace Dune\n+163\n+164#endif // DUNE_GEOMETRY_TYPEINDEX_HH\n+_\bt_\by_\bp_\be_\b._\bh_\bh\n+A unique label for each type of element that can occur in a grid.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bx_\bi_\bs_\bA_\bl_\bi_\bg_\bn_\be_\bd_\bC_\bu_\bb_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-A geometry implementation for axis-aligned hypercubes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn axisalignedcubegeometry.hh:50\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Static tag representing a codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp\n-Refinement implementation for hypercubes\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:74\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bE_\bn_\bd\n-static ElementIterator eEnd(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:152\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-static unsigned nVertices(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:108\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bE_\bn_\bd\n-static VertexIterator vEnd(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:125\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< int,(1<< dimension)> IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:86\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:83\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:84\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-static unsigned nElements(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:133\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:79\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-static ElementIterator eBegin(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:144\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static constexpr int dimension\n-Know your own dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-static VertexIterator vBegin(unsigned nIntervals)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:117\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Dune::AxisAlignedCubeGeometry< CoordType, dimension-codimension, dimension >\n-Geometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:102\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl\n-SubEntityIterator base class for hypercube refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:174\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:188\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n-Refinement::template Codim< dimension >::SubEntityIterator Common\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:187\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:186\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bm_\bm_\bo_\bn\n-Refinement::template Codim< 0 >::SubEntityIterator Common\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:220\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::CoordVector CoordVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:222\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bS_\bp_\be_\bc_\bi_\ba_\bl_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,\n-_\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b,_\b _\b0_\b _\b>_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-Refinement::IndexVector IndexVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:221\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:\n-_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-SubEntityIterator(unsigned int index, unsigned int nIntervals)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n-bool equals(const This &other) const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-Geometry geometry() const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-RefinementImp< dimension, CoordType > Refinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-int index() const\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n-void increment()\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bH_\bC_\bu_\bb_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bm_\bp_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs\n-Refinement::template Codim< codimension >::SubEntityIterator This\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn hcube.cc:282\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+Unique label for each type of entities that can occur in DUNE grids.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bI_\bd\n+constexpr Id toId() const\n+Create an Id representation of this GeometryType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:210\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n+constexpr unsigned int dim() const\n+Return dimension of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n+constexpr unsigned int id() const\n+Return the topology id of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bN_\bo_\bn_\be\n+constexpr bool isNone() const\n+Return true if entity is a singular of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:355\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+Compute per-dimension indices for geometry types.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:25\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n+static constexpr std::size_t size(std::size_t dim)\n+Compute total number of geometry types for the given dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bt_\by_\bp_\be\n+static constexpr GeometryType type(std::size_t dim, std::size_t index)\n+compute the geometry type for the given local index and dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+static constexpr std::size_t index(const GeometryType >)\n+Compute the index for the given geometry type within its dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:73\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx\n+Compute indices for geometry types, taking the dimension into account.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:90\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+static constexpr std::size_t index(const GeometryType >)\n+Compute the index for the given geometry type over all dimensions.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:138\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bo_\bf_\bf_\bs_\be_\bt\n+static constexpr std::size_t offset(std::size_t dim)\n+Compute the starting index for a given dimension including irregular geometry\n+types.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:113\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bI_\bn_\bd_\be_\bx_\b:_\b:_\bs_\bi_\bz_\be\n+static constexpr std::size_t size(std::size_t maxdim)\n+Compute total number of geometry types up to and including the given dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn typeindex.hh:125\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00233.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00233.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: topologyfactory.hh File Reference\n+dune-geometry: virtualrefinement.hh File Reference\n \n \n \n \n \n \n \n@@ -71,43 +71,53 @@\n \n \n \n
    \n \n-
    topologyfactory.hh File Reference
    \n+Namespaces |\n+Functions
    \n+
    virtualrefinement.hh File Reference
    \n \n
    \n-
    #include <cassert>
    \n-#include <array>
    \n-#include <map>
    \n-#include <memory>
    \n-#include <type_traits>
    \n-#include <vector>
    \n-#include <dune/geometry/type.hh>
    \n-#include <dune/geometry/typeindex.hh>
    \n+\n+

    This file contains the virtual wrapper around refinement. \n+More...

    \n+
    #include <vector>
    \n+#include <dune/common/fvector.hh>
    \n+#include "refinement.hh"
    \n+#include "type.hh"
    \n+#include "virtualrefinement.cc"
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Classes

    struct  Dune::TopologyFactory< Traits >
     Provide a factory over the generic topologies. More...
    class  Dune::VirtualRefinement< dimension, CoordType >
     VirtualRefinement base class. More...
     
    struct  Dune::TopologySingletonFactory< Factory >
     A wrapper for a TopologyFactory providing singleton storage. Same usage as TopologyFactory but with empty release method an internal storage. More...
    struct  Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension >
     codim database of VirtualRefinement More...
     
    \n \n \n \n+

    \n Namespaces

    namespace  Dune
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<int dimension, class CoordType >
    VirtualRefinement< dimension, CoordType > & Dune::buildRefinement (GeometryType geometryType, GeometryType coerceTo)
     return a reference to the VirtualRefinement according to the parameters
     
    \n-
    \n+

    Detailed Description

    \n+

    This file contains the virtual wrapper around refinement.

    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,37 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyfactory.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+virtualrefinement.hh File Reference\n+This file contains the virtual wrapper around refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n+#include \n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n+#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+#include \"_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-\u00a0 Provide a factory over the generic topologies. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n+\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt base class. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bF_\ba_\bc_\bt_\bo_\br_\by_\b _\b>\n- A wrapper for a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by providing singleton storage. Same\n-\u00a0 usage as _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by but with empty release method an internal\n- storage. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n+\u00a0 codim database of _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt< dimension, CoordType > _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+ &\u00a0 geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n+ return a reference to the\n+\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt according to the\n+ parameters\n+\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+This file contains the virtual wrapper around refinement.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00233_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00233_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: topologyfactory.hh Source File\n+dune-geometry: virtualrefinement.hh Source File\n \n \n \n \n \n \n \n@@ -74,194 +74,135 @@\n \n
    \n \n
    \n \n
    \n-
    topologyfactory.hh
    \n+
    virtualrefinement.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n-
    6#define DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n+
    5#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n+
    6#define DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n
    7
    \n-
    8#include <cassert>
    \n-
    9
    \n-
    10#include <array>
    \n-
    11#include <map>
    \n-
    12#include <memory>
    \n-
    13#include <type_traits>
    \n-
    14#include <vector>
    \n-
    15
    \n-
    16#include <dune/geometry/type.hh>
    \n-\n-
    18
    \n-
    19namespace Dune
    \n-
    20{
    \n-
    21
    \n-
    40 template <class Traits>
    \n-
    \n-\n-
    42 {
    \n-
    43 // extract types from Traits class
    \n-
    44 static const unsigned int dimension = Traits::dimension;
    \n-
    45 typedef typename Traits::Key Key;
    \n-
    46 typedef typename Traits::Object Object;
    \n-
    47 typedef typename Traits::Factory Factory;
    \n-
    48
    \n-
    \n-
    50 static Object *create ( const Dune::GeometryType &gt, const Key &key )
    \n-
    51 {
    \n-
    52 return Impl::toGeometryTypeIdConstant<dimension>(gt, [&](auto id) {
    \n-
    53 return create<decltype(id)::value>(key);
    \n-
    54 });
    \n-
    55 }
    \n-
    \n-
    57 template< GeometryType::Id geometryId >
    \n-
    \n-
    58 static Object *create ( const Key &key )
    \n-
    59 {
    \n-
    60 return Factory::template createObject< geometryId >( key );
    \n-
    61 }
    \n-
    \n-
    62
    \n-
    64 template< class Topology >
    \n-
    \n-
    65 static Object *create ( const Key &key )
    \n-
    66 {
    \n-
    67 return Factory::template createObject< Topology >( key );
    \n-
    68 }
    \n-
    \n-
    69
    \n-
    71 static void release( Object *object ) { delete object; }
    \n-
    72 };
    \n-
    \n-
    73
    \n-
    74
    \n-
    75
    \n-
    80 template <class Factory>
    \n-
    \n-\n-
    82 {
    \n-
    83 static const unsigned int dimension = Factory::dimension;
    \n-
    84 typedef typename Factory::Key Key;
    \n-
    85 typedef const typename Factory::Object Object;
    \n-
    86
    \n-
    \n-
    88 static Object *create ( const Dune::GeometryType &gt, const Key &key )
    \n-
    89 {
    \n-
    90 assert( gt.id() < numTopologies );
    \n-
    91 return instance().getObject( gt, key );
    \n-
    92 }
    \n-
    \n-
    94 template< GeometryType::Id geometryId >
    \n-
    \n-
    95 static auto create ( const Key &key )
    \n-
    96 -> std::enable_if_t< static_cast<GeometryType>(geometryId).dim() == dimension, Object * >
    \n-
    97 {
    \n-
    98 return instance().template getObject< geometryId >( key );
    \n-
    99 }
    \n-
    \n-
    100
    \n-
    102 template< class Topology >
    \n-
    \n-
    103 static auto create ( const Key &key )
    \n-
    104 -> std::enable_if_t< Topology::dimension == dimension, Object * >
    \n-
    105 {
    \n-
    106 return instance().template getObject< Topology >( key );
    \n-
    107 }
    \n-
    \n-
    108
    \n-
    \n-
    110 static void release ( Object *object )
    \n-
    111 {}
    \n-
    \n-
    112
    \n-
    113 private:
    \n-
    114 struct ObjectDeleter
    \n-
    115 {
    \n-
    116 void operator() ( Object *ptr ) const { Factory::release( ptr ); }
    \n-
    117 };
    \n-
    118
    \n-
    119 static TopologySingletonFactory &instance ()
    \n-
    120 {
    \n-
    121 static TopologySingletonFactory instance;
    \n-
    122 return instance;
    \n-
    123 }
    \n-
    124
    \n-
    125 static const unsigned int numTopologies = (1 << dimension);
    \n-
    126 typedef std::array< std::unique_ptr< Object, ObjectDeleter >, numTopologies > Array;
    \n-
    127 typedef std::map< Key, Array > Storage;
    \n-
    128
    \n-
    129 TopologySingletonFactory () = default;
    \n-
    130
    \n-
    131 std::unique_ptr< Object, ObjectDeleter > &find ( const unsigned int topologyId, const Key &key )
    \n-
    132 {
    \n-
    133 return storage_[ key ][ topologyId ];
    \n-
    134 }
    \n-
    135
    \n-
    136 Object *getObject ( const Dune::GeometryType &gt, const Key &key )
    \n-
    137 {
    \n-
    138 auto &object = find( gt.id(), key );
    \n-
    139 if( !object )
    \n-
    140 object.reset( Factory::create( gt, key ) );
    \n-
    141 return object.get();
    \n-
    142 }
    \n-
    143
    \n-
    144 template< GeometryType::Id geometryId >
    \n-
    145 Object *getObject ( const Key &key )
    \n-
    146 {
    \n-
    147 static constexpr GeometryType geometry = geometryId;
    \n-
    148 auto &object = find( geometry.id(), key );
    \n-
    149 if( !object )
    \n-
    150 object.reset( Factory::template create< geometry >( key ) );
    \n-
    151 return object.get();
    \n-
    152 }
    \n-
    153
    \n-
    154 template< class Topology >
    \n-
    155 Object *getObject ( const Key &key )
    \n-
    156 {
    \n-
    157 auto &object = find( Topology::id, key );
    \n-
    158 if( !object )
    \n-
    159 object.reset( Factory::template create< Topology >( key ) );
    \n-
    160 return object.get();
    \n-
    161 }
    \n-
    162
    \n-
    163 Storage storage_;
    \n-
    164 };
    \n-
    \n-
    165
    \n-
    166}
    \n-
    167
    \n-
    168#endif // #ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n-
    Helper classes to provide indices for geometrytypes for use in a vector.
    \n-
    A unique label for each type of element that can occur in a grid.
    \n+
    257#include <vector>
    \n+
    258
    \n+
    259#include <dune/common/fvector.hh>
    \n+
    260
    \n+
    261#include "refinement.hh"
    \n+
    262#include "type.hh"
    \n+
    263
    \n+
    264namespace Dune
    \n+
    265{
    \n+
    266 // //////////////////////////////////////////
    \n+
    267 //
    \n+
    268 // The virtual base class and its iterators
    \n+
    269 //
    \n+
    270
    \n+
    271 //
    \n+
    272 // Refinement
    \n+
    273 //
    \n+
    274
    \n+
    281 template<int dimension, class CoordType>
    \n+
    \n+\n+
    283 {
    \n+
    284 public:
    \n+
    285 template<int codimension>
    \n+
    286 struct Codim;
    \n+\n+\n+
    291
    \n+
    297 typedef FieldVector<CoordType, dimension> CoordVector;
    \n+
    303 typedef std::vector<int> IndexVector;
    \n+
    304
    \n+
    305 template<int codimension>
    \n+\n+\n+\n+
    309
    \n+
    315 virtual int nVertices(Dune::RefinementIntervals tag) const = 0;
    \n+
    316
    \n+\n+
    323
    \n+\n+
    330
    \n+
    336 virtual int nElements(Dune::RefinementIntervals tag) const = 0;
    \n+
    337
    \n+\n+
    344
    \n+\n+
    351
    \n+
    \n+\n+
    354 {}
    \n+
    \n+
    355
    \n+
    356 protected:
    \n+\n+\n+\n+\n+
    361 };
    \n+
    \n+
    362
    \n+
    364 template<int dimension, class CoordType>
    \n+
    365 template<int codimension>
    \n+
    \n+
    366 struct VirtualRefinement<dimension, CoordType>::Codim
    \n+
    367 {
    \n+
    368 class SubEntityIterator;
    \n+
    369 };
    \n+
    \n+
    370
    \n+
    371 // ////////////////////////
    \n+
    372 //
    \n+
    373 // The refinement builder
    \n+
    374 //
    \n+
    375
    \n+
    376 template<int dimension, class CoordType>
    \n+\n+
    378 buildRefinement(GeometryType geometryType, GeometryType coerceTo);
    \n+
    379
    \n+
    380} // namespace Dune
    \n+
    381
    \n+
    382#include "virtualrefinement.cc"
    \n+
    383
    \n+
    384#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n+
    This file contains the virtual wrapper around refinement.
    \n+
    This file simply includes all Refinement implementations so you don't have to do them separately.
    \n
    Definition affinegeometry.hh:21
    \n-
    Provide a factory over the generic topologies.
    Definition topologyfactory.hh:42
    \n-
    Traits::Factory Factory
    Definition topologyfactory.hh:47
    \n-
    static Object * create(const Dune::GeometryType &gt, const Key &key)
    dynamically create objects
    Definition topologyfactory.hh:50
    \n-
    static const unsigned int dimension
    Definition topologyfactory.hh:44
    \n-
    static Object * create(const Key &key)
    statically create objects
    Definition topologyfactory.hh:58
    \n-
    static void release(Object *object)
    release the object returned by the create methods
    Definition topologyfactory.hh:71
    \n-
    Traits::Key Key
    Definition topologyfactory.hh:45
    \n-
    Traits::Object Object
    Definition topologyfactory.hh:46
    \n-
    A wrapper for a TopologyFactory providing singleton storage. Same usage as TopologyFactory but with e...
    Definition topologyfactory.hh:82
    \n-
    static auto create(const Key &key) -> std::enable_if_t< Topology::dimension==dimension, Object * >
    Definition topologyfactory.hh:103
    \n-
    static Object * create(const Dune::GeometryType &gt, const Key &key)
    Definition topologyfactory.hh:88
    \n-
    static void release(Object *object)
    release the object returned by the create methods
    Definition topologyfactory.hh:110
    \n-
    const Factory::Object Object
    Definition topologyfactory.hh:85
    \n-
    Factory::Key Key
    Definition topologyfactory.hh:84
    \n-
    static auto create(const Key &key) -> std::enable_if_t< static_cast< GeometryType >(geometryId).dim()==dimension, Object * >
    Definition topologyfactory.hh:95
    \n-
    static const unsigned int dimension
    Definition topologyfactory.hh:83
    \n+
    VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType geometryType, GeometryType coerceTo)
    return a reference to the VirtualRefinement according to the parameters
    Definition virtualrefinement.cc:503
    \n+
    Holds the number of refined intervals per axis needed for virtual and static refinement.
    Definition base.cc:94
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n-
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n+
    Definition virtualrefinement.cc:231
    \n+
    VirtualRefinement base class.
    Definition virtualrefinement.hh:283
    \n+
    SubEntityIteratorBack< dimension > VertexIteratorBack
    Definition virtualrefinement.hh:307
    \n+
    virtual ElementIteratorBack * eEndBack(Dune::RefinementIntervals tag) const =0
    \n+
    VertexIterator vBegin(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:38
    \n+
    ElementIterator eBegin(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:54
    \n+
    virtual int nElements(Dune::RefinementIntervals tag) const =0
    Get the number of Elements.
    \n+
    ElementIterator eEnd(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:62
    \n+
    Codim< 0 >::SubEntityIterator ElementIterator
    The ElementIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:290
    \n+
    virtual ~VirtualRefinement()
    Destructor.
    Definition virtualrefinement.hh:353
    \n+
    VertexIterator vEnd(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:46
    \n+
    FieldVector< CoordType, dimension > CoordVector
    The CoordVector of the VirtualRefinement.
    Definition virtualrefinement.hh:297
    \n+
    virtual int nVertices(Dune::RefinementIntervals tag) const =0
    Get the number of Vertices.
    \n+
    std::vector< int > IndexVector
    The IndexVector of the VirtualRefinement.
    Definition virtualrefinement.hh:303
    \n+
    Codim< dimension >::SubEntityIterator VertexIterator
    The VertexIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:288
    \n+
    virtual VertexIteratorBack * vEndBack(Dune::RefinementIntervals tag) const =0
    \n+
    SubEntityIteratorBack< 0 > ElementIteratorBack
    Definition virtualrefinement.hh:308
    \n+
    virtual ElementIteratorBack * eBeginBack(Dune::RefinementIntervals tag) const =0
    \n+
    virtual VertexIteratorBack * vBeginBack(Dune::RefinementIntervals tag) const =0
    \n+
    codim database of VirtualRefinement
    Definition virtualrefinement.hh:367
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,220 +1,186 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-topologyfactory.hh\n+virtualrefinement.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n-6#define DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n+5#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n+6#define DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n 7\n-8#include \n-9\n-10#include \n-11#include \n-12#include \n-13#include \n-14#include \n-15\n-16#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-17#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n-18\n-19namespace _\bD_\bu_\bn_\be\n-20{\n-21\n-40 template \n-_\b4_\b1 struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by\n-42 {\n-43 // extract types from Traits class\n-_\b4_\b4 static const unsigned int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Traits::dimension;\n-_\b4_\b5 typedef typename Traits::Key _\bK_\be_\by;\n-_\b4_\b6 typedef typename Traits::Object _\bO_\bb_\bj_\be_\bc_\bt;\n-_\b4_\b7 typedef typename Traits::Factory _\bF_\ba_\bc_\bt_\bo_\br_\by;\n-48\n-_\b5_\b0 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n-51 {\n-52 return Impl::toGeometryTypeIdConstant(gt, [&](auto id) {\n-53 return create(key);\n-54 });\n-55 }\n-57 template< GeometryType::Id geometryId >\n-_\b5_\b8 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n-59 {\n-60 return Factory::template createObject< geometryId >( key );\n-61 }\n-62\n-64 template< class Topology >\n-_\b6_\b5 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n-66 {\n-67 return Factory::template createObject< Topology >( key );\n-68 }\n-69\n-_\b7_\b1 static void _\br_\be_\bl_\be_\ba_\bs_\be( _\bO_\bb_\bj_\be_\bc_\bt *object ) { delete object; }\n-72 };\n-73\n-74\n-75\n-80 template \n-_\b8_\b1 struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by\n-82 {\n-_\b8_\b3 static const unsigned int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Factory::dimension;\n-_\b8_\b4 typedef typename Factory::Key _\bK_\be_\by;\n-_\b8_\b5 typedef const typename Factory::Object _\bO_\bb_\bj_\be_\bc_\bt;\n-86\n-_\b8_\b8 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n-89 {\n-90 assert( gt._\bi_\bd() < numTopologies );\n-91 return instance().getObject( gt, key );\n-92 }\n-94 template< GeometryType::Id geometryId >\n-_\b9_\b5 static auto _\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n-96 -> std::enable_if_t< static_cast(geometryId).dim() ==\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, _\bO_\bb_\bj_\be_\bc_\bt * >\n-97 {\n-98 return instance().template getObject< geometryId >( key );\n-99 }\n-100\n-102 template< class Topology >\n-_\b1_\b0_\b3 static auto _\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n-104 -> std::enable_if_t< Topology::dimension == dimension, Object * >\n-105 {\n-106 return instance().template getObject< Topology >( key );\n-107 }\n-108\n-_\b1_\b1_\b0 static void _\br_\be_\bl_\be_\ba_\bs_\be ( _\bO_\bb_\bj_\be_\bc_\bt *object )\n-111 {}\n-112\n-113 private:\n-114 struct ObjectDeleter\n-115 {\n-116 void operator() ( _\bO_\bb_\bj_\be_\bc_\bt *ptr ) const { Factory::release( ptr ); }\n-117 };\n-118\n-119 static TopologySingletonFactory &instance ()\n-120 {\n-121 static TopologySingletonFactory instance;\n-122 return instance;\n-123 }\n-124\n-125 static const unsigned int numTopologies = (1 << _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n-126 typedef std::array< std::unique_ptr< Object, ObjectDeleter >, numTopologies\n-> Array;\n-127 typedef std::map< Key, Array > Storage;\n-128\n-129 TopologySingletonFactory () = default;\n-130\n-131 std::unique_ptr< Object, ObjectDeleter > &find ( const unsigned int\n-topologyId, const _\bK_\be_\by &key )\n-132 {\n-133 return storage_[ key ][ topologyId ];\n-134 }\n-135\n-136 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n-137 {\n-138 auto &object = find( gt._\bi_\bd(), key );\n-139 if( !object )\n-140 object.reset( Factory::create( gt, key ) );\n-141 return object.get();\n-142 }\n-143\n-144 template< GeometryType::Id geometryId >\n-145 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bK_\be_\by &key )\n-146 {\n-147 static constexpr GeometryType geometry = geometryId;\n-148 auto &object = find( geometry.id(), key );\n-149 if( !object )\n-150 object.reset( Factory::template create< geometry >( key ) );\n-151 return object.get();\n-152 }\n-153\n-154 template< class Topology >\n-155 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bK_\be_\by &key )\n-156 {\n-157 auto &object = find( Topology::id, key );\n-158 if( !object )\n-159 object.reset( Factory::template create< Topology >( key ) );\n-160 return object.get();\n-161 }\n-162\n-163 Storage storage_;\n-164 };\n-165\n-166}\n-167\n-168#endif // #ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n-_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh\n-Helper classes to provide indices for geometrytypes for use in a vector.\n+257#include \n+258\n+259#include \n+260\n+261#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n+262#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+263\n+264namespace _\bD_\bu_\bn_\be\n+265{\n+266 // //////////////////////////////////////////\n+267 //\n+268 // The virtual base class and its iterators\n+269 //\n+270\n+271 //\n+272 // Refinement\n+273 //\n+274\n+281 template\n+_\b2_\b8_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+283 {\n+284 public:\n+285 template\n+286 struct _\bC_\bo_\bd_\bi_\bm;\n+_\b2_\b8_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+_\b2_\b9_\b0 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+291\n+_\b2_\b9_\b7 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n+_\b3_\b0_\b3 typedef std::vector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n+304\n+305 template\n+306 class _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n+_\b3_\b0_\b7 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n+_\b3_\b0_\b8 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\b0_\b> _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n+309\n+_\b3_\b1_\b5 virtual int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const = 0;\n+316\n+322 _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n+323\n+329 _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n+330\n+_\b3_\b3_\b6 virtual int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const = 0;\n+337\n+343 _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n+344\n+350 _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n+351\n+_\b3_\b5_\b3 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt()\n+354 {}\n+355\n+356 protected:\n+_\b3_\b5_\b7 virtual _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+= 0;\n+_\b3_\b5_\b8 virtual _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\bv_\bE_\bn_\bd_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const =\n+0;\n+_\b3_\b5_\b9 virtual _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n+const = 0;\n+_\b3_\b6_\b0 virtual _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\be_\bE_\bn_\bd_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n+= 0;\n+361 };\n+362\n+364 template\n+365 template\n+_\b3_\b6_\b6 struct _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bC_\bo_\bd_\bi_\bm\n+367 {\n+368 class SubEntityIterator;\n+369 };\n+370\n+371 // ////////////////////////\n+372 //\n+373 // The refinement builder\n+374 //\n+375\n+376 template\n+377 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n+378 _\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo);\n+379\n+380} // namespace Dune\n+381\n+382#include \"_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\"\n+383\n+384#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\n+This file contains the virtual wrapper around refinement.\n+_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n+This file simply includes all Refinement implementations so you don't have to\n+do them separately.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Provide a factory over the generic topologies.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:42\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Traits::Factory Factory\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n-static Object * create(const Dune::GeometryType >, const Key &key)\n-dynamically create objects\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:50\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const unsigned int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:44\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n-static Object * create(const Key &key)\n-statically create objects\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:58\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\br_\be_\bl_\be_\ba_\bs_\be\n-static void release(Object *object)\n-release the object returned by the create methods\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bK_\be_\by\n-Traits::Key Key\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:45\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bb_\bj_\be_\bc_\bt\n-Traits::Object Object\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by\n-A wrapper for a TopologyFactory providing singleton storage. Same usage as\n-TopologyFactory but with e...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:82\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n-static auto create(const Key &key) -> std::enable_if_t< Topology::\n-dimension==dimension, Object * >\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:103\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n-static Object * create(const Dune::GeometryType >, const Key &key)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:88\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\br_\be_\bl_\be_\ba_\bs_\be\n-static void release(Object *object)\n-release the object returned by the create methods\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:110\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bb_\bj_\be_\bc_\bt\n-const Factory::Object Object\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bK_\be_\by\n-Factory::Key Key\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:84\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n-static auto create(const Key &key) -> std::enable_if_t< static_cast<\n-GeometryType >(geometryId).dim()==dimension, Object * >\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:95\n-_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const unsigned int dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType\n+geometryType, GeometryType coerceTo)\n+return a reference to the VirtualRefinement according to the parameters\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:503\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n+Holds the number of refined intervals per axis needed for virtual and static\n+refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n-constexpr unsigned int id() const\n-Return the topology id of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:231\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+VirtualRefinement base class.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:283\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+SubEntityIteratorBack< dimension > VertexIteratorBack\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:307\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd_\bB_\ba_\bc_\bk\n+virtual ElementIteratorBack * eEndBack(Dune::RefinementIntervals tag) const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n+VertexIterator vBegin(Dune::RefinementIntervals tag) const\n+Get an VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:38\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n+ElementIterator eBegin(Dune::RefinementIntervals tag) const\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+virtual int nElements(Dune::RefinementIntervals tag) const =0\n+Get the number of Elements.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n+ElementIterator eEnd(Dune::RefinementIntervals tag) const\n+Get an ElementIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< 0 >::SubEntityIterator ElementIterator\n+The ElementIterator of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:290\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n+virtual ~VirtualRefinement()\n+Destructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:353\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n+VertexIterator vEnd(Dune::RefinementIntervals tag) const\n+Get an VertexIterator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:46\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n+FieldVector< CoordType, dimension > CoordVector\n+The CoordVector of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:297\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+virtual int nVertices(Dune::RefinementIntervals tag) const =0\n+Get the number of Vertices.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< int > IndexVector\n+The IndexVector of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:303\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Codim< dimension >::SubEntityIterator VertexIterator\n+The VertexIterator of the VirtualRefinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:288\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd_\bB_\ba_\bc_\bk\n+virtual VertexIteratorBack * vEndBack(Dune::RefinementIntervals tag) const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n+SubEntityIteratorBack< 0 > ElementIteratorBack\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:308\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk\n+virtual ElementIteratorBack * eBeginBack(Dune::RefinementIntervals tag) const\n+=0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk\n+virtual VertexIteratorBack * vBeginBack(Dune::RefinementIntervals tag) const =0\n+_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+codim database of VirtualRefinement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:367\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00236.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00236.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: multilineargeometry.hh File Reference\n+dune-geometry: refinement.hh File Reference\n \n \n \n \n \n \n \n@@ -69,59 +69,30 @@\n \n
    \n \n
    \n \n
    \n- \n-
    multilineargeometry.hh File Reference
    \n+
    refinement.hh File Reference
    \n
    \n
    \n-
    #include <cassert>
    \n-#include <functional>
    \n-#include <iterator>
    \n-#include <limits>
    \n-#include <vector>
    \n-#include <dune/common/fmatrix.hh>
    \n-#include <dune/common/fvector.hh>
    \n-#include <dune/common/typetraits.hh>
    \n-#include <dune/geometry/affinegeometry.hh>
    \n-#include <dune/geometry/referenceelements.hh>
    \n-#include <dune/geometry/type.hh>
    \n+\n+

    This file simply includes all Refinement implementations so you don't have to do them separately. \n+More...

    \n+\n

    Go to the source code of this file.

    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  Dune::MultiLinearGeometryTraits< ct >
     default traits class for MultiLinearGeometry More...
     
    struct  Dune::MultiLinearGeometryTraits< ct >::CornerStorage< mydim, cdim >
     template specifying the storage for the corners More...
     
    struct  Dune::MultiLinearGeometryTraits< ct >::hasSingleGeometryType< dim >
     will there be only one geometry type for a dimension? More...
     
    class  Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >
     generic geometry implementation based on corner coordinates More...
     
    class  Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
     
    class  Dune::CachedMultiLinearGeometry< ct, mydim, cdim, Traits >
     Implement a MultiLinearGeometry with additional caching. More...
     
    \n-\n-\n-\n-

    \n-Namespaces

    namespace  Dune
     
    \n-
    \n+

    Detailed Description

    \n+

    This file simply includes all Refinement implementations so you don't have to do them separately.

    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,44 +1,21 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-multilineargeometry.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+refinement.hh File Reference\n+This file simply includes all _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementations so you don't have to\n+do them separately. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>\n-\u00a0 default traits class for _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be_\b<_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n-\u00a0 template specifying the storage for the corners _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bc_\bt_\b _\b>_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b<_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 will there be only one geometry type for a dimension? _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-\u00a0 generic geometry implementation based on corner coordinates _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>_\b:_\b:\n- _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-\u00a0 Implement a _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by with additional caching. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\n-\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+This file simply includes all _\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt implementations so you don't have to\n+do them separately.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00236_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00236_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: multilineargeometry.hh Source File\n+dune-geometry: refinement.hh Source File\n \n \n \n \n \n \n \n@@ -74,840 +74,42 @@\n \n
    \n \n
    \n \n
    \n-
    multilineargeometry.hh
    \n+
    refinement.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n-
    6#define DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n+
    5#ifndef DUNE_GEOMETRY_REFINEMENT_HH
    \n+
    6#define DUNE_GEOMETRY_REFINEMENT_HH
    \n
    7
    \n-
    8#include <cassert>
    \n-
    9#include <functional>
    \n-
    10#include <iterator>
    \n-
    11#include <limits>
    \n-
    12#include <vector>
    \n-
    13
    \n-
    14#include <dune/common/fmatrix.hh>
    \n-
    15#include <dune/common/fvector.hh>
    \n-
    16#include <dune/common/typetraits.hh>
    \n-
    17
    \n-\n-\n-
    20#include <dune/geometry/type.hh>
    \n-
    21
    \n-
    22namespace Dune
    \n-
    23{
    \n-
    24
    \n-
    25 // MultiLinearGeometryTraits
    \n-
    26 // -------------------------
    \n-
    27
    \n-
    37 template< class ct >
    \n-
    \n-\n-
    39 {
    \n-
    58 typedef Impl::FieldMatrixHelper< ct > MatrixHelper;
    \n-
    59
    \n-
    61 static ct tolerance () { return ct( 16 ) * std::numeric_limits< ct >::epsilon(); }
    \n-
    62
    \n-
    127 template< int mydim, int cdim >
    \n-
    \n-\n-
    129 {
    \n-
    130 typedef std::vector< FieldVector< ct, cdim > > Type;
    \n-
    131 };
    \n-
    \n-
    132
    \n-
    146 template< int dim >
    \n-
    \n-\n-
    148 {
    \n-
    149 static const bool v = false;
    \n-
    150 static const unsigned int topologyId = ~0u;
    \n-
    151 };
    \n-
    \n-
    152 };
    \n-
    \n-
    153
    \n-
    154
    \n-
    155
    \n-
    156 // MultiLinearGeometry
    \n-
    157 // -------------------
    \n-
    158
    \n-
    179 template< class ct, int mydim, int cdim, class Traits = MultiLinearGeometryTraits< ct > >
    \n-
    \n-\n-
    181 {
    \n-\n-
    183
    \n-
    184 public:
    \n-
    186 typedef ct ctype;
    \n-
    187
    \n-
    189 static const int mydimension= mydim;
    \n-
    191 static const int coorddimension = cdim;
    \n-
    192
    \n-
    194 typedef FieldVector< ctype, mydimension > LocalCoordinate;
    \n-
    196 typedef FieldVector< ctype, coorddimension > GlobalCoordinate;
    \n-
    198 typedef ctype Volume;
    \n-
    199
    \n-
    201 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed;
    \n-
    202
    \n-\n-
    205
    \n-
    207 typedef FieldMatrix< ctype, coorddimension, mydimension > Jacobian;
    \n-
    208
    \n-
    210 typedef FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse;
    \n-
    211
    \n-
    212 protected:
    \n-
    213
    \n-\n-
    215
    \n-
    216 public:
    \n-
    217
    \n-\n-
    220
    \n-
    221 private:
    \n-
    222 static const bool hasSingleGeometryType = Traits::template hasSingleGeometryType< mydimension >::v;
    \n-
    223
    \n-
    224 protected:
    \n-
    225 typedef typename Traits::MatrixHelper MatrixHelper;
    \n-
    226 typedef typename std::conditional< hasSingleGeometryType, std::integral_constant< unsigned int, Traits::template hasSingleGeometryType< mydimension >::topologyId >, unsigned int >::type TopologyId;
    \n-
    227
    \n-
    228 public:
    \n-
    238 template< class Corners >
    \n-
    \n-\n-
    240 const Corners &corners )
    \n-
    241 : refElement_( refElement ),
    \n-
    242 corners_( corners )
    \n-
    243 {}
    \n-
    \n-
    244
    \n-
    254 template< class Corners >
    \n-
    \n-\n-
    256 const Corners &corners )
    \n-
    257 : refElement_( ReferenceElements::general( gt ) ),
    \n-
    258 corners_( corners )
    \n-
    259 {}
    \n-
    \n-
    260
    \n-
    \n-
    262 bool affine () const
    \n-
    263 {
    \n-\n-
    265 return affine( jt );
    \n-
    266 }
    \n-
    \n-
    267
    \n-
    269 Dune::GeometryType type () const { return GeometryType( toUnsignedInt(topologyId()), mydimension ); }
    \n-
    270
    \n-
    272 int corners () const { return refElement().size( mydimension ); }
    \n-
    273
    \n-
    \n-
    275 GlobalCoordinate corner ( int i ) const
    \n-
    276 {
    \n-
    277 assert( (i >= 0) && (i < corners()) );
    \n-
    278 return std::cref(corners_).get()[ i ];
    \n-
    279 }
    \n-
    \n-
    280
    \n-
    282 GlobalCoordinate center () const { return global( refElement().position( 0, 0 ) ); }
    \n-
    283
    \n-
    \n-\n-
    291 {
    \n-
    292 using std::begin;
    \n-
    293
    \n-
    294 auto cit = begin(std::cref(corners_).get());
    \n-\n-
    296 global< false >( topologyId(), std::integral_constant< int, mydimension >(), cit, ctype( 1 ), local, ctype( 1 ), y );
    \n-
    297 return y;
    \n-
    298 }
    \n-
    \n-
    299
    \n-
    \n-
    312 LocalCoordinate local ( const GlobalCoordinate &globalCoord ) const
    \n-
    313 {
    \n-
    314 const ctype tolerance = Traits::tolerance();
    \n-
    315 LocalCoordinate x = refElement().position( 0, 0 );
    \n-\n-
    317 const bool affineMapping = this->affine();
    \n-
    318 do
    \n-
    319 {
    \n-
    320 // Newton's method: DF^n dx^n = F^n, x^{n+1} -= dx^n
    \n-
    321 const GlobalCoordinate dglobal = (*this).global( x ) - globalCoord;
    \n-
    322 const bool invertible =
    \n-
    323 MatrixHelper::template xTRightInvA< mydimension, coorddimension >( jacobianTransposed( x ), dglobal, dx );
    \n-
    324 if( ! invertible )
    \n-
    325 return LocalCoordinate( std::numeric_limits< ctype > :: max() );
    \n-
    326
    \n-
    327 // update x with correction
    \n-
    328 x -= dx;
    \n-
    329
    \n-
    330 // for affine mappings only one iteration is needed
    \n-
    331 if ( affineMapping ) break;
    \n-
    332 } while( dx.two_norm2() > tolerance );
    \n-
    333 return x;
    \n-
    334 }
    \n-
    \n-
    335
    \n-
    \n-\n-
    351 {
    \n-
    352 return MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >( jacobianTransposed( local ) );
    \n-
    353 }
    \n-
    \n-
    354
    \n-
    \n-
    363 Volume volume () const
    \n-
    364 {
    \n-
    365 return integrationElement( refElement().position( 0, 0 ) ) * refElement().volume();
    \n-
    366 }
    \n-
    \n-
    367
    \n-
    \n-\n-
    378 {
    \n-
    379 using std::begin;
    \n-
    380
    \n-\n-
    382 auto cit = begin(std::cref(corners_).get());
    \n-
    383 jacobianTransposed< false >( topologyId(), std::integral_constant< int, mydimension >(), cit, ctype( 1 ), local, ctype( 1 ), jt );
    \n-
    384 return jt;
    \n-
    385 }
    \n-
    \n-
    386
    \n-
    \n-
    393 JacobianInverseTransposed jacobianInverseTransposed ( const LocalCoordinate &local ) const;
    \n-
    394
    \n-
    \n-\n-
    396 {
    \n-
    397 return geometry.refElement();
    \n-
    398 }
    \n-
    \n-
    399
    \n-
    400
    \n-
    \n-\n-
    408 {
    \n-
    409 return jacobianTransposed(local).transposed();
    \n-
    410 }
    \n-
    \n-
    411
    \n-
    \n-\n-
    419 {
    \n-
    420 return jacobianInverseTransposed(local).transposed();
    \n-
    421 }
    \n-
    \n-
    422
    \n-
    423 protected:
    \n-
    424
    \n-
    \n-\n-
    426 {
    \n-
    427 return refElement_;
    \n-
    428 }
    \n-
    \n-
    429
    \n-
    \n-\n-
    431 {
    \n-
    432 return topologyId( std::integral_constant< bool, hasSingleGeometryType >() );
    \n-
    433 }
    \n-
    \n-
    434
    \n-
    435 template< bool add, int dim, class CornerIterator >
    \n-
    \n-
    436 static void global ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n-
    437 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    438 const ctype &rf, GlobalCoordinate &y );
    \n-
    439 template< bool add, class CornerIterator >
    \n-
    \n-
    440 static void global ( TopologyId topologyId, std::integral_constant< int, 0 >,
    \n-
    441 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    442 const ctype &rf, GlobalCoordinate &y );
    \n-
    443
    \n-
    444 template< bool add, int rows, int dim, class CornerIterator >
    \n-
    \n-
    445 static void jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n-
    446 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    447 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt );
    \n-
    448 template< bool add, int rows, class CornerIterator >
    \n-
    \n-
    449 static void jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, 0 >,
    \n-
    450 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    451 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt );
    \n-
    452
    \n-
    453 template< int dim, class CornerIterator >
    \n-
    \n-
    454 static bool affine ( TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt );
    \n-
    455 template< class CornerIterator >
    \n-
    \n-
    456 static bool affine ( TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed &jt );
    \n-
    457
    \n-
    \n-
    458 bool affine ( JacobianTransposed &jacobianT ) const
    \n-
    459 {
    \n-
    460 using std::begin;
    \n-
    461
    \n-
    462 auto cit = begin(std::cref(corners_).get());
    \n-
    463 return affine( topologyId(), std::integral_constant< int, mydimension >(), cit, jacobianT );
    \n-
    464 }
    \n-
    \n-
    465
    \n-
    466 private:
    \n-
    467 // The following methods are needed to convert the return type of topologyId to
    \n-
    468 // unsigned int with g++-4.4. It has problems casting integral_constant to the
    \n-
    469 // integral type.
    \n-
    470 static unsigned int toUnsignedInt(unsigned int i) { return i; }
    \n-
    471 template<unsigned int v>
    \n-
    472 static unsigned int toUnsignedInt(std::integral_constant<unsigned int,v> ) { return v; }
    \n-
    473 TopologyId topologyId ( std::integral_constant< bool, true > ) const { return TopologyId(); }
    \n-
    474 unsigned int topologyId ( std::integral_constant< bool, false > ) const { return refElement().type().id(); }
    \n-
    475
    \n-
    476 ReferenceElement refElement_;
    \n-
    477 typename Traits::template CornerStorage< mydimension, coorddimension >::Type corners_;
    \n-
    478 };
    \n-
    479
    \n-
    480
    \n-
    481
    \n-
    482 // MultiLinearGeometry::JacobianInverseTransposed
    \n-
    483 // ----------------------------------------------
    \n-
    484
    \n-
    485 template< class ct, int mydim, int cdim, class Traits >
    \n-
    \n-
    486 class MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
    \n-
    487 : public FieldMatrix< ctype, coorddimension, mydimension >
    \n-
    488 {
    \n-
    489 typedef FieldMatrix< ctype, coorddimension, mydimension > Base;
    \n-
    490
    \n-
    491 public:
    \n-
    \n-
    492 void setup ( const JacobianTransposed &jt )
    \n-
    493 {
    \n-
    494 detInv_ = MatrixHelper::template rightInvA< mydimension, coorddimension >( jt, static_cast< Base & >( *this ) );
    \n-
    495 }
    \n-
    \n-
    496
    \n-
    \n-\n-
    498 {
    \n-
    499 detInv_ = MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >( jt );
    \n-
    500 }
    \n-
    \n-
    501
    \n-
    502 ctype det () const { return ctype( 1 ) / detInv_; }
    \n-
    503 ctype detInv () const { return detInv_; }
    \n-
    504
    \n-
    505 private:
    \n-
    506 ctype detInv_;
    \n-
    507 };
    \n-
    \n-
    508
    \n-
    509
    \n-
    510
    \n-
    523 template< class ct, int mydim, int cdim, class Traits = MultiLinearGeometryTraits< ct > >
    \n-
    \n-\n-
    525 : public MultiLinearGeometry< ct, mydim, cdim, Traits >
    \n-
    526 {
    \n-\n-\n-
    529
    \n-
    530 protected:
    \n-\n-
    532
    \n-
    533 public:
    \n-\n-
    535
    \n-
    536 typedef typename Base::ctype ctype;
    \n-
    537
    \n-
    538 using Base::mydimension;
    \n-\n-
    540
    \n-\n-\n-
    543 typedef typename Base::Volume Volume;
    \n-
    544
    \n-\n-\n-
    547 typedef typename Base::Jacobian Jacobian;
    \n-\n-
    549
    \n-
    550 template< class CornerStorage >
    \n-
    \n-
    551 CachedMultiLinearGeometry ( const ReferenceElement &referenceElement, const CornerStorage &cornerStorage )
    \n-
    552 : Base( referenceElement, cornerStorage ),
    \n-
    553 affine_( Base::affine( jacobianTransposed_ ) ),
    \n-
    554 jacobianInverseTransposedComputed_( false ),
    \n-
    555 integrationElementComputed_( false )
    \n-
    556 {}
    \n-
    \n-
    557
    \n-
    558 template< class CornerStorage >
    \n-
    \n-
    559 CachedMultiLinearGeometry ( Dune::GeometryType gt, const CornerStorage &cornerStorage )
    \n-
    560 : Base( gt, cornerStorage ),
    \n-
    561 affine_( Base::affine( jacobianTransposed_ ) ),
    \n-
    562 jacobianInverseTransposedComputed_( false ),
    \n-
    563 integrationElementComputed_( false )
    \n-
    564 {}
    \n-
    \n-
    565
    \n-
    567 bool affine () const { return affine_; }
    \n-
    568
    \n-
    569 using Base::corner;
    \n-
    570
    \n-
    572 GlobalCoordinate center () const { return global( refElement().position( 0, 0 ) ); }
    \n-
    573
    \n-
    \n-\n-
    581 {
    \n-
    582 if( affine() )
    \n-
    583 {
    \n-\n-
    585 jacobianTransposed_.umtv( local, global );
    \n-
    586 return global;
    \n-
    587 }
    \n-
    588 else
    \n-
    589 return Base::global( local );
    \n-
    590 }
    \n-
    \n-
    591
    \n-
    \n-\n-
    605 {
    \n-
    606 if( affine() )
    \n-
    607 {
    \n-\n-
    609 if( jacobianInverseTransposedComputed_ )
    \n-
    610 jacobianInverseTransposed_.mtv( global - corner( 0 ), local );
    \n-
    611 else
    \n-
    612 MatrixHelper::template xTRightInvA< mydimension, coorddimension >( jacobianTransposed_, global - corner( 0 ), local );
    \n-
    613 return local;
    \n-
    614 }
    \n-
    615 else
    \n-
    616 return Base::local( global );
    \n-
    617 }
    \n-
    \n-
    618
    \n-
    \n-\n-
    634 {
    \n-
    635 if( affine() )
    \n-
    636 {
    \n-
    637 if( !integrationElementComputed_ )
    \n-
    638 {
    \n-
    639 jacobianInverseTransposed_.setupDeterminant( jacobianTransposed_ );
    \n-
    640 integrationElementComputed_ = true;
    \n-
    641 }
    \n-
    642 return jacobianInverseTransposed_.detInv();
    \n-
    643 }
    \n-
    644 else
    \n-\n-
    646 }
    \n-
    \n-
    647
    \n-
    \n-
    649 Volume volume () const
    \n-
    650 {
    \n-
    651 if( affine() )
    \n-
    652 return integrationElement( refElement().position( 0, 0 ) ) * refElement().volume();
    \n-
    653 else
    \n-
    654 return Base::volume();
    \n-
    655 }
    \n-
    \n-
    656
    \n-
    \n-\n-
    667 {
    \n-
    668 if( affine() )
    \n-
    669 return jacobianTransposed_;
    \n-
    670 else
    \n-\n-
    672 }
    \n-
    \n-
    673
    \n-
    \n-\n-
    681 {
    \n-
    682 if( affine() )
    \n-
    683 {
    \n-
    684 if( !jacobianInverseTransposedComputed_ )
    \n-
    685 {
    \n-
    686 jacobianInverseTransposed_.setup( jacobianTransposed_ );
    \n-
    687 jacobianInverseTransposedComputed_ = true;
    \n-
    688 integrationElementComputed_ = true;
    \n-
    689 }
    \n-
    690 return jacobianInverseTransposed_;
    \n-
    691 }
    \n-
    692 else
    \n-\n-
    694 }
    \n-
    \n-
    695
    \n-
    \n-\n-
    703 {
    \n-
    704 return jacobianTransposed(local).transposed();
    \n-
    705 }
    \n-
    \n-
    706
    \n-
    \n-\n-
    714 {
    \n-
    715 return jacobianInverseTransposed(local).transposed();
    \n-
    716 }
    \n-
    \n-
    717
    \n-
    718 protected:
    \n-
    719 using Base::refElement;
    \n-
    720
    \n-
    721 private:
    \n-
    722 mutable JacobianTransposed jacobianTransposed_;
    \n-
    723 mutable JacobianInverseTransposed jacobianInverseTransposed_;
    \n-
    724
    \n-
    725 mutable bool affine_ : 1;
    \n-
    726
    \n-
    727 mutable bool jacobianInverseTransposedComputed_ : 1;
    \n-
    728 mutable bool integrationElementComputed_ : 1;
    \n-
    729 };
    \n-
    \n-
    730
    \n-
    731
    \n-
    732
    \n-
    733 // Implementation of MultiLinearGeometry
    \n-
    734 // -------------------------------------
    \n-
    735
    \n-
    736 template< class ct, int mydim, int cdim, class Traits >
    \n-
    737 inline typename MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed
    \n-
    \n-\n-
    739 {
    \n-\n-
    741 jit.setup( jacobianTransposed( local ) );
    \n-
    742 return jit;
    \n-
    743 }
    \n-
    \n-
    744
    \n-
    745
    \n-
    746 template< class ct, int mydim, int cdim, class Traits >
    \n-
    747 template< bool add, int dim, class CornerIterator >
    \n-\n-
    \n-
    749 ::global ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n-
    750 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    751 const ctype &rf, GlobalCoordinate &y )
    \n-
    752 {
    \n-
    753 const ctype xn = df*x[ dim-1 ];
    \n-
    754 const ctype cxn = ctype( 1 ) - xn;
    \n-
    755
    \n-
    756 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n-
    757 {
    \n-
    758 // apply (1-xn) times mapping for bottom
    \n-
    759 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf*cxn, y );
    \n-
    760 // apply xn times mapping for top
    \n-
    761 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf*xn, y );
    \n-
    762 }
    \n-
    763 else
    \n-
    764 {
    \n-
    765 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension, mydimension-dim ) );
    \n-
    766 // apply (1-xn) times mapping for bottom (with argument x/(1-xn))
    \n-
    767 if( cxn > Traits::tolerance() || cxn < -Traits::tolerance() )
    \n-
    768 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df/cxn, x, rf*cxn, y );
    \n-
    769 else
    \n-
    770 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, ctype( 0 ), y );
    \n-
    771 // apply xn times the tip
    \n-
    772 y.axpy( rf*xn, *cit );
    \n-
    773 ++cit;
    \n-
    774 }
    \n-
    775 }
    \n-
    \n-
    776
    \n-
    777 template< class ct, int mydim, int cdim, class Traits >
    \n-
    778 template< bool add, class CornerIterator >
    \n-\n-
    \n-
    780 ::global ( TopologyId, std::integral_constant< int, 0 >,
    \n-
    781 CornerIterator &cit, const ctype &, const LocalCoordinate &,
    \n-
    782 const ctype &rf, GlobalCoordinate &y )
    \n-
    783 {
    \n-
    784 const GlobalCoordinate &origin = *cit;
    \n-
    785 ++cit;
    \n-
    786 for( int i = 0; i < coorddimension; ++i )
    \n-
    787 y[ i ] = (add ? y[ i ] + rf*origin[ i ] : rf*origin[ i ]);
    \n-
    788 }
    \n-
    \n-
    789
    \n-
    790
    \n-
    791 template< class ct, int mydim, int cdim, class Traits >
    \n-
    792 template< bool add, int rows, int dim, class CornerIterator >
    \n-\n-
    \n-
    794 ::jacobianTransposed ( TopologyId topologyId, std::integral_constant< int, dim >,
    \n-
    795 CornerIterator &cit, const ctype &df, const LocalCoordinate &x,
    \n-
    796 const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt )
    \n-
    797 {
    \n-
    798 assert( rows >= dim );
    \n-
    799
    \n-
    800 const ctype xn = df*x[ dim-1 ];
    \n-
    801 const ctype cxn = ctype( 1 ) - xn;
    \n-
    802
    \n-
    803 auto cit2( cit );
    \n-
    804 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n-
    805 {
    \n-
    806 // apply (1-xn) times Jacobian for bottom
    \n-
    807 jacobianTransposed< add >( topologyId, std::integral_constant< int, dim-1 >(), cit2, df, x, rf*cxn, jt );
    \n-
    808 // apply xn times Jacobian for top
    \n-
    809 jacobianTransposed< true >( topologyId, std::integral_constant< int, dim-1 >(), cit2, df, x, rf*xn, jt );
    \n-
    810 // compute last row as difference between top value and bottom value
    \n-
    811 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, -rf, jt[ dim-1 ] );
    \n-
    812 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit, df, x, rf, jt[ dim-1 ] );
    \n-
    813 }
    \n-
    814 else
    \n-
    815 {
    \n-
    816 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension, mydimension-dim ) );
    \n-
    817 /*
    \n-
    818 * In the pyramid case, we need a transformation Tb: B -> R^n for the
    \n-
    819 * base B \\subset R^{n-1}. The pyramid transformation is then defined as
    \n-
    820 * T: P \\subset R^n -> R^n
    \n-
    821 * (x, xn) |-> (1-xn) Tb(x*) + xn t (x \\in R^{n-1}, xn \\in R)
    \n-
    822 * with the tip of the pyramid mapped to t and x* = x/(1-xn)
    \n-
    823 * the projection of (x,xn) onto the base.
    \n-
    824 *
    \n-
    825 * For the Jacobi matrix DT we get
    \n-
    826 * DT = ( A | b )
    \n-
    827 * with A = DTb(x*) (n x n-1 matrix)
    \n-
    828 * and b = dT/dxn (n-dim column vector).
    \n-
    829 * Furthermore
    \n-
    830 * b = -Tb(x*) + t + \\sum_i dTb/dx_i(x^*) x_i/(1-xn)
    \n-
    831 *
    \n-
    832 * Note that both A and b are not defined in the pyramid tip (x=0, xn=1)!
    \n-
    833 * Indeed for B the unit square, Tb mapping B to the quadrilateral given
    \n-
    834 * by the vertices (0,0,0), (2,0,0), (0,1,0), (1,1,0) and t=(0,0,1), we get
    \n-
    835 *
    \n-
    836 * T(x,y,xn) = ( x(2-y/(1-xn)), y, xn )
    \n-
    837 * / 2-y/(1-xn) -x 0 \\
    \n-
    838 * DT(x,y,xn) = | 0 1 0 |
    \n-
    839 * \\ 0 0 1 /
    \n-
    840 * which is not continuous for xn -> 1, choose for example
    \n-
    841 * x=0, y=1-xn, xn -> 1 --> DT -> diag(1,1,1)
    \n-
    842 * x=1-xn, y=0, xn -> 1 --> DT -> diag(2,1,1)
    \n-
    843 *
    \n-
    844 * However, for Tb affine-linear, Tb(y) = My + y0, DTb = M:
    \n-
    845 * A = M
    \n-
    846 * b = -M x* - y0 + t + \\sum_i M_i x_i/(1-xn)
    \n-
    847 * = -M x* - y0 + t + M x*
    \n-
    848 * = -y0 + t
    \n-
    849 * which is continuous for xn -> 1. Note that this b is also given by
    \n-
    850 * b = -Tb(0) + t + \\sum_i dTb/dx_i(0) x_i/1
    \n-
    851 * that is replacing x* by 1 and 1-xn by 1 in the formular above.
    \n-
    852 *
    \n-
    853 * For xn -> 1, we can thus set x*=0, "1-xn"=1 (or anything != 0) and get
    \n-
    854 * the right result in case Tb is affine-linear.
    \n-
    855 */
    \n-
    856
    \n-
    857 /* The second case effectively results in x* = 0 */
    \n-
    858 ctype dfcxn = (cxn > Traits::tolerance() || cxn < -Traits::tolerance()) ? ctype(df / cxn) : ctype(0);
    \n-
    859
    \n-
    860 // initialize last row
    \n-
    861 // b = -Tb(x*)
    \n-
    862 // (b = -Tb(0) = -y0 in case xn -> 1 and Tb affine-linear)
    \n-
    863 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, dfcxn, x, -rf, jt[ dim-1 ] );
    \n-
    864 // b += t
    \n-
    865 jt[ dim-1 ].axpy( rf, *cit );
    \n-
    866 ++cit;
    \n-
    867 // apply Jacobian for bottom (with argument x/(1-xn)) and correct last row
    \n-
    868 if( add )
    \n-
    869 {
    \n-
    870 FieldMatrix< ctype, dim-1, coorddimension > jt2;
    \n-
    871 // jt2 = dTb/dx_i(x*)
    \n-
    872 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-1 >(), cit2, dfcxn, x, rf, jt2 );
    \n-
    873 // A = dTb/dx_i(x*) (jt[j], j=0..dim-1)
    \n-
    874 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn) (jt[dim-1])
    \n-
    875 // (b += 0 in case xn -> 1)
    \n-
    876 for( int j = 0; j < dim-1; ++j )
    \n-
    877 {
    \n-
    878 jt[ j ] += jt2[ j ];
    \n-
    879 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt2[ j ] );
    \n-
    880 }
    \n-
    881 }
    \n-
    882 else
    \n-
    883 {
    \n-
    884 // jt = dTb/dx_i(x*)
    \n-
    885 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-1 >(), cit2, dfcxn, x, rf, jt );
    \n-
    886 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn)
    \n-
    887 for( int j = 0; j < dim-1; ++j )
    \n-
    888 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt[ j ] );
    \n-
    889 }
    \n-
    890 }
    \n-
    891 }
    \n-
    \n-
    892
    \n-
    893 template< class ct, int mydim, int cdim, class Traits >
    \n-
    894 template< bool add, int rows, class CornerIterator >
    \n-\n-
    \n-
    896 ::jacobianTransposed ( TopologyId, std::integral_constant< int, 0 >,
    \n-
    897 CornerIterator &cit, const ctype &, const LocalCoordinate &,
    \n-
    898 const ctype &, FieldMatrix< ctype, rows, cdim > & )
    \n-
    899 {
    \n-
    900 ++cit;
    \n-
    901 }
    \n-
    \n-
    902
    \n-
    903
    \n-
    904
    \n-
    905 template< class ct, int mydim, int cdim, class Traits >
    \n-
    906 template< int dim, class CornerIterator >
    \n-\n-
    \n-
    908 ::affine ( TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt )
    \n-
    909 {
    \n-
    910 const GlobalCoordinate &orgBottom = *cit;
    \n-
    911 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jt ) )
    \n-
    912 return false;
    \n-
    913 const GlobalCoordinate &orgTop = *cit;
    \n-
    914
    \n-
    915 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim ) )
    \n-
    916 {
    \n-
    917 JacobianTransposed jtTop;
    \n-
    918 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jtTop ) )
    \n-
    919 return false;
    \n-
    920
    \n-
    921 // check whether both jacobians are identical
    \n-
    922 ctype norm( 0 );
    \n-
    923 for( int i = 0; i < dim-1; ++i )
    \n-
    924 norm += (jtTop[ i ] - jt[ i ]).two_norm2();
    \n-
    925 if( norm >= Traits::tolerance() )
    \n-
    926 return false;
    \n-
    927 }
    \n-
    928 else
    \n-
    929 ++cit;
    \n-
    930 jt[ dim-1 ] = orgTop - orgBottom;
    \n-
    931 return true;
    \n-
    932 }
    \n-
    \n-
    933
    \n-
    934 template< class ct, int mydim, int cdim, class Traits >
    \n-
    935 template< class CornerIterator >
    \n-\n-
    \n-
    937 ::affine ( TopologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed & )
    \n-
    938 {
    \n-
    939 ++cit;
    \n-
    940 return true;
    \n-
    941 }
    \n-
    \n-
    \n-
    942
    \n-
    943} // namespace Dune
    \n-
    944
    \n-
    945#endif // #ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH
    \n-
    \n-
    \n-
    \n-
    \n-
    \n-
    \n-
    \n-
    An implementation of the Geometry interface for affine geometries.
    \n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    Definition affinegeometry.hh:21
    \n-
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n-
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n-
    default traits class for MultiLinearGeometry
    Definition multilineargeometry.hh:39
    \n-
    Impl::FieldMatrixHelper< ct > MatrixHelper
    helper structure containing some matrix routines
    Definition multilineargeometry.hh:58
    \n-
    static ct tolerance()
    tolerance to numerical algorithms
    Definition multilineargeometry.hh:61
    \n-
    template specifying the storage for the corners
    Definition multilineargeometry.hh:129
    \n-
    std::vector< FieldVector< ct, cdim > > Type
    Definition multilineargeometry.hh:130
    \n-
    will there be only one geometry type for a dimension?
    Definition multilineargeometry.hh:148
    \n-
    static const unsigned int topologyId
    Definition multilineargeometry.hh:150
    \n-
    static const bool v
    Definition multilineargeometry.hh:149
    \n-
    generic geometry implementation based on corner coordinates
    Definition multilineargeometry.hh:181
    \n-
    static void global(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, GlobalCoordinate &y)
    Definition multilineargeometry.hh:749
    \n-
    static const int mydimension
    geometry dimension
    Definition multilineargeometry.hh:189
    \n-
    Dune::GeometryType type() const
    obtain the name of the reference element
    Definition multilineargeometry.hh:269
    \n-
    Traits::MatrixHelper MatrixHelper
    Definition multilineargeometry.hh:225
    \n-
    FieldVector< ctype, coorddimension > GlobalCoordinate
    type of global coordinates
    Definition multilineargeometry.hh:196
    \n-
    static void jacobianTransposed(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)
    Definition multilineargeometry.hh:896
    \n-
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian
    Definition multilineargeometry.hh:377
    \n-
    ReferenceElement refElement() const
    Definition multilineargeometry.hh:425
    \n-
    GlobalCoordinate global(const LocalCoordinate &local) const
    evaluate the mapping
    Definition multilineargeometry.hh:290
    \n-
    GlobalCoordinate center() const
    obtain the centroid of the mapping's image
    Definition multilineargeometry.hh:282
    \n-
    GlobalCoordinate corner(int i) const
    obtain coordinates of the i-th corner
    Definition multilineargeometry.hh:275
    \n-
    Dune::ReferenceElements< ctype, mydimension > ReferenceElements
    Definition multilineargeometry.hh:214
    \n-
    ct ctype
    coordinate type
    Definition multilineargeometry.hh:186
    \n-
    static void jacobianTransposed(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)
    Definition multilineargeometry.hh:794
    \n-
    static const int coorddimension
    coordinate dimension
    Definition multilineargeometry.hh:191
    \n-
    int corners() const
    obtain number of corners of the corresponding reference element
    Definition multilineargeometry.hh:272
    \n-
    TopologyId topologyId() const
    Definition multilineargeometry.hh:430
    \n-
    friend ReferenceElement referenceElement(const MultiLinearGeometry &geometry)
    Definition multilineargeometry.hh:395
    \n-
    LocalCoordinate local(const GlobalCoordinate &globalCoord) const
    evaluate the inverse mapping
    Definition multilineargeometry.hh:312
    \n-
    static void global(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype &rf, GlobalCoordinate &y)
    Definition multilineargeometry.hh:780
    \n-
    Volume volume() const
    obtain the volume of the mapping's image
    Definition multilineargeometry.hh:363
    \n-
    FieldVector< ctype, mydimension > LocalCoordinate
    type of local coordinates
    Definition multilineargeometry.hh:194
    \n-
    MultiLinearGeometry(const ReferenceElement &refElement, const Corners &corners)
    constructor
    Definition multilineargeometry.hh:239
    \n-
    static bool affine(TopologyId topologyId, std::integral_constant< int, 0 >, CornerIterator &cit, JacobianTransposed &jt)
    Definition multilineargeometry.hh:937
    \n-
    std::conditional< hasSingleGeometryType, std::integral_constant< unsignedint, Traits::templatehasSingleGeometryType< mydimension >::topologyId >, unsignedint >::type TopologyId
    Definition multilineargeometry.hh:226
    \n-
    ctype Volume
    type of volume
    Definition multilineargeometry.hh:198
    \n-
    static bool affine(TopologyId topologyId, std::integral_constant< int, dim >, CornerIterator &cit, JacobianTransposed &jt)
    Definition multilineargeometry.hh:908
    \n-
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Obtain the Jacobian's inverse.
    Definition multilineargeometry.hh:418
    \n-
    MultiLinearGeometry(Dune::GeometryType gt, const Corners &corners)
    constructor
    Definition multilineargeometry.hh:255
    \n-
    FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed
    type of jacobian transposed
    Definition multilineargeometry.hh:201
    \n-
    ReferenceElements::ReferenceElement ReferenceElement
    type of reference element
    Definition multilineargeometry.hh:219
    \n-
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian's inverse
    Definition multilineargeometry.hh:738
    \n-
    FieldMatrix< ctype, coorddimension, mydimension > Jacobian
    Type for the Jacobian matrix.
    Definition multilineargeometry.hh:207
    \n-
    bool affine() const
    is this mapping affine?
    Definition multilineargeometry.hh:262
    \n-
    FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse
    Type for the inverse Jacobian matrix.
    Definition multilineargeometry.hh:210
    \n-
    bool affine(JacobianTransposed &jacobianT) const
    Definition multilineargeometry.hh:458
    \n-
    Volume integrationElement(const LocalCoordinate &local) const
    obtain the integration element
    Definition multilineargeometry.hh:350
    \n-
    Jacobian jacobian(const LocalCoordinate &local) const
    Obtain the Jacobian.
    Definition multilineargeometry.hh:407
    \n-
    Definition multilineargeometry.hh:488
    \n-
    void setup(const JacobianTransposed &jt)
    Definition multilineargeometry.hh:492
    \n-
    ctype det() const
    Definition multilineargeometry.hh:502
    \n-
    ctype detInv() const
    Definition multilineargeometry.hh:503
    \n-
    void setupDeterminant(const JacobianTransposed &jt)
    Definition multilineargeometry.hh:497
    \n-
    Implement a MultiLinearGeometry with additional caching.
    Definition multilineargeometry.hh:526
    \n-
    GlobalCoordinate global(const LocalCoordinate &local) const
    evaluate the mapping
    Definition multilineargeometry.hh:580
    \n-
    Base::ReferenceElement ReferenceElement
    Definition multilineargeometry.hh:534
    \n-
    bool affine() const
    is this mapping affine?
    Definition multilineargeometry.hh:567
    \n-
    CachedMultiLinearGeometry(const ReferenceElement &referenceElement, const CornerStorage &cornerStorage)
    Definition multilineargeometry.hh:551
    \n-
    ReferenceElement refElement() const
    Definition multilineargeometry.hh:425
    \n-
    LocalCoordinate local(const GlobalCoordinate &global) const
    evaluate the inverse mapping
    Definition multilineargeometry.hh:604
    \n-
    Base::MatrixHelper MatrixHelper
    Definition multilineargeometry.hh:531
    \n-
    Base::LocalCoordinate LocalCoordinate
    Definition multilineargeometry.hh:541
    \n-
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Obtain the Jacobian's inverse.
    Definition multilineargeometry.hh:713
    \n-
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian
    Definition multilineargeometry.hh:666
    \n-
    GlobalCoordinate corner(int i) const
    obtain coordinates of the i-th corner
    Definition multilineargeometry.hh:275
    \n-
    Volume volume() const
    obtain the volume of the mapping's image
    Definition multilineargeometry.hh:649
    \n-
    CachedMultiLinearGeometry(Dune::GeometryType gt, const CornerStorage &cornerStorage)
    Definition multilineargeometry.hh:559
    \n-
    ctype integrationElement(const LocalCoordinate &local) const
    obtain the integration element
    Definition multilineargeometry.hh:633
    \n-
    Base::ctype ctype
    Definition multilineargeometry.hh:536
    \n-
    Jacobian jacobian(const LocalCoordinate &local) const
    Obtain the Jacobian.
    Definition multilineargeometry.hh:702
    \n-
    Base::JacobianInverseTransposed JacobianInverseTransposed
    Definition multilineargeometry.hh:546
    \n-
    Base::JacobianTransposed JacobianTransposed
    Definition multilineargeometry.hh:545
    \n-
    Base::JacobianInverse JacobianInverse
    Definition multilineargeometry.hh:548
    \n-
    Base::Jacobian Jacobian
    Definition multilineargeometry.hh:547
    \n-
    Base::Volume Volume
    Definition multilineargeometry.hh:543
    \n-
    Base::GlobalCoordinate GlobalCoordinate
    Definition multilineargeometry.hh:542
    \n-
    GlobalCoordinate center() const
    obtain the centroid of the mapping's image
    Definition multilineargeometry.hh:572
    \n-
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    obtain the transposed of the Jacobian's inverse
    Definition multilineargeometry.hh:680
    \n-
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    239// The interface (template<...> class StaticRefinement) is not included here
    \n+
    240// since it derives from parts which I consider implementation. Look
    \n+
    241// into refinement/base.cc if the documentation is above is not enough.
    \n+
    242#include "refinement/base.cc"
    \n+
    243
    \n+
    244#include "refinement/hcube.cc"
    \n+
    245#include "refinement/simplex.cc"
    \n+\n+\n+\n+
    249
    \n+
    250#endif // DUNE_GEOMETRY_REFINEMENT_HH
    \n+
    This file contains the parts independent of a particular Refinement implementation.
    \n+\n+\n+
    This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> trian...
    \n+
    This file contains the Refinement implementation for simplices (triangles, tetrahedrons....
    \n+
    This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons,...
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,1022 +1,44 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-multilineargeometry.hh\n+refinement.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n-6#define DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n+5#ifndef DUNE_GEOMETRY_REFINEMENT_HH\n+6#define DUNE_GEOMETRY_REFINEMENT_HH\n 7\n-8#include \n-9#include \n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17\n-18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n-19#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n-20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-21\n-22namespace _\bD_\bu_\bn_\be\n-23{\n-24\n-25 // MultiLinearGeometryTraits\n-26 // -------------------------\n-27\n-37 template< class ct >\n-_\b3_\b8 struct _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs\n-39 {\n-_\b5_\b8 typedef Impl::FieldMatrixHelper< ct > _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n-59\n-_\b6_\b1 static ct _\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be () { return ct( 16 ) * std::numeric_limits< ct >::\n-epsilon(); }\n-62\n-127 template< int mydim, int cdim >\n-_\b1_\b2_\b8 struct _\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be\n-129 {\n-_\b1_\b3_\b0 typedef std::vector< FieldVector< ct, cdim > > _\bT_\by_\bp_\be;\n-131 };\n-132\n-146 template< int dim >\n-_\b1_\b4_\b7 struct _\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-148 {\n-_\b1_\b4_\b9 static const bool _\bv = false;\n-_\b1_\b5_\b0 static const unsigned int _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd = ~0u;\n-151 };\n-152 };\n-153\n-154\n-155\n-156 // MultiLinearGeometry\n-157 // -------------------\n-158\n-179 template< class ct, int mydim, int cdim, class Traits =\n-MultiLinearGeometryTraits< ct > >\n-_\b1_\b8_\b0 class _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-181 {\n-182 typedef _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> This;\n-183\n-184 public:\n-_\b1_\b8_\b6 typedef ct _\bc_\bt_\by_\bp_\be;\n-187\n-_\b1_\b8_\b9 static const int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn= mydim;\n-_\b1_\b9_\b1 static const int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = cdim;\n-192\n-_\b1_\b9_\b4 typedef FieldVector< ctype, mydimension > _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-_\b1_\b9_\b6 typedef FieldVector< ctype, coorddimension > _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-_\b1_\b9_\b8 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n-199\n-_\b2_\b0_\b1 typedef FieldMatrix< ctype, mydimension, coorddimension >\n-_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-202\n-204 class _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-205\n-_\b2_\b0_\b7 typedef FieldMatrix< ctype, coorddimension, mydimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn;\n-208\n-_\b2_\b1_\b0 typedef FieldMatrix< ctype, mydimension, coorddimension > _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be;\n-211\n-212 protected:\n-213\n-_\b2_\b1_\b4 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b> _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs;\n-215\n-216 public:\n-217\n-_\b2_\b1_\b9 typedef typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-220\n-221 private:\n-222 static const bool hasSingleGeometryType = Traits::template\n-hasSingleGeometryType< mydimension >::v;\n-223\n-224 protected:\n-_\b2_\b2_\b5 typedef typename Traits::MatrixHelper _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n-_\b2_\b2_\b6 typedef typename std::conditional< hasSingleGeometryType, std::\n-integral_constant< unsigned int, Traits::template hasSingleGeometryType<\n-mydimension >::topologyId >, unsigned int >_\b:_\b:_\bt_\by_\bp_\be _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd;\n-227\n-228 public:\n-238 template< class Corners >\n-_\b2_\b3_\b9 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt,\n-240 const Corners &_\bc_\bo_\br_\bn_\be_\br_\bs )\n-241 : refElement_( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt ),\n-242 corners_( _\bc_\bo_\br_\bn_\be_\br_\bs )\n-243 {}\n-244\n-254 template< class Corners >\n-_\b2_\b5_\b5 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt,\n-256 const Corners &_\bc_\bo_\br_\bn_\be_\br_\bs )\n-257 : refElement_( _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general( gt ) ),\n-258 corners_( _\bc_\bo_\br_\bn_\be_\br_\bs )\n-259 {}\n-260\n-_\b2_\b6_\b2 bool _\ba_\bf_\bf_\bi_\bn_\be () const\n-263 {\n-264 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jt;\n-265 return _\ba_\bf_\bf_\bi_\bn_\be( jt );\n-266 }\n-267\n-_\b2_\b6_\b9 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const { return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be( toUnsignedInt\n-(_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd()), _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ); }\n-270\n-_\b2_\b7_\b2 int _\bc_\bo_\br_\bn_\be_\br_\bs () const { return _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().size( _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn ); }\n-273\n-_\b2_\b7_\b5 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br ( int i ) const\n-276 {\n-277 assert( (i >= 0) && (i < _\bc_\bo_\br_\bn_\be_\br_\bs()) );\n-278 return std::cref(corners_).get()[ i ];\n-279 }\n-280\n-_\b2_\b8_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const { return _\bg_\bl_\bo_\bb_\ba_\bl( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0,\n-0 ) ); }\n-283\n-_\b2_\b9_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n-291 {\n-292 using std::begin;\n-293\n-294 auto cit = begin(std::cref(corners_).get());\n-295 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be y;\n-296 global< false >( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int, mydimension >\n-(), cit, _\bc_\bt_\by_\bp_\be( 1 ), _\bl_\bo_\bc_\ba_\bl, _\bc_\bt_\by_\bp_\be( 1 ), y );\n-297 return y;\n-298 }\n-299\n-_\b3_\b1_\b2 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl ( const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &globalCoord ) const\n-313 {\n-314 const _\bc_\bt_\by_\bp_\be tolerance = Traits::tolerance();\n-315 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be x = _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 );\n-316 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be dx;\n-317 const bool affineMapping = this->_\ba_\bf_\bf_\bi_\bn_\be();\n-318 do\n-319 {\n-320 // Newton's method: DF^n dx^n = F^n, x^{n+1} -= dx^n\n-321 const GlobalCoordinate dglobal = (*this).global( x ) - globalCoord;\n-322 const bool invertible =\n-323 MatrixHelper::template xTRightInvA< mydimension, coorddimension >\n-( _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( x ), dglobal, dx );\n-324 if( ! invertible )\n-325 return _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be( std::numeric_limits< ctype > :: max() );\n-326\n-327 // update x with correction\n-328 x -= dx;\n-329\n-330 // for affine mappings only one iteration is needed\n-331 if ( affineMapping ) break;\n-332 } while( dx.two_norm2() > tolerance );\n-333 return x;\n-334 }\n-335\n-_\b3_\b5_\b0 _\bV_\bo_\bl_\bu_\bm_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n-351 {\n-352 return MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >\n-( _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl ) );\n-353 }\n-354\n-_\b3_\b6_\b3 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be () const\n-364 {\n-365 return _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 ) ) * _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n-().volume();\n-366 }\n-367\n-_\b3_\b7_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl )\n-const\n-378 {\n-379 using std::begin;\n-380\n-381 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jt;\n-382 auto cit = begin(std::cref(corners_).get());\n-383 jacobianTransposed< false >( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int,\n-mydimension >(), cit, _\bc_\bt_\by_\bp_\be( 1 ), _\bl_\bo_\bc_\ba_\bl, _\bc_\bt_\by_\bp_\be( 1 ), jt );\n-384 return jt;\n-385 }\n-386\n-_\b3_\b9_\b3 JacobianInverseTransposed _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-&_\bl_\bo_\bc_\ba_\bl ) const;\n-394\n-_\b3_\b9_\b5 friend _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-&geometry )\n-396 {\n-397 return geometry._\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt();\n-398 }\n-399\n-400\n-_\b4_\b0_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-408 {\n-409 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n-410 }\n-411\n-_\b4_\b1_\b8 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-419 {\n-420 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n-421 }\n-422\n-423 protected:\n-424\n-_\b4_\b2_\b5 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt () const\n-426 {\n-427 return refElement_;\n-428 }\n-429\n-_\b4_\b3_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd () const\n-431 {\n-432 return _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd( std::integral_constant< bool, hasSingleGeometryType >()\n-);\n-433 }\n-434\n-435 template< bool add, int dim, class CornerIterator >\n-_\b4_\b3_\b6 static void _\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int,\n-dim >,\n-437 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-438 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y );\n-439 template< bool add, class CornerIterator >\n-_\b4_\b4_\b0 static void _\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0\n->,\n-441 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-442 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y );\n-443\n-444 template< bool add, int rows, int dim, class CornerIterator >\n-_\b4_\b4_\b5 static void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::\n-integral_constant< int, dim >,\n-446 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-447 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt );\n-448 template< bool add, int rows, class CornerIterator >\n-_\b4_\b4_\b9 static void _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::\n-integral_constant< int, 0 >,\n-450 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-451 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt );\n-452\n-453 template< int dim, class CornerIterator >\n-_\b4_\b5_\b4 static bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int,\n-dim >, CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt );\n-455 template< class CornerIterator >\n-_\b4_\b5_\b6 static bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0\n->, CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt );\n-457\n-_\b4_\b5_\b8 bool _\ba_\bf_\bf_\bi_\bn_\be ( _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jacobianT ) const\n-459 {\n-460 using std::begin;\n-461\n-462 auto cit = begin(std::cref(corners_).get());\n-463 return _\ba_\bf_\bf_\bi_\bn_\be( _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(), std::integral_constant< int, mydimension >(),\n-cit, jacobianT );\n-464 }\n-465\n-466 private:\n-467 // The following methods are needed to convert the return type of\n-topologyId to\n-468 // unsigned int with g++-4.4. It has problems casting integral_constant to\n-the\n-469 // integral type.\n-470 static unsigned int toUnsignedInt(unsigned int i) { return i; }\n-471 template\n-472 static unsigned int toUnsignedInt(std::integral_constant )\n-{ return v; }\n-473 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd ( std::integral_constant< bool, true > ) const\n-{ return _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd(); }\n-474 unsigned int _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd ( std::integral_constant< bool, false > ) const\n-{ return _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().type().id(); }\n-475\n-476 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt refElement_;\n-477 typename Traits::template CornerStorage< mydimension, coorddimension >::\n-Type corners_;\n-478 };\n-479\n-480\n-481\n-482 // MultiLinearGeometry::JacobianInverseTransposed\n-483 // ----------------------------------------------\n-484\n-485 template< class ct, int mydim, int cdim, class Traits >\n-_\b4_\b8_\b6 class _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by< ct, mydim, cdim, Traits >::\n-_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-487 : public FieldMatrix< ctype, coorddimension, mydimension >\n-488 {\n-489 typedef FieldMatrix< ctype, coorddimension, mydimension > Base;\n-490\n-491 public:\n-_\b4_\b9_\b2 void _\bs_\be_\bt_\bu_\bp ( const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n-493 {\n-494 detInv_ = MatrixHelper::template rightInvA< mydimension, coorddimension >\n-( jt, static_cast< Base & >( *this ) );\n-495 }\n-496\n-_\b4_\b9_\b7 void _\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt ( const _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n-498 {\n-499 detInv_ = MatrixHelper::template sqrtDetAAT< mydimension, coorddimension >\n-( jt );\n-500 }\n-501\n-_\b5_\b0_\b2 _\bc_\bt_\by_\bp_\be _\bd_\be_\bt () const { return _\bc_\bt_\by_\bp_\be( 1 ) / detInv_; }\n-_\b5_\b0_\b3 _\bc_\bt_\by_\bp_\be _\bd_\be_\bt_\bI_\bn_\bv () const { return detInv_; }\n-504\n-505 private:\n-506 _\bc_\bt_\by_\bp_\be detInv_;\n-507 };\n-508\n-509\n-510\n-523 template< class ct, int mydim, int cdim, class Traits =\n-MultiLinearGeometryTraits< ct > >\n-_\b5_\b2_\b4 class _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-525 : public _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by< ct, mydim, cdim, Traits >\n-526 {\n-527 typedef _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> This;\n-528 typedef _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b> _\bB_\ba_\bs_\be;\n-529\n-530 protected:\n-_\b5_\b3_\b1 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br;\n-532\n-533 public:\n-_\b5_\b3_\b4 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-535\n-_\b5_\b3_\b6 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bt_\by_\bp_\be _\bc_\bt_\by_\bp_\be;\n-537\n-538 using _\bB_\ba_\bs_\be_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn;\n-539 using _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn;\n-540\n-_\b5_\b4_\b1 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-_\b5_\b4_\b2 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be;\n-_\b5_\b4_\b3 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be _\bV_\bo_\bl_\bu_\bm_\be;\n-544\n-_\b5_\b4_\b5 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-_\b5_\b4_\b6 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd;\n-_\b5_\b4_\b7 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn;\n-_\b5_\b4_\b8 typedef typename _\bB_\ba_\bs_\be_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be;\n-549\n-550 template< class CornerStorage >\n-_\b5_\b5_\b1 _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt &_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt, const\n-CornerStorage &cornerStorage )\n-552 : _\bB_\ba_\bs_\be( _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt, cornerStorage ),\n-553 affine_( _\bB_\ba_\bs_\be::_\ba_\bf_\bf_\bi_\bn_\be( jacobianTransposed_ ) ),\n-554 jacobianInverseTransposedComputed_( false ),\n-555 integrationElementComputed_( false )\n-556 {}\n-557\n-558 template< class CornerStorage >\n-_\b5_\b5_\b9 _\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by ( _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, const CornerStorage\n-&cornerStorage )\n-560 : _\bB_\ba_\bs_\be( gt, cornerStorage ),\n-561 affine_( _\bB_\ba_\bs_\be::_\ba_\bf_\bf_\bi_\bn_\be( jacobianTransposed_ ) ),\n-562 jacobianInverseTransposedComputed_( false ),\n-563 integrationElementComputed_( false )\n-564 {}\n-565\n-_\b5_\b6_\b7 bool _\ba_\bf_\bf_\bi_\bn_\be () const { return affine_; }\n-568\n-569 using _\bB_\ba_\bs_\be_\b:_\b:_\bc_\bo_\br_\bn_\be_\br;\n-570\n-_\b5_\b7_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const { return _\bg_\bl_\bo_\bb_\ba_\bl( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0,\n-0 ) ); }\n-573\n-_\b5_\b8_\b0 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n-581 {\n-582 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-583 {\n-584 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl( _\bc_\bo_\br_\bn_\be_\br( 0 ) );\n-585 jacobianTransposed_.umtv( _\bl_\bo_\bc_\ba_\bl, _\bg_\bl_\bo_\bb_\ba_\bl );\n-586 return _\bg_\bl_\bo_\bb_\ba_\bl;\n-587 }\n-588 else\n-589 return _\bB_\ba_\bs_\be_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl( _\bl_\bo_\bc_\ba_\bl );\n-590 }\n-591\n-_\b6_\b0_\b4 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl ( const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bg_\bl_\bo_\bb_\ba_\bl ) const\n-605 {\n-606 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-607 {\n-608 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl;\n-609 if( jacobianInverseTransposedComputed_ )\n-610 jacobianInverseTransposed_.mtv( _\bg_\bl_\bo_\bb_\ba_\bl - _\bc_\bo_\br_\bn_\be_\br( 0 ), _\bl_\bo_\bc_\ba_\bl );\n-611 else\n-612 MatrixHelper::template xTRightInvA< mydimension, coorddimension >\n-( jacobianTransposed_, _\bg_\bl_\bo_\bb_\ba_\bl - _\bc_\bo_\br_\bn_\be_\br( 0 ), _\bl_\bo_\bc_\ba_\bl );\n-613 return _\bl_\bo_\bc_\ba_\bl;\n-614 }\n-615 else\n-616 return _\bB_\ba_\bs_\be_\b:_\b:_\bl_\bo_\bc_\ba_\bl( _\bg_\bl_\bo_\bb_\ba_\bl );\n-617 }\n-618\n-_\b6_\b3_\b3 _\bc_\bt_\by_\bp_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl ) const\n-634 {\n-635 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-636 {\n-637 if( !integrationElementComputed_ )\n-638 {\n-639 jacobianInverseTransposed_._\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt( jacobianTransposed_ );\n-640 integrationElementComputed_ = true;\n-641 }\n-642 return jacobianInverseTransposed_._\bd_\be_\bt_\bI_\bn_\bv();\n-643 }\n-644 else\n-645 return _\bB_\ba_\bs_\be_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\bl_\bo_\bc_\ba_\bl );\n-646 }\n-647\n-_\b6_\b4_\b9 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be () const\n-650 {\n-651 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-652 return _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt( _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt().position( 0, 0 ) ) * _\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n-().volume();\n-653 else\n-654 return _\bB_\ba_\bs_\be_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be();\n-655 }\n-656\n-_\b6_\b6_\b6 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl )\n-const\n-667 {\n-668 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-669 return jacobianTransposed_;\n-670 else\n-671 return _\bB_\ba_\bs_\be_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl );\n-672 }\n-673\n-_\b6_\b8_\b0 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-&_\bl_\bo_\bc_\ba_\bl ) const\n-681 {\n-682 if( _\ba_\bf_\bf_\bi_\bn_\be() )\n-683 {\n-684 if( !jacobianInverseTransposedComputed_ )\n-685 {\n-686 jacobianInverseTransposed_._\bs_\be_\bt_\bu_\bp( jacobianTransposed_ );\n-687 jacobianInverseTransposedComputed_ = true;\n-688 integrationElementComputed_ = true;\n-689 }\n-690 return jacobianInverseTransposed_;\n-691 }\n-692 else\n-693 return _\bB_\ba_\bs_\be_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd( _\bl_\bo_\bc_\ba_\bl );\n-694 }\n-695\n-_\b7_\b0_\b2 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-703 {\n-704 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n-705 }\n-706\n-_\b7_\b1_\b3 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &_\bl_\bo_\bc_\ba_\bl) const\n-714 {\n-715 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl).transposed();\n-716 }\n-717\n-718 protected:\n-719 using _\bB_\ba_\bs_\be_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-720\n-721 private:\n-722 mutable _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianTransposed_;\n-723 mutable _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jacobianInverseTransposed_;\n-724\n-725 mutable bool affine_ : 1;\n-726\n-727 mutable bool jacobianInverseTransposedComputed_ : 1;\n-728 mutable bool integrationElementComputed_ : 1;\n-729 };\n-730\n-731\n-732\n-733 // Implementation of MultiLinearGeometry\n-734 // -------------------------------------\n-735\n-736 template< class ct, int mydim, int cdim, class Traits >\n-737 inline typename MultiLinearGeometry< ct, mydim, cdim, Traits >::\n-JacobianInverseTransposed\n-_\b7_\b3_\b8 _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-( const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &local ) const\n-739 {\n-740 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jit;\n-741 jit._\bs_\be_\bt_\bu_\bp( jacobianTransposed( local ) );\n-742 return jit;\n-743 }\n-744\n-745\n-746 template< class ct, int mydim, int cdim, class Traits >\n-747 template< bool add, int dim, class CornerIterator >\n-748 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b7_\b4_\b9_\b _\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int, dim >,\n-750 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-751 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y )\n-752 {\n-753 const _\bc_\bt_\by_\bp_\be xn = df*x[ dim-1 ];\n-754 const _\bc_\bt_\by_\bp_\be cxn = _\bc_\bt_\by_\bp_\be( 1 ) - xn;\n-755\n-756 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n-) )\n-757 {\n-758 // apply (1-xn) times mapping for bottom\n-759 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n-x, rf*cxn, y );\n-760 // apply xn times mapping for top\n-761 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n-df, x, rf*xn, y );\n-762 }\n-763 else\n-764 {\n-765 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension,\n-mydimension-dim ) );\n-766 // apply (1-xn) times mapping for bottom (with argument x/(1-xn))\n-767 if( cxn > Traits::tolerance() || cxn < -Traits::tolerance() )\n-768 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df/\n-cxn, x, rf*cxn, y );\n-769 else\n-770 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n-x, _\bc_\bt_\by_\bp_\be( 0 ), y );\n-771 // apply xn times the tip\n-772 y.axpy( rf*xn, *cit );\n-773 ++cit;\n-774 }\n-775 }\n-776\n-777 template< class ct, int mydim, int cdim, class Traits >\n-778 template< bool add, class CornerIterator >\n-779 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b7_\b8_\b0_\b _\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >,\n-781 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &,\n-782 const _\bc_\bt_\by_\bp_\be &rf, _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &y )\n-783 {\n-784 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &origin = *cit;\n-785 ++cit;\n-786 for( int i = 0; i < coorddimension; ++i )\n-787 y[ i ] = (add ? y[ i ] + rf*origin[ i ] : rf*origin[ i ]);\n-788 }\n-789\n-790\n-791 template< class ct, int mydim, int cdim, class Traits >\n-792 template< bool add, int rows, int dim, class CornerIterator >\n-793 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b7_\b9_\b4_\b _\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int,\n-dim >,\n-795 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &df, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &x,\n-796 const _\bc_\bt_\by_\bp_\be &rf, FieldMatrix< ctype, rows, cdim > &jt )\n-797 {\n-798 assert( rows >= dim );\n-799\n-800 const _\bc_\bt_\by_\bp_\be xn = df*x[ dim-1 ];\n-801 const _\bc_\bt_\by_\bp_\be cxn = _\bc_\bt_\by_\bp_\be( 1 ) - xn;\n-802\n-803 auto cit2( cit );\n-804 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n-) )\n-805 {\n-806 // apply (1-xn) times Jacobian for bottom\n-807 jacobianTransposed< add >( topologyId, std::integral_constant< int, dim-1 >\n-(), cit2, df, x, rf*cxn, jt );\n-808 // apply xn times Jacobian for top\n-809 jacobianTransposed< true >( topologyId, std::integral_constant< int, dim-\n-1 >(), cit2, df, x, rf*xn, jt );\n-810 // compute last row as difference between top value and bottom value\n-811 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit, df,\n-x, -rf, jt[ dim-1 ] );\n-812 global< true >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n-df, x, rf, jt[ dim-1 ] );\n-813 }\n-814 else\n-815 {\n-816 assert( Impl::isPyramid( toUnsignedInt(topologyId), mydimension,\n-mydimension-dim ) );\n-817 /*\n-818 * In the pyramid case, we need a transformation Tb: B -> R^n for the\n-819 * base B \\subset R^{n-1}. The pyramid transformation is then defined as\n-820 * T: P \\subset R^n -> R^n\n-821 * (x, xn) |-> (1-xn) Tb(x*) + xn t (x \\in R^{n-1}, xn \\in R)\n-822 * with the tip of the pyramid mapped to t and x* = x/(1-xn)\n-823 * the projection of (x,xn) onto the base.\n-824 *\n-825 * For the Jacobi matrix DT we get\n-826 * DT = ( A | b )\n-827 * with A = DTb(x*) (n x n-1 matrix)\n-828 * and b = dT/dxn (n-dim column vector).\n-829 * Furthermore\n-830 * b = -Tb(x*) + t + \\sum_i dTb/dx_i(x^*) x_i/(1-xn)\n-831 *\n-832 * Note that both A and b are not defined in the pyramid tip (x=0, xn=1)!\n-833 * Indeed for B the unit square, Tb mapping B to the quadrilateral given\n-834 * by the vertices (0,0,0), (2,0,0), (0,1,0), (1,1,0) and t=(0,0,1), we get\n-835 *\n-836 * T(x,y,xn) = ( x(2-y/(1-xn)), y, xn )\n-837 * / 2-y/(1-xn) -x 0 \\\n-838 * DT(x,y,xn) = | 0 1 0 |\n-839 * \\ 0 0 1 /\n-840 * which is not continuous for xn -> 1, choose for example\n-841 * x=0, y=1-xn, xn -> 1 --> DT -> diag(1,1,1)\n-842 * x=1-xn, y=0, xn -> 1 --> DT -> diag(2,1,1)\n-843 *\n-844 * However, for Tb affine-linear, Tb(y) = My + y0, DTb = M:\n-845 * A = M\n-846 * b = -M x* - y0 + t + \\sum_i M_i x_i/(1-xn)\n-847 * = -M x* - y0 + t + M x*\n-848 * = -y0 + t\n-849 * which is continuous for xn -> 1. Note that this b is also given by\n-850 * b = -Tb(0) + t + \\sum_i dTb/dx_i(0) x_i/1\n-851 * that is replacing x* by 1 and 1-xn by 1 in the formular above.\n-852 *\n-853 * For xn -> 1, we can thus set x*=0, \"1-xn\"=1 (or anything != 0) and get\n-854 * the right result in case Tb is affine-linear.\n-855 */\n-856\n-857 /* The second case effectively results in x* = 0 */\n-858 _\bc_\bt_\by_\bp_\be dfcxn = (cxn > Traits::tolerance() || cxn < -Traits::tolerance()) ?\n-_\bc_\bt_\by_\bp_\be(df / cxn) : _\bc_\bt_\by_\bp_\be(0);\n-859\n-860 // initialize last row\n-861 // b = -Tb(x*)\n-862 // (b = -Tb(0) = -y0 in case xn -> 1 and Tb affine-linear)\n-863 global< add >( topologyId, std::integral_constant< int, dim-1 >(), cit,\n-dfcxn, x, -rf, jt[ dim-1 ] );\n-864 // b += t\n-865 jt[ dim-1 ].axpy( rf, *cit );\n-866 ++cit;\n-867 // apply Jacobian for bottom (with argument x/(1-xn)) and correct last row\n-868 if( add )\n-869 {\n-870 FieldMatrix< _\bc_\bt_\by_\bp_\be, dim-1, coorddimension > jt2;\n-871 // jt2 = dTb/dx_i(x*)\n-872 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-\n-1 >(), cit2, dfcxn, x, rf, jt2 );\n-873 // A = dTb/dx_i(x*) (jt[j], j=0..dim-1)\n-874 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn) (jt[dim-1])\n-875 // (b += 0 in case xn -> 1)\n-876 for( int j = 0; j < dim-1; ++j )\n-877 {\n-878 jt[ j ] += jt2[ j ];\n-879 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt2[ j ] );\n-880 }\n-881 }\n-882 else\n-883 {\n-884 // jt = dTb/dx_i(x*)\n-885 jacobianTransposed< false >( topologyId, std::integral_constant< int, dim-\n-1 >(), cit2, dfcxn, x, rf, jt );\n-886 // b += \\sum_i dTb/dx_i(x*) x_i/(1-xn)\n-887 for( int j = 0; j < dim-1; ++j )\n-888 jt[ dim-1 ].axpy( dfcxn*x[ j ], jt[ j ] );\n-889 }\n-890 }\n-891 }\n-892\n-893 template< class ct, int mydim, int cdim, class Traits >\n-894 template< bool add, int rows, class CornerIterator >\n-895 inline void _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b8_\b9_\b6_\b _\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >,\n-897 CornerIterator &cit, const _\bc_\bt_\by_\bp_\be &, const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &,\n-898 const _\bc_\bt_\by_\bp_\be &, FieldMatrix< ctype, rows, cdim > & )\n-899 {\n-900 ++cit;\n-901 }\n-902\n-903\n-904\n-905 template< class ct, int mydim, int cdim, class Traits >\n-906 template< int dim, class CornerIterator >\n-907 inline bool _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b9_\b0_\b8_\b _\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd topologyId, std::integral_constant< int, dim >,\n-CornerIterator &cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd &jt )\n-909 {\n-910 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &orgBottom = *cit;\n-911 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jt )\n-)\n-912 return false;\n-913 const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be &orgTop = *cit;\n-914\n-915 if( Impl::isPrism( toUnsignedInt(topologyId), mydimension, mydimension-dim\n-) )\n-916 {\n-917 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd jtTop;\n-918 if( !affine( topologyId, std::integral_constant< int, dim-1 >(), cit, jtTop\n-) )\n-919 return false;\n-920\n-921 // check whether both jacobians are identical\n-922 _\bc_\bt_\by_\bp_\be norm( 0 );\n-923 for( int i = 0; i < dim-1; ++i )\n-924 norm += (jtTop[ i ] - jt[ i ]).two_norm2();\n-925 if( norm >= Traits::tolerance() )\n-926 return false;\n-927 }\n-928 else\n-929 ++cit;\n-930 jt[ dim-1 ] = orgTop - orgBottom;\n-931 return true;\n-932 }\n-933\n-934 template< class ct, int mydim, int cdim, class Traits >\n-935 template< class CornerIterator >\n-936 inline bool _\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bc_\bt_\b,_\b _\bm_\by_\bd_\bi_\bm_\b,_\b _\bc_\bd_\bi_\bm_\b,_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n-_\b9_\b3_\b7_\b _\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be ( _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd, std::integral_constant< int, 0 >, CornerIterator\n-&cit, _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd & )\n-938 {\n-939 ++cit;\n-940 return true;\n-941 }\n-942\n-943} // namespace Dune\n-944\n-945#endif // #ifndef DUNE_GEOMETRY_MULTILINEARGEOMETRY_HH\n-_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n-An implementation of the Geometry interface for affine geometries.\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n-_\bt_\by_\bp_\be_\b._\bh_\bh\n-A unique label for each type of element that can occur in a grid.\n-_\bD_\bu_\bn_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Class providing access to the singletons of the reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-typename Container::ReferenceElement ReferenceElement\n-The reference element type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs\n-default traits class for MultiLinearGeometry\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:39\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n-Impl::FieldMatrixHelper< ct > MatrixHelper\n-helper structure containing some matrix routines\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:58\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\bo_\bl_\be_\br_\ba_\bn_\bc_\be\n-static ct tolerance()\n-tolerance to numerical algorithms\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:61\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be\n-template specifying the storage for the corners\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:129\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bC_\bo_\br_\bn_\be_\br_\bS_\bt_\bo_\br_\ba_\bg_\be_\b:_\b:_\bT_\by_\bp_\be\n-std::vector< FieldVector< ct, cdim > > Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:130\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-will there be only one geometry type for a dimension?\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:148\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n-static const unsigned int topologyId\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:150\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bh_\ba_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bv\n-static const bool v\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:149\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-generic geometry implementation based on corner coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:181\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-static void global(TopologyId topologyId, std::integral_constant< int, dim >,\n-CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype\n-&rf, GlobalCoordinate &y)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:749\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int mydimension\n-geometry dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:189\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n-Dune::GeometryType type() const\n-obtain the name of the reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n-Traits::MatrixHelper MatrixHelper\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:225\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, coorddimension > GlobalCoordinate\n-type of global coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:196\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-static void jacobianTransposed(TopologyId topologyId, std::integral_constant<\n-int, 0 >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const\n-ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:896\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n-obtain the transposed of the Jacobian\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:377\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ReferenceElement refElement() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:425\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-GlobalCoordinate global(const LocalCoordinate &local) const\n-evaluate the mapping\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:290\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n-GlobalCoordinate center() const\n-obtain the centroid of the mapping's image\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:282\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-GlobalCoordinate corner(int i) const\n-obtain coordinates of the i-th corner\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Dune::ReferenceElements< ctype, mydimension > ReferenceElements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n-ct ctype\n-coordinate type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:186\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-static void jacobianTransposed(TopologyId topologyId, std::integral_constant<\n-int, dim >, CornerIterator &cit, const ctype &df, const LocalCoordinate &x,\n-const ctype &rf, FieldMatrix< ctype, rows, cdim > &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:794\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n-static const int coorddimension\n-coordinate dimension\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:191\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n-int corners() const\n-obtain number of corners of the corresponding reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:272\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n-TopologyId topologyId() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:430\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-friend ReferenceElement referenceElement(const MultiLinearGeometry &geometry)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:395\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-LocalCoordinate local(const GlobalCoordinate &globalCoord) const\n-evaluate the inverse mapping\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:312\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-static void global(TopologyId topologyId, std::integral_constant< int, 0 >,\n-CornerIterator &cit, const ctype &df, const LocalCoordinate &x, const ctype\n-&rf, GlobalCoordinate &y)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:780\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume() const\n-obtain the volume of the mapping's image\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:363\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-FieldVector< ctype, mydimension > LocalCoordinate\n-type of local coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:194\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-MultiLinearGeometry(const ReferenceElement &refElement, const Corners &corners)\n-constructor\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:239\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-static bool affine(TopologyId topologyId, std::integral_constant< int, 0 >,\n-CornerIterator &cit, JacobianTransposed &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:937\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bd\n-std::conditional< hasSingleGeometryType, std::integral_constant< unsignedint,\n-Traits::templatehasSingleGeometryType< mydimension >::topologyId >, unsignedint\n->::type TopologyId\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:226\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-ctype Volume\n-type of volume\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:198\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-static bool affine(TopologyId topologyId, std::integral_constant< int, dim >,\n-CornerIterator &cit, JacobianTransposed &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:908\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n-Obtain the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:418\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-MultiLinearGeometry(Dune::GeometryType gt, const Corners &corners)\n-constructor\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:255\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed\n-type of jacobian transposed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:201\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ReferenceElements::ReferenceElement ReferenceElement\n-type of reference element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n-&local) const\n-obtain the transposed of the Jacobian's inverse\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:738\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-FieldMatrix< ctype, coorddimension, mydimension > Jacobian\n-Type for the Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:207\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine() const\n-is this mapping affine?\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse\n-Type for the inverse Jacobian matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:210\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine(JacobianTransposed &jacobianT) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:458\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n-Volume integrationElement(const LocalCoordinate &local) const\n-obtain the integration element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:350\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Jacobian jacobian(const LocalCoordinate &local) const\n-Obtain the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:407\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:488\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bs_\be_\bt_\bu_\bp\n-void setup(const JacobianTransposed &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:492\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bd_\be_\bt\n-ctype det() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:502\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bd_\be_\bt_\bI_\bn_\bv\n-ctype detInv() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:503\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd_\b:_\b:_\bs_\be_\bt_\bu_\bp_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt\n-void setupDeterminant(const JacobianTransposed &jt)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:497\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-Implement a MultiLinearGeometry with additional caching.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:526\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n-GlobalCoordinate global(const LocalCoordinate &local) const\n-evaluate the mapping\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:580\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-Base::ReferenceElement ReferenceElement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:534\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n-bool affine() const\n-is this mapping affine?\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:567\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-CachedMultiLinearGeometry(const ReferenceElement &referenceElement, const\n-CornerStorage &cornerStorage)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:551\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ReferenceElement refElement() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:425\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n-LocalCoordinate local(const GlobalCoordinate &global) const\n-evaluate the inverse mapping\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:604\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n-Base::MatrixHelper MatrixHelper\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:531\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Base::LocalCoordinate LocalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:541\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n-Obtain the Jacobian's inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:713\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n-obtain the transposed of the Jacobian\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:666\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n-GlobalCoordinate corner(int i) const\n-obtain coordinates of the i-th corner\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n-Volume volume() const\n-obtain the volume of the mapping's image\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:649\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n-CachedMultiLinearGeometry(Dune::GeometryType gt, const CornerStorage\n-&cornerStorage)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:559\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n-ctype integrationElement(const LocalCoordinate &local) const\n-obtain the integration element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:633\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n-Base::ctype ctype\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:536\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Jacobian jacobian(const LocalCoordinate &local) const\n-Obtain the Jacobian.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:702\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-Base::JacobianInverseTransposed JacobianInverseTransposed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:546\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-Base::JacobianTransposed JacobianTransposed\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:545\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n-Base::JacobianInverse JacobianInverse\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:548\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n-Base::Jacobian Jacobian\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:547\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n-Base::Volume Volume\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:543\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n-Base::GlobalCoordinate GlobalCoordinate\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:542\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n-GlobalCoordinate center() const\n-obtain the centroid of the mapping's image\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:572\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\ba_\bc_\bh_\be_\bd_\bM_\bu_\bl_\bt_\bi_\bL_\bi_\bn_\be_\ba_\br_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n-JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n-&local) const\n-obtain the transposed of the Jacobian's inverse\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multilineargeometry.hh:680\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-Unique label for each type of entities that can occur in DUNE grids.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+239// The interface (template<...> class StaticRefinement) is not included here\n+240// since it derives from parts which I consider implementation. Look\n+241// into refinement/base.cc if the documentation is above is not enough.\n+242#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bb_\ba_\bs_\be_\b._\bc_\bc\"\n+243\n+244#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\"\n+245#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\"\n+246#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+247#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+248#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b/_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\"\n+249\n+250#endif // DUNE_GEOMETRY_REFINEMENT_HH\n+_\bb_\ba_\bs_\be_\b._\bc_\bc\n+This file contains the parts independent of a particular Refinement\n+implementation.\n+_\bp_\by_\br_\ba_\bm_\bi_\bd_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n+_\bp_\br_\bi_\bs_\bm_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n+_\bh_\bc_\bu_\bb_\be_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bc_\bc\n+This file contains the Refinement implementation for triangulating hypercubes\n+(quadrilateral -> trian...\n+_\bs_\bi_\bm_\bp_\bl_\be_\bx_\b._\bc_\bc\n+This file contains the Refinement implementation for simplices (triangles,\n+tetrahedrons....\n+_\bh_\bc_\bu_\bb_\be_\b._\bc_\bc\n+This file contains the Refinement implementation for hypercubes\n+(quadrilaterals, hexahedrons,...\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00239.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00239.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: dimension.hh File Reference\n+dune-geometry: topologyfactory.hh File Reference\n \n \n \n \n \n \n \n@@ -72,28 +72,35 @@\n
  • dune
  • geometry
  • \n \n \n
    \n \n-
    dimension.hh File Reference
    \n+
    topologyfactory.hh File Reference
    \n
    \n
    \n-
    #include <type_traits>
    \n+
    #include <cassert>
    \n+#include <array>
    \n+#include <map>
    \n+#include <memory>
    \n+#include <type_traits>
    \n+#include <vector>
    \n+#include <dune/geometry/type.hh>
    \n+#include <dune/geometry/typeindex.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Classes

    struct  Dune::Dim< dim >
     Static tag representing a dimension. More...
    struct  Dune::TopologyFactory< Traits >
     Provide a factory over the generic topologies. More...
     
    struct  Dune::Codim< codim >
     Static tag representing a codimension. More...
    struct  Dune::TopologySingletonFactory< Factory >
     A wrapper for a TopologyFactory providing singleton storage. Same usage as TopologyFactory but with empty release method an internal storage. More...
     
    \n \n \n \n

    \n Namespaces

    namespace  Dune
     
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,22 +1,31 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-dimension.hh File Reference\n+topologyfactory.hh File Reference\n+#include \n+#include \n+#include \n+#include \n #include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b<_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 Static tag representing a dimension. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bT_\br_\ba_\bi_\bt_\bs_\b _\b>\n+\u00a0 Provide a factory over the generic topologies. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\b _\b>\n-\u00a0 Static tag representing a codimension. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bF_\ba_\bc_\bt_\bo_\br_\by_\b _\b>\n+ A wrapper for a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by providing singleton storage. Same\n+\u00a0 usage as _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by but with empty release method an internal\n+ storage. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00239_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00239_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: dimension.hh Source File\n+dune-geometry: topologyfactory.hh Source File\n \n \n \n \n \n \n \n@@ -74,54 +74,194 @@\n \n
    \n \n
    \n
    \n
    \n-
    dimension.hh
    \n+
    topologyfactory.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_DIMENSION_HH
    \n-
    6#define DUNE_GEOMETRY_DIMENSION_HH
    \n+
    5#ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n+
    6#define DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n
    7
    \n-
    8#include <type_traits>
    \n+
    8#include <cassert>
    \n
    9
    \n-
    10namespace Dune {
    \n-
    11
    \n-
    13 template<int dim>
    \n-
    \n-
    14 struct Dim
    \n-
    15 : public std::integral_constant<int,dim>
    \n-
    16 {
    \n-
    17 typedef Dim type;
    \n-
    18 };
    \n-
    \n-
    19
    \n-
    21 template<int codim>
    \n-
    \n-
    22 struct Codim
    \n-
    23 : public std::integral_constant<int,codim>
    \n-
    24 {
    \n-
    25 typedef Codim type;
    \n-
    26 };
    \n-
    \n-
    27
    \n-
    28}
    \n-
    29
    \n-
    30#endif // DUNE_GEOMETRY_DIMENSION_HH
    \n+
    10#include <array>
    \n+
    11#include <map>
    \n+
    12#include <memory>
    \n+
    13#include <type_traits>
    \n+
    14#include <vector>
    \n+
    15
    \n+
    16#include <dune/geometry/type.hh>
    \n+\n+
    18
    \n+
    19namespace Dune
    \n+
    20{
    \n+
    21
    \n+
    40 template <class Traits>
    \n+
    \n+\n+
    42 {
    \n+
    43 // extract types from Traits class
    \n+
    44 static const unsigned int dimension = Traits::dimension;
    \n+
    45 typedef typename Traits::Key Key;
    \n+
    46 typedef typename Traits::Object Object;
    \n+
    47 typedef typename Traits::Factory Factory;
    \n+
    48
    \n+
    \n+
    50 static Object *create ( const Dune::GeometryType &gt, const Key &key )
    \n+
    51 {
    \n+
    52 return Impl::toGeometryTypeIdConstant<dimension>(gt, [&](auto id) {
    \n+
    53 return create<decltype(id)::value>(key);
    \n+
    54 });
    \n+
    55 }
    \n+
    \n+
    57 template< GeometryType::Id geometryId >
    \n+
    \n+
    58 static Object *create ( const Key &key )
    \n+
    59 {
    \n+
    60 return Factory::template createObject< geometryId >( key );
    \n+
    61 }
    \n+
    \n+
    62
    \n+
    64 template< class Topology >
    \n+
    \n+
    65 static Object *create ( const Key &key )
    \n+
    66 {
    \n+
    67 return Factory::template createObject< Topology >( key );
    \n+
    68 }
    \n+
    \n+
    69
    \n+
    71 static void release( Object *object ) { delete object; }
    \n+
    72 };
    \n+
    \n+
    73
    \n+
    74
    \n+
    75
    \n+
    80 template <class Factory>
    \n+
    \n+\n+
    82 {
    \n+
    83 static const unsigned int dimension = Factory::dimension;
    \n+
    84 typedef typename Factory::Key Key;
    \n+
    85 typedef const typename Factory::Object Object;
    \n+
    86
    \n+
    \n+
    88 static Object *create ( const Dune::GeometryType &gt, const Key &key )
    \n+
    89 {
    \n+
    90 assert( gt.id() < numTopologies );
    \n+
    91 return instance().getObject( gt, key );
    \n+
    92 }
    \n+
    \n+
    94 template< GeometryType::Id geometryId >
    \n+
    \n+
    95 static auto create ( const Key &key )
    \n+
    96 -> std::enable_if_t< static_cast<GeometryType>(geometryId).dim() == dimension, Object * >
    \n+
    97 {
    \n+
    98 return instance().template getObject< geometryId >( key );
    \n+
    99 }
    \n+
    \n+
    100
    \n+
    102 template< class Topology >
    \n+
    \n+
    103 static auto create ( const Key &key )
    \n+
    104 -> std::enable_if_t< Topology::dimension == dimension, Object * >
    \n+
    105 {
    \n+
    106 return instance().template getObject< Topology >( key );
    \n+
    107 }
    \n+
    \n+
    108
    \n+
    \n+
    110 static void release ( Object *object )
    \n+
    111 {}
    \n+
    \n+
    112
    \n+
    113 private:
    \n+
    114 struct ObjectDeleter
    \n+
    115 {
    \n+
    116 void operator() ( Object *ptr ) const { Factory::release( ptr ); }
    \n+
    117 };
    \n+
    118
    \n+
    119 static TopologySingletonFactory &instance ()
    \n+
    120 {
    \n+
    121 static TopologySingletonFactory instance;
    \n+
    122 return instance;
    \n+
    123 }
    \n+
    124
    \n+
    125 static const unsigned int numTopologies = (1 << dimension);
    \n+
    126 typedef std::array< std::unique_ptr< Object, ObjectDeleter >, numTopologies > Array;
    \n+
    127 typedef std::map< Key, Array > Storage;
    \n+
    128
    \n+
    129 TopologySingletonFactory () = default;
    \n+
    130
    \n+
    131 std::unique_ptr< Object, ObjectDeleter > &find ( const unsigned int topologyId, const Key &key )
    \n+
    132 {
    \n+
    133 return storage_[ key ][ topologyId ];
    \n+
    134 }
    \n+
    135
    \n+
    136 Object *getObject ( const Dune::GeometryType &gt, const Key &key )
    \n+
    137 {
    \n+
    138 auto &object = find( gt.id(), key );
    \n+
    139 if( !object )
    \n+
    140 object.reset( Factory::create( gt, key ) );
    \n+
    141 return object.get();
    \n+
    142 }
    \n+
    143
    \n+
    144 template< GeometryType::Id geometryId >
    \n+
    145 Object *getObject ( const Key &key )
    \n+
    146 {
    \n+
    147 static constexpr GeometryType geometry = geometryId;
    \n+
    148 auto &object = find( geometry.id(), key );
    \n+
    149 if( !object )
    \n+
    150 object.reset( Factory::template create< geometry >( key ) );
    \n+
    151 return object.get();
    \n+
    152 }
    \n+
    153
    \n+
    154 template< class Topology >
    \n+
    155 Object *getObject ( const Key &key )
    \n+
    156 {
    \n+
    157 auto &object = find( Topology::id, key );
    \n+
    158 if( !object )
    \n+
    159 object.reset( Factory::template create< Topology >( key ) );
    \n+
    160 return object.get();
    \n+
    161 }
    \n+
    162
    \n+
    163 Storage storage_;
    \n+
    164 };
    \n+
    \n+
    165
    \n+
    166}
    \n+
    167
    \n+
    168#endif // #ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n+
    Helper classes to provide indices for geometrytypes for use in a vector.
    \n
    Definition affinegeometry.hh:21
    \n-
    Static tag representing a dimension.
    Definition dimension.hh:16
    \n-
    Dim type
    Definition dimension.hh:17
    \n-
    Static tag representing a codimension.
    Definition dimension.hh:24
    \n-
    Codim type
    Definition dimension.hh:25
    \n+
    Provide a factory over the generic topologies.
    Definition topologyfactory.hh:42
    \n+
    Traits::Factory Factory
    Definition topologyfactory.hh:47
    \n+
    static Object * create(const Dune::GeometryType &gt, const Key &key)
    dynamically create objects
    Definition topologyfactory.hh:50
    \n+
    static const unsigned int dimension
    Definition topologyfactory.hh:44
    \n+
    static Object * create(const Key &key)
    statically create objects
    Definition topologyfactory.hh:58
    \n+
    static void release(Object *object)
    release the object returned by the create methods
    Definition topologyfactory.hh:71
    \n+
    Traits::Key Key
    Definition topologyfactory.hh:45
    \n+
    Traits::Object Object
    Definition topologyfactory.hh:46
    \n+
    A wrapper for a TopologyFactory providing singleton storage. Same usage as TopologyFactory but with e...
    Definition topologyfactory.hh:82
    \n+
    static auto create(const Key &key) -> std::enable_if_t< Topology::dimension==dimension, Object * >
    Definition topologyfactory.hh:103
    \n+
    static Object * create(const Dune::GeometryType &gt, const Key &key)
    Definition topologyfactory.hh:88
    \n+
    static void release(Object *object)
    release the object returned by the create methods
    Definition topologyfactory.hh:110
    \n+
    const Factory::Object Object
    Definition topologyfactory.hh:85
    \n+
    Factory::Key Key
    Definition topologyfactory.hh:84
    \n+
    static auto create(const Key &key) -> std::enable_if_t< static_cast< GeometryType >(geometryId).dim()==dimension, Object * >
    Definition topologyfactory.hh:95
    \n+
    static const unsigned int dimension
    Definition topologyfactory.hh:83
    \n+
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n+
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,53 +1,220 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-dimension.hh\n+topologyfactory.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_DIMENSION_HH\n-6#define DUNE_GEOMETRY_DIMENSION_HH\n+5#ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n+6#define DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n 7\n-8#include \n+8#include \n 9\n-10namespace _\bD_\bu_\bn_\be {\n-11\n-13 template\n-_\b1_\b4 struct _\bD_\bi_\bm\n-15 : public std::integral_constant\n-16 {\n-_\b1_\b7 typedef _\bD_\bi_\bm _\bt_\by_\bp_\be;\n-18 };\n-19\n-21 template\n-_\b2_\b2 struct _\bC_\bo_\bd_\bi_\bm\n-23 : public std::integral_constant\n-24 {\n-_\b2_\b5 typedef _\bC_\bo_\bd_\bi_\bm _\bt_\by_\bp_\be;\n-26 };\n-27\n-28}\n-29\n-30#endif // DUNE_GEOMETRY_DIMENSION_HH\n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15\n+16#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+17#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh>\n+18\n+19namespace _\bD_\bu_\bn_\be\n+20{\n+21\n+40 template \n+_\b4_\b1 struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by\n+42 {\n+43 // extract types from Traits class\n+_\b4_\b4 static const unsigned int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Traits::dimension;\n+_\b4_\b5 typedef typename Traits::Key _\bK_\be_\by;\n+_\b4_\b6 typedef typename Traits::Object _\bO_\bb_\bj_\be_\bc_\bt;\n+_\b4_\b7 typedef typename Traits::Factory _\bF_\ba_\bc_\bt_\bo_\br_\by;\n+48\n+_\b5_\b0 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n+51 {\n+52 return Impl::toGeometryTypeIdConstant(gt, [&](auto id) {\n+53 return create(key);\n+54 });\n+55 }\n+57 template< GeometryType::Id geometryId >\n+_\b5_\b8 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n+59 {\n+60 return Factory::template createObject< geometryId >( key );\n+61 }\n+62\n+64 template< class Topology >\n+_\b6_\b5 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n+66 {\n+67 return Factory::template createObject< Topology >( key );\n+68 }\n+69\n+_\b7_\b1 static void _\br_\be_\bl_\be_\ba_\bs_\be( _\bO_\bb_\bj_\be_\bc_\bt *object ) { delete object; }\n+72 };\n+73\n+74\n+75\n+80 template \n+_\b8_\b1 struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by\n+82 {\n+_\b8_\b3 static const unsigned int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Factory::dimension;\n+_\b8_\b4 typedef typename Factory::Key _\bK_\be_\by;\n+_\b8_\b5 typedef const typename Factory::Object _\bO_\bb_\bj_\be_\bc_\bt;\n+86\n+_\b8_\b8 static _\bO_\bb_\bj_\be_\bc_\bt *_\bc_\br_\be_\ba_\bt_\be ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n+89 {\n+90 assert( gt._\bi_\bd() < numTopologies );\n+91 return instance().getObject( gt, key );\n+92 }\n+94 template< GeometryType::Id geometryId >\n+_\b9_\b5 static auto _\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n+96 -> std::enable_if_t< static_cast(geometryId).dim() ==\n+_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn, _\bO_\bb_\bj_\be_\bc_\bt * >\n+97 {\n+98 return instance().template getObject< geometryId >( key );\n+99 }\n+100\n+102 template< class Topology >\n+_\b1_\b0_\b3 static auto _\bc_\br_\be_\ba_\bt_\be ( const _\bK_\be_\by &key )\n+104 -> std::enable_if_t< Topology::dimension == dimension, Object * >\n+105 {\n+106 return instance().template getObject< Topology >( key );\n+107 }\n+108\n+_\b1_\b1_\b0 static void _\br_\be_\bl_\be_\ba_\bs_\be ( _\bO_\bb_\bj_\be_\bc_\bt *object )\n+111 {}\n+112\n+113 private:\n+114 struct ObjectDeleter\n+115 {\n+116 void operator() ( _\bO_\bb_\bj_\be_\bc_\bt *ptr ) const { Factory::release( ptr ); }\n+117 };\n+118\n+119 static TopologySingletonFactory &instance ()\n+120 {\n+121 static TopologySingletonFactory instance;\n+122 return instance;\n+123 }\n+124\n+125 static const unsigned int numTopologies = (1 << _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n+126 typedef std::array< std::unique_ptr< Object, ObjectDeleter >, numTopologies\n+> Array;\n+127 typedef std::map< Key, Array > Storage;\n+128\n+129 TopologySingletonFactory () = default;\n+130\n+131 std::unique_ptr< Object, ObjectDeleter > &find ( const unsigned int\n+topologyId, const _\bK_\be_\by &key )\n+132 {\n+133 return storage_[ key ][ topologyId ];\n+134 }\n+135\n+136 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, const _\bK_\be_\by &key )\n+137 {\n+138 auto &object = find( gt._\bi_\bd(), key );\n+139 if( !object )\n+140 object.reset( Factory::create( gt, key ) );\n+141 return object.get();\n+142 }\n+143\n+144 template< GeometryType::Id geometryId >\n+145 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bK_\be_\by &key )\n+146 {\n+147 static constexpr GeometryType geometry = geometryId;\n+148 auto &object = find( geometry.id(), key );\n+149 if( !object )\n+150 object.reset( Factory::template create< geometry >( key ) );\n+151 return object.get();\n+152 }\n+153\n+154 template< class Topology >\n+155 _\bO_\bb_\bj_\be_\bc_\bt *getObject ( const _\bK_\be_\by &key )\n+156 {\n+157 auto &object = find( Topology::id, key );\n+158 if( !object )\n+159 object.reset( Factory::template create< Topology >( key ) );\n+160 return object.get();\n+161 }\n+162\n+163 Storage storage_;\n+164 };\n+165\n+166}\n+167\n+168#endif // #ifndef DUNE_GEOMETRY_TOPOLOGYFACTORY_HH\n+_\bt_\by_\bp_\be_\b._\bh_\bh\n+A unique label for each type of element that can occur in a grid.\n+_\bt_\by_\bp_\be_\bi_\bn_\bd_\be_\bx_\b._\bh_\bh\n+Helper classes to provide indices for geometrytypes for use in a vector.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm\n-Static tag representing a dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:16\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b:_\b:_\bt_\by_\bp_\be\n-Dim type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:17\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-Static tag representing a codimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bt_\by_\bp_\be\n-Codim type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:25\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Provide a factory over the generic topologies.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:42\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Traits::Factory Factory\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:47\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n+static Object * create(const Dune::GeometryType >, const Key &key)\n+dynamically create objects\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const unsigned int dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:44\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n+static Object * create(const Key &key)\n+statically create objects\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:58\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\br_\be_\bl_\be_\ba_\bs_\be\n+static void release(Object *object)\n+release the object returned by the create methods\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bK_\be_\by\n+Traits::Key Key\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:45\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bb_\bj_\be_\bc_\bt\n+Traits::Object Object\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:46\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by\n+A wrapper for a TopologyFactory providing singleton storage. Same usage as\n+TopologyFactory but with e...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:82\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n+static auto create(const Key &key) -> std::enable_if_t< Topology::\n+dimension==dimension, Object * >\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:103\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n+static Object * create(const Dune::GeometryType >, const Key &key)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:88\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\br_\be_\bl_\be_\ba_\bs_\be\n+static void release(Object *object)\n+release the object returned by the create methods\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:110\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bb_\bj_\be_\bc_\bt\n+const Factory::Object Object\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bK_\be_\by\n+Factory::Key Key\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:84\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bc_\br_\be_\ba_\bt_\be\n+static auto create(const Key &key) -> std::enable_if_t< static_cast<\n+GeometryType >(geometryId).dim()==dimension, Object * >\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:95\n+_\bD_\bu_\bn_\be_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bn_\bg_\bl_\be_\bt_\bo_\bn_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const unsigned int dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn topologyfactory.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n+Unique label for each type of entities that can occur in DUNE grids.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n+constexpr unsigned int id() const\n+Return the topology id of the type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00242.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00242.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: virtualrefinement.hh File Reference\n+dune-geometry: localfiniteelementgeometry.hh File Reference\n \n \n \n \n \n \n \n@@ -73,51 +73,62 @@\n
    \n \n
    \n \n-
    virtualrefinement.hh File Reference
    \n+
    localfiniteelementgeometry.hh File Reference
    \n
    \n
    \n-\n-

    This file contains the virtual wrapper around refinement. \n-More...

    \n-
    #include <vector>
    \n+
    #include <cassert>
    \n+#include <functional>
    \n+#include <limits>
    \n+#include <type_traits>
    \n+#include <vector>
    \n+#include <dune/common/fmatrix.hh>
    \n #include <dune/common/fvector.hh>
    \n-#include "refinement.hh"
    \n-#include "type.hh"
    \n-#include "virtualrefinement.cc"
    \n+#include <dune/common/math.hh>
    \n+#include <dune/common/typetraits.hh>
    \n+#include <dune/common/std/type_traits.hh>
    \n+#include <dune/geometry/affinegeometry.hh>
    \n+#include <dune/geometry/quadraturerules.hh>
    \n+#include <dune/geometry/referenceelements.hh>
    \n+#include <dune/geometry/type.hh>
    \n+#include <dune/geometry/utility/algorithms.hh>
    \n+#include <dune/geometry/utility/convergence.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Dune::VirtualRefinement< dimension, CoordType >
     VirtualRefinement base class. More...
     
    struct  Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension >
     codim database of VirtualRefinement More...
    class  Dune::LocalFiniteElementGeometry< LFE, cdim >
     Geometry implementation based on local-basis function parametrization. More...
     
    \n \n \n \n

    \n Namespaces

    namespace  Dune
     
    \n \n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n Functions

    template<int dimension, class CoordType >
    VirtualRefinement< dimension, CoordType > & Dune::buildRefinement (GeometryType geometryType, GeometryType coerceTo)
     return a reference to the VirtualRefinement according to the parameters
     
    template<class I , class LFE , class GlobalCoordinate >
     Dune::LocalFiniteElementGeometry (Geo::ReferenceElement< I >, const LFE &, std::vector< GlobalCoordinate >) -> LocalFiniteElementGeometry< LFE, GlobalCoordinate::dimension >
     
    template<class I , class LFE , class F , class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
     Dune::LocalFiniteElementGeometry (Geo::ReferenceElement< I >, const LFE &, const F &) -> LocalFiniteElementGeometry< LFE, Range::dimension >
     
    template<class LFE , class GlobalCoordinate >
     Dune::LocalFiniteElementGeometry (GeometryType, const LFE &localFE, std::vector< GlobalCoordinate >) -> LocalFiniteElementGeometry< LFE, GlobalCoordinate::dimension >
     
    template<class LFE , class F , class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
     Dune::LocalFiniteElementGeometry (GeometryType, const LFE &, const F &) -> LocalFiniteElementGeometry< LFE, Range::dimension >
     
    \n-

    Detailed Description

    \n-

    This file contains the virtual wrapper around refinement.

    \n-
    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,37 +1,56 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-virtualrefinement.hh File Reference\n-This file contains the virtual wrapper around refinement. _\bM_\bo_\br_\be_\b._\b._\b.\n+localfiniteelementgeometry.hh File Reference\n+#include \n+#include \n+#include \n+#include \n #include \n+#include \n #include \n-#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n-#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-#include \"_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\"\n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>\n-\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt base class. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\b _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b _\b>\n-\u00a0 codim database of _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\b _\bL_\bF_\bE_\b,_\b _\bc_\bd_\bi_\bm_\b _\b>\n+\u00a0 Geometry implementation based on local-basis function parametrization.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt< dimension, CoordType > _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n- &\u00a0 geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo)\n- return a reference to the\n-\u00a0 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt according to the\n- parameters\n+template\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt< I >, const LFE &,\n+ std::vector< GlobalCoordinate >) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE,\n+ GlobalCoordinate::dimension >\n+\u00a0\n+template>>\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt< I >, const LFE &,\n+ const F &) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE, Range::dimension >\n+\u00a0\n+template\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE &localFE, std::\n+ vector< GlobalCoordinate >) -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE,\n+ GlobalCoordinate::dimension >\n+\u00a0\n+template>>\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE &, const F &) -\n+ > _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by< LFE, Range::dimension >\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file contains the virtual wrapper around refinement.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00242_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00242_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: virtualrefinement.hh Source File\n+dune-geometry: localfiniteelementgeometry.hh Source File\n \n \n \n \n \n \n \n@@ -74,135 +74,435 @@\n \n
    \n \n
    \n \n
    \n-
    virtualrefinement.hh
    \n+
    localfiniteelementgeometry.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n-
    6#define DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n+
    5#ifndef DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
    \n+
    6#define DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
    \n
    7
    \n-
    257#include <vector>
    \n-
    258
    \n-
    259#include <dune/common/fvector.hh>
    \n-
    260
    \n-
    261#include "refinement.hh"
    \n-
    262#include "type.hh"
    \n-
    263
    \n-
    264namespace Dune
    \n-
    265{
    \n-
    266 // //////////////////////////////////////////
    \n-
    267 //
    \n-
    268 // The virtual base class and its iterators
    \n-
    269 //
    \n-
    270
    \n-
    271 //
    \n-
    272 // Refinement
    \n-
    273 //
    \n-
    274
    \n-
    281 template<int dimension, class CoordType>
    \n-
    \n-\n-
    283 {
    \n-
    284 public:
    \n-
    285 template<int codimension>
    \n-
    286 struct Codim;
    \n-\n-\n-
    291
    \n-
    297 typedef FieldVector<CoordType, dimension> CoordVector;
    \n-
    303 typedef std::vector<int> IndexVector;
    \n-
    304
    \n-
    305 template<int codimension>
    \n-\n-\n-\n-
    309
    \n-
    315 virtual int nVertices(Dune::RefinementIntervals tag) const = 0;
    \n-
    316
    \n-\n-
    323
    \n-\n-
    330
    \n-
    336 virtual int nElements(Dune::RefinementIntervals tag) const = 0;
    \n-
    337
    \n-\n-
    344
    \n-\n-
    351
    \n+
    8#include <cassert>
    \n+
    9#include <functional>
    \n+
    10#include <limits>
    \n+
    11#include <type_traits>
    \n+
    12#include <vector>
    \n+
    13
    \n+
    14#include <dune/common/fmatrix.hh>
    \n+
    15#include <dune/common/fvector.hh>
    \n+
    16#include <dune/common/math.hh>
    \n+
    17#include <dune/common/typetraits.hh>
    \n+
    18#include <dune/common/std/type_traits.hh>
    \n+
    19
    \n+
    20#include <dune/geometry/affinegeometry.hh> // for FieldMatrixHelper
    \n+\n+\n+
    23#include <dune/geometry/type.hh>
    \n+\n+\n+
    26
    \n+
    27namespace Dune {
    \n+
    28
    \n+
    38template <class LFE, int cdim>
    \n+
    \n+\n+
    40{
    \n+
    41 using LocalFiniteElement = LFE;
    \n+
    42 using LocalBasis = typename LFE::Traits::LocalBasisType;
    \n+
    43 using LocalBasisTraits = typename LocalBasis::Traits;
    \n+
    44
    \n+
    45public:
    \n+
    47 using ctype = typename LocalBasisTraits::DomainFieldType;
    \n+
    48
    \n+
    50 static const int mydimension = LocalBasisTraits::dimDomain;
    \n+
    51
    \n+
    53 static const int coorddimension = cdim;
    \n+
    54
    \n+
    56 using LocalCoordinate = FieldVector<ctype, mydimension>;
    \n+
    57
    \n+
    59 using GlobalCoordinate = FieldVector<ctype, coorddimension>;
    \n+
    60
    \n+
    62 using Volume = decltype(power(std::declval<ctype>(),mydimension));
    \n+
    63
    \n+
    65 using Jacobian = FieldMatrix<ctype, coorddimension, mydimension>;
    \n+
    66
    \n+
    68 using JacobianTransposed = FieldMatrix<ctype, mydimension, coorddimension>;
    \n+
    69
    \n+
    71 using JacobianInverse = FieldMatrix<ctype, mydimension, coorddimension>;
    \n+
    72
    \n+
    74 using JacobianInverseTransposed = FieldMatrix<ctype, coorddimension, mydimension>;
    \n+
    75
    \n+
    76public:
    \n+\n+\n+
    80
    \n+
    81protected:
    \n+
    82 using MatrixHelper = Impl::FieldMatrixHelper<ctype>;
    \n+
    83
    \n+
    84public:
    \n+\n+
    87
    \n+
    \n+\n+
    104 const LocalFiniteElement& localFE,
    \n+
    105 std::vector<GlobalCoordinate> vertices)
    \n+
    106 : refElement_(refElement)
    \n+
    107 , localFE_(localFE)
    \n+
    108 , vertices_(std::move(vertices))
    \n+
    109 {
    \n+
    110 assert(localFE_.size() == vertices_.size());
    \n+
    111 }
    \n+
    \n+
    112
    \n+
    126 template <class Param,
    \n+
    127 std::enable_if_t<std::is_invocable_r_v<GlobalCoordinate,Param,LocalCoordinate>, int> = 0>
    \n+
    \n+\n+
    129 const LocalFiniteElement& localFE,
    \n+
    130 Param&& parametrization)
    \n+
    131 : refElement_(refElement)
    \n+
    132 , localFE_(localFE)
    \n+
    133 {
    \n+
    134 localFE_.localInterpolation().interpolate(parametrization, vertices_);
    \n+
    135 }
    \n+
    \n+
    136
    \n+
    143 template <class... Args>
    \n+
    \n+
    144 explicit LocalFiniteElementGeometry (GeometryType gt, Args&&... args)
    \n+
    145 : LocalFiniteElementGeometry(ReferenceElements::general(gt), std::forward<Args>(args)...)
    \n+
    146 {}
    \n+
    \n+
    147
    \n+
    \n+
    149 int order () const
    \n+
    150 {
    \n+
    151 return localBasis().order();
    \n+
    152 }
    \n+
    \n+
    153
    \n+
    \n+
    159 bool affine () const
    \n+
    160 {
    \n+
    161 if (!affine_)
    \n+
    162 affine_.emplace(affineImpl());
    \n+
    163 return *affine_;
    \n+
    164 }
    \n+
    \n+
    165
    \n+
    \n+\n+
    168 {
    \n+
    169 return refElement_.type();
    \n+
    170 }
    \n+
    \n+
    171
    \n+
    \n+
    173 int corners () const
    \n+
    174 {
    \n+
    175 return refElement_.size(mydimension);
    \n+
    176 }
    \n+
    \n+
    177
    \n+
    \n+\n+
    180 {
    \n+
    181 assert( (i >= 0) && (i < corners()) );
    \n+
    182 return global(refElement_.position(i, mydimension));
    \n+
    183 }
    \n+
    \n+
    184
    \n+
    \n+\n+
    187 {
    \n+
    188 return global(refElement_.position(0, 0));
    \n+
    189 }
    \n+
    \n+
    190
    \n+
    \n+\n+
    203 {
    \n+
    204 thread_local std::vector<typename LocalBasisTraits::RangeType> shapeValues;
    \n+
    205 localBasis().evaluateFunction(local, shapeValues);
    \n+
    206 assert(shapeValues.size() == vertices_.size());
    \n+
    207
    \n+
    208 GlobalCoordinate out(0);
    \n+
    209 for (std::size_t i = 0; i < shapeValues.size(); ++i)
    \n+
    210 out.axpy(shapeValues[i], vertices_[i]);
    \n+
    211
    \n+
    212 return out;
    \n+
    213 }
    \n+
    \n+
    214
    \n+
    \n+
    232 LocalCoordinate local (const GlobalCoordinate& y, Impl::GaussNewtonOptions<ctype> opts = {}) const
    \n+
    233 {
    \n+
    234 LocalCoordinate x = refElement_.position(0,0);
    \n+
    235 Impl::GaussNewtonErrorCode err = Impl::gaussNewton(
    \n+
    236 [&](const LocalCoordinate& local) { return this->global(local); },
    \n+
    237 [&](const LocalCoordinate& local) { return this->jacobianTransposed(local); },
    \n+
    238 y, x, opts
    \n+
    239 );
    \n+
    240
    \n+
    241 if (err != Impl::GaussNewtonErrorCode::OK)
    \n+
    242 DUNE_THROW(Dune::Exception,
    \n+
    243 "Local coordinate can not be recovered from global coordinate, error code = " << int(err) << "\\n"
    \n+
    244 << " (global(x) - y).two_norm() = " << (global(x) - y).two_norm()
    \n+
    245 << " > tol = " << opts.absTol);
    \n+
    246
    \n+
    247 return x;
    \n+
    248 }
    \n+
    \n+
    249
    \n+
    \n+\n+
    261 {
    \n+
    262 return MatrixHelper::sqrtDetAAT(jacobianTransposed(local));
    \n+
    263 }
    \n+
    \n+
    264
    \n+
    \n+
    276 Volume volume (Impl::ConvergenceOptions<ctype> opts = {}) const
    \n+
    277 {
    \n+\n+
    279 if (affine())
    \n+
    280 return vol0;
    \n+
    281
    \n+
    282 using std::abs;
    \n+
    283 for (int p = 2; p < opts.maxIt; ++p) {
    \n+\n+
    285 if (abs(vol1 - vol0) < opts.absTol)
    \n+
    286 return vol1;
    \n+
    287
    \n+
    288 vol0 = vol1;
    \n+
    289 }
    \n+
    290 return vol0;
    \n+
    291 }
    \n+
    \n+
    292
    \n+
    \n+\n+
    295 {
    \n+
    296 Volume vol(0);
    \n+
    297 for (const auto& qp : quadRule)
    \n+
    298 vol += integrationElement(qp.position()) * qp.weight();
    \n+
    299 return vol;
    \n+
    300 }
    \n+
    \n+
    301
    \n+
    \n+\n+
    308 {
    \n+
    309 thread_local std::vector<typename LocalBasisTraits::JacobianType> shapeJacobians;
    \n+
    310 localBasis().evaluateJacobian(local, shapeJacobians);
    \n+
    311 assert(shapeJacobians.size() == vertices_.size());
    \n+
    312
    \n+
    313 Jacobian out(0);
    \n+
    314 for (std::size_t i = 0; i < shapeJacobians.size(); ++i) {
    \n+
    315 for (int j = 0; j < Jacobian::rows; ++j) {
    \n+
    316 shapeJacobians[i].umtv(vertices_[i][j], out[j]);
    \n+
    317 }
    \n+
    318 }
    \n+
    319 return out;
    \n+
    320 }
    \n+
    \n+
    321
    \n+
    \n+\n+
    328 {
    \n+
    329 return jacobian(local).transposed();
    \n+
    330 }
    \n+
    \n+
    331
    \n+
    \n+\n+
    340 {
    \n+
    341 JacobianInverse out;
    \n+
    342 MatrixHelper::leftInvA(jacobian(local), out);
    \n+
    343 return out;
    \n+
    344 }
    \n+
    \n+
    345
    \n
    \n-\n-
    354 {}
    \n+\n+
    354 {
    \n+
    355 return jacobianInverse(local).transposed();
    \n+
    356 }
    \n+
    \n+
    357
    \n+
    \n+\n+
    360 {
    \n+
    361 return geometry.refElement_;
    \n+
    362 }
    \n+
    \n+
    363
    \n+
    \n+
    365 const LocalFiniteElement& finiteElement () const
    \n+
    366 {
    \n+
    367 return localFE_;
    \n+
    368 }
    \n+
    \n+
    369
    \n+
    \n+
    371 const std::vector<GlobalCoordinate>& coefficients () const
    \n+
    372 {
    \n+
    373 return vertices_;
    \n+
    374 }
    \n
    \n-
    355
    \n-
    356 protected:
    \n-\n-\n-\n-\n-
    361 };
    \n-
    \n-
    362
    \n-
    364 template<int dimension, class CoordType>
    \n-
    365 template<int codimension>
    \n-
    \n-
    366 struct VirtualRefinement<dimension, CoordType>::Codim
    \n-
    367 {
    \n-
    368 class SubEntityIterator;
    \n-
    369 };
    \n-
    \n-
    370
    \n-
    371 // ////////////////////////
    \n-
    372 //
    \n-
    373 // The refinement builder
    \n-
    374 //
    \n
    375
    \n-
    376 template<int dimension, class CoordType>
    \n-\n-
    378 buildRefinement(GeometryType geometryType, GeometryType coerceTo);
    \n-
    379
    \n-
    380} // namespace Dune
    \n+
    \n+
    377 const LocalBasis& localBasis () const
    \n+
    378 {
    \n+
    379 return localFE_.localBasis();
    \n+
    380 }
    \n+
    \n
    381
    \n-
    382#include "virtualrefinement.cc"
    \n+
    382private:
    \n
    383
    \n-
    384#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_HH
    \n-
    This file simply includes all Refinement implementations so you don't have to do them separately.
    \n-
    This file contains the virtual wrapper around refinement.
    \n-
    A unique label for each type of element that can occur in a grid.
    \n+
    384 bool affineImpl () const
    \n+
    385 {
    \n+
    386 if constexpr(mydimension == 0)
    \n+
    387 // point geometries are always affine mappings
    \n+
    388 return true;
    \n+
    389 else {
    \n+
    390 if (order() > 1)
    \n+
    391 // higher-order parametrizations are by definition not affine
    \n+
    392 return false;
    \n+
    393 if constexpr(mydimension == 1)
    \n+
    394 // linear line geometries are affine mappings
    \n+
    395 return true;
    \n+
    396 else {
    \n+
    397 if (type().isSimplex())
    \n+
    398 // linear simplex geometries are affine mappings
    \n+
    399 return true;
    \n+
    400
    \n+
    401 // multi-linear mappings on non-simplex geometries might be affine
    \n+
    402 // as well. This is tested explicitly for all vertices by constructing
    \n+
    403 // an affine mapping from dim+1 affine-independent corners and evaluating
    \n+
    404 // at the other corners.
    \n+
    405 auto refSimplex = referenceElement<ctype,mydimension>(GeometryTypes::simplex(mydimension));
    \n+
    406 auto simplexIndices = Dune::range(refSimplex.size(mydimension));
    \n+
    407 auto simplexCorners = Dune::transformedRangeView(simplexIndices,
    \n+
    408 [&](int i) { return this->global(refSimplex.position(i,mydimension)); });
    \n+
    409 AffineGeometry<ctype,mydimension,coorddimension> affineGeo(refSimplex,simplexCorners);
    \n+
    410 using std::sqrt;
    \n+
    411 const ctype tol = sqrt(std::numeric_limits<ctype>::epsilon());
    \n+
    412 for (int i = 0; i < corners(); ++i) {
    \n+
    413 const auto corner = refElement_.position(i,mydimension);
    \n+
    414 if ((affineGeo.global(corner) - global(corner)).two_norm() > tol)
    \n+
    415 return false;
    \n+
    416 }
    \n+
    417 return true;
    \n+
    418 }
    \n+
    419 }
    \n+
    420 }
    \n+
    421
    \n+
    422private:
    \n+
    424 ReferenceElement refElement_{};
    \n+
    425
    \n+
    427 LocalFiniteElement localFE_{};
    \n+
    428
    \n+
    430 std::vector<GlobalCoordinate> vertices_{};
    \n+
    431
    \n+
    432 mutable std::optional<bool> affine_ = std::nullopt;
    \n+
    433};
    \n+
    \n+
    434
    \n+
    435namespace Impl {
    \n+
    436
    \n+
    437// extract the LocalCoordinate type from a LocalFiniteElement
    \n+
    438template <class LFE>
    \n+
    439using LocalCoordinate_t
    \n+
    440 = FieldVector<typename LFE::Traits::LocalBasisType::Traits::DomainFieldType,
    \n+
    441 LFE::Traits::LocalBasisType::Traits::dimDomain>;
    \n+
    442
    \n+
    443} // end namespace Impl
    \n+
    444
    \n+
    445
    \n+
    446// deduction guides
    \n+
    447template <class I, class LFE, class GlobalCoordinate>
    \n+
    448LocalFiniteElementGeometry (Geo::ReferenceElement<I>, const LFE&, std::vector<GlobalCoordinate>)
    \n+\n+
    450
    \n+
    451template <class I, class LFE, class F,
    \n+
    452 class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
    \n+\n+\n+
    455
    \n+
    456template <class LFE, class GlobalCoordinate>
    \n+
    457LocalFiniteElementGeometry (GeometryType, const LFE& localFE, std::vector<GlobalCoordinate>)
    \n+\n+
    459
    \n+
    460template <class LFE, class F,
    \n+
    461 class Range = std::invoke_result_t<F,Impl::LocalCoordinate_t<LFE>>>
    \n+\n+\n+
    464
    \n+
    465} // namespace Dune
    \n+
    466
    \n+
    467#endif // DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH
    \n+
    An implementation of the Geometry interface for affine geometries.
    \n+\n+
    A unique label for each type of element that can occur in a grid.
    \n+\n+\n+\n+
    STL namespace.
    \n
    Definition affinegeometry.hh:21
    \n-
    VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType geometryType, GeometryType coerceTo)
    return a reference to the VirtualRefinement according to the parameters
    Definition virtualrefinement.cc:503
    \n-
    Holds the number of refined intervals per axis needed for virtual and static refinement.
    Definition base.cc:94
    \n+
    This class provides access to geometric and topological properties of a reference element.
    Definition referenceelement.hh:52
    \n+
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n+
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n+
    Geometry implementation based on local-basis function parametrization.
    Definition localfiniteelementgeometry.hh:40
    \n+
    GeometryType type() const
    Obtain the name of the reference element.
    Definition localfiniteelementgeometry.hh:167
    \n+
    decltype(power(std::declval< ctype >(), mydimension)) Volume
    type of volume
    Definition localfiniteelementgeometry.hh:62
    \n+
    LocalCoordinate local(const GlobalCoordinate &y, Impl::GaussNewtonOptions< ctype > opts={}) const
    Evaluate the inverse coordinate mapping.
    Definition localfiniteelementgeometry.hh:232
    \n+
    LocalFiniteElementGeometry(const ReferenceElement &refElement, const LocalFiniteElement &localFE, std::vector< GlobalCoordinate > vertices)
    Constructor from a vector of coefficients of the LocalBasis parametrizing the geometry.
    Definition localfiniteelementgeometry.hh:103
    \n+
    JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const
    Obtain the transposed of the Jacobian.
    Definition localfiniteelementgeometry.hh:327
    \n+
    const LocalBasis & localBasis() const
    The local basis of the stored local finite-element.
    Definition localfiniteelementgeometry.hh:377
    \n+
    typename LocalBasisTraits::DomainFieldType ctype
    coordinate type
    Definition localfiniteelementgeometry.hh:47
    \n+
    JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate &local) const
    Obtain the transposed of the Jacobian's inverse.
    Definition localfiniteelementgeometry.hh:353
    \n+
    friend ReferenceElement referenceElement(const LocalFiniteElementGeometry &geometry)
    Obtain the reference-element related to this geometry.
    Definition localfiniteelementgeometry.hh:359
    \n+
    LocalFiniteElementGeometry()=default
    Default constructed geometry results in an empty/invalid representation.
    \n+
    bool affine() const
    Is this mapping affine? Geometries of order 1 might be affine, but it needs to be checked on non-simp...
    Definition localfiniteelementgeometry.hh:159
    \n+
    Jacobian jacobian(const LocalCoordinate &local) const
    Obtain the Jacobian.
    Definition localfiniteelementgeometry.hh:307
    \n+
    Volume volume(const QuadratureRule< ctype, mydimension > &quadRule) const
    Obtain the volume of the mapping's image by given quadrature rules.
    Definition localfiniteelementgeometry.hh:294
    \n+
    const std::vector< GlobalCoordinate > & coefficients() const
    Obtain the coefficients of the parametrization.
    Definition localfiniteelementgeometry.hh:371
    \n+
    LocalFiniteElementGeometry(GeometryType gt, Args &&... args)
    Constructor, forwarding to the other constructors that take a reference-element.
    Definition localfiniteelementgeometry.hh:144
    \n+
    static const int coorddimension
    coordinate dimension
    Definition localfiniteelementgeometry.hh:53
    \n+
    int corners() const
    Obtain number of corners of the corresponding reference element.
    Definition localfiniteelementgeometry.hh:173
    \n+
    GlobalCoordinate center() const
    Obtain the centroid of the mapping's image.
    Definition localfiniteelementgeometry.hh:186
    \n+
    const LocalFiniteElement & finiteElement() const
    Obtain the local finite-element.
    Definition localfiniteelementgeometry.hh:365
    \n+
    GlobalCoordinate global(const LocalCoordinate &local) const
    Evaluate the coordinate mapping.
    Definition localfiniteelementgeometry.hh:202
    \n+
    Impl::FieldMatrixHelper< ctype > MatrixHelper
    Definition localfiniteelementgeometry.hh:82
    \n+
    typename ReferenceElements::ReferenceElement ReferenceElement
    Definition localfiniteelementgeometry.hh:79
    \n+
    GlobalCoordinate corner(int i) const
    Obtain coordinates of the i-th corner.
    Definition localfiniteelementgeometry.hh:179
    \n+
    Volume volume(Impl::ConvergenceOptions< ctype > opts={}) const
    Obtain the volume of the mapping's image.
    Definition localfiniteelementgeometry.hh:276
    \n+
    static const int mydimension
    geometry dimension
    Definition localfiniteelementgeometry.hh:50
    \n+
    JacobianInverse jacobianInverse(const LocalCoordinate &local) const
    Obtain the Jacobian's inverse.
    Definition localfiniteelementgeometry.hh:339
    \n+
    FieldVector< ctype, coorddimension > GlobalCoordinate
    type of global coordinates
    Definition localfiniteelementgeometry.hh:59
    \n+
    FieldMatrix< ctype, coorddimension, mydimension > Jacobian
    type of jacobian
    Definition localfiniteelementgeometry.hh:65
    \n+
    FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed
    type of jacobian inverse transposed
    Definition localfiniteelementgeometry.hh:74
    \n+
    FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse
    type of jacobian inverse
    Definition localfiniteelementgeometry.hh:71
    \n+
    ctype integrationElement(const LocalCoordinate &local) const
    Obtain the integration element.
    Definition localfiniteelementgeometry.hh:260
    \n+
    int order() const
    Obtain the (highest) polynomial order of the parametrization.
    Definition localfiniteelementgeometry.hh:149
    \n+
    FieldVector< ctype, mydimension > LocalCoordinate
    type of local coordinates
    Definition localfiniteelementgeometry.hh:56
    \n+
    FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed
    type of jacobian transposed
    Definition localfiniteelementgeometry.hh:68
    \n+
    LocalFiniteElementGeometry(const ReferenceElement &refElement, const LocalFiniteElement &localFE, Param &&parametrization)
    Constructor from a local parametrization function, mapping local to (curved) global coordinates.
    Definition localfiniteelementgeometry.hh:128
    \n+
    Abstract base class for quadrature rules.
    Definition quadraturerules.hh:214
    \n+
    A container for all quadrature rules of dimension dim
    Definition quadraturerules.hh:260
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n-
    Definition virtualrefinement.cc:231
    \n-
    VirtualRefinement base class.
    Definition virtualrefinement.hh:283
    \n-
    SubEntityIteratorBack< dimension > VertexIteratorBack
    Definition virtualrefinement.hh:307
    \n-
    virtual ElementIteratorBack * eEndBack(Dune::RefinementIntervals tag) const =0
    \n-
    VertexIterator vBegin(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:38
    \n-
    ElementIterator eBegin(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:54
    \n-
    virtual int nElements(Dune::RefinementIntervals tag) const =0
    Get the number of Elements.
    \n-
    ElementIterator eEnd(Dune::RefinementIntervals tag) const
    Get an ElementIterator.
    Definition virtualrefinement.cc:62
    \n-
    Codim< 0 >::SubEntityIterator ElementIterator
    The ElementIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:290
    \n-
    virtual ~VirtualRefinement()
    Destructor.
    Definition virtualrefinement.hh:353
    \n-
    VertexIterator vEnd(Dune::RefinementIntervals tag) const
    Get an VertexIterator.
    Definition virtualrefinement.cc:46
    \n-
    FieldVector< CoordType, dimension > CoordVector
    The CoordVector of the VirtualRefinement.
    Definition virtualrefinement.hh:297
    \n-
    virtual int nVertices(Dune::RefinementIntervals tag) const =0
    Get the number of Vertices.
    \n-
    std::vector< int > IndexVector
    The IndexVector of the VirtualRefinement.
    Definition virtualrefinement.hh:303
    \n-
    Codim< dimension >::SubEntityIterator VertexIterator
    The VertexIterator of the VirtualRefinement.
    Definition virtualrefinement.hh:288
    \n-
    virtual VertexIteratorBack * vEndBack(Dune::RefinementIntervals tag) const =0
    \n-
    SubEntityIteratorBack< 0 > ElementIteratorBack
    Definition virtualrefinement.hh:308
    \n-
    virtual ElementIteratorBack * eBeginBack(Dune::RefinementIntervals tag) const =0
    \n-
    virtual VertexIteratorBack * vBeginBack(Dune::RefinementIntervals tag) const =0
    \n-
    codim database of VirtualRefinement
    Definition virtualrefinement.hh:367
    \n+
    constexpr bool isSimplex() const
    Return true if entity is a simplex of any dimension.
    Definition type.hh:319
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,186 +1,531 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-virtualrefinement.hh\n+localfiniteelementgeometry.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n-6#define DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n+5#ifndef DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n+6#define DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n 7\n-257#include \n-258\n-259#include \n-260\n-261#include \"_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\"\n-262#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-263\n-264namespace _\bD_\bu_\bn_\be\n-265{\n-266 // //////////////////////////////////////////\n-267 //\n-268 // The virtual base class and its iterators\n-269 //\n-270\n-271 //\n-272 // Refinement\n-273 //\n-274\n-281 template\n-_\b2_\b8_\b2 class _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-283 {\n-284 public:\n-285 template\n-286 struct _\bC_\bo_\bd_\bi_\bm;\n-_\b2_\b8_\b8 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b2_\b9_\b0 typedef typename _\bC_\bo_\bd_\bi_\bm_\b<_\b0_\b>_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-291\n-_\b2_\b9_\b7 typedef FieldVector _\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br;\n-_\b3_\b0_\b3 typedef std::vector _\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br;\n-304\n-305 template\n-306 class _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n-_\b3_\b0_\b7 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b> _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n-_\b3_\b0_\b8 typedef _\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk_\b<_\b0_\b> _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk;\n-309\n-_\b3_\b1_\b5 virtual int _\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const = 0;\n-316\n-322 _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n-323\n-329 _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bv_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n-330\n-_\b3_\b3_\b6 virtual int _\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const = 0;\n-337\n-343 _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bB_\be_\bg_\bi_\bn(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n-344\n-350 _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bE_\bn_\bd(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const;\n-351\n-_\b3_\b5_\b3 virtual _\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt()\n-354 {}\n-355\n-356 protected:\n-_\b3_\b5_\b7 virtual _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-= 0;\n-_\b3_\b5_\b8 virtual _\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\bv_\bE_\bn_\bd_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const =\n-0;\n-_\b3_\b5_\b9 virtual _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag)\n-const = 0;\n-_\b3_\b6_\b0 virtual _\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk *_\be_\bE_\bn_\bd_\bB_\ba_\bc_\bk(_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs tag) const\n-= 0;\n-361 };\n-362\n-364 template\n-365 template\n-_\b3_\b6_\b6 struct _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt::_\bC_\bo_\bd_\bi_\bm\n-367 {\n-368 class SubEntityIterator;\n-369 };\n-370\n-371 // ////////////////////////\n-372 //\n-373 // The refinement builder\n-374 //\n+8#include \n+9#include \n+10#include \n+11#include \n+12#include \n+13\n+14#include \n+15#include \n+16#include \n+17#include \n+18#include \n+19\n+20#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh> // for FieldMatrixHelper\n+21#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh>\n+22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n+24#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh>\n+25#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b/_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh>\n+26\n+27namespace _\bD_\bu_\bn_\be {\n+28\n+38template \n+_\b3_\b9class _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+40{\n+41 using LocalFiniteElement = LFE;\n+42 using LocalBasis = typename LFE::Traits::LocalBasisType;\n+43 using LocalBasisTraits = typename LocalBasis::Traits;\n+44\n+45public:\n+_\b4_\b7 using _\bc_\bt_\by_\bp_\be = typename LocalBasisTraits::DomainFieldType;\n+48\n+_\b5_\b0 static const int _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = LocalBasisTraits::dimDomain;\n+51\n+_\b5_\b3 static const int _\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = cdim;\n+54\n+_\b5_\b6 using _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = FieldVector;\n+57\n+_\b5_\b9 using _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = FieldVector;\n+60\n+_\b6_\b2 using _\bV_\bo_\bl_\bu_\bm_\be = decltype(power(std::declval(),_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n+63\n+_\b6_\b5 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn = FieldMatrix;\n+66\n+_\b6_\b8 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd = FieldMatrix;\n+69\n+_\b7_\b1 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be = FieldMatrix;\n+72\n+_\b7_\b4 using _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd = FieldMatrix;\n+75\n+76public:\n+_\b7_\b8 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs = _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n+_\b7_\b9 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = typename _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n+80\n+81protected:\n+_\b8_\b2 using _\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br = Impl::FieldMatrixHelper;\n+83\n+84public:\n+_\b8_\b6 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by () = default;\n+87\n+_\b1_\b0_\b3 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& refElement,\n+104 const LocalFiniteElement& localFE,\n+105 std::vector vertices)\n+106 : refElement_(refElement)\n+107 , localFE_(localFE)\n+108 , vertices_(_\bs_\bt_\bd::move(vertices))\n+109 {\n+110 assert(localFE_.size() == vertices_.size());\n+111 }\n+112\n+126 template , int> = 0>\n+_\b1_\b2_\b8 _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& refElement,\n+129 const LocalFiniteElement& localFE,\n+130 Param&& parametrization)\n+131 : refElement_(refElement)\n+132 , localFE_(localFE)\n+133 {\n+134 localFE_.localInterpolation().interpolate(parametrization, vertices_);\n+135 }\n+136\n+143 template \n+_\b1_\b4_\b4 explicit _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt, Args&&... args)\n+145 : _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by(_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs::general(gt), _\bs_\bt_\bd::\n+forward(args)...)\n+146 {}\n+147\n+_\b1_\b4_\b9 int _\bo_\br_\bd_\be_\br () const\n+150 {\n+151 return _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().order();\n+152 }\n+153\n+_\b1_\b5_\b9 bool _\ba_\bf_\bf_\bi_\bn_\be () const\n+160 {\n+161 if (!affine_)\n+162 affine_.emplace(affineImpl());\n+163 return *affine_;\n+164 }\n+165\n+_\b1_\b6_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be () const\n+168 {\n+169 return refElement_.type();\n+170 }\n+171\n+_\b1_\b7_\b3 int _\bc_\bo_\br_\bn_\be_\br_\bs () const\n+174 {\n+175 return refElement_.size(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n+176 }\n+177\n+_\b1_\b7_\b9 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\bo_\br_\bn_\be_\br (int i) const\n+180 {\n+181 assert( (i >= 0) && (i < _\bc_\bo_\br_\bn_\be_\br_\bs()) );\n+182 return _\bg_\bl_\bo_\bb_\ba_\bl(refElement_.position(i, _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n+183 }\n+184\n+_\b1_\b8_\b6 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bc_\be_\bn_\bt_\be_\br () const\n+187 {\n+188 return _\bg_\bl_\bo_\bb_\ba_\bl(refElement_.position(0, 0));\n+189 }\n+190\n+_\b2_\b0_\b2 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bg_\bl_\bo_\bb_\ba_\bl (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+203 {\n+204 thread_local std::vector shapeValues;\n+205 _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().evaluateFunction(_\bl_\bo_\bc_\ba_\bl, shapeValues);\n+206 assert(shapeValues.size() == vertices_.size());\n+207\n+208 _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be out(0);\n+209 for (std::size_t i = 0; i < shapeValues.size(); ++i)\n+210 out.axpy(shapeValues[i], vertices_[i]);\n+211\n+212 return out;\n+213 }\n+214\n+_\b2_\b3_\b2 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bl_\bo_\bc_\ba_\bl (const _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& y, Impl::\n+GaussNewtonOptions opts = {}) const\n+233 {\n+234 _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be x = refElement_.position(0,0);\n+235 Impl::GaussNewtonErrorCode err = Impl::gaussNewton(\n+236 [&](const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) { return this->_\bg_\bl_\bo_\bb_\ba_\bl(local); },\n+237 [&](const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) { return this->_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(local);\n+},\n+238 y, x, opts\n+239 );\n+240\n+241 if (err != Impl::GaussNewtonErrorCode::OK)\n+242 DUNE_THROW(Dune::Exception,\n+243 \"Local coordinate can not be recovered from global coordinate, error code =\n+\" << int(err) << \"\\n\"\n+244 << \" (global(x) - y).two_norm() = \" << (_\bg_\bl_\bo_\bb_\ba_\bl(x) - y).two_norm()\n+245 << \" > tol = \" << opts.absTol);\n+246\n+247 return x;\n+248 }\n+249\n+_\b2_\b6_\b0 _\bc_\bt_\by_\bp_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+261 {\n+262 return MatrixHelper::sqrtDetAAT(_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd(_\bl_\bo_\bc_\ba_\bl));\n+263 }\n+264\n+_\b2_\b7_\b6 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be (Impl::ConvergenceOptions opts = {}) const\n+277 {\n+278 _\bV_\bo_\bl_\bu_\bm_\be vol0 = _\bv_\bo_\bl_\bu_\bm_\be(_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\br_\bu_\bl_\be(_\bt_\by_\bp_\be(), 1));\n+279 if (_\ba_\bf_\bf_\bi_\bn_\be())\n+280 return vol0;\n+281\n+282 using std::abs;\n+283 for (int p = 2; p < opts.maxIt; ++p) {\n+284 _\bV_\bo_\bl_\bu_\bm_\be vol1 = _\bv_\bo_\bl_\bu_\bm_\be(_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>_\b:_\b:_\br_\bu_\bl_\be(_\bt_\by_\bp_\be(), p));\n+285 if (abs(vol1 - vol0) < opts.absTol)\n+286 return vol1;\n+287\n+288 vol0 = vol1;\n+289 }\n+290 return vol0;\n+291 }\n+292\n+_\b2_\b9_\b4 _\bV_\bo_\bl_\bu_\bm_\be _\bv_\bo_\bl_\bu_\bm_\be (const _\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\b<_\bc_\bt_\by_\bp_\be_\b,_\b _\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>& quadRule) const\n+295 {\n+296 _\bV_\bo_\bl_\bu_\bm_\be vol(0);\n+297 for (const auto& qp : quadRule)\n+298 vol += _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt(qp.position()) * qp.weight();\n+299 return vol;\n+300 }\n+301\n+_\b3_\b0_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+308 {\n+309 thread_local std::vector\n+shapeJacobians;\n+310 _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs().evaluateJacobian(_\bl_\bo_\bc_\ba_\bl, shapeJacobians);\n+311 assert(shapeJacobians.size() == vertices_.size());\n+312\n+313 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn out(0);\n+314 for (std::size_t i = 0; i < shapeJacobians.size(); ++i) {\n+315 for (int j = 0; j < Jacobian::rows; ++j) {\n+316 shapeJacobians[i].umtv(vertices_[i][j], out[j]);\n+317 }\n+318 }\n+319 return out;\n+320 }\n+321\n+_\b3_\b2_\b7 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+328 {\n+329 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn(_\bl_\bo_\bc_\ba_\bl).transposed();\n+330 }\n+331\n+_\b3_\b3_\b9 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& _\bl_\bo_\bc_\ba_\bl) const\n+340 {\n+341 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be out;\n+342 MatrixHelper::leftInvA(_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn(_\bl_\bo_\bc_\ba_\bl), out);\n+343 return out;\n+344 }\n+345\n+_\b3_\b5_\b3 _\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd (const _\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be&\n+_\bl_\bo_\bc_\ba_\bl) const\n+354 {\n+355 return _\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be(_\bl_\bo_\bc_\ba_\bl).transposed();\n+356 }\n+357\n+_\b3_\b5_\b9 friend _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by&\n+geometry)\n+360 {\n+361 return geometry.refElement_;\n+362 }\n+363\n+_\b3_\b6_\b5 const LocalFiniteElement& _\bf_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt () const\n+366 {\n+367 return localFE_;\n+368 }\n+369\n+_\b3_\b7_\b1 const std::vector& _\bc_\bo_\be_\bf_\bf_\bi_\bc_\bi_\be_\bn_\bt_\bs () const\n+372 {\n+373 return vertices_;\n+374 }\n 375\n-376 template\n-377 _\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b<_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b,_\b _\bC_\bo_\bo_\br_\bd_\bT_\by_\bp_\be_\b> &\n-378 _\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be geometryType, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be coerceTo);\n-379\n-380} // namespace Dune\n+_\b3_\b7_\b7 const LocalBasis& _\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs () const\n+378 {\n+379 return localFE_.localBasis();\n+380 }\n 381\n-382#include \"_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\"\n+382private:\n 383\n-384#endif // DUNE_GEOMETRY_VIRTUALREFINEMENT_HH\n-_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n-This file simply includes all Refinement implementations so you don't have to\n-do them separately.\n-_\bv_\bi_\br_\bt_\bu_\ba_\bl_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bc_\bc\n-This file contains the virtual wrapper around refinement.\n+384 bool affineImpl () const\n+385 {\n+386 if constexpr(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn == 0)\n+387 // point geometries are always affine mappings\n+388 return true;\n+389 else {\n+390 if (_\bo_\br_\bd_\be_\br() > 1)\n+391 // higher-order parametrizations are by definition not affine\n+392 return false;\n+393 if constexpr(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn == 1)\n+394 // linear line geometries are affine mappings\n+395 return true;\n+396 else {\n+397 if (_\bt_\by_\bp_\be()._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n+398 // linear simplex geometries are affine mappings\n+399 return true;\n+400\n+401 // multi-linear mappings on non-simplex geometries might be affine\n+402 // as well. This is tested explicitly for all vertices by constructing\n+403 // an affine mapping from dim+1 affine-independent corners and evaluating\n+404 // at the other corners.\n+405 auto refSimplex = referenceElement(GeometryTypes::\n+simplex(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n+406 auto simplexIndices = Dune::range(refSimplex.size(_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn));\n+407 auto simplexCorners = Dune::transformedRangeView(simplexIndices,\n+408 [&](int i) { return this->_\bg_\bl_\bo_\bb_\ba_\bl(refSimplex.position(i,_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn)); });\n+409 AffineGeometry affineGeo\n+(refSimplex,simplexCorners);\n+410 using std::sqrt;\n+411 const _\bc_\bt_\by_\bp_\be tol = sqrt(std::numeric_limits::epsilon());\n+412 for (int i = 0; i < _\bc_\bo_\br_\bn_\be_\br_\bs(); ++i) {\n+413 const auto _\bc_\bo_\br_\bn_\be_\br = refElement_.position(i,_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn);\n+414 if ((affineGeo.global(_\bc_\bo_\br_\bn_\be_\br) - _\bg_\bl_\bo_\bb_\ba_\bl(_\bc_\bo_\br_\bn_\be_\br)).two_norm() > tol)\n+415 return false;\n+416 }\n+417 return true;\n+418 }\n+419 }\n+420 }\n+421\n+422private:\n+424 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt refElement_{};\n+425\n+427 LocalFiniteElement localFE_{};\n+428\n+430 std::vector vertices_{};\n+431\n+432 mutable std::optional affine_ = std::nullopt;\n+433};\n+434\n+435namespace Impl {\n+436\n+437// extract the LocalCoordinate type from a LocalFiniteElement\n+438template \n+439using LocalCoordinate_t\n+440 = FieldVector;\n+442\n+443} // end namespace Impl\n+444\n+445\n+446// deduction guides\n+447template \n+_\b4_\b4_\b8_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\bI_\b>, const LFE&, std::\n+vector)\n+449 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n+450\n+451template >>\n+_\b4_\b5_\b3_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\bI_\b>, const LFE&, const F&)\n+454 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bR_\ba_\bn_\bg_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n+455\n+456template \n+_\b4_\b5_\b7_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE& localFE, std::\n+vector)\n+458 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n+459\n+460template >>\n+_\b4_\b6_\b2_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by (_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be, const LFE&, const F&)\n+463 -> _\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b<_\bL_\bF_\bE_\b,_\b _\bR_\ba_\bn_\bg_\be_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b>;\n+464\n+465} // namespace Dune\n+466\n+467#endif // DUNE_GEOMETRY_LOCALFINITEELEMENTGEOMETRY_HH\n+_\ba_\bf_\bf_\bi_\bn_\be_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b._\bh_\bh\n+An implementation of the Geometry interface for affine geometries.\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n+_\bq_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\br_\bu_\bl_\be_\bs_\b._\bh_\bh\n+_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bn_\bc_\be_\b._\bh_\bh\n+_\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\bs_\b._\bh_\bh\n+_\bs_\bt_\bd\n+STL namespace.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bu_\bi_\bl_\bd_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement< dimension, CoordType > & buildRefinement(GeometryType\n-geometryType, GeometryType coerceTo)\n-return a reference to the VirtualRefinement according to the parameters\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:503\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bv_\ba_\bl_\bs\n-Holds the number of refined intervals per axis needed for virtual and static\n-refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn base.cc:94\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+This class provides access to geometric and topological properties of a\n+reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Class providing access to the singletons of the reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename Container::ReferenceElement ReferenceElement\n+The reference element type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+Geometry implementation based on local-basis function parametrization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:40\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bt_\by_\bp_\be\n+GeometryType type() const\n+Obtain the name of the reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:167\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n+decltype(power(std::declval< ctype >(), mydimension)) Volume\n+type of volume\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:62\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl\n+LocalCoordinate local(const GlobalCoordinate &y, Impl::GaussNewtonOptions<\n+ctype > opts={}) const\n+Evaluate the inverse coordinate mapping.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:232\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+LocalFiniteElementGeometry(const ReferenceElement &refElement, const\n+LocalFiniteElement &localFE, std::vector< GlobalCoordinate > vertices)\n+Constructor from a vector of coefficients of the LocalBasis parametrizing the\n+geometry.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:103\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianTransposed jacobianTransposed(const LocalCoordinate &local) const\n+Obtain the transposed of the Jacobian.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:327\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bl_\bo_\bc_\ba_\bl_\bB_\ba_\bs_\bi_\bs\n+const LocalBasis & localBasis() const\n+The local basis of the stored local finite-element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:377\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bt_\by_\bp_\be\n+typename LocalBasisTraits::DomainFieldType ctype\n+coordinate type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:47\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+JacobianInverseTransposed jacobianInverseTransposed(const LocalCoordinate\n+&local) const\n+Obtain the transposed of the Jacobian's inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:353\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+friend ReferenceElement referenceElement(const LocalFiniteElementGeometry\n+&geometry)\n+Obtain the reference-element related to this geometry.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:359\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+LocalFiniteElementGeometry()=default\n+Default constructed geometry results in an empty/invalid representation.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\ba_\bf_\bf_\bi_\bn_\be\n+bool affine() const\n+Is this mapping affine? Geometries of order 1 might be affine, but it needs to\n+be checked on non-simp...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:159\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+Jacobian jacobian(const LocalCoordinate &local) const\n+Obtain the Jacobian.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:307\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+Volume volume(const QuadratureRule< ctype, mydimension > &quadRule) const\n+Obtain the volume of the mapping's image by given quadrature rules.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:294\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\be_\bf_\bf_\bi_\bc_\bi_\be_\bn_\bt_\bs\n+const std::vector< GlobalCoordinate > & coefficients() const\n+Obtain the coefficients of the parametrization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:371\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+LocalFiniteElementGeometry(GeometryType gt, Args &&... args)\n+Constructor, forwarding to the other constructors that take a reference-\n+element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:144\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\bo_\br_\bd_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const int coorddimension\n+coordinate dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:53\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bs\n+int corners() const\n+Obtain number of corners of the corresponding reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:173\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\be_\bn_\bt_\be_\br\n+GlobalCoordinate center() const\n+Obtain the centroid of the mapping's image.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:186\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bf_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+const LocalFiniteElement & finiteElement() const\n+Obtain the local finite-element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:365\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bg_\bl_\bo_\bb_\ba_\bl\n+GlobalCoordinate global(const LocalCoordinate &local) const\n+Evaluate the coordinate mapping.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:202\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\be_\bl_\bp_\be_\br\n+Impl::FieldMatrixHelper< ctype > MatrixHelper\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:82\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename ReferenceElements::ReferenceElement ReferenceElement\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bc_\bo_\br_\bn_\be_\br\n+GlobalCoordinate corner(int i) const\n+Obtain coordinates of the i-th corner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:179\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+Volume volume(Impl::ConvergenceOptions< ctype > opts={}) const\n+Obtain the volume of the mapping's image.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:276\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bm_\by_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const int mydimension\n+geometry dimension\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bj_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+JacobianInverse jacobianInverse(const LocalCoordinate &local) const\n+Obtain the Jacobian's inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:339\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bG_\bl_\bo_\bb_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, coorddimension > GlobalCoordinate\n+type of global coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:59\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn\n+FieldMatrix< ctype, coorddimension, mydimension > Jacobian\n+type of jacobian\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:65\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+FieldMatrix< ctype, coorddimension, mydimension > JacobianInverseTransposed\n+type of jacobian inverse transposed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:74\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bI_\bn_\bv_\be_\br_\bs_\be\n+FieldMatrix< ctype, mydimension, coorddimension > JacobianInverse\n+type of jacobian inverse\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:71\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ctype integrationElement(const LocalCoordinate &local) const\n+Obtain the integration element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:260\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bo_\br_\bd_\be_\br\n+int order() const\n+Obtain the (highest) polynomial order of the parametrization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+FieldVector< ctype, mydimension > LocalCoordinate\n+type of local coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bJ_\ba_\bc_\bo_\bb_\bi_\ba_\bn_\bT_\br_\ba_\bn_\bs_\bp_\bo_\bs_\be_\bd\n+FieldMatrix< ctype, mydimension, coorddimension > JacobianTransposed\n+type of jacobian transposed\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bF_\bi_\bn_\bi_\bt_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+LocalFiniteElementGeometry(const ReferenceElement &refElement, const\n+LocalFiniteElement &localFE, Param &¶metrization)\n+Constructor from a local parametrization function, mapping local to (curved)\n+global coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn localfiniteelementgeometry.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be\n+Abstract base class for quadrature rules.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:214\n+_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\br_\ba_\bt_\bu_\br_\be_\bR_\bu_\bl_\be_\bs\n+A container for all quadrature rules of dimension dim\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn quadraturerules.hh:260\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bS_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:231\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-VirtualRefinement base class.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:283\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-SubEntityIteratorBack< dimension > VertexIteratorBack\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:307\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd_\bB_\ba_\bc_\bk\n-virtual ElementIteratorBack * eEndBack(Dune::RefinementIntervals tag) const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn\n-VertexIterator vBegin(Dune::RefinementIntervals tag) const\n-Get an VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:38\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn\n-ElementIterator eBegin(Dune::RefinementIntervals tag) const\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-virtual int nElements(Dune::RefinementIntervals tag) const =0\n-Get the number of Elements.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bE_\bn_\bd\n-ElementIterator eEnd(Dune::RefinementIntervals tag) const\n-Get an ElementIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:62\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< 0 >::SubEntityIterator ElementIterator\n-The ElementIterator of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:290\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\b~_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-virtual ~VirtualRefinement()\n-Destructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:353\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd\n-VertexIterator vEnd(Dune::RefinementIntervals tag) const\n-Get an VertexIterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.cc:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bV_\be_\bc_\bt_\bo_\br\n-FieldVector< CoordType, dimension > CoordVector\n-The CoordVector of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:297\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bn_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-virtual int nVertices(Dune::RefinementIntervals tag) const =0\n-Get the number of Vertices.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< int > IndexVector\n-The IndexVector of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:303\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Codim< dimension >::SubEntityIterator VertexIterator\n-The VertexIterator of the VirtualRefinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:288\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bE_\bn_\bd_\bB_\ba_\bc_\bk\n-virtual VertexIteratorBack * vEndBack(Dune::RefinementIntervals tag) const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bE_\bl_\be_\bm_\be_\bn_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\bB_\ba_\bc_\bk\n-SubEntityIteratorBack< 0 > ElementIteratorBack\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:308\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\be_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk\n-virtual ElementIteratorBack * eBeginBack(Dune::RefinementIntervals tag) const\n-=0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bB_\be_\bg_\bi_\bn_\bB_\ba_\bc_\bk\n-virtual VertexIteratorBack * vBeginBack(Dune::RefinementIntervals tag) const =0\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\bi_\br_\bt_\bu_\ba_\bl_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n-codim database of VirtualRefinement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn virtualrefinement.hh:367\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n+constexpr bool isSimplex() const\n+Return true if entity is a simplex of any dimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00245.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00245.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelements.hh File Reference\n+dune-geometry: referenceelement.hh File Reference\n \n \n \n \n \n \n \n@@ -71,72 +71,37 @@\n \n \n \n
    \n \n-
    referenceelements.hh File Reference
    \n+Namespaces
    \n+
    referenceelement.hh File Reference
    \n \n
    \n-
    #include <cassert>
    \n-#include <algorithm>
    \n-#include <limits>
    \n-#include <tuple>
    \n-#include <utility>
    \n-#include <vector>
    \n-#include <array>
    \n-#include <dune/common/typetraits.hh>
    \n-#include <dune/common/std/type_traits.hh>
    \n-#include <dune/common/visibility.hh>
    \n-#include <dune/geometry/dimension.hh>
    \n-#include <dune/geometry/type.hh>
    \n-#include <dune/geometry/referenceelement.hh>
    \n-#include <dune/geometry/referenceelementimplementation.hh>
    \n+
    #include <dune/geometry/type.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  Dune::Geo::ReferenceElements< ctype_, dim >
     Class providing access to the singletons of the reference elements. More...
    class  Dune::Geo::ReferenceElement< Implementation >
     This class provides access to geometric and topological properties of a reference element. More...
     
    struct  Dune::Geo::ReferenceElement< Implementation >::Codim< codim >
     Collection of types depending on the codimension. More...
     
    \n \n \n \n \n \n-\n-\n-

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::Geo
     
    namespace  Dune::Transitional
     
    \n-\n-\n-\n-\n-

    \n-Typedefs

    template<typename... T>
    using Dune::ReferenceElement = decltype(referenceElement(std::declval< T >()...))
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename... T>
    unspecified value type Dune::referenceElement (T &&... t)
     Returns a reference element for the objects t....
     
    template<typename T , int dim>
    auto Dune::referenceElement (const Dune::GeometryType &gt, Dune::Dim< dim >={})
     Returns a reference element of dimension dim for the given geometry type and coordinate field type.
     
    template<typename T , int dim, std::enable_if_t< IsNumber< std::decay_t< T > >::value, int > = 0>
    auto Dune::referenceElement (const T &, const Dune::GeometryType &gt, Dune::Dim< dim >)
     Returns a reference element of dimension dim for the given geometry type and coordinate field type.
     
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,60 +1,25 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-referenceelements.hh File Reference\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh>\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+referenceelement.hh File Reference\n #include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\b _\bc_\bt_\by_\bp_\be_\b__\b,_\b _\bd_\bi_\bm_\b _\b>\n-\u00a0 Class providing access to the singletons of the reference elements.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>\n+\u00a0 This class provides access to geometric and topological properties of\n+ a reference element. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b<_\b _\bc_\bo_\bd_\bi_\bm_\b _\b>\n+\u00a0 Collection of types depending on the codimension. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\ba_\bl\n-\u00a0\n-T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n-template\n-using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval< T >\n- ()...))\n-\u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-unspecified value type\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (T &&... t)\n-\u00a0 Returns a reference element for the objects t....\n-\u00a0\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >,\n- _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm< dim >={})\n-\u00a0 Returns a reference element of dimension dim for the\n- given geometry type and coordinate field type.\n-\u00a0\n-template\n->::value, int > = 0>\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt (const T &, const _\bD_\bu_\bn_\be_\b:_\b:\n- _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be >, _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm< dim >)\n-\u00a0 Returns a reference element of dimension dim for the\n- given geometry type and coordinate field type.\n-\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00245_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00245_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: referenceelements.hh Source File\n+dune-geometry: referenceelement.hh Source File\n \n \n \n \n \n \n \n@@ -74,317 +74,261 @@\n \n
    \n \n
    \n
    \n
    \n-
    referenceelements.hh
    \n+
    referenceelement.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH
    \n-
    6#define DUNE_GEOMETRY_REFERENCEELEMENTS_HH
    \n+
    5#ifndef DUNE_GEOMETRY_REFERENCEELEMENT_HH
    \n+
    6#define DUNE_GEOMETRY_REFERENCEELEMENT_HH
    \n
    7
    \n-
    8#include <cassert>
    \n+\n
    9
    \n-
    10#include <algorithm>
    \n-
    11#include <limits>
    \n-
    12#include <tuple>
    \n-
    13#include <utility>
    \n-
    14#include <vector>
    \n-
    15#include <array>
    \n-
    16
    \n-
    17#include <dune/common/typetraits.hh>
    \n-
    18#include <dune/common/std/type_traits.hh>
    \n-
    19#include <dune/common/visibility.hh>
    \n+
    10namespace Dune {
    \n+
    11 namespace Geo {
    \n+
    12
    \n+
    13 namespace Impl {
    \n+
    14
    \n+
    15 // forward declaration for friend declaration
    \n+
    16 template<typename ctype, int dim>
    \n+
    17 class ReferenceElementContainer;
    \n+
    18
    \n+
    19 }
    \n
    20
    \n-\n-
    22#include <dune/geometry/type.hh>
    \n-\n-\n-
    25
    \n-
    26namespace Dune
    \n-
    27{
    \n+
    21 // forward declaration for constructing default reference element type
    \n+
    22 template<typename ctype, int dim>
    \n+
    23 class ReferenceElementImplementation;
    \n+
    24
    \n+
    25 // forward declaration for backwards compatibility conversion
    \n+
    26 template<typename ctype, int dim>
    \n+
    27 struct ReferenceElements;
    \n
    28
    \n-
    29 namespace Geo
    \n-
    30 {
    \n+
    29 // ReferenceElement
    \n+
    30 // ----------------
    \n
    31
    \n-
    32#ifndef DOXYGEN
    \n-
    33
    \n-
    34
    \n-
    35 namespace Impl
    \n-
    36 {
    \n-
    37
    \n-
    38 // ReferenceElementContainer
    \n-
    39 // -------------------------
    \n-
    40
    \n-
    41 template< class ctype, int dim >
    \n-
    42 class ReferenceElementContainer
    \n-
    43 {
    \n-
    44 static const unsigned int numTopologies = dim >= 0 ? (1u << dim) : 0;
    \n-
    45
    \n-
    46 using Implementation = ReferenceElementImplementation< ctype, dim >;
    \n-
    47
    \n-
    48 public:
    \n-
    49
    \n-
    50 using ReferenceElement = Dune::Geo::ReferenceElement< Implementation >;
    \n-
    51 using value_type = ReferenceElement;
    \n-
    52 using const_iterator = const value_type*;
    \n+
    50 template<typename Implementation>
    \n+
    \n+\n+
    52 {
    \n
    53
    \n-
    54 ReferenceElementContainer ()
    \n-
    55 {
    \n-
    56 for( unsigned int topologyId = 0; topologyId < numTopologies; ++topologyId )
    \n-
    57 {
    \n-
    58 implementations_[ topologyId ].initialize( topologyId );
    \n-
    59 reference_elements_[ topologyId ].setImplementation( implementations_[ topologyId ] );
    \n-
    60 }
    \n-
    61 }
    \n-
    62
    \n-
    63 const ReferenceElement& operator() ( const GeometryType &type ) const
    \n-
    64 {
    \n-
    65 assert( type.dim() == dim );
    \n-
    66 return reference_elements_[ type.id() ];
    \n-
    67 }
    \n-
    68
    \n-
    69 const ReferenceElement& simplex () const
    \n-
    70 {
    \n-
    71 return reference_elements_[ Dune::GeometryTypes::simplex(dim).id() ];
    \n-
    72 }
    \n+
    54 public:
    \n+
    55
    \n+
    56#ifndef DOXYGEN
    \n+
    57
    \n+
    59 template<int codim>
    \n+
    60 using Codim = typename Implementation::template Codim<codim>;
    \n+
    61
    \n+
    62#else
    \n+
    63
    \n+
    65 template< int codim >
    \n+
    \n+
    66 struct Codim
    \n+
    67 {
    \n+
    69 using Geometry = implementation-defined;
    \n+
    70 };
    \n+
    \n+
    71
    \n+
    72#endif // DOXYGEN
    \n
    73
    \n-
    74 const ReferenceElement& cube () const
    \n-
    75 {
    \n-
    76 return reference_elements_[ Dune::GeometryTypes::cube(dim).id() ];
    \n-
    77 }
    \n-
    78
    \n-
    79 const ReferenceElement& pyramid () const
    \n-
    80 {
    \n-
    81 return reference_elements_[ Dune::GeometryTypes::pyramid.id() ];
    \n-
    82 }
    \n-
    83
    \n-
    84 const ReferenceElement& prism () const
    \n-
    85 {
    \n-
    86 return reference_elements_[ Dune::GeometryTypes::prism.id() ];
    \n-
    87 }
    \n+
    75 using ctype = typename Implementation::ctype;
    \n+
    76
    \n+\n+
    79
    \n+
    81 using Coordinate = typename Implementation::Coordinate;
    \n+
    82
    \n+
    84 typedef ctype Volume;
    \n+
    85
    \n+
    87 static constexpr int dimension = Implementation::dimension;
    \n
    88
    \n-
    89 const_iterator begin () const
    \n-
    90 {
    \n-
    91 return reference_elements_.data();
    \n-
    92 }
    \n-
    93
    \n-
    94 const_iterator end () const
    \n-
    95 {
    \n-
    96 return reference_elements_.data() + numTopologies;
    \n-
    97 }
    \n+
    89
    \n+
    \n+
    94 int size(int c) const
    \n+
    95 {
    \n+
    96 return _impl->size(c);
    \n+
    97 }
    \n+
    \n
    98
    \n-
    99 private:
    \n-
    100
    \n-
    101 std::array<Implementation,numTopologies> implementations_;
    \n-
    102 std::array<ReferenceElement,numTopologies> reference_elements_;
    \n-
    103
    \n-
    104 };
    \n-
    105
    \n-
    106
    \n-
    107 } // namespace Impl
    \n-
    108
    \n-
    109
    \n-
    110#endif // DOXYGEN
    \n-
    111
    \n-
    112
    \n-
    113 // ReferenceElements
    \n-
    114 // ------------------------
    \n+
    99
    \n+
    \n+
    111 int size(int i, int c, int cc) const
    \n+
    112 {
    \n+
    113 return _impl->size(i,c,cc);
    \n+
    114 }
    \n+
    \n
    115
    \n-
    126 template< class ctype_, int dim >
    \n-
    \n-\n-
    128 {
    \n-
    129
    \n-
    131 using ctype = ctype_;
    \n-
    132
    \n-\n-
    135
    \n-
    137 static constexpr int dimension = dim;
    \n-
    138
    \n-
    139 private:
    \n-
    140
    \n-
    141 using Container = Impl::ReferenceElementContainer< ctype, dim >;
    \n-
    142
    \n-
    143 public:
    \n-
    144
    \n-
    146 using ReferenceElement = typename Container::ReferenceElement;
    \n-
    147
    \n-
    149 using Iterator = typename Container::const_iterator;
    \n-
    150
    \n-\n-
    153
    \n-
    155 static const ReferenceElement&
    \n-
    \n-
    156 general ( const GeometryType& type )
    \n-
    157 {
    \n-
    158 return container() ( type );
    \n-
    159 }
    \n-
    \n-
    160
    \n-
    \n-
    162 static const ReferenceElement& simplex ()
    \n-
    163 {
    \n-
    164 return container().simplex();
    \n-
    165 }
    \n-
    \n-
    166
    \n-
    \n-
    168 static const ReferenceElement& cube ()
    \n-
    169 {
    \n-
    170 return container().cube();
    \n-
    171 }
    \n+
    116
    \n+
    \n+
    130 int subEntity(int i, int c, int ii, int cc) const
    \n+
    131 {
    \n+
    132 return _impl->subEntity(i,c,ii,cc);
    \n+
    133 }
    \n+
    \n+
    134
    \n+
    \n+
    153 auto subEntities ( int i, int c, int cc ) const
    \n+
    154 {
    \n+
    155 return _impl->subEntities(i,c,cc);
    \n+
    156 }
    \n+
    \n+
    157
    \n+
    158
    \n+
    \n+
    167 GeometryType type(int i, int c) const
    \n+
    168 {
    \n+
    169 return _impl->type(i,c);
    \n+
    170 }
    \n
    \n+
    171
    \n
    172
    \n-
    \n-
    173 static Iterator begin ()
    \n-
    174 {
    \n-
    175 return container().begin();
    \n-
    176 }
    \n-
    \n-
    177
    \n-
    \n-
    178 static Iterator end ()
    \n-
    179 {
    \n-
    180 return container().end();
    \n-
    181 }
    \n-
    \n-
    182
    \n-
    183 private:
    \n-
    184
    \n-
    185 DUNE_EXPORT static const Container& container ()
    \n-
    186 {
    \n-
    187 static Container container;
    \n-
    188 return container;
    \n-
    189 }
    \n-
    190 };
    \n-
    \n-
    191
    \n-
    192 } // namespace Geo
    \n-
    193
    \n-
    195 using Geo::ReferenceElements;
    \n-
    196
    \n-
    197
    \n-
    198#ifdef DOXYGEN
    \n-
    199
    \n-
    201
    \n-
    244 template<typename... T>
    \n-
    245 unspecified-value-type referenceElement(T&&... t);
    \n-
    246
    \n-
    247#endif
    \n-
    248
    \n-
    249
    \n-
    251
    \n-
    264 template<typename T, int dim>
    \n-
    \n-\n-
    266 {
    \n-\n-
    268 }
    \n-
    \n-
    269
    \n-
    270
    \n-
    272
    \n-
    284 template<typename T, int dim, std::enable_if_t<IsNumber<std::decay_t<T>>::value, int> = 0>
    \n-
    \n-\n-
    286 {
    \n-\n-
    288 }
    \n+
    \n+\n+
    176 {
    \n+
    177 return _impl->type();
    \n+
    178 }
    \n+
    \n+
    179
    \n+
    180
    \n+
    \n+
    190 Coordinate position(int i, int c) const
    \n+
    191 {
    \n+
    192 return _impl->position(i,c);
    \n+
    193 }
    \n+
    \n+
    194
    \n+
    195
    \n+
    \n+
    203 bool checkInside(const Coordinate& local) const
    \n+
    204 {
    \n+
    205 return _impl->checkInside(local);
    \n+
    206 }
    \n+
    \n+
    207
    \n+
    208
    \n+
    220 template<int codim>
    \n+
    \n+
    221 typename Codim<codim>::Geometry geometry(int i) const
    \n+
    222 {
    \n+
    223 return _impl->template geometry<codim>(i);
    \n+
    224 }
    \n+
    \n+
    225
    \n+
    226
    \n+
    \n+\n+
    229 {
    \n+
    230 return _impl->volume();
    \n+
    231 }
    \n+
    \n+
    232
    \n+
    233
    \n+
    \n+\n+
    242 {
    \n+
    243 return _impl->integrationOuterNormal(face);
    \n+
    244 }
    \n
    \n-
    289
    \n+
    245
    \n+
    246
    \n+
    \n+\n+
    255 : _impl(nullptr)
    \n+
    256 {}
    \n+
    \n+
    257
    \n+
    \n+
    263 const Implementation& impl() const
    \n+
    264 {
    \n+
    265 return *_impl;
    \n+
    266 }
    \n+
    \n+
    267
    \n+
    \n+
    269 bool operator==(const ReferenceElement& r) const
    \n+
    270 {
    \n+
    271 return _impl == r._impl;
    \n+
    272 }
    \n+
    \n+
    273
    \n+
    \n+
    275 bool operator!=(const ReferenceElement& r) const
    \n+
    276 {
    \n+
    277 return not (*this == r);
    \n+
    278 }
    \n+
    \n+
    279
    \n+
    \n+
    281 friend std::size_t hash_value(const ReferenceElement& r)
    \n+
    282 {
    \n+
    283 return reinterpret_cast<std::size_t>(r._impl);
    \n+
    284 }
    \n+
    \n+
    285
    \n+
    286 private:
    \n+
    287
    \n+
    288 // The implementation must be a friend to construct a wrapper around itself.
    \n+
    289 friend Implementation;
    \n
    290
    \n-
    291#ifndef DOXYGEN
    \n-
    292
    \n-
    293 // helpers for the ReferenceElement<> meta function
    \n-
    294 // the complete Impl block can be removed together with deprecated Transitional::ReferenceElement
    \n-
    295
    \n-
    296 namespace Impl {
    \n-
    297
    \n-
    298 // Evaluates to the correct reference element iff <T...> matches the pattern <number_type,Dim<int>>
    \n-
    299 // otherwise, it's ill-formed. Should be used with detected_or and friends.
    \n-
    300
    \n-
    301 template<typename... T>
    \n-
    302 struct DefaultReferenceElementExtractor;
    \n+
    291 // The reference container is a friend to be able to call setImplementation.
    \n+
    292 friend class Impl::ReferenceElementContainer<ctype,dimension>;
    \n+
    293
    \n+
    294 // Constructor for wrapping an implementation reference (required internally by the default implementation)
    \n+
    295 ReferenceElement(const Implementation& impl)
    \n+
    296 : _impl(&impl)
    \n+
    297 {}
    \n+
    298
    \n+
    299 void setImplementation(const Implementation& impl)
    \n+
    300 {
    \n+
    301 _impl = &impl;
    \n+
    302 }
    \n
    303
    \n-
    304 template<typename T, typename std::enable_if<IsNumber<T>::value,int>::type dim>
    \n-
    305 struct DefaultReferenceElementExtractor<T,Dim<dim>>
    \n-
    306 {
    \n-\n-
    308 };
    \n+
    304 const Implementation* _impl;
    \n+
    305
    \n+
    306 };
    \n+
    \n+
    307
    \n+
    308 }
    \n
    309
    \n-
    310 template<typename... T>
    \n-
    311 using DefaultReferenceElement = typename DefaultReferenceElementExtractor<T...>::type;
    \n+
    310}
    \n+
    311
    \n
    312
    \n-
    313 }
    \n-
    314
    \n-
    315 // looks up the type of a reference element by trying to instantiate the correct overload
    \n-
    316 // of referenceElement() for the given arguments. This will fail if there is no valid
    \n-
    317 // overload and should be used with detected_or or some other utility that places the
    \n-
    318 // instantiation in SFINAE context.
    \n-
    319 //
    \n-
    320 // this is placed directly in namespace Dune to avoid any weird surprises
    \n-
    321
    \n-
    322 template<typename... T>
    \n-
    323 using LookupReferenceElement = decltype(referenceElement(std::declval<T>()...));
    \n-
    324
    \n-
    325#endif // DOXYGEN
    \n-
    326
    \n-
    \n-
    327 namespace [[deprecated]] Transitional {
    \n-
    328
    \n-
    329 // this abomination checks whether the template signature matches the special case
    \n-
    330 // ReferenceElement<number_type,Dune::Dim<int>> and otherwise defers the type lookup
    \n-
    331 // to a decltype on a call to referenceElement(std::declval<T>())
    \n-
    332
    \n-
    337 template<typename... T>
    \n-
    338 using ReferenceElement = detected_or_fallback_t<
    \n-
    339 Impl::DefaultReferenceElement,
    \n-
    340 LookupReferenceElement,
    \n-
    341 T...
    \n-
    342 >;
    \n-
    343
    \n-
    344 }
    \n-
    \n-
    345
    \n-
    346 template<typename... T>
    \n-
    347 using ReferenceElement = decltype(referenceElement(std::declval<T>()...));
    \n-
    348
    \n-
    349} // namespace Dune
    \n-
    350
    \n-
    351#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH
    \n-\n-\n-\n-
    A unique label for each type of element that can occur in a grid.
    \n-
    unspecified value type referenceElement(T &&... t)
    Returns a reference element for the objects t....
    \n+
    313#endif // DUNE_GEOMETRY_REFERENCEELEMENT_HH
    \n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    decltype(referenceElement(std::declval< T >()...)) ReferenceElement
    Definition referenceelements.hh:347
    \n
    This class provides access to geometric and topological properties of a reference element.
    Definition referenceelement.hh:52
    \n-
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n-
    static Iterator begin()
    Definition referenceelements.hh:173
    \n-
    Iterator iterator
    Iterator over available reference elements.
    Definition referenceelements.hh:152
    \n-
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n-
    static const ReferenceElement & cube()
    get hypercube reference elements
    Definition referenceelements.hh:168
    \n-
    static Iterator end()
    Definition referenceelements.hh:178
    \n-
    ctype_ ctype
    The coordinate field type of the contained reference elements.
    Definition referenceelements.hh:131
    \n-
    static const ReferenceElement & general(const GeometryType &type)
    get general reference elements
    Definition referenceelements.hh:156
    \n-
    static const ReferenceElement & simplex()
    get simplex reference elements
    Definition referenceelements.hh:162
    \n-
    typename Container::const_iterator Iterator
    Iterator over available reference elements.
    Definition referenceelements.hh:149
    \n-
    static constexpr int dimension
    The dimension of the contained reference elements.
    Definition referenceelements.hh:137
    \n-
    ctype CoordinateField
    The coordinate field type of the contained reference elements.
    Definition referenceelements.hh:134
    \n-
    Static tag representing a dimension.
    Definition dimension.hh:16
    \n+
    CoordinateField volume() const
    obtain the volume of the reference element
    Definition referenceelement.hh:228
    \n+
    GeometryType type(int i, int c) const
    obtain the type of subentity (i,c)
    Definition referenceelement.hh:167
    \n+
    ReferenceElement()
    Constructs an empty reference element.
    Definition referenceelement.hh:254
    \n+
    bool operator!=(const ReferenceElement &r) const
    Compares for inequality with another reference element.
    Definition referenceelement.hh:275
    \n+
    Coordinate position(int i, int c) const
    position of the barycenter of entity (i,c)
    Definition referenceelement.hh:190
    \n+
    typename Implementation::Coordinate Coordinate
    The coordinate type.
    Definition referenceelement.hh:81
    \n+
    Codim< codim >::Geometry geometry(int i) const
    obtain the embedding of subentity (i,codim) into the reference element
    Definition referenceelement.hh:221
    \n+
    static constexpr int dimension
    The dimension of the reference element.
    Definition referenceelement.hh:87
    \n+
    int size(int i, int c, int cc) const
    number of subentities of codimension cc of subentity (i,c)
    Definition referenceelement.hh:111
    \n+
    int subEntity(int i, int c, int ii, int cc) const
    obtain number of ii-th subentity with codim cc of (i,c)
    Definition referenceelement.hh:130
    \n+
    typename Implementation::ctype ctype
    The coordinate field type.
    Definition referenceelement.hh:75
    \n+
    int size(int c) const
    number of subentities of codimension c
    Definition referenceelement.hh:94
    \n+
    GeometryType type() const
    obtain the type of this reference element
    Definition referenceelement.hh:175
    \n+
    const Implementation & impl() const
    Returns a reference to the internal implementation object.
    Definition referenceelement.hh:263
    \n+
    bool checkInside(const Coordinate &local) const
    check if a coordinate is in the reference element
    Definition referenceelement.hh:203
    \n+
    Coordinate integrationOuterNormal(int face) const
    obtain the integration outer normal of the reference element
    Definition referenceelement.hh:241
    \n+
    ctype CoordinateField
    The coordinate field type.
    Definition referenceelement.hh:78
    \n+
    bool operator==(const ReferenceElement &r) const
    Compares for equality with another reference element.
    Definition referenceelement.hh:269
    \n+
    friend std::size_t hash_value(const ReferenceElement &r)
    Yields a hash value suitable for storing the reference element a in hash table.
    Definition referenceelement.hh:281
    \n+
    auto subEntities(int i, int c, int cc) const
    Obtain the range of numbers of subentities with codim cc of (i,c)
    Definition referenceelement.hh:153
    \n+
    ctype Volume
    Type used for volume.
    Definition referenceelement.hh:84
    \n+
    Collection of types depending on the codimension.
    Definition referenceelement.hh:67
    \n+
    implementation-defined Geometry
    type of geometry embedding a subentity into the reference element
    Definition referenceelement.hh:69
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n-
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,356 +1,297 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-referenceelements.hh\n+referenceelement.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n-6#define DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n+5#ifndef DUNE_GEOMETRY_REFERENCEELEMENT_HH\n+6#define DUNE_GEOMETRY_REFERENCEELEMENT_HH\n 7\n-8#include \n+8#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n 9\n-10#include \n-11#include \n-12#include \n-13#include \n-14#include \n-15#include \n-16\n-17#include \n-18#include \n-19#include \n+10namespace _\bD_\bu_\bn_\be {\n+11 namespace Geo {\n+12\n+13 namespace Impl {\n+14\n+15 // forward declaration for friend declaration\n+16 template\n+17 class ReferenceElementContainer;\n+18\n+19 }\n 20\n-21#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh>\n-22#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\bt_\by_\bp_\be_\b._\bh_\bh>\n-23#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh>\n-24#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n-25\n-26namespace _\bD_\bu_\bn_\be\n-27{\n+21 // forward declaration for constructing default reference element type\n+22 template\n+23 class ReferenceElementImplementation;\n+24\n+25 // forward declaration for backwards compatibility conversion\n+26 template\n+27 struct ReferenceElements;\n 28\n-29 namespace Geo\n-30 {\n+29 // ReferenceElement\n+30 // ----------------\n 31\n-32#ifndef DOXYGEN\n-33\n-34\n-35 namespace Impl\n-36 {\n-37\n-38 // ReferenceElementContainer\n-39 // -------------------------\n-40\n-41 template< class ctype, int dim >\n-42 class ReferenceElementContainer\n-43 {\n-44 static const unsigned int numTopologies = dim >= 0 ? (1u << dim) : 0;\n-45\n-46 using Implementation = ReferenceElementImplementation< ctype, dim >;\n-47\n-48 public:\n-49\n-50 using ReferenceElement = _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b<_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\b>;\n-51 using value_type = ReferenceElement;\n-52 using const_iterator = const value_type*;\n+50 template\n+_\b5_\b1 class _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+52 {\n 53\n-54 ReferenceElementContainer ()\n-55 {\n-56 for( unsigned int topologyId = 0; topologyId < numTopologies; ++topologyId )\n-57 {\n-58 implementations_[ topologyId ].initialize( topologyId );\n-59 reference_elements_[ topologyId ].setImplementation( implementations_\n-[ topologyId ] );\n-60 }\n-61 }\n-62\n-63 const ReferenceElement& operator() ( const GeometryType &type ) const\n-64 {\n-65 assert( type.dim() == dim );\n-66 return reference_elements_[ type.id() ];\n-67 }\n-68\n-69 const ReferenceElement& simplex () const\n-70 {\n-71 return reference_elements_[ Dune::GeometryTypes::simplex(dim)._\bi_\bd() ];\n-72 }\n+54 public:\n+55\n+56#ifndef DOXYGEN\n+57\n+59 template\n+60 using _\bC_\bo_\bd_\bi_\bm = typename Implementation::template _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\b>;\n+61\n+62#else\n+63\n+65 template< int codim >\n+_\b6_\b6 struct _\bC_\bo_\bd_\bi_\bm\n+67 {\n+_\b6_\b9 using _\bG_\be_\bo_\bm_\be_\bt_\br_\by = implementation-defined;\n+70 };\n+71\n+72#endif // DOXYGEN\n 73\n-74 const ReferenceElement& cube () const\n-75 {\n-76 return reference_elements_[ Dune::GeometryTypes::cube(dim)._\bi_\bd() ];\n-77 }\n-78\n-79 const ReferenceElement& pyramid () const\n-80 {\n-81 return reference_elements_[ Dune::GeometryTypes::pyramid._\bi_\bd() ];\n-82 }\n-83\n-84 const ReferenceElement& prism () const\n-85 {\n-86 return reference_elements_[ Dune::GeometryTypes::prism._\bi_\bd() ];\n-87 }\n+_\b7_\b5 using _\bc_\bt_\by_\bp_\be = typename Implementation::ctype;\n+76\n+_\b7_\b8 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd = _\bc_\bt_\by_\bp_\be;\n+79\n+_\b8_\b1 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be = typename Implementation::Coordinate;\n+82\n+_\b8_\b4 typedef _\bc_\bt_\by_\bp_\be _\bV_\bo_\bl_\bu_\bm_\be;\n+85\n+_\b8_\b7 static constexpr int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = Implementation::dimension;\n 88\n-89 const_iterator begin () const\n-90 {\n-91 return reference_elements_.data();\n-92 }\n-93\n-94 const_iterator end () const\n+89\n+_\b9_\b4 int _\bs_\bi_\bz_\be(int c) const\n 95 {\n-96 return reference_elements_.data() + numTopologies;\n+96 return _impl->size(c);\n 97 }\n 98\n-99 private:\n-100\n-101 std::array implementations_;\n-102 std::array reference_elements_;\n-103\n-104 };\n-105\n-106\n-107 } // namespace Impl\n-108\n-109\n-110#endif // DOXYGEN\n-111\n-112\n-113 // ReferenceElements\n-114 // ------------------------\n+99\n+_\b1_\b1_\b1 int _\bs_\bi_\bz_\be(int i, int c, int cc) const\n+112 {\n+113 return _impl->size(i,c,cc);\n+114 }\n 115\n-126 template< class ctype_, int dim >\n-_\b1_\b2_\b7 struct _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-128 {\n-129\n-_\b1_\b3_\b1 using _\bc_\bt_\by_\bp_\be = ctype_;\n-132\n-_\b1_\b3_\b4 using _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd = _\bc_\bt_\by_\bp_\be;\n-135\n-_\b1_\b3_\b7 static constexpr int _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n-138\n-139 private:\n-140\n-141 using Container = Impl::ReferenceElementContainer< ctype, dim >;\n-142\n-143 public:\n-144\n-_\b1_\b4_\b6 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = typename Container::ReferenceElement;\n-147\n-_\b1_\b4_\b9 using _\bI_\bt_\be_\br_\ba_\bt_\bo_\br = typename Container::const_iterator;\n-150\n-_\b1_\b5_\b2 using _\bi_\bt_\be_\br_\ba_\bt_\bo_\br = _\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-153\n-155 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt&\n-_\b1_\b5_\b6 _\bg_\be_\bn_\be_\br_\ba_\bl ( const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& type )\n-157 {\n-158 return container() ( type );\n-159 }\n-160\n-_\b1_\b6_\b2 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& _\bs_\bi_\bm_\bp_\bl_\be_\bx ()\n-163 {\n-164 return container().simplex();\n-165 }\n-166\n-_\b1_\b6_\b8 static const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& _\bc_\bu_\bb_\be ()\n-169 {\n-170 return container().cube();\n-171 }\n+116\n+_\b1_\b3_\b0 int _\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by(int i, int c, int ii, int cc) const\n+131 {\n+132 return _impl->subEntity(i,c,ii,cc);\n+133 }\n+134\n+_\b1_\b5_\b3 auto _\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\bi_\be_\bs ( int i, int c, int cc ) const\n+154 {\n+155 return _impl->subEntities(i,c,cc);\n+156 }\n+157\n+158\n+_\b1_\b6_\b7 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be(int i, int c) const\n+168 {\n+169 return _impl->type(i,c);\n+170 }\n+171\n 172\n-_\b1_\b7_\b3 static _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn ()\n-174 {\n-175 return container().begin();\n-176 }\n-177\n-_\b1_\b7_\b8 static _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd ()\n-179 {\n-180 return container().end();\n-181 }\n-182\n-183 private:\n-184\n-185 DUNE_EXPORT static const Container& container ()\n-186 {\n-187 static Container container;\n-188 return container;\n-189 }\n-190 };\n-191\n-192 } // namespace Geo\n-193\n-195 using Geo::ReferenceElements;\n-196\n-197\n-198#ifdef DOXYGEN\n-199\n-201\n-244 template\n-_\b2_\b4_\b5 unspecified-value-type _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(T&&... t);\n+_\b1_\b7_\b5 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be _\bt_\by_\bp_\be() const\n+176 {\n+177 return _impl->type();\n+178 }\n+179\n+180\n+_\b1_\b9_\b0 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn(int i, int c) const\n+191 {\n+192 return _impl->position(i,c);\n+193 }\n+194\n+195\n+_\b2_\b0_\b3 bool _\bc_\bh_\be_\bc_\bk_\bI_\bn_\bs_\bi_\bd_\be(const _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be& local) const\n+204 {\n+205 return _impl->checkInside(local);\n+206 }\n+207\n+208\n+220 template\n+_\b2_\b2_\b1 typename _\bC_\bo_\bd_\bi_\bm_\b<_\bc_\bo_\bd_\bi_\bm_\b>_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by _\bg_\be_\bo_\bm_\be_\bt_\br_\by(int i) const\n+222 {\n+223 return _impl->template geometry(i);\n+224 }\n+225\n+226\n+_\b2_\b2_\b8 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd _\bv_\bo_\bl_\bu_\bm_\be() const\n+229 {\n+230 return _impl->volume();\n+231 }\n+232\n+233\n+_\b2_\b4_\b1 _\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be _\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl(int face) const\n+242 {\n+243 return _impl->integrationOuterNormal(face);\n+244 }\n+245\n 246\n-247#endif\n-248\n-249\n-251\n-264 template\n-_\b2_\b6_\b5 auto _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt, _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm_\b<_\bd_\bi_\bm_\b> = {})\n-266 {\n-267 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl(gt);\n-268 }\n-269\n-270\n-272\n-284 template>::\n-value, int> = 0>\n-_\b2_\b8_\b5 auto _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const T&, const _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt, _\bD_\bu_\bn_\be_\b:_\b:\n-_\bD_\bi_\bm_\b<_\bd_\bi_\bm_\b>)\n-286 {\n-287 return _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl(gt);\n-288 }\n-289\n+_\b2_\b5_\b4 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt()\n+255 : _impl(nullptr)\n+256 {}\n+257\n+_\b2_\b6_\b3 const Implementation& _\bi_\bm_\bp_\bl() const\n+264 {\n+265 return *_impl;\n+266 }\n+267\n+_\b2_\b6_\b9 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r) const\n+270 {\n+271 return _impl == r._impl;\n+272 }\n+273\n+_\b2_\b7_\b5 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r) const\n+276 {\n+277 return not (*this == r);\n+278 }\n+279\n+_\b2_\b8_\b1 friend std::size_t _\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be(const _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt& r)\n+282 {\n+283 return reinterpret_cast(r._impl);\n+284 }\n+285\n+286 private:\n+287\n+288 // The implementation must be a friend to construct a wrapper around\n+itself.\n+289 friend Implementation;\n 290\n-291#ifndef DOXYGEN\n-292\n-293 // helpers for the ReferenceElement<> meta function\n-294 // the complete Impl block can be removed together with deprecated\n-Transitional::ReferenceElement\n-295\n-296 namespace Impl {\n-297\n-298 // Evaluates to the correct reference element iff matches the\n-pattern >\n-299 // otherwise, it's ill-formed. Should be used with detected_or and friends.\n-300\n-301 template\n-302 struct DefaultReferenceElementExtractor;\n+291 // The reference container is a friend to be able to call\n+setImplementation.\n+292 friend class Impl::ReferenceElementContainer<_\bc_\bt_\by_\bp_\be,_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn>;\n+293\n+294 // Constructor for wrapping an implementation reference (required\n+internally by the default implementation)\n+295 _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(const Implementation& _\bi_\bm_\bp_\bl)\n+296 : _impl(&_\bi_\bm_\bp_\bl)\n+297 {}\n+298\n+299 void setImplementation(const Implementation& _\bi_\bm_\bp_\bl)\n+300 {\n+301 _impl = &_\bi_\bm_\bp_\bl;\n+302 }\n 303\n-304 template::value,int>::type\n-dim>\n-305 struct DefaultReferenceElementExtractor>\n-306 {\n-307 using type = typename _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bT_\b,_\bd_\bi_\bm_\b>_\b:_\b:\n-_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt;\n-308 };\n+304 const Implementation* _impl;\n+305\n+306 };\n+307\n+308 }\n 309\n-310 template\n-311 using DefaultReferenceElement = typename\n-DefaultReferenceElementExtractor::type;\n+310}\n+311\n 312\n-313 }\n-314\n-315 // looks up the type of a reference element by trying to instantiate the\n-correct overload\n-316 // of referenceElement() for the given arguments. This will fail if there\n-is no valid\n-317 // overload and should be used with detected_or or some other utility that\n-places the\n-318 // instantiation in SFINAE context.\n-319 //\n-320 // this is placed directly in namespace Dune to avoid any weird surprises\n-321\n-322 template\n-323 using LookupReferenceElement = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval\n-()...));\n-324\n-325#endif // DOXYGEN\n-326\n-_\b3_\b2_\b7 namespace [[deprecated]] Transitional {\n-328\n-329 // this abomination checks whether the template signature matches the\n-special case\n-330 // ReferenceElement> and otherwise defers the\n-type lookup\n-331 // to a decltype on a call to referenceElement(std::declval())\n-332\n-337 template\n-338 using ReferenceElement = detected_or_fallback_t<\n-339 Impl::DefaultReferenceElement,\n-340 LookupReferenceElement,\n-341 T...\n-342 >;\n-343\n-344 }\n-345\n-346 template\n-_\b3_\b4_\b7 using _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt = decltype(_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt(std::declval()...));\n-348\n-349} // namespace Dune\n-350\n-351#endif // #ifndef DUNE_GEOMETRY_REFERENCEELEMENTS_HH\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\b._\bh_\bh\n-_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b._\bh_\bh\n-_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b._\bh_\bh\n+313#endif // DUNE_GEOMETRY_REFERENCEELEMENT_HH\n _\bt_\by_\bp_\be_\b._\bh_\bh\n A unique label for each type of element that can occur in a grid.\n-_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-unspecified value type referenceElement(T &&... t)\n-Returns a reference element for the objects t....\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-decltype(referenceElement(std::declval< T >()...)) ReferenceElement\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:347\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n This class provides access to geometric and topological properties of a\n reference element.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-Class providing access to the singletons of the reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-static Iterator begin()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:173\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-Iterator iterator\n-Iterator over available reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:152\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n-typename Container::ReferenceElement ReferenceElement\n-The reference element type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bu_\bb_\be\n-static const ReferenceElement & cube()\n-get hypercube reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:168\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\be_\bn_\bd\n-static Iterator end()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bc_\bt_\by_\bp_\be\n-ctype_ ctype\n-The coordinate field type of the contained reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:131\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bl\n-static const ReferenceElement & general(const GeometryType &type)\n-get general reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:156\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n-static const ReferenceElement & simplex()\n-get simplex reference elements\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:162\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-typename Container::const_iterator Iterator\n-Iterator over available reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:149\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bv_\bo_\bl_\bu_\bm_\be\n+CoordinateField volume() const\n+obtain the volume of the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:228\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bt_\by_\bp_\be\n+GeometryType type(int i, int c) const\n+obtain the type of subentity (i,c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:167\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+ReferenceElement()\n+Constructs an empty reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:254\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n+bool operator!=(const ReferenceElement &r) const\n+Compares for inequality with another reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n+Coordinate position(int i, int c) const\n+position of the barycenter of entity (i,c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:190\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be\n+typename Implementation::Coordinate Coordinate\n+The coordinate type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bg_\be_\bo_\bm_\be_\bt_\br_\by\n+Codim< codim >::Geometry geometry(int i) const\n+obtain the embedding of subentity (i,codim) into the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:221\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n static constexpr int dimension\n-The dimension of the contained reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:137\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd\n+The dimension of the reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:87\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bi_\bz_\be\n+int size(int i, int c, int cc) const\n+number of subentities of codimension cc of subentity (i,c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:111\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\by\n+int subEntity(int i, int c, int ii, int cc) const\n+obtain number of ii-th subentity with codim cc of (i,c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:130\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bc_\bt_\by_\bp_\be\n+typename Implementation::ctype ctype\n+The coordinate field type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:75\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bi_\bz_\be\n+int size(int c) const\n+number of subentities of codimension c\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:94\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bt_\by_\bp_\be\n+GeometryType type() const\n+obtain the type of this reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:175\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bi_\bm_\bp_\bl\n+const Implementation & impl() const\n+Returns a reference to the internal implementation object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bc_\bh_\be_\bc_\bk_\bI_\bn_\bs_\bi_\bd_\be\n+bool checkInside(const Coordinate &local) const\n+check if a coordinate is in the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:203\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bi_\bn_\bt_\be_\bg_\br_\ba_\bt_\bi_\bo_\bn_\bO_\bu_\bt_\be_\br_\bN_\bo_\br_\bm_\ba_\bl\n+Coordinate integrationOuterNormal(int face) const\n+obtain the integration outer normal of the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:241\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bo_\br_\bd_\bi_\bn_\ba_\bt_\be_\bF_\bi_\be_\bl_\bd\n ctype CoordinateField\n-The coordinate field type of the contained reference elements.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:134\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bi_\bm\n-Static tag representing a dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dimension.hh:16\n+The coordinate field type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n+bool operator==(const ReferenceElement &r) const\n+Compares for equality with another reference element.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be\n+friend std::size_t hash_value(const ReferenceElement &r)\n+Yields a hash value suitable for storing the reference element a in hash table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:281\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bs_\bu_\bb_\bE_\bn_\bt_\bi_\bt_\bi_\be_\bs\n+auto subEntities(int i, int c, int cc) const\n+Obtain the range of numbers of subentities with codim cc of (i,c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:153\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bV_\bo_\bl_\bu_\bm_\be\n+ctype Volume\n+Type used for volume.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:84\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm\n+Collection of types depending on the codimension.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\b:_\b:_\bC_\bo_\bd_\bi_\bm_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by\n+implementation-defined Geometry\n+type of geometry embedding a subentity into the reference element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelement.hh:69\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n-constexpr unsigned int id() const\n-Return the topology id of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00248.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00248.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: type.hh File Reference\n+dune-geometry: generalvertexorder.hh File Reference\n \n \n \n \n \n \n \n@@ -73,52 +73,49 @@\n
    \n
    \n
    \n \n-
    type.hh File Reference
    \n+
    generalvertexorder.hh File Reference
    \n
    \n
    \n-\n-

    A unique label for each type of element that can occur in a grid. \n-More...

    \n-
    #include <cassert>
    \n-#include <cstdint>
    \n-#include <string>
    \n-#include <type_traits>
    \n-#include <dune/common/exceptions.hh>
    \n-#include <dune/common/typetraits.hh>
    \n-#include <dune/common/unused.hh>
    \n+
    #include <algorithm>
    \n+#include <cassert>
    \n+#include <cstddef>
    \n+#include <iterator>
    \n+#include <vector>
    \n+#include <dune/common/iteratorfacades.hh>
    \n+#include "type.hh"
    \n+#include <dune/geometry/referenceelements.hh>
    \n
    \n

    Go to the source code of this file.

    \n \n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Dune::GeometryType
     Unique label for each type of entities that can occur in DUNE grids. More...
    class  Dune::GeneralVertexOrder< dim, Index_ >
     Class providing information on the ordering of vertices. More...
     
    class  Dune::GeneralVertexOrder< dim, Index_ >::iterator
     Iterate over the vertex indices of some sub-entity. More...
     
    \n \n \n \n-\n-\n-\n

    \n Namespaces

    namespace  Dune
     
    namespace  Dune::GeometryTypes
     Predefined GeometryTypes for common geometries.
     
    \n \n-\n-\n-\n+\n+\n+\n+\n

    \n Functions

    std::ostream & Dune::operator<< (std::ostream &s, const GeometryType &a)
     Prints the type to an output stream.
     
    template<class InIterator , class OutIterator >
    void Dune::reduceOrder (const InIterator &inBegin, const InIterator &inEnd, OutIterator outIt)
     Algorithm to reduce vertex order information.
     
    \n-

    Detailed Description

    \n-

    A unique label for each type of element that can occur in a grid.

    \n-
    \n+
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,36 +1,35 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-type.hh File Reference\n-A unique label for each type of element that can occur in a grid. _\bM_\bo_\br_\be_\b._\b._\b.\n+generalvertexorder.hh File Reference\n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-\u00a0 Unique label for each type of entities that can occur in DUNE grids.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\b,_\b _\bI_\bn_\bd_\be_\bx_\b__\b _\b>\n+\u00a0 Class providing information on the ordering of vertices. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b<_\b _\bd_\bi_\bm_\b,_\b _\bI_\bn_\bd_\be_\bx_\b__\b _\b>_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n+\u00a0 Iterate over the vertex indices of some sub-entity. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bs\n-\u00a0 Predefined _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\bs for common geometries.\n-\u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-std::ostream &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b< (std::ostream &s, const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &a)\n-\u00a0 Prints the type to an output stream.\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br (const InIterator &inBegin, const InIterator &inEnd,\n+ OutIterator outIt)\n+\u00a0 Algorithm to reduce vertex order information.\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-A unique label for each type of element that can occur in a grid.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00248_source.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00248_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-dune-geometry: type.hh Source File\n+dune-geometry: generalvertexorder.hh Source File\n \n \n \n \n \n \n \n@@ -74,477 +74,187 @@\n \n
    \n \n
    \n \n
    \n-
    type.hh
    \n+
    generalvertexorder.hh
    \n
    \n
    \n Go to the documentation of this file.
    1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
    \n
    2// vi: set et ts=4 sw=2 sts=2:
    \n
    3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
    \n
    4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
    \n-
    5#ifndef DUNE_GEOMETRY_TYPE_HH
    \n-
    6#define DUNE_GEOMETRY_TYPE_HH
    \n-
    7
    \n-
    12#include <cassert>
    \n-
    13#include <cstdint>
    \n+
    5
    \n+
    6#ifndef DUNE_GEOMETRY_GENERALVERTEXORDER_HH
    \n+
    7#define DUNE_GEOMETRY_GENERALVERTEXORDER_HH
    \n+
    8
    \n+
    9#include <algorithm>
    \n+
    10#include <cassert>
    \n+
    11#include <cstddef>
    \n+
    12#include <iterator>
    \n+
    13#include <vector>
    \n
    14
    \n-
    15#include <string>
    \n-
    16#include <type_traits>
    \n-
    17
    \n-
    18#include <dune/common/exceptions.hh>
    \n-
    19#include <dune/common/typetraits.hh>
    \n-
    20#include <dune/common/unused.hh>
    \n+
    15#include <dune/common/iteratorfacades.hh>
    \n+
    16
    \n+
    17#include "type.hh"
    \n+\n+
    19
    \n+
    20namespace Dune {
    \n
    21
    \n-
    22namespace Dune
    \n-
    23{
    \n-
    24
    \n-
    25 namespace Impl
    \n-
    26 {
    \n-
    27
    \n-
    28 enum TopologyConstruction { pyramidConstruction = 0, prismConstruction = 1 };
    \n-
    29
    \n-
    30 // Dynamic Topology Properties
    \n-
    31 // ---------------------------
    \n-
    32
    \n-
    41 inline static unsigned int numTopologies ( int dim ) noexcept
    \n-
    42 {
    \n-
    43 return (1u << dim);
    \n-
    44 }
    \n-
    45
    \n-
    57 inline bool static isPyramid ( unsigned int topologyId, int dim, int codim = 0 ) noexcept
    \n-
    58 {
    \n-
    59 assert( (dim > 0) && (topologyId < numTopologies( dim )) );
    \n-
    60 assert( (0 <= codim) && (codim < dim) );
    \n-
    61 return (((topologyId & ~1) & (1u << (dim-codim-1))) == 0);
    \n-
    62 }
    \n-
    63
    \n-
    75 inline static bool isPrism ( unsigned int topologyId, int dim, int codim = 0 ) noexcept
    \n-
    76 {
    \n-
    77 assert( (dim > 0) && (topologyId < numTopologies( dim )) );
    \n-
    78 assert( (0 <= codim) && (codim < dim) );
    \n-
    79 return (( (topologyId | 1) & (1u << (dim-codim-1))) != 0);
    \n-
    80 }
    \n+
    39 template<class InIterator, class OutIterator>
    \n+
    \n+
    40 void reduceOrder(const InIterator& inBegin, const InIterator& inEnd,
    \n+
    41 OutIterator outIt)
    \n+
    42 {
    \n+
    43 for(InIterator inIt = inBegin; inIt != inEnd; ++inIt, ++outIt)
    \n+
    44 *outIt = std::count_if(inBegin, inEnd, [&](const auto& v)
    \n+
    45 {
    \n+
    46 return v < *inIt;
    \n+
    47 });
    \n+
    48 }
    \n+
    \n+
    49
    \n+
    51
    \n+
    66 template<std::size_t dim, class Index_ = std::size_t>
    \n+
    \n+\n+
    68 typedef ReferenceElements<double, dim> RefElems;
    \n+
    69 typedef typename RefElems::ReferenceElement RefElem;
    \n+
    70
    \n+
    71 RefElem refelem;
    \n+
    72 GeometryType gt;
    \n+
    73 std::vector<Index_> vertexOrder;
    \n+
    74
    \n+
    75 public:
    \n+
    77 typedef Index_ Index;
    \n+
    78
    \n+
    80 class iterator;
    \n
    81
    \n-
    89 inline static unsigned int baseTopologyId ( unsigned int topologyId, int dim, int codim = 1 ) noexcept
    \n-
    90 {
    \n-
    91 assert( (dim >= 0) && (topologyId < numTopologies( dim )) );
    \n-
    92 assert( (0 <= codim) && (codim <= dim) );
    \n-
    93 return topologyId & ((1u << (dim-codim)) - 1);
    \n-
    94 }
    \n-
    95
    \n-
    96 } // namespace Impl
    \n-
    97
    \n-
    98 // GeometryType
    \n-
    99 // -------------
    \n-
    100
    \n-
    \n-\n-
    114 {
    \n-
    115 public:
    \n-
    116
    \n-
    \n-
    119 enum
    \n-
    120 BasicType {
    \n-\n-\n-\n-\n-\n-
    126 none
    \n-
    127 };
    \n-
    \n-
    128
    \n-
    129 private:
    \n-
    130
    \n-
    132 unsigned char dim_;
    \n-
    133
    \n-
    135 bool none_;
    \n+
    83 static const std::size_t dimension = dim;
    \n+
    85 const GeometryType &type() const { return gt; }
    \n+
    86
    \n+
    88
    \n+
    96 template<class InIterator>
    \n+
    \n+
    97 GeneralVertexOrder(const GeometryType& gt_, const InIterator &inBegin,
    \n+
    98 const InIterator &inEnd) :
    \n+
    99 refelem(RefElems::general(gt_)), gt(gt_),
    \n+
    100 vertexOrder(refelem.size(dim))
    \n+
    101 { reduceOrder(inBegin, inEnd, vertexOrder.begin()); }
    \n+
    \n+
    102
    \n+
    104
    \n+
    \n+
    108 iterator begin(std::size_t codim, std::size_t subEntity) const
    \n+
    109 { return iterator(*this, codim, subEntity); }
    \n+
    \n+
    111
    \n+
    \n+
    115 iterator end(std::size_t codim, std::size_t subEntity) const {
    \n+
    116 return iterator(*this, codim, subEntity,
    \n+
    117 refelem.size(subEntity, codim, dim));
    \n+
    118 }
    \n+
    \n+
    119
    \n+
    121
    \n+
    \n+
    128 void getReduced(std::size_t codim, std::size_t subEntity,
    \n+
    129 std::vector<Index>& order) const
    \n+
    130 {
    \n+
    131 order.resize(refelem.size(subEntity, codim, dim));
    \n+
    132 reduceOrder(begin(codim, subEntity), end(codim, subEntity),
    \n+
    133 order.begin());
    \n+
    134 }
    \n+
    \n+
    135 };
    \n+
    \n
    136
    \n-
    138 unsigned int topologyId_;
    \n-
    139
    \n-
    140 // Internal type used for the Id. The exact nature of this type is kept
    \n-
    141 // as an implementation detail on purpose. We use a scoped enum here because scoped enums
    \n-
    142 // can be used as template parameters, but are not implicitly converted to other integral
    \n-
    143 // types by the compiler. That way, we avoid unfortunate implicit conversion chains, e.g.
    \n-
    144 // people trying to work with GlobalGeometryTypeIndex, but forgetting to actually call
    \n-
    145 // GlobalGeometryTypeIndex::index(gt) and just using gt directly.
    \n-
    146 enum class IdType : std::uint64_t
    \n-
    147 {};
    \n-
    148
    \n-
    149 public:
    \n-
    150
    \n-
    181 using Id = IdType;
    \n+
    138
    \n+
    141 template<std::size_t dim, class Index_>
    \n+
    \n+
    142 class GeneralVertexOrder<dim, Index_>::iterator :
    \n+
    143 public Dune::RandomAccessIteratorFacade<iterator, const Index_>
    \n+
    144 {
    \n+
    145 const GeneralVertexOrder *order;
    \n+
    146 std::size_t codim;
    \n+
    147 std::size_t subEntity;
    \n+
    148 std::size_t vertex;
    \n+
    149
    \n+
    150 iterator(const GeneralVertexOrder &order_, std::size_t codim_,
    \n+
    151 std::size_t subEntity_, std::size_t vertex_ = 0) :
    \n+
    152 order(&order_), codim(codim_), subEntity(subEntity_), vertex(vertex_)
    \n+
    153 { }
    \n+
    154
    \n+
    155 public:
    \n+
    \n+
    156 const Index &dereference() const {
    \n+
    157 return order->vertexOrder[order->refelem.subEntity(subEntity, codim,
    \n+
    158 vertex, dim)];
    \n+
    159 }
    \n+
    \n+
    \n+
    160 const Index &elementAt(std::ptrdiff_t n) const {
    \n+
    161 return order->vertexOrder[order->refelem.subEntity(subEntity, codim,
    \n+
    162 vertex+n, dim)];
    \n+
    163 }
    \n+
    \n+
    \n+
    164 bool equals(const iterator &other) const {
    \n+
    165 return order == other.order && codim == other.codim &&
    \n+
    166 subEntity == other.subEntity && vertex == other.vertex;
    \n+
    167 }
    \n+
    \n+
    168 void increment() { ++vertex; }
    \n+
    169 void decrement() { --vertex; }
    \n+
    170 void advance(std::ptrdiff_t n) { vertex += n; }
    \n+
    \n+
    171 std::ptrdiff_t distanceTo(const iterator &other) const {
    \n+
    172 // make sure we reference the same container
    \n+
    173 assert(order == other.order && codim == other.codim &&
    \n+
    174 subEntity == other.subEntity);
    \n+
    175 if(vertex < other.vertex) return other.vertex - vertex;
    \n+
    176 else return -static_cast<std::ptrdiff_t>(vertex - other.vertex);
    \n+
    177 }
    \n+
    \n+
    178
    \n+
    179 friend class GeneralVertexOrder<dim, Index>;
    \n+
    180
    \n
    182
    \n-
    \n-
    190 constexpr operator Id() const
    \n-
    191 {
    \n-
    192 // recreate the exact storage layout that this class is using, making conversion
    \n-
    193 // extremely cheap
    \n-
    194 std::uint64_t id = dim_ | (std::uint64_t(none_) << 8) | (std::uint64_t(topologyId_) << 32);
    \n-
    195 return static_cast<Id>(id);
    \n-
    196 }
    \n-
    \n-
    197
    \n-
    \n-
    210 constexpr Id toId() const
    \n-
    211 {
    \n-
    212 return static_cast<Id>(*this);
    \n-
    213 }
    \n-
    \n-
    214
    \n-
    \n-
    222 constexpr GeometryType(Id id)
    \n-
    223 : dim_(static_cast<std::uint64_t>(id) & 0xFF)
    \n-
    224 , none_(static_cast<std::uint64_t>(id) & 0x100)
    \n-
    225 , topologyId_(static_cast<std::uint64_t>(id) >> 32)
    \n-
    226 {}
    \n-
    \n-
    227
    \n-
    230
    \n-
    \n-
    232 constexpr GeometryType ()
    \n-
    233 : dim_(0), none_(true), topologyId_(0)
    \n-
    234 {}
    \n-
    \n-
    235
    \n-
    \n-
    242 constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)
    \n-
    243 : dim_(dim), none_(isNone), topologyId_(topologyId)
    \n-
    244 {}
    \n-
    \n-
    245
    \n-
    \n-
    251 constexpr GeometryType(unsigned int topologyId, unsigned int dim)
    \n-
    252 : dim_(dim), none_(false), topologyId_(topologyId)
    \n-
    253 {}
    \n-
    \n-
    254
    \n-
    265 template<class TopologyType,
    \n-
    266 class = std::void_t<decltype(TopologyType::dimension), decltype(TopologyType::id)>>
    \n-
    \n-
    267 explicit GeometryType(TopologyType t)
    \n-
    268 : dim_(TopologyType::dimension), none_(false), topologyId_(TopologyType::id)
    \n-
    269 {
    \n-
    270 DUNE_UNUSED_PARAMETER(t);
    \n-
    271 }
    \n-
    \n-
    272
    \n-
    \n-
    279 constexpr bool isVertex() const {
    \n-
    280 return dim_==0;
    \n-
    281 }
    \n-
    \n-
    282
    \n-
    \n-
    284 constexpr bool isLine() const {
    \n-
    285 return dim_==1;
    \n-
    286 }
    \n-
    \n-
    287
    \n-
    \n-
    289 constexpr bool isTriangle() const {
    \n-
    290 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0001;
    \n-
    291 }
    \n-
    \n-
    292
    \n-
    \n-
    294 constexpr bool isQuadrilateral() const {
    \n-
    295 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0011;
    \n-
    296 }
    \n-
    \n-
    297
    \n-
    \n-
    299 constexpr bool isTetrahedron() const {
    \n-
    300 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0001;
    \n-
    301 }
    \n-
    \n-
    302
    \n-
    \n-
    304 constexpr bool isPyramid() const {
    \n-
    305 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0011;
    \n-
    306 }
    \n-
    \n-
    307
    \n-
    \n-
    309 constexpr bool isPrism() const {
    \n-
    310 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0101;
    \n-
    311 }
    \n-
    \n-
    312
    \n-
    \n-
    314 constexpr bool isHexahedron() const {
    \n-
    315 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0111;
    \n-
    316 }
    \n-
    \n-
    317
    \n-
    \n-
    319 constexpr bool isSimplex() const {
    \n-
    320 return ! none_ && (topologyId_ | 1) == 1;
    \n-
    321 }
    \n-
    \n-
    322
    \n-
    \n-
    324 constexpr bool isCube() const {
    \n-
    325 return ! none_ && ((topologyId_ ^ ((1 << dim_)-1)) >> 1 == 0);
    \n-
    326 }
    \n-
    \n-
    327
    \n-
    \n-
    329 constexpr bool isConical() const {
    \n-
    330 return ! none_ && (((topologyId_ & ~1) & (1u << (dim_-1))) == 0);
    \n-
    331 }
    \n-
    \n-
    332
    \n-
    \n-
    337 constexpr bool isConical(const int& step) const {
    \n-
    338 return ! none_ && (((topologyId_ & ~1) & (1u << step)) == 0);
    \n-
    339 }
    \n-
    \n-
    340
    \n-
    \n-
    342 constexpr bool isPrismatic() const {
    \n-
    343 return ! none_ && (( (topologyId_ | 1) & (1u << (dim_-1))) != 0);
    \n-
    344 }
    \n-
    \n-
    345
    \n-
    \n-
    350 constexpr bool isPrismatic(const int& step) const {
    \n-
    351 return ! none_ && (( (topologyId_ | 1) & (1u << step)) != 0);
    \n-
    352 }
    \n-
    \n-
    353
    \n-
    \n-
    355 constexpr bool isNone() const {
    \n-
    356 return none_;
    \n-
    357 }
    \n-
    \n-
    358
    \n-
    \n-
    360 constexpr unsigned int dim() const {
    \n-
    361 return dim_;
    \n-
    362 }
    \n-
    \n-
    363
    \n-
    \n-
    365 constexpr unsigned int id() const {
    \n-
    366 return topologyId_;
    \n-
    367 }
    \n-
    \n-
    368
    \n-
    373
    \n-
    \n-
    377 constexpr bool operator==(const GeometryType& other) const {
    \n-
    378 return ( ( none_ == other.none_ )
    \n-
    379 && ( ( none_ == true )
    \n-
    380 || ( ( dim_ == other.dim_ )
    \n-
    381 && ( (topologyId_ >> 1) == (other.topologyId_ >> 1) )
    \n-
    382 )
    \n-
    383 )
    \n-
    384 );
    \n-
    385 }
    \n-
    \n-
    386
    \n-
    \n-
    388 constexpr bool operator!=(const GeometryType& other) const {
    \n-
    389 return ! ((*this)==other);
    \n-
    390 }
    \n-
    \n-
    391
    \n-
    \n-
    393 constexpr bool operator < (const GeometryType& other) const {
    \n-
    394 return ( ( none_ < other.none_ )
    \n-
    395 || ( !( other.none_ < none_ )
    \n-
    396 && ( ( dim_ < other.dim_ )
    \n-
    397 || ( (other.dim_ == dim_)
    \n-
    398 && ((topologyId_ >> 1) < (other.topologyId_ >> 1) )
    \n-
    399 )
    \n-
    400 )
    \n-
    401 )
    \n-
    402 );
    \n-
    403 }
    \n-
    \n-
    404
    \n-
    407 };
    \n-
    \n-
    408
    \n-
    \n-
    410 inline std::ostream& operator<< (std::ostream& s, const GeometryType& a)
    \n-
    411 {
    \n-
    412 if (a.isSimplex())
    \n-
    413 {
    \n-
    414 s << "(simplex, " << a.dim() << ")";
    \n-
    415 return s;
    \n-
    416 }
    \n-
    417 if (a.isCube())
    \n-
    418 {
    \n-
    419 s << "(cube, " << a.dim() << ")";
    \n-
    420 return s;
    \n-
    421 }
    \n-
    422 if (a.isPyramid())
    \n-
    423 {
    \n-
    424 s << "(pyramid, 3)";
    \n-
    425 return s;
    \n-
    426 }
    \n-
    427 if (a.isPrism())
    \n-
    428 {
    \n-
    429 s << "(prism, 3)";
    \n-
    430 return s;
    \n-
    431 }
    \n-
    432 if (a.isNone())
    \n-
    433 {
    \n-
    434 s << "(none, " << a.dim() << ")";
    \n-
    435 return s;
    \n-
    436 }
    \n-
    437 s << "(other [" << a.id() << "], " << a.dim() << ")";
    \n-
    438 return s;
    \n-
    439 }
    \n-
    \n-
    440
    \n-
    441
    \n-
    443
    \n-
    \n-
    447 namespace GeometryTypes {
    \n-
    448
    \n-
    450
    \n-
    453 inline constexpr GeometryType simplex(unsigned int dim)
    \n-
    454 {
    \n-
    455 return GeometryType(0,dim,false);
    \n-
    456 }
    \n-
    457
    \n-
    459
    \n-
    462 inline constexpr GeometryType cube(unsigned int dim)
    \n-
    463 {
    \n-
    464 return GeometryType(((dim>1) ? ((1 << dim) - 1) : 0),dim,false);
    \n-
    465 }
    \n-
    466
    \n-
    468
    \n-
    471 inline constexpr GeometryType none(unsigned int dim)
    \n-
    472 {
    \n-
    473 return GeometryType(0,dim,true);
    \n-
    474 }
    \n-
    475
    \n-
    477 inline constexpr GeometryType conicalExtension(const GeometryType& gt)
    \n-
    478 {
    \n-
    479 return GeometryType(gt.id(), gt.dim()+1, gt.isNone());
    \n-
    480 }
    \n-
    481
    \n-
    483 inline constexpr GeometryType prismaticExtension(const GeometryType& gt)
    \n-
    484 {
    \n-
    485 return GeometryType(gt.id() | ((1 << gt.dim())), gt.dim()+1, gt.isNone());
    \n-
    486 }
    \n-
    487
    \n-
    489
    \n-
    492 inline constexpr GeometryType vertex = GeometryType(0,0,false);
    \n-
    493
    \n-
    495
    \n-
    498 inline constexpr GeometryType line = GeometryType(0,1,false);
    \n-
    499
    \n-
    501
    \n-
    504 inline constexpr GeometryType triangle = simplex(2);
    \n-
    505
    \n-
    507
    \n-
    510 inline constexpr GeometryType quadrilateral = cube(2);
    \n-
    511
    \n-
    513
    \n-
    516 inline constexpr GeometryType tetrahedron = simplex(3);
    \n-
    517
    \n-
    519
    \n-
    522 inline constexpr GeometryType pyramid = GeometryType(0b0011,3,false);
    \n-
    523
    \n-
    525
    \n-
    528 inline constexpr GeometryType prism = GeometryType(0b0101,3,false);
    \n-
    529
    \n-
    531
    \n-
    534 inline constexpr GeometryType hexahedron = cube(3);
    \n-
    535
    \n-
    536 }
    \n-
    \n-
    537
    \n-
    538 namespace Impl
    \n-
    539 {
    \n-
    540
    \n-
    542 inline constexpr GeometryType getBase(const GeometryType& gt) {
    \n-
    543 return GeometryType(gt.id() & ((1 << (gt.dim()-1))-1), gt.dim()-1, gt.isNone());
    \n-
    544 }
    \n-
    545
    \n-
    546
    \n-
    547 // IfGeometryType
    \n-
    548 // ----------
    \n-
    549
    \n-
    550 template< template< GeometryType::Id > class Operation, int dim, GeometryType::Id geometryId = GeometryTypes::vertex >
    \n-
    551 struct IfGeometryType
    \n-
    552 {
    \n-
    553 static constexpr GeometryType geometry = geometryId;
    \n-
    554 template< class... Args >
    \n-
    555 static auto apply ( GeometryType gt, Args &&... args )
    \n-
    556 {
    \n-
    557 GeometryType lowerGeometry(gt.id() >>1 , gt.dim()-1, gt.isNone());
    \n-
    558
    \n-
    559 if( gt.id() & 1 )
    \n-
    560 return IfGeometryType< Operation, dim-1, GeometryTypes::prismaticExtension(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );
    \n-
    561 else
    \n-
    562 return IfGeometryType< Operation, dim-1, GeometryTypes::conicalExtension(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );
    \n-
    563 }
    \n-
    564 };
    \n-
    565
    \n-
    566 template< template< GeometryType::Id > class Operation, GeometryType::Id geometryId >
    \n-
    567 struct IfGeometryType< Operation, 0, geometryId>
    \n-
    568 {
    \n-
    569 template< class... Args >
    \n-
    570 static auto apply ([[maybe_unused]] GeometryType gt, Args &&... args )
    \n-
    571 {
    \n-
    572 return Operation< geometryId >::apply( std::forward< Args >( args )... );
    \n-
    573 }
    \n-
    574 };
    \n-
    575 } // namespace Impl
    \n-
    576} // namespace Dune
    \n-
    577
    \n-
    578#endif // DUNE_GEOMETRY_TYPE_HH
    \n-
    STL namespace.
    \n+\n+
    188 };
    \n+
    \n+
    189} // namespace Dune
    \n+
    190
    \n+
    191#endif // DUNE_GEOMETRY_GENERALVERTEXORDER_HH
    \n+\n+
    A unique label for each type of element that can occur in a grid.
    \n
    Definition affinegeometry.hh:21
    \n-
    std::ostream & operator<<(std::ostream &s, const GeometryType &a)
    Prints the type to an output stream.
    Definition type.hh:410
    \n+
    void reduceOrder(const InIterator &inBegin, const InIterator &inEnd, OutIterator outIt)
    Algorithm to reduce vertex order information.
    Definition generalvertexorder.hh:40
    \n+
    Class providing access to the singletons of the reference elements.
    Definition referenceelements.hh:128
    \n+
    typename Container::ReferenceElement ReferenceElement
    The reference element type.
    Definition referenceelements.hh:146
    \n+
    Class providing information on the ordering of vertices.
    Definition generalvertexorder.hh:67
    \n+
    Index_ Index
    Type of indices.
    Definition generalvertexorder.hh:77
    \n+
    const GeometryType & type() const
    get type of the entity's geometry
    Definition generalvertexorder.hh:85
    \n+
    static const std::size_t dimension
    export the dimension of the entity we provide information for
    Definition generalvertexorder.hh:83
    \n+
    void getReduced(std::size_t codim, std::size_t subEntity, std::vector< Index > &order) const
    get a vector of reduced indices for some sub-entity
    Definition generalvertexorder.hh:128
    \n+
    iterator end(std::size_t codim, std::size_t subEntity) const
    get end iterator for the vertex indices of some sub-entity
    Definition generalvertexorder.hh:115
    \n+
    GeneralVertexOrder(const GeometryType &gt_, const InIterator &inBegin, const InIterator &inEnd)
    construct a GeneralVertexOrder
    Definition generalvertexorder.hh:97
    \n+
    iterator begin(std::size_t codim, std::size_t subEntity) const
    get begin iterator for the vertex indices of some sub-entity
    Definition generalvertexorder.hh:108
    \n+
    Iterate over the vertex indices of some sub-entity.
    Definition generalvertexorder.hh:144
    \n+
    iterator()
    public default constructor
    Definition generalvertexorder.hh:187
    \n+
    void decrement()
    Definition generalvertexorder.hh:169
    \n+
    void advance(std::ptrdiff_t n)
    Definition generalvertexorder.hh:170
    \n+
    const Index & dereference() const
    Definition generalvertexorder.hh:156
    \n+
    void increment()
    Definition generalvertexorder.hh:168
    \n+
    bool equals(const iterator &other) const
    Definition generalvertexorder.hh:164
    \n+
    std::ptrdiff_t distanceTo(const iterator &other) const
    Definition generalvertexorder.hh:171
    \n+
    const Index & elementAt(std::ptrdiff_t n) const
    Definition generalvertexorder.hh:160
    \n
    Unique label for each type of entities that can occur in DUNE grids.
    Definition type.hh:114
    \n-
    constexpr GeometryType(unsigned int topologyId, unsigned int dim)
    Constructor, using the topologyId (integer) and the dimension.
    Definition type.hh:251
    \n-
    constexpr bool operator<(const GeometryType &other) const
    less-than operation for use with maps
    Definition type.hh:393
    \n-
    constexpr bool operator!=(const GeometryType &other) const
    Check for inequality.
    Definition type.hh:388
    \n-
    constexpr bool isPyramid() const
    Return true if entity is a pyramid.
    Definition type.hh:304
    \n-
    constexpr bool isTetrahedron() const
    Return true if entity is a tetrahedron.
    Definition type.hh:299
    \n-
    constexpr bool isPrism() const
    Return true if entity is a prism.
    Definition type.hh:309
    \n-
    constexpr bool isVertex() const
    Return true if entity is a vertex.
    Definition type.hh:279
    \n-
    constexpr bool operator==(const GeometryType &other) const
    Check for equality. This method knows that in dimension 0 and 1 all BasicTypes are equal.
    Definition type.hh:377
    \n-
    constexpr Id toId() const
    Create an Id representation of this GeometryType.
    Definition type.hh:210
    \n-
    constexpr bool isConical(const int &step) const
    Return true if entity was constructed with a conical product in the chosen step.
    Definition type.hh:337
    \n-
    constexpr unsigned int dim() const
    Return dimension of the type.
    Definition type.hh:360
    \n-
    constexpr bool isPrismatic(const int &step) const
    Return true if entity was constructed with a prismatic product in the chosen step.
    Definition type.hh:350
    \n-
    constexpr bool isTriangle() const
    Return true if entity is a triangle.
    Definition type.hh:289
    \n-
    GeometryType(TopologyType t)
    Constructor from static TopologyType class.
    Definition type.hh:267
    \n-
    constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)
    Constructor, using the topologyId (integer), the dimension and a flag for type none.
    Definition type.hh:242
    \n-
    BasicType
    Each entity can be tagged by one of these basic types plus its space dimension.
    Definition type.hh:120
    \n-
    @ cube
    Cube element in any nonnegative dimension.
    Definition type.hh:122
    \n-
    @ simplex
    Simplicial element in any nonnegative dimension.
    Definition type.hh:121
    \n-
    @ pyramid
    Four sided pyramid in three dimensions.
    Definition type.hh:123
    \n-
    @ extended
    Other, more general topology, representable as topologyId.
    Definition type.hh:125
    \n-
    @ none
    Even more general topology, cannot be specified by a topologyId. Two GeometryTypes with 'none' type a...
    Definition type.hh:126
    \n-
    @ prism
    Prism element in three dimensions.
    Definition type.hh:124
    \n-
    constexpr GeometryType(Id id)
    Reconstruct a Geometry type from a GeometryType::Id.
    Definition type.hh:222
    \n-
    constexpr bool isCube() const
    Return true if entity is a cube of any dimension.
    Definition type.hh:324
    \n-
    constexpr GeometryType()
    Default constructor, not initializing anything.
    Definition type.hh:232
    \n-
    constexpr bool isConical() const
    Return true if entity was constructed with a conical product in the last step.
    Definition type.hh:329
    \n-
    constexpr bool isLine() const
    Return true if entity is a line segment.
    Definition type.hh:284
    \n-
    constexpr bool isQuadrilateral() const
    Return true if entity is a quadrilateral.
    Definition type.hh:294
    \n-
    constexpr bool isPrismatic() const
    Return true if entity was constructed with a prismatic product in the last step.
    Definition type.hh:342
    \n-
    constexpr unsigned int id() const
    Return the topology id of the type.
    Definition type.hh:365
    \n-
    constexpr bool isNone() const
    Return true if entity is a singular of any dimension.
    Definition type.hh:355
    \n-
    constexpr bool isHexahedron() const
    Return true if entity is a hexahedron.
    Definition type.hh:314
    \n-
    constexpr bool isSimplex() const
    Return true if entity is a simplex of any dimension.
    Definition type.hh:319
    \n-
    IdType Id
    An integral id representing a GeometryType.
    Definition type.hh:181
    \n
    \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n
    \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,542 +1,216 @@\n dune-geometry\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bg_\be_\bo_\bm_\be_\bt_\br_\by\n-type.hh\n+generalvertexorder.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-5#ifndef DUNE_GEOMETRY_TYPE_HH\n-6#define DUNE_GEOMETRY_TYPE_HH\n-7\n-12#include \n-13#include \n+5\n+6#ifndef DUNE_GEOMETRY_GENERALVERTEXORDER_HH\n+7#define DUNE_GEOMETRY_GENERALVERTEXORDER_HH\n+8\n+9#include \n+10#include \n+11#include \n+12#include \n+13#include \n 14\n-15#include \n-16#include \n-17\n-18#include \n-19#include \n-20#include \n+15#include \n+16\n+17#include \"_\bt_\by_\bp_\be_\b._\bh_\bh\"\n+18#include <_\bd_\bu_\bn_\be_\b/_\bg_\be_\bo_\bm_\be_\bt_\br_\by_\b/_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh>\n+19\n+20namespace _\bD_\bu_\bn_\be {\n 21\n-22namespace _\bD_\bu_\bn_\be\n-23{\n-24\n-25 namespace Impl\n-26 {\n-27\n-28 enum TopologyConstruction { pyramidConstruction = 0, prismConstruction = 1\n-};\n-29\n-30 // Dynamic Topology Properties\n-31 // ---------------------------\n-32\n-41 inline static unsigned int numTopologies ( int dim ) noexcept\n+39 template\n+_\b4_\b0 void _\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br(const InIterator& inBegin, const InIterator& inEnd,\n+41 OutIterator outIt)\n 42 {\n-43 return (1u << dim);\n-44 }\n-45\n-57 inline bool static isPyramid ( unsigned int topologyId, int dim, int codim =\n-0 ) noexcept\n-58 {\n-59 assert( (dim > 0) && (topologyId < numTopologies( dim )) );\n-60 assert( (0 <= codim) && (codim < dim) );\n-61 return (((topologyId & ~1) & (1u << (dim-codim-1))) == 0);\n-62 }\n-63\n-75 inline static bool isPrism ( unsigned int topologyId, int dim, int codim = 0\n-) noexcept\n-76 {\n-77 assert( (dim > 0) && (topologyId < numTopologies( dim )) );\n-78 assert( (0 <= codim) && (codim < dim) );\n-79 return (( (topologyId | 1) & (1u << (dim-codim-1))) != 0);\n-80 }\n+43 for(InIterator inIt = inBegin; inIt != inEnd; ++inIt, ++outIt)\n+44 *outIt = std::count_if(inBegin, inEnd, [&](const auto& v)\n+45 {\n+46 return v < *inIt;\n+47 });\n+48 }\n+49\n+51\n+66 template\n+_\b6_\b7 class _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br {\n+68 typedef _\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b<_\bd_\bo_\bu_\bb_\bl_\be_\b,_\b _\bd_\bi_\bm_\b> RefElems;\n+69 typedef typename _\bR_\be_\bf_\bE_\bl_\be_\bm_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt RefElem;\n+70\n+71 RefElem refelem;\n+72 _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be gt;\n+73 std::vector vertexOrder;\n+74\n+75 public:\n+_\b7_\b7 typedef Index_ _\bI_\bn_\bd_\be_\bx;\n+78\n+80 class _\bi_\bt_\be_\br_\ba_\bt_\bo_\br;\n 81\n-89 inline static unsigned int baseTopologyId ( unsigned int topologyId, int\n-dim, int codim = 1 ) noexcept\n-90 {\n-91 assert( (dim >= 0) && (topologyId < numTopologies( dim )) );\n-92 assert( (0 <= codim) && (codim <= dim) );\n-93 return topologyId & ((1u << (dim-codim)) - 1);\n-94 }\n-95\n-96 } // namespace Impl\n-97\n-98 // GeometryType\n-99 // -------------\n-100\n-_\b1_\b1_\b3 class _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-114 {\n-115 public:\n-116\n-_\b1_\b1_\b9 enum\n-120 _\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be {\n-_\b1_\b2_\b1 _\bs_\bi_\bm_\bp_\bl_\be_\bx,\n-_\b1_\b2_\b2 _\bc_\bu_\bb_\be,\n-_\b1_\b2_\b3 _\bp_\by_\br_\ba_\bm_\bi_\bd,\n-_\b1_\b2_\b4 _\bp_\br_\bi_\bs_\bm,\n-_\b1_\b2_\b5 _\be_\bx_\bt_\be_\bn_\bd_\be_\bd,\n-126 _\bn_\bo_\bn_\be\n-_\b1_\b2_\b7 };\n-128\n-129 private:\n-130\n-132 unsigned char dim_;\n-133\n-135 bool none_;\n+_\b8_\b3 static const std::size_t _\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn = dim;\n+_\b8_\b5 const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be &_\bt_\by_\bp_\be() const { return gt; }\n+86\n+88\n+96 template\n+_\b9_\b7 _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt_, const InIterator &inBegin,\n+98 const InIterator &inEnd) :\n+99 refelem(RefElems::general(gt_)), gt(gt_),\n+100 vertexOrder(refelem.size(dim))\n+101 { _\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br(inBegin, inEnd, vertexOrder.begin()); }\n+102\n+104\n+_\b1_\b0_\b8 _\bi_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn(std::size_t codim, std::size_t subEntity) const\n+109 { return _\bi_\bt_\be_\br_\ba_\bt_\bo_\br(*this, codim, subEntity); }\n+111\n+_\b1_\b1_\b5 _\bi_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd(std::size_t codim, std::size_t subEntity) const {\n+116 return _\bi_\bt_\be_\br_\ba_\bt_\bo_\br(*this, codim, subEntity,\n+117 refelem.size(subEntity, codim, dim));\n+118 }\n+119\n+121\n+_\b1_\b2_\b8 void _\bg_\be_\bt_\bR_\be_\bd_\bu_\bc_\be_\bd(std::size_t codim, std::size_t subEntity,\n+129 std::vector& order) const\n+130 {\n+131 order.resize(refelem.size(subEntity, codim, dim));\n+132 _\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br(_\bb_\be_\bg_\bi_\bn(codim, subEntity), _\be_\bn_\bd(codim, subEntity),\n+133 order.begin());\n+134 }\n+135 };\n 136\n-138 unsigned int topologyId_;\n-139\n-140 // Internal type used for the Id. The exact nature of this type is kept\n-141 // as an implementation detail on purpose. We use a scoped enum here\n-because scoped enums\n-142 // can be used as template parameters, but are not implicitly converted to\n-other integral\n-143 // types by the compiler. That way, we avoid unfortunate implicit\n-conversion chains, e.g.\n-144 // people trying to work with GlobalGeometryTypeIndex, but forgetting to\n-actually call\n-145 // GlobalGeometryTypeIndex::index(gt) and just using gt directly.\n-146 enum class IdType : std::uint64_t\n-147 {};\n-148\n-149 public:\n-150\n-_\b1_\b8_\b1 using Id = IdType;\n+138\n+141 template\n+_\b1_\b4_\b2 class _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br::_\bi_\bt_\be_\br_\ba_\bt_\bo_\br :\n+143 public Dune::RandomAccessIteratorFacade\n+144 {\n+145 const _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br *order;\n+146 std::size_t codim;\n+147 std::size_t subEntity;\n+148 std::size_t vertex;\n+149\n+150 _\bi_\bt_\be_\br_\ba_\bt_\bo_\br(const _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br &order_, std::size_t codim_,\n+151 std::size_t subEntity_, std::size_t vertex_ = 0) :\n+152 order(&order_), codim(codim_), subEntity(subEntity_), vertex(vertex_)\n+153 { }\n+154\n+155 public:\n+_\b1_\b5_\b6 const _\bI_\bn_\bd_\be_\bx &_\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be() const {\n+157 return order->vertexOrder[order->refelem.subEntity(subEntity, codim,\n+158 vertex, dim)];\n+159 }\n+_\b1_\b6_\b0 const _\bI_\bn_\bd_\be_\bx &_\be_\bl_\be_\bm_\be_\bn_\bt_\bA_\bt(std::ptrdiff_t n) const {\n+161 return order->vertexOrder[order->refelem.subEntity(subEntity, codim,\n+162 vertex+n, dim)];\n+163 }\n+_\b1_\b6_\b4 bool _\be_\bq_\bu_\ba_\bl_\bs(const _\bi_\bt_\be_\br_\ba_\bt_\bo_\br &other) const {\n+165 return order == other.order && codim == other.codim &&\n+166 subEntity == other.subEntity && vertex == other.vertex;\n+167 }\n+_\b1_\b6_\b8 void _\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt() { ++vertex; }\n+_\b1_\b6_\b9 void _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt() { --vertex; }\n+_\b1_\b7_\b0 void _\ba_\bd_\bv_\ba_\bn_\bc_\be(std::ptrdiff_t n) { vertex += n; }\n+_\b1_\b7_\b1 std::ptrdiff_t _\bd_\bi_\bs_\bt_\ba_\bn_\bc_\be_\bT_\bo(const _\bi_\bt_\be_\br_\ba_\bt_\bo_\br &other) const {\n+172 // make sure we reference the same container\n+173 assert(order == other.order && codim == other.codim &&\n+174 subEntity == other.subEntity);\n+175 if(vertex < other.vertex) return other.vertex - vertex;\n+176 else return -static_cast(vertex - other.vertex);\n+177 }\n+178\n+179 friend class _\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br;\n+180\n 182\n-_\b1_\b9_\b0 constexpr operator _\bI_\bd() const\n-191 {\n-192 // recreate the exact storage layout that this class is using, making\n-conversion\n-193 // extremely cheap\n-194 std::uint64_t id = dim_ | (std::uint64_t(none_) << 8) | (std::uint64_t\n-(topologyId_) << 32);\n-195 return static_cast(_\bi_\bd);\n-196 }\n-197\n-_\b2_\b1_\b0 constexpr Id _\bt_\bo_\bI_\bd() const\n-211 {\n-212 return static_cast(*this);\n-213 }\n-214\n-_\b2_\b2_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(Id id)\n-223 : dim_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) & 0xFF)\n-224 , none_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) & 0x100)\n-225 , topologyId_(static_cast<_\bs_\bt_\bd::uint64_t>(_\bi_\bd) >> 32)\n-226 {}\n-227\n-230\n-_\b2_\b3_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be ()\n-233 : dim_(0), none_(true), topologyId_(0)\n-234 {}\n-235\n-_\b2_\b4_\b2 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(unsigned int topologyId, unsigned int _\bd_\bi_\bm, bool\n-_\bi_\bs_\bN_\bo_\bn_\be)\n-243 : dim_(_\bd_\bi_\bm), none_(_\bi_\bs_\bN_\bo_\bn_\be), topologyId_(topologyId)\n-244 {}\n-245\n-_\b2_\b5_\b1 constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(unsigned int topologyId, unsigned int _\bd_\bi_\bm)\n-252 : dim_(_\bd_\bi_\bm), none_(false), topologyId_(topologyId)\n-253 {}\n-254\n-265 template>\n-_\b2_\b6_\b7 explicit _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(TopologyType t)\n-268 : dim_(TopologyType::dimension), none_(false), topologyId_(TopologyType::\n-_\bi_\bd)\n-269 {\n-270 DUNE_UNUSED_PARAMETER(t);\n-271 }\n-272\n-_\b2_\b7_\b9 constexpr bool _\bi_\bs_\bV_\be_\br_\bt_\be_\bx() const {\n-280 return dim_==0;\n-281 }\n-282\n-_\b2_\b8_\b4 constexpr bool _\bi_\bs_\bL_\bi_\bn_\be() const {\n-285 return dim_==1;\n-286 }\n-287\n-_\b2_\b8_\b9 constexpr bool _\bi_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be() const {\n-290 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0001;\n-291 }\n-292\n-_\b2_\b9_\b4 constexpr bool _\bi_\bs_\bQ_\bu_\ba_\bd_\br_\bi_\bl_\ba_\bt_\be_\br_\ba_\bl() const {\n-295 return ! none_ && dim_==2 && (topologyId_ | 1) == 0b0011;\n-296 }\n-297\n-_\b2_\b9_\b9 constexpr bool _\bi_\bs_\bT_\be_\bt_\br_\ba_\bh_\be_\bd_\br_\bo_\bn() const {\n-300 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0001;\n-301 }\n-302\n-_\b3_\b0_\b4 constexpr bool _\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd() const {\n-305 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0011;\n-306 }\n-307\n-_\b3_\b0_\b9 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm() const {\n-310 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0101;\n-311 }\n-312\n-_\b3_\b1_\b4 constexpr bool _\bi_\bs_\bH_\be_\bx_\ba_\bh_\be_\bd_\br_\bo_\bn() const {\n-315 return ! none_ && dim_==3 && (topologyId_ | 1) == 0b0111;\n-316 }\n-317\n-_\b3_\b1_\b9 constexpr bool _\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx() const {\n-320 return ! none_ && (topologyId_ | 1) == 1;\n-321 }\n-322\n-_\b3_\b2_\b4 constexpr bool _\bi_\bs_\bC_\bu_\bb_\be() const {\n-325 return ! none_ && ((topologyId_ ^ ((1 << dim_)-1)) >> 1 == 0);\n-326 }\n-327\n-_\b3_\b2_\b9 constexpr bool _\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl() const {\n-330 return ! none_ && (((topologyId_ & ~1) & (1u << (dim_-1))) == 0);\n-331 }\n-332\n-_\b3_\b3_\b7 constexpr bool _\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl(const int& step) const {\n-338 return ! none_ && (((topologyId_ & ~1) & (1u << step)) == 0);\n-339 }\n-340\n-_\b3_\b4_\b2 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc() const {\n-343 return ! none_ && (( (topologyId_ | 1) & (1u << (dim_-1))) != 0);\n-344 }\n-345\n-_\b3_\b5_\b0 constexpr bool _\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc(const int& step) const {\n-351 return ! none_ && (( (topologyId_ | 1) & (1u << step)) != 0);\n-352 }\n-353\n-_\b3_\b5_\b5 constexpr bool _\bi_\bs_\bN_\bo_\bn_\be() const {\n-356 return none_;\n-357 }\n-358\n-_\b3_\b6_\b0 constexpr unsigned int _\bd_\bi_\bm() const {\n-361 return dim_;\n-362 }\n-363\n-_\b3_\b6_\b5 constexpr unsigned int _\bi_\bd() const {\n-366 return topologyId_;\n-367 }\n-368\n-373\n-_\b3_\b7_\b7 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n-378 return ( ( none_ == other.none_ )\n-379 && ( ( none_ == true )\n-380 || ( ( dim_ == other.dim_ )\n-381 && ( (topologyId_ >> 1) == (other.topologyId_ >> 1) )\n-382 )\n-383 )\n-384 );\n-385 }\n-386\n-_\b3_\b8_\b8 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n-389 return ! ((*this)==other);\n-390 }\n-391\n-_\b3_\b9_\b3 constexpr bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b (const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& other) const {\n-394 return ( ( none_ < other.none_ )\n-395 || ( !( other.none_ < none_ )\n-396 && ( ( dim_ < other.dim_ )\n-397 || ( (other.dim_ == dim_)\n-398 && ((topologyId_ >> 1) < (other.topologyId_ >> 1) )\n-399 )\n-400 )\n-401 )\n-402 );\n-403 }\n-404\n-407 };\n-408\n-_\b4_\b1_\b0 inline std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b (std::ostream& s, const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& a)\n-411 {\n-412 if (a._\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx())\n-413 {\n-414 s << \"(simplex, \" << a._\bd_\bi_\bm() << \")\";\n-415 return s;\n-416 }\n-417 if (a._\bi_\bs_\bC_\bu_\bb_\be())\n-418 {\n-419 s << \"(cube, \" << a._\bd_\bi_\bm() << \")\";\n-420 return s;\n-421 }\n-422 if (a._\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd())\n-423 {\n-424 s << \"(pyramid, 3)\";\n-425 return s;\n-426 }\n-427 if (a._\bi_\bs_\bP_\br_\bi_\bs_\bm())\n-428 {\n-429 s << \"(prism, 3)\";\n-430 return s;\n-431 }\n-432 if (a._\bi_\bs_\bN_\bo_\bn_\be())\n-433 {\n-434 s << \"(none, \" << a._\bd_\bi_\bm() << \")\";\n-435 return s;\n-436 }\n-437 s << \"(other [\" << a._\bi_\bd() << \"], \" << a._\bd_\bi_\bm() << \")\";\n-438 return s;\n-439 }\n-440\n-441\n-443\n-_\b4_\b4_\b7 namespace GeometryTypes {\n-448\n-450\n-453 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be simplex(unsigned int dim)\n-454 {\n-455 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,dim,false);\n-456 }\n-457\n-459\n-462 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be cube(unsigned int dim)\n-463 {\n-464 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(((dim>1) ? ((1 << dim) - 1) : 0),dim,false);\n-465 }\n-466\n-468\n-471 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be none(unsigned int dim)\n-472 {\n-473 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,dim,true);\n-474 }\n-475\n-477 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be conicalExtension(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt)\n-478 {\n-479 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd(), gt._\bd_\bi_\bm()+1, gt._\bi_\bs_\bN_\bo_\bn_\be());\n-480 }\n-481\n-483 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be prismaticExtension(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt)\n-484 {\n-485 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd() | ((1 << gt._\bd_\bi_\bm())), gt._\bd_\bi_\bm()+1, gt._\bi_\bs_\bN_\bo_\bn_\be());\n-486 }\n-487\n-489\n-492 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be vertex = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,0,false);\n-493\n-495\n-498 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be line = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0,1,false);\n-499\n-501\n-504 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be triangle = simplex(2);\n-505\n-507\n-510 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be quadrilateral = cube(2);\n-511\n-513\n-516 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be tetrahedron = simplex(3);\n-517\n-519\n-522 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be pyramid = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0b0011,3,false);\n-523\n-525\n-528 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be prism = _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(0b0101,3,false);\n-529\n-531\n-534 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be hexahedron = cube(3);\n-535\n-536 }\n-537\n-538 namespace Impl\n-539 {\n-540\n-542 inline constexpr _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be getBase(const _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be& gt) {\n-543 return _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be(gt._\bi_\bd() & ((1 << (gt._\bd_\bi_\bm()-1))-1), gt._\bd_\bi_\bm()-1,\n-gt._\bi_\bs_\bN_\bo_\bn_\be());\n-544 }\n-545\n-546\n-547 // IfGeometryType\n-548 // ----------\n-549\n-550 template< template< GeometryType::Id > class Operation, int dim,\n-_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd geometryId = GeometryTypes::vertex >\n-551 struct IfGeometryType\n-552 {\n-553 static constexpr GeometryType geometry = geometryId;\n-554 template< class... Args >\n-555 static auto apply ( GeometryType gt, Args &&... args )\n-556 {\n-557 GeometryType lowerGeometry(gt.id() >>1 , gt.dim()-1, gt.isNone());\n-558\n-559 if( gt.id() & 1 )\n-560 return IfGeometryType< Operation, dim-1, GeometryTypes::prismaticExtension\n-(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );\n-561 else\n-562 return IfGeometryType< Operation, dim-1, GeometryTypes::conicalExtension\n-(geometry).toId() >::apply( lowerGeometry, std::forward< Args >( args )... );\n-563 }\n-564 };\n-565\n-566 template< template< GeometryType::Id > class Operation, _\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd\n-geometryId >\n-567 struct IfGeometryType< Operation, 0, geometryId>\n-568 {\n-569 template< class... Args >\n-570 static auto apply ([[maybe_unused]] GeometryType gt, Args &&... args )\n-571 {\n-572 return Operation< geometryId >::apply( std::forward< Args >( args )... );\n-573 }\n-574 };\n-575 } // namespace Impl\n-576} // namespace Dune\n-577\n-578#endif // DUNE_GEOMETRY_TYPE_HH\n-_\bs_\bt_\bd\n-STL namespace.\n+_\b1_\b8_\b7 _\bi_\bt_\be_\br_\ba_\bt_\bo_\br() { }\n+188 };\n+189} // namespace Dune\n+190\n+191#endif // DUNE_GEOMETRY_GENERALVERTEXORDER_HH\n+_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be_\be_\bl_\be_\bm_\be_\bn_\bt_\bs_\b._\bh_\bh\n+_\bt_\by_\bp_\be_\b._\bh_\bh\n+A unique label for each type of element that can occur in a grid.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn affinegeometry.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n-std::ostream & operator<<(std::ostream &s, const GeometryType &a)\n-Prints the type to an output stream.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:410\n+_\bD_\bu_\bn_\be_\b:_\b:_\br_\be_\bd_\bu_\bc_\be_\bO_\br_\bd_\be_\br\n+void reduceOrder(const InIterator &inBegin, const InIterator &inEnd,\n+OutIterator outIt)\n+Algorithm to reduce vertex order information.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:40\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+Class providing access to the singletons of the reference elements.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs_\b:_\b:_\bR_\be_\bf_\be_\br_\be_\bn_\bc_\be_\bE_\bl_\be_\bm_\be_\bn_\bt\n+typename Container::ReferenceElement ReferenceElement\n+The reference element type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn referenceelements.hh:146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br\n+Class providing information on the ordering of vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:67\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Index_ Index\n+Type of indices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bt_\by_\bp_\be\n+const GeometryType & type() const\n+get type of the entity's geometry\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bd_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+static const std::size_t dimension\n+export the dimension of the entity we provide information for\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bg_\be_\bt_\bR_\be_\bd_\bu_\bc_\be_\bd\n+void getReduced(std::size_t codim, std::size_t subEntity, std::vector< Index >\n+&order) const\n+get a vector of reduced indices for some sub-entity\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:128\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\be_\bn_\bd\n+iterator end(std::size_t codim, std::size_t subEntity) const\n+get end iterator for the vertex indices of some sub-entity\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:115\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br\n+GeneralVertexOrder(const GeometryType >_, const InIterator &inBegin, const\n+InIterator &inEnd)\n+construct a GeneralVertexOrder\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:97\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bb_\be_\bg_\bi_\bn\n+iterator begin(std::size_t codim, std::size_t subEntity) const\n+get begin iterator for the vertex indices of some sub-entity\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:108\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n+Iterate over the vertex indices of some sub-entity.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:144\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n+iterator()\n+public default constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:187\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt\n+void decrement()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:169\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bd_\bv_\ba_\bn_\bc_\be\n+void advance(std::ptrdiff_t n)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:170\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\be_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n+const Index & dereference() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:156\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bn_\bc_\br_\be_\bm_\be_\bn_\bt\n+void increment()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:168\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\be_\bq_\bu_\ba_\bl_\bs\n+bool equals(const iterator &other) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:164\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bs_\bt_\ba_\bn_\bc_\be_\bT_\bo\n+std::ptrdiff_t distanceTo(const iterator &other) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:171\n+_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bn_\be_\br_\ba_\bl_\bV_\be_\br_\bt_\be_\bx_\bO_\br_\bd_\be_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\be_\bl_\be_\bm_\be_\bn_\bt_\bA_\bt\n+const Index & elementAt(std::ptrdiff_t n) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn generalvertexorder.hh:160\n _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n Unique label for each type of entities that can occur in DUNE grids.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-constexpr GeometryType(unsigned int topologyId, unsigned int dim)\n-Constructor, using the topologyId (integer) and the dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:251\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<\n-constexpr bool operator<(const GeometryType &other) const\n-less-than operation for use with maps\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:393\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n-constexpr bool operator!=(const GeometryType &other) const\n-Check for inequality.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:388\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\by_\br_\ba_\bm_\bi_\bd\n-constexpr bool isPyramid() const\n-Return true if entity is a pyramid.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:304\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bT_\be_\bt_\br_\ba_\bh_\be_\bd_\br_\bo_\bn\n-constexpr bool isTetrahedron() const\n-Return true if entity is a tetrahedron.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:299\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm\n-constexpr bool isPrism() const\n-Return true if entity is a prism.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:309\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bV_\be_\br_\bt_\be_\bx\n-constexpr bool isVertex() const\n-Return true if entity is a vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:279\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-constexpr bool operator==(const GeometryType &other) const\n-Check for equality. This method knows that in dimension 0 and 1 all BasicTypes\n-are equal.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:377\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bt_\bo_\bI_\bd\n-constexpr Id toId() const\n-Create an Id representation of this GeometryType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:210\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl\n-constexpr bool isConical(const int &step) const\n-Return true if entity was constructed with a conical product in the chosen\n-step.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:337\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bd_\bi_\bm\n-constexpr unsigned int dim() const\n-Return dimension of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:360\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc\n-constexpr bool isPrismatic(const int &step) const\n-Return true if entity was constructed with a prismatic product in the chosen\n-step.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:350\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n-constexpr bool isTriangle() const\n-Return true if entity is a triangle.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:289\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-GeometryType(TopologyType t)\n-Constructor from static TopologyType class.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:267\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-constexpr GeometryType(unsigned int topologyId, unsigned int dim, bool isNone)\n-Constructor, using the topologyId (integer), the dimension and a flag for type\n-none.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:242\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bB_\ba_\bs_\bi_\bc_\bT_\by_\bp_\be\n-BasicType\n-Each entity can be tagged by one of these basic types plus its space dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:120\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bc_\bu_\bb_\be\n-@ cube\n-Cube element in any nonnegative dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:122\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bs_\bi_\bm_\bp_\bl_\be_\bx\n-@ simplex\n-Simplicial element in any nonnegative dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:121\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\by_\br_\ba_\bm_\bi_\bd\n-@ pyramid\n-Four sided pyramid in three dimensions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:123\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\be_\bx_\bt_\be_\bn_\bd_\be_\bd\n-@ extended\n-Other, more general topology, representable as topologyId.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:125\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bn_\bo_\bn_\be\n-@ none\n-Even more general topology, cannot be specified by a topologyId. Two\n-GeometryTypes with 'none' type a...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:126\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bp_\br_\bi_\bs_\bm\n-@ prism\n-Prism element in three dimensions.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:124\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-constexpr GeometryType(Id id)\n-Reconstruct a Geometry type from a GeometryType::Id.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:222\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bu_\bb_\be\n-constexpr bool isCube() const\n-Return true if entity is a cube of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:324\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be\n-constexpr GeometryType()\n-Default constructor, not initializing anything.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:232\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bC_\bo_\bn_\bi_\bc_\ba_\bl\n-constexpr bool isConical() const\n-Return true if entity was constructed with a conical product in the last step.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:329\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bL_\bi_\bn_\be\n-constexpr bool isLine() const\n-Return true if entity is a line segment.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:284\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bQ_\bu_\ba_\bd_\br_\bi_\bl_\ba_\bt_\be_\br_\ba_\bl\n-constexpr bool isQuadrilateral() const\n-Return true if entity is a quadrilateral.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:294\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bP_\br_\bi_\bs_\bm_\ba_\bt_\bi_\bc\n-constexpr bool isPrismatic() const\n-Return true if entity was constructed with a prismatic product in the last\n-step.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:342\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bd\n-constexpr unsigned int id() const\n-Return the topology id of the type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:365\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bN_\bo_\bn_\be\n-constexpr bool isNone() const\n-Return true if entity is a singular of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:355\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bH_\be_\bx_\ba_\bh_\be_\bd_\br_\bo_\bn\n-constexpr bool isHexahedron() const\n-Return true if entity is a hexahedron.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:314\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bi_\bs_\bS_\bi_\bm_\bp_\bl_\be_\bx\n-constexpr bool isSimplex() const\n-Return true if entity is a simplex of any dimension.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:319\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bo_\bm_\be_\bt_\br_\by_\bT_\by_\bp_\be_\b:_\b:_\bI_\bd\n-IdType Id\n-An integral id representing a GeometryType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn type.hh:181\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00260.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00260.html", "unified_diff": "@@ -274,15 +274,15 @@\n
    GeometryTypes::cube(2), 2>
    \n
    {
    \n
    typedef SquaringTheCircle::RefinementImp<CoordType> Imp;
    \n
    };
    \n
    }
    \n
    This namespace contains the implementation of Refinement.
    Definition base.cc:29
    \n If you implement a template class, you have to specialise struct RefinementImp::Traits for every possible combination of topologyId and coerceToId that your implementation supports.\n-
  • #include \"refinement/squaringthecircle.cc\" from refinement.hh.
  • \n+
  • #include \"refinement/squaringthecircle.cc\" from refinement.hh.
  • \n \n

    This is enough to integrate your implementation into the Refinement system. You probably want to include it into VirtualRefinement also.

    \n

    \n Namespaces

    \n

    The (non-virtual) Refinement system is organized in the following way into namespaces:

      \n
    • Only template class StaticRefinement lives directly in namespace Dune.
    • \n
    • Use namespace Dune::RefinementImp for all the Implementation.
    • \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a00263.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a00263.html", "unified_diff": "@@ -647,16 +647,16 @@\n )\n \n \n \n
      \n \n

      Algorithm to reduce vertex order information.

      \n-
      \n-\n+
      Parameters
      \n \n \n \n \n
      inBeginStart of the range of ids to reduce.
      inEndEnd of the range of ids to reduce.
      outItStart of the sequence where to store the result.
      \n
      \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01091.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01091.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::Geo::ReferenceElement< Implementation > Class Template Reference
      \n
      \n
      \n \n

      This class provides access to geometric and topological properties of a reference element. \n More...

      \n \n-

      #include <dune/geometry/referenceelement.hh>

      \n+

      #include <dune/geometry/referenceelement.hh>

      \n
      \n Inheritance diagram for Dune::Geo::ReferenceElement< Implementation >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -883,16 +883,16 @@\n
      \n \n

      The dimension of the reference element.

      \n \n
      \n
      \n
      The documentation for this class was generated from the following files:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01095.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01095.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01099.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01099.html", "unified_diff": "@@ -81,15 +81,15 @@\n
      Dune::Geo::ReferenceElements< ctype_, dim > Struct Template Reference
      \n \n
      \n \n

      Class providing access to the singletons of the reference elements. \n More...

      \n \n-

      #include <dune/geometry/referenceelements.hh>

      \n+

      #include <dune/geometry/referenceelements.hh>

      \n \n \n \n \n \n \n@@ -389,16 +389,16 @@\n
      \n \n

      The dimension of the contained reference elements.

      \n \n
      \n \n
      The documentation for this struct was generated from the following files:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01107.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01107.html", "unified_diff": "@@ -81,15 +81,15 @@\n
      Dune::AffineGeometry< ct, mydim, cdim > Class Template Reference
      \n \n
      \n \n

      Implementation of the Geometry interface for affine geometries. \n More...

      \n \n-

      #include <dune/geometry/affinegeometry.hh>

      \n+

      #include <dune/geometry/affinegeometry.hh>

      \n

      \n Public Types

      using ctype = ctype_
       The coordinate field type of the contained reference elements.
       
      using CoordinateField = ctype
      \n \n \n \n \n \n@@ -1028,15 +1028,15 @@\n
      \n \n

      Dimension of the geometry.

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01111.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01111.html", "unified_diff": "@@ -81,15 +81,15 @@\n
      Dune::AxisAlignedCubeGeometry< CoordType, dim, coorddim > Class Template Reference
      \n \n
      \n \n

      A geometry implementation for axis-aligned hypercubes. \n More...

      \n \n-

      #include <dune/geometry/axisalignedcubegeometry.hh>

      \n+

      #include <dune/geometry/axisalignedcubegeometry.hh>

      \n

      \n Public Types

      typedef ct ctype
       Type used for coordinates.
       
      typedef FieldVector< ctype, mydimensionLocalCoordinate
      \n \n \n \n \n \n@@ -933,15 +933,15 @@\n
      \n \n

      Dimension of the cube element.

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01115.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01115.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::Dim< dim > Struct Template Reference
      \n \n
      \n \n

      Static tag representing a dimension. \n More...

      \n \n-

      #include <dune/geometry/dimension.hh>

      \n+

      #include <dune/geometry/dimension.hh>

      \n
      \n Inheritance diagram for Dune::Dim< dim >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -117,15 +117,15 @@\n \n

      \n Public Types

      typedef CoordType ctype
       Type used for single coordinate coefficients.
       
      typedef FieldVector< ctype, dim > LocalCoordinate
      \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01119.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01119.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::Codim< codim > Struct Template Reference
      \n \n
      \n \n

      Static tag representing a codimension. \n More...

      \n \n-

      #include <dune/geometry/dimension.hh>

      \n+

      #include <dune/geometry/dimension.hh>

      \n
      \n Inheritance diagram for Dune::Codim< codim >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -123,15 +123,15 @@\n \n \n
      \n \n
      \n
      \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01123.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01123.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::GeneralVertexOrder< dim, Index_ > Class Template Reference
      \n \n
      \n \n

      Class providing information on the ordering of vertices. \n More...

      \n \n-

      #include <dune/geometry/generalvertexorder.hh>

      \n+

      #include <dune/geometry/generalvertexorder.hh>

      \n \n \n \n \n \n

      \n Classes

      class  iterator
       Iterate over the vertex indices of some sub-entity. More...
       
      \n@@ -417,15 +417,15 @@\n
      \n \n

      export the dimension of the entity we provide information for

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01127.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01127.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::GeneralVertexOrder< dim, Index_ >::iterator Class Reference
      \n \n
      \n \n

      Iterate over the vertex indices of some sub-entity. \n More...

      \n \n-

      #include <dune/geometry/generalvertexorder.hh>

      \n+

      #include <dune/geometry/generalvertexorder.hh>

      \n
      \n Inheritance diagram for Dune::GeneralVertexOrder< dim, Index_ >::iterator:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -341,15 +341,15 @@\n \n
      \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01131.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01131.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::LocalFiniteElementGeometry< LFE, cdim > Class Template Reference
      \n \n
      \n \n

      Geometry implementation based on local-basis function parametrization. \n More...

      \n \n-

      #include <dune/geometry/localfiniteelementgeometry.hh>

      \n+

      #include <dune/geometry/localfiniteelementgeometry.hh>

      \n \n \n \n \n \n \n@@ -1267,15 +1267,15 @@\n
      \n \n

      geometry dimension

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01139.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01139.html", "unified_diff": "@@ -81,15 +81,15 @@\n
      Dune::MultiLinearGeometryTraits< ct > Struct Template Reference
      \n \n
      \n \n

      default traits class for MultiLinearGeometry \n More...

      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n

      \n Public Types

      using ctype = typename LocalBasisTraits::DomainFieldType
       coordinate type
       
      using LocalCoordinate = FieldVector< ctype, mydimension >
      \n \n \n \n \n \n@@ -176,15 +176,15 @@\n
      \n \n

      tolerance to numerical algorithms

      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01143.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01143.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::MultiLinearGeometryTraits< ct >::CornerStorage< mydim, cdim > Struct Template Reference
      \n \n
      \n \n

      template specifying the storage for the corners \n More...

      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n

      \n Classes

      struct  CornerStorage
       template specifying the storage for the corners More...
       
      struct  hasSingleGeometryType
      \n \n \n \n

      \n Public Types

      typedef std::vector< FieldVector< ct, cdim > > Type
       
      \n

      Detailed Description

      \n@@ -143,15 +143,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01147.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01147.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::MultiLinearGeometryTraits< ct >::hasSingleGeometryType< dim > Struct Template Reference
      \n \n
      \n \n

      will there be only one geometry type for a dimension? \n More...

      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n \n \n \n \n \n \n@@ -149,15 +149,15 @@\n \n

      \n Static Public Attributes

      static const bool v = false
       
      static const unsigned int topologyId = ~0u
       
      \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01151.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01151.html", "unified_diff": "@@ -85,15 +85,15 @@\n
      Dune::MultiLinearGeometry< ct, mydim, cdim, Traits > Class Template Reference
      \n \n
      \n \n

      generic geometry implementation based on corner coordinates \n More...

      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n
      \n Inheritance diagram for Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -1521,15 +1521,15 @@\n
      \n \n

      geometry dimension

      \n \n
      \n
      \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01155.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01155.html", "unified_diff": "@@ -76,15 +76,15 @@\n \n
      Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed Class Reference
      \n \n
      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n
      \n Inheritance diagram for Dune::MultiLinearGeometry< ct, mydim, cdim, Traits >::JacobianInverseTransposed:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -211,15 +211,15 @@\n \n \n
      \n \n
      \n
      \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01159.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01159.html", "unified_diff": "@@ -84,15 +84,15 @@\n
      Dune::CachedMultiLinearGeometry< ct, mydim, cdim, Traits > Class Template Reference
      \n \n
      \n \n

      Implement a MultiLinearGeometry with additional caching. \n More...

      \n \n-

      #include <dune/geometry/multilineargeometry.hh>

      \n+

      #include <dune/geometry/multilineargeometry.hh>

      \n
      \n Inheritance diagram for Dune::CachedMultiLinearGeometry< ct, mydim, cdim, Traits >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -1479,15 +1479,15 @@\n
      \n \n

      geometry dimension

      \n \n
      \n
      \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01163.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01163.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::QuadraturePoint< ct, dim > Class Template Reference
      \n \n
      \n \n

      Single evaluation point in a quadrature rule. \n More...

      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n \n \n \n \n \n \n@@ -392,15 +392,15 @@\n \n

      \n Public Types

      typedef ct Field
       Number type used for coordinates and quadrature weights.
       
      typedef Dune::FieldVector< ct, dim > Vector
      \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01167.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01167.html", "unified_diff": "@@ -73,27 +73,27 @@\n \n \n
      \n
      std::tuple_size< Dune::QuadraturePoint< ct, dim > > Struct Template Reference
      \n
      \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      \n Inheritance diagram for std::tuple_size< Dune::QuadraturePoint< ct, dim > >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n \"\"\n \n
      \n
      The documentation for this struct was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01171.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01171.html", "unified_diff": "@@ -76,15 +76,15 @@\n \n
      std::tuple_element< 0, Dune::QuadraturePoint< ct, dim > > Struct Template Reference
      \n \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n \n \n \n \n

      \n Public Types

      using type = Dune::FieldVector< ct, dim >
       
      \n

      Member Typedef Documentation

      \n@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01175.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01175.html", "unified_diff": "@@ -76,15 +76,15 @@\n \n
      std::tuple_element< 1, Dune::QuadraturePoint< ct, dim > > Struct Template Reference
      \n \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n \n \n \n \n

      \n Public Types

      using type = ct
       
      \n

      Member Typedef Documentation

      \n@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01179.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01179.html", "unified_diff": "@@ -76,29 +76,29 @@\n
      Dune::QuadratureOrderOutOfRange Class Reference
      \n \n
      \n \n

      Exception thrown if a desired QuadratureRule is not available, because the requested order is to high. \n More...

      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      \n Inheritance diagram for Dune::QuadratureOrderOutOfRange:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n \"\"\n \n
      \n

      Detailed Description

      \n

      Exception thrown if a desired QuadratureRule is not available, because the requested order is to high.

      \n

      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01183.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01183.html", "unified_diff": "@@ -84,15 +84,15 @@\n
      Dune::QuadratureRule< ct, dim > Class Template Reference
      \n \n
      \n \n

      Abstract base class for quadrature rules. \n More...

      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      \n Inheritance diagram for Dune::QuadratureRule< ct, dim >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -482,15 +482,15 @@\n \n \n
      \n \n
      \n
      \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01187.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01187.html", "unified_diff": "@@ -78,21 +78,21 @@\n
      Dune::QuadratureRuleFactory< ctype, dim > Class Template Reference
      \n \n
      \n \n

      Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType. \n More...

      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n

      Detailed Description

      \n
      template<typename ctype, int dim>
      \n class Dune::QuadratureRuleFactory< ctype, dim >

      Factory class for creation of quadrature rules, depending on GeometryType, order and QuadratureType.

      \n

      The whole class is private and can only be accessed by the singleton container class QuadratureRules.

      \n

      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01191.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01191.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::QuadratureRules< ctype, dim > Class Template Reference
      \n \n
      \n \n

      A container for all quadrature rules of dimension dim \n More...

      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n \n \n \n \n \n \n@@ -230,15 +230,15 @@\n
      \n \n

      select the appropriate QuadratureRule for GeometryType t and order p

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01195.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01195.html", "unified_diff": "@@ -75,17 +75,17 @@\n
      \n \n
      Dune::QuadratureRuleFactory< ctype, 0 > Class Template Reference
      \n
      \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01199.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01199.html", "unified_diff": "@@ -75,17 +75,17 @@\n
      \n \n
      Dune::QuadratureRuleFactory< ctype, 1 > Class Template Reference
      \n
      \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01203.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01203.html", "unified_diff": "@@ -75,17 +75,17 @@\n
      \n \n
      Dune::QuadratureRuleFactory< ctype, 2 > Class Template Reference
      \n
      \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01207.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01207.html", "unified_diff": "@@ -75,17 +75,17 @@\n
      \n \n
      Dune::QuadratureRuleFactory< ctype, 3 > Class Template Reference
      \n
      \n
      \n \n-

      #include <dune/geometry/quadraturerules.hh>

      \n+

      #include <dune/geometry/quadraturerules.hh>

      \n
      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01215.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01215.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::Geo::ReferenceElement< Implementation >::Codim< codim > Struct Template Reference
      \n \n
      \n \n

      Collection of types depending on the codimension. \n More...

      \n \n-

      #include <dune/geometry/referenceelement.hh>

      \n+

      #include <dune/geometry/referenceelement.hh>

      \n

      \n Static Public Member Functions

      static unsigned maxOrder (const GeometryType &t, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
       maximum quadrature order for given geometry type and quadrature type
       
      static const QuadratureRulerule (const GeometryType &t, int p, QuadratureType::Enum qt=QuadratureType::GaussLegendre)
      \n \n \n \n \n

      \n Public Types

      using Geometry = implementation-defined
       type of geometry embedding a subentity into the reference element
       
      \n@@ -113,15 +113,15 @@\n
      \n \n

      type of geometry embedding a subentity into the reference element

      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01219.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01219.html", "unified_diff": "@@ -96,15 +96,15 @@\n

      Each specialisation should contain a single member typedef Imp, e.g.:

      template<class CoordType>
      \n
      struct Traits<sphereTopologyId, CoordType, Impl::CubeToplogy<2>::id, 2>
      \n
      {
      \n
      typedef SquaringTheCircle::Refinement Imp;
      \n
      };
      \n
      Mapping from geometryType, CoordType and coerceTo to a particular Refinement implementation.
      Definition base.cc:70
      \n

      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01223.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01223.html", "unified_diff": "@@ -143,15 +143,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01227.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01227.html", "unified_diff": "@@ -461,15 +461,15 @@\n \n

      The IndexVector of the Refinement.

      \n

      This is always a typedef to a FieldVector

      \n \n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01231.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01231.html", "unified_diff": "@@ -118,15 +118,15 @@\n \n

      The SubEntityIterator for each codim.

      \n

      This is some sort of type, not necessarily a typedef

      \n \n \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01235.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01235.html", "unified_diff": "@@ -412,15 +412,15 @@\n
      \n \n

      Know your own dimension.

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01239.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01239.html", "unified_diff": "@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01243.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01243.html", "unified_diff": "@@ -98,15 +98,15 @@\n CoordTypeCoordinate type of the refined element \n codimensionCodimension of the iterator\n \n \n \n

      This is the base class for SubEntityIterators. We have to use this construct because RefinementImp<...>::codim<...> cannot be specialized without first specializing RefinementImp.

      \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01247.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01247.html", "unified_diff": "@@ -161,15 +161,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01251.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01251.html", "unified_diff": "@@ -200,15 +200,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01255.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01255.html", "unified_diff": "@@ -265,15 +265,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01259.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01259.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01263.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01263.html", "unified_diff": "@@ -395,15 +395,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01267.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01267.html", "unified_diff": "@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01271.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01271.html", "unified_diff": "@@ -452,15 +452,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01275.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01275.html", "unified_diff": "@@ -513,15 +513,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01279.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01279.html", "unified_diff": "@@ -196,15 +196,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01283.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01283.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01287.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01287.html", "unified_diff": "@@ -402,15 +402,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01291.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01291.html", "unified_diff": "@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01295.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01295.html", "unified_diff": "@@ -452,15 +452,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01299.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01299.html", "unified_diff": "@@ -491,15 +491,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01303.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01303.html", "unified_diff": "@@ -196,15 +196,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01307.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01307.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01311.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01311.html", "unified_diff": "@@ -402,15 +402,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01315.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01315.html", "unified_diff": "@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01319.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01319.html", "unified_diff": "@@ -452,15 +452,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01323.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01323.html", "unified_diff": "@@ -491,15 +491,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01327.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01327.html", "unified_diff": "@@ -196,15 +196,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01331.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01331.html", "unified_diff": "@@ -395,15 +395,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01335.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01335.html", "unified_diff": "@@ -101,15 +101,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01339.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01339.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01343.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01343.html", "unified_diff": "@@ -384,15 +384,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01347.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01347.html", "unified_diff": "@@ -503,15 +503,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01351.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01351.html", "unified_diff": "@@ -152,15 +152,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01355.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01355.html", "unified_diff": "@@ -81,15 +81,15 @@\n
      Dune::TopologyFactory< Traits > Struct Template Reference
      \n \n
      \n \n

      Provide a factory over the generic topologies. \n More...

      \n \n-

      #include <dune/geometry/topologyfactory.hh>

      \n+

      #include <dune/geometry/topologyfactory.hh>

      \n \n \n \n \n \n \n@@ -328,15 +328,15 @@\n \n

      \n Public Types

      typedef Traits::Key Key
       
      typedef Traits::Object Object
       
      \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01359.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01359.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::TopologySingletonFactory< Factory > Struct Template Reference
      \n \n
      \n \n

      A wrapper for a TopologyFactory providing singleton storage. Same usage as TopologyFactory but with empty release method an internal storage. \n More...

      \n \n-

      #include <dune/geometry/topologyfactory.hh>

      \n+

      #include <dune/geometry/topologyfactory.hh>

      \n \n \n \n \n \n \n@@ -309,15 +309,15 @@\n \n

      \n Public Types

      typedef Factory::Key Key
       
      typedef const Factory::Object Object
       
      \n
      \n \n
      \n \n
      The documentation for this struct was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01367.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01367.html", "unified_diff": "@@ -80,15 +80,15 @@\n
      Dune::GeometryType Class Reference
      \n \n
      \n \n

      Unique label for each type of entities that can occur in DUNE grids. \n More...

      \n \n-

      #include <dune/geometry/type.hh>

      \n+

      #include <dune/geometry/type.hh>

      \n \n \n \n

      \n Public Types

      enum  BasicType {
      \n   simplex\n , cube\n , pyramid\n@@ -1059,15 +1059,15 @@\n

      Create an Id representation of this GeometryType.

      \n

      The returned Id encapsulates the whole information of this GeometryType into an enum suitable for being used as template parameter. The GeometryType can be reconstructed from the Id using GeometryType{id}.

      \n

      This function was mainly introduced to support older GCC versions (<10.2). There the implicit conversion from GeometryType to Id failed if a pure r-value template argument based on a static class member was used. (See dune/geometry/test/test-geometrytype-id.cc)

      \n \n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01379.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01379.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::LocalGeometryTypeIndex Class Reference
      \n \n
      \n \n

      Compute per-dimension indices for geometry types. \n More...

      \n \n-

      #include <dune/geometry/typeindex.hh>

      \n+

      #include <dune/geometry/typeindex.hh>

      \n \n \n \n \n \n \n@@ -193,15 +193,15 @@\n
      \n \n

      compute the geometry type for the given local index and dimension

      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01383.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01383.html", "unified_diff": "@@ -79,15 +79,15 @@\n
      Dune::GlobalGeometryTypeIndex Class Reference
      \n \n
      \n \n

      Compute indices for geometry types, taking the dimension into account. \n More...

      \n \n-

      #include <dune/geometry/typeindex.hh>

      \n+

      #include <dune/geometry/typeindex.hh>

      \n

      \n Static Public Member Functions

      static constexpr std::size_t size (std::size_t dim)
       Compute total number of geometry types for the given dimension.
       
      static constexpr std::size_t index (const GeometryType &gt)
      \n \n \n \n \n \n@@ -183,15 +183,15 @@\n \n

      Compute total number of geometry types up to and including the given dimension.

      \n

      This includes irregular geometry types such as \"None\".

      \n \n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01395.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01395.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01399.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01399.html", "unified_diff": "@@ -73,15 +73,15 @@\n \n \n
      \n
      Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, dimension > Class Template Reference
      \n
      \n
      \n
      The documentation for this class was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01403.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01403.html", "unified_diff": "@@ -161,15 +161,15 @@\n \n

      \n Static Public Member Functions

      static constexpr std::size_t offset (std::size_t dim)
       Compute the starting index for a given dimension including irregular geometry types.
       
      static constexpr std::size_t size (std::size_t maxdim)
      \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01407.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01407.html", "unified_diff": "@@ -367,15 +367,15 @@\n
      \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01411.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01411.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01415.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01415.html", "unified_diff": "@@ -110,15 +110,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01419.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01419.html", "unified_diff": "@@ -181,15 +181,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01423.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01423.html", "unified_diff": "@@ -344,15 +344,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01427.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01427.html", "unified_diff": "@@ -579,15 +579,15 @@\n \n \n \n \n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01431.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01431.html", "unified_diff": "@@ -341,15 +341,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01435.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01435.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01439.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01439.html", "unified_diff": "@@ -83,15 +83,15 @@\n \n \"\"\n \"\"\n \"\"\n \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01443.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01443.html", "unified_diff": "@@ -207,15 +207,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01447.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01447.html", "unified_diff": "@@ -121,15 +121,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01451.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01451.html", "unified_diff": "@@ -121,15 +121,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01455.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01455.html", "unified_diff": "@@ -121,15 +121,15 @@\n \n \n
      \n \n
      \n \n
      The documentation for this class was generated from the following file:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01459.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01459.html", "unified_diff": "@@ -82,15 +82,15 @@\n
      Dune::VirtualRefinement< dimension, CoordType > Class Template Referenceabstract
      \n \n
      \n \n

      VirtualRefinement base class. \n More...

      \n \n-

      #include <dune/geometry/virtualrefinement.hh>

      \n+

      #include <dune/geometry/virtualrefinement.hh>

      \n
      \n Inheritance diagram for Dune::VirtualRefinement< dimension, CoordType >:
      \n
      \n
      \"Inheritance
      \n \n \"\"\n \"\"\n@@ -607,16 +607,16 @@\n \n \n
      \n \n
      \n
      \n
      The documentation for this class was generated from the following files:\n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/a01463.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/a01463.html", "unified_diff": "@@ -76,21 +76,21 @@\n
      Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension > Struct Template Reference
      \n \n
      \n \n

      codim database of VirtualRefinement \n More...

      \n \n-

      #include <dune/geometry/virtualrefinement.hh>

      \n+

      #include <dune/geometry/virtualrefinement.hh>

      \n

      Detailed Description

      \n
      template<int dimension, class CoordType>
      \n template<int codimension>
      \n struct Dune::VirtualRefinement< dimension, CoordType >::Codim< codimension >

      codim database of VirtualRefinement

      \n

      The documentation for this struct was generated from the following file:\n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_000004_000006.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_000004_000006.html", "unified_diff": "@@ -69,14 +69,14 @@\n \n
      \n \n
      \n \n \n+

      geometry → refinement Relation

      File in dune/geometryIncludes file in dune/geometry/refinement
      refinement.hhbase.cc
      refinement.hhhcube.cc
      refinement.hhhcubetriangulation.cc
      refinement.hhprismtriangulation.cc
      refinement.hhpyramidtriangulation.cc
      refinement.hhsimplex.cc
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_000004_000007.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_000004_000007.html", "unified_diff": "@@ -69,14 +69,14 @@\n \n
      \n \n
      \n \n \n+

      geometry → utility Relation

      File in dune/geometryIncludes file in dune/geometry/utility
      localfiniteelementgeometry.hhalgorithms.hh
      localfiniteelementgeometry.hhconvergence.hh
      mappedgeometry.hhalgorithms.hh
      mappedgeometry.hhconvergence.hh
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_18620fa9f137864b479f21357cfac10d.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_18620fa9f137864b479f21357cfac10d.html", "unified_diff": "@@ -97,56 +97,56 @@\n  refinement\n  \n  utility\n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n-\n+\n+\n \n-\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

      \n Files

       affinegeometry.hh
       An implementation of the Geometry interface for affine geometries.
       affinegeometry.hh
       An implementation of the Geometry interface for affine geometries.
       
       axisalignedcubegeometry.hh
       A geometry implementation for axis-aligned hypercubes.
       axisalignedcubegeometry.hh
       A geometry implementation for axis-aligned hypercubes.
       
       dimension.hh
       dimension.hh
       
       generalvertexorder.hh
       generalvertexorder.hh
       
       localfiniteelementgeometry.hh
       localfiniteelementgeometry.hh
       
       mappedgeometry.hh
       
       multilineargeometry.hh
       multilineargeometry.hh
       
       quadraturerules.hh
       quadraturerules.hh
       
       referenceelement.hh
       referenceelement.hh
       
       referenceelementimplementation.cc
       referenceelementimplementation.cc
       
       referenceelementimplementation.hh
       referenceelementimplementation.hh
       
       referenceelements.hh
       referenceelements.hh
       
       refinement.hh
       This file simply includes all Refinement implementations so you don't have to do them separately.
       refinement.hh
       This file simply includes all Refinement implementations so you don't have to do them separately.
       
       topologyfactory.hh
       topologyfactory.hh
       
       type.hh
       A unique label for each type of element that can occur in a grid.
       type.hh
       A unique label for each type of element that can occur in a grid.
       
       typeindex.hh
       Helper classes to provide indices for geometrytypes for use in a vector.
       typeindex.hh
       Helper classes to provide indices for geometrytypes for use in a vector.
       
       virtualrefinement.cc
       This file contains the virtual wrapper around refinement.
       virtualrefinement.cc
       This file contains the virtual wrapper around refinement.
       
       virtualrefinement.hh
       This file contains the virtual wrapper around refinement.
       virtualrefinement.hh
       This file contains the virtual wrapper around refinement.
       
      \n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_428ed1c935e77406fcbfdccd4ee3f7a2.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_428ed1c935e77406fcbfdccd4ee3f7a2.html", "unified_diff": "@@ -84,19 +84,19 @@\n \"\"\n \"\"\n \n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n

      \n Files

       algorithms.hh
       algorithms.hh
       
       convergence.hh
       convergence.hh
       
       typefromvertexcount.hh
       typefromvertexcount.hh
       
      \n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_b609f53bbb5e26b8e9292001c59476a3.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dir_b609f53bbb5e26b8e9292001c59476a3.html", "unified_diff": "@@ -84,29 +84,29 @@\n \"\"\n \"\"\n \n \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n+\n \n-\n+\n \n-\n-\n+\n+\n \n

      \n Files

       base.cc
       This file contains the parts independent of a particular Refinement implementation.
       base.cc
       This file contains the parts independent of a particular Refinement implementation.
       
       hcube.cc
       This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.).
       hcube.cc
       This file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.).
       
       hcubetriangulation.cc
       This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron)
       hcubetriangulation.cc
       This file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron)
       
       prismtriangulation.cc
       prismtriangulation.cc
       
       pyramidtriangulation.cc
       pyramidtriangulation.cc
       
       simplex.cc
       This file contains the Refinement implementation for simplices (triangles, tetrahedrons...)
       simplex.cc
       This file contains the Refinement implementation for simplices (triangles, tetrahedrons...)
       
      \n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/dune-geometry.tag.gz", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/dune-geometry.tag.gz", "unified_diff": null, "details": [{"source1": "dune-geometry.tag", "source2": "dune-geometry.tag", "unified_diff": null, "details": [{"source1": "dune-geometry.tag", "source2": "dune-geometry.tag", "unified_diff": "@@ -14,94 +14,94 @@\n modules.txt\n /build/reproducible-path/dune-geometry-2.10.0/doc/doxygen/\n a00167.html\n \n \n affinegeometry.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00176.html\n- dune/geometry/type.hh\n+ a00170.html\n+ dune/geometry/type.hh\n Dune::AffineGeometry\n Dune\n Dune::Geo\n \n \n axisalignedcubegeometry.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00203.html\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n+ a00200.html\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n Dune::AxisAlignedCubeGeometry\n Dune\n \n \n dimension.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00239.html\n+ a00224.html\n Dune::Dim\n Dune::Codim\n Dune\n \n \n generalvertexorder.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00212.html\n- type.hh\n- dune/geometry/referenceelements.hh\n+ a00248.html\n+ type.hh\n+ dune/geometry/referenceelements.hh\n Dune::GeneralVertexOrder\n Dune::GeneralVertexOrder::iterator\n Dune\n \n \n localfiniteelementgeometry.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00173.html\n- dune/geometry/affinegeometry.hh\n- dune/geometry/quadraturerules.hh\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- dune/geometry/utility/algorithms.hh\n- dune/geometry/utility/convergence.hh\n+ a00242.html\n+ dune/geometry/affinegeometry.hh\n+ dune/geometry/quadraturerules.hh\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ dune/geometry/utility/algorithms.hh\n+ dune/geometry/utility/convergence.hh\n Dune::LocalFiniteElementGeometry\n Dune\n \n \n mappedgeometry.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n a00209.html\n- dune/geometry/affinegeometry.hh\n- dune/geometry/quadraturerules.hh\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- dune/geometry/utility/algorithms.hh\n- dune/geometry/utility/convergence.hh\n+ dune/geometry/affinegeometry.hh\n+ dune/geometry/quadraturerules.hh\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ dune/geometry/utility/algorithms.hh\n+ dune/geometry/utility/convergence.hh\n Dune::MappedGeometry\n Dune\n \n \n multilineargeometry.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00236.html\n- dune/geometry/affinegeometry.hh\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n+ a00206.html\n+ dune/geometry/affinegeometry.hh\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n Dune::MultiLinearGeometryTraits\n Dune::MultiLinearGeometryTraits::CornerStorage\n Dune::MultiLinearGeometryTraits::hasSingleGeometryType\n Dune::MultiLinearGeometry\n Dune::MultiLinearGeometry::JacobianInverseTransposed\n Dune::CachedMultiLinearGeometry\n Dune\n \n \n quadraturerules.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00200.html\n- dune/geometry/type.hh\n- dune/geometry/typeindex.hh\n+ a00203.html\n+ dune/geometry/type.hh\n+ dune/geometry/typeindex.hh\n std::tuple_size< Dune::QuadraturePoint< ct, dim > >\n std::tuple_element< 0, Dune::QuadraturePoint< ct, dim > >\n std::tuple_element< 1, Dune::QuadraturePoint< ct, dim > >\n Dune::QuadratureOrderOutOfRange\n Dune::QuadraturePoint\n Dune::QuadratureRule\n Dune::QuadratureRules\n@@ -112,206 +112,206 @@\n Dune::QuadratureRuleFactory< ctype, 3 >\n Dune\n std\n Dune::QuadratureType\n \n #define\n DUNE_INCLUDING_IMPLEMENTATION\n- a00200.html\n+ a00203.html\n a0aeda817d7161b7c1afd8dd15ff12f17\n \n \n \n \n referenceelement.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00179.html\n- dune/geometry/type.hh\n+ a00245.html\n+ dune/geometry/type.hh\n Dune::Geo::ReferenceElement\n Dune::Geo::ReferenceElement::Codim\n Dune\n Dune::Geo\n \n \n referenceelementimplementation.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00170.html\n- dune/geometry/referenceelementimplementation.hh\n+ a00212.html\n+ dune/geometry/referenceelementimplementation.hh\n Dune\n Dune::Geo\n \n \n referenceelementimplementation.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00206.html\n- dune/geometry/referenceelement.hh\n- dune/geometry/affinegeometry.hh\n- dune/geometry/type.hh\n+ a00191.html\n+ dune/geometry/referenceelement.hh\n+ dune/geometry/affinegeometry.hh\n+ dune/geometry/type.hh\n Dune\n Dune::Geo\n \n \n referenceelements.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00245.html\n- dune/geometry/dimension.hh\n- dune/geometry/type.hh\n- dune/geometry/referenceelement.hh\n- dune/geometry/referenceelementimplementation.hh\n+ a00194.html\n+ dune/geometry/dimension.hh\n+ dune/geometry/type.hh\n+ dune/geometry/referenceelement.hh\n+ dune/geometry/referenceelementimplementation.hh\n Dune::Geo::ReferenceElements\n Dune\n Dune::Geo\n Dune::Transitional\n \n \n refinement.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00182.html\n- refinement/base.cc\n- refinement/hcube.cc\n- refinement/simplex.cc\n- refinement/hcubetriangulation.cc\n- refinement/prismtriangulation.cc\n- refinement/pyramidtriangulation.cc\n+ a00236.html\n+ refinement/base.cc\n+ refinement/hcube.cc\n+ refinement/simplex.cc\n+ refinement/hcubetriangulation.cc\n+ refinement/prismtriangulation.cc\n+ refinement/pyramidtriangulation.cc\n \n \n base.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00218.html\n- dune/geometry/type.hh\n+ a00173.html\n+ dune/geometry/type.hh\n Dune::RefinementImp::Traits\n Dune::RefinementIntervals\n Dune::StaticRefinement\n Dune::StaticRefinement::Codim\n Dune\n Dune::RefinementImp\n \n #define\n DUNE_GEOMETRY_REFINEMENT_BASE_CC\n- a00218.html\n+ a00173.html\n ab8232ef779e57c3676c54a73bd759f72\n \n \n \n \n hcube.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00230.html\n- dune/geometry/referenceelements.hh\n- dune/geometry/axisalignedcubegeometry.hh\n- base.cc\n+ a00188.html\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/axisalignedcubegeometry.hh\n+ base.cc\n Dune::RefinementImp::HCube::RefinementImp\n Dune::RefinementImp::HCube::RefinementImp::Codim\n Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial\n Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >\n Dune::RefinementImp::HCube::RefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >\n Dune::RefinementImp::HCube::RefinementImp::Codim< codimension >\n Dune\n Dune::RefinementImp\n Dune::RefinementImp::HCube\n \n #define\n DUNE_GEOMETRY_REFINEMENT_HCUBE_CC\n- a00230.html\n+ a00188.html\n a2be7a03e64dedaaa1cf5c7c8e2a9cf60\n \n \n \n \n hcubetriangulation.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00227.html\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- base.cc\n- simplex.cc\n+ a00182.html\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ base.cc\n+ simplex.cc\n Dune::RefinementImp::HCubeTriangulation::RefinementImp\n Dune::RefinementImp::HCubeTriangulation::RefinementImp::Codim\n Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >\n Dune::RefinementImp::HCubeTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >\n Dune::RefinementImp::HCubeTriangulation::RefinementImp::Codim< codimension >\n Dune\n Dune::RefinementImp\n Dune::RefinementImp::HCubeTriangulation\n \n #define\n DUNE_GEOMETRY_REFINEMENT_HCUBETRIANGULATION_CC\n- a00227.html\n+ a00182.html\n a3fe24de9b756cd18f014979a41cb0843\n \n \n \n \n prismtriangulation.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00221.html\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- base.cc\n- simplex.cc\n+ a00179.html\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ base.cc\n+ simplex.cc\n Dune::RefinementImp::PrismTriangulation::RefinementImp\n Dune::RefinementImp::PrismTriangulation::RefinementImp::Codim\n Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >\n Dune::RefinementImp::PrismTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >\n Dune::RefinementImp::PrismTriangulation::RefinementImp::Codim< codimension >\n Dune\n Dune::RefinementImp\n Dune::RefinementImp::PrismTriangulation\n \n #define\n DUNE_GEOMETRY_REFINEMENT_PRISMTRIANGULATION_CC\n- a00221.html\n+ a00179.html\n ae56eb72b98f97f57cc224eb9b4394ef8\n \n \n \n \n pyramidtriangulation.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00215.html\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- base.cc\n- simplex.cc\n+ a00176.html\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ base.cc\n+ simplex.cc\n Dune::RefinementImp::PyramidTriangulation::RefinementImp\n Dune::RefinementImp::PyramidTriangulation::RefinementImp::Codim\n Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, dimension >\n Dune::RefinementImp::PyramidTriangulation::RefinementIteratorSpecial< dimension, CoordType, 0 >\n Dune::RefinementImp::PyramidTriangulation::RefinementImp::Codim< codimension >\n Dune\n Dune::RefinementImp\n Dune::RefinementImp::PyramidTriangulation\n \n #define\n DUNE_GEOMETRY_REFINEMENT_PYRAMIDTRIANGULATION_CC\n- a00215.html\n+ a00176.html\n a5f431ee98541c17b3d9aea2dbc726941\n \n \n \n \n simplex.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/refinement/\n- a00224.html\n- dune/geometry/multilineargeometry.hh\n- dune/geometry/referenceelements.hh\n- dune/geometry/type.hh\n- base.cc\n+ a00185.html\n+ dune/geometry/multilineargeometry.hh\n+ dune/geometry/referenceelements.hh\n+ dune/geometry/type.hh\n+ base.cc\n Dune::RefinementImp::Simplex::RefinementImp\n Dune::RefinementImp::Simplex::RefinementImp::Codim\n Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, dimension >\n Dune::RefinementImp::Simplex::RefinementIteratorSpecial< dimension, CoordType, 0 >\n Dune::RefinementImp::Simplex::RefinementImp::Codim< codimension >\n Dune\n Dune::RefinementImp\n Dune::RefinementImp::Simplex\n \n #define\n DUNE_GRID_COMMON_REFINEMENT_SIMPLEX_CC\n- a00224.html\n+ a00185.html\n a944407dc4f6f9a372b10b69bbb5a0792\n \n \n \n int\n pointIndex\n a00274.html\n@@ -367,64 +367,64 @@\n afd47205aa1691498b073d9681fb23f6d\n (FieldVector< CoordType, dimension > point, const FieldVector< int, dimension > &kuhn)\n \n \n \n topologyfactory.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00233.html\n- dune/geometry/type.hh\n- dune/geometry/typeindex.hh\n+ a00239.html\n+ dune/geometry/type.hh\n+ dune/geometry/typeindex.hh\n Dune::TopologyFactory\n Dune::TopologySingletonFactory\n Dune\n \n \n type.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00248.html\n+ a00197.html\n Dune::GeometryType\n Dune\n Dune::GeometryTypes\n \n \n typeindex.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00194.html\n- type.hh\n+ a00230.html\n+ type.hh\n Dune::LocalGeometryTypeIndex\n Dune::GlobalGeometryTypeIndex\n Dune\n \n \n algorithms.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/utility/\n- a00188.html\n- dune/geometry/affinegeometry.hh\n+ a00221.html\n+ dune/geometry/affinegeometry.hh\n Dune\n \n \n convergence.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/utility/\n- a00185.html\n+ a00215.html\n Dune\n \n \n typefromvertexcount.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/utility/\n- a00191.html\n- dune/geometry/type.hh\n+ a00218.html\n+ dune/geometry/type.hh\n Dune\n \n \n virtualrefinement.cc\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00197.html\n- type.hh\n- refinement.hh\n+ a00227.html\n+ type.hh\n+ refinement.hh\n Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, dimension >\n Dune::VirtualRefinementSubEntityIteratorSpecial< dimension, CoordType, 0 >\n Dune::VirtualRefinement::Codim< codimension >\n Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, dimension >\n Dune::VirtualRefinementSubEntityIteratorBackSpecial< dimension, CoordType, 0 >\n Dune::VirtualRefinement::SubEntityIteratorBack\n Dune::VirtualRefinementImp\n@@ -434,26 +434,26 @@\n Dune::RefinementBuilder\n Dune::RefinementBuilder< 1, CoordType >\n Dune::RefinementBuilder< 3, CoordType >\n Dune\n \n #define\n DUNE_GEOMETRY_VIRTUALREFINEMENT_CC\n- a00197.html\n+ a00227.html\n ac82d420bff6cce87d06ad71b4f1cb0c8\n \n \n \n \n virtualrefinement.hh\n /build/reproducible-path/dune-geometry-2.10.0/dune/geometry/\n- a00242.html\n- refinement.hh\n- type.hh\n- virtualrefinement.cc\n+ a00233.html\n+ refinement.hh\n+ type.hh\n+ virtualrefinement.cc\n Dune::VirtualRefinement\n Dune::VirtualRefinement::Codim\n Dune\n \n \n Dune::AffineGeometry\n a01107.html\n"}]}]}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/files.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/files.html", "unified_diff": "@@ -77,42 +77,42 @@\n   doc\n   appl\n  refelements\n  doxygen\n   dune\n   geometry\n   refinement\n- base.ccThis file contains the parts independent of a particular Refinement implementation \n- hcube.ccThis file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.) \n- hcubetriangulation.ccThis file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron) \n- prismtriangulation.cc\n- pyramidtriangulation.cc\n- simplex.ccThis file contains the Refinement implementation for simplices (triangles, tetrahedrons...) \n+ base.ccThis file contains the parts independent of a particular Refinement implementation \n+ hcube.ccThis file contains the Refinement implementation for hypercubes (quadrilaterals, hexahedrons, etc.) \n+ hcubetriangulation.ccThis file contains the Refinement implementation for triangulating hypercubes (quadrilateral -> triangle, hexahedron -> tetrahedron) \n+ prismtriangulation.cc\n+ pyramidtriangulation.cc\n+ simplex.ccThis file contains the Refinement implementation for simplices (triangles, tetrahedrons...) \n   utility\n- algorithms.hh\n- convergence.hh\n- typefromvertexcount.hh\n- affinegeometry.hhAn implementation of the Geometry interface for affine geometries \n- axisalignedcubegeometry.hhA geometry implementation for axis-aligned hypercubes \n- dimension.hh\n- generalvertexorder.hh\n- localfiniteelementgeometry.hh\n+ algorithms.hh\n+ convergence.hh\n+ typefromvertexcount.hh\n+ affinegeometry.hhAn implementation of the Geometry interface for affine geometries \n+ axisalignedcubegeometry.hhA geometry implementation for axis-aligned hypercubes \n+ dimension.hh\n+ generalvertexorder.hh\n+ localfiniteelementgeometry.hh\n  mappedgeometry.hh\n- multilineargeometry.hh\n- quadraturerules.hh\n- referenceelement.hh\n- referenceelementimplementation.cc\n- referenceelementimplementation.hh\n- referenceelements.hh\n- refinement.hhThis file simply includes all Refinement implementations so you don't have to do them separately \n- topologyfactory.hh\n- type.hhA unique label for each type of element that can occur in a grid \n- typeindex.hhHelper classes to provide indices for geometrytypes for use in a vector \n- virtualrefinement.ccThis file contains the virtual wrapper around refinement \n- virtualrefinement.hhThis file contains the virtual wrapper around refinement \n+ multilineargeometry.hh\n+ quadraturerules.hh\n+ referenceelement.hh\n+ referenceelementimplementation.cc\n+ referenceelementimplementation.hh\n+ referenceelements.hh\n+ refinement.hhThis file simply includes all Refinement implementations so you don't have to do them separately \n+ topologyfactory.hh\n+ type.hhA unique label for each type of element that can occur in a grid \n+ typeindex.hhHelper classes to provide indices for geometrytypes for use in a vector \n+ virtualrefinement.ccThis file contains the virtual wrapper around refinement \n+ virtualrefinement.hhThis file contains the virtual wrapper around refinement \n \n \n \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/globals.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/globals.html", "unified_diff": "@@ -66,22 +66,22 @@\n \n \n \n \n \n
      \n
      Here is a list of all file members with links to the files they belong to:
      \n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}, {"source1": "./usr/share/doc/libdune-geometry-doc/doxygen/globals_defs.html", "source2": "./usr/share/doc/libdune-geometry-doc/doxygen/globals_defs.html", "unified_diff": "@@ -66,22 +66,22 @@\n \n \n \n \n \n
      \n
      Here is a list of all macros with links to the files they belong to:
      \n
      \n \n
      \n Generated by \"doxygen\"/ 1.9.8\n
      \n \n"}]}]}]}]}