OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "core/dom/custom/CustomElementUpgradeCandidateMap.h" | |
32 | |
33 #include "core/dom/Element.h" | |
34 | |
35 namespace blink { | |
36 | |
37 CustomElementUpgradeCandidateMap* CustomElementUpgradeCandidateMap::create() | |
38 { | |
39 return new CustomElementUpgradeCandidateMap(); | |
40 } | |
41 | |
42 CustomElementUpgradeCandidateMap::~CustomElementUpgradeCandidateMap() | |
43 { | |
44 } | |
45 | |
46 void CustomElementUpgradeCandidateMap::add(const CustomElementDescriptor& descri
ptor, Element* element) | |
47 { | |
48 observe(element); | |
49 | |
50 UpgradeCandidateMap::AddResult result = m_upgradeCandidates.add(element, des
criptor); | |
51 ASSERT_UNUSED(result, result.isNewEntry); | |
52 | |
53 UnresolvedDefinitionMap::iterator it = m_unresolvedDefinitions.find(descript
or); | |
54 ElementSet* elements; | |
55 if (it == m_unresolvedDefinitions.end()) | |
56 elements = m_unresolvedDefinitions.add(descriptor, new ElementSet()).sto
redValue->value.get(); | |
57 else | |
58 elements = it->value.get(); | |
59 elements->add(element); | |
60 } | |
61 | |
62 void CustomElementUpgradeCandidateMap::elementWasDestroyed(Element* element) | |
63 { | |
64 CustomElementObserver::elementWasDestroyed(element); | |
65 UpgradeCandidateMap::iterator candidate = m_upgradeCandidates.find(element); | |
66 ASSERT_WITH_SECURITY_IMPLICATION(candidate != m_upgradeCandidates.end()); | |
67 | |
68 UnresolvedDefinitionMap::iterator elements = m_unresolvedDefinitions.find(ca
ndidate->value); | |
69 ASSERT_WITH_SECURITY_IMPLICATION(elements != m_unresolvedDefinitions.end()); | |
70 elements->value->remove(element); | |
71 m_upgradeCandidates.remove(candidate); | |
72 } | |
73 | |
74 CustomElementUpgradeCandidateMap::ElementSet* CustomElementUpgradeCandidateMap::
takeUpgradeCandidatesFor(const CustomElementDescriptor& descriptor) | |
75 { | |
76 ElementSet* candidates = m_unresolvedDefinitions.take(descriptor); | |
77 | |
78 if (!candidates) | |
79 return nullptr; | |
80 | |
81 for (const auto& candidate : *candidates) { | |
82 unobserve(candidate); | |
83 m_upgradeCandidates.remove(candidate); | |
84 } | |
85 return candidates; | |
86 } | |
87 | |
88 DEFINE_TRACE(CustomElementUpgradeCandidateMap) | |
89 { | |
90 visitor->trace(m_upgradeCandidates); | |
91 visitor->trace(m_unresolvedDefinitions); | |
92 CustomElementObserver::trace(visitor); | |
93 } | |
94 | |
95 } // namespace blink | |
OLD | NEW |