forked from LadybirdBrowser/ladybird
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCOWVector.h
172 lines (139 loc) · 3.34 KB
/
COWVector.h
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
/*
* Copyright (c) 2021-2024, Ali Mohammad Pur <[email protected]>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/NonnullRefPtr.h>
#include <AK/RefCounted.h>
#include <AK/Vector.h>
namespace AK {
template<typename T>
class COWVector {
struct Detail : RefCounted<Detail> {
Vector<T> m_members;
};
public:
COWVector()
: m_detail(make_ref_counted<Detail>())
{
}
COWVector(std::initializer_list<T> entries)
: m_detail(make_ref_counted<Detail>())
{
for (auto& entry : entries)
m_detail->m_members.append(entry);
}
COWVector(COWVector const&) = default;
COWVector(COWVector&&) = default;
COWVector& operator=(COWVector const&) = default;
COWVector& operator=(COWVector&&) = default;
Vector<T> release() &&
{
if (m_detail->ref_count() == 1)
return exchange(m_detail->m_members, Vector<T>());
return m_detail->m_members;
}
void append(T const& value)
{
return append(T { value });
}
void append(T&& value)
{
copy();
m_detail->m_members.append(move(value));
}
void extend(Vector<T>&& values)
{
copy();
m_detail->m_members.extend(move(values));
}
void extend(Vector<T> const& values)
{
copy();
m_detail->m_members.extend(values);
}
void extend(COWVector<T> const& values)
{
copy();
m_detail->m_members.extend(values.m_detail->m_members);
}
void resize(size_t size)
{
copy();
m_detail->m_members.resize(size);
}
void ensure_capacity(size_t capacity)
{
if (m_detail->m_members.capacity() >= capacity)
return;
copy();
m_detail->m_members.ensure_capacity(capacity);
}
void prepend(T value)
{
copy();
m_detail->m_members.prepend(move(value));
}
template<typename... Args>
void empend(Args&&... args)
{
copy();
m_detail->m_members.empend(forward<Args>(args)...);
}
void clear()
{
if (m_detail->ref_count() > 1)
m_detail = make_ref_counted<Detail>();
else
m_detail->m_members.clear();
}
T& mutable_at(size_t index)
{
// We're handing out a mutable reference, so make sure we own the data exclusively.
copy();
return m_detail->m_members.at(index);
}
T const& at(size_t index) const
{
return m_detail->m_members.at(index);
}
T const& operator[](size_t index) const
{
return m_detail->m_members[index];
}
size_t capacity() const
{
return m_detail->m_members.capacity();
}
size_t size() const
{
return m_detail->m_members.size();
}
bool is_empty() const
{
return m_detail->m_members.is_empty();
}
T const& first() const
{
return m_detail->m_members.first();
}
T const& last() const
{
return m_detail->m_members.last();
}
private:
void copy()
{
if (m_detail->ref_count() <= 1)
return;
auto new_detail = make_ref_counted<Detail>();
new_detail->m_members = m_detail->m_members;
m_detail = new_detail;
}
NonnullRefPtr<Detail> m_detail;
};
}
#if USING_AK_GLOBALLY
using AK::COWVector;
#endif