summaryrefslogtreecommitdiffstats
path: root/searchlib/src/vespa/searchlib/attribute/enumstore.cpp
blob: ddd5f8540d113f16349bc9195bb7f11f4238aeb0 (plain) (blame)
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
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.

#include "enumstore.hpp"
#include <vespa/vespalib/util/rcuvector.hpp>
#include <iomanip>

#include <vespa/log/log.h>
LOG_SETUP(".searchlib.attribute.enum_store");

namespace search {

template <>
void
EnumStoreT<StringEntryType>::writeValues(BufferWriter& writer,
                                         vespalib::ConstArrayRef<Index> idxs) const
{
    for (const auto& idx : idxs) {
        const char* src = _store.get(idx);
        size_t sz = strlen(src) + 1;
        writer.write(src, sz);
    }
}

template <>
ssize_t
EnumStoreT<StringEntryType>::load_unique_value(const void* src,
                                               size_t available,
                                               Index& idx)
{
    const char* value = static_cast<const char*>(src);
    size_t slen = strlen(value);
    size_t sz = slen + 1;
    if (available < sz) {
        return -1;
    }
    Index prev_idx = idx;
    idx = _store.get_allocator().allocate(value);

    if (prev_idx.valid()) {
        assert(ComparatorType::compare(getValue(prev_idx), value) < 0);
    }
    return sz;
}

std::unique_ptr<datastore::IUniqueStoreDictionary>
make_enum_store_dictionary(IEnumStore &store, bool has_postings, std::unique_ptr<datastore::EntryComparator> folded_compare)
{
    if (has_postings) {
        if (folded_compare) {
            return std::make_unique<EnumStoreFoldedDictionary>(store, std::move(folded_compare));
        } else {
            return std::make_unique<EnumStoreDictionary<EnumPostingTree>>(store);
        }
    } else {
        return std::make_unique<EnumStoreDictionary<EnumTree>>(store);
    }
}


template class datastore::DataStoreT<IEnumStore::InternalIndex>;

template
class btree::BTreeBuilder<IEnumStore::Index, btree::BTreeNoLeafData, btree::NoAggregated,
                          EnumTreeTraits::INTERNAL_SLOTS, EnumTreeTraits::LEAF_SLOTS>;

template
class btree::BTreeBuilder<IEnumStore::Index, datastore::EntryRef, btree::NoAggregated,
                          EnumTreeTraits::INTERNAL_SLOTS, EnumTreeTraits::LEAF_SLOTS>;

template class EnumStoreT< StringEntryType >;
template class EnumStoreT<NumericEntryType<int8_t> >;
template class EnumStoreT<NumericEntryType<int16_t> >;
template class EnumStoreT<NumericEntryType<int32_t> >;
template class EnumStoreT<NumericEntryType<int64_t> >;
template class EnumStoreT<NumericEntryType<float> >;
template class EnumStoreT<NumericEntryType<double> >;

} // namespace search

namespace vespalib {
    template class RcuVectorBase<search::IEnumStore::Index>;
}