forked from WebKit/WebKit
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayReference.h
More file actions
120 lines (97 loc) · 3.24 KB
/
ArrayReference.h
File metadata and controls
120 lines (97 loc) · 3.24 KB
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
/*
* Copyright (C) 2010-2020 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include <limits>
#include <wtf/Vector.h>
namespace IPC {
inline constexpr size_t arrayReferenceDynamicExtent = std::numeric_limits<size_t>::max();
template <typename T, size_t Extent = arrayReferenceDynamicExtent>
class ArrayReference;
template <typename T>
class ArrayReference<T, arrayReferenceDynamicExtent> {
public:
ArrayReference() = default;
ArrayReference(const T* data, size_t size)
: m_data(data)
, m_size(size)
{
}
template <size_t inlineCapacity>
ArrayReference(const Vector<T, inlineCapacity>& vector)
: m_data(vector.data())
, m_size(vector.size())
{
}
bool isEmpty() const { return !m_size; }
size_t size() const { return m_size; }
const T* data() const
{
if (isEmpty())
return nullptr;
return m_data;
}
Vector<T> vector() const
{
Vector<T> result;
result.append(m_data, m_size);
return result;
}
private:
const T* m_data { nullptr };
size_t m_size { 0 };
};
template <typename T, size_t Extent>
class ArrayReference {
public:
ArrayReference() = default;
ArrayReference(const T* data, size_t size)
: m_data(data)
{
ASSERT_UNUSED(size, size == Extent);
}
template <size_t inlineCapacity>
ArrayReference(const Vector<T, inlineCapacity>& vector)
: m_data(vector.data())
{
ASSERT(vector.size() == Extent);
}
constexpr bool isEmpty() const { return !Extent; }
constexpr size_t size() const { return Extent; }
const T* data() const
{
if (isEmpty())
return nullptr;
return m_data;
}
Vector<T> vector() const
{
return { m_data, Extent };
}
private:
const T* m_data { nullptr };
};
template<typename T, size_t inlineCapacity>
ArrayReference(const WTF::Vector<T, inlineCapacity>&) -> ArrayReference<T>;
} // namespace IPC