OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef CustomElementUpgradeCandidateMap_h | 31 #ifndef V0CustomElementUpgradeCandidateMap_h |
32 #define CustomElementUpgradeCandidateMap_h | 32 #define V0CustomElementUpgradeCandidateMap_h |
33 | 33 |
34 #include "core/dom/custom/CustomElementDescriptor.h" | 34 #include "core/dom/custom/V0CustomElementDescriptor.h" |
35 #include "core/dom/custom/CustomElementDescriptorHash.h" | 35 #include "core/dom/custom/V0CustomElementDescriptorHash.h" |
36 #include "core/dom/custom/CustomElementObserver.h" | 36 #include "core/dom/custom/V0CustomElementObserver.h" |
37 #include "wtf/HashMap.h" | 37 #include "wtf/HashMap.h" |
38 #include "wtf/LinkedHashSet.h" | 38 #include "wtf/LinkedHashSet.h" |
39 #include "wtf/Noncopyable.h" | 39 #include "wtf/Noncopyable.h" |
40 | 40 |
41 namespace blink { | 41 namespace blink { |
42 | 42 |
43 class CustomElementUpgradeCandidateMap final : public CustomElementObserver { | 43 class V0CustomElementUpgradeCandidateMap final : public V0CustomElementObserver
{ |
44 WTF_MAKE_NONCOPYABLE(CustomElementUpgradeCandidateMap); | 44 WTF_MAKE_NONCOPYABLE(V0CustomElementUpgradeCandidateMap); |
45 public: | 45 public: |
46 static CustomElementUpgradeCandidateMap* create(); | 46 static V0CustomElementUpgradeCandidateMap* create(); |
47 ~CustomElementUpgradeCandidateMap() override; | 47 ~V0CustomElementUpgradeCandidateMap() override; |
48 | 48 |
49 // API for CustomElementRegistrationContext to save and take candidates | 49 // API for V0CustomElementRegistrationContext to save and take candidates |
50 | 50 |
51 typedef HeapLinkedHashSet<WeakMember<Element>> ElementSet; | 51 typedef HeapLinkedHashSet<WeakMember<Element>> ElementSet; |
52 | 52 |
53 void add(const CustomElementDescriptor&, Element*); | 53 void add(const V0CustomElementDescriptor&, Element*); |
54 ElementSet* takeUpgradeCandidatesFor(const CustomElementDescriptor&); | 54 ElementSet* takeUpgradeCandidatesFor(const V0CustomElementDescriptor&); |
55 | 55 |
56 DECLARE_VIRTUAL_TRACE(); | 56 DECLARE_VIRTUAL_TRACE(); |
57 | 57 |
58 private: | 58 private: |
59 CustomElementUpgradeCandidateMap() { } | 59 V0CustomElementUpgradeCandidateMap() { } |
60 | 60 |
61 void elementWasDestroyed(Element*) override; | 61 void elementWasDestroyed(Element*) override; |
62 | 62 |
63 typedef HeapHashMap<WeakMember<Element>, CustomElementDescriptor> UpgradeCan
didateMap; | 63 typedef HeapHashMap<WeakMember<Element>, V0CustomElementDescriptor> UpgradeC
andidateMap; |
64 UpgradeCandidateMap m_upgradeCandidates; | 64 UpgradeCandidateMap m_upgradeCandidates; |
65 | 65 |
66 typedef HeapHashMap<CustomElementDescriptor, Member<ElementSet>> UnresolvedD
efinitionMap; | 66 typedef HeapHashMap<V0CustomElementDescriptor, Member<ElementSet>> Unresolve
dDefinitionMap; |
67 UnresolvedDefinitionMap m_unresolvedDefinitions; | 67 UnresolvedDefinitionMap m_unresolvedDefinitions; |
68 }; | 68 }; |
69 | 69 |
70 } // namespace blink | 70 } // namespace blink |
71 | 71 |
72 #endif // CustomElementUpgradeCandidateMap_h | 72 #endif // V0CustomElementUpgradeCandidateMap_h |
OLD | NEW |