From fe7abcad1423f1a320453c5439b5b6b36f0d265a Mon Sep 17 00:00:00 2001 From: str4d Date: Fri, 13 Aug 2021 00:44:23 +0100 Subject: [PATCH] Adjust code comments to remove topological-sort references There's no point in renaming everything to reflect us not backporting the PR from upstream, but we may as well make the code comments make sense. Co-authored-by: Daira Hopwood --- src/main.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/main.cpp b/src/main.cpp index c8a3e6632..d0bae9de7 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -7287,7 +7287,7 @@ public: bool operator()(std::set::iterator a, std::set::iterator b) { /* As std::make_heap produces a max-heap, we want the entries with the - * fewest ancestors/highest fee to sort later. */ + * highest feerate to sort later. */ return mp->CompareDepthAndScore(*b, *a); } }; @@ -7488,7 +7488,7 @@ bool SendMessages(const Consensus::Params& params, CNode* pto) for (std::set::iterator it = pto->setInventoryTxToSend.begin(); it != pto->setInventoryTxToSend.end(); it++) { vInvTx.push_back(it); } - // Topologically and fee-rate sort the inventory we send for privacy and priority reasons. + // Sort the inventory we send for privacy and priority reasons. // A heap is used so that not all items need sorting if only a few are being sent. CompareInvMempoolOrder compareInvMempoolOrder(&mempool); std::make_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);