From 7a8cef15e8a4f8936a934060903642004ba55034 Mon Sep 17 00:00:00 2001 From: Bogdan Burlacu Date: Wed, 15 Nov 2023 21:39:15 +0100 Subject: [PATCH] fix compile on clang-15 --- source/operators/non_dominated_sorter/merge_sort.cpp | 5 ++--- source/operators/non_dominated_sorter/rank_intersect.cpp | 2 +- 2 files changed, 3 insertions(+), 4 deletions(-) diff --git a/source/operators/non_dominated_sorter/merge_sort.cpp b/source/operators/non_dominated_sorter/merge_sort.cpp index dea5a8b..ff5fd6a 100644 --- a/source/operators/non_dominated_sorter/merge_sort.cpp +++ b/source/operators/non_dominated_sorter/merge_sort.cpp @@ -186,10 +186,9 @@ namespace detail { detail::BitsetManager bsm(n); cppsort::merge_sorter sorter; - std::vector items; - items.reserve(n); + std::vector items(n); for (auto i = 0; i < n; ++i) { - items.emplace_back(i, pop[i][1]); + items[i] = { i, pop[i][1] }; } sorter(items); diff --git a/source/operators/non_dominated_sorter/rank_intersect.cpp b/source/operators/non_dominated_sorter/rank_intersect.cpp index 4d77262..0ab9fd0 100644 --- a/source/operators/non_dominated_sorter/rank_intersect.cpp +++ b/source/operators/non_dominated_sorter/rank_intersect.cpp @@ -95,7 +95,7 @@ auto RankIntersectSorter::Sort(Operon::Span pop, Opero cppsort::merge_sorter sorter; std::vector items(n); for (auto i = 0; i < n; ++i) { - items[i] = {i, pop[i][1] }; + items[i] = { i, pop[i][1] }; } sorter(items);