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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0+ OR GPL-3.0 WITH Qt-GPL-exception-1.0
#pragma once
#include <algorithm>
#include <array>
#include <cstdint>
#include <ostream>
#include <iterator>
namespace Utils {
template <typename T, std::uint8_t MaxSize>
class SizedArray : public std::array<T, MaxSize>
{
public:
using size_type = std::uint8_t;
using reference = typename std::array<T, MaxSize>::reference;
using const_reference = typename std::array<T, MaxSize>::const_reference;
using iterator = typename std::array<T, MaxSize>::iterator;
using const_iterator = typename std::array<T, MaxSize>::const_iterator;
using reverse_iterator = typename std::array<T, MaxSize>::reverse_iterator;
using const_reverse_iterator = typename std::array<T, MaxSize>::const_reverse_iterator;
using value_type = typename std::array<T, MaxSize>::value_type;
using pointer = typename std::array<T, MaxSize>::pointer;
using difference_type = typename std::array<T, MaxSize>::difference_type;
using std::array<T, MaxSize>::operator[];
using std::array<T, MaxSize>::begin;
using std::array<T, MaxSize>::cbegin;
using std::array<T, MaxSize>::rend;
using std::array<T, MaxSize>::crend;
constexpr SizedArray() : std::array<T, MaxSize>() {}
SizedArray(std::initializer_list<T> list)
: m_size(std::uint8_t(list.size()))
{
std::copy(list.begin(), list.end(), begin());
}
constexpr size_type size() const
{
return m_size;
}
void push_back(const T &value)
{
operator[](m_size) = value;
++m_size;
}
constexpr const_reference back() const
{
return operator[](m_size - 1);
}
iterator end()
{
return std::next(begin(), m_size);
}
const_iterator end() const
{
return std::next(begin(), m_size);
}
const_iterator cend() const
{
return std::next(cbegin(), m_size);
}
reverse_iterator rbegin()
{
return std::prev(rend(), m_size);
}
const_reverse_iterator rbegin() const
{
return std::prev(rend(), m_size);
}
const_reverse_iterator crbegin() const
{
return std::prev(crend(), m_size);
}
bool empty() const
{
return m_size == 0;
}
void initializeElements()
{
std::array<T, MaxSize>::fill(T{});
}
bool contains(const T &item) const
{
return std::any_of(begin(), end(), [&item](const T ¤t) {
return item == current;
});
}
friend std::ostream &operator<<(std::ostream &out, SizedArray array)
{
out << "[";
copy(array.cbegin(), array.cend(), std::ostream_iterator<T>(out, ", "));
out << "]";
return out;
}
private:
std::uint8_t m_size = 0;
};
} // namespace Utils
|
