highperfocused/bitcoin
1
0
Fork 0
mirror of https://github.com/bitcoin/bitcoin.git synced 2025-11-11 22:50:59 +01:00
Code Issues Packages Projects Releases Wiki Activity

tree-wide: clang-format CTxMemPool references

Browse Source 
[META] Do this so that we can more easily grep for all actual instances
       of CTxMemPool construction.
This commit is contained in:
Carl Dong
2022-03-21 21:22:19 -04:00
parent 7008087548
commit 03574b956a
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/net_processing.cpp
View File

@@ -4628,7 +4628,7 @@ void PeerManagerImpl::MaybeSendFeefilter(CNode& pto, Peer& peer, std::chrono::mi
namespace { namespace {
class CompareInvMempoolOrder class CompareInvMempoolOrder
{ {
CTxMemPool *mp; CTxMemPool* mp;
bool m_wtxid_relay; bool m_wtxid_relay;
public: public:
explicit CompareInvMempoolOrder(CTxMemPool *_mempool, bool use_wtxid) explicit CompareInvMempoolOrder(CTxMemPool *_mempool, bool use_wtxid)

6
src/test/mempool_tests.cpp
View File

@@ -108,12 +108,12 @@ BOOST_AUTO_TEST_CASE(MempoolRemoveTest)
BOOST_CHECK_EQUAL(testPool.size(), 0U); BOOST_CHECK_EQUAL(testPool.size(), 0U);
} }
template<typename name> template <typename name>
static void CheckSort(CTxMemPool &pool, std::vector<std::string> &sortedOrder) EXCLUSIVE_LOCKS_REQUIRED(pool.cs) static void CheckSort(CTxMemPool& pool, std::vector<std::string>& sortedOrder) EXCLUSIVE_LOCKS_REQUIRED(pool.cs)
{ {
BOOST_CHECK_EQUAL(pool.size(), sortedOrder.size()); BOOST_CHECK_EQUAL(pool.size(), sortedOrder.size());
typename CTxMemPool::indexed_transaction_set::index<name>::type::iterator it = pool.mapTx.get<name>().begin(); typename CTxMemPool::indexed_transaction_set::index<name>::type::iterator it = pool.mapTx.get<name>().begin();
int count=0; int count = 0;
for (; it != pool.mapTx.get<name>().end(); ++it, ++count) { for (; it != pool.mapTx.get<name>().end(); ++it, ++count) {
BOOST_CHECK_EQUAL(it->GetTx().GetHash().ToString(), sortedOrder[count]); BOOST_CHECK_EQUAL(it->GetTx().GetHash().ToString(), sortedOrder[count]);
} }