blob: 9200fe2cdeff3cd5db54aaf650157b05f120a8c2 (
plain)
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
// SPDX-License-Identifier: CC0-1.0
#pragma once
#include <array>
#include <cassert>
#include <cstddef>
#include <utility>
#include "Common/TypeUtils.h"
namespace Common
{
// TODO C++26: Replace with std::inplace_vector.
// An std::vector-like container that uses no heap allocations but is limited to a maximum size.
template <typename T, size_t MaxSize>
class SmallVector final
{
public:
using value_type = T;
SmallVector() = default;
explicit SmallVector(size_t new_size) { resize(new_size); }
~SmallVector() { clear(); }
SmallVector(const SmallVector& other)
{
for (auto& value : other)
emplace_back(value);
}
SmallVector& operator=(const SmallVector& rhs)
{
clear();
for (auto& value : rhs)
emplace_back(value);
return *this;
}
SmallVector(SmallVector&& other)
{
for (auto& value : other)
emplace_back(std::move(value));
other.clear();
}
SmallVector& operator=(SmallVector&& rhs)
{
clear();
for (auto& value : rhs)
emplace_back(std::move(value));
rhs.clear();
return *this;
}
void push_back(const value_type& x) { emplace_back(x); }
void push_back(value_type&& x) { emplace_back(std::move(x)); }
template <typename... Args>
value_type& emplace_back(Args&&... args)
{
assert(m_size < MaxSize);
return m_array[m_size++].Construct(std::forward<Args>(args)...);
}
void pop_back()
{
assert(m_size > 0);
m_array[--m_size].Destroy();
}
value_type& operator[](size_t i)
{
assert(i < m_size);
return data()[i];
}
const value_type& operator[](size_t i) const
{
assert(i < m_size);
return data()[i];
}
auto data() { return m_array.data()->Ptr(); }
auto begin() { return data(); }
auto end() { return data() + m_size; }
auto data() const { return m_array.data()->Ptr(); }
auto begin() const { return data(); }
auto end() const { return data() + m_size; }
size_t capacity() const { return MaxSize; }
size_t size() const { return m_size; }
bool empty() const { return m_size == 0; }
void resize(size_t new_size)
{
assert(new_size <= MaxSize);
while (size() < new_size)
emplace_back();
while (size() > new_size)
pop_back();
}
void clear() { resize(0); }
private:
std::array<ManuallyConstructedValue<T>, MaxSize> m_array;
size_t m_size = 0;
};
} // namespace Common
|
