rippled
Loading...
Searching...
No Matches
SHAMapSyncFilter.h
1#pragma once
2
3#include <xrpl/shamap/SHAMapTreeNode.h>
4
5#include <optional>
6
8namespace xrpl {
9
11{
12public:
13 virtual ~SHAMapSyncFilter() = default;
14 SHAMapSyncFilter() = default;
17 operator=(SHAMapSyncFilter const&) = delete;
18
19 // Note that the nodeData is overwritten by this call
20 virtual void
22 bool fromFilter,
23 SHAMapHash const& nodeHash,
24 std::uint32_t ledgerSeq,
25 Blob&& nodeData,
26 SHAMapNodeType type) const = 0;
27
29 getNode(SHAMapHash const& nodeHash) const = 0;
30};
31
32} // namespace xrpl
virtual std::optional< Blob > getNode(SHAMapHash const &nodeHash) const =0
SHAMapSyncFilter & operator=(SHAMapSyncFilter const &)=delete
virtual void gotNode(bool fromFilter, SHAMapHash const &nodeHash, std::uint32_t ledgerSeq, Blob &&nodeData, SHAMapNodeType type) const =0
virtual ~SHAMapSyncFilter()=default
SHAMapSyncFilter(SHAMapSyncFilter const &)=delete
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition algorithm.h:5