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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
// Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/public/common/indexeddb/indexeddb_key.h"
#include <algorithm>
#include <sstream>
#include <string>
#include <utility>
#include "base/strings/string_number_conversions.h"
namespace blink {
namespace {
// Very rough estimate of minimum key size overhead.
const size_t kOverheadSize = 16;
size_t CalculateArraySize(const IndexedDBKey::KeyArray& keys) {
size_t size(0);
for (const auto& key : keys)
size += key.size_estimate();
return size;
}
template <typename T>
int Compare(const T& a, const T& b) {
// Using '<' for both comparisons here is as generic as possible (for e.g.
// objects which only define operator<() and not operator>() or operator==())
// and also allows e.g. floating point NaNs to compare equal.
if (a < b)
return -1;
return (b < a) ? 1 : 0;
}
} // namespace
IndexedDBKey::IndexedDBKey() : IndexedDBKey(mojom::IDBKeyType::None) {}
IndexedDBKey::IndexedDBKey(mojom::IDBKeyType type)
: type_(type), size_estimate_(kOverheadSize) {
DCHECK(!IsValid());
}
IndexedDBKey::IndexedDBKey(double number, mojom::IDBKeyType type)
: type_(type),
number_(number),
size_estimate_(kOverheadSize + sizeof(number)) {
DCHECK(type == mojom::IDBKeyType::Number || type == mojom::IDBKeyType::Date);
}
IndexedDBKey::IndexedDBKey(KeyArray array)
: type_(mojom::IDBKeyType::Array),
array_(std::move(array)),
size_estimate_(kOverheadSize + CalculateArraySize(array_)) {}
IndexedDBKey::IndexedDBKey(std::string binary)
: type_(mojom::IDBKeyType::Binary),
binary_(std::move(binary)),
size_estimate_(kOverheadSize +
(binary_.length() * sizeof(std::string::value_type))) {}
IndexedDBKey::IndexedDBKey(std::u16string string)
: type_(mojom::IDBKeyType::String),
string_(std::move(string)),
size_estimate_(kOverheadSize +
(string_.length() * sizeof(std::u16string::value_type))) {}
IndexedDBKey::IndexedDBKey(IndexedDBKey&& other) = default;
IndexedDBKey& IndexedDBKey::operator=(IndexedDBKey&& other) = default;
IndexedDBKey::~IndexedDBKey() = default;
bool IndexedDBKey::IsValid() const {
switch (type_) {
case mojom::IDBKeyType::Array:
return std::ranges::all_of(array_, &IndexedDBKey::IsValid);
case mojom::IDBKeyType::Binary:
case mojom::IDBKeyType::String:
case mojom::IDBKeyType::Date:
case mojom::IDBKeyType::Number:
return true;
case mojom::IDBKeyType::Invalid:
case mojom::IDBKeyType::None:
case mojom::IDBKeyType::Min:
return false;
}
}
bool IndexedDBKey::IsLessThan(const IndexedDBKey& other) const {
return CompareTo(other) < 0;
}
bool IndexedDBKey::Equals(const IndexedDBKey& other) const {
return !CompareTo(other);
}
bool IndexedDBKey::HasHoles() const {
if (type_ != mojom::IDBKeyType::Array)
return false;
for (const auto& subkey : array_) {
if (subkey.type() == mojom::IDBKeyType::None)
return true;
}
return false;
}
IndexedDBKey IndexedDBKey::Clone() const {
IndexedDBKey clone;
clone.type_ = type_;
for (size_t i = 0; i < array_.size(); ++i) {
clone.array_.emplace_back(array_[i].Clone());
}
clone.binary_ = binary_;
clone.string_ = string_;
clone.number_ = number_;
clone.size_estimate_ = size_estimate_;
return clone;
}
IndexedDBKey IndexedDBKey::FillHoles(const IndexedDBKey& primary_key) const {
if (type_ != mojom::IDBKeyType::Array)
return Clone();
std::vector<IndexedDBKey> subkeys;
subkeys.reserve(array_.size());
for (const IndexedDBKey& subkey : array_) {
if (subkey.type() == mojom::IDBKeyType::None) {
subkeys.emplace_back(primary_key.Clone());
} else {
// "Holes" can only exist at the top level of an array key, as (1) they
// are produced by an index's array keypath when a member matches the
// store's keypath, and (2) array keypaths are flat (no
// arrays-of-arrays).
DCHECK(!subkey.HasHoles());
subkeys.emplace_back(subkey.Clone());
}
}
return IndexedDBKey(std::move(subkeys));
}
std::string IndexedDBKey::DebugString() const {
std::stringstream result;
result << "IDBKey{";
switch (type_) {
case mojom::IDBKeyType::Array: {
result << "array: [";
for (size_t i = 0; i < array_.size(); ++i) {
result << array_[i].DebugString();
if (i != array_.size() - 1)
result << ", ";
}
result << "]";
break;
}
case mojom::IDBKeyType::Binary:
result << "binary: 0x" << base::HexEncode(binary_);
break;
case mojom::IDBKeyType::String:
result << "string: " << string_;
break;
case mojom::IDBKeyType::Date:
result << "date: " << number_;
break;
case mojom::IDBKeyType::Number:
result << "number: " << number_;
break;
case mojom::IDBKeyType::Invalid:
result << "Invalid";
break;
case mojom::IDBKeyType::None:
result << "None";
break;
case mojom::IDBKeyType::Min:
result << "Min";
break;
default:
result << "InvalidKey";
}
result << "}";
return result.str();
}
int IndexedDBKey::CompareTo(const IndexedDBKey& other) const {
DCHECK(IsValid());
DCHECK(other.IsValid());
if (type_ != other.type_)
return type_ > other.type_ ? -1 : 1;
switch (type_) {
case mojom::IDBKeyType::Array:
for (size_t i = 0; i < array_.size() && i < other.array_.size(); ++i) {
int result = array_[i].CompareTo(other.array_[i]);
if (result != 0)
return result;
}
return Compare(array_.size(), other.array_.size());
case mojom::IDBKeyType::Binary:
return binary_.compare(other.binary_);
case mojom::IDBKeyType::String:
return string_.compare(other.string_);
case mojom::IDBKeyType::Date:
case mojom::IDBKeyType::Number:
return Compare(number_, other.number_);
case mojom::IDBKeyType::Invalid:
case mojom::IDBKeyType::None:
case mojom::IDBKeyType::Min:
default:
NOTREACHED();
}
}
} // namespace blink
|
