#include <common/system.h>
#include <policy/policy.h>
#include <test/util/txmempool.h>
#include <txmempool.h>
#include <util/time.h>
#include <test/util/setup_common.h>
#include <boost/test/unit_test.hpp>
#include <vector>
Go to the source code of this file.
◆ BOOST_AUTO_TEST_CASE() [1/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolAncestorIndexingTest |
| ) |
|
◆ BOOST_AUTO_TEST_CASE() [2/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolAncestryTests |
| ) |
|
◆ BOOST_AUTO_TEST_CASE() [3/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolAncestryTestsDiamond |
| ) |
|
◆ BOOST_AUTO_TEST_CASE() [4/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolIndexingTest |
| ) |
|
tx8 and tx9 should both now be sorted higher Final order after tx10 is added:
tx3 = 0 (1) tx5 = 10000 (1) tx1 = 10000 (1) tx4 = 15000 (1) tx2 = 20000 (1) tx9 = 200k (2 txs) tx8 = 200k (2 txs) tx10 = 200k (1 tx) tx6 = 2.2M (5 txs) tx7 = 2.2M (4 txs)
Definition at line 129 of file mempool_tests.cpp.
◆ BOOST_AUTO_TEST_CASE() [5/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolRemoveTest |
| ) |
|
◆ BOOST_AUTO_TEST_CASE() [6/6]
BOOST_AUTO_TEST_CASE |
( |
MempoolSizeLimitTest |
| ) |
|
◆ CheckSort()
static void CheckSort |
( |
CTxMemPool & |
pool, |
|
|
std::vector< std::string > & |
sortedOrder |
|
) |
| |
|
static |
◆ make_tx()
◆ REMOVAL_REASON_DUMMY