blob: d5514358ea6d51f99311854a562cb22bed119d2e (
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "alternatespanlist.h"
#include "spantreevisitor.h"
#include <cassert>
using std::unique_ptr;
namespace document {
namespace {
template <typename T>
void ensureSize(size_t size, T &t) {
if (size > t.size()) {
t.resize(size);
}
}
} // namespace
void AlternateSpanList::addInternal(size_t index, unique_ptr<SpanNode> node) {
ensureSize(index + 1, _subtrees);
Subtree &subtree = _subtrees[index];
if (!subtree.span_list) {
subtree.span_list = new SpanList;
}
subtree.span_list->add(std::move(node));
}
AlternateSpanList::~AlternateSpanList() {
for (size_t i = 0; i < _subtrees.size(); ++i) {
delete _subtrees[i].span_list;
}
}
void AlternateSpanList::setSubtree(size_t index, std::unique_ptr<SpanList> subtree) {
ensureSize(index + 1, _subtrees);
_subtrees[index].span_list = subtree.release();
}
void AlternateSpanList::setProbability(size_t index, double probability) {
ensureSize(index + 1, _subtrees);
_subtrees[index].probability = probability;
}
SpanList &AlternateSpanList::getSubtree(size_t index) const {
assert(index < _subtrees.size());
assert(_subtrees[index].span_list);
return *_subtrees[index].span_list;
}
double AlternateSpanList::getProbability(size_t index) const {
assert(index < _subtrees.size());
return _subtrees[index].probability;
}
void AlternateSpanList::accept(SpanTreeVisitor &visitor) const {
visitor.visit(*this);
}
} // namespace document
|
