20#ifndef RIPPLE_SHAMAP_TESTS_COMMON_H_INCLUDED
21#define RIPPLE_SHAMAP_TESTS_COMMON_H_INCLUDED
23#include <xrpld/nodestore/DummyScheduler.h>
24#include <xrpld/nodestore/Manager.h>
25#include <xrpld/shamap/Family.h>
27#include <xrpl/basics/chrono.h>
48 "App family full below cache",
52 "App family tree node cache",
54 std::chrono::minutes{1},
60 testSection.
set(
"type",
"memory");
61 testSection.
set(
"path",
"SHAMap_test");
107 Throw<std::runtime_error>(
"missing node");
114 Throw<std::runtime_error>(
"missing node");
A generic endpoint for log messages.
Persistency layer for NodeObject.
Simple NodeStore Scheduler that just peforms the tasks synchronously.
virtual std::unique_ptr< Database > make_Database(std::size_t burstSize, Scheduler &scheduler, int readThreads, Section const &backendParameters, beast::Journal journal)=0
Construct a NodeStore database.
static Manager & instance()
Returns the instance of the manager singleton.
Holds a collection of configuration values.
void set(std::string const &key, std::string const &value)
Set a key/value pair.
Remembers which tree keys have all descendants resident.
TestNodeFamily(beast::Journal j)
std::unique_ptr< NodeStore::Database > db_
beast::Journal const & journal() override
NodeStore::Database & db() override
std::shared_ptr< FullBelowCache > fbCache_
std::shared_ptr< TreeNodeCache > getTreeNodeCache() override
Return a pointer to the Family Tree Node Cache.
void missingNodeAcquireBySeq(std::uint32_t refNum, uint256 const &nodeHash) override
Acquire ledger that has a missing node by ledger sequence.
void missingNodeAcquireByHash(uint256 const &refHash, std::uint32_t refNum) override
Acquire ledger that has a missing node by ledger hash.
std::shared_ptr< TreeNodeCache > tnCache_
NodeStore::Database const & db() const override
std::shared_ptr< FullBelowCache > getFullBelowCache() override
Return a pointer to the Family Full Below Cache.
NodeStore::DummyScheduler scheduler_
beast::manual_clock< std::chrono::steady_clock > clock()
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
constexpr auto megabytes(T value) noexcept