| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights |
| 3 * reserved. | 3 * reserved. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions are | 6 * modification, are permitted provided that the following conditions are |
| 7 * met: | 7 * met: |
| 8 * | 8 * |
| 9 * * Redistributions of source code must retain the above copyright | 9 * * Redistributions of source code must retain the above copyright |
| 10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 30 */ | 30 */ |
| 31 | 31 |
| 32 #ifndef DocumentOrderedMap_h | 32 #ifndef DocumentOrderedMap_h |
| 33 #define DocumentOrderedMap_h | 33 #define DocumentOrderedMap_h |
| 34 | 34 |
| 35 #include "platform/heap/Handle.h" | 35 #include "platform/heap/Handle.h" |
| 36 #include "wtf/Allocator.h" | 36 #include "platform/wtf/Allocator.h" |
| 37 #include "wtf/Forward.h" | 37 #include "platform/wtf/Forward.h" |
| 38 #include "wtf/HashMap.h" | 38 #include "platform/wtf/HashMap.h" |
| 39 #include "wtf/text/AtomicString.h" | 39 #include "platform/wtf/text/AtomicString.h" |
| 40 #include "wtf/text/AtomicStringHash.h" | 40 #include "platform/wtf/text/AtomicStringHash.h" |
| 41 #include "wtf/text/StringImpl.h" | 41 #include "platform/wtf/text/StringImpl.h" |
| 42 | 42 |
| 43 namespace blink { | 43 namespace blink { |
| 44 | 44 |
| 45 class Element; | 45 class Element; |
| 46 class HTMLSlotElement; | 46 class HTMLSlotElement; |
| 47 class TreeScope; | 47 class TreeScope; |
| 48 | 48 |
| 49 class DocumentOrderedMap : public GarbageCollected<DocumentOrderedMap> { | 49 class DocumentOrderedMap : public GarbageCollected<DocumentOrderedMap> { |
| 50 public: | 50 public: |
| 51 static DocumentOrderedMap* Create(); | 51 static DocumentOrderedMap* Create(); |
| (...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 115 } | 115 } |
| 116 | 116 |
| 117 inline bool DocumentOrderedMap::ContainsMultiple(const AtomicString& id) const { | 117 inline bool DocumentOrderedMap::ContainsMultiple(const AtomicString& id) const { |
| 118 Map::const_iterator it = map_.Find(id); | 118 Map::const_iterator it = map_.Find(id); |
| 119 return it != map_.end() && it->value->count > 1; | 119 return it != map_.end() && it->value->count > 1; |
| 120 } | 120 } |
| 121 | 121 |
| 122 } // namespace blink | 122 } // namespace blink |
| 123 | 123 |
| 124 #endif // DocumentOrderedMap_h | 124 #endif // DocumentOrderedMap_h |
| OLD | NEW |