Compare commits

..

4 Commits

Author SHA1 Message Date
Richard Holland
a4e6dd2d3e clang 2024-10-12 18:49:14 +11:00
Richard Holland
e305c6b52a use std::lexicographical_compare_three_way for uint spaceship operator 2024-10-12 17:05:21 +11:00
Richard Holland
d921c87c88 also update max transactions for tx queue 2024-10-11 09:59:04 +11:00
RichardAH
7b94d3d99d increase txn in ledger target to 1000 (#372) 2024-10-11 08:21:23 +10:00
3 changed files with 17 additions and 3 deletions

View File

@@ -111,7 +111,7 @@ public:
std::uint32_t minimumTxnInLedgerSA = 1000; std::uint32_t minimumTxnInLedgerSA = 1000;
/// Number of transactions per ledger that fee escalation "works /// Number of transactions per ledger that fee escalation "works
/// towards". /// towards".
std::uint32_t targetTxnInLedger = 256; std::uint32_t targetTxnInLedger = 1000;
/** Optional maximum allowed value of transactions per ledger before /** Optional maximum allowed value of transactions per ledger before
fee escalation kicks in. By default, the maximum is an emergent fee escalation kicks in. By default, the maximum is an emergent
property of network, validator, and consensus performance. This property of network, validator, and consensus performance. This

View File

@@ -549,7 +549,8 @@ using uint128 = base_uint<128>;
using uint160 = base_uint<160>; using uint160 = base_uint<160>;
using uint256 = base_uint<256>; using uint256 = base_uint<256>;
template <std::size_t Bits, class Tag> /*
* template <std::size_t Bits, class Tag>
[[nodiscard]] inline constexpr std::strong_ordering [[nodiscard]] inline constexpr std::strong_ordering
operator<=>(base_uint<Bits, Tag> const& lhs, base_uint<Bits, Tag> const& rhs) operator<=>(base_uint<Bits, Tag> const& lhs, base_uint<Bits, Tag> const& rhs)
{ {
@@ -570,6 +571,19 @@ operator<=>(base_uint<Bits, Tag> const& lhs, base_uint<Bits, Tag> const& rhs)
return (*ret.first > *ret.second) ? std::strong_ordering::greater return (*ret.first > *ret.second) ? std::strong_ordering::greater
: std::strong_ordering::less; : std::strong_ordering::less;
} }
*/
template <std::size_t Bits, class Tag>
[[nodiscard]] inline constexpr std::strong_ordering
operator<=>(base_uint<Bits, Tag> const& lhs, base_uint<Bits, Tag> const& rhs)
{
return std::lexicographical_compare_three_way(
lhs.cbegin(),
lhs.cend(),
rhs.cbegin(),
rhs.cend(),
std::compare_three_way{});
}
template <std::size_t Bits, typename Tag> template <std::size_t Bits, typename Tag>
[[nodiscard]] inline constexpr bool [[nodiscard]] inline constexpr bool

View File

@@ -240,7 +240,7 @@ public:
bool LEDGER_REPLAY = false; bool LEDGER_REPLAY = false;
// Work queue limits // Work queue limits
int MAX_TRANSACTIONS = 250; int MAX_TRANSACTIONS = 1000;
static constexpr int MAX_JOB_QUEUE_TX = 1000; static constexpr int MAX_JOB_QUEUE_TX = 1000;
static constexpr int MIN_JOB_QUEUE_TX = 100; static constexpr int MIN_JOB_QUEUE_TX = 100;