{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.ihkcmOsK/b1/deal.ii_9.6.2-3_amd64.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.ihkcmOsK/b2/deal.ii_9.6.2-3_amd64.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,5 +1,5 @@\n \n 3dbc86ddb66c3ae240dc8e978cbdcc2e 1066341856 debug optional libdeal.ii-9.6.2-dbgsym_9.6.2-3_amd64.deb\n 35c95fba9a398939a5ca8f9e2c124eb8 91453708 libs optional libdeal.ii-9.6.2_9.6.2-3_amd64.deb\n 07ebed89dd2438da0d3dc7481895af9e 2258228 libdevel optional libdeal.ii-dev_9.6.2-3_amd64.deb\n- c77c87c1c49f2e9c444b7a23ede06d85 286292008 doc optional libdeal.ii-doc_9.6.2-3_all.deb\n+ a049a2b2f92867658d7f4982a745d4ee 286235188 doc optional libdeal.ii-doc_9.6.2-3_all.deb\n"}, {"source1": "libdeal.ii-doc_9.6.2-3_all.deb", "source2": "libdeal.ii-doc_9.6.2-3_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 2025-04-06 17:33:23.000000 debian-binary\n--rw-r--r-- 0 0 0 270680 2025-04-06 17:33:23.000000 control.tar.xz\n--rw-r--r-- 0 0 0 286021136 2025-04-06 17:33:23.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 270560 2025-04-06 17:33:23.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 285964436 2025-04-06 17:33:23.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": "./control", "source2": "./control", "unified_diff": "@@ -1,13 +1,13 @@\n Package: libdeal.ii-doc\n Source: deal.ii\n Version: 9.6.2-3\n Architecture: all\n Maintainer: Debian Science Maintainers \n-Installed-Size: 644375\n+Installed-Size: 644711\n Depends: fonts-mathjax-extras, libjs-mathjax\n Section: doc\n Priority: optional\n Multi-Arch: foreign\n Homepage: http://www.dealii.org/\n Description: Differential Equations Analysis Library - html doc. and examples\n deal.II is a C++ program library targeted at the computational solution of\n"}, {"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}]}]}]}, {"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": "@@ -604,29 +604,29 @@\n -rw-r--r-- 0 root (0) root (0) 65584 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_6_1_and_6_2.html\n -rw-r--r-- 0 root (0) root (0) 5676 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_6_2_0_and_6_2_1.html\n -rw-r--r-- 0 root (0) root (0) 53953 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_6_2_and_6_3.html\n -rw-r--r-- 0 root (0) root (0) 9952 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_6_3_0_and_6_3_1.html\n -rw-r--r-- 0 root (0) root (0) 36566 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_6_3_and_7_0.html\n -rw-r--r-- 0 root (0) root (0) 49560 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_0_and_7_1.html\n -rw-r--r-- 0 root (0) root (0) 45297 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_1_and_7_2.html\n--rw-r--r-- 0 root (0) root (0) 34013 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_2_and_7_3.html\n+-rw-r--r-- 0 root (0) root (0) 34110 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_2_and_7_3.html\n -rw-r--r-- 0 root (0) root (0) 36053 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_3_and_8_0.html\n -rw-r--r-- 0 root (0) root (0) 38473 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_0_and_8_1.html\n -rw-r--r-- 0 root (0) root (0) 70104 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_1_and_8_2.html\n -rw-r--r-- 0 root (0) root (0) 5002 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_2_0_and_8_2_1.html\n -rw-r--r-- 0 root (0) root (0) 64815 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_2_1_and_8_3.html\n -rw-r--r-- 0 root (0) root (0) 63639 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_3_and_8_4.html\n -rw-r--r-- 0 root (0) root (0) 4799 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_0_and_8_4_1.html\n -rw-r--r-- 0 root (0) root (0) 5761 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_1_and_8_4_2.html\n--rw-r--r-- 0 root (0) root (0) 100831 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_2_and_8_5_0.html\n+-rw-r--r-- 0 root (0) root (0) 100928 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_2_and_8_5_0.html\n -rw-r--r-- 0 root (0) root (0) 157651 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_5_0_and_9_0_0.html\n -rw-r--r-- 0 root (0) root (0) 5601 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_0_0_and_9_0_1.html\n -rw-r--r-- 0 root (0) root (0) 98908 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_0_1_and_9_1_0.html\n -rw-r--r-- 0 root (0) root (0) 4931 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_1_0_and_9_1_1.html\n--rw-r--r-- 0 root (0) root (0) 124702 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_1_1_and_9_2_0.html\n+-rw-r--r-- 0 root (0) root (0) 124799 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_1_1_and_9_2_0.html\n -rw-r--r-- 0 root (0) root (0) 85740 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_2_0_and_9_3_0.html\n -rw-r--r-- 0 root (0) root (0) 6016 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_3_0_and_9_3_1.html\n -rw-r--r-- 0 root (0) root (0) 5353 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_3_1_and_9_3_2.html\n -rw-r--r-- 0 root (0) root (0) 6165 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_3_2_and_9_3_3.html\n -rw-r--r-- 0 root (0) root (0) 86285 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_3_3_and_9_4_0.html\n -rw-r--r-- 0 root (0) root (0) 56210 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_4_0_and_9_5_0.html\n -rw-r--r-- 0 root (0) root (0) 5381 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_5_0_and_9_5_2.html\n@@ -2115,15 +2115,15 @@\n -rw-r--r-- 0 root (0) root (0) 84974 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1CUDAWrappers_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 8077 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1CommunicationPattern-members.html\n -rw-r--r-- 0 root (0) root (0) 20695 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1CommunicationPattern.html\n -rw-r--r-- 0 root (0) root (0) 450 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1CommunicationPattern__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1CommunicationPattern__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 8499 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1CommunicationPattern__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 32162 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector-members.html\n--rw-r--r-- 0 root (0) root (0) 139375 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html\n+-rw-r--r-- 0 root (0) root (0) 164981 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 5713 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1VectorTraits-members.html\n -rw-r--r-- 0 root (0) root (0) 8822 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1VectorTraits.html\n -rw-r--r-- 0 root (0) root (0) 829 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 17107 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 39717 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1ReadWriteVector-members.html\n -rw-r--r-- 0 root (0) root (0) 193483 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1ReadWriteVector.html\n@@ -2275,15 +2275,15 @@\n -rw-r--r-- 0 root (0) root (0) 17656 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPatternIterators_1_1Accessor__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 11453 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPatternIterators_1_1Iterator-members.html\n -rw-r--r-- 0 root (0) root (0) 30752 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPatternIterators_1_1Iterator.html\n -rw-r--r-- 0 root (0) root (0) 936 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 19470 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 44554 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector-members.html\n--rw-r--r-- 0 root (0) root (0) 193630 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html\n+-rw-r--r-- 0 root (0) root (0) 245578 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 5359 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1VectorTraits-members.html\n -rw-r--r-- 0 root (0) root (0) 7538 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1VectorTraits.html\n -rw-r--r-- 0 root (0) root (0) 911 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 21812 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 5296 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 57627 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1BlockVector-members.html\n@@ -2669,15 +2669,15 @@\n -rw-r--r-- 0 root (0) root (0) 11571 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1ResidualSimple__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 13168 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1SystemSimple-members.html\n -rw-r--r-- 0 root (0) root (0) 45891 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1SystemSimple.html\n -rw-r--r-- 0 root (0) root (0) 723 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1SystemSimple__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1SystemSimple__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 17358 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1SystemSimple__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 22488 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo-members.html\n--rw-r--r-- 0 root (0) root (0) 110713 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo.html\n+-rw-r--r-- 0 root (0) root (0) 131065 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo.html\n -rw-r--r-- 0 root (0) root (0) 8460 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfoBox-members.html\n -rw-r--r-- 0 root (0) root (0) 25417 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfoBox.html\n -rw-r--r-- 0 root (0) root (0) 431 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 7933 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 13511 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1IntegrationInfo-members.html\n -rw-r--r-- 0 root (0) root (0) 59516 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1IntegrationInfo.html\n@@ -2688,15 +2688,15 @@\n -rw-r--r-- 0 root (0) root (0) 8807 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1IntegrationInfo__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 16104 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator-members.html\n -rw-r--r-- 0 root (0) root (0) 61225 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator.html\n -rw-r--r-- 0 root (0) root (0) 432 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 7111 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 14831 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults-members.html\n--rw-r--r-- 0 root (0) root (0) 65614 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults.html\n+-rw-r--r-- 0 root (0) root (0) 74830 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults.html\n -rw-r--r-- 0 root (0) root (0) 644 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 14519 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 7772 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LoopControl-members.html\n -rw-r--r-- 0 root (0) root (0) 17259 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LoopControl.html\n -rw-r--r-- 0 root (0) root (0) 25124 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1MGVectorData-members.html\n -rw-r--r-- 0 root (0) root (0) 100497 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1MGVectorData.html\n@@ -2894,15 +2894,15 @@\n -rw-r--r-- 0 root (0) root (0) 30467 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1BlockVector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 46299 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1SparseMatrix-members.html\n -rw-r--r-- 0 root (0) root (0) 249689 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1SparseMatrix.html\n -rw-r--r-- 0 root (0) root (0) 616 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1SparseMatrix__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1SparseMatrix__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 9481 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1SparseMatrix__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 41011 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector-members.html\n--rw-r--r-- 0 root (0) root (0) 219543 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector.html\n+-rw-r--r-- 0 root (0) root (0) 257001 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 1044 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 17705 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 37363 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MatrixBase-members.html\n -rw-r--r-- 0 root (0) root (0) 189518 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MatrixBase.html\n -rw-r--r-- 0 root (0) root (0) 1349 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MatrixBase__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MatrixBase__inherit__graph.md5\n@@ -3066,15 +3066,15 @@\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SparseMatrix__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 8233 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SparseMatrix__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 19705 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepper-members.html\n -rw-r--r-- 0 root (0) root (0) 97124 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepper.html\n -rw-r--r-- 0 root (0) root (0) 10653 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepperData-members.html\n -rw-r--r-- 0 root (0) root (0) 30431 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepperData.html\n -rw-r--r-- 0 root (0) root (0) 35072 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase-members.html\n--rw-r--r-- 0 root (0) root (0) 163933 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase.html\n+-rw-r--r-- 0 root (0) root (0) 193440 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase.html\n -rw-r--r-- 0 root (0) root (0) 1045 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 17680 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 16260 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPackagedOperation-members.html\n -rw-r--r-- 0 root (0) root (0) 54798 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPackagedOperation.html\n -rw-r--r-- 0 root (0) root (0) 20069 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classParameterAcceptor-members.html\n -rw-r--r-- 0 root (0) root (0) 113293 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classParameterAcceptor.html\n@@ -4224,15 +4224,15 @@\n -rw-r--r-- 0 root (0) root (0) 24715 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1BlockSparsityPattern__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 43545 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1BlockVector-members.html\n -rw-r--r-- 0 root (0) root (0) 211407 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1BlockVector.html\n -rw-r--r-- 0 root (0) root (0) 1645 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1BlockVector__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1BlockVector__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 31883 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1BlockVector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 45321 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector-members.html\n--rw-r--r-- 0 root (0) root (0) 232604 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector.html\n+-rw-r--r-- 0 root (0) root (0) 275147 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector.html\n -rw-r--r-- 0 root (0) root (0) 809 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector__inherit__graph.md5\n -rw-r--r-- 0 root (0) root (0) 14671 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector__inherit__graph.png\n -rw-r--r-- 0 root (0) root (0) 11433 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1NOXSolver-members.html\n -rw-r--r-- 0 root (0) root (0) 51570 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1NOXSolver.html\n -rw-r--r-- 0 root (0) root (0) 430 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1NOXSolver__inherit__graph.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1NOXSolver__inherit__graph.md5\n@@ -6415,15 +6415,15 @@\n -rw-r--r-- 0 root (0) root (0) 18347 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Accessors.png\n -rw-r--r-- 0 root (0) root (0) 100511 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__CPP11.html\n -rw-r--r-- 0 root (0) root (0) 61812 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__CUDAWrappers.html\n -rw-r--r-- 0 root (0) root (0) 241 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__CUDAWrappers.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__CUDAWrappers.md5\n -rw-r--r-- 0 root (0) root (0) 9601 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__CUDAWrappers.png\n -rw-r--r-- 0 root (0) root (0) 21438 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Concepts.html\n--rw-r--r-- 0 root (0) root (0) 1174237 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Exceptions.html\n+-rw-r--r-- 0 root (0) root (0) 1178922 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Exceptions.html\n -rw-r--r-- 0 root (0) root (0) 27449 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__FE__vs__Mapping__vs__FEValues.html\n -rw-r--r-- 0 root (0) root (0) 312 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__FE__vs__Mapping__vs__FEValues.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__FE__vs__Mapping__vs__FEValues.md5\n -rw-r--r-- 0 root (0) root (0) 6367 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__FE__vs__Mapping__vs__FEValues.png\n -rw-r--r-- 0 root (0) root (0) 6216 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__IO.html\n -rw-r--r-- 0 root (0) root (0) 442 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__IO.map\n -rw-r--r-- 0 root (0) root (0) 32 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__IO.md5\n@@ -7884,15 +7884,15 @@\n -rw-r--r-- 0 root (0) root (0) 5763 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/linear__operator__tools_8h.html\n -rw-r--r-- 0 root (0) root (0) 11309 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/linear__operator__tools_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6317 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__integrator_8h.html\n -rw-r--r-- 0 root (0) root (0) 24436 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__integrator_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 5706 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__integrators_8h.html\n -rw-r--r-- 0 root (0) root (0) 10972 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__integrators_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6567 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__results_8h.html\n--rw-r--r-- 0 root (0) root (0) 97631 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__results_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 98511 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__results_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 13396 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/logo200.png\n -rw-r--r-- 0 root (0) root (0) 9225 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/logstream_8cc.html\n -rw-r--r-- 0 root (0) root (0) 90724 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/logstream_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 13203 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/logstream_8h.html\n -rw-r--r-- 0 root (0) root (0) 48414 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/logstream_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 15083 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/loop_8h.html\n -rw-r--r-- 0 root (0) root (0) 109441 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/loop_8h_source.html\n@@ -8029,15 +8029,15 @@\n -rw-r--r-- 0 root (0) root (0) 4784 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker_8h.html\n -rw-r--r-- 0 root (0) root (0) 7421 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 5465 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker__info_8cc.html\n -rw-r--r-- 0 root (0) root (0) 10950 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker__info_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 5965 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker__vector__selector_8cc.html\n -rw-r--r-- 0 root (0) root (0) 12191 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mesh__worker__vector__selector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 7016 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2dof__info_8h.html\n--rw-r--r-- 0 root (0) root (0) 94502 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2dof__info_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 96487 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2dof__info_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 7531 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2functional_8h.html\n -rw-r--r-- 0 root (0) root (0) 58659 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2functional_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 5276 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mg_8h.html\n -rw-r--r-- 0 root (0) root (0) 7980 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mg_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6048 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mg__base_8cc.html\n -rw-r--r-- 0 root (0) root (0) 18590 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mg__base_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 6698 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/mg__base_8h.html\n@@ -8696,15 +8696,15 @@\n -rw-r--r-- 0 root (0) root (0) 5116 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__block__vector_8h.html\n -rw-r--r-- 0 root (0) root (0) 9665 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__block__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6602 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__sparse__matrix_8cc.html\n -rw-r--r-- 0 root (0) root (0) 195444 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__sparse__matrix_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 5122 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__sparse__matrix_8h.html\n -rw-r--r-- 0 root (0) root (0) 9585 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__sparse__matrix_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 5994 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8cc.html\n--rw-r--r-- 0 root (0) root (0) 106738 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8cc_source.html\n+-rw-r--r-- 0 root (0) root (0) 122056 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 5077 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8h.html\n -rw-r--r-- 0 root (0) root (0) 9496 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 8278 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__precondition_8cc.html\n -rw-r--r-- 0 root (0) root (0) 304039 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__precondition_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 14299 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__precondition_8h.html\n -rw-r--r-- 0 root (0) root (0) 174439 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__precondition_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 4675 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__snes_8cc.html\n@@ -8720,19 +8720,19 @@\n -rw-r--r-- 0 root (0) root (0) 7931 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__sparse__matrix_8h.html\n -rw-r--r-- 0 root (0) root (0) 77345 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__sparse__matrix_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 4667 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__ts_8cc.html\n -rw-r--r-- 0 root (0) root (0) 34171 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__ts_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 7185 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__ts_8h.html\n -rw-r--r-- 0 root (0) root (0) 94223 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__ts_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 9743 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector_8h.html\n--rw-r--r-- 0 root (0) root (0) 66863 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 67823 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 8812 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8cc.html\n--rw-r--r-- 0 root (0) root (0) 242939 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8cc_source.html\n+-rw-r--r-- 0 root (0) root (0) 291224 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 7720 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8h.html\n--rw-r--r-- 0 root (0) root (0) 196331 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 198551 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6438 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/physics_8h.html\n -rw-r--r-- 0 root (0) root (0) 9824 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/physics_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 112820 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/plate_with_a_hole.png\n -rw-r--r-- 0 root (0) root (0) 124647 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/plate_with_a_hole_3D.png\n -rw-r--r-- 0 root (0) root (0) 696 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/plus.svg\n -rw-r--r-- 0 root (0) root (0) 696 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/plusd.svg\n -rw-r--r-- 0 root (0) root (0) 5338 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/point__conversion_8h.html\n@@ -8973,19 +8973,19 @@\n -rw-r--r-- 0 root (0) root (0) 276457 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_14.js\n -rw-r--r-- 0 root (0) root (0) 12134 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_15.js\n -rw-r--r-- 0 root (0) root (0) 4673 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_16.js\n -rw-r--r-- 0 root (0) root (0) 125362 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_17.js\n -rw-r--r-- 0 root (0) root (0) 258057 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_18.js\n -rw-r--r-- 0 root (0) root (0) 157301 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_19.js\n -rw-r--r-- 0 root (0) root (0) 220616 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1a.js\n--rw-r--r-- 0 root (0) root (0) 289804 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js\n+-rw-r--r-- 0 root (0) root (0) 289315 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js\n -rw-r--r-- 0 root (0) root (0) 40894 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1c.js\n -rw-r--r-- 0 root (0) root (0) 235387 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1d.js\n--rw-r--r-- 0 root (0) root (0) 464546 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js\n--rw-r--r-- 0 root (0) root (0) 260240 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js\n+-rw-r--r-- 0 root (0) root (0) 465583 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js\n+-rw-r--r-- 0 root (0) root (0) 259941 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js\n -rw-r--r-- 0 root (0) root (0) 3645 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_2.js\n -rw-r--r-- 0 root (0) root (0) 56423 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_20.js\n -rw-r--r-- 0 root (0) root (0) 167601 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_21.js\n -rw-r--r-- 0 root (0) root (0) 36152 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_22.js\n -rw-r--r-- 0 root (0) root (0) 3907 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_23.js\n -rw-r--r-- 0 root (0) root (0) 269 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_24.js\n -rw-r--r-- 0 root (0) root (0) 4076 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_25.js\n@@ -8997,15 +8997,15 @@\n -rw-r--r-- 0 root (0) root (0) 1892 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_7.js\n -rw-r--r-- 0 root (0) root (0) 2888 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_8.js\n -rw-r--r-- 0 root (0) root (0) 3088 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_9.js\n -rw-r--r-- 0 root (0) root (0) 7437 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_a.js\n -rw-r--r-- 0 root (0) root (0) 350 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_b.js\n -rw-r--r-- 0 root (0) root (0) 258512 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_c.js\n -rw-r--r-- 0 root (0) root (0) 107860 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_d.js\n--rw-r--r-- 0 root (0) root (0) 418156 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js\n+-rw-r--r-- 0 root (0) root (0) 417992 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js\n -rw-r--r-- 0 root (0) root (0) 200058 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_f.js\n -rw-r--r-- 0 root (0) root (0) 43245 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_0.js\n -rw-r--r-- 0 root (0) root (0) 9809 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_1.js\n -rw-r--r-- 0 root (0) root (0) 5320 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_10.js\n -rw-r--r-- 0 root (0) root (0) 13686 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_11.js\n -rw-r--r-- 0 root (0) root (0) 59275 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_12.js\n -rw-r--r-- 0 root (0) root (0) 38047 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_13.js\n@@ -11653,17 +11653,17 @@\n -rw-r--r-- 0 root (0) root (0) 6156 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__block__vector_8cc.html\n -rw-r--r-- 0 root (0) root (0) 57154 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__block__vector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 6173 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__communication__pattern_8cc.html\n -rw-r--r-- 0 root (0) root (0) 25491 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__communication__pattern_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 6826 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__communication__pattern_8h.html\n -rw-r--r-- 0 root (0) root (0) 21544 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__communication__pattern_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6601 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8cc.html\n--rw-r--r-- 0 root (0) root (0) 165702 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8cc_source.html\n+-rw-r--r-- 0 root (0) root (0) 180779 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 8199 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8h.html\n--rw-r--r-- 0 root (0) root (0) 115186 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 116561 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 13727 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__index__access_8h.html\n -rw-r--r-- 0 root (0) root (0) 37049 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__index__access_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 15045 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__linear__operator_8h.html\n -rw-r--r-- 0 root (0) root (0) 47757 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__linear__operator_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 9514 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__parallel__block__vector_8h.html\n -rw-r--r-- 0 root (0) root (0) 86940 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__parallel__block__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6101 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__precondition_8cc.html\n@@ -11715,23 +11715,23 @@\n -rw-r--r-- 0 root (0) root (0) 9110 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__sparsity__pattern_8h.html\n -rw-r--r-- 0 root (0) root (0) 200374 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__sparsity__pattern_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 22093 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__types_8h.html\n -rw-r--r-- 0 root (0) root (0) 37645 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__types_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 5821 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8cc.html\n -rw-r--r-- 0 root (0) root (0) 22247 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 11574 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8h.html\n--rw-r--r-- 0 root (0) root (0) 226950 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 229950 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 11074 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__utilities_8cc.html\n -rw-r--r-- 0 root (0) root (0) 43621 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__utilities_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 12368 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__utilities_8h.html\n -rw-r--r-- 0 root (0) root (0) 29175 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__utilities_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 6897 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8cc.html\n--rw-r--r-- 0 root (0) root (0) 222150 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8cc_source.html\n+-rw-r--r-- 0 root (0) root (0) 242628 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8cc_source.html\n -rw-r--r-- 0 root (0) root (0) 11178 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8h.html\n--rw-r--r-- 0 root (0) root (0) 324173 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8h_source.html\n+-rw-r--r-- 0 root (0) root (0) 341186 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 64742 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/truncated_cone_2d.png\n -rw-r--r-- 0 root (0) root (0) 191918 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/truncated_cone_3d.png\n -rw-r--r-- 0 root (0) root (0) 5608 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/tuple_8h.html\n -rw-r--r-- 0 root (0) root (0) 11522 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/tuple_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 4772 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/tutorial_8h.html\n -rw-r--r-- 0 root (0) root (0) 7317 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/tutorial_8h_source.html\n -rw-r--r-- 0 root (0) root (0) 23239 2025-04-06 17:33:23.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/types_8h.html\n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_2_and_7_3.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_7_2_and_7_3.html", "unified_diff": "@@ -198,15 +198,15 @@\n \n
  • \n

    New: GridGenerator::extrude_triangulation() allows you to extrude a 2d mesh to turn it into a 3d mesh.
    \n (Timo Heister, 2013/02/16)

    \n

    \n
    • \n
  • \n-

    PETScWrappers::Vector::operator= and PETScWrappers::MPI::Vector::operator= now call update_ghost_values() automatically if necessary. This means that update_ghost_values() does not need to be called from user code at all any more.
    \n+

    PETScWrappers::Vector::operator= and PETScWrappers::MPI::Vector::operator= now call update_ghost_values() automatically if necessary. This means that update_ghost_values() does not need to be called from user code at all any more.
    \n (Timo Heister, 2013/02/14)

    \n

    \n
    • \n
  • \n

    Fixed: VectorTools::interpolate did not work properly in 1d if boundary indicators had been set to anything but the default (i.e., zero at the left and one at the right end of the domain). This was a hold-over from the past when these were the only possible values. This is now fixed.
    \n (Kevin Dugan, Wolfgang Bangerth, 2013/02/14)

    \n

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_2_and_8_5_0.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_8_4_2_and_8_5_0.html", "unified_diff": "@@ -107,15 +107,15 @@\n
    • \n
  • \n

    Changed: The template arguments to the DerivativeApproximation::approximate_derivative_tensor() function have been modified. It is no longer necessary to explicitly specify the dim and spacedim arguments as they are determined from the input DoFHandler.
    \n (Jean-Paul Pelteret, 2017/02/16)

    \n

    \n
    • \n
  • \n-

    Changed: PETScWrappers::VectorBase::operator= is now both private and undefined. This operator was formerly implicitly defined (i.e., it did a byte-for-byte copy of VectorBase's members), which provided, almost certainly, the wrong behavior since the underlying Vec (the managed PETSc object) would then be destroyed twice. Since both inheriting classes (PETScWrappers::Vector and PETScWrappers::MPI::Vector) define their own operator= overloads this operator is also not necessary.
    \n+

    Changed: PETScWrappers::VectorBase::operator= is now both private and undefined. This operator was formerly implicitly defined (i.e., it did a byte-for-byte copy of VectorBase's members), which provided, almost certainly, the wrong behavior since the underlying Vec (the managed PETSc object) would then be destroyed twice. Since both inheriting classes (PETScWrappers::Vector and PETScWrappers::MPI::Vector) define their own operator= overloads this operator is also not necessary.
    \n (David Wells, 2017/02/11)

    \n

    \n
    • \n
  • \n

    Fixed: The MappingQGeneric class (which is a base class of MappingQ) sometimes set the update_JxW_values flag internally, even though this was not necessary. This resulted in doing more work than was actually necessary, and this has been rectified. On the other hand, this change means that in some circumstances, codes may not have explicitly told an FEValues or FEFaceValues object that they actually need the JxW values, but could access them anyway without getting an error. This will now yield an error that is easily fixed by explicitly listing update_JxW_values as a required flag where you create the FEValues object.
    \n (Wolfgang Bangerth, 2017/01/16)

    \n

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_1_1_and_9_2_0.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/changes_between_9_1_1_and_9_2_0.html", "unified_diff": "@@ -122,15 +122,15 @@\n
    • \n
  • \n

    Removed: The deprecated TrilinosWrappers matrix and sparsity patterns and reinitialization functions have been removed.
    \n (Daniel Arndt, 2020/04/22)

    \n

    \n
    • \n
  • \n-

    Removed: The deprecated member functions PETScWrappers::VectorBase::ratio() and Vector::ratio() have been removed.
    \n+

    Removed: The deprecated member functions PETScWrappers::VectorBase::ratio() and Vector::ratio() have been removed.
    \n (Daniel Arndt, 2020/04/17)

    \n

    \n
    • \n
  • \n

    Changed: The header file deal.II/fe/fe_q.h is not included implicitly via deal.II/fe/mapping_q_generic.h any more. Add the header deal.II/fe/fe_q.h if necessary.
    \n (Martin Kronbichler, 2020/04/16)

    \n

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFaceEvaluation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFaceEvaluation.html", "unified_diff": "@@ -1371,15 +1371,15 @@\n \n \n )\n \n \n \n
    \n-
    Deprecated:
    Please use the integrate_scatter() function with the EvaluationFlags argument.
    \n+
    Deprecated:
    Please use the integrate_scatter() function with the EvaluationFlags argument.
    \n \n
    \n \n \n

    ◆ dof_indices()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFacePointEvaluation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFacePointEvaluation.html", "has_internal_linenos": true, "unified_diff": "@@ -8697,15 +8697,15 @@\n 00021f80: 6261 3664 3763 3239 3031 3633 3934 6362 ba6d7c29016394cb\n 00021f90: 3922 3e72 6569 6e69 7428 293c 2f61 3e2e 9\">reinit().\n 00021fa0: 3c2f 703e 0a3c 646c 2063 6c61 7373 3d22

    .
    \n 00021fc0: 3c62 3e3c 6120 636c 6173 733d 2265 6c22 Deprec\n+00021ff0: 6564 3030 3031 3036 223e 4465 7072 6563 ed000106\">Deprec\n 00022000: 6174 6564 3a3c 2f61 3e3c 2f62 3e3c 2f64 ated:
    Use the fu\n 00022020: 6e63 7469 6f6e 203c 6120 636c 6173 733d nction re\n 00028050: 696e 6974 2829 3c2f 613e 2e3c 2f70 3e0a init().

    .\n 00028060: 3c64 6c20 636c 6173 733d 2264 6570 7265
    Deprecated:\n+000280b0: 3130 3622 3e44 6570 7265 6361 7465 643a 106\">Deprecated:\n 000280c0: 3c2f 613e 3c2f 623e 3c2f 6474 3e3c 6464
    Use the functio\n 000280e0: 6e20 3c61 2063 6c61 7373 3d22 656c 2220 n .
    \n 00015ee0: 3c62 3e3c 6120 636c 6173 733d 2265 6c22 Deprec\n+00015f10: 6564 3030 3031 3036 223e 4465 7072 6563 ed000106\">Deprec\n 00015f20: 6174 6564 3a3c 2f61 3e3c 2f62 3e3c 2f64 ated:
    Use the fu\n 00015f40: 6e63 7469 6f6e 203c 6120 636c 6173 733d nction \n

    Detailed Description

    \n
    template<int dim>
    \n class FE_ABF< dim >

    Implementation of Arnold-Boffi-Falk (ABF) elements, conforming with the space Hdiv. These elements generate vector fields with normal components continuous between mesh cells.

    \n

    These elements are based on an article from Arnold, Boffi and Falk: Quadrilateral H(div) finite elements, SIAM J. Numer. Anal. Vol.42, No.6, pp.2429-2451

    \n

    In this article, the authors demonstrate that the usual RT elements and also BDM and other proposed finite dimensional subspaces of H(div) do not work properly on arbitrary FE grids. I.e. the convergence rates deteriorate on these meshes. As a solution the authors propose the ABF elements, which are implemented in this class.

    \n

    This class is not implemented for the codimension one case (spacedim != dim).

    \n-
    Todo:
    Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
    \n+
    Todo:
    Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
    \n

    Interpolation

    \n

    The interpolation operators associated with the RT element are constructed such that interpolation and computing the divergence are commuting operations. We require this from interpolating arbitrary functions as well as the restriction matrices. It can be achieved by two interpolation schemes, the simplified one in FE_RaviartThomasNodal and the original one here:

    \n

    Node values on edges/faces

    \n

    On edges or faces, the node values are the moments of the normal component of the interpolated function with respect to the traces of the RT polynomials. Since the normal trace of the RT space of degree k on an edge/face is the space Qk, the moments are taken with respect to this space.

    \n

    Interior node values

    \n

    Higher order RT spaces have interior nodes. These are moments taken with respect to the gradient of functions in Qk on the cell (this space is the matching space for RTk in a mixed formulation).

    \n

    Generalized support points

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__BDM.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__BDM.html", "unified_diff": "@@ -595,16 +595,16 @@\n static std::mutex mutex\n  \n \n

    Detailed Description

    \n
    template<int dim>
    \n class FE_BDM< dim >

    The Brezzi-Douglas-Marini element.

    \n

    Degrees of freedom

    \n-
    Todo:
    The 3d version exhibits some numerical instabilities, in particular for higher order
    \n-
    Todo:
    Restriction matrices are missing.
    \n+
    Todo:
    The 3d version exhibits some numerical instabilities, in particular for higher order
    \n+
    Todo:
    Restriction matrices are missing.
    \n

    The matching pressure space for FE_BDM of order k is the element FE_DGP of order k-1.

    \n

    The BDM element of order p has p+1 degrees of freedom on each face. These are implemented as the function values in the p+1 Gauss points on each face.

    \n

    Additionally, for order greater or equal 2, we have additional p(p-1), the number of vector valued polynomials in Pp, interior degrees of freedom. These are the vector function values in the first p(p-1)/2 of the p2 Gauss points in the cell.

    \n \n

    Definition at line 58 of file fe_bdm.h.

    \n

    Member Typedef Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__RT__Bubbles.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__RT__Bubbles.html", "unified_diff": "@@ -609,15 +609,15 @@\n \"\"/\n
    \n

    \n \n \n Left - \\(2d,\\,k=3\\), right - \\(3d,\\,k=2\\). \n \n-
    Todo:
    Implement restriction matrices
    \n+
    Todo:
    Implement restriction matrices
    \n \n

    Definition at line 87 of file fe_rt_bubbles.h.

    \n

    Member Typedef Documentation

    \n \n

    ◆ map_value_type

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html", "unified_diff": "@@ -124,202 +124,202 @@\n \"\"\n \"\"\n \n
    [legend]
    \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Public Types

    using value_type = VectorTraits::value_type
    using value_type = VectorTraits::value_type
     
    using size_type = VectorTraits::size_type
    using size_type = VectorTraits::size_type
     
    using real_type = value_type
    using real_type = value_type
     
    using reference = internal::VectorReference
    using reference = internal::VectorReference
     
    using const_reference = const internal::VectorReference
    using const_reference = const internal::VectorReference
     
    \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-\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 \n-\n+\n \n-\n-\n+\n+\n \n-\n+\n \n

    \n Public Member Functions

    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< VectorTraits::value_type > &elements) const=0
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< VectorTraits::value_type > &elements) const=0
     
    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
     
    1: Basic Object-handling
     Vector ()
     
     Vector (const Vector &V)
     Vector (const Vector &V)
     
     Vector (const IndexSet &parallel_partitioner, const MPI_Comm communicator)
     Vector (const IndexSet &parallel_partitioner, const MPI_Comm communicator)
     
    void reinit (const IndexSet &parallel_partitioner, const MPI_Comm communicator, const bool omit_zeroing_entries=false)
    void reinit (const IndexSet &parallel_partitioner, const MPI_Comm communicator, const bool omit_zeroing_entries=false)
     
    void reinit (const Vector &V, const bool omit_zeroing_entries=false)
    void reinit (const Vector &V, const bool omit_zeroing_entries=false)
     
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< double > &elements) const override
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< double > &elements) const override
     
    Vector & operator= (const Vector &V)
    Vector & operator= (const Vector &V)
     
    Vector & operator= (const double s)
    Vector & operator= (const double s)
     
    void import_elements (const ReadWriteVector< double > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    void import_elements (const ReadWriteVector< double > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
     
    void import (const ReadWriteVector< double > &V, const VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    void import (const ReadWriteVector< double > &V, const VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
     
    2: Data-Access
    reference operator() (const size_type index)
    reference operator() (const size_type index)
     
    value_type operator() (const size_type index) const
    value_type operator() (const size_type index) const
     
    reference operator[] (const size_type index)
    reference operator[] (const size_type index)
     
    value_type operator[] (const size_type index) const
    value_type operator[] (const size_type index) const
     
    3: Modification of vectors
    Vector & operator*= (const double factor)
    Vector & operator*= (const double factor)
     
    Vector & operator/= (const double factor)
    Vector & operator/= (const double factor)
     
    Vector & operator+= (const Vector &V)
    Vector & operator+= (const Vector &V)
     
    Vector & operator-= (const Vector &V)
    Vector & operator-= (const Vector &V)
     
    double operator* (const Vector &V) const
    double operator* (const Vector &V) const
     
    void add (const double a)
    void add (const double a)
     
    void add (const double a, const Vector &V)
    void add (const double a, const Vector &V)
     
    void add (const double a, const Vector &V, const double b, const Vector &W)
    void add (const double a, const Vector &V, const double b, const Vector &W)
     
    void sadd (const double s, const double a, const Vector &V)
    void sadd (const double s, const double a, const Vector &V)
     
    void scale (const Vector &scaling_factors)
    void scale (const Vector &scaling_factors)
     
    void equ (const double a, const Vector &V)
    void equ (const double a, const Vector &V)
     
    bool all_zero () const
    bool all_zero () const
     
    4: Scalar products, norms and related operations
    double mean_value () const
    double mean_value () const
     
    double l1_norm () const
    double l1_norm () const
     
    double l2_norm () const
    double l2_norm () const
     
    double linfty_norm () const
    double linfty_norm () const
     
    double add_and_dot (const double a, const Vector &V, const Vector &W)
    double add_and_dot (const double a, const Vector &V, const Vector &W)
     
    5: Scalar products, norms and related operations
    bool has_ghost_elements () const
    bool has_ghost_elements () const
     
    virtual size_type size () const override
    virtual size_type size () const override
     
    size_type locally_owned_size () const
    size_type locally_owned_size () const
     
    MPI_Comm get_mpi_communicator () const
    MPI_Comm get_mpi_communicator () const
     
    ::IndexSet locally_owned_elements () const
    ::IndexSet locally_owned_elements () const
     
    6: Mixed stuff
    void compress (const VectorOperation::values operation)
    void compress (const VectorOperation::values operation)
     
    const Epetra_FEVector & trilinos_vector () const
    const Epetra_FEVector & trilinos_vector () const
     
    Epetra_FEVector & trilinos_vector ()
     
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    Subscriptor functionality

    Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

    \n
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    unsigned int n_subscriptions () const
    unsigned int n_subscriptions () const
     
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
     
    void list_subscribers () const
    void list_subscribers () const
     
    \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Static Public Member Functions

    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & ExcVectorTypeNotCompatible ()
    static ::ExceptionBase & ExcVectorTypeNotCompatible ()
     
    static ::ExceptionBase & ExcTrilinosError (int arg1)
    static ::ExceptionBase & ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
     
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Types

    using map_value_type = decltype(counter_map)::value_type
    using map_value_type = decltype(counter_map)::value_type
     
    using map_iterator = decltype(counter_map)::iterator
    using map_iterator = decltype(counter_map)::iterator
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Member Functions

    void create_epetra_comm_pattern (const IndexSet &source_index_set, const MPI_Comm mpi_comm)
    void create_epetra_comm_pattern (const IndexSet &source_index_set, const MPI_Comm mpi_comm)
     
    void check_no_subscribers () const noexcept
    void check_no_subscribers () const noexcept
     
    \n \n \n \n \n \n-\n+\n \n \n \n \n \n \n \n-\n+\n \n

    \n Private Attributes

    std::unique_ptr< Epetra_FEVector > vector
     
    ::IndexSet source_stored_elements
     
    std::shared_ptr< const CommunicationPattern > epetra_comm_pattern
    std::shared_ptr< const CommunicationPattern > epetra_comm_pattern
     
    std::atomic< unsigned int > counter
     
    std::map< std::string, unsigned int > counter_map
     
    std::vector< std::atomic< bool > * > validity_pointers
     
    const std::type_info * object_info
    const std::type_info * object_info
     
    \n \n-\n+\n \n

    \n Static Private Attributes

    static std::mutex mutex
    static std::mutex mutex
     
    \n \n-\n+\n \n

    \n Friends

    class internal::VectorReference
    class internal::VectorReference
     
    \n

    Detailed Description

    \n

    This class implements a wrapper to the Trilinos distributed vector class Epetra_FEVector. This class requires Trilinos to be compiled with MPI support.

    \n \n

    Definition at line 225 of file trilinos_epetra_vector.h.

    \n

    Member Typedef Documentation

    \n \n

    ◆ value_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using LinearAlgebra::EpetraWrappers::Vector::value_type = VectorTraits::value_typeusing LinearAlgebra::EpetraWrappers::Vector::value_type = VectorTraits::value_type
    \n
    \n \n

    Definition at line 229 of file trilinos_epetra_vector.h.

    \n \n
    \n@@ -327,15 +327,15 @@\n \n

    ◆ size_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using LinearAlgebra::EpetraWrappers::Vector::size_type = VectorTraits::size_typeusing LinearAlgebra::EpetraWrappers::Vector::size_type = VectorTraits::size_type
    \n
    \n \n

    Definition at line 230 of file trilinos_epetra_vector.h.

    \n \n
    \n@@ -343,15 +343,15 @@\n \n

    ◆ real_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using LinearAlgebra::EpetraWrappers::Vector::real_type = value_typeusing LinearAlgebra::EpetraWrappers::Vector::real_type = value_type
    \n
    \n \n

    Definition at line 231 of file trilinos_epetra_vector.h.

    \n \n
    \n@@ -359,15 +359,15 @@\n \n

    ◆ reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using LinearAlgebra::EpetraWrappers::Vector::reference = internal::VectorReferenceusing LinearAlgebra::EpetraWrappers::Vector::reference = internal::VectorReference
    \n
    \n \n

    Definition at line 232 of file trilinos_epetra_vector.h.

    \n \n
    \n@@ -375,15 +375,15 @@\n \n

    ◆ const_reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using LinearAlgebra::EpetraWrappers::Vector::const_reference = const internal::VectorReferenceusing LinearAlgebra::EpetraWrappers::Vector::const_reference = const internal::VectorReference
    \n
    \n \n

    Definition at line 233 of file trilinos_epetra_vector.h.

    \n \n
    \n@@ -394,15 +394,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_value_type = decltype(counter_map)::value_typeusing Subscriptor::map_value_type = decltype(counter_map)::value_type
    \n     		\n privateinherited
    \n@@ -419,15 +419,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_iterator = decltype(counter_map)::iteratorusing Subscriptor::map_iterator = decltype(counter_map)::iterator
    \n     		\n privateinherited
    \n@@ -464,15 +464,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    Vector< Number >::Vector (const Vector & const Vector & V)
    \n
    \n

    Copy constructor. Sets the dimension and the partitioning to that of the given vector and copies all elements.

    \n \n@@ -488,21 +488,21 @@\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@@ -525,28 +525,28 @@\n \n
    \n
    \n
    Vector< Number >::Vector (const IndexSet & const IndexSet & parallel_partitioner,
    const MPI_Comm const MPI_Comm communicator 
    )
    \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
    void Vector< Number >::reinit (const IndexSet & const IndexSet & parallel_partitioner,
    const MPI_Comm const MPI_Comm communicator,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -562,22 +562,22 @@\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
    void Vector< Number >::reinit (const Vector & const Vector & V,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -596,15 +596,15 @@\n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -630,17 +630,17 @@\n \n

    ◆ operator=() [1/2]

    \n \n
    \n
    \n
    void Vector< Number >::extract_subvector_to (const ArrayView< const types::global_dof_index > & const ArrayView< const types::global_dof_index > & indices,
    ArrayView< double > & elements 
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator= Vector & Vector< Number >::operator= (const Vector & const Vector & V)
    \n
    \n

    Copy function. This function takes a Vector and copies all the elements. The Vector will have the same parallel distribution as V.

    \n

    The semantics of this operator are complex. If the two vectors have the same size, and if either the left or right hand side vector of the assignment (i.e., either the input vector on the right hand side, or the calling vector to the left of the assignment operator) currently has ghost elements, then the left hand side vector will also have ghost values and will consequently be a read-only vector (see also the glossary entry on the issue). Otherwise, the left hand vector will be a writable vector after this operation. These semantics facilitate having a vector with ghost elements on the left hand side of the assignment, and a vector without ghost elements on the right hand side, with the resulting left hand side vector having the correct values in both its locally owned and its ghost elements.

    \n@@ -653,17 +653,17 @@\n \n

    ◆ operator=() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator= Vector & Vector< Number >::operator= (const double const double s)
    \n
    \n

    Sets all elements of the vector to the scalar s. This operation is only allowed if s is equal to zero.

    \n \n@@ -676,27 +676,27 @@\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@@ -716,27 +716,27 @@\n
    void Vector< Number >::import_elements (const ReadWriteVector< double > & const ReadWriteVector< double > & V,
    VectorOperation::values operation,
    const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & communication_pattern = {} 
    )
    \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@@ -759,17 +759,17 @@\n
    \n
    \n
    void LinearAlgebra::EpetraWrappers::Vector::import (const ReadWriteVector< double > & const ReadWriteVector< double > & V,
    const VectorOperation::values const VectorOperation::values operation,
    const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & communication_pattern = {} 
    )
    \n \n \n \n@@ -786,17 +786,17 @@\n \n

    ◆ operator()() [2/2]

    \n \n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    internal::VectorReference Vector< Number >::operator() internal::VectorReference Vector< Number >::operator() (const size_type const size_type index)
    \n     		\n inline
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    value_type LinearAlgebra::EpetraWrappers::Vector::operator() value_type LinearAlgebra::EpetraWrappers::Vector::operator() (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n

    When using a vector distributed with MPI, this operation only makes sense for elements that are actually present on the calling processor. Otherwise, an exception is thrown.

    \n@@ -809,29 +809,29 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    internal::VectorReference Vector< Number >::operator[] internal::VectorReference Vector< Number >::operator[] (const size_type const size_type index)
    \n     		\n inline
    \n
    \n

    Provide access to a given element, both read and write.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n

    Definition at line 798 of file trilinos_epetra_vector.h.

    \n \n
    \n
    \n \n

    ◆ operator[]() [2/2]

    \n@@ -839,44 +839,44 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector::value_type Vector< Number >::operator[] Vector::value_type Vector< Number >::operator[] (const size_type const size_type index) const
    \n     		\n inline
    \n
    \n

    Provide read-only access to an element.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n

    Definition at line 804 of file trilinos_epetra_vector.h.

    \n \n
    \n
    \n \n

    ◆ operator*=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator*= Vector & Vector< Number >::operator*= (const double const double factor)
    \n
    \n

    Multiply the entire vector by a fixed factor.

    \n \n@@ -887,17 +887,17 @@\n \n

    ◆ operator/=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator/= Vector & Vector< Number >::operator/= (const double const double factor)
    \n
    \n

    Divide the entire vector by a fixed factor.

    \n \n@@ -908,17 +908,17 @@\n \n

    ◆ operator+=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator+= Vector & Vector< Number >::operator+= (const Vector & const Vector & V)
    \n
    \n

    Add the vector V to the present one.

    \n \n@@ -929,17 +929,17 @@\n \n

    ◆ operator-=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator-= Vector & Vector< Number >::operator-= (const Vector & const Vector & V)
    \n
    \n

    Subtract the vector V from the present one.

    \n \n@@ -950,17 +950,17 @@\n \n

    ◆ operator*()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    double Vector< Number >::operator* double Vector< Number >::operator* (const Vector & const Vector & V) const
    \n
    \n

    Return the scalar product of two vectors. The vectors need to have the same layout.

    \n \n@@ -973,15 +973,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void Vector< Number >::add (const double const double a)
    \n
    \n

    Add a to all components. Note that is a scalar not a vector.

    \n \n@@ -994,21 +994,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1025,33 +1025,33 @@\n \n
    \n
    \n
    void Vector< Number >::add (const double const double a,
    const Vector & const Vector & V 
    )
    \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@@ -1068,27 +1068,27 @@\n \n
    \n
    \n
    void Vector< Number >::add (const double const double a,
    const Vector & const Vector & V,
    const double const double b,
    const Vector & const Vector & W 
    )
    \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@@ -1105,15 +1105,15 @@\n \n
    \n
    \n
    void Vector< Number >::sadd (const double const double s,
    const double const double a,
    const Vector & const Vector & V 
    )
    \n \n \n \n- \n+ \n \n \n \n
    void Vector< Number >::scale (const Vector & const Vector & scaling_factors)
    \n
    \n

    Scale each element of this vector by the corresponding element in the argument. This function is mostly meant to simulate multiplication (and immediate re-assignment) by a diagonal scaling matrix. The vectors need to have the same layout.

    \n \n@@ -1126,21 +1126,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1257,27 +1257,27 @@\n \n
    \n
    \n
    void Vector< Number >::equ (const double const double a,
    const Vector & const Vector & V 
    )
    \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@@ -1402,15 +1402,16 @@\n \n \n \n \n \n
    double Vector< Number >::add_and_dot (const double const double a,
    const Vector & const Vector & V,
    const Vector & const Vector & W 
    )
    IndexSet Vector< Number >::locally_owned_elements () const
    \n
    \n-

    Return an index set that describes which elements of this vector are owned by the current processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set(vec.size())
    \n+

    Return an index set that describes which elements of this vector are owned by the current processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set(vec.size())
    \n+
    LinearAlgebra::EpetraWrappers::Vector::vector
    std::unique_ptr< Epetra_FEVector > vector
    Definition trilinos_epetra_vector.h:680
    \n
    complete_index_set
    IndexSet complete_index_set(const IndexSet::size_type N)
    Definition index_set.h:1204
    \n
    \n

    Definition at line 562 of file trilinos_epetra_vector.cc.

    \n \n
    \n
    \n \n@@ -1418,15 +1419,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void Vector< Number >::compress (const VectorOperation::values const VectorOperation::values operation)
    \n
    \n

    Compress the underlying representation of the Trilinos object, i.e. flush the buffers of the vector object if it has any. This function is necessary after writing into a vector element-by-element and before anything else can be done on it.

    \n

    See Compressing distributed objects for more information.

    \n@@ -1438,15 +1439,15 @@\n \n

    ◆ trilinos_vector() [1/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n \n \n \n
    const Epetra_FEVector & Vector< Number >::trilinos_vector const Epetra_FEVector & Vector< Number >::trilinos_vector () const
    \n
    \n

    Return a const reference to the underlying Trilinos Epetra_FEVector class.

    \n@@ -1486,28 +1487,28 @@\n
    		(std::ostream & out,
    const unsigned int const unsigned int precision = 3,
    const bool scientific = true, const bool scientific = true,
    const bool across = true const bool across = true 
    ) const
    \n@@ -1546,21 +1547,21 @@\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@@ -1583,15 +1584,15 @@\n
    \n
    \n
    void Vector< Number >::create_epetra_comm_pattern (const IndexSet & const IndexSet & source_index_set,
    const MPI_Comm const MPI_Comm mpi_comm 
    )
    \n \n
    \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1723,15 +1724,15 @@\n \n \n

    ◆ list_subscribers() [1/2]

    \n \n
    \n
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n
    virtual void ReadVector< VectorTraits::value_type >::extract_subvector_to virtual void ReadVector< VectorTraits::value_type >::extract_subvector_to (const ArrayView< const types::global_dof_index > & indices,
    \n \n \n \n \n
    \n \n \n \n \n@@ -1782,15 +1783,15 @@\n \n \n

    ◆ serialize()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void Subscriptor::list_subscribers (
    \n \n
    \n \n \n \n \n@@ -1860,15 +1861,15 @@\n
    \n
    \n
    void Subscriptor::serialize (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    friend class internal::VectorReferencefriend class internal::VectorReference
    \n     		\n friend
    \n@@ -1935,15 +1936,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    std::shared_ptr<const CommunicationPattern> LinearAlgebra::EpetraWrappers::Vector::epetra_comm_patternstd::shared_ptr<const CommunicationPattern> LinearAlgebra::EpetraWrappers::Vector::epetra_comm_pattern
    \n     		\n private
    \n@@ -2038,15 +2039,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    const std::type_info* Subscriptor::object_infoconst std::type_info* Subscriptor::object_info
    \n     		\n mutableprivateinherited
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1ReadWriteVector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1ReadWriteVector.html", "unified_diff": "@@ -1041,15 +1041,15 @@\n
    \n     		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 312 of file read_write_vector.h.

    \n \n
    \n \n \n

    ◆ import_elements() [2/9]

    \n@@ -1129,15 +1129,15 @@\n
    \n     		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 341 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ import_elements() [3/9]

    \n@@ -1213,15 +1213,15 @@\n
    \n
    		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 371 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ import_elements() [4/9]

    \n@@ -1298,15 +1298,15 @@\n \n \n \n inline \n \n \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 403 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ import_elements() [5/9]

    \n@@ -1386,15 +1386,15 @@\n \n \n \n inline \n \n \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 435 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ import_elements() [6/9]

    \n@@ -1470,15 +1470,15 @@\n \n \n \n inline \n \n \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 464 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ import_elements() [7/9]

    \n@@ -1554,15 +1554,15 @@\n \n \n \n inline \n \n \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 493 of file read_write_vector.h.

    \n \n
    \n
    \n \n

    ◆ size()

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html", "unified_diff": "@@ -124,257 +124,257 @@\n \"\"\n \"\"\n \n
    [legend]
    \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Public Types

    using value_type = Number
    using value_type = Number
     
    using real_type = typename numbers::NumberTraits< Number >::real_type
    using real_type = typename numbers::NumberTraits< Number >::real_type
     
    using size_type = types::global_dof_index
    using size_type = types::global_dof_index
     
    using reference = internal::VectorReference< Number, MemorySpace >
    using reference = internal::VectorReference< Number, MemorySpace >
     
    using const_reference = const internal::VectorReference< Number, MemorySpace >
    using const_reference = const internal::VectorReference< Number, MemorySpace >
     
    \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-\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-\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

    \n Public Member Functions

    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
     
    1: Basic Object-handling
     Vector ()
     
     Vector (const Vector &V)
     Vector (const Vector &V)
     
     Vector (const Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > V)
     Vector (const Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > V)
     
     Vector (const IndexSet &parallel_partitioner, const MPI_Comm communicator)
     Vector (const IndexSet &parallel_partitioner, const MPI_Comm communicator)
     
     Vector (const IndexSet &locally_owned_entries, const IndexSet &ghost_entries, const MPI_Comm communicator, const bool vector_writable=false)
     Vector (const IndexSet &locally_owned_entries, const IndexSet &ghost_entries, const MPI_Comm communicator, const bool vector_writable=false)
     
    void clear ()
     
    void reinit (const IndexSet &parallel_partitioner, const MPI_Comm communicator=MPI_COMM_WORLD, const bool omit_zeroing_entries=false)
    void reinit (const IndexSet &parallel_partitioner, const MPI_Comm communicator=MPI_COMM_WORLD, const bool omit_zeroing_entries=false)
     
    void reinit (const IndexSet &locally_owned_entries, const IndexSet &locally_relevant_or_ghost_entries, const MPI_Comm communicator=MPI_COMM_WORLD, const bool vector_writable=false)
    void reinit (const IndexSet &locally_owned_entries, const IndexSet &locally_relevant_or_ghost_entries, const MPI_Comm communicator=MPI_COMM_WORLD, const bool vector_writable=false)
     
    void reinit (const Vector< Number, MemorySpace > &V, const bool omit_zeroing_entries=false)
    void reinit (const Vector< Number, MemorySpace > &V, const bool omit_zeroing_entries=false)
     
    virtual void swap (Vector &v) noexcept
    virtual void swap (Vector &v) noexcept
     
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< Number > &elements) const override
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< Number > &elements) const override
     
    Vector & operator= (const Vector &V)
    Vector & operator= (const Vector &V)
     
    template<typename OtherNumber >
    Vector & operator= (const ::Vector< OtherNumber > &V)
    template<typename OtherNumber >
    Vector & operator= (const ::Vector< OtherNumber > &V)
     
    Vector & operator= (const Number s)
    Vector & operator= (const Number s)
     
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const Teuchos::RCP< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const Teuchos::RCP< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
     
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
     
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation)
    void import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation)
     
    void import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    void import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
     
    2: Data-Access
    reference operator() (const size_type index)
    reference operator() (const size_type index)
     
    Number operator() (const size_type index) const
    Number operator() (const size_type index) const
     
    reference operator[] (const size_type index)
    reference operator[] (const size_type index)
     
    Number operator[] (const size_type index) const
    Number operator[] (const size_type index) const
     
    3: Modification of vectors
    Vector & operator*= (const Number factor)
    Vector & operator*= (const Number factor)
     
    Vector & operator/= (const Number factor)
    Vector & operator/= (const Number factor)
     
    Vector & operator+= (const Vector< Number, MemorySpace > &V)
    Vector & operator+= (const Vector< Number, MemorySpace > &V)
     
    Vector & operator-= (const Vector< Number, MemorySpace > &V)
    Vector & operator-= (const Vector< Number, MemorySpace > &V)
     
    Number operator* (const Vector< Number, MemorySpace > &V) const
    Number operator* (const Vector< Number, MemorySpace > &V) const
     
    void add (const Number a)
    void add (const Number a)
     
    void add (const Number a, const Vector< Number, MemorySpace > &V)
    void add (const Number a, const Vector< Number, MemorySpace > &V)
     
    void add (const Number a, const Vector< Number, MemorySpace > &V, const Number b, const Vector< Number, MemorySpace > &W)
    void add (const Number a, const Vector< Number, MemorySpace > &V, const Number b, const Vector< Number, MemorySpace > &W)
     
    void add (const std::vector< size_type > &indices, const std::vector< Number > &values)
    void add (const std::vector< size_type > &indices, const std::vector< Number > &values)
     
    void add (const size_type n_elements, const size_type *indices, const Number *values)
    void add (const size_type n_elements, const size_type *indices, const Number *values)
     
    void sadd (const Number s, const Number a, const Vector< Number, MemorySpace > &V)
    void sadd (const Number s, const Number a, const Vector< Number, MemorySpace > &V)
     
    void set (const size_type n_elements, const size_type *indices, const Number *values)
    void set (const size_type n_elements, const size_type *indices, const Number *values)
     
    void scale (const Vector< Number, MemorySpace > &scaling_factors)
    void scale (const Vector< Number, MemorySpace > &scaling_factors)
     
    void equ (const Number a, const Vector< Number, MemorySpace > &V)
    void equ (const Number a, const Vector< Number, MemorySpace > &V)
     
    bool all_zero () const
    bool all_zero () const
     
    bool is_non_negative () const
    bool is_non_negative () const
     
    4: Scalar products, norms and related operations
    Number mean_value () const
    Number mean_value () const
     
    real_type l1_norm () const
    real_type l1_norm () const
     
    real_type l2_norm () const
    real_type l2_norm () const
     
    real_type linfty_norm () const
    real_type linfty_norm () const
     
    real_type norm_sqr () const
    real_type norm_sqr () const
     
    Number add_and_dot (const Number a, const Vector< Number, MemorySpace > &V, const Vector< Number, MemorySpace > &W)
    Number add_and_dot (const Number a, const Vector< Number, MemorySpace > &V, const Vector< Number, MemorySpace > &W)
     
    5: Scalar products, norms and related operations
    bool has_ghost_elements () const
    bool has_ghost_elements () const
     
    bool operator== (const Vector< Number, MemorySpace > &v) const
    bool operator== (const Vector< Number, MemorySpace > &v) const
     
    bool operator!= (const Vector< Number, MemorySpace > &v) const
    bool operator!= (const Vector< Number, MemorySpace > &v) const
     
    virtual size_type size () const override
    virtual size_type size () const override
     
    size_type locally_owned_size () const
    size_type locally_owned_size () const
     
    std::pair< size_type, size_type > local_range () const
    std::pair< size_type, size_type > local_range () const
     
    bool in_local_range (const size_type index) const
    bool in_local_range (const size_type index) const
     
    bool is_compressed () const
    bool is_compressed () const
     
    MPI_Comm get_mpi_communicator () const
    MPI_Comm get_mpi_communicator () const
     
    ::IndexSet locally_owned_elements () const
    ::IndexSet locally_owned_elements () const
     
    6: Mixed stuff
    void compress (const VectorOperation::values operation)
    void compress (const VectorOperation::values operation)
     
    const TpetraTypes::VectorType< Number, MemorySpace > & trilinos_vector () const
    const TpetraTypes::VectorType< Number, MemorySpace > & trilinos_vector () const
     
    TpetraTypes::VectorType< Number, MemorySpace > & trilinos_vector ()
     
    Teuchos::RCP< const TpetraTypes::VectorType< Number, MemorySpace > > trilinos_rcp () const
    Teuchos::RCP< const TpetraTypes::VectorType< Number, MemorySpace > > trilinos_rcp () const
     
    Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > trilinos_rcp ()
     
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    MPI_Comm mpi_comm () const
    MPI_Comm mpi_comm () const
     
    Subscriptor functionality

    Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

    \n
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    unsigned int n_subscriptions () const
    unsigned int n_subscriptions () const
     
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
     
    void list_subscribers () const
    void list_subscribers () const
     
    \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Static Public Member Functions

    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & ExcVectorTypeNotCompatible ()
    static ::ExceptionBase & ExcVectorTypeNotCompatible ()
     
    static ::ExceptionBase & ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
    static ::ExceptionBase & ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
     
    static ::ExceptionBase & ExcMissingIndexSet ()
    static ::ExceptionBase & ExcMissingIndexSet ()
     
    static ::ExceptionBase & ExcTrilinosError (int arg1)
    static ::ExceptionBase & ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
     
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Types

    using map_value_type = decltype(counter_map)::value_type
    using map_value_type = decltype(counter_map)::value_type
     
    using map_iterator = decltype(counter_map)::iterator
    using map_iterator = decltype(counter_map)::iterator
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Member Functions

    void create_tpetra_comm_pattern (const IndexSet &source_index_set, const MPI_Comm mpi_comm)
    void create_tpetra_comm_pattern (const IndexSet &source_index_set, const MPI_Comm mpi_comm)
     
    void check_no_subscribers () const noexcept
    void check_no_subscribers () const noexcept
     
    \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 Private Attributes

    bool compressed
     
    bool has_ghost
     
    Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > vector
     
    Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > nonlocal_vector
     
    ::IndexSet source_stored_elements
     
    Teuchos::RCP< const TpetraWrappers::CommunicationPattern< MemorySpace > > tpetra_comm_pattern
    Teuchos::RCP< const TpetraWrappers::CommunicationPattern< MemorySpace > > tpetra_comm_pattern
     
    std::atomic< unsigned int > counter
     
    std::map< std::string, unsigned int > counter_map
     
    std::vector< std::atomic< bool > * > validity_pointers
     
    const std::type_info * object_info
    const std::type_info * object_info
     
    \n \n-\n+\n \n

    \n Static Private Attributes

    static std::mutex mutex
    static std::mutex mutex
     
    \n \n-\n+\n \n

    \n Friends

    class internal::VectorReference< Number, MemorySpace >
    class internal::VectorReference< Number, MemorySpace >
     
    \n

    Detailed Description

    \n-
    template<typename Number, typename MemorySpace = ::MemorySpace::Host>
    \n+
    template<typename Number, typename MemorySpace = ::MemorySpace::Host>
    \n class LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >

    This class implements a wrapper to the Trilinos distributed vector class Tpetra::Vector. This class requires Trilinos to be compiled with MPI support.

    \n

    Moreover, this class takes an optional template argument for the memory space used. By default, all memory is allocated on the CPU.

    \n \n

    Definition at line 288 of file trilinos_tpetra_vector.h.

    \n

    Member Typedef Documentation

    \n \n

    ◆ value_type

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n
    using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::value_type = Numberusing LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::value_type = Number
    \n
    \n

    Declare some of the standard types used in all containers.

    \n \n

    Definition at line 294 of file trilinos_tpetra_vector.h.

    \n \n@@ -382,72 +382,72 @@\n
    \n \n

    ◆ real_type

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n
    using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::real_type = typename numbers::NumberTraits<Number>::real_typeusing LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::real_type = typename numbers::NumberTraits<Number>::real_type
    \n
    \n \n

    Definition at line 295 of file trilinos_tpetra_vector.h.

    \n \n
    \n
    \n \n

    ◆ size_type

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n
    using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::size_type = types::global_dof_indexusing LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::size_type = types::global_dof_index
    \n
    \n \n

    Definition at line 296 of file trilinos_tpetra_vector.h.

    \n \n
    \n
    \n \n

    ◆ reference

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n
    using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::reference = internal::VectorReference<Number, MemorySpace>using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::reference = internal::VectorReference<Number, MemorySpace>
    \n
    \n \n

    Definition at line 297 of file trilinos_tpetra_vector.h.

    \n \n
    \n \n \n

    ◆ const_reference

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n
    using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::const_reference = const internal::VectorReference<Number, MemorySpace>using LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::const_reference = const internal::VectorReference<Number, MemorySpace>
    \n
    \n \n

    Definition at line 298 of file trilinos_tpetra_vector.h.

    \n \n
    \n@@ -458,15 +458,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_value_type = decltype(counter_map)::value_typeusing Subscriptor::map_value_type = decltype(counter_map)::value_type
    \n     		\n privateinherited
    \n@@ -483,15 +483,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_iterator = decltype(counter_map)::iteratorusing Subscriptor::map_iterator = decltype(counter_map)::iterator
    \n     		\n privateinherited
    \n@@ -505,15 +505,15 @@\n

    Constructor & Destructor Documentation

    \n \n

    ◆ Vector() [1/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -525,20 +525,20 @@\n \n \n

    ◆ Vector() [2/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::Vector ()
    \n \n \n \n- \n+ \n \n \n \n
    LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::Vector (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V)
    \n
    \n

    Copy constructor. Sets the dimension and the partitioning to that of the given vector and copies all elements.

    \n \n@@ -546,20 +546,20 @@\n
    \n \n

    ◆ Vector() [3/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n
    LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::Vector (const Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > const Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > V)
    \n
    \n

    Copy constructor from Teuchos::RCP<Tpetra::Vector>.

    \n \n@@ -567,29 +567,29 @@\n
    \n \n

    ◆ Vector() [4/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -606,42 +606,42 @@\n \n \n

    ◆ Vector() [5/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::Vector (const IndexSet & const IndexSet & parallel_partitioner,
    const MPI_Comm const MPI_Comm communicator 
    )
    \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
    LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::Vector (const IndexSet & const IndexSet & locally_owned_entries,
    const IndexSet & const IndexSet & ghost_entries,
    const MPI_Comm const MPI_Comm communicator,
    const bool vector_writable = false const bool vector_writable = false 
    )
    \n@@ -660,15 +660,15 @@\n

    Member Function Documentation

    \n \n

    ◆ clear()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -680,33 +680,33 @@\n \n \n

    ◆ reinit() [1/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::clear ()
    \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
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::reinit (const IndexSet & const IndexSet & parallel_partitioner,
    const MPI_Comm communicator = MPI_COMM_WORLD, const MPI_Comm communicator = MPI_COMM_WORLD,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -717,39 +717,39 @@\n
    \n \n

    ◆ reinit() [2/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \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
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::reinit (const IndexSet & const IndexSet & locally_owned_entries,
    const IndexSet & const IndexSet & locally_relevant_or_ghost_entries,
    const MPI_Comm communicator = MPI_COMM_WORLD, const MPI_Comm communicator = MPI_COMM_WORLD,
    const bool vector_writable = false const bool vector_writable = false 
    )
    \n@@ -762,27 +762,27 @@\n
    \n \n

    ◆ reinit() [3/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n- \n+ \n+ \n \n \n \n \n \n \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::reinit (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -793,15 +793,15 @@\n
    \n \n

    ◆ swap()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n \n \n
    \n \n \n \n \n@@ -826,23 +826,23 @@\n \n \n

    ◆ extract_subvector_to()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void Vector< Number, MemorySpace >::swap (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n \n \n \n \n@@ -867,20 +867,20 @@\n \n \n

    ◆ operator=() [1/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    virtual void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::extract_subvector_to virtual void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::extract_subvector_to (const ArrayView< const types::global_dof_index > & const ArrayView< const types::global_dof_index > & indices,
    ArrayView< Number > & elements 
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V)
    \n
    \n

    Copy function. This function takes a Vector and copies all the elements. The Vector will have the same parallel distribution as V.

    \n

    The semantics of this operator are complex. If the two vectors have the same size, and if either the left or right hand side vector of the assignment (i.e., either the input vector on the right hand side, or the calling vector to the left of the assignment operator) currently has ghost elements, then the left hand side vector will also have ghost values and will consequently be a read-only vector (see also the glossary entry on the issue). Otherwise, the left hand vector will be a writable vector after this operation. These semantics facilitate having a vector with ghost elements on the left hand side of the assignment, and a vector without ghost elements on the right hand side, with the resulting left hand side vector having the correct values in both its locally owned and its ghost elements.

    \n@@ -890,22 +890,22 @@\n
    \n \n

    ◆ operator=() [2/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    \n-template<typename OtherNumber >
    \n+template<typename OtherNumber >
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= (const ::Vector< OtherNumber > & const ::Vector< OtherNumber > & V)
    \n
    \n

    Copy function. This function takes a Vector and copies all the elements. The Vector will have the same parallel distribution as V.

    \n \n@@ -913,20 +913,20 @@\n
    \n \n

    ◆ operator=() [3/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator= (const Number const Number s)
    \n
    \n

    Sets all elements of the vector to the scalar s. This operation is only allowed if s is equal to zero.

    \n \n@@ -934,32 +934,32 @@\n
    \n \n

    ◆ import_elements() [1/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \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@@ -971,32 +971,32 @@\n \n \n

    ◆ import_elements() [2/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import_elements (const ReadWriteVector< Number > & const ReadWriteVector< Number > & V,
    VectorOperation::values operation,
    const Teuchos::RCP< const Utilities::MPI::CommunicationPatternBase > & const Teuchos::RCP< const Utilities::MPI::CommunicationPatternBase > & communication_pattern 
    )
    \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@@ -1008,20 +1008,20 @@\n \n \n

    ◆ import_elements() [3/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import_elements (const ReadWriteVector< Number > & const ReadWriteVector< Number > & V,
    VectorOperation::values operation,
    const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > & communication_pattern 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1038,35 +1038,35 @@\n \n \n

    ◆ import()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import_elements (const ReadWriteVector< Number > & const ReadWriteVector< Number > & V,
    VectorOperation::values operation 
    \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@@ -1085,23 +1085,23 @@\n \n \n

    ◆ operator()() [1/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import (const ReadWriteVector< Number > & const ReadWriteVector< Number > & V,
    VectorOperation::values operation,
    std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern = {} 
    )
    \n \n \n \n@@ -1117,20 +1117,20 @@\n \n \n

    ◆ operator()() [2/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    internal::VectorReference< Number, MemorySpace > Vector< Number, MemorySpace >::operator() internal::VectorReference< Number, MemorySpace > Vector< Number, MemorySpace >::operator() (const size_type const size_type index)
    \n     		\n inline
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator() Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator() (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n

    When using a vector distributed with MPI, this operation only makes sense for elements that are actually present on the calling processor. Otherwise, an exception is thrown.

    \n@@ -1139,84 +1139,84 @@\n
    \n \n

    ◆ operator[]() [1/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    internal::VectorReference< Number, MemorySpace > Vector< Number, MemorySpace >::operator[] internal::VectorReference< Number, MemorySpace > Vector< Number, MemorySpace >::operator[] (const size_type const size_type index)
    \n     		\n inline
    \n
    \n

    Provide access to a given element, both read and write.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n

    Definition at line 1368 of file trilinos_tpetra_vector.h.

    \n \n
    \n \n \n

    ◆ operator[]() [2/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Number Vector< Number, MemorySpace >::operator[] Number Vector< Number, MemorySpace >::operator[] (const size_type const size_type index) const
    \n     		\n inline
    \n
    \n

    Provide read-only access to an element.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n

    Definition at line 1375 of file trilinos_tpetra_vector.h.

    \n \n
    \n \n \n

    ◆ operator*=()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator*= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator*= (const Number const Number factor)
    \n
    \n

    Multiply the entire vector by a fixed factor.

    \n \n@@ -1224,20 +1224,20 @@\n
    \n \n

    ◆ operator/=()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator/= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator/= (const Number const Number factor)
    \n
    \n

    Divide the entire vector by a fixed factor.

    \n \n@@ -1245,20 +1245,20 @@\n
    \n \n

    ◆ operator+=()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator+= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator+= (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V)
    \n
    \n

    Add the vector V to the present one.

    \n \n@@ -1266,20 +1266,20 @@\n
    \n \n

    ◆ operator-=()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator-= Vector & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator-= (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V)
    \n
    \n

    Subtract the vector V from the present one.

    \n \n@@ -1287,20 +1287,20 @@\n
    \n \n

    ◆ operator*()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator* Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator* (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V) const
    \n
    \n

    Return the scalar product of two vectors. The vectors need to have the same layout.

    \n \n@@ -1308,20 +1308,20 @@\n
    \n \n

    ◆ add() [1/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::add (const Number const Number a)
    \n
    \n

    Add a to all components. Note that is a scalar not a vector.

    \n \n@@ -1329,26 +1329,26 @@\n
    \n \n

    ◆ add() [2/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1360,38 +1360,38 @@\n \n \n

    ◆ add() [3/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::add (const Number const Number a,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V 
    )
    \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@@ -1403,29 +1403,29 @@\n \n \n

    ◆ add() [4/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::add (const Number const Number a,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V,
    const Number const Number b,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & W 
    )
    \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@@ -1444,35 +1444,35 @@\n \n \n

    ◆ add() [5/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n
    void Vector< Number, MemorySpace >::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< Number > & const std::vector< Number > & values 
    )
    \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@@ -1491,32 +1491,32 @@\n \n \n

    ◆ sadd()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void Vector< Number, MemorySpace >::add (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const Number * const Number * values 
    )
    \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@@ -1528,35 +1528,35 @@\n \n \n

    ◆ set()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::sadd (const Number const Number s,
    const Number const Number a,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V 
    )
    \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@@ -1575,20 +1575,20 @@\n \n \n

    ◆ scale()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void Vector< Number, MemorySpace >::set (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const Number * const Number * values 
    )
    \n \n \n \n- \n+ \n \n \n \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::scale (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & scaling_factors)
    \n
    \n

    Scale each element of this vector by the corresponding element in the argument. This function is mostly meant to simulate multiplication (and immediate re-assignment) by a diagonal scaling matrix. The vectors need to have the same layout.

    \n \n@@ -1596,26 +1596,26 @@\n
    \n \n

    ◆ equ()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1627,15 +1627,15 @@\n \n \n

    ◆ all_zero()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::equ (const Number const Number a,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V 
    )
    \n \n \n \n \n \n \n@@ -1647,15 +1647,15 @@\n \n \n

    ◆ is_non_negative()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::all_zero () const
    \n \n \n \n \n \n \n@@ -1667,15 +1667,15 @@\n \n \n

    ◆ mean_value()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::is_non_negative () const
    \n \n \n \n \n \n \n@@ -1687,15 +1687,15 @@\n \n \n

    ◆ l1_norm()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::mean_value () const
    \n \n \n \n \n \n \n@@ -1707,15 +1707,15 @@\n \n \n

    ◆ l2_norm()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    real_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::l1_norm () const
    \n \n \n \n \n \n \n@@ -1727,15 +1727,15 @@\n \n \n

    ◆ linfty_norm()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    real_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::l2_norm () const
    \n \n \n \n \n \n \n@@ -1747,15 +1747,15 @@\n \n \n

    ◆ norm_sqr()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    real_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::linfty_norm () const
    \n \n \n \n \n \n \n@@ -1767,32 +1767,32 @@\n \n \n

    ◆ add_and_dot()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    real_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::norm_sqr () const
    \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@@ -1809,15 +1809,15 @@\n \n \n

    ◆ has_ghost_elements()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n
    Number LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::add_and_dot (const Number const Number a,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & V,
    const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & W 
    )
    \n \n
    \n \n \n \n \n@@ -1839,20 +1839,20 @@\n \n \n

    ◆ operator==()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool Vector< Number, MemorySpace >::has_ghost_elements (
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator== bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator== (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & v) const
    \n
    \n

    Test for equality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -1860,20 +1860,20 @@\n
    \n \n

    ◆ operator!=()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::operator!= (const Vector< Number, MemorySpace > & const Vector< Number, MemorySpace > & v) const
    \n
    \n

    Test for inequality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -1881,21 +1881,21 @@\n
    \n \n

    ◆ size()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    virtual size_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::size virtual size_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::size () const
    \n     		\n@@ -1911,15 +1911,15 @@\n \n \n

    ◆ locally_owned_size()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -1931,15 +1931,15 @@\n \n \n

    ◆ local_range()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    size_type LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::locally_owned_size () const
    \n \n \n \n \n \n \n@@ -1952,20 +1952,20 @@\n \n \n

    ◆ in_local_range()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    std::pair< size_type, size_type > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::local_range () const
    \n \n \n \n- \n+ \n \n \n \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::in_local_range (const size_type const size_type index) const
    \n
    \n

    Return whether index is in the local range or not, see also local_range().

    \n
    Note
    The same limitation for the applicability of this function applies as listed in the documentation of local_range().
    \n@@ -1974,15 +1974,15 @@\n
    \n \n

    ◆ is_compressed()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace >
    \n+template<typename Number , typename MemorySpace >
    \n \n \n
    \n \n \n \n \n@@ -2004,15 +2004,15 @@\n \n \n

    ◆ get_mpi_communicator()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool Vector< Number, MemorySpace >::is_compressed (
    \n \n \n \n \n \n \n@@ -2024,41 +2024,42 @@\n \n \n

    ◆ locally_owned_elements()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    MPI_Comm LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::get_mpi_communicator () const
    \n \n \n \n \n \n \n
    ::IndexSet LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::locally_owned_elements () const
    \n
    \n-

    Return an index set that describes which elements of this vector are owned by the current processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set(vec.size())
    \n+

    Return an index set that describes which elements of this vector are owned by the current processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set(vec.size())
    \n+
    LinearAlgebra::TpetraWrappers::Vector::vector
    Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > vector
    Definition trilinos_tpetra_vector.h:1047
    \n
    complete_index_set
    IndexSet complete_index_set(const IndexSet::size_type N)
    Definition index_set.h:1204
    \n
    \n
    \n
    \n \n

    ◆ compress()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n- \n+ \n \n \n \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::compress (const VectorOperation::values const VectorOperation::values operation)
    \n
    \n

    Compress the underlying representation of the Trilinos object, i.e. flush the buffers of the vector object if it has any. This function is necessary after writing into a vector element-by-element and before anything else can be done on it.

    \n
    Parameters
    \n@@ -2073,18 +2074,18 @@\n
    \n \n

    ◆ trilinos_vector() [1/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n- \n+ \n \n \n \n \n
    const TpetraTypes::VectorType< Number, MemorySpace > & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_vector const TpetraTypes::VectorType< Number, MemorySpace > & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_vector () const
    \n
    \n

    Return a const reference to the underlying Trilinos Tpetra::Vector class.

    \n@@ -2093,15 +2094,15 @@\n
    \n \n

    ◆ trilinos_vector() [2/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -2113,18 +2114,18 @@\n \n \n

    ◆ trilinos_rcp() [1/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    TpetraTypes::VectorType< Number, MemorySpace > & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_vector ()
    \n \n- \n+ \n \n \n \n \n
    Teuchos::RCP< const TpetraTypes::VectorType< Number, MemorySpace > > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_rcp Teuchos::RCP< const TpetraTypes::VectorType< Number, MemorySpace > > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_rcp () const
    \n
    \n

    Return a const Teuchos::RCP to the underlying Trilinos Tpetra::Vector class.

    \n@@ -2133,15 +2134,15 @@\n
    \n \n

    ◆ trilinos_rcp() [2/2]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -2153,39 +2154,39 @@\n \n \n

    ◆ print()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    Teuchos::RCP< TpetraTypes::VectorType< Number, MemorySpace > > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::trilinos_rcp ()
    \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
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::print (std::ostream & out,
    const unsigned int const unsigned int precision = 3,
    const bool scientific = true, const bool scientific = true,
    const bool across = true const bool across = true 
    ) const
    \n@@ -2196,15 +2197,15 @@\n
    \n \n

    ◆ memory_consumption()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n@@ -2216,15 +2217,15 @@\n \n \n

    ◆ mpi_comm()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    std::size_t LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::memory_consumption () const
    \n \n \n \n \n \n \n@@ -2236,29 +2237,29 @@\n \n \n

    ◆ create_tpetra_comm_pattern()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    MPI_Comm LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::mpi_comm () const
    \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2382,15 +2383,15 @@\n \n \n

    ◆ list_subscribers() [1/2]

    \n \n
    \n
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n
    void LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::create_tpetra_comm_pattern (const IndexSet & const IndexSet & source_index_set,
    const MPI_Comm const MPI_Comm mpi_comm 
    )
    \n \n \n \n \n
    \n \n \n \n \n@@ -2441,15 +2442,15 @@\n \n \n

    ◆ serialize()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void Subscriptor::list_subscribers (
    \n \n
    \n \n \n \n \n@@ -2515,21 +2516,21 @@\n

    Friends And Related Symbol Documentation

    \n \n

    ◆ internal::VectorReference< Number, MemorySpace >

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    void Subscriptor::serialize (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    friend class internal::VectorReference< Number, MemorySpace >friend class internal::VectorReference< Number, MemorySpace >
    \n     		\n friend
    \n@@ -2542,15 +2543,15 @@\n

    Member Data Documentation

    \n \n

    ◆ compressed

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n
    \n \n \n \n \n@@ -2569,15 +2570,15 @@\n \n \n

    ◆ has_ghost

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::compressed
    \n \n
    \n \n \n \n \n@@ -2624,15 +2625,15 @@\n \n \n

    ◆ nonlocal_vector

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    bool LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::has_ghost
    \n \n \n \n \n
    \n \n \n \n \n@@ -2651,15 +2652,15 @@\n \n \n

    ◆ source_stored_elements

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    Teuchos::RCP<TpetraTypes::VectorType<Number, MemorySpace> > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::nonlocal_vector
    \n \n
    \n \n \n \n \n@@ -2678,21 +2679,21 @@\n \n \n

    ◆ tpetra_comm_pattern

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    ::IndexSet LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::source_stored_elements
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    Teuchos::RCP<const TpetraWrappers::CommunicationPattern<MemorySpace> > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::tpetra_comm_patternTeuchos::RCP<const TpetraWrappers::CommunicationPattern<MemorySpace> > LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::tpetra_comm_pattern
    \n     		\n private
    \n@@ -2787,15 +2788,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    const std::type_info* Subscriptor::object_infoconst std::type_info* Subscriptor::object_info
    \n     		\n mutableprivateinherited
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1BlockVector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1BlockVector.html", "unified_diff": "@@ -1758,15 +1758,15 @@\n
    \n     		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 573 of file la_parallel_block_vector.h.

    \n \n
    \n \n \n

    ◆ operator*() [1/2]

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1Vector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1Vector.html", "unified_diff": "@@ -1558,15 +1558,15 @@\n
    \n     		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 717 of file la_parallel_vector.h.

    \n \n
    \n \n \n

    ◆ operator*=()

    \n@@ -1727,15 +1727,15 @@\n
    \n     		\n inline
    \n
    \n-
    Deprecated:
    Use import_elements() instead.
    \n+
    Deprecated:
    Use import_elements() instead.
    \n \n

    Definition at line 776 of file la_parallel_vector.h.

    \n \n
    \n \n \n

    ◆ operator*()

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMGTransferBase.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMGTransferBase.html", "unified_diff": "@@ -217,15 +217,15 @@\n
    \n

    Detailed Description

    \n
    template<typename VectorType>
    \n class MGTransferBase< VectorType >

    Base class used to declare the operations needed by a concrete class implementing prolongation and restriction of vectors in the multigrid context. This class is abstract and has no implementation of these operations.

    \n

    There are several derived classes, reflecting the fact that vector types and numbering of the fine-grid discretization and of the multi-level implementation are independent.

    \n

    If you use multigrid for a single PDE or for your complete system of equations, you will use MGTransferPrebuilt together with Multigrid. The vector types used on the fine grid as well as for the multilevel operations may be Vector or BlockVector. In both cases, MGTransferPrebuilt will operate on all components of the solution.

    \n
    Note
    For the following, it is important to realize the difference between a solution component and a solution block. The distinction only applies if vector valued elements are used, but is quite important then. This is reflected in the fact that it is not possible right now to use transfer classes based on MGTransferComponentBase for genuine vector valued elements, but descendants of MGTransferBlockBase would have to be applied. In the following text, we will use the term block, but remark that it might refer to components as well.
    \n-
    Todo:
    update the following documentation, since it does not reflect the latest changes in structure.
    \n+
    Todo:
    update the following documentation, since it does not reflect the latest changes in structure.
    \n

    For mixed systems, it may be required to do multigrid only for a single component or for some components. The classes MGTransferSelect and MGTransferBlock handle these cases.

    \n

    MGTransferSelect is used if you use multigrid (on Vector objects) for a single component, possibly grouped using mg_target_component.

    \n

    The class MGTransferBlock handles the case where your multigrid method operates on BlockVector objects. These can contain all or a consecutive set of the blocks of the complete system. Since most smoothers cannot operate on block structures, it is not clear whether this case is really useful. Therefore, a tested implementation of this case will be supplied when needed.

    \n \n

    Definition at line 171 of file mg_base.h.

    \n

    Member Typedef Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMapping.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMapping.html", "unified_diff": "@@ -330,15 +330,15 @@\n \\sum_{q}\n \\hat u(\\hat{\\mathbf x}_q)\n \\underbrace{\\left|\\text{det}J(\\hat{\\mathbf x}_q)\\right| w_q}_{=:\n \\text{JxW}_q}.\n \\]\n

    \n

    Here, the weights \\(\\text{JxW}_q\\) of each quadrature point (where JxW mnemonically stands for Jacobian times Quadrature Weights) take the role of the \\(dx\\) in the original integral. Consequently, they appear in all code that computes integrals approximated by quadrature, and are accessed by FEValues::JxW().

    \n-
    Todo:
    Document what happens in the codimension-1 case.
    \n+
    Todo:
    Document what happens in the codimension-1 case.
    \n

    Mapping of vector fields, differential forms and gradients of vector fields

    \n

    The transformation of vector fields or differential forms (gradients of scalar functions) \\(\\mathbf v\\), and gradients of vector fields \\(\\mathbf T\\) follows the general form

    \n

    \n \\[\n \\mathbf v(\\mathbf x) = \\mathbf A(\\hat{\\mathbf x})\n \\hat{\\mathbf v}(\\hat{\\mathbf x}),\n \\qquad\n@@ -1072,15 +1072,15 @@\n

    \n
    		\n protectedvirtual
    \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -1326,15 +1326,15 @@\n
    \n
    		\n protectedvirtual
    \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n@@ -1720,15 +1720,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingC1.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingC1.html", "unified_diff": "@@ -1171,15 +1171,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1680,15 +1680,15 @@\n
    \n     		\n protectedvirtualinherited
    \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -1942,15 +1942,15 @@\n
    \n
    		\n protectedvirtualinherited
    \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingCartesian.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingCartesian.html", "unified_diff": "@@ -864,15 +864,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -2279,15 +2279,15 @@\n
    \n
    		\n protectedvirtualinherited
    \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_face_values() [2/2]

    \n \n
    \n@@ -2336,15 +2336,15 @@\n
    \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n
    \n \n

    ◆ subscribe()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFE.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFE.html", "unified_diff": "@@ -906,15 +906,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n
    • \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1817,15 +1817,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_face_values() [2/2]

    \n \n
    \n@@ -1874,15 +1874,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_immersed_surface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFEField.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFEField.html", "unified_diff": "@@ -1015,15 +1015,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -2170,15 +2170,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_face_values() [2/2]

    \n \n
    \n@@ -2227,15 +2227,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ subscribe()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingManifold.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingManifold.html", "unified_diff": "@@ -821,15 +821,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1740,15 +1740,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_face_values() [2/2]

    \n \n
    \n@@ -1797,15 +1797,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_immersed_surface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ.html", "unified_diff": "@@ -1039,15 +1039,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -2556,15 +2556,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_face_values() [2/2]

    \n \n
    \n@@ -2613,15 +2613,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ subscribe()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1.html", "unified_diff": "@@ -960,15 +960,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1469,15 +1469,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -1731,15 +1731,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1Eulerian.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1Eulerian.html", "unified_diff": "@@ -1123,15 +1123,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1632,15 +1632,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -1812,15 +1812,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQCache.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQCache.html", "unified_diff": "@@ -1395,15 +1395,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1904,15 +1904,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -2166,15 +2166,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQEulerian.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQEulerian.html", "unified_diff": "@@ -1153,15 +1153,15 @@\n \\frac{1}{\\text{det}\\;J(\\hat{\\mathbf x})}\n J(\\hat{\\mathbf x}) \\hat{\\mathbf T}(\\hat{\\mathbf x})\n J(\\hat{\\mathbf x})^{-1}.\n \\]\n

    \n \n \n-
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    Todo:
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Parameters
    \n \n \n \n \n \n
    [in]inputAn array (or part of an array) of input objects that should be mapped.
    [in]kindThe kind of mapping to be applied.
    [in]internalA pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to.
    [out]outputAn array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.)
    \n@@ -1662,15 +1662,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ get_subface_data()

    \n \n
    \n@@ -1842,15 +1842,15 @@\n \n \n \n protectedvirtualinherited \n \n \n
    \n-
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n+
    Deprecated:
    Use the version taking a hp::QCollection argument.
    \n \n
    \n \n \n

    ◆ fill_fe_subface_values()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1ResidualLocalBlocksToGlobalBlocks.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1ResidualLocalBlocksToGlobalBlocks.html", "unified_diff": "@@ -139,15 +139,15 @@\n \n

    Detailed Description

    \n
    template<typename VectorType>
    \n class MeshWorker::Assembler::ResidualLocalBlocksToGlobalBlocks< VectorType >

    Assemble local residuals into global residuals.

    \n

    The global residuals are expected as an FEVectors object. The local residuals are block vectors.

    \n

    Depending on whether the BlockInfo object was initialize with BlockInfo::initialize_local(), the comprehensive or block data model is used locally.

    \n

    In the block model, each of the blocks of the local vectors corresponds to the restriction of a single block of the system to this cell (see GlossBlock). Thus, the size of this local block is the number of degrees of freedom of the corresponding base element of the FESystem.

    \n-
    Todo:
    Comprehensive model currently not implemented.
    \n+
    Todo:
    Comprehensive model currently not implemented.
    \n \n

    Definition at line 110 of file assembler.h.

    \n

    Member Function Documentation

    \n \n

    ◆ initialize() [1/2]

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1DoFInfo.html", "unified_diff": "@@ -117,83 +117,83 @@\n \"\"\n \"\"\n \n
    [legend]
    \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 \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 Public Member Functions

     DoFInfo (const BlockInfo &block_info)
     DoFInfo (const BlockInfo &block_info)
     
     DoFInfo (const DoFHandler< dim, spacedim > &dof_handler)
     DoFInfo (const DoFHandler< dim, spacedim > &dof_handler)
     
    template<class DHCellIterator >
    void reinit (const DHCellIterator &c)
    template<class DHCellIterator >
    void reinit (const DHCellIterator &c)
     
    template<class DHCellIterator , class DHFaceIterator >
    void reinit (const DHCellIterator &c, const DHFaceIterator &f, const unsigned int face_no)
    template<class DHCellIterator , class DHFaceIterator >
    void reinit (const DHCellIterator &c, const DHFaceIterator &f, const unsigned int face_no)
     
    template<class DHCellIterator , class DHFaceIterator >
    void reinit (const DHCellIterator &c, const DHFaceIterator &f, const unsigned int face_no, const unsigned int subface_no)
    template<class DHCellIterator , class DHFaceIterator >
    void reinit (const DHCellIterator &c, const DHFaceIterator &f, const unsigned int face_no, const unsigned int subface_no)
     
    template<class DHFaceIterator >
    void set_face (const DHFaceIterator &f, const unsigned int face_no)
    template<class DHFaceIterator >
    void set_face (const DHFaceIterator &f, const unsigned int face_no)
     
    template<class DHFaceIterator >
    void set_subface (const DHFaceIterator &f, const unsigned int face_no, const unsigned int subface_no)
    template<class DHFaceIterator >
    void set_subface (const DHFaceIterator &f, const unsigned int face_no, const unsigned int subface_no)
     
    const BlockIndices & local_indices () const
    const BlockIndices & local_indices () const
     
    unsigned int n_values () const
    unsigned int n_values () const
     
    unsigned int n_vectors () const
    unsigned int n_vectors () const
     
    unsigned int n_matrices () const
    unsigned int n_matrices () const
     
    unsigned int n_quadrature_points () const
    unsigned int n_quadrature_points () const
     
    unsigned int n_quadrature_values () const
    unsigned int n_quadrature_values () const
     
    number & value (const unsigned int i)
    number & value (const unsigned int i)
     
    number value (const unsigned int i) const
    number value (const unsigned int i) const
     
    BlockVector< number > & vector (const unsigned int i)
     
    const BlockVector< number > & vector (const unsigned int i) const
     
    MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false)
    MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false)
     
    const MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false) const
    const MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false) const
     
    Table< 2, number > & quadrature_values ()
     
    number & quadrature_value (const unsigned int k, const unsigned int i)
    number & quadrature_value (const unsigned int k, const unsigned int i)
     
    number quadrature_value (const unsigned int k, const unsigned int i) const
    number quadrature_value (const unsigned int k, const unsigned int i) const
     
    void initialize_numbers (const unsigned int n)
    void initialize_numbers (const unsigned int n)
     
    void initialize_vectors (const unsigned int n)
    void initialize_vectors (const unsigned int n)
     
    void initialize_matrices (const unsigned int n, bool both)
    void initialize_matrices (const unsigned int n, bool both)
     
    template<typename MatrixType >
    void initialize_matrices (const MatrixBlockVector< MatrixType > &matrices, bool both)
    template<typename MatrixType >
    void initialize_matrices (const MatrixBlockVector< MatrixType > &matrices, bool both)
     
    template<typename MatrixType >
    void initialize_matrices (const MGMatrixBlockVector< MatrixType > &matrices, bool both)
    template<typename MatrixType >
    void initialize_matrices (const MGMatrixBlockVector< MatrixType > &matrices, bool both)
     
    void initialize_quadrature (const unsigned int np, const unsigned int nv)
    void initialize_quadrature (const unsigned int np, const unsigned int nv)
     
    void reinit (const BlockIndices &local_sizes)
    void reinit (const BlockIndices &local_sizes)
     
    template<typename StreamType >
    void print_debug (StreamType &os) const
    template<typename StreamType >
    void print_debug (StreamType &os) const
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    \n \n \n \n \n@@ -204,29 +204,29 @@\n \n \n \n \n \n \n \n-\n+\n \n \n \n \n

    \n Public Attributes

    Triangulation< dim, spacedim >::cell_iterator cell
     The current cell.
     
     
    unsigned int sub_number
     
    std::vector< types::global_dof_index > indices
     
    std::vector< std::vector< types::global_dof_index > > indices_by_block
     
    SmartPointer< const BlockInfo, DoFInfo< dim, spacedim > > block_info
    SmartPointer< const BlockInfo, DoFInfo< dim, spacedim > > block_info
     The block structure of the system.
     
    bool level_cell
     
    \n \n \n \n \n \n \n-\n-\n+\n+\n \n \n

    \n Private Member Functions

     DoFInfo ()
     
    void set_block_indices ()
     Set up local block indices.
     
    template<class DHCellIterator >
    void get_indices (const DHCellIterator &c)
    template<class DHCellIterator >
    void get_indices (const DHCellIterator &c)
     Fill index vector with active indices.
     
    \n \n \n \n@@ -242,19 +242,19 @@\n \n \n \n \n

    \n Private Attributes

    std::vector< types::global_dof_index > indices_org
     Auxiliary vector.
    std::vector< MatrixBlock< FullMatrix< number > > > M2
     
    Table< 2, number > quadrature_data
     
    \n \n-\n+\n \n

    \n Friends

    class DoFInfoBox< dim, DoFInfo< dim, spacedim, number > >
    class DoFInfoBox< dim, DoFInfo< dim, spacedim, number > >
     
    \n

    Detailed Description

    \n-
    template<int dim, int spacedim = dim, typename number = double>
    \n+
    template<int dim, int spacedim = dim, typename number = double>
    \n class MeshWorker::DoFInfo< dim, spacedim, number >

    A class containing information on geometry and degrees of freedom of a mesh object.

    \n

    The information in these objects is usually used by one of the Assembler classes. It is also the kind of information which is needed in mesh based matrices (often referred to as matrix free methods).

    \n

    In addition to the information on degrees of freedom stored in this class, it also provides the local computation space for the worker object operating on it in LocalResults. This base class will automatically be reinitialized on each cell, but initial setup is up to the user and should be done when initialize() for this class is called.

    \n

    This class operates in two different modes, corresponding to the data models discussed in the Assembler namespace documentation.

    \n

    The choice of the local data model is triggered by the vector BlockInfo::local_renumbering, which in turn is usually filled by BlockInfo::initialize_local(). If this function has been used, or the vector has been changed from zero-length, then local dof indices stored in this object will automatically be renumbered to reflect local block structure. This means, the first entries in indices will refer to the first block of the system, then comes the second block and so on.

    \n

    The BlockInfo object is stored as a pointer. Therefore, if the block structure changes, for instance because of mesh refinement, the DoFInfo class will automatically use the new structures.

    \n \n@@ -262,20 +262,20 @@\n

    Constructor & Destructor Documentation

    \n \n

    ◆ DoFInfo() [1/3]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n- \n+ \n \n \n \n
    MeshWorker::DoFInfo< dim, spacedim, number >::DoFInfo (const BlockInfo & const BlockInfo & block_info)
    \n
    \n

    Constructor setting the block_info pointer.

    \n \n@@ -283,20 +283,20 @@\n
    \n \n

    ◆ DoFInfo() [2/3]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n \n \n \n \n- \n+ \n \n \n \n
    MeshWorker::DoFInfo< dim, spacedim, number >::DoFInfo (const DoFHandler< dim, spacedim > & const DoFHandler< dim, spacedim > & dof_handler)
    \n
    \n

    Constructor leaving the block_info pointer empty, but setting the aux_local_indices.

    \n \n@@ -306,15 +306,15 @@\n
    \n \n

    ◆ DoFInfo() [3/3]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n \n \n
    \n \n \n \n \n@@ -337,25 +337,25 @@\n

    Member Function Documentation

    \n \n

    ◆ reinit() [1/4]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHCellIterator >
    \n+template<class DHCellIterator >
    \n
    MeshWorker::DoFInfo< dim, spacedim, number >::DoFInfo (
    \n \n \n \n@@ -370,37 +370,37 @@\n \n \n

    ◆ reinit() [2/4]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHCellIterator , class DHFaceIterator >
    \n+template<class DHCellIterator , class DHFaceIterator >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::reinit (const DHCellIterator & const DHCellIterator & c)
    \n     		\n inline
    \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@@ -419,43 +419,43 @@\n \n \n

    ◆ reinit() [3/4]

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHCellIterator , class DHFaceIterator >
    \n+template<class DHCellIterator , class DHFaceIterator >
    \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::reinit (const DHCellIterator & const DHCellIterator & c,
    const DHFaceIterator & const DHFaceIterator & f,
    const unsigned int const unsigned int face_no 
    )
    \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@@ -474,31 +474,31 @@\n \n \n

    ◆ set_face()

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHFaceIterator >
    \n+template<class DHFaceIterator >
    \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::reinit (const DHCellIterator & const DHCellIterator & c,
    const DHFaceIterator & const DHFaceIterator & f,
    const unsigned int const unsigned int face_no,
    const unsigned int const unsigned int subface_no 
    )
    \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@@ -517,37 +517,37 @@\n \n \n

    ◆ set_subface()

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHFaceIterator >
    \n+template<class DHFaceIterator >
    \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::set_face (const DHFaceIterator & const DHFaceIterator & f,
    const unsigned int const unsigned int face_no 
    )
    \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@@ -566,21 +566,21 @@\n \n \n

    ◆ local_indices()

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::set_subface (const DHFaceIterator & const DHFaceIterator & f,
    const unsigned int const unsigned int face_no,
    const unsigned int const unsigned int subface_no 
    )
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    const BlockIndices & MeshWorker::DoFInfo< dim, spacedim, number >::local_indices const BlockIndices & MeshWorker::DoFInfo< dim, spacedim, number >::local_indices () const
    \n     		\n@@ -595,15 +595,15 @@\n \n \n

    ◆ set_block_indices()

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n
    \n \n \n \n \n@@ -624,25 +624,25 @@\n \n \n

    ◆ get_indices()

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim, typename number >
    \n+template<int dim, int spacedim, typename number >
    \n
    \n-template<class DHCellIterator >
    \n+template<class DHCellIterator >
    \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::set_block_indices (
    \n \n \n \n@@ -658,15 +658,15 @@\n \n \n

    ◆ n_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::DoFInfo< dim, spacedim, number >::get_indices (const DHCellIterator & const DHCellIterator & c)
    \n     		\n inlineprivate
    \n \n \n \n \n
    \n \n \n \n \n@@ -689,15 +689,15 @@\n \n \n

    ◆ n_vectors()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_values (
    \n \n
    \n \n \n \n \n@@ -720,15 +720,15 @@\n \n \n

    ◆ n_matrices()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_vectors (
    \n \n \n \n \n
    \n \n \n \n \n@@ -750,15 +750,15 @@\n \n \n

    ◆ n_quadrature_points()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_matrices (
    \n \n
    \n \n \n \n \n@@ -780,15 +780,15 @@\n \n \n

    ◆ n_quadrature_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_quadrature_points (
    \n \n \n \n \n
    \n \n \n \n \n@@ -810,23 +810,23 @@\n \n \n

    ◆ value() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_quadrature_values (
    \n \n \n \n@@ -841,23 +841,23 @@\n \n \n

    ◆ value() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    number & MeshWorker::LocalResults< number >::value (const unsigned int const unsigned int i)
    \n     		\n inlineinherited
    \n \n \n \n@@ -934,30 +934,30 @@\n \n \n

    ◆ matrix() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    number MeshWorker::LocalResults< number >::value (const unsigned int const unsigned int i) const
    \n     		\n inlineinherited
    \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n- \n+ \n+ \n \n \n \n \n \n \n
    MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix (const unsigned int const unsigned int i,
    const bool external = false const bool external = false 
    )
    \n@@ -976,30 +976,30 @@\n \n \n

    ◆ matrix() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \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
    const MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix const MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix (const unsigned int const unsigned int i,
    const bool external = false const bool external = false 
    ) const
    \n@@ -1018,15 +1018,15 @@\n \n \n

    ◆ quadrature_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n \n \n
    \n \n \n \n \n@@ -1048,29 +1048,29 @@\n \n \n

    ◆ quadrature_value() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    Table< 2, number > & MeshWorker::LocalResults< number >::quadrature_values (
    \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@@ -1089,29 +1089,29 @@\n \n \n

    ◆ quadrature_value() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    number & MeshWorker::LocalResults< number >::quadrature_value (const unsigned int const unsigned int k,
    const unsigned int const unsigned int i 
    )
    \n \n \n \n \n \n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n@@ -934,29 +934,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 \n \n \n \n@@ -6463,15 +6463,15 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1130,23 +1130,23 @@\n \n \n

    ◆ initialize_numbers()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    number MeshWorker::LocalResults< number >::quadrature_value (const unsigned int const unsigned int k,
    const unsigned int const unsigned int i 
    ) const
    \n \n \n \n@@ -1162,23 +1162,23 @@\n \n \n

    ◆ initialize_vectors()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::initialize_numbers (const unsigned int const unsigned int n)
    \n     		\n inlineinherited
    \n \n \n \n@@ -1194,23 +1194,23 @@\n \n \n

    ◆ initialize_matrices() [1/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::initialize_vectors (const unsigned int const unsigned int n)
    \n     		\n inlineinherited
    \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1236,25 +1236,25 @@\n \n \n

    ◆ initialize_matrices() [2/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename MatrixType >
    \n+template<typename MatrixType >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const unsigned int const unsigned int n,
    bool both 
    \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1280,25 +1280,25 @@\n \n \n

    ◆ initialize_matrices() [3/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename MatrixType >
    \n+template<typename MatrixType >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const MatrixBlockVector< MatrixType > & const MatrixBlockVector< MatrixType > & matrices,
    bool both 
    \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1324,29 +1324,29 @@\n \n \n

    ◆ initialize_quadrature()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const MGMatrixBlockVector< MatrixType > & const MGMatrixBlockVector< MatrixType > & matrices,
    bool both 
    \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@@ -1365,23 +1365,23 @@\n \n \n

    ◆ reinit() [4/4]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    void MeshWorker::LocalResults< number >::initialize_quadrature (const unsigned int const unsigned int np,
    const unsigned int const unsigned int nv 
    )
    \n \n \n \n@@ -1396,25 +1396,25 @@\n \n \n

    ◆ print_debug()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::reinit (const BlockIndices & const BlockIndices & local_sizes)
    \n     		\n inherited
    \n \n \n \n@@ -1428,15 +1428,15 @@\n \n \n

    ◆ memory_consumption()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::print_debug (StreamType & StreamType & os) const
    \n     		\n inherited
    \n \n \n \n \n
    \n \n \n \n \n@@ -1459,21 +1459,21 @@\n

    Friends And Related Symbol Documentation

    \n \n

    ◆ DoFInfoBox< dim, DoFInfo< dim, spacedim, number > >

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n
    std::size_t MeshWorker::LocalResults< number >::memory_consumption (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    friend class DoFInfoBox< dim, DoFInfo< dim, spacedim, number > >friend class DoFInfoBox< dim, DoFInfo< dim, spacedim, number > >
    \n     		\n friend
    \n@@ -1486,15 +1486,15 @@\n

    Member Data Documentation

    \n \n

    ◆ cell

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    Triangulation<dim,spacedim>::cell_iterator MeshWorker::DoFInfo< dim, spacedim, number >::cell
    \n
    \n \n@@ -1506,15 +1506,15 @@\n
    \n \n

    ◆ face

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    Triangulation<dim,spacedim>::face_iterator MeshWorker::DoFInfo< dim, spacedim, number >::face
    \n
    \n \n@@ -1526,15 +1526,15 @@\n
    \n \n

    ◆ face_number

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    unsigned int MeshWorker::DoFInfo< dim, spacedim, number >::face_number
    \n
    \n

    The number of the current face on the current cell.

    \n@@ -1546,15 +1546,15 @@\n
    \n \n

    ◆ sub_number

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    unsigned int MeshWorker::DoFInfo< dim, spacedim, number >::sub_number
    \n
    \n

    The number of the current subface on the current face

    \n@@ -1566,15 +1566,15 @@\n
    \n \n

    ◆ indices

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    std::vector<types::global_dof_index> MeshWorker::DoFInfo< dim, spacedim, number >::indices
    \n
    \n

    The DoF indices of the current cell

    \n@@ -1585,15 +1585,15 @@\n
    \n \n

    ◆ indices_by_block

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    std::vector<std::vector<types::global_dof_index> > MeshWorker::DoFInfo< dim, spacedim, number >::indices_by_block
    \n
    \n

    The DoF indices on the current cell, organized by local blocks. The size of this vector is zero, unless local blocks are used.

    \n@@ -1604,18 +1604,18 @@\n
    \n \n

    ◆ block_info

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n- \n+ \n \n
    SmartPointer<const BlockInfo, DoFInfo<dim, spacedim> > MeshWorker::DoFInfo< dim, spacedim, number >::block_infoSmartPointer<const BlockInfo, DoFInfo<dim, spacedim> > MeshWorker::DoFInfo< dim, spacedim, number >::block_info
    \n
    \n \n

    The block structure of the system.

    \n \n

    Definition at line 171 of file dof_info.h.

    \n@@ -1624,15 +1624,15 @@\n
    \n \n

    ◆ level_cell

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    bool MeshWorker::DoFInfo< dim, spacedim, number >::level_cell
    \n
    \n

    The structure refers to a cell with level data instead of active data.

    \n@@ -1643,15 +1643,15 @@\n
    \n \n

    ◆ indices_org

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n \n \n \n \n
    \n \n \n \n \n@@ -1671,15 +1671,15 @@\n \n \n

    ◆ aux_local_indices

    \n \n
    \n
    \n
    \n-template<int dim, int spacedim = dim, typename number = double>
    \n+template<int dim, int spacedim = dim, typename number = double>
    \n
    std::vector<types::global_dof_index> MeshWorker::DoFInfo< dim, spacedim, number >::indices_org
    \n \n \n \n
    \n \n \n \n \n@@ -1698,15 +1698,15 @@\n \n \n

    ◆ J

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    BlockIndices MeshWorker::DoFInfo< dim, spacedim, number >::aux_local_indices
    \n \n \n \n
    \n \n \n \n \n@@ -1725,15 +1725,15 @@\n \n \n

    ◆ R

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<number> MeshWorker::LocalResults< number >::J
    \n \n \n \n
    \n \n \n \n \n@@ -1752,15 +1752,15 @@\n \n \n

    ◆ M1

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<BlockVector<number> > MeshWorker::LocalResults< number >::R
    \n \n \n \n \n
    \n \n \n \n \n@@ -1779,15 +1779,15 @@\n \n \n

    ◆ M2

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<MatrixBlock<FullMatrix<number> > > MeshWorker::LocalResults< number >::M1
    \n \n \n \n
    \n \n \n \n \n@@ -1807,15 +1807,15 @@\n \n \n

    ◆ quadrature_data

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<MatrixBlock<FullMatrix<number> > > MeshWorker::LocalResults< number >::M2
    \n \n \n \n
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalResults.html", "unified_diff": "@@ -116,62 +116,62 @@\n \"\"\n \"\"\n \n
    [legend]
    \n
    Table<2, number> MeshWorker::LocalResults< number >::quadrature_data
    \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+\n \n

    \n Public Member Functions

    unsigned int n_values () const
    unsigned int n_values () const
     
    unsigned int n_vectors () const
    unsigned int n_vectors () const
     
    unsigned int n_matrices () const
    unsigned int n_matrices () const
     
    unsigned int n_quadrature_points () const
    unsigned int n_quadrature_points () const
     
    unsigned int n_quadrature_values () const
    unsigned int n_quadrature_values () const
     
    number & value (const unsigned int i)
    number & value (const unsigned int i)
     
    number value (const unsigned int i) const
    number value (const unsigned int i) const
     
    BlockVector< number > & vector (const unsigned int i)
     
    const BlockVector< number > & vector (const unsigned int i) const
     
    MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false)
    MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false)
     
    const MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false) const
    const MatrixBlock< FullMatrix< number > > & matrix (const unsigned int i, const bool external=false) const
     
    Table< 2, number > & quadrature_values ()
     
    number & quadrature_value (const unsigned int k, const unsigned int i)
    number & quadrature_value (const unsigned int k, const unsigned int i)
     
    number quadrature_value (const unsigned int k, const unsigned int i) const
    number quadrature_value (const unsigned int k, const unsigned int i) const
     
    void initialize_numbers (const unsigned int n)
    void initialize_numbers (const unsigned int n)
     
    void initialize_vectors (const unsigned int n)
    void initialize_vectors (const unsigned int n)
     
    void initialize_matrices (const unsigned int n, bool both)
    void initialize_matrices (const unsigned int n, bool both)
     
    template<typename MatrixType >
    void initialize_matrices (const MatrixBlockVector< MatrixType > &matrices, bool both)
    template<typename MatrixType >
    void initialize_matrices (const MatrixBlockVector< MatrixType > &matrices, bool both)
     
    template<typename MatrixType >
    void initialize_matrices (const MGMatrixBlockVector< MatrixType > &matrices, bool both)
    template<typename MatrixType >
    void initialize_matrices (const MGMatrixBlockVector< MatrixType > &matrices, bool both)
     
    void initialize_quadrature (const unsigned int np, const unsigned int nv)
    void initialize_quadrature (const unsigned int np, const unsigned int nv)
     
    void reinit (const BlockIndices &local_sizes)
    void reinit (const BlockIndices &local_sizes)
     
    template<typename StreamType >
    void print_debug (StreamType &os) const
    template<typename StreamType >
    void print_debug (StreamType &os) const
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    \n \n \n \n \n@@ -180,15 +180,15 @@\n \n \n \n \n \n

    \n Private Attributes

    std::vector< number > J
     
    std::vector< BlockVector< number > > R
     
    std::vector< MatrixBlock< FullMatrix< number > > > M2
     
    Table< 2, number > quadrature_data
     
    \n

    Detailed Description

    \n-
    template<typename number>
    \n+
    template<typename number>
    \n class MeshWorker::LocalResults< number >

    The class providing the scrapbook to fill with results of local integration. Depending on the task the mesh worker loop is performing, local results can be of different types: They can be scalars, vectors of size equal to the number of degrees of freedom used in the integrals, or square matrices of that same size. All of these have in common that they are the result of local integration over a cell or face. Which kind of object is the result of an operation is determined by the Assembler using them. It is also the assembler that determines how many of each kind of object are produced (for example, an assembler may create both the local contributions to a mass and a stiffness matrix), and for setting the arrays of local results to the sizes needed.

    \n

    The interface of this class allows accessing all of this information via the following functions:

    \n
      \n
    1. \n

      Scalars: n_values() returns the number of scalars stored by an object of this class, and they are accessed via the value() function.

      \n

      \n
      2. \n@@ -205,15 +205,15 @@\n

    Member Function Documentation

    \n \n

    ◆ n_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n \n \n \n \n
    \n \n \n \n \n@@ -236,15 +236,15 @@\n \n \n

    ◆ n_vectors()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_values (
    \n \n \n \n
    \n \n \n \n \n@@ -267,15 +267,15 @@\n \n \n

    ◆ n_matrices()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_vectors (
    \n \n \n \n \n
    \n \n \n \n \n@@ -297,15 +297,15 @@\n \n \n

    ◆ n_quadrature_points()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_matrices (
    \n \n \n \n
    \n \n \n \n \n@@ -327,15 +327,15 @@\n \n \n

    ◆ n_quadrature_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_quadrature_points (
    \n \n \n \n
    \n \n \n \n \n@@ -357,23 +357,23 @@\n \n \n

    ◆ value() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    unsigned int MeshWorker::LocalResults< number >::n_quadrature_values (
    \n \n \n \n@@ -388,23 +388,23 @@\n \n \n

    ◆ value() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    number & MeshWorker::LocalResults< number >::value (const unsigned int const unsigned int i)
    \n     		\n inline
    \n \n \n \n@@ -481,30 +481,30 @@\n \n \n

    ◆ matrix() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    number MeshWorker::LocalResults< number >::value (const unsigned int const unsigned int i) const
    \n     		\n inline
    \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
    MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix (const unsigned int const unsigned int i,
    const bool external = false const bool external = false 
    )
    \n@@ -523,30 +523,30 @@\n \n \n

    ◆ matrix() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \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
    const MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix const MatrixBlock< FullMatrix< number > > & MeshWorker::LocalResults< number >::matrix (const unsigned int const unsigned int i,
    const bool external = false const bool external = false 
    ) const
    \n@@ -565,15 +565,15 @@\n \n \n

    ◆ quadrature_values()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n \n \n \n \n \n
    \n \n \n \n \n@@ -595,29 +595,29 @@\n \n \n

    ◆ quadrature_value() [1/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    Table< 2, number > & MeshWorker::LocalResults< number >::quadrature_values (
    \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@@ -636,29 +636,29 @@\n \n \n

    ◆ quadrature_value() [2/2]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    number & MeshWorker::LocalResults< number >::quadrature_value (const unsigned int const unsigned int k,
    const unsigned int const unsigned int i 
    )
    \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@@ -677,23 +677,23 @@\n \n \n

    ◆ initialize_numbers()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    number MeshWorker::LocalResults< number >::quadrature_value (const unsigned int const unsigned int k,
    const unsigned int const unsigned int i 
    ) const
    \n \n \n \n@@ -709,23 +709,23 @@\n \n \n

    ◆ initialize_vectors()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::initialize_numbers (const unsigned int const unsigned int n)
    \n     		\n inline
    \n \n \n \n@@ -741,23 +741,23 @@\n \n \n

    ◆ initialize_matrices() [1/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::initialize_vectors (const unsigned int const unsigned int n)
    \n     		\n inline
    \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -783,25 +783,25 @@\n \n \n

    ◆ initialize_matrices() [2/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename MatrixType >
    \n+template<typename MatrixType >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const unsigned int const unsigned int n,
    bool both 
    \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -827,25 +827,25 @@\n \n \n

    ◆ initialize_matrices() [3/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename MatrixType >
    \n+template<typename MatrixType >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const MatrixBlockVector< MatrixType > & const MatrixBlockVector< MatrixType > & matrices,
    bool both 
    \n \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -871,29 +871,29 @@\n \n \n

    ◆ initialize_quadrature()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    void MeshWorker::LocalResults< number >::initialize_matrices (const MGMatrixBlockVector< MatrixType > & const MGMatrixBlockVector< MatrixType > & matrices,
    bool both 
    \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@@ -912,20 +912,20 @@\n \n \n

    ◆ reinit()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    void MeshWorker::LocalResults< number >::initialize_quadrature (const unsigned int const unsigned int np,
    const unsigned int const unsigned int nv 
    )
    \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::reinit (const BlockIndices & const BlockIndices & local_sizes)
    \n
    \n

    Reinitialize matrices for new cell. Does not resize any of the data vectors stored in this object, but resizes the vectors in R and the matrices in M1 and M2 for hp and sets them to zero.

    \n \n@@ -935,22 +935,22 @@\n
    \n \n

    ◆ print_debug()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n \n \n \n \n- \n+ \n \n \n \n
    void MeshWorker::LocalResults< number >::print_debug (StreamType & StreamType & os) const
    \n
    \n \n

    Definition at line 522 of file local_results.h.

    \n@@ -959,15 +959,15 @@\n
    \n \n

    ◆ memory_consumption()

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n \n \n \n \n \n \n \n@@ -982,15 +982,15 @@\n

    Member Data Documentation

    \n \n

    ◆ J

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::size_t MeshWorker::LocalResults< number >::memory_consumption () const
    \n \n \n \n
    \n \n \n \n \n@@ -1009,15 +1009,15 @@\n \n \n

    ◆ R

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<number> MeshWorker::LocalResults< number >::J
    \n \n \n \n
    \n \n \n \n \n@@ -1036,15 +1036,15 @@\n \n \n

    ◆ M1

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<BlockVector<number> > MeshWorker::LocalResults< number >::R
    \n \n \n \n
    \n \n \n \n \n@@ -1063,15 +1063,15 @@\n \n \n

    ◆ M2

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<MatrixBlock<FullMatrix<number> > > MeshWorker::LocalResults< number >::M1
    \n \n \n \n
    \n \n \n \n \n@@ -1091,15 +1091,15 @@\n \n \n

    ◆ quadrature_data

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n
    std::vector<MatrixBlock<FullMatrix<number> > > MeshWorker::LocalResults< number >::M2
    \n \n \n \n
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1MPI_1_1Vector.html", "unified_diff": "@@ -128,204 +128,204 @@\n \"\"\n \"\"\n \n
    [legend]
    \n
    Table<2, number> MeshWorker::LocalResults< number >::quadrature_data
    \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Public Types

    using size_type = types::global_dof_index
    using size_type = types::global_dof_index
     
    using value_type = PetscScalar
    using value_type = PetscScalar
     
    using real_type = PetscReal
    using real_type = PetscReal
     
    using reference = internal::VectorReference
    using reference = internal::VectorReference
     
    using const_reference = const internal::VectorReference
    using const_reference = const internal::VectorReference
     
    \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-\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+\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 \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 Public Member Functions

     Vector ()
     
     Vector (const MPI_Comm communicator, const size_type n, const size_type locally_owned_size)
     Vector (const MPI_Comm communicator, const size_type n, const size_type locally_owned_size)
     
    template<typename Number >
     Vector (const MPI_Comm communicator, const ::Vector< Number > &v, const size_type locally_owned_size)
    template<typename Number >
     Vector (const MPI_Comm communicator, const ::Vector< Number > &v, const size_type locally_owned_size)
     
     Vector (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator)
     Vector (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator)
     
     Vector (const IndexSet &local, const MPI_Comm communicator)
     Vector (const IndexSet &local, const MPI_Comm communicator)
     
     Vector (const Vector &v)
     Vector (const Vector &v)
     
    virtual void clear () override
    virtual void clear () override
     
    Vector & operator= (const Vector &v)
    Vector & operator= (const Vector &v)
     
    Vector & operator= (const PetscScalar s)
    Vector & operator= (const PetscScalar s)
     
    template<typename number >
    Vector & operator= (const ::Vector< number > &v)
    template<typename number >
    Vector & operator= (const ::Vector< number > &v)
     
    void reinit (const MPI_Comm communicator, const size_type N, const size_type locally_owned_size, const bool omit_zeroing_entries=false)
    void reinit (const MPI_Comm communicator, const size_type N, const size_type locally_owned_size, const bool omit_zeroing_entries=false)
     
    void reinit (const Vector &v, const bool omit_zeroing_entries=false)
    void reinit (const Vector &v, const bool omit_zeroing_entries=false)
     
    void reinit (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator)
    void reinit (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator)
     
    void reinit (const IndexSet &local, const MPI_Comm communicator)
    void reinit (const IndexSet &local, const MPI_Comm communicator)
     
    void reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > &partitioner, const bool make_ghosted=true)
    void reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > &partitioner, const bool make_ghosted=true)
     
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
     
    bool all_zero () const
    bool all_zero () const
     
     VectorBase ()
     
     VectorBase (const VectorBase &v)
     VectorBase (const VectorBase &v)
     
     VectorBase (const Vec &v)
     VectorBase (const Vec &v)
     
    void reinit (Vec v)
     
    void compress (const VectorOperation::values operation)
    void compress (const VectorOperation::values operation)
     
    bool operator== (const VectorBase &v) const
    bool operator== (const VectorBase &v) const
     
    bool operator!= (const VectorBase &v) const
    bool operator!= (const VectorBase &v) const
     
    size_type size () const override
    size_type size () const override
     
    size_type locally_owned_size () const
    size_type locally_owned_size () const
     
    std::pair< size_type, size_type > local_range () const
    std::pair< size_type, size_type > local_range () const
     
    bool in_local_range (const size_type index) const
    bool in_local_range (const size_type index) const
     
    IndexSet locally_owned_elements () const
    IndexSet locally_owned_elements () const
     
    bool has_ghost_elements () const
    bool has_ghost_elements () const
     
    const IndexSet & ghost_elements () const
    const IndexSet & ghost_elements () const
     
    void update_ghost_values () const
    void update_ghost_values () const
     
    reference operator() (const size_type index)
    reference operator() (const size_type index)
     
    PetscScalar operator() (const size_type index) const
    PetscScalar operator() (const size_type index) const
     
    reference operator[] (const size_type index)
    reference operator[] (const size_type index)
     
    PetscScalar operator[] (const size_type index) const
    PetscScalar operator[] (const size_type index) const
     
    void set (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
    void set (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
     
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< PetscScalar > &values) const
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< PetscScalar > &values) const
     
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< PetscScalar > &elements) const override
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< PetscScalar > &elements) const override
     
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (const ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (const ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
     
    void add (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
    void add (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
     
    void add (const std::vector< size_type > &indices, const ::Vector< PetscScalar > &values)
    void add (const std::vector< size_type > &indices, const ::Vector< PetscScalar > &values)
     
    void add (const size_type n_elements, const size_type *indices, const PetscScalar *values)
    void add (const size_type n_elements, const size_type *indices, const PetscScalar *values)
     
    void add (const PetscScalar s)
    void add (const PetscScalar s)
     
    void add (const PetscScalar a, const VectorBase &V)
    void add (const PetscScalar a, const VectorBase &V)
     
    void add (const PetscScalar a, const VectorBase &V, const PetscScalar b, const VectorBase &W)
    void add (const PetscScalar a, const VectorBase &V, const PetscScalar b, const VectorBase &W)
     
    PetscScalar operator* (const VectorBase &vec) const
    PetscScalar operator* (const VectorBase &vec) const
     
    real_type norm_sqr () const
    real_type norm_sqr () const
     
    PetscScalar mean_value () const
    PetscScalar mean_value () const
     
    real_type l1_norm () const
    real_type l1_norm () const
     
    real_type l2_norm () const
    real_type l2_norm () const
     
    real_type lp_norm (const real_type p) const
    real_type lp_norm (const real_type p) const
     
    real_type linfty_norm () const
    real_type linfty_norm () const
     
    PetscScalar add_and_dot (const PetscScalar a, const VectorBase &V, const VectorBase &W)
    PetscScalar add_and_dot (const PetscScalar a, const VectorBase &V, const VectorBase &W)
     
    VectorBase & operator*= (const PetscScalar factor)
    VectorBase & operator*= (const PetscScalar factor)
     
    VectorBase & operator/= (const PetscScalar factor)
    VectorBase & operator/= (const PetscScalar factor)
     
    VectorBase & operator+= (const VectorBase &V)
    VectorBase & operator+= (const VectorBase &V)
     
    VectorBase & operator-= (const VectorBase &V)
    VectorBase & operator-= (const VectorBase &V)
     
    void sadd (const PetscScalar s, const VectorBase &V)
    void sadd (const PetscScalar s, const VectorBase &V)
     
    void sadd (const PetscScalar s, const PetscScalar a, const VectorBase &V)
    void sadd (const PetscScalar s, const PetscScalar a, const VectorBase &V)
     
    void scale (const VectorBase &scaling_factors)
    void scale (const VectorBase &scaling_factors)
     
    void equ (const PetscScalar a, const VectorBase &V)
    void equ (const PetscScalar a, const VectorBase &V)
     
    void write_ascii (const PetscViewerFormat format=PETSC_VIEWER_DEFAULT)
    void write_ascii (const PetscViewerFormat format=PETSC_VIEWER_DEFAULT)
     
    template<class Archive >
    void save (Archive &ar, const unsigned int version) const
    template<class Archive >
    void save (Archive &ar, const unsigned int version) const
     
    template<class Archive >
    void load (Archive &ar, const unsigned int version)
    template<class Archive >
    void load (Archive &ar, const unsigned int version)
     
    template<class Archive >
    void serialize (Archive &archive, const unsigned int version)
    template<class Archive >
    void serialize (Archive &archive, const unsigned int version)
     
    void swap (VectorBase &v) noexcept
    void swap (VectorBase &v) noexcept
     
     operator const Vec & () const
     operator const Vec & () const
     
    Vec & petsc_vector ()
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    MPI_Comm get_mpi_communicator () const
    MPI_Comm get_mpi_communicator () const
     
    Subscriptor functionality

    Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

    \n
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    unsigned int n_subscriptions () const
    unsigned int n_subscriptions () const
     
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
     
    void list_subscribers () const
    void list_subscribers () const
     
    \n \n-\n+\n \n-\n+\n \n

    \n Static Public Member Functions

    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
     
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
     
    \n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n

    \n Protected Member Functions

    virtual void create_vector (const MPI_Comm comm, const size_type n, const size_type locally_owned_size)
    virtual void create_vector (const MPI_Comm comm, const size_type n, const size_type locally_owned_size)
     
    virtual void create_vector (const MPI_Comm comm, const size_type n, const size_type locally_owned_size, const IndexSet &ghostnodes)
    virtual void create_vector (const MPI_Comm comm, const size_type n, const size_type locally_owned_size, const IndexSet &ghostnodes)
     
    void do_set_add_operation (const size_type n_elements, const size_type *indices, const PetscScalar *values, const bool add_values)
    void do_set_add_operation (const size_type n_elements, const size_type *indices, const PetscScalar *values, const bool add_values)
     
    void determine_ghost_indices ()
     
    \n \n \n@@ -335,66 +335,66 @@\n \n \n \n \n

    \n Protected Attributes

    Vec vector
    IndexSet ghost_indices
     
    VectorOperation::values last_action
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Types

    using map_value_type = decltype(counter_map)::value_type
    using map_value_type = decltype(counter_map)::value_type
     
    using map_iterator = decltype(counter_map)::iterator
    using map_iterator = decltype(counter_map)::iterator
     
    \n \n-\n+\n \n

    \n Private Member Functions

    void check_no_subscribers () const noexcept
    void check_no_subscribers () const noexcept
     
    \n \n \n \n \n \n \n \n-\n+\n \n

    \n Private Attributes

    std::atomic< unsigned int > counter
     
    std::map< std::string, unsigned int > counter_map
     
    std::vector< std::atomic< bool > * > validity_pointers
     
    const std::type_info * object_info
    const std::type_info * object_info
     
    \n \n-\n+\n \n

    \n Static Private Attributes

    static std::mutex mutex
    static std::mutex mutex
     
    \n \n \n-\n+\n \n-\n+\n \n

    \n Related Symbols

    (Note that these are not member symbols.)

    \n
    void swap (Vector &u, Vector &v)
    void swap (Vector &u, Vector &v)
     
    void swap (VectorBase &u, VectorBase &v) noexcept
    void swap (VectorBase &u, VectorBase &v) noexcept
     
    \n

    Detailed Description

    \n

    Implementation of a parallel vector class based on PETSC and using MPI communication to synchronize distributed operations. All the functionality is actually in the base class, except for the calls to generate a parallel vector. This is possible since PETSc only works on an abstract vector type and internally distributes to functions that do the actual work depending on the actual vector type (much like using virtual functions). Only the functions creating a vector of specific type differ, and are implemented in this particular class.

    \n

    Parallel communication model

    \n

    The parallel functionality of PETSc is built on top of the Message Passing Interface (MPI). MPI's communication model is built on collective communications: if one process wants something from another, that other process has to be willing to accept this communication. A process cannot query data from another process by calling a remote function, without that other process expecting such a transaction. The consequence is that most of the operations in the base class of this class have to be called collectively. For example, if you want to compute the l2 norm of a parallel vector, all processes across which this vector is shared have to call the l2_norm function. If you don't do this, but instead only call the l2_norm function on one process, then the following happens: This one process will call one of the collective MPI functions and wait for all the other processes to join in on this. Since the other processes don't call this function, you will either get a time-out on the first process, or, worse, by the time the next a call to a PETSc function generates an MPI message on the other processes, you will get a cryptic message that only a subset of processes attempted a communication. These bugs can be very hard to figure out, unless you are well-acquainted with the communication model of MPI, and know which functions may generate MPI messages.

    \n

    One particular case, where an MPI message may be generated unexpectedly is discussed below.

    \n

    Accessing individual elements of a vector

    \n-

    PETSc does allow read access to individual elements of a vector, but in the distributed case only to elements that are stored locally. We implement this through calls like d=vec(i). However, if you access an element outside the locally stored range, an exception is generated.

    \n-

    In contrast to read access, PETSc (and the respective deal.II wrapper classes) allow to write (or add) to individual elements of vectors, even if they are stored on a different process. You can do this writing, for example, vec(i)=d or vec(i)+=d, or similar operations. There is one catch, however, that may lead to very confusing error messages: PETSc requires application programs to call the compress() function when they switch from adding, to elements to writing to elements. The reasoning is that all processes might accumulate addition operations to elements, even if multiple processes write to the same elements. By the time we call compress() the next time, all these additions are executed. However, if one process adds to an element, and another overwrites to it, the order of execution would yield non-deterministic behavior if we don't make sure that a synchronization with compress() happens in between.

    \n+

    PETSc does allow read access to individual elements of a vector, but in the distributed case only to elements that are stored locally. We implement this through calls like d=vec(i). However, if you access an element outside the locally stored range, an exception is generated.

    \n+

    In contrast to read access, PETSc (and the respective deal.II wrapper classes) allow to write (or add) to individual elements of vectors, even if they are stored on a different process. You can do this writing, for example, vec(i)=d or vec(i)+=d, or similar operations. There is one catch, however, that may lead to very confusing error messages: PETSc requires application programs to call the compress() function when they switch from adding, to elements to writing to elements. The reasoning is that all processes might accumulate addition operations to elements, even if multiple processes write to the same elements. By the time we call compress() the next time, all these additions are executed. However, if one process adds to an element, and another overwrites to it, the order of execution would yield non-deterministic behavior if we don't make sure that a synchronization with compress() happens in between.

    \n

    In order to make sure these calls to compress() happen at the appropriate time, the deal.II wrappers keep a state variable that store which is the presently allowed operation: additions or writes. If it encounters an operation of the opposite kind, it calls compress() and flips the state. This can sometimes lead to very confusing behavior, in code that may for example look like this:

    PETScWrappers::MPI::Vector vector;
    \n
    ...
    \n
    // do some write operations on the vector
    \n
    for (unsigned int i=0; i<vector.size(); ++i)
    \n
    vector(i) = i;
    \n
    \n
    // do some additions to vector elements, but only for some elements
    \n
    for (unsigned int i=0; i<vector.size(); ++i)
    \n-
    if (some_condition(i) == true)
    \n+
    if (some_condition(i) == true)
    \n
    vector(i) += 1;
    \n
    \n
    // do another collective operation
    \n
    const double norm = vector.l2_norm();
    \n \n \n

    This code can run into trouble: by the time we see the first addition operation, we need to flush the overwrite buffers for the vector, and the deal.II library will do so by calling compress(). However, it will only do so for all processes that actually do an addition – if the condition is never true for one of the processes, then this one will not get to the actual compress() call, whereas all the other ones do. This gets us into trouble, since all the other processes hang in the call to flush the write buffers, while the one other process advances to the call to compute the l2 norm. At this time, you will get an error that some operation was attempted by only a subset of processes. This behavior may seem surprising, unless you know that write/addition operations on single elements may trigger this behavior.

    \n@@ -406,15 +406,15 @@\n \n

    ◆ size_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::MPI::Vector::size_type = types::global_dof_indexusing PETScWrappers::MPI::Vector::size_type = types::global_dof_index
    \n
    \n

    Declare type for container size.

    \n \n

    Definition at line 163 of file petsc_vector.h.

    \n \n@@ -426,15 +426,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::value_type = PetscScalarusing PETScWrappers::VectorBase::value_type = PetscScalar
    \n     		\n inherited
    \n@@ -451,15 +451,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::real_type = PetscRealusing PETScWrappers::VectorBase::real_type = PetscReal
    \n     		\n inherited
    \n@@ -475,15 +475,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::reference = internal::VectorReferenceusing PETScWrappers::VectorBase::reference = internal::VectorReference
    \n     		\n inherited
    \n@@ -499,15 +499,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::const_reference = const internal::VectorReferenceusing PETScWrappers::VectorBase::const_reference = const internal::VectorReference
    \n     		\n inherited
    \n@@ -523,15 +523,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_value_type = decltype(counter_map)::value_typeusing Subscriptor::map_value_type = decltype(counter_map)::value_type
    \n     		\n privateinherited
    \n@@ -548,15 +548,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_iterator = decltype(counter_map)::iteratorusing Subscriptor::map_iterator = decltype(counter_map)::iterator
    \n     		\n privateinherited
    \n@@ -596,27 +596,27 @@\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@@ -642,35 +642,35 @@\n \n \n

    ◆ Vector() [3/6]

    \n \n
    \n
    \n
    \n-template<typename Number >
    \n+template<typename Number >
    \n
    Vector< Number >::Vector (const MPI_Comm const MPI_Comm communicator,
    const size_type const size_type n,
    const size_type const size_type locally_owned_size 
    )
    \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@@ -696,27 +696,27 @@\n \n
    \n
    \n
    PETScWrappers::MPI::Vector::Vector (const MPI_Comm const MPI_Comm communicator,
    const ::Vector< Number > & const ::Vector< Number > & v,
    const size_type const size_type locally_owned_size 
    )
    \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@@ -740,21 +740,21 @@\n
    Vector< Number >::Vector (const IndexSet & const IndexSet & local,
    const IndexSet & const IndexSet & ghost,
    const MPI_Comm const MPI_Comm communicator 
    )
    \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@@ -777,15 +777,15 @@\n \n
    \n
    \n
    Vector< Number >::Vector (const IndexSet & const IndexSet & local,
    const MPI_Comm const MPI_Comm communicator 
    )
    \n \n \n \n- \n+ \n \n \n \n
    Vector< Number >::Vector (const Vector & const Vector & v)
    \n
    \n

    Copy constructor.

    \n \n@@ -827,17 +827,17 @@\n \n

    ◆ operator=() [1/3]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator= Vector & Vector< Number >::operator= (const Vector & const Vector & v)
    \n
    \n

    Copy the given vector. Resize the present vector if necessary. Also take over the MPI communicator of v.

    \n

    The semantics of this operator are complex. If the two vectors have the same size, and if either the left or right hand side vector of the assignment (i.e., either the input vector on the right hand side, or the calling vector to the left of the assignment operator) currently has ghost elements, then the left hand side vector will also have ghost values and will consequently be a read-only vector (see also the glossary entry on the issue). Otherwise, the left hand vector will be a writable vector after this operation. These semantics facilitate having a vector with ghost elements on the left hand side of the assignment, and a vector without ghost elements on the right hand side, with the resulting left hand side vector having the correct values in both its locally owned and its ghost elements.

    \n@@ -850,17 +850,17 @@\n \n

    ◆ operator=() [2/3]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & PETScWrappers::MPI::Vector::operator= Vector & PETScWrappers::MPI::Vector::operator= (const PetscScalar const PetscScalar s)
    \n
    \n

    Set all components of the vector to the given number s. Simply pass this down to the base class, but we still need to declare this function to make the example given in the discussion about making the constructor explicit work.

    \n \n@@ -868,20 +868,20 @@\n
    \n \n

    ◆ operator=() [3/3]

    \n \n
    \n
    \n
    \n-template<typename number >
    \n+template<typename number >
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & PETScWrappers::MPI::Vector::operator= Vector & PETScWrappers::MPI::Vector::operator= (const ::Vector< number > & const ::Vector< number > & v)
    \n
    \n

    Copy the values of a deal.II vector (as opposed to those of the PETSc vector wrapper class) into this object.

    \n

    Contrary to the case of sequential vectors, this operators requires that the present vector already has the correct size, since we need to have a partition and a communicator present which we otherwise can't get from the source vector.

    \n@@ -893,34 +893,34 @@\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
    void Vector< Number >::reinit (const MPI_Comm const MPI_Comm communicator,
    const size_type const size_type N,
    const size_type const size_type locally_owned_size,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -939,22 +939,22 @@\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
    void Vector< Number >::reinit (const Vector & const Vector & v,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -971,27 +971,27 @@\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@@ -1009,21 +1009,21 @@\n \n
    \n
    \n
    void Vector< Number >::reinit (const IndexSet & const IndexSet & local,
    const IndexSet & const IndexSet & ghost,
    const MPI_Comm const MPI_Comm communicator 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1041,22 +1041,22 @@\n \n
    \n
    \n
    void Vector< Number >::reinit (const IndexSet & const IndexSet & local,
    const MPI_Comm const MPI_Comm communicator 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n- \n+ \n+ \n \n \n \n \n \n \n
    void Vector< Number >::reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > & const std::shared_ptr< const Utilities::MPI::Partitioner > & partitioner,
    const bool make_ghosted = true const bool make_ghosted = true 
    )
    \n@@ -1079,28 +1079,28 @@\n
    		(std::ostream & out,
    const unsigned int const unsigned int precision = 3,
    const bool scientific = true, const bool scientific = true,
    const bool across = true const bool across = true 
    ) const
    \n@@ -1143,27 +1143,27 @@\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@@ -1188,33 +1188,33 @@\n
    void Vector< Number >::create_vector (const MPI_Comm const MPI_Comm comm,
    const size_type const size_type n,
    const size_type const size_type locally_owned_size 
    )
    \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@@ -1256,15 +1256,15 @@\n \n
    \n
    \n
    void Vector< Number >::create_vector (const MPI_Comm const MPI_Comm comm,
    const size_type const size_type n,
    const size_type const size_type locally_owned_size,
    const IndexSet & const IndexSet & ghostnodes 
    )
    \n \n \n \n- \n+ \n \n \n \n
    PETScWrappers::VectorBase::VectorBase (const VectorBase & const VectorBase & v)
    \n
    \n

    Import VectorBase constructors, including from a PETSc Vec object.

    \n \n@@ -1280,15 +1280,15 @@\n \n \n \n \n@@ -1330,15 +1330,15 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    PETScWrappers::VectorBase::VectorBase (const Vec & const Vec & v)
    \n     		\n explicit
    \n \n \n \n@@ -1358,17 +1358,17 @@\n
    \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::compress (const VectorOperation::values const VectorOperation::values operation)
    \n     		\n inherited
    \n \n \n \n@@ -1389,15 +1389,15 @@\n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::operator== bool PETScWrappers::VectorBase::operator== (const VectorBase & const VectorBase & v) const
    \n     		\n inherited
    \n \n \n \n@@ -1505,15 +1505,15 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::operator!= (const VectorBase & const VectorBase & v) const
    \n     		\n inherited
    \n \n \n \n@@ -1542,15 +1542,15 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::in_local_range (const size_type const size_type index) const
    \n     		\n inherited
    \n
    		\n inherited
    \n
    \n-

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n+

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n
    complete_index_set
    IndexSet complete_index_set(const IndexSet::size_type N)
    Definition index_set.h:1204
    \n
    \n
    \n
    \n \n

    ◆ has_ghost_elements()

    \n \n@@ -1584,15 +1584,15 @@\n
    \n
    \n \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    const IndexSet & PETScWrappers::VectorBase::ghost_elements const IndexSet & PETScWrappers::VectorBase::ghost_elements () const
    \n     		\n@@ -1636,17 +1636,17 @@\n
    \n
    \n \n \n \n \n@@ -1663,17 +1663,17 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference PETScWrappers::VectorBase::operator() reference PETScWrappers::VectorBase::operator() (const size_type const size_type index)
    \n     		\n inherited
    \n \n \n \n@@ -1690,57 +1690,57 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator() PetscScalar PETScWrappers::VectorBase::operator() (const size_type const size_type index) const
    \n     		\n inherited
    \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference PETScWrappers::VectorBase::operator[] reference PETScWrappers::VectorBase::operator[] (const size_type const size_type index)
    \n     		\n inherited
    \n
    \n

    Provide access to a given element, both read and write.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ operator[]() [2/2]

    \n \n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator[] PetscScalar PETScWrappers::VectorBase::operator[] (const size_type const size_type index) const
    \n     		\n inherited
    \n
    \n

    Provide read-only access to an element.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ set()

    \n \n
    \n@@ -1748,21 +1748,21 @@\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@@ -1787,15 +1787,15 @@\n
    void PETScWrappers::VectorBase::set (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< PetscScalar > & const std::vector< PetscScalar > & values 
    )
    \n \n \n \n \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1808,15 +1808,15 @@\n
    void PETScWrappers::VectorBase::extract_subvector_to (const std::vector< size_type > & const std::vector< size_type > & indices,
    std::vector< PetscScalar > & values 
    \n     		\n inherited
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n

    If the current vector is called v, then this function is the equivalent to the code

    for (unsigned int i=0; i<indices.size(); ++i)
    \n
    values[i] = v[indices[i]];
    \n
    Precondition
    The sizes of the indices and values arrays must be identical.
    \n \n
    \n \n \n@@ -1825,17 +1825,17 @@\n
    \n
    \n \n \n \n \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1860,57 +1860,57 @@\n \n \n

    ◆ extract_subvector_to() [3/3]

    \n \n
    \n
    \n
    \n-template<typename ForwardIterator , typename OutputIterator >
    \n+template<typename ForwardIterator , typename OutputIterator >
    \n
    virtual void PETScWrappers::VectorBase::extract_subvector_to virtual void PETScWrappers::VectorBase::extract_subvector_to (const ArrayView< const types::global_dof_index > & const ArrayView< const types::global_dof_index > & indices,
    ArrayView< PetscScalar > & elements 
    \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
    void PETScWrappers::VectorBase::extract_subvector_to (const ForwardIterator const ForwardIterator indices_begin,
    const ForwardIterator const ForwardIterator indices_end,
    OutputIterator OutputIterator values_begin 
    ) const
    \n     		\n inherited
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n-

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n-
    OutputIterator values_p = values_begin;
    \n-
    while (indices_p != indices_end)
    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n+

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n+
    OutputIterator values_p = values_begin;
    \n+
    while (indices_p != indices_end)
    \n
    {
    \n-
    *values_p = v[*indices_p];
    \n-
    ++indices_p;
    \n-
    ++values_p;
    \n+
    *values_p = v[*indices_p];
    \n+
    ++indices_p;
    \n+
    ++values_p;
    \n
    }
    \n
    Precondition
    It must be possible to write into as many memory locations starting at values_begin as there are iterators between indices_begin and indices_end.
    \n \n
    \n
    \n \n

    ◆ add() [1/6]

    \n@@ -1920,21 +1920,21 @@\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@@ -1959,21 +1959,21 @@\n
    void PETScWrappers::VectorBase::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< PetscScalar > & const std::vector< PetscScalar > & values 
    )
    \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@@ -1998,27 +1998,27 @@\n
    void PETScWrappers::VectorBase::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const ::Vector< PetscScalar > & const ::Vector< PetscScalar > & values 
    )
    \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@@ -2043,15 +2043,15 @@\n
    void PETScWrappers::VectorBase::add (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const PetscScalar * const PetscScalar * values 
    )
    \n \n \n \n@@ -2072,21 +2072,21 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar s)
    \n     		\n inherited
    \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@@ -2111,33 +2111,33 @@\n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \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@@ -2160,17 +2160,17 @@\n
    \n
    \n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V,
    const PetscScalar const PetscScalar b,
    const VectorBase & const VectorBase & W 
    )
    \n \n \n \n@@ -2305,15 +2305,15 @@\n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator* PetscScalar PETScWrappers::VectorBase::operator* (const VectorBase & const VectorBase & vec) const
    \n     		\n inherited
    \n \n \n \n@@ -2362,27 +2362,27 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    VectorBase::real_type PETScWrappers::VectorBase::lp_norm (const real_type const real_type p) const
    \n     		\n inherited
    \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@@ -2409,17 +2409,17 @@\n
    \n
    \n
    PetscScalar PETScWrappers::VectorBase::add_and_dot (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V,
    const VectorBase & const VectorBase & W 
    )
    \n \n \n \n@@ -2438,17 +2438,17 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator*= VectorBase & PETScWrappers::VectorBase::operator*= (const PetscScalar const PetscScalar factor)
    \n     		\n inherited
    \n \n \n \n@@ -2467,17 +2467,17 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator/= VectorBase & PETScWrappers::VectorBase::operator/= (const PetscScalar const PetscScalar factor)
    \n     		\n inherited
    \n \n \n \n@@ -2496,17 +2496,17 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator+= VectorBase & PETScWrappers::VectorBase::operator+= (const VectorBase & const VectorBase & V)
    \n     		\n inherited
    \n \n \n \n@@ -2527,21 +2527,21 @@\n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator-= VectorBase & PETScWrappers::VectorBase::operator-= (const VectorBase & const VectorBase & V)
    \n     		\n inherited
    \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@@ -2566,27 +2566,27 @@\n
    void PETScWrappers::VectorBase::sadd (const PetscScalar const PetscScalar s,
    const VectorBase & const VectorBase & V 
    )
    \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@@ -2611,15 +2611,15 @@\n
    void PETScWrappers::VectorBase::sadd (const PetscScalar const PetscScalar s,
    const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \n \n \n \n@@ -2640,21 +2640,21 @@\n
    \n \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::scale (const VectorBase & const VectorBase & scaling_factors)
    \n     		\n inherited
    \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@@ -2679,16 +2679,16 @@\n
    void PETScWrappers::VectorBase::equ (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \n \n \n \n \n@@ -2702,29 +2702,29 @@\n \n \n

    ◆ save()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    \n \n \n \n \n- \n- \n+ \n+ \n \n \n
    void PETScWrappers::VectorBase::write_ascii (const PetscViewerFormat format = PETSC_VIEWER_DEFAULT)const PetscViewerFormat format = PETSC_VIEWER_DEFAULT)
    \n     		\n inherited
    \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@@ -2742,29 +2742,29 @@\n \n \n

    ◆ load()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void PETScWrappers::VectorBase::save (Archive & Archive & ar,
    const unsigned int const unsigned int version 
    ) const
    \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@@ -2781,29 +2781,29 @@\n \n \n

    ◆ serialize()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void PETScWrappers::VectorBase::load (Archive & Archive & ar,
    const unsigned int const unsigned int version 
    )
    \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@@ -2854,15 +2854,15 @@\n
    \n
    \n
    void PETScWrappers::VectorBase::serialize (Archive & Archive & archive,
    const unsigned int const unsigned int version 
    )
    \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    PETScWrappers::VectorBase::operator const Vec & PETScWrappers::VectorBase::operator const Vec & () const
    \n     		\n@@ -2966,33 +2966,33 @@\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@@ -3146,15 +3146,15 @@\n \n \n

    ◆ list_subscribers() [1/2]

    \n \n
    \n
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n
    void PETScWrappers::VectorBase::do_set_add_operation (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const PetscScalar * const PetscScalar * values,
    const bool const bool add_values 
    )
    \n \n \n \n \n \n
    \n \n \n \n \n@@ -3498,15 +3498,15 @@\n
    \n
    \n
    void Subscriptor::list_subscribers (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    const std::type_info* Subscriptor::object_infoconst std::type_info* Subscriptor::object_info
    \n     		\n mutableprivateinherited
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverBiCG.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverBiCG.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 368 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverBicgstab.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverBicgstab.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 439 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCG.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCG.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 341 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCGS.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCGS.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 466 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCR.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverCR.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 547 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverChebychev.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverChebychev.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 314 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverGMRES.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverGMRES.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 404 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverLSQR.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverLSQR.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 575 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverPreOnly.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverPreOnly.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 610 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverRichardson.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverRichardson.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 264 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverTCQMR.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverTCQMR.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 520 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverTFQMR.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SolverTFQMR.html", "unified_diff": "@@ -235,15 +235,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 493 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SparseDirectMUMPS.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1SparseDirectMUMPS.html", "unified_diff": "@@ -247,15 +247,15 @@\n     		)
    \n
    \n

    Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.

    \n-
    Deprecated:
    \n+
    Deprecated:
    \n \n

    Definition at line 650 of file petsc_solver.cc.

    \n \n
    \n \n

    Member Function Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepper.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1TimeStepper.html", "unified_diff": "@@ -895,15 +895,15 @@\n template<typename VectorType = PETScWrappers::VectorBase, typename PMatrixType = PETScWrappers::MatrixBase, typename AMatrixType = PMatrixType> \n \n \n \n \n
    std::function<void(const real_type t, VectorType &y)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::distribute
    \n
    \n-
    Deprecated:
    This callback is equivalent to update_constrained_components, but is deprecated. Use update_constrained_components instead.
    \n+
    Deprecated:
    This callback is equivalent to update_constrained_components, but is deprecated. Use update_constrained_components instead.
    \n \n

    Definition at line 621 of file petsc_ts.h.

    \n \n
    \n \n \n

    ◆ update_constrained_components

    \n@@ -935,15 +935,15 @@\n template<typename VectorType = PETScWrappers::VectorBase, typename PMatrixType = PETScWrappers::MatrixBase, typename AMatrixType = PMatrixType> \n \n \n \n \n
    std::function<void(const real_type t, const unsigned int step, const VectorType &y, bool &resize)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::decide_for_coarsening_and_refinement
    \n
    \n-
    Deprecated:
    This callback is equivalent to decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead.
    \n+
    Deprecated:
    This callback is equivalent to decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead.
    \n \n

    Definition at line 656 of file petsc_ts.h.

    \n \n
    \n \n \n

    ◆ decide_and_prepare_for_remeshing

    \n@@ -975,15 +975,15 @@\n template<typename VectorType = PETScWrappers::VectorBase, typename PMatrixType = PETScWrappers::MatrixBase, typename AMatrixType = PMatrixType> \n \n \n \n \n
    std::function<void(const std::vector<VectorType> &all_in, std::vector<VectorType> &all_out)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::interpolate
    \n
    \n-
    Deprecated:
    This callback is equivalent to transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead.
    \n+
    Deprecated:
    This callback is equivalent to transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead.
    \n \n

    Definition at line 688 of file petsc_ts.h.

    \n \n
    \n \n \n

    ◆ transfer_solution_vectors_to_new_mesh

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPETScWrappers_1_1VectorBase.html", "unified_diff": "@@ -129,176 +129,176 @@\n \"\"\n \"\"\n \n
    [legend]
    \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Public Types

    using value_type = PetscScalar
    using value_type = PetscScalar
     
    using real_type = PetscReal
    using real_type = PetscReal
     
    using size_type = types::global_dof_index
    using size_type = types::global_dof_index
     
    using reference = internal::VectorReference
    using reference = internal::VectorReference
     
    using const_reference = const internal::VectorReference
    using const_reference = const internal::VectorReference
     
    \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-\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+\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 Public Member Functions

     VectorBase ()
     
     VectorBase (const VectorBase &v)
     VectorBase (const VectorBase &v)
     
     VectorBase (const Vec &v)
     VectorBase (const Vec &v)
     
    virtual ~VectorBase () override
    virtual ~VectorBase () override
     
    virtual void clear ()
    virtual void clear ()
     
    void compress (const VectorOperation::values operation)
    void compress (const VectorOperation::values operation)
     
    VectorBase & operator= (const VectorBase &)
    VectorBase & operator= (const VectorBase &)
     
    VectorBase & operator= (const PetscScalar s)
    VectorBase & operator= (const PetscScalar s)
     
    void reinit (Vec v)
     
    bool operator== (const VectorBase &v) const
    bool operator== (const VectorBase &v) const
     
    bool operator!= (const VectorBase &v) const
    bool operator!= (const VectorBase &v) const
     
    size_type size () const override
    size_type size () const override
     
    size_type locally_owned_size () const
    size_type locally_owned_size () const
     
    std::pair< size_type, size_type > local_range () const
    std::pair< size_type, size_type > local_range () const
     
    bool in_local_range (const size_type index) const
    bool in_local_range (const size_type index) const
     
    IndexSet locally_owned_elements () const
    IndexSet locally_owned_elements () const
     
    bool has_ghost_elements () const
    bool has_ghost_elements () const
     
    const IndexSet & ghost_elements () const
    const IndexSet & ghost_elements () const
     
    void update_ghost_values () const
    void update_ghost_values () const
     
    reference operator() (const size_type index)
    reference operator() (const size_type index)
     
    PetscScalar operator() (const size_type index) const
    PetscScalar operator() (const size_type index) const
     
    reference operator[] (const size_type index)
    reference operator[] (const size_type index)
     
    PetscScalar operator[] (const size_type index) const
    PetscScalar operator[] (const size_type index) const
     
    void set (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
    void set (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
     
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< PetscScalar > &values) const
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< PetscScalar > &values) const
     
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< PetscScalar > &elements) const override
    virtual void extract_subvector_to (const ArrayView< const types::global_dof_index > &indices, ArrayView< PetscScalar > &elements) const override
     
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (const ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (const ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
     
    void add (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
    void add (const std::vector< size_type > &indices, const std::vector< PetscScalar > &values)
     
    void add (const std::vector< size_type > &indices, const ::Vector< PetscScalar > &values)
    void add (const std::vector< size_type > &indices, const ::Vector< PetscScalar > &values)
     
    void add (const size_type n_elements, const size_type *indices, const PetscScalar *values)
    void add (const size_type n_elements, const size_type *indices, const PetscScalar *values)
     
    PetscScalar operator* (const VectorBase &vec) const
    PetscScalar operator* (const VectorBase &vec) const
     
    real_type norm_sqr () const
    real_type norm_sqr () const
     
    PetscScalar mean_value () const
    PetscScalar mean_value () const
     
    real_type l1_norm () const
    real_type l1_norm () const
     
    real_type l2_norm () const
    real_type l2_norm () const
     
    real_type lp_norm (const real_type p) const
    real_type lp_norm (const real_type p) const
     
    real_type linfty_norm () const
    real_type linfty_norm () const
     
    PetscScalar add_and_dot (const PetscScalar a, const VectorBase &V, const VectorBase &W)
    PetscScalar add_and_dot (const PetscScalar a, const VectorBase &V, const VectorBase &W)
     
    bool all_zero () const
    bool all_zero () const
     
    VectorBase & operator*= (const PetscScalar factor)
    VectorBase & operator*= (const PetscScalar factor)
     
    VectorBase & operator/= (const PetscScalar factor)
    VectorBase & operator/= (const PetscScalar factor)
     
    VectorBase & operator+= (const VectorBase &V)
    VectorBase & operator+= (const VectorBase &V)
     
    VectorBase & operator-= (const VectorBase &V)
    VectorBase & operator-= (const VectorBase &V)
     
    void add (const PetscScalar s)
    void add (const PetscScalar s)
     
    void add (const PetscScalar a, const VectorBase &V)
    void add (const PetscScalar a, const VectorBase &V)
     
    void add (const PetscScalar a, const VectorBase &V, const PetscScalar b, const VectorBase &W)
    void add (const PetscScalar a, const VectorBase &V, const PetscScalar b, const VectorBase &W)
     
    void sadd (const PetscScalar s, const VectorBase &V)
    void sadd (const PetscScalar s, const VectorBase &V)
     
    void sadd (const PetscScalar s, const PetscScalar a, const VectorBase &V)
    void sadd (const PetscScalar s, const PetscScalar a, const VectorBase &V)
     
    void scale (const VectorBase &scaling_factors)
    void scale (const VectorBase &scaling_factors)
     
    void equ (const PetscScalar a, const VectorBase &V)
    void equ (const PetscScalar a, const VectorBase &V)
     
    void write_ascii (const PetscViewerFormat format=PETSC_VIEWER_DEFAULT)
    void write_ascii (const PetscViewerFormat format=PETSC_VIEWER_DEFAULT)
     
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
     
    template<class Archive >
    void save (Archive &ar, const unsigned int version) const
    template<class Archive >
    void save (Archive &ar, const unsigned int version) const
     
    template<class Archive >
    void load (Archive &ar, const unsigned int version)
    template<class Archive >
    void load (Archive &ar, const unsigned int version)
     
    template<class Archive >
    void serialize (Archive &archive, const unsigned int version)
    template<class Archive >
    void serialize (Archive &archive, const unsigned int version)
     
    void swap (VectorBase &v) noexcept
    void swap (VectorBase &v) noexcept
     
     operator const Vec & () const
     operator const Vec & () const
     
    Vec & petsc_vector ()
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    MPI_Comm get_mpi_communicator () const
    MPI_Comm get_mpi_communicator () const
     
    Subscriptor functionality

    Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

    \n
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    unsigned int n_subscriptions () const
    unsigned int n_subscriptions () const
     
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
     
    void list_subscribers () const
    void list_subscribers () const
     
    \n \n-\n+\n \n-\n+\n \n

    \n Static Public Member Functions

    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
     
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
     
    \n \n-\n+\n \n \n \n

    \n Protected Member Functions

    void do_set_add_operation (const size_type n_elements, const size_type *indices, const PetscScalar *values, const bool add_values)
    void do_set_add_operation (const size_type n_elements, const size_type *indices, const PetscScalar *values, const bool add_values)
     
    void determine_ghost_indices ()
     
    \n \n \n@@ -308,50 +308,50 @@\n \n \n \n \n

    \n Protected Attributes

    Vec vector
    IndexSet ghost_indices
     
    VectorOperation::values last_action
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Types

    using map_value_type = decltype(counter_map)::value_type
    using map_value_type = decltype(counter_map)::value_type
     
    using map_iterator = decltype(counter_map)::iterator
    using map_iterator = decltype(counter_map)::iterator
     
    \n \n-\n+\n \n

    \n Private Member Functions

    void check_no_subscribers () const noexcept
    void check_no_subscribers () const noexcept
     
    \n \n \n \n \n \n \n \n-\n+\n \n

    \n Private Attributes

    std::atomic< unsigned int > counter
     
    std::map< std::string, unsigned int > counter_map
     
    std::vector< std::atomic< bool > * > validity_pointers
     
    const std::type_info * object_info
    const std::type_info * object_info
     
    \n \n-\n+\n \n

    \n Static Private Attributes

    static std::mutex mutex
    static std::mutex mutex
     
    \n \n-\n+\n \n

    \n Friends

    class internal::VectorReference
    class internal::VectorReference
     
    \n \n \n-\n+\n \n

    \n Related Symbols

    (Note that these are not member symbols.)

    \n
    void swap (VectorBase &u, VectorBase &v) noexcept
    void swap (VectorBase &u, VectorBase &v) noexcept
     
    \n

    Detailed Description

    \n

    Base class for all vector classes that are implemented on top of the PETSc vector types. Since in PETSc all vector types (i.e. sequential and parallel ones) are built by filling the contents of an abstract object that is only referenced through a pointer of a type that is independent of the actual vector type, we can implement almost all functionality of vectors in this base class. As such, this class can also be used as a deal.II-compatible wrapper for a PETSc Vec object of any type. Derived classes will then only have to provide the functionality to create one or the other kind of vector.

    \n

    The interface of this class is modeled after the existing Vector class in deal.II. It has almost the same member functions, and is often exchangeable. However, since PETSc only supports a single scalar type (either double, float, or a complex data type), it is not templated, and only works with whatever your PETSc installation has defined the data type PetscScalar to.

    \n

    Note that PETSc only guarantees that operations do what you expect if the functions VecAssemblyBegin and VecAssemblyEnd have been called after vector assembly. Therefore, you need to call Vector::compress() before you actually use the vector.

    \n \n@@ -360,15 +360,15 @@\n \n

    ◆ value_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::value_type = PetscScalarusing PETScWrappers::VectorBase::value_type = PetscScalar
    \n
    \n

    Declare some of the standard types used in all containers. These types parallel those in the C++ standard libraries vector<...> class.

    \n \n

    Definition at line 260 of file petsc_vector_base.h.

    \n \n@@ -377,15 +377,15 @@\n \n

    ◆ real_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::real_type = PetscRealusing PETScWrappers::VectorBase::real_type = PetscReal
    \n
    \n \n

    Definition at line 261 of file petsc_vector_base.h.

    \n \n
    \n@@ -393,15 +393,15 @@\n \n

    ◆ size_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::size_type = types::global_dof_indexusing PETScWrappers::VectorBase::size_type = types::global_dof_index
    \n
    \n \n

    Definition at line 262 of file petsc_vector_base.h.

    \n \n
    \n@@ -409,15 +409,15 @@\n \n

    ◆ reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::reference = internal::VectorReferenceusing PETScWrappers::VectorBase::reference = internal::VectorReference
    \n
    \n \n

    Definition at line 263 of file petsc_vector_base.h.

    \n \n
    \n@@ -425,15 +425,15 @@\n \n

    ◆ const_reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using PETScWrappers::VectorBase::const_reference = const internal::VectorReferenceusing PETScWrappers::VectorBase::const_reference = const internal::VectorReference
    \n
    \n \n

    Definition at line 264 of file petsc_vector_base.h.

    \n \n
    \n@@ -444,15 +444,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_value_type = decltype(counter_map)::value_typeusing Subscriptor::map_value_type = decltype(counter_map)::value_type
    \n     		\n privateinherited
    \n@@ -469,15 +469,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_iterator = decltype(counter_map)::iteratorusing Subscriptor::map_iterator = decltype(counter_map)::iterator
    \n     		\n privateinherited
    \n@@ -514,15 +514,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    PETScWrappers::VectorBase::VectorBase (const VectorBase & const VectorBase & v)
    \n
    \n

    Copy constructor. Sets the dimension to that of the given vector, and copies all elements.

    \n \n@@ -538,15 +538,15 @@\n \n \n \n \n@@ -623,15 +623,15 @@\n \n
    \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    PETScWrappers::VectorBase::VectorBase (const Vec & const Vec & v)
    \n     		\n explicit
    \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::compress (const VectorOperation::values const VectorOperation::values operation)
    \n
    \n

    Compress the underlying representation of the PETSc object, i.e. flush the buffers of the vector object if it has any. This function is necessary after writing into a vector element-by-element and before anything else can be done on it.

    \n

    See Compressing distributed objects for more information.

    \n@@ -643,17 +643,17 @@\n \n

    ◆ operator=() [1/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator= VectorBase & PETScWrappers::VectorBase::operator= (const VectorBase & const VectorBase & v)
    \n
    \n

    The copy assignment operator.

    \n \n@@ -664,17 +664,17 @@\n \n

    ◆ operator=() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator= VectorBase & PETScWrappers::VectorBase::operator= (const PetscScalar const PetscScalar s)
    \n
    \n

    Set all components of the vector to the given number s. Simply pass this down to the individual block objects, but we still need to declare this function to make the example given in the discussion about making the constructor explicit work.

    \n

    Since the semantics of assigning a scalar to a vector are not immediately clear, this operator should really only be used if you want to set the entire vector to zero. This allows the intuitive notation v=0. Assigning other values is deprecated and may be disallowed in the future.

    \n@@ -707,17 +707,17 @@\n \n

    ◆ operator==()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::operator== bool PETScWrappers::VectorBase::operator== (const VectorBase & const VectorBase & v) const
    \n
    \n

    Test for equality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -730,15 +730,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::operator!= (const VectorBase & const VectorBase & v) const
    \n
    \n

    Test for inequality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -822,15 +822,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool PETScWrappers::VectorBase::in_local_range (const size_type const size_type index) const
    \n
    \n

    Return whether index is in the local range or not, see also local_range().

    \n \n@@ -846,15 +846,16 @@\n
    		IndexSet PETScWrappers::VectorBase::locally_owned_elements () const
    \n
    \n-

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n+

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n+\n
    complete_index_set
    IndexSet complete_index_set(const IndexSet::size_type N)
    Definition index_set.h:1204
    \n
    \n
    \n
    \n \n

    ◆ has_ghost_elements()

    \n \n@@ -877,15 +878,15 @@\n \n

    ◆ ghost_elements()

    \n \n
    \n
    \n \n \n- \n+ \n \n \n \n \n
    const IndexSet & PETScWrappers::VectorBase::ghost_elements const IndexSet & PETScWrappers::VectorBase::ghost_elements () const
    \n
    \n

    Return the IndexSet of ghost elements.

    \n@@ -913,17 +914,17 @@\n \n

    ◆ operator()() [1/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference PETScWrappers::VectorBase::operator() reference PETScWrappers::VectorBase::operator() (const size_type const size_type index)
    \n
    \n

    Provide access to a given element, both read and write.

    \n \n@@ -932,17 +933,17 @@\n \n

    ◆ operator()() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator() PetscScalar PETScWrappers::VectorBase::operator() (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n \n@@ -951,63 +952,63 @@\n \n

    ◆ operator[]() [1/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference PETScWrappers::VectorBase::operator[] reference PETScWrappers::VectorBase::operator[] (const size_type const size_type index)
    \n
    \n

    Provide access to a given element, both read and write.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ operator[]() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator[] PetscScalar PETScWrappers::VectorBase::operator[] (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ set()

    \n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1024,15 +1025,15 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::set (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< PetscScalar > & const std::vector< PetscScalar > & values 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1040,15 +1041,15 @@\n \n \n \n \n \n
    void PETScWrappers::VectorBase::extract_subvector_to (const std::vector< size_type > & const std::vector< size_type > & indices,
    std::vector< PetscScalar > & values 
    ) const
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n

    If the current vector is called v, then this function is the equivalent to the code

    for (unsigned int i=0; i<indices.size(); ++i)
    \n
    values[i] = v[indices[i]];
    \n
    Precondition
    The sizes of the indices and values arrays must be identical.
    \n \n
    \n
    \n \n@@ -1057,17 +1058,17 @@\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@@ -1092,70 +1093,70 @@\n \n \n

    ◆ extract_subvector_to() [3/3]

    \n \n
    \n
    \n
    \n-template<typename ForwardIterator , typename OutputIterator >
    \n+template<typename ForwardIterator , typename OutputIterator >
    \n
    virtual void PETScWrappers::VectorBase::extract_subvector_to virtual void PETScWrappers::VectorBase::extract_subvector_to (const ArrayView< const types::global_dof_index > & const ArrayView< const types::global_dof_index > & indices,
    ArrayView< PetscScalar > & elements 
    \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
    void PETScWrappers::VectorBase::extract_subvector_to (const ForwardIterator const ForwardIterator indices_begin,
    const ForwardIterator const ForwardIterator indices_end,
    OutputIterator OutputIterator values_begin 
    ) const
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n-

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n-
    OutputIterator values_p = values_begin;
    \n-
    while (indices_p != indices_end)
    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n+

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n+
    OutputIterator values_p = values_begin;
    \n+
    while (indices_p != indices_end)
    \n
    {
    \n-
    *values_p = v[*indices_p];
    \n-
    ++indices_p;
    \n-
    ++values_p;
    \n+
    *values_p = v[*indices_p];
    \n+
    ++indices_p;
    \n+
    ++values_p;
    \n
    }
    \n
    Precondition
    It must be possible to write into as many memory locations starting at values_begin as there are iterators between indices_begin and indices_end.
    \n \n
    \n
    \n \n

    ◆ add() [1/6]

    \n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1172,21 +1173,21 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< PetscScalar > & const std::vector< PetscScalar > & values 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1203,27 +1204,27 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const ::Vector< PetscScalar > & const ::Vector< PetscScalar > & values 
    )
    \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@@ -1238,17 +1239,17 @@\n \n

    ◆ operator*()

    \n \n
    \n
    \n
    void PETScWrappers::VectorBase::add (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const PetscScalar * const PetscScalar * values 
    )
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    PetscScalar PETScWrappers::VectorBase::operator* PetscScalar PETScWrappers::VectorBase::operator* (const VectorBase & const VectorBase & vec) const
    \n
    \n

    Return the scalar product of two vectors. The vectors must have the same size.

    \n

    For complex valued vector, this gives \\(\\left(v^\\ast,vec\\right)\\).

    \n@@ -1343,15 +1344,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    VectorBase::real_type PETScWrappers::VectorBase::lp_norm (const real_type const real_type p) const
    \n
    \n

    \\(l_p\\)-norm of the vector. The pth root of the sum of the pth powers of the absolute values of the elements.

    \n \n@@ -1384,27 +1385,27 @@\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@@ -1443,17 +1444,17 @@\n \n

    ◆ operator*=()

    \n \n
    \n
    \n
    PetscScalar PETScWrappers::VectorBase::add_and_dot (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V,
    const VectorBase & const VectorBase & W 
    )
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator*= VectorBase & PETScWrappers::VectorBase::operator*= (const PetscScalar const PetscScalar factor)
    \n
    \n

    Multiply the entire vector by a fixed factor.

    \n \n@@ -1464,17 +1465,17 @@\n \n

    ◆ operator/=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator/= VectorBase & PETScWrappers::VectorBase::operator/= (const PetscScalar const PetscScalar factor)
    \n
    \n

    Divide the entire vector by a fixed factor.

    \n \n@@ -1485,17 +1486,17 @@\n \n

    ◆ operator+=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator+= VectorBase & PETScWrappers::VectorBase::operator+= (const VectorBase & const VectorBase & V)
    \n
    \n

    Add the given vector to the present one.

    \n \n@@ -1506,17 +1507,17 @@\n \n

    ◆ operator-=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    VectorBase & PETScWrappers::VectorBase::operator-= VectorBase & PETScWrappers::VectorBase::operator-= (const VectorBase & const VectorBase & V)
    \n
    \n

    Subtract the given vector from the present one.

    \n \n@@ -1529,15 +1530,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar s)
    \n
    \n

    Addition of s to all components. Note that s is a scalar and not a vector.

    \n \n@@ -1550,21 +1551,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1581,33 +1582,33 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \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@@ -1624,21 +1625,21 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::add (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V,
    const PetscScalar const PetscScalar b,
    const VectorBase & const VectorBase & W 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1655,27 +1656,27 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::sadd (const PetscScalar const PetscScalar s,
    const VectorBase & const VectorBase & V 
    )
    \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@@ -1692,15 +1693,15 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::sadd (const PetscScalar const PetscScalar s,
    const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \n \n \n \n- \n+ \n \n \n \n
    void PETScWrappers::VectorBase::scale (const VectorBase & const VectorBase & scaling_factors)
    \n
    \n

    Scale each element of this vector by the corresponding element in the argument. This function is mostly meant to simulate multiplication (and immediate re-assignment) by a diagonal scaling matrix.

    \n \n@@ -1713,21 +1714,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1744,16 +1745,16 @@\n \n
    \n
    \n
    void PETScWrappers::VectorBase::equ (const PetscScalar const PetscScalar a,
    const VectorBase & const VectorBase & V 
    )
    \n \n \n \n- \n- \n+ \n+ \n \n \n
    void PETScWrappers::VectorBase::write_ascii (const PetscViewerFormat format = PETSC_VIEWER_DEFAULT)const PetscViewerFormat format = PETSC_VIEWER_DEFAULT)
    \n
    \n

    Prints the PETSc vector object values using PETSc internal vector viewer function VecView. The default format prints the vector's contents, including indices of vector elements. For other valid view formats, consult http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/Vec/VecView.html

    \n \n

    Definition at line 952 of file petsc_vector_base.cc.

    \n@@ -1771,28 +1772,28 @@\n
    		(std::ostream & out,
    const unsigned int const unsigned int precision = 3,
    const bool scientific = true, const bool scientific = true,
    const bool across = true const bool across = true 
    ) const
    \n@@ -1805,26 +1806,26 @@\n
    \n \n

    ◆ save()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1837,26 +1838,26 @@\n \n \n

    ◆ load()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void PETScWrappers::VectorBase::save (Archive & Archive & ar,
    const unsigned int const unsigned int version 
    ) const
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1868,26 +1869,26 @@\n \n \n

    ◆ serialize()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void PETScWrappers::VectorBase::load (Archive & Archive & ar,
    const unsigned int const unsigned int version 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1930,15 +1931,15 @@\n \n

    ◆ operator const Vec &()

    \n \n
    \n
    \n
    void PETScWrappers::VectorBase::serialize (Archive & Archive & archive,
    const unsigned int const unsigned int version 
    )
    \n \n- \n+ \n \n \n \n \n
    PETScWrappers::VectorBase::operator const Vec & PETScWrappers::VectorBase::operator const Vec & () const
    \n
    \n

    Conversion operator to gain access to the underlying PETSc type. If you do this, you cut this class off some information it may need, so this conversion operator should only be used if you know what you do. In particular, it should only be used for read-only operations into the vector.

    \n@@ -2013,33 +2014,33 @@\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@@ -2193,15 +2194,15 @@\n \n \n

    ◆ list_subscribers() [1/2]

    \n \n
    \n
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n
    void PETScWrappers::VectorBase::do_set_add_operation (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const PetscScalar * const PetscScalar * values,
    const bool const bool add_values 
    )
    \n \n \n \n \n
    \n \n \n \n \n@@ -2288,15 +2289,15 @@\n
    \n
    \n
    void Subscriptor::list_subscribers (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    friend class internal::VectorReferencefriend class internal::VectorReference
    \n     		\n friend
    \n@@ -2530,15 +2531,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    const std::type_info* Subscriptor::object_infoconst std::type_info* Subscriptor::object_info
    \n     		\n mutableprivateinherited
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPersistentTriangulation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPersistentTriangulation.html", "unified_diff": "@@ -895,15 +895,15 @@\n
    		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -7632,15 +7632,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n
    \n
    \n \n

    ◆ CELL_REFINE

    \n@@ -7662,15 +7662,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -7692,15 +7692,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n
    \n \n \n

    ◆ CELL_INVALID

    \n@@ -7722,15 +7722,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPolarManifold.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPolarManifold.html", "unified_diff": "@@ -1409,15 +1409,15 @@\n \n \n \n \n
    const Point<spacedim> PolarManifold< dim, spacedim >::center
    \n
    \n

    The center of the spherical coordinate system.

    \n-
    Deprecated:
    Use get_center() instead.
    \n+
    Deprecated:
    Use get_center() instead.
    \n \n

    Definition at line 150 of file manifold_lib.h.

    \n \n
    \n \n \n

    ◆ p_center

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSUNDIALS_1_1KINSOL.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSUNDIALS_1_1KINSOL.html", "unified_diff": "@@ -523,16 +523,16 @@\n \n \n \n \n
    std::function<VectorType &()> SUNDIALS::KINSOL< VectorType >::get_solution_scaling
    \n
    \n

    A function object that users may supply and that is intended to return a vector whose components are the weights used by KINSOL to compute the vector norm of the solution. The implementation of this function is optional, and it is used only if implemented.

    \n-

    The intent for this scaling factor is for problems in which the different components of a solution have vastly different numerical magnitudes – typically because they have different physical units and represent different things. For example, if one were to solve a nonlinear Stokes problem, the solution vector has components that correspond to velocities and other components that correspond to pressures. These have different physical units and depending on which units one chooses, they may have roughly comparable numerical sizes or maybe they don't. To give just one example, in simulations of flow in the Earth's interior, one has velocities on the order of maybe ten centimeters per year, and pressures up to around 100 GPa. If one expresses this in SI units, this corresponds to velocities of around \\(0.000,000,003=3 \\times 10^{-9}\\) m/s, and pressures around \\(10^9 \\text{kg}/\\text{m}/\\text{s}^2\\), i.e., vastly different. In such cases, computing the \\(l_2\\) norm of a solution-type vector (e.g., the difference between the previous and the current solution) makes no sense because the norm will either be dominated by the velocity components or the pressure components. The scaling vector this function returns is intended to provide each component of the solution with a scaling factor that is generally chosen as the inverse of a \"typical velocity\" or \"typical pressure\" so that upon multiplication of a vector component by the corresponding scaling vector component, one obtains a number that is of order of magnitude of one (i.e., a reasonably small multiple of one times the typical velocity/pressure). The KINSOL manual states this as follows: \"The user should supply values \\_form#2663,\n-which are diagonal elements of the scaling matrix such that \\_form#2679 has\n+

    The intent for this scaling factor is for problems in which the different components of a solution have vastly different numerical magnitudes – typically because they have different physical units and represent different things. For example, if one were to solve a nonlinear Stokes problem, the solution vector has components that correspond to velocities and other components that correspond to pressures. These have different physical units and depending on which units one chooses, they may have roughly comparable numerical sizes or maybe they don't. To give just one example, in simulations of flow in the Earth's interior, one has velocities on the order of maybe ten centimeters per year, and pressures up to around 100 GPa. If one expresses this in SI units, this corresponds to velocities of around \\(0.000,000,003=3 \\times 10^{-9}\\) m/s, and pressures around \\(10^9 \\text{kg}/\\text{m}/\\text{s}^2\\), i.e., vastly different. In such cases, computing the \\(l_2\\) norm of a solution-type vector (e.g., the difference between the previous and the current solution) makes no sense because the norm will either be dominated by the velocity components or the pressure components. The scaling vector this function returns is intended to provide each component of the solution with a scaling factor that is generally chosen as the inverse of a \"typical velocity\" or \"typical pressure\" so that upon multiplication of a vector component by the corresponding scaling vector component, one obtains a number that is of order of magnitude of one (i.e., a reasonably small multiple of one times the typical velocity/pressure). The KINSOL manual states this as follows: \"The user should supply values \\_form#2658,\n+which are diagonal elements of the scaling matrix such that \\_form#2674 has\n all components roughly the same magnitude when \\_form#304 is close to a\n solution\".

    \n

    If no function is provided to a KINSOL object, then this is interpreted as implicitly saying that all of these scaling factors should be considered as one.

    \n
    Note
    This variable represents a user provided callback. See there for a description of how to deal with errors and other requirements and conventions. In particular, KINSOL can deal with \"recoverable\" errors in some circumstances, so callbacks can throw exceptions of type RecoverableUserCallbackError.
    \n \n

    Definition at line 651 of file kinsol.h.

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSphericalManifold.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSphericalManifold.html", "unified_diff": "@@ -1344,15 +1344,15 @@\n \n \n \n \n
    const Point<spacedim> SphericalManifold< dim, spacedim >::center
    \n
    \n

    The center of the spherical coordinate system.

    \n-
    Deprecated:
    Use get_center() instead.
    \n+
    Deprecated:
    Use get_center() instead.
    \n \n

    Definition at line 356 of file manifold_lib.h.

    \n \n
    \n \n \n

    ◆ p_center

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSymmetricTensor.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSymmetricTensor.html", "unified_diff": "@@ -592,15 +592,15 @@\n     		()
    \n
    \n

    Return a pointer to the first element of the underlying storage.

    \n-
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n \n
    \n
    \n \n

    ◆ begin_raw() [2/2]

    \n \n
    \n@@ -613,15 +613,15 @@\n
    		() const
    \n
    \n

    Return a const pointer to the first element of the underlying storage.

    \n-
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n \n
    \n \n \n

    ◆ end_raw() [1/2]

    \n \n
    \n@@ -634,15 +634,15 @@\n
    		()
    \n
    \n

    Return a pointer to the element past the end of the underlying storage.

    \n-
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n \n
    \n \n \n

    ◆ end_raw() [2/2]

    \n \n
    \n@@ -655,15 +655,15 @@\n
    		() const
    \n
    \n

    Return a const pointer to the element past the end of the underlying storage.

    \n-
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Deprecated:
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n \n
    \n
    \n \n

    ◆ operator=() [1/2]

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTriangulation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTriangulation.html", "unified_diff": "@@ -1221,15 +1221,15 @@\n \n \n \n \n
    using Triangulation< dim, spacedim >::CellStatus = ::CellStatus
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n
    \n \n

    ◆ raw_cell_iterator

    \n@@ -6847,15 +6847,15 @@\n staticconstexpr
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -6877,15 +6877,15 @@\n staticconstexpr
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -6907,15 +6907,15 @@\n staticconstexpr
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -6937,15 +6937,15 @@\n staticconstexpr
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTrilinosWrappers_1_1MPI_1_1Vector.html", "unified_diff": "@@ -125,237 +125,237 @@\n \"\"\n \"\"\n \n
    [legend]
    \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 Public Types

    using value_type = TrilinosScalar
    using value_type = TrilinosScalar
     
    using real_type = TrilinosScalar
    using real_type = TrilinosScalar
     
    using size_type = VectorTraits::size_type
    using size_type = VectorTraits::size_type
     
    using iterator = value_type *
    using iterator = value_type *
     
    using const_iterator = const value_type *
    using const_iterator = const value_type *
     
    using reference = internal::VectorReference
    using reference = internal::VectorReference
     
    using const_reference = const internal::VectorReference
    using const_reference = const internal::VectorReference
     
    \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+\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-\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 \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 Public Member Functions

    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
    template<class Archive >
    void serialize (Archive &ar, const unsigned int version)
     
    1: Basic Object-handling
     Vector ()
     
     Vector (const Vector &v)
     Vector (const Vector &v)
     
     Vector (const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD)
     Vector (const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD)
     
     Vector (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator=MPI_COMM_WORLD)
     Vector (const IndexSet &local, const IndexSet &ghost, const MPI_Comm communicator=MPI_COMM_WORLD)
     
     Vector (const IndexSet &parallel_partitioning, const Vector &v, const MPI_Comm communicator=MPI_COMM_WORLD)
     Vector (const IndexSet &parallel_partitioning, const Vector &v, const MPI_Comm communicator=MPI_COMM_WORLD)
     
    template<typename Number >
     Vector (const IndexSet &parallel_partitioning, const ::Vector< Number > &v, const MPI_Comm communicator=MPI_COMM_WORLD)
    template<typename Number >
     Vector (const IndexSet &parallel_partitioning, const ::Vector< Number > &v, const MPI_Comm communicator=MPI_COMM_WORLD)
     
     Vector (Vector &&v)
     
     ~Vector () override=default
     ~Vector () override=default
     
    void clear ()
     
    void reinit (const Vector &v, const bool omit_zeroing_entries=false, const bool allow_different_maps=false)
    void reinit (const Vector &v, const bool omit_zeroing_entries=false, const bool allow_different_maps=false)
     
    void reinit (const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const bool omit_zeroing_entries=false)
    void reinit (const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const bool omit_zeroing_entries=false)
     
    void reinit (const IndexSet &locally_owned_entries, const IndexSet &locally_relevant_or_ghost_entries, const MPI_Comm communicator=MPI_COMM_WORLD, const bool vector_writable=false)
    void reinit (const IndexSet &locally_owned_entries, const IndexSet &locally_relevant_or_ghost_entries, const MPI_Comm communicator=MPI_COMM_WORLD, const bool vector_writable=false)
     
    void reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > &partitioner, const bool make_ghosted=true, const bool vector_writable=false)
    void reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > &partitioner, const bool make_ghosted=true, const bool vector_writable=false)
     
    void reinit (const BlockVector &v, const bool import_data=false)
    void reinit (const BlockVector &v, const bool import_data=false)
     
    void compress (VectorOperation::values operation)
     
    Vector & operator= (const TrilinosScalar s)
    Vector & operator= (const TrilinosScalar s)
     
    Vector & operator= (const Vector &v)
    Vector & operator= (const Vector &v)
     
    Vector & operator= (Vector &&v) noexcept
    Vector & operator= (Vector &&v) noexcept
     
    template<typename Number >
    Vector & operator= (const ::Vector< Number > &v)
    template<typename Number >
    Vector & operator= (const ::Vector< Number > &v)
     
    void import_nonlocal_data_for_fe (const ::TrilinosWrappers::SparseMatrix &matrix, const Vector &vector)
    void import_nonlocal_data_for_fe (const ::TrilinosWrappers::SparseMatrix &matrix, const Vector &vector)
     
    void import_elements (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
    void import_elements (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
     
    void import (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
    void import (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
     
    bool operator== (const Vector &v) const
    bool operator== (const Vector &v) const
     
    bool operator!= (const Vector &v) const
    bool operator!= (const Vector &v) const
     
    size_type size () const override
    size_type size () const override
     
    size_type locally_owned_size () const
    size_type locally_owned_size () const
     
    std::pair< size_type, size_type > local_range () const
    std::pair< size_type, size_type > local_range () const
     
    bool in_local_range (const size_type index) const
    bool in_local_range (const size_type index) const
     
    IndexSet locally_owned_elements () const
    IndexSet locally_owned_elements () const
     
    bool has_ghost_elements () const
    bool has_ghost_elements () const
     
    void update_ghost_values () const
    void update_ghost_values () const
     
    TrilinosScalar operator* (const Vector &vec) const
    TrilinosScalar operator* (const Vector &vec) const
     
    real_type norm_sqr () const
    real_type norm_sqr () const
     
    TrilinosScalar mean_value () const
    TrilinosScalar mean_value () const
     
    TrilinosScalar min () const
    TrilinosScalar min () const
     
    TrilinosScalar max () const
    TrilinosScalar max () const
     
    real_type l1_norm () const
    real_type l1_norm () const
     
    real_type l2_norm () const
    real_type l2_norm () const
     
    real_type lp_norm (const TrilinosScalar p) const
    real_type lp_norm (const TrilinosScalar p) const
     
    real_type linfty_norm () const
    real_type linfty_norm () const
     
    TrilinosScalar add_and_dot (const TrilinosScalar a, const Vector &V, const Vector &W)
    TrilinosScalar add_and_dot (const TrilinosScalar a, const Vector &V, const Vector &W)
     
    bool all_zero () const
    bool all_zero () const
     
    bool is_non_negative () const
    bool is_non_negative () const
     
    2: Data-Access
    reference operator() (const size_type index)
    reference operator() (const size_type index)
     
    TrilinosScalar operator() (const size_type index) const
    TrilinosScalar operator() (const size_type index) const
     
    reference operator[] (const size_type index)
    reference operator[] (const size_type index)
     
    TrilinosScalar operator[] (const size_type index) const
    TrilinosScalar operator[] (const size_type index) const
     
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< TrilinosScalar > &values) const
    void extract_subvector_to (const std::vector< size_type > &indices, std::vector< TrilinosScalar > &values) const
     
    virtual void extract_subvector_to (const ArrayView< const size_type > &indices, ArrayView< TrilinosScalar > &elements) const override
    virtual void extract_subvector_to (const ArrayView< const size_type > &indices, ArrayView< TrilinosScalar > &elements) const override
     
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
    template<typename ForwardIterator , typename OutputIterator >
    void extract_subvector_to (ForwardIterator indices_begin, const ForwardIterator indices_end, OutputIterator values_begin) const
     
    iterator begin ()
     
    const_iterator begin () const
    const_iterator begin () const
     
    iterator end ()
     
    const_iterator end () const
    const_iterator end () const
     
    3: Modification of vectors
    void set (const std::vector< size_type > &indices, const std::vector< TrilinosScalar > &values)
    void set (const std::vector< size_type > &indices, const std::vector< TrilinosScalar > &values)
     
    void set (const std::vector< size_type > &indices, const ::Vector< TrilinosScalar > &values)
    void set (const std::vector< size_type > &indices, const ::Vector< TrilinosScalar > &values)
     
    void set (const size_type n_elements, const size_type *indices, const TrilinosScalar *values)
    void set (const size_type n_elements, const size_type *indices, const TrilinosScalar *values)
     
    void add (const std::vector< size_type > &indices, const std::vector< TrilinosScalar > &values)
    void add (const std::vector< size_type > &indices, const std::vector< TrilinosScalar > &values)
     
    void add (const std::vector< size_type > &indices, const ::Vector< TrilinosScalar > &values)
    void add (const std::vector< size_type > &indices, const ::Vector< TrilinosScalar > &values)
     
    void add (const size_type n_elements, const size_type *indices, const TrilinosScalar *values)
    void add (const size_type n_elements, const size_type *indices, const TrilinosScalar *values)
     
    Vector & operator*= (const TrilinosScalar factor)
    Vector & operator*= (const TrilinosScalar factor)
     
    Vector & operator/= (const TrilinosScalar factor)
    Vector & operator/= (const TrilinosScalar factor)
     
    Vector & operator+= (const Vector &V)
    Vector & operator+= (const Vector &V)
     
    Vector & operator-= (const Vector &V)
    Vector & operator-= (const Vector &V)
     
    void add (const TrilinosScalar s)
    void add (const TrilinosScalar s)
     
    void add (const Vector &V, const bool allow_different_maps=false)
    void add (const Vector &V, const bool allow_different_maps=false)
     
    void add (const TrilinosScalar a, const Vector &V)
    void add (const TrilinosScalar a, const Vector &V)
     
    void add (const TrilinosScalar a, const Vector &V, const TrilinosScalar b, const Vector &W)
    void add (const TrilinosScalar a, const Vector &V, const TrilinosScalar b, const Vector &W)
     
    void sadd (const TrilinosScalar s, const Vector &V)
    void sadd (const TrilinosScalar s, const Vector &V)
     
    void sadd (const TrilinosScalar s, const TrilinosScalar a, const Vector &V)
    void sadd (const TrilinosScalar s, const TrilinosScalar a, const Vector &V)
     
    void scale (const Vector &scaling_factors)
    void scale (const Vector &scaling_factors)
     
    void equ (const TrilinosScalar a, const Vector &V)
    void equ (const TrilinosScalar a, const Vector &V)
     
    4: Mixed stuff
    const Epetra_MultiVector & trilinos_vector () const
    const Epetra_MultiVector & trilinos_vector () const
     
    Epetra_FEVector & trilinos_vector ()
     
    const Epetra_BlockMap & trilinos_partitioner () const
    const Epetra_BlockMap & trilinos_partitioner () const
     
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    void print (std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
     
    void swap (Vector &v) noexcept
    void swap (Vector &v) noexcept
     
    std::size_t memory_consumption () const
    std::size_t memory_consumption () const
     
    MPI_Comm get_mpi_communicator () const
    MPI_Comm get_mpi_communicator () const
     
    Subscriptor functionality

    Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

    \n
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
    void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
     
    unsigned int n_subscriptions () const
    unsigned int n_subscriptions () const
     
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
    template<typename StreamType >
    void list_subscribers (StreamType &stream) const
     
    void list_subscribers () const
    void list_subscribers () const
     
    \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n

    \n Static Public Member Functions

    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & ExcTrilinosError (int arg1)
    static ::ExceptionBase & ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
    static ::ExceptionBase & ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
     
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
    static ::ExceptionBase & ExcInUse (int arg1, std::string arg2, std::string arg3)
     
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
    static ::ExceptionBase & ExcNoSubscriber (std::string arg1, std::string arg2)
     
    \n \n-\n+\n \n-\n+\n \n

    \n Private Types

    using map_value_type = decltype(counter_map)::value_type
    using map_value_type = decltype(counter_map)::value_type
     
    using map_iterator = decltype(counter_map)::iterator
    using map_iterator = decltype(counter_map)::iterator
     
    \n \n-\n+\n \n

    \n Private Member Functions

    void check_no_subscribers () const noexcept
    void check_no_subscribers () const noexcept
     
    \n \n \n \n \n@@ -370,54 +370,54 @@\n \n \n \n \n \n \n \n-\n+\n \n

    \n Private Attributes

    Epetra_CombineMode last_action
     
    bool compressed
     
    std::atomic< unsigned int > counter
     
    std::map< std::string, unsigned int > counter_map
     
    std::vector< std::atomic< bool > * > validity_pointers
     
    const std::type_info * object_info
    const std::type_info * object_info
     
    \n \n-\n+\n \n

    \n Static Private Attributes

    static std::mutex mutex
    static std::mutex mutex
     
    \n \n-\n+\n \n

    \n Friends

    class internal::VectorReference
    class internal::VectorReference
     
    \n \n \n-\n+\n \n

    \n Related Symbols

    (Note that these are not member symbols.)

    \n
    void swap (Vector &u, Vector &v) noexcept
    void swap (Vector &u, Vector &v) noexcept
     
    \n

    Detailed Description

    \n

    This class implements a wrapper to use the Trilinos distributed vector class Epetra_FEVector, the (parallel) partitioning of which is governed by an Epetra_Map. The Epetra_FEVector is precisely the kind of vector we deal with all the time - we probably get it from some assembly process, where also entries not locally owned might need to written and hence need to be forwarded to the owner.

    \n

    The interface of this class is modeled after the existing Vector class in deal.II. It has almost the same member functions, and is often exchangeable. However, since Trilinos only supports a single scalar type (double), it is not templated, and only works with that type.

    \n

    Note that Trilinos only guarantees that operations do what you expect if the function GlobalAssemble has been called after vector assembly in order to distribute the data. This is necessary since some processes might have accumulated data of elements that are not owned by themselves, but must be sent to the owning process. In order to avoid using the wrong data, you need to call Vector::compress() before you actually use the vectors.

    \n

    Parallel communication model

    \n

    The parallel functionality of Trilinos is built on top of the Message Passing Interface (MPI). MPI's communication model is built on collective communications: if one process wants something from another, that other process has to be willing to accept this communication. A process cannot query data from another process by calling a remote function, without that other process expecting such a transaction. The consequence is that most of the operations in the base class of this class have to be called collectively. For example, if you want to compute the l2 norm of a parallel vector, all processes across which this vector is shared have to call the l2_norm function. If you don't do this, but instead only call the l2_norm function on one process, then the following happens: This one process will call one of the collective MPI functions and wait for all the other processes to join in on this. Since the other processes don't call this function, you will either get a time-out on the first process, or, worse, by the time the next a call to a Trilinos function generates an MPI message on the other processes, you will get a cryptic message that only a subset of processes attempted a communication. These bugs can be very hard to figure out, unless you are well-acquainted with the communication model of MPI, and know which functions may generate MPI messages.

    \n

    One particular case, where an MPI message may be generated unexpectedly is discussed below.

    \n

    Accessing individual elements of a vector

    \n-

    Trilinos does of course allow read access to individual elements of a vector, but in the distributed case only to elements that are stored locally. We implement this through calls like d=vec(i). However, if you access an element outside the locally stored range, an exception is generated.

    \n-

    In contrast to read access, Trilinos (and the respective deal.II wrapper classes) allow to write (or add) to individual elements of vectors, even if they are stored on a different process. You can do this by writing into or adding to elements using the syntax vec(i)=d or vec(i)+=d, or similar operations. There is one catch, however, that may lead to very confusing error messages: Trilinos requires application programs to call the compress() function when they switch from performing a set of operations that add to elements, to performing a set of operations that write to elements. The reasoning is that all processes might accumulate addition operations to elements, even if multiple processes write to the same elements. By the time we call compress() the next time, all these additions are executed. However, if one process adds to an element, and another overwrites to it, the order of execution would yield non-deterministic behavior if we don't make sure that a synchronization with compress() happens in between.

    \n+

    Trilinos does of course allow read access to individual elements of a vector, but in the distributed case only to elements that are stored locally. We implement this through calls like d=vec(i). However, if you access an element outside the locally stored range, an exception is generated.

    \n+

    In contrast to read access, Trilinos (and the respective deal.II wrapper classes) allow to write (or add) to individual elements of vectors, even if they are stored on a different process. You can do this by writing into or adding to elements using the syntax vec(i)=d or vec(i)+=d, or similar operations. There is one catch, however, that may lead to very confusing error messages: Trilinos requires application programs to call the compress() function when they switch from performing a set of operations that add to elements, to performing a set of operations that write to elements. The reasoning is that all processes might accumulate addition operations to elements, even if multiple processes write to the same elements. By the time we call compress() the next time, all these additions are executed. However, if one process adds to an element, and another overwrites to it, the order of execution would yield non-deterministic behavior if we don't make sure that a synchronization with compress() happens in between.

    \n

    In order to make sure these calls to compress() happen at the appropriate time, the deal.II wrappers keep a state variable that store which is the presently allowed operation: additions or writes. If it encounters an operation of the opposite kind, it calls compress() and flips the state. This can sometimes lead to very confusing behavior, in code that may for example look like this:

    \n
    TrilinosWrappers::MPI::Vector vector;
    \n
    // do some write operations on the vector
    \n
    for (size_type i=0; i<vector->size(); ++i)
    \n
    vector(i) = i;
    \n
    \n
    // do some additions to vector elements, but
    \n
    // only for some elements
    \n
    for (size_type i=0; i<vector->size(); ++i)
    \n-
    if (some_condition(i) == true)
    \n+
    if (some_condition(i) == true)
    \n
    vector(i) += 1;
    \n
    \n
    // do another collective operation
    \n
    const double norm = vector->l2_norm();
    \n \n
    TrilinosWrappers::MPI::Vector::vector
    std::unique_ptr< Epetra_FEVector > vector
    Definition trilinos_vector.h:1391
    \n \n@@ -436,15 +436,15 @@\n \n

    ◆ value_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::value_type = TrilinosScalarusing TrilinosWrappers::MPI::Vector::value_type = TrilinosScalar
    \n
    \n

    Declare some of the standard types used in all containers. These types parallel those in the C standard libraries vector<...> class.

    \n \n

    Definition at line 412 of file trilinos_vector.h.

    \n \n@@ -453,15 +453,15 @@\n \n

    ◆ real_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::real_type = TrilinosScalarusing TrilinosWrappers::MPI::Vector::real_type = TrilinosScalar
    \n
    \n \n

    Definition at line 413 of file trilinos_vector.h.

    \n \n
    \n@@ -469,15 +469,15 @@\n \n

    ◆ size_type

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::size_type = VectorTraits::size_typeusing TrilinosWrappers::MPI::Vector::size_type = VectorTraits::size_type
    \n
    \n \n

    Definition at line 414 of file trilinos_vector.h.

    \n \n
    \n@@ -485,15 +485,15 @@\n \n

    ◆ iterator

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::iterator = value_type *using TrilinosWrappers::MPI::Vector::iterator = value_type *
    \n
    \n \n

    Definition at line 415 of file trilinos_vector.h.

    \n \n
    \n@@ -501,15 +501,15 @@\n \n

    ◆ const_iterator

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::const_iterator = const value_type *using TrilinosWrappers::MPI::Vector::const_iterator = const value_type *
    \n
    \n \n

    Definition at line 416 of file trilinos_vector.h.

    \n \n
    \n@@ -517,15 +517,15 @@\n \n

    ◆ reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::reference = internal::VectorReferenceusing TrilinosWrappers::MPI::Vector::reference = internal::VectorReference
    \n
    \n \n

    Definition at line 417 of file trilinos_vector.h.

    \n \n
    \n@@ -533,15 +533,15 @@\n \n

    ◆ const_reference

    \n \n
    \n
    \n \n \n- \n+ \n \n
    using TrilinosWrappers::MPI::Vector::const_reference = const internal::VectorReferenceusing TrilinosWrappers::MPI::Vector::const_reference = const internal::VectorReference
    \n
    \n \n

    Definition at line 418 of file trilinos_vector.h.

    \n \n
    \n@@ -552,15 +552,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_value_type = decltype(counter_map)::value_typeusing Subscriptor::map_value_type = decltype(counter_map)::value_type
    \n     		\n privateinherited
    \n@@ -577,15 +577,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    using Subscriptor::map_iterator = decltype(counter_map)::iteratorusing Subscriptor::map_iterator = decltype(counter_map)::iterator
    \n     		\n privateinherited
    \n@@ -622,15 +622,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    Vector< Number >::Vector (const Vector & const Vector & v)
    \n
    \n

    Copy constructor using the given vector.

    \n \n@@ -646,22 +646,22 @@\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
    Vector< Number >::Vector (const IndexSet & const IndexSet & parallel_partitioning,
    const MPI_Comm communicator = MPI_COMM_WORLD const MPI_Comm communicator = MPI_COMM_WORLD 
    )
    \n@@ -685,28 +685,28 @@\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
    Vector< Number >::Vector (const IndexSet & const IndexSet & local,
    const IndexSet & const IndexSet & ghost,
    const MPI_Comm communicator = MPI_COMM_WORLD const MPI_Comm communicator = MPI_COMM_WORLD 
    )
    \n@@ -724,28 +724,28 @@\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
    Vector< Number >::Vector (const IndexSet & const IndexSet & parallel_partitioning,
    const Vector & const Vector & v,
    const MPI_Comm communicator = MPI_COMM_WORLD const MPI_Comm communicator = MPI_COMM_WORLD 
    )
    \n@@ -760,33 +760,33 @@\n
    \n \n

    ◆ Vector() [6/7]

    \n \n
    \n
    \n
    \n-template<typename Number >
    \n+template<typename Number >
    \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
    TrilinosWrappers::MPI::Vector::Vector (const IndexSet & const IndexSet & parallel_partitioning,
    const ::Vector< Number > & const ::Vector< Number > & v,
    const MPI_Comm communicator = MPI_COMM_WORLD const MPI_Comm communicator = MPI_COMM_WORLD 
    )
    \n@@ -871,28 +871,28 @@\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
    void Vector< Number >::reinit (const Vector & const Vector & v,
    const bool omit_zeroing_entries = false, const bool omit_zeroing_entries = false,
    const bool allow_different_maps = false const bool allow_different_maps = false 
    )
    \n@@ -909,28 +909,28 @@\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
    void Vector< Number >::reinit (const IndexSet & const IndexSet & parallel_partitioning,
    const MPI_Comm communicator = MPI_COMM_WORLD, const MPI_Comm communicator = MPI_COMM_WORLD,
    const bool omit_zeroing_entries = false const bool omit_zeroing_entries = false 
    )
    \n@@ -949,34 +949,34 @@\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
    void Vector< Number >::reinit (const IndexSet & const IndexSet & locally_owned_entries,
    const IndexSet & const IndexSet & locally_relevant_or_ghost_entries,
    const MPI_Comm communicator = MPI_COMM_WORLD, const MPI_Comm communicator = MPI_COMM_WORLD,
    const bool vector_writable = false const bool vector_writable = false 
    )
    \n@@ -996,28 +996,28 @@\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
    void Vector< Number >::reinit (const std::shared_ptr< const Utilities::MPI::Partitioner > & const std::shared_ptr< const Utilities::MPI::Partitioner > & partitioner,
    const bool make_ghosted = true, const bool make_ghosted = true,
    const bool vector_writable = false const bool vector_writable = false 
    )
    \n@@ -1035,22 +1035,22 @@\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
    void Vector< Number >::reinit (const BlockVector & const BlockVector & v,
    const bool import_data = false const bool import_data = false 
    )
    \n@@ -1087,17 +1087,17 @@\n \n

    ◆ operator=() [1/4]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator= Vector & TrilinosWrappers::MPI::Vector::operator= (const TrilinosScalar const TrilinosScalar s)
    \n
    \n

    Set all components of the vector to the given number s. Simply pass this down to the base class, but we still need to declare this function to make the example given in the discussion about making the constructor explicit work. the constructor explicit work.

    \n

    Since the semantics of assigning a scalar to a vector are not immediately clear, this operator can only be used if you want to set the entire vector to zero. This allows the intuitive notation v=0.

    \n@@ -1107,17 +1107,17 @@\n \n

    ◆ operator=() [2/4]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & Vector< Number >::operator= Vector & Vector< Number >::operator= (const Vector & const Vector & v)
    \n
    \n

    Copy the given vector. Resize the present vector if necessary. In this case, also the Epetra_Map that designs the parallel partitioning is taken from the input vector.

    \n

    The semantics of this operator are complex. If the two vectors have the same size, and if either the left or right hand side vector of the assignment (i.e., either the input vector on the right hand side, or the calling vector to the left of the assignment operator) currently has ghost elements, then the left hand side vector will also have ghost values and will consequently be a read-only vector (see also the glossary entry on the issue). Otherwise, the left hand vector will be a writable vector after this operation. These semantics facilitate having a vector with ghost elements on the left hand side of the assignment, and a vector without ghost elements on the right hand side, with the resulting left hand side vector having the correct values in both its locally owned and its ghost elements.

    \n@@ -1133,15 +1133,15 @@\n
    \n
    \n \n \n \n@@ -1158,20 +1158,20 @@\n \n \n

    ◆ operator=() [4/4]

    \n \n
    \n
    \n
    \n-template<typename Number >
    \n+template<typename Number >
    \n
    \n \n \n- \n+ \n \n \n \n \n \n
    Vector & Vector< Number >::operator= Vector & Vector< Number >::operator= (Vector && v)
    \n
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator= Vector & TrilinosWrappers::MPI::Vector::operator= (const ::Vector< Number > & const ::Vector< Number > & v)
    \n
    \n

    Another copy function. This one takes a deal.II vector and copies it into a TrilinosWrapper vector. Note that since we do not provide any Epetra_map that tells about the partitioning of the vector among the MPI processes, the size of the TrilinosWrapper vector has to be the same as the size of the input vector.

    \n \n@@ -1182,21 +1182,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1213,21 +1213,21 @@\n \n
    \n
    \n
    void Vector< Number >::import_nonlocal_data_for_fe (const ::TrilinosWrappers::SparseMatrix & const ::TrilinosWrappers::SparseMatrix & matrix,
    const Vector & const Vector & vector 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1247,21 +1247,21 @@\n
    void Vector< Number >::import_elements (const LinearAlgebra::ReadWriteVector< double > & const LinearAlgebra::ReadWriteVector< double > & rwv,
    const VectorOperation::values const VectorOperation::values operation 
    )
    \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@@ -1281,17 +1281,17 @@\n \n

    ◆ operator==()

    \n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::import (const LinearAlgebra::ReadWriteVector< double > & const LinearAlgebra::ReadWriteVector< double > & rwv,
    const VectorOperation::values const VectorOperation::values operation 
    )
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    bool Vector< Number >::operator== bool Vector< Number >::operator== (const Vector & const Vector & v) const
    \n
    \n

    Test for equality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -1304,15 +1304,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool Vector< Number >::operator!= (const Vector & const Vector & v) const
    \n
    \n

    Test for inequality. This function assumes that the present vector and the one to compare with have the same size already, since comparing vectors of different sizes makes not much sense anyway.

    \n \n@@ -1390,15 +1390,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    bool TrilinosWrappers::MPI::Vector::in_local_range (const size_type const size_type index) const
    \n
    \n

    Return whether index is in the local range or not, see also local_range().

    \n
    Note
    The same limitation for the applicability of this function applies as listed in the documentation of local_range().
    \n@@ -1415,15 +1415,15 @@\n
    		IndexSet TrilinosWrappers::MPI::Vector::locally_owned_elements () const
    \n
    \n-

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n+

    Return an index set that describes which elements of this vector are owned by the current processor. Note that this index set does not include elements this vector may store locally as ghost elements but that are in fact owned by another processor. As a consequence, the index sets returned on different processors if this is a distributed vector will form disjoint sets that add up to the complete index set. Obviously, if a vector is created on only one processor, then the result would satisfy

    vec.locally_owned_elements() == complete_index_set (vec.size())
    \n
    complete_index_set
    IndexSet complete_index_set(const IndexSet::size_type N)
    Definition index_set.h:1204
    \n
    \n
    \n
    \n \n

    ◆ has_ghost_elements()

    \n \n@@ -1464,17 +1464,17 @@\n \n

    ◆ operator*()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    TrilinosScalar TrilinosWrappers::MPI::Vector::operator* TrilinosScalar TrilinosWrappers::MPI::Vector::operator* (const Vector & const Vector & vec) const
    \n
    \n

    Return the scalar (inner) product of two vectors. The vectors must have the same size.

    \n \n@@ -1593,15 +1593,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    real_type TrilinosWrappers::MPI::Vector::lp_norm (const TrilinosScalar const TrilinosScalar p) const
    \n
    \n

    \\(l_p\\)-norm of the vector. The pth root of the sum of the pth powers of the absolute values of the elements.

    \n \n@@ -1630,27 +1630,27 @@\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@@ -1707,17 +1707,17 @@\n \n

    ◆ operator()() [1/2]

    \n \n
    \n
    \n
    TrilinosScalar TrilinosWrappers::MPI::Vector::add_and_dot (const TrilinosScalar const TrilinosScalar a,
    const Vector & const Vector & V,
    const Vector & const Vector & W 
    )
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference TrilinosWrappers::MPI::Vector::operator() reference TrilinosWrappers::MPI::Vector::operator() (const size_type const size_type index)
    \n
    \n

    Provide access to a given element, both read and write.

    \n

    When using a vector distributed with MPI, this operation only makes sense for elements that are actually present on the calling processor. Otherwise, an exception is thrown.

    \n@@ -1727,17 +1727,17 @@\n \n

    ◆ operator()() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    TrilinosScalar Vector< Number >::operator() TrilinosScalar Vector< Number >::operator() (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n

    When using a vector distributed with MPI, this operation only makes sense for elements that are actually present on the calling processor. Otherwise, an exception is thrown.

    \n@@ -1749,57 +1749,57 @@\n \n

    ◆ operator[]() [1/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    reference TrilinosWrappers::MPI::Vector::operator[] reference TrilinosWrappers::MPI::Vector::operator[] (const size_type const size_type index)
    \n
    \n

    Provide access to a given element, both read and write.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ operator[]() [2/2]

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    TrilinosScalar TrilinosWrappers::MPI::Vector::operator[] TrilinosScalar TrilinosWrappers::MPI::Vector::operator[] (const size_type const size_type index) const
    \n
    \n

    Provide read-only access to an element.

    \n-

    Exactly the same as operator().

    \n+

    Exactly the same as operator().

    \n \n
    \n
    \n \n

    ◆ extract_subvector_to() [1/3]

    \n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -1807,15 +1807,15 @@\n \n \n \n \n \n
    void TrilinosWrappers::MPI::Vector::extract_subvector_to (const std::vector< size_type > & const std::vector< size_type > & indices,
    std::vector< TrilinosScalar > & values 
    ) const
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. The indices of the elements to be read are stated in the first argument, the corresponding values are returned in the second.

    \n

    If the current vector is called v, then this function is the equivalent to the code

    for (unsigned int i=0; i<indices.size(); ++i)
    \n
    values[i] = v[indices[i]];
    \n
    Precondition
    The sizes of the indices and values arrays must be identical.
    \n \n
    \n
    \n \n@@ -1824,17 +1824,17 @@\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@@ -1859,49 +1859,49 @@\n \n \n

    ◆ extract_subvector_to() [3/3]

    \n \n
    \n
    \n
    \n-template<typename ForwardIterator , typename OutputIterator >
    \n+template<typename ForwardIterator , typename OutputIterator >
    \n
    virtual void TrilinosWrappers::MPI::Vector::extract_subvector_to virtual void TrilinosWrappers::MPI::Vector::extract_subvector_to (const ArrayView< const size_type > & const ArrayView< const size_type > & indices,
    ArrayView< TrilinosScalar > & elements 
    \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
    void TrilinosWrappers::MPI::Vector::extract_subvector_to (ForwardIterator ForwardIterator indices_begin,
    const ForwardIterator const ForwardIterator indices_end,
    OutputIterator OutputIterator values_begin 
    ) const
    \n
    \n-

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n-

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n-
    OutputIterator values_p = values_begin;
    \n-
    while (indices_p != indices_end)
    \n+

    Instead of getting individual elements of a vector via operator(), this function allows getting a whole set of elements at once. In contrast to the previous function, this function obtains the indices of the elements by dereferencing all elements of the iterator range provided by the first two arguments, and puts the vector values into memory locations obtained by dereferencing a range of iterators starting at the location pointed to by the third argument.

    \n+

    If the current vector is called v, then this function is the equivalent to the code

    ForwardIterator indices_p = indices_begin;
    \n+
    OutputIterator values_p = values_begin;
    \n+
    while (indices_p != indices_end)
    \n
    {
    \n-
    *values_p = v[*indices_p];
    \n-
    ++indices_p;
    \n-
    ++values_p;
    \n+
    *values_p = v[*indices_p];
    \n+
    ++indices_p;
    \n+
    ++values_p;
    \n
    }
    \n
    Precondition
    It must be possible to write into as many memory locations starting at values_begin as there are iterators between indices_begin and indices_end.
    \n \n
    \n
    \n \n

    ◆ begin() [1/2]

    \n@@ -1980,21 +1980,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2009,21 +2009,21 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::set (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< TrilinosScalar > & const std::vector< TrilinosScalar > & values 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2038,27 +2038,27 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::set (const std::vector< size_type > & const std::vector< size_type > & indices,
    const ::Vector< TrilinosScalar > & const ::Vector< TrilinosScalar > & values 
    )
    \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@@ -2073,21 +2073,21 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::set (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const TrilinosScalar * const TrilinosScalar * values 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2102,21 +2102,21 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const std::vector< TrilinosScalar > & const std::vector< TrilinosScalar > & values 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2131,27 +2131,27 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::add (const std::vector< size_type > & const std::vector< size_type > & indices,
    const ::Vector< TrilinosScalar > & const ::Vector< TrilinosScalar > & values 
    )
    \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@@ -2164,17 +2164,17 @@\n \n

    ◆ operator*=()

    \n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::add (const size_type const size_type n_elements,
    const size_type * const size_type * indices,
    const TrilinosScalar * const TrilinosScalar * values 
    )
    \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator*= Vector & TrilinosWrappers::MPI::Vector::operator*= (const TrilinosScalar const TrilinosScalar factor)
    \n
    \n

    Multiply the entire vector by a fixed factor.

    \n \n@@ -2183,17 +2183,17 @@\n \n

    ◆ operator/=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator/= Vector & TrilinosWrappers::MPI::Vector::operator/= (const TrilinosScalar const TrilinosScalar factor)
    \n
    \n

    Divide the entire vector by a fixed factor.

    \n \n@@ -2202,17 +2202,17 @@\n \n

    ◆ operator+=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator+= Vector & TrilinosWrappers::MPI::Vector::operator+= (const Vector & const Vector & V)
    \n
    \n

    Add the given vector to the present one.

    \n \n@@ -2221,17 +2221,17 @@\n \n

    ◆ operator-=()

    \n \n
    \n
    \n \n \n- \n+ \n \n- \n+ \n \n \n \n
    Vector & TrilinosWrappers::MPI::Vector::operator-= Vector & TrilinosWrappers::MPI::Vector::operator-= (const Vector & const Vector & V)
    \n
    \n

    Subtract the given vector from the present one.

    \n \n@@ -2242,15 +2242,15 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n
    void TrilinosWrappers::MPI::Vector::add (const TrilinosScalar const TrilinosScalar s)
    \n
    \n

    Addition of s to all components. Note that s is a scalar and not a vector.

    \n \n@@ -2261,22 +2261,22 @@\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
    void Vector< Number >::add (const Vector & const Vector & V,
    const bool allow_different_maps = false const bool allow_different_maps = false 
    )
    \n@@ -2293,21 +2293,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2322,33 +2322,33 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::add (const TrilinosScalar const TrilinosScalar a,
    const Vector & const Vector & V 
    )
    \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@@ -2363,21 +2363,21 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::add (const TrilinosScalar const TrilinosScalar a,
    const Vector & const Vector & V,
    const TrilinosScalar const TrilinosScalar b,
    const Vector & const Vector & W 
    )
    \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2392,27 +2392,27 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::sadd (const TrilinosScalar const TrilinosScalar s,
    const Vector & const Vector & V 
    )
    \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@@ -2427,15 +2427,15 @@\n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::sadd (const TrilinosScalar const TrilinosScalar s,
    const TrilinosScalar const TrilinosScalar a,
    const Vector & const Vector & V 
    )
    \n \n \n \n- \n+ \n \n \n \n
    void TrilinosWrappers::MPI::Vector::scale (const Vector & const Vector & scaling_factors)
    \n
    \n

    Scale each element of this vector by the corresponding element in the argument. This function is mostly meant to simulate multiplication (and immediate re-assignment) by a diagonal scaling matrix.

    \n \n@@ -2446,21 +2446,21 @@\n \n
    \n
    \n \n \n \n \n- \n+ \n \n \n \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -2473,15 +2473,15 @@\n \n

    ◆ trilinos_vector() [1/2]

    \n \n
    \n
    \n
    void TrilinosWrappers::MPI::Vector::equ (const TrilinosScalar const TrilinosScalar a,
    const Vector & const Vector & V 
    )
    \n \n- \n+ \n \n \n \n \n
    const Epetra_MultiVector & TrilinosWrappers::MPI::Vector::trilinos_vector const Epetra_MultiVector & TrilinosWrappers::MPI::Vector::trilinos_vector () const
    \n
    \n

    Return a const reference to the underlying Trilinos Epetra_MultiVector class.

    \n@@ -2509,15 +2509,15 @@\n \n

    ◆ trilinos_partitioner()

    \n \n
    \n
    \n \n \n- \n+ \n \n \n \n \n
    const Epetra_BlockMap & TrilinosWrappers::MPI::Vector::trilinos_partitioner const Epetra_BlockMap & TrilinosWrappers::MPI::Vector::trilinos_partitioner () const
    \n
    \n

    Return a const reference to the underlying Trilinos Epetra_BlockMap that sets the parallel partitioning of the vector.

    \n@@ -2535,28 +2535,28 @@\n
    		(std::ostream & out,
    const unsigned int const unsigned int precision = 3,
    const bool scientific = true, const bool scientific = true,
    const bool across = true const bool across = true 
    ) const
    \n@@ -2744,15 +2744,15 @@\n
    \n \n

    ◆ list_subscribers() [1/2]

    \n \n
    \n
    \n
    \n-template<typename StreamType >
    \n+template<typename StreamType >
    \n \n \n \n \n
    \n \n \n \n \n@@ -2803,15 +2803,15 @@\n \n \n

    ◆ serialize()

    \n \n
    \n
    \n
    \n-template<class Archive >
    \n+template<class Archive >
    \n
    void Subscriptor::list_subscribers (
    \n \n \n \n \n
    \n \n \n \n \n@@ -2881,15 +2881,15 @@\n
    \n
    \n
    void Subscriptor::serialize (
    \n \n \n \n \n
    \n \n \n- \n+ \n \n
    friend class internal::VectorReferencefriend class internal::VectorReference
    \n     		\n friend
    \n@@ -3173,15 +3173,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n
    const std::type_info* Subscriptor::object_infoconst std::type_info* Subscriptor::object_info
    \n     		\n mutableprivateinherited
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1DistributedTriangulationBase.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1DistributedTriangulationBase.html", "unified_diff": "@@ -903,15 +903,15 @@\n
    		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -7755,15 +7755,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n
    \n
    \n \n

    ◆ CELL_REFINE

    \n@@ -7785,15 +7785,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n
    \n
    \n \n

    ◆ CELL_COARSEN

    \n@@ -7815,15 +7815,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -7845,15 +7845,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1TriangulationBase.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1TriangulationBase.html", "unified_diff": "@@ -895,15 +895,15 @@\n     		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -7701,15 +7701,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -7731,15 +7731,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -7761,15 +7761,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -7791,15 +7791,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1distributed_1_1Triangulation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1distributed_1_1Triangulation.html", "unified_diff": "@@ -992,15 +992,15 @@\n     		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -8647,15 +8647,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -8677,15 +8677,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -8707,15 +8707,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -8737,15 +8737,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1distributed_1_1Triangulation_3_011_00_01spacedim_01_4.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1distributed_1_1Triangulation_3_011_00_01spacedim_01_4.html", "unified_diff": "@@ -925,15 +925,15 @@\n     		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -8008,15 +8008,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -8038,15 +8038,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n
    \n
    \n \n

    ◆ CELL_COARSEN

    \n@@ -8068,15 +8068,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -8098,15 +8098,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1fullydistributed_1_1Triangulation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1fullydistributed_1_1Triangulation.html", "unified_diff": "@@ -935,15 +935,15 @@\n     		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -8085,15 +8085,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -8115,15 +8115,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -8145,15 +8145,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -8175,15 +8175,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1shared_1_1Triangulation.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1shared_1_1Triangulation.html", "unified_diff": "@@ -929,15 +929,15 @@\n     		\n inherited
    \n
    \n

    The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.

    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2228 of file tria.h.

    \n \n
    \n \n \n

    ◆ raw_cell_iterator

    \n@@ -8027,15 +8027,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_persist
    \n
    CellStatus::cell_will_persist
    @ cell_will_persist
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2234 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_REFINE

    \n@@ -8057,15 +8057,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_will_be_refined
    \n
    CellStatus::cell_will_be_refined
    @ cell_will_be_refined
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2241 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_COARSEN

    \n@@ -8087,15 +8087,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::children_will_be_coarsened
    \n
    CellStatus::children_will_be_coarsened
    @ children_will_be_coarsened
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2248 of file tria.h.

    \n \n \n \n \n

    ◆ CELL_INVALID

    \n@@ -8117,15 +8117,15 @@\n staticconstexprinherited
    \n
    \n Initial value:
    =
    \n
    ::CellStatus::cell_invalid
    \n
    CellStatus::cell_invalid
    @ cell_invalid
    \n-
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    Deprecated:
    This is an alias for backward compatibility. Use CellStatus directly.
    \n \n

    Definition at line 2255 of file tria.h.

    \n \n \n \n \n

    ◆ signals

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/deprecated.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/deprecated.html", "unified_diff": "@@ -109,107 +109,107 @@\n
    Member CELL_PERSIST
    \n
    Use CellStatus::cell_will_persist instead
    \n
    Member CELL_REFINE
    \n
    Use CellStatus::cell_will_be_refined instead
    \n
    Member DataOutBase::default_suffix (const OutputFormat output_format)
    \n
    Using Tecplot binary output is deprecated.
    \n
    Member DataOutBase::VtkFlags::ZlibCompressionLevel
    \n-
    Use DataOutBase::CompressionLevel instead.
    \n+
    Use DataOutBase::CompressionLevel instead.
    \n
    Member DoFHandler< dim, spacedim >::active_fe_index_type
    \n
    Use types::fe_index instead.
    \n
    Member DoFHandler< dim, spacedim >::get_active_fe_indices (std::vector< unsigned int > &active_fe_indices) const
    \n
    Use get_active_fe_indices() that returns the result vector.
    \n
    Member DoFHandler< dim, spacedim >::invalid_active_fe_index
    \n
    Use numbers::invalid_fe_index instead.
    \n
    Member DoFHandler< dim, spacedim >::invalid_fe_index
    \n
    Use numbers::invalid_fe_index instead.
    \n
    Member DoFHandler< dim, spacedim >::set_active_fe_indices (const std::vector< unsigned int > &active_fe_indices)
    \n
    Use set_active_fe_indices() with the types::fe_index datatype.
    \n
    Member DoFTools::extract_locally_active_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set)
    \n-
    Use the previous function instead.
    \n+
    Use the previous function instead.
    \n
    Member DoFTools::extract_locally_active_level_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set, const unsigned int level)
    \n-
    Use the previous function instead.
    \n+
    Use the previous function instead.
    \n
    Member DoFTools::extract_locally_relevant_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set)
    \n-
    Use the previous function instead.
    \n+
    Use the previous function instead.
    \n
    Member DoFTools::extract_locally_relevant_level_dofs (const DoFHandler< dim, spacedim > &dof_handler, const unsigned int level, IndexSet &dof_set)
    \n-
    Use the previous function instead.
    \n+
    Use the previous function instead.
    \n
    Member DoFTools::get_active_fe_indices (const DoFHandler< dim, spacedim > &dof_handler, std::vector< unsigned int > &active_fe_indices)
    \n-
    Use DoFHandler::get_active_fe_indices() that returns the result vector.
    \n-
    Member DoFTools::map_dofs_to_support_points (const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
    \n-
    Use the function that returns the std::map instead.
    \n+
    Use DoFHandler::get_active_fe_indices() that returns the result vector.
    \n
    Member DoFTools::map_dofs_to_support_points (const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
    \n-
    Use the function that returns the std::map instead.
    \n+
    Use the function that returns the std::map instead.
    \n+
    Member DoFTools::map_dofs_to_support_points (const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
    \n+
    Use the function that returns the std::map instead.
    \n
    Member FEEvaluationData< dim, Number, is_face >::get_normal_vector (const unsigned int q_point) const
    \n
    Use normal_vector() instead.
    \n
    Member FEFaceEvaluation< dim, fe_degree, n_q_points_1d, n_components_, Number, VectorizedArrayType >::integrate_scatter (const bool integrate_values, const bool integrate_gradients, VectorType &output_vector)
    \n-
    Please use the integrate_scatter() function with the EvaluationFlags argument.
    \n+
    Please use the integrate_scatter() function with the EvaluationFlags argument.
    \n
    Member FEInterfaceViews::Vector< dim, spacedim >::average_hessian (const unsigned int interface_dof_index, const unsigned int q_point) const
    \n
    Use the average_of_hessians() function instead.
    \n
    Member FEInterfaceViews::Vector< dim, spacedim >::jump_gradient (const unsigned int interface_dof_index, const unsigned int q_point) const
    \n
    Use the average_of_gradients() function instead.
    \n
    Member FEInterfaceViews::Vector< dim, spacedim >::jump_hessian (const unsigned int interface_dof_index, const unsigned int q_point) const
    \n
    Use the average_of_hessians() function instead.
    \n
    Member FEPointEvaluationBase< n_components_, dim, spacedim, Number >::real_point (const unsigned int point_index) const
    \n-
    Use the function quadrature_point() instead.
    \n+
    Use the function quadrature_point() instead.
    \n
    Member FETools::Compositing::compute_nonzero_components (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0, const bool do_tensor_product=true)
    \n-
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n
    Member FETools::Compositing::compute_restriction_is_additive_flags (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0)
    \n-
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n
    Member FETools::Compositing::multiply_dof_numbers (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0)
    \n-
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n
    Member FiniteElement< dim, spacedim >::fill_fe_face_values (const typename Triangulation< dim, spacedim >::cell_iterator &cell, const unsigned int face_no, const Quadrature< dim - 1 > &quadrature, const Mapping< dim, spacedim > &mapping, const typename Mapping< dim, spacedim >::InternalDataBase &mapping_internal, const internal::FEValuesImplementation::MappingRelatedData< dim, spacedim > &mapping_data, const InternalDataBase &fe_internal, internal::FEValuesImplementation::FiniteElementRelatedData< dim, spacedim > &output_data) const
    \n
    Use the version taking a hp::QCollection argument.
    \n
    Member FiniteElement< dim, spacedim >::get_face_data (const UpdateFlags update_flags, const Mapping< dim, spacedim > &mapping, const Quadrature< dim - 1 > &quadrature, internal::FEValuesImplementation::FiniteElementRelatedData< dim, spacedim > &output_data) const
    \n
    Use the version taking a hp::QCollection argument.
    \n
    Member GridTools::fix_up_distorted_child_cells (const typename Triangulation< dim, spacedim >::DistortedCellList &distorted_cells, Triangulation< dim, spacedim > &triangulation)
    \n
    This function predates deal.II's use of manifolds and use of cell-local transfinite interpolation to place new points and is no longer necessary. See Manifolds::get_default_points_and_weights() for more information.
    \n
    Member GridTools::rotate (const double angle, const unsigned int axis, Triangulation< dim, 3 > &triangulation)
    \n
    Use the alternative with the unit vector instead.
    \n
    Member identity
    \n-
    Use std_cxx20::type_identity instead.
    \n+
    Use std_cxx20::type_identity instead.
    \n
    Member LinearAlgebra::CUDAWrappers::Vector< Number >::import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    \n
    Use import_elements() instead.
    \n
    Member LinearAlgebra::distributed::BlockVector< Number >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    \n-
    Use import_elements() instead.
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const Vector< Number, MemorySpace2 > &src, VectorOperation::values operation)
    \n-
    Use import_elements() instead.
    \n-
    Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    \n
    Use import_elements() instead.
    \n+
    Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::EpetraWrappers::Vector::import (const ReadWriteVector< double > &V, const VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n
    Use import_elements() instead.
    \n-
    Member LinearAlgebra::ReadWriteVector< Number >::import (const EpetraWrappers::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n
    Member LinearAlgebra::ReadWriteVector< Number >::import (const CUDAWrappers::Vector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n-
    Member LinearAlgebra::ReadWriteVector< Number >::import (const TpetraWrappers::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n-
    Member LinearAlgebra::ReadWriteVector< Number >::import (const TrilinosWrappers::MPI::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n+
    Use import_elements() instead.
    \n+
    Member LinearAlgebra::ReadWriteVector< Number >::import (const EpetraWrappers::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::ReadWriteVector< Number >::import (const ::Vector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::ReadWriteVector< Number >::import (const distributed::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::ReadWriteVector< Number >::import (const PETScWrappers::MPI::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n-
    Use import_elements() instead.
    \n+
    Use import_elements() instead.
    \n+
    Member LinearAlgebra::ReadWriteVector< Number >::import (const TrilinosWrappers::MPI::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n+
    Use import_elements() instead.
    \n+
    Member LinearAlgebra::ReadWriteVector< Number >::import (const TpetraWrappers::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
    \n+
    Use import_elements() instead.
    \n
    Member LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
    \n
    Use import_elements() instead.
    \n
    Member LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
    \n
    Use Teuchos::RCP<> instead of std::shared_ptr<>.
    \n
    Member make_array_view (Tensor< rank, dim, Number > &tensor)
    \n
    This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member make_array_view (const Tensor< rank, dim, Number > &tensor)
    \n
    This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member make_array_view (SymmetricTensor< rank, dim, Number > &tensor)
    \n
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member make_array_view (const SymmetricTensor< rank, dim, Number > &tensor)
    \n
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member Mapping< dim, spacedim >::fill_fe_face_values (const typename Triangulation< dim, spacedim >::cell_iterator &cell, const unsigned int face_no, const Quadrature< dim - 1 > &quadrature, const typename Mapping< dim, spacedim >::InternalDataBase &internal_data, internal::FEValuesImplementation::MappingRelatedData< dim, spacedim > &output_data) const
    \n-
    Use the version taking a hp::QCollection argument.
    \n+
    Use the version taking a hp::QCollection argument.
    \n
    Member Mapping< dim, spacedim >::get_face_data (const UpdateFlags update_flags, const Quadrature< dim - 1 > &quadrature) const
    \n-
    Use the version taking a hp::QCollection argument.
    \n+
    Use the version taking a hp::QCollection argument.
    \n
    Member MeshWorker::integration_loop (IteratorType begin, std_cxx20::type_identity_t< IteratorType > end, DoFInfo< dim, spacedim > &dof_info, IntegrationInfoBox< dim, spacedim > &box, const LocalIntegrator< dim, spacedim > &integrator, AssemblerType &assembler, const LoopControl &lctrl=LoopControl())
    \n
    This function is deprecated, along with the LocalIntegrator class. Use the MeshWorker::loop() function directly, with three function objects that perform the cell, boundary, and interior face integration.
    \n
    Class MeshWorker::LocalIntegrator< dim, spacedim, number >
    \n
    This class is deprecated. It used to be the basis for integration via the MeshWorker::integration_loop() function, but the same functionality is available via MeshWorker::loop().
    \n
    Member MeshWorker::LocalIntegrator< dim, spacedim, number >::input_vector_names
    \n
    Because the library itself does not use this field, it is better placed in derived classes.
    \n
    Member MeshWorker::LocalIntegrator< dim, spacedim, number >::output_names
    \n@@ -231,49 +231,49 @@\n
    Member Particles::ParticleHandler< dim, spacedim >::register_load_callback_function (const bool serialization)
    \n
    Please use unpack_after_coarsening_and_refinement() or deserialize() instead. See there for further information about the purpose of this function.
    \n
    Member Particles::ParticleHandler< dim, spacedim >::register_store_callback_function ()
    \n
    Please use prepare_for_coarsening_and_refinement() or prepare_for_serialization() instead. See there for further information about the purpose of this function.
    \n
    Class PathSearch
    \n
    Use the std::filesystem facilities instead.
    \n
    Member PETScWrappers::SolverBiCG::SolverBiCG (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverBicgstab::SolverBicgstab (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverCG::SolverCG (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverCGS::SolverCGS (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverChebychev::SolverChebychev (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverCR::SolverCR (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverGMRES::SolverGMRES (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverLSQR::SolverLSQR (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverPreOnly::SolverPreOnly (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverRichardson::SolverRichardson (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverTCQMR::SolverTCQMR (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SolverTFQMR::SolverTFQMR (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::SparseDirectMUMPS::SparseDirectMUMPS (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
    \n-
    \n+
    \n
    Member PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::decide_for_coarsening_and_refinement
    \n-
    This callback is equivalent to decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead.
    \n+
    This callback is equivalent to decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead.
    \n
    Member PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::distribute
    \n-
    This callback is equivalent to update_constrained_components, but is deprecated. Use update_constrained_components instead.
    \n+
    This callback is equivalent to update_constrained_components, but is deprecated. Use update_constrained_components instead.
    \n
    Member PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::interpolate
    \n-
    This callback is equivalent to transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead.
    \n+
    This callback is equivalent to transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead.
    \n
    Member Physics::Transformations::Rotations::rotation_matrix_3d (const Point< 3, Number > &axis, const Number &angle)
    \n
    Use the variant with a Tensor as an axis.
    \n
    Member PolarManifold< dim, spacedim >::center
    \n-
    Use get_center() instead.
    \n+
    Use get_center() instead.
    \n
    Member QProjector< dim >::DataSetDescriptor::face (const ReferenceCell &reference_cell, const unsigned int face_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const unsigned int n_quadrature_points)
    \n
    Use the version of this function which takes a combined_orientation argument instead.
    \n
    Member QProjector< dim >::DataSetDescriptor::face (const ReferenceCell &reference_cell, const unsigned int face_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const hp::QCollection< dim - 1 > &quadrature)
    \n
    Use the version of this function which takes a combined_orientation argument instead.
    \n
    Member QProjector< dim >::DataSetDescriptor::subface (const ReferenceCell &reference_cell, const unsigned int face_no, const unsigned int subface_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const unsigned int n_quadrature_points, const internal::SubfaceCase< dim > ref_case=internal::SubfaceCase< dim >::case_isotropic)
    \n
    Use the version of this function which takes a combined_orientation argument instead.
    \n
    Member ReferenceCell::compute_orientation (const std::array< T, N > &vertices_0, const std::array< T, N > &vertices_1) const
    \n@@ -283,49 +283,49 @@\n
    Class SLEPcWrappers::TransformationSpectrumFolding
    \n
    Since deal.II requires PETSc 3.7 or newer this class no longer does anything.
    \n
    Member SolverGMRES< VectorType >::AdditionalData::max_n_tmp_vectors
    \n
    Use max_basis_size instead.
    \n
    Member SparsityTools::distribute_sparsity_pattern (BlockDynamicSparsityPattern &dsp, const std::vector< IndexSet > &owned_set_per_cpu, const MPI_Comm mpi_comm, const IndexSet &myrange)
    \n
    Use the distribute_sparsity_pattern() with a single index set for the present MPI process only.
    \n
    Member SphericalManifold< dim, spacedim >::center
    \n-
    Use get_center() instead.
    \n-
    Member SymmetricTensor< rank_, dim, Number >::begin_raw () const
    \n-
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Use get_center() instead.
    \n
    Member SymmetricTensor< rank_, dim, Number >::begin_raw ()
    \n+
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Member SymmetricTensor< rank_, dim, Number >::begin_raw () const
    \n
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n-
    Member SymmetricTensor< rank_, dim, Number >::end_raw () const
    \n-
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member SymmetricTensor< rank_, dim, Number >::end_raw ()
    \n+
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n+
    Member SymmetricTensor< rank_, dim, Number >::end_raw () const
    \n
    This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
    \n
    Member Tensor< rank_, dim, Number >::unroll (Vector< OtherNumber > &result) const
    \n
    Use the more general function that takes a pair of iterators instead.
    \n
    Member Triangulation< dim, spacedim >::CELL_COARSEN
    \n-
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    This is an alias for backward compatibility. Use CellStatus directly.
    \n
    Member Triangulation< dim, spacedim >::CELL_INVALID
    \n-
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    This is an alias for backward compatibility. Use CellStatus directly.
    \n
    Member Triangulation< dim, spacedim >::CELL_PERSIST
    \n-
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    This is an alias for backward compatibility. Use CellStatus directly.
    \n
    Member Triangulation< dim, spacedim >::CELL_REFINE
    \n-
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    This is an alias for backward compatibility. Use CellStatus directly.
    \n
    Member Triangulation< dim, spacedim >::CellStatus
    \n-
    This is an alias for backward compatibility. Use CellStatus directly.
    \n+
    This is an alias for backward compatibility. Use CellStatus directly.
    \n
    Member TrilinosWrappers::MPI::Vector::import (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
    \n
    Use import_elements() instead.
    \n
    Member Utilities::MPI::create_group (const MPI_Comm comm, const MPI_Group &group, const int tag, MPI_Comm *new_comm)
    \n-
    Use MPI_Comm_create_group directly
    \n+
    Use MPI_Comm_create_group directly
    \n
    Member Utilities::MPI::RemotePointEvaluation< dim, spacedim >::RemotePointEvaluation (const double tolerance, const bool enforce_unique_mapping=false, const unsigned int rtree_level=0, const std::function< std::vector< bool >()> &marked_vertices={})
    \n
    \n
    Member XDMFEntry::get_xdmf_content (const unsigned int indent_level, const ReferenceCell &reference_cell) const
    \n
    Use the other function instead.
    \n+
    Member XDMFEntry::XDMFEntry (const std::string &mesh_filename, const std::string &solution_filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim, const unsigned int spacedim)
    \n+
    Use the constructor that additionally takes a ReferenceCell.
    \n
    Member XDMFEntry::XDMFEntry (const std::string &mesh_filename, const std::string &solution_filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim)
    \n
    Use the constructor that additionally takes a ReferenceCell.
    \n
    Member XDMFEntry::XDMFEntry (const std::string &filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim)
    \n-
    Use the constructor that additionally takes a ReferenceCell.
    \n-
    Member XDMFEntry::XDMFEntry (const std::string &mesh_filename, const std::string &solution_filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim, const unsigned int spacedim)
    \n-
    Use the constructor that additionally takes a ReferenceCell.
    \n+
    Use the constructor that additionally takes a ReferenceCell.
    \n \n \n \n \n \n
    \n Generated by \"doxygen\"/ 1.9.8\n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Exceptions.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Exceptions.html", "unified_diff": "@@ -841,19 +841,19 @@\n
     
    static ::ExceptionBase & SparsityTools::ExcZOLTANNotInstalled ()
     
    static ::ExceptionBase & TrilinosWrappers::BlockSparseMatrix::ExcIncompatibleRowNumbers (int arg1, int arg2, int arg3, int arg4)
     
    static ::ExceptionBase & TrilinosWrappers::BlockSparseMatrix::ExcIncompatibleColNumbers (int arg1, int arg2, int arg3, int arg4)
     
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcVectorTypeNotCompatible ()
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcVectorTypeNotCompatible ()
     
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcTrilinosError (int arg1)
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & TrilinosWrappers::MPI::BlockVector::ExcIteratorRangeDoesNotMatchVectorSize ()
     
    static ::ExceptionBase & TrilinosWrappers::MPI::BlockVector::ExcNonMatchingBlockVectors ()
     
    static ::ExceptionBase & TrilinosWrappers::PreconditionBase::ExcNonMatchingMaps (std::string arg1)
     
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::SparsityPattern< MemorySpace >::ExcInvalidIndex (size_type arg1, size_type arg2)
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::SparsityPattern< MemorySpace >::ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::SparsityPattern< MemorySpace >::ExcAccessToNonPresentElement (size_type arg1, size_type arg2)
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcVectorTypeNotCompatible ()
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcVectorTypeNotCompatible ()
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcMissingIndexSet ()
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcMissingIndexSet ()
     
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcTrilinosError (int arg1)
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcDifferentParallelPartitioning ()
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcDifferentParallelPartitioning ()
     
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcTrilinosError (int arg1)
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcTrilinosError (int arg1)
     
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcAccessToNonLocalElement (size_type arg1, size_type arg2, size_type arg3, size_type arg4)
     
    static ::ExceptionBase & VectorMemory< VectorType >::ExcNotAllocatedHere ()
     
    static ::ExceptionBase & internal::ExcAccessToUninitializedField ()
     
    static ::ExceptionBase & internal::ExcMatrixFreeAccessToUninitializedMappingField (std::string arg1)
     
    \n     		\n static
    \n
    \n-
    Todo:
    Write description
    \n+
    Todo:
    Write description
    \n \n
    \n \n \n

    ◆ ExcGridNotCoarser()

    \n \n
    \n@@ -6489,15 +6489,15 @@\n
    \n
    		\n static
    \n
    \n-
    Todo:
    Write description
    \n+
    Todo:
    Write description
    \n \n
    \n \n \n

    ◆ ExcGridsDontMatch()

    \n \n
    \n@@ -6515,15 +6515,15 @@\n
    \n     		\n static
    \n
    \n-
    Todo:
    Write description
    \n+
    Todo:
    Write description
    \n

    Exception

    \n \n
    \n \n \n

    ◆ ExcNoFESelected() [2/2]

    \n \n@@ -6568,15 +6568,15 @@\n
    \n     		\n static
    \n
    \n-
    Todo:
    Write description
    \n+
    Todo:
    Write description
    \n \n
    \n \n \n

    ◆ ExcNoComponentSelected()

    \n \n
    \n@@ -7252,15 +7252,15 @@\n
    \n     		\n static
    \n
    \n-
    Todo:
    Document this
    \n+
    Todo:
    Document this
    \n \n
    \n \n \n

    ◆ ExcFaceHasNoSubfaces()

    \n \n
    \n@@ -7280,15 +7280,15 @@\n
    \n
    		\n static
    \n
    \n-
    Todo:
    Document this
    \n+
    Todo:
    Document this
    \n \n
    \n \n \n

    ◆ ExcAccessToUninitializedField() [1/2]

    \n \n
    \n@@ -13646,15 +13646,15 @@\n
    \n
    \n \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcDifferentParallelPartitioning static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcDifferentParallelPartitioning ()
    \n     		\n@@ -13672,15 +13672,15 @@\n
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcVectorTypeNotCompatible static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcVectorTypeNotCompatible ()
    \n     		\n@@ -13698,15 +13698,15 @@\n
    \n
    \n \n \n \n@@ -15157,21 +15157,21 @@\n \n \n

    ◆ ExcDifferentParallelPartitioning() [2/3]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    \n \n \n- \n+ \n \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcTrilinosError static ::ExceptionBase & LinearAlgebra::EpetraWrappers::Vector::ExcTrilinosError (int arg1)
    \n
    \n \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcDifferentParallelPartitioning static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcDifferentParallelPartitioning ()
    \n     		\n@@ -15185,21 +15185,21 @@\n \n \n

    ◆ ExcVectorTypeNotCompatible() [5/5]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcVectorTypeNotCompatible static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcVectorTypeNotCompatible ()
    \n     		\n@@ -15213,21 +15213,21 @@\n \n \n

    ◆ ExcAccessToNonLocalElement() [6/7]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n \n \n \n@@ -15264,21 +15264,21 @@\n \n \n

    ◆ ExcMissingIndexSet()

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcAccessToNonLocalElement static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcAccessToNonLocalElement (size_type arg1,
    \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcMissingIndexSet static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcMissingIndexSet ()
    \n     		\n@@ -15292,21 +15292,21 @@\n \n \n

    ◆ ExcTrilinosError() [9/10]

    \n \n
    \n
    \n
    \n-template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n+template<typename Number , typename MemorySpace = ::MemorySpace::Host>
    \n \n \n \n@@ -15325,15 +15325,15 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n \n \n \n \n
    static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcTrilinosError static ::ExceptionBase & LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::ExcTrilinosError (int arg1)
    \n
    \n \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcDifferentParallelPartitioning static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcDifferentParallelPartitioning ()
    \n     		\n@@ -15351,15 +15351,15 @@\n
    \n
    \n \n \n \n@@ -15378,15 +15378,15 @@\n
    \n
    \n
    \n \n \n- \n+ \n \n \n \n \n \n
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcTrilinosError static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcTrilinosError (int arg1)
    \n
    \n \n \n \n \n \n
    \n \n \n- \n+ \n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__results_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/local__results_8h_source.html", "unified_diff": "@@ -181,31 +181,31 @@\n
    136
    \n
    140 const BlockVector<number> &
    \n
    \n
    141 vector(const unsigned int i) const;
    \n
    142
    \n
    149 MatrixBlock<FullMatrix<number>> &
    \n
    \n-
    150 matrix(const unsigned int i, const bool external = false);
    \n+
    150 matrix(const unsigned int i, const bool external = false);
    \n
    151
    \n
    158 const MatrixBlock<FullMatrix<number>> &
    \n
    \n-
    159 matrix(const unsigned int i, const bool external = false) const;
    \n+
    159 matrix(const unsigned int i, const bool external = false) const;
    \n
    160
    \n
    166 Table<2, number> &
    \n
    \n
    167 quadrature_values();
    \n
    168
    \n
    172 number &
    \n
    \n-
    173 quadrature_value(const unsigned int k, const unsigned int i);
    \n+
    173 quadrature_value(const unsigned int k, const unsigned int i);
    \n
    174
    \n
    178 number
    \n
    \n-
    179 quadrature_value(const unsigned int k, const unsigned int i) const;
    \n+
    179 quadrature_value(const unsigned int k, const unsigned int i) const;
    \n
    180
    \n
    186 void
    \n
    \n
    187 initialize_numbers(const unsigned int n);
    \n
    188
    \n
    194 void
    \n
    \n@@ -225,23 +225,23 @@\n
    227 void
    \n
    \n
    228 initialize_matrices(const MGMatrixBlockVector<MatrixType> &matrices,
    \n
    229 bool both);
    \n
    230
    \n
    235 void
    \n
    \n-
    236 initialize_quadrature(const unsigned int np, const unsigned int nv);
    \n+
    236 initialize_quadrature(const unsigned int np, const unsigned int nv);
    \n
    237
    \n
    243 void
    \n-
    244 reinit(const BlockIndices &local_sizes);
    \n+
    244 reinit(const BlockIndices &local_sizes);
    \n
    245
    \n
    246 template <typename StreamType>
    \n
    247 void
    \n
    \n-
    248 print_debug(StreamType &os) const;
    \n+
    248 print_debug(StreamType &os) const;
    \n
    249
    \n
    253 std::size_t
    \n
    254 memory_consumption() const;
    \n
    255
    \n
    256 private:
    \n
    260 std::vector<number> J;
    \n
    261
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2dof__info_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/meshworker_2dof__info_8h_source.html", "unified_diff": "@@ -164,38 +164,38 @@\n
    110
    \n
    114 DoFInfo(const BlockInfo &block_info);
    \n
    115
    \n
    120 DoFInfo(const DoFHandler<dim, spacedim> &dof_handler);
    \n
    121
    \n
    125 template <class DHCellIterator>
    \n
    126 void
    \n-
    127 reinit(const DHCellIterator &c);
    \n+
    127 reinit(const DHCellIterator &c);
    \n
    128
    \n
    132 template <class DHCellIterator, class DHFaceIterator>
    \n
    133 void
    \n-
    134 reinit(const DHCellIterator &c,
    \n-
    135 const DHFaceIterator &f,
    \n-
    136 const unsigned int face_no);
    \n+
    134 reinit(const DHCellIterator &c,
    \n+
    135 const DHFaceIterator &f,
    \n+
    136 const unsigned int face_no);
    \n
    137
    \n
    141 template <class DHCellIterator, class DHFaceIterator>
    \n
    142 void
    \n-
    143 reinit(const DHCellIterator &c,
    \n-
    144 const DHFaceIterator &f,
    \n-
    145 const unsigned int face_no,
    \n-
    146 const unsigned int subface_no);
    \n+
    143 reinit(const DHCellIterator &c,
    \n+
    144 const DHFaceIterator &f,
    \n+
    145 const unsigned int face_no,
    \n+
    146 const unsigned int subface_no);
    \n
    147
    \n
    152 template <class DHFaceIterator>
    \n
    153 void
    \n-
    154 set_face(const DHFaceIterator &f, const unsigned int face_no);
    \n+
    154 set_face(const DHFaceIterator &f, const unsigned int face_no);
    \n
    155
    \n
    160 template <class DHFaceIterator>
    \n
    161 void
    \n-
    162 set_subface(const DHFaceIterator &f,
    \n-
    163 const unsigned int face_no,
    \n-
    164 const unsigned int subface_no);
    \n+
    162 set_subface(const DHFaceIterator &f,
    \n+
    163 const unsigned int face_no,
    \n+
    164 const unsigned int subface_no);
    \n
    165
    \n
    166 const BlockIndices &
    \n
    167 local_indices() const;
    \n
    168
    \n
    169
    \n
    171 SmartPointer<const BlockInfo, DoFInfo<dim, spacedim>> block_info;
    \n
    172
    \n@@ -205,15 +205,15 @@\n
    184 DoFInfo();
    \n
    185
    \n
    187 void
    \n
    188 set_block_indices();
    \n
    189
    \n
    191 template <class DHCellIterator>
    \n
    192 void
    \n-
    193 get_indices(const DHCellIterator &c);
    \n+
    193 get_indices(const DHCellIterator &c);
    \n
    194
    \n
    196 std::vector<types::global_dof_index> indices_org;
    \n
    197
    \n
    203 BlockIndices aux_local_indices;
    \n
    204
    \n
    205 friend class DoFInfoBox<dim, DoFInfo<dim, spacedim, number>>;
    \n
    206 };
    \n@@ -545,14 +545,15 @@\n
    MeshWorker::DoFInfo::face
    Triangulation< dim, spacedim >::face_iterator face
    The current face.
    Definition dof_info.h:81
    \n
    MeshWorker::DoFInfo::indices_by_block
    std::vector< std::vector< types::global_dof_index > > indices_by_block
    Definition dof_info.h:109
    \n
    MeshWorker::DoFInfo::block_info
    SmartPointer< const BlockInfo, DoFInfo< dim, spacedim > > block_info
    The block structure of the system.
    Definition dof_info.h:171
    \n
    MeshWorker::DoFInfo::face_number
    unsigned int face_number
    Definition dof_info.h:89
    \n
    MeshWorker::DoFInfo::reinit
    void reinit(const DHCellIterator &c)
    Definition dof_info.h:331
    \n
    MeshWorker::DoFInfo::cell
    Triangulation< dim, spacedim >::cell_iterator cell
    The current cell.
    Definition dof_info.h:78
    \n \n+
    MeshWorker::LocalResults::vector
    BlockVector< number > & vector(const unsigned int i)
    Definition local_results.h:440
    \n
    MeshWorker::LocalResults::reinit
    void reinit(const BlockIndices &local_sizes)
    Definition mesh_worker.cc:27
    \n \n \n \n
    DEAL_II_NAMESPACE_OPEN
    #define DEAL_II_NAMESPACE_OPEN
    Definition config.h:501
    \n
    DEAL_II_NAMESPACE_CLOSE
    #define DEAL_II_NAMESPACE_CLOSE
    Definition config.h:502
    \n
    fe_values.h
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceDoFTools.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceDoFTools.html", "unified_diff": "@@ -1390,15 +1390,15 @@\n
    \n \n \n
    static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcAccessToNonLocalElement static ::ExceptionBase & TrilinosWrappers::MPI::Vector::ExcAccessToNonLocalElement (size_type arg1,
    )
    \n
    \n

    Extract the set of global DoF indices that are active on the current DoFHandler. For regular DoFHandlers, these are all DoF indices, but for DoFHandler objects built on parallel::distributed::Triangulation this set is a superset of DoFHandler::locally_owned_dofs() and contains all DoF indices that live on all locally owned cells (including on the interface to ghost cells). However, it does not contain the DoF indices that are exclusively defined on ghost or artificial cells (see the glossary).

    \n

    The degrees of freedom identified by this function equal those obtained from the dof_indices_with_subdomain_association() function when called with the locally owned subdomain id.

    \n-
    Deprecated:
    Use the previous function instead.
    \n+
    Deprecated:
    Use the previous function instead.
    \n \n

    Definition at line 1105 of file dof_tools.cc.

    \n \n
    \n \n \n

    ◆ extract_locally_active_level_dofs() [1/2]

    \n@@ -1463,15 +1463,15 @@\n     		)
    \n
    \n

    Same function as above but for a certain (multigrid-)level. This function returns all DoF indices that live on all locally owned cells (including on the interface to ghost cells) on the given level.

    \n-
    Deprecated:
    Use the previous function instead.
    \n+
    Deprecated:
    Use the previous function instead.
    \n \n

    Definition at line 1152 of file dof_tools.cc.

    \n \n
    \n
    \n \n

    ◆ extract_locally_relevant_dofs() [1/2]

    \n@@ -1520,15 +1520,15 @@\n     		)
    \n
    \n

    Extract the set of global DoF indices that are active on the current DoFHandler. For regular DoFHandlers, these are all DoF indices, but for DoFHandler objects built on parallel::distributed::Triangulation this set is the union of DoFHandler::locally_owned_dofs() and the DoF indices on all ghost cells. In essence, it is the DoF indices on all cells that are not artificial (see the glossary).

    \n-
    Deprecated:
    Use the previous function instead.
    \n+
    Deprecated:
    Use the previous function instead.
    \n \n

    Definition at line 1202 of file dof_tools.cc.

    \n \n
    \n \n \n

    ◆ locally_owned_dofs_per_component()

    \n@@ -1674,15 +1674,15 @@\n     		)
    \n
    \n

    Same as extract_locally_relevant_dofs() but for multigrid DoFs for the given level.

    \n-
    Deprecated:
    Use the previous function instead.
    \n+
    Deprecated:
    Use the previous function instead.
    \n \n

    Definition at line 1258 of file dof_tools.cc.

    \n \n
    \n \n \n

    ◆ get_subdomain_association()

    \n@@ -2311,15 +2311,15 @@\n
    \n
    \n

    For each active cell of a DoFHandler, extract the active finite element index and fill the vector given as second argument. This vector is assumed to have as many entries as there are active cells.

    \n

    For DoFHandler objects without hp-capabilities given as first argument, the returned vector will consist of only zeros, indicating that all cells use the same finite element. In hp-mode, the values may be different, though.

    \n

    As we do not know the active FE index on artificial cells, we set them to the invalid value numbers::invalid_fe_index.

    \n-
    Deprecated:
    Use DoFHandler::get_active_fe_indices() that returns the result vector.
    \n+
    Deprecated:
    Use DoFHandler::get_active_fe_indices() that returns the result vector.
    \n \n

    Definition at line 1499 of file dof_tools.cc.

    \n \n
    \n \n \n

    ◆ count_dofs_on_patch()

    \n@@ -2652,15 +2652,15 @@\n
    )
    \n
    \n-

    A version of the function of same name that returns the map via its third argument. This function is deprecated.

    Deprecated:
    Use the function that returns the std::map instead.
    \n+

    A version of the function of same name that returns the map via its third argument. This function is deprecated.

    Deprecated:
    Use the function that returns the std::map instead.
    \n \n

    Definition at line 2430 of file dof_tools.cc.

    \n \n
    \n \n \n

    ◆ map_dofs_to_support_points() [6/6]

    \n@@ -2697,15 +2697,15 @@\n
    )
    \n
    \n-

    A version of the function of same name that returns the map via its third argument. This function is deprecated.

    Deprecated:
    Use the function that returns the std::map instead.
    \n+

    A version of the function of same name that returns the map via its third argument. This function is deprecated.

    Deprecated:
    Use the function that returns the std::map instead.
    \n \n

    Definition at line 2451 of file dof_tools.cc.

    \n \n
    \n
    \n \n

    ◆ map_support_points_to_dofs()

    \n@@ -2739,15 +2739,15 @@\n
    \n
    \n

    This is the opposite function to the one above. It generates a map where the keys are the support points of the degrees of freedom, while the values are the DoF indices. For a definition of support points, see this glossary entry.

    \n

    Since there is no natural order in the space of points (except for the 1d case), you have to provide a map with an explicitly specified comparator object. This function is therefore templatized on the comparator object. Previous content of the map object is deleted in this function.

    \n

    Just as with the function above, it is assumed that the finite element in use here actually supports the notion of support points of all its components.

    \n-
    Todo:
    This function should generate a multimap, rather than just a map, since several dofs may be located at the same support point. Currently, only the last value in the map returned by map_dofs_to_support_points() for each point will be returned.
    \n+
    Todo:
    This function should generate a multimap, rather than just a map, since several dofs may be located at the same support point. Currently, only the last value in the map returned by map_dofs_to_support_points() for each point will be returned.
    \n \n
    \n
    \n \n

    ◆ distribute_cell_to_dof_vector()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceFETools_1_1Compositing.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceFETools_1_1Compositing.html", "unified_diff": "@@ -310,15 +310,15 @@\n
    		)
    \n
    \n

    Same as above but for a specific number of sub-elements.

    \n-
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n \n
    \n
    \n \n

    ◆ compute_restriction_is_additive_flags() [1/3]

    \n \n
    \n@@ -444,15 +444,15 @@\n
    		)
    \n
    \n

    Take a FiniteElement object and return a boolean vector describing the restriction_is_additive_flags (see the documentation of the FiniteElement class) for each shape function of the mixed element consisting of N1, N2, ... copies of the sub-elements fe1, fe2, ...

    \n

    The \"restriction is additive\" flags are properties of individual shape functions that do not depend on whether the composed element uses the tensor product or combination strategy outlined in the documentation of the FETools::Composition namespace. Consequently, this function does not have a do_tensor_product argument.

    \n-
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n \n
    \n \n \n

    ◆ compute_nonzero_components() [1/3]

    \n \n
    \n@@ -592,15 +592,15 @@\n
    \n
    \n

    Compute the non-zero vector components of a composed finite element. This function is similar to the previous one, except that the pointers indicate the elements to be composed, and the arguments N1, N2, ... the multiplicities. Null pointers indicate that an argument is to be skipped.

    \n

    If do_tensor_product is true, the number of components (and thus the size of the ComponentMask objects) is the sum over the product of the number of components in each of the finite elements times the corresponding multiplicity. Otherwise the number of components is taken from the first finite element with non-zero multiplicity, and all other elements with non-zero multiplicities need to have the same number of vector components.

    \n

    See the documentation of namespace FETools::Compositing for more information about the do_tensor_product argument.

    \n-
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n+
    Deprecated:
    Use the versions of this function that take a vector of elements or an initializer list as arguments.
    \n \n
    \n \n \n

    ◆ build_cell_tables()

    \n \n
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceUtilities_1_1MPI.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/namespaceUtilities_1_1MPI.html", "unified_diff": "@@ -515,15 +515,15 @@\n
    Pavan and Hammond, Jeff R and Krishnan, Manojkumar and
    \n
    Tipparaju, Vinod and Vishnu, Abhinav},
    \n
    booktitle = {European MPI Users' Group Meeting},
    \n
    pages = {282--291},
    \n
    year = {2011},
    \n
    organization = {Springer}
    \n
    }
    \n-
    Deprecated:
    Use MPI_Comm_create_group directly
    \n+
    Deprecated:
    Use MPI_Comm_create_group directly
    \n \n

    Definition at line 164 of file mpi.cc.

    \n \n \n \n \n

    ◆ create_ascending_partitioning()

    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8cc_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__parallel__vector_8cc_source.html", "unified_diff": "@@ -143,15 +143,15 @@\n
    37
    \n
    \n
    38 Vector::Vector()
    \n
    39 {
    \n
    40 // virtual functions called in constructors and destructors never use the
    \n
    41 // override in a derived class
    \n
    42 // for clarity be explicit on which function is called
    \n-
    43 Vector::create_vector(MPI_COMM_SELF, 0, 0);
    \n+
    43 Vector::create_vector(MPI_COMM_SELF, 0, 0);
    \n
    44 }
    \n
    \n
    45
    \n
    46
    \n
    47
    \n
    \n
    48 Vector::Vector(const MPI_Comm communicator,
    \n@@ -168,21 +168,21 @@\n
    57 Vector::Vector(const IndexSet &local,
    \n
    58 const IndexSet &ghost,
    \n
    59 const MPI_Comm communicator)
    \n
    60 {
    \n
    61 Assert(local.is_ascending_and_one_to_one(communicator),
    \n
    62 ExcNotImplemented());
    \n
    63
    \n-
    64 IndexSet ghost_set = ghost;
    \n-
    65 ghost_set.subtract_set(local);
    \n+
    64 IndexSet ghost_set = ghost;
    \n+
    65 ghost_set.subtract_set(local);
    \n
    66
    \n
    67 Vector::create_vector(communicator,
    \n
    68 local.size(),
    \n
    69 local.n_elements(),
    \n-
    70 ghost_set);
    \n+
    70 ghost_set);
    \n
    71 }
    \n
    \n
    72
    \n
    73
    \n
    74
    \n
    \n
    75 Vector::Vector(const Vector &v)
    \n@@ -239,37 +239,37 @@\n
    122 else
    \n
    123 reinit(v.get_mpi_communicator(),
    \n
    124 v.size(),
    \n
    125 v.locally_owned_size(),
    \n
    126 true);
    \n
    127 }
    \n
    128
    \n-
    129 PetscErrorCode ierr = VecCopy(v.vector, vector);
    \n-
    130 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    129 PetscErrorCode ierr = VecCopy(v.vector, vector);
    \n+
    130 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    131
    \n
    132 if (has_ghost_elements())
    \n
    133 {
    \n-
    134 ierr = VecGhostUpdateBegin(vector, INSERT_VALUES, SCATTER_FORWARD);
    \n-
    135 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    136 ierr = VecGhostUpdateEnd(vector, INSERT_VALUES, SCATTER_FORWARD);
    \n-
    137 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    134 ierr = VecGhostUpdateBegin(vector, INSERT_VALUES, SCATTER_FORWARD);
    \n+
    135 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    136 ierr = VecGhostUpdateEnd(vector, INSERT_VALUES, SCATTER_FORWARD);
    \n+
    137 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    138 }
    \n
    139 return *this;
    \n
    140 }
    \n
    \n
    141
    \n
    142
    \n
    143
    \n
    144 void
    \n
    \n
    145 Vector::clear()
    \n
    146 {
    \n
    147 VectorBase::clear();
    \n
    148
    \n-
    149 create_vector(MPI_COMM_SELF, 0, 0);
    \n+
    149 create_vector(MPI_COMM_SELF, 0, 0);
    \n
    150 }
    \n
    \n
    151
    \n
    152
    \n
    153
    \n
    154 void
    \n
    \n@@ -277,41 +277,41 @@\n
    156 const size_type n,
    \n
    157 const size_type local_sz,
    \n
    158 const bool omit_zeroing_entries)
    \n
    159 {
    \n
    160 // only do something if the sizes
    \n
    161 // mismatch (may not be true for every proc)
    \n
    162
    \n-
    163 int k_global, k = ((size() != n) || (locally_owned_size() != local_sz));
    \n+
    163 int k_global, k = ((size() != n) || (locally_owned_size() != local_sz));
    \n
    164 {
    \n-
    165 const int ierr =
    \n-
    166 MPI_Allreduce(&k, &k_global, 1, MPI_INT, MPI_LOR, communicator);
    \n-
    167 AssertThrowMPI(ierr);
    \n+
    165 const int ierr =
    \n+
    166 MPI_Allreduce(&k, &k_global, 1, MPI_INT, MPI_LOR, communicator);
    \n+
    167 AssertThrowMPI(ierr);
    \n
    168 }
    \n
    169
    \n-
    170 if (k_global || has_ghost_elements())
    \n+
    170 if (k_global || has_ghost_elements())
    \n
    171 {
    \n
    172 // FIXME: I'd like to use this here,
    \n
    173 // but somehow it leads to odd errors
    \n
    174 // somewhere down the line in some of
    \n
    175 // the tests:
    \n
    176 // const PetscErrorCode ierr = VecSetSizes (vector, n, n);
    \n
    177 // AssertThrow (ierr == 0, ExcPETScError(ierr));
    \n
    178
    \n
    179 // so let's go the slow way:
    \n
    180
    \n-
    181 const PetscErrorCode ierr = VecDestroy(&vector);
    \n-
    182 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    181 const PetscErrorCode ierr = VecDestroy(&vector);
    \n+
    182 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    183
    \n-
    184 create_vector(communicator, n, local_sz);
    \n+
    184 create_vector(communicator, n, local_sz);
    \n
    185 }
    \n
    186
    \n
    187 // finally clear the new vector if so
    \n
    188 // desired
    \n-
    189 if (omit_zeroing_entries == false)
    \n+
    189 if (omit_zeroing_entries == false)
    \n
    190 *this = 0;
    \n
    191 }
    \n
    \n
    192
    \n
    193
    \n
    194
    \n
    195 void
    \n@@ -319,68 +319,68 @@\n
    196 Vector::reinit(const Vector &v, const bool omit_zeroing_entries)
    \n
    197 {
    \n
    198 if (v.has_ghost_elements())
    \n
    199 {
    \n
    200 reinit(v.locally_owned_elements(),
    \n
    201 v.ghost_indices,
    \n
    202 v.get_mpi_communicator());
    \n-
    203 if (!omit_zeroing_entries)
    \n+
    203 if (!omit_zeroing_entries)
    \n
    204 {
    \n-
    205 const PetscErrorCode ierr = VecSet(vector, 0.0);
    \n-
    206 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    205 const PetscErrorCode ierr = VecSet(vector, 0.0);
    \n+
    206 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    207 }
    \n
    208 }
    \n
    209 else
    \n
    210 reinit(v.get_mpi_communicator(),
    \n
    211 v.size(),
    \n
    212 v.locally_owned_size(),
    \n-
    213 omit_zeroing_entries);
    \n+
    213 omit_zeroing_entries);
    \n
    214 }
    \n \n
    215
    \n
    216
    \n
    217
    \n
    218 void
    \n
    \n
    219 Vector::reinit(const IndexSet &local,
    \n
    220 const IndexSet &ghost,
    \n
    221 const MPI_Comm comm)
    \n
    222 {
    \n-
    223 const PetscErrorCode ierr = VecDestroy(&vector);
    \n-
    224 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    223 const PetscErrorCode ierr = VecDestroy(&vector);
    \n+
    224 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    225
    \n
    226 Assert(local.is_ascending_and_one_to_one(comm), ExcNotImplemented());
    \n
    227
    \n-
    228 IndexSet ghost_set = ghost;
    \n-
    229 ghost_set.subtract_set(local);
    \n+
    228 IndexSet ghost_set = ghost;
    \n+
    229 ghost_set.subtract_set(local);
    \n
    230
    \n-
    231 create_vector(comm, local.size(), local.n_elements(), ghost_set);
    \n+
    231 create_vector(comm, local.size(), local.n_elements(), ghost_set);
    \n
    232 }
    \n
    \n
    233
    \n
    234 void
    \n
    \n
    235 Vector::reinit(const IndexSet &local, const MPI_Comm comm)
    \n
    236 {
    \n-
    237 const PetscErrorCode ierr = VecDestroy(&vector);
    \n-
    238 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    237 const PetscErrorCode ierr = VecDestroy(&vector);
    \n+
    238 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    239
    \n
    240 Assert(local.is_ascending_and_one_to_one(comm), ExcNotImplemented());
    \n
    241 Assert(local.size() > 0, ExcMessage("can not create vector of size 0."));
    \n
    242 create_vector(comm, local.size(), local.n_elements());
    \n
    243 }
    \n
    \n
    244
    \n
    245 void
    \n
    \n
    246 Vector::reinit(
    \n
    247 const std::shared_ptr<const Utilities::MPI::Partitioner> &partitioner,
    \n
    248 const bool make_ghosted)
    \n
    249 {
    \n-
    250 if (make_ghosted)
    \n+
    250 if (make_ghosted)
    \n
    251 {
    \n
    252 Assert(partitioner->ghost_indices_initialized(),
    \n
    253 ExcMessage("You asked to create a ghosted vector, but the "
    \n
    254 "partitioner does not provide ghost indices."));
    \n
    255
    \n
    256 this->reinit(partitioner->locally_owned_range(),
    \n
    257 partitioner->ghost_indices(),
    \n@@ -401,19 +401,19 @@\n
    270 const size_type n,
    \n
    271 const size_type locally_owned_size)
    \n
    272 {
    \n
    273 (void)n;
    \n
    274 AssertIndexRange(locally_owned_size, n + 1);
    \n
    275 ghosted = false;
    \n
    276
    \n-
    277 const PetscErrorCode ierr = VecCreateMPI(communicator,
    \n+
    277 const PetscErrorCode ierr = VecCreateMPI(communicator,
    \n
    278 locally_owned_size,
    \n-
    279 PETSC_DETERMINE,
    \n+
    279 PETSC_DETERMINE,
    \n
    280 &vector);
    \n-
    281 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    281 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    282
    \n
    283 Assert(size() == n, ExcDimensionMismatch(size(), n));
    \n
    284 }
    \n
    \n
    285
    \n
    286
    \n
    287
    \n@@ -423,74 +423,74 @@\n
    290 const size_type n,
    \n
    291 const size_type locally_owned_size,
    \n
    292 const IndexSet &ghostnodes)
    \n
    293 {
    \n
    294 (void)n;
    \n
    295 AssertIndexRange(locally_owned_size, n + 1);
    \n
    296 ghosted = true;
    \n-
    297 ghost_indices = ghostnodes;
    \n+
    297 ghost_indices = ghostnodes;
    \n
    298
    \n-
    299 const std::vector<size_type> ghostindices = ghostnodes.get_index_vector();
    \n+
    299 const std::vector<size_type> ghostindices = ghostnodes.get_index_vector();
    \n
    300
    \n
    301 const PetscInt *ptr =
    \n-
    302 (ghostindices.size() > 0 ?
    \n-
    303 reinterpret_cast<const PetscInt *>(ghostindices.data()) :
    \n+
    302 (ghostindices.size() > 0 ?
    \n+
    303 reinterpret_cast<const PetscInt *>(ghostindices.data()) :
    \n
    304 nullptr);
    \n
    305
    \n-
    306 PetscErrorCode ierr = VecCreateGhost(communicator,
    \n+
    306 PetscErrorCode ierr = VecCreateGhost(communicator,
    \n
    307 locally_owned_size,
    \n-
    308 PETSC_DETERMINE,
    \n-
    309 ghostindices.size(),
    \n+
    308 PETSC_DETERMINE,
    \n+
    309 ghostindices.size(),
    \n
    310 ptr,
    \n
    311 &vector);
    \n-
    312 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    312 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    313
    \n
    314 Assert(size() == n, ExcDimensionMismatch(size(), n));
    \n
    315
    \n
    316# ifdef DEBUG
    \n
    317 {
    \n
    318 // test ghost allocation in debug mode
    \n
    319 PetscInt begin, end;
    \n
    320
    \n-
    321 ierr = VecGetOwnershipRange(vector, &begin, &end);
    \n-
    322 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    321 ierr = VecGetOwnershipRange(vector, &begin, &end);
    \n+
    322 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    323
    \n
    324 AssertDimension(locally_owned_size,
    \n
    325 static_cast<size_type>(end - begin));
    \n
    326
    \n
    327 Vec l;
    \n-
    328 ierr = VecGhostGetLocalForm(vector, &l);
    \n-
    329 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    328 ierr = VecGhostGetLocalForm(vector, &l);
    \n+
    329 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    330
    \n-
    331 PetscInt lsize;
    \n-
    332 ierr = VecGetSize(l, &lsize);
    \n-
    333 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    331 PetscInt lsize;
    \n+
    332 ierr = VecGetSize(l, &lsize);
    \n+
    333 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    334
    \n-
    335 ierr = VecGhostRestoreLocalForm(vector, &l);
    \n-
    336 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    335 ierr = VecGhostRestoreLocalForm(vector, &l);
    \n+
    336 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    337
    \n-
    338 AssertDimension(lsize,
    \n+
    338 AssertDimension(lsize,
    \n
    339 end - begin +
    \n
    340 static_cast<PetscInt>(ghost_indices.n_elements()));
    \n
    341 }
    \n
    342# endif
    \n
    343 }
    \n \n
    344
    \n
    345
    \n
    346
    \n
    347 bool
    \n
    \n
    348 Vector::all_zero() const
    \n
    349 {
    \n-
    350 unsigned int has_nonzero = VectorBase::all_zero() ? 0 : 1;
    \n+
    350 unsigned int has_nonzero = VectorBase::all_zero() ? 0 : 1;
    \n
    351 // in parallel, check that the vector
    \n
    352 // is zero on _all_ processors.
    \n-
    353 unsigned int num_nonzero =
    \n-
    354 Utilities::MPI::sum(has_nonzero, this->get_mpi_communicator());
    \n+
    353 unsigned int num_nonzero =
    \n+
    354 Utilities::MPI::sum(has_nonzero, this->get_mpi_communicator());
    \n
    355 return num_nonzero == 0;
    \n
    356 }
    \n
    \n
    357
    \n
    358
    \n
    359 void
    \n
    \n@@ -500,28 +500,28 @@\n
    363 const bool across) const
    \n
    364 {
    \n
    365 AssertThrow(out.fail() == false, ExcIO());
    \n
    366
    \n
    367 // get a representation of the vector and
    \n
    368 // loop over all the elements
    \n
    369 const PetscScalar *val;
    \n-
    370 PetscInt nlocal, istart, iend;
    \n+
    370 PetscInt nlocal, istart, iend;
    \n
    371
    \n-
    372 PetscErrorCode ierr = VecGetArrayRead(vector, &val);
    \n-
    373 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    372 PetscErrorCode ierr = VecGetArrayRead(vector, &val);
    \n+
    373 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    374
    \n-
    375 ierr = VecGetLocalSize(vector, &nlocal);
    \n-
    376 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    375 ierr = VecGetLocalSize(vector, &nlocal);
    \n+
    376 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    377
    \n-
    378 ierr = VecGetOwnershipRange(vector, &istart, &iend);
    \n-
    379 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    378 ierr = VecGetOwnershipRange(vector, &istart, &iend);
    \n+
    379 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    380
    \n
    381 // save the state of out stream
    \n-
    382 std::ios::fmtflags old_flags = out.flags();
    \n-
    383 unsigned int old_precision = out.precision(precision);
    \n+
    382 std::ios::fmtflags old_flags = out.flags();
    \n+
    383 unsigned int old_precision = out.precision(precision);
    \n
    384
    \n
    385 out.precision(precision);
    \n
    386 if (scientific)
    \n
    387 out.setf(std::ios::scientific, std::ios::floatfield);
    \n
    388 else
    \n
    389 out.setf(std::ios::fixed, std::ios::floatfield);
    \n
    390
    \n@@ -531,44 +531,44 @@\n
    394 // matrix this way on a regular basis for production runs, so
    \n
    395 // the slowness of the barrier doesn't matter
    \n
    396 MPI_Comm communicator = this->get_mpi_communicator();
    \n
    397 for (unsigned int i = 0;
    \n
    398 i < Utilities::MPI::n_mpi_processes(communicator);
    \n
    399 i++)
    \n
    400 {
    \n-
    401 const int mpi_ierr = MPI_Barrier(communicator);
    \n-
    402 AssertThrowMPI(mpi_ierr);
    \n+
    401 const int mpi_ierr = MPI_Barrier(communicator);
    \n+
    402 AssertThrowMPI(mpi_ierr);
    \n
    403
    \n
    404 if (i == Utilities::MPI::this_mpi_process(communicator))
    \n
    405 {
    \n-
    406 if (across)
    \n+
    406 if (across)
    \n
    407 {
    \n-
    408 out << "[Proc" << i << " " << istart << "-" << iend - 1 << "]"
    \n+
    408 out << "[Proc" << i << " " << istart << "-" << iend - 1 << "]"
    \n
    409 << ' ';
    \n-
    410 for (PetscInt i = 0; i < nlocal; ++i)
    \n+
    410 for (PetscInt i = 0; i < nlocal; ++i)
    \n
    411 out << val[i] << ' ';
    \n
    412 }
    \n
    413 else
    \n
    414 {
    \n-
    415 out << "[Proc " << i << " " << istart << "-" << iend - 1
    \n+
    415 out << "[Proc " << i << " " << istart << "-" << iend - 1
    \n
    416 << "]" << std::endl;
    \n-
    417 for (PetscInt i = 0; i < nlocal; ++i)
    \n+
    417 for (PetscInt i = 0; i < nlocal; ++i)
    \n
    418 out << val[i] << std::endl;
    \n
    419 }
    \n
    420 out << std::endl;
    \n
    421 }
    \n
    422 }
    \n
    423 // reset output format
    \n-
    424 out.flags(old_flags);
    \n-
    425 out.precision(old_precision);
    \n+
    424 out.flags(old_flags);
    \n+
    425 out.precision(old_precision);
    \n
    426
    \n
    427 // restore the representation of the
    \n
    428 // vector
    \n-
    429 ierr = VecRestoreArrayRead(vector, &val);
    \n-
    430 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    429 ierr = VecRestoreArrayRead(vector, &val);
    \n+
    430 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    431
    \n
    432 AssertThrow(out.fail() == false, ExcIO());
    \n
    433 }
    \n
    \n
    434
    \n
    435 } // namespace MPI
    \n
    436
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector_8h_source.html", "unified_diff": "@@ -185,37 +185,37 @@\n
    314
    \n
    315 using VectorBase::reinit;
    \n
    316
    \n
    333 void
    \n
    334 reinit(const MPI_Comm communicator,
    \n
    335 const size_type N,
    \n
    336 const size_type locally_owned_size,
    \n-
    337 const bool omit_zeroing_entries = false);
    \n+
    337 const bool omit_zeroing_entries = false);
    \n
    338
    \n
    348 void
    \n-
    349 reinit(const Vector &v, const bool omit_zeroing_entries = false);
    \n+
    349 reinit(const Vector &v, const bool omit_zeroing_entries = false);
    \n
    350
    \n
    358 void
    \n
    359 reinit(const IndexSet &local,
    \n
    360 const IndexSet &ghost,
    \n
    361 const MPI_Comm communicator);
    \n
    362
    \n
    370 void
    \n
    371 reinit(const IndexSet &local, const MPI_Comm communicator);
    \n
    372
    \n
    380 void
    \n
    381 reinit(
    \n
    382 const std::shared_ptr<const Utilities::MPI::Partitioner> &partitioner,
    \n-
    383 const bool make_ghosted = true);
    \n+
    383 const bool make_ghosted = true);
    \n
    384
    \n
    396 void
    \n
    397 print(std::ostream &out,
    \n
    398 const unsigned int precision = 3,
    \n
    399 const bool scientific = true,
    \n-
    400 const bool across = true) const;
    \n+
    400 const bool across = true) const;
    \n
    401
    \n
    408 bool
    \n
    409 all_zero() const;
    \n
    410
    \n
    411 protected:
    \n
    418 virtual void
    \n
    419 create_vector(const MPI_Comm comm,
    \n@@ -224,15 +224,15 @@\n
    422
    \n
    423
    \n
    424
    \n
    430 virtual void
    \n
    431 create_vector(const MPI_Comm comm,
    \n
    432 const size_type n,
    \n
    433 const size_type locally_owned_size,
    \n-
    434 const IndexSet &ghostnodes);
    \n+
    434 const IndexSet &ghostnodes);
    \n
    435 };
    \n \n
    436
    \n
    437
    \n
    438 // ------------------ template and inline functions -------------
    \n
    439
    \n
    440
    \n@@ -381,14 +381,15 @@\n
    PETScWrappers::MPI::Vector::create_vector
    virtual void create_vector(const MPI_Comm comm, const size_type n, const size_type locally_owned_size)
    Definition petsc_parallel_vector.cc:269
    \n
    PETScWrappers::MPI::Vector::operator=
    Vector & operator=(const PetscScalar s)
    \n \n
    PETScWrappers::MPI::Vector::reinit
    void reinit(const MPI_Comm communicator, const size_type N, const size_type locally_owned_size, const bool omit_zeroing_entries=false)
    Definition petsc_parallel_vector.cc:155
    \n
    PETScWrappers::MPI::Vector::Vector
    Vector(const MPI_Comm communicator, const ::Vector< Number > &v, const size_type locally_owned_size)
    \n
    PETScWrappers::MPI::Vector::swap
    void swap(Vector &u, Vector &v)
    Definition petsc_vector.h:449
    \n \n+\n \n
    PETScWrappers::VectorBase::compress
    void compress(const VectorOperation::values operation)
    Definition petsc_vector_base.cc:540
    \n \n
    PETScWrappers::VectorBase::locally_owned_size
    size_type locally_owned_size() const
    Definition petsc_vector_base.cc:439
    \n
    PETScWrappers::VectorBase::operator=
    VectorBase & operator=(const VectorBase &)
    Definition petsc_vector_base.cc:358
    \n
    PETScWrappers::VectorBase::size
    size_type size() const override
    Definition petsc_vector_base.cc:427
    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8cc_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8cc_source.html", "unified_diff": "@@ -240,63 +240,63 @@\n
    \n
    130 VectorBase::VectorBase(const VectorBase &v)
    \n
    131 : Subscriptor()
    \n
    132 , ghosted(v.ghosted)
    \n
    133 , ghost_indices(v.ghost_indices)
    \n
    134 , last_action(VectorOperation::unknown)
    \n
    135 {
    \n-
    136 PetscErrorCode ierr = VecDuplicate(v.vector, &vector);
    \n-
    137 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    136 PetscErrorCode ierr = VecDuplicate(v.vector, &vector);
    \n+
    137 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    138
    \n-
    139 ierr = VecCopy(v.vector, vector);
    \n-
    140 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    139 ierr = VecCopy(v.vector, vector);
    \n+
    140 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    141 }
    \n
    \n
    142
    \n
    143
    \n
    144
    \n
    \n
    145 VectorBase::VectorBase(const Vec &v)
    \n
    146 : Subscriptor()
    \n
    147 , vector(v)
    \n
    148 , ghosted(false)
    \n
    149 , last_action(VectorOperation::unknown)
    \n
    150 {
    \n-
    151 const PetscErrorCode ierr =
    \n-
    152 PetscObjectReference(reinterpret_cast<PetscObject>(vector));
    \n-
    153 AssertNothrow(ierr == 0, ExcPETScError(ierr));
    \n-
    154 (void)ierr;
    \n+
    151 const PetscErrorCode ierr =
    \n+
    152 PetscObjectReference(reinterpret_cast<PetscObject>(vector));
    \n+
    153 AssertNothrow(ierr == 0, ExcPETScError(ierr));
    \n+
    154 (void)ierr;
    \n
    155 this->determine_ghost_indices();
    \n
    156 }
    \n
    \n
    157
    \n
    158
    \n
    159
    \n
    \n
    160 VectorBase::~VectorBase()
    \n
    161 {
    \n-
    162 const PetscErrorCode ierr = VecDestroy(&vector);
    \n-
    163 AssertNothrow(ierr == 0, ExcPETScError(ierr));
    \n-
    164 (void)ierr;
    \n+
    162 const PetscErrorCode ierr = VecDestroy(&vector);
    \n+
    163 AssertNothrow(ierr == 0, ExcPETScError(ierr));
    \n+
    164 (void)ierr;
    \n
    165 }
    \n
    \n
    166
    \n
    167
    \n
    168
    \n
    169 void
    \n
    \n
    170 VectorBase::reinit(Vec v)
    \n
    171 {
    \n
    172 AssertThrow(last_action == VectorOperation::unknown,
    \n
    173 ExcMessage("Cannot assign a new Vec"));
    \n-
    174 PetscErrorCode ierr =
    \n-
    175 PetscObjectReference(reinterpret_cast<PetscObject>(v));
    \n-
    176 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    177 ierr = VecDestroy(&vector);
    \n-
    178 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    174 PetscErrorCode ierr =
    \n+
    175 PetscObjectReference(reinterpret_cast<PetscObject>(v));
    \n+
    176 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    177 ierr = VecDestroy(&vector);
    \n+
    178 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    179 vector = v;
    \n
    180 this->determine_ghost_indices();
    \n
    181 }
    \n
    \n
    182
    \n
    183
    \n
    184
    \n@@ -364,116 +364,116 @@\n
    245 ghosted = false;
    \n
    246 ghost_indices.clear();
    \n
    247
    \n
    248 // There's no API to infer ghost indices from a PETSc Vec which
    \n
    249 // unfortunately doesn't allow integer entries. We use the
    \n
    250 // "ConvertingIterator" class above to do an implicit conversion when
    \n
    251 // sorting and adding ghost indices below.
    \n-
    252 PetscErrorCode ierr;
    \n-
    253 Vec ghosted_vec;
    \n-
    254 ierr = VecGhostGetLocalForm(vector, &ghosted_vec);
    \n-
    255 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    256 if (ghosted_vec && ghosted_vec != vector)
    \n+
    252 PetscErrorCode ierr;
    \n+
    253 Vec ghosted_vec;
    \n+
    254 ierr = VecGhostGetLocalForm(vector, &ghosted_vec);
    \n+
    255 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    256 if (ghosted_vec && ghosted_vec != vector)
    \n
    257 {
    \n-
    258 Vec tvector;
    \n+
    258 Vec tvector;
    \n
    259 PetscScalar *array;
    \n-
    260 PetscInt ghost_start_index, end_index, n_elements_stored_locally;
    \n+
    260 PetscInt ghost_start_index, end_index, n_elements_stored_locally;
    \n
    261
    \n-
    262 ierr = VecGhostRestoreLocalForm(vector, &ghosted_vec);
    \n-
    263 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    262 ierr = VecGhostRestoreLocalForm(vector, &ghosted_vec);
    \n+
    263 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    264
    \n-
    265 ierr = VecGetOwnershipRange(vector, &ghost_start_index, &end_index);
    \n-
    266 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    267 ierr = VecDuplicate(vector, &tvector);
    \n-
    268 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    269 ierr = VecGetArray(tvector, &array);
    \n+
    265 ierr = VecGetOwnershipRange(vector, &ghost_start_index, &end_index);
    \n+
    266 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    267 ierr = VecDuplicate(vector, &tvector);
    \n+
    268 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    269 ierr = VecGetArray(tvector, &array);
    \n
    \n-
    270 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    270 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    271
    \n
    272 // Store the indices we care about in the vector, so that we can then
    \n
    273 // exchange this information between processes. It is unfortunate that
    \n
    274 // we have to store integers in floating point numbers. Let's at least
    \n
    275 // make sure we do that in a way that ensures that when we get these
    \n
    \n
    276 // numbers back as integers later on, we get the same thing.
    \n-
    277 for (PetscInt i = 0; i < end_index - ghost_start_index; i++)
    \n+
    277 for (PetscInt i = 0; i < end_index - ghost_start_index; i++)
    \n
    278 {
    \n
    279 Assert(static_cast<PetscInt>(std::real(static_cast<PetscScalar>(
    \n-
    280 ghost_start_index + i))) == (ghost_start_index + i),
    \n+
    280 ghost_start_index + i))) == (ghost_start_index + i),
    \n
    281 ExcInternalError());
    \n
    \n-
    282 array[i] = ghost_start_index + i;
    \n+
    282 array[i] = ghost_start_index + i;
    \n
    283 }
    \n
    284
    \n-
    285 ierr = VecRestoreArray(tvector, &array);
    \n-
    286 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    287 ierr = VecGhostUpdateBegin(tvector, INSERT_VALUES, SCATTER_FORWARD);
    \n-
    288 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    289 ierr = VecGhostUpdateEnd(tvector, INSERT_VALUES, SCATTER_FORWARD);
    \n-
    290 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    291 ierr = VecGhostGetLocalForm(tvector, &ghosted_vec);
    \n-
    292 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    293 ierr = VecGetLocalSize(ghosted_vec, &n_elements_stored_locally);
    \n-
    294 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    295 ierr = VecGetArrayRead(ghosted_vec, (const PetscScalar **)&array);
    \n-
    296 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    285 ierr = VecRestoreArray(tvector, &array);
    \n+
    286 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    287 ierr = VecGhostUpdateBegin(tvector, INSERT_VALUES, SCATTER_FORWARD);
    \n+
    288 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    289 ierr = VecGhostUpdateEnd(tvector, INSERT_VALUES, SCATTER_FORWARD);
    \n+
    290 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    291 ierr = VecGhostGetLocalForm(tvector, &ghosted_vec);
    \n+
    292 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    293 ierr = VecGetLocalSize(ghosted_vec, &n_elements_stored_locally);
    \n+
    294 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    295 ierr = VecGetArrayRead(ghosted_vec, (const PetscScalar **)&array);
    \n+
    296 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    297
    \n
    298 // Populate the 'ghosted' flag and the ghost_indices variable. The
    \n
    299 // latter is an index set that is most efficiently filled by
    \n
    300 // sorting the indices to add. At the same time, we don't want to
    \n
    301 // sort the indices stored in a PETSc-owned array; so if the array
    \n
    302 // is already sorted, pass that to the IndexSet variable, and if
    \n
    303 // not then copy the indices, sort them, and then add those.
    \n
    304 ghosted = true;
    \n
    305 ghost_indices.set_size(this->size());
    \n
    306
    \n-
    307 ConvertingIterator<PetscScalar *, types::global_dof_index> begin_ghosts(
    \n-
    308 &array[end_index - ghost_start_index]);
    \n-
    309 ConvertingIterator<PetscScalar *, types::global_dof_index> end_ghosts(
    \n-
    310 &array[n_elements_stored_locally]);
    \n-
    311 if (std::is_sorted(&array[end_index - ghost_start_index],
    \n-
    312 &array[n_elements_stored_locally],
    \n+
    307 ConvertingIterator<PetscScalar *, types::global_dof_index> begin_ghosts(
    \n+
    308 &array[end_index - ghost_start_index]);
    \n+
    309 ConvertingIterator<PetscScalar *, types::global_dof_index> end_ghosts(
    \n+
    310 &array[n_elements_stored_locally]);
    \n+
    311 if (std::is_sorted(&array[end_index - ghost_start_index],
    \n+
    312 &array[n_elements_stored_locally],
    \n
    313 [](PetscScalar left, PetscScalar right) {
    \n
    314 return static_cast<PetscInt>(std::real(left)) <
    \n
    315 static_cast<PetscInt>(std::real(right));
    \n
    316 }))
    \n
    317 {
    \n-
    318 ghost_indices.add_indices(begin_ghosts, end_ghosts);
    \n+
    318 ghost_indices.add_indices(begin_ghosts, end_ghosts);
    \n
    319 }
    \n
    320 else
    \n
    321 {
    \n-
    322 std::vector<PetscInt> sorted_indices(begin_ghosts, end_ghosts);
    \n-
    323 std::sort(sorted_indices.begin(), sorted_indices.end());
    \n-
    324 ghost_indices.add_indices(sorted_indices.begin(),
    \n-
    325 sorted_indices.end());
    \n+
    322 std::vector<PetscInt> sorted_indices(begin_ghosts, end_ghosts);
    \n+
    323 std::sort(sorted_indices.begin(), sorted_indices.end());
    \n+
    324 ghost_indices.add_indices(sorted_indices.begin(),
    \n+
    325 sorted_indices.end());
    \n
    326 }
    \n
    327 ghost_indices.compress();
    \n
    328
    \n-
    329 ierr = VecRestoreArrayRead(ghosted_vec, (const PetscScalar **)&array);
    \n-
    330 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    331 ierr = VecGhostRestoreLocalForm(tvector, &ghosted_vec);
    \n-
    332 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    333 ierr = VecDestroy(&tvector);
    \n-
    334 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    329 ierr = VecRestoreArrayRead(ghosted_vec, (const PetscScalar **)&array);
    \n+
    330 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    331 ierr = VecGhostRestoreLocalForm(tvector, &ghosted_vec);
    \n+
    332 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    333 ierr = VecDestroy(&tvector);
    \n+
    334 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    335 }
    \n
    336 else
    \n
    337 {
    \n
    \n-
    338 ierr = VecGhostRestoreLocalForm(vector, &ghosted_vec);
    \n-
    339 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    338 ierr = VecGhostRestoreLocalForm(vector, &ghosted_vec);
    \n+
    339 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    340 }
    \n
    341 }
    \n
    342
    \n
    343
    \n
    344 void
    \n
    \n
    345 VectorBase::clear()
    \n
    346 {
    \n-
    347 const PetscErrorCode ierr = VecDestroy(&vector);
    \n-
    348 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    347 const PetscErrorCode ierr = VecDestroy(&vector);
    \n+
    348 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    349
    \n
    350 ghosted = false;
    \n
    351 ghost_indices.clear();
    \n
    352 last_action = VectorOperation::unknown;
    \n
    353 }
    \n
    \n
    354
    \n@@ -481,16 +481,16 @@\n
    356
    \n
    357 VectorBase &
    \n
    \n
    358 VectorBase::operator=(const VectorBase &v)
    \n
    359 {
    \n
    360 Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
    \n
    361
    \n-
    362 PetscErrorCode ierr = VecCopy(v, vector);
    \n-
    363 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    362 PetscErrorCode ierr = VecCopy(v, vector);
    \n+
    363 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    364
    \n
    365 return *this;
    \n
    366 }
    \n
    \n
    367
    \n
    368
    \n
    369
    \n@@ -498,104 +498,104 @@\n
    \n
    371 VectorBase::operator=(const PetscScalar s)
    \n
    372 {
    \n
    373 AssertIsFinite(s);
    \n
    374
    \n
    375 // TODO[TH]: assert(is_compressed())
    \n
    376
    \n-
    377 PetscErrorCode ierr = VecSet(vector, s);
    \n-
    378 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    377 PetscErrorCode ierr = VecSet(vector, s);
    \n+
    378 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    379
    \n
    380 if (has_ghost_elements())
    \n
    381 {
    \n
    382 Vec ghost = nullptr;
    \n-
    383 ierr = VecGhostGetLocalForm(vector, &ghost);
    \n-
    384 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    383 ierr = VecGhostGetLocalForm(vector, &ghost);
    \n+
    384 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    385
    \n-
    386 ierr = VecSet(ghost, s);
    \n-
    387 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    386 ierr = VecSet(ghost, s);
    \n+
    387 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    388
    \n-
    389 ierr = VecGhostRestoreLocalForm(vector, &ghost);
    \n-
    390 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    389 ierr = VecGhostRestoreLocalForm(vector, &ghost);
    \n+
    390 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    391 }
    \n
    392
    \n
    393 return *this;
    \n
    394 }
    \n
    \n
    395
    \n
    396
    \n
    397
    \n
    398 bool
    \n
    \n
    399 VectorBase::operator==(const VectorBase &v) const
    \n
    400 {
    \n
    401 Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
    \n
    402
    \n-
    403 PetscBool flag;
    \n-
    404 const PetscErrorCode ierr = VecEqual(vector, v.vector, &flag);
    \n-
    405 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    403 PetscBool flag;
    \n+
    404 const PetscErrorCode ierr = VecEqual(vector, v.vector, &flag);
    \n+
    405 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    406
    \n-
    407 return (flag == PETSC_TRUE);
    \n+
    407 return (flag == PETSC_TRUE);
    \n
    408 }
    \n
    \n
    409
    \n
    410
    \n
    411
    \n
    412 bool
    \n
    \n
    413 VectorBase::operator!=(const VectorBase &v) const
    \n
    414 {
    \n
    415 Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
    \n
    416
    \n-
    417 PetscBool flag;
    \n-
    418 const PetscErrorCode ierr = VecEqual(vector, v.vector, &flag);
    \n-
    419 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    417 PetscBool flag;
    \n+
    418 const PetscErrorCode ierr = VecEqual(vector, v.vector, &flag);
    \n+
    419 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    420
    \n-
    421 return (flag == PETSC_FALSE);
    \n+
    421 return (flag == PETSC_FALSE);
    \n
    422 }
    \n
    \n
    423
    \n
    424
    \n
    425
    \n
    426 VectorBase::size_type
    \n
    \n
    427 VectorBase::size() const
    \n
    428 {
    \n-
    429 PetscInt sz;
    \n-
    430 const PetscErrorCode ierr = VecGetSize(vector, &sz);
    \n-
    431 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    429 PetscInt sz;
    \n+
    430 const PetscErrorCode ierr = VecGetSize(vector, &sz);
    \n+
    431 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    432
    \n-
    433 return sz;
    \n+
    433 return sz;
    \n
    434 }
    \n
    \n
    435
    \n
    436
    \n
    437
    \n
    438 VectorBase::size_type
    \n
    \n
    439 VectorBase::locally_owned_size() const
    \n
    440 {
    \n-
    441 PetscInt sz;
    \n-
    442 const PetscErrorCode ierr = VecGetLocalSize(vector, &sz);
    \n-
    443 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    441 PetscInt sz;
    \n+
    442 const PetscErrorCode ierr = VecGetLocalSize(vector, &sz);
    \n+
    443 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    444
    \n-
    445 return sz;
    \n+
    445 return sz;
    \n
    446 }
    \n
    \n
    447
    \n
    448
    \n
    449
    \n
    450 std::pair<VectorBase::size_type, VectorBase::size_type>
    \n
    \n
    451 VectorBase::local_range() const
    \n
    452 {
    \n
    453 PetscInt begin, end;
    \n-
    454 const PetscErrorCode ierr =
    \n-
    455 VecGetOwnershipRange(static_cast<const Vec &>(vector), &begin, &end);
    \n-
    456 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    454 const PetscErrorCode ierr =
    \n+
    455 VecGetOwnershipRange(static_cast<const Vec &>(vector), &begin, &end);
    \n+
    456 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    457
    \n
    458 return std::make_pair(begin, end);
    \n
    459 }
    \n
    \n
    460
    \n
    461
    \n
    462
    \n@@ -650,29 +650,29 @@\n
    503
    \n
    504
    \n
    505
    \n
    506 PetscScalar
    \n
    \n
    507 VectorBase::operator*(const VectorBase &vec) const
    \n
    508 {
    \n-
    509 Assert(size() == vec.size(), ExcDimensionMismatch(size(), vec.size()));
    \n+
    509 Assert(size() == vec.size(), ExcDimensionMismatch(size(), vec.size()));
    \n
    510
    \n-
    511 PetscScalar result;
    \n+
    511 PetscScalar result;
    \n
    512
    \n
    513 // For complex vectors, VecDot() computes
    \n
    514 // val = (x,y) = y^H x,
    \n
    515 // where y^H denotes the conjugate transpose of y.
    \n
    516 // Note that this corresponds to the usual "mathematicians'"
    \n
    517 // complex inner product where the SECOND argument gets the
    \n
    518 // complex conjugate, which is also how we document this
    \n
    519 // operation.
    \n-
    520 const PetscErrorCode ierr = VecDot(vec.vector, vector, &result);
    \n-
    521 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    520 const PetscErrorCode ierr = VecDot(vec.vector, vector, &result);
    \n+
    521 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    522
    \n-
    523 return result;
    \n+
    523 return result;
    \n
    524 }
    \n
    \n
    525
    \n
    526
    \n
    527
    \n
    528 PetscScalar
    \n
    \n@@ -698,26 +698,26 @@\n
    546 "not make sense to call compress() for such "
    \n
    547 "vectors."));
    \n
    548
    \n
    549 {
    \n
    550# ifdef DEBUG
    \n
    551 // Check that all processors agree that last_action is the same (or none!)
    \n
    552
    \n-
    553 int my_int_last_action = last_action;
    \n-
    554 int all_int_last_action;
    \n+
    553 int my_int_last_action = last_action;
    \n+
    554 int all_int_last_action;
    \n
    555
    \n-
    556 const int ierr = MPI_Allreduce(&my_int_last_action,
    \n-
    557 &all_int_last_action,
    \n+
    556 const int ierr = MPI_Allreduce(&my_int_last_action,
    \n+
    557 &all_int_last_action,
    \n
    558 1,
    \n-
    559 MPI_INT,
    \n-
    560 MPI_BOR,
    \n+
    559 MPI_INT,
    \n+
    560 MPI_BOR,
    \n
    561 get_mpi_communicator());
    \n-
    562 AssertThrowMPI(ierr);
    \n+
    562 AssertThrowMPI(ierr);
    \n
    563
    \n-
    564 AssertThrow(all_int_last_action !=
    \n+
    564 AssertThrow(all_int_last_action !=
    \n
    565 (VectorOperation::add | VectorOperation::insert),
    \n
    566 ExcMessage("Error: not all processors agree on the last "
    \n
    567 "VectorOperation before this compress() call."));
    \n
    568# endif
    \n
    569 }
    \n
    570
    \n
    571 AssertThrow(
    \n@@ -735,18 +735,18 @@\n
    583 // situations where only one
    \n
    584 // processor (or a subset of
    \n
    585 // processors) actually writes
    \n
    586 // something into a vector, but
    \n
    587 // we still need to call
    \n
    588 // VecAssemblyBegin/End on all
    \n
    589 // processors.
    \n-
    590 PetscErrorCode ierr = VecAssemblyBegin(vector);
    \n-
    591 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    592 ierr = VecAssemblyEnd(vector);
    \n-
    593 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    590 PetscErrorCode ierr = VecAssemblyBegin(vector);
    \n+
    591 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    592 ierr = VecAssemblyEnd(vector);
    \n+
    593 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    594
    \n
    595 // reset the last action field to
    \n
    596 // indicate that we're back to a
    \n
    597 // pristine state
    \n
    598 last_action = VectorOperation::unknown;
    \n
    599 }
    \n
    \n@@ -769,174 +769,174 @@\n
    613 VectorBase::mean_value() const
    \n
    614 {
    \n
    615 // We can only use our more efficient
    \n
    616 // routine in the serial case.
    \n
    617 if (dynamic_cast<const PETScWrappers::MPI::Vector *>(this) != nullptr)
    \n
    618 {
    \n
    619 PetscScalar sum;
    \n-
    620 const PetscErrorCode ierr = VecSum(vector, &sum);
    \n-
    621 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    620 const PetscErrorCode ierr = VecSum(vector, &sum);
    \n+
    621 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    622 return sum / static_cast<PetscReal>(size());
    \n
    623 }
    \n
    624
    \n
    625 // get a representation of the vector and
    \n
    626 // loop over all the elements
    \n-
    627 const PetscScalar *start_ptr;
    \n-
    628 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n-
    629 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    627 const PetscScalar *start_ptr;
    \n+
    628 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n+
    629 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    630
    \n
    631 PetscScalar mean = 0;
    \n
    632 {
    \n-
    633 PetscScalar sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
    \n+
    633 PetscScalar sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
    \n
    634
    \n
    635 // use modern processors better by
    \n
    636 // allowing pipelined commands to be
    \n
    637 // executed in parallel
    \n-
    638 const PetscScalar *ptr = start_ptr;
    \n-
    639 const PetscScalar *eptr = ptr + (size() / 4) * 4;
    \n-
    640 while (ptr != eptr)
    \n+
    638 const PetscScalar *ptr = start_ptr;
    \n+
    639 const PetscScalar *eptr = ptr + (size() / 4) * 4;
    \n+
    640 while (ptr != eptr)
    \n
    641 {
    \n-
    642 sum0 += *ptr++;
    \n-
    643 sum1 += *ptr++;
    \n-
    644 sum2 += *ptr++;
    \n-
    645 sum3 += *ptr++;
    \n+
    642 sum0 += *ptr++;
    \n+
    643 sum1 += *ptr++;
    \n+
    644 sum2 += *ptr++;
    \n+
    645 sum3 += *ptr++;
    \n
    646 }
    \n
    647 // add up remaining elements
    \n-
    648 while (ptr != start_ptr + size())
    \n-
    649 sum0 += *ptr++;
    \n+
    648 while (ptr != start_ptr + size())
    \n+
    649 sum0 += *ptr++;
    \n
    650
    \n-
    651 mean = (sum0 + sum1 + sum2 + sum3) / static_cast<PetscReal>(size());
    \n+
    651 mean = (sum0 + sum1 + sum2 + sum3) / static_cast<PetscReal>(size());
    \n
    652 }
    \n
    653
    \n
    654 // restore the representation of the
    \n
    655 // vector
    \n-
    656 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n-
    657 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    656 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n+
    657 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    658
    \n
    659 return mean;
    \n
    660 }
    \n
    \n
    661
    \n
    662
    \n
    663 VectorBase::real_type
    \n
    \n
    664 VectorBase::l1_norm() const
    \n
    665 {
    \n
    666 real_type d;
    \n
    667
    \n-
    668 const PetscErrorCode ierr = VecNorm(vector, NORM_1, &d);
    \n-
    669 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    668 const PetscErrorCode ierr = VecNorm(vector, NORM_1, &d);
    \n+
    669 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    670
    \n
    671 return d;
    \n
    672 }
    \n
    \n
    673
    \n
    674
    \n
    675
    \n
    676 VectorBase::real_type
    \n
    \n
    677 VectorBase::l2_norm() const
    \n
    678 {
    \n
    679 real_type d;
    \n
    680
    \n-
    681 const PetscErrorCode ierr = VecNorm(vector, NORM_2, &d);
    \n-
    682 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    681 const PetscErrorCode ierr = VecNorm(vector, NORM_2, &d);
    \n+
    682 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    683
    \n
    684 return d;
    \n
    685 }
    \n
    \n
    686
    \n
    687
    \n
    688
    \n
    689 VectorBase::real_type
    \n
    \n
    690 VectorBase::lp_norm(const real_type p) const
    \n
    691 {
    \n
    692 // get a representation of the vector and
    \n
    693 // loop over all the elements
    \n-
    694 const PetscScalar *start_ptr;
    \n-
    695 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n-
    696 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    694 const PetscScalar *start_ptr;
    \n+
    695 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n+
    696 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    697
    \n
    698 real_type norm = 0;
    \n
    699 {
    \n-
    700 real_type sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
    \n+
    700 real_type sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
    \n
    701
    \n
    702 // use modern processors better by
    \n
    703 // allowing pipelined commands to be
    \n
    704 // executed in parallel
    \n-
    705 const PetscScalar *ptr = start_ptr;
    \n-
    706 const PetscScalar *eptr = ptr + (size() / 4) * 4;
    \n-
    707 while (ptr != eptr)
    \n+
    705 const PetscScalar *ptr = start_ptr;
    \n+
    706 const PetscScalar *eptr = ptr + (size() / 4) * 4;
    \n+
    707 while (ptr != eptr)
    \n
    708 {
    \n-
    709 sum0 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n-
    710 sum1 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n-
    711 sum2 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n-
    712 sum3 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n+
    709 sum0 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n+
    710 sum1 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n+
    711 sum2 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n+
    712 sum3 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n
    713 }
    \n
    714 // add up remaining elements
    \n-
    715 while (ptr != start_ptr + size())
    \n-
    716 sum0 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n+
    715 while (ptr != start_ptr + size())
    \n+
    716 sum0 += std::pow(numbers::NumberTraits<value_type>::abs(*ptr++), p);
    \n
    717
    \n-
    718 norm = std::pow(sum0 + sum1 + sum2 + sum3, 1. / p);
    \n+
    718 norm = std::pow(sum0 + sum1 + sum2 + sum3, 1. / p);
    \n
    719 }
    \n
    720
    \n
    721 // restore the representation of the
    \n
    722 // vector
    \n-
    723 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n-
    724 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    723 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n+
    724 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    725
    \n
    726 return norm;
    \n
    727 }
    \n
    \n
    728
    \n
    729
    \n
    730
    \n
    731 VectorBase::real_type
    \n
    \n
    732 VectorBase::linfty_norm() const
    \n
    733 {
    \n
    734 real_type d;
    \n
    735
    \n-
    736 const PetscErrorCode ierr = VecNorm(vector, NORM_INFINITY, &d);
    \n-
    737 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    736 const PetscErrorCode ierr = VecNorm(vector, NORM_INFINITY, &d);
    \n+
    737 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    738
    \n
    739 return d;
    \n
    740 }
    \n
    \n
    741
    \n
    742
    \n
    743
    \n
    744 bool
    \n
    \n
    745 VectorBase::all_zero() const
    \n
    746 {
    \n
    747 // get a representation of the vector and
    \n
    748 // loop over all the elements
    \n-
    749 const PetscScalar *start_ptr;
    \n-
    750 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n-
    751 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    749 const PetscScalar *start_ptr;
    \n+
    750 PetscErrorCode ierr = VecGetArrayRead(vector, &start_ptr);
    \n+
    751 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    752
    \n-
    753 const PetscScalar *ptr = start_ptr,
    \n-
    754 *eptr = start_ptr + locally_owned_size();
    \n+
    753 const PetscScalar *ptr = start_ptr,
    \n+
    754 *eptr = start_ptr + locally_owned_size();
    \n
    755 bool flag = true;
    \n-
    756 while (ptr != eptr)
    \n+
    756 while (ptr != eptr)
    \n
    757 {
    \n
    758 if (*ptr != value_type())
    \n
    759 {
    \n
    760 flag = false;
    \n
    761 break;
    \n
    762 }
    \n
    763 ++ptr;
    \n
    764 }
    \n
    765
    \n
    766 // restore the representation of the
    \n
    767 // vector
    \n-
    768 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n-
    769 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    768 ierr = VecRestoreArrayRead(vector, &start_ptr);
    \n+
    769 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    770
    \n
    771 return flag;
    \n
    772 }
    \n
    \n
    773
    \n
    774
    \n
    775 namespace internal
    \n@@ -970,16 +970,16 @@\n
    799 VectorBase &
    \n
    \n
    800 VectorBase::operator*=(const PetscScalar a)
    \n
    801 {
    \n
    802 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    803 AssertIsFinite(a);
    \n
    804
    \n-
    805 const PetscErrorCode ierr = VecScale(vector, a);
    \n-
    806 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    805 const PetscErrorCode ierr = VecScale(vector, a);
    \n+
    806 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    807
    \n
    808 return *this;
    \n
    809 }
    \n
    \n
    810
    \n
    811
    \n
    812
    \n@@ -989,74 +989,74 @@\n
    815 {
    \n
    816 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    817 AssertIsFinite(a);
    \n
    818
    \n
    819 const PetscScalar factor = 1. / a;
    \n
    820 AssertIsFinite(factor);
    \n
    821
    \n-
    822 const PetscErrorCode ierr = VecScale(vector, factor);
    \n-
    823 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    822 const PetscErrorCode ierr = VecScale(vector, factor);
    \n+
    823 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    824
    \n
    825 return *this;
    \n
    826 }
    \n
    \n
    827
    \n
    828
    \n
    829
    \n
    830 VectorBase &
    \n
    \n
    831 VectorBase::operator+=(const VectorBase &v)
    \n
    832 {
    \n
    833 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n-
    834 const PetscErrorCode ierr = VecAXPY(vector, 1, v);
    \n-
    835 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    834 const PetscErrorCode ierr = VecAXPY(vector, 1, v);
    \n+
    835 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    836
    \n
    837 return *this;
    \n
    838 }
    \n
    \n
    839
    \n
    840
    \n
    841
    \n
    842 VectorBase &
    \n
    \n
    843 VectorBase::operator-=(const VectorBase &v)
    \n
    844 {
    \n
    845 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n-
    846 const PetscErrorCode ierr = VecAXPY(vector, -1, v);
    \n-
    847 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    846 const PetscErrorCode ierr = VecAXPY(vector, -1, v);
    \n+
    847 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    848
    \n
    849 return *this;
    \n
    850 }
    \n
    \n
    851
    \n
    852
    \n
    853
    \n
    854 void
    \n
    \n
    855 VectorBase::add(const PetscScalar s)
    \n
    856 {
    \n
    857 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    858 AssertIsFinite(s);
    \n
    859
    \n-
    860 const PetscErrorCode ierr = VecShift(vector, s);
    \n-
    861 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    860 const PetscErrorCode ierr = VecShift(vector, s);
    \n+
    861 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    862 }
    \n
    \n
    863
    \n
    864
    \n
    865
    \n
    866 void
    \n
    \n
    867 VectorBase::add(const PetscScalar a, const VectorBase &v)
    \n
    868 {
    \n
    869 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    870 AssertIsFinite(a);
    \n
    871
    \n-
    872 const PetscErrorCode ierr = VecAXPY(vector, a, v);
    \n-
    873 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    872 const PetscErrorCode ierr = VecAXPY(vector, a, v);
    \n+
    873 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    874 }
    \n
    \n
    875
    \n
    876
    \n
    877
    \n
    878 void
    \n
    \n@@ -1066,32 +1066,32 @@\n
    882 const VectorBase &w)
    \n
    883 {
    \n
    884 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    885 AssertIsFinite(a);
    \n
    886 AssertIsFinite(b);
    \n
    887
    \n
    888 const PetscScalar weights[2] = {a, b};
    \n-
    889 Vec addends[2] = {v.vector, w.vector};
    \n+
    889 Vec addends[2] = {v.vector, w.vector};
    \n
    890
    \n-
    891 const PetscErrorCode ierr = VecMAXPY(vector, 2, weights, addends);
    \n-
    892 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    891 const PetscErrorCode ierr = VecMAXPY(vector, 2, weights, addends);
    \n+
    892 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    893 }
    \n
    \n
    894
    \n
    895
    \n
    896
    \n
    897 void
    \n
    \n
    898 VectorBase::sadd(const PetscScalar s, const VectorBase &v)
    \n
    899 {
    \n
    900 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    901 AssertIsFinite(s);
    \n
    902
    \n-
    903 const PetscErrorCode ierr = VecAYPX(vector, s, v);
    \n-
    904 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    903 const PetscErrorCode ierr = VecAYPX(vector, s, v);
    \n+
    904 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    905 }
    \n
    \n
    906
    \n
    907
    \n
    908
    \n
    909 void
    \n
    \n@@ -1114,54 +1114,54 @@\n
    925
    \n
    926
    \n
    927 void
    \n
    \n
    928 VectorBase::scale(const VectorBase &factors)
    \n
    929 {
    \n
    930 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n-
    931 const PetscErrorCode ierr = VecPointwiseMult(vector, factors, vector);
    \n-
    932 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    931 const PetscErrorCode ierr = VecPointwiseMult(vector, factors, vector);
    \n+
    932 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    933 }
    \n
    \n
    934
    \n
    935
    \n
    936
    \n
    937 void
    \n
    \n
    938 VectorBase::equ(const PetscScalar a, const VectorBase &v)
    \n
    939 {
    \n
    940 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    941 AssertIsFinite(a);
    \n
    942
    \n
    943 Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
    \n
    944
    \n-
    945 const PetscErrorCode ierr = VecAXPBY(vector, a, 0.0, v.vector);
    \n-
    946 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    945 const PetscErrorCode ierr = VecAXPBY(vector, a, 0.0, v.vector);
    \n+
    946 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    947 }
    \n
    \n
    948
    \n
    949
    \n
    950
    \n
    951 void
    \n
    \n
    952 VectorBase::write_ascii(const PetscViewerFormat format)
    \n
    953 {
    \n
    954 // TODO[TH]:assert(is_compressed())
    \n-
    955 MPI_Comm comm = PetscObjectComm((PetscObject)vector);
    \n+
    955 MPI_Comm comm = PetscObjectComm((PetscObject)vector);
    \n
    956
    \n
    957 // Set options
    \n-
    958 PetscErrorCode ierr =
    \n-
    959 PetscViewerPushFormat(PETSC_VIEWER_STDOUT_(comm), format);
    \n-
    960 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    958 PetscErrorCode ierr =
    \n+
    959 PetscViewerPushFormat(PETSC_VIEWER_STDOUT_(comm), format);
    \n+
    960 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    961
    \n
    962 // Write to screen
    \n-
    963 ierr = VecView(vector, PETSC_VIEWER_STDOUT_(comm));
    \n-
    964 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n-
    965 ierr = PetscViewerPopFormat(PETSC_VIEWER_STDOUT_(comm));
    \n-
    966 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    963 ierr = VecView(vector, PETSC_VIEWER_STDOUT_(comm));
    \n+
    964 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    965 ierr = PetscViewerPopFormat(PETSC_VIEWER_STDOUT_(comm));
    \n+
    966 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    967 }
    \n
    \n
    968
    \n
    969
    \n
    970
    \n
    971 void
    \n
    \n@@ -1171,44 +1171,44 @@\n
    975 const bool across) const
    \n
    976 {
    \n
    977 AssertThrow(out.fail() == false, ExcIO());
    \n
    978
    \n
    979 // get a representation of the vector and
    \n
    980 // loop over all the elements
    \n
    981 const PetscScalar *val;
    \n-
    982 PetscErrorCode ierr = VecGetArrayRead(vector, &val);
    \n+
    982 PetscErrorCode ierr = VecGetArrayRead(vector, &val);
    \n
    983
    \n-
    984 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    984 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    985
    \n
    986 // save the state of out stream
    \n-
    987 const std::ios::fmtflags old_flags = out.flags();
    \n-
    988 const unsigned int old_precision = out.precision(precision);
    \n+
    987 const std::ios::fmtflags old_flags = out.flags();
    \n+
    988 const unsigned int old_precision = out.precision(precision);
    \n
    989
    \n
    990 out.precision(precision);
    \n
    991 if (scientific)
    \n
    992 out.setf(std::ios::scientific, std::ios::floatfield);
    \n
    993 else
    \n
    994 out.setf(std::ios::fixed, std::ios::floatfield);
    \n
    995
    \n-
    996 if (across)
    \n+
    996 if (across)
    \n
    997 for (size_type i = 0; i < locally_owned_size(); ++i)
    \n
    998 out << val[i] << ' ';
    \n
    999 else
    \n
    1000 for (size_type i = 0; i < locally_owned_size(); ++i)
    \n
    1001 out << val[i] << std::endl;
    \n
    1002 out << std::endl;
    \n
    1003
    \n
    1004 // reset output format
    \n-
    1005 out.flags(old_flags);
    \n-
    1006 out.precision(old_precision);
    \n+
    1005 out.flags(old_flags);
    \n+
    1006 out.precision(old_precision);
    \n
    1007
    \n
    1008 // restore the representation of the
    \n
    1009 // vector
    \n-
    1010 ierr = VecRestoreArrayRead(vector, &val);
    \n-
    1011 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    1010 ierr = VecRestoreArrayRead(vector, &val);
    \n+
    1011 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    1012
    \n
    1013 AssertThrow(out.fail() == false, ExcIO());
    \n
    1014 }
    \n
    \n
    1015
    \n
    1016
    \n
    1017
    \n@@ -1224,15 +1224,15 @@\n
    1026 this->ghost_indices = v.ghost_indices;
    \n
    1027 v.ghost_indices = t;
    \n
    1028 }
    \n
    \n
    1029
    \n
    1030
    \n
    \n-
    1031 VectorBase::operator const Vec &() const
    \n+
    1031 VectorBase::operator const Vec &() const
    \n
    1032 {
    \n
    1033 return vector;
    \n
    1034 }
    \n
    \n
    1035
    \n
    1036
    \n
    1037 Vec &
    \n@@ -1271,39 +1271,39 @@\n
    1066 void
    \n
    \n
    1067 VectorBase::do_set_add_operation(const size_type n_elements,
    \n
    1068 const size_type *indices,
    \n
    1069 const PetscScalar *values,
    \n
    1070 const bool add_values)
    \n
    1071 {
    \n-
    1072 VectorOperation::values action =
    \n-
    1073 (add_values ? VectorOperation::add : VectorOperation::insert);
    \n-
    1074 Assert((last_action == action) || (last_action == VectorOperation::unknown),
    \n-
    1075 internal::VectorReference::ExcWrongMode(action, last_action));
    \n+
    1072 VectorOperation::values action =
    \n+
    1073 (add_values ? VectorOperation::add : VectorOperation::insert);
    \n+
    1074 Assert((last_action == action) || (last_action == VectorOperation::unknown),
    \n+
    1075 internal::VectorReference::ExcWrongMode(action, last_action));
    \n
    1076 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1077 // VecSetValues complains if we
    \n
    1078 // come with an empty
    \n
    1079 // vector. however, it is not a
    \n
    1080 // collective operation, so we
    \n
    1081 // can skip the call if necessary
    \n
    1082 // (unlike the above calls)
    \n
    1083 if (n_elements != 0)
    \n
    1084 {
    \n-
    1085 const PetscInt *petsc_indices =
    \n+
    1085 const PetscInt *petsc_indices =
    \n
    1086 reinterpret_cast<const PetscInt *>(indices);
    \n
    1087
    \n-
    1088 const InsertMode mode = (add_values ? ADD_VALUES : INSERT_VALUES);
    \n-
    1089 const PetscErrorCode ierr =
    \n-
    1090 VecSetValues(vector, n_elements, petsc_indices, values, mode);
    \n-
    1091 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n+
    1088 const InsertMode mode = (add_values ? ADD_VALUES : INSERT_VALUES);
    \n+
    1089 const PetscErrorCode ierr =
    \n+
    1090 VecSetValues(vector, n_elements, petsc_indices, values, mode);
    \n+
    1091 AssertThrow(ierr == 0, ExcPETScError(ierr));
    \n
    1092 }
    \n
    1093
    \n
    1094 // set the mode here, independent of whether we have actually
    \n
    1095 // written elements or whether the list was empty
    \n-
    1096 last_action = action;
    \n+
    1096 last_action = action;
    \n
    1097 }
    \n
    \n
    1098
    \n
    1099} // namespace PETScWrappers
    \n
    1100
    \n
    1101DEAL_II_NAMESPACE_CLOSE
    \n
    1102
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/petsc__vector__base_8h_source.html", "unified_diff": "@@ -321,17 +321,17 @@\n
    488 virtual void
    \n
    489 extract_subvector_to(
    \n
    490 const ArrayView<const types::global_dof_index> &indices,
    \n
    491 ArrayView<PetscScalar> &elements) const override;
    \n
    492
    \n
    520 template <typename ForwardIterator, typename OutputIterator>
    \n
    521 void
    \n-
    522 extract_subvector_to(const ForwardIterator indices_begin,
    \n-
    523 const ForwardIterator indices_end,
    \n-
    524 OutputIterator values_begin) const;
    \n+
    522 extract_subvector_to(const ForwardIterator indices_begin,
    \n+
    523 const ForwardIterator indices_end,
    \n+
    524 OutputIterator values_begin) const;
    \n
    525
    \n
    530 void
    \n
    531 add(const std::vector<size_type> &indices,
    \n
    532 const std::vector<PetscScalar> &values);
    \n
    533
    \n
    538 void
    \n
    539 add(const std::vector<size_type> &indices,
    \n@@ -339,15 +339,15 @@\n
    541
    \n
    547 void
    \n
    548 add(const size_type n_elements,
    \n
    549 const size_type *indices,
    \n
    550 const PetscScalar *values);
    \n
    551
    \n
    558 PetscScalar
    \n-
    559 operator*(const VectorBase &vec) const;
    \n+
    559 operator*(const VectorBase &vec) const;
    \n
    560
    \n
    564 real_type
    \n
    565 norm_sqr() const;
    \n
    566
    \n
    570 PetscScalar
    \n
    571 mean_value() const;
    \n
    572
    \n@@ -396,44 +396,44 @@\n
    683 void
    \n
    684 sadd(const PetscScalar s, const VectorBase &V);
    \n
    685
    \n
    689 void
    \n
    690 sadd(const PetscScalar s, const PetscScalar a, const VectorBase &V);
    \n
    691
    \n
    697 void
    \n-
    698 scale(const VectorBase &scaling_factors);
    \n+
    698 scale(const VectorBase &scaling_factors);
    \n
    699
    \n
    703 void
    \n
    704 equ(const PetscScalar a, const VectorBase &V);
    \n
    705
    \n
    713 void
    \n-
    714 write_ascii(const PetscViewerFormat format = PETSC_VIEWER_DEFAULT);
    \n+
    714 write_ascii(const PetscViewerFormat format = PETSC_VIEWER_DEFAULT);
    \n
    715
    \n
    723 void
    \n
    724 print(std::ostream &out,
    \n
    725 const unsigned int precision = 3,
    \n
    726 const bool scientific = true,
    \n-
    727 const bool across = true) const;
    \n+
    727 const bool across = true) const;
    \n
    728
    \n
    736 template <class Archive>
    \n
    737 void
    \n-
    738 save(Archive &ar, const unsigned int version) const;
    \n+
    738 save(Archive &ar, const unsigned int version) const;
    \n
    739
    \n
    745 template <class Archive>
    \n
    746 void
    \n-
    747 load(Archive &ar, const unsigned int version);
    \n+
    747 load(Archive &ar, const unsigned int version);
    \n
    748
    \n
    749# ifdef DOXYGEN
    \n
    755 template <class Archive>
    \n
    756 void
    \n-
    757 serialize(Archive &archive, const unsigned int version);
    \n+
    757 serialize(Archive &archive, const unsigned int version);
    \n
    758# else
    \n
    759 // This macro defines the serialize() method that is compatible with
    \n
    760 // the templated save() and load() method that have been implemented.
    \n-
    761 BOOST_SERIALIZATION_SPLIT_MEMBER()
    \n+
    761 BOOST_SERIALIZATION_SPLIT_MEMBER()
    \n
    762# endif
    \n
    763
    \n
    776 void
    \n
    777 swap(VectorBase &v) noexcept;
    \n
    778
    \n
    786 operator const Vec &() const;
    \n
    787
    \n@@ -458,15 +458,15 @@\n
    836 // Make the reference class a friend.
    \n
    837 friend class internal::VectorReference;
    \n
    838
    \n
    844 void
    \n
    845 do_set_add_operation(const size_type n_elements,
    \n
    846 const size_type *indices,
    \n
    847 const PetscScalar *values,
    \n-
    848 const bool add_values);
    \n+
    848 const bool add_values);
    \n
    849
    \n
    853 void
    \n
    854 determine_ghost_indices();
    \n
    855 };
    \n
    \n
    856
    \n
    857
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_12.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_12.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1669,30 +1669,30 @@\n ['ginkgowrappers_671', ['GinkgoWrappers', ['../namespaceGinkgoWrappers.html', 1, '']]],\n ['given_5fdegree_672', ['given_degree', ['../classinternal_1_1HelperBase.html#a8eb01e3eca82f668f8d472bf01ffc65f', 1, 'internal::HelperBase']]],\n ['givens_5frotation_673', ['givens_rotation', ['../namespaceUtilities_1_1LinearAlgebra.html#a33aa7919799a8f798916c463aa88096a', 1, 'Utilities::LinearAlgebra']]],\n ['givens_5frotations_674', ['givens_rotations', ['../classinternal_1_1SolverGMRESImplementation_1_1ArnoldiProcess.html#aac9acdf63f8a9a52bb1410bb1c47c95f', 1, 'internal::SolverGMRESImplementation::ArnoldiProcess']]],\n ['givens_5fsignal_675', ['givens_signal', ['../classBaseQR.html#a8af1fce48fab4ae55e91c9a220b5e88d', 1, 'BaseQR']]],\n ['global_676', ['global', ['../classBlockInfo.html#ab9c42d6e2e1fb8bfc0f55ecd938b2f2b', 1, 'BlockInfo']]],\n ['global_5factive_5fcell_5findex_677', ['global_active_cell_index', ['../classCellAccessor.html#a13e7c4a89332133d5ce71a1a5aa8f64f', 1, 'CellAccessor']]],\n- ['global_5factive_5fcell_5findex_5fpartitioner_678', ['global_active_cell_index_partitioner', ['../classTriangulation.html#a214a4a1e9e7893a482b2dd983fa96502', 1, 'Triangulation::global_active_cell_index_partitioner()'],\n- ['../classparallel_1_1TriangulationBase.html#ac2caf65a56ee58460c9fcf77c7051f9f', 1, 'parallel::TriangulationBase::global_active_cell_index_partitioner()']\n+ ['global_5factive_5fcell_5findex_5fpartitioner_678', ['global_active_cell_index_partitioner', ['../classparallel_1_1TriangulationBase.html#ac2caf65a56ee58460c9fcf77c7051f9f', 1, 'parallel::TriangulationBase::global_active_cell_index_partitioner()'],\n+ ['../classTriangulation.html#a214a4a1e9e7893a482b2dd983fa96502', 1, 'Triangulation::global_active_cell_index_partitioner()']\n ]],\n ['global_5factive_5fcell_5findices_679', ['global_active_cell_indices', ['../classinternal_1_1TriangulationImplementation_1_1TriaLevel.html#a4ce37ecbacae2d0ffa3b69a4bb936cbc', 1, 'internal::TriangulationImplementation::TriaLevel']]],\n ['global_5fbase_5felement_5foffset_680', ['global_base_element_offset', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#a36a52e6cac05be6d4c9782f3375beef0', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['global_5fcell_5findex_681', ['global_cell_index', ['../namespacetypes.html#a88f8129eb3e40ecc8022e92a1e15d70e', 1, 'types']]],\n ['global_5fcolumn_682', ['global_column', ['../classScaLAPACKMatrix.html#ae10eacb6dbdb705df9683564f03ee525', 1, 'ScaLAPACKMatrix']]],\n ['global_5fcolumn_5findex_683', ['global_column_index', ['../namespaceTrilinosWrappers.html#a7aaea400039264486162b4c5f798c9fb', 1, 'TrilinosWrappers']]],\n ['global_5fdata_684', ['global_data', ['../classMeshWorker_1_1IntegrationInfo.html#a5141cc25519af7790f4e4b4c6f24cb92', 1, 'MeshWorker::IntegrationInfo']]],\n ['global_5fdof_5findex_685', ['global_dof_index', ['../namespacetypes.html#a3543786f7dc7c57385fc923a6afd5917', 1, 'types::global_dof_index'],\n ['../structinternal_1_1MGTransfer_1_1DoFPair.html#a0a65e606a57cb3e6f113c905a97f60c0', 1, 'internal::MGTransfer::DoFPair::global_dof_index']\n ]],\n ['global_5fdof_5findex_2eh_686', ['global_dof_index.h', ['../global__dof__index_8h.html', 1, '']]],\n ['global_5fdof_5fvalues_687', ['global_dof_values', ['../classNonMatching_1_1internal_1_1DiscreteQuadratureGeneratorImplementation_1_1RefSpaceFEFieldFunction.html#aea140d71d93864b24b365cd0d049acdf', 1, 'NonMatching::internal::DiscreteQuadratureGeneratorImplementation::RefSpaceFEFieldFunction']]],\n- ['global_5findex_688', ['global_index', ['../classinternal_1_1BlockVectorIterators_1_1Iterator.html#a49f1c385f5da45f441e8c99724c841e1', 1, 'internal::BlockVectorIterators::Iterator::global_index'],\n- ['../namespaceTrilinosWrappers.html#a0fa35a38e466d9c3b2dab8beca1df5b2', 1, 'TrilinosWrappers::global_index()'],\n+ ['global_5findex_688', ['global_index', ['../namespaceTrilinosWrappers.html#a0fa35a38e466d9c3b2dab8beca1df5b2', 1, 'TrilinosWrappers::global_index()'],\n+ ['../classinternal_1_1BlockVectorIterators_1_1Iterator.html#a49f1c385f5da45f441e8c99724c841e1', 1, 'internal::BlockVectorIterators::Iterator::global_index'],\n ['../classSparsityPatternIterators_1_1Accessor.html#a6358815e9f89a7706975c9fdc3890aa4', 1, 'SparsityPatternIterators::Accessor::global_index()']\n ]],\n ['global_5flength_689', ['global_length', ['../namespaceTrilinosWrappers.html#a1fc7a95abc642e46a4f3d3fe8d6f1d20', 1, 'TrilinosWrappers']]],\n ['global_5flevel_5fcell_5findex_690', ['global_level_cell_index', ['../classCellAccessor.html#ae8e84609c2c6afbeefdaa9096ff50dae', 1, 'CellAccessor']]],\n ['global_5flevel_5fcell_5findex_5fpartitioner_691', ['global_level_cell_index_partitioner', ['../classTriangulation.html#a6bd15347c12fa08b59fbd29551b25962', 1, 'Triangulation::global_level_cell_index_partitioner()'],\n ['../classparallel_1_1TriangulationBase.html#a22320eb97b1adcab2d0fb8482edc580b', 1, 'parallel::TriangulationBase::global_level_cell_index_partitioner()']\n ]],\n@@ -1703,20 +1703,20 @@\n ['global_5fparameter_5frepresentation_696', ['global_parameter_representation', ['../structDoFTools_1_1internal_1_1Assembler_1_1CopyData.html#a1785d066eaff462e8b396e7828f1b0ce', 1, 'DoFTools::internal::Assembler::CopyData']]],\n ['global_5fproperty_5fpool_697', ['global_property_pool', ['../classParticles_1_1Particle.html#a3c969b5bc292d02c5d4f288f12b42ce9', 1, 'Particles::Particle']]],\n ['global_5frow_698', ['global_row', ['../classScaLAPACKMatrix.html#ae2c72bf2945cab1cd8050371520629ed', 1, 'ScaLAPACKMatrix']]],\n ['global_5frow_5findex_699', ['global_row_index', ['../namespaceTrilinosWrappers.html#aaaa4a2dda466bdbb27775c45f7f82d1c', 1, 'TrilinosWrappers']]],\n ['global_5fsize_700', ['global_size', ['../classUtilities_1_1MPI_1_1Partitioner.html#a85a845b1a3a1a35329cd57858dd2f2d3', 1, 'Utilities::MPI::Partitioner']]],\n ['global_5fsymbol_5f42_701', ['global_symbol_42', ['../dummy_8cc.html#a06218cf7864c1dd433cc4e8e62bf9035', 1, 'dummy.cc']]],\n ['global_5fto_5flocal_702', ['global_to_local', ['../classBlockIndices.html#af8f0338eeb4dd28fb8cdf74b46c85f3d', 1, 'BlockIndices::global_to_local()'],\n- ['../classUtilities_1_1MPI_1_1Partitioner.html#a11316c010d3d51912cdfe1939651ad72', 1, 'Utilities::MPI::Partitioner::global_to_local()'],\n- ['../classLinearAlgebra_1_1ReadWriteVector.html#a6f246ddfbf22f0f8a54274a6540228d7', 1, 'LinearAlgebra::ReadWriteVector::global_to_local()']\n+ ['../classLinearAlgebra_1_1ReadWriteVector.html#a6f246ddfbf22f0f8a54274a6540228d7', 1, 'LinearAlgebra::ReadWriteVector::global_to_local()'],\n+ ['../classUtilities_1_1MPI_1_1Partitioner.html#a11316c010d3d51912cdfe1939651ad72', 1, 'Utilities::MPI::Partitioner::global_to_local()']\n ]],\n- ['global_5fvertex_5findex_703', ['global_vertex_index', ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a4583dc1605e3c727e723de66d63069b1', 1, 'TriaAccessor< 0, dim, spacedim >::global_vertex_index'],\n+ ['global_5fvertex_5findex_703', ['global_vertex_index', ['../namespacetypes.html#a2510b6835b1ec4a277ef342b5db6aee0', 1, 'types::global_vertex_index'],\n ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a21c20f6143a24e5f578e9413f525b6b3', 1, 'TriaAccessor< 0, 1, spacedim >::global_vertex_index'],\n- ['../namespacetypes.html#a2510b6835b1ec4a277ef342b5db6aee0', 1, 'types::global_vertex_index']\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a4583dc1605e3c727e723de66d63069b1', 1, 'TriaAccessor< 0, dim, spacedim >::global_vertex_index']\n ]],\n ['gloidx_704', ['gloidx', ['../structinternal_1_1p4est_1_1types_3_013_01_4.html#ac5cb9381f13803f7641416bc0ea5e2e5', 1, 'internal::p4est::types< 3 >::gloidx'],\n ['../structinternal_1_1p4est_1_1types_3_012_01_4.html#a712adc879560f4685424f25814aca15c', 1, 'internal::p4est::types< 2 >::gloidx']\n ]],\n ['glossary_705', ['Glossary', ['../DEALGlossary.html', 1, '']]],\n ['glossary_2eh_706', ['glossary.h', ['../glossary_8h.html', 1, '']]],\n ['gmres_707', ['gmres', ['../classTrilinosWrappers_1_1SolverBelos.html#a9f38d6d3139d6f3ebc8d11df949acf99af7b33458b897d1294a241f9dd609832e', 1, 'TrilinosWrappers::SolverBelos::gmres'],\n@@ -1725,126 +1725,126 @@\n ['gmres_5fdata_708', ['gmres_data', ['../classSolverSelector.html#a0c6e82d3ec3b17e8ff938edc787e2e28', 1, 'SolverSelector']]],\n ['gmres_5frestart_5fparameter_709', ['gmres_restart_parameter', ['../structTrilinosWrappers_1_1SolverBase_1_1AdditionalData.html#a05567d5e6ac16d6cd84257415124301e', 1, 'TrilinosWrappers::SolverBase::AdditionalData']]],\n ['gmsh_710', ['Gmsh', ['../namespaceGmsh.html', 1, '']]],\n ['gmsh_5felement_5ftype_711', ['gmsh_element_type', ['../classReferenceCell.html#a9d31423874e8e5e3e25ada9bc8193555', 1, 'ReferenceCell']]],\n ['gmv_712', ['gmv', ['../namespaceDataOutBase.html#aa3cbced9f1d4ae661f13018f4c980aa1a958eea3b2724c76d1c1ff20d69f7da4e', 1, 'DataOutBase']]],\n ['gmv_5fflags_713', ['gmv_flags', ['../classDataOutInterface.html#a62aad8dd9acbe017b15757d419d356ae', 1, 'DataOutInterface']]],\n ['gmvflags_714', ['GmvFlags', ['../structDataOutBase_1_1GmvFlags.html', 1, 'DataOutBase']]],\n- ['gnuplot_715', ['gnuplot', ['../namespaceDataOutBase.html#aa3cbced9f1d4ae661f13018f4c980aa1a025233c1a8124e5521952c7c7cd78df1', 1, 'DataOutBase::gnuplot'],\n- ['../structGridOutFlags_1_1Gnuplot.html', 1, 'GridOutFlags::Gnuplot'],\n+ ['gnuplot_715', ['gnuplot', ['../structGridOutFlags_1_1Gnuplot.html', 1, 'GridOutFlags::Gnuplot'],\n ['../structGridOutFlags_1_1Gnuplot.html#ae631c5fd2087d6efce628a2e0c7fbe21', 1, 'GridOutFlags::Gnuplot::Gnuplot()'],\n- ['../classGridOut.html#af24aadcd00f93b7f428f44ecd40c44d9a9becaeaa34ee67f9686fef40075176e6', 1, 'GridOut::gnuplot']\n+ ['../classGridOut.html#af24aadcd00f93b7f428f44ecd40c44d9a9becaeaa34ee67f9686fef40075176e6', 1, 'GridOut::gnuplot'],\n+ ['../namespaceDataOutBase.html#aa3cbced9f1d4ae661f13018f4c980aa1a025233c1a8124e5521952c7c7cd78df1', 1, 'DataOutBase::gnuplot']\n ]],\n- ['gnuplot_5fflags_716', ['gnuplot_flags', ['../classDataOutInterface.html#a8466681c18e24c0b3c7af7eae5e0997e', 1, 'DataOutInterface::gnuplot_flags'],\n- ['../classGridOut.html#a7446a2fd3ff7eebc06063371a4a94684', 1, 'GridOut::gnuplot_flags']\n+ ['gnuplot_5fflags_716', ['gnuplot_flags', ['../classGridOut.html#a7446a2fd3ff7eebc06063371a4a94684', 1, 'GridOut::gnuplot_flags'],\n+ ['../classDataOutInterface.html#a8466681c18e24c0b3c7af7eae5e0997e', 1, 'DataOutInterface::gnuplot_flags']\n ]],\n- ['gnuplotflags_717', ['gnuplotflags', ['../structDataOutBase_1_1GnuplotFlags.html#ad35b84198f0ef1de6d34ebce204afd4b', 1, 'DataOutBase::GnuplotFlags::GnuplotFlags(const std::vector< std::string > &space_dimension_labels)'],\n+ ['gnuplotflags_717', ['gnuplotflags', ['../structDataOutBase_1_1GnuplotFlags.html', 1, 'DataOutBase::GnuplotFlags'],\n ['../structDataOutBase_1_1GnuplotFlags.html#afdd33b3b9d2f0f67cf9d2e4a6b9f0cc1', 1, 'DataOutBase::GnuplotFlags::GnuplotFlags()'],\n- ['../structDataOutBase_1_1GnuplotFlags.html', 1, 'DataOutBase::GnuplotFlags']\n+ ['../structDataOutBase_1_1GnuplotFlags.html#ad35b84198f0ef1de6d34ebce204afd4b', 1, 'DataOutBase::GnuplotFlags::GnuplotFlags(const std::vector< std::string > &space_dimension_labels)']\n ]],\n- ['gnuplotpatch_718', ['gnuplotpatch', ['../classMeshWorker_1_1Assembler_1_1GnuplotPatch.html#a783e2178d20f552f5c113058d4376793', 1, 'MeshWorker::Assembler::GnuplotPatch::GnuplotPatch()'],\n- ['../classMeshWorker_1_1Assembler_1_1GnuplotPatch.html', 1, 'MeshWorker::Assembler::GnuplotPatch']\n+ ['gnuplotpatch_718', ['gnuplotpatch', ['../classMeshWorker_1_1Assembler_1_1GnuplotPatch.html', 1, 'MeshWorker::Assembler::GnuplotPatch'],\n+ ['../classMeshWorker_1_1Assembler_1_1GnuplotPatch.html#a783e2178d20f552f5c113058d4376793', 1, 'MeshWorker::Assembler::GnuplotPatch::GnuplotPatch()']\n ]],\n ['go_719', ['GO', ['../namespaceLinearAlgebra_1_1TpetraWrappers_1_1TpetraTypes.html#a12dcc4b4f9f4d4dc1b77e2f619099942', 1, 'LinearAlgebra::TpetraWrappers::TpetraTypes']]],\n ['go_5fto_5fone_720', ['go_to_one', ['../namespaceMGTransferGlobalCoarseningTools.html#a0b3ae7f7ace3aef7bdcbca73ae07c126a4700af23eb58d665b1bffa9b2d8bd01a', 1, 'MGTransferGlobalCoarseningTools']]],\n ['grad_5fdiv_2eh_721', ['grad_div.h', ['../grad__div_8h.html', 1, '']]],\n- ['gradient_722', ['gradient', ['../classFunctions_1_1CosineFunction.html#aebd93b4e32d3eba6d9ac05e4eec7d3a8', 1, 'Functions::CosineFunction::gradient()'],\n+ ['gradient_722', ['gradient', ['../classFunctions_1_1FourierCosineSum.html#ab8feb7179d0d83c32848a010e2f68da3', 1, 'Functions::FourierCosineSum::gradient()'],\n+ ['../classFunctions_1_1CutOffFunctionTensorProduct.html#ab6a9cdfd34309b8235d3192208000e7c', 1, 'Functions::CutOffFunctionTensorProduct::gradient()'],\n+ ['../classDerivativeApproximation_1_1internal_1_1Gradient.html', 1, 'DerivativeApproximation::internal::Gradient< dim >'],\n+ ['../classFunctions_1_1CutOffFunctionC1.html#ab875bab3fadc6409fd0cb614e6803634', 1, 'Functions::CutOffFunctionC1::gradient()'],\n+ ['../classFunctions_1_1FourierCosineFunction.html#ae932a6127e44639cfde188ad2f689d08', 1, 'Functions::FourierCosineFunction::gradient()'],\n+ ['../classFunctions_1_1FourierSineSum.html#a98b52849e8b87e7c64ac808daf4de5fb', 1, 'Functions::FourierSineSum::gradient()'],\n+ ['../classFunctions_1_1JumpFunction.html#a998f60b6fd8cff1a39cfcf93108c4491', 1, 'Functions::JumpFunction::gradient()'],\n+ ['../classFunctions_1_1SlitHyperSingularityFunction.html#ad4a51adc97ffbaeb072beafbadc03499', 1, 'Functions::SlitHyperSingularityFunction::gradient()'],\n ['../classFunctions_1_1SlitSingularityFunction.html#a5acef6578d995278e3a59fb4d72027cf', 1, 'Functions::SlitSingularityFunction::gradient()'],\n ['../classFunctions_1_1LSingularityGradFunction.html#af78fcfa5ce9295e029f9fe490435f656', 1, 'Functions::LSingularityGradFunction::gradient()'],\n ['../classFunctions_1_1LSingularityFunction.html#a5ecbe28dfb30b7b199699c92715eeab1', 1, 'Functions::LSingularityFunction::gradient()'],\n ['../classFunctions_1_1ExpFunction.html#a58c87396123fb892cf53ba0ec8024884', 1, 'Functions::ExpFunction::gradient()'],\n ['../classFunctions_1_1CosineGradFunction.html#a2a4a8b5be2033e435d239d5b68d3c8d6', 1, 'Functions::CosineGradFunction::gradient()'],\n- ['../classFunctions_1_1CutOffFunctionC1.html#ab875bab3fadc6409fd0cb614e6803634', 1, 'Functions::CutOffFunctionC1::gradient()'],\n- ['../classFunctions_1_1SlitHyperSingularityFunction.html#ad4a51adc97ffbaeb072beafbadc03499', 1, 'Functions::SlitHyperSingularityFunction::gradient()'],\n- ['../classFunctions_1_1JumpFunction.html#a998f60b6fd8cff1a39cfcf93108c4491', 1, 'Functions::JumpFunction::gradient()'],\n- ['../classFunctions_1_1FourierCosineFunction.html#ae932a6127e44639cfde188ad2f689d08', 1, 'Functions::FourierCosineFunction::gradient()'],\n- ['../classFunctions_1_1FourierSineFunction.html#af9fa95e62c08fa7b31e790bd47010cae', 1, 'Functions::FourierSineFunction::gradient()'],\n- ['../classFunctions_1_1FourierCosineSum.html#ab8feb7179d0d83c32848a010e2f68da3', 1, 'Functions::FourierCosineSum::gradient()'],\n- ['../classFunctions_1_1CutOffFunctionTensorProduct.html#ab6a9cdfd34309b8235d3192208000e7c', 1, 'Functions::CutOffFunctionTensorProduct::gradient()'],\n- ['../classFunctions_1_1FourierSineSum.html#a98b52849e8b87e7c64ac808daf4de5fb', 1, 'Functions::FourierSineSum::gradient()'],\n+ ['../classFunctions_1_1CosineFunction.html#aebd93b4e32d3eba6d9ac05e4eec7d3a8', 1, 'Functions::CosineFunction::gradient()'],\n ['../classFunctions_1_1PillowFunction.html#af8734c7c65977ac719b8dc2c20cfc4dd', 1, 'Functions::PillowFunction::gradient()'],\n ['../classFunctions_1_1Q1WedgeFunction.html#ad85fbdb2787f73a7d4fb68fcdee24d14', 1, 'Functions::Q1WedgeFunction::gradient()'],\n ['../classFunctions_1_1SquareFunction.html#ad83c2f3d5e293c683e53543e3455473e', 1, 'Functions::SquareFunction::gradient()'],\n ['../classFunctions_1_1CSpline.html#a8b0b05a47a4b95d0930716deccd3dc8f', 1, 'Functions::CSpline::gradient()'],\n ['../classFunctions_1_1Bessel1.html#a287c9ab516bafab96725eed9c80502f2', 1, 'Functions::Bessel1::gradient()'],\n ['../classVectorFunctionFromTensorFunction.html#a0955df9497c8389c22e932622e6ebf61', 1, 'VectorFunctionFromTensorFunction::gradient()'],\n ['../classFunctionFromFunctionObjects.html#a4a60bd11d54ca7a28d53c2b096e4a03b', 1, 'FunctionFromFunctionObjects::gradient()'],\n+ ['../classFunctions_1_1FourierSineFunction.html#af9fa95e62c08fa7b31e790bd47010cae', 1, 'Functions::FourierSineFunction::gradient()'],\n ['../namespaceinternal.html#aa5bef221c94bc6b9c5441c306a72cdbaae2b6dfb8a5c48206992d8310d176c37c', 1, 'internal::gradient'],\n ['../structNonMatching_1_1internal_1_1QuadratureGeneratorImplementation_1_1FunctionBounds.html#a190a2dff3c0dbdfe0fdc9c9283d4236b', 1, 'NonMatching::internal::QuadratureGeneratorImplementation::FunctionBounds::gradient'],\n ['../classAutoDerivativeFunction.html#a699fef370c63619a08aa94433f34136b', 1, 'AutoDerivativeFunction::gradient()'],\n ['../classFunction.html#a60dfaf4b27fbbf86e2e9b40b8836b57f', 1, 'Function::gradient()'],\n ['../classFunctions_1_1ConstantFunction.html#ab4e412532f460fe04c8d9224f5b4dd90', 1, 'Functions::ConstantFunction::gradient()'],\n ['../classFunctions_1_1IdentityFunction.html#ae1b182714c7a42a9db0547bfcced7649', 1, 'Functions::IdentityFunction::gradient()'],\n- ['../classDerivativeApproximation_1_1internal_1_1Gradient.html', 1, 'DerivativeApproximation::internal::Gradient< dim >'],\n ['../classFunctions_1_1Monomial.html#a3a572c2af7c1174ce2ff316dd77aafe5', 1, 'Functions::Monomial::gradient()'],\n ['../classFunctions_1_1Spherical.html#a578a604ff2b45b4261cc40eca64f20e0', 1, 'Functions::Spherical::gradient()'],\n ['../classNonMatching_1_1internal_1_1DiscreteQuadratureGeneratorImplementation_1_1RefSpaceFEFieldFunction.html#a169fce204d6f37defaab6c87721aebc2', 1, 'NonMatching::internal::DiscreteQuadratureGeneratorImplementation::RefSpaceFEFieldFunction::gradient()'],\n ['../classFunctions_1_1FEFieldFunction.html#a298269556af8667b9adbfef322c4ae57', 1, 'Functions::FEFieldFunction::gradient()'],\n ['../classFEValuesViews_1_1Tensor_3_012_00_01dim_00_01spacedim_01_4.html#aa58cffa16a48be95e37cd76f8f416555', 1, 'FEValuesViews::Tensor< 2, dim, spacedim >::gradient()'],\n ['../classFEValuesViews_1_1Vector.html#a749be2d4827bdfb9c3df8f8e3ba1b066', 1, 'FEValuesViews::Vector::gradient()'],\n ['../classFEValuesViews_1_1Scalar.html#a2c9a7415cea23e0d3e9b405f30fc56ac', 1, 'FEValuesViews::Scalar::gradient()'],\n ['../classFEValuesViews_1_1RenumberedView.html#a1a4b604451ecf9331b29473fb3c5cab5', 1, 'FEValuesViews::RenumberedView::gradient()'],\n ['../structDifferentiation_1_1AD_1_1TapelessDrivers.html#a092dfc71f6a8dc3a23a29c683ca0f19c', 1, 'Differentiation::AD::TapelessDrivers::gradient()'],\n ['../structDifferentiation_1_1AD_1_1TapedDrivers.html#a24835c2c731a7d4d69d90d95bdaae270', 1, 'Differentiation::AD::TapedDrivers::gradient()'],\n ['../classConstantTensorFunction.html#aab6a061147fdc853dea510e931bb4f30', 1, 'ConstantTensorFunction::gradient()'],\n ['../classTensorFunction.html#a49064481c7e7a64525109f030ad43cd7', 1, 'TensorFunction::gradient()'],\n ['../classFunctions_1_1Spherical.html#a6d63ed3ec94f9fbaab1f107e1bf19af1', 1, 'Functions::Spherical::gradient()'],\n- ['../classFunctions_1_1SymbolicFunction.html#ab2eeb7da7fe4944fad9f4d3da5a9933f', 1, 'Functions::SymbolicFunction::gradient()'],\n- ['../classFunctions_1_1InterpolatedTensorProductGridData.html#ab559d17f99e63ef67574a21f83372c84', 1, 'Functions::InterpolatedTensorProductGridData::gradient()'],\n- ['../classFunctions_1_1InterpolatedUniformGridData.html#a601c763590643a75e85a41ee4c3a56a0', 1, 'Functions::InterpolatedUniformGridData::gradient()'],\n+ ['../classFunctions_1_1SignedDistance_1_1Ellipsoid.html#a0d8df3f2111460fb60aa5bc990af801e', 1, 'Functions::SignedDistance::Ellipsoid::gradient()'],\n+ ['../classFunctions_1_1SignedDistance_1_1Plane.html#ab85307507c3055d4584fe0aa0104d8ae', 1, 'Functions::SignedDistance::Plane::gradient()'],\n+ ['../classFunctions_1_1SignedDistance_1_1Sphere.html#afaec76137ca08a84aea6dd11682cb1f9', 1, 'Functions::SignedDistance::Sphere::gradient()'],\n+ ['../classFunctions_1_1PointRestriction.html#a4d63b6319eb9ad77a25584cb38f695b2', 1, 'Functions::PointRestriction::gradient()'],\n+ ['../classFunctions_1_1CoordinateRestriction.html#a8185d25e0428169386e22b98c9fd9963', 1, 'Functions::CoordinateRestriction::gradient()'],\n ['../classFunctions_1_1CutOffFunctionCinfty.html#a615ce24fea527714e0d261b8a4d0c452', 1, 'Functions::CutOffFunctionCinfty::gradient()'],\n ['../classFunctions_1_1Polynomial.html#a77d0c30da2bf5d122ca6f05c4c84009c', 1, 'Functions::Polynomial::gradient()'],\n- ['../classFunctions_1_1CoordinateRestriction.html#a8185d25e0428169386e22b98c9fd9963', 1, 'Functions::CoordinateRestriction::gradient()'],\n- ['../classFunctions_1_1PointRestriction.html#a4d63b6319eb9ad77a25584cb38f695b2', 1, 'Functions::PointRestriction::gradient()'],\n- ['../classFunctions_1_1SignedDistance_1_1Sphere.html#afaec76137ca08a84aea6dd11682cb1f9', 1, 'Functions::SignedDistance::Sphere::gradient()'],\n- ['../classFunctions_1_1SignedDistance_1_1Plane.html#ab85307507c3055d4584fe0aa0104d8ae', 1, 'Functions::SignedDistance::Plane::gradient()'],\n- ['../classFunctions_1_1SignedDistance_1_1Ellipsoid.html#a0d8df3f2111460fb60aa5bc990af801e', 1, 'Functions::SignedDistance::Ellipsoid::gradient()']\n+ ['../classFunctions_1_1InterpolatedUniformGridData.html#a601c763590643a75e85a41ee4c3a56a0', 1, 'Functions::InterpolatedUniformGridData::gradient()'],\n+ ['../classFunctions_1_1InterpolatedTensorProductGridData.html#ab559d17f99e63ef67574a21f83372c84', 1, 'Functions::InterpolatedTensorProductGridData::gradient()'],\n+ ['../classFunctions_1_1SymbolicFunction.html#ab2eeb7da7fe4944fad9f4d3da5a9933f', 1, 'Functions::SymbolicFunction::gradient()']\n ]],\n ['gradient_5findex_723', ['gradient_index', ['../classMeshWorker_1_1VectorSelector.html#affc53cab05328d7fc666524b21fc7f42', 1, 'MeshWorker::VectorSelector']]],\n- ['gradient_5flist_724', ['gradient_list', ['../classFunctions_1_1PillowFunction.html#a4e96cefde0b80abe20e5ed8bc3ab1e56', 1, 'Functions::PillowFunction::gradient_list()'],\n- ['../classFunctions_1_1CosineFunction.html#affdb0def2e5b8550676051db6bb72f97', 1, 'Functions::CosineFunction::gradient_list()'],\n- ['../classFunctions_1_1CosineGradFunction.html#a73a866f092b490be9573655e89676c0e', 1, 'Functions::CosineGradFunction::gradient_list()'],\n- ['../classFunctions_1_1ExpFunction.html#af45d5d1815cd6f751926ea6cf5d28570', 1, 'Functions::ExpFunction::gradient_list()'],\n- ['../classFunctions_1_1LSingularityFunction.html#ade0770ece16df13dff4e532f49a6e28a', 1, 'Functions::LSingularityFunction::gradient_list()'],\n- ['../classFunctions_1_1LSingularityGradFunction.html#aeefc4e750fc67ae8f1ba7bd02c556748', 1, 'Functions::LSingularityGradFunction::gradient_list()'],\n- ['../classFunctions_1_1SlitSingularityFunction.html#a7fc24669069be569636f1c225f60c971', 1, 'Functions::SlitSingularityFunction::gradient_list()'],\n- ['../classFunctions_1_1SlitHyperSingularityFunction.html#a6e145f8c858ab4947e55a76df5b81996', 1, 'Functions::SlitHyperSingularityFunction::gradient_list()'],\n- ['../classFunctions_1_1JumpFunction.html#ababedd6fc8d17aa80220f439f3946e5b', 1, 'Functions::JumpFunction::gradient_list()'],\n+ ['gradient_5flist_724', ['gradient_list', ['../classFunctions_1_1JumpFunction.html#ababedd6fc8d17aa80220f439f3946e5b', 1, 'Functions::JumpFunction::gradient_list()'],\n ['../classTensorFunction.html#ac2b9389efaf1690f7e7b25d6dbbf654c', 1, 'TensorFunction::gradient_list()'],\n ['../classConstantTensorFunction.html#ad32663adb2d5cfd7c3980f40df2ea3e1', 1, 'ConstantTensorFunction::gradient_list()'],\n- ['../classFunctions_1_1Bessel1.html#a5ac9affe25ecfcfeeb016aca46177122', 1, 'Functions::Bessel1::gradient_list()'],\n ['../classFunctions_1_1FEFieldFunction.html#a7c6bf60f93ffffd446db9f2b16f002f3', 1, 'Functions::FEFieldFunction::gradient_list()'],\n+ ['../classFunctions_1_1SlitHyperSingularityFunction.html#a6e145f8c858ab4947e55a76df5b81996', 1, 'Functions::SlitHyperSingularityFunction::gradient_list()'],\n+ ['../classFunctions_1_1SlitSingularityFunction.html#a7fc24669069be569636f1c225f60c971', 1, 'Functions::SlitSingularityFunction::gradient_list()'],\n+ ['../classFunctions_1_1LSingularityGradFunction.html#aeefc4e750fc67ae8f1ba7bd02c556748', 1, 'Functions::LSingularityGradFunction::gradient_list()'],\n+ ['../classFunctions_1_1LSingularityFunction.html#ade0770ece16df13dff4e532f49a6e28a', 1, 'Functions::LSingularityFunction::gradient_list()'],\n+ ['../classFunctions_1_1ExpFunction.html#af45d5d1815cd6f751926ea6cf5d28570', 1, 'Functions::ExpFunction::gradient_list()'],\n+ ['../classFunctions_1_1CosineGradFunction.html#a73a866f092b490be9573655e89676c0e', 1, 'Functions::CosineGradFunction::gradient_list()'],\n+ ['../classFunctions_1_1CosineFunction.html#affdb0def2e5b8550676051db6bb72f97', 1, 'Functions::CosineFunction::gradient_list()'],\n+ ['../classFunctions_1_1PillowFunction.html#a4e96cefde0b80abe20e5ed8bc3ab1e56', 1, 'Functions::PillowFunction::gradient_list()'],\n ['../classFunctions_1_1Q1WedgeFunction.html#a007ee4fdcae68b911c59636132600f4c', 1, 'Functions::Q1WedgeFunction::gradient_list()'],\n- ['../classAutoDerivativeFunction.html#aefb93d9e7a78678fb9b31239841c3ab0', 1, 'AutoDerivativeFunction::gradient_list()'],\n- ['../classFunction.html#a4603183dfa66622a4dc428aeb32a4452', 1, 'Function::gradient_list()'],\n- ['../classFunctions_1_1ConstantFunction.html#a5a42d62ced01537957099fc15fcc48bd', 1, 'Functions::ConstantFunction::gradient_list()'],\n+ ['../classFunctions_1_1SquareFunction.html#a83c5fd2ee3398f36c891081473d062d7', 1, 'Functions::SquareFunction::gradient_list()'],\n+ ['../classFunctions_1_1Bessel1.html#a5ac9affe25ecfcfeeb016aca46177122', 1, 'Functions::Bessel1::gradient_list()'],\n ['../classVectorFunctionFromTensorFunction.html#a9d3ebb52ed20ba65c5d0edf641e16ed5', 1, 'VectorFunctionFromTensorFunction::gradient_list()'],\n- ['../classFunctions_1_1SquareFunction.html#a83c5fd2ee3398f36c891081473d062d7', 1, 'Functions::SquareFunction::gradient_list()']\n+ ['../classFunctions_1_1ConstantFunction.html#a5a42d62ced01537957099fc15fcc48bd', 1, 'Functions::ConstantFunction::gradient_list()'],\n+ ['../classFunction.html#a4603183dfa66622a4dc428aeb32a4452', 1, 'Function::gradient_list()'],\n+ ['../classAutoDerivativeFunction.html#aefb93d9e7a78678fb9b31239841c3ab0', 1, 'AutoDerivativeFunction::gradient_list()']\n ]],\n ['gradient_5fmatrix_725', ['gradient_matrix', ['../namespaceLocalIntegrators_1_1Divergence.html#ad708d69e74c34829387629c5d770bd1c', 1, 'LocalIntegrators::Divergence']]],\n ['gradient_5fresidual_726', ['gradient_residual', ['../namespaceLocalIntegrators_1_1Divergence.html#ab7fd6d21f74e11f38386f415527c1721', 1, 'LocalIntegrators::Divergence::gradient_residual(Vector< number > &result, const FEValuesBase< dim > &fetest, const std::vector< double > &input, const double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Divergence.html#a49b84c8d36c4c8800cd63b7a3b184299', 1, 'LocalIntegrators::Divergence::gradient_residual(Vector< number > &result, const FEValuesBase< dim > &fetest, const std::vector< Tensor< 1, dim > > &input, const double factor=1.)']\n ]],\n ['gradient_5fselection_727', ['gradient_selection', ['../classMeshWorker_1_1VectorSelector.html#ab7f18113d9f7d9900506f2e2b46df483', 1, 'MeshWorker::VectorSelector']]],\n- ['gradient_5ftype_728', ['gradient_type', ['../classFEInterfaceViews_1_1Scalar.html#a76d9164cdeaf79c291bf322fe1abe758', 1, 'FEInterfaceViews::Scalar::gradient_type'],\n- ['../classFEPointEvaluation.html#a6e4f8061b480e0831faac8a5a2318922', 1, 'FEPointEvaluation::gradient_type'],\n+ ['gradient_5ftype_728', ['gradient_type', ['../classFEValuesViews_1_1Scalar.html#a365b47766d644b4c6a50ad941e8ece6e', 1, 'FEValuesViews::Scalar::gradient_type'],\n ['../classFEInterfaceViews_1_1Vector.html#ac9411ad24b0d5836374a90f5c47968ae', 1, 'FEInterfaceViews::Vector::gradient_type'],\n- ['../classFEValuesViews_1_1Scalar.html#a365b47766d644b4c6a50ad941e8ece6e', 1, 'FEValuesViews::Scalar::gradient_type'],\n+ ['../classFEInterfaceViews_1_1Scalar.html#a76d9164cdeaf79c291bf322fe1abe758', 1, 'FEInterfaceViews::Scalar::gradient_type'],\n+ ['../classFEValuesViews_1_1RenumberedView.html#aa0a3f0825797a6cc0b29bca28b920a0d', 1, 'FEValuesViews::RenumberedView::gradient_type'],\n+ ['../classFEFaceEvaluation.html#ad5ac66f58cec9630c76cc0f29f9d497e', 1, 'FEFaceEvaluation::gradient_type'],\n+ ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1SymmetricTensor_3_012_01_4_01_4.html#a808c6e31a2c9c0892c49a49cf9f2febb', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::SymmetricTensor< 2 > >::gradient_type'],\n ['../classFEValuesViews_1_1Vector.html#a3136b8a6daa13014856ba61f290aba58', 1, 'FEValuesViews::Vector::gradient_type'],\n ['../classFEValuesViews_1_1Tensor_3_012_00_01dim_00_01spacedim_01_4.html#a89ee7d04e0b843012317e1bd8c3d8265', 1, 'FEValuesViews::Tensor< 2, dim, spacedim >::gradient_type'],\n ['../classFEEvaluationBase.html#a5e13ff564ace863c84f87940e255f41d', 1, 'FEEvaluationBase::gradient_type'],\n- ['../classinternal_1_1PrecomputedEvaluationDataAccessor.html#ad0f084ad37ae702dc49679fbefeead7b', 1, 'internal::PrecomputedEvaluationDataAccessor::gradient_type'],\n ['../classPortable_1_1FEEvaluation.html#a71fd2cf86193d5940fd3f662f7290d5d', 1, 'Portable::FEEvaluation::gradient_type'],\n+ ['../classinternal_1_1PrecomputedEvaluationDataAccessor.html#ad0f084ad37ae702dc49679fbefeead7b', 1, 'internal::PrecomputedEvaluationDataAccessor::gradient_type'],\n ['../structinternal_1_1PrecomputedEvaluationData.html#ad0a460380c778dd1164026084dbf872d', 1, 'internal::PrecomputedEvaluationData::gradient_type'],\n ['../classFEFacePointEvaluation.html#a71fb8499099a290bca360aedd44b8f97', 1, 'FEFacePointEvaluation::gradient_type'],\n- ['../classFEFaceEvaluation.html#ad5ac66f58cec9630c76cc0f29f9d497e', 1, 'FEFaceEvaluation::gradient_type'],\n+ ['../classFEPointEvaluation.html#a6e4f8061b480e0831faac8a5a2318922', 1, 'FEPointEvaluation::gradient_type'],\n ['../classFEPointEvaluationBase.html#ad7b179b70c640ab282b1bd58dd2b0fd2', 1, 'FEPointEvaluationBase::gradient_type'],\n- ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1SymmetricTensor_3_012_01_4_01_4.html#a808c6e31a2c9c0892c49a49cf9f2febb', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::SymmetricTensor< 2 > >::gradient_type'],\n ['../classFEEvaluation.html#a8a40f0bccb9db6ed543f7800a824f930', 1, 'FEEvaluation::gradient_type'],\n- ['../classFEValuesViews_1_1RenumberedView.html#aa0a3f0825797a6cc0b29bca28b920a0d', 1, 'FEValuesViews::RenumberedView::gradient_type'],\n ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Tensor_3_012_01_4_01_4.html#a23a4be2a20b4a45c61f217e92f0d7ec7', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Tensor< 2 > >::gradient_type'],\n ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Tensor_3_011_01_4_01_4.html#ad6d4eee86c4c861aac2e08662b7e0b9e', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Tensor< 1 > >::gradient_type'],\n ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Vector_01_4.html#a816d68b7911faef5026583c3e75ba83f', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Vector >::gradient_type'],\n ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Scalar_01_4.html#a565de2667cc147db27b0f221fecf9d4a', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Scalar >::gradient_type'],\n ['../classTensorFunction.html#a1560a439470c14b426e28a72fc08e252', 1, 'TensorFunction::gradient_type']\n ]],\n ['gradients_729', ['gradients', ['../structPortable_1_1internal_1_1EvaluatorTensorProduct_3_01evaluate__general_00_01dim_00_01fe__dega8134ecf00d3c979bab5bfb2c3980f13.html#ae9965c122a68910e50079a74941541c2', 1, 'Portable::internal::EvaluatorTensorProduct< evaluate_general, dim, fe_degree, n_q_points_1d, Number >::gradients()'],\n@@ -1865,18 +1865,18 @@\n ]],\n ['gradients_5fquad_733', ['gradients_quad', ['../classFEEvaluationData.html#a11c94c5e2492db775df00631b99f2c3c', 1, 'FEEvaluationData']]],\n ['gradients_5fquad_5finitialized_734', ['gradients_quad_initialized', ['../classFEEvaluationData.html#a6118052e91b09cf12d5051e1b29b49f7', 1, 'FEEvaluationData']]],\n ['gradients_5fquad_5fsubmitted_735', ['gradients_quad_submitted', ['../classFEEvaluationData.html#a980080cfd9249384b4cafaf4261b7654', 1, 'FEEvaluationData']]],\n ['gradients_5fwithin_5fsubface_736', ['gradients_within_subface', ['../structinternal_1_1MatrixFreeFunctions_1_1UnivariateShapeData.html#affbc72772c45175bf7e1f303477b6c53', 1, 'internal::MatrixFreeFunctions::UnivariateShapeData']]],\n ['gradientvector_737', ['GradientVector', ['../classinternal_1_1FEValuesImplementation_1_1FiniteElementRelatedData.html#a435a591d936013e27b62ab3d95300edb', 1, 'internal::FEValuesImplementation::FiniteElementRelatedData']]],\n ['gradtype_738', ['GradType', ['../classBarycentricPolynomials.html#a21c692d805e173963b9f36e51990bc4e', 1, 'BarycentricPolynomials']]],\n- ['graph_739', ['graph', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern.html#a0b86c71fdbfa142a0681c8a7b6365237', 1, 'LinearAlgebra::TpetraWrappers::SparsityPattern::graph'],\n- ['../classPortable_1_1MatrixFree.html#a1b061d43e6028b803dcfb85ab6f13c1c', 1, 'Portable::MatrixFree::graph'],\n- ['../namespaceDoFRenumbering_1_1boost_1_1boosttypes.html#acaee4366d1567663daae1e81b7716233', 1, 'DoFRenumbering::boost::boosttypes::Graph'],\n- ['../classTrilinosWrappers_1_1SparsityPattern.html#a35f91d854cbcbfea97bf753ef967a704', 1, 'TrilinosWrappers::SparsityPattern::graph']\n+ ['graph_739', ['graph', ['../classPortable_1_1MatrixFree.html#a1b061d43e6028b803dcfb85ab6f13c1c', 1, 'Portable::MatrixFree::graph'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern.html#a0b86c71fdbfa142a0681c8a7b6365237', 1, 'LinearAlgebra::TpetraWrappers::SparsityPattern::graph'],\n+ ['../classTrilinosWrappers_1_1SparsityPattern.html#a35f91d854cbcbfea97bf753ef967a704', 1, 'TrilinosWrappers::SparsityPattern::graph'],\n+ ['../namespaceDoFRenumbering_1_1boost_1_1boosttypes.html#acaee4366d1567663daae1e81b7716233', 1, 'DoFRenumbering::boost::boosttypes::Graph']\n ]],\n ['graph_5fcoloring_2ecc_740', ['graph_coloring.cc', ['../graph__coloring_8cc.html', 1, '']]],\n ['graph_5fcoloring_2eh_741', ['graph_coloring.h', ['../graph__coloring_8h.html', 1, '']]],\n ['graphcoloring_742', ['GraphColoring', ['../namespaceGraphColoring.html', 1, '']]],\n ['graphcoloring_3a_3ainternal_743', ['internal', ['../namespaceGraphColoring_1_1internal.html', 1, 'GraphColoring']]],\n ['graphical_20output_744', ['Graphical output', ['../group__output.html', 1, '']]],\n ['graphtype_745', ['GraphType', ['../namespaceLinearAlgebra_1_1TpetraWrappers_1_1TpetraTypes.html#a948048ee43686de403afa46220b5f0a9', 1, 'LinearAlgebra::TpetraWrappers::TpetraTypes']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -558,22 +558,22 @@\n ['petscwrappers_300', ['petscwrappers', ['../namespacePETScWrappers.html', 1, 'PETScWrappers'],\n ['../group__PETScWrappers.html', 1, 'PETScWrappers']\n ]],\n ['petscwrappers_3a_3ainternal_301', ['internal', ['../namespacePETScWrappers_1_1internal.html', 1, 'PETScWrappers']]],\n ['petscwrappers_3a_3ainternals_302', ['internals', ['../namespacePETScWrappers_1_1internals.html', 1, 'PETScWrappers']]],\n ['petscwrappers_3a_3amatrixiterators_303', ['MatrixIterators', ['../namespacePETScWrappers_1_1MatrixIterators.html', 1, 'PETScWrappers']]],\n ['petscwrappers_3a_3ampi_304', ['MPI', ['../namespacePETScWrappers_1_1MPI.html', 1, 'PETScWrappers']]],\n- ['pex_305', ['pex', ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1PEX.html#a8cc4e471cdb7ce9c8f6d040069b740a1', 1, 'Utilities::MPI::ConsensusAlgorithms::PEX::PEX()'],\n- ['../namespaceUtilities_1_1MPI_1_1ConsensusAlgorithms.html#ae25940905d374060a91ad2ea5f93b894', 1, 'Utilities::MPI::ConsensusAlgorithms::pex(const std::vector< unsigned int > &targets, const std::function< RequestType(const unsigned int)> &create_request, const std::function< AnswerType(const unsigned int, const RequestType &)> &answer_request, const std::function< void(const unsigned int, const AnswerType &)> &process_answer, const MPI_Comm comm)'],\n- ['../namespaceUtilities_1_1MPI_1_1ConsensusAlgorithms.html#af8bb38892767188ade0256558b119bfc', 1, 'Utilities::MPI::ConsensusAlgorithms::pex(const std::vector< unsigned int > &targets, const std::function< RequestType(const unsigned int)> &create_request, const std::function< void(const unsigned int, const RequestType &)> &process_request, const MPI_Comm comm)'],\n- ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1PEX.html', 1, 'Utilities::MPI::ConsensusAlgorithms::PEX< RequestType, AnswerType >']\n+ ['pex_305', ['pex', ['../namespaceUtilities_1_1MPI_1_1ConsensusAlgorithms.html#ae25940905d374060a91ad2ea5f93b894', 1, 'Utilities::MPI::ConsensusAlgorithms::pex(const std::vector< unsigned int > &targets, const std::function< RequestType(const unsigned int)> &create_request, const std::function< AnswerType(const unsigned int, const RequestType &)> &answer_request, const std::function< void(const unsigned int, const AnswerType &)> &process_answer, const MPI_Comm comm)'],\n+ ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1PEX.html', 1, 'Utilities::MPI::ConsensusAlgorithms::PEX< RequestType, AnswerType >'],\n+ ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1PEX.html#a8cc4e471cdb7ce9c8f6d040069b740a1', 1, 'Utilities::MPI::ConsensusAlgorithms::PEX::PEX()'],\n+ ['../namespaceUtilities_1_1MPI_1_1ConsensusAlgorithms.html#af8bb38892767188ade0256558b119bfc', 1, 'Utilities::MPI::ConsensusAlgorithms::pex()']\n ]],\n ['physical_5funits_306', ['physical_units', ['../structDataOutBase_1_1VtkFlags.html#a6edd0f24133d33ae6ec4964dd7661b2a', 1, 'DataOutBase::VtkFlags']]],\n- ['physics_307', ['physics', ['../namespacePhysics.html', 1, 'Physics'],\n- ['../group__physics.html', 1, 'Physics']\n+ ['physics_307', ['physics', ['../group__physics.html', 1, 'Physics'],\n+ ['../namespacePhysics.html', 1, 'Physics']\n ]],\n ['physics_2eh_308', ['physics.h', ['../physics_8h.html', 1, '']]],\n ['physics_3a_3aelasticity_309', ['Elasticity', ['../namespacePhysics_1_1Elasticity.html', 1, 'Physics']]],\n ['physics_3a_3aelasticity_3a_3akinematics_310', ['Kinematics', ['../namespacePhysics_1_1Elasticity_1_1Kinematics.html', 1, 'Physics::Elasticity']]],\n ['physics_3a_3anotation_311', ['Notation', ['../namespacePhysics_1_1Notation.html', 1, 'Physics']]],\n ['physics_3a_3anotation_3a_3akelvin_312', ['Kelvin', ['../namespacePhysics_1_1Notation_1_1Kelvin.html', 1, 'Physics::Notation']]],\n ['physics_3a_3atransformations_313', ['Transformations', ['../namespacePhysics_1_1Transformations.html', 1, 'Physics']]],\n@@ -584,66 +584,66 @@\n ['physics_3a_3avectorrelations_318', ['VectorRelations', ['../namespacePhysics_1_1VectorRelations.html', 1, 'Physics']]],\n ['pi_319', ['PI', ['../namespacenumbers.html#a3e24f194a9cb9b6ff4442b8a7a877d4a', 1, 'numbers']]],\n ['pi_5f2_320', ['PI_2', ['../namespacenumbers.html#a05c8aa45b7cf3c1c746cdf79e44dcffe', 1, 'numbers']]],\n ['pi_5f4_321', ['PI_4', ['../namespacenumbers.html#aa36e80e99e5c662879bd3f89c8b9f0e4', 1, 'numbers']]],\n ['picard_322', ['picard', ['../classNonlinearSolverSelector_1_1AdditionalData.html#a2dd69fb6550aa48fecc20a58123869a0a189283de8e82751183a7c21be498f4eb', 1, 'NonlinearSolverSelector::AdditionalData::picard'],\n ['../classSUNDIALS_1_1KINSOL_1_1AdditionalData.html#a6160e0cd736c36f42c25a05eeb7ec079a3b45671a6573d03b922841a3b16b9dbb', 1, 'SUNDIALS::KINSOL::AdditionalData::picard']\n ]],\n- ['piecewisepolynomial_323', ['piecewisepolynomial', ['../classPolynomials_1_1PiecewisePolynomial.html', 1, 'Polynomials::PiecewisePolynomial< number >'],\n- ['../classPolynomials_1_1PiecewisePolynomial.html#aa87f48bdebc569ac84076a1defb80909', 1, 'Polynomials::PiecewisePolynomial::PiecewisePolynomial(const std::vector< Point< 1, number > > &points, const unsigned int index)'],\n- ['../classPolynomials_1_1PiecewisePolynomial.html#a1e98b7fabac18e3ac0a95c4487682a47', 1, 'Polynomials::PiecewisePolynomial::PiecewisePolynomial(const Polynomial< number > &coefficients_on_interval, const unsigned int n_intervals, const unsigned int interval, const bool spans_next_interval)']\n+ ['piecewisepolynomial_323', ['piecewisepolynomial', ['../classPolynomials_1_1PiecewisePolynomial.html#a1e98b7fabac18e3ac0a95c4487682a47', 1, 'Polynomials::PiecewisePolynomial::PiecewisePolynomial()'],\n+ ['../classPolynomials_1_1PiecewisePolynomial.html', 1, 'Polynomials::PiecewisePolynomial< number >'],\n+ ['../classPolynomials_1_1PiecewisePolynomial.html#aa87f48bdebc569ac84076a1defb80909', 1, 'Polynomials::PiecewisePolynomial::PiecewisePolynomial()']\n ]],\n ['pillowfunction_324', ['pillowfunction', ['../classFunctions_1_1PillowFunction.html', 1, 'Functions::PillowFunction< dim >'],\n ['../classFunctions_1_1PillowFunction.html#ada5b2f3bfbb10e5e3484a359a3664145', 1, 'Functions::PillowFunction::PillowFunction()']\n ]],\n ['pipe_5fjunction_325', ['pipe_junction', ['../namespaceGridGenerator.html#a673c458200304475d60b98ae389a309b', 1, 'GridGenerator']]],\n ['pipesegment_326', ['PipeSegment', ['../namespacePipeSegment.html', 1, '']]],\n ['pivoting_327', ['pivoting', ['../structPETScWrappers_1_1PreconditionLU_1_1AdditionalData.html#ad3b4930e350d425af5e27c1c6045c8f4', 1, 'PETScWrappers::PreconditionLU::AdditionalData']]],\n ['plain_5fdof_5findices_328', ['plain_dof_indices', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#ac8a3ff65aba921897310b903e288ceb2', 1, 'internal::MatrixFreeFunctions::DoFInfo::plain_dof_indices'],\n ['../classinternal_1_1MatrixFreeFunctions_1_1ConstraintInfo.html#a64f011a9343bf2806eba66109c841fa1', 1, 'internal::MatrixFreeFunctions::ConstraintInfo::plain_dof_indices']\n ]],\n ['plain_5fdof_5findices_5fper_5fcell_329', ['plain_dof_indices_per_cell', ['../classinternal_1_1MatrixFreeFunctions_1_1ConstraintInfo.html#a4b26f3a8e9d8fa63ff70d4cdc0110669', 1, 'internal::MatrixFreeFunctions::ConstraintInfo']]],\n ['plain_5ftext_330', ['plain_text', ['../namespaceDataOutBase.html#af036f347f3e7f48a0e602577905fb3c9a10504904240f7c7a24587ef9209b3f55', 1, 'DataOutBase']]],\n- ['plane_331', ['plane', ['../classFunctions_1_1SignedDistance_1_1Plane.html#a6e14ae85193bd3575b1a3ecb48edf38a', 1, 'Functions::SignedDistance::Plane::Plane()'],\n- ['../classFunctions_1_1SignedDistance_1_1Plane.html', 1, 'Functions::SignedDistance::Plane< dim >']\n+ ['plane_331', ['plane', ['../classFunctions_1_1SignedDistance_1_1Plane.html', 1, 'Functions::SignedDistance::Plane< dim >'],\n+ ['../classFunctions_1_1SignedDistance_1_1Plane.html#a6e14ae85193bd3575b1a3ecb48edf38a', 1, 'Functions::SignedDistance::Plane::Plane()']\n ]],\n ['plate_5fwith_5fa_5fhole_332', ['plate_with_a_hole', ['../namespaceGridGenerator.html#a1cef2def7a0b1ce88eef4ec630b1e3b8', 1, 'GridGenerator']]],\n ['plus_333', ['plus', ['../classRol_1_1VectorAdaptor.html#ad38d3d8ef95463debbb0165f7c22d704', 1, 'Rol::VectorAdaptor']]],\n- ['pocon_334', ['pocon', ['../lapack__templates_8h.html#a4420399a6c63b889cadb9bf82246d559', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const std::complex< float > *a, const ::types::blas_int *lda, const float *anorm, float *rcond, std::complex< float > *work, float *rwork, ::types::blas_int *info): lapack_templates.h'],\n+ ['pocon_334', ['pocon', ['../lapack__templates_8h.html#a40dff1d35b2a0f5b27f6297bcdc437af', 1, 'pocon(const char *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, const number2 *, number3 *, number4 *, ::types::blas_int *, ::types::blas_int *): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#aef431a4db93d812efe1000c00a0ccd45', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const std::complex< double > *a, const ::types::blas_int *lda, const double *anorm, double *rcond, std::complex< double > *work, double *rwork, ::types::blas_int *info): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#a4420399a6c63b889cadb9bf82246d559', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const std::complex< float > *a, const ::types::blas_int *lda, const float *anorm, float *rcond, std::complex< float > *work, float *rwork, ::types::blas_int *info): lapack_templates.h'],\n ['../lapack__templates_8h.html#aa3c24b5c257f22b94abebb8248b59c6c', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const double *a, const ::types::blas_int *lda, const double *anorm, double *rcond, double *work, ::types::blas_int *iwork, ::types::blas_int *info): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a4f39ac546c9115f24754d365028eae6a', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const float *a, const ::types::blas_int *lda, const float *anorm, float *rcond, float *work, ::types::blas_int *iwork, ::types::blas_int *info): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a40dff1d35b2a0f5b27f6297bcdc437af', 1, 'pocon(const char *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, const number2 *, number3 *, number4 *, ::types::blas_int *, ::types::blas_int *): lapack_templates.h'],\n- ['../lapack__templates_8h.html#aef431a4db93d812efe1000c00a0ccd45', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const std::complex< double > *a, const ::types::blas_int *lda, const double *anorm, double *rcond, std::complex< double > *work, double *rwork, ::types::blas_int *info): lapack_templates.h']\n+ ['../lapack__templates_8h.html#a4f39ac546c9115f24754d365028eae6a', 1, 'pocon(const char *uplo, const ::types::blas_int *n, const float *a, const ::types::blas_int *lda, const float *anorm, float *rcond, float *work, ::types::blas_int *iwork, ::types::blas_int *info): lapack_templates.h']\n ]],\n- ['point_335', ['point', ['../classPoint.html#a90772f600d22f6e2f580f58111055b49', 1, 'Point::Point()'],\n+ ['point_335', ['point', ['../classPoint.html#a776e6e3d8f28d1d462b222924b2b648b', 1, 'Point::Point()'],\n+ ['../namespaceOpenCASCADE.html#aa3c9ea93645e89d325289cb9d8b14788', 1, 'OpenCASCADE::point()'],\n+ ['../classFunctions_1_1PointRestriction.html#a8931a676106b37def1bf548060274a49', 1, 'Functions::PointRestriction::point'],\n+ ['../classQuadrature.html#a6c4d059aebcd62ba03c70c1a11cc2053', 1, 'Quadrature::point()'],\n+ ['../classPoint.html#a90772f600d22f6e2f580f58111055b49', 1, 'Point::Point()'],\n ['../classPoint.html#a84324443e6024fb48cf3d1732620b7d0', 1, 'Point::Point(const Tensor< 1, dim, Number > &)'],\n- ['../classPoint.html#a776e6e3d8f28d1d462b222924b2b648b', 1, 'Point::Point(const Number x)'],\n+ ['../namespaceOpenCASCADE.html#a7b0b2393711bae58d859be1bb9761781', 1, 'OpenCASCADE::point()'],\n ['../classPoint.html#a4a4b14271d1a830a7007d63e4e5ec9a3', 1, 'Point::Point(const Number x, const Number y)'],\n ['../classPoint.html#a62d4135b23cae2e3d112783d03486f1a', 1, 'Point::Point(const Number x, const Number y, const Number z)'],\n- ['../classPoint.html', 1, 'Point< dim, Number >'],\n- ['../classQuadrature.html#a6c4d059aebcd62ba03c70c1a11cc2053', 1, 'Quadrature::point()'],\n- ['../classFunctions_1_1PointRestriction.html#a8931a676106b37def1bf548060274a49', 1, 'Functions::PointRestriction::point'],\n- ['../classPoint.html#a298faf034066a5a5ae78449170b4f276', 1, 'Point::Point()'],\n- ['../namespaceOpenCASCADE.html#aa3c9ea93645e89d325289cb9d8b14788', 1, 'OpenCASCADE::point(const Point< spacedim > &p)'],\n- ['../namespaceOpenCASCADE.html#a7b0b2393711bae58d859be1bb9761781', 1, 'OpenCASCADE::point(const gp_Pnt &p, const double tolerance=1e-10)']\n+ ['../classPoint.html#a298faf034066a5a5ae78449170b4f276', 1, 'Point::Point(const boost::geometry::model::point< Number, dummy_dim, boost::geometry::cs::cartesian > &boost_pt)'],\n+ ['../classPoint.html', 1, 'Point< dim, Number >']\n ]],\n ['point_2eh_336', ['point.h', ['../base_2point_8h.html', 1, '(Global Namespace)'],\n ['../boost__adaptors_2point_8h.html', 1, '(Global Namespace)']\n ]],\n ['point3comp_337', ['Point3Comp', ['../structDataOutBase_1_1DataOutFilter_1_1Point3Comp.html', 1, 'DataOutBase::DataOutFilter']]],\n ['point_3c_200_20_3e_338', ['Point< 0 >', ['../classPoint.html', 1, '']]],\n ['point_3c_201_20_3e_339', ['Point< 1 >', ['../classPoint.html', 1, '']]],\n ['point_3c_202_20_3e_340', ['Point< 2 >', ['../classPoint.html', 1, '']]],\n ['point_3c_202_2c_20double_20_3e_341', ['Point< 2, double >', ['../classPoint.html', 1, '']]],\n ['point_3c_203_20_3e_342', ['Point< 3 >', ['../classPoint.html', 1, '']]],\n ['point_3c_203_2c_20float_20_3e_343', ['Point< 3, float >', ['../classPoint.html', 1, '']]],\n ['point_3c_20dim_20_2d_201_2c_20vectorizedarraytype_20_3e_344', ['Point< dim - 1, VectorizedArrayType >', ['../classPoint.html', 1, '']]],\n ['point_3c_20dim_2c_20double_20_3e_345', ['Point< dim, double >', ['../classPoint.html', 1, '']]],\n- ['point_3c_20dim_2c_20number_20_3e_346', ['point< dim, number >', ['../classPoint.html', 1, 'Point< dim, Number >'],\n- ['../classTensor.html#aa03297e722be020f98fc14aafcab34a7', 1, 'Tensor::Point< dim, Number >']\n+ ['point_3c_20dim_2c_20number_20_3e_346', ['point< dim, number >', ['../classTensor.html#aa03297e722be020f98fc14aafcab34a7', 1, 'Tensor::Point< dim, Number >'],\n+ ['../classPoint.html', 1, 'Point< dim, Number >']\n ]],\n ['point_3c_20dim_2c_20vectorizedarray_3c_20double_20_3e_20_3e_347', ['Point< dim, VectorizedArray< double > >', ['../classPoint.html', 1, '']]],\n ['point_3c_20dim_2c_20vectorizedarraytype_20_3e_348', ['Point< dim, VectorizedArrayType >', ['../classPoint.html', 1, '']]],\n ['point_3c_20spacedim_20_3e_349', ['Point< spacedim >', ['../classPoint.html', 1, '']]],\n ['point_3c_20spacedim_2c_20double_20_3e_350', ['Point< spacedim, double >', ['../classPoint.html', 1, '']]],\n ['point_3c_20spacedim_2c_20number_20_3e_351', ['Point< spacedim, Number >', ['../classPoint.html', 1, '']]],\n ['point_3c_20spacedim_2c_20vectorizedarray_3c_20double_20_3e_20_3e_352', ['Point< spacedim, VectorizedArray< double > >', ['../classPoint.html', 1, '']]],\n@@ -653,23 +653,23 @@\n ['point_5fcompare_356', ['point_compare', ['../namespaceOpenCASCADE.html#a7a919a5ebb75e67a4baa0ddd0caf8f15', 1, 'OpenCASCADE']]],\n ['point_5fconversion_2eh_357', ['point_conversion.h', ['../point__conversion_8h.html', 1, '']]],\n ['point_5fdifference_358', ['point_difference', ['../namespaceVectorTools.html#abf62ca21c24dbb459266851cb234e8bf', 1, 'VectorTools::point_difference(const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Function< spacedim, typename VectorType::value_type > &exact_solution, Vector< typename VectorType::value_type > &difference, const Point< spacedim, double > &point)'],\n ['../namespaceVectorTools.html#a07907666e2000a6e8a6c0118f5d82b9f', 1, 'VectorTools::point_difference(const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Function< spacedim, typename VectorType::value_type > &exact_solution, Vector< typename VectorType::value_type > &difference, const Point< spacedim, double > &point)']\n ]],\n ['point_5ffound_359', ['point_found', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#af500b74c1b221de1168dabaabb885a6a', 1, 'Utilities::MPI::RemotePointEvaluation']]],\n ['point_5fgeometry_5fdata_360', ['point_geometry_data', ['../classPointValueHistory.html#a16afe6ce81de54b61bb92d8ade45467b', 1, 'PointValueHistory']]],\n- ['point_5fgradient_361', ['point_gradient', ['../namespaceVectorTools.html#ad45ffee55254ed05b67883151f60af87', 1, 'VectorTools::point_gradient(const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point)'],\n- ['../namespaceVectorTools.html#a0e1901873f1cd477040b075af82edb07', 1, 'VectorTools::point_gradient(const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point)'],\n- ['../namespaceVectorTools.html#a76788c65b86b01f4ab915036da3624b7', 1, 'VectorTools::point_gradient(const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)'],\n- ['../namespaceVectorTools.html#aad595520f8639976523a3d83a3e079de', 1, 'VectorTools::point_gradient(const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)'],\n+ ['point_5fgradient_361', ['point_gradient', ['../namespaceVectorTools.html#aff3a34b2d2d46fef05df4ab9f72dc5f2', 1, 'VectorTools::point_gradient(const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)'],\n ['../namespaceVectorTools.html#a078534e0dfc25a7893805fc1385da132', 1, 'VectorTools::point_gradient(const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point)'],\n- ['../namespaceVectorTools.html#aff3a34b2d2d46fef05df4ab9f72dc5f2', 1, 'VectorTools::point_gradient(const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)']\n+ ['../namespaceVectorTools.html#aad595520f8639976523a3d83a3e079de', 1, 'VectorTools::point_gradient(const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)'],\n+ ['../namespaceVectorTools.html#a76788c65b86b01f4ab915036da3624b7', 1, 'VectorTools::point_gradient(const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point, std::vector< Tensor< 1, spacedim, typename VectorType::value_type > > &value)'],\n+ ['../namespaceVectorTools.html#a0e1901873f1cd477040b075af82edb07', 1, 'VectorTools::point_gradient(const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point)'],\n+ ['../namespaceVectorTools.html#ad45ffee55254ed05b67883151f60af87', 1, 'VectorTools::point_gradient(const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const VectorType &fe_function, const Point< spacedim, double > &point)']\n ]],\n- ['point_5fgradients_362', ['point_gradients', ['../namespaceVectorTools.html#a7e0432da0056b4ced193d2501684363b', 1, 'VectorTools::point_gradients(const Utilities::MPI::RemotePointEvaluation< dim, spacedim > &cache, const MeshType< dim, spacedim > &mesh, const VectorType &vector, const EvaluationFlags::EvaluationFlags flags=EvaluationFlags::avg, const unsigned int first_selected_component=0)'],\n- ['../namespaceVectorTools.html#aa96d29e9f7275de7556d6222d8023849', 1, 'VectorTools::point_gradients(const Mapping< dim > &mapping, const MeshType< dim, spacedim > &mesh, const VectorType &vector, const std::vector< Point< spacedim > > &evaluation_points, Utilities::MPI::RemotePointEvaluation< dim, spacedim > &cache, const EvaluationFlags::EvaluationFlags flags=EvaluationFlags::avg, const unsigned int first_selected_component=0)']\n+ ['point_5fgradients_362', ['point_gradients', ['../namespaceVectorTools.html#aa96d29e9f7275de7556d6222d8023849', 1, 'VectorTools::point_gradients(const Mapping< dim > &mapping, const MeshType< dim, spacedim > &mesh, const VectorType &vector, const std::vector< Point< spacedim > > &evaluation_points, Utilities::MPI::RemotePointEvaluation< dim, spacedim > &cache, const EvaluationFlags::EvaluationFlags flags=EvaluationFlags::avg, const unsigned int first_selected_component=0)'],\n+ ['../namespaceVectorTools.html#a7e0432da0056b4ced193d2501684363b', 1, 'VectorTools::point_gradients(const Utilities::MPI::RemotePointEvaluation< dim, spacedim > &cache, const MeshType< dim, spacedim > &mesh, const VectorType &vector, const EvaluationFlags::EvaluationFlags flags=EvaluationFlags::avg, const unsigned int first_selected_component=0)']\n ]],\n ['point_5fin_5fplane_363', ['point_in_plane', ['../classFunctions_1_1SignedDistance_1_1Plane.html#a535b7f391e3121866644d968b60b35af', 1, 'Functions::SignedDistance::Plane']]],\n ['point_5finside_364', ['point_inside', ['../classCellAccessor.html#ac2b2737b807db65267bcf69085076383', 1, 'CellAccessor::point_inside(const Point< 2 > &p) const'],\n ['../classCellAccessor.html#a419a58c7dc8980434ebbef1ad5d5ebe7', 1, 'CellAccessor::point_inside(const Point< 3 > &p) const'],\n ['../classCellAccessor.html#a3f47557759ff655acc0a454c40e0b563', 1, 'CellAccessor::point_inside(const Point< 2 > &p) const'],\n ['../classCellAccessor.html#a956125786970f7352ff136b52f3f7014', 1, 'CellAccessor::point_inside(const Point< 1 > &p) const'],\n ['../classCellAccessor.html#adb8a0465d3d7145513463b6a4a215fbc', 1, 'CellAccessor::point_inside(const Point< spacedim > &p) const'],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -263,34 +263,34 @@\n ]],\n ['scopeexit_88', ['scopeexit', ['../classScopeExit.html#adc2520f639a7a4691a35c112ff144546', 1, 'ScopeExit::ScopeExit(const std::function< void()> &exit_function)'],\n ['../classScopeExit.html#a11b025c4fded47adacbd1fda10e4d8fb', 1, 'ScopeExit::ScopeExit(const ScopeExit &)=delete'],\n ['../classScopeExit.html', 1, 'ScopeExit']\n ]],\n ['scratch_89', ['scratch', ['../classMappingQ_1_1InternalData.html#af762857547746c556b2773480635540d', 1, 'MappingQ::InternalData::scratch'],\n ['../structDerivativeApproximation_1_1internal_1_1Assembler_1_1Scratch.html#a88992115d3fe179a421cf1a9a193bb35', 1, 'DerivativeApproximation::internal::Assembler::Scratch::Scratch()'],\n- ['../structDoFTools_1_1internal_1_1Assembler_1_1Scratch.html', 1, 'DoFTools::internal::Assembler::Scratch'],\n- ['../structDerivativeApproximation_1_1internal_1_1Assembler_1_1Scratch.html', 1, 'DerivativeApproximation::internal::Assembler::Scratch']\n+ ['../structDerivativeApproximation_1_1internal_1_1Assembler_1_1Scratch.html', 1, 'DerivativeApproximation::internal::Assembler::Scratch'],\n+ ['../structDoFTools_1_1internal_1_1Assembler_1_1Scratch.html', 1, 'DoFTools::internal::Assembler::Scratch']\n ]],\n ['scratch_5fdata_90', ['scratch_data', ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#aace2ef6cbd6d731cb2b866f8aee139e0', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::scratch_data'],\n ['../structWorkStream_1_1internal_1_1tbb__no__coloring_1_1IteratorRangeToItemStream_1_1ItemType.html#abe6e08eb4d1cbd7b9a69e595fc0023b2', 1, 'WorkStream::internal::tbb_no_coloring::IteratorRangeToItemStream::ItemType::scratch_data'],\n ['../structWorkStream_1_1internal_1_1tbb__no__coloring_1_1IteratorRangeToItemStream_1_1ItemType_1_1ScratchDataObject.html#a15577a9c7b73850e8d4921aa664a494c', 1, 'WorkStream::internal::tbb_no_coloring::IteratorRangeToItemStream::ItemType::ScratchDataObject::scratch_data'],\n ['../classAffineConstraints.html#a25dd838dee6db05afec001e52e414f95', 1, 'AffineConstraints::scratch_data'],\n ['../classFEEvaluationData.html#a27788a2a021acb880c9068f9b06344ab', 1, 'FEEvaluationData::scratch_data']\n ]],\n ['scratch_5fdata_2ecc_91', ['scratch_data.cc', ['../scratch__data_8cc.html', 1, '']]],\n ['scratch_5fdata_2eh_92', ['scratch_data.h', ['../scratch__data_8h.html', 1, '']]],\n ['scratch_5fdata_5farray_93', ['scratch_data_array', ['../classFEEvaluationBase.html#a0e3058a20278b62618fd9b1a37ec23d0', 1, 'FEEvaluationBase']]],\n ['scratch_5fdata_5fscalar_94', ['scratch_data_scalar', ['../classFEPointEvaluationBase.html#a4814ac4c04ed942ef1399a0f52a82ad1', 1, 'FEPointEvaluationBase']]],\n ['scratch_5fpad_95', ['scratch_pad', ['../classMatrixFree.html#a9dbe6cd7b3a803387e09b5746898a1fc', 1, 'MatrixFree']]],\n ['scratch_5fpad_5fnon_5fthreadsafe_96', ['scratch_pad_non_threadsafe', ['../classMatrixFree.html#aab344a297bb56fc07d4490794da49fc9', 1, 'MatrixFree']]],\n ['scratchandcopydatalist_97', ['ScratchAndCopyDataList', ['../classWorkStream_1_1internal_1_1tbb__colored_1_1WorkerAndCopier.html#a419252279a302c0f35b94e8c89e1877d', 1, 'WorkStream::internal::tbb_colored::WorkerAndCopier']]],\n- ['scratchandcopydataobjects_98', ['scratchandcopydataobjects', ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#a74a86c0e9169494ec83481aeefc8cf42', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::ScratchAndCopyDataObjects()'],\n+ ['scratchandcopydataobjects_98', ['scratchandcopydataobjects', ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#a90c0ab5c80023db6d14b67ed8cbc7117', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::ScratchAndCopyDataObjects()'],\n ['../classWorkStream_1_1internal_1_1tbb__colored_1_1WorkerAndCopier.html#ac8a39af635294ab7c0e8c07abf57f432', 1, 'WorkStream::internal::tbb_colored::WorkerAndCopier::ScratchAndCopyDataObjects'],\n ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#ab2cacd6e6398a5a2c49beb1db9401cfe', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::ScratchAndCopyDataObjects()'],\n- ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#a90c0ab5c80023db6d14b67ed8cbc7117', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::ScratchAndCopyDataObjects(std::unique_ptr< ScratchData > &&p, std::unique_ptr< CopyData > &&q, const bool in_use)'],\n+ ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html#a74a86c0e9169494ec83481aeefc8cf42', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects::ScratchAndCopyDataObjects(const ScratchAndCopyDataObjects &)'],\n ['../structWorkStream_1_1internal_1_1tbb__colored_1_1ScratchAndCopyDataObjects.html', 1, 'WorkStream::internal::tbb_colored::ScratchAndCopyDataObjects< Iterator, ScratchData, CopyData >']\n ]],\n ['scratchdata_99', ['scratchdata', ['../classMeshWorker_1_1ScratchData.html#a6f0f80d9d2bcddd1e2209a93020c394f', 1, 'MeshWorker::ScratchData::ScratchData(const FiniteElement< dim, spacedim > &fe, const Quadrature< dim > &quadrature, const UpdateFlags &update_flags, const Quadrature< dim - 1 > &face_quadrature=Quadrature< dim - 1 >(), const UpdateFlags &face_update_flags=update_default)'],\n ['../classMeshWorker_1_1ScratchData.html#aeacee1116932b81cd7d911b5fd654a70', 1, 'MeshWorker::ScratchData::ScratchData(const Mapping< dim, spacedim > &mapping, const FiniteElement< dim, spacedim > &fe, const Quadrature< dim > &quadrature, const UpdateFlags &update_flags, const Quadrature< dim - 1 > &face_quadrature=Quadrature< dim - 1 >(), const UpdateFlags &face_update_flags=update_default)'],\n ['../classMeshWorker_1_1ScratchData.html#ac4e07cafcb589366711a29af21a57b4f', 1, 'MeshWorker::ScratchData::ScratchData(const Mapping< dim, spacedim > &mapping, const FiniteElement< dim, spacedim > &fe, const Quadrature< dim > &quadrature, const UpdateFlags &update_flags, const UpdateFlags &neighbor_update_flags, const Quadrature< dim - 1 > &face_quadrature=Quadrature< dim - 1 >(), const UpdateFlags &face_update_flags=update_default, const UpdateFlags &neighbor_face_update_flags=update_default)'],\n ['../classMeshWorker_1_1ScratchData.html', 1, 'MeshWorker::ScratchData< dim, spacedim >'],\n ['../classMeshWorker_1_1ScratchData.html#a630539e779766b9aa57999eb09c6d7e6', 1, 'MeshWorker::ScratchData::ScratchData(const ScratchData< dim, spacedim > &scratch)'],\n@@ -309,26 +309,26 @@\n ]],\n ['scripts_102', ['Data exchange with python scripts', ['../namespaceHDF5.html#autotoc_md9', 1, '']]],\n ['sd_2eh_103', ['sd.h', ['../sd_8h.html', 1, '']]],\n ['sdirk_5ftwo_5fstages_104', ['SDIRK_TWO_STAGES', ['../namespaceTimeStepping.html#abff97b5326e452552f108a379dd6cff4a2102ce2c5306320faa2eb291b505d495', 1, 'TimeStepping']]],\n ['sec_105', ['sec', ['../namespaceDifferentiation_1_1SD.html#a775d2e774698e280712d757c235f3edd', 1, 'Differentiation::SD']]],\n ['sech_106', ['sech', ['../namespaceDifferentiation_1_1SD.html#aa9d7349600d504401a36f33f0dabd908', 1, 'Differentiation::SD']]],\n ['second_107', ['second', ['../grid__out_8cc.html#a2cc229a4f1ffc75e83ed269d5f725729', 1, 'grid_out.cc']]],\n- ['second_5fderivative_108', ['second_derivative', ['../classMappingFE_1_1InternalData.html#ac187eb443ad6907a61a6124de0547334', 1, 'MappingFE::InternalData::second_derivative()'],\n- ['../classMappingFEField_1_1InternalData.html#a8f2b5945957e5be17ced151fa0ae655d', 1, 'MappingFEField::InternalData::second_derivative(const unsigned int qpoint, const unsigned int shape_nr)'],\n+ ['second_5fderivative_108', ['second_derivative', ['../classMappingFE_1_1InternalData.html#a12fa76898e59268d07fe97f2584401e3', 1, 'MappingFE::InternalData::second_derivative()'],\n ['../classMappingFEField_1_1InternalData.html#a3c33af29fcd93e1aa657fb0b68900864', 1, 'MappingFEField::InternalData::second_derivative(const unsigned int qpoint, const unsigned int shape_nr) const'],\n- ['../classMappingFE_1_1InternalData.html#a12fa76898e59268d07fe97f2584401e3', 1, 'MappingFE::InternalData::second_derivative()']\n+ ['../classMappingFEField_1_1InternalData.html#a8f2b5945957e5be17ced151fa0ae655d', 1, 'MappingFEField::InternalData::second_derivative(const unsigned int qpoint, const unsigned int shape_nr)'],\n+ ['../classMappingFE_1_1InternalData.html#ac187eb443ad6907a61a6124de0547334', 1, 'MappingFE::InternalData::second_derivative()']\n ]],\n ['second_5fdof_5findices_109', ['second_dof_indices', ['../classFECouplingValues.html#ac23e0536057661a1e58882351e15a2f4', 1, 'FECouplingValues']]],\n ['second_5ffe_5fvalues_110', ['second_fe_values', ['../classFECouplingValues.html#af1c8a42166128a9bdcccf5d76338b6ef', 1, 'FECouplingValues']]],\n- ['second_5finvariant_111', ['second_invariant', ['../classSymmetricTensor.html#ad72c692699fac3f36b632e1a122e6c88', 1, 'SymmetricTensor::second_invariant()'],\n+ ['second_5finvariant_111', ['second_invariant', ['../classSymmetricTensor.html#ab0f2fb014b5467b0a6cb66a836897662', 1, 'SymmetricTensor::second_invariant()'],\n ['../symmetric__tensor_8h.html#ad72c692699fac3f36b632e1a122e6c88', 1, 'second_invariant(const SymmetricTensor< 2, 1, Number > &): symmetric_tensor.h'],\n ['../symmetric__tensor_8h.html#ad1b0f52ee48642219026cce20bd438a6', 1, 'second_invariant(const SymmetricTensor< 2, 3, Number > &t): symmetric_tensor.h'],\n- ['../classSymmetricTensor.html#ab0f2fb014b5467b0a6cb66a836897662', 1, 'SymmetricTensor::second_invariant(const SymmetricTensor< 2, 2, Number > &t)'],\n ['../classSymmetricTensor.html#ad1b0f52ee48642219026cce20bd438a6', 1, 'SymmetricTensor::second_invariant(const SymmetricTensor< 2, 3, Number > &t)'],\n+ ['../classSymmetricTensor.html#ad72c692699fac3f36b632e1a122e6c88', 1, 'SymmetricTensor::second_invariant(const SymmetricTensor< 2, 1, Number > &)'],\n ['../symmetric__tensor_8h.html#ab0f2fb014b5467b0a6cb66a836897662', 1, 'second_invariant(): symmetric_tensor.h']\n ]],\n ['second_5forder_5ftensors_112', ['second_order_tensors', ['../structinternal_1_1FEValuesViews_1_1Cache.html#a77ae6938149f067040434a3198e5a4d6', 1, 'internal::FEValuesViews::Cache']]],\n ['second_5frenumbering_5fdata_113', ['second_renumbering_data', ['../classFECouplingValues.html#af92f7303de5df4e4deeaa28d5ff56ad3', 1, 'FECouplingValues']]],\n ['secondcoupling_114', ['secondcoupling', ['../structFEValuesExtractors_1_1SecondCoupling.html#a4e66dcbc5ff6cad18caaff011ae1223f', 1, 'FEValuesExtractors::SecondCoupling::SecondCoupling()'],\n ['../structFEValuesExtractors_1_1SecondCoupling.html', 1, 'FEValuesExtractors::SecondCoupling< Extractor >']\n ]],\n@@ -336,18 +336,18 @@\n ['section_116', ['Section', ['../structTimerOutput_1_1Section.html', 1, 'TimerOutput']]],\n ['section_5fname_117', ['section_name', ['../classTimerOutput_1_1Scope.html#a60ec606e16380263ea164e751beb148d', 1, 'TimerOutput::Scope::section_name'],\n ['../classParameterAcceptor.html#a52134c59ec98830230c23e080c841705', 1, 'ParameterAcceptor::section_name']\n ]],\n ['sections_118', ['sections', ['../classTimerOutput.html#a486310cf9dad2c283e1bfb33a72dfc52', 1, 'TimerOutput']]],\n ['segment_119', ['Segment', ['../segment_8h.html#abe8b244c98d19a51f52c0b4e9c5516bc', 1, 'segment.h']]],\n ['segment_2eh_120', ['segment.h', ['../segment_8h.html', 1, '']]],\n- ['select_121', ['select', ['../classMGTransferBlockSelect.html#ae59d47c210e98c5a4ab8e6812909a1cd', 1, 'MGTransferBlockSelect::select()'],\n- ['../classSolverSelector.html#a3da215c843356cdab3b603ce98991b53', 1, 'SolverSelector::select()'],\n+ ['select_121', ['select', ['../classSolverSelector.html#a3da215c843356cdab3b603ce98991b53', 1, 'SolverSelector::select()'],\n ['../classPArpackSolver.html#a9a05304440f493dd2cca7f9f172f3c7a', 1, 'PArpackSolver::select'],\n ['../classNonlinearSolverSelector.html#ad8528a051d82705c1bc526e35e25e5c7', 1, 'NonlinearSolverSelector::select()'],\n+ ['../classMGTransferBlockSelect.html#ae59d47c210e98c5a4ab8e6812909a1cd', 1, 'MGTransferBlockSelect::select()'],\n ['../classMGTransferSelect.html#acd445990eab1f89989fc9d59e7818a95', 1, 'MGTransferSelect::select()']\n ]],\n ['select_5fblock_122', ['select_block', ['../classMGMatrixSelect.html#a3a6103aa3043f2de24918b604743705a', 1, 'MGMatrixSelect']]],\n ['select_5ffe_5fvalues_123', ['select_fe_values', ['../classhp_1_1FEValuesBase.html#a6102162564760bf57c7fb737d3c4afd1', 1, 'hp::FEValuesBase']]],\n ['selected_124', ['selected', ['../classFunctions_1_1CutOffFunctionBase.html#aace5c010457cffc4b192cbd708e76c69', 1, 'Functions::CutOffFunctionBase::selected'],\n ['../classSparseVanka_1_1AdditionalData.html#af65014883f94780aafc5072dd5aa3aa1', 1, 'SparseVanka::AdditionalData::selected'],\n ['../classSparseVanka.html#ab1c1073cd133bb81b5875b341eb32925', 1, 'SparseVanka::selected'],\n@@ -383,16 +383,16 @@\n ['send_5fpermutation_139', ['send_permutation', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#aff3383cfb0d231ea03bf627d763550d4', 1, 'Utilities::MPI::RemotePointEvaluation']]],\n ['send_5fpermutation_5finv_140', ['send_permutation_inv', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#a76a0e42447dd63444f016ab806f397ef', 1, 'Utilities::MPI::RemotePointEvaluation']]],\n ['send_5fpointers_141', ['send_pointers', ['../structParticles_1_1internal_1_1GhostParticlePartitioner.html#ab489520af5750243e3b5f69072f3930f', 1, 'Particles::internal::GhostParticlePartitioner']]],\n ['send_5fptr_142', ['send_ptr', ['../classUtilities_1_1MPI_1_1NoncontiguousPartitioner.html#a846bbce80d3a7a9cda03aa8082bb44ff', 1, 'Utilities::MPI::NoncontiguousPartitioner']]],\n ['send_5fptrs_143', ['send_ptrs', ['../structGridTools_1_1internal_1_1DistributedComputePointLocationsInternal.html#a15dd53afbc0d493d4d422d2fcdf261ef', 1, 'GridTools::internal::DistributedComputePointLocationsInternal::send_ptrs'],\n ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#a27dbac49abdde22260ba793e24c47f45', 1, 'Utilities::MPI::RemotePointEvaluation::send_ptrs']\n ]],\n- ['send_5franks_144', ['send_ranks', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#ab97d7fbf5a9a4a3cb8b4bee4a7fdfcf3', 1, 'Utilities::MPI::RemotePointEvaluation::send_ranks'],\n- ['../classUtilities_1_1MPI_1_1NoncontiguousPartitioner.html#a8b05f28c9f2bc1f36a2dcd34a9709eda', 1, 'Utilities::MPI::NoncontiguousPartitioner::send_ranks'],\n+ ['send_5franks_144', ['send_ranks', ['../classUtilities_1_1MPI_1_1NoncontiguousPartitioner.html#a8b05f28c9f2bc1f36a2dcd34a9709eda', 1, 'Utilities::MPI::NoncontiguousPartitioner::send_ranks'],\n+ ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#ab97d7fbf5a9a4a3cb8b4bee4a7fdfcf3', 1, 'Utilities::MPI::RemotePointEvaluation::send_ranks'],\n ['../structGridTools_1_1internal_1_1DistributedComputePointLocationsInternal.html#a1e813aac0c08c497d60fc2f9772aeb1c', 1, 'GridTools::internal::DistributedComputePointLocationsInternal::send_ranks']\n ]],\n ['send_5frecv_5fparticles_145', ['send_recv_particles', ['../classParticles_1_1ParticleHandler.html#a6fcf5277e9370590bc8752e07964d10c', 1, 'Particles::ParticleHandler']]],\n ['send_5frecv_5fparticles_5fproperties_5fand_5flocation_146', ['send_recv_particles_properties_and_location', ['../classParticles_1_1ParticleHandler.html#a749528e60e569644898059300c80d26f', 1, 'Particles::ParticleHandler']]],\n ['send_5frequest_5frequests_147', ['send_request_requests', ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1PEX.html#a2f5d2d672812f732080ad312e5179930', 1, 'Utilities::MPI::ConsensusAlgorithms::PEX']]],\n ['send_5frequests_148', ['send_requests', ['../classUtilities_1_1MPI_1_1ConsensusAlgorithms_1_1NBX.html#affb45f296ef0819a85571593ca2260ad', 1, 'Utilities::MPI::ConsensusAlgorithms::NBX']]],\n ['send_5fto_5finactive_149', ['send_to_inactive', ['../classUtilities_1_1MPI_1_1ProcessGrid.html#a62525d61d9504dccef9ea4d1d1345fb6', 1, 'Utilities::MPI::ProcessGrid']]],\n@@ -1456,25 +1456,25 @@\n ['../classPETScWrappers_1_1MatrixIterators_1_1const__iterator.html#a45b34073eb315617bd7ed0decce6e13d', 1, 'PETScWrappers::MatrixIterators::const_iterator::size_type'],\n ['../classPETScWrappers_1_1MatrixBase.html#a4b34a2b174fb98ddb568d1aa0f52e332', 1, 'PETScWrappers::MatrixBase::size_type'],\n ['../namespaceLinearAlgebra_1_1TpetraWrappers_1_1SparsityPatternImpl.html#a9c3a34907ad15b70343a3eaa1e48c9fc', 1, 'LinearAlgebra::TpetraWrappers::SparsityPatternImpl::size_type'],\n ['../namespaceTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation.html#ae624cce172704f0553c807c91e156cda', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::size_type'],\n ['../namespacePETScWrappers_1_1MPI.html#aa42c73b325c6bf80822a53b5f60465af', 1, 'PETScWrappers::MPI::size_type'],\n ['../namespaceDoFRenumbering_1_1boost_1_1boosttypes.html#a21b40eee54a33507bff47d84efe11fe6', 1, 'DoFRenumbering::boost::boosttypes::size_type'],\n ['../namespaceSparsityPatternIterators.html#a60b8b8534c2b95e4fc84b89b585eeb2e', 1, 'SparsityPatternIterators::size_type'],\n- ['../classIdentityMatrix.html#a67523acb9c6b41689fd6049584cff433', 1, 'IdentityMatrix::size_type'],\n- ['../classHouseholder.html#a9d891cccb7ab6f730f8e2e4ccbe1dde0', 1, 'Householder::size_type'],\n- ['../classDynamicSparsityPattern.html#a2d7249323016034cf1e20072c0b58907', 1, 'DynamicSparsityPattern::size_type'],\n+ ['../classLinearAlgebra_1_1distributed_1_1BlockVector.html#aa000c54aa3fc182e5f05422233af7257', 1, 'LinearAlgebra::distributed::BlockVector::size_type'],\n ['../classEigenInverse.html#a763f6b0b8df3c3f4379ca2cc286bfbae', 1, 'EigenInverse::size_type'],\n ['../classFullMatrix.html#a4e8f9ce2c12a56e26b62133edfcc9cef', 1, 'FullMatrix::size_type'],\n- ['../classLinearAlgebra_1_1distributed_1_1BlockVector.html#aa000c54aa3fc182e5f05422233af7257', 1, 'LinearAlgebra::distributed::BlockVector::size_type']\n+ ['../classHouseholder.html#a9d891cccb7ab6f730f8e2e4ccbe1dde0', 1, 'Householder::size_type'],\n+ ['../classDynamicSparsityPattern.html#a2d7249323016034cf1e20072c0b58907', 1, 'DynamicSparsityPattern::size_type'],\n+ ['../classIdentityMatrix.html#a67523acb9c6b41689fd6049584cff433', 1, 'IdentityMatrix::size_type']\n ]],\n- ['sizes_501', ['sizes', ['../classMGLevelGlobalTransfer_3_01LinearAlgebra_1_1distributed_1_1Vector_3_01Number_01_4_01_4.html#a5cfe585529e9b71195fe132b0d0a153a', 1, 'MGLevelGlobalTransfer< LinearAlgebra::distributed::Vector< Number > >::sizes'],\n+ ['sizes_501', ['sizes', ['../classMGLevelGlobalTransfer.html#ab7e17de0faa95b1d071c8b7e41542821', 1, 'MGLevelGlobalTransfer::sizes'],\n+ ['../classMGLevelGlobalTransfer_3_01LinearAlgebra_1_1distributed_1_1Vector_3_01Number_01_4_01_4.html#a5cfe585529e9b71195fe132b0d0a153a', 1, 'MGLevelGlobalTransfer< LinearAlgebra::distributed::Vector< Number > >::sizes'],\n ['../classMGTransferBlockBase.html#a469132c7fec454daba298ce3097364c2', 1, 'MGTransferBlockBase::sizes'],\n- ['../classMGTransferComponentBase.html#ad063c5d8219be2ae5b6ed90cf49c1e85', 1, 'MGTransferComponentBase::sizes'],\n- ['../classMGLevelGlobalTransfer.html#ab7e17de0faa95b1d071c8b7e41542821', 1, 'MGLevelGlobalTransfer::sizes']\n+ ['../classMGTransferComponentBase.html#ad063c5d8219be2ae5b6ed90cf49c1e85', 1, 'MGTransferComponentBase::sizes']\n ]],\n ['sizes_5ffixed_5fcumulative_502', ['sizes_fixed_cumulative', ['../classinternal_1_1CellAttachedDataSerializer.html#aa0fb46817aa574a4992da1d0e260ba6e', 1, 'internal::CellAttachedDataSerializer']]],\n ['sizetype_503', ['sizetype', ['../structGridOutFlags_1_1EpsFlagsBase.html#a32c762440065566901cddf967a1d9b65', 1, 'GridOutFlags::EpsFlagsBase::SizeType'],\n ['../structDataOutBase_1_1EpsFlags.html#aa7e57ae4034c9cafe9474e5ea71b7ba2', 1, 'DataOutBase::EpsFlags::SizeType']\n ]],\n ['skip_5fcomment_5flines_504', ['skip_comment_lines', ['../classGridIn.html#a74dabcf2cca1967a760e105ebf03572e', 1, 'GridIn']]],\n ['skip_5fempty_5flines_505', ['skip_empty_lines', ['../classGridIn.html#a3cae9ca8ac0670b3dedd5ec6203f6811', 1, 'GridIn']]],\n@@ -1500,16 +1500,16 @@\n ['sm_5fimport_5fdata_521', ['sm_import_data', ['../classinternal_1_1MatrixFreeFunctions_1_1VectorDataExchange_1_1Full.html#ab12e5520da9b3f9e691fcd43070c72f2', 1, 'internal::MatrixFreeFunctions::VectorDataExchange::Full']]],\n ['sm_5fimport_5fdata_5fthis_522', ['sm_import_data_this', ['../classinternal_1_1MatrixFreeFunctions_1_1VectorDataExchange_1_1Full.html#add9184345ebfc177010aa2d83516434e', 1, 'internal::MatrixFreeFunctions::VectorDataExchange::Full']]],\n ['sm_5fimport_5franks_523', ['sm_import_ranks', ['../classinternal_1_1MatrixFreeFunctions_1_1VectorDataExchange_1_1Full.html#a2fe92d212159777927b90fd1bfe85eab', 1, 'internal::MatrixFreeFunctions::VectorDataExchange::Full']]],\n ['small_5farray_524', ['small_array', ['../structinternal_1_1VectorOperations_1_1TBBReduceFunctor.html#a988fb71681828fd4a831a908ab1a5510', 1, 'internal::VectorOperations::TBBReduceFunctor']]],\n ['smallest_5fimaginary_5fpart_525', ['smallest_imaginary_part', ['../classArpackSolver.html#ad8d0a4392fc4cd6f45eaa8a16bf18a7ca452e39e63994da018355cb6db7c70a77', 1, 'ArpackSolver::smallest_imaginary_part'],\n ['../classPArpackSolver.html#a61e6ecc371924100bc132fba84bc9b67ad6dc41106d4fdbdfbda4a57ae614bde1', 1, 'PArpackSolver::smallest_imaginary_part']\n ]],\n- ['smallest_5fmagnitude_526', ['smallest_magnitude', ['../classPArpackSolver.html#a61e6ecc371924100bc132fba84bc9b67a69d0bf1e0b6c58e261dc108ffbaacbd4', 1, 'PArpackSolver::smallest_magnitude'],\n- ['../classArpackSolver.html#ad8d0a4392fc4cd6f45eaa8a16bf18a7cad11a8e7300d30fcd0215a12c927c4695', 1, 'ArpackSolver::smallest_magnitude']\n+ ['smallest_5fmagnitude_526', ['smallest_magnitude', ['../classArpackSolver.html#ad8d0a4392fc4cd6f45eaa8a16bf18a7cad11a8e7300d30fcd0215a12c927c4695', 1, 'ArpackSolver::smallest_magnitude'],\n+ ['../classPArpackSolver.html#a61e6ecc371924100bc132fba84bc9b67a69d0bf1e0b6c58e261dc108ffbaacbd4', 1, 'PArpackSolver::smallest_magnitude']\n ]],\n ['smallest_5freal_5fpart_527', ['smallest_real_part', ['../classArpackSolver.html#ad8d0a4392fc4cd6f45eaa8a16bf18a7ca63f5b12bf22f52e6493db48d0ef6056a', 1, 'ArpackSolver::smallest_real_part'],\n ['../classPArpackSolver.html#a61e6ecc371924100bc132fba84bc9b67af059d366b3f4386d078561f7f968ff52', 1, 'PArpackSolver::smallest_real_part']\n ]],\n ['smartpointer_528', ['smartpointer', ['../classSmartPointer.html#a2966c8f04cc5959cb0524c4ed125cf64', 1, 'SmartPointer::SmartPointer()'],\n ['../classSmartPointer.html#a2766dce74485a1d9be72ae1cfceb56ea', 1, 'SmartPointer::SmartPointer(T *t)'],\n ['../classSmartPointer.html#aead2afe40070de6630e8d7add74f35d8', 1, 'SmartPointer::SmartPointer(T *t, const std::string &id)'],\n@@ -1657,38 +1657,38 @@\n ['smartpointer_3c_20solvertype_2c_20mgcoarsegriditerativesolver_3c_20vectortype_2c_20solvertype_2c_20matrixtype_2c_20preconditionertype_20_3e_20_3e_666', ['SmartPointer< SolverType, MGCoarseGridIterativeSolver< VectorType, SolverType, MatrixType, PreconditionerType > >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20timestepbase_2c_20timedependent_20_3e_667', ['SmartPointer< TimeStepBase, TimeDependent >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20triangulation_3c_20dim_2c_20dim_20_3e_2c_20gridin_3c_20dim_2c_20dim_20_3e_20_3e_668', ['SmartPointer< Triangulation< dim, dim >, GridIn< dim, dim > >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20triangulation_3c_20dim_2c_20dim_20_3e_2c_20timestepbase_5ftria_3c_20dim_20_3e_20_3e_669', ['SmartPointer< Triangulation< dim, dim >, TimeStepBase_Tria< dim > >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20vectormemory_3c_20blockvector_3c_20number_20_3e_20_3e_2c_20mgsmootherblock_3c_20matrixtype_2c_20relaxationtype_2c_20number_20_3e_20_3e_670', ['SmartPointer< VectorMemory< BlockVector< number > >, MGSmootherBlock< MatrixType, RelaxationType, number > >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20vectormemory_3c_20vector_3c_20number_20_3e_20_3e_2c_20mgtransferblock_3c_20number_20_3e_20_3e_671', ['SmartPointer< VectorMemory< Vector< number > >, MGTransferBlock< number > >', ['../classSmartPointer.html', 1, '']]],\n ['smartpointer_3c_20vectormemory_3c_20vector_3c_20number_20_3e_20_3e_2c_20preconditionlu_3c_20number_20_3e_20_3e_672', ['SmartPointer< VectorMemory< Vector< number > >, PreconditionLU< number > >', ['../classSmartPointer.html', 1, '']]],\n- ['smooth_673', ['smooth', ['../classMGSmootherRelaxation.html#a069b956f39c338049e0e7510d5af4a6c', 1, 'MGSmootherRelaxation::smooth()'],\n- ['../structDataOutBase_1_1PovrayFlags.html#a03e733344e6ab9501af03e502caea949', 1, 'DataOutBase::PovrayFlags::smooth'],\n+ ['smooth_673', ['smooth', ['../structDataOutBase_1_1PovrayFlags.html#a03e733344e6ab9501af03e502caea949', 1, 'DataOutBase::PovrayFlags::smooth'],\n ['../classMGSmootherBase.html#a12f5374a1300fad1d9decbb039950821', 1, 'MGSmootherBase::smooth()'],\n ['../classMGSmootherBlock.html#a1d711117737b37f6151db3804c4f45a6', 1, 'MGSmootherBlock::smooth()'],\n ['../classMGSmootherIdentity.html#acd287cbe058a5490e146475c79aa3ae9', 1, 'MGSmootherIdentity::smooth()'],\n ['../classmg_1_1SmootherRelaxation.html#aaa356a3381436f0d70b8ed186f7e2f0a', 1, 'mg::SmootherRelaxation::smooth()'],\n- ['../classMGSmootherPrecondition.html#a3bead4c99e29324bea5a12cdbf82a2bb', 1, 'MGSmootherPrecondition::smooth()']\n+ ['../classMGSmootherPrecondition.html#a3bead4c99e29324bea5a12cdbf82a2bb', 1, 'MGSmootherPrecondition::smooth()'],\n+ ['../classMGSmootherRelaxation.html#a069b956f39c338049e0e7510d5af4a6c', 1, 'MGSmootherRelaxation::smooth()']\n ]],\n ['smooth_5fgrid_674', ['smooth_grid', ['../classTriangulation.html#ac9474a14d0e8429412c82450013bde67', 1, 'Triangulation']]],\n- ['smoother_5foverlap_675', ['smoother_overlap', ['../structTrilinosWrappers_1_1PreconditionAMG_1_1AdditionalData.html#aad93b8e7862fee43ab5507b30d972bd7', 1, 'TrilinosWrappers::PreconditionAMG::AdditionalData::smoother_overlap'],\n- ['../structTrilinosWrappers_1_1PreconditionAMGMueLu_1_1AdditionalData.html#ad213ade8c2bc25efb2ada18100a9997b', 1, 'TrilinosWrappers::PreconditionAMGMueLu::AdditionalData::smoother_overlap']\n+ ['smoother_5foverlap_675', ['smoother_overlap', ['../structTrilinosWrappers_1_1PreconditionAMGMueLu_1_1AdditionalData.html#ad213ade8c2bc25efb2ada18100a9997b', 1, 'TrilinosWrappers::PreconditionAMGMueLu::AdditionalData::smoother_overlap'],\n+ ['../structTrilinosWrappers_1_1PreconditionAMG_1_1AdditionalData.html#aad93b8e7862fee43ab5507b30d972bd7', 1, 'TrilinosWrappers::PreconditionAMG::AdditionalData::smoother_overlap']\n ]],\n ['smoother_5fsweeps_676', ['smoother_sweeps', ['../structTrilinosWrappers_1_1PreconditionAMG_1_1AdditionalData.html#a7bcc5fa85afdb96d90416e7bf182edd0', 1, 'TrilinosWrappers::PreconditionAMG::AdditionalData::smoother_sweeps'],\n ['../structTrilinosWrappers_1_1PreconditionAMGMueLu_1_1AdditionalData.html#acd1f1b80084e5e51e3c43b368f385cac', 1, 'TrilinosWrappers::PreconditionAMGMueLu::AdditionalData::smoother_sweeps']\n ]],\n ['smoother_5ftype_677', ['smoother_type', ['../structTrilinosWrappers_1_1PreconditionAMG_1_1AdditionalData.html#af4c9b8fcda773646bafc45a09b9c800f', 1, 'TrilinosWrappers::PreconditionAMG::AdditionalData::smoother_type'],\n ['../structTrilinosWrappers_1_1PreconditionAMGMueLu_1_1AdditionalData.html#af9e4b9c9ff53b97f999d842f1ac82b59', 1, 'TrilinosWrappers::PreconditionAMGMueLu::AdditionalData::smoother_type']\n ]],\n ['smootherrelaxation_678', ['smootherrelaxation', ['../classmg_1_1SmootherRelaxation.html#a9aa4250627c6ca82eceed11800ba31e9', 1, 'mg::SmootherRelaxation::SmootherRelaxation()'],\n ['../classmg_1_1SmootherRelaxation.html', 1, 'mg::SmootherRelaxation< RelaxationType, VectorType >']\n ]],\n- ['smoothers_679', ['smoothers', ['../classMGSmootherPrecondition.html#a0f5137c6c2507b390eb0a57fc4c61a78', 1, 'MGSmootherPrecondition::smoothers'],\n+ ['smoothers_679', ['smoothers', ['../classMGSmootherBlock.html#a55be8cb6588f573db5e15633f16773bd', 1, 'MGSmootherBlock::smoothers'],\n ['../classMGSmootherRelaxation.html#a6d6a705b4b4321e31ac90d36390f6d40', 1, 'MGSmootherRelaxation::smoothers'],\n- ['../classMGSmootherBlock.html#a55be8cb6588f573db5e15633f16773bd', 1, 'MGSmootherBlock::smoothers']\n+ ['../classMGSmootherPrecondition.html#a0f5137c6c2507b390eb0a57fc4c61a78', 1, 'MGSmootherPrecondition::smoothers']\n ]],\n ['smoothing_680', ['smoothing', ['../structTriangulationDescription_1_1Description.html#a3c18b27c895e42f09201fdc2c6258da8', 1, 'TriangulationDescription::Description']]],\n ['smoothing_5fon_5fcoarsening_681', ['smoothing_on_coarsening', ['../classTriangulation.html#a0633dd17e535a59162b79f338c6ff5aea8d8dbaaa62136a7e51c7bf5c02d6e1e7', 1, 'Triangulation']]],\n ['smoothing_5fon_5frefinement_682', ['smoothing_on_refinement', ['../classTriangulation.html#a0633dd17e535a59162b79f338c6ff5aea3fb6b9153821aefc45661f67f22e232a', 1, 'Triangulation']]],\n ['smoothing_5frange_683', ['smoothing_range', ['../structinternal_1_1EigenvalueAlgorithmAdditionalData.html#ae7d16492ed774f220676673fbe1d5e8f', 1, 'internal::EigenvalueAlgorithmAdditionalData']]],\n ['smoothness_5festimator_2ecc_684', ['smoothness_estimator.cc', ['../smoothness__estimator_8cc.html', 1, '']]],\n ['smoothness_5festimator_2eh_685', ['smoothness_estimator.h', ['../smoothness__estimator_8h.html', 1, '']]],\n@@ -1708,17 +1708,17 @@\n ['../classFEValuesViews_1_1SymmetricTensor_3_012_00_01dim_00_01spacedim_01_4.html#afbf067fab11c479f7677d7b780d17a50', 1, 'FEValuesViews::SymmetricTensor< 2, dim, spacedim >::solution_divergence_type'],\n ['../classFEValuesViews_1_1Tensor_3_012_00_01dim_00_01spacedim_01_4.html#a184141f9deeec4d04a99e9a846c1860c', 1, 'FEValuesViews::Tensor< 2, dim, spacedim >::solution_divergence_type']\n ]],\n ['solution_5fghosted_5fglobal_5fvector_699', ['solution_ghosted_global_vector', ['../classMGLevelGlobalTransfer_3_01LinearAlgebra_1_1distributed_1_1Vector_3_01Number_01_4_01_4.html#ac3bf7823682e917be25c20aaef8d8b8b', 1, 'MGLevelGlobalTransfer< LinearAlgebra::distributed::Vector< Number > >']]],\n ['solution_5fgradient_5ftype_700', ['solution_gradient_type', ['../classFEValuesViews_1_1Tensor_3_012_00_01dim_00_01spacedim_01_4.html#a337e34bd069815f31c108f15d174b7b8', 1, 'FEValuesViews::Tensor< 2, dim, spacedim >::solution_gradient_type'],\n ['../classFEValuesViews_1_1Vector.html#a9091b04ce3b9c4c7578134e6ae94dfcb', 1, 'FEValuesViews::Vector::solution_gradient_type'],\n ['../classFEValuesViews_1_1Scalar.html#a8a88091ff31d432d9338b3bcfdabc35e', 1, 'FEValuesViews::Scalar::solution_gradient_type'],\n+ ['../classFEInterfaceViews_1_1Vector.html#a56cda5edbeadf4cc1528a68ebe1abbd9', 1, 'FEInterfaceViews::Vector::solution_gradient_type'],\n ['../classFEInterfaceViews_1_1Scalar.html#afdfc9b8eed34e27fac5d1b67d3776e4f', 1, 'FEInterfaceViews::Scalar::solution_gradient_type'],\n- ['../classFEValuesViews_1_1RenumberedView.html#ad87a5c0b949c97a6b2f60f131db85045', 1, 'FEValuesViews::RenumberedView::solution_gradient_type'],\n- ['../classFEInterfaceViews_1_1Vector.html#a56cda5edbeadf4cc1528a68ebe1abbd9', 1, 'FEInterfaceViews::Vector::solution_gradient_type']\n+ ['../classFEValuesViews_1_1RenumberedView.html#ad87a5c0b949c97a6b2f60f131db85045', 1, 'FEValuesViews::RenumberedView::solution_gradient_type']\n ]],\n ['solution_5fgradients_701', ['solution_gradients', ['../structDataPostprocessorInputs_1_1Scalar.html#ab816d7aff9d49ca60eabecc71e5a04a6', 1, 'DataPostprocessorInputs::Scalar::solution_gradients'],\n ['../structDataPostprocessorInputs_1_1Vector.html#ac96fb295c3c807f96021bae734e8c3c3', 1, 'DataPostprocessorInputs::Vector::solution_gradients']\n ]],\n ['solution_5fhessian_5ftype_702', ['solution_hessian_type', ['../classFEInterfaceViews_1_1Scalar.html#af87130b3b7bbd1cb727e0bcbb2726e32', 1, 'FEInterfaceViews::Scalar::solution_hessian_type'],\n ['../classFEInterfaceViews_1_1Vector.html#a95633ad88f5ec0a6d6eba03542e9064c', 1, 'FEInterfaceViews::Vector::solution_hessian_type'],\n ['../classFEValuesViews_1_1Scalar.html#a100057b4b51f2fa4bc4767bb11697037', 1, 'FEValuesViews::Scalar::solution_hessian_type'],\n@@ -1731,22 +1731,22 @@\n ['solution_5flaplacian_5ftype_705', ['solution_laplacian_type', ['../classFEValuesViews_1_1Scalar.html#a3cebb45fb4c4398e15179c4ea19d364b', 1, 'FEValuesViews::Scalar::solution_laplacian_type'],\n ['../classFEValuesViews_1_1Vector.html#ada81976c055ed69444bdfcf6bbd46742', 1, 'FEValuesViews::Vector::solution_laplacian_type']\n ]],\n ['solution_5fold_706', ['solution_old', ['../classPreconditionChebyshev.html#a47a332bf35ca46f19c46b7db33bd9e4a', 1, 'PreconditionChebyshev']]],\n ['solution_5frenumbered_707', ['solution_renumbered', ['../classFEPointEvaluationBase.html#a52045275cffe8824d272c7a7dccb2a07', 1, 'FEPointEvaluationBase']]],\n ['solution_5frenumbered_5fvectorized_708', ['solution_renumbered_vectorized', ['../classFEPointEvaluationBase.html#a97f4edd1e1e89b8d4d1f7698efb7492c', 1, 'FEPointEvaluationBase']]],\n ['solution_5fsymmetric_5fgradient_5ftype_709', ['solution_symmetric_gradient_type', ['../classFEValuesViews_1_1Vector.html#a602ae6e22e425055d3f641d571973a57', 1, 'FEValuesViews::Vector']]],\n- ['solution_5fthird_5fderivative_5ftype_710', ['solution_third_derivative_type', ['../classFEValuesViews_1_1Vector.html#a09a2ac5d6a8445dbef6a6c654e31e2c7', 1, 'FEValuesViews::Vector::solution_third_derivative_type'],\n+ ['solution_5fthird_5fderivative_5ftype_710', ['solution_third_derivative_type', ['../classFEInterfaceViews_1_1Scalar.html#aa22c6ec405dc54066f29d7f9dba0a016', 1, 'FEInterfaceViews::Scalar::solution_third_derivative_type'],\n+ ['../classFEInterfaceViews_1_1Vector.html#abb762d393feaf0c2b0f1da8d62ba8d1a', 1, 'FEInterfaceViews::Vector::solution_third_derivative_type'],\n ['../classFEValuesViews_1_1Scalar.html#a7a62cc970fe6a4f162a3a781e9ff3c5f', 1, 'FEValuesViews::Scalar::solution_third_derivative_type'],\n- ['../classFEInterfaceViews_1_1Scalar.html#aa22c6ec405dc54066f29d7f9dba0a016', 1, 'FEInterfaceViews::Scalar::solution_third_derivative_type'],\n- ['../classFEInterfaceViews_1_1Vector.html#abb762d393feaf0c2b0f1da8d62ba8d1a', 1, 'FEInterfaceViews::Vector::solution_third_derivative_type']\n+ ['../classFEValuesViews_1_1Vector.html#a09a2ac5d6a8445dbef6a6c654e31e2c7', 1, 'FEValuesViews::Vector::solution_third_derivative_type']\n ]],\n ['solution_5ftime_711', ['solution_time', ['../structDataOutBase_1_1TecplotFlags.html#a35153183c6355ed3ed76b018560e4a47', 1, 'DataOutBase::TecplotFlags']]],\n- ['solution_5ftransfer_2ecc_712', ['solution_transfer.cc', ['../distributed_2solution__transfer_8cc.html', 1, '(Global Namespace)'],\n- ['../numerics_2solution__transfer_8cc.html', 1, '(Global Namespace)']\n+ ['solution_5ftransfer_2ecc_712', ['solution_transfer.cc', ['../numerics_2solution__transfer_8cc.html', 1, '(Global Namespace)'],\n+ ['../distributed_2solution__transfer_8cc.html', 1, '(Global Namespace)']\n ]],\n ['solution_5ftransfer_2eh_713', ['solution_transfer.h', ['../distributed_2solution__transfer_8h.html', 1, '(Global Namespace)'],\n ['../numerics_2solution__transfer_8h.html', 1, '(Global Namespace)']\n ]],\n ['solution_5ftransfer_5finst2_2ecc_714', ['solution_transfer_inst2.cc', ['../solution__transfer__inst2_8cc.html', 1, '']]],\n ['solution_5ftransfer_5finst3_2ecc_715', ['solution_transfer_inst3.cc', ['../solution__transfer__inst3_8cc.html', 1, '']]],\n ['solution_5ftransfer_5finst4_2ecc_716', ['solution_transfer_inst4.cc', ['../solution__transfer__inst4_8cc.html', 1, '']]],\n@@ -1764,37 +1764,37 @@\n ['solutionstate_719', ['solutionstate', ['../classTimeStepBase.html#a524c9e9ef065d5f38c0dcbdb4839b14f', 1, 'TimeStepBase::SolutionState'],\n ['../classTimeStepBase__Tria.html#a04c6f0ed3688c4e2424348d5b8b0dec6', 1, 'TimeStepBase_Tria::SolutionState']\n ]],\n ['solutionstrategy_720', ['solutionstrategy', ['../classNonlinearSolverSelector_1_1AdditionalData.html#a2dd69fb6550aa48fecc20a58123869a0', 1, 'NonlinearSolverSelector::AdditionalData::SolutionStrategy'],\n ['../classSUNDIALS_1_1KINSOL_1_1AdditionalData.html#a6160e0cd736c36f42c25a05eeb7ec079', 1, 'SUNDIALS::KINSOL::AdditionalData::SolutionStrategy']\n ]],\n ['solutiontransfer_721', ['solutiontransfer', ['../classSolutionTransfer.html#ad33057265bf051ae9972df33c54b892e', 1, 'SolutionTransfer::SolutionTransfer()'],\n+ ['../classparallel_1_1distributed_1_1SolutionTransfer.html', 1, 'parallel::distributed::SolutionTransfer< dim, VectorType, spacedim >'],\n ['../classSolutionTransfer.html', 1, 'SolutionTransfer< dim, VectorType, spacedim >'],\n- ['../classparallel_1_1distributed_1_1SolutionTransfer.html#aebd38d82f946a96118f73e4e26defd61', 1, 'parallel::distributed::SolutionTransfer::SolutionTransfer()'],\n- ['../classparallel_1_1distributed_1_1SolutionTransfer.html', 1, 'parallel::distributed::SolutionTransfer< dim, VectorType, spacedim >']\n+ ['../classparallel_1_1distributed_1_1SolutionTransfer.html#aebd38d82f946a96118f73e4e26defd61', 1, 'parallel::distributed::SolutionTransfer::SolutionTransfer()']\n ]],\n- ['solve_722', ['solve', ['../classCUDAWrappers_1_1SolverDirect.html#ae287a55668ca67d194d8f459b937fad8', 1, 'CUDAWrappers::SolverDirect::solve()'],\n- ['../classBaseQR.html#a6fda22779712cb578b129b659590aff0', 1, 'BaseQR::solve()'],\n- ['../classPETScWrappers_1_1TimeStepper.html#a99da12e36485bbb20a947b14a862c90a', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y, AMatrixType &A, PMatrixType &P)'],\n- ['../classPETScWrappers_1_1TimeStepper.html#a133eb65b9dfa87f113062d2e6722dfda', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y, PMatrixType &P)'],\n- ['../classPETScWrappers_1_1TimeStepper.html#ad62bfc86d9b0f3d52797e0ceb752e517', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y)'],\n- ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a08d73453888955bd5a9863be32f3b347', 1, 'PETScWrappers::SparseDirectMUMPS::solve()'],\n+ ['solve_722', ['solve', ['../classPETScWrappers_1_1NonlinearSolver.html#a6824521a044f81e3c214d31dbddfd95e', 1, 'PETScWrappers::NonlinearSolver::solve()'],\n ['../classPETScWrappers_1_1SolverBase.html#abfc375c07a38e1314a79c6a1093edb53', 1, 'PETScWrappers::SolverBase::solve()'],\n- ['../classPETScWrappers_1_1NonlinearSolver.html#a6824521a044f81e3c214d31dbddfd95e', 1, 'PETScWrappers::NonlinearSolver::solve()'],\n+ ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a08d73453888955bd5a9863be32f3b347', 1, 'PETScWrappers::SparseDirectMUMPS::solve()'],\n+ ['../classPETScWrappers_1_1TimeStepper.html#ad62bfc86d9b0f3d52797e0ceb752e517', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y)'],\n+ ['../classPETScWrappers_1_1TimeStepper.html#a133eb65b9dfa87f113062d2e6722dfda', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y, PMatrixType &P)'],\n+ ['../classPETScWrappers_1_1TimeStepper.html#a99da12e36485bbb20a947b14a862c90a', 1, 'PETScWrappers::TimeStepper::solve(VectorType &y, AMatrixType &A, PMatrixType &P)'],\n ['../classSLEPcWrappers_1_1SolverBase.html#a853fa13eb1a29f59335250475d39433b', 1, 'SLEPcWrappers::SolverBase::solve()'],\n- ['../classArpackSolver.html#ae49067a1359b8d6794b92e1d0b405df6', 1, 'ArpackSolver::solve()'],\n- ['../classEigenPower.html#a5d1b4586ee7d951a30f204961068aed1', 1, 'EigenPower::solve()'],\n- ['../classEigenInverse.html#ae9a92ea1e8cbb04af2a7a95ddbee7c05', 1, 'EigenInverse::solve()'],\n+ ['../classBaseQR.html#a6fda22779712cb578b129b659590aff0', 1, 'BaseQR::solve()'],\n ['../classPETScWrappers_1_1NonlinearSolver.html#aad0cf7e52853d0921d45db1aed0628b5', 1, 'PETScWrappers::NonlinearSolver::solve(VectorType &x, PMatrixType &P)'],\n ['../classPETScWrappers_1_1NonlinearSolver.html#a7d31a59c610ed0e48a6392865828b88c', 1, 'PETScWrappers::NonlinearSolver::solve(VectorType &x)'],\n ['../classPArpackSolver.html#a8462215d8b273ec58f255ce1f2856dec', 1, 'PArpackSolver::solve(const MatrixType1 &A, const MatrixType2 &B, const INVERSE &inverse, std::vector< std::complex< double > > &eigenvalues, std::vector< VectorType * > &eigenvectors, const unsigned int n_eigenvalues)'],\n ['../classPArpackSolver.html#a6b11d2a4ee3046ace276667be420c15c', 1, 'PArpackSolver::solve(const MatrixType1 &A, const MatrixType2 &B, const INVERSE &inverse, std::vector< std::complex< double > > &eigenvalues, std::vector< VectorType > &eigenvectors, const unsigned int n_eigenvalues)'],\n ['../classLAPACKFullMatrix.html#a7446f061d01a871d110b8bb2594f32a6', 1, 'LAPACKFullMatrix::solve(LAPACKFullMatrix< number > &B, const bool transposed=false) const'],\n ['../classLAPACKFullMatrix.html#a7bf80811306c4cdddd287c295e2f096c', 1, 'LAPACKFullMatrix::solve(Vector< number > &v, const bool transposed=false) const'],\n ['../classGinkgoWrappers_1_1SolverBase.html#ab10de093fe9cfb3829820f41adb95108', 1, 'GinkgoWrappers::SolverBase::solve()'],\n+ ['../classEigenInverse.html#ae9a92ea1e8cbb04af2a7a95ddbee7c05', 1, 'EigenInverse::solve()'],\n+ ['../classEigenPower.html#a5d1b4586ee7d951a30f204961068aed1', 1, 'EigenPower::solve()'],\n+ ['../classCUDAWrappers_1_1SolverDirect.html#ae287a55668ca67d194d8f459b937fad8', 1, 'CUDAWrappers::SolverDirect::solve()'],\n+ ['../classArpackSolver.html#ae49067a1359b8d6794b92e1d0b405df6', 1, 'ArpackSolver::solve()'],\n ['../classTrilinosWrappers_1_1SolverBase.html#acaba6101091a8853b7e429a00026a872', 1, 'TrilinosWrappers::SolverBase::solve()'],\n ['../classSLEPcWrappers_1_1SolverBase.html#acca4f79c1dd845716a3f7cfa0cff0b82', 1, 'SLEPcWrappers::SolverBase::solve()'],\n ['../classSparseDirectUMFPACK.html#ac581d1ba43cee9de89cf7217584980a3', 1, 'SparseDirectUMFPACK::solve(const Matrix &matrix, Vector< std::complex< double > > &rhs_and_solution, const bool transpose=false)'],\n ['../classSparseDirectUMFPACK.html#a044f8fa5b6cdf89fb30d410d2fb1b059', 1, 'SparseDirectUMFPACK::solve(const Matrix &matrix, BlockVector< double > &rhs_and_solution, const bool transpose=false)'],\n ['../classSparseDirectUMFPACK.html#a61cad1ea0d95008b49ba1e90bdfaf5f4', 1, 'SparseDirectUMFPACK::solve(const Matrix &matrix, BlockVector< std::complex< double > > &rhs_and_solution, const bool transpose=false)'],\n ['../classTrilinosWrappers_1_1SolverBase.html#a3dfbf75de5fe13880fa2ad2455a89f67', 1, 'TrilinosWrappers::SolverBase::solve(const SparseMatrix &A, MPI::Vector &x, const MPI::Vector &b, const PreconditionBase &preconditioner)'],\n ['../classTrilinosWrappers_1_1SolverBase.html#aa9423586774003f660e66ad2233f1d1a', 1, 'TrilinosWrappers::SolverBase::solve(const Epetra_Operator &A, MPI::Vector &x, const MPI::Vector &b, const PreconditionBase &preconditioner)'],\n@@ -2002,178 +2002,178 @@\n ['solverdirectbase_776', ['solverdirectbase', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectBase.html#a64e35ad0ac12c39a105b4b99a7aee51f', 1, 'LinearAlgebra::TpetraWrappers::SolverDirectBase::SolverDirectBase()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectBase.html', 1, 'LinearAlgebra::TpetraWrappers::SolverDirectBase< Number, MemorySpace >']\n ]],\n ['solverdirectbase_3c_20number_2c_20_3a_3amemoryspace_3a_3ahost_20_3e_777', ['SolverDirectBase< Number, ::MemorySpace::Host >', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectBase.html', 1, 'LinearAlgebra::TpetraWrappers']]],\n ['solverdirectklu2_778', ['solverdirectklu2', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectKLU2.html#ab3a76c2c5a453cb54efcbc7434c7cb82', 1, 'LinearAlgebra::TpetraWrappers::SolverDirectKLU2::SolverDirectKLU2()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectKLU2.html', 1, 'LinearAlgebra::TpetraWrappers::SolverDirectKLU2< Number, MemorySpace >']\n ]],\n- ['solverfcg_779', ['solverfcg', ['../classGinkgoWrappers_1_1SolverFCG.html#ab0a0de9f505021b179488333a21e4594', 1, 'GinkgoWrappers::SolverFCG::SolverFCG(SolverControl &solver_control, const std::string &exec_type, const AdditionalData &data=AdditionalData())'],\n- ['../classGinkgoWrappers_1_1SolverFCG.html#afd741d566294831fac6b06ec16437a0b', 1, 'GinkgoWrappers::SolverFCG::SolverFCG(SolverControl &solver_control, const std::string &exec_type, const std::shared_ptr< gko::LinOpFactory > &preconditioner, const AdditionalData &data=AdditionalData())'],\n+ ['solverfcg_779', ['solverfcg', ['../classGinkgoWrappers_1_1SolverFCG.html#afd741d566294831fac6b06ec16437a0b', 1, 'GinkgoWrappers::SolverFCG::SolverFCG(SolverControl &solver_control, const std::string &exec_type, const std::shared_ptr< gko::LinOpFactory > &preconditioner, const AdditionalData &data=AdditionalData())'],\n+ ['../classGinkgoWrappers_1_1SolverFCG.html#ab0a0de9f505021b179488333a21e4594', 1, 'GinkgoWrappers::SolverFCG::SolverFCG(SolverControl &solver_control, const std::string &exec_type, const AdditionalData &data=AdditionalData())'],\n ['../classGinkgoWrappers_1_1SolverFCG.html', 1, 'GinkgoWrappers::SolverFCG< ValueType, IndexType >']\n ]],\n- ['solverfgmres_780', ['solverfgmres', ['../classSolverFGMRES.html#a1fdfa99be49ee8ca02c00b1ee021a7ea', 1, 'SolverFGMRES::SolverFGMRES(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverFGMRES.html#a5710da72286b4b24181be839b23c9320', 1, 'SolverFGMRES::SolverFGMRES(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverFGMRES.html', 1, 'SolverFGMRES< VectorType >']\n+ ['solverfgmres_780', ['solverfgmres', ['../classSolverFGMRES.html#a5710da72286b4b24181be839b23c9320', 1, 'SolverFGMRES::SolverFGMRES()'],\n+ ['../classSolverFGMRES.html', 1, 'SolverFGMRES< VectorType >'],\n+ ['../classSolverFGMRES.html#a1fdfa99be49ee8ca02c00b1ee021a7ea', 1, 'SolverFGMRES::SolverFGMRES()']\n ]],\n ['solverfgmres_3c_20vector_3c_20double_20_3e_20_3e_781', ['SolverFGMRES< Vector< double > >', ['../classSolverFGMRES.html', 1, '']]],\n- ['solverfire_782', ['solverfire', ['../classSolverFIRE.html#aa728a90d310d39eb529261110064b44d', 1, 'SolverFIRE::SolverFIRE()'],\n- ['../classSolverFIRE.html', 1, 'SolverFIRE< VectorType >'],\n- ['../classSolverFIRE.html#a0e3e9a3aff48c7ad602e536a66c67b35', 1, 'SolverFIRE::SolverFIRE()']\n+ ['solverfire_782', ['solverfire', ['../classSolverFIRE.html#a0e3e9a3aff48c7ad602e536a66c67b35', 1, 'SolverFIRE::SolverFIRE(SolverControl &solver_control, VectorMemory< VectorType > &vector_memory, const AdditionalData &data=AdditionalData())'],\n+ ['../classSolverFIRE.html#aa728a90d310d39eb529261110064b44d', 1, 'SolverFIRE::SolverFIRE(SolverControl &solver_control, const AdditionalData &data=AdditionalData())'],\n+ ['../classSolverFIRE.html', 1, 'SolverFIRE< VectorType >']\n ]],\n- ['solverflexiblecg_783', ['solverflexiblecg', ['../classSolverFlexibleCG.html', 1, 'SolverFlexibleCG< VectorType >'],\n+ ['solverflexiblecg_783', ['solverflexiblecg', ['../classSolverFlexibleCG.html#aea5e0e9e656bb8cead918dbc359a9965', 1, 'SolverFlexibleCG::SolverFlexibleCG(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n ['../classSolverFlexibleCG.html#aea3a3daf1f09ac464a8525de8b7234c9', 1, 'SolverFlexibleCG::SolverFlexibleCG(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverFlexibleCG.html#aea5e0e9e656bb8cead918dbc359a9965', 1, 'SolverFlexibleCG::SolverFlexibleCG(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())']\n+ ['../classSolverFlexibleCG.html', 1, 'SolverFlexibleCG< VectorType >']\n ]],\n ['solvergeneralizeddavidson_784', ['solvergeneralizeddavidson', ['../classSLEPcWrappers_1_1SolverGeneralizedDavidson.html#a9cdc4915c3ec61614738ccb4e4fd3b2e', 1, 'SLEPcWrappers::SolverGeneralizedDavidson::SolverGeneralizedDavidson()'],\n ['../classSLEPcWrappers_1_1SolverGeneralizedDavidson.html', 1, 'SLEPcWrappers::SolverGeneralizedDavidson']\n ]],\n- ['solvergmres_785', ['solvergmres', ['../classGinkgoWrappers_1_1SolverGMRES.html#a68dde65089c8c0100212acabbaf8a7ae', 1, 'GinkgoWrappers::SolverGMRES::SolverGMRES()'],\n- ['../classTrilinosWrappers_1_1SolverGMRES.html', 1, 'TrilinosWrappers::SolverGMRES'],\n- ['../classSolverGMRES.html', 1, 'SolverGMRES< VectorType >'],\n- ['../namespaceLinearAlgebraPETSc.html#a9b3a0b860cbd543367526766a589aa6f', 1, 'LinearAlgebraPETSc::SolverGMRES'],\n- ['../namespaceLinearAlgebraTrilinos.html#a15dc1560501d6bec5adadd22d3401a12', 1, 'LinearAlgebraTrilinos::SolverGMRES'],\n- ['../classPETScWrappers_1_1SolverGMRES.html', 1, 'PETScWrappers::SolverGMRES'],\n+ ['solvergmres_785', ['solvergmres', ['../classSolverGMRES.html', 1, 'SolverGMRES< VectorType >'],\n+ ['../classPETScWrappers_1_1SolverGMRES.html#a0f3a37da80ddd43051e58d68b0265110', 1, 'PETScWrappers::SolverGMRES::SolverGMRES()'],\n+ ['../classGinkgoWrappers_1_1SolverGMRES.html#a68dde65089c8c0100212acabbaf8a7ae', 1, 'GinkgoWrappers::SolverGMRES::SolverGMRES(SolverControl &solver_control, const std::string &exec_type, const AdditionalData &data=AdditionalData())'],\n+ ['../classGinkgoWrappers_1_1SolverGMRES.html#a0ec5b512f67d96e0792348c5088b4f16', 1, 'GinkgoWrappers::SolverGMRES::SolverGMRES(SolverControl &solver_control, const std::string &exec_type, const std::shared_ptr< gko::LinOpFactory > &preconditioner, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SolverGMRES.html#ad9eab644dfb3f3cb2f7aaea962310ff8', 1, 'PETScWrappers::SolverGMRES::SolverGMRES()'],\n ['../classGinkgoWrappers_1_1SolverGMRES.html', 1, 'GinkgoWrappers::SolverGMRES< ValueType, IndexType >'],\n- ['../classGinkgoWrappers_1_1SolverGMRES.html#a0ec5b512f67d96e0792348c5088b4f16', 1, 'GinkgoWrappers::SolverGMRES::SolverGMRES()'],\n+ ['../classPETScWrappers_1_1SolverGMRES.html', 1, 'PETScWrappers::SolverGMRES'],\n+ ['../classTrilinosWrappers_1_1SolverGMRES.html', 1, 'TrilinosWrappers::SolverGMRES'],\n ['../classTrilinosWrappers_1_1SolverGMRES.html#ad9eab644dfb3f3cb2f7aaea962310ff8', 1, 'TrilinosWrappers::SolverGMRES::SolverGMRES()'],\n ['../classSolverGMRES.html#a20fea69602a523fdb4314ad8d58f22eb', 1, 'SolverGMRES::SolverGMRES(const SolverGMRES< VectorType > &)=delete'],\n ['../classSolverGMRES.html#ad9eab644dfb3f3cb2f7aaea962310ff8', 1, 'SolverGMRES::SolverGMRES(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n ['../classSolverGMRES.html#a7daabdaa13f77bfd0af4b3c3079f2caf', 1, 'SolverGMRES::SolverGMRES(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n- ['../classPETScWrappers_1_1SolverGMRES.html#a0f3a37da80ddd43051e58d68b0265110', 1, 'PETScWrappers::SolverGMRES::SolverGMRES(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())'],\n- ['../classPETScWrappers_1_1SolverGMRES.html#ad9eab644dfb3f3cb2f7aaea962310ff8', 1, 'PETScWrappers::SolverGMRES::SolverGMRES(SolverControl &cn, const AdditionalData &data=AdditionalData())']\n+ ['../namespaceLinearAlgebraPETSc.html#a9b3a0b860cbd543367526766a589aa6f', 1, 'LinearAlgebraPETSc::SolverGMRES'],\n+ ['../namespaceLinearAlgebraTrilinos.html#a15dc1560501d6bec5adadd22d3401a12', 1, 'LinearAlgebraTrilinos::SolverGMRES']\n ]],\n ['solvergmres_3c_20vector_3c_20double_20_3e_20_3e_786', ['SolverGMRES< Vector< double > >', ['../classSolverGMRES.html', 1, '']]],\n ['solveridr_787', ['solveridr', ['../classSolverIDR.html#ab6b7070d69acdaed22f1cdfec8069d1c', 1, 'SolverIDR::SolverIDR(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n ['../classSolverIDR.html#a1f59609cde6d24bb4d267d5ce75cf07e', 1, 'SolverIDR::SolverIDR(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n ['../classSolverIDR.html', 1, 'SolverIDR< VectorType >']\n ]],\n- ['solverir_788', ['solverir', ['../classGinkgoWrappers_1_1SolverIR.html#a68b92f260afbe96579654dff037578a3', 1, 'GinkgoWrappers::SolverIR::SolverIR()'],\n- ['../classGinkgoWrappers_1_1SolverIR.html', 1, 'GinkgoWrappers::SolverIR< ValueType, IndexType >'],\n- ['../classGinkgoWrappers_1_1SolverIR.html#a6772e1507a4403a1a401fa24b9aed2e2', 1, 'GinkgoWrappers::SolverIR::SolverIR()']\n+ ['solverir_788', ['solverir', ['../classGinkgoWrappers_1_1SolverIR.html', 1, 'GinkgoWrappers::SolverIR< ValueType, IndexType >'],\n+ ['../classGinkgoWrappers_1_1SolverIR.html#a68b92f260afbe96579654dff037578a3', 1, 'GinkgoWrappers::SolverIR::SolverIR(SolverControl &solver_control, const std::string &exec_type, const AdditionalData &data=AdditionalData())'],\n+ ['../classGinkgoWrappers_1_1SolverIR.html#a6772e1507a4403a1a401fa24b9aed2e2', 1, 'GinkgoWrappers::SolverIR::SolverIR(SolverControl &solver_control, const std::string &exec_type, const std::shared_ptr< gko::LinOpFactory > &inner_solver, const AdditionalData &data=AdditionalData())']\n ]],\n ['solverjacobidavidson_789', ['solverjacobidavidson', ['../classSLEPcWrappers_1_1SolverJacobiDavidson.html', 1, 'SLEPcWrappers::SolverJacobiDavidson'],\n ['../classSLEPcWrappers_1_1SolverJacobiDavidson.html#a2d45b7b83bd93a833f987e0677d53502', 1, 'SLEPcWrappers::SolverJacobiDavidson::SolverJacobiDavidson()']\n ]],\n ['solverkrylovschur_790', ['solverkrylovschur', ['../classSLEPcWrappers_1_1SolverKrylovSchur.html', 1, 'SLEPcWrappers::SolverKrylovSchur'],\n ['../classSLEPcWrappers_1_1SolverKrylovSchur.html#af8e7bf5848b9ad9b4e8fd36981d570d2', 1, 'SLEPcWrappers::SolverKrylovSchur::SolverKrylovSchur()']\n ]],\n ['solverlanczos_791', ['solverlanczos', ['../classSLEPcWrappers_1_1SolverLanczos.html', 1, 'SLEPcWrappers::SolverLanczos'],\n ['../classSLEPcWrappers_1_1SolverLanczos.html#afe01b4f89ef310e7fc5da80306433930', 1, 'SLEPcWrappers::SolverLanczos::SolverLanczos()']\n ]],\n- ['solverlapack_792', ['solverlapack', ['../classSLEPcWrappers_1_1SolverLAPACK.html#a02d84c27e448f9ac014c8c3988031da9', 1, 'SLEPcWrappers::SolverLAPACK::SolverLAPACK()'],\n- ['../classSLEPcWrappers_1_1SolverLAPACK.html', 1, 'SLEPcWrappers::SolverLAPACK']\n+ ['solverlapack_792', ['solverlapack', ['../classSLEPcWrappers_1_1SolverLAPACK.html', 1, 'SLEPcWrappers::SolverLAPACK'],\n+ ['../classSLEPcWrappers_1_1SolverLAPACK.html#a02d84c27e448f9ac014c8c3988031da9', 1, 'SLEPcWrappers::SolverLAPACK::SolverLAPACK()']\n ]],\n ['solverlsqr_793', ['solverlsqr', ['../classPETScWrappers_1_1SolverLSQR.html#af0562adb7a3192d66d7ba66aa211addd', 1, 'PETScWrappers::SolverLSQR::SolverLSQR(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())'],\n ['../classPETScWrappers_1_1SolverLSQR.html#a83916ac11c4e456b9c714c972535099a', 1, 'PETScWrappers::SolverLSQR::SolverLSQR(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n ['../classPETScWrappers_1_1SolverLSQR.html', 1, 'PETScWrappers::SolverLSQR']\n ]],\n- ['solverminres_794', ['solverminres', ['../classSolverMinRes.html#a7271274e0ae6165786c16cedb56e190d', 1, 'SolverMinRes::SolverMinRes(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverMinRes.html#af40c973a8d6a619b1f77a014135551e7', 1, 'SolverMinRes::SolverMinRes(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n+ ['solverminres_794', ['solverminres', ['../classSolverMinRes.html#af40c973a8d6a619b1f77a014135551e7', 1, 'SolverMinRes::SolverMinRes(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n+ ['../classSolverMinRes.html#a7271274e0ae6165786c16cedb56e190d', 1, 'SolverMinRes::SolverMinRes(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n ['../classSolverMinRes.html', 1, 'SolverMinRes< VectorType >']\n ]],\n ['solverminres_3c_20vector_3c_20double_20_3e_20_3e_795', ['SolverMinRes< Vector< double > >', ['../classSolverMinRes.html', 1, '']]],\n ['solvername_796', ['solvername', ['../classTrilinosWrappers_1_1SolverBase.html#afdefddba07cdfc566bfb749bcb5b0840', 1, 'TrilinosWrappers::SolverBase::SolverName'],\n ['../classTrilinosWrappers_1_1SolverBelos.html#a9f38d6d3139d6f3ebc8d11df949acf99', 1, 'TrilinosWrappers::SolverBelos::SolverName']\n ]],\n ['solverpower_797', ['solverpower', ['../classSLEPcWrappers_1_1SolverPower.html#ae14fba5d7247099fae0330574ede25b3', 1, 'SLEPcWrappers::SolverPower::SolverPower()'],\n ['../classSLEPcWrappers_1_1SolverPower.html', 1, 'SLEPcWrappers::SolverPower']\n ]],\n- ['solverpreonly_798', ['solverpreonly', ['../classPETScWrappers_1_1SolverPreOnly.html#a56978231e8a37364c38841ea29569346', 1, 'PETScWrappers::SolverPreOnly::SolverPreOnly()'],\n- ['../classPETScWrappers_1_1SolverPreOnly.html', 1, 'PETScWrappers::SolverPreOnly'],\n- ['../classPETScWrappers_1_1SolverPreOnly.html#ab952eb3be00bb170dba7eda3481cd53c', 1, 'PETScWrappers::SolverPreOnly::SolverPreOnly()']\n- ]],\n- ['solverqmrs_799', ['solverqmrs', ['../classSolverQMRS.html#a8201dc99bc89a5ccc43334c0691d2f33', 1, 'SolverQMRS::SolverQMRS(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverQMRS.html#ada0b6490b76d98824b9b426ba54a6004', 1, 'SolverQMRS::SolverQMRS(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n- ['../classSolverQMRS.html', 1, 'SolverQMRS< VectorType >']\n+ ['solverpreonly_798', ['solverpreonly', ['../classPETScWrappers_1_1SolverPreOnly.html', 1, 'PETScWrappers::SolverPreOnly'],\n+ ['../classPETScWrappers_1_1SolverPreOnly.html#ab952eb3be00bb170dba7eda3481cd53c', 1, 'PETScWrappers::SolverPreOnly::SolverPreOnly(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SolverPreOnly.html#a56978231e8a37364c38841ea29569346', 1, 'PETScWrappers::SolverPreOnly::SolverPreOnly(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())']\n+ ]],\n+ ['solverqmrs_799', ['solverqmrs', ['../classSolverQMRS.html', 1, 'SolverQMRS< VectorType >'],\n+ ['../classSolverQMRS.html#a8201dc99bc89a5ccc43334c0691d2f33', 1, 'SolverQMRS::SolverQMRS(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n+ ['../classSolverQMRS.html#ada0b6490b76d98824b9b426ba54a6004', 1, 'SolverQMRS::SolverQMRS(SolverControl &cn, const AdditionalData &data=AdditionalData())']\n ]],\n ['solverrelaxation_800', ['solverrelaxation', ['../classSolverRelaxation.html#a4b0fd7a74033570e6b621398d7e35d28', 1, 'SolverRelaxation::SolverRelaxation()'],\n ['../classSolverRelaxation.html', 1, 'SolverRelaxation< VectorType >']\n ]],\n- ['solverrichardson_801', ['solverrichardson', ['../classSolverRichardson.html#af4b2589f5d94f28bd8cd2f46c96fb148', 1, 'SolverRichardson::SolverRichardson(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['solverrichardson_801', ['solverrichardson', ['../classPETScWrappers_1_1SolverRichardson.html#af4b2589f5d94f28bd8cd2f46c96fb148', 1, 'PETScWrappers::SolverRichardson::SolverRichardson(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SolverRichardson.html#ab4e9021a5e0605b90f705add33642b26', 1, 'PETScWrappers::SolverRichardson::SolverRichardson(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())'],\n ['../classSolverRichardson.html#ab8a731576438f1175595037583b11d7b', 1, 'SolverRichardson::SolverRichardson(SolverControl &cn, VectorMemory< VectorType > &mem, const AdditionalData &data=AdditionalData())'],\n- ['../classPETScWrappers_1_1SolverRichardson.html#af4b2589f5d94f28bd8cd2f46c96fb148', 1, 'PETScWrappers::SolverRichardson::SolverRichardson()'],\n- ['../classSolverRichardson.html', 1, 'SolverRichardson< VectorType >'],\n- ['../classPETScWrappers_1_1SolverRichardson.html#ab4e9021a5e0605b90f705add33642b26', 1, 'PETScWrappers::SolverRichardson::SolverRichardson()'],\n- ['../classPETScWrappers_1_1SolverRichardson.html', 1, 'PETScWrappers::SolverRichardson']\n+ ['../classSolverRichardson.html#af4b2589f5d94f28bd8cd2f46c96fb148', 1, 'SolverRichardson::SolverRichardson(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SolverRichardson.html', 1, 'PETScWrappers::SolverRichardson'],\n+ ['../classSolverRichardson.html', 1, 'SolverRichardson< VectorType >']\n ]],\n ['solverrichardson_3c_20vector_3c_20double_20_3e_20_3e_802', ['SolverRichardson< Vector< double > >', ['../classSolverRichardson.html', 1, '']]],\n ['solvers_2eh_803', ['solvers.h', ['../solvers_8h.html', 1, '']]],\n- ['solverselector_804', ['solverselector', ['../classSolverSelector.html#adfb445fd78a4d060a9e5c3dd7b78131a', 1, 'SolverSelector::SolverSelector()'],\n- ['../classSolverSelector.html', 1, 'SolverSelector< VectorType >'],\n- ['../classSolverSelector.html#ab703bd437df4bb59a7d6b031b8ba6824', 1, 'SolverSelector::SolverSelector()']\n+ ['solverselector_804', ['solverselector', ['../classSolverSelector.html', 1, 'SolverSelector< VectorType >'],\n+ ['../classSolverSelector.html#adfb445fd78a4d060a9e5c3dd7b78131a', 1, 'SolverSelector::SolverSelector(const std::string &name, SolverControl &control)'],\n+ ['../classSolverSelector.html#ab703bd437df4bb59a7d6b031b8ba6824', 1, 'SolverSelector::SolverSelector()=default']\n ]],\n ['solvertcqmr_805', ['solvertcqmr', ['../classPETScWrappers_1_1SolverTCQMR.html#ae32fe5a5a99c2f1271a5158bd35c2255', 1, 'PETScWrappers::SolverTCQMR::SolverTCQMR()'],\n ['../classPETScWrappers_1_1SolverTCQMR.html', 1, 'PETScWrappers::SolverTCQMR'],\n ['../classPETScWrappers_1_1SolverTCQMR.html#a7814d604dc03de6e9ca40e2477c087ef', 1, 'PETScWrappers::SolverTCQMR::SolverTCQMR()']\n ]],\n- ['solvertfqmr_806', ['solvertfqmr', ['../classTrilinosWrappers_1_1SolverTFQMR.html', 1, 'TrilinosWrappers::SolverTFQMR'],\n- ['../classPETScWrappers_1_1SolverTFQMR.html', 1, 'PETScWrappers::SolverTFQMR'],\n+ ['solvertfqmr_806', ['solvertfqmr', ['../classPETScWrappers_1_1SolverTFQMR.html', 1, 'PETScWrappers::SolverTFQMR'],\n ['../classTrilinosWrappers_1_1SolverTFQMR.html#aa472b93bb7f412ec5f543ec0768f1634', 1, 'TrilinosWrappers::SolverTFQMR::SolverTFQMR()'],\n- ['../classPETScWrappers_1_1SolverTFQMR.html#a915b832900f25c6b0e533ac414f765dc', 1, 'PETScWrappers::SolverTFQMR::SolverTFQMR(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())'],\n- ['../classPETScWrappers_1_1SolverTFQMR.html#ae3b70779943b2d6b151f500662a56f68', 1, 'PETScWrappers::SolverTFQMR::SolverTFQMR(SolverControl &cn, const AdditionalData &data=AdditionalData())']\n+ ['../classTrilinosWrappers_1_1SolverTFQMR.html', 1, 'TrilinosWrappers::SolverTFQMR'],\n+ ['../classPETScWrappers_1_1SolverTFQMR.html#ae3b70779943b2d6b151f500662a56f68', 1, 'PETScWrappers::SolverTFQMR::SolverTFQMR(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SolverTFQMR.html#a915b832900f25c6b0e533ac414f765dc', 1, 'PETScWrappers::SolverTFQMR::SolverTFQMR(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())']\n ]],\n ['solvertype_807', ['SolverType', ['../classNonlinearSolverSelector_1_1AdditionalData.html#a458e4d6fb204a1aacf159665e4b7d810', 1, 'NonlinearSolverSelector::AdditionalData']]],\n ['some_5fto_5fsome_808', ['some_to_some', ['../namespaceUtilities_1_1MPI.html#a45c66d6552aa01199a863a77221b64b3', 1, 'Utilities::MPI']]],\n- ['sor_809', ['sor', ['../classSparseMatrix.html#ab0c29bffd5a8424e4fe12e0bde814b5b', 1, 'SparseMatrix::SOR()'],\n- ['../classChunkSparseMatrix.html#ad53944dc7b09001d11ed026255cb358f', 1, 'ChunkSparseMatrix::SOR()']\n+ ['sor_809', ['sor', ['../classChunkSparseMatrix.html#ad53944dc7b09001d11ed026255cb358f', 1, 'ChunkSparseMatrix::SOR()'],\n+ ['../classSparseMatrix.html#ab0c29bffd5a8424e4fe12e0bde814b5b', 1, 'SparseMatrix::SOR()']\n ]],\n- ['sor_5fstep_810', ['sor_step', ['../classSparseMatrix.html#a198be3a66b3160777c2b511636dc17c7', 1, 'SparseMatrix::SOR_step()'],\n- ['../classChunkSparseMatrix.html#afbed725005ae31c2043903c5528ba60a', 1, 'ChunkSparseMatrix::SOR_step()']\n+ ['sor_5fstep_810', ['sor_step', ['../classChunkSparseMatrix.html#afbed725005ae31c2043903c5528ba60a', 1, 'ChunkSparseMatrix::SOR_step()'],\n+ ['../classSparseMatrix.html#a198be3a66b3160777c2b511636dc17c7', 1, 'SparseMatrix::SOR_step()']\n ]],\n ['sorjacobi_811', ['SORJacobi', ['../structPETScWrappers_1_1PreconditionBoomerAMG_1_1AdditionalData.html#a5d92688a1fdd10088cddaf971b84e987a532f235785ea593b4cb5310addde46d0', 1, 'PETScWrappers::PreconditionBoomerAMG::AdditionalData']]],\n ['sort_812', ['sort', ['../classTableIndices.html#a8749a68bcfa5ab2892017dcfd95b9122', 1, 'TableIndices']]],\n- ['sort_5farrays_813', ['sort_arrays', ['../classSparseDirectUMFPACK.html#a8f08924b9c05dbc4c4794d61ee23fb82', 1, 'SparseDirectUMFPACK::sort_arrays(const SparseMatrixEZ< number > &)'],\n+ ['sort_5farrays_813', ['sort_arrays', ['../classSparseDirectUMFPACK.html#a89de20908e57f7b8b3761d18441f131d', 1, 'SparseDirectUMFPACK::sort_arrays(const BlockSparseMatrix< number > &)'],\n ['../classSparseDirectUMFPACK.html#ab2aa3b8eefe3c7dab0423e024538a085', 1, 'SparseDirectUMFPACK::sort_arrays(const SparseMatrix< number > &)'],\n- ['../classSparseDirectUMFPACK.html#a89de20908e57f7b8b3761d18441f131d', 1, 'SparseDirectUMFPACK::sort_arrays(const BlockSparseMatrix< number > &)']\n+ ['../classSparseDirectUMFPACK.html#a8f08924b9c05dbc4c4794d61ee23fb82', 1, 'SparseDirectUMFPACK::sort_arrays(const SparseMatrixEZ< number > &)']\n ]],\n ['sort_5fmemory_5fslots_814', ['sort_memory_slots', ['../classParticles_1_1PropertyPool.html#ab5269448f493a363138fe8f90cc0ecd5', 1, 'Particles::PropertyPool']]],\n ['sort_5fparticles_5finto_5fsubdomains_5fand_5fcells_815', ['sort_particles_into_subdomains_and_cells', ['../classParticles_1_1ParticleHandler.html#ad817e16828f2355b0cad6fef8db7df81', 1, 'Particles::ParticleHandler']]],\n- ['sort_5fselected_5fdofs_5fback_816', ['sort_selected_dofs_back', ['../namespaceDoFRenumbering.html#a7879b1de6248876edccd07c9b37d84c8', 1, 'DoFRenumbering::sort_selected_dofs_back(DoFHandler< dim, spacedim > &dof_handler, const std::vector< bool > &selected_dofs)'],\n- ['../namespaceDoFRenumbering.html#a443837e68de5c74cd84475034852aa2b', 1, 'DoFRenumbering::sort_selected_dofs_back(DoFHandler< dim, spacedim > &dof_handler, const std::vector< bool > &selected_dofs, const unsigned int level)']\n+ ['sort_5fselected_5fdofs_5fback_816', ['sort_selected_dofs_back', ['../namespaceDoFRenumbering.html#a443837e68de5c74cd84475034852aa2b', 1, 'DoFRenumbering::sort_selected_dofs_back(DoFHandler< dim, spacedim > &dof_handler, const std::vector< bool > &selected_dofs, const unsigned int level)'],\n+ ['../namespaceDoFRenumbering.html#a7879b1de6248876edccd07c9b37d84c8', 1, 'DoFRenumbering::sort_selected_dofs_back(DoFHandler< dim, spacedim > &dof_handler, const std::vector< bool > &selected_dofs)']\n ]],\n- ['sorted_817', ['sorted', ['../namespaceinternal.html#aa1c66592673b9ca3c1f4adecdc7897cea26decc94d83c358f67f11c3cbd99b126', 1, 'internal::sorted'],\n- ['../classAffineConstraints.html#a2cacb6fdc27f68b1db0766faff484604', 1, 'AffineConstraints::sorted']\n+ ['sorted_817', ['sorted', ['../classAffineConstraints.html#a2cacb6fdc27f68b1db0766faff484604', 1, 'AffineConstraints::sorted'],\n+ ['../namespaceinternal.html#aa1c66592673b9ca3c1f4adecdc7897cea26decc94d83c358f67f11c3cbd99b126', 1, 'internal::sorted']\n ]],\n ['sorteigenvaluesvectors_818', ['SortEigenValuesVectors', ['../structinternal_1_1SymmetricTensorImplementation_1_1SortEigenValuesVectors.html', 1, 'internal::SymmetricTensorImplementation']]],\n ['source_5f_819', ['source_', ['../classinternal_1_1AlignedVectorCopyConstruct.html#a059b579e814df28d5b93c9b0571df9dc', 1, 'internal::AlignedVectorCopyConstruct::source_'],\n ['../classinternal_1_1AlignedVectorMoveConstruct.html#a2223e1d503e4d732aa098eb7c1657efe', 1, 'internal::AlignedVectorMoveConstruct::source_']\n ]],\n ['source_5fgrid_820', ['source_grid', ['../classInterGridMap.html#a2b6f6a7b0ee53442d031e4bc83456195', 1, 'InterGridMap']]],\n- ['source_5fstored_5felements_821', ['source_stored_elements', ['../classLinearAlgebra_1_1ReadWriteVector.html#abc229cf3f043c2d7ecc0ecacc2f39f2e', 1, 'LinearAlgebra::ReadWriteVector::source_stored_elements'],\n- ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#ad4eadb0393c133e24740e28c56fd1439', 1, 'LinearAlgebra::EpetraWrappers::Vector::source_stored_elements'],\n+ ['source_5fstored_5felements_821', ['source_stored_elements', ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#ad4eadb0393c133e24740e28c56fd1439', 1, 'LinearAlgebra::EpetraWrappers::Vector::source_stored_elements'],\n+ ['../classLinearAlgebra_1_1ReadWriteVector.html#abc229cf3f043c2d7ecc0ecacc2f39f2e', 1, 'LinearAlgebra::ReadWriteVector::source_stored_elements'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#a8fe4f215c6e5af20fa4cede83b6748e6', 1, 'LinearAlgebra::TpetraWrappers::Vector::source_stored_elements']\n ]],\n ['sourceclass_822', ['SourceClass', ['../classSourceClass.html', 1, '']]],\n ['sp_5fdescr_823', ['sp_descr', ['../classCUDAWrappers_1_1SparseMatrix.html#a9a8531c5bf108f2d7b44a7d30fa5866d', 1, 'CUDAWrappers::SparseMatrix']]],\n ['space_20descriptions_824', ['Finite element space descriptions', ['../group__fe.html', 1, '']]],\n ['space_5fdim_825', ['space_dim', ['../structDataOutBase_1_1Patch.html#a97333e18dad880741c9330f2d7be9fce', 1, 'DataOutBase::Patch::space_dim'],\n ['../structDataOutBase_1_1Patch_3_010_00_01spacedim_01_4.html#ad3ffd4adda353c536ea341c02520d251', 1, 'DataOutBase::Patch< 0, spacedim >::space_dim']\n ]],\n- ['space_5fdimension_826', ['space_dimension', ['../classMeshWorker_1_1IntegrationInfo.html#a1257b4a22d587f626f2fe83f3779721f', 1, 'MeshWorker::IntegrationInfo::space_dimension'],\n+ ['space_5fdimension_826', ['space_dimension', ['../classFESubfaceValues.html#a1a0da8b5685d0986f53208b1efad8849', 1, 'FESubfaceValues::space_dimension'],\n ['../classXDMFEntry.html#aecd2cf7afcf617f2576a9f7755d99d27', 1, 'XDMFEntry::space_dimension'],\n+ ['../classMeshWorker_1_1IntegrationInfo.html#a1257b4a22d587f626f2fe83f3779721f', 1, 'MeshWorker::IntegrationInfo::space_dimension'],\n ['../classhp_1_1FEValues.html#ac1b163f9344510cc3ada47b87de95430', 1, 'hp::FEValues::space_dimension'],\n+ ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#ac528d364fd6ca159bff216bdeb6852fe', 1, 'TriaAccessor< 0, 1, spacedim >::space_dimension'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a05dc3108a2aa95039b63732034829d19', 1, 'TriaAccessor< 0, dim, spacedim >::space_dimension'],\n+ ['../classInvalidAccessor.html#a2adb54058528be1e896c7a4a6e26d3f9', 1, 'InvalidAccessor::space_dimension'],\n+ ['../classTriaAccessorBase.html#a2131ba12ea4f87124032394f029e1ae7', 1, 'TriaAccessorBase::space_dimension'],\n+ ['../classTriangulation.html#a93d0da28b11e60e2efe59a24ebb3eb23', 1, 'Triangulation::space_dimension'],\n ['../classCellDataStorage.html#aaf369129aeac25da22a15bdb2faadf0c', 1, 'CellDataStorage::space_dimension'],\n ['../classDoFAccessor.html#a0ebf5625b40e2ecedaaeef5f684d3fab', 1, 'DoFAccessor::space_dimension'],\n ['../classDoFAccessor_3_010_00_011_00_01spacedim_00_01level__dof__access_01_4.html#ab75512c4886db880024d402485f4ccca', 1, 'DoFAccessor< 0, 1, spacedim, level_dof_access >::space_dimension'],\n ['../classDoFHandler.html#a487655c6f995924828ebac2b002d9441', 1, 'DoFHandler::space_dimension'],\n ['../classFiniteElement.html#a60f0839966450e669d1a6d4c6789e960', 1, 'FiniteElement::space_dimension'],\n ['../classFEFaceValues.html#ac33217b956de1217f5009db6593f6174', 1, 'FEFaceValues::space_dimension'],\n- ['../classFESubfaceValues.html#a1a0da8b5685d0986f53208b1efad8849', 1, 'FESubfaceValues::space_dimension'],\n- ['../classTriangulation.html#a93d0da28b11e60e2efe59a24ebb3eb23', 1, 'Triangulation::space_dimension'],\n- ['../classTriaAccessorBase.html#a2131ba12ea4f87124032394f029e1ae7', 1, 'TriaAccessorBase::space_dimension'],\n- ['../classInvalidAccessor.html#a2adb54058528be1e896c7a4a6e26d3f9', 1, 'InvalidAccessor::space_dimension'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a05dc3108a2aa95039b63732034829d19', 1, 'TriaAccessor< 0, dim, spacedim >::space_dimension'],\n- ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#ac528d364fd6ca159bff216bdeb6852fe', 1, 'TriaAccessor< 0, 1, spacedim >::space_dimension'],\n ['../classFEValuesBase.html#a6541820cb52f78a4d43de18be0352002', 1, 'FEValuesBase::space_dimension']\n ]],\n ['space_5fdimension_5flabels_827', ['space_dimension_labels', ['../structDataOutBase_1_1GnuplotFlags.html#a1d7b4326557caa5cf7a04988fef96306', 1, 'DataOutBase::GnuplotFlags']]],\n ['space_5fvars_828', ['space_vars', ['../classFunctionManifold.html#a765a33128fca25cd021429a33b2fe967', 1, 'FunctionManifold']]],\n- ['spacedim_829', ['spacedim', ['../classDoFCellAccessor.html#a8b0e36ef5665c0ad1921049acb84604e', 1, 'DoFCellAccessor::spacedim'],\n- ['../classTorusManifold.html#a235b1553d95cd5dd1fc9ad90d59e4990', 1, 'TorusManifold::spacedim'],\n- ['../classTensorProductManifold.html#a837ba00d9a8940603373132ec9d7e191', 1, 'TensorProductManifold::spacedim']\n+ ['spacedim_829', ['spacedim', ['../classTorusManifold.html#a235b1553d95cd5dd1fc9ad90d59e4990', 1, 'TorusManifold::spacedim'],\n+ ['../classTensorProductManifold.html#a837ba00d9a8940603373132ec9d7e191', 1, 'TensorProductManifold::spacedim'],\n+ ['../classDoFCellAccessor.html#a8b0e36ef5665c0ad1921049acb84604e', 1, 'DoFCellAccessor::spacedim']\n ]],\n ['spacedimension_830', ['spacedimension', ['../classPersistentTriangulation.html#a9591fbe1bf861f4333f1b2e3de0fc287', 1, 'PersistentTriangulation']]],\n ['spaces_831', ['Polynomials and polynomial spaces', ['../group__Polynomials.html', 1, '']]],\n ['spans_5ftwo_5fintervals_832', ['spans_two_intervals', ['../classPolynomials_1_1PiecewisePolynomial.html#af2ca6c04e2a7c1b942c4c850efc08570', 1, 'Polynomials::PiecewisePolynomial']]],\n ['sparse_5fdecomposition_2ecc_833', ['sparse_decomposition.cc', ['../sparse__decomposition_8cc.html', 1, '']]],\n ['sparse_5fdecomposition_2eh_834', ['sparse_decomposition.h', ['../sparse__decomposition_8h.html', 1, '']]],\n ['sparse_5fdirect_2ecc_835', ['sparse_direct.cc', ['../sparse__direct_8cc.html', 1, '']]],\n@@ -2188,120 +2188,120 @@\n ['sparse_5fmatrix_5finst2_2ecc_844', ['sparse_matrix_inst2.cc', ['../sparse__matrix__inst2_8cc.html', 1, '']]],\n ['sparse_5fmatrix_5ftools_2eh_845', ['sparse_matrix_tools.h', ['../sparse__matrix__tools_8h.html', 1, '']]],\n ['sparse_5fmic_2ecc_846', ['sparse_mic.cc', ['../sparse__mic_8cc.html', 1, '']]],\n ['sparse_5fmic_2eh_847', ['sparse_mic.h', ['../sparse__mic_8h.html', 1, '']]],\n ['sparse_5fvanka_2ecc_848', ['sparse_vanka.cc', ['../sparse__vanka_8cc.html', 1, '']]],\n ['sparse_5fvanka_2eh_849', ['sparse_vanka.h', ['../sparse__vanka_8h.html', 1, '']]],\n ['sparseblockvanka_850', ['sparseblockvanka', ['../classSparseBlockVanka.html', 1, 'SparseBlockVanka< number >'],\n- ['../classSparseBlockVanka.html#aaa8cdd87a01a0d331978494d4678f433', 1, 'SparseBlockVanka::SparseBlockVanka()'],\n- ['../classSparseVanka.html#a124076b34c9c5c998b7d5b64ffb0cfc7', 1, 'SparseVanka::SparseBlockVanka']\n+ ['../classSparseVanka.html#a124076b34c9c5c998b7d5b64ffb0cfc7', 1, 'SparseVanka::SparseBlockVanka'],\n+ ['../classSparseBlockVanka.html#aaa8cdd87a01a0d331978494d4678f433', 1, 'SparseBlockVanka::SparseBlockVanka()']\n ]],\n- ['sparsedirectmumps_851', ['sparsedirectmumps', ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a90f3c6be5ff5a7a88d941e02d48167db', 1, 'PETScWrappers::SparseDirectMUMPS::SparseDirectMUMPS()'],\n- ['../classPETScWrappers_1_1SparseDirectMUMPS.html', 1, 'PETScWrappers::SparseDirectMUMPS'],\n- ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a80b441683f6ff89891028e4cda7b63f5', 1, 'PETScWrappers::SparseDirectMUMPS::SparseDirectMUMPS()']\n+ ['sparsedirectmumps_851', ['sparsedirectmumps', ['../classPETScWrappers_1_1SparseDirectMUMPS.html', 1, 'PETScWrappers::SparseDirectMUMPS'],\n+ ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a90f3c6be5ff5a7a88d941e02d48167db', 1, 'PETScWrappers::SparseDirectMUMPS::SparseDirectMUMPS(SolverControl &cn, const AdditionalData &data=AdditionalData())'],\n+ ['../classPETScWrappers_1_1SparseDirectMUMPS.html#a80b441683f6ff89891028e4cda7b63f5', 1, 'PETScWrappers::SparseDirectMUMPS::SparseDirectMUMPS(SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())']\n ]],\n- ['sparsedirectumfpack_852', ['sparsedirectumfpack', ['../classSparseDirectUMFPACK.html#adb7961d3df78499fd885763482a77ecc', 1, 'SparseDirectUMFPACK::SparseDirectUMFPACK()'],\n- ['../classSparseDirectUMFPACK.html', 1, 'SparseDirectUMFPACK']\n+ ['sparsedirectumfpack_852', ['sparsedirectumfpack', ['../classSparseDirectUMFPACK.html', 1, 'SparseDirectUMFPACK'],\n+ ['../classSparseDirectUMFPACK.html#adb7961d3df78499fd885763482a77ecc', 1, 'SparseDirectUMFPACK::SparseDirectUMFPACK()']\n ]],\n- ['sparseilu_853', ['sparseilu', ['../classSparseMatrix.html#a821b53e73219682e8d8efdacd3571e62', 1, 'SparseMatrix::SparseILU'],\n+ ['sparseilu_853', ['sparseilu', ['../classSparseILU.html', 1, 'SparseILU< number >'],\n ['../classSparseILU.html#aeb4b4012fc1d9d2e47a6a3de3adbe696', 1, 'SparseILU::SparseILU()'],\n ['../classSparsityPattern.html#a821b53e73219682e8d8efdacd3571e62', 1, 'SparsityPattern::SparseILU'],\n- ['../classSparseILU.html', 1, 'SparseILU< number >']\n+ ['../classSparseMatrix.html#a821b53e73219682e8d8efdacd3571e62', 1, 'SparseMatrix::SparseILU']\n ]],\n ['sparseludecomposition_854', ['sparseludecomposition', ['../classSparseMatrix.html#ab3b41703cc0d0eea14c99c2bac2c5149', 1, 'SparseMatrix::SparseLUDecomposition'],\n ['../classSparsityPattern.html#ab3b41703cc0d0eea14c99c2bac2c5149', 1, 'SparsityPattern::SparseLUDecomposition'],\n ['../classSparseLUDecomposition.html#a03cf23744ef3cd8739e4c9d696b7bf44', 1, 'SparseLUDecomposition::SparseLUDecomposition()'],\n ['../classSparseLUDecomposition.html', 1, 'SparseLUDecomposition< number >']\n ]],\n- ['sparsematrix_855', ['sparsematrix', ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html#acaff145e57c38a32b03f8b3fcf869abc', 1, 'PETScWrappers::MPI::SparseMatrix::SparseMatrix()'],\n- ['../classPETScWrappers_1_1SparseMatrix.html#a56ce532c27689c8f9946598a07351506', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< size_type > &row_lengths, const bool is_symmetric=false)'],\n- ['../classPETScWrappers_1_1SparseMatrix.html#a7e03b379abb85784d95e98fc788b0aa2', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const SparsityPatternType &sparsity_pattern, const bool preset_nonzero_locations=true)'],\n- ['../classPETScWrappers_1_1SparseMatrix.html#ad8f059452b7c5929c91973f9ad3741d8', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const SparseMatrix &)=delete'],\n- ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'PETScWrappers::MPI::SparseMatrix::SparseMatrix()'],\n+ ['sparsematrix_855', ['sparsematrix', ['../classPETScWrappers_1_1SparseMatrix.html#ad8f059452b7c5929c91973f9ad3741d8', 1, 'PETScWrappers::SparseMatrix::SparseMatrix()'],\n ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html#a4b5fe1f433acf6d5492e9f18dc57a758', 1, 'PETScWrappers::MPI::SparseMatrix::SparseMatrix(const Mat &)'],\n- ['../classSparseMatrix.html#a0fd7c8660c196bb350961307b29cc9da', 1, 'SparseMatrix::SparseMatrix()'],\n+ ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'PETScWrappers::MPI::SparseMatrix::SparseMatrix()'],\n+ ['../classSparsityPattern.html#ad66f15847b7c27c5898f3b859d6cfe05', 1, 'SparsityPattern::SparseMatrix'],\n+ ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html#acaff145e57c38a32b03f8b3fcf869abc', 1, 'PETScWrappers::MPI::SparseMatrix::SparseMatrix()'],\n+ ['../classSparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'SparseMatrix::SparseMatrix()'],\n+ ['../classSparseMatrix.html#ae1435ec2862610afc1b304dc52508b0f', 1, 'SparseMatrix::SparseMatrix(const SparseMatrix &)'],\n+ ['../classSparseMatrix.html#a59917a056d39a6e30a73db7d790f6a31', 1, 'SparseMatrix::SparseMatrix(SparseMatrix< number > &&m) noexcept'],\n+ ['../classPETScWrappers_1_1SparseMatrix.html#a7e03b379abb85784d95e98fc788b0aa2', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const SparsityPatternType &sparsity_pattern, const bool preset_nonzero_locations=true)'],\n+ ['../classPETScWrappers_1_1SparseMatrix.html#a56ce532c27689c8f9946598a07351506', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< size_type > &row_lengths, const bool is_symmetric=false)'],\n ['../classPETScWrappers_1_1SparseMatrix.html#abdba8e5ef1db617093c727ac293c43a4', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const size_type n_nonzero_per_row, const bool is_symmetric=false)'],\n ['../classPETScWrappers_1_1SparseMatrix.html#a4b5fe1f433acf6d5492e9f18dc57a758', 1, 'PETScWrappers::SparseMatrix::SparseMatrix(const Mat &)'],\n ['../classPETScWrappers_1_1SparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'PETScWrappers::SparseMatrix::SparseMatrix()'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#ad4410f8bbbe80bed507e104fe473e072', 1, 'CUDAWrappers::SparseMatrix::SparseMatrix(const CUDAWrappers::SparseMatrix< Number > &)=delete'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#a6b510e69e0f2b0411f7308c22870d0b4', 1, 'CUDAWrappers::SparseMatrix::SparseMatrix(CUDAWrappers::SparseMatrix< Number > &&)'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#aa992bb35b4864ac58f4cdd443414b2d5', 1, 'CUDAWrappers::SparseMatrix::SparseMatrix(Utilities::CUDA::Handle &handle, const ::SparseMatrix< Number > &sparse_matrix_host)'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#ab8d299430e60d54cc507a515bfb90b3d', 1, 'CUDAWrappers::SparseMatrix::SparseMatrix()'],\n- ['../classSparsityPattern.html#ad66f15847b7c27c5898f3b859d6cfe05', 1, 'SparsityPattern::SparseMatrix'],\n+ ['../namespaceLinearAlgebraTrilinos_1_1MPI.html#a7b1aabd2a739ed06a4d182ccb638dd0a', 1, 'LinearAlgebraTrilinos::MPI::SparseMatrix'],\n ['../classSparseMatrix.html#ad66f15847b7c27c5898f3b859d6cfe05', 1, 'SparseMatrix::SparseMatrix()'],\n ['../namespaceLinearAlgebraDealII.html#a912abe2208022aec6753876bcc72f6bf', 1, 'LinearAlgebraDealII::SparseMatrix'],\n ['../namespaceLinearAlgebraPETSc_1_1MPI.html#aad9d5a3f5f28412efdb2e8b8f31d4e6f', 1, 'LinearAlgebraPETSc::MPI::SparseMatrix'],\n- ['../namespaceLinearAlgebraTrilinos_1_1MPI.html#a7b1aabd2a739ed06a4d182ccb638dd0a', 1, 'LinearAlgebraTrilinos::MPI::SparseMatrix'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a9fde243f65eef259349c65dc5a069089', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix()'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a0b2b62a80dac30c548e1d20c3e77beae', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const SparsityPattern &InputSparsityPattern)'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a7d0c3506eddcfd2bff3c8b4658b7d493', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(SparseMatrix &&other) noexcept'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#aafc6e5a99462abbc7d9324b4824be576', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const SparseMatrix &)=delete'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#aa3a2cc48fba9c3860277d5ccd5e8e674', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const unsigned int n_max_entries_per_row=0)'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a64f9f75ac64c04e8cde36aad1ecbb90a', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a9826e4994b26da950d6925d2eed56bec', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const size_type n_max_entries_per_row=0)'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a9e975b925d1cfa91d7c6053c323d533e', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a133bab2e3e5c877571d560cd2a60bf27', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix()'],\n- ['../classSparseMatrix.html#ae1435ec2862610afc1b304dc52508b0f', 1, 'SparseMatrix::SparseMatrix()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a69b0af68877489e92b722d466baf530c', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const unsigned int n_max_entries_per_row)'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aa9bd6574182f4c480b00a7ea2ff3ac96', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< unsigned int > &n_entries_per_row)'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a34292a2bcd0bdd8cae8073581c47303b', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(SparseMatrix< Number, MemorySpace > &&other) noexcept'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a0d8afaf89eece8344d47284179cdc957', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const SparseMatrix< Number, MemorySpace > &)=delete'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aa257d97525db14d396592ad2acaa2758', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const unsigned int n_max_entries_per_row=0)'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aafb6511f06c884f7945e88cfcb8ec000', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a1979f1159e8b8d11dc899b14ed2c2ae2', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const size_type n_max_entries_per_row=0)'],\n+ ['../classSparseMatrix.html#a713953af05d18bdb920a4905fb412793', 1, 'SparseMatrix::SparseMatrix()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a99a9d03993bf67f72550d3b375b57a98', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#ab3900dae374f5a71e5134840682662d8', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix()'],\n- ['../classSparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'SparseMatrix::SparseMatrix()'],\n- ['../classSparseMatrix.html#a59917a056d39a6e30a73db7d790f6a31', 1, 'SparseMatrix::SparseMatrix(SparseMatrix< number > &&m) noexcept'],\n- ['../classSparseMatrix.html#a713953af05d18bdb920a4905fb412793', 1, 'SparseMatrix::SparseMatrix(const SparsityPattern &sparsity, const IdentityMatrix &id)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a1979f1159e8b8d11dc899b14ed2c2ae2', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const size_type n_max_entries_per_row=0)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aafb6511f06c884f7945e88cfcb8ec000', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aa257d97525db14d396592ad2acaa2758', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const unsigned int n_max_entries_per_row=0)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a0d8afaf89eece8344d47284179cdc957', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const SparseMatrix< Number, MemorySpace > &)=delete'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a34292a2bcd0bdd8cae8073581c47303b', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(SparseMatrix< Number, MemorySpace > &&other) noexcept'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#aa9bd6574182f4c480b00a7ea2ff3ac96', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< unsigned int > &n_entries_per_row)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a69b0af68877489e92b722d466baf530c', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const unsigned int n_max_entries_per_row)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a9fde243f65eef259349c65dc5a069089', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix(const SparsityPattern< MemorySpace > &sparsity_pattern)'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a133bab2e3e5c877571d560cd2a60bf27', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::SparseMatrix()'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a9e975b925d1cfa91d7c6053c323d533e', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a9826e4994b26da950d6925d2eed56bec', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &row_parallel_partitioning, const IndexSet &col_parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const size_type n_max_entries_per_row=0)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a64f9f75ac64c04e8cde36aad1ecbb90a', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator, const std::vector< unsigned int > &n_entries_per_row)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#aa3a2cc48fba9c3860277d5ccd5e8e674', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const IndexSet &parallel_partitioning, const MPI_Comm communicator=MPI_COMM_WORLD, const unsigned int n_max_entries_per_row=0)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#aafc6e5a99462abbc7d9324b4824be576', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const SparseMatrix &)=delete'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a0b2b62a80dac30c548e1d20c3e77beae', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const SparsityPattern &InputSparsityPattern)'],\n+ ['../classSparseMatrix.html#a0fd7c8660c196bb350961307b29cc9da', 1, 'SparseMatrix::SparseMatrix()'],\n ['../classCUDAWrappers_1_1SparseMatrix.html', 1, 'CUDAWrappers::SparseMatrix< Number >'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix< Number, MemorySpace >'],\n ['../classPETScWrappers_1_1MPI_1_1SparseMatrix.html', 1, 'PETScWrappers::MPI::SparseMatrix'],\n ['../classPETScWrappers_1_1SparseMatrix.html', 1, 'PETScWrappers::SparseMatrix'],\n ['../classSparseMatrix.html', 1, 'SparseMatrix< number >'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html', 1, 'TrilinosWrappers::SparseMatrix'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html#a637dbbd4e8ca9fc07a447c8f31e21647', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix()'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a944e51f3f5f0202024e04b679172ec9e', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< unsigned int > &n_entries_per_row)']\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#ab3900dae374f5a71e5134840682662d8', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const unsigned int n_max_entries_per_row)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a944e51f3f5f0202024e04b679172ec9e', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(const size_type m, const size_type n, const std::vector< unsigned int > &n_entries_per_row)'],\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a7d0c3506eddcfd2bff3c8b4658b7d493', 1, 'TrilinosWrappers::SparseMatrix::SparseMatrix(SparseMatrix &&other) noexcept']\n ]],\n ['sparsematrix_3c_20double_20_3e_856', ['SparseMatrix< double >', ['../classSparseMatrix.html', 1, '']]],\n ['sparsematrix_3c_20double_2c_20memoryspace_20_3e_857', ['SparseMatrix< double, MemorySpace >', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern.html#a92be1c0c41e397bf6a8ea409634ae4c9', 1, 'LinearAlgebra::TpetraWrappers::SparsityPattern']]],\n ['sparsematrix_3c_20number_2c_20memoryspace_20_3e_858', ['SparseMatrix< Number, MemorySpace >', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html', 1, 'LinearAlgebra::TpetraWrappers']]],\n ['sparsematrixcollection_859', ['SparseMatrixCollection', ['../classmg_1_1SparseMatrixCollection.html', 1, 'mg']]],\n ['sparsematrixez_860', ['sparsematrixez', ['../classSparseMatrixEZ.html', 1, 'SparseMatrixEZ< number >'],\n ['../classSparseMatrixEZ.html#a76707819366679c2c6ec6270a8749be0', 1, 'SparseMatrixEZ::SparseMatrixEZ()'],\n ['../classSparseMatrixEZ.html#a3d2076481d9981ceb8a9669544d229fd', 1, 'SparseMatrixEZ::SparseMatrixEZ(const SparseMatrixEZ &)'],\n ['../classSparseMatrixEZ.html#a9dbcfcbbb9879425358f04cb7c20a8e5', 1, 'SparseMatrixEZ::SparseMatrixEZ(const size_type n_rows, const size_type n_columns, const size_type default_row_length=0, const unsigned int default_increment=1)']\n ]],\n ['sparsematrixiterators_861', ['SparseMatrixIterators', ['../namespaceSparseMatrixIterators.html', 1, '']]],\n ['sparsematrixiterators_3a_3aaccessor_862', ['Accessor', ['../classSparseMatrix.html#a8834e738affcd56700ea78a3cbb7e051', 1, 'SparseMatrix']]],\n ['sparsematrixiterators_3a_3aiterator_863', ['Iterator', ['../classSparseMatrix.html#aadb72d74c6d5421b8bdf522916064359', 1, 'SparseMatrix']]],\n ['sparsematrixtools_864', ['SparseMatrixTools', ['../namespaceSparseMatrixTools.html', 1, '']]],\n- ['sparsemic_865', ['sparsemic', ['../classSparseMIC.html#ac642eec05888737dfe705447560f7214', 1, 'SparseMIC::SparseMIC()'],\n- ['../classSparseMIC.html', 1, 'SparseMIC< number >']\n+ ['sparsemic_865', ['sparsemic', ['../classSparseMIC.html', 1, 'SparseMIC< number >'],\n+ ['../classSparseMIC.html#ac642eec05888737dfe705447560f7214', 1, 'SparseMIC::SparseMIC()']\n ]],\n ['sparsevanka_866', ['sparsevanka', ['../classSparseVanka.html#ab78b48bc19c8ed47b648f49bc1dce86f', 1, 'SparseVanka::SparseVanka()'],\n ['../classSparseVanka.html#ada2d29d0432f512fcc10d2c72c8597e8', 1, 'SparseVanka::SparseVanka(const SparseMatrix< number > &M, const std::vector< bool > &selected)'],\n ['../classSparseVanka.html', 1, 'SparseVanka< number >']\n ]],\n- ['sparsity_867', ['sparsity', ['../structinternal_1_1MatrixSelector.html#aa1f73aa4d72f14778be3603131f20fde', 1, 'internal::MatrixSelector::Sparsity'],\n+ ['sparsity_867', ['sparsity', ['../structinternal_1_1MatrixSelector_3_1_1LinearAlgebra_1_1TpetraWrappers_1_1Vector_3_01Number_01_4_01_4.html#a26c7bf662a697bc2afc06cb7d65e336a', 1, 'internal::MatrixSelector<::LinearAlgebra::TpetraWrappers::Vector< Number > >::Sparsity'],\n+ ['../structinternal_1_1MatrixSelector.html#aa1f73aa4d72f14778be3603131f20fde', 1, 'internal::MatrixSelector::Sparsity'],\n+ ['../structinternal_1_1MatrixSelector_3_1_1LinearAlgebra_1_1EpetraWrappers_1_1Vector_01_4.html#a429df9b632b67c0dbc5b2bdf0db29055', 1, 'internal::MatrixSelector<::LinearAlgebra::EpetraWrappers::Vector >::Sparsity'],\n ['../structinternal_1_1MatrixSelector_3_01LinearAlgebra_1_1distributed_1_1Vector_3_01Number_01_4_01_4.html#a312ff4a52a9097d1d899c8e9732d85f6', 1, 'internal::MatrixSelector< LinearAlgebra::distributed::Vector< Number > >::Sparsity'],\n ['../structinternal_1_1MatrixSelector_3_1_1TrilinosWrappers_1_1MPI_1_1Vector_01_4.html#a5f9c0cf226163d8b6395973b721d8d84', 1, 'internal::MatrixSelector<::TrilinosWrappers::MPI::Vector >::Sparsity'],\n- ['../structinternal_1_1MatrixSelector_3_1_1LinearAlgebra_1_1TpetraWrappers_1_1Vector_3_01Number_01_4_01_4.html#a26c7bf662a697bc2afc06cb7d65e336a', 1, 'internal::MatrixSelector<::LinearAlgebra::TpetraWrappers::Vector< Number > >::Sparsity'],\n- ['../structinternal_1_1MatrixSelector_3_1_1LinearAlgebra_1_1EpetraWrappers_1_1Vector_01_4.html#a429df9b632b67c0dbc5b2bdf0db29055', 1, 'internal::MatrixSelector<::LinearAlgebra::EpetraWrappers::Vector >::Sparsity'],\n ['../structinternal_1_1MatrixSelector_3_1_1PETScWrappers_1_1MPI_1_1Vector_01_4.html#ab91a01372d15c9b094f8896e1aed1b3c', 1, 'internal::MatrixSelector<::PETScWrappers::MPI::Vector >::Sparsity'],\n ['../classmg_1_1SparseMatrixCollection.html#ad36a17fcf15847a3871012ea7eb1956f', 1, 'mg::SparseMatrixCollection::sparsity']\n ]],\n ['sparsity_20patterns_868', ['Sparsity patterns', ['../group__Sparsity.html', 1, '']]],\n ['sparsity_2eh_869', ['sparsity.h', ['../sparsity_8h.html', 1, '']]],\n ['sparsity_5fedge_870', ['sparsity_edge', ['../classmg_1_1SparseMatrixCollection.html#ae9090c5fa8f084d1feb556a1e2ec4443', 1, 'mg::SparseMatrixCollection']]],\n ['sparsity_5ffactor_871', ['sparsity_factor', ['../structUtilities_1_1MPI_1_1internal_1_1ComputeIndexOwner_1_1Dictionary.html#a9e10defc48e6cec60250d15ced541a5f', 1, 'Utilities::MPI::internal::ComputeIndexOwner::Dictionary']]],\n- ['sparsity_5fpattern_872', ['sparsity_pattern', ['../classBlockSparseMatrix.html#a9fb413a875ce50b9da3f61761d6324ce', 1, 'BlockSparseMatrix::sparsity_pattern'],\n- ['../classChunkSparsityPatternIterators_1_1Accessor.html#ab2f33f03a63ea5a39df498427d594dea', 1, 'ChunkSparsityPatternIterators::Accessor::sparsity_pattern'],\n+ ['sparsity_5fpattern_872', ['sparsity_pattern', ['../classDynamicSparsityPatternIterators_1_1Accessor.html#ad03e9248cd173882124566ccc171ab82', 1, 'DynamicSparsityPatternIterators::Accessor::sparsity_pattern'],\n ['../classChunkSparsityPattern.html#abea560a4f454ecd6dc4d44574fa74790', 1, 'ChunkSparsityPattern::sparsity_pattern'],\n- ['../classDynamicSparsityPatternIterators_1_1Accessor.html#ad03e9248cd173882124566ccc171ab82', 1, 'DynamicSparsityPatternIterators::Accessor::sparsity_pattern'],\n+ ['../classChunkSparsityPatternIterators_1_1Accessor.html#ab2f33f03a63ea5a39df498427d594dea', 1, 'ChunkSparsityPatternIterators::Accessor::sparsity_pattern'],\n+ ['../classBlockSparseMatrix.html#a9fb413a875ce50b9da3f61761d6324ce', 1, 'BlockSparseMatrix::sparsity_pattern'],\n ['../classTrilinosWrappers_1_1SparsityPatternIterators_1_1Accessor.html#ab9d386238bd7e362e39d1ee95b78ae43', 1, 'TrilinosWrappers::SparsityPatternIterators::Accessor::sparsity_pattern'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPatternIterators_1_1Accessor.html#acaa101a4435c5c95ab818705087fac8c', 1, 'LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Accessor::sparsity_pattern']\n ]],\n ['sparsity_5fpattern_2ecc_873', ['sparsity_pattern.cc', ['../sparsity__pattern_8cc.html', 1, '']]],\n ['sparsity_5fpattern_2eh_874', ['sparsity_pattern.h', ['../sparsity__pattern_8h.html', 1, '']]],\n ['sparsity_5fpattern_5fbase_2ecc_875', ['sparsity_pattern_base.cc', ['../sparsity__pattern__base_8cc.html', 1, '']]],\n ['sparsity_5fpattern_5fbase_2eh_876', ['sparsity_pattern_base.h', ['../sparsity__pattern__base_8h.html', 1, '']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,49 +1,49 @@\n var searchData = [\n- ['t_0', ['t', ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1array_3_01ValueType_00_01N_01_4_01_4.html#ac5562fff0d2edd9678195d853fba2767', 1, 'Patterns::Tools::Convert< std::array< ValueType, N > >::T'],\n- ['../classMultigrid.html#ad3e9788315cc3157c817f33ecb5fabc9', 1, 'Multigrid::t'],\n+ ['t_0', ['t', ['../classMultigrid.html#ad3e9788315cc3157c817f33ecb5fabc9', 1, 'Multigrid::t'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1array_3_01ValueType_00_01N_01_4_01_4.html#ac5562fff0d2edd9678195d853fba2767', 1, 'Patterns::Tools::Convert< std::array< ValueType, N > >::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01Tensor_3_01rank_00_01dim_00_01Number_01_4_01_4.html#a91fc87bbbcc1b378cb45c0c1206639dd', 1, 'Patterns::Tools::Convert< Tensor< rank, dim, Number > >::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01Point_3_01dim_00_01Number_01_4_01_4.html#ae4f4eb5a3bba428962260ea6b06bdd6b', 1, 'Patterns::Tools::Convert< Point< dim, Number > >::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1unique__ptr_3_01FunctionParser_3_01dim_01_4_01_4_01_4.html#a26259cb38c9262e5f1c8435c98385513', 1, 'Patterns::Tools::Convert< std::unique_ptr< FunctionParser< dim > > >::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01ComponentMask_01_4.html#a1cc5d40272d56fbd359ec8d0f1052428', 1, 'Patterns::Tools::Convert< ComponentMask >::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1complex_3_01Number_01_4_01_4.html#a2b2e9bf95f2a7923fe61af59964743bd', 1, 'Patterns::Tools::Convert< std::complex< Number > >::T'],\n+ ['../namespaceLAPACKSupport.html#a8cac1e477eff052db622c8a9a9426ea3', 1, 'LAPACKSupport::T'],\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1string_01_4.html#a56877933f3bb59d453832eb995a7c220', 1, 'Patterns::Tools::Convert< std::string >::T'],\n ['../classinternal_1_1HelperBase.html#ac770979c7838fa36e29ae5f3c04989a3', 1, 'internal::HelperBase::t'],\n ['../classSmartPointer.html#ac25ef94eebd61bc1e721ff35229657c3', 1, 'SmartPointer::t'],\n ['../classFunctions_1_1RayleighKotheVortex.html#ab9e49f8dbbc4a47064c235c396fcfcbc', 1, 'Functions::RayleighKotheVortex::T'],\n ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html#ab8647d0f1d3a177579d00c73e142d25f', 1, 'Patterns::Tools::Convert< std::tuple< Args... > >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1pair_3_01Key_00_01Value_01_4_01_4.html#a142c0f89fcf22d8e072209698c828830', 1, 'Patterns::Tools::Convert< std::pair< Key, Value > >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1string_01_4.html#a56877933f3bb59d453832eb995a7c220', 1, 'Patterns::Tools::Convert< std::string >::T'],\n- ['../namespaceLAPACKSupport.html#a8cac1e477eff052db622c8a9a9426ea3', 1, 'LAPACKSupport::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1complex_3_01Number_01_4_01_4.html#a2b2e9bf95f2a7923fe61af59964743bd', 1, 'Patterns::Tools::Convert< std::complex< Number > >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01ComponentMask_01_4.html#a1cc5d40272d56fbd359ec8d0f1052428', 1, 'Patterns::Tools::Convert< ComponentMask >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1unique__ptr_3_01FunctionParser_3_01dim_01_4_01_4_01_4.html#a26259cb38c9262e5f1c8435c98385513', 1, 'Patterns::Tools::Convert< std::unique_ptr< FunctionParser< dim > > >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01Point_3_01dim_00_01Number_01_4_01_4.html#ae4f4eb5a3bba428962260ea6b06bdd6b', 1, 'Patterns::Tools::Convert< Point< dim, Number > >::T'],\n- ['../structPatterns_1_1Tools_1_1Convert_3_01Tensor_3_01rank_00_01dim_00_01Number_01_4_01_4.html#a91fc87bbbcc1b378cb45c0c1206639dd', 1, 'Patterns::Tools::Convert< Tensor< rank, dim, Number > >::T']\n+ ['../structPatterns_1_1Tools_1_1Convert_3_01std_1_1pair_3_01Key_00_01Value_01_4_01_4.html#a142c0f89fcf22d8e072209698c828830', 1, 'Patterns::Tools::Convert< std::pair< Key, Value > >::T']\n ]],\n- ['t_5f_1', ['t_', ['../classTensorAccessors_1_1internal_1_1ReorderedIndexView.html#a9cd6a8c83307d483f90d4a0d84bdea82', 1, 'TensorAccessors::internal::ReorderedIndexView::t_'],\n+ ['t_5f_1', ['t_', ['../classTensorAccessors_1_1internal_1_1ReorderedIndexView_3_010_00_011_00_01T_01_4.html#a0f64dafbb79e7060ee54f976396aaf95', 1, 'TensorAccessors::internal::ReorderedIndexView< 0, 1, T >::t_'],\n+ ['../classTensorAccessors_1_1internal_1_1ReorderedIndexView.html#a9cd6a8c83307d483f90d4a0d84bdea82', 1, 'TensorAccessors::internal::ReorderedIndexView::t_'],\n ['../classTensorAccessors_1_1internal_1_1ReorderedIndexView_3_010_00_01rank_00_01T_01_4.html#a82f09d2991420465311443769ddfb116', 1, 'TensorAccessors::internal::ReorderedIndexView< 0, rank, T >::t_'],\n- ['../classTensorAccessors_1_1internal_1_1ReorderedIndexView_3_010_00_011_00_01T_01_4.html#a0f64dafbb79e7060ee54f976396aaf95', 1, 'TensorAccessors::internal::ReorderedIndexView< 0, 1, T >::t_'],\n ['../classTensorAccessors_1_1internal_1_1Identity.html#af6f24f588e4ea58adcb40ecbd15415c6', 1, 'TensorAccessors::internal::Identity::t_']\n ]],\n- ['table_2', ['table', ['../classTable_3_011_00_01T_01_4.html#a49e6fcb964a311b6111cbf4d99efee59', 1, 'Table< 1, T >::Table(const size_type size)'],\n- ['../classTable_3_011_00_01T_01_4.html#abcae888f084f1237143c0824399370ae', 1, 'Table< 1, T >::Table()=default'],\n- ['../classTable_3_014_00_01T_01_4.html#a578b95d257e41c19b20f803d51bba6cb', 1, 'Table< 4, T >::Table()'],\n- ['../classTable.html', 1, 'Table< N, T >'],\n- ['../classinternal_1_1TableBaseAccessors_1_1Accessor_3_01N_00_01T_00_01C_00_011_01_4.html#a11f035ed5fed6b0e018052b2bd5ba091', 1, 'internal::TableBaseAccessors::Accessor< N, T, C, 1 >::table'],\n+ ['table_2', ['table', ['../classParsedConvergenceTable.html#a23bb830083a4be3be38076739f2c975e', 1, 'ParsedConvergenceTable::table'],\n+ ['../classTable_3_017_00_01T_01_4.html#aa72564e8c6a4ca61788ba27d5886cc08', 1, 'Table< 7, T >::Table()'],\n ['../classinternal_1_1TableBaseAccessors_1_1Accessor.html#a1155c827597f511ebd489e88993695f9', 1, 'internal::TableBaseAccessors::Accessor::table'],\n- ['../classParsedConvergenceTable.html#a23bb830083a4be3be38076739f2c975e', 1, 'ParsedConvergenceTable::table'],\n- ['../classTable_3_017_00_01T_01_4.html#aa72564e8c6a4ca61788ba27d5886cc08', 1, 'Table< 7, T >::Table(const size_type size1, const size_type size2, const size_type size3, const size_type size4, const size_type size5, const size_type size6, const size_type size7)'],\n- ['../classTable_3_017_00_01T_01_4.html#a8f63627f65b80c7dcbe191b4575ff07d', 1, 'Table< 7, T >::Table()=default'],\n+ ['../classinternal_1_1TableBaseAccessors_1_1Accessor_3_01N_00_01T_00_01C_00_011_01_4.html#a11f035ed5fed6b0e018052b2bd5ba091', 1, 'internal::TableBaseAccessors::Accessor< N, T, C, 1 >::table'],\n+ ['../classTable_3_017_00_01T_01_4.html#a8f63627f65b80c7dcbe191b4575ff07d', 1, 'Table< 7, T >::Table()'],\n ['../classTable_3_016_00_01T_01_4.html#abb279a3252f7ada5d980af4dbae1605f', 1, 'Table< 6, T >::Table(const size_type size1, const size_type size2, const size_type size3, const size_type size4, const size_type size5, const size_type size6)'],\n ['../classTable_3_016_00_01T_01_4.html#a1b2c3ef04de3f988ef920948fd4983e5', 1, 'Table< 6, T >::Table()=default'],\n ['../classTable_3_015_00_01T_01_4.html#aec6c5e555a22a7b4e6b2ccf62f2716c2', 1, 'Table< 5, T >::Table(const size_type size1, const size_type size2, const size_type size3, const size_type size4, const size_type size5)'],\n ['../classTable_3_015_00_01T_01_4.html#ad22f207d96a5d96d30f32510ffaa3f07', 1, 'Table< 5, T >::Table()=default'],\n- ['../classTable_3_014_00_01T_01_4.html#af26c97a708bf69426545c5e78668ccbd', 1, 'Table< 4, T >::Table()'],\n- ['../classTable_3_013_00_01T_01_4.html#aa93414a22ab80dd3ddbafe3ad7c2f628', 1, 'Table< 3, T >::Table(const size_type size1, const size_type size2, const size_type size3, InputIterator entries, const bool C_style_indexing=true)'],\n+ ['../classTable_3_014_00_01T_01_4.html#a578b95d257e41c19b20f803d51bba6cb', 1, 'Table< 4, T >::Table(const size_type size1, const size_type size2, const size_type size3, const size_type size4)'],\n+ ['../classTable_3_014_00_01T_01_4.html#af26c97a708bf69426545c5e78668ccbd', 1, 'Table< 4, T >::Table()=default'],\n+ ['../classTable_3_013_00_01T_01_4.html#aa93414a22ab80dd3ddbafe3ad7c2f628', 1, 'Table< 3, T >::Table()'],\n+ ['../classTable.html', 1, 'Table< N, T >'],\n ['../classTable_3_013_00_01T_01_4.html#a8992de97a1c2aa0401fae950d3949f65', 1, 'Table< 3, T >::Table(const size_type size1, const size_type size2, const size_type size3)'],\n ['../classTable_3_013_00_01T_01_4.html#a67c5fbea834a46ed81e54b6a120ecf6c', 1, 'Table< 3, T >::Table()=default'],\n ['../classTable_3_012_00_01T_01_4.html#ac528e5302ff82ce126b5f1c9feb0ff1e', 1, 'Table< 2, T >::Table(const size_type size1, const size_type size2, InputIterator entries, const bool C_style_indexing=true)'],\n ['../classTable_3_012_00_01T_01_4.html#ae61c1ac86f917852931108c15dd357f7', 1, 'Table< 2, T >::Table(const size_type size1, const size_type size2)'],\n ['../classTable_3_012_00_01T_01_4.html#a5d4570e8f82d77eb4b5fabd4d05e5ec4', 1, 'Table< 2, T >::Table()=default'],\n- ['../classTable_3_011_00_01T_01_4.html#afc063fc10ce3709a44c3f007d9ca7cd2', 1, 'Table< 1, T >::Table()']\n+ ['../classTable_3_011_00_01T_01_4.html#afc063fc10ce3709a44c3f007d9ca7cd2', 1, 'Table< 1, T >::Table(const size_type size, InputIterator entries, const bool C_style_indexing=true)'],\n+ ['../classTable_3_011_00_01T_01_4.html#a49e6fcb964a311b6111cbf4d99efee59', 1, 'Table< 1, T >::Table(const size_type size)'],\n+ ['../classTable_3_011_00_01T_01_4.html#abcae888f084f1237143c0824399370ae', 1, 'Table< 1, T >::Table()=default']\n ]],\n ['table_2eh_3', ['table.h', ['../table_8h.html', 1, '']]],\n ['table_3c_201_2c_20t_20_3e_4', ['Table< 1, T >', ['../classTable_3_011_00_01T_01_4.html', 1, '']]],\n ['table_3c_202_2c_20bool_20_3e_5', ['Table< 2, bool >', ['../classTable.html', 1, '']]],\n ['table_3c_202_2c_20coefficienttype_20_3e_6', ['Table< 2, CoefficientType >', ['../classTable.html', 1, '']]],\n ['table_3c_202_2c_20derivativeform_3c_201_2c_20dim_2c_20spacedim_20_3e_20_3e_7', ['Table< 2, DerivativeForm< 1, dim, spacedim > >', ['../classTable.html', 1, '']]],\n ['table_3c_202_2c_20derivativeform_3c_202_2c_20dim_2c_20spacedim_20_3e_20_3e_8', ['Table< 2, DerivativeForm< 2, dim, spacedim > >', ['../classTable.html', 1, '']]],\n@@ -96,31 +96,31 @@\n ['table_3c_207_2c_20t_20_3e_53', ['Table< 7, T >', ['../classTable_3_017_00_01T_01_4.html', 1, '']]],\n ['table_3c_20dim_2b1_2c_20double_20_3e_54', ['Table< dim+1, double >', ['../classTable.html', 1, '']]],\n ['table_3c_20dim_2c_20double_20_3e_55', ['Table< dim, double >', ['../classTable.html', 1, '']]],\n ['table_3c_20dim_2c_20tensor_3c_201_2c_20dim_20_3e_20_3e_56', ['Table< dim, Tensor< 1, dim > >', ['../classTable.html', 1, '']]],\n ['table_5fhandler_2ecc_57', ['table_handler.cc', ['../table__handler_8cc.html', 1, '']]],\n ['table_5fhandler_2eh_58', ['table_handler.h', ['../table__handler_8h.html', 1, '']]],\n ['table_5findex_5fof_5fpoint_59', ['table_index_of_point', ['../classFunctions_1_1InterpolatedTensorProductGridData.html#a946372cea4fb863c866cbba6f95b4447', 1, 'Functions::InterpolatedTensorProductGridData']]],\n- ['table_5findex_5fview_60', ['table_index_view', ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Tensor_3_012_01_4_01_4.html#a3e58a64bc79d5f44e302c2dd94f816f9', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Tensor< 2 > >::table_index_view()'],\n+ ['table_5findex_5fview_60', ['table_index_view', ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1SymmetricTensor_3_012_01_4_01_4.html#a24fca7ba1e506dea292645265ba6326a', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::SymmetricTensor< 2 > >::table_index_view()'],\n+ ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Tensor_3_012_01_4_01_4.html#a3e58a64bc79d5f44e302c2dd94f816f9', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Tensor< 2 > >::table_index_view()'],\n ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Tensor_3_011_01_4_01_4.html#a4ae0ca8edca1ff482f82a898c921248e', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Tensor< 1 > >::table_index_view()'],\n- ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Vector_01_4.html#aebda2841a5610d1513349de6cf41eebb', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Vector >::table_index_view()'],\n- ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1SymmetricTensor_3_012_01_4_01_4.html#a24fca7ba1e506dea292645265ba6326a', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::SymmetricTensor< 2 > >::table_index_view()']\n+ ['../structDifferentiation_1_1AD_1_1internal_1_1Extractor_3_01dim_00_01FEValuesExtractors_1_1Vector_01_4.html#aebda2841a5610d1513349de6cf41eebb', 1, 'Differentiation::AD::internal::Extractor< dim, FEValuesExtractors::Vector >::table_index_view()']\n ]],\n ['table_5findices_2eh_61', ['table_indices.h', ['../table__indices_8h.html', 1, '']]],\n ['table_5fsize_62', ['table_size', ['../classTableBase.html#af33df922c5081e1b69e73027cacdaa95', 1, 'TableBase']]],\n ['table_5fwith_5fheaders_63', ['table_with_headers', ['../classTableHandler.html#a84255fd53f3c75dcbdc4706079d56d8aa3a2f08767f7c1c0c87d0ff4916696317', 1, 'TableHandler']]],\n ['table_5fwith_5fseparate_5fcolumn_5fdescription_64', ['table_with_separate_column_description', ['../classTableHandler.html#a84255fd53f3c75dcbdc4706079d56d8aabc13cea8f6e7f62b88b05bf8028f9b58', 1, 'TableHandler']]],\n- ['tablebase_65', ['tablebase', ['../classTableBase.html#af3168edb85b2dbb6f3ad5780a9c66b8e', 1, 'TableBase::TableBase(TableBase< N, T > &&src) noexcept'],\n- ['../classTableBase.html#a2b417c0141e8f8a1800830f237577112', 1, 'TableBase::TableBase'],\n- ['../classTableBase.html#aaee05c9fdcfe902905b8f366cdc9ecf8', 1, 'TableBase::TableBase()=default'],\n- ['../classTableBase.html', 1, 'TableBase< N, T >'],\n+ ['tablebase_65', ['tablebase', ['../classTableBase.html#a8b08c4ce198f3c4a697813a56db00a18', 1, 'TableBase::TableBase(const TableIndices< N > &sizes, InputIterator entries, const bool C_style_indexing=true)'],\n ['../classTableBase.html#af15af459bf3b300499ded46de0b2eec0', 1, 'TableBase::TableBase(const TableIndices< N > &sizes)'],\n- ['../classTableBase.html#a8b08c4ce198f3c4a697813a56db00a18', 1, 'TableBase::TableBase(const TableIndices< N > &sizes, InputIterator entries, const bool C_style_indexing=true)'],\n+ ['../classTableBase.html#aaee05c9fdcfe902905b8f366cdc9ecf8', 1, 'TableBase::TableBase()=default'],\n+ ['../classTableBase.html#a2b417c0141e8f8a1800830f237577112', 1, 'TableBase::TableBase'],\n ['../classTableBase.html#ab9996bc992edcbcc2d349554c6097249', 1, 'TableBase::TableBase(const TableBase< N, T > &src)'],\n- ['../classTableBase.html#a736feb31b90fcba77fd410ffe70b2622', 1, 'TableBase::TableBase(const TableBase< N, T2 > &src)']\n+ ['../classTableBase.html#af3168edb85b2dbb6f3ad5780a9c66b8e', 1, 'TableBase::TableBase(TableBase< N, T > &&src) noexcept'],\n+ ['../classTableBase.html#a736feb31b90fcba77fd410ffe70b2622', 1, 'TableBase::TableBase(const TableBase< N, T2 > &src)'],\n+ ['../classTableBase.html', 1, 'TableBase< N, T >']\n ]],\n ['tablebase_3c_201_2c_20t_20_3e_66', ['TableBase< 1, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_202_2c_20double_20_3e_67', ['TableBase< 2, double >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_202_2c_20inverse_5ftype_20_3e_68', ['TableBase< 2, inverse_type >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_202_2c_20inversenumbertype_20_3e_69', ['TableBase< 2, InverseNumberType >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_202_2c_20number_20_3e_70', ['tablebase< 2, number >', ['../classTableBase.html', 1, 'TableBase< 2, number >'],\n ['../classTableBase.html', 1, 'TableBase< 2, Number >']\n@@ -129,69 +129,69 @@\n ['tablebase_3c_202_2c_20t_20_3e_72', ['TableBase< 2, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_202_2c_20typename_20matrixtype_3a_3avalue_5ftype_20_3e_73', ['TableBase< 2, typename MatrixType::value_type >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_203_2c_20t_20_3e_74', ['TableBase< 3, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_204_2c_20t_20_3e_75', ['TableBase< 4, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_205_2c_20t_20_3e_76', ['TableBase< 5, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_206_2c_20t_20_3e_77', ['TableBase< 6, T >', ['../classTableBase.html', 1, '']]],\n ['tablebase_3c_207_2c_20t_20_3e_78', ['TableBase< 7, T >', ['../classTableBase.html', 1, '']]],\n- ['tableentry_79', ['tableentry', ['../structinternal_1_1TableEntry.html#a63e71cfe24b2b08602c6cc2af26d9d5c', 1, 'internal::TableEntry::TableEntry()'],\n- ['../structinternal_1_1TableEntry.html', 1, 'internal::TableEntry'],\n- ['../structinternal_1_1TableEntry.html#a07d7583426095596f91b1075fd40fbfd', 1, 'internal::TableEntry::TableEntry()']\n+ ['tableentry_79', ['tableentry', ['../structinternal_1_1TableEntry.html#a07d7583426095596f91b1075fd40fbfd', 1, 'internal::TableEntry::TableEntry(const T &t)'],\n+ ['../structinternal_1_1TableEntry.html#a63e71cfe24b2b08602c6cc2af26d9d5c', 1, 'internal::TableEntry::TableEntry()=default'],\n+ ['../structinternal_1_1TableEntry.html', 1, 'internal::TableEntry']\n ]],\n ['tablehandler_80', ['tablehandler', ['../classTableHandler.html#a7824771057567647419de994788c1b52', 1, 'TableHandler::TableHandler()'],\n ['../classTableHandler.html', 1, 'TableHandler']\n ]],\n- ['tableindices_81', ['tableindices', ['../classTableIndices.html#ad1c87b3ec46401c169aa6e556aec32af', 1, 'TableIndices::TableIndices()=default'],\n+ ['tableindices_81', ['tableindices', ['../classTableIndices.html', 1, 'TableIndices< N >'],\n ['../classTableIndices.html#aa3f79b8093dd48d983f84fc4d7df7b30', 1, 'TableIndices::TableIndices(const T... indices)'],\n- ['../classTableIndices.html', 1, 'TableIndices< N >']\n+ ['../classTableIndices.html#ad1c87b3ec46401c169aa6e556aec32af', 1, 'TableIndices::TableIndices()=default']\n ]],\n ['tableindices_3c_203_20_3e_82', ['TableIndices< 3 >', ['../classTableIndices.html', 1, '']]],\n ['tableindices_3c_20rank_20_3e_83', ['TableIndices< rank >', ['../classTableIndices.html', 1, '']]],\n- ['tabletype_84', ['tabletype', ['../classinternal_1_1TableBaseAccessors_1_1Accessor.html#a33e321dfbbb29608028e8a6e3ab52222', 1, 'internal::TableBaseAccessors::Accessor::TableType'],\n- ['../structinternal_1_1TableBaseAccessors_1_1Types_3_01N_00_01T_00_01true_01_4.html#a60af63c0dd763eb9f2ad3920effb09ea', 1, 'internal::TableBaseAccessors::Types< N, T, true >::TableType'],\n+ ['tabletype_84', ['tabletype', ['../classinternal_1_1TableBaseAccessors_1_1Accessor_3_01N_00_01T_00_01C_00_011_01_4.html#a47cd2aeaf192a3b1947e1255a6c8fd8e', 1, 'internal::TableBaseAccessors::Accessor< N, T, C, 1 >::TableType'],\n+ ['../classinternal_1_1TableBaseAccessors_1_1Accessor.html#a33e321dfbbb29608028e8a6e3ab52222', 1, 'internal::TableBaseAccessors::Accessor::TableType'],\n ['../structinternal_1_1TableBaseAccessors_1_1Types_3_01N_00_01T_00_01false_01_4.html#a3888f3f8c595399f6d8a86b8a0a55c51', 1, 'internal::TableBaseAccessors::Types< N, T, false >::TableType'],\n- ['../classinternal_1_1TableBaseAccessors_1_1Accessor_3_01N_00_01T_00_01C_00_011_01_4.html#a47cd2aeaf192a3b1947e1255a6c8fd8e', 1, 'internal::TableBaseAccessors::Accessor< N, T, C, 1 >::TableType']\n+ ['../structinternal_1_1TableBaseAccessors_1_1Types_3_01N_00_01T_00_01true_01_4.html#a60af63c0dd763eb9f2ad3920effb09ea', 1, 'internal::TableBaseAccessors::Types< N, T, true >::TableType']\n ]],\n- ['tadd_85', ['tadd', ['../classFullMatrix.html#a6556863808164142f559bcce1d92a09e', 1, 'FullMatrix::Tadd(const number s, const FullMatrix< number2 > &B)'],\n+ ['tadd_85', ['tadd', ['../classScaLAPACKMatrix.html#a354f71241b0d44cba4f46e8410f26fcd', 1, 'ScaLAPACKMatrix::Tadd()'],\n ['../classFullMatrix.html#ad79daca87844eec1680018f196a3df0c', 1, 'FullMatrix::Tadd(const FullMatrix< number2 > &src, const number factor, const size_type dst_offset_i=0, const size_type dst_offset_j=0, const size_type src_offset_i=0, const size_type src_offset_j=0)'],\n- ['../classScaLAPACKMatrix.html#a354f71241b0d44cba4f46e8410f26fcd', 1, 'ScaLAPACKMatrix::Tadd()']\n+ ['../classFullMatrix.html#a6556863808164142f559bcce1d92a09e', 1, 'FullMatrix::Tadd(const number s, const FullMatrix< number2 > &B)']\n ]],\n ['tag_3c_3a_3aboundingbox_3c_20dim_2c_20number_20_3e_20_3e_86', ['tag<::BoundingBox< dim, Number > >', ['../structboost_1_1geometry_1_1traits_1_1tag_3_1_1BoundingBox_3_01dim_00_01Number_01_4_01_4.html', 1, 'boost::geometry::traits']]],\n ['tag_3c_3a_3apoint_3c_20dim_2c_20number_20_3e_20_3e_87', ['tag<::Point< dim, Number > >', ['../structboost_1_1geometry_1_1traits_1_1tag_3_1_1Point_3_01dim_00_01Number_01_4_01_4.html', 1, 'boost::geometry::traits']]],\n ['take_5fmin_5fmax_5fat_5fvertices_88', ['take_min_max_at_vertices', ['../namespaceNonMatching_1_1internal_1_1QuadratureGeneratorImplementation.html#ac7720536051174721f6a9ceb5c35753b', 1, 'NonMatching::internal::QuadratureGeneratorImplementation']]],\n ['tan_89', ['tan', ['../namespaceDifferentiation_1_1SD.html#ab202ef14f4d632f420dc24507376d510', 1, 'Differentiation::SD::tan()'],\n- ['../classVectorizedArray.html#a615c2bc9aed946b4e0c526f977009195', 1, 'VectorizedArray::tan()'],\n+ ['../namespacestd.html#ac6d7c28746b422525264d03f82da5f8c', 1, 'std::tan(const ::VectorizedArray< Number, width > &x)'],\n ['../namespacestd.html#a1f062580c581c7ad325863a775755265', 1, 'std::tan(const ::VectorizedArray< Number, width > &)'],\n- ['../namespacestd.html#ac6d7c28746b422525264d03f82da5f8c', 1, 'std::tan(const ::VectorizedArray< Number, width > &x)']\n+ ['../classVectorizedArray.html#a615c2bc9aed946b4e0c526f977009195', 1, 'VectorizedArray::tan()']\n ]],\n ['tangential_90', ['tangential', ['../structinternal_1_1EvaluatorTensorProductAnisotropic.html#a80bce0c06ec5529decf7ecef7ada15c7', 1, 'internal::EvaluatorTensorProductAnisotropic']]],\n ['tangential_5fcurl_91', ['tangential_curl', ['../namespaceLocalIntegrators_1_1Maxwell.html#ad8b466d4b34a100a5a5d5578f26a611b', 1, 'LocalIntegrators::Maxwell']]],\n ['tangential_5fdegree_92', ['tangential_degree', ['../classPolynomialsRaviartThomas.html#a7237dfde0c06beeba31a1d7a3e7cc5a8', 1, 'PolynomialsRaviartThomas']]],\n ['tangential_5ftrace_5fmatrix_93', ['tangential_trace_matrix', ['../namespaceLocalIntegrators_1_1Maxwell.html#a2ef3855dd6489eef23fa59c97768a3d0', 1, 'LocalIntegrators::Maxwell']]],\n- ['tanh_94', ['tanh', ['../classVectorizedArray.html#a71ec471f55a4006be4aab3168640d414', 1, 'VectorizedArray::tanh()'],\n- ['../namespaceDifferentiation_1_1SD.html#a86151e4842702eb0b667b22122df4597', 1, 'Differentiation::SD::tanh()'],\n- ['../namespacestd.html#a696e8f42183ea673dcafebbace9b581c', 1, 'std::tanh()']\n+ ['tanh_94', ['tanh', ['../namespacestd.html#a696e8f42183ea673dcafebbace9b581c', 1, 'std::tanh()'],\n+ ['../classVectorizedArray.html#a71ec471f55a4006be4aab3168640d414', 1, 'VectorizedArray::tanh()'],\n+ ['../namespaceDifferentiation_1_1SD.html#a86151e4842702eb0b667b22122df4597', 1, 'Differentiation::SD::tanh()']\n ]],\n ['tape_5fbuffer_5fsizes_95', ['tape_buffer_sizes', ['../structDifferentiation_1_1AD_1_1Types.html#a89d0fb67e2bfb3f18a4d563f8925da5c', 1, 'Differentiation::AD::Types']]],\n ['tape_5findex_96', ['tape_index', ['../structDifferentiation_1_1AD_1_1Types.html#a6e4cd93ad087fbd28ad9e21a61d3c294', 1, 'Differentiation::AD::Types']]],\n ['taped_5fdriver_97', ['taped_driver', ['../classDifferentiation_1_1AD_1_1HelperBase.html#a114003cd9c63f8631e6d5089fc108348', 1, 'Differentiation::AD::HelperBase']]],\n ['tapeddrivers_98', ['TapedDrivers', ['../structDifferentiation_1_1AD_1_1TapedDrivers.html', 1, 'Differentiation::AD']]],\n ['tapeddrivers_3c_20ad_5ftype_2c_20scalar_5ftype_20_3e_99', ['TapedDrivers< ad_type, scalar_type >', ['../structDifferentiation_1_1AD_1_1TapedDrivers.html', 1, 'Differentiation::AD']]],\n ['tapeless_5fdriver_100', ['tapeless_driver', ['../classDifferentiation_1_1AD_1_1HelperBase.html#ac36ec008f43873763d1109fd2d8c8e72', 1, 'Differentiation::AD::HelperBase']]],\n ['tapelessdrivers_101', ['TapelessDrivers', ['../structDifferentiation_1_1AD_1_1TapelessDrivers.html', 1, 'Differentiation::AD']]],\n ['tapelessdrivers_3c_20ad_5ftype_2c_20scalar_5ftype_20_3e_102', ['TapelessDrivers< ad_type, scalar_type >', ['../structDifferentiation_1_1AD_1_1TapelessDrivers.html', 1, 'Differentiation::AD']]],\n ['tapply_5fadd_103', ['Tapply_add', ['../classMatrixFreeOperators_1_1Base.html#a8db2f257421b9d02967925ae65d31674', 1, 'MatrixFreeOperators::Base']]],\n ['target_5fcomponent_104', ['target_component', ['../classMGTransferComponentBase.html#a211e9817d9890ea89bfdc82c88cd6c49', 1, 'MGTransferComponentBase']]],\n ['target_5flevel_105', ['target_level', ['../structExtractLevelVisitor.html#abbae500137e391bd488b541f8f4f55c8', 1, 'ExtractLevelVisitor']]],\n- ['task_106', ['task', ['../classThreads_1_1TaskResult.html#a8f1fe3f4e186f4f61e51cc4c6c86e71b', 1, 'Threads::TaskResult::task'],\n+ ['task_106', ['task', ['../classThreads_1_1Task.html', 1, 'Threads::Task< RT >'],\n+ ['../classThreads_1_1TaskResult.html#a8f1fe3f4e186f4f61e51cc4c6c86e71b', 1, 'Threads::TaskResult::task'],\n ['../classThreads_1_1Task.html#af2c0813ed811a0e14ba29f0509de37e7', 1, 'Threads::Task::Task(const std::function< RT()> &function_object)'],\n ['../classThreads_1_1Task.html#abf766b2ca3533e75da9f00543dc5bc83', 1, 'Threads::Task::Task()=default'],\n ['../classThreads_1_1Task.html#ab2a22cc39a9ed9e0d3300cb45003bb47', 1, 'Threads::Task::Task(const Task &other)=default'],\n- ['../classThreads_1_1Task.html#a02949de4cd0dc671ba82704ccd2b7dc8', 1, 'Threads::Task::Task(Task &&other) noexcept=default'],\n- ['../classThreads_1_1Task.html', 1, 'Threads::Task< RT >']\n+ ['../classThreads_1_1Task.html#a02949de4cd0dc671ba82704ccd2b7dc8', 1, 'Threads::Task::Task(Task &&other) noexcept=default']\n ]],\n ['task_3c_20rt_20_3e_107', ['Task< RT >', ['../classThreads_1_1Task_1_1TaskData.html#a8fa8794184c2968647d7f7e2e403227b', 1, 'Threads::Task::TaskData']]],\n ['task_3c_20void_20_3e_108', ['Task< void >', ['../classThreads_1_1Task.html', 1, 'Threads']]],\n ['task_5fat_5fmpi_5fboundary_109', ['task_at_mpi_boundary', ['../structinternal_1_1MatrixFreeFunctions_1_1TaskInfo.html#a32bfdea8495f3d89b0a1531752425930', 1, 'internal::MatrixFreeFunctions::TaskInfo']]],\n ['task_5fdata_110', ['task_data', ['../classThreads_1_1Task.html#a53c7fa86b54fbf59b67d09810f9190d2', 1, 'Threads::Task']]],\n ['task_5fgroup_111', ['task_group', ['../classThreads_1_1Task_1_1TaskData.html#a913189023d88ab14b143f4b5f9d9d6f2', 1, 'Threads::Task::TaskData']]],\n ['task_5fhas_5ffinished_112', ['task_has_finished', ['../classThreads_1_1Task_1_1TaskData.html#a8027766d8a8ed96ceccc983674bfb5a2', 1, 'Threads::Task::TaskData']]],\n@@ -247,20 +247,20 @@\n ['../structDataOutBase_1_1TecplotFlags.html#a9c4a58168f8cf0ea255450d94d8fc44b', 1, 'DataOutBase::TecplotFlags::TecplotFlags()']\n ]],\n ['temp_5fghost_5fvector_137', ['temp_ghost_vector', ['../classRelaxationBlock_1_1AdditionalData.html#acf67785c5a9e819b695df8801a2323d1', 1, 'RelaxationBlock::AdditionalData']]],\n ['temp_5fvector1_138', ['temp_vector1', ['../classPreconditionChebyshev.html#ad5340a84d3dcb8fbb8fc03e0e7df3cc4', 1, 'PreconditionChebyshev']]],\n ['temp_5fvector2_139', ['temp_vector2', ['../classPreconditionChebyshev.html#aca88a1ace994929ee001cde4cb550cad', 1, 'PreconditionChebyshev']]],\n ['templ_5fcopy_5fconstructor_140', ['templ_copy_constructor', ['../namespaceLinearAlgebra_1_1distributed.html#a3afee21bbf6f7172d90d327ed6388f59', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR()'],\n ['../read__write__vector_8cc.html#a803d64a3875f24f8aba3e953b73bbe98', 1, 'TEMPL_COPY_CONSTRUCTOR: read_write_vector.cc'],\n- ['../namespaceLinearAlgebra_1_1distributed.html#ae1104c07c5e57891c49403f4f1aeb1ee', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR()'],\n- ['../namespaceLinearAlgebra.html#a5435c92d43d1d838286fb83edd9d4f1d', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR(std::complex< float >, std::complex< double >)'],\n- ['../namespaceLinearAlgebra.html#aa98aea9167fdf2a5533f85ee5013b6cb', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR(std::complex< double >, std::complex< float >)'],\n- ['../namespaceLinearAlgebra_1_1distributed.html#af3f65ff09b2fae0b24fd57e85198245d', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR()'],\n+ ['../namespaceLinearAlgebra_1_1distributed.html#ae1104c07c5e57891c49403f4f1aeb1ee', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR(double, float)'],\n+ ['../namespaceLinearAlgebra_1_1distributed.html#af3f65ff09b2fae0b24fd57e85198245d', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR(float, double)'],\n+ ['../namespaceLinearAlgebra.html#a5435c92d43d1d838286fb83edd9d4f1d', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR()'],\n ['../la__parallel__block__vector_8cc.html#a803d64a3875f24f8aba3e953b73bbe98', 1, 'TEMPL_COPY_CONSTRUCTOR: la_parallel_block_vector.cc'],\n ['../la__parallel__vector_8cc.html#a803d64a3875f24f8aba3e953b73bbe98', 1, 'TEMPL_COPY_CONSTRUCTOR: la_parallel_vector.cc'],\n+ ['../namespaceLinearAlgebra.html#aa98aea9167fdf2a5533f85ee5013b6cb', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR(std::complex< double >, std::complex< float >)'],\n ['../namespaceLinearAlgebra.html#a00f9596dfe4edb5a8deaaa88064dd803', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR(float, double)'],\n ['../namespaceLinearAlgebra.html#aba05a6ec670f0ee57a4efceee9fd6843', 1, 'LinearAlgebra::TEMPL_COPY_CONSTRUCTOR(double, float)'],\n ['../namespaceLinearAlgebra_1_1distributed.html#a916727e530c8e44070ae69bb0d33652f', 1, 'LinearAlgebra::distributed::TEMPL_COPY_CONSTRUCTOR()']\n ]],\n ['template_20instantiations_141', ['Template instantiations', ['../Instantiations.html', 1, '']]],\n ['template_20parameters_142', ['Concepts, or expectations on template parameters', ['../group__Concepts.html', 1, '']]],\n ['template_5fconstraints_2eh_143', ['template_constraints.h', ['../template__constraints_8h.html', 1, '']]],\n@@ -728,16 +728,16 @@\n ]],\n ['timestepping_448', ['timestepping', ['../classTimeStepping_1_1TimeStepping.html', 1, 'TimeStepping::TimeStepping< VectorType >'],\n ['../namespaceTimeStepping.html', 1, 'TimeStepping']\n ]],\n ['timestepping_5fdata_5fdual_449', ['timestepping_data_dual', ['../classTimeDependent.html#a9faffa5541ca5d3bd30961a0b7fcfaa5', 1, 'TimeDependent']]],\n ['timestepping_5fdata_5fpostprocess_450', ['timestepping_data_postprocess', ['../classTimeDependent.html#af7a70165a5a2e9b4bf9f360fc4160fc5', 1, 'TimeDependent']]],\n ['timestepping_5fdata_5fprimal_451', ['timestepping_data_primal', ['../classTimeDependent.html#a337854b0a7c9361c65520fc57e61dc99', 1, 'TimeDependent']]],\n- ['timesteppingdata_452', ['timesteppingdata', ['../structTimeDependent_1_1TimeSteppingData.html#aa846e38bf6e51787ff7faf5284f35e90', 1, 'TimeDependent::TimeSteppingData::TimeSteppingData()'],\n- ['../structTimeDependent_1_1TimeSteppingData.html', 1, 'TimeDependent::TimeSteppingData']\n+ ['timesteppingdata_452', ['timesteppingdata', ['../structTimeDependent_1_1TimeSteppingData.html', 1, 'TimeDependent::TimeSteppingData'],\n+ ['../structTimeDependent_1_1TimeSteppingData.html#aa846e38bf6e51787ff7faf5284f35e90', 1, 'TimeDependent::TimeSteppingData::TimeSteppingData()']\n ]],\n ['timesteps_453', ['timesteps', ['../classTimeDependent.html#a45bc5cb4c0dc165e66030436e86bda32', 1, 'TimeDependent']]],\n ['tmmult_454', ['tmmult', ['../classScaLAPACKMatrix.html#a546401290947b77277a5f1811bc97ea2', 1, 'ScaLAPACKMatrix::Tmmult()'],\n ['../classFullMatrix.html#a850654dea1494fffc80677d3f58142a0', 1, 'FullMatrix::Tmmult()'],\n ['../classLAPACKFullMatrix.html#a077f79ad9720e43d40a3e5281437477c', 1, 'LAPACKFullMatrix::Tmmult(LAPACKFullMatrix< number > &C, const LAPACKFullMatrix< number > &B, const bool adding=false) const'],\n ['../classLAPACKFullMatrix.html#a5ee294f214a4a993c8e810f0fd8093b2', 1, 'LAPACKFullMatrix::Tmmult(FullMatrix< number > &C, const LAPACKFullMatrix< number > &B, const bool adding=false) const'],\n ['../classLAPACKFullMatrix.html#a56fcea28944813d20b7fc8d5653bfe50', 1, 'LAPACKFullMatrix::Tmmult(LAPACKFullMatrix< number > &C, const LAPACKFullMatrix< number > &B, const Vector< number > &V, const bool adding=false) const'],\n@@ -1063,36 +1063,36 @@\n ['../classinternal_1_1CellIDTranslator.html#a2588e92b66adbedaceef0278e144d212', 1, 'internal::CellIDTranslator::translate(const TriaIterator< Accessor > &cell) const']\n ]],\n ['translation_543', ['translation', ['../namespaceCellSimilarity.html#abbf8aa4eab099bd2356cb51200494c13a4f8507015c458575753e0a45e0c3544a', 1, 'CellSimilarity']]],\n ['translator_544', ['translator', ['../structExtractLevelVisitor.html#acd660951d12d1865e86eda216480cba3', 1, 'ExtractLevelVisitor']]],\n ['transparent_545', ['transparent', ['../structGridOutFlags_1_1Svg.html#acd2da6d580f03e1c38c9a11bd4c554b1ad8c8e8c680a9e6f75cff1e427895f3d0', 1, 'GridOutFlags::Svg']]],\n ['transpose_546', ['transpose', ['../symmetric__tensor_8h.html#a04dfad55543d8599c933dfe2c98731f7', 1, 'transpose(const SymmetricTensor< rank_, dim, Number > &t): symmetric_tensor.h'],\n ['../derivative__form_8h.html#a3c201452e8dd28e4f5be4a316cb9305f', 1, 'transpose(const DerivativeForm< 1, dim, spacedim, Number > &DF): derivative_form.h'],\n- ['../classPETScWrappers_1_1MatrixBase.html#aacd76b6ce3247735964836a82eedff6d', 1, 'PETScWrappers::MatrixBase::transpose()'],\n+ ['../classTrilinosWrappers_1_1PreconditionBase.html#a85c5de5d6c5963170bc1104e106ec317', 1, 'TrilinosWrappers::PreconditionBase::transpose()'],\n+ ['../classSymmetricTensor.html#a04dfad55543d8599c933dfe2c98731f7', 1, 'SymmetricTensor::transpose()'],\n ['../classMGSmoother.html#a317cde3d39504f1d72d78671a42f9b15', 1, 'MGSmoother::transpose'],\n ['../classDerivativeForm.html#a50c6d530478916a13721a5d03b64671f', 1, 'DerivativeForm::transpose()'],\n ['../classLAPACKFullMatrix.html#a138200940285ad81d97be9a38b5df595', 1, 'LAPACKFullMatrix::transpose()'],\n- ['../classTrilinosWrappers_1_1PreconditionBase.html#a85c5de5d6c5963170bc1104e106ec317', 1, 'TrilinosWrappers::PreconditionBase::transpose()'],\n+ ['../classPETScWrappers_1_1MatrixBase.html#aacd76b6ce3247735964836a82eedff6d', 1, 'PETScWrappers::MatrixBase::transpose()'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html#a1a7a578fb46241991114a6ffa99cd3fe', 1, 'TrilinosWrappers::SparseMatrix::transpose()'],\n ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#ad2aef26123dc346023bc80c2d47e9f2a', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::transpose()'],\n- ['../classDerivativeForm.html#a3c201452e8dd28e4f5be4a316cb9305f', 1, 'DerivativeForm::transpose()'],\n- ['../classSymmetricTensor.html#a04dfad55543d8599c933dfe2c98731f7', 1, 'SymmetricTensor::transpose()']\n+ ['../classDerivativeForm.html#a3c201452e8dd28e4f5be4a316cb9305f', 1, 'DerivativeForm::transpose()']\n ]],\n ['transpose_5fface_547', ['transpose_face', ['../classinternal_1_1MatrixFreeFunctions_1_1HangingNodes.html#a193617c5866de2768fb0eddd8a62eb24', 1, 'internal::MatrixFreeFunctions::HangingNodes']]],\n ['transpose_5fmode_548', ['transpose_mode', ['../structLinearAlgebra_1_1TpetraWrappers_1_1SolverDirectKLU2_1_1AdditionalData.html#aec2050ba26d1a7478d1d6c640e846fde', 1, 'LinearAlgebra::TpetraWrappers::SolverDirectKLU2::AdditionalData']]],\n ['transpose_5foperator_549', ['transpose_operator', ['../group__LAOperators.html#ga6bdc65fb2db56230e6bc7d545e81295d', 1, 'transpose_operator(): linear_operator.h'],\n ['../group__LAOperators.html#ga6bdc65fb2db56230e6bc7d545e81295d', 1, 'LinearOperator::transpose_operator()']\n ]],\n ['transpose_5fpayload_550', ['transpose_payload', ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a2080b5d29c2f775b2f98e80b98857370', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::transpose_payload()'],\n ['../classinternal_1_1LinearOperatorImplementation_1_1EmptyPayload.html#a6e6069a31a7e683cf42b652472de91f5', 1, 'internal::LinearOperatorImplementation::EmptyPayload::transpose_payload()']\n ]],\n ['transpose_5fsubface_5findex_551', ['transpose_subface_index', ['../classinternal_1_1MatrixFreeFunctions_1_1HangingNodes.html#a4f4418ed486e4d55cf1391f4b1473710', 1, 'internal::MatrixFreeFunctions::HangingNodes']]],\n- ['transposetable_552', ['transposetable', ['../classTransposeTable.html#a34dcef68fd1537d1d4fca5f1b295d005', 1, 'TransposeTable::TransposeTable(const size_type size1, const size_type size2)'],\n+ ['transposetable_552', ['transposetable', ['../classTransposeTable.html', 1, 'TransposeTable< T >'],\n ['../classTransposeTable.html#a50216eb585941653b66c6b62157ef813', 1, 'TransposeTable::TransposeTable()=default'],\n- ['../classTransposeTable.html', 1, 'TransposeTable< T >']\n+ ['../classTransposeTable.html#a34dcef68fd1537d1d4fca5f1b295d005', 1, 'TransposeTable::TransposeTable(const size_type size1, const size_type size2)']\n ]],\n ['transposetable_3c_20double_20_3e_553', ['TransposeTable< double >', ['../classTransposeTable.html', 1, '']]],\n ['transposetable_3c_20inverse_5ftype_20_3e_554', ['TransposeTable< inverse_type >', ['../classTransposeTable.html', 1, '']]],\n ['transposetable_3c_20inversenumbertype_20_3e_555', ['TransposeTable< InverseNumberType >', ['../classTransposeTable.html', 1, '']]],\n ['transposetable_3c_20number_20_3e_556', ['transposetable< number >', ['../classTransposeTable.html', 1, 'TransposeTable< number >'],\n ['../classTransposeTable.html', 1, 'TransposeTable< Number >']\n ]],\n@@ -1105,30 +1105,30 @@\n ['../lapack__templates_8h.html#a5d6569acbac9edf043e62c056100c855', 1, 'trcon(const char *, const char *, const char *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, number2 *, number3 *, ::types::blas_int *, ::types::blas_int *): lapack_templates.h']\n ]],\n ['tree_560', ['tree', ['../structinternal_1_1p4est_1_1types_3_012_01_4.html#a65e8e6a09fec97c67501abcd3ff3f075', 1, 'internal::p4est::types< 2 >::tree'],\n ['../structinternal_1_1p4est_1_1types_3_013_01_4.html#a9d6990d5cd5b55923ec40978a51bae4d', 1, 'internal::p4est::types< 3 >::tree']\n ]],\n ['tree_5fexists_5flocally_561', ['tree_exists_locally', ['../namespaceinternal_1_1p4est.html#ae4042b8fee3749ad4567600e2fc90f95', 1, 'internal::p4est']]],\n ['tree_5fsizes_562', ['tree_sizes', ['../classinternal_1_1CellIDTranslator.html#a66ec800bda4b84994972e4ce148a8d86', 1, 'internal::CellIDTranslator']]],\n- ['tria_563', ['tria', ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a7865b873e19ac47af4215a67d370d8d8', 1, 'TriaAccessor< 0, dim, spacedim >::tria'],\n+ ['tria_563', ['tria', ['../classGridTools_1_1Cache.html#a0f5145b5b27a5994dc55e128f855fb7d', 1, 'GridTools::Cache::tria'],\n ['../classTimeStepBase__Tria.html#ad204413ada6420a34cadbe04bdae3442', 1, 'TimeStepBase_Tria::tria'],\n ['../classFERemoteEvaluation.html#a107b513a4e796e02f40344bf31fb7cf2', 1, 'FERemoteEvaluation::tria'],\n ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#afb5e5a50da409fc3544a0d6ec008a429', 1, 'TriaAccessor< 0, 1, spacedim >::tria'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a7865b873e19ac47af4215a67d370d8d8', 1, 'TriaAccessor< 0, dim, spacedim >::tria'],\n ['../classTriaAccessorBase.html#af02486bbb2ee4b94d1b51f03ba47257f', 1, 'TriaAccessorBase::tria'],\n- ['../classGridTools_1_1Cache.html#a0f5145b5b27a5994dc55e128f855fb7d', 1, 'GridTools::Cache::tria'],\n- ['../classDoFHandler.html#a2a7806b667817e6dbf55ceda2c6cde62', 1, 'DoFHandler::tria'],\n+ ['../classGridIn.html#a041d7c6e7f98b51f33090a8c96367ce3', 1, 'GridIn::tria'],\n ['../classCellDataStorage.html#ac873b002e5bf1ff64e3478e6eb91f624', 1, 'CellDataStorage::tria'],\n ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#ae602ad6b373f25eb7e2c43320aaa0611', 1, 'Utilities::MPI::RemotePointEvaluation::tria'],\n- ['../classGridIn.html#a041d7c6e7f98b51f33090a8c96367ce3', 1, 'GridIn::tria']\n+ ['../classDoFHandler.html#a2a7806b667817e6dbf55ceda2c6cde62', 1, 'DoFHandler::tria']\n ]],\n- ['tria_2ecc_564', ['tria.cc', ['../grid_2tria_8cc.html', 1, '(Global Namespace)'],\n- ['../distributed_2tria_8cc.html', 1, '(Global Namespace)']\n+ ['tria_2ecc_564', ['tria.cc', ['../distributed_2tria_8cc.html', 1, '(Global Namespace)'],\n+ ['../grid_2tria_8cc.html', 1, '(Global Namespace)']\n ]],\n- ['tria_2eh_565', ['tria.h', ['../grid_2tria_8h.html', 1, '(Global Namespace)'],\n- ['../distributed_2tria_8h.html', 1, '(Global Namespace)']\n+ ['tria_2eh_565', ['tria.h', ['../distributed_2tria_8h.html', 1, '(Global Namespace)'],\n+ ['../grid_2tria_8h.html', 1, '(Global Namespace)']\n ]],\n ['tria_5faccessor_2ecc_566', ['tria_accessor.cc', ['../tria__accessor_8cc.html', 1, '']]],\n ['tria_5faccessor_2eh_567', ['tria_accessor.h', ['../tria__accessor_8h.html', 1, '']]],\n ['tria_5fattached_5fdata_5findex_568', ['tria_attached_data_index', ['../classParticles_1_1ParticleHandler.html#a0dcbe0661a9f20e6ec5ce31c621bd7f1', 1, 'Particles::ParticleHandler']]],\n ['tria_5fbase_2ecc_569', ['tria_base.cc', ['../tria__base_8cc.html', 1, '']]],\n ['tria_5fbase_2eh_570', ['tria_base.h', ['../tria__base_8h.html', 1, '']]],\n ['tria_5fchange_5flistener_571', ['tria_change_listener', ['../classPointValueHistory.html#ae0be238effe81ad3ba1d208e7b4a296c', 1, 'PointValueHistory']]],\n@@ -1142,109 +1142,109 @@\n ['tria_5fiterator_5fbase_2eh_579', ['tria_iterator_base.h', ['../tria__iterator__base_8h.html', 1, '']]],\n ['tria_5fiterator_5fselector_2eh_580', ['tria_iterator_selector.h', ['../tria__iterator__selector_8h.html', 1, '']]],\n ['tria_5flevels_2ecc_581', ['tria_levels.cc', ['../tria__levels_8cc.html', 1, '']]],\n ['tria_5flevels_2eh_582', ['tria_levels.h', ['../tria__levels_8h.html', 1, '']]],\n ['tria_5flistener_583', ['tria_listener', ['../classPointValueHistory.html#a0973b92f7a50cb794a864b6754c0e3bd', 1, 'PointValueHistory']]],\n ['tria_5flistener_5fmesh_5ftransform_584', ['tria_listener_mesh_transform', ['../classFEValuesBase.html#a2f853782c9ba1f6c4093f64ede145253', 1, 'FEValuesBase']]],\n ['tria_5flistener_5frefinement_585', ['tria_listener_refinement', ['../classFEValuesBase.html#aa7274f2ea9bbe0ea61bd983c5746ffef', 1, 'FEValuesBase']]],\n- ['tria_5flisteners_586', ['tria_listeners', ['../classParticles_1_1ParticleHandler.html#adfacbe32357e12bc77bc2dec277fbffc', 1, 'Particles::ParticleHandler::tria_listeners'],\n- ['../classDoFHandler.html#a69d18cd831e20abfe981209f36d9ca13', 1, 'DoFHandler::tria_listeners']\n+ ['tria_5flisteners_586', ['tria_listeners', ['../classDoFHandler.html#a69d18cd831e20abfe981209f36d9ca13', 1, 'DoFHandler::tria_listeners'],\n+ ['../classParticles_1_1ParticleHandler.html#adfacbe32357e12bc77bc2dec277fbffc', 1, 'Particles::ParticleHandler::tria_listeners']\n ]],\n ['tria_5flisteners_5ffor_5ftransfer_587', ['tria_listeners_for_transfer', ['../classDoFHandler.html#a4288a5d2a60c264ede590a0d00dc19fd', 1, 'DoFHandler']]],\n ['tria_5fobjects_2ecc_588', ['tria_objects.cc', ['../tria__objects_8cc.html', 1, '']]],\n ['tria_5fobjects_2eh_589', ['tria_objects.h', ['../tria__objects_8h.html', 1, '']]],\n ['tria_5fobjects_5forientations_2eh_590', ['tria_objects_orientations.h', ['../tria__objects__orientations_8h.html', 1, '']]],\n ['tria_5forientation_2eh_591', ['tria_orientation.h', ['../tria__orientation_8h.html', 1, '']]],\n ['tria_5fsignal_592', ['tria_signal', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#a3fe6a8aba339dcb57079fe2cf66021ef', 1, 'Utilities::MPI::RemotePointEvaluation']]],\n- ['triaaccessor_593', ['triaaccessor', ['../classTriaAccessor.html#adcbbfa481886d095df724cef84d92286', 1, 'TriaAccessor::TriaAccessor(const Triangulation< dim, spacedim > *parent=nullptr, const int level=-1, const int index=-1, const AccessorData *local_data=nullptr)'],\n+ ['triaaccessor_593', ['triaaccessor', ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a96a6f03f19d53f4efd9a22fa70e1c3b9', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const Triangulation< dim, spacedim > *tria=nullptr, const int level=0, const int index=0, const AccessorData *=nullptr)'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a0326fcd9f2fae9f175973f68b3a58e53', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const Triangulation< dim, spacedim > *tria, const unsigned int vertex_index)'],\n+ ['../classTriaAccessor.html#a397500f10867aa69f4a731cc9ab2de53', 1, 'TriaAccessor::TriaAccessor(const TriaAccessor< structdim2, dim2, spacedim2 > &)'],\n+ ['../classTriaAccessor.html#aeaf81fa90cc1506bbdf6a54fb0626985', 1, 'TriaAccessor::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)'],\n+ ['../classTriangulation.html#a43c0730c894c987ae4e06de5f80bae12', 1, 'Triangulation::TriaAccessor'],\n+ ['../classTriaAccessor.html#adcbbfa481886d095df724cef84d92286', 1, 'TriaAccessor::TriaAccessor(const Triangulation< dim, spacedim > *parent=nullptr, const int level=-1, const int index=-1, const AccessorData *local_data=nullptr)'],\n ['../classTriaAccessor.html#a6ff27529711a78693b3912ce592c25df', 1, 'TriaAccessor::TriaAccessor(const TriaAccessor &)=default'],\n+ ['../classTriaAccessor.html#a14ff7adf27cb0ce877196474c858ddcf', 1, 'TriaAccessor::TriaAccessor(TriaAccessor &&)=default'],\n ['../classTriaAccessor.html', 1, 'TriaAccessor< structdim, dim, spacedim >'],\n- ['../classTriaAccessor.html#a14ff7adf27cb0ce877196474c858ddcf', 1, 'TriaAccessor::TriaAccessor()'],\n- ['../classTriangulation.html#a43c0730c894c987ae4e06de5f80bae12', 1, 'Triangulation::TriaAccessor'],\n- ['../classTriaAccessor.html#aeaf81fa90cc1506bbdf6a54fb0626985', 1, 'TriaAccessor::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)'],\n- ['../classTriaAccessor.html#a397500f10867aa69f4a731cc9ab2de53', 1, 'TriaAccessor::TriaAccessor(const TriaAccessor< structdim2, dim2, spacedim2 > &)'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a0326fcd9f2fae9f175973f68b3a58e53', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const Triangulation< dim, spacedim > *tria, const unsigned int vertex_index)'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a96a6f03f19d53f4efd9a22fa70e1c3b9', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const Triangulation< dim, spacedim > *tria=nullptr, const int level=0, const int index=0, const AccessorData *=nullptr)'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#ad85738c0e922f5fe2c441309f49b943a', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const TriaAccessor< structdim2, dim2, spacedim2 > &)'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a4ba7deefb228f9e8cabbd5836d7b834b', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)'],\n- ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a55a1395beb9eb0a096d7b5cfafac5091', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const Triangulation< 1, spacedim > *tria, const VertexKind vertex_kind, const unsigned int vertex_index)'],\n- ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a6b631a7eabd1dc1954e67c840ed0fca5', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const Triangulation< 1, spacedim > *tria=nullptr, const int=0, const int=0, const AccessorData *=nullptr)'],\n+ ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a4fb728aec52b5766d2c0d821f6c36a0d', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)'],\n ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#acabe8763d32267aedd8a47df53f26ffc', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const TriaAccessor< structdim2, dim2, spacedim2 > &)'],\n- ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a4fb728aec52b5766d2c0d821f6c36a0d', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)']\n+ ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a6b631a7eabd1dc1954e67c840ed0fca5', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const Triangulation< 1, spacedim > *tria=nullptr, const int=0, const int=0, const AccessorData *=nullptr)'],\n+ ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html#a55a1395beb9eb0a096d7b5cfafac5091', 1, 'TriaAccessor< 0, 1, spacedim >::TriaAccessor(const Triangulation< 1, spacedim > *tria, const VertexKind vertex_kind, const unsigned int vertex_index)'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a4ba7deefb228f9e8cabbd5836d7b834b', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const InvalidAccessor< structdim2, dim2, spacedim2 > &)'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#ad85738c0e922f5fe2c441309f49b943a', 1, 'TriaAccessor< 0, dim, spacedim >::TriaAccessor(const TriaAccessor< structdim2, dim2, spacedim2 > &)']\n ]],\n- ['triaaccessor_3c_200_2c_201_2c_20spacedim_20_3e_594', ['triaaccessor< 0, 1, spacedim >', ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html', 1, 'TriaAccessor< 0, 1, spacedim >'],\n- ['../classTriangulation.html#a97f9b1157ed4068cc2ff016ceb0050fb', 1, 'Triangulation::TriaAccessor< 0, 1, spacedim >']\n+ ['triaaccessor_3c_200_2c_201_2c_20spacedim_20_3e_594', ['triaaccessor< 0, 1, spacedim >', ['../classTriangulation.html#a97f9b1157ed4068cc2ff016ceb0050fb', 1, 'Triangulation::TriaAccessor< 0, 1, spacedim >'],\n+ ['../classTriaAccessor_3_010_00_011_00_01spacedim_01_4.html', 1, 'TriaAccessor< 0, 1, spacedim >']\n ]],\n ['triaaccessor_3c_200_2c_20dim_2c_20spacedim_20_3e_595', ['TriaAccessor< 0, dim, spacedim >', ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html', 1, '']]],\n ['triaaccessor_3c_20dim_2c_20dim_2c_20dim_20_3e_596', ['TriaAccessor< dim, dim, dim >', ['../classTriaAccessor.html', 1, '']]],\n- ['triaaccessorbase_597', ['triaaccessorbase', ['../classTriaAccessorBase.html#a3fcd7ae82e0aa33d326dc65bf45d36f8', 1, 'TriaAccessorBase::TriaAccessorBase(const Triangulation< dim, spacedim > *parent=nullptr, const int level=-1, const int index=-1, const AccessorData *=nullptr)'],\n- ['../classTriaAccessorBase.html#a29f2c7a72b6e0e7e36b9cff8533465ef', 1, 'TriaAccessorBase::TriaAccessorBase(const TriaAccessorBase &)'],\n+ ['triaaccessorbase_597', ['triaaccessorbase', ['../classTriaAccessorBase.html#a29f2c7a72b6e0e7e36b9cff8533465ef', 1, 'TriaAccessorBase::TriaAccessorBase()'],\n ['../classTriangulation.html#a78484ccbc5d665a7ffc679fe62cecd7d', 1, 'Triangulation::TriaAccessorBase'],\n+ ['../classTriaAccessorBase.html#a3fcd7ae82e0aa33d326dc65bf45d36f8', 1, 'TriaAccessorBase::TriaAccessorBase()'],\n ['../classTriaAccessorBase.html', 1, 'TriaAccessorBase< structdim, dim, spacedim >']\n ]],\n ['triaaccessorbase_3c_20structdim_2c_20dim_2c_20spacedim_20_3e_598', ['TriaAccessorBase< structdim, dim, spacedim >', ['../classTriaAccessorBase.html', 1, '']]],\n ['triaaccessorexceptions_599', ['TriaAccessorExceptions', ['../namespaceTriaAccessorExceptions.html', 1, '']]],\n- ['triaactiveiterator_600', ['triaactiveiterator', ['../classTriaActiveIterator.html#a14b97e1864b084dfbc03acedf3785a26', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaActiveIterator< Accessor > &)'],\n- ['../classTriaActiveIterator.html#a93993a69ca4b4b7d0c7e312c19d6c802', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaAccessorBase< Accessor::structure_dimension, Accessor::dimension, Accessor::space_dimension > &tria_accessor, const typename Accessor::AccessorData *local_data)'],\n- ['../classTriaActiveIterator.html#abbdad300e5a45916d86437f6449d0618', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaActiveIterator< OtherAccessor > &i)'],\n- ['../classTriaActiveIterator.html#a999c78e642dec06e4f0ea8886524feb4', 1, 'TriaActiveIterator::TriaActiveIterator(const Triangulation< Accessor::dimension, Accessor::space_dimension > *parent, const int level, const int index, const typename Accessor::AccessorData *local_data=nullptr)'],\n- ['../classTriaActiveIterator.html#af50b84329e0f45f5eae19694332366a0', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaIterator< Accessor > &)'],\n- ['../classTriaActiveIterator.html#a260c93b2a5a09fe7a1fe4451228801e6', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaRawIterator< Accessor > &)'],\n- ['../classTriaActiveIterator.html#a9a9608f317a5beeebd9940192b866cf2', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaRawIterator< OtherAccessor > &i)'],\n- ['../classTriaActiveIterator.html', 1, 'TriaActiveIterator< Accessor >'],\n- ['../classTriaActiveIterator.html#adb7a3279d22467ba18475474fe816a2d', 1, 'TriaActiveIterator::TriaActiveIterator()'],\n+ ['triaactiveiterator_600', ['triaactiveiterator', ['../classTriaActiveIterator.html#a9a9608f317a5beeebd9940192b866cf2', 1, 'TriaActiveIterator::TriaActiveIterator()'],\n ['../classTriaRawIterator.html#a447f70b258e8135c365834a7f4415670', 1, 'TriaRawIterator::TriaActiveIterator'],\n+ ['../classTriaAccessorBase.html#a447f70b258e8135c365834a7f4415670', 1, 'TriaAccessorBase::TriaActiveIterator'],\n ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a447f70b258e8135c365834a7f4415670', 1, 'TriaAccessor< 0, dim, spacedim >::TriaActiveIterator'],\n- ['../classTriaAccessorBase.html#a447f70b258e8135c365834a7f4415670', 1, 'TriaAccessorBase::TriaActiveIterator']\n+ ['../classTriaActiveIterator.html#a14b97e1864b084dfbc03acedf3785a26', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaActiveIterator< Accessor > &)'],\n+ ['../classTriaActiveIterator.html#adb7a3279d22467ba18475474fe816a2d', 1, 'TriaActiveIterator::TriaActiveIterator()'],\n+ ['../classTriaActiveIterator.html#a260c93b2a5a09fe7a1fe4451228801e6', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaRawIterator< Accessor > &)'],\n+ ['../classTriaActiveIterator.html#af50b84329e0f45f5eae19694332366a0', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaIterator< Accessor > &)'],\n+ ['../classTriaActiveIterator.html#a999c78e642dec06e4f0ea8886524feb4', 1, 'TriaActiveIterator::TriaActiveIterator(const Triangulation< Accessor::dimension, Accessor::space_dimension > *parent, const int level, const int index, const typename Accessor::AccessorData *local_data=nullptr)'],\n+ ['../classTriaActiveIterator.html#abbdad300e5a45916d86437f6449d0618', 1, 'TriaActiveIterator::TriaActiveIterator(const TriaActiveIterator< OtherAccessor > &i)'],\n+ ['../classTriaActiveIterator.html', 1, 'TriaActiveIterator< Accessor >'],\n+ ['../classTriaActiveIterator.html#a93993a69ca4b4b7d0c7e312c19d6c802', 1, 'TriaActiveIterator::TriaActiveIterator()']\n ]],\n ['triafaces_601', ['triafaces', ['../classinternal_1_1TriangulationImplementation_1_1TriaFaces.html#a142f3e4ba1e3d746f209084eed891288', 1, 'internal::TriangulationImplementation::TriaFaces::TriaFaces()=default'],\n ['../classinternal_1_1TriangulationImplementation_1_1TriaFaces.html#af4de919ece460e5b1f72f9dc50de679a', 1, 'internal::TriangulationImplementation::TriaFaces::TriaFaces(const unsigned int dim)'],\n ['../classinternal_1_1TriangulationImplementation_1_1TriaFaces.html', 1, 'internal::TriangulationImplementation::TriaFaces']\n ]],\n- ['triaiterator_602', ['triaiterator', ['../classTriaIterator.html#a80e1edf7dcf7cf06398827c7688a2e4a', 1, 'TriaIterator::TriaIterator()'],\n+ ['triaiterator_602', ['triaiterator', ['../classTriaIterator.html#a051c6a39b9d5e779b0ffb0ef8a88a811', 1, 'TriaIterator::TriaIterator()'],\n ['../classTriaAccessorBase.html#a2c937d2d69cd157e5b4d5d61e0cbdd90', 1, 'TriaAccessorBase::TriaIterator'],\n ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a2c937d2d69cd157e5b4d5d61e0cbdd90', 1, 'TriaAccessor< 0, dim, spacedim >::TriaIterator'],\n ['../classTriaRawIterator.html#a2c937d2d69cd157e5b4d5d61e0cbdd90', 1, 'TriaRawIterator::TriaIterator'],\n ['../classTriaIterator.html#acef5c1c5b85fd3a207cdac7eff8f0beb', 1, 'TriaIterator::TriaIterator()'],\n+ ['../classTriaIterator.html#a562147d2404188a2b4d792e3efae7332', 1, 'TriaIterator::TriaIterator(const OtherAccessor &a)'],\n ['../classTriaIterator.html#af67f933885ce9f47c180269fdb672e19', 1, 'TriaIterator::TriaIterator(const TriaRawIterator< Accessor > &)'],\n- ['../classTriaIterator.html#a051c6a39b9d5e779b0ffb0ef8a88a811', 1, 'TriaIterator::TriaIterator(const TriaIterator< Accessor > &)'],\n- ['../classTriaIterator.html', 1, 'TriaIterator< Accessor >'],\n ['../classTriaIterator.html#ac9c554dd4781aa2538f9ca798382f589', 1, 'TriaIterator::TriaIterator(const Triangulation< Accessor::dimension, Accessor::space_dimension > *parent, const int level, const int index, const typename Accessor::AccessorData *local_data=nullptr)'],\n- ['../classTriaIterator.html#a562147d2404188a2b4d792e3efae7332', 1, 'TriaIterator::TriaIterator(const OtherAccessor &a)'],\n+ ['../classTriaIterator.html', 1, 'TriaIterator< Accessor >'],\n ['../classTriaIterator.html#a3f5bf64b8dc93fff59b2c95e2026bdee', 1, 'TriaIterator::TriaIterator(const TriaIterator< OtherAccessor > &i)'],\n ['../classTriaIterator.html#a992a1e2037d7c984aae20f869ca8d7d6', 1, 'TriaIterator::TriaIterator(const TriaAccessorBase< Accessor::structure_dimension, Accessor::dimension, Accessor::space_dimension > &tria_accessor, const typename Accessor::AccessorData *local_data)'],\n- ['../classTriaIterator.html#a3ea48b1e446606404a6e44a18e59a575', 1, 'TriaIterator::TriaIterator(const TriaRawIterator< OtherAccessor > &i)']\n+ ['../classTriaIterator.html#a3ea48b1e446606404a6e44a18e59a575', 1, 'TriaIterator::TriaIterator(const TriaRawIterator< OtherAccessor > &i)'],\n+ ['../classTriaIterator.html#a80e1edf7dcf7cf06398827c7688a2e4a', 1, 'TriaIterator::TriaIterator(const TriaActiveIterator< OtherAccessor > &i)']\n ]],\n ['trialevel_603', ['trialevel', ['../classinternal_1_1TriangulationImplementation_1_1TriaLevel.html', 1, 'internal::TriangulationImplementation::TriaLevel'],\n ['../classinternal_1_1TriangulationImplementation_1_1TriaLevel.html#ab220b7fdf0dbc6b19399b4ebd4e2b445', 1, 'internal::TriangulationImplementation::TriaLevel::TriaLevel()'],\n ['../classinternal_1_1TriangulationImplementation_1_1TriaLevel.html#aaf781ca18e4ad88ecf8c59340e253fac', 1, 'internal::TriangulationImplementation::TriaLevel::TriaLevel(const unsigned int dim)']\n ]],\n ['triangle_604', ['Triangle', ['../namespaceReferenceCells.html#a3ab331cfe2d03f3c89c0738624a11344', 1, 'ReferenceCells']]],\n ['triangle_5fvertex_5fpermutations_605', ['triangle_vertex_permutations', ['../classReferenceCell.html#af9ffe95e08f8bccff95d48f97fcbfd2b', 1, 'ReferenceCell']]],\n ['triangular_5fmatrix_606', ['triangular_matrix', ['../classinternal_1_1SolverGMRESImplementation_1_1ArnoldiProcess.html#ac94bd731c7fe707a1f2e8c2649760d98', 1, 'internal::SolverGMRESImplementation::ArnoldiProcess']]],\n- ['triangulation_607', ['triangulation', ['../classparallel_1_1distributed_1_1Triangulation.html', 1, 'parallel::distributed::Triangulation< dim, spacedim >'],\n+ ['triangulation_607', ['triangulation', ['../classparallel_1_1shared_1_1Triangulation.html', 1, 'parallel::shared::Triangulation< dim, spacedim >'],\n ['../classparallel_1_1distributed_1_1CellDataTransfer.html#a4e7a730ef7a17f3e97a8fd8929132bf9', 1, 'parallel::distributed::CellDataTransfer::triangulation'],\n- ['../classCellDataTransfer.html#a02b307c95b372e13851a759fc11e0818', 1, 'CellDataTransfer::triangulation'],\n ['../classDataOut__DoFData.html#ab87e6a1ac30aee2b4a134aeca8b38253', 1, 'DataOut_DoFData::triangulation'],\n ['../classParticles_1_1ParticleHandler.html#ad1469d144554b97c1923b89b41ed9861', 1, 'Particles::ParticleHandler::triangulation'],\n ['../classparallel_1_1fullydistributed_1_1Triangulation.html#a2505a4dbdb2fbf92ddc91fde642acaf7', 1, 'parallel::fullydistributed::Triangulation::Triangulation()'],\n ['../classparallel_1_1shared_1_1Triangulation.html#ad7b6488ccba51e892e4788eee907cd8a', 1, 'parallel::shared::Triangulation::Triangulation()'],\n ['../classparallel_1_1distributed_1_1Triangulation.html#ac8ad1ee3094dda503162fdabdba41840', 1, 'parallel::distributed::Triangulation::Triangulation()'],\n ['../classparallel_1_1distributed_1_1Triangulation_3_011_00_01spacedim_01_4.html#a497f01ba500e6dd30e5178abf277daba', 1, 'parallel::distributed::Triangulation< 1, spacedim >::Triangulation()'],\n ['../classTriangulation.html#a67f431ce66c6df985caf5587bf329ebc', 1, 'Triangulation::Triangulation(const MeshSmoothing smooth_grid=none, const bool check_for_distorted_cells=false)'],\n ['../classTriangulation.html#afc766f8def6774029a22aa635270ebce', 1, 'Triangulation::Triangulation(const Triangulation< dim, spacedim > &)=delete'],\n ['../classTriangulation.html#af7ac8a261c841e50cddfff066c28498b', 1, 'Triangulation::Triangulation(Triangulation< dim, spacedim > &&tria) noexcept'],\n+ ['../classNonMatching_1_1MeshClassifier.html#ab390088dc999e6c06571614efe05aa2b', 1, 'NonMatching::MeshClassifier::triangulation'],\n ['../classNonMatching_1_1MappingInfo.html#a37adacd323083370115f041eabb6660b', 1, 'NonMatching::MappingInfo::triangulation'],\n ['../classTransfiniteInterpolationManifold.html#a0e291ba17bd296e1c79d053649e288f5', 1, 'TransfiniteInterpolationManifold::triangulation'],\n ['../p4est__wrappers_8cc.html#ace00f2f80d9780ef9aa1007e1c22c6a4', 1, 'triangulation: p4est_wrappers.cc'],\n ['../classparallel_1_1distributed_1_1ContinuousQuadratureDataTransfer.html#a653d45c6401c481f66858458702f9c09', 1, 'parallel::distributed::ContinuousQuadratureDataTransfer::triangulation'],\n ['../classUtilities_1_1MPI_1_1RemotePointEvaluation_1_1CellData.html#a75301f351244fe406ba5b0090919f246', 1, 'Utilities::MPI::RemotePointEvaluation::CellData::triangulation'],\n- ['../classNonMatching_1_1MeshClassifier.html#ab390088dc999e6c06571614efe05aa2b', 1, 'NonMatching::MeshClassifier::triangulation'],\n+ ['../classparallel_1_1distributed_1_1Triangulation.html', 1, 'parallel::distributed::Triangulation< dim, spacedim >'],\n ['../classparallel_1_1fullydistributed_1_1Triangulation.html', 1, 'parallel::fullydistributed::Triangulation< dim, spacedim >'],\n- ['../classparallel_1_1shared_1_1Triangulation.html', 1, 'parallel::shared::Triangulation< dim, spacedim >'],\n+ ['../classCellDataTransfer.html#a02b307c95b372e13851a759fc11e0818', 1, 'CellDataTransfer::triangulation'],\n ['../classTriangulation.html', 1, 'Triangulation< dim, spacedim >']\n ]],\n ['triangulation_2eh_608', ['triangulation.h', ['../triangulation_8h.html', 1, '']]],\n ['triangulation2_609', ['Triangulation2', ['../namespaceCGALWrappers.html#a9a4b77bb490d8969d970b6b6ab4b10f2', 1, 'CGALWrappers']]],\n ['triangulation3_610', ['Triangulation3', ['../namespaceCGALWrappers.html#aaafe791d547c123fa06a343b88d312a8', 1, 'CGALWrappers']]],\n ['triangulation3_5fexact_611', ['Triangulation3_exact', ['../namespaceCGALWrappers.html#a6dfe446ebcbbd9331e23bfeb5a6e1561', 1, 'CGALWrappers']]],\n ['triangulation_3c_201_2c_20spacedim_20_3e_612', ['triangulation< 1, spacedim >', ['../classparallel_1_1distributed_1_1Triangulation_3_011_00_01spacedim_01_4.html', 1, 'parallel::distributed::Triangulation< 1, spacedim >'],\n@@ -1267,34 +1267,34 @@\n ['triangulationbase_3c_20dim_2c_20dim_20_3e_622', ['TriangulationBase< dim, dim >', ['../classparallel_1_1TriangulationBase.html', 1, 'parallel']]],\n ['triangulationbase_3c_20dim_2c_20spacedim_20_3e_623', ['TriangulationBase< dim, spacedim >', ['../classparallel_1_1TriangulationBase.html', 1, 'parallel']]],\n ['triangulationdescription_624', ['TriangulationDescription', ['../namespaceTriangulationDescription.html', 1, '']]],\n ['triangulationdescription_3a_3autilities_625', ['Utilities', ['../namespaceTriangulationDescription_1_1Utilities.html', 1, 'TriangulationDescription']]],\n ['triangulations_626', ['triangulations', ['../group__grid.html', 1, 'Grids and Triangulations'],\n ['../group__manifold.html', 1, 'Manifold description for triangulations']\n ]],\n- ['triaobjects_627', ['triaobjects', ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html#a3c0c197b18061ae24d9ecd9eda2979a5', 1, 'internal::TriangulationImplementation::TriaObjects::TriaObjects()'],\n- ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html', 1, 'internal::TriangulationImplementation::TriaObjects'],\n- ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html#ac7f4c39e182b1b5cc53e87eb99945866', 1, 'internal::TriangulationImplementation::TriaObjects::TriaObjects()']\n- ]],\n- ['triaobjectsorientations_628', ['triaobjectsorientations', ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations'],\n- ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html#afb7bf83a2d5ff0f09ec832ec7801d6c2', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations::TriaObjectsOrientations()'],\n- ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html#abdccc246837e5f16ac7d93c7ad29c9ff', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations::TriaObjectsOrientations(const unsigned int n_objects)']\n+ ['triaobjects_627', ['triaobjects', ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html#ac7f4c39e182b1b5cc53e87eb99945866', 1, 'internal::TriangulationImplementation::TriaObjects::TriaObjects()'],\n+ ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html#a3c0c197b18061ae24d9ecd9eda2979a5', 1, 'internal::TriangulationImplementation::TriaObjects::TriaObjects(const unsigned int structdim)'],\n+ ['../classinternal_1_1TriangulationImplementation_1_1TriaObjects.html', 1, 'internal::TriangulationImplementation::TriaObjects']\n+ ]],\n+ ['triaobjectsorientations_628', ['triaobjectsorientations', ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html#afb7bf83a2d5ff0f09ec832ec7801d6c2', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations::TriaObjectsOrientations()'],\n+ ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html#abdccc246837e5f16ac7d93c7ad29c9ff', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations::TriaObjectsOrientations(const unsigned int n_objects)'],\n+ ['../classinternal_1_1TriangulationImplementation_1_1TriaObjectsOrientations.html', 1, 'internal::TriangulationImplementation::TriaObjectsOrientations']\n ]],\n- ['triarawiterator_629', ['triarawiterator', ['../classTriaRawIterator.html#a972118d0712cd84d2b7a4fb60d40d3df', 1, 'TriaRawIterator::TriaRawIterator(const Accessor &a)'],\n+ ['triarawiterator_629', ['triarawiterator', ['../classTriaRawIterator.html#a2cbcfb44453dd32cdc1787d884d9e30f', 1, 'TriaRawIterator::TriaRawIterator(const Triangulation< Accessor::dimension, Accessor::space_dimension > *parent, const int level, const int index, const typename AccessorType::AccessorData *local_data=nullptr)'],\n+ ['../classTriaRawIterator.html#a2dae776615895759d9406f7546c7d17f', 1, 'TriaRawIterator::TriaRawIterator(const TriaAccessorBase< Accessor::structure_dimension, Accessor::dimension, Accessor::space_dimension > &tria_accessor, const typename Accessor::AccessorData *local_data)'],\n ['../classTriaRawIterator.html#a915d1e6e745a614dc18f103bd52e7906', 1, 'TriaRawIterator::TriaRawIterator(const OtherAccessor &a)'],\n- ['../classTriaRawIterator.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'TriaRawIterator::TriaRawIterator'],\n- ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'TriaAccessor< 0, dim, spacedim >::TriaRawIterator'],\n- ['../classTriaRawIterator.html#a2cbcfb44453dd32cdc1787d884d9e30f', 1, 'TriaRawIterator::TriaRawIterator(const Triangulation< Accessor::dimension, Accessor::space_dimension > *parent, const int level, const int index, const typename AccessorType::AccessorData *local_data=nullptr)'],\n+ ['../classTriaRawIterator.html#a972118d0712cd84d2b7a4fb60d40d3df', 1, 'TriaRawIterator::TriaRawIterator(const Accessor &a)'],\n ['../classTriaRawIterator.html#a4e972bae8d2540f2aa3ec1c6ade88cd9', 1, 'TriaRawIterator::TriaRawIterator(const TriaRawIterator &)'],\n ['../classTriaRawIterator.html#a6c35a49d58a76d36b85784f2a6465347', 1, 'TriaRawIterator::TriaRawIterator()'],\n- ['../classTriaRawIterator.html#ac8808d63d54fc5404489bcab6bf15573', 1, 'TriaRawIterator::TriaRawIterator(const TriaRawIterator< OtherAccessor > &i)'],\n+ ['../classTriaRawIterator.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'TriaRawIterator::TriaRawIterator'],\n+ ['../classTriaAccessor_3_010_00_01dim_00_01spacedim_01_4.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'TriaAccessor< 0, dim, spacedim >::TriaRawIterator'],\n ['../classTriaAccessorBase.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'TriaAccessorBase::TriaRawIterator'],\n ['../classDoFAccessor_3_010_00_011_00_01spacedim_00_01level__dof__access_01_4.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'DoFAccessor< 0, 1, spacedim, level_dof_access >::TriaRawIterator'],\n- ['../classTriaRawIterator.html#a2dae776615895759d9406f7546c7d17f', 1, 'TriaRawIterator::TriaRawIterator()'],\n ['../classDoFAccessor.html#a9dacc3081fd832e48ab08d167cce90e2', 1, 'DoFAccessor::TriaRawIterator'],\n+ ['../classTriaRawIterator.html#ac8808d63d54fc5404489bcab6bf15573', 1, 'TriaRawIterator::TriaRawIterator(const TriaRawIterator< OtherAccessor > &i)'],\n ['../classTriaRawIterator.html#a42b552e4dcb90b2f969b1f8db2fe8432', 1, 'TriaRawIterator::TriaRawIterator(const TriaIterator< OtherAccessor > &i)'],\n ['../classTriaRawIterator.html#af5e759cf552f254d87dc6c895bf17d71', 1, 'TriaRawIterator::TriaRawIterator(const TriaActiveIterator< OtherAccessor > &i)'],\n ['../classTriaRawIterator.html', 1, 'TriaRawIterator< Accessor >']\n ]],\n ['tridiagonal_5fmatrix_2ecc_630', ['tridiagonal_matrix.cc', ['../tridiagonal__matrix_8cc.html', 1, '']]],\n ['tridiagonal_5fmatrix_2eh_631', ['tridiagonal_matrix.h', ['../tridiagonal__matrix_8h.html', 1, '']]],\n ['tridiagonalize_632', ['tridiagonalize', ['../namespaceinternal_1_1SymmetricTensorImplementation.html#a839c683c2f3d5789886a16ff505cd159', 1, 'internal::SymmetricTensorImplementation']]],\n@@ -1307,42 +1307,42 @@\n ['trilinos_5fblock_5fvector_2ecc_637', ['trilinos_block_vector.cc', ['../trilinos__block__vector_8cc.html', 1, '']]],\n ['trilinos_5fepetra_5fcommunication_5fpattern_2ecc_638', ['trilinos_epetra_communication_pattern.cc', ['../trilinos__epetra__communication__pattern_8cc.html', 1, '']]],\n ['trilinos_5fepetra_5fcommunication_5fpattern_2eh_639', ['trilinos_epetra_communication_pattern.h', ['../trilinos__epetra__communication__pattern_8h.html', 1, '']]],\n ['trilinos_5fepetra_5fvector_2ecc_640', ['trilinos_epetra_vector.cc', ['../trilinos__epetra__vector_8cc.html', 1, '']]],\n ['trilinos_5fepetra_5fvector_2eh_641', ['trilinos_epetra_vector.h', ['../trilinos__epetra__vector_8h.html', 1, '']]],\n ['trilinos_5findex_5faccess_2eh_642', ['trilinos_index_access.h', ['../trilinos__index__access_8h.html', 1, '']]],\n ['trilinos_5flinear_5foperator_2eh_643', ['trilinos_linear_operator.h', ['../trilinos__linear__operator_8h.html', 1, '']]],\n- ['trilinos_5fmatrix_644', ['trilinos_matrix', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a2ef7ecf41d06143ff38e06715a147545', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_matrix()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#ad54bc35c998e9600005b41dcf6d4e849', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_matrix() const'],\n- ['../classTrilinosWrappers_1_1SparseMatrix.html#a331a1c0750d1bdc25c4d7663857222b9', 1, 'TrilinosWrappers::SparseMatrix::trilinos_matrix()'],\n+ ['trilinos_5fmatrix_644', ['trilinos_matrix', ['../classTrilinosWrappers_1_1PreconditionAMG.html#a3ecdb5a7f3c8a524e080532a33a83585', 1, 'TrilinosWrappers::PreconditionAMG::trilinos_matrix'],\n ['../classTrilinosWrappers_1_1PreconditionAMGMueLu.html#a0f1169cd319987117fe6919c699f83aa', 1, 'TrilinosWrappers::PreconditionAMGMueLu::trilinos_matrix'],\n- ['../classTrilinosWrappers_1_1PreconditionAMG.html#a3ecdb5a7f3c8a524e080532a33a83585', 1, 'TrilinosWrappers::PreconditionAMG::trilinos_matrix']\n+ ['../classTrilinosWrappers_1_1SparseMatrix.html#a331a1c0750d1bdc25c4d7663857222b9', 1, 'TrilinosWrappers::SparseMatrix::trilinos_matrix()'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#ad54bc35c998e9600005b41dcf6d4e849', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_matrix() const'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a2ef7ecf41d06143ff38e06715a147545', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_matrix()']\n ]],\n ['trilinos_5foperator_645', ['trilinos_operator', ['../classTrilinosWrappers_1_1PreconditionBase.html#a5dbb87bb5e1b441ba9581866e47ad9c9', 1, 'TrilinosWrappers::PreconditionBase::trilinos_operator()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1PreconditionBase.html#ad4b1ec1d1af3d5fa3b0bfe0f55a090fe', 1, 'LinearAlgebra::TpetraWrappers::PreconditionBase::trilinos_operator()']\n ]],\n ['trilinos_5fparallel_5fblock_5fvector_2eh_646', ['trilinos_parallel_block_vector.h', ['../trilinos__parallel__block__vector_8h.html', 1, '']]],\n ['trilinos_5fpartitioner_647', ['trilinos_partitioner', ['../classTrilinosWrappers_1_1MPI_1_1Vector.html#a3e86e35140c8cb0bbb20745bf8d4c031', 1, 'TrilinosWrappers::MPI::Vector']]],\n ['trilinos_5fprecondition_2ecc_648', ['trilinos_precondition.cc', ['../trilinos__precondition_8cc.html', 1, '']]],\n ['trilinos_5fprecondition_2eh_649', ['trilinos_precondition.h', ['../trilinos__precondition_8h.html', 1, '']]],\n ['trilinos_5fprecondition_5fml_2ecc_650', ['trilinos_precondition_ml.cc', ['../trilinos__precondition__ml_8cc.html', 1, '']]],\n ['trilinos_5fprecondition_5fmuelu_2ecc_651', ['trilinos_precondition_muelu.cc', ['../trilinos__precondition__muelu_8cc.html', 1, '']]],\n- ['trilinos_5frcp_652', ['trilinos_rcp', ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#af4275888758d36724595514ed4352d31', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_rcp()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#acb9fa88a131dd6cbc4b22b25928437b1', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_rcp() const'],\n+ ['trilinos_5frcp_652', ['trilinos_rcp', ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a5a13e4a82b3f2f31c575d86551fcd28f', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_rcp()'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1PreconditionBase.html#aa0519d6a0b97b2382e09fac32bdb862e', 1, 'LinearAlgebra::TpetraWrappers::PreconditionBase::trilinos_rcp()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#ac4f761e24b8d61326ea5fa60a3b00349', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_rcp()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a5a13e4a82b3f2f31c575d86551fcd28f', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::trilinos_rcp() const'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1PreconditionBase.html#aa0519d6a0b97b2382e09fac32bdb862e', 1, 'LinearAlgebra::TpetraWrappers::PreconditionBase::trilinos_rcp()']\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#acb9fa88a131dd6cbc4b22b25928437b1', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_rcp() const'],\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#af4275888758d36724595514ed4352d31', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_rcp()']\n ]],\n ['trilinos_5fsolver_2ecc_653', ['trilinos_solver.cc', ['../trilinos__solver_8cc.html', 1, '']]],\n ['trilinos_5fsolver_2eh_654', ['trilinos_solver.h', ['../trilinos__solver_8h.html', 1, '']]],\n ['trilinos_5fsparse_5fmatrix_2ecc_655', ['trilinos_sparse_matrix.cc', ['../trilinos__sparse__matrix_8cc.html', 1, '']]],\n ['trilinos_5fsparse_5fmatrix_2eh_656', ['trilinos_sparse_matrix.h', ['../trilinos__sparse__matrix_8h.html', 1, '']]],\n ['trilinos_5fsparsity_5fpattern_657', ['trilinos_sparsity_pattern', ['../classTrilinosWrappers_1_1SparseMatrix.html#aaf7998bfc014b977edaa7e1da951d2a1', 1, 'TrilinosWrappers::SparseMatrix::trilinos_sparsity_pattern()'],\n- ['../classTrilinosWrappers_1_1SparsityPattern.html#a8ed395d20c71f4621b7d43b0a3783aae', 1, 'TrilinosWrappers::SparsityPattern::trilinos_sparsity_pattern()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern.html#a259b10ca773a9a143d83e9014cf968a2', 1, 'LinearAlgebra::TpetraWrappers::SparsityPattern::trilinos_sparsity_pattern()']\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparsityPattern.html#a259b10ca773a9a143d83e9014cf968a2', 1, 'LinearAlgebra::TpetraWrappers::SparsityPattern::trilinos_sparsity_pattern()'],\n+ ['../classTrilinosWrappers_1_1SparsityPattern.html#a8ed395d20c71f4621b7d43b0a3783aae', 1, 'TrilinosWrappers::SparsityPattern::trilinos_sparsity_pattern()']\n ]],\n ['trilinos_5fsparsity_5fpattern_2ecc_658', ['trilinos_sparsity_pattern.cc', ['../trilinos__sparsity__pattern_8cc.html', 1, '']]],\n ['trilinos_5fsparsity_5fpattern_2eh_659', ['trilinos_sparsity_pattern.h', ['../trilinos__sparsity__pattern_8h.html', 1, '']]],\n ['trilinos_5ftpetra_5fblock_5fsparse_5fmatrix_2ecc_660', ['trilinos_tpetra_block_sparse_matrix.cc', ['../trilinos__tpetra__block__sparse__matrix_8cc.html', 1, '']]],\n ['trilinos_5ftpetra_5fblock_5fsparse_5fmatrix_2eh_661', ['trilinos_tpetra_block_sparse_matrix.h', ['../trilinos__tpetra__block__sparse__matrix_8h.html', 1, '']]],\n ['trilinos_5ftpetra_5fblock_5fvector_2ecc_662', ['trilinos_tpetra_block_vector.cc', ['../trilinos__tpetra__block__vector_8cc.html', 1, '']]],\n ['trilinos_5ftpetra_5fblock_5fvector_2eh_663', ['trilinos_tpetra_block_vector.h', ['../trilinos__tpetra__block__vector_8h.html', 1, '']]],\n@@ -1357,40 +1357,40 @@\n ['trilinos_5ftpetra_5fsparsity_5fpattern_2ecc_672', ['trilinos_tpetra_sparsity_pattern.cc', ['../trilinos__tpetra__sparsity__pattern_8cc.html', 1, '']]],\n ['trilinos_5ftpetra_5fsparsity_5fpattern_2eh_673', ['trilinos_tpetra_sparsity_pattern.h', ['../trilinos__tpetra__sparsity__pattern_8h.html', 1, '']]],\n ['trilinos_5ftpetra_5ftypes_2eh_674', ['trilinos_tpetra_types.h', ['../trilinos__tpetra__types_8h.html', 1, '']]],\n ['trilinos_5ftpetra_5fvector_2ecc_675', ['trilinos_tpetra_vector.cc', ['../trilinos__tpetra__vector_8cc.html', 1, '']]],\n ['trilinos_5ftpetra_5fvector_2eh_676', ['trilinos_tpetra_vector.h', ['../trilinos__tpetra__vector_8h.html', 1, '']]],\n ['trilinos_5futilities_2ecc_677', ['trilinos_utilities.cc', ['../trilinos__utilities_8cc.html', 1, '']]],\n ['trilinos_5futilities_2eh_678', ['trilinos_utilities.h', ['../trilinos__utilities_8h.html', 1, '']]],\n- ['trilinos_5fvector_679', ['trilinos_vector', ['../classTrilinosWrappers_1_1MPI_1_1Vector.html#a5f8c768a5e6bc023afe77cf1e6a7a3e0', 1, 'TrilinosWrappers::MPI::Vector::trilinos_vector()'],\n- ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#a7578e31917b74a65f4b757c64892ed71', 1, 'LinearAlgebra::EpetraWrappers::Vector::trilinos_vector()'],\n- ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#abae529d2ecb99dd0b4cbd1f0534cd32a', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_vector() const'],\n+ ['trilinos_5fvector_679', ['trilinos_vector', ['../classTrilinosWrappers_1_1MPI_1_1Vector.html#a826184e736d1cffefb8b6f8b93352699', 1, 'TrilinosWrappers::MPI::Vector::trilinos_vector()'],\n+ ['../classTrilinosWrappers_1_1MPI_1_1Vector.html#a5f8c768a5e6bc023afe77cf1e6a7a3e0', 1, 'TrilinosWrappers::MPI::Vector::trilinos_vector() const'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#a0a9bcd7ee95baa828b059b309443ced4', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_vector()'],\n- ['../classTrilinosWrappers_1_1MPI_1_1Vector.html#a826184e736d1cffefb8b6f8b93352699', 1, 'TrilinosWrappers::MPI::Vector::trilinos_vector()'],\n- ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#a5e04a272da58747cd901a90cd9fc99a7', 1, 'LinearAlgebra::EpetraWrappers::Vector::trilinos_vector()']\n+ ['../classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html#abae529d2ecb99dd0b4cbd1f0534cd32a', 1, 'LinearAlgebra::TpetraWrappers::Vector::trilinos_vector() const'],\n+ ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#a7578e31917b74a65f4b757c64892ed71', 1, 'LinearAlgebra::EpetraWrappers::Vector::trilinos_vector()'],\n+ ['../classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html#a5e04a272da58747cd901a90cd9fc99a7', 1, 'LinearAlgebra::EpetraWrappers::Vector::trilinos_vector() const']\n ]],\n ['trilinos_5fvector_2ecc_680', ['trilinos_vector.cc', ['../trilinos__vector_8cc.html', 1, '']]],\n ['trilinos_5fvector_2eh_681', ['trilinos_vector.h', ['../trilinos__vector_8h.html', 1, '']]],\n ['trilinosblockpayload_682', ['trilinosblockpayload', ['../classTrilinosWrappers_1_1internal_1_1BlockLinearOperatorImplementation_1_1TrilinosBlockPayload.html#a56a94df51cf351c0d9beffc894ee8b3b', 1, 'TrilinosWrappers::internal::BlockLinearOperatorImplementation::TrilinosBlockPayload::TrilinosBlockPayload()'],\n ['../classTrilinosWrappers_1_1internal_1_1BlockLinearOperatorImplementation_1_1TrilinosBlockPayload.html', 1, 'TrilinosWrappers::internal::BlockLinearOperatorImplementation::TrilinosBlockPayload< PayloadBlockType >']\n ]],\n- ['trilinospayload_683', ['trilinospayload', ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#ad287b3e900608d1f4cc468f986b262e1', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload()'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a825ab50b68a8fe88168a0d21081cbeb1', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &first_op, const TrilinosPayload &second_op)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a45bece642b71a041088bb6cbe8eeffe9', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#ade0c1f7886604b92665b3132bea01a0c', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a7b5f0d9cca729b38ad066a1ef31e8398', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosWrappers::PreconditionBase &preconditioner_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a3379621a480a77473af04150f79cd2ee', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosWrappers::SparseMatrix &matrix_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a7b552e2783a938ab207c3484f2897eb8', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload_exemplar, const TrilinosWrappers::SparseMatrix &matrix)'],\n+ ['trilinospayload_683', ['trilinospayload', ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a6e026499ade2f662c6014d1e4924e7da', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload()'],\n ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a35ab5268d902e11507794366955d78a1', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosWrappers::SparseMatrix &matrix_exemplar, const TrilinosWrappers::SparseMatrix &matrix)'],\n- ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a6e026499ade2f662c6014d1e4924e7da', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload()']\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a7b552e2783a938ab207c3484f2897eb8', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload_exemplar, const TrilinosWrappers::SparseMatrix &matrix)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a3379621a480a77473af04150f79cd2ee', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosWrappers::SparseMatrix &matrix_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a7b5f0d9cca729b38ad066a1ef31e8398', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosWrappers::PreconditionBase &preconditioner_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#ade0c1f7886604b92665b3132bea01a0c', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload_exemplar, const TrilinosWrappers::PreconditionBase &preconditioner)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a45bece642b71a041088bb6cbe8eeffe9', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &payload)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a825ab50b68a8fe88168a0d21081cbeb1', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(const TrilinosPayload &first_op, const TrilinosPayload &second_op)'],\n+ ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#ad287b3e900608d1f4cc468f986b262e1', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::TrilinosPayload(EpetraOpType &op, const bool supports_inverse_operations, const bool use_transpose, const MPI_Comm mpi_communicator, const IndexSet &locally_owned_domain_indices, const IndexSet &locally_owned_range_indices)']\n ]],\n ['trilinosscalar_684', ['TrilinosScalar', ['../types_8h.html#a7dcbf452228a2e0b1467e0d8b722db6b', 1, 'types.h']]],\n- ['trilinoswrappers_685', ['trilinoswrappers', ['../group__TrilinosWrappers.html', 1, 'TrilinosWrappers'],\n- ['../namespaceTrilinosWrappers.html', 1, 'TrilinosWrappers']\n+ ['trilinoswrappers_685', ['trilinoswrappers', ['../namespaceTrilinosWrappers.html', 1, 'TrilinosWrappers'],\n+ ['../group__TrilinosWrappers.html', 1, 'TrilinosWrappers']\n ]],\n ['trilinoswrappers_3a_3ainternal_686', ['internal', ['../namespaceTrilinosWrappers_1_1internal.html', 1, 'TrilinosWrappers']]],\n ['trilinoswrappers_3a_3ainternal_3a_3ablocklinearoperatorimplementation_687', ['BlockLinearOperatorImplementation', ['../namespaceTrilinosWrappers_1_1internal_1_1BlockLinearOperatorImplementation.html', 1, 'TrilinosWrappers::internal']]],\n ['trilinoswrappers_3a_3ainternal_3a_3alinearoperatorimplementation_688', ['LinearOperatorImplementation', ['../namespaceTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation.html', 1, 'TrilinosWrappers::internal']]],\n ['trilinoswrappers_3a_3ainternal_3a_3asparsematriximplementation_689', ['SparseMatrixImplementation', ['../namespaceTrilinosWrappers_1_1internal_1_1SparseMatrixImplementation.html', 1, 'TrilinosWrappers::internal']]],\n ['trilinoswrappers_3a_3ainternals_690', ['internals', ['../namespaceTrilinosWrappers_1_1internals.html', 1, 'TrilinosWrappers']]],\n ['trilinoswrappers_3a_3ampi_691', ['MPI', ['../namespaceTrilinosWrappers_1_1MPI.html', 1, 'TrilinosWrappers']]],\n@@ -1398,35 +1398,35 @@\n ['trilinoswrappers_3a_3asparsematrixiterators_693', ['SparseMatrixIterators', ['../namespaceTrilinosWrappers_1_1SparseMatrixIterators.html', 1, 'TrilinosWrappers']]],\n ['trilinoswrappers_3a_3asparsitypattern_694', ['SparsityPattern', ['../classTrilinosWrappers_1_1SparsityPatternIterators_1_1Iterator.html#a8c40610947fca1a488c32224ee55e491', 1, 'TrilinosWrappers::SparsityPatternIterators::Iterator']]],\n ['trilinoswrappers_3a_3asparsitypatterniterators_695', ['SparsityPatternIterators', ['../namespaceTrilinosWrappers_1_1SparsityPatternIterators.html', 1, 'TrilinosWrappers']]],\n ['trilinoswrappers_3a_3atypes_696', ['types', ['../namespaceTrilinosWrappers_1_1types.html', 1, 'TrilinosWrappers']]],\n ['trim_697', ['trim', ['../namespaceUtilities.html#aca117b9cf9345b7ae7b72a075ddde116', 1, 'Utilities']]],\n ['triple_5fproduct_698', ['triple_product', ['../classFullMatrix.html#a087ad6f60a4a0c365aeaee4760ad5cb9', 1, 'FullMatrix']]],\n ['trivial_5felement_699', ['trivial_element', ['../classinternal_1_1AlignedVectorInitialize.html#a74c40e1b8b43a9da73b7ea58ccdccea6', 1, 'internal::AlignedVectorInitialize']]],\n- ['trmv_700', ['trmv', ['../lapack__templates_8h.html#a6e212791d85c55d12c8321c3ed06d44e', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const std::complex< double > *a, const ::types::blas_int *lda, std::complex< double > *x, const ::types::blas_int *incx): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a87c7a54d89acb5827b1f6fbdab9e897b', 1, 'trmv(const char *, const char *, const char *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, number2 *, const ::types::blas_int *): lapack_templates.h'],\n- ['../lapack__templates_8h.html#abfababb100066f2b397692ff53da483d', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const std::complex< float > *a, const ::types::blas_int *lda, std::complex< float > *x, const ::types::blas_int *incx): lapack_templates.h'],\n+ ['trmv_700', ['trmv', ['../lapack__templates_8h.html#a87c7a54d89acb5827b1f6fbdab9e897b', 1, 'trmv(const char *, const char *, const char *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, number2 *, const ::types::blas_int *): lapack_templates.h'],\n ['../lapack__templates_8h.html#aecb4eb59951bbfc06e22f09139edb29c', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const float *a, const ::types::blas_int *lda, float *x, const ::types::blas_int *incx): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a5dd35d46daf84b56fb397be493f0d5cd', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const double *a, const ::types::blas_int *lda, double *x, const ::types::blas_int *incx): lapack_templates.h']\n+ ['../lapack__templates_8h.html#a6e212791d85c55d12c8321c3ed06d44e', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const std::complex< double > *a, const ::types::blas_int *lda, std::complex< double > *x, const ::types::blas_int *incx): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#a5dd35d46daf84b56fb397be493f0d5cd', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const double *a, const ::types::blas_int *lda, double *x, const ::types::blas_int *incx): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#abfababb100066f2b397692ff53da483d', 1, 'trmv(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const std::complex< float > *a, const ::types::blas_int *lda, std::complex< float > *x, const ::types::blas_int *incx): lapack_templates.h']\n ]],\n- ['trtrs_701', ['trtrs', ['../lapack__templates_8h.html#a901180ad06ca3066e466fcaa918e82e9', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const std::complex< float > *a, const ::types::blas_int *lda, std::complex< float > *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a811ac4ef644fb5bf051ac5d0ab9775f6', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const double *a, const ::types::blas_int *lda, double *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n+ ['trtrs_701', ['trtrs', ['../lapack__templates_8h.html#a4e91e673623a81b9e28eab5ffafa50c5', 1, 'trtrs(const char *, const char *, const char *, const ::types::blas_int *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, number2 *, const ::types::blas_int *, ::types::blas_int *): lapack_templates.h'],\n ['../lapack__templates_8h.html#a6644432d13ffb7e0fa2cde8cc3509aa6', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const std::complex< double > *a, const ::types::blas_int *lda, std::complex< double > *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a76a429e52f3aa8f408c8f896ddd97b52', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const float *a, const ::types::blas_int *lda, float *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n- ['../lapack__templates_8h.html#a4e91e673623a81b9e28eab5ffafa50c5', 1, 'trtrs(const char *, const char *, const char *, const ::types::blas_int *, const ::types::blas_int *, const number1 *, const ::types::blas_int *, number2 *, const ::types::blas_int *, ::types::blas_int *): lapack_templates.h']\n+ ['../lapack__templates_8h.html#a901180ad06ca3066e466fcaa918e82e9', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const std::complex< float > *a, const ::types::blas_int *lda, std::complex< float > *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#a811ac4ef644fb5bf051ac5d0ab9775f6', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const double *a, const ::types::blas_int *lda, double *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h'],\n+ ['../lapack__templates_8h.html#a76a429e52f3aa8f408c8f896ddd97b52', 1, 'trtrs(const char *uplo, const char *trans, const char *diag, const ::types::blas_int *n, const ::types::blas_int *nrhs, const float *a, const ::types::blas_int *lda, float *b, const ::types::blas_int *ldb, ::types::blas_int *info): lapack_templates.h']\n ]],\n ['true_5flevel_5fsubdomain_5fids_5fof_5fcells_702', ['true_level_subdomain_ids_of_cells', ['../classparallel_1_1shared_1_1Triangulation.html#a54f13f72f842cf3926a9c71606a335c3', 1, 'parallel::shared::Triangulation']]],\n ['true_5fsubdomain_5fids_5fof_5fcells_703', ['true_subdomain_ids_of_cells', ['../classparallel_1_1shared_1_1Triangulation.html#a10f51163a7c523cedfb51568af32bd07', 1, 'parallel::shared::Triangulation']]],\n ['truncate_5fto_5fn_5fdigits_704', ['truncate_to_n_digits', ['../namespaceUtilities.html#a17955af7a4bc8771d430e622f9e732b3', 1, 'Utilities']]],\n ['truncated_5fcone_705', ['truncated_cone', ['../namespaceGridGenerator.html#ae63c93351f77276c20de07c91d3c1e48', 1, 'GridGenerator']]],\n ['truncated_5ftensor_706', ['truncated_tensor', ['../group__matrixfree.html#ggaee4d2d09d3fd284528a8a9c4a3e36979aaa07f0ab46904720720c338d6610b967', 1, 'internal::MatrixFreeFunctions']]],\n ['try_5femplace_5ftask_707', ['try_emplace_task', ['../classThreads_1_1TaskResult.html#acfc8eac73edf4ee7a171ae8fa13ef1c4', 1, 'Threads::TaskResult']]],\n ['try_5ffind_708', ['try_find', ['../classAnyData.html#a35dfae6b2fbc85f4f5c56de11387e299', 1, 'AnyData']]],\n- ['try_5fget_5fdata_709', ['try_get_data', ['../classCellDataStorage.html#ad25cd97a52aae3da7abb9d6f4be489f7', 1, 'CellDataStorage::try_get_data(const CellIteratorType &cell)'],\n- ['../classCellDataStorage.html#a2c905d1a4446e4679a8505ade29473c1', 1, 'CellDataStorage::try_get_data(const CellIteratorType &cell) const']\n+ ['try_5fget_5fdata_709', ['try_get_data', ['../classCellDataStorage.html#a2c905d1a4446e4679a8505ade29473c1', 1, 'CellDataStorage::try_get_data(const CellIteratorType &cell) const'],\n+ ['../classCellDataStorage.html#ad25cd97a52aae3da7abb9d6f4be489f7', 1, 'CellDataStorage::try_get_data(const CellIteratorType &cell)']\n ]],\n ['try_5fread_710', ['try_read', ['../classAnyData.html#a21b2e0522f7e4f244395d3f25981a75f', 1, 'AnyData::try_read(const std::string &name) const'],\n ['../classAnyData.html#afdff7cb5c4ad6acb67becbb0c0ef44ea', 1, 'AnyData::try_read(const unsigned int i) const']\n ]],\n ['try_5fread_5fptr_711', ['try_read_ptr', ['../classAnyData.html#ac82d2937c524aa75857180b88fca34b1', 1, 'AnyData::try_read_ptr(const std::string &name) const'],\n ['../classAnyData.html#a5f3e927f4a549ad50dfba9881cb5e1b9', 1, 'AnyData::try_read_ptr(const unsigned int i) const']\n ]],\n@@ -1441,36 +1441,36 @@\n ['tsolve_720', ['Tsolve', ['../classSolverRichardson.html#ace4a5712e16b2ead7f4e0711cc4691b3', 1, 'SolverRichardson']]],\n ['tsor_721', ['tsor', ['../classSparseMatrix.html#a5a8b5655e772d946d55d66bd70f46ea6', 1, 'SparseMatrix::TSOR()'],\n ['../classChunkSparseMatrix.html#a8f939ccb2ac6f1ede6c15a64e8eebf56', 1, 'ChunkSparseMatrix::TSOR(Vector< somenumber > &v, const number om=1.) const']\n ]],\n ['tsor_5fstep_722', ['tsor_step', ['../classChunkSparseMatrix.html#acc459e0fd2c58f66bdc4c6bc4637b6ea', 1, 'ChunkSparseMatrix::TSOR_step()'],\n ['../classSparseMatrix.html#a04f33ff3e6ae2e7363e073ef3bfc9a22', 1, 'SparseMatrix::TSOR_step()']\n ]],\n- ['tstep_723', ['tstep', ['../classPreconditionBlockSSOR.html#a740be9e59a6fd7b22b23dd92ca690b18', 1, 'PreconditionBlockSSOR::Tstep()'],\n- ['../classPreconditionBlockSOR.html#a6d41401a1cdf28dc4e46735404de0274', 1, 'PreconditionBlockSOR::Tstep()'],\n- ['../classPreconditionBlockJacobi.html#ae63a4e1b455162072c6b688de7c12c67', 1, 'PreconditionBlockJacobi::Tstep()'],\n- ['../classPreconditionChebyshev.html#a6bb2f2b8e8637bbed91b327af0490fe6', 1, 'PreconditionChebyshev::Tstep()'],\n+ ['tstep_723', ['tstep', ['../classPreconditionBlockSOR.html#a6d41401a1cdf28dc4e46735404de0274', 1, 'PreconditionBlockSOR::Tstep()'],\n+ ['../classRelaxationBlockSSOR.html#a2439c9f3f9dbab169956a6db7d561c55', 1, 'RelaxationBlockSSOR::Tstep()'],\n+ ['../classRelaxationBlockSOR.html#af59df86f9d3f228154d906b3db0d20ba', 1, 'RelaxationBlockSOR::Tstep()'],\n ['../classRelaxationBlockJacobi.html#a070df61ff6538fa8d9a2552406e40531', 1, 'RelaxationBlockJacobi::Tstep()'],\n+ ['../classPreconditionBlockSSOR.html#a740be9e59a6fd7b22b23dd92ca690b18', 1, 'PreconditionBlockSSOR::Tstep()'],\n ['../classPreconditionRelaxation.html#adc6e66ab68436936c2389059ff955c57', 1, 'PreconditionRelaxation::Tstep()'],\n- ['../classRelaxationBlockSOR.html#af59df86f9d3f228154d906b3db0d20ba', 1, 'RelaxationBlockSOR::Tstep()'],\n- ['../classRelaxationBlockSSOR.html#a2439c9f3f9dbab169956a6db7d561c55', 1, 'RelaxationBlockSSOR::Tstep()']\n+ ['../classPreconditionBlockJacobi.html#ae63a4e1b455162072c6b688de7c12c67', 1, 'PreconditionBlockJacobi::Tstep()'],\n+ ['../classPreconditionChebyshev.html#a6bb2f2b8e8637bbed91b327af0490fe6', 1, 'PreconditionChebyshev::Tstep()']\n ]],\n- ['tuple_724', ['tuple', ['../classPatterns_1_1Tuple.html#a21db2c2402a8b88cc8fe2b7ebecb40a1', 1, 'Patterns::Tuple::Tuple(const PatternTypes &...ps)'],\n- ['../classPatterns_1_1Tuple.html#a619041d07a3b8cf104769224455a7361', 1, 'Patterns::Tuple::Tuple(const std::vector< std::unique_ptr< PatternBase > > &patterns, const char *separator)'],\n- ['../classPatterns_1_1Tuple.html#a040e18a7875b096061ad9005eef2446a', 1, 'Patterns::Tuple::Tuple(const std::string &separator, const PatternTypes &...patterns)'],\n- ['../classPatterns_1_1Tuple.html#a1176f5049bb5fb8d249422526f944246', 1, 'Patterns::Tuple::Tuple(const Tuple &other)'],\n+ ['tuple_724', ['tuple', ['../classPatterns_1_1Tuple.html#aa39aa7280eba075458efe5c8acaa0f6d', 1, 'Patterns::Tuple::Tuple()'],\n ['../classPatterns_1_1Tuple.html', 1, 'Patterns::Tuple'],\n+ ['../classPatterns_1_1Tuple.html#a619041d07a3b8cf104769224455a7361', 1, 'Patterns::Tuple::Tuple(const std::vector< std::unique_ptr< PatternBase > > &patterns, const char *separator)'],\n ['../classPatterns_1_1Tuple.html#a6abc1e32015c22e2b83512881b393c8b', 1, 'Patterns::Tuple::Tuple(const Patterns &...patterns)'],\n- ['../classPatterns_1_1Tuple.html#aa39aa7280eba075458efe5c8acaa0f6d', 1, 'Patterns::Tuple::Tuple(const char *separator, const PatternTypes &...patterns)'],\n- ['../classPatterns_1_1Tuple.html#aa7aed619dda6ba2d5011a57c439a9a63', 1, 'Patterns::Tuple::Tuple(const std::vector< std::unique_ptr< PatternBase > > &patterns, const std::string &separator=":")']\n+ ['../classPatterns_1_1Tuple.html#a1176f5049bb5fb8d249422526f944246', 1, 'Patterns::Tuple::Tuple(const Tuple &other)'],\n+ ['../classPatterns_1_1Tuple.html#a21db2c2402a8b88cc8fe2b7ebecb40a1', 1, 'Patterns::Tuple::Tuple(const PatternTypes &...ps)'],\n+ ['../classPatterns_1_1Tuple.html#aa7aed619dda6ba2d5011a57c439a9a63', 1, 'Patterns::Tuple::Tuple(const std::vector< std::unique_ptr< PatternBase > > &patterns, const std::string &separator=":")'],\n+ ['../classPatterns_1_1Tuple.html#a040e18a7875b096061ad9005eef2446a', 1, 'Patterns::Tuple::Tuple(const std::string &separator, const PatternTypes &...patterns)']\n ]],\n ['tuple_2eh_725', ['tuple.h', ['../tuple_8h.html', 1, '']]],\n ['tupletype_726', ['TupleType', ['../classUtilities_1_1MutableBind.html#afcab447c477fcf62cd0762fe8acdafda', 1, 'Utilities::MutableBind']]],\n- ['turn_5fangle_727', ['turn_angle', ['../structGridOutFlags_1_1Eps_3_013_01_4.html#abd508c887a07c00467fc746d242a70ac', 1, 'GridOutFlags::Eps< 3 >::turn_angle'],\n- ['../structDataOutBase_1_1EpsFlags.html#a3afae76795cf33c76a3f65af902abf41', 1, 'DataOutBase::EpsFlags::turn_angle']\n+ ['turn_5fangle_727', ['turn_angle', ['../structDataOutBase_1_1EpsFlags.html#a3afae76795cf33c76a3f65af902abf41', 1, 'DataOutBase::EpsFlags::turn_angle'],\n+ ['../structGridOutFlags_1_1Eps_3_013_01_4.html#abd508c887a07c00467fc746d242a70ac', 1, 'GridOutFlags::Eps< 3 >::turn_angle']\n ]],\n ['tutorial_20program_728', ['tutorial program', ['../step_1.html', 1, 'The step-1 tutorial program'],\n ['../step_10.html', 1, 'The step-10 tutorial program'],\n ['../step_11.html', 1, 'The step-11 tutorial program'],\n ['../step_12.html', 1, 'The step-12 tutorial program'],\n ['../step_13.html', 1, 'The step-13 tutorial program'],\n ['../step_14.html', 1, 'The step-14 tutorial program'],\n@@ -1553,103 +1553,103 @@\n ['../step_87.html', 1, 'The step-87 tutorial program'],\n ['../step_89.html', 1, 'The step-89 tutorial program'],\n ['../step_9.html', 1, 'The step-9 tutorial program'],\n ['../step_90.html', 1, 'The step-90 tutorial program']\n ]],\n ['tutorial_20programs_729', ['Tutorial programs', ['../Tutorial.html', 1, '']]],\n ['tutorial_2eh_730', ['tutorial.h', ['../tutorial_8h.html', 1, '']]],\n- ['tvmult_731', ['tvmult', ['../classBlockSparseMatrixEZ.html#a74da15e981b325ca25e3e5167453bfd7', 1, 'BlockSparseMatrixEZ::Tvmult()'],\n- ['../classLAPACKFullMatrix.html#a12d12356863a62644b6a84204f2af273', 1, 'LAPACKFullMatrix::Tvmult()'],\n+ ['tvmult_731', ['tvmult', ['../classLAPACKFullMatrix.html#a12d12356863a62644b6a84204f2af273', 1, 'LAPACKFullMatrix::Tvmult()'],\n ['../classHouseholder.html#a443f8cbe62b5f9b2ef53e2bac9884f40', 1, 'Householder::Tvmult()'],\n+ ['../classIdentityMatrix.html#ae6b65c1397dde601fdb95eb5502b20c2', 1, 'IdentityMatrix::Tvmult()'],\n ['../classFullMatrix.html#a8219d4fa962f1b041a506221a7a15379', 1, 'FullMatrix::Tvmult()'],\n ['../classDiagonalMatrix.html#ae5bd2748269c6117a3b20eafd8d1ea5e', 1, 'DiagonalMatrix::Tvmult()'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#a3fa9724908c08643745c8f7bfa032330', 1, 'CUDAWrappers::SparseMatrix::Tvmult()'],\n ['../classCUDAWrappers_1_1PreconditionILU.html#ae51ad37af3441c9f7092a51ffea9a802', 1, 'CUDAWrappers::PreconditionILU::Tvmult()'],\n ['../classCUDAWrappers_1_1PreconditionIC.html#a0ac1835d42986c3052b19964184ca69f', 1, 'CUDAWrappers::PreconditionIC::Tvmult()'],\n ['../classChunkSparseMatrix.html#a1ad069c45a5c9e4d7b675e1942897c84', 1, 'ChunkSparseMatrix::Tvmult()'],\n+ ['../classBlockSparseMatrixEZ.html#a74da15e981b325ca25e3e5167453bfd7', 1, 'BlockSparseMatrixEZ::Tvmult()'],\n ['../classBlockSparseMatrix.html#a565f4c52db80d9e8f94b4236cefe5292', 1, 'BlockSparseMatrix::Tvmult(Vector< nonblock_number > &dst, const Vector< nonblock_number > &src) const'],\n ['../classBlockSparseMatrix.html#a887a23f787dad22e556166d42a92e68c', 1, 'BlockSparseMatrix::Tvmult(Vector< nonblock_number > &dst, const BlockVector< block_number > &src) const'],\n ['../classBlockSparseMatrix.html#ab68dd4e1121c1435b7fbdeb12735a57a', 1, 'BlockSparseMatrix::Tvmult(BlockVector< block_number > &dst, const Vector< nonblock_number > &src) const'],\n ['../classBlockSparseMatrix.html#aadcb0ea8eddf6bd974b1e6cab4b9811b', 1, 'BlockSparseMatrix::Tvmult(BlockVector< block_number > &dst, const BlockVector< block_number > &src) const'],\n ['../classTrilinosWrappers_1_1internal_1_1LinearOperatorImplementation_1_1TrilinosPayload.html#a74b9fd2fe71583071e9546baa1400c55', 1, 'TrilinosWrappers::internal::LinearOperatorImplementation::TrilinosPayload::Tvmult'],\n ['../classLinearOperator.html#a6968174d73bf018f6d0c9181c730e217', 1, 'LinearOperator::Tvmult'],\n- ['../classIdentityMatrix.html#ae6b65c1397dde601fdb95eb5502b20c2', 1, 'IdentityMatrix::Tvmult()'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html#a48dec6635c9f70e30b68c014da05b876', 1, 'TrilinosWrappers::SparseMatrix::Tvmult()'],\n ['../classSparseMatrix.html#a224a78133e7b655e3a2c26647097c2c7', 1, 'SparseMatrix::Tvmult()'],\n ['../classSparseMatrixEZ.html#aa64fd564d949d4bde318f47fcadc0b15', 1, 'SparseMatrixEZ::Tvmult()'],\n ['../classSparseMIC.html#ae6c10ad5b2938fde6b1bfc3c83e83000', 1, 'SparseMIC::Tvmult()'],\n ['../classSparseVanka.html#a9244a620a91b61ee03f70edbf2e52ba7', 1, 'SparseVanka::Tvmult()'],\n ['../classTridiagonalMatrix.html#a971bcd838b2cf0a1e6d91e4d36540844', 1, 'TridiagonalMatrix::Tvmult()'],\n ['../classTrilinosWrappers_1_1BlockSparseMatrix.html#a921db0dd739cc4366de336ce6e11c390', 1, 'TrilinosWrappers::BlockSparseMatrix::Tvmult()'],\n ['../classTrilinosWrappers_1_1PreconditionBase.html#a20d9654a7b5c799fe3b23460ae7c00b0', 1, 'TrilinosWrappers::PreconditionBase::Tvmult(MPI::Vector &dst, const MPI::Vector &src) const'],\n ['../classTrilinosWrappers_1_1PreconditionBase.html#a864dc8e8aa1215741819c2f1ea7f136c', 1, 'TrilinosWrappers::PreconditionBase::Tvmult(::Vector< double > &dst, const ::Vector< double > &src) const'],\n ['../classTrilinosWrappers_1_1PreconditionBase.html#a103862b260f244c95a2a721e2fd1372b', 1, 'TrilinosWrappers::PreconditionBase::Tvmult(::LinearAlgebra::distributed::Vector< double > &dst, const ::LinearAlgebra::distributed::Vector< double > &src) const'],\n ['../classTrilinosWrappers_1_1PreconditionIdentity.html#ab7548060a6b9933741ac818bf3ab99aa', 1, 'TrilinosWrappers::PreconditionIdentity::Tvmult(MPI::Vector &dst, const MPI::Vector &src) const override'],\n ['../classTrilinosWrappers_1_1PreconditionIdentity.html#adf3d3edd2f02a806066ae2f5b8e278fa', 1, 'TrilinosWrappers::PreconditionIdentity::Tvmult(::Vector< double > &dst, const ::Vector< double > &src) const override'],\n ['../classTrilinosWrappers_1_1PreconditionIdentity.html#abd070924586d9521b90a561a20eb5a9d', 1, 'TrilinosWrappers::PreconditionIdentity::Tvmult(LinearAlgebra::distributed::Vector< double > &dst, const ::LinearAlgebra::distributed::Vector< double > &src) const override'],\n- ['../classLAPACKFullMatrix.html#a170934a03d4da208daa6f507575d758e', 1, 'LAPACKFullMatrix::Tvmult()'],\n+ ['../classPreconditionLU.html#a593bf3cc024de25bff252940847d9c15', 1, 'PreconditionLU::Tvmult()'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html#a37f966d6bdd5ae5004ddf2449b4672e4', 1, 'TrilinosWrappers::SparseMatrix::Tvmult()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1BlockSparseMatrix.html#a155d53d7f2b9d3f9c60e6b59e11a80a9', 1, 'LinearAlgebra::TpetraWrappers::BlockSparseMatrix::Tvmult()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1PreconditionBase.html#a1926f11386bab7d738e9d8f79d5bcf20', 1, 'LinearAlgebra::TpetraWrappers::PreconditionBase::Tvmult(Vector< Number, MemorySpace > &dst, const Vector< Number, MemorySpace > &src) const'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1PreconditionBase.html#ac1c72f7856df931794b0e92e3d1cd97f', 1, 'LinearAlgebra::TpetraWrappers::PreconditionBase::Tvmult(::Vector< Number > &dst, ::Vector< Number > &src) const'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#a4fbcb374d3eb320e857f941e8c2ffe31', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::Tvmult()'],\n ['../classMatrixFreeOperators_1_1Base.html#a3187eec4b078008f5a7d4c01b2ce2689', 1, 'MatrixFreeOperators::Base::Tvmult()'],\n ['../classMatrixFreeOperators_1_1MGInterfaceOperator.html#aa455960b915907fc34a0cffc390c3a41', 1, 'MatrixFreeOperators::MGInterfaceOperator::Tvmult()'],\n ['../classMGMatrixBase.html#ab35ecf735eb2e381cd360b42ee50096c', 1, 'MGMatrixBase::Tvmult()'],\n ['../classmg_1_1Matrix.html#a57d2635554ae03eecfafd69eba39ba27', 1, 'mg::Matrix::Tvmult()'],\n ['../classMGMatrixSelect.html#a40ba92768d46011b5091ed256ce71000', 1, 'MGMatrixSelect::Tvmult()'],\n ['../classPreconditionMG.html#a17e1edd6247186c21f514fbca8fac678', 1, 'PreconditionMG::Tvmult()'],\n ['../classSparseDirectUMFPACK.html#a0988c7a7119f7d1edb6fbfe0936e0c25', 1, 'SparseDirectUMFPACK::Tvmult()'],\n- ['../classPreconditionLU.html#a593bf3cc024de25bff252940847d9c15', 1, 'PreconditionLU::Tvmult(Vector< number > &, const Vector< number > &) const'],\n- ['../classPreconditionLU.html#ad73d67958d9a30a33e7ca7da3d8ae9b9', 1, 'PreconditionLU::Tvmult(BlockVector< number > &, const BlockVector< number > &) const'],\n+ ['../classLAPACKFullMatrix.html#a170934a03d4da208daa6f507575d758e', 1, 'LAPACKFullMatrix::Tvmult()'],\n+ ['../classPreconditionLU.html#ad73d67958d9a30a33e7ca7da3d8ae9b9', 1, 'PreconditionLU::Tvmult()'],\n ['../classMatrixBlock.html#a867b40603aa607580bf854d5275c6c9a', 1, 'MatrixBlock::Tvmult()'],\n- ['../classPETScWrappers_1_1MPI_1_1BlockSparseMatrix.html#a1025b10f63c69f3e9b9ad7738e37c55b', 1, 'PETScWrappers::MPI::BlockSparseMatrix::Tvmult(BlockVector &dst, const BlockVector &src) const'],\n+ ['../classPETScWrappers_1_1MPI_1_1BlockSparseMatrix.html#a1025b10f63c69f3e9b9ad7738e37c55b', 1, 'PETScWrappers::MPI::BlockSparseMatrix::Tvmult()'],\n+ ['../classSparseILU.html#a12f8c19ec0f5e1f85bc49b992683c0bb', 1, 'SparseILU::Tvmult()'],\n ['../classPETScWrappers_1_1MPI_1_1BlockSparseMatrix.html#a7ed644062e23218a84153ab9bf653e77', 1, 'PETScWrappers::MPI::BlockSparseMatrix::Tvmult(BlockVector &dst, const Vector &src) const'],\n ['../classPETScWrappers_1_1MPI_1_1BlockSparseMatrix.html#ab11e1a578c61c0ef58457951a0d3eb9d', 1, 'PETScWrappers::MPI::BlockSparseMatrix::Tvmult(Vector &dst, const BlockVector &src) const'],\n ['../classPETScWrappers_1_1MPI_1_1BlockSparseMatrix.html#acb4b4f5d0655d6603ddc0a9e4b466543', 1, 'PETScWrappers::MPI::BlockSparseMatrix::Tvmult(Vector &dst, const Vector &src) const'],\n ['../classPETScWrappers_1_1MatrixBase.html#aa53f7571665e69020dd5c1c90cf2e04d', 1, 'PETScWrappers::MatrixBase::Tvmult()'],\n ['../classPETScWrappers_1_1MatrixFree.html#a28a709fbc0734a52dc086850c90c1784', 1, 'PETScWrappers::MatrixFree::Tvmult()'],\n ['../classPETScWrappers_1_1PreconditionBase.html#a002abaad5d84e0a24db540b91a726f41', 1, 'PETScWrappers::PreconditionBase::Tvmult()'],\n ['../classPreconditionIdentity.html#ae9f020a4443253aaf2837804ba6d297b', 1, 'PreconditionIdentity::Tvmult()'],\n ['../classPreconditionRelaxation.html#a1e57277b6e16b396340ab4e7a2c78767', 1, 'PreconditionRelaxation::Tvmult()'],\n- ['../classSparseILU.html#a12f8c19ec0f5e1f85bc49b992683c0bb', 1, 'SparseILU::Tvmult()'],\n ['../classSparseDirectUMFPACK.html#a35891c5581473707d1cbc360ae67b89d', 1, 'SparseDirectUMFPACK::Tvmult()'],\n ['../classRelaxationBlockSSOR.html#a49f43405174199ad1402915134be5b35', 1, 'RelaxationBlockSSOR::Tvmult()'],\n ['../classRelaxationBlockSOR.html#a30a5ac020f04f5b82fcf035733ac48ed', 1, 'RelaxationBlockSOR::Tvmult()'],\n- ['../classPreconditionRichardson.html#abf6eaea08792c0992474c51447504f5a', 1, 'PreconditionRichardson::Tvmult()'],\n ['../classRelaxationBlockJacobi.html#ac1b35cf5a842c710feb60757b154cdd4', 1, 'RelaxationBlockJacobi::Tvmult()'],\n ['../classPreconditionSelector.html#a15a25b01762b498ff1386013840cf996', 1, 'PreconditionSelector::Tvmult()'],\n ['../classPreconditionBlockSSOR.html#ab64fd7a616f0771b693975d22c6db1cb', 1, 'PreconditionBlockSSOR::Tvmult()'],\n ['../classPreconditionBlockSOR.html#ab30eef85edd3d7684ff8fd4cc958ad98', 1, 'PreconditionBlockSOR::Tvmult()'],\n ['../classPreconditionBlockJacobi.html#a78a18bbf71d9f9d04d5171bdf858a131', 1, 'PreconditionBlockJacobi::Tvmult()'],\n- ['../classPreconditionChebyshev.html#a11bfb1160c35429d7ed3bb3ccca1c281', 1, 'PreconditionChebyshev::Tvmult()']\n+ ['../classPreconditionChebyshev.html#a11bfb1160c35429d7ed3bb3ccca1c281', 1, 'PreconditionChebyshev::Tvmult()'],\n+ ['../classPreconditionRichardson.html#abf6eaea08792c0992474c51447504f5a', 1, 'PreconditionRichardson::Tvmult()']\n ]],\n- ['tvmult_5fadd_732', ['tvmult_add', ['../classFullMatrix.html#abed6fffa5cb201496d751a4427cb59d6', 1, 'FullMatrix::Tvmult_add()'],\n- ['../classIdentityMatrix.html#af0fd06815919616aee83da0e68f43d49', 1, 'IdentityMatrix::Tvmult_add()'],\n+ ['tvmult_5fadd_732', ['tvmult_add', ['../classIdentityMatrix.html#af0fd06815919616aee83da0e68f43d49', 1, 'IdentityMatrix::Tvmult_add()'],\n ['../classLAPACKFullMatrix.html#ac91b909d2d10fb50e18022dc86d7c61b', 1, 'LAPACKFullMatrix::Tvmult_add(Vector< number2 > &w, const Vector< number2 > &v) const'],\n ['../classLAPACKFullMatrix.html#afcee505e084838936eb0d6694988b6e5', 1, 'LAPACKFullMatrix::Tvmult_add(Vector< number > &w, const Vector< number > &v) const'],\n+ ['../classFullMatrix.html#abed6fffa5cb201496d751a4427cb59d6', 1, 'FullMatrix::Tvmult_add()'],\n ['../classMatrixBlock.html#a3d72bab49d6b379b013533e403a4a3ec', 1, 'MatrixBlock::Tvmult_add()'],\n ['../classPETScWrappers_1_1MatrixBase.html#a714cb0c98ae635dd7591b40192dc9240', 1, 'PETScWrappers::MatrixBase::Tvmult_add()'],\n ['../classPETScWrappers_1_1MatrixFree.html#ad8eecd7c35f946aaf5456fe82356d5f9', 1, 'PETScWrappers::MatrixFree::Tvmult_add()'],\n- ['../classDiagonalMatrix.html#a39ca09eb44845a804349dd50283033ea', 1, 'DiagonalMatrix::Tvmult_add()'],\n ['../classPreconditionIdentity.html#af40bbb4672a057009b058cdc9dfb2e65', 1, 'PreconditionIdentity::Tvmult_add()'],\n ['../classPreconditionRichardson.html#ac4c08bc5df6bf0f37d3d629aa0324bf8', 1, 'PreconditionRichardson::Tvmult_add()'],\n ['../classPreconditionBlockJacobi.html#a9f729b944df0654976aad6ff9383fc2f', 1, 'PreconditionBlockJacobi::Tvmult_add()'],\n ['../classPreconditionBlockSOR.html#aef91d7c629e8f8ac9d8663a605240af2', 1, 'PreconditionBlockSOR::Tvmult_add()'],\n- ['../classPreconditionMG.html#ab39442b6b6af481fc24878f9f1d7377e', 1, 'PreconditionMG::Tvmult_add()'],\n ['../classSparseLUDecomposition.html#a6ab34f131cd580d739a30eab32bba6a9', 1, 'SparseLUDecomposition::Tvmult_add()'],\n+ ['../classSparseMatrix.html#ae58727ce898d97c486b3bc1ec4826a0b', 1, 'SparseMatrix::Tvmult_add()'],\n+ ['../classPreconditionMG.html#ab39442b6b6af481fc24878f9f1d7377e', 1, 'PreconditionMG::Tvmult_add()'],\n ['../classMGMatrixSelect.html#af25b39e2dd3a5bbef4b410ce63507326', 1, 'MGMatrixSelect::Tvmult_add()'],\n+ ['../classTridiagonalMatrix.html#a109ab6cd883483ecc7aa022e6b1f4218', 1, 'TridiagonalMatrix::Tvmult_add()'],\n ['../classmg_1_1Matrix.html#a9ceb53d965ed66562a3a4e32671d53ab', 1, 'mg::Matrix::Tvmult_add()'],\n ['../classMGMatrixBase.html#ac85646b75287bb3343deff05ff127303', 1, 'MGMatrixBase::Tvmult_add()'],\n ['../classMatrixFreeOperators_1_1Base.html#a116ea5a71579c73717e30ed2305cdc53', 1, 'MatrixFreeOperators::Base::Tvmult_add()'],\n ['../classLinearAlgebra_1_1TpetraWrappers_1_1SparseMatrix.html#acb3d91d3af0665b7847217316d1a9847', 1, 'LinearAlgebra::TpetraWrappers::SparseMatrix::Tvmult_add()'],\n ['../classTrilinosWrappers_1_1SparseMatrix.html#a849653e0230720b0f0ab58591974c0f2', 1, 'TrilinosWrappers::SparseMatrix::Tvmult_add()'],\n- ['../classTridiagonalMatrix.html#a109ab6cd883483ecc7aa022e6b1f4218', 1, 'TridiagonalMatrix::Tvmult_add()'],\n ['../classSparseMatrixEZ.html#a2604963df46206e988ce4a573c87a00e', 1, 'SparseMatrixEZ::Tvmult_add()'],\n- ['../classSparseMatrix.html#ae58727ce898d97c486b3bc1ec4826a0b', 1, 'SparseMatrix::Tvmult_add()'],\n+ ['../classDiagonalMatrix.html#a39ca09eb44845a804349dd50283033ea', 1, 'DiagonalMatrix::Tvmult_add()'],\n ['../classLinearOperator.html#ad36a8841e61b3dbea54cf3745e56c140', 1, 'LinearOperator::Tvmult_add'],\n ['../classCUDAWrappers_1_1SparseMatrix.html#a27473454cf7a1d2e949f96499bdaf636', 1, 'CUDAWrappers::SparseMatrix::Tvmult_add()'],\n ['../classChunkSparseMatrix.html#ab048e4226ca71b562cec4615f5b281cc', 1, 'ChunkSparseMatrix::Tvmult_add()'],\n ['../classBlockSparseMatrixEZ.html#a5f961859f7b186463c0dc705e239ce0c', 1, 'BlockSparseMatrixEZ::Tvmult_add()'],\n ['../classBlockMatrixBase.html#a657f2265bcb165f5b9016787d62c8d1a', 1, 'BlockMatrixBase::Tvmult_add(BlockVectorType &dst, const BlockVectorType &src) const']\n ]],\n ['tvmult_5fblock_5fblock_733', ['Tvmult_block_block', ['../classBlockMatrixBase.html#a1b5e896a6aadc0f6663ca4bfd69e8e73', 1, 'BlockMatrixBase']]],\n@@ -1670,17 +1670,17 @@\n ['../structinternal_1_1ProductTypeImpl_3_01adub_00_01double_01_4.html#aa63ea6f2b3b01d1fe16f2095d169f8a9', 1, 'internal::ProductTypeImpl< adub, double >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01double_00_01adub_01_4.html#a3859b5b04314487f1ea3fd3a9b221140', 1, 'internal::ProductTypeImpl< double, adub >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01adouble_00_01double_01_4.html#a08cd8a0f15040b13b3adf37c1f3171cd', 1, 'internal::ProductTypeImpl< adouble, double >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01double_00_01adouble_01_4.html#a9ee069595391aaa7c6a9a7920f44fb5d', 1, 'internal::ProductTypeImpl< double, adouble >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01adouble_00_01adub_01_4.html#a23c41dbf7cdff59e7c949fda6a5c7baf', 1, 'internal::ProductTypeImpl< adouble, adub >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01adub_00_01adouble_01_4.html#a978e93c14b0ce5155c9b9b11c1d2b298', 1, 'internal::ProductTypeImpl< adub, adouble >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01adouble_00_01adouble_01_4.html#a868d55da3d2fd7fd906f975e0cc8b23f', 1, 'internal::ProductTypeImpl< adouble, adouble >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01float_00_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_01_4.html#ab1d81c4602554cf0ac87db5ed7ff37fe', 1, 'internal::ProductTypeImpl< float, Sacado::Fad::DFad< T > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_00_01double_01_4.html#ad7bca6adf2bba7991db2eb51792e442a', 1, 'internal::ProductTypeImpl< Sacado::Fad::DFad< T >, double >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01adtl_1_1adouble_00_01float_01_4.html#a02b909dee208f21752de6e72b18154fa', 1, 'internal::ProductTypeImpl< adtl::adouble, float >::type'],\n- ['../structinternal_1_1TriaAccessorImplementation_1_1PresentLevelType_1_1type.html', 1, 'internal::TriaAccessorImplementation::PresentLevelType< structdim, dim >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01float_00_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_01_4.html#ab1d81c4602554cf0ac87db5ed7ff37fe', 1, 'internal::ProductTypeImpl< float, Sacado::Fad::DFad< T > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_00_01float_01_4.html#a7764d608905ebed130e54ec3eee96c7b', 1, 'internal::ProductTypeImpl< Sacado::Fad::DFad< T >, float >::type'],\n ['../structEnableIfScalar_3_01std_1_1complex_3_01adtl_1_1adouble_01_4_01_4.html#ae9b19dadf1124b366f064af4ccb74adf', 1, 'EnableIfScalar< std::complex< adtl::adouble > >::type'],\n ['../structEnableIfScalar_3_01adtl_1_1adouble_01_4.html#acfe26a7ce5afc7983fe5b67a6b277eee', 1, 'EnableIfScalar< adtl::adouble >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01std_1_1complex_3_01adtl_1_1adouble_01_4_00_01std_1_1complex_3_01float_01_4_01_4.html#a39ffe7987b59b5d7baeb7232bfea3922', 1, 'internal::ProductTypeImpl< std::complex< adtl::adouble >, std::complex< float > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01std_1_1complex_3_01float_01_4_00_01std_1_1complex_3_01adtl_1_1adouble_01_4_01_4.html#a1d8fa12528ec16886d755f4df0924687', 1, 'internal::ProductTypeImpl< std::complex< float >, std::complex< adtl::adouble > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01std_1_1complex_3_01adtl_1_1adouble_01_4_00_01std_1_1complex_3_01adtl_1_1adouble_01_4_01_4.html#aff68c59be3f0f910f6ccd769ebc76dfa', 1, 'internal::ProductTypeImpl< std::complex< adtl::adouble >, std::complex< adtl::adouble > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01std_1_1complex_3_01adtl_1_1adouble_01_4_00_01std_1_1complex_3_01double_01_4_01_4.html#a17997f54bff3eaaca55a5ee77d0ba105', 1, 'internal::ProductTypeImpl< std::complex< adtl::adouble >, std::complex< double > >::type'],\n@@ -1729,21 +1729,21 @@\n ['../structTensorAccessors_1_1internal_1_1ReferenceType.html#a673775877e451f86a37dd6d009899c66', 1, 'TensorAccessors::internal::ReferenceType::type'],\n ['../structEnableIfScalar_3_01std_1_1complex_3_01T_01_4_01_4.html#af81fc2daccb72695624e0add4d71d387', 1, 'EnableIfScalar< std::complex< T > >::type'],\n ['../structEnableIfScalar_3_01unsigned_01int_01_4.html#a6dc40b8d85bd9fa200962337205bfb80', 1, 'EnableIfScalar< unsigned int >::type'],\n ['../structEnableIfScalar_3_01int_01_4.html#adf7f549d5778a65ffe39acd6295f9643', 1, 'EnableIfScalar< int >::type'],\n ['../structEnableIfScalar_3_01long_01double_01_4.html#aab3d90136e68768ea7fb151ec7baa91f', 1, 'EnableIfScalar< long double >::type'],\n ['../structEnableIfScalar_3_01float_01_4.html#a6ef2e8615fef7dc748124fc0867a2669', 1, 'EnableIfScalar< float >::type'],\n ['../structinternal_1_1FEValuesViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1SymmetricTensor_3_01rank_01_4_01_4.html#a49fb75befd199e88b7f9d3af4e806ec0', 1, 'internal::FEValuesViews::ViewType< dim, spacedim, FEValuesExtractors::SymmetricTensor< rank > >::type'],\n- ['../structinternal_1_1SD_1_1GeneralProductTypeImpl_3_01T_00_01Differentiation_1_1SD_1_1Expression_00370b4ac1364c00b7550560ac15d1e107.html#a5cd0dcd8871f5cb82aee6c17f1e37e00', 1, 'internal::SD::GeneralProductTypeImpl< T, Differentiation::SD::Expression, std::enable_if_t< boost::is_complex< T >::value &&std::is_arithmetic_v< typename T::value_type > > >::type'],\n ['../structinternal_1_1SD_1_1GeneralProductTypeImpl_3_01Tensor_3_01rank_00_01dim_00_01T_01_4_00_01Dif803e851d3b456abf80aaaf2d18a83276.html#a3d31723c959e36ef916d5ccff0d9dfd3', 1, 'internal::SD::GeneralProductTypeImpl< Tensor< rank, dim, T >, Differentiation::SD::Expression >::type'],\n ['../structinternal_1_1SD_1_1GeneralProductTypeImpl_3_01SymmetricTensor_3_01rank_00_01dim_00_01T_01_467aa97ef8bc398049cf523195bbd2a0b.html#a5681db133683a0a29adc4fbcedbe3400', 1, 'internal::SD::GeneralProductTypeImpl< SymmetricTensor< rank, dim, T >, Differentiation::SD::Expression >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Differentiation_1_1SD_1_1Expression_00_01Differentiation_1_1SD_1_1Expression_01_4.html#a5c6f9d1cbc06e47764669d0b7a720aae', 1, 'internal::ProductTypeImpl< Differentiation::SD::Expression, Differentiation::SD::Expression >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01T_00_01Differentiation_1_1SD_1_1Expression_01_4.html#ac163c98e27e284494f78bbba7e4f5cc6', 1, 'internal::ProductTypeImpl< T, Differentiation::SD::Expression >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Differentiation_1_1SD_1_1Expression_00_01T_01_4.html#a4e3906354024c9624e8b5a45bd1474bb', 1, 'internal::ProductTypeImpl< Differentiation::SD::Expression, T >::type'],\n ['../structinternal_1_1FEInterfaceViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1Scalar_01_4.html#af22ec308ef4e1c203096f1f72544e11a', 1, 'internal::FEInterfaceViews::ViewType< dim, spacedim, FEValuesExtractors::Scalar >::type'],\n+ ['../structinternal_1_1TriaAccessorImplementation_1_1PresentLevelType_1_1type.html', 1, 'internal::TriaAccessorImplementation::PresentLevelType< structdim, dim >::type'],\n ['../structinternal_1_1FEInterfaceViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1Vector_01_4.html#a20a52fd2c4c46705788dd8911951c57b', 1, 'internal::FEInterfaceViews::ViewType< dim, spacedim, FEValuesExtractors::Vector >::type'],\n ['../structinternal_1_1CurlType_3_011_00_01NumberType_01_4.html#a9d78b5f9297d2013e0533a678d35ab79', 1, 'internal::CurlType< 1, NumberType >::type'],\n ['../structinternal_1_1CurlType_3_012_00_01NumberType_01_4.html#ace2c7da20d2afc0649b12de663476298', 1, 'internal::CurlType< 2, NumberType >::type'],\n ['../structinternal_1_1CurlType_3_013_00_01NumberType_01_4.html#a7a7e23dcbebac5ce58afe9117ef3aa05', 1, 'internal::CurlType< 3, NumberType >::type'],\n ['../structinternal_1_1FEValuesViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1Scalar_01_4.html#a2e94262573431362a0cd8aa81bae4a35', 1, 'internal::FEValuesViews::ViewType< dim, spacedim, FEValuesExtractors::Scalar >::type'],\n ['../structinternal_1_1FEValuesViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1Vector_01_4.html#ad255b03400b095f99671c37525d5d59d', 1, 'internal::FEValuesViews::ViewType< dim, spacedim, FEValuesExtractors::Vector >::type'],\n ['../structinternal_1_1FEValuesViews_1_1ViewType_3_01dim_00_01spacedim_00_01FEValuesExtractors_1_1Tensor_3_01rank_01_4_01_4.html#a6d31c32cb77d58cef9907cb10c7ef84d', 1, 'internal::FEValuesViews::ViewType< dim, spacedim, FEValuesExtractors::Tensor< rank > >::type'],\n@@ -1758,70 +1758,70 @@\n ['../structinternal_1_1ProductTypeNoPoint_3_01Point_3_01dim_00_01Number_01_4_00_01Number2_01_4.html#af495a78a4974a7f49210192dbfa2a065', 1, 'internal::ProductTypeNoPoint< Point< dim, Number >, Number2 >::type'],\n ['../structMeshWorker_1_1internal_1_1CellIteratorBaseType.html#a370888e9017884978b09c58a2b5086e2', 1, 'MeshWorker::internal::CellIteratorBaseType::type'],\n ['../structMeshWorker_1_1internal_1_1CellIteratorBaseType_3_01IteratorOverIterators_3_01CellIteratorType_01_4_01_4.html#aef84c8b03d0cb4efad44ac0037011fe2', 1, 'MeshWorker::internal::CellIteratorBaseType< IteratorOverIterators< CellIteratorType > >::type'],\n ['../structMeshWorker_1_1internal_1_1CellIteratorBaseType_3_01FilteredIterator_3_01CellIteratorType_01_4_01_4.html#ab373fee2f43d3be85cdb8b69aa08750e', 1, 'MeshWorker::internal::CellIteratorBaseType< FilteredIterator< CellIteratorType > >::type'],\n ['../classMultipleParameterLoop_1_1Entry.html#a8d48d3255c3f0c458e0eb79f429ca489', 1, 'MultipleParameterLoop::Entry::type'],\n ['../structinternal_1_1TriaAccessorImplementation_1_1PresentLevelType_1_1type.html#a64d588cc73dc9290f32179814dc127cb', 1, 'internal::TriaAccessorImplementation::PresentLevelType::type::type()=default'],\n ['../structinternal_1_1TriaAccessorImplementation_1_1PresentLevelType_1_1type.html#a16d23ea4bbe32888a0fbe12dd65eb095', 1, 'internal::TriaAccessorImplementation::PresentLevelType::type::type(const int level)'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01int_01_4.html#a18fb9c04015cf5a6bee78b88e88e5909', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, int >::type'],\n ['../structinternal_1_1SD_1_1GeneralProductTypeImpl_3_01T_00_01Differentiation_1_1SD_1_1Expression_00e4af64fe8ae6710a80ec025170181438.html#acedd2d7231e1862b5fcfa065fe06bc93', 1, 'internal::SD::GeneralProductTypeImpl< T, Differentiation::SD::Expression, std::enable_if_t< std::is_arithmetic_v< T > > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_00_01double_01_4.html#ad7bca6adf2bba7991db2eb51792e442a', 1, 'internal::ProductTypeImpl< Sacado::Fad::DFad< T >, double >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_00_01int_01_4.html#aca26d73e89f693109f3c4279c8ebc7c0', 1, 'internal::ProductTypeImpl< Sacado::Fad::DFad< T >, int >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01int_00_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_01_4.html#a66f8b263992baa17c16e44e5133cf2b0', 1, 'internal::ProductTypeImpl< int, Sacado::Fad::DFad< T > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_00_01Sacado_1_1Fad_1_1DFad_3_01U_01_4_01_4.html#ad2a2969e441e09fca9ec207bc84efe0c', 1, 'internal::ProductTypeImpl< Sacado::Fad::DFad< T >, Sacado::Fad::DFad< U > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1Expr_3_01T_01_4_00_01U_01_4.html#ae136a12531dca33d5c61f8a244c1b374', 1, 'internal::ProductTypeImpl< Sacado::Fad::Expr< T >, U >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01T_00_01Sacado_1_1Fad_1_1Expr_3_01U_01_4_01_4.html#ac6677434865b29a5804e4d2ae5b96fa1', 1, 'internal::ProductTypeImpl< T, Sacado::Fad::Expr< U > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Fad_1_1Expr_3_01T_01_4_00_01Sacado_1_1Fad_1_1Expr_3_01U_01_4_01_4.html#a693638228ad1d8d4f0b24b9fc773ddb7', 1, 'internal::ProductTypeImpl< Sacado::Fad::Expr< T >, Sacado::Fad::Expr< U > >::type'],\n ['../structEnableIfScalar_3_01Sacado_1_1Fad_1_1DFad_3_01T_01_4_01_4.html#a7ed981748d78fdf483f9996c9b75dd26', 1, 'EnableIfScalar< Sacado::Fad::DFad< T > >::type'],\n ['../structEnableIfScalar_3_01Sacado_1_1Fad_1_1Expr_3_01T_01_4_01_4.html#a1879b9847bd37cdb31e83429f4022fea', 1, 'EnableIfScalar< Sacado::Fad::Expr< T > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01float_01_4.html#ae2474fc4a5fb82cc112db756c88a60b6', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, float >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01float_00_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_01_4.html#a3c7ddf472eab7b161f0d5afed08850d6', 1, 'internal::ProductTypeImpl< float, Sacado::Rad::ADvar< T > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01double_01_4.html#ad00cfe70014fbd05aa4088cf1911a921', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, double >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01double_00_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_01_4.html#a4a86cce85768327e22a4ece7e5f37211', 1, 'internal::ProductTypeImpl< double, Sacado::Rad::ADvar< T > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01int_01_4.html#a18fb9c04015cf5a6bee78b88e88e5909', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, int >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01int_00_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_01_4.html#a5cb036829735f56101c1ae4bba56fa98', 1, 'internal::ProductTypeImpl< int, Sacado::Rad::ADvar< T > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvar_3_01U_01_4_01_4.html#a2508fe2b981c255ddb31682d8b2b10bb', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, Sacado::Rad::ADvar< U > >::type'],\n ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01float_01_4.html#afca837f6acc120a5fbf403390ba4703f', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, float >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01float_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a14170576e1ce7788795091b9bc46d540', 1, 'internal::ProductTypeImpl< float, Sacado::Rad::ADvari< T > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01double_01_4.html#ab4b460f9dfdfee5b40d3b92d9318e4ab', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, double >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01double_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a952dd7b365d42f5ef4e1a7aa615d2485', 1, 'internal::ProductTypeImpl< double, Sacado::Rad::ADvari< T > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01int_01_4.html#af7e81d52abe5fbc4d48a5c820c057524', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, int >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01int_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a61f72b910e734356543b339e58186be8', 1, 'internal::ProductTypeImpl< int, Sacado::Rad::ADvari< T > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvari_3_01U_01_4_01_4.html#a9eeb796a6feb5381cd535881c49d0195', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, Sacado::Rad::ADvari< U > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvari_3_01U_01_4_01_4.html#a9cb6a28c6abf1a7a65aa48e0c67f8760', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, Sacado::Rad::ADvari< U > >::type'],\n- ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvar_3_01U_01_4_01_4.html#a5146d60d4852e5ae097cadbf265af295', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, Sacado::Rad::ADvar< U > >::type'],\n- ['../structEnableIfScalar_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_01_4.html#ac88d00518c05a7a64aae59d0f50f3393', 1, 'EnableIfScalar< Sacado::Rad::ADvar< T > >::type'],\n+ ['../structinternal_1_1SD_1_1GeneralProductTypeImpl_3_01T_00_01Differentiation_1_1SD_1_1Expression_00370b4ac1364c00b7550560ac15d1e107.html#a5cd0dcd8871f5cb82aee6c17f1e37e00', 1, 'internal::SD::GeneralProductTypeImpl< T, Differentiation::SD::Expression, std::enable_if_t< boost::is_complex< T >::value &&std::is_arithmetic_v< typename T::value_type > > >::type'],\n+ ['../structEnableIfScalar_3_01Differentiation_1_1SD_1_1Expression_01_4.html#a23170c90192fb9ebcb310a9e89ad7c08', 1, 'EnableIfScalar< Differentiation::SD::Expression >::type'],\n ['../structEnableIfScalar_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a269d435714b3313910656ed6ac60ce7a', 1, 'EnableIfScalar< Sacado::Rad::ADvari< T > >::type'],\n- ['../structEnableIfScalar_3_01Differentiation_1_1SD_1_1Expression_01_4.html#a23170c90192fb9ebcb310a9e89ad7c08', 1, 'EnableIfScalar< Differentiation::SD::Expression >::type']\n+ ['../structEnableIfScalar_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_01_4.html#ac88d00518c05a7a64aae59d0f50f3393', 1, 'EnableIfScalar< Sacado::Rad::ADvar< T > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvar_3_01U_01_4_01_4.html#a5146d60d4852e5ae097cadbf265af295', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, Sacado::Rad::ADvar< U > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvar_3_01U_01_4_01_4.html#a2508fe2b981c255ddb31682d8b2b10bb', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, Sacado::Rad::ADvar< U > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvar_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvari_3_01U_01_4_01_4.html#a9cb6a28c6abf1a7a65aa48e0c67f8760', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvar< T >, Sacado::Rad::ADvari< U > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01Sacado_1_1Rad_1_1ADvari_3_01U_01_4_01_4.html#a9eeb796a6feb5381cd535881c49d0195', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, Sacado::Rad::ADvari< U > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01int_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a61f72b910e734356543b339e58186be8', 1, 'internal::ProductTypeImpl< int, Sacado::Rad::ADvari< T > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01int_01_4.html#af7e81d52abe5fbc4d48a5c820c057524', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, int >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01double_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a952dd7b365d42f5ef4e1a7aa615d2485', 1, 'internal::ProductTypeImpl< double, Sacado::Rad::ADvari< T > >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_00_01double_01_4.html#ab4b460f9dfdfee5b40d3b92d9318e4ab', 1, 'internal::ProductTypeImpl< Sacado::Rad::ADvari< T >, double >::type'],\n+ ['../structinternal_1_1ProductTypeImpl_3_01float_00_01Sacado_1_1Rad_1_1ADvari_3_01T_01_4_01_4.html#a14170576e1ce7788795091b9bc46d540', 1, 'internal::ProductTypeImpl< float, Sacado::Rad::ADvari< T > >::type']\n ]],\n ['type_5fautomatic_738', ['type_automatic', ['../classDataOut__DoFData.html#a062005bfe37e877e1f44e1c3e8e6cb27a06a7819d088394bfea7a51fbba00f962', 1, 'DataOut_DoFData']]],\n ['type_5fcell_5fdata_739', ['type_cell_data', ['../classDataOut__DoFData.html#a062005bfe37e877e1f44e1c3e8e6cb27a1272225f0fb10683c921dbd9f3e45980', 1, 'DataOut_DoFData']]],\n ['type_5fcontiguous_5fc_740', ['Type_contiguous_c', ['../namespaceUtilities_1_1MPI_1_1LargeCount.html#ac796476ed11f1a1dc809fe2de071ee5d', 1, 'Utilities::MPI::LargeCount']]],\n ['type_5fdof_5fdata_741', ['type_dof_data', ['../classDataOut__DoFData.html#a062005bfe37e877e1f44e1c3e8e6cb27a346ed8834d890734537f4dd6dd016ef8', 1, 'DataOut_DoFData']]],\n ['type_5fidentity_742', ['type_identity', ['../structstd__cxx20_1_1type__identity.html', 1, 'std_cxx20']]],\n ['type_5fidentity_5ft_743', ['type_identity_t', ['../namespacestd__cxx20.html#ab049e9306467671be5ea7b82c890eb4f', 1, 'std_cxx20']]],\n- ['type_5fof_5fentity_744', ['type_of_entity', ['../structinternal_1_1TriangulationImplementation_1_1CellTypeBase.html#a82713de2f3ba1608cd2387fcb510879f', 1, 'internal::TriangulationImplementation::CellTypeBase::type_of_entity()'],\n- ['../structinternal_1_1TriangulationImplementation_1_1CellTypeHexahedron.html#a0e0eedf7b3598e7707f65930324c5039', 1, 'internal::TriangulationImplementation::CellTypeHexahedron::type_of_entity()'],\n- ['../structinternal_1_1TriangulationImplementation_1_1CellTypeWedge.html#a98da13f062e0e488c23d8d01574c6307', 1, 'internal::TriangulationImplementation::CellTypeWedge::type_of_entity()'],\n- ['../structinternal_1_1TriangulationImplementation_1_1CellTypeTetrahedron.html#aeb91d10cc2aff625130939df47c9241f', 1, 'internal::TriangulationImplementation::CellTypeTetrahedron::type_of_entity()'],\n- ['../structinternal_1_1TriangulationImplementation_1_1CellTypeLine.html#a9577d773ddcd0025b192f6b662561391', 1, 'internal::TriangulationImplementation::CellTypeLine::type_of_entity()'],\n+ ['type_5fof_5fentity_744', ['type_of_entity', ['../structinternal_1_1TriangulationImplementation_1_1CellTypeLine.html#a9577d773ddcd0025b192f6b662561391', 1, 'internal::TriangulationImplementation::CellTypeLine::type_of_entity()'],\n ['../structinternal_1_1TriangulationImplementation_1_1CellTypeTriangle.html#a57bac5efc11d72d1e0281c20b3fa313b', 1, 'internal::TriangulationImplementation::CellTypeTriangle::type_of_entity()'],\n ['../structinternal_1_1TriangulationImplementation_1_1CellTypeQuadrilateral.html#a05da70eec874b374ef4cee710b42fd71', 1, 'internal::TriangulationImplementation::CellTypeQuadrilateral::type_of_entity()'],\n- ['../structinternal_1_1TriangulationImplementation_1_1CellTypePyramid.html#aeca622c8a40f5de175d5dbaa11e1423b', 1, 'internal::TriangulationImplementation::CellTypePyramid::type_of_entity()']\n+ ['../structinternal_1_1TriangulationImplementation_1_1CellTypeTetrahedron.html#aeb91d10cc2aff625130939df47c9241f', 1, 'internal::TriangulationImplementation::CellTypeTetrahedron::type_of_entity()'],\n+ ['../structinternal_1_1TriangulationImplementation_1_1CellTypePyramid.html#aeca622c8a40f5de175d5dbaa11e1423b', 1, 'internal::TriangulationImplementation::CellTypePyramid::type_of_entity()'],\n+ ['../structinternal_1_1TriangulationImplementation_1_1CellTypeWedge.html#a98da13f062e0e488c23d8d01574c6307', 1, 'internal::TriangulationImplementation::CellTypeWedge::type_of_entity()'],\n+ ['../structinternal_1_1TriangulationImplementation_1_1CellTypeHexahedron.html#a0e0eedf7b3598e7707f65930324c5039', 1, 'internal::TriangulationImplementation::CellTypeHexahedron::type_of_entity()'],\n+ ['../structinternal_1_1TriangulationImplementation_1_1CellTypeBase.html#a82713de2f3ba1608cd2387fcb510879f', 1, 'internal::TriangulationImplementation::CellTypeBase::type_of_entity()']\n ]],\n ['type_5fto_5fstring_745', ['type_to_string', ['../namespaceUtilities.html#a1e7b53ed9c24a8dbec9f2305e908c5ff', 1, 'Utilities']]],\n- ['type_5ftraits_2eh_746', ['type_traits.h', ['../matrix__free_2type__traits_8h.html', 1, '(Global Namespace)'],\n- ['../base_2std__cxx20_2type__traits_8h.html', 1, '(Global Namespace)']\n+ ['type_5ftraits_2eh_746', ['type_traits.h', ['../base_2std__cxx20_2type__traits_8h.html', 1, '(Global Namespace)'],\n+ ['../matrix__free_2type__traits_8h.html', 1, '(Global Namespace)']\n ]],\n ['type_5fx_747', ['type_x', ['../classinternal_1_1HelperBase.html#ace02a24a846221099a1238bc9be39bee', 1, 'internal::HelperBase']]],\n ['type_5fy_748', ['type_y', ['../classinternal_1_1HelperBase.html#ad725bd70fe556b793797b4648e696344', 1, 'internal::HelperBase']]],\n ['type_5fz_749', ['type_z', ['../classinternal_1_1HelperBase.html#a517be47ba330812d9fe0bd7f88259d06', 1, 'internal::HelperBase']]],\n- ['types_750', ['types', ['../structinternal_1_1TableBaseAccessors_1_1Types.html', 1, 'internal::TableBaseAccessors::Types< N, T, Constness >'],\n- ['../structinternal_1_1p4est_1_1types.html', 1, 'internal::p4est::types< int >'],\n+ ['types_750', ['types', ['../namespacetypes.html', 1, 'types'],\n ['../structDifferentiation_1_1AD_1_1Types.html', 1, 'Differentiation::AD::Types< ADNumberType, T >'],\n- ['../namespacetypes.html', 1, 'types']\n+ ['../structinternal_1_1p4est_1_1types.html', 1, 'internal::p4est::types< int >'],\n+ ['../structinternal_1_1TableBaseAccessors_1_1Types.html', 1, 'internal::TableBaseAccessors::Types< N, T, Constness >']\n ]],\n ['types_2eh_751', ['types.h', ['../types_8h.html', 1, '']]],\n ['types_3a_3aglobal_5fdof_5findex_20instead_20of_20unsigned_20int_752', ['When to use types::global_dof_index instead of unsigned int', ['../GlobalDoFIndex.html', 1, '']]],\n ['types_3c_201_20_3e_753', ['types< 1 >', ['../structinternal_1_1p4est_1_1types_3_011_01_4.html', 1, 'internal::p4est']]],\n ['types_3c_202_20_3e_754', ['types< 2 >', ['../structinternal_1_1p4est_1_1types_3_012_01_4.html', 1, 'internal::p4est']]],\n ['types_3c_203_20_3e_755', ['types< 3 >', ['../structinternal_1_1p4est_1_1types_3_013_01_4.html', 1, 'internal::p4est']]],\n ['types_3c_20n_2c_20t_2c_20false_20_3e_756', ['Types< N, T, false >', ['../structinternal_1_1TableBaseAccessors_1_1Types_3_01N_00_01T_00_01false_01_4.html', 1, 'internal::TableBaseAccessors']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_d.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_d.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -701,16 +701,16 @@\n ['../structinternal_1_1TriangulationImplementation_1_1TriaObjects_1_1BoundaryOrMaterialId.html#a56c08d26369c65d862aa8e4cc2065289', 1, 'internal::TriangulationImplementation::TriaObjects::BoundaryOrMaterialId::BoundaryOrMaterialId()']\n ]],\n ['boundaryworkerfunctiontype_269', ['BoundaryWorkerFunctionType', ['../namespaceMeshWorker.html#a6e4b155e980747e8f5842cebcdded8fe', 1, 'MeshWorker']]],\n ['bounding_5fbox_270', ['bounding_box', ['../classFunctions_1_1SignedDistance_1_1Rectangle.html#ae38736c2a97534325fddec30309dd1f3', 1, 'Functions::SignedDistance::Rectangle::bounding_box'],\n ['../classTriaAccessor.html#a57453302997d9df8d1e242bf663dc11b', 1, 'TriaAccessor::bounding_box()']\n ]],\n ['bounding_5fbox_2ecc_271', ['bounding_box.cc', ['../bounding__box_8cc.html', 1, '']]],\n- ['bounding_5fbox_2eh_272', ['bounding_box.h', ['../base_2bounding__box_8h.html', 1, '(Global Namespace)'],\n- ['../boost__adaptors_2bounding__box_8h.html', 1, '(Global Namespace)']\n+ ['bounding_5fbox_2eh_272', ['bounding_box.h', ['../boost__adaptors_2bounding__box_8h.html', 1, '(Global Namespace)'],\n+ ['../base_2bounding__box_8h.html', 1, '(Global Namespace)']\n ]],\n ['bounding_5fbox_5fdata_5fout_2eh_273', ['bounding_box_data_out.h', ['../bounding__box__data__out_8h.html', 1, '']]],\n ['bounding_5fboxes_274', ['bounding_boxes', ['../classArborXWrappers_1_1BoundingBoxPredicate.html#ae9b40ffb97f53a142b961a72b1f80e52', 1, 'ArborXWrappers::BoundingBoxPredicate']]],\n ['boundingbox_275', ['boundingbox', ['../classBoundingBox_3_010_00_01Number_01_4.html#adcd25e9e0edf3645c296e1969d51a9ef', 1, 'BoundingBox< 0, Number >::BoundingBox()'],\n ['../classBoundingBox_3_010_00_01Number_01_4.html#a8ab5664ce0d7a6b3dceef749c1e47d1c', 1, 'BoundingBox< 0, Number >::BoundingBox(const std::pair< Point< 0, Number >, Point< 0, Number > > &)'],\n ['../classBoundingBox.html', 1, 'BoundingBox< spacedim, Number >'],\n ['../classBoundingBox.html#a680e15f8c18f320bd013f0a00ad2510d', 1, 'BoundingBox::BoundingBox(const Container &points)'],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -81,52 +81,52 @@\n ['case_5fy2x_34', ['case_y2x', ['../structinternal_1_1SubfacePossibilities_3_013_01_4.html#ac1af553c23407ad236e0a57d7b46c1baa396bb9fb8f6d361519819f23f8e0396e', 1, 'internal::SubfacePossibilities< 3 >']]],\n ['cash_5fkarp_35', ['CASH_KARP', ['../namespaceTimeStepping.html#abff97b5326e452552f108a379dd6cff4ab1d63829a0bd48bc67f35dae07d35a22', 1, 'TimeStepping']]],\n ['categorize_5fby_5fboundary_5fids_36', ['categorize_by_boundary_ids', ['../namespaceMatrixFreeTools.html#ae034b98c0db11285fae23a08ef3f197f', 1, 'MatrixFreeTools']]],\n ['cbegin_37', ['cbegin', ['../classArrayView.html#a97b07ec0bfaa77c5dec9061bfd28c60e', 1, 'ArrayView']]],\n ['cbrt_38', ['cbrt', ['../namespaceDifferentiation_1_1SD.html#a0a9eaf1827ea15d79f9cbad4e9e5425a', 1, 'Differentiation::SD']]],\n ['cdt_39', ['CDT', ['../namespaceCGALWrappers.html#a74d881116bd6c3027f395504b6c4102d', 1, 'CGALWrappers']]],\n ['ceil_40', ['ceil', ['../namespaceDifferentiation_1_1SD.html#a6545410ba18556ebf7c478b6ad9939f6', 1, 'Differentiation::SD']]],\n- ['cell_41', ['cell', ['../classQProjector_1_1DataSetDescriptor.html#a6d8f6e3e5908ad7cb6d5e8030a6c9b5f', 1, 'QProjector::DataSetDescriptor::cell()'],\n- ['../structinternal_1_1MFWorkerInterface.html#a3304d29619c35afa0ef7c710a5b37e19', 1, 'internal::MFWorkerInterface::cell(const std::pair< unsigned int, unsigned int > &cell_range)=0'],\n- ['../structinternal_1_1MFWorkerInterface.html#a89f9bbfe269df6a0f0d75f4e60f01c2b', 1, 'internal::MFWorkerInterface::cell(const unsigned int range_index)=0'],\n- ['../classMeshWorker_1_1LocalIntegrator.html#a44cc05e3e905a8cd5af4c12d3026ea2a', 1, 'MeshWorker::LocalIntegrator::cell()'],\n+ ['cell_41', ['cell', ['../structinternal_1_1MFWorkerInterface.html#a3304d29619c35afa0ef7c710a5b37e19', 1, 'internal::MFWorkerInterface::cell()'],\n+ ['../classQProjector_1_1DataSetDescriptor.html#a6d8f6e3e5908ad7cb6d5e8030a6c9b5f', 1, 'QProjector::DataSetDescriptor::cell()'],\n+ ['../structinternal_1_1MFWorkerInterface.html#a89f9bbfe269df6a0f0d75f4e60f01c2b', 1, 'internal::MFWorkerInterface::cell()'],\n+ ['../classFEEvaluationData.html#a82220588e241f3122e89dd85467b34a4', 1, 'FEEvaluationData::cell'],\n ['../structParticles_1_1ParticleAccessor_1_1ParticlesInCell.html#a612620c887aeb7fcad2e51b7c7899c32', 1, 'Particles::ParticleAccessor::ParticlesInCell::cell'],\n ['../structDataPostprocessorInputs_1_1CommonInputs.html#aa087bf70267c525ef35973d21436e6bf', 1, 'DataPostprocessorInputs::CommonInputs::cell'],\n- ['../structGridTools_1_1PeriodicFacePair.html#abab771b60503301261ae7f374e42e4f9', 1, 'GridTools::PeriodicFacePair::cell'],\n+ ['../classMeshWorker_1_1LocalIntegrator.html#a44cc05e3e905a8cd5af4c12d3026ea2a', 1, 'MeshWorker::LocalIntegrator::cell()'],\n ['../classMeshWorker_1_1DoFInfoBox.html#aaab129d3d5c0d065d3493fe05a080ef8', 1, 'MeshWorker::DoFInfoBox::cell'],\n- ['../classFEEvaluationData.html#a82220588e241f3122e89dd85467b34a4', 1, 'FEEvaluationData::cell'],\n+ ['../structGridTools_1_1PeriodicFacePair.html#abab771b60503301261ae7f374e42e4f9', 1, 'GridTools::PeriodicFacePair::cell'],\n ['../classMappingManifold_1_1InternalData.html#afd5901bdb90b529b2b82b1e8549ebb00', 1, 'MappingManifold::InternalData::cell'],\n ['../classFEValuesBase_1_1CellIteratorWrapper.html#a942e797d45b93c6d58507dcf2ca8cb70', 1, 'FEValuesBase::CellIteratorWrapper::cell'],\n- ['../classMeshWorker_1_1IntegrationInfoBox.html#a3bde8cb43c8838a642a3c7742c02fef0', 1, 'MeshWorker::IntegrationInfoBox::cell'],\n ['../classMeshWorker_1_1DoFInfo.html#afdcc49b1167a86ccc232e96b5cf0d2bd', 1, 'MeshWorker::DoFInfo::cell'],\n+ ['../classMeshWorker_1_1IntegrationInfoBox.html#a3bde8cb43c8838a642a3c7742c02fef0', 1, 'MeshWorker::IntegrationInfoBox::cell'],\n ['../group__mapping.html', 1, 'Mappings between reference and real cell']\n ]],\n ['cell_20orientation_42', ['Grid reordering and cell orientation', ['../group__reordering.html', 1, '']]],\n ['cell_5faccessor_43', ['cell_accessor', ['../group__Iterators.html#ga80b314b2fc3b2ebf9b70106678efb326', 1, 'DoFHandler']]],\n ['cell_5faction_44', ['cell_action', ['../group__MeshWorker.html#ga57d904254a3a2ab7a146f678a85cdc88', 1, 'MeshWorker']]],\n ['cell_5factive_5ffe_5findex_45', ['cell_active_fe_index', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#ac5cc9596bab9f3448bdd12bcdd39990e', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['cell_5fand_5fface_5fboundary_5fid_46', ['cell_and_face_boundary_id', ['../structinternal_1_1MatrixFreeFunctions_1_1FaceInfo.html#ad976c8625ab1898516e37a29ac2434c0', 1, 'internal::MatrixFreeFunctions::FaceInfo']]],\n ['cell_5fand_5fface_5fto_5fplain_5ffaces_47', ['cell_and_face_to_plain_faces', ['../structinternal_1_1MatrixFreeFunctions_1_1FaceInfo.html#a51271fd761289d55f122434c6c058d63', 1, 'internal::MatrixFreeFunctions::FaceInfo']]],\n ['cell_5fattached_5fdata_48', ['cell_attached_data', ['../classTriangulation.html#aa25806aabd371f96574bb6f083c5a63f', 1, 'Triangulation']]],\n ['cell_5fbounding_5fboxes_5frtree_49', ['cell_bounding_boxes_rtree', ['../classGridTools_1_1Cache.html#a750382c0f0ed758c42d1098199ea40c4', 1, 'GridTools::Cache']]],\n ['cell_5fbounding_5fboxes_5frtree_5fmutex_50', ['cell_bounding_boxes_rtree_mutex', ['../classGridTools_1_1Cache.html#a22b05d9349465de7e9eacf2eb9c0b9f5', 1, 'GridTools::Cache']]],\n ['cell_5fcoarsen_51', ['cell_coarsen', ['../classTriangulation.html#a81eae05e6ac01d78e5eee50929136565', 1, 'Triangulation::CELL_COARSEN'],\n ['../cell__status_8h.html#abb85aea14ecc7704be737d83fc60127ea36335b781286a0ba2b2c405a0aae0a54', 1, 'CELL_COARSEN: cell_status.h']\n ]],\n- ['cell_5fdata_52', ['cell_data', ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#a2916bd083ea7c5d98edf680983fbfb1e', 1, 'Utilities::MPI::RemotePointEvaluation::cell_data'],\n+ ['cell_5fdata_52', ['cell_data', ['../classDataOut__DoFData.html#a31bbb02ee5dcd6752232e76bdecaecd4', 1, 'DataOut_DoFData::cell_data'],\n+ ['../classDataOutStack.html#a473d0888923eec14988bd421cdcf74ff', 1, 'DataOutStack::cell_data'],\n ['../structinternal_1_1MatrixFreeFunctions_1_1MappingInfo.html#a8e855706c773b20f718b6bab02423112', 1, 'internal::MatrixFreeFunctions::MappingInfo::cell_data'],\n ['../classMeshWorker_1_1IntegrationInfoBox.html#a9879403d8b7ce1a73e8a0f8465092faa', 1, 'MeshWorker::IntegrationInfoBox::cell_data'],\n- ['../classDataOut__DoFData.html#a31bbb02ee5dcd6752232e76bdecaecd4', 1, 'DataOut_DoFData::cell_data'],\n- ['../classDataOutStack.html#a473d0888923eec14988bd421cdcf74ff', 1, 'DataOutStack::cell_data']\n+ ['../classUtilities_1_1MPI_1_1RemotePointEvaluation.html#a2916bd083ea7c5d98edf680983fbfb1e', 1, 'Utilities::MPI::RemotePointEvaluation::cell_data']\n ]],\n ['cell_5fdata_5ftransfer_53', ['cell_data_transfer', ['../classparallel_1_1distributed_1_1experimental_1_1FieldTransfer.html#a34cf1f8afd6916e61ca041e5b9422e1f', 1, 'parallel::distributed::experimental::FieldTransfer::cell_data_transfer'],\n ['../structDoFHandler_1_1ActiveFEIndexTransfer.html#aaac73401fec187b47bf44408285f27a5', 1, 'DoFHandler::ActiveFEIndexTransfer::cell_data_transfer']\n ]],\n- ['cell_5fdata_5ftransfer_2ecc_54', ['cell_data_transfer.cc', ['../distributed_2cell__data__transfer_8cc.html', 1, '(Global Namespace)'],\n- ['../numerics_2cell__data__transfer_8cc.html', 1, '(Global Namespace)']\n+ ['cell_5fdata_5ftransfer_2ecc_54', ['cell_data_transfer.cc', ['../numerics_2cell__data__transfer_8cc.html', 1, '(Global Namespace)'],\n+ ['../distributed_2cell__data__transfer_8cc.html', 1, '(Global Namespace)']\n ]],\n ['cell_5fdata_5ftransfer_2eh_55', ['cell_data_transfer.h', ['../distributed_2cell__data__transfer_8h.html', 1, '(Global Namespace)'],\n ['../numerics_2cell__data__transfer_8h.html', 1, '(Global Namespace)']\n ]],\n ['cell_5fdiameter_56', ['cell_diameter', ['../classKellyErrorEstimator.html#adc94d710b3db4967da1ea80bd7813a1eaf8f87cb31b00db990be93ff11809ea06', 1, 'KellyErrorEstimator::cell_diameter'],\n ['../classKellyErrorEstimator_3_011_00_01spacedim_01_4.html#a0e20493f777fe0299c7c163143702dbfa1c83afdb687d614cb72f76997e50febb', 1, 'KellyErrorEstimator< 1, spacedim >::cell_diameter']\n ]],\n@@ -183,22 +183,22 @@\n ['../group__CPP11.html#ga3a2430c530494b0a95e06c99b51691d4', 1, 'DoFHandler::cell_iterators_on_level()']\n ]],\n ['cell_5flevel_5fand_5findices_82', ['cell_level_and_indices', ['../classNonMatching_1_1MappingInfo.html#abe146facf2c7b41031f81f52bfea51d6', 1, 'NonMatching::MappingInfo']]],\n ['cell_5flevel_5findex_83', ['cell_level_index', ['../classMatrixFree.html#a6ccb8c2689c4029ccf44dacf47c4d224', 1, 'MatrixFree']]],\n ['cell_5flevel_5findex_5fend_5flocal_84', ['cell_level_index_end_local', ['../classMatrixFree.html#aebd8b73ecd3843be97bc6c62a91550e8', 1, 'MatrixFree']]],\n ['cell_5flist_5ffine_5fto_5fcoarse_85', ['cell_list_fine_to_coarse', ['../structMGTwoLevelTransfer_1_1MatrixFreeRelatedData.html#a1178d601283f9057e51e8b52e1363c3a', 1, 'MGTwoLevelTransfer::MatrixFreeRelatedData']]],\n ['cell_5flocations_86', ['cell_locations', ['../classNonMatching_1_1MeshClassifier.html#ad0ea17c7428187c1cdc675c915f81775', 1, 'NonMatching::MeshClassifier']]],\n- ['cell_5floop_87', ['cell_loop', ['../classMatrixFree.html#abc204ec41ead1b5060f47ef3a5a066d7', 1, 'MatrixFree::cell_loop()'],\n- ['../classMatrixFreeTools_1_1ElementActivationAndDeactivationMatrixFree.html#a5f20bf9fc143c27d6e726e29406196a0', 1, 'MatrixFreeTools::ElementActivationAndDeactivationMatrixFree::cell_loop()'],\n+ ['cell_5floop_87', ['cell_loop', ['../classMatrixFreeTools_1_1ElementActivationAndDeactivationMatrixFree.html#a5f20bf9fc143c27d6e726e29406196a0', 1, 'MatrixFreeTools::ElementActivationAndDeactivationMatrixFree::cell_loop()'],\n ['../classPortable_1_1MatrixFree.html#afdd78bad98bf5deecc7ddb96f48c39a9', 1, 'Portable::MatrixFree::cell_loop()'],\n ['../classMatrixFree.html#a2c3b0bd3cad76dc2e3957f205c6138ac', 1, 'MatrixFree::cell_loop(const std::function< void(const MatrixFree< dim, Number, VectorizedArrayType > &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &)> &cell_operation, OutVector &dst, const InVector &src, const std::function< void(const unsigned int, const unsigned int)> &operation_before_loop, const std::function< void(const unsigned int, const unsigned int)> &operation_after_loop, const unsigned int dof_handler_index_pre_post=0) const'],\n ['../classMatrixFree.html#a4299fd60761d1be3cc6461d72c265577', 1, 'MatrixFree::cell_loop(void(CLASS::*cell_operation)(const MatrixFree &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &), CLASS *owning_class, OutVector &dst, const InVector &src, const std::function< void(const unsigned int, const unsigned int)> &operation_before_loop, const std::function< void(const unsigned int, const unsigned int)> &operation_after_loop, const unsigned int dof_handler_index_pre_post=0) const'],\n ['../classMatrixFree.html#a6a53b93080a15c49d5513f09fc6bbb5d', 1, 'MatrixFree::cell_loop(void(CLASS::*cell_operation)(const MatrixFree &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &) const, const CLASS *owning_class, OutVector &dst, const InVector &src, const std::function< void(const unsigned int, const unsigned int)> &operation_before_loop, const std::function< void(const unsigned int, const unsigned int)> &operation_after_loop, const unsigned int dof_handler_index_pre_post=0) const'],\n ['../classMatrixFree.html#aca4e2ec1389ae3f7abd7c0552f782f47', 1, 'MatrixFree::cell_loop(void(CLASS::*cell_operation)(const MatrixFree &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &), CLASS *owning_class, OutVector &dst, const InVector &src, const bool zero_dst_vector=false) const'],\n- ['../classMatrixFree.html#aaa941c80d60b2cd987660d2d04587fde', 1, 'MatrixFree::cell_loop(void(CLASS::*cell_operation)(const MatrixFree &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &) const, const CLASS *owning_class, OutVector &dst, const InVector &src, const bool zero_dst_vector=false) const']\n+ ['../classMatrixFree.html#aaa941c80d60b2cd987660d2d04587fde', 1, 'MatrixFree::cell_loop(void(CLASS::*cell_operation)(const MatrixFree &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &) const, const CLASS *owning_class, OutVector &dst, const InVector &src, const bool zero_dst_vector=false) const'],\n+ ['../classMatrixFree.html#abc204ec41ead1b5060f47ef3a5a066d7', 1, 'MatrixFree::cell_loop(const std::function< void(const MatrixFree< dim, Number, VectorizedArrayType > &, OutVector &, const InVector &, const std::pair< unsigned int, unsigned int > &)> &cell_operation, OutVector &dst, const InVector &src, const bool zero_dst_vector=false) const']\n ]],\n ['cell_5floop_5fpost_5flist_88', ['cell_loop_post_list', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#aef140efba60e6dc942773cef26a2ba9c', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['cell_5floop_5fpost_5flist_5findex_89', ['cell_loop_post_list_index', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#a3fab8413e642935ee3ce156d3d3c3fda', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['cell_5floop_5fpost_5frange_90', ['cell_loop_post_range', ['../structinternal_1_1MFWorkerInterface.html#aba160091d94b4ac79b642c0c7ef59d05', 1, 'internal::MFWorkerInterface']]],\n ['cell_5floop_5fpre_5flist_91', ['cell_loop_pre_list', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#a9deb9c267367115ebfe5d1547c7c9a48', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['cell_5floop_5fpre_5flist_5findex_92', ['cell_loop_pre_list_index', ['../structinternal_1_1MatrixFreeFunctions_1_1DoFInfo.html#a1092964dc10c70fccce05d6bf65519a2', 1, 'internal::MatrixFreeFunctions::DoFInfo']]],\n ['cell_5floop_5fpre_5frange_93', ['cell_loop_pre_range', ['../structinternal_1_1MFWorkerInterface.html#ade9e89eca19967c9d4ca1957de8c17b1', 1, 'internal::MFWorkerInterface']]],\n@@ -237,18 +237,18 @@\n ['cell_5frelation_5ft_113', ['cell_relation_t', ['../classinternal_1_1CellAttachedDataSerializer.html#aa531ca6c6617b67582dd37a72cd12fe1', 1, 'internal::CellAttachedDataSerializer']]],\n ['cell_5fresidual_114', ['cell_residual', ['../namespaceLocalIntegrators_1_1Advection.html#a5f7393cd1f4fe91ee442fd2ccb58be5e', 1, 'LocalIntegrators::Advection::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const std::vector< Tensor< 1, dim > > &input, const ArrayView< const std::vector< double > > &velocity, double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Advection.html#aaf120ce8c9ad13322ed2fd0f9363ed8b', 1, 'LocalIntegrators::Advection::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const ArrayView< const std::vector< Tensor< 1, dim > > > &input, const ArrayView< const std::vector< double > > &velocity, double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Advection.html#a9f2fafd590896b15015ba618008b9548', 1, 'LocalIntegrators::Advection::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const std::vector< double > &input, const ArrayView< const std::vector< double > > &velocity, double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Advection.html#aaf40de8a47585f48c6412eba8cd70917', 1, 'LocalIntegrators::Advection::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const ArrayView< const std::vector< double > > &input, const ArrayView< const std::vector< double > > &velocity, double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Laplace.html#a6da749467ed6443db391e0ea04fc3c86', 1, 'LocalIntegrators::Laplace::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const ArrayView< const std::vector< Tensor< 1, dim > > > &input, double factor=1.)'],\n ['../namespaceLocalIntegrators_1_1Laplace.html#a5bc806068f4368accf96817045aed45d', 1, 'LocalIntegrators::Laplace::cell_residual(Vector< double > &result, const FEValuesBase< dim > &fe, const std::vector< Tensor< 1, dim > > &input, double factor=1.)'],\n+ ['../namespaceLocalIntegrators_1_1Divergence.html#a20e3c827089a0174daeef8822ed05c41', 1, 'LocalIntegrators::Divergence::cell_residual()'],\n ['../namespaceLocalIntegrators_1_1GradDiv.html#abfa14733a95cc9779fe755316b769155', 1, 'LocalIntegrators::GradDiv::cell_residual()'],\n- ['../namespaceLocalIntegrators_1_1Elasticity.html#aab493bec18a2411d71857d5017f8918a', 1, 'LocalIntegrators::Elasticity::cell_residual()'],\n- ['../namespaceLocalIntegrators_1_1Divergence.html#a20e3c827089a0174daeef8822ed05c41', 1, 'LocalIntegrators::Divergence::cell_residual(Vector< number > &result, const FEValuesBase< dim > &fetest, const ArrayView< const std::vector< Tensor< 1, dim > > > &input, const double factor=1.)'],\n- ['../namespaceLocalIntegrators_1_1Divergence.html#af91d14d4c52320c9844d0fab6f45dd05', 1, 'LocalIntegrators::Divergence::cell_residual(Vector< number > &result, const FEValuesBase< dim > &fetest, const ArrayView< const std::vector< double > > &input, const double factor=1.)']\n+ ['../namespaceLocalIntegrators_1_1Divergence.html#af91d14d4c52320c9844d0fab6f45dd05', 1, 'LocalIntegrators::Divergence::cell_residual()'],\n+ ['../namespaceLocalIntegrators_1_1Elasticity.html#aab493bec18a2411d71857d5017f8918a', 1, 'LocalIntegrators::Elasticity::cell_residual()']\n ]],\n ['cell_5fselector_115', ['cell_selector', ['../classMeshWorker_1_1IntegrationInfoBox.html#ac2d837236f8a481331a3b5fb9f28898d', 1, 'MeshWorker::IntegrationInfoBox']]],\n ['cell_5fsimilarity_116', ['cell_similarity', ['../classFEValuesBase.html#a096d4ea9edea6618e23f5f13ab40784c', 1, 'FEValuesBase']]],\n ['cell_5fsize_117', ['cell_size', ['../structCGALWrappers_1_1AdditionalData.html#a6eb20d45aa9ff17edbf390f01bf11fab', 1, 'CGALWrappers::AdditionalData']]],\n ['cell_5fstatus_2eh_118', ['cell_status.h', ['../cell__status_8h.html', 1, '']]],\n ['cell_5fto_5fchild_5fcoordinates_119', ['cell_to_child_coordinates', ['../structGeometryInfo.html#ae26001a1a9558930f358f1c2196376e1', 1, 'GeometryInfo']]],\n ['cell_5fto_5fpatch_5findex_5fmap_120', ['cell_to_patch_index_map', ['../structinternal_1_1DataOutImplementation_1_1ParallelData.html#a16b1d866ff588536ef28b53a958030e7', 1, 'internal::DataOutImplementation::ParallelData']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_18.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_18.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -18,16 +18,16 @@\n ['particle_2ecc_14', ['particle.cc', ['../particle_8cc.html', 1, '']]],\n ['particle_2eh_15', ['particle.h', ['../particle_8h.html', 1, '']]],\n ['particle_5faccessor_2eh_16', ['particle_accessor.h', ['../particle__accessor_8h.html', 1, '']]],\n ['particle_5fhandler_2ecc_17', ['particle_handler.cc', ['../particle__handler_8cc.html', 1, '']]],\n ['particle_5fhandler_2eh_18', ['particle_handler.h', ['../particle__handler_8h.html', 1, '']]],\n ['particle_5fiterator_2eh_19', ['particle_iterator.h', ['../particle__iterator_8h.html', 1, '']]],\n ['partitioner_2ecc_20', ['partitioner.cc', ['../partitioner_8cc.html', 1, '']]],\n- ['partitioner_2eh_21', ['partitioner.h', ['../particles_2partitioner_8h.html', 1, '(Global Namespace)'],\n- ['../base_2partitioner_8h.html', 1, '(Global Namespace)']\n+ ['partitioner_2eh_21', ['partitioner.h', ['../base_2partitioner_8h.html', 1, '(Global Namespace)'],\n+ ['../particles_2partitioner_8h.html', 1, '(Global Namespace)']\n ]],\n ['patches_2eh_22', ['patches.h', ['../patches_8h.html', 1, '']]],\n ['path_5fsearch_2ecc_23', ['path_search.cc', ['../path__search_8cc.html', 1, '']]],\n ['path_5fsearch_2eh_24', ['path_search.h', ['../path__search_8h.html', 1, '']]],\n ['patterns_2ecc_25', ['patterns.cc', ['../patterns_8cc.html', 1, '']]],\n ['patterns_2eh_26', ['patterns.h', ['../patterns_8h.html', 1, '']]],\n ['persistent_5ftria_2ecc_27', ['persistent_tria.cc', ['../persistent__tria_8cc.html', 1, '']]],\n@@ -63,16 +63,16 @@\n ['petsc_5fsparse_5fmatrix_2eh_57', ['petsc_sparse_matrix.h', ['../petsc__sparse__matrix_8h.html', 1, '']]],\n ['petsc_5fts_2ecc_58', ['petsc_ts.cc', ['../petsc__ts_8cc.html', 1, '']]],\n ['petsc_5fts_2eh_59', ['petsc_ts.h', ['../petsc__ts_8h.html', 1, '']]],\n ['petsc_5fvector_2eh_60', ['petsc_vector.h', ['../petsc__vector_8h.html', 1, '']]],\n ['petsc_5fvector_5fbase_2ecc_61', ['petsc_vector_base.cc', ['../petsc__vector__base_8cc.html', 1, '']]],\n ['petsc_5fvector_5fbase_2eh_62', ['petsc_vector_base.h', ['../petsc__vector__base_8h.html', 1, '']]],\n ['physics_2eh_63', ['physics.h', ['../physics_8h.html', 1, '']]],\n- ['point_2eh_64', ['point.h', ['../base_2point_8h.html', 1, '(Global Namespace)'],\n- ['../boost__adaptors_2point_8h.html', 1, '(Global Namespace)']\n+ ['point_2eh_64', ['point.h', ['../boost__adaptors_2point_8h.html', 1, '(Global Namespace)'],\n+ ['../base_2point_8h.html', 1, '(Global Namespace)']\n ]],\n ['point_5fconversion_2eh_65', ['point_conversion.h', ['../point__conversion_8h.html', 1, '']]],\n ['point_5fvalue_5fhistory_2ecc_66', ['point_value_history.cc', ['../point__value__history_8cc.html', 1, '']]],\n ['point_5fvalue_5fhistory_2eh_67', ['point_value_history.h', ['../point__value__history_8h.html', 1, '']]],\n ['polynomial_2ecc_68', ['polynomial.cc', ['../polynomial_8cc.html', 1, '']]],\n ['polynomial_2eh_69', ['polynomial.h', ['../polynomial_8h.html', 1, '']]],\n ['polynomial_5fspace_2ecc_70', ['polynomial_space.cc', ['../polynomial__space_8cc.html', 1, '']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_1b.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_1b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -25,16 +25,16 @@\n ['slepc_5fsolver_2ecc_23', ['slepc_solver.cc', ['../slepc__solver_8cc.html', 1, '']]],\n ['slepc_5fsolver_2eh_24', ['slepc_solver.h', ['../slepc__solver_8h.html', 1, '']]],\n ['slepc_5fspectral_5ftransformation_2ecc_25', ['slepc_spectral_transformation.cc', ['../slepc__spectral__transformation_8cc.html', 1, '']]],\n ['slepc_5fspectral_5ftransformation_2eh_26', ['slepc_spectral_transformation.h', ['../slepc__spectral__transformation_8h.html', 1, '']]],\n ['smartpointer_2eh_27', ['smartpointer.h', ['../smartpointer_8h.html', 1, '']]],\n ['smoothness_5festimator_2ecc_28', ['smoothness_estimator.cc', ['../smoothness__estimator_8cc.html', 1, '']]],\n ['smoothness_5festimator_2eh_29', ['smoothness_estimator.h', ['../smoothness__estimator_8h.html', 1, '']]],\n- ['solution_5ftransfer_2ecc_30', ['solution_transfer.cc', ['../numerics_2solution__transfer_8cc.html', 1, '(Global Namespace)'],\n- ['../distributed_2solution__transfer_8cc.html', 1, '(Global Namespace)']\n+ ['solution_5ftransfer_2ecc_30', ['solution_transfer.cc', ['../distributed_2solution__transfer_8cc.html', 1, '(Global Namespace)'],\n+ ['../numerics_2solution__transfer_8cc.html', 1, '(Global Namespace)']\n ]],\n ['solution_5ftransfer_2eh_31', ['solution_transfer.h', ['../numerics_2solution__transfer_8h.html', 1, '(Global Namespace)'],\n ['../distributed_2solution__transfer_8h.html', 1, '(Global Namespace)']\n ]],\n ['solution_5ftransfer_5finst2_2ecc_32', ['solution_transfer_inst2.cc', ['../solution__transfer__inst2_8cc.html', 1, '']]],\n ['solution_5ftransfer_5finst3_2ecc_33', ['solution_transfer_inst3.cc', ['../solution__transfer__inst3_8cc.html', 1, '']]],\n ['solution_5ftransfer_5finst4_2ecc_34', ['solution_transfer_inst4.cc', ['../solution__transfer__inst4_8cc.html', 1, '']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_f.js", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/files_f.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -23,16 +23,16 @@\n ['grid_5fgenerator_5fcgal_2ecc_21', ['grid_generator_cgal.cc', ['../grid__generator__cgal_8cc.html', 1, '']]],\n ['grid_5fgenerator_5ffrom_5fname_2ecc_22', ['grid_generator_from_name.cc', ['../grid__generator__from__name_8cc.html', 1, '']]],\n ['grid_5fgenerator_5fpipe_5fjunction_2ecc_23', ['grid_generator_pipe_junction.cc', ['../grid__generator__pipe__junction_8cc.html', 1, '']]],\n ['grid_5fin_2ecc_24', ['grid_in.cc', ['../grid__in_8cc.html', 1, '']]],\n ['grid_5fin_2eh_25', ['grid_in.h', ['../grid__in_8h.html', 1, '']]],\n ['grid_5fout_2ecc_26', ['grid_out.cc', ['../grid__out_8cc.html', 1, '']]],\n ['grid_5fout_2eh_27', ['grid_out.h', ['../grid__out_8h.html', 1, '']]],\n- ['grid_5frefinement_2ecc_28', ['grid_refinement.cc', ['../distributed_2grid__refinement_8cc.html', 1, '(Global Namespace)'],\n- ['../grid_2grid__refinement_8cc.html', 1, '(Global Namespace)']\n+ ['grid_5frefinement_2ecc_28', ['grid_refinement.cc', ['../grid_2grid__refinement_8cc.html', 1, '(Global Namespace)'],\n+ ['../distributed_2grid__refinement_8cc.html', 1, '(Global Namespace)']\n ]],\n ['grid_5frefinement_2eh_29', ['grid_refinement.h', ['../grid_2grid__refinement_8h.html', 1, '(Global Namespace)'],\n ['../distributed_2grid__refinement_8h.html', 1, '(Global Namespace)']\n ]],\n ['grid_5ftools_2ecc_30', ['grid_tools.cc', ['../grid__tools_8cc.html', 1, '']]],\n ['grid_5ftools_2eh_31', ['grid_tools.h', ['../grid__tools_8h.html', 1, '']]],\n ['grid_5ftools_5fcache_2ecc_32', ['grid_tools_cache.cc', ['../grid__tools__cache_8cc.html', 1, '']]],\n"}]}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_47.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_47.html", "unified_diff": "@@ -231,15 +231,15 @@\n &&\\forall \\mathbf x \\in \\partial\\Omega.\n \\end{align*}\n

    \n

    The same trick with the mixed system does not work here, because we would end up with both Dirichlet and Neumann boundary conditions for \\(u\\), but none for \\(v\\).

    \n

    The solution to this conundrum arrived with the Discontinuous Galerkin method wave in the 1990s and early 2000s: In much the same way as one can use discontinuous shape functions for the Laplace equation by penalizing the size of the discontinuity to obtain a scheme for an equation that has one derivative on each shape function, we can use a scheme that uses continuous (but not \\(C^1\\) continuous) shape functions and penalize the jump in the derivative to obtain a scheme for an equation that has two derivatives on each shape function. In analogy to the Interior Penalty (IP) method for the Laplace equation, this scheme for the biharmonic equation is typically called the \\(C^0\\) IP (or C0IP) method, since it uses \\(C^0\\) (continuous but not continuously differentiable) shape functions with an interior penalty formulation.

    \n

    It is worth noting that the C0IP method is not the only one that has been developed for the biharmonic equation. step-82 shows an alternative method.

    \n

    Derivation of the C0IP method

    \n-

    We base this program on the \\(C^0\\) IP method presented by Susanne Brenner and Li-Yeng Sung in the paper \"C \\_form#5279 Interior Penalty Method\n+

    We base this program on the \\(C^0\\) IP method presented by Susanne Brenner and Li-Yeng Sung in the paper \"C \\_form#5070 Interior Penalty Method\n for Linear Fourth Order Boundary Value Problems on polygonal\n domains\" [Brenner2005] where the method is derived for the biharmonic equation with \"clamped\" boundary conditions.

    \n

    As mentioned, this method relies on the use of \\(C^0\\) Lagrange finite elements where the \\(C^1\\) continuity requirement is relaxed and has been replaced with interior penalty techniques. To derive this method, we consider a \\(C^0\\) shape function \\(v_h\\) which vanishes on \\(\\partial\\Omega\\). We introduce notation \\( \\mathbb{F} \\) as the set of all faces of \\(\\mathbb{T}\\), \\( \\mathbb{F}^b \\) as the set of boundary faces, and \\( \\mathbb{F}^i \\) as the set of interior faces for use further down below. Since the higher order derivatives of \\(v_h\\) have two values on each interface \\(e\\in \\mathbb{F}\\) (shared by the two cells \\(K_{+},K_{-} \\in \\mathbb{T}\\)), we cope with this discontinuity by defining the following single-valued functions on \\(e\\):

    \n \\begin{align*}\n \\jump{\\frac{\\partial^k v_h}{\\partial \\mathbf n^k}}\n &=\n \\frac{\\partial^k v_h|_{K_+}}{\\partial \\mathbf n^k} \\bigg |_e\n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_58.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_58.html", "unified_diff": "@@ -566,16 +566,16 @@\n \\left(\\psi^{(n,2)}+\\psi^{(n,1)}\\right)\\right]\n +\n V \\left[\\frac 12 \\left(\\psi^{(n,2)}+\\psi^{(n,1)}\\right)\\right] = 0.\n \\end{align*}\n

    \n

    Here, the \"previous\" solution \\(\\psi^{(n,1)}\\) (or the \"initial\n condition\" for this part of the time step) is the output of the first phase rotation half-step; the output of the current step will be denoted by \\(\\psi^{(n,2)}\\). \\(k_{n+1}=t_{n+1}-t_n\\) is the length of the time step. (One could argue whether \\(\\psi^{(n,1)}\\) and \\(\\psi^{(n,1)}\\) live at time step \\(n\\) or \\(n+1\\) and what their upper indices should be. This is a philosophical discussion without practical impact, and one might think of \\(\\psi^{(n,1)}\\) as something like \\(\\psi^{(n+\\tfrac 13)}\\), and \\(\\psi^{(n,2)}\\) as \\(\\psi^{(n+\\tfrac 23)}\\) if that helps clarify things – though, again \\(n+\\frac 13\\) is not to be understood as \"one third time step after\n- \\_form#446\" but more like \"we've already done one third of the work necessary\n-for time step \\_form#3264\".)

    \n+ \\_form#438\" but more like \"we've already done one third of the work necessary\n+for time step \\_form#3329\".)

    \n

    If we multiply the whole equation with \\(k_{n+1}\\) and sort terms with the unknown \\(\\psi^{(n+1,2)}\\) to the left and those with the known \\(\\psi^{(n,2)}\\) to the right, then we obtain the following (spatial) partial differential equation that needs to be solved in each time step:

    \n \\begin{align*}\n -i\\psi^{(n,2)}\n -\n \\frac 14 k_{n+1} \\Delta \\psi^{(n,2)}\n +\n \\frac 12 k_{n+1} V \\psi^{(n,2)}\n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structDataOutBase_1_1VtkFlags.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structDataOutBase_1_1VtkFlags.html", "unified_diff": "@@ -183,15 +183,15 @@\n \n \n \n \n
    using DataOutBase::VtkFlags::ZlibCompressionLevel = DataOutBase::CompressionLevel
    \n

    \n

    A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.

    \n-
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n+
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n \n

    Definition at line 1166 of file data_out_base.h.

    \n \n
    \n \n

    Constructor & Destructor Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structGridOutFlags_1_1Vtk.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structGridOutFlags_1_1Vtk.html", "unified_diff": "@@ -197,15 +197,15 @@\n     		\n inherited
    \n
    \n

    A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.

    \n-
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n+
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n \n

    Definition at line 1166 of file data_out_base.h.

    \n \n
    \n \n

    Constructor & Destructor Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structGridOutFlags_1_1Vtu.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structGridOutFlags_1_1Vtu.html", "unified_diff": "@@ -191,15 +191,15 @@\n     		\n inherited
    \n
    \n

    A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.

    \n-
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n+
    Deprecated:
    Use DataOutBase::CompressionLevel instead.
    \n \n

    Definition at line 1166 of file data_out_base.h.

    \n \n
    \n \n

    Constructor & Destructor Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/template__constraints_8h.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/template__constraints_8h.html", "unified_diff": "@@ -313,15 +313,15 @@\n \n \n \n \n
    using identity = std_cxx20::type_identity<T>
    \n
    \n

    A using declaration to make the std::identity_type class available under the name that deal.II has used for a long time.

    \n-
    Deprecated:
    Use std_cxx20::type_identity instead.
    \n+
    Deprecated:
    Use std_cxx20::type_identity instead.
    \n \n

    Definition at line 322 of file template_constraints.h.

    \n \n
    \n \n

    Variable Documentation

    \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/todo.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/todo.html", "unified_diff": "@@ -107,71 +107,71 @@\n
    Class DataOutFaces< dim, spacedim >
    \n
    Reimplement this whole class using actual FEFaceValues and MeshWorker.
    \n
    Member DataOutFaces< dim, spacedim >::build_patches (const Mapping< dim, spacedim > &mapping, const unsigned int n_subdivisions=0)
    \n
    The mapping argument should be replaced by a hp::MappingCollection in case of a DoFHandler with hp-capabilities.
    \n
    Class Differentiation::AD::HelperBase< ADNumberTypeCode, ScalarType >
    \n
    Make this class thread safe for Sacado number and ADOL-C tapeless numbers (if supported).
    \n
    Member DoFTools::ExcFiniteElementsDontMatch ()
    \n-
    Write description
    \n+
    Write description
    \n
    Member DoFTools::ExcGridNotCoarser ()
    \n-
    Write description
    \n+
    Write description
    \n
    Member DoFTools::ExcGridsDontMatch ()
    \n-
    Write description
    \n+
    Write description
    \n
    Member DoFTools::ExcInvalidBoundaryIndicator ()
    \n-
    Write description
    \n+
    Write description
    \n
    Member DoFTools::map_support_points_to_dofs (const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< Point< spacedim >, types::global_dof_index, Comp > &point_to_index_map)
    \n-
    This function should generate a multimap, rather than just a map, since several dofs may be located at the same support point. Currently, only the last value in the map returned by map_dofs_to_support_points() for each point will be returned.
    \n+
    This function should generate a multimap, rather than just a map, since several dofs may be located at the same support point. Currently, only the last value in the map returned by map_dofs_to_support_points() for each point will be returned.
    \n
    Class FE_ABF< dim >
    \n-
    Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
    \n+
    Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
    \n
    Class FE_BDM< dim >
    \n-

    Restriction matrices are missing.

    \n-

    The 3d version exhibits some numerical instabilities, in particular for higher order

    \n+

    Restriction matrices are missing.

    \n+

    The 3d version exhibits some numerical instabilities, in particular for higher order

    \n
    \n
    Class FE_Nedelec< dim >
    \n
    Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
    \n
    Class FE_Poly< dim, spacedim >
    \n
    Since nearly all functions for spacedim != dim are specialized, this class needs cleaning up.
    \n
    Class FE_RT_Bubbles< dim >
    \n-
    Implement restriction matrices
    \n+
    Implement restriction matrices
    \n
    Member FESubfaceValues< dim, spacedim >::ExcFaceHasNoSubfaces ()
    \n-
    Document this
    \n+
    Document this
    \n
    Member FESubfaceValues< dim, spacedim >::ExcReinitCalledWithBoundaryFace ()
    \n-
    Document this
    \n+
    Document this
    \n
    Member GinkgoWrappers::SolverBase< ValueType, IndexType >::system_matrix
    \n
    Templatize based on Matrix type.
    \n
    Member internal::TriangulationImplementation::TriaObjects::next_free_pair_object (const Triangulation< dim, spacedim > &tria)
    \n
    This function is not instantiated for the codim-one case
    \n
    Member internal::TriangulationImplementation::TriaObjects::next_free_single_object (const Triangulation< dim, spacedim > &tria)
    \n
    This function is not instantiated for the codim-one case
    \n
    Member LocalIntegrators::Divergence::cell_residual (Vector< number > &result, const FEValuesBase< dim > &fetest, const ArrayView< const std::vector< double > > &input, const double factor=1.)
    \n
    Verify: The function cell_matrix() is the Frechet derivative of this function with respect to the test functions.
    \n
    Member LocalIntegrators::Divergence::gradient_residual (Vector< number > &result, const FEValuesBase< dim > &fetest, const std::vector< double > &input, const double factor=1.)
    \n
    Verify: The function gradient_matrix() is the Frechet derivative of this function with respect to the test functions.
    \n
    Class Mapping< dim, spacedim >
    \n-
    Document what happens in the codimension-1 case.
    \n+
    Document what happens in the codimension-1 case.
    \n
    Member Mapping< dim, spacedim >::transform (const ArrayView< const Tensor< 2, dim > > &input, const MappingKind kind, const typename Mapping< dim, spacedim >::InternalDataBase &internal, const ArrayView< Tensor< 2, spacedim > > &output) const =0
    \n-
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n+
    The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \\(J\\).
    \n
    Class MatrixBlock< MatrixType >
    \n
    Example for the product preconditioner of the pressure Schur complement.
    \n+
    Member MatrixBlock< MatrixType >::add (const std::vector< size_type > &indices, const FullMatrix< number > &full_matrix, const bool elide_zero_values=true)
    \n+
    elide_zero_values is currently ignored.
    \n
    Member MatrixBlock< MatrixType >::add (const std::vector< size_type > &row_indices, const std::vector< size_type > &col_indices, const FullMatrix< number > &full_matrix, const bool elide_zero_values=true)
    \n
    elide_zero_values is currently ignored.
    \n
    Member MatrixBlock< MatrixType >::add (const size_type row_index, const std::vector< size_type > &col_indices, const std::vector< number > &values, const bool elide_zero_values=true)
    \n
    elide_zero_values is currently ignored.
    \n-
    Member MatrixBlock< MatrixType >::add (const std::vector< size_type > &indices, const FullMatrix< number > &full_matrix, const bool elide_zero_values=true)
    \n-
    elide_zero_values is currently ignored.
    \n
    Member MatrixCreator::create_boundary_mass_matrix (const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof, const Quadrature< dim - 1 > &q, SparseMatrix< number > &matrix, const std::map< types::boundary_id, const Function< spacedim, number > * > &boundary_functions, Vector< number > &rhs_vector, std::vector< types::global_dof_index > &dof_to_boundary_mapping, const Function< spacedim, number > *const weight=0, std::vector< unsigned int > component_mapping={})
    \n
    This function does not work for finite elements with cell-dependent shape functions.
    \n
    Class MeshWorker::Assembler::MGMatrixSimple< MatrixType >
    \n
    The matrix structures needed for assembling level matrices with local refinement and continuous elements are missing.
    \n
    Class MeshWorker::Assembler::ResidualLocalBlocksToGlobalBlocks< VectorType >
    \n-
    Comprehensive model currently not implemented.
    \n+
    Comprehensive model currently not implemented.
    \n
    Class MeshWorker::DoFInfoBox< dim, DOFINFO >
    \n
    Currently, we are storing an object for the cells and two for each face. We could gather all face data pertaining to the cell itself in one object, saving a bit of memory and a few operations, but sacrificing some cleanliness.
    \n
    Class MGTransferBase< VectorType >
    \n-
    update the following documentation, since it does not reflect the latest changes in structure.
    \n+
    update the following documentation, since it does not reflect the latest changes in structure.
    \n
    Class PolynomialsAdini< dim >
    \n
    This polynomial space is implemented in 2d only and does not compute derivatives of order 3 or higher.
    \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8cc_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8cc_source.html", "unified_diff": "@@ -218,36 +218,36 @@\n
    106
    \n
    107 void
    \n
    \n
    108 Vector::reinit(const IndexSet &parallel_partitioner,
    \n
    109 const MPI_Comm communicator,
    \n
    110 const bool omit_zeroing_entries)
    \n
    111 {
    \n-
    112 Epetra_Map input_map =
    \n-
    113 parallel_partitioner.make_trilinos_map(communicator, false);
    \n-
    114 if (vector->Map().SameAs(input_map) == false)
    \n-
    115 vector = std::make_unique<Epetra_FEVector>(input_map);
    \n-
    116 else if (omit_zeroing_entries == false)
    \n+
    112 Epetra_Map input_map =
    \n+
    113 parallel_partitioner.make_trilinos_map(communicator, false);
    \n+
    114 if (vector->Map().SameAs(input_map) == false)
    \n+
    115 vector = std::make_unique<Epetra_FEVector>(input_map);
    \n+
    116 else if (omit_zeroing_entries == false)
    \n
    117 {
    \n-
    118 const int ierr = vector->PutScalar(0.);
    \n-
    119 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    120 (void)ierr;
    \n+
    118 const int ierr = vector->PutScalar(0.);
    \n+
    119 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    120 (void)ierr;
    \n
    121 }
    \n
    122 }
    \n
    \n
    123
    \n
    124
    \n
    125
    \n
    126 void
    \n
    \n
    127 Vector::reinit(const Vector &V, const bool omit_zeroing_entries)
    \n
    128 {
    \n
    129 reinit(V.locally_owned_elements(),
    \n
    130 V.get_mpi_communicator(),
    \n-
    131 omit_zeroing_entries);
    \n+
    131 omit_zeroing_entries);
    \n
    132 }
    \n
    \n
    133
    \n
    134
    \n
    135
    \n
    136 void
    \n
    \n@@ -258,17 +258,17 @@\n
    141 AssertDimension(indices.size(), elements.size());
    \n
    142 const auto &vector = trilinos_vector();
    \n
    143 const auto &map = vector.Map();
    \n
    144
    \n
    145 for (unsigned int i = 0; i < indices.size(); ++i)
    \n
    146 {
    \n
    147 AssertIndexRange(indices[i], size());
    \n-
    148 const auto trilinos_i =
    \n+
    148 const auto trilinos_i =
    \n
    149 map.LID(static_cast<TrilinosWrappers::types::int_type>(indices[i]));
    \n-
    150 elements[i] = vector[0][trilinos_i];
    \n+
    150 elements[i] = vector[0][trilinos_i];
    \n
    151 }
    \n
    152 }
    \n
    \n
    153
    \n
    154
    \n
    155
    \n
    156 Vector &
    \n@@ -281,21 +281,21 @@\n
    162 // - Third case: the vectors have different size.
    \n
    163 if (vector->Map().SameAs(V.trilinos_vector().Map()))
    \n
    164 *vector = V.trilinos_vector();
    \n
    165 else
    \n
    166 {
    \n
    167 if (size() == V.size())
    \n
    168 {
    \n-
    169 Epetra_Import data_exchange(vector->Map(),
    \n+
    169 Epetra_Import data_exchange(vector->Map(),
    \n
    170 V.trilinos_vector().Map());
    \n
    171
    \n-
    172 const int ierr =
    \n-
    173 vector->Import(V.trilinos_vector(), data_exchange, Insert);
    \n-
    174 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    175 (void)ierr;
    \n+
    172 const int ierr =
    \n+
    173 vector->Import(V.trilinos_vector(), data_exchange, Insert);
    \n+
    174 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    175 (void)ierr;
    \n
    176 }
    \n
    177 else
    \n
    178 vector = std::make_unique<Epetra_FEVector>(V.trilinos_vector());
    \n
    179 }
    \n
    180
    \n
    181 return *this;
    \n
    182 }
    \n@@ -305,17 +305,17 @@\n
    185
    \n
    186 Vector &
    \n
    \n
    187 Vector::operator=(const double s)
    \n
    188 {
    \n
    189 Assert(s == 0., ExcMessage("Only 0 can be assigned to a vector."));
    \n
    190
    \n-
    191 const int ierr = vector->PutScalar(s);
    \n-
    192 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    193 (void)ierr;
    \n+
    191 const int ierr = vector->PutScalar(s);
    \n+
    192 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    193 (void)ierr;
    \n
    194
    \n
    195 return *this;
    \n
    196 }
    \n
    \n
    197
    \n
    198
    \n
    199
    \n@@ -325,15 +325,15 @@\n
    202 const ReadWriteVector<double> &V,
    \n
    203 VectorOperation::values operation,
    \n
    204 const std::shared_ptr<const Utilities::MPI::CommunicationPatternBase>
    \n
    205 &communication_pattern)
    \n
    206 {
    \n
    207 // If no communication pattern is given, create one. Otherwise, use the
    \n
    208 // one given.
    \n-
    209 if (communication_pattern == nullptr)
    \n+
    209 if (communication_pattern == nullptr)
    \n
    210 {
    \n
    211 // The first time import is called, a communication pattern is
    \n
    212 // created. Check if the communication pattern already exists and if
    \n
    213 // it can be reused.
    \n
    214 if ((source_stored_elements.size() !=
    \n
    215 V.get_stored_elements().size()) ||
    \n
    216 (source_stored_elements != V.get_stored_elements()))
    \n@@ -343,37 +343,37 @@\n
    220 dynamic_cast<const Epetra_MpiComm &>(vector->Comm()).Comm());
    \n
    221 }
    \n
    222 }
    \n
    223 else
    \n
    224 {
    \n
    225 epetra_comm_pattern =
    \n
    226 std::dynamic_pointer_cast<const CommunicationPattern>(
    \n-
    227 communication_pattern);
    \n+
    227 communication_pattern);
    \n
    228 AssertThrow(
    \n
    229 epetra_comm_pattern != nullptr,
    \n
    230 ExcMessage(
    \n
    231 std::string("The communication pattern is not of type ") +
    \n
    232 "LinearAlgebra::EpetraWrappers::CommunicationPattern."));
    \n
    233 }
    \n
    234
    \n-
    235 Epetra_Import import_map(epetra_comm_pattern->get_epetra_import());
    \n+
    235 Epetra_Import import_map(epetra_comm_pattern->get_epetra_import());
    \n
    236
    \n
    237 // The TargetMap and the SourceMap have their roles inverted.
    \n-
    238 Epetra_FEVector source_vector(import_map.TargetMap());
    \n-
    239 double *values = source_vector.Values();
    \n+
    238 Epetra_FEVector source_vector(import_map.TargetMap());
    \n+
    239 double *values = source_vector.Values();
    \n
    240 std::copy(V.begin(), V.end(), values);
    \n
    241
    \n
    242 if (operation == VectorOperation::insert)
    \n-
    243 vector->Export(source_vector, import_map, Insert);
    \n+
    243 vector->Export(source_vector, import_map, Insert);
    \n
    244 else if (operation == VectorOperation::add)
    \n-
    245 vector->Export(source_vector, import_map, Add);
    \n+
    245 vector->Export(source_vector, import_map, Add);
    \n
    246 else if (operation == VectorOperation::max)
    \n-
    247 vector->Export(source_vector, import_map, Epetra_Max);
    \n+
    247 vector->Export(source_vector, import_map, Epetra_Max);
    \n
    248 else if (operation == VectorOperation::min)
    \n-
    249 vector->Export(source_vector, import_map, Epetra_Min);
    \n+
    249 vector->Export(source_vector, import_map, Epetra_Min);
    \n
    250 else
    \n
    251 AssertThrow(false, ExcNotImplemented());
    \n
    252 }
    \n \n
    253
    \n
    254
    \n
    255
    \n@@ -407,43 +407,43 @@\n
    279 Vector &
    \n
    \n
    280 Vector::operator+=(const Vector &V)
    \n
    281 {
    \n
    282 // If the maps are the same we can Update right away.
    \n
    283 if (vector->Map().SameAs(V.trilinos_vector().Map()))
    \n
    284 {
    \n-
    285 const int ierr = vector->Update(1., V.trilinos_vector(), 1.);
    \n-
    286 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    287 (void)ierr;
    \n+
    285 const int ierr = vector->Update(1., V.trilinos_vector(), 1.);
    \n+
    286 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    287 (void)ierr;
    \n
    288 }
    \n
    289 else
    \n
    290 {
    \n
    291 Assert(this->size() == V.size(),
    \n
    292 ExcDimensionMismatch(this->size(), V.size()));
    \n
    293
    \n
    294# if DEAL_II_TRILINOS_VERSION_GTE(11, 11, 0)
    \n-
    295 Epetra_Import data_exchange(vector->Map(), V.trilinos_vector().Map());
    \n-
    296 const int ierr = vector->Import(V.trilinos_vector(),
    \n-
    297 data_exchange,
    \n-
    298 Epetra_AddLocalAlso);
    \n-
    299 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    300 (void)ierr;
    \n+
    295 Epetra_Import data_exchange(vector->Map(), V.trilinos_vector().Map());
    \n+
    296 const int ierr = vector->Import(V.trilinos_vector(),
    \n+
    297 data_exchange,
    \n+
    298 Epetra_AddLocalAlso);
    \n+
    299 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    300 (void)ierr;
    \n
    301# else
    \n
    302 // In versions older than 11.11 the Import function is broken for
    \n
    303 // adding Hence, we provide a workaround in this case
    \n
    304
    \n-
    305 Epetra_MultiVector dummy(vector->Map(), 1, false);
    \n-
    306 Epetra_Import data_exchange(dummy.Map(), V.trilinos_vector().Map());
    \n+
    305 Epetra_MultiVector dummy(vector->Map(), 1, false);
    \n+
    306 Epetra_Import data_exchange(dummy.Map(), V.trilinos_vector().Map());
    \n
    307
    \n-
    308 int ierr = dummy.Import(V.trilinos_vector(), data_exchange, Insert);
    \n-
    309 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    308 int ierr = dummy.Import(V.trilinos_vector(), data_exchange, Insert);
    \n+
    309 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n
    310
    \n-
    311 ierr = vector->Update(1.0, dummy, 1.0);
    \n-
    312 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    313 (void)ierr;
    \n+
    311 ierr = vector->Update(1.0, dummy, 1.0);
    \n+
    312 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    313 (void)ierr;
    \n
    314# endif
    \n
    315 }
    \n
    316
    \n
    317 return *this;
    \n
    318 }
    \n
    \n
    319
    \n@@ -466,20 +466,20 @@\n
    333 Vector::operator*(const Vector &V) const
    \n
    334 {
    \n
    335 Assert(this->size() == V.size(),
    \n
    336 ExcDimensionMismatch(this->size(), V.size()));
    \n
    337 Assert(vector->Map().SameAs(V.trilinos_vector().Map()),
    \n
    338 ExcDifferentParallelPartitioning());
    \n
    339
    \n-
    340 double result(0.);
    \n-
    341 const int ierr = vector->Dot(V.trilinos_vector(), &result);
    \n-
    342 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    343 (void)ierr;
    \n+
    340 double result(0.);
    \n+
    341 const int ierr = vector->Dot(V.trilinos_vector(), &result);
    \n+
    342 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    343 (void)ierr;
    \n
    344
    \n-
    345 return result;
    \n+
    345 return result;
    \n
    346 }
    \n \n
    347
    \n
    348
    \n
    349
    \n
    350 void
    \n
    \n@@ -498,17 +498,17 @@\n
    \n
    362 Vector::add(const double a, const Vector &V)
    \n
    363 {
    \n
    364 AssertIsFinite(a);
    \n
    365 Assert(vector->Map().SameAs(V.trilinos_vector().Map()),
    \n
    366 ExcDifferentParallelPartitioning());
    \n
    367
    \n-
    368 const int ierr = vector->Update(a, V.trilinos_vector(), 1.);
    \n-
    369 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    370 (void)ierr;
    \n+
    368 const int ierr = vector->Update(a, V.trilinos_vector(), 1.);
    \n+
    369 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    370 (void)ierr;
    \n
    371 }
    \n
    \n
    372
    \n
    373
    \n
    374
    \n
    375 void
    \n
    \n@@ -520,18 +520,18 @@\n
    381 Assert(vector->Map().SameAs(V.trilinos_vector().Map()),
    \n
    382 ExcDifferentParallelPartitioning());
    \n
    383 Assert(vector->Map().SameAs(W.trilinos_vector().Map()),
    \n
    384 ExcDifferentParallelPartitioning());
    \n
    385 AssertIsFinite(a);
    \n
    386 AssertIsFinite(b);
    \n
    387
    \n-
    388 const int ierr =
    \n+
    388 const int ierr =
    \n
    389 vector->Update(a, V.trilinos_vector(), b, W.trilinos_vector(), 1.);
    \n-
    390 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    391 (void)ierr;
    \n+
    390 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    391 (void)ierr;
    \n
    392 }
    \n
    \n
    393
    \n
    394
    \n
    395
    \n
    396 void
    \n
    \n@@ -546,21 +546,21 @@\n
    404
    \n
    405
    \n
    406
    \n
    407 void
    \n
    \n
    408 Vector::scale(const Vector &scaling_factors)
    \n
    409 {
    \n-
    410 Assert(vector->Map().SameAs(scaling_factors.trilinos_vector().Map()),
    \n+
    410 Assert(vector->Map().SameAs(scaling_factors.trilinos_vector().Map()),
    \n
    411 ExcDifferentParallelPartitioning());
    \n
    412
    \n-
    413 const int ierr =
    \n-
    414 vector->Multiply(1.0, scaling_factors.trilinos_vector(), *vector, 0.0);
    \n-
    415 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    416 (void)ierr;
    \n+
    413 const int ierr =
    \n+
    414 vector->Multiply(1.0, scaling_factors.trilinos_vector(), *vector, 0.0);
    \n+
    415 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    416 (void)ierr;
    \n
    417 }
    \n
    \n
    418
    \n
    419
    \n
    420
    \n
    421 void
    \n
    \n@@ -568,108 +568,108 @@\n
    423 {
    \n
    424 // If we don't have the same map, copy.
    \n
    425 if (vector->Map().SameAs(V.trilinos_vector().Map()) == false)
    \n
    426 this->sadd(0., a, V);
    \n
    427 else
    \n
    428 {
    \n
    429 // Otherwise, just update
    \n-
    430 int ierr = vector->Update(a, V.trilinos_vector(), 0.);
    \n-
    431 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    432 (void)ierr;
    \n+
    430 int ierr = vector->Update(a, V.trilinos_vector(), 0.);
    \n+
    431 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    432 (void)ierr;
    \n
    433 }
    \n
    434 }
    \n
    \n
    435
    \n
    436
    \n
    437
    \n
    438 bool
    \n
    \n
    439 Vector::all_zero() const
    \n
    440 {
    \n
    441 // get a representation of the vector and
    \n
    442 // loop over all the elements
    \n-
    443 double *start_ptr = (*vector)[0];
    \n-
    444 const double *ptr = start_ptr, *eptr = start_ptr + vector->MyLength();
    \n+
    443 double *start_ptr = (*vector)[0];
    \n+
    444 const double *ptr = start_ptr, *eptr = start_ptr + vector->MyLength();
    \n
    445 unsigned int flag = 0;
    \n-
    446 while (ptr != eptr)
    \n+
    446 while (ptr != eptr)
    \n
    447 {
    \n
    448 if (*ptr != 0)
    \n
    449 {
    \n
    450 flag = 1;
    \n
    451 break;
    \n
    452 }
    \n
    453 ++ptr;
    \n
    454 }
    \n
    455
    \n
    456 // Check that the vector is zero on _all_ processors.
    \n
    457 const Epetra_MpiComm *mpi_comm =
    \n
    458 dynamic_cast<const Epetra_MpiComm *>(&vector->Map().Comm());
    \n
    459 Assert(mpi_comm != nullptr, ExcInternalError());
    \n-
    460 unsigned int num_nonzero = Utilities::MPI::sum(flag, mpi_comm->Comm());
    \n+
    460 unsigned int num_nonzero = Utilities::MPI::sum(flag, mpi_comm->Comm());
    \n
    461
    \n-
    462 return num_nonzero == 0;
    \n+
    462 return num_nonzero == 0;
    \n
    463 }
    \n
    \n
    464
    \n
    465
    \n
    466
    \n
    467 double
    \n
    \n
    468 Vector::mean_value() const
    \n
    469 {
    \n
    470 double mean_value(0.);
    \n
    471
    \n-
    472 int ierr = vector->MeanValue(&mean_value);
    \n-
    473 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    474 (void)ierr;
    \n+
    472 int ierr = vector->MeanValue(&mean_value);
    \n+
    473 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    474 (void)ierr;
    \n
    475
    \n
    476 return mean_value;
    \n
    477 }
    \n
    \n
    478
    \n
    479
    \n
    480
    \n
    481 double
    \n
    \n
    482 Vector::l1_norm() const
    \n
    483 {
    \n
    484 double norm(0.);
    \n-
    485 int ierr = vector->Norm1(&norm);
    \n-
    486 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    487 (void)ierr;
    \n+
    485 int ierr = vector->Norm1(&norm);
    \n+
    486 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    487 (void)ierr;
    \n
    488
    \n
    489 return norm;
    \n
    490 }
    \n
    \n
    491
    \n
    492
    \n
    493
    \n
    494 double
    \n
    \n
    495 Vector::l2_norm() const
    \n
    496 {
    \n
    497 double norm(0.);
    \n-
    498 int ierr = vector->Norm2(&norm);
    \n-
    499 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    500 (void)ierr;
    \n+
    498 int ierr = vector->Norm2(&norm);
    \n+
    499 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    500 (void)ierr;
    \n
    501
    \n
    502 return norm;
    \n
    503 }
    \n
    \n
    504
    \n
    505
    \n
    506
    \n
    507 double
    \n
    \n
    508 Vector::linfty_norm() const
    \n
    509 {
    \n
    510 double norm(0.);
    \n-
    511 int ierr = vector->NormInf(&norm);
    \n-
    512 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    513 (void)ierr;
    \n+
    511 int ierr = vector->NormInf(&norm);
    \n+
    512 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    513 (void)ierr;
    \n
    514
    \n
    515 return norm;
    \n
    516 }
    \n
    \n
    517
    \n
    518
    \n
    519
    \n@@ -709,54 +709,54 @@\n
    547
    \n
    548
    \n
    549
    \n
    550 MPI_Comm
    \n
    \n
    551 Vector::get_mpi_communicator() const
    \n
    552 {
    \n-
    553 const Epetra_MpiComm *epetra_comm =
    \n+
    553 const Epetra_MpiComm *epetra_comm =
    \n
    554 dynamic_cast<const Epetra_MpiComm *>(&(vector->Comm()));
    \n-
    555 Assert(epetra_comm != nullptr, ExcInternalError());
    \n-
    556 return epetra_comm->GetMpiComm();
    \n+
    555 Assert(epetra_comm != nullptr, ExcInternalError());
    \n+
    556 return epetra_comm->GetMpiComm();
    \n
    557 }
    \n
    \n
    558
    \n
    559
    \n
    560
    \n
    561 ::IndexSet
    \n
    \n
    562 Vector::locally_owned_elements() const
    \n
    563 {
    \n-
    564 IndexSet is(size());
    \n+
    564 IndexSet is(size());
    \n
    565
    \n
    566 // easy case: local range is contiguous
    \n
    567 if (vector->Map().LinearMap())
    \n
    568 {
    \n
    569# ifndef DEAL_II_WITH_64BIT_INDICES
    \n-
    570 is.add_range(vector->Map().MinMyGID(), vector->Map().MaxMyGID() + 1);
    \n+
    570 is.add_range(vector->Map().MinMyGID(), vector->Map().MaxMyGID() + 1);
    \n
    571# else
    \n-
    572 is.add_range(vector->Map().MinMyGID64(),
    \n+
    572 is.add_range(vector->Map().MinMyGID64(),
    \n
    573 vector->Map().MaxMyGID64() + 1);
    \n
    574# endif
    \n
    575 }
    \n
    576 else if (vector->Map().NumMyElements() > 0)
    \n
    577 {
    \n-
    578 const size_type n_indices = vector->Map().NumMyElements();
    \n+
    578 const size_type n_indices = vector->Map().NumMyElements();
    \n
    579# ifndef DEAL_II_WITH_64BIT_INDICES
    \n-
    580 unsigned int *vector_indices =
    \n+
    580 unsigned int *vector_indices =
    \n
    581 reinterpret_cast<unsigned int *>(vector->Map().MyGlobalElements());
    \n
    582# else
    \n-
    583 size_type *vector_indices =
    \n+
    583 size_type *vector_indices =
    \n
    584 reinterpret_cast<size_type *>(vector->Map().MyGlobalElements64());
    \n
    585# endif
    \n-
    586 is.add_indices(vector_indices, vector_indices + n_indices);
    \n+
    586 is.add_indices(vector_indices, vector_indices + n_indices);
    \n
    587 }
    \n-
    588 is.compress();
    \n+
    588 is.compress();
    \n
    589
    \n-
    590 return is;
    \n+
    590 return is;
    \n
    591 }
    \n
    \n
    592
    \n
    593
    \n
    594 void
    \n
    \n
    595 Vector::compress(const VectorOperation::values /*operation*/)
    \n@@ -789,31 +789,31 @@\n
    \n
    617 Vector::print(std::ostream &out,
    \n
    618 const unsigned int precision,
    \n
    619 const bool scientific,
    \n
    620 const bool across) const
    \n
    621 {
    \n
    622 AssertThrow(out.fail() == false, ExcIO());
    \n-
    623 boost::io::ios_flags_saver restore_flags(out);
    \n+
    623 boost::io::ios_flags_saver restore_flags(out);
    \n
    624
    \n
    625 // Get a representation of the vector and loop over all
    \n
    626 // the elements
    \n
    627 double *val;
    \n-
    628 int leading_dimension;
    \n-
    629 int ierr = vector->ExtractView(&val, &leading_dimension);
    \n+
    628 int leading_dimension;
    \n+
    629 int ierr = vector->ExtractView(&val, &leading_dimension);
    \n
    630
    \n-
    631 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n-
    632 (void)ierr;
    \n+
    631 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    632 (void)ierr;
    \n
    633 out.precision(precision);
    \n
    634 if (scientific)
    \n
    635 out.setf(std::ios::scientific, std::ios::floatfield);
    \n
    636 else
    \n
    637 out.setf(std::ios::fixed, std::ios::floatfield);
    \n
    638
    \n-
    639 if (across)
    \n+
    639 if (across)
    \n
    640 for (int i = 0; i < vector->MyLength(); ++i)
    \n
    641 out << val[i] << ' ';
    \n
    642 else
    \n
    643 for (int i = 0; i < vector->MyLength(); ++i)
    \n
    644 out << val[i] << std::endl;
    \n
    645 out << std::endl;
    \n
    646
    \n@@ -838,35 +838,31 @@\n
    662
    \n
    663
    \n
    664 void
    \n
    \n
    665 Vector::create_epetra_comm_pattern(const IndexSet &source_index_set,
    \n
    666 const MPI_Comm mpi_comm)
    \n
    667 {
    \n-
    668 source_stored_elements = source_index_set;
    \n+
    668 source_stored_elements = source_index_set;
    \n
    669 epetra_comm_pattern =
    \n
    670 std::make_shared<CommunicationPattern>(locally_owned_elements(),
    \n-
    671 source_index_set,
    \n+
    671 source_index_set,
    \n
    672 mpi_comm);
    \n
    673 }
    \n
    \n
    674 } // namespace EpetraWrappers
    \n
    675} // namespace LinearAlgebra
    \n
    676
    \n
    677DEAL_II_NAMESPACE_CLOSE
    \n
    678
    \n
    679#endif
    \n \n
    ArrayView::size
    std::size_t size() const
    Definition array_view.h:684
    \n \n
    IndexSet::size
    size_type size() const
    Definition index_set.h:1776
    \n-
    IndexSet::make_trilinos_map
    Epetra_Map make_trilinos_map(const MPI_Comm communicator=MPI_COMM_WORLD, const bool overlapping=false) const
    Definition index_set.cc:1041
    \n-
    IndexSet::add_range
    void add_range(const size_type begin, const size_type end)
    Definition index_set.h:1803
    \n-
    IndexSet::compress
    void compress() const
    Definition index_set.h:1784
    \n-
    IndexSet::add_indices
    void add_indices(const ForwardIterator &begin, const ForwardIterator &end)
    Definition index_set.h:1831
    \n \n \n
    LinearAlgebra::EpetraWrappers::Vector::equ
    void equ(const double a, const Vector &V)
    Definition trilinos_epetra_vector.cc:422
    \n \n \n
    LinearAlgebra::EpetraWrappers::Vector::compress
    void compress(const VectorOperation::values operation)
    Definition trilinos_epetra_vector.cc:595
    \n
    LinearAlgebra::EpetraWrappers::Vector::print
    void print(std::ostream &out, const unsigned int precision=3, const bool scientific=true, const bool across=true) const
    Definition trilinos_epetra_vector.cc:617
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__epetra__vector_8h_source.html", "unified_diff": "@@ -249,24 +249,24 @@\n
    232 using reference = internal::VectorReference;
    \n
    233 using const_reference = const internal::VectorReference;
    \n
    234
    \n
    243 Vector();
    \n
    244
    \n
    249 Vector(const Vector &V);
    \n
    250
    \n-
    257 explicit Vector(const IndexSet &parallel_partitioner,
    \n+
    257 explicit Vector(const IndexSet &parallel_partitioner,
    \n
    258 const MPI_Comm communicator);
    \n
    259
    \n
    266 void
    \n-
    267 reinit(const IndexSet &parallel_partitioner,
    \n+
    267 reinit(const IndexSet &parallel_partitioner,
    \n
    268 const MPI_Comm communicator,
    \n-
    269 const bool omit_zeroing_entries = false);
    \n+
    269 const bool omit_zeroing_entries = false);
    \n
    270
    \n
    275 void
    \n-
    276 reinit(const Vector &V, const bool omit_zeroing_entries = false);
    \n+
    276 reinit(const Vector &V, const bool omit_zeroing_entries = false);
    \n
    277
    \n
    281 virtual void
    \n
    282 extract_subvector_to(
    \n
    283 const ArrayView<const types::global_dof_index> &indices,
    \n
    284 ArrayView<double> &elements) const override;
    \n
    285
    \n
    315 Vector &
    \n@@ -276,26 +276,26 @@\n
    323 operator=(const double s);
    \n
    324
    \n
    333 void
    \n
    334 import_elements(
    \n
    335 const ReadWriteVector<double> &V,
    \n
    336 VectorOperation::values operation,
    \n
    337 const std::shared_ptr<const Utilities::MPI::CommunicationPatternBase>
    \n-
    338 &communication_pattern = {});
    \n+
    338 &communication_pattern = {});
    \n
    339
    \n
    343 DEAL_II_DEPRECATED
    \n
    344 void
    \n
    \n
    345 import(
    \n
    346 const ReadWriteVector<double> &V,
    \n
    347 const VectorOperation::values operation,
    \n
    348 const std::shared_ptr<const Utilities::MPI::CommunicationPatternBase>
    \n-
    349 &communication_pattern = {})
    \n+
    349 &communication_pattern = {})
    \n
    350 {
    \n-
    351 import_elements(V, operation, communication_pattern);
    \n+
    351 import_elements(V, operation, communication_pattern);
    \n
    352 }
    \n
    \n
    353
    \n
    369 reference
    \n
    370 operator()(const size_type index);
    \n
    371
    \n
    379 value_type
    \n@@ -331,15 +331,15 @@\n
    453 void
    \n
    454 add(const double a, const Vector &V, const double b, const Vector &W);
    \n
    455
    \n
    460 void
    \n
    461 sadd(const double s, const double a, const Vector &V);
    \n
    462
    \n
    469 void
    \n-
    470 scale(const Vector &scaling_factors);
    \n+
    470 scale(const Vector &scaling_factors);
    \n
    471
    \n
    475 void
    \n
    476 equ(const double a, const Vector &V);
    \n
    477
    \n
    481 bool
    \n
    482 all_zero() const;
    \n
    483
    \n@@ -382,31 +382,31 @@\n
    624 Epetra_FEVector &
    \n
    625 trilinos_vector();
    \n
    626
    \n
    630 void
    \n
    631 print(std::ostream &out,
    \n
    632 const unsigned int precision = 3,
    \n
    633 const bool scientific = true,
    \n-
    634 const bool across = true) const;
    \n+
    634 const bool across = true) const;
    \n
    635
    \n
    639 std::size_t
    \n
    640 memory_consumption() const;
    \n
    641
    \n
    648 DeclException0(ExcDifferentParallelPartitioning);
    \n
    649
    \n
    655 DeclException0(ExcVectorTypeNotCompatible);
    \n
    656
    \n
    662 DeclException1(ExcTrilinosError,
    \n
    663 int,
    \n-
    664 << "An error with error number " << arg1
    \n+
    664 << "An error with error number " << arg1
    \n
    665 << " occurred while calling a Trilinos function");
    \n
    666
    \n
    667 private:
    \n
    673 void
    \n-
    674 create_epetra_comm_pattern(const IndexSet &source_index_set,
    \n+
    674 create_epetra_comm_pattern(const IndexSet &source_index_set,
    \n
    675 const MPI_Comm mpi_comm);
    \n
    676
    \n
    680 std::unique_ptr<Epetra_FEVector> vector;
    \n
    681
    \n
    685 ::IndexSet source_stored_elements;
    \n
    686
    \n
    691 std::shared_ptr<const CommunicationPattern> epetra_comm_pattern;
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__tpetra__vector_8h_source.html", "unified_diff": "@@ -299,39 +299,39 @@\n
    310 Vector();
    \n
    311
    \n
    316 Vector(const Vector &V);
    \n
    317
    \n
    321 Vector(
    \n
    322 const Teuchos::RCP<TpetraTypes::VectorType<Number, MemorySpace>> V);
    \n
    323
    \n-
    331 explicit Vector(const IndexSet &parallel_partitioner,
    \n+
    331 explicit Vector(const IndexSet &parallel_partitioner,
    \n
    332 const MPI_Comm communicator);
    \n
    333
    \n-
    348 explicit Vector(const IndexSet &locally_owned_entries,
    \n-
    349 const IndexSet &ghost_entries,
    \n+
    348 explicit Vector(const IndexSet &locally_owned_entries,
    \n+
    349 const IndexSet &ghost_entries,
    \n
    350 const MPI_Comm communicator,
    \n-
    351 const bool vector_writable = false);
    \n+
    351 const bool vector_writable = false);
    \n
    352
    \n
    357 void
    \n
    358 clear();
    \n
    359
    \n
    366 void
    \n-
    367 reinit(const IndexSet &parallel_partitioner,
    \n-
    368 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n-
    369 const bool omit_zeroing_entries = false);
    \n+
    367 reinit(const IndexSet &parallel_partitioner,
    \n+
    368 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n+
    369 const bool omit_zeroing_entries = false);
    \n
    370
    \n
    385 void
    \n-
    386 reinit(const IndexSet &locally_owned_entries,
    \n-
    387 const IndexSet &locally_relevant_or_ghost_entries,
    \n-
    388 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n-
    389 const bool vector_writable = false);
    \n+
    386 reinit(const IndexSet &locally_owned_entries,
    \n+
    387 const IndexSet &locally_relevant_or_ghost_entries,
    \n+
    388 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n+
    389 const bool vector_writable = false);
    \n
    390
    \n
    395 void
    \n
    396 reinit(const Vector<Number, MemorySpace> &V,
    \n-
    397 const bool omit_zeroing_entries = false);
    \n+
    397 const bool omit_zeroing_entries = false);
    \n
    398
    \n
    414 virtual void
    \n
    \n
    415 swap(Vector &v) noexcept;
    \n
    416
    \n
    420 virtual void
    \n
    421 extract_subvector_to(
    \n@@ -349,23 +349,23 @@\n
    471 operator=(const Number s);
    \n
    472
    \n
    481 void
    \n
    482 import_elements(
    \n
    483 const ReadWriteVector<Number> &V,
    \n
    484 VectorOperation::values operation,
    \n
    485 const Teuchos::RCP<const Utilities::MPI::CommunicationPatternBase>
    \n-
    486 &communication_pattern);
    \n+
    486 &communication_pattern);
    \n
    487
    \n
    491 DEAL_II_DEPRECATED
    \n
    492 void
    \n
    493 import_elements(
    \n
    494 const ReadWriteVector<Number> &V,
    \n
    495 VectorOperation::values operation,
    \n
    496 const std::shared_ptr<const Utilities::MPI::CommunicationPatternBase>
    \n-
    497 &communication_pattern);
    \n+
    497 &communication_pattern);
    \n
    498
    \n
    499 /*
    \n
    500 * Imports all the elements present in the vector's IndexSet from the
    \n
    501 * input vector @p V. VectorOperation::values @p operation is used to decide if
    \n
    502 * the elements in @p V should be added to the current vector or replace the
    \n
    503 * current elements.
    \n
    504 */
    \n@@ -375,17 +375,17 @@\n
    508
    \n
    512 DEAL_II_DEPRECATED
    \n
    513 void
    \n
    \n
    514 import(const ReadWriteVector<Number> &V,
    \n
    515 VectorOperation::values operation,
    \n
    516 std::shared_ptr<const Utilities::MPI::CommunicationPatternBase>
    \n-
    517 communication_pattern = {})
    \n+
    517 communication_pattern = {})
    \n
    518 {
    \n-
    519 import_elements(V, operation, communication_pattern);
    \n+
    519 import_elements(V, operation, communication_pattern);
    \n
    520 }
    \n
    \n
    521
    \n
    537 reference
    \n
    \n
    538 operator()(const size_type index);
    \n
    539
    \n@@ -447,15 +447,15 @@\n
    662 void
    \n
    \n
    663 set(const size_type n_elements,
    \n
    664 const size_type *indices,
    \n
    665 const Number *values);
    \n
    666
    \n
    673 void
    \n-
    674 scale(const Vector<Number, MemorySpace> &scaling_factors);
    \n+
    674 scale(const Vector<Number, MemorySpace> &scaling_factors);
    \n
    675
    \n
    679 void
    \n
    680 equ(const Number a, const Vector<Number, MemorySpace> &V);
    \n
    681
    \n
    685 bool
    \n
    686 all_zero() const;
    \n
    687
    \n@@ -529,15 +529,15 @@\n
    925 Teuchos::RCP<TpetraTypes::VectorType<Number, MemorySpace>>
    \n
    926 trilinos_rcp();
    \n
    927
    \n
    931 void
    \n
    932 print(std::ostream &out,
    \n
    933 const unsigned int precision = 3,
    \n
    934 const bool scientific = true,
    \n-
    935 const bool across = true) const;
    \n+
    935 const bool across = true) const;
    \n
    936
    \n
    940 std::size_t
    \n
    941 memory_consumption() const;
    \n
    942
    \n
    946 MPI_Comm
    \n
    947 mpi_comm() const;
    \n
    948
    \n@@ -552,20 +552,20 @@\n
    971 */
    \n
    972 DeclException4(
    \n
    973 ExcAccessToNonLocalElement,
    \n
    974 size_type,
    \n
    975 size_type,
    \n
    976 size_type,
    \n
    977 size_type,
    \n-
    978 << "You are trying to access element " << arg1
    \n+
    978 << "You are trying to access element " << arg1
    \n
    979 << " of a distributed vector, but this element is not stored "
    \n-
    980 << "on the current processor. Note: There are " << arg2
    \n+
    980 << "on the current processor. Note: There are " << arg2
    \n
    981 << " elements stored "
    \n-
    982 << "on the current processor from within the range [" << arg3 << ','
    \n-
    983 << arg4 << "] but Trilinos vectors need not store contiguous "
    \n+
    982 << "on the current processor from within the range [" << arg3 << ','
    \n+
    983 << arg4 << "] but Trilinos vectors need not store contiguous "
    \n
    984 << "ranges on each processor, and not every element in "
    \n
    985 << "this range may in fact be stored locally."
    \n
    986 << "\\n\\n"
    \n
    987 << "A common source for this kind of problem is that you "
    \n
    988 << "are passing a 'fully distributed' vector into a function "
    \n
    989 << "that needs read access to vector elements that correspond "
    \n
    990 << "to degrees of freedom on ghost cells (or at least to "
    \n@@ -579,20 +579,20 @@\n
    1003 "must be provided. These index sets must be "
    \n
    1004 "provided either when the vector is initialized "
    \n
    1005 "or when compress is called. See the documentation "
    \n
    1006 "of compress() for more information.");
    \n
    1007
    \n
    1013 DeclException1(ExcTrilinosError,
    \n
    1014 int,
    \n-
    1015 << "An error with error number " << arg1
    \n+
    1015 << "An error with error number " << arg1
    \n
    1016 << " occurred while calling a Trilinos function");
    \n
    1017
    \n
    1018 private:
    \n
    1024 void
    \n-
    1025 create_tpetra_comm_pattern(const IndexSet &source_index_set,
    \n+
    1025 create_tpetra_comm_pattern(const IndexSet &source_index_set,
    \n
    1026 const MPI_Comm mpi_comm);
    \n
    1027
    \n
    1032 bool compressed;
    \n
    1033
    \n
    1042 bool has_ghost;
    \n
    1043
    \n
    1047 Teuchos::RCP<TpetraTypes::VectorType<Number, MemorySpace>> vector;
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8cc_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8cc_source.html", "unified_diff": "@@ -196,15 +196,15 @@\n
    88
    \n
    89
    \n
    \n
    90 Vector::Vector(const IndexSet &parallel_partitioning,
    \n
    91 const MPI_Comm communicator)
    \n
    92 : Vector()
    \n
    93 {
    \n-
    94 reinit(parallel_partitioning, communicator);
    \n+
    94 reinit(parallel_partitioning, communicator);
    \n
    95 }
    \n
    \n
    96
    \n
    97
    \n
    98
    \n
    \n
    99 Vector::Vector(const Vector &v)
    \n@@ -232,23 +232,23 @@\n
    118
    \n
    \n
    119 Vector::Vector(const IndexSet &parallel_partitioner,
    \n
    120 const Vector &v,
    \n
    121 const MPI_Comm communicator)
    \n
    122 : Vector()
    \n
    123 {
    \n-
    124 AssertThrow(parallel_partitioner.size() ==
    \n+
    124 AssertThrow(parallel_partitioner.size() ==
    \n
    125 static_cast<size_type>(
    \n
    126 TrilinosWrappers::n_global_elements(v.vector->Map())),
    \n-
    127 ExcDimensionMismatch(parallel_partitioner.size(),
    \n+
    127 ExcDimensionMismatch(parallel_partitioner.size(),
    \n
    128 TrilinosWrappers::n_global_elements(
    \n
    129 v.vector->Map())));
    \n
    130
    \n
    131 vector = std::make_unique<Epetra_FEVector>(
    \n-
    132 parallel_partitioner.make_trilinos_map(communicator, true));
    \n+
    132 parallel_partitioner.make_trilinos_map(communicator, true));
    \n
    133 reinit(v, false, true);
    \n
    134 }
    \n
    \n
    135
    \n
    136
    \n
    137
    \n
    \n@@ -265,37 +265,37 @@\n
    147
    \n
    148 void
    \n
    \n
    149 Vector::clear()
    \n
    150 {
    \n
    151 // When we clear the vector, reset the pointer and generate an empty
    \n
    152 // vector.
    \n-
    153 Epetra_Map map(0, 0, Epetra_MpiComm(MPI_COMM_SELF));
    \n+
    153 Epetra_Map map(0, 0, Epetra_MpiComm(MPI_COMM_SELF));
    \n
    154
    \n
    155 has_ghosts = false;
    \n
    156 vector = std::make_unique<Epetra_FEVector>(map);
    \n-
    157 last_action = Zero;
    \n+
    157 last_action = Zero;
    \n
    158 }
    \n
    \n
    159
    \n
    160
    \n
    161
    \n
    162 void
    \n
    \n
    163 Vector::reinit(const IndexSet &parallel_partitioner,
    \n
    164 const MPI_Comm communicator,
    \n
    165 const bool /*omit_zeroing_entries*/)
    \n
    166 {
    \n
    167 nonlocal_vector.reset();
    \n
    168
    \n
    169 const bool overlapping =
    \n-
    170 !parallel_partitioner.is_ascending_and_one_to_one(communicator);
    \n+
    170 !parallel_partitioner.is_ascending_and_one_to_one(communicator);
    \n
    171
    \n
    172 Epetra_Map map =
    \n-
    173 parallel_partitioner.make_trilinos_map(communicator, overlapping);
    \n+
    173 parallel_partitioner.make_trilinos_map(communicator, overlapping);
    \n
    174
    \n
    175 vector = std::make_unique<Epetra_FEVector>(map);
    \n
    176
    \n
    177 has_ghosts = vector->Map().UniqueGIDs() == false;
    \n
    178
    \n
    179 // If the IndexSets are overlapping, we don't really know
    \n
    180 // which process owns what. So we decide that no process
    \n@@ -303,24 +303,24 @@\n
    182 // the locally owned elements is not allowed.
    \n
    183 if (has_ghosts)
    \n
    184 {
    \n
    185 owned_elements.clear();
    \n
    186 owned_elements.set_size(0);
    \n
    187 }
    \n
    188 else
    \n-
    189 owned_elements = parallel_partitioner;
    \n+
    189 owned_elements = parallel_partitioner;
    \n
    190
    \n
    191# ifdef DEBUG
    \n-
    192 const size_type n_elements_global =
    \n+
    192 const size_type n_elements_global =
    \n
    193 Utilities::MPI::sum(owned_elements.n_elements(), communicator);
    \n
    194
    \n-
    195 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n+
    195 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n
    196# endif
    \n
    197
    \n-
    198 last_action = Zero;
    \n+
    198 last_action = Zero;
    \n
    199 }
    \n
    \n
    200
    \n
    201
    \n
    202
    \n
    203 void
    \n
    \n@@ -329,80 +329,80 @@\n
    206 const bool allow_different_maps)
    \n
    207 {
    \n
    208 nonlocal_vector.reset();
    \n
    209
    \n
    210 // In case we do not allow to have different maps, this call means that
    \n
    211 // we have to reset the vector. So clear the vector, initialize our map
    \n
    212 // with the map in v, and generate the vector.
    \n-
    213 if (allow_different_maps == false)
    \n+
    213 if (allow_different_maps == false)
    \n
    214 {
    \n
    215 // check equality for MPI communicators: We can only choose the fast
    \n
    216 // version in case the underlying Epetra_MpiComm object is the same,
    \n
    217 // otherwise we might access an MPI_Comm object that has been
    \n
    218 // deleted
    \n-
    219 const Epetra_MpiComm *my_comm =
    \n+
    219 const Epetra_MpiComm *my_comm =
    \n
    220 dynamic_cast<const Epetra_MpiComm *>(&vector->Comm());
    \n-
    221 const Epetra_MpiComm *v_comm =
    \n+
    221 const Epetra_MpiComm *v_comm =
    \n
    222 dynamic_cast<const Epetra_MpiComm *>(&v.vector->Comm());
    \n-
    223 const bool same_communicators =
    \n-
    224 my_comm != nullptr && v_comm != nullptr &&
    \n-
    225 my_comm->DataPtr() == v_comm->DataPtr();
    \n-
    226 if (!same_communicators ||
    \n+
    223 const bool same_communicators =
    \n+
    224 my_comm != nullptr && v_comm != nullptr &&
    \n+
    225 my_comm->DataPtr() == v_comm->DataPtr();
    \n+
    226 if (!same_communicators ||
    \n
    227 vector->Map().SameAs(v.vector->Map()) == false)
    \n
    228 {
    \n
    229 vector = std::make_unique<Epetra_FEVector>(v.vector->Map());
    \n
    230 has_ghosts = v.has_ghosts;
    \n-
    231 last_action = Zero;
    \n+
    231 last_action = Zero;
    \n
    232 owned_elements = v.owned_elements;
    \n
    233 }
    \n-
    234 else if (omit_zeroing_entries == false)
    \n+
    234 else if (omit_zeroing_entries == false)
    \n
    235 {
    \n
    236 // old and new vectors have exactly the same map, i.e. size and
    \n
    237 // parallel distribution
    \n-
    238 int ierr;
    \n-
    239 ierr = vector->GlobalAssemble(last_action);
    \n-
    240 (void)ierr;
    \n-
    241 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    238 int ierr;
    \n+
    239 ierr = vector->GlobalAssemble(last_action);
    \n+
    240 (void)ierr;
    \n+
    241 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n
    242
    \n-
    243 ierr = vector->PutScalar(0.0);
    \n-
    244 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    243 ierr = vector->PutScalar(0.0);
    \n+
    244 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n
    245
    \n-
    246 last_action = Zero;
    \n+
    246 last_action = Zero;
    \n
    247 }
    \n
    248 }
    \n
    249
    \n
    250 // Otherwise, we have to check that the two vectors are already of the
    \n
    251 // same size, create an object for the data exchange and then insert all
    \n
    252 // the data. The first assertion is only a check whether the user knows
    \n
    253 // what they are doing.
    \n
    254 else
    \n
    255 {
    \n-
    256 Assert(omit_zeroing_entries == false,
    \n+
    256 Assert(omit_zeroing_entries == false,
    \n
    257 ExcMessage(
    \n
    258 "It is not possible to exchange data with the "
    \n
    259 "option 'omit_zeroing_entries' set, which would not write "
    \n
    260 "elements."));
    \n
    261
    \n
    262 AssertThrow(size() == v.size(),
    \n
    263 ExcDimensionMismatch(size(), v.size()));
    \n
    264
    \n-
    265 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n+
    265 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n
    266
    \n-
    267 const int ierr = vector->Import(*v.vector, data_exchange, Insert);
    \n-
    268 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    267 const int ierr = vector->Import(*v.vector, data_exchange, Insert);
    \n+
    268 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    269
    \n-
    270 last_action = Insert;
    \n+
    270 last_action = Insert;
    \n
    271 }
    \n
    272# ifdef DEBUG
    \n-
    273 const Epetra_MpiComm *comm_ptr =
    \n+
    273 const Epetra_MpiComm *comm_ptr =
    \n
    274 dynamic_cast<const Epetra_MpiComm *>(&(v.vector->Comm()));
    \n-
    275 Assert(comm_ptr != nullptr, ExcInternalError());
    \n-
    276 const size_type n_elements_global =
    \n-
    277 Utilities::MPI::sum(owned_elements.n_elements(), comm_ptr->Comm());
    \n-
    278 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n+
    275 Assert(comm_ptr != nullptr, ExcInternalError());
    \n+
    276 const size_type n_elements_global =
    \n+
    277 Utilities::MPI::sum(owned_elements.n_elements(), comm_ptr->Comm());
    \n+
    278 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n
    279# endif
    \n
    280 }
    \n
    \n
    281
    \n
    282
    \n
    283
    \n
    284 void
    \n@@ -417,155 +417,155 @@\n
    292 // we have to reset the vector. So clear the vector, initialize our map
    \n
    293 // with the map in v, and generate the vector.
    \n
    294 if (v.n_blocks() == 0)
    \n
    295 return;
    \n
    296
    \n
    297 // create a vector that holds all the elements contained in the block
    \n
    298 // vector. need to manually create an Epetra_Map.
    \n-
    299 size_type n_elements = 0, added_elements = 0, block_offset = 0;
    \n+
    299 size_type n_elements = 0, added_elements = 0, block_offset = 0;
    \n
    300 for (size_type block = 0; block < v.n_blocks(); ++block)
    \n
    301 n_elements += v.block(block).vector->Map().NumMyElements();
    \n-
    302 std::vector<TrilinosWrappers::types::int_type> global_ids(n_elements, -1);
    \n+
    302 std::vector<TrilinosWrappers::types::int_type> global_ids(n_elements, -1);
    \n
    303 for (size_type block = 0; block < v.n_blocks(); ++block)
    \n
    304 {
    \n-
    305 TrilinosWrappers::types::int_type *glob_elements =
    \n+
    305 TrilinosWrappers::types::int_type *glob_elements =
    \n
    306 TrilinosWrappers::my_global_elements(
    \n
    307 v.block(block).trilinos_partitioner());
    \n-
    308 size_type vector_size = v.block(block).vector->Map().NumMyElements();
    \n-
    309 for (size_type i = 0; i < vector_size; ++i)
    \n-
    310 global_ids[added_elements++] = glob_elements[i] + block_offset;
    \n+
    308 size_type vector_size = v.block(block).vector->Map().NumMyElements();
    \n+
    309 for (size_type i = 0; i < vector_size; ++i)
    \n+
    310 global_ids[added_elements++] = glob_elements[i] + block_offset;
    \n
    311 owned_elements.add_indices(v.block(block).owned_elements,
    \n-
    312 block_offset);
    \n-
    313 block_offset += v.block(block).size();
    \n+
    312 block_offset);
    \n+
    313 block_offset += v.block(block).size();
    \n
    314 }
    \n
    315
    \n-
    316 Assert(n_elements == added_elements, ExcInternalError());
    \n-
    317 Epetra_Map new_map(v.size(),
    \n+
    316 Assert(n_elements == added_elements, ExcInternalError());
    \n+
    317 Epetra_Map new_map(v.size(),
    \n
    318 n_elements,
    \n-
    319 global_ids.data(),
    \n+
    319 global_ids.data(),
    \n
    320 0,
    \n
    321 v.block(0).trilinos_partitioner().Comm());
    \n
    322
    \n-
    323 auto actual_vec = std::make_unique<Epetra_FEVector>(new_map);
    \n+
    323 auto actual_vec = std::make_unique<Epetra_FEVector>(new_map);
    \n
    324
    \n
    325 TrilinosScalar *entries = (*actual_vec)[0];
    \n
    326 for (size_type block = 0; block < v.n_blocks(); ++block)
    \n
    327 {
    \n
    328 v.block(block).trilinos_vector().ExtractCopy(entries, 0);
    \n
    329 entries += v.block(block).vector->Map().NumMyElements();
    \n
    330 }
    \n
    331
    \n
    332 if (import_data == true)
    \n
    333 {
    \n
    334 AssertThrow(static_cast<size_type>(TrilinosWrappers::global_length(
    \n-
    335 *actual_vec)) == v.size(),
    \n+
    335 *actual_vec)) == v.size(),
    \n
    336 ExcDimensionMismatch(TrilinosWrappers::global_length(
    \n-
    337 *actual_vec),
    \n+
    337 *actual_vec),
    \n
    338 v.size()));
    \n
    339
    \n-
    340 Epetra_Import data_exchange(vector->Map(), actual_vec->Map());
    \n+
    340 Epetra_Import data_exchange(vector->Map(), actual_vec->Map());
    \n
    341
    \n-
    342 const int ierr = vector->Import(*actual_vec, data_exchange, Insert);
    \n-
    343 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    342 const int ierr = vector->Import(*actual_vec, data_exchange, Insert);
    \n+
    343 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    344
    \n-
    345 last_action = Insert;
    \n+
    345 last_action = Insert;
    \n
    346 }
    \n
    347 else
    \n-
    348 vector = std::move(actual_vec);
    \n+
    348 vector = std::move(actual_vec);
    \n
    349# ifdef DEBUG
    \n-
    350 const Epetra_MpiComm *comm_ptr =
    \n+
    350 const Epetra_MpiComm *comm_ptr =
    \n
    351 dynamic_cast<const Epetra_MpiComm *>(&(vector->Comm()));
    \n-
    352 Assert(comm_ptr != nullptr, ExcInternalError());
    \n-
    353 const size_type n_elements_global =
    \n-
    354 Utilities::MPI::sum(owned_elements.n_elements(), comm_ptr->Comm());
    \n+
    352 Assert(comm_ptr != nullptr, ExcInternalError());
    \n+
    353 const size_type n_elements_global =
    \n+
    354 Utilities::MPI::sum(owned_elements.n_elements(), comm_ptr->Comm());
    \n
    355
    \n-
    356 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n+
    356 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n
    357# endif
    \n
    358 }
    \n
    \n
    359
    \n
    360
    \n
    361
    \n
    362 void
    \n
    \n
    363 Vector::reinit(const IndexSet &locally_owned_entries,
    \n
    364 const IndexSet &ghost_entries,
    \n
    365 const MPI_Comm communicator,
    \n
    366 const bool vector_writable)
    \n
    367 {
    \n
    368 nonlocal_vector.reset();
    \n-
    369 owned_elements = locally_owned_entries;
    \n-
    370 if (vector_writable == false)
    \n+
    369 owned_elements = locally_owned_entries;
    \n+
    370 if (vector_writable == false)
    \n
    371 {
    \n-
    372 IndexSet parallel_partitioner = locally_owned_entries;
    \n-
    373 parallel_partitioner.add_indices(ghost_entries);
    \n+
    372 IndexSet parallel_partitioner = locally_owned_entries;
    \n+
    373 parallel_partitioner.add_indices(ghost_entries);
    \n
    374 Epetra_Map map =
    \n-
    375 parallel_partitioner.make_trilinos_map(communicator, true);
    \n+
    375 parallel_partitioner.make_trilinos_map(communicator, true);
    \n
    376 vector = std::make_unique<Epetra_FEVector>(map);
    \n
    377 }
    \n
    378 else
    \n
    379 {
    \n
    380 Epetra_Map map =
    \n-
    381 locally_owned_entries.make_trilinos_map(communicator, true);
    \n+
    381 locally_owned_entries.make_trilinos_map(communicator, true);
    \n
    382 Assert(map.IsOneToOne(),
    \n
    383 ExcMessage("A writable vector must not have ghost entries in "
    \n
    384 "its parallel partitioning"));
    \n
    385
    \n
    386 if (vector->Map().SameAs(map) == false)
    \n
    387 vector = std::make_unique<Epetra_FEVector>(map);
    \n
    388 else
    \n
    389 {
    \n-
    390 const int ierr = vector->PutScalar(0.);
    \n-
    391 (void)ierr;
    \n-
    392 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n+
    390 const int ierr = vector->PutScalar(0.);
    \n+
    391 (void)ierr;
    \n+
    392 Assert(ierr == 0, ExcTrilinosError(ierr));
    \n
    393 }
    \n
    394
    \n-
    395 IndexSet nonlocal_entries(ghost_entries);
    \n-
    396 nonlocal_entries.subtract_set(locally_owned_entries);
    \n+
    395 IndexSet nonlocal_entries(ghost_entries);
    \n+
    396 nonlocal_entries.subtract_set(locally_owned_entries);
    \n
    397 if (Utilities::MPI::n_mpi_processes(communicator) > 1)
    \n
    398 {
    \n-
    399 Epetra_Map nonlocal_map =
    \n-
    400 nonlocal_entries.make_trilinos_map(communicator, true);
    \n+
    399 Epetra_Map nonlocal_map =
    \n+
    400 nonlocal_entries.make_trilinos_map(communicator, true);
    \n
    401 nonlocal_vector =
    \n-
    402 std::make_unique<Epetra_MultiVector>(nonlocal_map, 1);
    \n+
    402 std::make_unique<Epetra_MultiVector>(nonlocal_map, 1);
    \n
    403 }
    \n
    404 }
    \n
    405
    \n
    406 has_ghosts = vector->Map().UniqueGIDs() == false;
    \n
    407
    \n-
    408 last_action = Zero;
    \n+
    408 last_action = Zero;
    \n
    409
    \n
    410# ifdef DEBUG
    \n-
    411 const size_type n_elements_global =
    \n+
    411 const size_type n_elements_global =
    \n
    412 Utilities::MPI::sum(owned_elements.n_elements(), communicator);
    \n
    413
    \n-
    414 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n+
    414 Assert(has_ghosts || n_elements_global == size(), ExcInternalError());
    \n
    415# endif
    \n
    416 }
    \n
    \n
    417
    \n
    418
    \n
    419
    \n
    420 void
    \n
    \n
    421 Vector::reinit(
    \n
    422 const std::shared_ptr<const Utilities::MPI::Partitioner> &partitioner,
    \n
    423 const bool make_ghosted,
    \n
    424 const bool vector_writable)
    \n
    425 {
    \n-
    426 if (make_ghosted)
    \n+
    426 if (make_ghosted)
    \n
    427 {
    \n
    428 Assert(partitioner->ghost_indices_initialized(),
    \n
    429 ExcMessage("You asked to create a ghosted vector, but the "
    \n
    430 "partitioner does not provide ghost indices."));
    \n
    431
    \n
    432 this->reinit(partitioner->locally_owned_range(),
    \n
    433 partitioner->ghost_indices(),
    \n
    434 partitioner->get_mpi_communicator(),
    \n-
    435 vector_writable);
    \n+
    435 vector_writable);
    \n
    436 }
    \n
    437 else
    \n
    438 {
    \n
    439 this->reinit(partitioner->locally_owned_range(),
    \n
    440 partitioner->get_mpi_communicator());
    \n
    441 }
    \n
    442 }
    \n@@ -578,20 +578,20 @@\n
    447 Vector::operator=(const Vector &v)
    \n
    448 {
    \n
    449 Assert(vector.get() != nullptr,
    \n
    450 ExcMessage("Vector is not constructed properly."));
    \n
    451
    \n
    452 // check equality for MPI communicators to avoid accessing a possibly
    \n
    453 // invalid MPI_Comm object
    \n-
    454 const Epetra_MpiComm *my_comm =
    \n+
    454 const Epetra_MpiComm *my_comm =
    \n
    455 dynamic_cast<const Epetra_MpiComm *>(&vector->Comm());
    \n-
    456 const Epetra_MpiComm *v_comm =
    \n+
    456 const Epetra_MpiComm *v_comm =
    \n
    457 dynamic_cast<const Epetra_MpiComm *>(&v.vector->Comm());
    \n-
    458 const bool same_communicators = my_comm != nullptr && v_comm != nullptr &&
    \n-
    459 my_comm->DataPtr() == v_comm->DataPtr();
    \n+
    458 const bool same_communicators = my_comm != nullptr && v_comm != nullptr &&
    \n+
    459 my_comm->DataPtr() == v_comm->DataPtr();
    \n
    460 // Need to ask MPI whether the communicators are the same. We would like
    \n
    461 // to use the following checks but currently we cannot make sure the
    \n
    462 // memory of my_comm is not stale from some MPI_Comm_free
    \n
    463 // somewhere. This can happen when a vector lives in GrowingVectorMemory
    \n
    464 // data structures. Thus, the following code is commented out.
    \n
    465 //
    \n
    466 // if (my_comm != nullptr &&
    \n@@ -610,21 +610,21 @@\n
    479 // same_communicators = true;
    \n
    480 // }
    \n
    481
    \n
    482 // distinguish three cases. First case: both vectors have the same
    \n
    483 // layout (just need to copy the local data, not reset the memory and
    \n
    484 // the underlying Epetra_Map). The third case means that we have to
    \n
    485 // rebuild the calling vector.
    \n-
    486 if (same_communicators && v.vector->Map().SameAs(vector->Map()))
    \n+
    486 if (same_communicators && v.vector->Map().SameAs(vector->Map()))
    \n
    487 {
    \n
    488 *vector = *v.vector;
    \n
    489 if (v.nonlocal_vector.get() != nullptr)
    \n
    490 nonlocal_vector =
    \n
    491 std::make_unique<Epetra_MultiVector>(v.nonlocal_vector->Map(), 1);
    \n-
    492 last_action = Zero;
    \n+
    492 last_action = Zero;
    \n
    493 }
    \n
    494 // Second case: vectors have the same global
    \n
    495 // size, but different parallel layouts (and
    \n
    496 // one of them a one-to-one mapping). Then we
    \n
    497 // can call the import/export functionality.
    \n
    498 else if (size() == v.size() &&
    \n
    499 (v.vector->Map().UniqueGIDs() || vector->Map().UniqueGIDs()))
    \n@@ -632,15 +632,15 @@\n
    501 reinit(v, false, true);
    \n
    502 }
    \n
    503 // Third case: Vectors do not have the same
    \n
    504 // size.
    \n
    505 else
    \n
    506 {
    \n
    507 vector = std::make_unique<Epetra_FEVector>(*v.vector);
    \n-
    508 last_action = Zero;
    \n+
    508 last_action = Zero;
    \n
    509 has_ghosts = v.has_ghosts;
    \n
    510 owned_elements = v.owned_elements;
    \n
    511 }
    \n
    512
    \n
    513 if (v.nonlocal_vector.get() != nullptr)
    \n
    514 nonlocal_vector =
    \n
    515 std::make_unique<Epetra_MultiVector>(v.nonlocal_vector->Map(), 1);
    \n@@ -697,20 +697,20 @@\n
    560 ExcMessage("The input vector has overlapping data, "
    \n
    561 "which is not allowed."));
    \n
    562
    \n
    563 if (vector->Map().SameAs(m.trilinos_matrix().ColMap()) == false)
    \n
    564 vector =
    \n
    565 std::make_unique<Epetra_FEVector>(m.trilinos_matrix().ColMap());
    \n
    566
    \n-
    567 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n-
    568 const int ierr = vector->Import(*v.vector, data_exchange, Insert);
    \n+
    567 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n+
    568 const int ierr = vector->Import(*v.vector, data_exchange, Insert);
    \n
    569
    \n-
    570 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    570 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    571
    \n-
    572 last_action = Insert;
    \n+
    572 last_action = Insert;
    \n
    573 }
    \n
    \n
    574
    \n
    575
    \n
    576 void
    \n
    \n
    577 Vector::import_elements(const LinearAlgebra::ReadWriteVector<double> &rwv,
    \n@@ -725,20 +725,20 @@\n
    586 // this class will (hopefully) be retired eventually.
    \n
    587 Assert(this->locally_owned_elements() == rwv.get_stored_elements(),
    \n
    588 ExcNotImplemented());
    \n
    589
    \n
    590 if (operation == VectorOperation::insert)
    \n
    591 {
    \n
    592 for (const auto idx : this->locally_owned_elements())
    \n-
    593 (*this)[idx] = rwv[idx];
    \n+
    593 (*this)[idx] = rwv[idx];
    \n
    594 }
    \n
    595 else if (operation == VectorOperation::add)
    \n
    596 {
    \n
    597 for (const auto idx : this->locally_owned_elements())
    \n-
    598 (*this)[idx] += rwv[idx];
    \n+
    598 (*this)[idx] += rwv[idx];
    \n
    599 }
    \n
    600 else
    \n
    601 AssertThrow(false, ExcNotImplemented());
    \n
    602
    \n
    603 this->compress(operation);
    \n
    604 }
    \n
    \n@@ -758,93 +758,93 @@\n
    617
    \n
    618 // Select which mode to send to Trilinos. Note that we use last_action if
    \n
    619 // available and ignore what the user tells us to detect wrongly mixed
    \n
    620 // operations. Typically given_last_action is only used on machines that
    \n
    621 // do not execute an operation (because they have no own cells for
    \n
    622 // example).
    \n
    623 Epetra_CombineMode mode = last_action;
    \n-
    624 if (last_action == Zero)
    \n+
    624 if (last_action == Zero)
    \n
    625 {
    \n-
    626 if (given_last_action == VectorOperation::add)
    \n-
    627 mode = Add;
    \n-
    628 else if (given_last_action == VectorOperation::insert)
    \n-
    629 mode = Insert;
    \n+
    626 if (given_last_action == VectorOperation::add)
    \n+
    627 mode = Add;
    \n+
    628 else if (given_last_action == VectorOperation::insert)
    \n+
    629 mode = Insert;
    \n
    630 else
    \n
    631 Assert(
    \n
    632 false,
    \n
    633 ExcMessage(
    \n
    634 "compress() can only be called with VectorOperation add, insert, or unknown"));
    \n
    635 }
    \n
    636 else
    \n
    637 {
    \n
    638 Assert(
    \n-
    639 ((last_action == Add) &&
    \n-
    640 (given_last_action == VectorOperation::add)) ||
    \n-
    641 ((last_action == Insert) &&
    \n-
    642 (given_last_action == VectorOperation::insert)),
    \n+
    639 ((last_action == Add) &&
    \n+
    640 (given_last_action == VectorOperation::add)) ||
    \n+
    641 ((last_action == Insert) &&
    \n+
    642 (given_last_action == VectorOperation::insert)),
    \n
    643 ExcMessage(
    \n
    644 "The last operation on the Vector and the given last action in the compress() call do not agree!"));
    \n
    645 }
    \n
    646
    \n
    647
    \n
    648# ifdef DEBUG
    \n
    649 // check that every process has decided to use the same mode. This will
    \n
    650 // otherwise result in undefined behavior in the call to
    \n
    651 // GlobalAssemble().
    \n-
    652 const double double_mode = mode;
    \n-
    653 const Epetra_MpiComm *comm_ptr =
    \n+
    652 const double double_mode = mode;
    \n+
    653 const Epetra_MpiComm *comm_ptr =
    \n
    654 dynamic_cast<const Epetra_MpiComm *>(&(trilinos_partitioner().Comm()));
    \n-
    655 Assert(comm_ptr != nullptr, ExcInternalError());
    \n+
    655 Assert(comm_ptr != nullptr, ExcInternalError());
    \n
    656
    \n-
    657 const Utilities::MPI::MinMaxAvg result =
    \n-
    658 Utilities::MPI::min_max_avg(double_mode, comm_ptr->GetMpiComm());
    \n-
    659 Assert(result.max == result.min,
    \n+
    657 const Utilities::MPI::MinMaxAvg result =
    \n+
    658 Utilities::MPI::min_max_avg(double_mode, comm_ptr->GetMpiComm());
    \n+
    659 Assert(result.max == result.min,
    \n
    660 ExcMessage(
    \n
    661 "Not all processors agree whether the last operation on "
    \n
    662 "this vector was an addition or a set operation. This will "
    \n
    663 "prevent the compress() operation from succeeding."));
    \n
    664
    \n
    665# endif
    \n
    666
    \n
    667 // Now pass over the information about what we did last to the vector.
    \n-
    668 if (nonlocal_vector.get() == nullptr || mode != Add)
    \n+
    668 if (nonlocal_vector.get() == nullptr || mode != Add)
    \n
    669 {
    \n-
    670 const auto ierr = vector->GlobalAssemble(mode);
    \n-
    671 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    670 const auto ierr = vector->GlobalAssemble(mode);
    \n+
    671 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    672 }
    \n
    673 else
    \n
    674 {
    \n-
    675 Epetra_Export exporter(nonlocal_vector->Map(), vector->Map());
    \n+
    675 Epetra_Export exporter(nonlocal_vector->Map(), vector->Map());
    \n
    676
    \n-
    677 int ierr = vector->Export(*nonlocal_vector, exporter, mode);
    \n-
    678 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    677 int ierr = vector->Export(*nonlocal_vector, exporter, mode);
    \n+
    678 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    679
    \n-
    680 ierr = nonlocal_vector->PutScalar(0.);
    \n-
    681 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    680 ierr = nonlocal_vector->PutScalar(0.);
    \n+
    681 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    682 }
    \n-
    683 last_action = Zero;
    \n+
    683 last_action = Zero;
    \n
    684
    \n
    685 compressed = true;
    \n
    686 }
    \n
    \n
    687
    \n
    688
    \n
    689
    \n
    690 TrilinosScalar
    \n
    \n
    691 Vector::operator()(const size_type index) const
    \n
    692 {
    \n
    693 // Extract local indices in the vector.
    \n-
    694 TrilinosWrappers::types::int_type trilinos_i = vector->Map().LID(
    \n+
    694 TrilinosWrappers::types::int_type trilinos_i = vector->Map().LID(
    \n
    695 static_cast<TrilinosWrappers::types::int_type>(index));
    \n
    696 TrilinosScalar value = 0.;
    \n
    697
    \n
    698 // If the element is not present on the current processor, we can't
    \n
    699 // continue. This is the main difference to the el() function.
    \n-
    700 if (trilinos_i == -1)
    \n+
    700 if (trilinos_i == -1)
    \n
    701 {
    \n
    702# ifndef DEAL_II_WITH_64BIT_INDICES
    \n
    703 Assert(false,
    \n
    704 ExcAccessToNonLocalElement(index,
    \n
    705 vector->Map().NumMyElements(),
    \n
    706 vector->Map().MinMyGID(),
    \n
    707 vector->Map().MaxMyGID()));
    \n@@ -853,52 +853,52 @@\n
    710 ExcAccessToNonLocalElement(index,
    \n
    711 vector->Map().NumMyElements(),
    \n
    712 vector->Map().MinMyGID64(),
    \n
    713 vector->Map().MaxMyGID64()));
    \n
    714# endif
    \n
    715 }
    \n
    716 else
    \n-
    717 value = (*vector)[0][trilinos_i];
    \n+
    717 value = (*vector)[0][trilinos_i];
    \n
    718
    \n
    719 return value;
    \n
    720 }
    \n
    \n
    721
    \n
    722
    \n
    723
    \n
    724 void
    \n
    \n
    725 Vector::add(const Vector &v, const bool allow_different_maps)
    \n
    726 {
    \n-
    727 if (allow_different_maps == false)
    \n+
    727 if (allow_different_maps == false)
    \n
    728 *this += v;
    \n
    729 else
    \n
    730 {
    \n
    731 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    732 AssertThrow(size() == v.size(),
    \n
    733 ExcDimensionMismatch(size(), v.size()));
    \n
    734
    \n
    735# if DEAL_II_TRILINOS_VERSION_GTE(11, 11, 0)
    \n-
    736 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n-
    737 int ierr =
    \n-
    738 vector->Import(*v.vector, data_exchange, Epetra_AddLocalAlso);
    \n-
    739 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n-
    740 last_action = Add;
    \n+
    736 Epetra_Import data_exchange(vector->Map(), v.vector->Map());
    \n+
    737 int ierr =
    \n+
    738 vector->Import(*v.vector, data_exchange, Epetra_AddLocalAlso);
    \n+
    739 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    740 last_action = Add;
    \n
    741# else
    \n
    742 // In versions older than 11.11 the Import function is broken for
    \n
    743 // adding Hence, we provide a workaround in this case
    \n
    744
    \n-
    745 Epetra_MultiVector dummy(vector->Map(), 1, false);
    \n-
    746 Epetra_Import data_exchange(dummy.Map(), v.vector->Map());
    \n+
    745 Epetra_MultiVector dummy(vector->Map(), 1, false);
    \n+
    746 Epetra_Import data_exchange(dummy.Map(), v.vector->Map());
    \n
    747
    \n-
    748 int ierr = dummy.Import(*v.vector, data_exchange, Insert);
    \n-
    749 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    748 int ierr = dummy.Import(*v.vector, data_exchange, Insert);
    \n+
    749 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    750
    \n-
    751 ierr = vector->Update(1.0, dummy, 1.0);
    \n-
    752 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    751 ierr = vector->Update(1.0, dummy, 1.0);
    \n+
    752 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    753# endif
    \n
    754 }
    \n
    755 }
    \n
    \n
    756
    \n
    757
    \n
    758
    \n@@ -906,16 +906,16 @@\n
    \n
    760 Vector::operator==(const Vector &v) const
    \n
    761 {
    \n
    762 Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
    \n
    763 if (vector->Map().NumMyElements() != v.vector->Map().NumMyElements())
    \n
    764 return false;
    \n
    765
    \n-
    766 size_type vector_size = vector->Map().NumMyElements();
    \n-
    767 for (size_type i = 0; i < vector_size; ++i)
    \n+
    766 size_type vector_size = vector->Map().NumMyElements();
    \n+
    767 for (size_type i = 0; i < vector_size; ++i)
    \n
    768 if ((*(v.vector))[0][i] != (*vector)[0][i])
    \n
    769 return false;
    \n
    770
    \n
    771 return true;
    \n
    772 }
    \n
    \n
    773
    \n@@ -935,108 +935,108 @@\n
    785
    \n
    786 bool
    \n
    \n
    787 Vector::all_zero() const
    \n
    788 {
    \n
    789 // get a representation of the vector and
    \n
    790 // loop over all the elements
    \n-
    791 TrilinosScalar *start_ptr = (*vector)[0];
    \n-
    792 const TrilinosScalar *ptr = start_ptr,
    \n-
    793 *eptr = start_ptr + vector->Map().NumMyElements();
    \n+
    791 TrilinosScalar *start_ptr = (*vector)[0];
    \n+
    792 const TrilinosScalar *ptr = start_ptr,
    \n+
    793 *eptr = start_ptr + vector->Map().NumMyElements();
    \n
    794 unsigned int flag = 0;
    \n-
    795 while (ptr != eptr)
    \n+
    795 while (ptr != eptr)
    \n
    796 {
    \n
    797 if (*ptr != 0)
    \n
    798 {
    \n
    799 flag = 1;
    \n
    800 break;
    \n
    801 }
    \n
    802 ++ptr;
    \n
    803 }
    \n
    804
    \n
    805 // in parallel, check that the vector
    \n
    806 // is zero on _all_ processors.
    \n
    807 const Epetra_MpiComm *mpi_comm =
    \n
    808 dynamic_cast<const Epetra_MpiComm *>(&vector->Map().Comm());
    \n
    809 Assert(mpi_comm != nullptr, ExcInternalError());
    \n-
    810 unsigned int num_nonzero = Utilities::MPI::sum(flag, mpi_comm->Comm());
    \n-
    811 return num_nonzero == 0;
    \n+
    810 unsigned int num_nonzero = Utilities::MPI::sum(flag, mpi_comm->Comm());
    \n+
    811 return num_nonzero == 0;
    \n
    812 }
    \n
    \n
    813
    \n
    814
    \n
    815
    \n
    816 bool
    \n
    \n
    817 Vector::is_non_negative() const
    \n
    818 {
    \n
    819 // get a representation of the vector and
    \n
    820 // loop over all the elements
    \n-
    821 TrilinosScalar *start_ptr = (*vector)[0];
    \n-
    822 const TrilinosScalar *ptr = start_ptr,
    \n-
    823 *eptr = start_ptr + vector->Map().NumMyElements();
    \n+
    821 TrilinosScalar *start_ptr = (*vector)[0];
    \n+
    822 const TrilinosScalar *ptr = start_ptr,
    \n+
    823 *eptr = start_ptr + vector->Map().NumMyElements();
    \n
    824 unsigned int flag = 0;
    \n-
    825 while (ptr != eptr)
    \n+
    825 while (ptr != eptr)
    \n
    826 {
    \n
    827 if (*ptr < 0.0)
    \n
    828 {
    \n
    829 flag = 1;
    \n
    830 break;
    \n
    831 }
    \n
    832 ++ptr;
    \n
    833 }
    \n
    834
    \n
    835 // in parallel, check that the vector
    \n
    836 // is zero on _all_ processors.
    \n-
    837 const auto max_n_negative =
    \n+
    837 const auto max_n_negative =
    \n
    838 Utilities::MPI::max(flag, get_mpi_communicator());
    \n-
    839 return max_n_negative == 0;
    \n+
    839 return max_n_negative == 0;
    \n
    840 }
    \n
    \n
    841
    \n
    842
    \n
    843
    \n
    844 void
    \n
    \n
    845 Vector::print(std::ostream &out,
    \n
    846 const unsigned int precision,
    \n
    847 const bool scientific,
    \n
    848 const bool across) const
    \n
    849 {
    \n
    850 AssertThrow(out.fail() == false, ExcIO());
    \n-
    851 boost::io::ios_flags_saver restore_flags(out);
    \n+
    851 boost::io::ios_flags_saver restore_flags(out);
    \n
    852
    \n
    853
    \n
    854 out.precision(precision);
    \n
    855 if (scientific)
    \n
    856 out.setf(std::ios::scientific, std::ios::floatfield);
    \n
    857 else
    \n
    858 out.setf(std::ios::fixed, std::ios::floatfield);
    \n
    859
    \n-
    860 size_type vector_size = vector->Map().NumMyElements();
    \n-
    861 if (size() != vector_size)
    \n+
    860 size_type vector_size = vector->Map().NumMyElements();
    \n+
    861 if (size() != vector_size)
    \n
    862 {
    \n-
    863 auto global_id = [&](const size_type index) {
    \n+
    863 auto global_id = [&](const size_type index) {
    \n
    864 return gid(vector->Map(), index);
    \n
    865 };
    \n
    866 out << "size:" << size()
    \n
    867 << " locally_owned_size:" << vector->Map().NumMyElements() << " :"
    \n
    868 << std::endl;
    \n-
    869 for (size_type i = 0; i < vector_size; ++i)
    \n-
    870 out << "[" << global_id(i) << "]: " << (*(vector))[0][i]
    \n+
    869 for (size_type i = 0; i < vector_size; ++i)
    \n+
    870 out << "[" << global_id(i) << "]: " << (*(vector))[0][i]
    \n
    871 << std::endl;
    \n
    872 }
    \n
    873 else
    \n
    874 {
    \n
    875 TrilinosScalar *val;
    \n-
    876 int leading_dimension;
    \n-
    877 int ierr = vector->ExtractView(&val, &leading_dimension);
    \n+
    876 int leading_dimension;
    \n+
    877 int ierr = vector->ExtractView(&val, &leading_dimension);
    \n
    878
    \n-
    879 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n-
    880 if (across)
    \n+
    879 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    880 if (across)
    \n
    881 for (size_type i = 0; i < size(); ++i)
    \n
    882 out << static_cast<double>(val[i]) << ' ';
    \n
    883 else
    \n
    884 for (size_type i = 0; i < size(); ++i)
    \n
    885 out << static_cast<double>(val[i]) << std::endl;
    \n
    886 out << std::endl;
    \n
    887 }
    \n@@ -1087,21 +1087,17 @@\n
    927DEAL_II_NAMESPACE_CLOSE
    \n
    928
    \n
    929#endif // DEAL_II_WITH_TRILINOS
    \n
    BlockVectorBase::size
    virtual size_type size() const override
    \n
    BlockVectorBase::n_blocks
    unsigned int n_blocks() const
    \n
    BlockVectorBase::block
    BlockType & block(const unsigned int i)
    \n \n-
    IndexSet::is_ascending_and_one_to_one
    bool is_ascending_and_one_to_one(const MPI_Comm communicator) const
    Definition index_set.cc:1130
    \n-
    IndexSet::size
    size_type size() const
    Definition index_set.h:1776
    \n
    IndexSet::n_elements
    size_type n_elements() const
    Definition index_set.h:1934
    \n
    IndexSet::set_size
    void set_size(const size_type size)
    Definition index_set.h:1764
    \n-
    IndexSet::make_trilinos_map
    Epetra_Map make_trilinos_map(const MPI_Comm communicator=MPI_COMM_WORLD, const bool overlapping=false) const
    Definition index_set.cc:1041
    \n
    IndexSet::clear
    void clear()
    Definition index_set.h:1752
    \n-
    IndexSet::subtract_set
    void subtract_set(const IndexSet &other)
    Definition index_set.cc:473
    \n
    IndexSet::add_indices
    void add_indices(const ForwardIterator &begin, const ForwardIterator &end)
    Definition index_set.h:1831
    \n \n
    LinearAlgebra::ReadWriteVector::size
    size_type size() const override
    \n
    LinearAlgebra::ReadWriteVector::get_stored_elements
    const IndexSet & get_stored_elements() const
    \n
    MPI_Comm
    \n \n \n@@ -1164,16 +1160,14 @@\n
    Utilities::MPI::n_mpi_processes
    unsigned int n_mpi_processes(const MPI_Comm mpi_communicator)
    Definition mpi.cc:92
    \n
    Utilities::MPI::max
    T max(const T &t, const MPI_Comm mpi_communicator)
    \n
    Utilities::MPI::min_max_avg
    MinMaxAvg min_max_avg(const double my_value, const MPI_Comm mpi_communicator)
    Definition mpi.cc:66
    \n \n \n
    read_write_vector.h
    \n \n-\n-\n \n \n \n
    trilinos_index_access.h
    \n
    trilinos_parallel_block_vector.h
    \n
    trilinos_sparse_matrix.h
    \n
    trilinos_utilities.h
    \n"}, {"source1": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8h_source.html", "source2": "./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/trilinos__vector_8h_source.html", "unified_diff": "@@ -258,58 +258,58 @@\n
    417 using reference = internal::VectorReference;
    \n
    418 using const_reference = const internal::VectorReference;
    \n
    419
    \n
    429 Vector();
    \n
    430
    \n
    434 Vector(const Vector &v);
    \n
    435
    \n-
    454 explicit Vector(const IndexSet &parallel_partitioning,
    \n-
    455 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n+
    454 explicit Vector(const IndexSet &parallel_partitioning,
    \n+
    455 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n
    456
    \n
    468 Vector(const IndexSet &local,
    \n
    469 const IndexSet &ghost,
    \n-
    470 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n+
    470 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n
    471
    \n-
    486 Vector(const IndexSet &parallel_partitioning,
    \n+
    486 Vector(const IndexSet &parallel_partitioning,
    \n
    487 const Vector &v,
    \n-
    488 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n+
    488 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n
    489
    \n
    502 template <typename Number>
    \n-
    503 Vector(const IndexSet &parallel_partitioning,
    \n+
    503 Vector(const IndexSet &parallel_partitioning,
    \n
    504 const ::Vector<Number> &v,
    \n-
    505 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n+
    505 const MPI_Comm communicator = MPI_COMM_WORLD);
    \n
    506
    \n
    515 Vector(Vector &&v); // NOLINT
    \n
    516
    \n
    520 ~Vector() override = default;
    \n
    521
    \n
    526 void
    \n
    527 clear();
    \n
    528
    \n
    552 void
    \n
    553 reinit(const Vector &v,
    \n-
    554 const bool omit_zeroing_entries = false,
    \n-
    555 const bool allow_different_maps = false);
    \n+
    554 const bool omit_zeroing_entries = false,
    \n+
    555 const bool allow_different_maps = false);
    \n
    556
    \n
    579 void
    \n-
    580 reinit(const IndexSet &parallel_partitioning,
    \n-
    581 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n-
    582 const bool omit_zeroing_entries = false);
    \n+
    580 reinit(const IndexSet &parallel_partitioning,
    \n+
    581 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n+
    582 const bool omit_zeroing_entries = false);
    \n
    583
    \n
    618 void
    \n-
    619 reinit(const IndexSet &locally_owned_entries,
    \n-
    620 const IndexSet &locally_relevant_or_ghost_entries,
    \n-
    621 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n-
    622 const bool vector_writable = false);
    \n+
    619 reinit(const IndexSet &locally_owned_entries,
    \n+
    620 const IndexSet &locally_relevant_or_ghost_entries,
    \n+
    621 const MPI_Comm communicator = MPI_COMM_WORLD,
    \n+
    622 const bool vector_writable = false);
    \n
    623
    \n
    634 void
    \n
    635 reinit(
    \n
    636 const std::shared_ptr<const Utilities::MPI::Partitioner> &partitioner,
    \n-
    637 const bool make_ghosted = true,
    \n-
    638 const bool vector_writable = false);
    \n+
    637 const bool make_ghosted = true,
    \n+
    638 const bool vector_writable = false);
    \n
    639
    \n
    643 void
    \n
    644 reinit(const BlockVector &v, const bool import_data = false);
    \n
    645
    \n
    662 void
    \n
    663 compress(VectorOperation::values operation);
    \n
    664
    \n@@ -328,24 +328,24 @@\n
    729
    \n
    747 void
    \n
    748 import_nonlocal_data_for_fe(
    \n
    749 const ::TrilinosWrappers::SparseMatrix &matrix,
    \n
    750 const Vector &vector);
    \n
    751
    \n
    758 void
    \n-
    759 import_elements(const LinearAlgebra::ReadWriteVector<double> &rwv,
    \n+
    759 import_elements(const LinearAlgebra::ReadWriteVector<double> &rwv,
    \n
    760 const VectorOperation::values operation);
    \n
    761
    \n
    765 DEAL_II_DEPRECATED
    \n
    766 void
    \n
    \n-
    767 import(const LinearAlgebra::ReadWriteVector<double> &rwv,
    \n+
    767 import(const LinearAlgebra::ReadWriteVector<double> &rwv,
    \n
    768 const VectorOperation::values operation)
    \n
    769 {
    \n-
    770 import_elements(rwv, operation);
    \n+
    770 import_elements(rwv, operation);
    \n
    771 }
    \n
    \n
    772
    \n
    773
    \n
    779 bool
    \n
    780 operator==(const Vector &v) const;
    \n
    781
    \n@@ -370,15 +370,15 @@\n
    861 bool
    \n
    862 has_ghost_elements() const;
    \n
    863
    \n
    870 void
    \n
    871 update_ghost_values() const;
    \n
    872
    \n
    877 TrilinosScalar
    \n-
    878 operator*(const Vector &vec) const;
    \n+
    878 operator*(const Vector &vec) const;
    \n
    879
    \n
    883 real_type
    \n
    884 norm_sqr() const;
    \n
    885
    \n
    889 TrilinosScalar
    \n
    890 mean_value() const;
    \n
    891
    \n@@ -426,17 +426,17 @@\n
    1029
    \n
    1033 virtual void
    \n
    1034 extract_subvector_to(const ArrayView<const size_type> &indices,
    \n
    1035 ArrayView<TrilinosScalar> &elements) const override;
    \n
    1036
    \n
    1064 template <typename ForwardIterator, typename OutputIterator>
    \n
    1065 void
    \n-
    1066 extract_subvector_to(ForwardIterator indices_begin,
    \n-
    1067 const ForwardIterator indices_end,
    \n-
    1068 OutputIterator values_begin) const;
    \n+
    1066 extract_subvector_to(ForwardIterator indices_begin,
    \n+
    1067 const ForwardIterator indices_end,
    \n+
    1068 OutputIterator values_begin) const;
    \n
    1069
    \n
    1078 iterator
    \n
    1079 begin();
    \n
    1080
    \n
    1085 const_iterator
    \n
    1086 begin() const;
    \n
    1087
    \n@@ -484,15 +484,15 @@\n
    1185 Vector &
    \n
    1186 operator-=(const Vector &V);
    \n
    1187
    \n
    1192 void
    \n
    1193 add(const TrilinosScalar s);
    \n
    1194
    \n
    1207 void
    \n-
    1208 add(const Vector &V, const bool allow_different_maps = false);
    \n+
    1208 add(const Vector &V, const bool allow_different_maps = false);
    \n
    1209
    \n
    1213 void
    \n
    1214 add(const TrilinosScalar a, const Vector &V);
    \n
    1215
    \n
    1219 void
    \n
    1220 add(const TrilinosScalar a,
    \n
    1221 const Vector &V,
    \n@@ -502,60 +502,60 @@\n
    1229 void
    \n
    1230 sadd(const TrilinosScalar s, const Vector &V);
    \n
    1231
    \n
    1235 void
    \n
    1236 sadd(const TrilinosScalar s, const TrilinosScalar a, const Vector &V);
    \n
    1237
    \n
    1243 void
    \n-
    1244 scale(const Vector &scaling_factors);
    \n+
    1244 scale(const Vector &scaling_factors);
    \n
    1245
    \n
    1249 void
    \n
    1250 equ(const TrilinosScalar a, const Vector &V);
    \n
    1262 const Epetra_MultiVector &
    \n
    1263 trilinos_vector() const;
    \n
    1264
    \n
    1269 Epetra_FEVector &
    \n
    1270 trilinos_vector();
    \n
    1271
    \n-
    1276 const Epetra_BlockMap &
    \n+
    1276 const Epetra_BlockMap &
    \n
    1277 trilinos_partitioner() const;
    \n
    1278
    \n
    1286 void
    \n
    1287 print(std::ostream &out,
    \n
    1288 const unsigned int precision = 3,
    \n
    1289 const bool scientific = true,
    \n-
    1290 const bool across = true) const;
    \n+
    1290 const bool across = true) const;
    \n
    1291
    \n
    1305 void
    \n
    1306 swap(Vector &v) noexcept;
    \n
    1307
    \n
    1311 std::size_t
    \n
    1312 memory_consumption() const;
    \n
    1313
    \n
    1317 MPI_Comm
    \n
    1318 get_mpi_communicator() const;
    \n
    1324 DeclException0(ExcDifferentParallelPartitioning);
    \n
    1325
    \n
    1329 DeclException1(ExcTrilinosError,
    \n
    1330 int,
    \n-
    1331 << "An error with error number " << arg1
    \n+
    1331 << "An error with error number " << arg1
    \n
    1332 << " occurred while calling a Trilinos function");
    \n
    1333
    \n
    1337 DeclException4(
    \n
    1338 ExcAccessToNonLocalElement,
    \n
    1339 size_type,
    \n
    1340 size_type,
    \n
    1341 size_type,
    \n
    1342 size_type,
    \n-
    1343 << "You are trying to access element " << arg1
    \n+
    1343 << "You are trying to access element " << arg1
    \n
    1344 << " of a distributed vector, but this element is not stored "
    \n-
    1345 << "on the current processor. Note: There are " << arg2
    \n+
    1345 << "on the current processor. Note: There are " << arg2
    \n
    1346 << " elements stored "
    \n-
    1347 << "on the current processor from within the range [" << arg3 << ','
    \n-
    1348 << arg4 << "] but Trilinos vectors need not store contiguous "
    \n+
    1347 << "on the current processor from within the range [" << arg3 << ','
    \n+
    1348 << arg4 << "] but Trilinos vectors need not store contiguous "
    \n
    1349 << "ranges on each processor, and not every element in "
    \n
    1350 << "this range may in fact be stored locally."
    \n
    1351 << "\\n\\n"
    \n
    1352 << "A common source for this kind of problem is that you "
    \n
    1353 << "are passing a 'fully distributed' vector into a function "
    \n
    1354 << "that needs read access to vector elements that correspond "
    \n
    1355 << "to degrees of freedom on ghost cells (or at least to "
    \n@@ -678,17 +678,17 @@\n
    1508 } // namespace internal
    \n
    1509
    \n
    1510 namespace MPI
    \n
    1511 {
    \n
    1512 inline bool
    \n
    1513 Vector::in_local_range(const size_type index) const
    \n
    1514 {
    \n-
    1515 std::pair<size_type, size_type> range = local_range();
    \n+
    1515 std::pair<size_type, size_type> range = local_range();
    \n
    1516
    \n-
    1517 return ((index >= range.first) && (index < range.second));
    \n+
    1517 return ((index >= range.first) && (index < range.second));
    \n
    1518 }
    \n
    1519
    \n
    1520
    \n
    1521
    \n
    1522 inline IndexSet
    \n
    1523 Vector::locally_owned_elements() const
    \n
    1524 {
    \n@@ -766,19 +766,19 @@\n
    1596
    \n
    1597 template <typename ForwardIterator, typename OutputIterator>
    \n
    1598 inline void
    \n
    1599 Vector::extract_subvector_to(ForwardIterator indices_begin,
    \n
    1600 const ForwardIterator indices_end,
    \n
    1601 OutputIterator values_begin) const
    \n
    1602 {
    \n-
    1603 while (indices_begin != indices_end)
    \n+
    1603 while (indices_begin != indices_end)
    \n
    1604 {
    \n-
    1605 *values_begin = operator()(*indices_begin);
    \n-
    1606 ++indices_begin;
    \n-
    1607 ++values_begin;
    \n+
    1605 *values_begin = operator()(*indices_begin);
    \n+
    1606 ++indices_begin;
    \n+
    1607 ++values_begin;
    \n
    1608 }
    \n
    1609 }
    \n
    1610
    \n
    1611
    \n
    1612
    \n
    1613 inline Vector::iterator
    \n
    1614 Vector::begin()
    \n@@ -847,34 +847,34 @@\n
    1677 const size_type *indices,
    \n
    1678 const TrilinosScalar *values)
    \n
    1679 {
    \n
    1680 // if we have ghost values, do not allow
    \n
    1681 // writing to this vector at all.
    \n
    1682 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1683
    \n-
    1684 if (last_action == Add)
    \n+
    1684 if (last_action == Add)
    \n
    1685 {
    \n-
    1686 const int ierr = vector->GlobalAssemble(Add);
    \n-
    1687 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1686 const int ierr = vector->GlobalAssemble(Add);
    \n+
    1687 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1688 }
    \n
    1689
    \n-
    1690 if (last_action != Insert)
    \n-
    1691 last_action = Insert;
    \n+
    1690 if (last_action != Insert)
    \n+
    1691 last_action = Insert;
    \n
    1692
    \n
    1693 for (size_type i = 0; i < n_elements; ++i)
    \n
    1694 {
    \n
    1695 const TrilinosWrappers::types::int_type row = indices[i];
    \n-
    1696 const TrilinosWrappers::types::int_type local_row =
    \n+
    1696 const TrilinosWrappers::types::int_type local_row =
    \n
    1697 vector->Map().LID(row);
    \n-
    1698 if (local_row != -1)
    \n-
    1699 (*vector)[0][local_row] = values[i];
    \n+
    1698 if (local_row != -1)
    \n+
    1699 (*vector)[0][local_row] = values[i];
    \n
    1700 else
    \n
    1701 {
    \n-
    1702 const int ierr = vector->ReplaceGlobalValues(1, &row, &values[i]);
    \n-
    1703 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1702 const int ierr = vector->ReplaceGlobalValues(1, &row, &values[i]);
    \n+
    1703 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1704 compressed = false;
    \n
    1705 }
    \n
    1706 // in set operation, do not use the pre-allocated vector for nonlocal
    \n
    1707 // entries even if it exists. This is to ensure that we really only
    \n
    1708 // set the elements touched by the set() method and not all contained
    \n
    1709 // in the nonlocal entries vector (there is no way to distinguish them
    \n
    1710 // on the receiving processor)
    \n@@ -916,54 +916,54 @@\n
    1746 const size_type *indices,
    \n
    1747 const TrilinosScalar *values)
    \n
    1748 {
    \n
    1749 // if we have ghost values, do not allow
    \n
    1750 // writing to this vector at all.
    \n
    1751 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1752
    \n-
    1753 if (last_action != Add)
    \n+
    1753 if (last_action != Add)
    \n
    1754 {
    \n-
    1755 if (last_action == Insert)
    \n+
    1755 if (last_action == Insert)
    \n
    1756 {
    \n-
    1757 const int ierr = vector->GlobalAssemble(Insert);
    \n-
    1758 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1757 const int ierr = vector->GlobalAssemble(Insert);
    \n+
    1758 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1759 }
    \n-
    1760 last_action = Add;
    \n+
    1760 last_action = Add;
    \n
    1761 }
    \n
    1762
    \n
    1763 for (size_type i = 0; i < n_elements; ++i)
    \n
    1764 {
    \n
    1765 const size_type row = indices[i];
    \n-
    1766 const TrilinosWrappers::types::int_type local_row = vector->Map().LID(
    \n+
    1766 const TrilinosWrappers::types::int_type local_row = vector->Map().LID(
    \n
    1767 static_cast<TrilinosWrappers::types::int_type>(row));
    \n-
    1768 if (local_row != -1)
    \n-
    1769 (*vector)[0][local_row] += values[i];
    \n+
    1768 if (local_row != -1)
    \n+
    1769 (*vector)[0][local_row] += values[i];
    \n
    1770 else if (nonlocal_vector.get() == nullptr)
    \n
    1771 {
    \n-
    1772 const int ierr = vector->SumIntoGlobalValues(
    \n+
    1772 const int ierr = vector->SumIntoGlobalValues(
    \n
    1773 1,
    \n
    1774 reinterpret_cast<const TrilinosWrappers::types::int_type *>(
    \n
    1775 &row),
    \n
    1776 &values[i]);
    \n-
    1777 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1777 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1778 compressed = false;
    \n
    1779 }
    \n
    1780 else
    \n
    1781 {
    \n
    1782 // use pre-allocated vector for non-local entries if it exists for
    \n
    1783 // addition operation
    \n-
    1784 const TrilinosWrappers::types::int_type my_row =
    \n+
    1784 const TrilinosWrappers::types::int_type my_row =
    \n
    1785 nonlocal_vector->Map().LID(
    \n
    1786 static_cast<TrilinosWrappers::types::int_type>(row));
    \n-
    1787 Assert(my_row != -1,
    \n+
    1787 Assert(my_row != -1,
    \n
    1788 ExcMessage(
    \n
    1789 "Attempted to write into off-processor vector entry "
    \n
    1790 "that has not be specified as being writable upon "
    \n
    1791 "initialization"));
    \n-
    1792 (*nonlocal_vector)[0][my_row] += values[i];
    \n+
    1792 (*nonlocal_vector)[0][my_row] += values[i];
    \n
    1793 compressed = false;
    \n
    1794 }
    \n
    1795 }
    \n
    1796 }
    \n
    1797
    \n
    1798
    \n
    1799
    \n@@ -1012,24 +1012,24 @@\n
    1842 }
    \n
    1843
    \n
    1844
    \n
    1845
    \n
    1846 inline TrilinosScalar
    \n
    1847 Vector::operator*(const Vector &vec) const
    \n
    1848 {
    \n-
    1849 Assert(vector->Map().SameAs(vec.vector->Map()),
    \n+
    1849 Assert(vector->Map().SameAs(vec.vector->Map()),
    \n
    1850 ExcDifferentParallelPartitioning());
    \n
    1851 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1852
    \n-
    1853 TrilinosScalar result;
    \n+
    1853 TrilinosScalar result;
    \n
    1854
    \n-
    1855 const int ierr = vector->Dot(*(vec.vector), &result);
    \n-
    1856 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1855 const int ierr = vector->Dot(*(vec.vector), &result);
    \n+
    1856 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1857
    \n-
    1858 return result;
    \n+
    1858 return result;
    \n
    1859 }
    \n
    1860
    \n
    1861
    \n
    1862
    \n
    1863 inline Vector::real_type
    \n
    1864 Vector::norm_sqr() const
    \n
    1865 {
    \n@@ -1041,86 +1041,86 @@\n
    1871
    \n
    1872 inline TrilinosScalar
    \n
    1873 Vector::mean_value() const
    \n
    1874 {
    \n
    1875 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1876
    \n
    1877 TrilinosScalar mean;
    \n-
    1878 const int ierr = vector->MeanValue(&mean);
    \n-
    1879 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1878 const int ierr = vector->MeanValue(&mean);
    \n+
    1879 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1880
    \n
    1881 return mean;
    \n
    1882 }
    \n
    1883
    \n
    1884
    \n
    1885
    \n
    1886 inline TrilinosScalar
    \n
    1887 Vector::min() const
    \n
    1888 {
    \n-
    1889 TrilinosScalar min_value;
    \n-
    1890 const int ierr = vector->MinValue(&min_value);
    \n-
    1891 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1889 TrilinosScalar min_value;
    \n+
    1890 const int ierr = vector->MinValue(&min_value);
    \n+
    1891 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1892
    \n-
    1893 return min_value;
    \n+
    1893 return min_value;
    \n
    1894 }
    \n
    1895
    \n
    1896
    \n
    1897
    \n
    1898 inline TrilinosScalar
    \n
    1899 Vector::max() const
    \n
    1900 {
    \n-
    1901 TrilinosScalar max_value;
    \n-
    1902 const int ierr = vector->MaxValue(&max_value);
    \n-
    1903 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1901 TrilinosScalar max_value;
    \n+
    1902 const int ierr = vector->MaxValue(&max_value);
    \n+
    1903 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1904
    \n-
    1905 return max_value;
    \n+
    1905 return max_value;
    \n
    1906 }
    \n
    1907
    \n
    1908
    \n
    1909
    \n
    1910 inline Vector::real_type
    \n
    1911 Vector::l1_norm() const
    \n
    1912 {
    \n
    1913 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1914
    \n
    1915 TrilinosScalar d;
    \n-
    1916 const int ierr = vector->Norm1(&d);
    \n-
    1917 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1916 const int ierr = vector->Norm1(&d);
    \n+
    1917 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1918
    \n
    1919 return d;
    \n
    1920 }
    \n
    1921
    \n
    1922
    \n
    1923
    \n
    1924 inline Vector::real_type
    \n
    1925 Vector::l2_norm() const
    \n
    1926 {
    \n
    1927 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1928
    \n
    1929 TrilinosScalar d;
    \n-
    1930 const int ierr = vector->Norm2(&d);
    \n-
    1931 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1930 const int ierr = vector->Norm2(&d);
    \n+
    1931 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1932
    \n
    1933 return d;
    \n
    1934 }
    \n
    1935
    \n
    1936
    \n
    1937
    \n
    1938 inline Vector::real_type
    \n
    1939 Vector::lp_norm(const TrilinosScalar p) const
    \n
    1940 {
    \n
    1941 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    1942
    \n
    1943 TrilinosScalar norm = 0;
    \n
    1944 TrilinosScalar sum = 0;
    \n-
    1945 const size_type n_local = locally_owned_size();
    \n+
    1945 const size_type n_local = locally_owned_size();
    \n
    1946
    \n
    1947 // loop over all the elements because
    \n
    1948 // Trilinos does not support lp norms
    \n-
    1949 for (size_type i = 0; i < n_local; ++i)
    \n+
    1949 for (size_type i = 0; i < n_local; ++i)
    \n
    1950 sum += std::pow(std::fabs((*vector)[0][i]), p);
    \n
    1951
    \n
    1952 norm = std::pow(sum, static_cast<TrilinosScalar>(1. / p));
    \n
    1953
    \n
    1954 return norm;
    \n
    1955 }
    \n
    1956
    \n@@ -1131,16 +1131,16 @@\n
    1961 {
    \n
    1962 // while we disallow the other
    \n
    1963 // norm operations on ghosted
    \n
    1964 // vectors, this particular norm
    \n
    1965 // is safe to run even in the
    \n
    1966 // presence of ghost elements
    \n
    1967 TrilinosScalar d;
    \n-
    1968 const int ierr = vector->NormInf(&d);
    \n-
    1969 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1968 const int ierr = vector->NormInf(&d);
    \n+
    1969 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1970
    \n
    1971 return d;
    \n
    1972 }
    \n
    1973
    \n
    1974
    \n
    1975
    \n
    1976 inline TrilinosScalar
    \n@@ -1160,16 +1160,16 @@\n
    1990 // call. This reduces the overhead of the
    \n
    1991 // wrapper class.
    \n
    1992 inline Vector &
    \n
    1993 Vector::operator*=(const TrilinosScalar a)
    \n
    1994 {
    \n
    1995 AssertIsFinite(a);
    \n
    1996
    \n-
    1997 const int ierr = vector->Scale(a);
    \n-
    1998 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    1997 const int ierr = vector->Scale(a);
    \n+
    1998 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    1999
    \n
    2000 return *this;
    \n
    2001 }
    \n
    2002
    \n
    2003
    \n
    2004
    \n
    2005 inline Vector &
    \n@@ -1177,62 +1177,62 @@\n
    2007 {
    \n
    2008 AssertIsFinite(a);
    \n
    2009
    \n
    2010 const TrilinosScalar factor = 1. / a;
    \n
    2011
    \n
    2012 AssertIsFinite(factor);
    \n
    2013
    \n-
    2014 const int ierr = vector->Scale(factor);
    \n-
    2015 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2014 const int ierr = vector->Scale(factor);
    \n+
    2015 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2016
    \n
    2017 return *this;
    \n
    2018 }
    \n
    2019
    \n
    2020
    \n
    2021
    \n
    2022 inline Vector &
    \n
    2023 Vector::operator+=(const Vector &v)
    \n
    2024 {
    \n
    2025 AssertDimension(size(), v.size());
    \n
    2026 Assert(vector->Map().SameAs(v.vector->Map()),
    \n
    2027 ExcDifferentParallelPartitioning());
    \n
    2028
    \n-
    2029 const int ierr = vector->Update(1.0, *(v.vector), 1.0);
    \n-
    2030 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2029 const int ierr = vector->Update(1.0, *(v.vector), 1.0);
    \n+
    2030 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2031
    \n
    2032 return *this;
    \n
    2033 }
    \n
    2034
    \n
    2035
    \n
    2036
    \n
    2037 inline Vector &
    \n
    2038 Vector::operator-=(const Vector &v)
    \n
    2039 {
    \n
    2040 AssertDimension(size(), v.size());
    \n
    2041 Assert(vector->Map().SameAs(v.vector->Map()),
    \n
    2042 ExcDifferentParallelPartitioning());
    \n
    2043
    \n-
    2044 const int ierr = vector->Update(-1.0, *(v.vector), 1.0);
    \n-
    2045 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2044 const int ierr = vector->Update(-1.0, *(v.vector), 1.0);
    \n+
    2045 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2046
    \n
    2047 return *this;
    \n
    2048 }
    \n
    2049
    \n
    2050
    \n
    2051
    \n
    2052 inline void
    \n
    2053 Vector::add(const TrilinosScalar s)
    \n
    2054 {
    \n
    2055 // if we have ghost values, do not allow
    \n
    2056 // writing to this vector at all.
    \n
    2057 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    2058 AssertIsFinite(s);
    \n
    2059
    \n-
    2060 size_type n_local = locally_owned_size();
    \n-
    2061 for (size_type i = 0; i < n_local; ++i)
    \n+
    2060 size_type n_local = locally_owned_size();
    \n+
    2061 for (size_type i = 0; i < n_local; ++i)
    \n
    2062 (*vector)[0][i] += s;
    \n
    2063 }
    \n
    2064
    \n
    2065
    \n
    2066
    \n
    2067 inline void
    \n
    2068 Vector::add(const TrilinosScalar a, const Vector &v)
    \n@@ -1240,16 +1240,16 @@\n
    2070 // if we have ghost values, do not allow
    \n
    2071 // writing to this vector at all.
    \n
    2072 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    2073 AssertDimension(locally_owned_size(), v.locally_owned_size());
    \n
    2074
    \n
    2075 AssertIsFinite(a);
    \n
    2076
    \n-
    2077 const int ierr = vector->Update(a, *(v.vector), 1.);
    \n-
    2078 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2077 const int ierr = vector->Update(a, *(v.vector), 1.);
    \n+
    2078 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2079 }
    \n
    2080
    \n
    2081
    \n
    2082
    \n
    2083 inline void
    \n
    2084 Vector::add(const TrilinosScalar a,
    \n
    2085 const Vector &v,
    \n@@ -1261,17 +1261,17 @@\n
    2091 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    2092 AssertDimension(locally_owned_size(), v.locally_owned_size());
    \n
    2093 AssertDimension(locally_owned_size(), w.locally_owned_size());
    \n
    2094
    \n
    2095 AssertIsFinite(a);
    \n
    2096 AssertIsFinite(b);
    \n
    2097
    \n-
    2098 const int ierr = vector->Update(a, *(v.vector), b, *(w.vector), 1.);
    \n+
    2098 const int ierr = vector->Update(a, *(v.vector), b, *(w.vector), 1.);
    \n
    2099
    \n-
    2100 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2100 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2101 }
    \n
    2102
    \n
    2103
    \n
    2104
    \n
    2105 inline void
    \n
    2106 Vector::sadd(const TrilinosScalar s, const Vector &v)
    \n
    2107 {
    \n@@ -1285,16 +1285,16 @@\n
    2115 // We assume that the vectors have the same Map
    \n
    2116 // if the local size is the same and if the vectors are not ghosted
    \n
    2117 if (locally_owned_size() == v.locally_owned_size() &&
    \n
    2118 !v.has_ghost_elements())
    \n
    2119 {
    \n
    2120 Assert(this->vector->Map().SameAs(v.vector->Map()) == true,
    \n
    2121 ExcDifferentParallelPartitioning());
    \n-
    2122 const int ierr = vector->Update(1., *(v.vector), s);
    \n-
    2123 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2122 const int ierr = vector->Update(1., *(v.vector), s);
    \n+
    2123 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2124 }
    \n
    2125 else
    \n
    2126 {
    \n
    2127 (*this) *= s;
    \n
    2128 this->add(v, true);
    \n
    2129 }
    \n
    2130 }
    \n@@ -1316,16 +1316,16 @@\n
    2146 // We assume that the vectors have the same Map
    \n
    2147 // if the local size is the same and if the vectors are not ghosted
    \n
    2148 if (locally_owned_size() == v.locally_owned_size() &&
    \n
    2149 !v.has_ghost_elements())
    \n
    2150 {
    \n
    2151 Assert(this->vector->Map().SameAs(v.vector->Map()) == true,
    \n
    2152 ExcDifferentParallelPartitioning());
    \n-
    2153 const int ierr = vector->Update(a, *(v.vector), s);
    \n-
    2154 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2153 const int ierr = vector->Update(a, *(v.vector), s);
    \n+
    2154 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2155 }
    \n
    2156 else
    \n
    2157 {
    \n
    2158 (*this) *= s;
    \n
    2159 Vector tmp = v;
    \n
    2160 tmp *= a;
    \n
    2161 this->add(tmp, true);
    \n@@ -1338,16 +1338,16 @@\n
    2168 Vector::scale(const Vector &factors)
    \n
    2169 {
    \n
    2170 // if we have ghost values, do not allow
    \n
    2171 // writing to this vector at all.
    \n
    2172 Assert(!has_ghost_elements(), ExcGhostsPresent());
    \n
    2173 AssertDimension(locally_owned_size(), factors.locally_owned_size());
    \n
    2174
    \n-
    2175 const int ierr = vector->Multiply(1.0, *(factors.vector), *vector, 0.0);
    \n-
    2176 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2175 const int ierr = vector->Multiply(1.0, *(factors.vector), *vector, 0.0);
    \n+
    2176 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2177 }
    \n
    2178
    \n
    2179
    \n
    2180
    \n
    2181 inline void
    \n
    2182 Vector::equ(const TrilinosScalar a, const Vector &v)
    \n
    2183 {
    \n@@ -1360,18 +1360,18 @@\n
    2190 if (vector->Map().SameAs(v.vector->Map()) == false)
    \n
    2191 {
    \n
    2192 this->sadd(0., a, v);
    \n
    2193 }
    \n
    2194 else
    \n
    2195 {
    \n
    2196 // Otherwise, just update
    \n-
    2197 int ierr = vector->Update(a, *v.vector, 0.0);
    \n-
    2198 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2197 int ierr = vector->Update(a, *v.vector, 0.0);
    \n+
    2198 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2199
    \n-
    2200 last_action = Zero;
    \n+
    2200 last_action = Zero;
    \n
    2201 }
    \n
    2202 }
    \n
    2203
    \n
    2204
    \n
    2205
    \n
    2206 inline const Epetra_MultiVector &
    \n
    2207 Vector::trilinos_vector() const
    \n@@ -1409,32 +1409,32 @@\n
    2239
    \n
    2240 template <typename number>
    \n
    2241 Vector::Vector(const IndexSet &parallel_partitioner,
    \n
    2242 const ::Vector<number> &v,
    \n
    2243 const MPI_Comm communicator)
    \n
    2244 {
    \n
    2245 *this =
    \n-
    2246 Vector(parallel_partitioner.make_trilinos_map(communicator, true), v);
    \n-
    2247 owned_elements = parallel_partitioner;
    \n+
    2246 Vector(parallel_partitioner.make_trilinos_map(communicator, true), v);
    \n+
    2247 owned_elements = parallel_partitioner;
    \n
    2248 }
    \n
    2249
    \n
    2250
    \n
    2251
    \n
    2252 inline Vector &
    \n
    2253 Vector::operator=(const TrilinosScalar s)
    \n
    2254 {
    \n
    2255 AssertIsFinite(s);
    \n
    2256
    \n-
    2257 int ierr = vector->PutScalar(s);
    \n-
    2258 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2257 int ierr = vector->PutScalar(s);
    \n+
    2258 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2259
    \n
    2260 if (nonlocal_vector.get() != nullptr)
    \n
    2261 {
    \n-
    2262 ierr = nonlocal_vector->PutScalar(0.);
    \n-
    2263 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n+
    2262 ierr = nonlocal_vector->PutScalar(0.);
    \n+
    2263 AssertThrow(ierr == 0, ExcTrilinosError(ierr));
    \n
    2264 }
    \n
    2265
    \n
    2266 return *this;
    \n
    2267 }
    \n
    2268 } /* end of namespace MPI */
    \n
    2269
    \n
    2270# endif /* DOXYGEN */
    \n@@ -1501,15 +1501,14 @@\n \n \n
    ArrayView::size
    std::size_t size() const
    Definition array_view.h:684
    \n \n \n
    IndexSet::size
    size_type size() const
    Definition index_set.h:1776
    \n
    IndexSet::n_elements
    size_type n_elements() const
    Definition index_set.h:1934
    \n-
    IndexSet::make_trilinos_map
    Epetra_Map make_trilinos_map(const MPI_Comm communicator=MPI_COMM_WORLD, const bool overlapping=false) const
    Definition index_set.cc:1041
    \n \n
    MPI_Comm
    \n \n \n \n \n \n"}]}]}]}]}