Modernize `std::find_if` with ranges

In BTEmu.cpp, `std::mem_fn` was not necessary for the predicate to compile.

1 files changed, 6 insertions, 5 deletions

diff --git a/Source/Core/DolphinQt/FIFO/FIFOAnalyzer.cpp b/Source/Core/DolphinQt/FIFO/FIFOAnalyzer.cpp
index e33ba4c214..09cc7edb71 100644
--- a/Source/Core/DolphinQt/FIFO/FIFOAnalyzer.cpp
+++ b/Source/Core/DolphinQt/FIFO/FIFOAnalyzer.cpp
@@ -5,6 +5,7 @@
 
 #include <algorithm>
 #include <bit>
+#include <ranges>
 
 #include <QGroupBox>
 #include <QHBoxLayout>
@@ -472,9 +473,8 @@ void FIFOAnalyzer::FindNext()
   const int index = m_detail_list->currentRow();
   ASSERT(index >= 0);
 
-  auto next_result =
-      std::find_if(m_search_results.begin(), m_search_results.end(),
-                   [index](auto& result) { return result.m_cmd > static_cast<u32>(index); });
+  auto next_result = std::ranges::find_if(
+      m_search_results, [index](auto& result) { return result.m_cmd > static_cast<u32>(index); });
   if (next_result != m_search_results.end())
   {
     ShowSearchResult(next_result - m_search_results.begin());
@@ -487,8 +487,9 @@ void FIFOAnalyzer::FindPrevious()
   ASSERT(index >= 0);
 
   auto prev_result =
-      std::find_if(m_search_results.rbegin(), m_search_results.rend(),
-                   [index](auto& result) { return result.m_cmd < static_cast<u32>(index); });
+      std::ranges::find_if(m_search_results | std::views::reverse, [index](auto& result) {
+        return result.m_cmd < static_cast<u32>(index);
+      });
   if (prev_result != m_search_results.rend())
   {
     ShowSearchResult((m_search_results.rend() - prev_result) - 1);