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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "i_enum_store.h"
#include <vespa/searchcommon/attribute/iattributevector.h>
#include <vespa/vespalib/datastore/entry_comparator_wrapper.h>
#include <vespa/vespalib/datastore/unique_store_dictionary.h>
namespace search {
class BufferWriter;
using EnumTreeTraits = vespalib::btree::BTreeTraits<16, 16, 10, true>;
using EnumTree = vespalib::btree::BTree<vespalib::datastore::AtomicEntryRef, vespalib::btree::BTreeNoLeafData,
vespalib::btree::NoAggregated,
const vespalib::datastore::EntryComparatorWrapper,
EnumTreeTraits>;
using EnumPostingTree = vespalib::btree::BTree<vespalib::datastore::AtomicEntryRef, vespalib::datastore::AtomicEntryRef,
vespalib::btree::NoAggregated,
const vespalib::datastore::EntryComparatorWrapper,
EnumTreeTraits>;
/**
* Interface for the dictionary used by an enum store.
*/
class IEnumStoreDictionary : public vespalib::datastore::IUniqueStoreDictionary {
public:
using AtomicEntryRef = vespalib::datastore::AtomicEntryRef;
using EntryRef = vespalib::datastore::EntryRef;
using EntryComparator = vespalib::datastore::EntryComparator;
using EntryRefFilter = vespalib::datastore::EntryRefFilter;
using EnumVector = IEnumStore::EnumVector;
using Index = IEnumStore::Index;
using IndexList = IEnumStore::IndexList;
using IndexVector = IEnumStore::IndexVector;
using generation_t = vespalib::GenerationHandler::generation_t;
public:
virtual ~IEnumStoreDictionary() = default;
virtual void free_unused_values(const EntryComparator& cmp) = 0;
virtual void free_unused_values(const IndexList& to_remove, const EntryComparator& cmp) = 0;
virtual bool find_index(const EntryComparator& cmp, Index& idx) const = 0;
virtual bool find_frozen_index(const EntryComparator& cmp, Index& idx) const = 0;
virtual std::vector<attribute::IAttributeVector::EnumHandle>
find_matching_enums(const EntryComparator& cmp) const = 0;
virtual EntryRef get_frozen_root() const = 0;
virtual std::pair<Index, EntryRef> find_posting_list(const EntryComparator& cmp, EntryRef root) const = 0;
virtual void collect_folded(Index idx, EntryRef root, const std::function<void(EntryRef)>& callback) const = 0;
virtual Index remap_index(Index idx) = 0;
virtual void clear_all_posting_lists(std::function<void(EntryRef)> clearer) = 0;
virtual void update_posting_list(Index idx, const EntryComparator& cmp, std::function<EntryRef(EntryRef)> updater) = 0;
/*
* Scan dictionary and call normalize function for each value. If
* returned value is different then write back the modified value to
* the dictionary. Only used by unit tests.
*/
virtual bool normalize_posting_lists(std::function<EntryRef(EntryRef)> normalize) = 0;
/*
* Scan dictionary and call normalize function for batches of values
* that pass the filter. Write back modified values to the dictionary.
* Used by compaction of posting lists when moving short arrays,
* bitvectors or btree roots.
*/
virtual bool normalize_posting_lists(std::function<void(std::vector<EntryRef>&)> normalize, const EntryRefFilter& filter) = 0;
/*
* Scan dictionary and call callback function for batches of values
* that pass the filter. Used by compaction of posting lists when
* moving btree nodes.
*/
virtual void foreach_posting_list(std::function<void(const std::vector<EntryRef>&)> callback, const EntryRefFilter& filter) = 0;
virtual const EnumPostingTree& get_posting_dictionary() const = 0;
};
}
|
