fix: use native std::set::contains() instead of linear search

UdjinM6 · claude · UdjinM6 · commit b9713544a57e · 2026-01-14T15:23:19.000+03:00
Use C++20's native `std::set::contains()` method for `forMembers` and
`validCommitments` instead of `std23::ranges::contains()` which performs
an O(n) linear scan. The native method maintains O(log n) complexity.

Also removes the now-unused `&lt;util/std23.h&gt;` include from the file.

Co-Authored-By: Claude Opus 4.5 &lt;noreply@anthropic.com&gt;
diff --git a/src/active/dkgsession.cpp b/src/active/dkgsession.cpp
@@ -13,7 +13,6 @@
 #include <llmq/utils.h>
 #include <masternode/meta.h>
 #include <util/helpers.h>
-#include <util/std23.h>
 
 #include <chain.h>
 #include <deploymentstatus.h>
@@ -356,7 +355,7 @@ void ActiveDKGSession::SendJustification(CDKGPendingMessages& pendingMessages, P
 
     for (const uint32_t i : util::irange(members.size())) {
         const auto& m = members[i];
-        if (!std23::ranges::contains(forMembers, m->dmn->proTxHash)) {
+        if (!forMembers.contains(m->dmn->proTxHash)) {
             continue;
         }
         logger.Batch("justifying for %s", m->dmn->proTxHash.ToString());
@@ -561,7 +560,7 @@ std::vector<CFinalCommitment> ActiveDKGSession::FinalizeCommitments()
 
         for (const auto& p : prematureCommitments) {
             const auto& qc = p.second;
-            if (!std23::ranges::contains(validCommitments, p.first)) {
+            if (!validCommitments.contains(p.first)) {
                 continue;
             }
 
