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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
/*
* Copyright 2020 The WebRTC Project Authors. All rights reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#ifndef RTC_BASE_BOUNDED_INLINE_VECTOR_H_
#define RTC_BASE_BOUNDED_INLINE_VECTOR_H_
#include <stdint.h>
#include <memory>
#include <type_traits>
#include <utility>
#include "rtc_base/bounded_inline_vector_impl.h"
#include "rtc_base/checks.h"
namespace webrtc {
// A small std::vector-like type whose capacity is a compile-time constant. It
// stores all data inline and never heap allocates (beyond what its element type
// requires). Trying to grow it beyond its constant capacity is an error.
//
// TODO(bugs.webrtc.org/11391): Comparison operators.
// TODO(bugs.webrtc.org/11391): Methods for adding and deleting elements.
template <typename T, int fixed_capacity>
class BoundedInlineVector {
static_assert(!std::is_const<T>::value, "T may not be const");
static_assert(fixed_capacity > 0, "Capacity must be strictly positive");
public:
using size_type = int;
using value_type = T;
using const_iterator = const T*;
BoundedInlineVector() = default;
BoundedInlineVector(const BoundedInlineVector&) = default;
BoundedInlineVector(BoundedInlineVector&&) = default;
BoundedInlineVector& operator=(const BoundedInlineVector&) = default;
BoundedInlineVector& operator=(BoundedInlineVector&&) = default;
~BoundedInlineVector() = default;
// This constructor is implicit, to make it possible to write e.g.
//
// BoundedInlineVector<double, 7> x = {2.72, 3.14};
//
// and
//
// BoundedInlineVector<double, 7> GetConstants() {
// return {2.72, 3.14};
// }
template <typename... Ts,
typename std::enable_if_t<
bounded_inline_vector_impl::AllConvertible<T, Ts...>::value>* =
nullptr>
BoundedInlineVector(Ts&&... elements) // NOLINT(runtime/explicit)
: storage_(std::forward<Ts>(elements)...) {
static_assert(sizeof...(Ts) <= fixed_capacity, "");
}
template <
int other_capacity,
typename std::enable_if_t<other_capacity != fixed_capacity>* = nullptr>
BoundedInlineVector(const BoundedInlineVector<T, other_capacity>& other) {
RTC_DCHECK_LE(other.size(), fixed_capacity);
bounded_inline_vector_impl::CopyElements(other.data(), other.size(),
storage_.data, &storage_.size);
}
template <
int other_capacity,
typename std::enable_if_t<other_capacity != fixed_capacity>* = nullptr>
BoundedInlineVector(BoundedInlineVector<T, other_capacity>&& other) {
RTC_DCHECK_LE(other.size(), fixed_capacity);
bounded_inline_vector_impl::MoveElements(other.data(), other.size(),
storage_.data, &storage_.size);
}
template <
int other_capacity,
typename std::enable_if_t<other_capacity != fixed_capacity>* = nullptr>
BoundedInlineVector& operator=(
const BoundedInlineVector<T, other_capacity>& other) {
bounded_inline_vector_impl::DestroyElements(storage_.data, storage_.size);
RTC_DCHECK_LE(other.size(), fixed_capacity);
bounded_inline_vector_impl::CopyElements(other.data(), other.size(),
storage_.data, &storage_.size);
return *this;
}
template <
int other_capacity,
typename std::enable_if_t<other_capacity != fixed_capacity>* = nullptr>
BoundedInlineVector& operator=(
BoundedInlineVector<T, other_capacity>&& other) {
bounded_inline_vector_impl::DestroyElements(storage_.data, storage_.size);
RTC_DCHECK_LE(other.size(), fixed_capacity);
bounded_inline_vector_impl::MoveElements(other.data(), other.size(),
storage_.data, &storage_.size);
return *this;
}
bool empty() const { return storage_.size == 0; }
int size() const { return storage_.size; }
constexpr int capacity() const { return fixed_capacity; }
// Resizes the BoundedInlineVector to the given size, which must not exceed
// its constant capacity. If the size is increased, the added elements are
// default constructed.
void resize(int new_size) {
RTC_DCHECK_GE(new_size, 0);
RTC_DCHECK_LE(new_size, fixed_capacity);
if (new_size > storage_.size) {
bounded_inline_vector_impl::DefaultInitializeElements(
storage_.data + storage_.size, new_size - storage_.size);
} else if (new_size < storage_.size) {
bounded_inline_vector_impl::DestroyElements(storage_.data + new_size,
storage_.size - new_size);
}
storage_.size = new_size;
}
const T* data() const { return storage_.data; }
T* data() { return storage_.data; }
const T& operator[](int index) const {
RTC_DCHECK_GE(index, 0);
RTC_DCHECK_LT(index, storage_.size);
return storage_.data[index];
}
T& operator[](int index) {
RTC_DCHECK_GE(index, 0);
RTC_DCHECK_LT(index, storage_.size);
return storage_.data[index];
}
T* begin() { return storage_.data; }
T* end() { return storage_.data + storage_.size; }
const T* begin() const { return storage_.data; }
const T* end() const { return storage_.data + storage_.size; }
const T* cbegin() const { return storage_.data; }
const T* cend() const { return storage_.data + storage_.size; }
private:
bounded_inline_vector_impl::Storage<T, fixed_capacity> storage_;
};
} // namespace webrtc
#endif // RTC_BASE_BOUNDED_INLINE_VECTOR_H_
|
