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
|
// Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef THIRD_PARTY_BLINK_RENDERER_CORE_DOM_SLOT_ASSIGNMENT_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_DOM_SLOT_ASSIGNMENT_H_
#include "third_party/blink/renderer/core/dom/tree_ordered_map.h"
#include "third_party/blink/renderer/platform/heap/handle.h"
#include "third_party/blink/renderer/platform/wtf/text/atomic_string.h"
namespace blink {
class HTMLElement;
class HTMLSlotElement;
class Node;
class ShadowRoot;
class SlotAssignment final : public GarbageCollected<SlotAssignment> {
public:
explicit SlotAssignment(ShadowRoot& owner);
// Relevant DOM Standard: https://dom.spec.whatwg.org/#find-a-slot
HTMLSlotElement* FindSlot(const Node&);
HTMLSlotElement* FindSlotByName(const AtomicString& slot_name) const;
// DOM Standaard defines these two procedures:
// 1. https://dom.spec.whatwg.org/#assign-a-slot
// void assignSlot(const Node& slottable);
// 2. https://dom.spec.whatwg.org/#assign-slotables
// void assignSlotables(HTMLSlotElement&);
// As an optimization, Blink does not implement these literally.
// Instead, provide alternative, HTMLSlotElement::hasAssignedNodesSlow()
// so that slotchange can be detected.
const HeapVector<Member<HTMLSlotElement>>& Slots();
void DidAddSlot(HTMLSlotElement&);
void DidRemoveSlot(HTMLSlotElement&);
void DidRenameSlot(const AtomicString& old_name, HTMLSlotElement&);
void DidChangeHostChildSlotName(const AtomicString& old_value,
const AtomicString& new_value);
bool FindHostChildBySlotName(const AtomicString& slot_name) const;
void CallSlotChangeAfterRemovedFromAssignFunction(HTMLSlotElement& slot);
void CallSlotChangeAfterAdditionFromAssignFunction(
HTMLSlotElement& slot,
const HeapVector<Member<Node>>& added_assign_nodes);
void CallSlotChangeAfterAddition(HTMLSlotElement& slot);
void CallSlotChangeAfterRemoved(HTMLSlotElement& slot);
void CallSlotChangeIfNeeded(HTMLSlotElement& slot, Node& child);
void Trace(Visitor*) const;
bool NeedsAssignmentRecalc() const { return needs_assignment_recalc_; }
void SetNeedsAssignmentRecalc();
void RecalcAssignment();
bool UpdateCandidateNodeAssignedSlot(Node&, HTMLSlotElement&);
void ClearCandidateNodes(const HeapLinkedHashSet<Member<Node>>& candidates);
HeapHashSet<Member<HTMLElement>>& GetCandidateDirectionality() {
return candidate_directionality_set_;
}
private:
enum class SlotMutationType {
kRemoved,
kRenamed,
};
HTMLSlotElement* FindSlotInManualSlotting(const Node&);
HTMLSlotElement* FindSlotInUserAgentShadow(const Node&) const;
void CollectSlots();
HTMLSlotElement* GetCachedFirstSlotWithoutAccessingNodeTree(
const AtomicString& slot_name);
void DidAddSlotInternal(HTMLSlotElement&);
void DidRemoveSlotInternal(HTMLSlotElement&,
const AtomicString& slot_name,
SlotMutationType);
HeapVector<Member<HTMLSlotElement>> slots_;
Member<TreeOrderedMap> slot_map_;
WeakMember<ShadowRoot> owner_;
unsigned needs_collect_slots_ : 1;
unsigned needs_assignment_recalc_ : 1;
unsigned slot_count_ : 30;
// TODO: (1067157) Ensure references inside the map are GCed.
HeapHashMap<Member<Node>, Member<HTMLSlotElement>>
candidate_assigned_slot_map_;
HeapHashSet<Member<HTMLElement>> candidate_directionality_set_;
};
} // namespace blink
#endif // HTMLSlotAssignment_h
|
