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
|
// Copyright 2018 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/renderer/core/css/part_names.h"
#include "third_party/blink/renderer/core/dom/names_map.h"
#include "third_party/blink/renderer/core/dom/space_split_string.h"
namespace blink {
namespace {
// Adds the names to the set.
static void AddToSet(const SpaceSplitString& strings,
HashSet<AtomicString>* set) {
for (wtf_size_t i = 0; i < strings.size(); i++) {
set->insert(strings[i]);
}
}
} // namespace
PartNames::PartNames(const SpaceSplitString& names) {
AddToSet(names, &names_);
}
void PartNames::PushMap(const NamesMap& names_map) {
pending_maps_.push_back(&names_map);
}
void PartNames::ApplyMap(const NamesMap& names_map) {
HashSet<AtomicString> new_names;
for (const AtomicString& name : names_) {
if (SpaceSplitString* mapped_names = names_map.Get(name)) {
AddToSet(*mapped_names, &new_names);
}
}
std::swap(names_, new_names);
}
bool PartNames::Contains(const AtomicString& name) {
// If we have any, apply all pending maps and clear the queue.
if (pending_maps_.size()) {
for (const NamesMap* pending_map : pending_maps_) {
ApplyMap(*pending_map);
}
pending_maps_.clear();
}
return names_.Contains(name);
}
size_t PartNames::size() {
return names_.size();
}
} // namespace blink
|
