songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Change order of tparam and get rid of one constructor

This commit is contained in:
Andreas Fabri 2025-05-07 12:37:33 +01:00
parent be9c51b452
commit 00b5174181
1 changed files with 4 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Frechet_distance/include/CGAL/Frechet_distance/Neighbor_search.h
View File

@ -48,28 +48,18 @@ class Neighbor_search
using Polylines = std::vector<Polyline>; using Polylines = std::vector<Polyline>;
public: public:
/*!
* constructs a neighbor search data structure for `polylines`
* \tparam PolylineRange must be a model of `RandomAccessRange` with value type `PointRange`
*/
template <typename PolylineRange>
Neighbor_search(const PolylineRange& polylines)
: curves(polylines.begin(), polylines.end())
{
kd_tree.insert(curves);
kd_tree.template build<Sequential_tag>();
}
/*! /*!
* constructs a neighbor search data structure for `polylines` * constructs a neighbor search data structure for `polylines`
* \tparam PolylineRange must be a model of `RandomAccessRange` with value type `PointRange`
* \tparam ConcurrencyTag enables sequential versus parallel construction. * \tparam ConcurrencyTag enables sequential versus parallel construction.
* Possible values are `Sequential_tag`, `Parallel_tag`, and `Parallel_if_available_tag`. * Possible values are `Sequential_tag`, `Parallel_tag`, and `Parallel_if_available_tag`.
* \tparam PolylineRange must be a model of `RandomAccessRange` with value type `PointRange`
*/ */
template <typename PolylineRange, typename ConcurrencyTag> template <typename ConcurrencyTag = Sequential_tag, typename PolylineRange>
Neighbor_search(const PolylineRange& polylines, ConcurrencyTag) Neighbor_search(const PolylineRange& polylines, ConcurrencyTag tag = ConcurrencyTag())
: curves(polylines.begin(), polylines.end()) : curves(polylines.begin(), polylines.end())
{ {
CGAL_USE(tag);
kd_tree.insert(curves); kd_tree.insert(curves);
kd_tree.template build<ConcurrencyTag>(); kd_tree.template build<ConcurrencyTag>();
} }