blob: 987071bf9d1d6385df8af5d56a84a18f9483394a (
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "value.h"
#include "nix_value.h"
#include "value_factory.h"
#include <vespa/vespalib/stllike/allocator.h>
#include <vector>
namespace vespalib::slime {
/**
* Class representing a collection of ordered values that can be
* looked up by index.
**/
class ArrayValue final : public Value
{
private:
SymbolTable &_symbolTable;
Stash &_stash;
std::vector<Value*, vespalib::allocator_large<Value*>> _values;
protected:
Cursor &addLeaf(const ValueFactory &input) override {
Value *value = input.create(_stash);
_values.push_back(value);
return *value;
}
public:
ArrayValue(SymbolTable &table, Stash & stash);
ArrayValue(const ArrayValue &) = delete;
ArrayValue &operator=(const ArrayValue &) = delete;
void reserve(size_t sz) { _values.reserve(sz); }
Type type() const override { return ARRAY::instance; }
size_t children() const override { return _values.size(); }
size_t entries() const override { return _values.size(); }
void traverse(ArrayTraverser &at) const override;
Cursor &operator[](size_t idx) const override {
if (idx < _values.size()) {
return *_values[idx];
}
return *NixValue::invalid();
}
Cursor &addArray(size_t reserve) override;
Cursor &addObject() override;
Symbol resolve(Memory symbol_name) override;
~ArrayValue() override;
};
} // namespace vespalib::slime
|
