}\r
}\r
\r
- inline bool is_visited(turn_type const& turn, turn_operation_type const& op,\r
- signed_size_type turn_index, int op_index) const\r
+ inline bool is_visited(turn_type const&, turn_operation_type const& op,\r
+ signed_size_type, int) const\r
{\r
return op.visited.visited();\r
}\r
get_used_vertices() const;
/**
- * Returned the cached RTree object for the vertices, constructed using the
+ * Return the cached RTree object for the vertices, constructed using the
* used vertices of the triangulation.
*/
const RTree<std::pair<Point<spacedim>, unsigned int>> &
get_used_vertices_rtree() const;
/**
- * Returned the cached RTree object of the cell bounging boxes, constructed
+ * Return the cached RTree object of the cell bounging boxes, constructed
* using the active cell iterators of the stored triangulation.
*/
const RTree<
/**
* Update all objects.
*/
- update_all = 0xFFF,
+ update_all = 0x0FF,
};
std::vector<std::pair<Point<spacedim>, unsigned int>> vertices(
used_vertices.size());
unsigned int i = 0;
- for (auto it : used_vertices)
+ for (const auto &it : used_vertices)
vertices[i++] = std::make_pair(it.second, it.first);
used_vertices_rtree = pack_rtree(vertices);
}
Triangulation<dim, spacedim> tria;
GridGenerator::hyper_cube(tria);
tria.refine_global(ref);
- GridTools::Cache cache(tria);
+ GridTools::Cache<dim, spacedim> cache(tria);
const auto &b_tree = cache.get_cell_bounding_boxes_rtree();
Triangulation<dim, spacedim> tria;
GridGenerator::hyper_cube(tria);
tria.refine_global(ref);
- GridTools::Cache cache(tria);
+ GridTools::Cache<dim, spacedim> cache(tria);
const auto &v_tree = cache.get_used_vertices_rtree();