diff --git a/AccountChannels_8cpp_source.html b/AccountChannels_8cpp_source.html
index c91c2cb441..b180a38891 100644
--- a/AccountChannels_8cpp_source.html
+++ b/AccountChannels_8cpp_source.html
@@ -322,7 +322,7 @@ $(function() {
Json::Value rpcError(int iError)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
std::string to_string(base_uint< Bits, Tag > const &a)
@ ltANY
A special type, matching any ledger entry type.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
bool isFlagLedger(LedgerIndex seq)
Returns true if the given ledgerIndex is a flag ledgerIndex.
static bool adjustOwnerCount(ApplyContext &ctx, int count)
std::string strHex(FwdIt begin, FwdIt end)
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
std::string makeFeaturesResponseHeader(http_request_type const &headers, bool comprEnabled, bool ledgerReplayEnabled, bool txReduceRelayEnabled, bool vpReduceRelayEnabled)
Make response header X-Protocol-Ctl value with supported features.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
static constexpr char DELIM_FEATURE[]
boost::beast::http::response< boost::beast::http::dynamic_body > http_response_type
void buildHandshake(boost::beast::http::fields &h, ripple::uint256 const &sharedValue, std::optional< std::uint32_t > networkID, beast::IP::Address public_ip, beast::IP::Address remote_ip, Application &app)
Insert fields headers necessary for upgrading the link to the peer protocol.
bool isFeatureValue(boost::beast::http::fields const &headers, std::string const &feature, std::string const &value)
Check if a feature's value is equal to the specified value.
std::optional< uint256 > makeSharedValue(stream_type &ssl, beast::Journal journal)
Computes a shared value based on the SSL connection state.
std::string const & supportedProtocolVersions()
The list of all the protocol versions we support.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
static std::optional< base_uint< 512 > > hashLastMessage(SSL const *ssl, size_t(*get)(const SSL *, void *, size_t))
Hashes the latest finished message from an SSL stream.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
316 using Seq = Ledger::Seq;
-
-
- 319 LedgerHistoryHelper h;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 364 using Seq = Ledger::Seq;
-
-
-
-
-
-
-
-
-
- 374 LedgerHistoryHelper h;
-
-
- 377 BEAST_EXPECT(t.
getPreferred(Seq{0})->id == genesis.id());
- 378 BEAST_EXPECT(t.
remove(genesis));
-
- 380 BEAST_EXPECT(!t.
remove(genesis));
-
-
-
-
- 385 LedgerHistoryHelper h;
-
- 387 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
-
-
-
-
- 392 LedgerHistoryHelper h;
-
-
- 395 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 396 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
-
-
-
-
- 401 LedgerHistoryHelper h;
-
-
- 404 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcd"].id());
- 405 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
-
-
-
-
- 410 LedgerHistoryHelper h;
-
-
-
- 414 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 415 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
-
-
- 418 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 419 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
-
-
-
-
- 424 LedgerHistoryHelper h;
-
-
-
- 428 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 429 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
-
-
- 432 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcd"].id());
- 433 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
-
-
-
-
- 438 LedgerHistoryHelper h;
-
-
-
- 442 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
- 443 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abce"].id());
-
-
- 446 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
- 447 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
-
-
-
-
-
- 453 LedgerHistoryHelper h;
-
-
-
-
- 458 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
- 459 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abce"].id());
- 460 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abce"].id());
-
-
-
-
- 465 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 466 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
-
-
-
-
-
- 472 LedgerHistoryHelper h;
-
-
-
- 476 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcde"].id());
- 477 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcde"].id());
- 478 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abcde"].id());
-
-
-
-
-
- 484 LedgerHistoryHelper h;
-
-
-
-
- 489 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
- 490 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
- 491 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abc"].id());
-
-
-
-
-
-
- 498 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcde"].id());
- 499 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcde"].id());
-
-
-
-
- 504 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abc"].id());
-
-
-
-
-
- 521 LedgerHistoryHelper h;
-
-
-
-
-
-
- 528 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
- 529 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
-
-
- 532 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"a"].id());
- 533 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
-
-
-
-
- 549 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
- 550 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
- 551 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"a"].id());
- 552 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
- 553 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"a"].id());
-
-
-
- 568 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
- 569 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
- 570 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"ab"].id());
- 571 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
- 572 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"a"].id());
-
-
-
- 587 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"abde"].id());
- 588 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"abde"].id());
- 589 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abde"].id());
- 590 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"ab"].id());
- 591 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"ab"].id());
-
-
-
-
-
-
-
- 599 using Seq = Ledger::Seq;
-
-
-
-
- 604 LedgerHistoryHelper h;
- 605 BEAST_EXPECT(!t.
remove(h[
""]));
-
-
-
-
-
-
-
-
-
-
-
-
-
- 619 BEAST_EXPECT(t.
remove(h[
"e"]));
-
-
-
-
-
-
-
-
-
-
- 630 LedgerHistoryHelper h;
-
-
-
-
-
-
-
-
+
+
+ 318 LedgerHistoryHelper h;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 363 using Seq = Ledger::Seq;
+
+
+
+
+
+
+
+
+
+ 373 LedgerHistoryHelper h;
+
+
+ 376 BEAST_EXPECT(t.
getPreferred(Seq{0})->id == genesis.id());
+ 377 BEAST_EXPECT(t.
remove(genesis));
+
+ 379 BEAST_EXPECT(!t.
remove(genesis));
+
+
+
+
+ 384 LedgerHistoryHelper h;
+
+ 386 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+
+
+
+
+ 391 LedgerHistoryHelper h;
+
+
+ 394 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 395 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+
+
+
+
+ 400 LedgerHistoryHelper h;
+
+
+ 403 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcd"].id());
+ 404 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
+
+
+
+
+ 409 LedgerHistoryHelper h;
+
+
+
+ 413 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 414 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+
+
+ 417 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 418 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+
+
+
+
+ 423 LedgerHistoryHelper h;
+
+
+
+ 427 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 428 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+
+
+ 431 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcd"].id());
+ 432 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
+
+
+
+
+ 437 LedgerHistoryHelper h;
+
+
+
+ 441 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
+ 442 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abce"].id());
+
+
+ 445 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
+ 446 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcd"].id());
+
+
+
+
+
+ 452 LedgerHistoryHelper h;
+
+
+
+
+ 457 BEAST_EXPECT(h[
"abce"].
id() > h[
"abcd"].
id());
+ 458 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abce"].id());
+ 459 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abce"].id());
+
+
+
+
+ 464 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 465 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+
+
+
+
+
+ 471 LedgerHistoryHelper h;
+
+
+
+ 475 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcde"].id());
+ 476 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcde"].id());
+ 477 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abcde"].id());
+
+
+
+
+
+ 483 LedgerHistoryHelper h;
+
+
+
+
+ 488 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abc"].id());
+ 489 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abc"].id());
+ 490 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abc"].id());
+
+
+
+
+
+
+ 497 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abcde"].id());
+ 498 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"abcde"].id());
+
+
+
+
+ 503 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"abc"].id());
+
+
+
+
+
+ 520 LedgerHistoryHelper h;
+
+
+
+
+
+
+ 527 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
+ 528 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
+
+
+ 531 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"a"].id());
+ 532 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
+
+
+
+
+ 548 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
+ 549 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
+ 550 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"a"].id());
+ 551 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
+ 552 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"a"].id());
+
+
+
+ 567 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"ab"].id());
+ 568 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"ab"].id());
+ 569 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"ab"].id());
+ 570 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"a"].id());
+ 571 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"a"].id());
+
+
+
+ 586 BEAST_EXPECT(t.
getPreferred(Seq{1})->id == h[
"abde"].id());
+ 587 BEAST_EXPECT(t.
getPreferred(Seq{2})->id == h[
"abde"].id());
+ 588 BEAST_EXPECT(t.
getPreferred(Seq{3})->id == h[
"abde"].id());
+ 589 BEAST_EXPECT(t.
getPreferred(Seq{4})->id == h[
"ab"].id());
+ 590 BEAST_EXPECT(t.
getPreferred(Seq{5})->id == h[
"ab"].id());
+
+
+
+
+
+
+
+
+
+
+
+ 602 LedgerHistoryHelper h;
+ 603 BEAST_EXPECT(!t.
remove(h[
""]));
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 617 BEAST_EXPECT(t.
remove(h[
"e"]));
+
+
+
+
+
+
+
+
+
+
+ 628 LedgerHistoryHelper h;
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
- 651 char depth = depthDist(gen);
-
- 653 for (
char d = 0; d < depth; ++d)
-
- 655 char a = offset + widthDist(gen);
-
- 657 offset = (a + 1) * width;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+ 649 char depth = depthDist(gen);
+
+ 651 for (
char d = 0; d < depth; ++d)
+
+ 653 char a = offset + widthDist(gen);
+
+ 655 offset = (a + 1) * width;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Ancestry trie of ledgers.
bool checkInvariants() const
Check the compressed trie and support invariants.
void run() override
Runs the suite.
void run() override
Runs the suite.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::shared_ptr< Ledger > loadByHash(uint256 const &ledgerHash, Application &app, bool acquire)
@ open
We haven't closed our ledger yet, but others might have.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
bool isFlagLedger(LedgerIndex seq)
Returns true if the given ledgerIndex is a flag ledgerIndex.
auto constexpr ledgerGenesisTimeResolution
Close time resolution in genesis ledger.
static std::uint32_t const sLCF_NoConsensusTime
48 for (
auto const& [k, v] : logTable)
-
-
- 51 ret[jss::levels] = lev;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 76 if (boost::iequals(partition,
"base"))
-
-
-
-
-
-
-
-
-
-
-
+ 47 for (
auto const& [k, v] : logTable)
+
+
+ 50 ret[jss::levels] = lev;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 75 if (boost::iequals(partition,
"base"))
+
+
+
+
+
+
+
+
+
+
+
std::string asString() const
Returns the unquoted string value.
static beast::severities::Severity toSeverity(LogSeverity level)
std::vector< std::pair< std::string, std::string > > partition_severities() const
static LogSeverity fromSeverity(beast::severities::Severity level)
@ objectValue
object value (collection of name/value pairs).
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::optional< Blob > strUnHex(std::size_t strSize, Iterator begin, Iterator end)
void saveManifests(soci::session &session, std::string const &dbTable, std::function< bool(PublicKey const &)> const &isTrusted, hash_map< PublicKey, Manifest > const &map, beast::Journal j)
saveManifests Saves all given manifests to the database.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
std::string base64_decode(std::string_view data)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
Stream & logMftAct(Stream &s, std::string const &action, PublicKey const &pk, std::uint32_t seq)
@ badMasterKey
The master key is not acceptable to us.
std::optional< Manifest > deserializeManifest(Slice s, beast::Journal journal)
Constructs Manifest from serialized string.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
Seed randomSeed()
Create a seed using secure random numbers.
std::unique_ptr< DatabaseCon > makeTestWalletDB(DatabaseCon::Setup const &setup, std::string const &dbname, beast::Journal j)
makeTestWalletDB Opens a test wallet database with an arbitrary name.
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
SecretKey generateSecretKey(KeyType type, Seed const &seed)
Generate a new secret key deterministically.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
@ badMasterKey
The master key is not acceptable to us.
@ stale
Sequence is too old.
Keylet const & skip() noexcept
The index of the "short" skip list.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
bool canAdd(STAmount const &amt1, STAmount const &amt2)
Safely checks if two STAmount values can be added without overflow, underflow, or precision loss.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
boost::intrusive_ptr< SHAMapItem > make_shamapitem(uint256 const &tag, Slice data)
std::uint32_t constexpr FLAG_LEDGER_INTERVAL
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
SecretKey randomSecretKey()
Create a secret key using secure random numbers.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
ApplyResult apply(Application &app, OpenView &view, STTx const &tx, ApplyFlags flags, beast::Journal journal)
Apply a transaction to an OpenView.
create_genesis_t const create_genesis
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
std::optional< std::uint64_t > to_uint64(std::string const &s)
Json::Value rpcError(int iError)
void serializePayChanAuthorization(Serializer &msg, uint256 const &key, XRPAmount const &amt)
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
static TER closeChannel(std::shared_ptr< SLE > const &slep, ApplyView &view, uint256 const &key, beast::Journal j)
bool isXRP(AccountID const &c)
constexpr std::uint32_t tfRenew
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
@ lsfDisallowIncomingPayChan
void serializePayChanAuthorization(Serializer &msg, uint256 const &key, XRPAmount const &amt)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static bool adjustOwnerCount(ApplyContext &ctx, int count)
NotTEC preflight2(PreflightContext const &ctx)
Checks whether the signature appears valid.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::enable_if_t< std::is_integral< Integral >::value &&detail::is_engine< Engine >::value, Integral > rand_int(Engine &engine, Integral min, Integral max)
Return a uniformly distributed random integer.
std::string strHex(FwdIt begin, FwdIt end)
static std::shared_ptr< PeerImp > getPeerWithLedger(OverlayImpl &ov, uint256 const &ledgerHash, LedgerIndex ledger, PeerImp const *skip)
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
Stopwatch & stopwatch()
Returns an instance of a wall clock.
boost::beast::http::request< boost::beast::http::dynamic_body > http_request_type
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
static std::shared_ptr< PeerImp > getPeerWithTree(OverlayImpl &ov, uint256 const &rootHash, PeerImp const *skip)
bool peerFeatureEnabled(headers const &request, std::string const &feature, std::string value, bool config)
Check if a feature should be enabled for a peer.
void forceValidity(HashRouter &router, uint256 const &txid, Validity validity)
Sets the validity of a given transaction in the cache.
108 for (
int i = 0; i < slice.
size(); ++i)
- 110 s +=
"0123456789ABCDEF"[((slice[i] & 0xf0) >> 4)];
- 111 s +=
"0123456789ABCDEF"[((slice[i] & 0x0f) >> 0)];
-
-
-
-
-
-
-
-
- 132 boost::multiprecision::number<boost::multiprecision::cpp_int_backend<
-
+ 110 constexpr char hex[] =
"0123456789ABCDEF";
+ 111 s += hex[((slice[i] & 0xf0) >> 4)];
+ 112 s += hex[((slice[i] & 0x0f) >> 0)];
+
+
+
+
+
+
+
+
+ 133 boost::multiprecision::number<boost::multiprecision::cpp_int_backend<
- 135 boost::multiprecision::signed_magnitude,
- 136 boost::multiprecision::unchecked,
-
-
- 139 static uint264
const G(
- 140 "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
-
-
-
- 144 if ((sig.
size() < 8) || (sig.
size() > 72))
-
- 146 if ((sig[0] != 0x30) || (sig[1] != (sig.
size() - 2)))
-
-
-
-
- 151 if (!r || !s || !p.
empty())
-
-
-
-
-
-
-
-
-
-
-
-
- 164 auto const Sp = G - S;
-
-
-
-
-
-
-
-
- 173 if (sig.
size() != 64)
-
-
-
- 177 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
- 178 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0xDE, 0xF9, 0xDE, 0xA2, 0xF7,
- 179 0x9C, 0xD6, 0x58, 0x12, 0x63, 0x1A, 0x5C, 0xF5, 0xD3, 0xED,
-
-
-
- 183 auto const le = sig.
data() + 32;
-
-
-
-
-
-
-
-
-
-
-
-
- 196 "PublicKey::PublicKey - Input slice cannot be an undersized "
-
-
-
- 200 LogicError(
"PublicKey::PublicKey invalid type");
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 225 if (slice.
size() == 33)
-
- 227 if (slice[0] == 0xED)
-
-
- 230 if (slice[0] == 0x02 || slice[0] == 0x03)
-
-
-
-
-
-
-
-
-
-
-
- 242 bool mustBeFullyCanonical)
noexcept
-
-
- 245 LogicError(
"sign: secp256k1 required for digest signing");
-
-
-
- 249 if (mustBeFullyCanonical &&
-
-
-
- 253 secp256k1_pubkey pubkey_imp;
- 254 if (secp256k1_ec_pubkey_parse(
-
-
- 257 reinterpret_cast<unsigned char const*
>(publicKey.data()),
- 258 publicKey.size()) != 1)
-
-
- 261 secp256k1_ecdsa_signature sig_imp;
- 262 if (secp256k1_ecdsa_signature_parse_der(
-
-
- 265 reinterpret_cast<unsigned char const*
>(sig.data()),
-
-
-
-
- 270 secp256k1_ecdsa_signature sig_norm;
- 271 if (secp256k1_ecdsa_signature_normalize(
-
-
- 274 return secp256k1_ecdsa_verify(
-
-
- 277 reinterpret_cast<unsigned char const*
>(
digest.data()),
-
-
- 280 return secp256k1_ecdsa_verify(
-
-
- 283 reinterpret_cast<unsigned char const*
>(
digest.data()),
-
-
-
-
-
-
-
-
- 292 bool mustBeFullyCanonical)
noexcept
-
-
-
-
-
-
- 299 publicKey,
sha512Half(m), sig, mustBeFullyCanonical);
-
-
-
-
-
-
-
-
-
-
- 310 return ed25519_sign_open(
- 311 m.data(), m.size(), publicKey.data() + 1, sig.data()) ==
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+ 136 boost::multiprecision::signed_magnitude,
+ 137 boost::multiprecision::unchecked,
+
+
+ 140 static uint264
const G(
+ 141 "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
+
+
+
+ 145 if ((sig.
size() < 8) || (sig.
size() > 72))
+
+ 147 if ((sig[0] != 0x30) || (sig[1] != (sig.
size() - 2)))
+
+
+
+
+ 152 if (!r || !s || !p.
empty())
+
+
+
+
+
+
+
+
+
+
+
+
+ 165 auto const Sp = G - S;
+
+
+
+
+
+
+
+
+ 174 if (sig.
size() != 64)
+
+
+
+ 178 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ 179 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0xDE, 0xF9, 0xDE, 0xA2, 0xF7,
+ 180 0x9C, 0xD6, 0x58, 0x12, 0x63, 0x1A, 0x5C, 0xF5, 0xD3, 0xED,
+
+
+
+ 184 auto const le = sig.
data() + 32;
+
+
+
+
+
+
+
+
+
+
+
+
+ 197 "PublicKey::PublicKey - Input slice cannot be an undersized "
+
+
+
+ 201 LogicError(
"PublicKey::PublicKey invalid type");
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 226 if (slice.
size() == 33)
+
+ 228 if (slice[0] == 0xED)
+
+
+ 231 if (slice[0] == 0x02 || slice[0] == 0x03)
+
+
+
+
+
+
+
+
+
+
+
+ 243 bool mustBeFullyCanonical)
noexcept
+
+
+ 246 LogicError(
"sign: secp256k1 required for digest signing");
+
+
+
+ 250 if (mustBeFullyCanonical &&
+
+
+
+ 254 secp256k1_pubkey pubkey_imp;
+ 255 if (secp256k1_ec_pubkey_parse(
+
+
+ 258 reinterpret_cast<unsigned char const*
>(publicKey.data()),
+ 259 publicKey.size()) != 1)
+
+
+ 262 secp256k1_ecdsa_signature sig_imp;
+ 263 if (secp256k1_ecdsa_signature_parse_der(
+
+
+ 266 reinterpret_cast<unsigned char const*
>(sig.data()),
+
+
+
+
+ 271 secp256k1_ecdsa_signature sig_norm;
+ 272 if (secp256k1_ecdsa_signature_normalize(
+
+
+ 275 return secp256k1_ecdsa_verify(
+
+
+ 278 reinterpret_cast<unsigned char const*
>(
digest.data()),
+
+
+ 281 return secp256k1_ecdsa_verify(
+
+
+ 284 reinterpret_cast<unsigned char const*
>(
digest.data()),
+
+
+
+
+
+
+
+
+ 293 bool mustBeFullyCanonical)
noexcept
+
+
+
+
+
+
+ 300 publicKey,
sha512Half(m), sig, mustBeFullyCanonical);
+
+
+
+
+
+
+
+
+
+
+ 311 return ed25519_sign_open(
+ 312 m.data(), m.size(), publicKey.data() + 1, sig.data()) ==
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
@@ -403,7 +404,7 @@ $(function() {
Slice slice() const noexcept
PublicKey & operator=(PublicKey const &other)
PublicKey & operator=(PublicKey const &other)
An immutable linear range of bytes.
bool empty() const noexcept
Return true if the byte range is empty.
std::uint8_t const * data() const noexcept
Return a pointer to beginning of the storage.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
secp256k1_context const * secp256k1Context()
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
std::optional< AccountID > parseBase58(std::string const &s)
Parse AccountID from checked, base58 string.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
static std::string sliceToHex(Slice const &slice)
base_uint< 160, detail::NodeIDTag > NodeID
NodeID is a 160-bit hash representing one node.
static std::optional< Slice > sigPart(Slice &buf)
std::ostream & operator<<(std::ostream &out, base_uint< Bits, Tag > const &u)
std::string decodeBase58Token(std::string const &s, TokenType type)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
static Hasher::result_type digest(void const *data, std::size_t size) noexcept
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
static bool ed25519Canonical(Slice const &sig)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
static bool ed25519Canonical(Slice const &sig)
sha512_half_hasher::result_type sha512Half(Args const &... args)
Returns the SHA512-Half of a series of objects.
void LogicError(std::string const &how) noexcept
Called when faulty logic causes a broken invariant.
const_iterator end() const noexcept
Slice slice() const noexcept
PublicKey & operator=(PublicKey const &other)
PublicKey & operator=(PublicKey const &other)
std::uint8_t const * data() const
ripple::AccountID getOrThrow(Json::Value const &v, ripple::SField const &field)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
base_uint< 160, detail::AccountIDTag > AccountID
A 160-bit unsigned that uniquely identifies an account.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
void hash_append(Hasher &h, Slice const &v)
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
std::optional< Blob > strUnHex(std::size_t strSize, Iterator begin, Iterator end)
std::optional< AccountID > parseBase58(std::string const &s)
Parse AccountID from checked, base58 string.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
base_uint< 160, detail::NodeIDTag > NodeID
NodeID is a 160-bit hash representing one node.
std::ostream & operator<<(std::ostream &out, base_uint< Bits, Tag > const &u)
std::string encodeBase58Token(TokenType type, void const *token, std::size_t size)
Encode data in Base58Check format using XRPL alphabet.
AccountID calcAccountID(PublicKey const &pk)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static Hasher::result_type digest(void const *data, std::size_t size) noexcept
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
bool operator<(Slice const &lhs, Slice const &rhs) noexcept
constexpr bool operator==(base_uint< Bits, Tag > const &lhs, base_uint< Bits, Tag > const &rhs)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
uint256 proposalUniqueId(uint256 const &proposeHash, uint256 const &previousLedger, std::uint32_t proposeSeq, NetClock::time_point closeTime, Slice const &publicKey, Slice const &signature)
Calculate a unique identifier for a signed proposal.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
@ proposal
proposal for signing
@ current
This was a new validation and was added.
@ conflicting
Multiple validations by a validator for different ledgers.
@ multiple
Multiple validations by a validator for the same ledger.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
235 Seq
const maxAncestors = 256;
-
-
-
-
-
-
- 242 auto prev = std::make_shared<Ledger const>(
-
-
-
- 246 env.
app().getNodeFamily());
-
- 248 for (
auto i = 0; i < (maxAncestors + 10); ++i)
-
- 250 auto next = std::make_shared<Ledger>(
-
- 252 next->updateSkipList();
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 278 BEAST_EXPECT(trie.
remove(ledg_258, 3));
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+ 234 Seq
const maxAncestors = 256;
+
+
+
+
+
+
+ 241 auto prev = std::make_shared<Ledger const>(
+
+
+
+ 245 env.
app().getNodeFamily());
+
+ 247 for (
auto i = 0; i < (maxAncestors + 10); ++i)
+
+ 249 auto next = std::make_shared<Ledger>(
+
+ 251 next->updateSkipList();
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 277 BEAST_EXPECT(trie.
remove(ledg_258, 3));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
@@ -434,7 +433,7 @@ $(function() {
void testRCLValidatedLedger()
void run() override
Runs the suite.
void run() override
Runs the suite.
void testLedgerTrieRCLValidatedLedger()
A transaction testing environment.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
RCLValidatedLedger::Seq mismatch(RCLValidatedLedger const &a, RCLValidatedLedger const &b)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
create_genesis_t const create_genesis
std::pair< PublicKey, SecretKey > randomKeyPair(KeyType type)
Create a key pair using secure random numbers.
std::optional< std::uint64_t > to_uint64(std::string const &s)
Json::Value rpcError(int iError)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
bool isRpcError(Json::Value jvResult)
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
ServerHandler::Setup setup_ServerHandler(Config const &config, std::ostream &&log)
671 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
672 "abcdefghijklmnopqrstuvwxyz");
- 674 for (
char c : symbols)
+ 674 for (
unsigned char c : symbols)
- 679 for (
auto c : *optData)
+ 679 for (
unsigned char c : *optData)
681 if (!allowedSymbols[c])
@@ -1002,7 +1002,7 @@ $(function() {
TxType
Transaction type identifiers.
bool isPseudoTx(STObject const &tx)
Check whether a transaction is a pseudo-transaction.
Serializer startMultiSigningData(STObject const &obj)
Break the multi-signing hash computation into 2 parts for optimization.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
static bool isMemoOkay(STObject const &st, std::string &reason)
static bool isRawTransactionOkay(STObject const &st, std::string &reason)
std::size_t constexpr txMinSizeBytes
Protocol specific constants.
static auto getTxFormat(TxType type)
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static bool invalidMPTAmountInTx(STObject const &tx)
std::string sqlBlobLiteral(Blob const &blob)
Format arbitrary binary data as an SQLite "blob literal".
std::string strHex(FwdIt begin, FwdIt end)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
constexpr std::uint32_t vfFullyCanonicalSig
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
beast::Journal debugLog()
Returns a debug journal.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
SecretKey generateSecretKey(KeyType type, Seed const &seed)
Generate a new secret key deterministically.
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::string decodeBase58Token(std::string const &s, TokenType type)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
static Hasher::result_type digest(void const *data, std::size_t size) noexcept
void rngfill(void *const buffer, std::size_t const bytes, Generator &g)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::optional< ECDSACanonicality > ecdsaCanonicality(Slice const &sig)
Determines the canonicality of a signature.
std::string toBase58(AccountID const &v)
Convert AccountID to base58 checked string.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
bool verifyDigest(PublicKey const &publicKey, uint256 const &digest, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a secp256k1 signature on the digest of a message.
std::pair< PublicKey, SecretKey > generateKeyPair(KeyType type, Seed const &seed)
Generate a key pair deterministically.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
AccountID calcAccountID(PublicKey const &pk)
csprng_engine & crypto_prng()
The default cryptographically secure PRNG.
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
SecretKey generateSecretKey(KeyType type, Seed const &seed)
Generate a new secret key deterministically.
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static Hasher::result_type digest(void const *data, std::size_t size) noexcept
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
SecretKey randomSecretKey()
Create a secret key using secure random numbers.
std::pair< PublicKey, SecretKey > generateKeyPair(KeyType type, Seed const &seed)
Generate a key pair deterministically.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
Seed randomSeed()
Create a seed using secure random numbers.
AccountID calcAccountID(PublicKey const &pk)
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::string to_string(base_uint< Bits, Tag > const &a)
std::pair< PublicKey, SecretKey > randomKeyPair(KeyType type)
Create a key pair using secure random numbers.
std::optional< Seed > parseGenericSeed(std::string const &str, bool rfc1751=true)
Attempt to parse a string as a seed.
constexpr std::uint32_t asfDisableMaster
constexpr std::uint32_t asfDisallowIncomingTrustline
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
void loadGranularPermission(std::shared_ptr< SLE const > const &delegate, TxType const &type, std::unordered_set< GranularPermissionType > &granularPermissions)
Load the granular permissions granted to the delegate account for the specified transaction type.
NotTEC preflight2(PreflightContext const &ctx)
Checks whether the signature appears valid.
constexpr std::uint32_t asfAccountTxnID
NotTEC preflight1(PreflightContext const &ctx)
Performs early sanity checks on the account and fee fields.
AccountID calcAccountID(PublicKey const &pk)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
NotTEC preflight2(PreflightContext const &ctx)
Checks whether the signature appears valid.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
void finishMultiSigningData(AccountID const &signingID, Serializer &s)
Serializer startMultiSigningData(STObject const &obj)
Break the multi-signing hash computation into 2 parts for optimization.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
Serializer buildMultiSigningData(STObject const &obj, AccountID const &signingID)
Return a Serializer suitable for computing a multisigning TxnSignature.
bool set(T &target, std::string const &name, Section const §ion)
Set a value from a configuration Section If the named value is not found or doesn't parse as a T,...
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
TypedField< STBlob > SF_VL
void finishMultiSigningData(AccountID const &signingID, Serializer &s)
Serializer startMultiSigningData(STObject const &obj)
Break the multi-signing hash computation into 2 parts for optimization.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
Serializer buildMultiSigningData(STObject const &obj, AccountID const &signingID)
Return a Serializer suitable for computing a multisigning TxnSignature.
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
Serializer buildMultiSigningData(STObject const &obj, AccountID const &signingID)
Return a Serializer suitable for computing a multisigning TxnSignature.
XRPAmount calculateBaseFee(ReadView const &view, STTx const &tx)
Compute only the expected base fee for a transaction.
bool isLegalNet(STAmount const &value)
@ open
We haven't closed our ledger yet, but others might have.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static void removeExpiredCredentials(ApplyView &view, std::vector< uint256 > const &creds, beast::Journal viewJ)
static bool adjustOwnerCount(ApplyContext &ctx, int count)
std::string transToken(TER code)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
bool from_string(RangeSet< T > &rs, std::string const &s)
Convert the given styled string to a RangeSet.
std::string strHex(FwdIt begin, FwdIt end)
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
805 Ledger ledgerACD = h[
"acd"];
-
-
- 810 auto pref = [](
Ledger ledger) {
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 830 BEAST_EXPECT(ledgerB.
id() > ledgerA.
id());
-
-
-
-
-
-
-
-
- 839 harness.
clock().advance(5s);
-
-
- 842 for (
auto const& node : {a, b, c, d})
-
-
-
-
-
-
-
-
-
-
- 853 harness.
clock().advance(5s);
- 854 for (
auto const& node : {a, b, c, d})
-
-
- 857 for (
auto const& ledger : {ledgerA, ledgerB, ledgerACD})
-
-
-
-
-
-
-
- 865 using namespace std::chrono_literals;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 886 ++peerCounts[ledgerB.
id()];
-
-
-
-
-
-
- 893 ++peerCounts[ledgerC.
id()];
-
- 895 BEAST_EXPECT(ledgerC.
id() > ledgerB.
id());
-
-
-
-
-
- 901 peerCounts[ledgerC.
id()] += 1000;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 925 using namespace std::chrono_literals;
- 926 testcase(
"Acquire validated ledger");
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 954 harness.
add(b.
validate(ID{3}, Seq{2}, 0s, 0s,
true)));
-
-
-
-
-
- 960 Ledger ledgerAB = h[
"ab"];
-
-
-
-
- 965 harness.
clock().advance(5s);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 982 harness.
clock().advance(5s);
- 983 Ledger ledgerABCDE = h[
"abcde"];
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1020 BEAST_EXPECT(enforcer(clock.now(), Seq{1}, p));
- 1021 BEAST_EXPECT(enforcer(clock.now(), Seq{10}, p));
- 1022 BEAST_EXPECT(!enforcer(clock.now(), Seq{5}, p));
- 1023 BEAST_EXPECT(!enforcer(clock.now(), Seq{9}, p));
-
- 1025 BEAST_EXPECT(!enforcer(clock.now(), Seq{1}, p));
-
- 1027 BEAST_EXPECT(enforcer(clock.now(), Seq{1}, p));
-
-
-
-
-
-
-
-
- 1036 auto checker = [
this](
-
-
-
-
- 1041 : trustedVals[0].ledgerID();
-
-
- 1044 : trustedVals[0].seq();
-
-
-
-
- 1049 trustedVals.size());
- 1050 if (trustedVals.empty())
-
- 1052 vals.
getPreferred(this->genesisLedger) == std::nullopt);
-
-
- 1055 vals.
getPreferred(this->genesisLedger)->second == testID);
-
-
-
-
-
-
-
-
-
-
-
- 1067 Ledger ledgerAB = h[
"ab"];
-
-
-
-
-
- 1073 checker(harness.
vals(), listed, trustedVals);
-
- 1075 trustedVals.clear();
-
- 1077 checker(harness.
vals(), listed, trustedVals);
-
-
-
-
-
-
-
-
- 1086 Ledger ledgerAB = h[
"ab"];
-
-
-
-
-
- 1092 checker(harness.
vals(), listed, trustedVals);
-
- 1094 trustedVals.push_back(v);
-
- 1096 checker(harness.
vals(), listed, trustedVals);
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1110 auto& vals = harness.
vals();
- 1111 BEAST_EXPECT(vals.currentTrusted() == trustedVals);
-
-
-
-
-
- 1117 trustedVals.clear();
-
-
-
- 1121 BEAST_EXPECT(vals.currentTrusted() == trustedVals);
- 1122 BEAST_EXPECT(vals.getPreferred(
genesisLedger) == std::nullopt);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+ 809 auto pref = [](
Ledger ledger) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 829 BEAST_EXPECT(ledgerB.
id() > ledgerA.
id());
+
+
+
+
+
+
+
+
+ 838 harness.
clock().advance(5s);
+
+
+ 841 for (
auto const& node : {a, b, c, d})
+
+
+
+
+
+
+
+
+
+
+ 852 harness.
clock().advance(5s);
+ 853 for (
auto const& node : {a, b, c, d})
+
+
+ 856 for (
auto const& ledger : {ledgerA, ledgerB, ledgerACD})
+
+
+
+
+
+
+
+ 864 using namespace std::chrono_literals;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 885 ++peerCounts[ledgerB.
id()];
+
+
+
+
+
+
+ 892 ++peerCounts[ledgerC.
id()];
+
+ 894 BEAST_EXPECT(ledgerC.
id() > ledgerB.
id());
+
+
+
+
+
+ 900 peerCounts[ledgerC.
id()] += 1000;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 924 using namespace std::chrono_literals;
+ 925 testcase(
"Acquire validated ledger");
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 953 harness.
add(b.
validate(ID{3}, Seq{2}, 0s, 0s,
true)));
+
+
+
+
+
+ 959 Ledger ledgerAB = h[
"ab"];
+
+
+
+
+ 964 harness.
clock().advance(5s);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 981 harness.
clock().advance(5s);
+ 982 Ledger ledgerABCDE = h[
"abcde"];
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1019 BEAST_EXPECT(enforcer(clock.now(), Seq{1}, p));
+ 1020 BEAST_EXPECT(enforcer(clock.now(), Seq{10}, p));
+ 1021 BEAST_EXPECT(!enforcer(clock.now(), Seq{5}, p));
+ 1022 BEAST_EXPECT(!enforcer(clock.now(), Seq{9}, p));
+
+ 1024 BEAST_EXPECT(!enforcer(clock.now(), Seq{1}, p));
+
+ 1026 BEAST_EXPECT(enforcer(clock.now(), Seq{1}, p));
+
+
+
+
+
+
+
+
+ 1035 auto checker = [
this](
+
+
+
+
+ 1040 : trustedVals[0].ledgerID();
+
+
+ 1043 : trustedVals[0].seq();
+
+
+
+
+ 1048 trustedVals.size());
+ 1049 if (trustedVals.empty())
+
+ 1051 vals.
getPreferred(this->genesisLedger) == std::nullopt);
+
+
+ 1054 vals.
getPreferred(this->genesisLedger)->second == testID);
+
+
+
+
+
+
+
+
+
+
+
+ 1066 Ledger ledgerAB = h[
"ab"];
+
+
+
+
+
+ 1072 checker(harness.
vals(), listed, trustedVals);
+
+ 1074 trustedVals.clear();
+
+ 1076 checker(harness.
vals(), listed, trustedVals);
+
+
+
+
+
+
+
+
+ 1085 Ledger ledgerAB = h[
"ab"];
+
+
+
+
+
+ 1091 checker(harness.
vals(), listed, trustedVals);
+
+ 1093 trustedVals.push_back(v);
+
+ 1095 checker(harness.
vals(), listed, trustedVals);
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1109 auto& vals = harness.
vals();
+ 1110 BEAST_EXPECT(vals.currentTrusted() == trustedVals);
+
+
+
+
+
+ 1116 trustedVals.clear();
+
+
+
+ 1120 BEAST_EXPECT(vals.currentTrusted() == trustedVals);
+ 1121 BEAST_EXPECT(vals.getPreferred(
genesisLedger) == std::nullopt);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Abstract interface to a clock.
Manual clock implementation.
void testAcquireValidatedLedger()
void testAcquireValidatedLedger()
void testGetPreferredLedger()
void testGetCurrentPublicKeys()
Ledger const genesisLedger
beast::abstract_clock< std::chrono::steady_clock > const clock_type
void testNumTrustedForLedger()
void run() override
Runs the suite.
void testNumTrustedForLedger()
void run() override
Runs the suite.
void testTrustedByLedgerFunctions()
void testGetPreferredLCL()
void testGetPreferredLCL()
static NetClock::time_point toNetClock(clock_type const &c)
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
SecretKey generateSecretKey(KeyType type, Seed const &seed)
Generate a new secret key deterministically.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::optional< ValidatorToken > loadValidatorToken(std::vector< std::string > const &blob, beast::Journal journal)
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
SecretKey generateSecretKey(KeyType type, Seed const &seed)
Generate a new secret key deterministically.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::optional< Blob > strUnHex(std::size_t strSize, Iterator begin, Iterator end)
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
@ ValidatorListPropagation
@ ValidatorList2Propagation
std::string base64_decode(std::string_view data)
@ expired
List is expired, but has the largest non-pending sequence seen so far.
@ invalid
Invalid format or signature.
std::error_code make_error_code(ripple::TokenCodecErrc e)
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
@ accepted
Manifest is valid.
@ invalid
Timely, but invalid signature.
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::optional< Blob > strViewUnHex(std::string_view strSrc)
@ same_sequence
Same sequence as current list.
@ expired
List is expired, but has the largest non-pending sequence seen so far.
PublicKey derivePublicKey(KeyType type, SecretKey const &sk)
Derive the public key from a secret key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
SecretKey randomSecretKey()
Create a secret key using secure random numbers.
std::string base64_encode(std::uint8_t const *data, std::size_t len)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::pair< PublicKey, SecretKey > randomKeyPair(KeyType type)
Create a key pair using secure random numbers.
bool isAdmin(Port const &port, Json::Value const ¶ms, beast::IP::Address const &remoteIp)
std::string strHex(FwdIt begin, FwdIt end)
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
NodeID calcNodeID(PublicKey const &)
Calculate the 160-bit node ID from a node public key.
std::string to_string(base_uint< Bits, Tag > const &a)
std::pair< PublicKey, SecretKey > randomKeyPair(KeyType type)
Create a key pair using secure random numbers.
JSON (JavaScript Object Notation).
bool operator==(AttestationClaim const &lhs, AttestationClaim const &rhs)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool verify(PublicKey const &publicKey, Slice const &m, Slice const &sig, bool mustBeFullyCanonical=true) noexcept
Verify a signature on a message.
bool isLegalNet(STAmount const &value)
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
bool isTefFailure(TER x) noexcept
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
static bool adjustOwnerCount(ApplyContext &ctx, int count)
NotTEC preflight2(PreflightContext const &ctx)
Checks whether the signature appears valid.
constexpr std::uint32_t tfClearAccountCreateAmount
707 Cont::is_unordered::value,
- 708 Cont::is_multi::value,
- 709 Cont::is_map::value>;
- 710 using size_type =
typename Cont::size_type;
-
- 712 BEAST_EXPECT(c.size() == v.size());
- 713 BEAST_EXPECT(size_type(
std::distance(c.begin(), c.end())) == v.size());
- 714 BEAST_EXPECT(size_type(
std::distance(c.cbegin(), c.cend())) == v.size());
-
-
- 717 c.chronological.begin(), c.chronological.end())) == v.size());
-
-
- 720 c.chronological.cbegin(), c.chronological.cend())) == v.size());
-
-
- 723 c.chronological.rbegin(), c.chronological.rend())) == v.size());
-
-
- 726 c.chronological.crbegin(), c.chronological.crend())) == v.size());
-
-
-
-
- 731template <
class Cont,
class Values>
-
-
-
-
-
-
-
-
-
-
-
-
-
- 745 Cont::is_unordered::value,
- 746 Cont::is_multi::value,
- 747 Cont::is_map::value>;
- 748 using Values =
typename Traits::Values;
-
-
-
+ 706 using size_type =
typename Cont::size_type;
+
+ 708 BEAST_EXPECT(c.size() == v.size());
+ 709 BEAST_EXPECT(size_type(
std::distance(c.begin(), c.end())) == v.size());
+ 710 BEAST_EXPECT(size_type(
std::distance(c.cbegin(), c.cend())) == v.size());
+
+
+ 713 c.chronological.begin(), c.chronological.end())) == v.size());
+
+
+ 716 c.chronological.cbegin(), c.chronological.cend())) == v.size());
+
+
+ 719 c.chronological.rbegin(), c.chronological.rend())) == v.size());
+
+
+ 722 c.chronological.crbegin(), c.chronological.crend())) == v.size());
+
+
+
+
+ 727template <
class Cont,
class Values>
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 741 Cont::is_unordered::value,
+ 742 Cont::is_multi::value,
+ 743 Cont::is_map::value>;
+ 744 using Values =
typename Traits::Values;
+
+
+
+
+
+
+
-
-
-
-
-
-
- 759template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 764 using Value =
typename Traits::Value;
- 765 using Key =
typename Traits::Key;
- 766 using T =
typename Traits::T;
- 767 using Clock =
typename Traits::Clock;
- 768 using Comp =
typename Traits::Comp;
- 769 using Alloc =
typename Traits::Alloc;
- 770 using MyComp =
typename Traits::MyComp;
- 771 using MyAlloc =
typename Traits::MyAlloc;
- 772 typename Traits::ManualClock clock;
+
+
+ 755template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 760 using Comp =
typename Traits::Comp;
+ 761 using Alloc =
typename Traits::Alloc;
+ 762 using MyComp =
typename Traits::MyComp;
+ 763 using MyAlloc =
typename Traits::MyAlloc;
+ 764 typename Traits::ManualClock clock;
+
+
+
+
+
+ 770 typename Traits::template Cont<Comp, Alloc> c(clock);
+
+
-
-
-
-
- 778 typename Traits::template Cont<Comp, Alloc> c(clock);
-
-
-
-
- 783 typename Traits::template Cont<MyComp, Alloc> c(clock, MyComp(1));
-
-
-
-
- 788 typename Traits::template Cont<Comp, MyAlloc> c(clock, MyAlloc(1));
-
-
-
-
- 793 typename Traits::template Cont<MyComp, MyAlloc> c(
- 794 clock, MyComp(1), MyAlloc(1));
-
-
-
-
-
- 800template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
- 804 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
- 805 using Value =
typename Traits::Value;
- 806 using Key =
typename Traits::Key;
- 807 using T =
typename Traits::T;
- 808 using Clock =
typename Traits::Clock;
- 809 using Hash =
typename Traits::Hash;
- 810 using Equal =
typename Traits::Equal;
- 811 using Alloc =
typename Traits::Alloc;
- 812 using MyHash =
typename Traits::MyHash;
- 813 using MyEqual =
typename Traits::MyEqual;
- 814 using MyAlloc =
typename Traits::MyAlloc;
- 815 typename Traits::ManualClock clock;
-
-
-
-
- 820 typename Traits::template Cont<Hash, Equal, Alloc> c(clock);
+
+ 775 typename Traits::template Cont<MyComp, Alloc> c(clock, MyComp(1));
+
+
+
+
+ 780 typename Traits::template Cont<Comp, MyAlloc> c(clock, MyAlloc(1));
+
+
+
+
+ 785 typename Traits::template Cont<MyComp, MyAlloc> c(
+ 786 clock, MyComp(1), MyAlloc(1));
+
+
+
+
+
+ 792template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+ 796 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
+ 797 using Hash =
typename Traits::Hash;
+ 798 using Equal =
typename Traits::Equal;
+ 799 using Alloc =
typename Traits::Alloc;
+ 800 using MyHash =
typename Traits::MyHash;
+ 801 using MyEqual =
typename Traits::MyEqual;
+ 802 using MyAlloc =
typename Traits::MyAlloc;
+ 803 typename Traits::ManualClock clock;
+
+
+
+
+ 808 typename Traits::template Cont<Hash, Equal, Alloc> c(clock);
+
+
+
+
+ 813 typename Traits::template Cont<MyHash, Equal, Alloc> c(
+
+
+
+
+
+ 819 typename Traits::template Cont<Hash, MyEqual, Alloc> c(
+
- 825 typename Traits::template Cont<MyHash, Equal, Alloc> c(
-
+ 825 typename Traits::template Cont<Hash, Equal, MyAlloc> c(
+
- 831 typename Traits::template Cont<Hash, MyEqual, Alloc> c(
-
+ 831 typename Traits::template Cont<MyHash, MyEqual, Alloc> c(
+ 832 clock, MyHash(1), MyEqual(1));
- 837 typename Traits::template Cont<Hash, Equal, MyAlloc> c(
-
+ 837 typename Traits::template Cont<MyHash, Equal, MyAlloc> c(
+ 838 clock, MyHash(1), MyAlloc(1));
- 843 typename Traits::template Cont<MyHash, MyEqual, Alloc> c(
- 844 clock, MyHash(1), MyEqual(1));
+ 843 typename Traits::template Cont<Hash, MyEqual, MyAlloc> c(
+ 844 clock, MyEqual(1), MyAlloc(1));
- 849 typename Traits::template Cont<MyHash, Equal, MyAlloc> c(
- 850 clock, MyHash(1), MyAlloc(1));
+ 849 typename Traits::template Cont<MyHash, MyEqual, MyAlloc> c(
+ 850 clock, MyHash(1), MyEqual(1), MyAlloc(1));
-
-
- 855 typename Traits::template Cont<Hash, MyEqual, MyAlloc> c(
- 856 clock, MyEqual(1), MyAlloc(1));
-
-
-
-
- 861 typename Traits::template Cont<MyHash, MyEqual, MyAlloc> c(
- 862 clock, MyHash(1), MyEqual(1), MyAlloc(1));
-
-
-
-
-
- 868template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 873 using Value =
typename Traits::Value;
- 874 using Key =
typename Traits::Key;
- 875 using T =
typename Traits::T;
- 876 using Clock =
typename Traits::Clock;
- 877 using Comp =
typename Traits::Comp;
- 878 using Alloc =
typename Traits::Alloc;
- 879 using MyComp =
typename Traits::MyComp;
- 880 using MyAlloc =
typename Traits::MyAlloc;
- 881 typename Traits::ManualClock clock;
- 882 auto const v(Traits::values());
-
-
-
-
-
- 888 typename Traits::template Cont<Comp, Alloc> c(
- 889 v.begin(), v.end(), clock);
-
-
-
-
- 894 typename Traits::template Cont<MyComp, Alloc> c(
- 895 v.begin(), v.end(), clock, MyComp(1));
-
-
-
-
- 900 typename Traits::template Cont<Comp, MyAlloc> c(
- 901 v.begin(), v.end(), clock, MyAlloc(1));
-
+
+
+
+ 856template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 861 using Comp =
typename Traits::Comp;
+ 862 using Alloc =
typename Traits::Alloc;
+ 863 using MyComp =
typename Traits::MyComp;
+ 864 using MyAlloc =
typename Traits::MyAlloc;
+ 865 typename Traits::ManualClock clock;
+ 866 auto const v(Traits::values());
+
+
+
+
+
+ 872 typename Traits::template Cont<Comp, Alloc> c(
+ 873 v.begin(), v.end(), clock);
+
+
+
+
+ 878 typename Traits::template Cont<MyComp, Alloc> c(
+ 879 v.begin(), v.end(), clock, MyComp(1));
+
+
+
+
+ 884 typename Traits::template Cont<Comp, MyAlloc> c(
+ 885 v.begin(), v.end(), clock, MyAlloc(1));
+
+
+
+
+ 890 typename Traits::template Cont<MyComp, MyAlloc> c(
+ 891 v.begin(), v.end(), clock, MyComp(1), MyAlloc(1));
+
+
+
+
+
+
+ 898 typename Traits::template Cont<Comp, Alloc> c1(
+ 899 v.begin(), v.end(), clock);
+ 900 typename Traits::template Cont<Comp, Alloc> c2(clock);
+
+
-
-
- 906 typename Traits::template Cont<MyComp, MyAlloc> c(
- 907 v.begin(), v.end(), clock, MyComp(1), MyAlloc(1));
-
-
-
-
-
-
- 914 typename Traits::template Cont<Comp, Alloc> c1(
- 915 v.begin(), v.end(), clock);
- 916 typename Traits::template Cont<Comp, Alloc> c2(clock);
-
-
-
-
-
-
- 923template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
- 927 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
- 928 using Value =
typename Traits::Value;
- 929 using Key =
typename Traits::Key;
- 930 using T =
typename Traits::T;
- 931 using Clock =
typename Traits::Clock;
- 932 using Hash =
typename Traits::Hash;
- 933 using Equal =
typename Traits::Equal;
- 934 using Alloc =
typename Traits::Alloc;
- 935 using MyHash =
typename Traits::MyHash;
- 936 using MyEqual =
typename Traits::MyEqual;
- 937 using MyAlloc =
typename Traits::MyAlloc;
- 938 typename Traits::ManualClock clock;
- 939 auto const v(Traits::values());
-
-
-
-
-
- 945 typename Traits::template Cont<Hash, Equal, Alloc> c(
- 946 v.begin(), v.end(), clock);
-
-
-
-
- 951 typename Traits::template Cont<MyHash, Equal, Alloc> c(
- 952 v.begin(), v.end(), clock, MyHash(1));
-
-
-
-
- 957 typename Traits::template Cont<Hash, MyEqual, Alloc> c(
- 958 v.begin(), v.end(), clock, MyEqual(1));
-
-
-
-
- 963 typename Traits::template Cont<Hash, Equal, MyAlloc> c(
- 964 v.begin(), v.end(), clock, MyAlloc(1));
-
-
-
-
- 969 typename Traits::template Cont<MyHash, MyEqual, Alloc> c(
- 970 v.begin(), v.end(), clock, MyHash(1), MyEqual(1));
-
-
-
-
- 975 typename Traits::template Cont<MyHash, Equal, MyAlloc> c(
- 976 v.begin(), v.end(), clock, MyHash(1), MyAlloc(1));
-
-
-
-
- 981 typename Traits::template Cont<Hash, MyEqual, MyAlloc> c(
- 982 v.begin(), v.end(), clock, MyEqual(1), MyAlloc(1));
-
-
+
+
+
+ 907template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+ 911 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
+ 912 using Hash =
typename Traits::Hash;
+ 913 using Equal =
typename Traits::Equal;
+ 914 using Alloc =
typename Traits::Alloc;
+ 915 using MyHash =
typename Traits::MyHash;
+ 916 using MyEqual =
typename Traits::MyEqual;
+ 917 using MyAlloc =
typename Traits::MyAlloc;
+ 918 typename Traits::ManualClock clock;
+ 919 auto const v(Traits::values());
+
+
+
+
+
+ 925 typename Traits::template Cont<Hash, Equal, Alloc> c(
+ 926 v.begin(), v.end(), clock);
+
+
+
+
+ 931 typename Traits::template Cont<MyHash, Equal, Alloc> c(
+ 932 v.begin(), v.end(), clock, MyHash(1));
+
+
+
+
+ 937 typename Traits::template Cont<Hash, MyEqual, Alloc> c(
+ 938 v.begin(), v.end(), clock, MyEqual(1));
+
+
+
+
+ 943 typename Traits::template Cont<Hash, Equal, MyAlloc> c(
+ 944 v.begin(), v.end(), clock, MyAlloc(1));
+
+
+
+
+ 949 typename Traits::template Cont<MyHash, MyEqual, Alloc> c(
+ 950 v.begin(), v.end(), clock, MyHash(1), MyEqual(1));
+
+
+
+
+ 955 typename Traits::template Cont<MyHash, Equal, MyAlloc> c(
+ 956 v.begin(), v.end(), clock, MyHash(1), MyAlloc(1));
+
+
+
+
+ 961 typename Traits::template Cont<Hash, MyEqual, MyAlloc> c(
+ 962 v.begin(), v.end(), clock, MyEqual(1), MyAlloc(1));
+
+
+
+
+ 967 typename Traits::template Cont<MyHash, MyEqual, MyAlloc> c(
+ 968 v.begin(), v.end(), clock, MyHash(1), MyEqual(1), MyAlloc(1));
+
+
+
+
+
+ 974template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 979 typename Traits::ManualClock clock;
+
+
+
+
+
-
- 987 typename Traits::template Cont<MyHash, MyEqual, MyAlloc> c(
- 988 v.begin(), v.end(), clock, MyHash(1), MyEqual(1), MyAlloc(1));
-
-
-
-
-
- 994template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 999 using Value =
typename Traits::Value;
- 1000 using Key =
typename Traits::Key;
- 1001 using T =
typename Traits::T;
- 1002 using Clock =
typename Traits::Clock;
- 1003 using Comp =
typename Traits::Comp;
- 1004 using Alloc =
typename Traits::Alloc;
- 1005 using MyComp =
typename Traits::MyComp;
- 1006 using MyAlloc =
typename Traits::MyAlloc;
- 1007 typename Traits::ManualClock clock;
-
-
-
-
-
-
-
-
-
-
- 1018template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
- 1022 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
- 1023 using Value =
typename Traits::Value;
- 1024 using Key =
typename Traits::Key;
- 1025 using T =
typename Traits::T;
- 1026 using Clock =
typename Traits::Clock;
- 1027 using Hash =
typename Traits::Hash;
- 1028 using Equal =
typename Traits::Equal;
- 1029 using Alloc =
typename Traits::Alloc;
- 1030 using MyHash =
typename Traits::MyHash;
- 1031 using MyEqual =
typename Traits::MyEqual;
- 1032 using MyAlloc =
typename Traits::MyAlloc;
- 1033 typename Traits::ManualClock clock;
-
-
-
-
-
-
-
+
+
+
+
+ 990template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+ 994 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
+ 995 typename Traits::ManualClock clock;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1010template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1015 using Alloc =
typename Traits::Alloc;
+ 1016 typename Traits::ManualClock clock;
+ 1017 auto const v(Traits::values());
+
+
+
+
+
+
+
+ 1025 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1026 typename Traits::template Cont<> c2(c);
+
+
+ 1029 BEAST_EXPECT(c == c2);
+
+
+
+
+ 1034 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1035 typename Traits::template Cont<> c2(c, Alloc());
+
+
+ 1038 BEAST_EXPECT(c == c2);
+
+
-
-
-
-
-
-
- 1048template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1053 using Value =
typename Traits::Value;
- 1054 using Alloc =
typename Traits::Alloc;
- 1055 typename Traits::ManualClock clock;
- 1056 auto const v(Traits::values());
-
-
-
-
-
-
-
- 1064 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1065 typename Traits::template Cont<> c2(c);
-
-
- 1068 BEAST_EXPECT(c == c2);
-
-
-
-
- 1073 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1074 typename Traits::template Cont<> c2(c, Alloc());
-
-
- 1077 BEAST_EXPECT(c == c2);
-
-
-
-
- 1082 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1083 typename Traits::template Cont<> c2(clock);
-
-
-
- 1087 BEAST_EXPECT(c == c2);
-
-
+
+ 1043 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1044 typename Traits::template Cont<> c2(clock);
+
+
+
+ 1048 BEAST_EXPECT(c == c2);
+
+
+
+
+
+
+ 1055 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1056 typename Traits::template Cont<> c2(std::move(c));
+
+
+
+
+ 1061 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1062 typename Traits::template Cont<> c2(std::move(c), Alloc());
+
+
+
+
+ 1067 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+ 1068 typename Traits::template Cont<> c2(clock);
+
+
+
+
+
+
+
+
+
+
+
+ 1080template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1085 typename Traits::ManualClock clock;
+ 1086 auto const v(Traits::values());
+
+
+
-
+ 1091 typename Traits::template Cont<> c{clock};
-
- 1094 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1095 typename Traits::template Cont<> c2(std::move(c));
-
-
-
-
- 1100 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1101 typename Traits::template Cont<> c2(std::move(c), Alloc());
-
-
-
-
- 1106 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
- 1107 typename Traits::template Cont<> c2(clock);
-
-
-
-
+ 1093 using iterator =
decltype(c.begin());
+ 1094 using const_iterator =
decltype(c.cbegin());
+
+
+ 1097 iterator nnIt_0{c.begin()};
+ 1098 iterator nnIt_1{nnIt_0};
+ 1099 BEAST_EXPECT(nnIt_0 == nnIt_1);
+
+
+ 1102 BEAST_EXPECT(nnIt_1 == nnIt_2);
+
+
+
+ 1106 const_iterator ccIt_0{c.cbegin()};
+ 1107 const_iterator ccIt_1{ccIt_0};
+ 1108 BEAST_EXPECT(ccIt_0 == ccIt_1);
+ 1109 const_iterator ccIt_2;
+
+ 1111 BEAST_EXPECT(ccIt_1 == ccIt_2);
-
-
-
-
-
-
- 1119template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1124 using Value =
typename Traits::Value;
- 1125 using Alloc =
typename Traits::Alloc;
- 1126 typename Traits::ManualClock clock;
- 1127 auto const v(Traits::values());
-
-
-
+
+ 1114 BEAST_EXPECT(nnIt_0 == ccIt_0);
+ 1115 BEAST_EXPECT(ccIt_1 == nnIt_1);
+
+
+ 1118 const_iterator ncIt_3{c.begin()};
+ 1119 const_iterator ncIt_4{nnIt_0};
+ 1120 BEAST_EXPECT(ncIt_3 == ncIt_4);
+ 1121 const_iterator ncIt_5;
+
+ 1123 BEAST_EXPECT(ncIt_5 == ncIt_4);
+
+
+
+
+
+
+
- 1132 typename Traits::template Cont<> c{clock};
-
- 1134 using iterator =
decltype(c.begin());
- 1135 using const_iterator =
decltype(c.cbegin());
-
-
- 1138 iterator nnIt_0{c.begin()};
- 1139 iterator nnIt_1{nnIt_0};
- 1140 BEAST_EXPECT(nnIt_0 == nnIt_1);
-
-
- 1143 BEAST_EXPECT(nnIt_1 == nnIt_2);
-
-
-
- 1147 const_iterator ccIt_0{c.cbegin()};
- 1148 const_iterator ccIt_1{ccIt_0};
- 1149 BEAST_EXPECT(ccIt_0 == ccIt_1);
- 1150 const_iterator ccIt_2;
-
- 1152 BEAST_EXPECT(ccIt_1 == ccIt_2);
-
-
- 1155 BEAST_EXPECT(nnIt_0 == ccIt_0);
- 1156 BEAST_EXPECT(ccIt_1 == nnIt_1);
-
-
- 1159 const_iterator ncIt_3{c.begin()};
- 1160 const_iterator ncIt_4{nnIt_0};
- 1161 BEAST_EXPECT(ncIt_3 == ncIt_4);
- 1162 const_iterator ncIt_5;
-
- 1164 BEAST_EXPECT(ncIt_5 == ncIt_4);
-
-
-
+
+
+
+
+ 1136template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1141 typename Traits::ManualClock clock;
+ 1142 auto const v(Traits::values());
+
+
+
+
+ 1147 typename Traits::template Cont<> c{clock};
+
+ 1149 using iterator =
decltype(c.begin());
+ 1150 using reverse_iterator =
decltype(c.rbegin());
+ 1151 using const_reverse_iterator =
decltype(c.crbegin());
+
+
+
+
+
+
+
+
+
+
+ 1162 reverse_iterator rNrNit_0{c.rbegin()};
+ 1163 reverse_iterator rNrNit_1{rNrNit_0};
+ 1164 BEAST_EXPECT(rNrNit_0 == rNrNit_1);
+ 1165 reverse_iterator xXrNit_2;
+ 1166 xXrNit_2 = rNrNit_1;
+ 1167 BEAST_EXPECT(rNrNit_1 == xXrNit_2);
-
-
-
-
-
-
-
-
- 1177template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1182 using Value =
typename Traits::Value;
- 1183 using Alloc =
typename Traits::Alloc;
- 1184 typename Traits::ManualClock clock;
- 1185 auto const v(Traits::values());
-
-
-
+
+
+ 1171 const_reverse_iterator rCrCit_0{c.crbegin()};
+ 1172 const_reverse_iterator rCrCit_1{rCrCit_0};
+ 1173 BEAST_EXPECT(rCrCit_0 == rCrCit_1);
+ 1174 const_reverse_iterator xXrCit_2;
+ 1175 xXrCit_2 = rCrCit_1;
+ 1176 BEAST_EXPECT(rCrCit_1 == xXrCit_2);
+
+
+ 1179 BEAST_EXPECT(rNrNit_0 == rCrCit_0);
+ 1180 BEAST_EXPECT(rCrCit_1 == rNrNit_1);
+
+
+
+ 1184 const_reverse_iterator rNrCit_0{c.rbegin()};
+ 1185 const_reverse_iterator rNrCit_1{rNrNit_0};
+ 1186 BEAST_EXPECT(rNrCit_0 == rNrCit_1);
+ 1187 xXrCit_2 = rNrNit_1;
+ 1188 BEAST_EXPECT(rNrCit_1 == xXrCit_2);
- 1190 typename Traits::template Cont<> c{clock};
-
- 1192 using iterator =
decltype(c.begin());
- 1193 using const_iterator =
decltype(c.cbegin());
- 1194 using reverse_iterator =
decltype(c.rbegin());
- 1195 using const_reverse_iterator =
decltype(c.crbegin());
-
-
-
-
-
-
-
-
-
-
- 1206 reverse_iterator rNrNit_0{c.rbegin()};
- 1207 reverse_iterator rNrNit_1{rNrNit_0};
- 1208 BEAST_EXPECT(rNrNit_0 == rNrNit_1);
- 1209 reverse_iterator xXrNit_2;
- 1210 xXrNit_2 = rNrNit_1;
- 1211 BEAST_EXPECT(rNrNit_1 == xXrNit_2);
-
-
-
- 1215 const_reverse_iterator rCrCit_0{c.crbegin()};
- 1216 const_reverse_iterator rCrCit_1{rCrCit_0};
- 1217 BEAST_EXPECT(rCrCit_0 == rCrCit_1);
- 1218 const_reverse_iterator xXrCit_2;
- 1219 xXrCit_2 = rCrCit_1;
- 1220 BEAST_EXPECT(rCrCit_1 == xXrCit_2);
-
-
- 1223 BEAST_EXPECT(rNrNit_0 == rCrCit_0);
- 1224 BEAST_EXPECT(rCrCit_1 == rNrNit_1);
-
-
-
- 1228 const_reverse_iterator rNrCit_0{c.rbegin()};
- 1229 const_reverse_iterator rNrCit_1{rNrNit_0};
- 1230 BEAST_EXPECT(rNrCit_0 == rNrCit_1);
- 1231 xXrCit_2 = rNrNit_1;
- 1232 BEAST_EXPECT(rNrCit_1 == xXrCit_2);
-
-
-
-
-
-
-
- 1240 reverse_iterator fNrNit_0{c.begin()};
- 1241 const_reverse_iterator fNrCit_0{c.begin()};
- 1242 BEAST_EXPECT(fNrNit_0 == fNrCit_0);
- 1243 const_reverse_iterator fCrCit_0{c.cbegin()};
- 1244 BEAST_EXPECT(fNrCit_0 == fCrCit_0);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1265template <
class Container,
class Values>
-
-
-
-
-
- 1271 for (
auto const& e : v)
-
-
-
-
- 1276template <
class Container,
class Values>
-
-
-
-
-
-
-
- 1284 c.insert(std::move(e));
-
-
-
- 1288template <
class Container,
class Values>
-
-
-
-
-
- 1294 for (
auto const& e : v)
- 1295 c.insert(c.cend(), e);
-
-
-
- 1299template <
class Container,
class Values>
-
-
-
-
-
-
-
- 1307 c.insert(c.cend(), std::move(e));
-
-
+
+
+
+
+
+
+ 1196 reverse_iterator fNrNit_0{c.begin()};
+ 1197 const_reverse_iterator fNrCit_0{c.begin()};
+ 1198 BEAST_EXPECT(fNrNit_0 == fNrCit_0);
+ 1199 const_reverse_iterator fCrCit_0{c.cbegin()};
+ 1200 BEAST_EXPECT(fNrCit_0 == fCrCit_0);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1221template <
class Container,
class Values>
+
+
+
+
+
+ 1227 for (
auto const& e : v)
+
+
+
+
+ 1232template <
class Container,
class Values>
+
+
+
+
+
+
+
+ 1240 c.insert(std::move(e));
+
+
+
+ 1244template <
class Container,
class Values>
+
+
+
+
+
+ 1250 for (
auto const& e : v)
+ 1251 c.insert(c.cend(), e);
+
+
+
+ 1255template <
class Container,
class Values>
+
+
+
+
+
+
+
+ 1263 c.insert(c.cend(), std::move(e));
+
+
+
+ 1267template <
class Container,
class Values>
+
+
+
+
+
+ 1273 for (
auto const& e : v)
+
+
+
+
+ 1278template <
class Container,
class Values>
+
+
+
+
+
+ 1284 for (
auto const& e : v)
+ 1285 c.emplace_hint(c.cend(), e);
+
+
+
+ 1289template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1294 typename Traits::ManualClock clock;
+ 1295 auto const v(Traits::values());
+
+
+
+
+
+
+ 1302 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1307 typename Traits::template Cont<> c(clock);
+
+
- 1311template <
class Container,
class Values>
-
-
-
-
-
- 1317 for (
auto const& e : v)
-
-
-
-
- 1322template <
class Container,
class Values>
-
-
-
-
-
- 1328 for (
auto const& e : v)
- 1329 c.emplace_hint(c.cend(), e);
-
-
-
- 1333template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1338 typename Traits::ManualClock clock;
- 1339 auto const v(Traits::values());
-
+
+ 1312 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1317 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1322 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1327 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1332 typename Traits::template Cont<> c(clock);
+
+
+
+
+ 1337 typename Traits::template Cont<> c(clock);
+
+
+
-
-
-
-
- 1346 typename Traits::template Cont<> c(clock);
-
-
-
-
- 1351 typename Traits::template Cont<> c(clock);
-
-
-
-
- 1356 typename Traits::template Cont<> c(clock);
-
-
-
-
- 1361 typename Traits::template Cont<> c(clock);
-
-
-
-
- 1366 typename Traits::template Cont<> c(clock);
-
-
-
+
+
+
+
+
+
+ 1348template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1353 typename Traits::ManualClock clock;
+ 1354 auto const v(Traits::values());
+
+
+
+
+ 1359 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+
+
+ 1362 c.chronological.cbegin(),
+ 1363 c.chronological.cend(),
+
+
+
+
+
+ 1369 for (
auto iter(v.crbegin()); iter != v.crend(); ++iter)
- 1371 typename Traits::template Cont<> c(clock);
-
-
-
-
- 1376 typename Traits::template Cont<> c(clock);
-
+ 1371 using iterator =
typename decltype(c)::iterator;
+ 1372 iterator found(c.find(Traits::extract(*iter)));
+
+ 1374 BEAST_EXPECT(found != c.cend());
+ 1375 if (found == c.cend())
+
+
-
- 1381 typename Traits::template Cont<> c(clock);
-
-
-
-
-
-
-
-
-
-
- 1392template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1397 using Value =
typename Traits::Value;
- 1398 typename Traits::ManualClock clock;
- 1399 auto const v(Traits::values());
-
-
-
-
- 1404 typename Traits::template Cont<> c(v.begin(), v.end(), clock);
+
+ 1381 c.chronological.cbegin(),
+ 1382 c.chronological.cend(),
+
+
+
+
+
+ 1388 for (
auto iter(v.cbegin()); iter != v.cend(); ++iter)
+
+ 1390 using const_iterator =
typename decltype(c)::const_iterator;
+ 1391 const_iterator found(c.find(Traits::extract(*iter)));
+
+ 1393 BEAST_EXPECT(found != c.cend());
+ 1394 if (found == c.cend())
+
+
+
+
+
+ 1400 c.chronological.cbegin(),
+ 1401 c.chronological.cend(),
+
+
+
-
- 1407 c.chronological.cbegin(),
- 1408 c.chronological.cend(),
-
-
-
-
-
- 1414 for (
auto iter(v.crbegin()); iter != v.crend(); ++iter)
-
- 1416 using iterator =
typename decltype(c)::iterator;
- 1417 iterator found(c.find(Traits::extract(*iter)));
-
- 1419 BEAST_EXPECT(found != c.cend());
- 1420 if (found == c.cend())
-
-
-
-
-
- 1426 c.chronological.cbegin(),
- 1427 c.chronological.cend(),
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1421template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1426 typename Traits::ManualClock clock;
+ 1427 auto v(Traits::values());
+
+
+
-
- 1433 for (
auto iter(v.cbegin()); iter != v.cend(); ++iter)
-
- 1435 using const_iterator =
typename decltype(c)::const_iterator;
- 1436 const_iterator found(c.find(Traits::extract(*iter)));
-
- 1438 BEAST_EXPECT(found != c.cend());
- 1439 if (found == c.cend())
-
-
-
-
-
- 1445 c.chronological.cbegin(),
- 1446 c.chronological.cend(),
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1466template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1471 typename Traits::ManualClock clock;
- 1472 auto v(Traits::values());
-
-
-
-
-
-
- 1479 typename Traits::template Cont<> c(clock);
-
- 1481 c[e.first] = e.second;
-
-
-
-
-
- 1487 typename Traits::template Cont<> c(clock);
-
- 1489 c[std::move(e.first)] = e.second;
-
-
-
-
-
-
-
-
-
-
- 1500template <
class Container,
class Values>
-
-
-
- 1504 Values
const& values)
-
-
-
-
-
-
-
- 1512 ManualClock& clk(
dynamic_cast<ManualClock&
>(c.clock()));
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1528template <
class Iter>
-
-
-
-
-
- 1534 if (beginIter == endIter)
-
- 1536 fail(
"Internal test failure. Cannot advance beginIter");
-
-
-
-
- 1541 Iter nextToEnd = beginIter;
-
-
- 1544 nextToEnd = beginIter++;
- 1545 }
while (beginIter != endIter);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1562template <
class Container,
class Iter>
-
-
-
- 1566 Iter
const beginItr,
-
-
-
- 1570 size_t count = c.size();
- 1571 while (it != endItr)
-
-
-
-
+
+
+ 1434 typename Traits::template Cont<> c(clock);
+
+ 1436 c[e.first] = e.second;
+
+
+
+
+
+ 1442 typename Traits::template Cont<> c(clock);
+
+ 1444 c[std::move(e.first)] = e.second;
+
+
+
+
+
+
+
+
+
+
+ 1455template <
class Container,
class Values>
+
+
+
+ 1459 Values
const& values)
+
+
+
+
+
+
+
+ 1467 ManualClock& clk(
dynamic_cast<ManualClock&
>(c.clock()));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1483template <
class Iter>
+
+
+
+
+
+ 1489 if (beginIter == endIter)
+
+ 1491 fail(
"Internal test failure. Cannot advance beginIter");
+
+
+
+
+ 1496 Iter nextToEnd = beginIter;
+
+
+ 1499 nextToEnd = beginIter++;
+ 1500 }
while (beginIter != endIter);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1517template <
class Container,
class Iter>
+
+
+
+ 1521 Iter
const beginItr,
+
+
+
+ 1525 size_t count = c.size();
+ 1526 while (it != endItr)
+
+
+
+
+
+
+
+ 1534 fail(
"Unexpected returned iterator from element erase");
+
+
+
+
+ 1539 if (count != c.size())
+
+ 1541 fail(
"Failed to erase element");
+
+
+
+
+
+
+
+ 1549 fail(
"Erase of last element didn't produce end");
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1563template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+
+
+
+
+
+ 1573 typename Traits::ManualClock clock;
+ 1574 typename Traits::template Cont<> c{clock};
+
-
-
- 1579 fail(
"Unexpected returned iterator from element erase");
-
-
-
-
- 1584 if (count != c.size())
-
- 1586 fail(
"Failed to erase element");
-
-
-
-
-
-
-
- 1594 fail(
"Erase of last element didn't produce end");
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1608template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
-
-
-
-
-
- 1618 typename Traits::ManualClock clock;
- 1619 typename Traits::template Cont<> c{clock};
-
-
-
-
- 1624 auto tempContainer(c);
-
- 1626 tempContainer, tempContainer.cbegin(), tempContainer.cend()))
-
-
- 1629 BEAST_EXPECT(tempContainer.empty());
-
-
-
-
- 1634 auto tempContainer(c);
- 1635 auto& chron(tempContainer.chronological);
-
-
-
- 1639 BEAST_EXPECT(tempContainer.empty());
-
-
-
-
- 1644 auto tempContainer(c);
- 1645 BEAST_EXPECT(tempContainer.size() > 2);
-
-
- 1648 ++tempContainer.begin(),
-
-
-
- 1652 BEAST_EXPECT(tempContainer.size() == 2);
-
-
-
-
- 1657 auto tempContainer(c);
- 1658 BEAST_EXPECT(tempContainer.size() > 2);
- 1659 auto& chron(tempContainer.chronological);
-
-
-
-
-
+
+
+ 1579 auto tempContainer(c);
+
+ 1581 tempContainer, tempContainer.cbegin(), tempContainer.cend()))
+
+
+ 1584 BEAST_EXPECT(tempContainer.empty());
+
+
+
+
+ 1589 auto tempContainer(c);
+ 1590 auto& chron(tempContainer.chronological);
+
+
+
+ 1594 BEAST_EXPECT(tempContainer.empty());
+
+
+
+
+ 1599 auto tempContainer(c);
+ 1600 BEAST_EXPECT(tempContainer.size() > 2);
+
+
+ 1603 ++tempContainer.begin(),
+
+
+
+ 1607 BEAST_EXPECT(tempContainer.size() == 2);
+
+
+
+
+ 1612 auto tempContainer(c);
+ 1613 BEAST_EXPECT(tempContainer.size() > 2);
+ 1614 auto& chron(tempContainer.chronological);
+
+
+
+
+
+
+ 1621 BEAST_EXPECT(tempContainer.size() == 2);
+
+
+
+ 1625 auto tempContainer(c);
+ 1626 BEAST_EXPECT(tempContainer.size() > 4);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1651template <
class Container,
class BeginEndSrc>
+
+
+
+ 1655 BeginEndSrc
const& beginEndSrc)
+
+ 1657 BEAST_EXPECT(c.size() > 2);
+ 1658 auto itBeginPlusOne(beginEndSrc.begin());
+ 1659 auto const valueFront = *itBeginPlusOne;
+
+
+
+ 1663 auto itBack(
nextToEndIter(itBeginPlusOne, beginEndSrc.end()));
+ 1664 auto const valueBack = *itBack;
- 1666 BEAST_EXPECT(tempContainer.size() == 2);
-
-
-
- 1670 auto tempContainer(c);
- 1671 BEAST_EXPECT(tempContainer.size() > 4);
-
-
-
-
-
-
-
-
+
+ 1667 auto const retIter = c.erase(itBeginPlusOne, itBack);
+
+ 1669 BEAST_EXPECT(c.size() == 2);
+ 1670 BEAST_EXPECT(valueFront == *(beginEndSrc.begin()));
+ 1671 BEAST_EXPECT(valueBack == *(++beginEndSrc.begin()));
+ 1672 BEAST_EXPECT(retIter == (++beginEndSrc.begin()));
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1696template <
class Container,
class BeginEndSrc>
-
-
-
- 1700 BeginEndSrc
const& beginEndSrc)
-
- 1702 BEAST_EXPECT(c.size() > 2);
- 1703 auto itBeginPlusOne(beginEndSrc.begin());
- 1704 auto const valueFront = *itBeginPlusOne;
-
-
-
- 1708 auto itBack(
nextToEndIter(itBeginPlusOne, beginEndSrc.end()));
- 1709 auto const valueBack = *itBack;
-
-
- 1712 auto const retIter = c.erase(itBeginPlusOne, itBack);
-
- 1714 BEAST_EXPECT(c.size() == 2);
- 1715 BEAST_EXPECT(valueFront == *(beginEndSrc.begin()));
- 1716 BEAST_EXPECT(valueBack == *(++beginEndSrc.begin()));
- 1717 BEAST_EXPECT(retIter == (++beginEndSrc.begin()));
-
-
-
-
-
-
-
+ 1681template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+
+
+
+
+
+ 1691 typename Traits::ManualClock clock;
+ 1692 typename Traits::template Cont<> c{clock};
+
+
+
+
+ 1697 auto tempContainer(c);
+
+
+
+ 1701 auto tempContainer(c);
+ 1702 doRangeErase(tempContainer, tempContainer.chronological);
+
+
+
+
+
+
+
+
+
+
+ 1713template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1718 typename Traits::ManualClock clock;
+ 1719 auto const v(Traits::values());
+
+
+
+
+ 1724 typename Traits::template Cont<> c1(v.begin(), v.end(), clock);
- 1726template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
-
-
-
-
-
- 1736 typename Traits::ManualClock clock;
- 1737 typename Traits::template Cont<> c{clock};
-
-
-
-
- 1742 auto tempContainer(c);
-
-
-
- 1746 auto tempContainer(c);
- 1747 doRangeErase(tempContainer, tempContainer.chronological);
-
-
+ 1726 typename Traits::template Cont<> c2(v.begin(), v.end(), clock);
+ 1727 c2.erase(c2.cbegin());
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1744template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+
+ 1749 typename Traits::ManualClock clock;
-
-
-
-
-
-
-
- 1758template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1763 using Value =
typename Traits::Value;
- 1764 typename Traits::ManualClock clock;
- 1765 auto const v(Traits::values());
-
-
-
-
- 1770 typename Traits::template Cont<> c1(v.begin(), v.end(), clock);
+
+
+
+ 1754 typename Traits::template Cont<> c(clock);
+
+
+
+
+
+
+
+ 1762template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+ 1766 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
+ 1767 typename Traits::ManualClock clock;
+
+
+
- 1772 typename Traits::template Cont<> c2(v.begin(), v.end(), clock);
- 1773 c2.erase(c2.cbegin());
-
-
-
-
-
-
-
-
-
+ 1772 typename Traits::template Cont<> c(clock);
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
- 1790template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
- 1795 typename Traits::ManualClock clock;
-
-
-
-
- 1800 typename Traits::template Cont<> c(clock);
-
-
+
+ 1785template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
+
+
+
+ 1789 testConstructEmpty<IsUnordered, IsMulti, IsMap>();
+ 1790 testConstructRange<IsUnordered, IsMulti, IsMap>();
+ 1791 testConstructInitList<IsUnordered, IsMulti, IsMap>();
+ 1792 testCopyMove<IsUnordered, IsMulti, IsMap>();
+ 1793 testIterator<IsUnordered, IsMulti, IsMap>();
+ 1794 testReverseIterator<IsUnordered, IsMulti, IsMap>();
+ 1795 testModifiers<IsUnordered, IsMulti, IsMap>();
+ 1796 testChronological<IsUnordered, IsMulti, IsMap>();
+ 1797 testArrayCreate<IsUnordered, IsMulti, IsMap>();
+ 1798 testElementErase<IsUnordered, IsMulti, IsMap>();
+ 1799 testRangeErase<IsUnordered, IsMulti, IsMap>();
+ 1800 testCompare<IsUnordered, IsMulti, IsMap>();
+ 1801 testObservers<IsUnordered, IsMulti, IsMap>();
+
-
-
-
-
- 1808template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
- 1812 using Traits = TestTraits<IsUnordered, IsMulti, IsMap>;
- 1813 typename Traits::ManualClock clock;
-
-
-
-
- 1818 typename Traits::template Cont<> c(clock);
-
-
-
-
-
-
-
-
-
-
-
-
- 1831template <
bool IsUnordered,
bool IsMulti,
bool IsMap>
-
-
-
-
-
- 1837 testConstructEmpty<IsUnordered, IsMulti, IsMap>();
- 1838 testConstructRange<IsUnordered, IsMulti, IsMap>();
- 1839 testConstructInitList<IsUnordered, IsMulti, IsMap>();
- 1840 testCopyMove<IsUnordered, IsMulti, IsMap>();
- 1841 testIterator<IsUnordered, IsMulti, IsMap>();
- 1842 testReverseIterator<IsUnordered, IsMulti, IsMap>();
- 1843 testModifiers<IsUnordered, IsMulti, IsMap>();
- 1844 testChronological<IsUnordered, IsMulti, IsMap>();
- 1845 testArrayCreate<IsUnordered, IsMulti, IsMap>();
- 1846 testElementErase<IsUnordered, IsMulti, IsMap>();
- 1847 testRangeErase<IsUnordered, IsMulti, IsMap>();
- 1848 testCompare<IsUnordered, IsMulti, IsMap>();
- 1849 testObservers<IsUnordered, IsMulti, IsMap>();
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1818 "bad alias: aged_set");
+
+
+
+
+
+ 1824 "bad alias: aged_multiset");
+
+
+
+
+
+ 1830 "bad alias: aged_map");
+
+
+
+
+
+ 1836 "bad alias: aged_multimap");
+
+
+
+
+
+ 1842 "bad alias: aged_unordered_set");
+
+
+
+
+
+ 1848 "bad alias: aged_unordered_multiset");
+
+
+
+
+
+ 1854 "bad alias: aged_unordered_map");
+
+
+
+
+
+ 1860 "bad alias: aged_unordered_multimap");
-
-
-
-
- 1866 "bad alias: aged_set");
-
-
-
-
-
- 1872 "bad alias: aged_multiset");
-
-
-
-
-
- 1878 "bad alias: aged_map");
-
-
-
-
-
- 1884 "bad alias: aged_multimap");
-
-
-
-
-
- 1890 "bad alias: aged_unordered_set");
-
-
-
-
-
- 1896 "bad alias: aged_unordered_multiset");
-
-
-
-
-
- 1902 "bad alias: aged_unordered_map");
-
-
-
-
-
- 1908 "bad alias: aged_unordered_multimap");
-
-
-
-
- 1913 testMaybeUnorderedMultiMap<false, false, false>();
-
-
-
-
-
-
-
-
-
- 1923 testMaybeUnorderedMultiMap<false, false, true>();
-
-
-
-
-
-
-
-
-
- 1933 testMaybeUnorderedMultiMap<false, true, false>();
-
-
-
-
-
-
-
-
-
- 1943 testMaybeUnorderedMultiMap<false, true, true>();
-
-
-
-
-
-
-
-
-
- 1953 testMaybeUnorderedMultiMap<true, false, false>();
-
-
-
-
-
-
-
-
-
- 1963 testMaybeUnorderedMultiMap<true, false, true>();
-
-
-
-
-
-
-
-
-
- 1973 testMaybeUnorderedMultiMap<true, true, false>();
-
-
-
-
-
-
-
-
-
- 1983 testMaybeUnorderedMultiMap<true, true, true>();
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+ 1865 testMaybeUnorderedMultiMap<false, false, false>();
+
+
+
+
+
+
+
+
+
+ 1875 testMaybeUnorderedMultiMap<false, false, true>();
+
+
+
+
+
+
+
+
+
+ 1885 testMaybeUnorderedMultiMap<false, true, false>();
+
+
+
+
+
+
+
+
+
+ 1895 testMaybeUnorderedMultiMap<false, true, true>();
+
+
+
+
+
+
+
+
+
+ 1905 testMaybeUnorderedMultiMap<true, false, false>();
+
+
+
+
+
+
+
+
+
+ 1915 testMaybeUnorderedMultiMap<true, false, true>();
+
+
+
+
+
+
+
+
+
+ 1925 testMaybeUnorderedMultiMap<true, true, false>();
+
+
+
+
+
+
+
+
+
+ 1935 testMaybeUnorderedMultiMap<true, true, true>();
+
+
+
+
+
+
+
+
+
+
+
+
+
@@ -2097,60 +2049,60 @@ $(function() {
static std::string name_ordered_part()
std::enable_if< IsMap &&!IsMulti >::type testArrayCreate()
std::enable_if< IsMap &&!IsMulti >::type testArrayCreate()
std::enable_if<!std::remove_reference< C >::type::is_unordered::value >::type checkUnorderedContentsRefRef(C &&, Values const &)
void checkInsertHintMove(Container &c, Values const &v)
void checkInsertCopy(Container &c, Values const &v)
std::enable_if<!IsUnordered >::type testReverseIterator()
void checkInsertHintMove(Container &c, Values const &v)
void checkInsertCopy(Container &c, Values const &v)
std::enable_if<!IsUnordered >::type testReverseIterator()
std::enable_if<!(Container::is_map::value &&!Container::is_multi::value)>::type checkMapContents(Container, Values const &)
void checkInsertHintCopy(Container &c, Values const &v)
void checkInsertHintCopy(Container &c, Values const &v)
void checkContentsRefRef(C &&c, Values const &v)
void checkEmplace(Container &c, Values const &v)
void checkEmplace(Container &c, Values const &v)
static std::vector< typename Cont::value_type > make_list(Cont const &c)
std::enable_if< IsUnordered >::type testReverseIterator()
std::enable_if<!IsUnordered >::type testCompare()
std::enable_if<!IsUnordered >::type testCompare()
std::enable_if< Container::is_map::value &&!Container::is_multi::value >::type checkMapContents(Container &c, Values const &v)
static std::string name(Cont const &)
std::enable_if<!IsUnordered >::type testConstructRange()
std::enable_if<!IsUnordered >::type testConstructRange()
void testMaybeUnorderedMulti()
bool doElementErase(Container &c, Iter const beginItr, Iter const endItr)
bool doElementErase(Container &c, Iter const beginItr, Iter const endItr)
std::enable_if< IsUnordered >::type testCompare()
std::enable_if<!IsUnordered >::type testObservers()
Iter nextToEndIter(Iter const beginIter, Iter const endItr)
void testMaybeUnorderedMultiMap()
std::enable_if<!IsUnordered >::type testConstructEmpty()
void reverseFillAgedContainer(Container &c, Values const &v)
std::enable_if<!IsUnordered >::type testObservers()
Iter nextToEndIter(Iter const beginIter, Iter const endItr)
void testMaybeUnorderedMultiMap()
std::enable_if<!IsUnordered >::type testConstructEmpty()
void reverseFillAgedContainer(Container &c, Values const &v)
std::enable_if< std::remove_reference< C >::type::is_unordered::value >::type checkUnorderedContentsRefRef(C &&c, Values const &v)
std::enable_if<!IsUnordered >::type testConstructInitList()
std::enable_if<!IsUnordered >::type testConstructInitList()
std::enable_if<!(IsMap &&!IsMulti)>::type testArrayCreate()
void testMaybeUnordered()
void checkContents(Cont &c, Values const &v)
void doRangeErase(Container &c, BeginEndSrc const &beginEndSrc)
void checkEmplaceHint(Container &c, Values const &v)
void checkInsertMove(Container &c, Values const &v)
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void checkContents(Cont &c, Values const &v)
void doRangeErase(Container &c, BeginEndSrc const &beginEndSrc)
void checkEmplaceHint(Container &c, Values const &v)
void checkInsertMove(Container &c, Values const &v)
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
void run() override
Runs the suite.
Associative container where each element is also indexed by time.
Associative container where each element is also indexed by time.
Manual clock implementation.
3258 if (size() != other.size())
-
- 3261 for (
auto iter(cbegin()), last(cend()); iter != last;)
-
- 3263 auto const& k(extract(*iter));
- 3264 auto const eq(equal_range(k));
- 3265 auto const oeq(other.equal_range(k));
- 3266#if BEAST_NO_CXX14_IS_PERMUTATION
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 3292template <
bool maybe_multi>
-
-
-
-
-
-
-
-
-
-
-
-
- 3305 typename cont_type::insert_commit_data d;
- 3306 auto const result(m_cont.insert_check(
-
-
-
-
-
-
- 3313 element*
const p(new_element(value));
- 3314 auto const iter(m_cont.insert_commit(*p, d));
- 3315 chronological.list.push_back(*p);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 3331template <
bool maybe_multi>
-
-
-
-
-
-
-
-
-
- 3341 Allocator>::insert_unchecked(value_type
const& value) ->
-
-
- 3344 element*
const p(new_element(value));
- 3345 chronological.list.push_back(*p);
- 3346 auto const iter(m_cont.insert(*p));
- 3347 return iterator(iter);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 3408 Allocator>& rhs)
noexcept
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 3439 auto const expired(c.clock().now() - age);
- 3440 for (
auto iter(c.chronological.cbegin());
- 3441 iter != c.chronological.cend() && iter.when() <= expired;)
-
- 3443 iter = c.erase(iter);
-
-
-
-
-
-
-
-
+ 3260 for (
auto iter(cbegin()), last(cend()); iter != last;)
+
+ 3262 auto const& k(extract(*iter));
+ 3263 auto const eq(equal_range(k));
+ 3264 auto const oeq(other.equal_range(k));
+ 3265#if BEAST_NO_CXX14_IS_PERMUTATION
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 3291template <
bool maybe_multi>
+
+
+
+
+
+
+
+
+
+
+
+
+ 3304 typename cont_type::insert_commit_data d;
+ 3305 auto const result(m_cont.insert_check(
+
+
+
+
+
+
+ 3312 element*
const p(new_element(value));
+ 3313 auto const iter(m_cont.insert_commit(*p, d));
+ 3314 chronological.list.push_back(*p);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 3330template <
bool maybe_multi>
+
+
+
+
+
+
+
+
+
+ 3340 Allocator>::insert_unchecked(value_type
const& value) ->
+
+
+ 3343 element*
const p(new_element(value));
+ 3344 chronological.list.push_back(*p);
+ 3345 auto const iter(m_cont.insert(*p));
+ 3346 return iterator(iter);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 3407 Allocator>& rhs)
noexcept
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 3438 auto const expired(c.clock().now() - age);
+ 3439 for (
auto iter(c.chronological.cbegin());
+ 3440 iter != c.chronological.cend() && iter.when() <= expired;)
+
+ 3442 iter = c.erase(iter);
+
+
+
+
+
+
+
+
@@ -3682,7 +3681,7 @@ $(function() {
const_local_iterator cbegin(size_type n) const
const_iterator end() const
const_iterator cend() const
auto insert_unchecked(value_type const &value) -> typename std::enable_if<!maybe_multi, std::pair< iterator, bool > >::type
auto insert_unchecked(value_type const &value) -> typename std::enable_if<!maybe_multi, std::pair< iterator, bool > >::type
aged_unordered_container(aged_unordered_container const &other, Allocator const &alloc)
~aged_unordered_container()
allocator_type get_allocator() const
void finishMultiSigningData(AccountID const &signingID, Serializer &s)
void serializeBatch(Serializer &msg, std::uint32_t const &flags, std::vector< uint256 > const &txids)
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
std::string to_string(base_uint< Bits, Tag > const &a)
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1921 of file aged_associative_container_test.cpp.
+Definition at line 1873 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__multimap__test.html b/classbeast_1_1aged__multimap__test.html
index 43eb845d01..5548d16a37 100644
--- a/classbeast_1_1aged__multimap__test.html
+++ b/classbeast_1_1aged__multimap__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1941 of file aged_associative_container_test.cpp.
+Definition at line 1893 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__multiset__test.html b/classbeast_1_1aged__multiset__test.html
index 4c284c122e..0d7eed2212 100644
--- a/classbeast_1_1aged__multiset__test.html
+++ b/classbeast_1_1aged__multiset__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1931 of file aged_associative_container_test.cpp.
+Definition at line 1883 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__set__test.html b/classbeast_1_1aged__set__test.html
index ddb09ba1b2..3cb9b8df60 100644
--- a/classbeast_1_1aged__set__test.html
+++ b/classbeast_1_1aged__set__test.html
@@ -354,7 +354,7 @@ Private Attributes
◆ Key
@@ -368,7 +368,7 @@ Private Attributes
@@ -384,7 +384,7 @@ Private Attributes
@@ -416,7 +416,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1911 of file aged_associative_container_test.cpp.
+Definition at line 1863 of file aged_associative_container_test.cpp.
@@ -716,7 +716,7 @@ template<class Cont , class Values >
@@ -746,7 +746,7 @@ template<class Cont >
@@ -772,7 +772,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -825,7 +825,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -878,7 +878,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -931,7 +931,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -957,7 +957,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -983,7 +983,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1052,7 +1052,7 @@ template<class Container , class Values >
@@ -1092,7 +1092,7 @@ template<class Container , class Values >
@@ -1132,7 +1132,7 @@ template<class Container , class Values >
@@ -1172,7 +1172,7 @@ template<class Container , class Values >
@@ -1212,7 +1212,7 @@ template<class Container , class Values >
@@ -1252,7 +1252,7 @@ template<class Container , class Values >
@@ -1278,7 +1278,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1304,7 +1304,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1330,7 +1330,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1399,7 +1399,7 @@ template<class Container , class Values >
@@ -1439,7 +1439,7 @@ template<class Iter >
@@ -1485,7 +1485,7 @@ template<class Container , class Iter >
@@ -1511,7 +1511,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1551,7 +1551,7 @@ template<class Container , class BeginEndSrc >
@@ -1577,7 +1577,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1603,7 +1603,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1658,7 +1658,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1711,7 +1711,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__unordered__map__test.html b/classbeast_1_1aged__unordered__map__test.html
index dd4afd0341..0a1945750d 100644
--- a/classbeast_1_1aged__unordered__map__test.html
+++ b/classbeast_1_1aged__unordered__map__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1961 of file aged_associative_container_test.cpp.
+Definition at line 1913 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__unordered__multimap__test.html b/classbeast_1_1aged__unordered__multimap__test.html
index ad2f80d8b0..68a1d55f2f 100644
--- a/classbeast_1_1aged__unordered__multimap__test.html
+++ b/classbeast_1_1aged__unordered__multimap__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1981 of file aged_associative_container_test.cpp.
+Definition at line 1933 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__unordered__multiset__test.html b/classbeast_1_1aged__unordered__multiset__test.html
index c4e0207ea6..3cb5c03bd5 100644
--- a/classbeast_1_1aged__unordered__multiset__test.html
+++ b/classbeast_1_1aged__unordered__multiset__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1971 of file aged_associative_container_test.cpp.
+Definition at line 1923 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1aged__unordered__set__test.html b/classbeast_1_1aged__unordered__set__test.html
index c90455c06d..3371c7e28a 100644
--- a/classbeast_1_1aged__unordered__set__test.html
+++ b/classbeast_1_1aged__unordered__set__test.html
@@ -346,7 +346,7 @@ Private Attributes
◆ run()
@@ -375,7 +375,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1951 of file aged_associative_container_test.cpp.
+Definition at line 1903 of file aged_associative_container_test.cpp.
@@ -675,7 +675,7 @@ template<class Cont , class Values >
@@ -705,7 +705,7 @@ template<class Cont >
@@ -731,7 +731,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -784,7 +784,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -837,7 +837,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -890,7 +890,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -916,7 +916,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -942,7 +942,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1011,7 +1011,7 @@ template<class Container , class Values >
@@ -1051,7 +1051,7 @@ template<class Container , class Values >
@@ -1091,7 +1091,7 @@ template<class Container , class Values >
@@ -1131,7 +1131,7 @@ template<class Container , class Values >
@@ -1171,7 +1171,7 @@ template<class Container , class Values >
@@ -1211,7 +1211,7 @@ template<class Container , class Values >
@@ -1237,7 +1237,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1263,7 +1263,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1289,7 +1289,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1358,7 +1358,7 @@ template<class Container , class Values >
@@ -1398,7 +1398,7 @@ template<class Iter >
@@ -1444,7 +1444,7 @@ template<class Container , class Iter >
@@ -1470,7 +1470,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1510,7 +1510,7 @@ template<class Container , class BeginEndSrc >
@@ -1536,7 +1536,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1562,7 +1562,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1617,7 +1617,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
@@ -1670,7 +1670,7 @@ template<bool IsUnordered, bool IsMulti, bool IsMap>
diff --git a/classbeast_1_1detail_1_1aged__unordered__container.html b/classbeast_1_1detail_1_1aged__unordered__container.html
index c23a3b6165..ce224d2dd6 100644
--- a/classbeast_1_1detail_1_1aged__unordered__container.html
+++ b/classbeast_1_1detail_1_1aged__unordered__container.html
@@ -4154,7 +4154,7 @@ template<bool maybe_multi>
diff --git a/classripple_1_1PublicKey.html b/classripple_1_1PublicKey.html
index 01a990372c..5816e51eb7 100644
--- a/classripple_1_1PublicKey.html
+++ b/classripple_1_1PublicKey.html
@@ -210,7 +210,7 @@ ed25519
@@ -241,7 +241,7 @@ ed25519
Create a public key.
Preconditions: publicKeyType(slice) != std::nullopt
-Definition at line 192 of file PublicKey.cpp.
+Definition at line 193 of file PublicKey.cpp.
@@ -262,7 +262,7 @@ ed25519
diff --git a/classripple_1_1test_1_1LedgerTrie__test.html b/classripple_1_1test_1_1LedgerTrie__test.html
index 39624167a7..10443089ae 100644
--- a/classripple_1_1test_1_1LedgerTrie__test.html
+++ b/classripple_1_1test_1_1LedgerTrie__test.html
@@ -369,7 +369,7 @@ Private Attributes
C advancing to H does advance the seq 3 preferred ledger A / \ B(1) C / | | H(1)D F(1) | E(1) | G(1)
F advancing to E also moves the preferred ledger forward A / \ B(1) C / | | H(1)D F | E(2) | G(1)
-Definition at line 361 of file LedgerTrie_test.cpp.
+Definition at line 360 of file LedgerTrie_test.cpp.
@@ -396,7 +396,7 @@ Private Attributes
@@ -423,7 +423,7 @@ Private Attributes
@@ -454,7 +454,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 671 of file LedgerTrie_test.cpp.
+Definition at line 669 of file LedgerTrie_test.cpp.
diff --git a/classripple_1_1test_1_1RCLValidations__test.html b/classripple_1_1test_1_1RCLValidations__test.html
index 27ee342097..29ee06b9f7 100644
--- a/classripple_1_1test_1_1RCLValidations__test.html
+++ b/classripple_1_1test_1_1RCLValidations__test.html
@@ -334,7 +334,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 323 of file RCLValidations_test.cpp.
+Definition at line 322 of file RCLValidations_test.cpp.
diff --git a/classripple_1_1test_1_1csf_1_1Validations__test.html b/classripple_1_1test_1_1csf_1_1Validations__test.html
index cdfc1a91da..7da25e5dd3 100644
--- a/classripple_1_1test_1_1csf_1_1Validations__test.html
+++ b/classripple_1_1test_1_1csf_1_1Validations__test.html
@@ -625,7 +625,7 @@ Private Attributes
@@ -652,7 +652,7 @@ Private Attributes
@@ -679,7 +679,7 @@ Private Attributes
@@ -706,7 +706,7 @@ Private Attributes
@@ -733,7 +733,7 @@ Private Attributes
@@ -764,7 +764,7 @@ Private Attributes
Implements beast::unit_test::suite.
-Definition at line 1129 of file Validations_test.cpp.
+Definition at line 1128 of file Validations_test.cpp.
diff --git a/multisign_8cpp_source.html b/multisign_8cpp_source.html
index 8895ce2a15..41b070343e 100644
--- a/multisign_8cpp_source.html
+++ b/multisign_8cpp_source.html
@@ -196,7 +196,7 @@ $(function() {
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Serializer buildMultiSigningData(STObject const &obj, AccountID const &signingID)
Return a Serializer suitable for computing a multisigning TxnSignature.
Buffer sign(PublicKey const &pk, SecretKey const &sk, Slice const &message)
Generate a signature for a message.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::optional< KeyType > publicKeyType(Slice const &slice)
Returns the type of public key.
std::string strHex(FwdIt begin, FwdIt end)
std::string to_string(base_uint< Bits, Tag > const &a)
void Rethrow()
Rethrow the exception currently being handled.
Expire aged container items past the specified age.
-Definition at line 3426 of file aged_unordered_container.h.
+Definition at line 3425 of file aged_unordered_container.h.
diff --git a/namespaceripple.html b/namespaceripple.html
index c1f92bbfe8..4b7e9c1e01 100644
--- a/namespaceripple.html
+++ b/namespaceripple.html
@@ -17465,7 +17465,7 @@ template<>
- Note
- For more details please see: https://xrpl.org/transaction-malleability.html https://bitcointalk.org/index.php?topic=8392.msg127623#msg127623 https://github.com/sipa/bitcoin/commit/58bc86e37fda1aec270bccb3df6c20fbd2a6591c
-Definition at line 129 of file PublicKey.cpp.
+Definition at line 130 of file PublicKey.cpp.
@@ -17488,7 +17488,7 @@ template<>
Returns the type of public key.
- Returns
- std::nullopt If the public key does not represent a known type.
-Definition at line 223 of file PublicKey.cpp.
+Definition at line 224 of file PublicKey.cpp.
@@ -17560,7 +17560,7 @@ template<>
Verify a secp256k1 signature on the digest of a message.
-Definition at line 238 of file PublicKey.cpp.
+Definition at line 239 of file PublicKey.cpp.
@@ -17613,7 +17613,7 @@ template<>
Verify a signature on a message.
With secp256k1 signatures, the data is first hashed with SHA512-Half, and the resulting digest is signed.
-Definition at line 288 of file PublicKey.cpp.
+Definition at line 289 of file PublicKey.cpp.
@@ -17635,7 +17635,7 @@ template<>
Calculate the 160-bit node ID from a node public key.
-Definition at line 319 of file PublicKey.cpp.
+Definition at line 320 of file PublicKey.cpp.
@@ -22604,7 +22604,7 @@ template<>
diff --git a/structbeast_1_1is__aged__container_3_01beast_1_1detail_1_1aged__unordered__container_3_01IsMultia80d60acae45fc077226391e490a323d.html b/structbeast_1_1is__aged__container_3_01beast_1_1detail_1_1aged__unordered__container_3_01IsMultia80d60acae45fc077226391e490a323d.html
index 83c9d6d37d..525119a9c8 100644
--- a/structbeast_1_1is__aged__container_3_01beast_1_1detail_1_1aged__unordered__container_3_01IsMultia80d60acae45fc077226391e490a323d.html
+++ b/structbeast_1_1is__aged__container_3_01beast_1_1detail_1_1aged__unordered__container_3_01IsMultia80d60acae45fc077226391e490a323d.html
@@ -108,7 +108,7 @@ Public Member Functions
template<bool IsMulti, bool IsMap, class Key, class T, class Clock, class Hash, class KeyEqual, class Allocator>
struct beast::is_aged_container< beast::detail::aged_unordered_container< IsMulti, IsMap, Key, T, Clock, Hash, KeyEqual, Allocator > >
-
Definition at line 3365 of file aged_unordered_container.h.
+
Definition at line 3364 of file aged_unordered_container.h.
◆ is_aged_container()
diff --git a/tokens_8cpp_source.html b/tokens_8cpp_source.html
index 7f059c344f..d47a47abd4 100644
--- a/tokens_8cpp_source.html
+++ b/tokens_8cpp_source.html
@@ -613,7 +613,7 @@ $(function() {
545 num_b_58_10_coeffs <= b_58_10_coeff.size(),
546 "ripple::b58_fast::detail::b58_to_b256_be : maximum coeff");
- 547 for (
auto c : input.
substr(0, partial_coeff_len))
+ 547 for (
unsigned char c : input.
substr(0, partial_coeff_len))
@@ -627,7 +627,7 @@ $(function() {
559 for (
int j = 0; j < num_full_coeffs; ++j)
- 561 auto c = input[partial_coeff_len + j * 10 + i];
+ 561 unsigned char c = input[partial_coeff_len + j * 10 + i];