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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/btree/btree.h>
#include "i_unique_store_dictionary.h"
#pragma once
namespace vespalib::datastore {
class EntryComparatorWrapper;
class IUniqueStoreDictionaryReadSnapshot;
class NoBTreeDictionary { };
class NoHashDictionary;
template <typename BTreeDictionaryT>
class UniqueStoreBTreeDictionaryBase
{
protected:
BTreeDictionaryT _btree_dict;
public:
static constexpr bool has_btree_dictionary = true;
UniqueStoreBTreeDictionaryBase()
: _btree_dict()
{
}
};
template <>
class UniqueStoreBTreeDictionaryBase<NoBTreeDictionary>
{
public:
static constexpr bool has_btree_dictionary = false;
UniqueStoreBTreeDictionaryBase()
{
}
};
template <typename HashDictionaryT>
class UniqueStoreHashDictionaryBase
{
protected:
HashDictionaryT _hash_dict;
public:
static constexpr bool has_hash_dictionary = true;
UniqueStoreHashDictionaryBase(std::unique_ptr<EntryComparator> compare)
: _hash_dict(std::move(compare))
{
}
};
template <>
class UniqueStoreHashDictionaryBase<NoHashDictionary>
{
public:
static constexpr bool has_hash_dictionary = false;
UniqueStoreHashDictionaryBase(std::unique_ptr<EntryComparator>)
{
}
};
/**
* A dictionary for unique store. Mostly accessed via base class.
*/
template <typename BTreeDictionaryT, typename ParentT = IUniqueStoreDictionary, typename HashDictionaryT = NoHashDictionary>
class UniqueStoreDictionary : public ParentT, public UniqueStoreBTreeDictionaryBase<BTreeDictionaryT>, public UniqueStoreHashDictionaryBase<HashDictionaryT> {
protected:
using BTreeDictionaryType = BTreeDictionaryT;
using generation_t = typename ParentT::generation_t;
public:
using UniqueStoreBTreeDictionaryBase<BTreeDictionaryT>::has_btree_dictionary;
using UniqueStoreHashDictionaryBase<HashDictionaryT>::has_hash_dictionary;
UniqueStoreDictionary(std::unique_ptr<EntryComparator> compare);
~UniqueStoreDictionary() override;
void freeze() override;
void transfer_hold_lists(generation_t generation) override;
void trim_hold_lists(generation_t firstUsed) override;
UniqueStoreAddResult add(const EntryComparator& comp, std::function<EntryRef(void)> insertEntry) override;
EntryRef find(const EntryComparator& comp) override;
void remove(const EntryComparator& comp, EntryRef ref) override;
void move_keys_on_compact(ICompactable& compactable, const EntryRefFilter& compacting_buffers) override;
uint32_t get_num_uniques() const override;
vespalib::MemoryUsage get_memory_usage() const override;
void build(vespalib::ConstArrayRef<EntryRef>, vespalib::ConstArrayRef<uint32_t> ref_counts, std::function<void(EntryRef)> hold) override;
void build(vespalib::ConstArrayRef<EntryRef> refs) override;
void build_with_payload(vespalib::ConstArrayRef<EntryRef>, vespalib::ConstArrayRef<EntryRef> payloads) override;
std::unique_ptr<IUniqueStoreDictionaryReadSnapshot> get_read_snapshot() const override;
bool get_has_btree_dictionary() const override;
bool get_has_hash_dictionary() const override;
vespalib::MemoryUsage get_btree_memory_usage() const override;
vespalib::MemoryUsage get_hash_memory_usage() const override;
bool has_held_buffers() const override;
void compact_worst(bool compact_btree_dictionary, bool compact_hash_dictionary, const CompactionStrategy& compaction_strategy) override;
};
}
|
