blob: 33bbfd61df94718f56b68976f9a477b5ad6d94e7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
//
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2025
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#pragma once
#include "td/utils/common.h"
#include "td/utils/FlatHashMap.h"
#include "td/utils/HashTableUtils.h"
#include "td/utils/Promise.h"
#include "td/utils/Slice.h"
#include <functional>
#include <unordered_map>
namespace td {
class KeyValueSyncInterface {
public:
// SeqNo is used to restore total order on all write queries.
// Some implementations may return 0 as SeqNo.
using SeqNo = uint64;
KeyValueSyncInterface() = default;
KeyValueSyncInterface(const KeyValueSyncInterface &) = delete;
KeyValueSyncInterface &operator=(const KeyValueSyncInterface &) = delete;
KeyValueSyncInterface(KeyValueSyncInterface &&) = default;
KeyValueSyncInterface &operator=(KeyValueSyncInterface &&) = default;
virtual ~KeyValueSyncInterface() = default;
virtual SeqNo set(string key, string value) = 0;
virtual bool isset(const string &key) = 0;
virtual string get(const string &key) = 0;
virtual void for_each(std::function<void(Slice, Slice)> func) = 0;
virtual std::unordered_map<string, string, Hash<string>> prefix_get(Slice prefix) = 0;
virtual FlatHashMap<string, string> get_all() = 0;
virtual SeqNo erase(const string &key) = 0;
virtual SeqNo erase_batch(vector<string> keys) = 0;
virtual void erase_by_prefix(Slice prefix) = 0;
virtual void force_sync(Promise<> &&promise, const char *source) = 0;
virtual void close(Promise<> promise) = 0;
};
} // namespace td
|