20 #ifndef RIPPLE_LEDGER_CASHDIFF_H_INCLUDED
21 #define RIPPLE_LEDGER_CASHDIFF_H_INCLUDED
23 #include <ripple/basics/safe_cast.h>
24 #include <ripple/protocol/STAmount.h>
33 class ApplyStateTable;
47 return static_cast<CashFilter>(safe_cast<ul_t>(lhs) | safe_cast<ul_t>(rhs));
53 return static_cast<CashFilter>(safe_cast<ul_t>(lhs) & safe_cast<ul_t>(rhs));
152 return lhs[1] < rhs[1];
static constexpr std::size_t count_
const base_uint< Bits, Tag > operator|(base_uint< Bits, Tag > const &a, base_uint< Bits, Tag > const &b)
bool diffIsDust(STAmount const &v1, STAmount const &v2, std::uint8_t e10=6)
bool rmLhsDeletedOffers()
std::unique_ptr< Impl > impl_
bool rmRhsDeletedOffers()
std::size_t rhsOnlyCount() const
static constexpr std::size_t count()
STAmount const & takerPays() const
STAmount const & takerGets() const
std::size_t commonCount() const
const base_uint< Bits, Tag > operator&(base_uint< Bits, Tag > const &a, base_uint< Bits, Tag > const &b)
@ treatZeroOfferAsDeletion
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::size_t lhsOnlyCount() const
CashDiff & operator=(CashDiff const &)=delete
friend bool operator<(OfferAmounts const &lhs, OfferAmounts const &rhs)
STAmount const & operator[](std::size_t i) const
int xrpRoundToZero() const