aboutsummaryrefslogtreecommitdiff
path: root/src/wallet/test/coinselector_tests.cpp
diff options
context:
space:
mode:
authorMurch <murch@murch.one>2024-01-08 15:26:21 -0500
committerMurch <murch@murch.one>2024-02-09 10:50:53 +0100
commit5f84f3cc043c5fb15072f5072fee752eaa01a2ec (patch)
treea4d35045af18ffddb37313fb06fc6385dfe78447 /src/wallet/test/coinselector_tests.cpp
parentd68bc74fb2e3ae4ae775ab544fe5b4ab46025abb (diff)
downloadbitcoin-5f84f3cc043c5fb15072f5072fee752eaa01a2ec.tar.xz
opt: Skip branches with worse weight
Once we exceed the weight of the current best selection, we can always shift as adding more inputs can never yield a better solution.
Diffstat (limited to 'src/wallet/test/coinselector_tests.cpp')
-rw-r--r--src/wallet/test/coinselector_tests.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/wallet/test/coinselector_tests.cpp b/src/wallet/test/coinselector_tests.cpp
index e23292d21f..fe9922e31c 100644
--- a/src/wallet/test/coinselector_tests.cpp
+++ b/src/wallet/test/coinselector_tests.cpp
@@ -1231,7 +1231,7 @@ BOOST_AUTO_TEST_CASE(coin_grinder_tests)
add_coin(4 * COIN, 3, expected_result);
BOOST_CHECK(EquivalentResult(expected_result, *res));
// Demonstrate how following improvements reduce iteration count and catch any regressions in the future.
- size_t expected_attempts = 2041;
+ size_t expected_attempts = 525;
BOOST_CHECK_MESSAGE(res->GetSelectionsEvaluated() == expected_attempts, strprintf("Expected %i attempts, but got %i", expected_attempts, res->GetSelectionsEvaluated()));
}