* Abbreviate the somewhat lengthy
* name for the @p{Patch} class.
*/
- typedef typename DataOutBase::Patch<patch_dim,patch_space_dim> Patch;
+ typedef ::DataOutBase::Patch<patch_dim,patch_space_dim> Patch;
/**
* Pointer to the dof handler object.
* for finding neighbors.
*/
typedef std::map<typename DoFHandler<dim>::cell_iterator,
- typename std::vector<typename DataOutBase::Patch<dim> >::iterator>
+ typename std::vector<::DataOutBase::Patch<dim> >::iterator>
PatchMap;
/**
* List of patches of all past and
* present parameter value data sets.
*/
- typename std::vector<DataOutBase::Patch<dim+1> > patches;
+ typename std::vector<::DataOutBase::Patch<dim+1> > patches;
/**
* Structure holding data vectors
* the base class @ref{DataOutBase}) to
* the actual output function.
*/
- virtual const typename std::vector<typename DataOutBase::Patch<dim+1> > & get_patches () const;
+ virtual const typename std::vector<::DataOutBase::Patch<dim+1> > & get_patches () const;
/**
template <int dof_handler_dim, int patch_dim, int patch_space_dim>
-const typename std::vector<typename DataOutBase::Patch<patch_dim, patch_space_dim> > &
+const typename std::vector<::DataOutBase::Patch<patch_dim, patch_space_dim> > &
DataOut_DoFData<dof_handler_dim,patch_dim,patch_space_dim>::get_patches () const
{
return patches;
const unsigned int n_q_points = patch_points.n_quadrature_points;
unsigned int cell_number = 0;
- typename std::vector<typename DataOutBase::Patch<dim> >::iterator patch = this->patches.begin();
+ typename std::vector<::DataOutBase::Patch<dim> >::iterator patch = this->patches.begin();
typename DoFHandler<dim>::cell_iterator cell=first_cell();
// get first cell in this thread
// clear the patches array
if (true)
{
- typename std::vector<DataOutBase::Patch<dim> > dummy;
+ typename std::vector<::DataOutBase::Patch<dim> > dummy;
this->patches.swap (dummy);
};
// or similar operations are used
// which would regularly overflow
// the allocated amount of memory
- DataOutBase::Patch<dim> default_patch;
+ ::DataOutBase::Patch<dim> default_patch;
default_patch.n_subdivisions = n_subdivisions;
default_patch.data.reinit (n_datasets, n_q_points);
this->patches.insert (patches.end(), n_patches, default_patch);
// First, number patches
// consecutively.
unsigned int patch_no = 0;
- for (typename std::vector<typename DataOutBase::Patch<dim> >::iterator
+ for (typename std::vector<::DataOutBase::Patch<dim> >::iterator
patch = patches.begin(); patch != patches.end(); ++patch)
patch->me = patch_no++;
{
const typename DoFHandler<dim>::cell_iterator
cell = map_entry->first;
- const typename std::vector<typename DataOutBase::Patch<dim> >::iterator
+ const typename std::vector<::DataOutBase::Patch<dim> >::iterator
patch = map_entry->second;
// loop over all faces and see
// if there is a neighbor,
// get its patch...
const typename
- std::vector<typename DataOutBase::Patch<dim> >::iterator
+ std::vector<::DataOutBase::Patch<dim> >::iterator
neighbor_patch = patch_map.find(cell->neighbor(i))->second;
// ...and set its neighbor
// pointer set
const unsigned int n_q_points = patch_points.n_quadrature_points;
unsigned int face_number = 0;
- typename std::vector<DataOutBase::Patch<dim-1,dim> >::iterator patch = this->patches.begin();
+ typename std::vector<::DataOutBase::Patch<dim-1,dim> >::iterator patch = this->patches.begin();
FaceDescriptor face=first_face();
// get first face in this thread
// clear the patches array
if (true)
{
- std::vector<DataOutBase::Patch<dim-1,dim> > dummy;
+ std::vector<::DataOutBase::Patch<dim-1,dim> > dummy;
this->patches.swap (dummy);
};
// values. note that the evaluation
// points on the face have to be
// repeated in angular direction
- DataOutBase::Patch<dim-1,dim> default_patch;
+ ::DataOutBase::Patch<dim-1,dim> default_patch;
default_patch.n_subdivisions = n_subdivisions;
default_patch.data.reinit (n_datasets, n_q_points);
this->patches.insert (patches.end(), n_patches, default_patch);
unsigned int cell_number = 0;
- typename std::vector<DataOutBase::Patch<dim+1> >::iterator patch = this->patches.begin();
+ typename std::vector<::DataOutBase::Patch<dim+1> >::iterator patch = this->patches.begin();
typename DoFHandler<dim>::cell_iterator cell=first_cell();
// get first cell in this thread
// clear the patches array
if (true)
{
- std::vector<DataOutBase::Patch<dim+1> > dummy;
+ std::vector<::DataOutBase::Patch<dim+1> > dummy;
this->patches.swap (dummy);
};
// values. note that the evaluation
// points on the cell have to be
// repeated in angular direction
- DataOutBase::Patch<dim+1> default_patch;
+ ::DataOutBase::Patch<dim+1> default_patch;
default_patch.n_subdivisions = n_subdivisions;
default_patch.data.reinit (n_datasets,
n_q_points * (n_subdivisions+1));
Vector<double>(n_components));
// add the required number of patches
- DataOutBase::Patch<dim+1> default_patch;
+ ::DataOutBase::Patch<dim+1> default_patch;
default_patch.n_subdivisions = n_subdivisions;
default_patch.data.reinit (n_datasets, n_q_points*(n_subdivisions+1));
patches.insert (patches.end(), n_patches, default_patch);
// now loop over all cells and
// actually create the patches
- typename std::vector<DataOutBase::Patch<dim+1> >::iterator
+ typename std::vector<::DataOutBase::Patch<dim+1> >::iterator
patch = patches.begin() + (patches.size()-n_patches);
unsigned int cell_number = 0;
for (typename DoFHandler<dim>::active_cell_iterator cell=dof_handler->begin_active();
template <int dim>
-const typename std::vector<typename DataOutBase::Patch<dim+1> > &
+const typename std::vector<::DataOutBase::Patch<dim+1> > &
DataOutStack<dim>::get_patches () const
{
return patches;