1 /* 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple 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 #ifndef DocumentOrderedMap_h 32 #define DocumentOrderedMap_h 33 34 #include "wtf/HashCountedSet.h" 35 #include "wtf/HashMap.h" 36 #include "wtf/Vector.h" 37 #include "wtf/text/StringImpl.h" 38 39 namespace WebCore { 40 41 class Element; 42 class TreeScope; 43 44 class DocumentOrderedMap { 45 public: 46 void add(StringImpl*, Element*); 47 void remove(StringImpl*, Element*); 48 void clear(); 49 50 bool contains(StringImpl*) const; 51 bool containsSingle(StringImpl*) const; 52 bool containsMultiple(StringImpl*) const; 53 54 // concrete instantiations of the get<>() method template 55 Element* getElementById(StringImpl*, const TreeScope*) const; 56 Element* getElementByName(StringImpl*, const TreeScope*) const; 57 Element* getElementByMapName(StringImpl*, const TreeScope*) const; 58 Element* getElementByLowercasedMapName(StringImpl*, const TreeScope*) const; 59 Element* getElementByLabelForAttribute(StringImpl*, const TreeScope*) const; 60 61 const Vector<Element*>* getAllElementsById(StringImpl*, const TreeScope*) const; 62 63 void checkConsistency() const; 64 65 private: 66 template<bool keyMatches(StringImpl*, Element*)> Element* get(StringImpl*, const TreeScope*) const; 67 68 struct MapEntry { 69 MapEntry() 70 : element(0) 71 , count(0) 72 { 73 } 74 explicit MapEntry(Element* firstElement) 75 : element(firstElement) 76 , count(1) 77 { 78 } 79 80 Element* element; 81 unsigned count; 82 Vector<Element*> orderedList; 83 }; 84 85 typedef HashMap<StringImpl*, MapEntry> Map; 86 87 mutable Map m_map; 88 }; 89 90 inline bool DocumentOrderedMap::containsSingle(StringImpl* id) const 91 { 92 Map::const_iterator it = m_map.find(id); 93 return it != m_map.end() && it->value.count == 1; 94 } 95 96 inline bool DocumentOrderedMap::contains(StringImpl* id) const 97 { 98 return m_map.contains(id); 99 } 100 101 inline bool DocumentOrderedMap::containsMultiple(StringImpl* id) const 102 { 103 Map::const_iterator it = m_map.find(id); 104 return it != m_map.end() && it->value.count > 1; 105 } 106 107 } // namespace WebCore 108 109 #endif // DocumentOrderedMap_h 110