blob: 654b3c311d8dd7b05e8f777a25634ba6a174c61d (
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
84
85
86
87
88
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "changevector.h"
#include <vespa/vespalib/util/memoryusage.h>
#include <vespa/vespalib/util/alloc.h>
#include <algorithm>
namespace search {
using vespalib::roundUp2inN;
namespace {
// This number is selected to be large enough to hold bursts between commits
constexpr size_t NUM_ELEMS_TO_RESERVE = 200;
constexpr size_t NUM_ELEMS_TO_RESERVE_INITIAL = 4;
}
template <typename T>
ChangeVectorT<T>::ChangeVectorT()
: _v()
{
_v.reserve(roundUp2inN<T>(NUM_ELEMS_TO_RESERVE_INITIAL));
}
template <typename T>
ChangeVectorT<T>::~ChangeVectorT() = default;
template <typename T>
void
ChangeVectorT<T>::clear() {
if (_v.capacity() > roundUp2inN<T>(NUM_ELEMS_TO_RESERVE * 5)) {
// Ensure we do not keep insanely large buffers over time, due to abnormal peaks
// caused by hickups else where.
_v = Vector();
_v.reserve(roundUp2inN<T>(NUM_ELEMS_TO_RESERVE));
} else {
_v.clear();
}
}
template <typename T>
void
ChangeVectorT<T>::push_back(const T & c)
{
_v.push_back(c);
}
template <typename T>
template <typename Accessor>
void
ChangeVectorT<T>::push_back(uint32_t doc, Accessor & ac)
{
if (ac.size() <= 0) { return; }
_v.reserve(roundUp2inN<T>(size() + ac.size()));
for (size_t i(0), m(ac.size()); i < m; i++, ac.next()) {
_v.push_back(T(ChangeBase::APPEND, doc, typename T::DataType(ac.value()), ac.weight()));
}
}
template <typename T>
vespalib::MemoryUsage
ChangeVectorT<T>::getMemoryUsage() const
{
size_t usedBytes = _v.size() * sizeof(T);
size_t allocBytes = _v.capacity() * sizeof(T);
return vespalib::MemoryUsage(allocBytes, usedBytes, 0, 0);
}
template <typename T>
ChangeVectorT<T>::DocIdInsertOrder::DocIdInsertOrder(const Vector & v)
: _v(v),
_adjacent()
{
_adjacent.reserve(v.size());
uint32_t index(0);
for (const auto & c : _v) {
_adjacent.push_back((uint64_t(c._doc) << 32) | index++);
}
std::sort(_adjacent.begin(), _adjacent.end());
}
} // namespace search
|
