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 "config.h" |
| 32 |
| 33 #include "core/dom/CustomElementUpgradeCandidateMap.h" |
| 34 |
| 35 namespace WebCore { |
| 36 |
| 37 void CustomElementUpgradeCandidateMap::add(CustomElementDefinition::CustomElemen
tKind kind, const AtomicString& type, Element* element) |
| 38 { |
| 39 m_unresolvedElements.add(element, RequiredDefinition(kind, type)); |
| 40 |
| 41 UnresolvedDefinitionMap::iterator it = m_unresolvedDefinitions.find(type); |
| 42 if (it == m_unresolvedDefinitions.end()) |
| 43 it = m_unresolvedDefinitions.add(type, ElementSet()).iterator; |
| 44 it->value.add(element); |
| 45 } |
| 46 |
| 47 bool CustomElementUpgradeCandidateMap::contains(Element* element) const |
| 48 { |
| 49 return m_unresolvedElements.contains(element); |
| 50 } |
| 51 |
| 52 void CustomElementUpgradeCandidateMap::remove(Element* element) |
| 53 { |
| 54 UnresolvedElementMap::iterator it = m_unresolvedElements.find(element); |
| 55 if (it == m_unresolvedElements.end()) |
| 56 return; |
| 57 |
| 58 const AtomicString& type = it->value.second; |
| 59 m_unresolvedDefinitions.get(type).remove(element); |
| 60 m_unresolvedElements.remove(it); |
| 61 } |
| 62 |
| 63 CustomElementUpgradeCandidateMap::ElementSet CustomElementUpgradeCandidateMap::t
akeUpgradeCandidatesFor(CustomElementDefinition* definition) |
| 64 { |
| 65 UnresolvedDefinitionMap::iterator it = m_unresolvedDefinitions.find(definiti
on->type()); |
| 66 if (it == m_unresolvedDefinitions.end()) |
| 67 return ElementSet(); |
| 68 |
| 69 const ElementSet& candidatesForThisType = it->value; |
| 70 ElementSet matchingCandidates; |
| 71 |
| 72 // Filter the set based on whether the definition matches |
| 73 for (ElementSet::const_iterator candidate = candidatesForThisType.begin(); c
andidate != candidatesForThisType.end(); ++candidate) { |
| 74 if (matches(definition, *candidate)) { |
| 75 matchingCandidates.add(*candidate); |
| 76 m_unresolvedElements.remove(*candidate); |
| 77 } |
| 78 } |
| 79 |
| 80 m_unresolvedDefinitions.remove(it); |
| 81 return matchingCandidates; |
| 82 } |
| 83 |
| 84 bool CustomElementUpgradeCandidateMap::matches(CustomElementDefinition* definiti
on, Element* element) |
| 85 { |
| 86 ASSERT(m_unresolvedElements.contains(element)); |
| 87 const RequiredDefinition& requirement = m_unresolvedElements.get(element); |
| 88 return definition->kind() == requirement.first && definition->type() == requ
irement.second && definition->namespaceURI() == element->namespaceURI() && defin
ition->name() == element->localName(); |
| 89 } |
| 90 |
| 91 } |
OLD | NEW |