diff --git a/src/test/policyestimator_tests.cpp b/src/test/policyestimator_tests.cpp --- a/src/test/policyestimator_tests.cpp +++ b/src/test/policyestimator_tests.cpp @@ -222,8 +222,7 @@ } // Test that if the mempool is limited, estimateSmartFee won't return a - // value below the mempool min fee and that estimateSmartPriority returns - // essentially an infinite value + // value below the mempool min mpool.addUnchecked( tx.GetId(), entry.Fee(feeV[5]).Time(GetTime()).Priority(0).Height(blocknum).FromTx( @@ -237,8 +236,6 @@ mpool.estimateFee(i).GetFeePerK()); BOOST_CHECK(mpool.estimateSmartFee(i).GetFeePerK() >= mpool.GetMinFee(1).GetFeePerK()); - BOOST_CHECK(mpool.estimateSmartPriority(i) == - double(INF_PRIORITY.GetSatoshis())); } } diff --git a/src/txmempool.h b/src/txmempool.h --- a/src/txmempool.h +++ b/src/txmempool.h @@ -727,14 +727,6 @@ /** Estimate fee rate needed to get into the next nBlocks */ CFeeRate estimateFee(int nBlocks) const; - /** - * Estimate priority needed to get into the next nBlocks. If no answer can - * be given at nBlocks, return an estimate at the lowest number of blocks - * where one can be given. - */ - double estimateSmartPriority(int nBlocks, - int *answerFoundAtBlocks = nullptr) const; - /** Write/Read estimates to disk */ bool WriteFeeEstimates(CAutoFile &fileout) const; bool ReadFeeEstimates(CAutoFile &filein); diff --git a/src/txmempool.cpp b/src/txmempool.cpp --- a/src/txmempool.cpp +++ b/src/txmempool.cpp @@ -941,12 +941,6 @@ return minerPolicyEstimator->estimateSmartFee(nBlocks, answerFoundAtBlocks, *this); } -double CTxMemPool::estimateSmartPriority(int nBlocks, - int *answerFoundAtBlocks) const { - LOCK(cs); - return minerPolicyEstimator->estimateSmartPriority( - nBlocks, answerFoundAtBlocks, *this); -} bool CTxMemPool::WriteFeeEstimates(CAutoFile &fileout) const { try {