From 00b5174181922a6083d1ccd2fe73a0c4a113a35c Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Wed, 7 May 2025 12:37:33 +0100 Subject: [PATCH] Change order of tparam and get rid of one constructor --- .../CGAL/Frechet_distance/Neighbor_search.h | 18 ++++-------------- 1 file changed, 4 insertions(+), 14 deletions(-) diff --git a/Frechet_distance/include/CGAL/Frechet_distance/Neighbor_search.h b/Frechet_distance/include/CGAL/Frechet_distance/Neighbor_search.h index 123703aca3a..f31f52042fe 100644 --- a/Frechet_distance/include/CGAL/Frechet_distance/Neighbor_search.h +++ b/Frechet_distance/include/CGAL/Frechet_distance/Neighbor_search.h @@ -48,28 +48,18 @@ class Neighbor_search using Polylines = std::vector; public: -/*! - * constructs a neighbor search data structure for `polylines` - * \tparam PolylineRange must be a model of `RandomAccessRange` with value type `PointRange` -*/ - template - Neighbor_search(const PolylineRange& polylines) - : curves(polylines.begin(), polylines.end()) - { - kd_tree.insert(curves); - kd_tree.template build(); - } /*! * 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. * 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 - Neighbor_search(const PolylineRange& polylines, ConcurrencyTag) + template + Neighbor_search(const PolylineRange& polylines, ConcurrencyTag tag = ConcurrencyTag()) : curves(polylines.begin(), polylines.end()) { + CGAL_USE(tag); kd_tree.insert(curves); kd_tree.template build(); }