 |
Reference documentation for deal.II version 8.5.1
|
|
Reference documentation for deal.II version 8.5.1
|
#include <deal.II/base/data_out_base.h>
Public Member Functions | |
| Patch () | |
| bool | operator== (const Patch &patch) const |
| std::size_t | memory_consumption () const |
| void | swap (Patch< dim, spacedim > &other_patch) |
Static Public Member Functions | |
| static ::ExceptionBase & | ExcInvalidCombinationOfDimensions (int arg1, int arg2) |
Public Attributes | |
| Point< spacedim > | vertices [GeometryInfo< dim >::vertices_per_cell] |
| unsigned int | neighbors [dim > 0 ? GeometryInfo< dim >::faces_per_cell :1] |
| unsigned int | patch_index |
| unsigned int | n_subdivisions |
| Table< 2, float > | data |
| bool | points_are_available |
Static Public Attributes | |
| static const unsigned int | space_dim =spacedim |
| static const unsigned int | no_neighbor = numbers::invalid_unsigned_int |
Data structure describing a patch of data in dim space dimensions.
A patch consists of the following data:
See the general documentation of the DataOutBase class for more information on its contents and purposes. In the case of two dimensions, the next picture is an example of n_subdivisions = 4 because the number of (sub)cells within each patch is equal to 2dim.
Definition at line 238 of file data_out_base.h.
| DataOutBase::Patch< dim, spacedim >::Patch | ( | ) |
Default constructor. Sets n_subdivisions to one, points_are_available to false, and patch_index to no_neighbor.
Definition at line 1519 of file data_out_base.cc.
| bool DataOutBase::Patch< dim, spacedim >::operator== | ( | const Patch< dim, spacedim > & | patch | ) | const |
Compare the present patch for equality with another one. This is used in a few of the automated tests in our testsuite.
Definition at line 1540 of file data_out_base.cc.
| std::size_t DataOutBase::Patch< dim, spacedim >::memory_consumption | ( | ) | const |
Return an estimate for the memory consumption, in bytes, of this object. This is not exact (but will usually be close) because calculating the memory usage of trees (e.g., std::map) is difficult.
Definition at line 1579 of file data_out_base.cc.
| void DataOutBase::Patch< dim, spacedim >::swap | ( | Patch< dim, spacedim > & | other_patch | ) |
Swap the current object's contents with those of the given argument.
Definition at line 1595 of file data_out_base.cc.
|
static |
Make the spacedim template parameter available.
Definition at line 243 of file data_out_base.h.
| Point<spacedim> DataOutBase::Patch< dim, spacedim >::vertices[GeometryInfo< dim >::vertices_per_cell] |
Corner points of a patch. Inner points are computed by a multilinear transformation of the unit cell to the cell specified by these corner points, if points_are_available==false.
On the other hand, if points_are_available==true, then the coordinates of the points at which output is to be generated is attached in additional rows to the data table.
The order of points is the same as for cells in the triangulation.
Definition at line 257 of file data_out_base.h.
| unsigned int DataOutBase::Patch< dim, spacedim >::neighbors[dim > 0 ? GeometryInfo< dim >::faces_per_cell : 1] |
Numbers of neighbors of a patch. OpenDX format requires neighbor information for advanced output. Here the neighborship relationship of patches is stored. During output, this must be transformed into neighborship of sub-grid cells.
Definition at line 269 of file data_out_base.h.
| unsigned int DataOutBase::Patch< dim, spacedim >::patch_index |
Number of this patch. Since we are not sure patches are handled in the same order, always, we better store this.
Definition at line 275 of file data_out_base.h.
| unsigned int DataOutBase::Patch< dim, spacedim >::n_subdivisions |
Number of subdivisions with which this patch is to be written. 1 means no subdivision, 2 means bisection, 3 trisection, etc.
Definition at line 282 of file data_out_base.h.
| Table<2,float> DataOutBase::Patch< dim, spacedim >::data |
Data vectors. The format is as follows: data(i,.) denotes the data belonging to the ith data vector. data.n_cols() therefore equals the number of output points; this number is (subdivisions+1)^{dim}. data.n_rows() equals the number of data vectors. For the current purpose, a data vector equals one scalar, even if multiple scalars may later be interpreted as vectors.
Within each column, data(.,j) are the data values at the output point j, where j denotes the usual lexicographic ordering in deal.II. This is also the order of points as provided by the QIterated class when used with the QTrapez class as subquadrature.
Since the number of data vectors is usually the same for all patches to be printed, data.size() should yield the same value for all patches provided. The exception are patches for which points_are_available are set, where the actual coordinates of the point are appended to the 'data' field, see the documentation of the points_are_available flag.
Definition at line 305 of file data_out_base.h.
| bool DataOutBase::Patch< dim, spacedim >::points_are_available |
A flag indicating whether the coordinates of the interior patch points (assuming that the patch is supposed to be subdivided further) are appended to the data table (true) or not (false). The latter is the default and in this case the locations of the points interior to this patch are computed by (bi-, tri-)linear interpolation from the vertices of the patch.
This option exists since patch points may be evaluated using a Mapping (rather than by a linear interpolation) and therefore have to be stored in the Patch structure.
Definition at line 319 of file data_out_base.h.
|
static |
Value to be used if this patch has no neighbor on one side.
Definition at line 349 of file data_out_base.h.
1.8.14