From 132e020742c6d32ba83ad1535c2fd2820e69cf55 Mon Sep 17 00:00:00 2001
From: Marcus Holland-Moritz <github@mhxnet.de>
Date: Mon, 14 Apr 2025 00:03:00 +0200
Subject: [PATCH] refactor(metadata_v2): use std::stable_sort instead of boost
 algo

---
 src/reader/internal/metadata_v2.cpp | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

diff --git a/src/reader/internal/metadata_v2.cpp b/src/reader/internal/metadata_v2.cpp
index b206b128..a3b6f03e 100644
--- a/src/reader/internal/metadata_v2.cpp
+++ b/src/reader/internal/metadata_v2.cpp
@@ -39,8 +39,6 @@
 
 #include <boost/algorithm/string.hpp>
 
-#include <boost/sort/flat_stable_sort/flat_stable_sort.hpp>
-
 #include <thrift/lib/cpp2/frozen/FrozenUtil.h>
 #include <thrift/lib/cpp2/protocol/DebugProtocol.h>
 #include <thrift/lib/cpp2/protocol/Serializer.h>
@@ -955,9 +953,8 @@ metadata_v2_data::build_dir_icase_cache(logger& lgr) const {
       if (!std::ranges::is_sorted(names)) {
         std::vector<uint32_t> entries(range.size());
         std::iota(entries.begin(), entries.end(), 0);
-        boost::sort::flat_stable_sort(
-            entries.begin(), entries.end(),
-            [&](auto a, auto b) { return names[a] < names[b]; });
+        std::ranges::stable_sort(
+            entries, [&](auto a, auto b) { return names[a] < names[b]; });
         auto& pv = cache[inode];
         pv.reset(std::bit_width(entries.size()), entries.size());
         for (size_t i = 0; i < entries.size(); ++i) {