mirror of
https://github.com/bitcoin/bitcoin.git
synced 2026-05-18 09:54:08 +02:00
clusterlin: use 'cost' terminology instead of 'iters' (refactor)
This commit is contained in:
committed by
Pieter Wuille
parent
9e7129df29
commit
ecc9a84f85
@@ -51,9 +51,9 @@ void BenchTxGraphTrim(benchmark::Bench& bench)
|
||||
static constexpr int NUM_DEPS_PER_BOTTOM_TX = 100;
|
||||
/** Set a very large cluster size limit so that only the count limit is triggered. */
|
||||
static constexpr int32_t MAX_CLUSTER_SIZE = 100'000 * 100;
|
||||
/** Set a very high number for acceptable iterations, so that we certainly benchmark optimal
|
||||
/** Set a very high number for acceptable cost, so that we certainly benchmark optimal
|
||||
* linearization. */
|
||||
static constexpr uint64_t NUM_ACCEPTABLE_ITERS = 100'000'000;
|
||||
static constexpr uint64_t HIGH_ACCEPTABLE_COST = 100'000'000;
|
||||
|
||||
/** Refs to all top transactions. */
|
||||
std::vector<TxGraph::Ref> top_refs;
|
||||
@@ -65,7 +65,7 @@ void BenchTxGraphTrim(benchmark::Bench& bench)
|
||||
std::vector<size_t> top_components;
|
||||
|
||||
InsecureRandomContext rng(11);
|
||||
auto graph = MakeTxGraph(MAX_CLUSTER_COUNT, MAX_CLUSTER_SIZE, NUM_ACCEPTABLE_ITERS, PointerComparator);
|
||||
auto graph = MakeTxGraph(MAX_CLUSTER_COUNT, MAX_CLUSTER_SIZE, HIGH_ACCEPTABLE_COST, PointerComparator);
|
||||
|
||||
// Construct the top chains.
|
||||
for (int chain = 0; chain < NUM_TOP_CHAINS; ++chain) {
|
||||
|
||||
Reference in New Issue
Block a user