compute_mesh_predicate_bounding_box
( const MeshType &mesh,
const std::function<bool (const typename MeshType::active_cell_iterator &)> &predicate,
- const unsigned int &refinement_level = 0,
- const bool &allow_merge = false,
- const unsigned int &max_boxes = numbers::invalid_unsigned_int);
+ const unsigned int refinement_level = 0,
+ const bool allow_merge = false,
+ const unsigned int max_boxes = numbers::invalid_unsigned_int);
/**
* Given an array of points, use the global bounding box description obtained using
compute_mesh_predicate_bounding_box
(const MeshType &mesh,
const std::function<bool (const typename MeshType::active_cell_iterator &)> &predicate,
- const unsigned int &refinement_level,
- const bool &allow_merge,
- const unsigned int &max_boxes)
+ const unsigned int refinement_level,
+ const bool allow_merge,
+ const unsigned int max_boxes)
{
// Algorithm brief description: begin with creating bounding boxes of all cells at
// refinement_level (and coarser levels if there are active cells) which have the predicate
template
std::vector < BoundingBox< deal_II_space_dimension > >
compute_mesh_predicate_bounding_box< X >
- (const X &, const std::function<bool (const dealii::internal::ActiveCellIterator<deal_II_dimension, deal_II_space_dimension, X>::type&)> &,
- const unsigned int &, const bool&, const unsigned int &);
+ (const X &,
+ const std::function<bool (const dealii::internal::ActiveCellIterator<deal_II_dimension, deal_II_space_dimension, X>::type&)> &,
+ const unsigned int,
+ const bool,
+ const unsigned int);
\}
#endif