*/
const FiniteElement<dim,spacedim> &get_fe () const;
+ /**
+ * Return a constant reference to the triangulation underlying this object.
+ *
+ * @deprecated Use get_triangulation() instead.
+ */
+ const Triangulation<dim,spacedim> &get_tria () const DEAL_II_DEPRECATED;
+
/**
* Return a constant reference to the triangulation underlying this object.
*/
- const Triangulation<dim,spacedim> &get_tria () const;
+ const Triangulation<dim,spacedim> &get_triangulation () const;
/**
* Determine an estimate for the memory consumption (in bytes) of this
const IndexSet &
DoFHandler<dim, spacedim>::locally_owned_mg_dofs(const unsigned int level) const
{
- Assert(level < this->get_tria().n_global_levels(), ExcMessage("invalid level in locally_owned_mg_dofs"));
+ Assert(level < this->get_triangulation().n_global_levels(), ExcMessage("invalid level in locally_owned_mg_dofs"));
return mg_number_cache[level].locally_owned_dofs;
}
const std::vector<IndexSet> &
DoFHandler<dim, spacedim>::locally_owned_mg_dofs_per_processor (const unsigned int level) const
{
- Assert(level < this->get_tria().n_global_levels(), ExcMessage("invalid level in locally_owned_mg_dofs_per_processor"));
+ Assert(level < this->get_triangulation().n_global_levels(), ExcMessage("invalid level in locally_owned_mg_dofs_per_processor"));
return mg_number_cache[level].locally_owned_dofs_per_processor;
}
}
+
template <int dim, int spacedim>
inline
const Triangulation<dim,spacedim> &
}
+
+template <int dim, int spacedim>
+inline
+const Triangulation<dim,spacedim> &
+DoFHandler<dim,spacedim>::get_triangulation () const
+{
+ Assert(tria != 0, ExcNotInitialized());
+ return *tria;
+}
+
+
+
template <int dim, int spacedim>
inline
const BlockInfo &
* may not only be a triangulation, but also a DoFHandler, for example).
*/
Triangulation<dim,spacedim> &
- get_tria ();
+ get_triangulation ();
/**
* Return a reference to the current object. This is the const-version
* of the previous function.
*/
const Triangulation<dim,spacedim> &
- get_tria () const;
+ get_triangulation () const;
/*
const hp::FECollection<dim,spacedim> &get_fe () const;
/**
- * Return a constant reference to the triangulation underlying this
- * object.
+ * Return a constant reference to the triangulation underlying this object.
+ *
+ * @deprecated Use get_triangulation() instead.
+ */
+ const Triangulation<dim,spacedim> &get_tria () const DEAL_II_DEPRECATED;
+
+ /**
+ * Return a constant reference to the triangulation underlying this object.
*/
- const Triangulation<dim,spacedim> &get_tria () const;
+ const Triangulation<dim,spacedim> &get_triangulation () const;
/**
* Determine an estimate for the memory consumption (in bytes) of this
}
+
template<int dim, int spacedim>
inline
const Triangulation<dim,spacedim> &
return *tria;
}
+
+
+ template<int dim, int spacedim>
+ inline
+ const Triangulation<dim,spacedim> &
+ DoFHandler<dim,spacedim>::get_triangulation () const
+ {
+ return *tria;
+ }
+
+
+
template<int dim, int spacedim>
inline
DoFHandler<dim, spacedim>::MGVertexDoFs::MGVertexDoFs()
mapping; // temporary map for level==0
- std::vector< bool > touched (volume_mesh.get_tria().n_vertices(), false);
+ std::vector< bool > touched (volume_mesh.get_triangulation().n_vertices(), false);
std::vector< CellData< boundary_dim > > cells;
SubCellData subcell_data;
std::vector< Point<spacedim> > vertices;
// create level 0 surface triangulation
Assert (cells.size() > 0, ExcMessage ("No boundary faces selected"));
- const_cast<Triangulation<dim-1,spacedim>&>(surface_mesh.get_tria())
+ const_cast<Triangulation<dim-1,spacedim>&>(surface_mesh.get_triangulation())
.create_triangulation (vertices, cells, subcell_data);
// Make the actual mapping
if (changed)
{
- const_cast<Triangulation<dim-1,spacedim>&>(surface_mesh.get_tria())
+ const_cast<Triangulation<dim-1,spacedim>&>(surface_mesh.get_triangulation())
.execute_coarsening_and_refinement();
for (typename Container<dim-1,spacedim>::cell_iterator
// triangulation from the
// container and determine vertices
// and used vertices
- const Triangulation<dim, spacedim> &tria = container.get_tria();
+ const Triangulation<dim, spacedim> &tria = container.get_triangulation();
const std::vector< Point<spacedim> > &vertices = tria.get_vertices();
const std::vector< bool > &used = tria.get_used_vertices();
// make sure that the given vertex is
// an active vertex of the underlying
// triangulation
- Assert(vertex < container.get_tria().n_vertices(),
- ExcIndexRange(0,container.get_tria().n_vertices(),vertex));
- Assert(container.get_tria().get_used_vertices()[vertex],
+ Assert(vertex < container.get_triangulation().n_vertices(),
+ ExcIndexRange(0,container.get_triangulation().n_vertices(),vertex));
+ Assert(container.get_triangulation().get_used_vertices()[vertex],
ExcVertexNotUsed(vertex));
// use a set instead of a vector
// the cell and have not searched
// every cell in the triangulation,
// we keep on looking.
- const unsigned int n_active_cells = container.get_tria().n_active_cells();
+ const unsigned int n_active_cells = container.get_triangulation().n_active_cells();
bool found = false;
unsigned int cells_searched = 0;
while (!found && cells_searched < n_active_cells)
// the cell and have not searched
// every cell in the triangulation,
// we keep on looking.
- const unsigned int n_cells = container.get_tria().n_cells();
+ const unsigned int n_cells = container.get_triangulation().n_cells();
bool found = false;
unsigned int cells_searched = 0;
while (!found && cells_searched < n_cells)
const std_cxx11::function<bool (const typename Container::active_cell_iterator &)> &predicate)
{
std::vector<typename Container::active_cell_iterator> active_halo_layer;
- std::vector<bool> locally_active_vertices_on_subdomain (container.get_tria().n_vertices(),
+ std::vector<bool> locally_active_vertices_on_subdomain (container.get_triangulation().n_vertices(),
false);
// Find the cells for which the predicate is true
have_same_coarse_mesh (const Container &mesh_1,
const Container &mesh_2)
{
- return have_same_coarse_mesh (mesh_1.get_tria(),
- mesh_2.get_tria());
+ return have_same_coarse_mesh (mesh_1.get_triangulation(),
+ mesh_2.get_triangulation());
}
// then set up the containers from
// scratch and fill them with end-iterators
- const unsigned int n_levels = source_grid.get_tria().n_levels();
+ const unsigned int n_levels = source_grid.get_triangulation().n_levels();
mapping.resize (n_levels);
for (unsigned int level=0; level<n_levels; ++level)
{
template <int dim, int spacedim>
Triangulation<dim,spacedim> &
-Triangulation<dim,spacedim>::get_tria ()
+Triangulation<dim,spacedim>::get_triangulation ()
{
return *this;
}
template <int dim, int spacedim>
const Triangulation<dim,spacedim> &
-Triangulation<dim,spacedim>::get_tria () const
+Triangulation<dim,spacedim>::get_triangulation () const
{
return *this;
}