txorphanage.cpp File Reference

#include <node/txorphanage.h>
#include <consensus/validation.h>
#include <logging.h>
#include <policy/policy.h>
#include <primitives/transaction.h>
#include <util/feefrac.h>
#include <util/time.h>
#include <util/hasher.h>
#include <boost/multi_index/indexed_by.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index/tag.hpp>
#include <boost/multi_index_container.hpp>
#include <cassert>
#include <cmath>
#include <unordered_map>

Include dependency graph for txorphanage.cpp:

Go to the source code of this file.

Classes
class	node::TxOrphanageImpl
struct	node::TxOrphanageImpl::Announcement
	One orphan announcement. More...
struct	node::TxOrphanageImpl::ByWtxid
struct	node::TxOrphanageImpl::WtxidExtractor
struct	node::TxOrphanageImpl::ByPeer
struct	node::TxOrphanageImpl::ByPeerViewExtractor
struct	node::TxOrphanageImpl::OrphanIndices
struct	node::TxOrphanageImpl::PeerDoSInfo

Namespaces
namespace	node

Functions
std::unique_ptr< TxOrphanage >	node::MakeTxOrphanage () noexcept
	Create a new TxOrphanage instance. More...
std::unique_ptr< TxOrphanage >	node::MakeTxOrphanage (TxOrphanage::Count max_global_latency_score, TxOrphanage::Usage reserved_peer_usage) noexcept

Variables
static constexpr NodeId	node::MIN_PEER {std::numeric_limits<NodeId>::min()}
	Minimum NodeId for lower_bound lookups (in practice, NodeIds start at 0). More...
static constexpr NodeId	node::MAX_PEER {std::numeric_limits<NodeId>::max()}
	Maximum NodeId for upper_bound lookups. More...