blob: 55b724a2882d177255a80d97cd071482ac8fe2fa (
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
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/* A compile-time constant-length array with bounds-checking assertions. */
#ifndef mozilla_Array_h
#define mozilla_Array_h
#include <stddef.h>
#include <iterator>
#include <ostream>
#include <utility>
#include "mozilla/Assertions.h"
#include "mozilla/Attributes.h"
#include "mozilla/Likely.h"
namespace mozilla {
template <typename T, size_t _Length>
class Array {
T mArr[_Length];
public:
using ElementType = T;
static constexpr size_t Length = _Length;
constexpr Array() = default;
template <typename... Args>
MOZ_IMPLICIT constexpr Array(Args&&... aArgs)
: mArr{std::forward<Args>(aArgs)...} {
static_assert(sizeof...(aArgs) == Length,
"The number of arguments should be equal to the template "
"parameter Length");
}
T& operator[](size_t aIndex) {
if (MOZ_UNLIKELY(aIndex >= Length)) {
detail::InvalidArrayIndex_CRASH(aIndex, Length);
}
return mArr[aIndex];
}
const T& operator[](size_t aIndex) const {
if (MOZ_UNLIKELY(aIndex >= Length)) {
detail::InvalidArrayIndex_CRASH(aIndex, Length);
}
return mArr[aIndex];
}
bool operator==(const Array<T, Length>& aOther) const {
for (size_t i = 0; i < Length; i++) {
if (mArr[i] != aOther[i]) {
return false;
}
}
return true;
}
typedef T* iterator;
typedef const T* const_iterator;
typedef std::reverse_iterator<T*> reverse_iterator;
typedef std::reverse_iterator<const T*> const_reverse_iterator;
// Methods for range-based for loops.
iterator begin() { return mArr; }
constexpr const_iterator begin() const { return mArr; }
constexpr const_iterator cbegin() const { return begin(); }
iterator end() { return mArr + Length; }
constexpr const_iterator end() const { return mArr + Length; }
constexpr const_iterator cend() const { return end(); }
// Methods for reverse iterating.
reverse_iterator rbegin() { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const {
return const_reverse_iterator(end());
}
const_reverse_iterator crbegin() const { return rbegin(); }
reverse_iterator rend() { return reverse_iterator(begin()); }
const_reverse_iterator rend() const {
return const_reverse_iterator(begin());
}
const_reverse_iterator crend() const { return rend(); }
};
template <typename T>
class Array<T, 0> {
public:
T& operator[](size_t aIndex) { MOZ_CRASH("indexing into zero-length array"); }
const T& operator[](size_t aIndex) const {
MOZ_CRASH("indexing into zero-length array");
}
};
// MOZ_DBG support
template <typename T, size_t Length>
std::ostream& operator<<(std::ostream& aOut, const Array<T, Length>& aArray) {
return aOut << Span(aArray);
}
} /* namespace mozilla */
#endif /* mozilla_Array_h */
|
