| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2006, 2007 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004, 2006, 2007 Apple Inc. All rights reserved. |
| 6 * | 6 * |
| 7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
| 8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
| 9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
| 10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 * | 21 * |
| 22 */ | 22 */ |
| 23 | 23 |
| 24 #ifndef LiveNodeList_h | 24 #ifndef LiveNodeList_h |
| 25 #define LiveNodeList_h | 25 #define LiveNodeList_h |
| 26 | 26 |
| 27 #include "core/dom/LiveNodeListBase.h" | 27 #include "core/dom/LiveNodeListBase.h" |
| 28 #include "core/dom/NodeList.h" | 28 #include "core/dom/NodeList.h" |
| 29 #include "core/html/CollectionIndexCache.h" | 29 #include "core/html/CollectionIndexCache.h" |
| 30 #include "core/html/CollectionType.h" | 30 #include "core/html/CollectionType.h" |
| 31 #include "platform/heap/Handle.h" |
| 31 #include "wtf/PassRefPtr.h" | 32 #include "wtf/PassRefPtr.h" |
| 32 | 33 |
| 33 namespace WebCore { | 34 namespace WebCore { |
| 34 | 35 |
| 35 class Element; | 36 class Element; |
| 36 | 37 |
| 37 class LiveNodeList : public NodeList, public LiveNodeListBase { | 38 class LiveNodeList : public NodeList, public LiveNodeListBase { |
| 39 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(LiveNodeList); |
| 38 public: | 40 public: |
| 39 LiveNodeList(ContainerNode& ownerNode, CollectionType collectionType, NodeLi
stInvalidationType invalidationType, NodeListRootType rootType = NodeListIsRoote
dAtNode) | 41 LiveNodeList(ContainerNode& ownerNode, CollectionType collectionType, NodeLi
stInvalidationType invalidationType, NodeListRootType rootType = NodeListIsRoote
dAtNode) |
| 40 : LiveNodeListBase(ownerNode, rootType, invalidationType, | 42 : LiveNodeListBase(ownerNode, rootType, invalidationType, collectionType
) { } |
| 41 collectionType) | |
| 42 { } | |
| 43 | 43 |
| 44 virtual unsigned length() const OVERRIDE FINAL { return m_collectionIndexCac
he.nodeCount(*this); } | 44 virtual unsigned length() const OVERRIDE FINAL { return m_collectionIndexCac
he.nodeCount(*this); } |
| 45 virtual Node* item(unsigned offset) const OVERRIDE FINAL { return m_collecti
onIndexCache.nodeAt(*this, offset); } | 45 virtual Node* item(unsigned offset) const OVERRIDE FINAL { return m_collecti
onIndexCache.nodeAt(*this, offset); } |
| 46 virtual bool elementMatches(const Element&) const = 0; | 46 virtual bool elementMatches(const Element&) const = 0; |
| 47 | 47 |
| 48 virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE FINAL
; | 48 virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE FINAL
; |
| 49 void invalidateCacheForAttribute(const QualifiedName*) const; | 49 void invalidateCacheForAttribute(const QualifiedName*) const; |
| 50 | 50 |
| 51 bool shouldOnlyIncludeDirectChildren() const { return false; } | 51 bool shouldOnlyIncludeDirectChildren() const { return false; } |
| 52 | 52 |
| 53 // Collection IndexCache API. | 53 // Collection IndexCache API. |
| 54 bool canTraverseBackward() const { return true; } | 54 bool canTraverseBackward() const { return true; } |
| 55 Element* traverseToFirstElement() const; | 55 Element* traverseToFirstElement() const; |
| 56 Element* traverseToLastElement() const; | 56 Element* traverseToLastElement() const; |
| 57 Element* traverseForwardToOffset(unsigned offset, Element& currentNode, unsi
gned& currentOffset) const; | 57 Element* traverseForwardToOffset(unsigned offset, Element& currentNode, unsi
gned& currentOffset) const; |
| 58 Element* traverseBackwardToOffset(unsigned offset, Element& currentNode, uns
igned& currentOffset) const; | 58 Element* traverseBackwardToOffset(unsigned offset, Element& currentNode, uns
igned& currentOffset) const; |
| 59 | 59 |
| 60 virtual void trace(Visitor*) OVERRIDE; |
| 61 |
| 60 private: | 62 private: |
| 61 virtual Node* virtualOwnerNode() const OVERRIDE FINAL; | 63 virtual Node* virtualOwnerNode() const OVERRIDE FINAL; |
| 62 | 64 |
| 63 mutable CollectionIndexCache<LiveNodeList, Element> m_collectionIndexCache; | 65 mutable CollectionIndexCache<LiveNodeList, Element> m_collectionIndexCache; |
| 64 }; | 66 }; |
| 65 | 67 |
| 66 DEFINE_TYPE_CASTS(LiveNodeList, LiveNodeListBase, list, isLiveNodeListType(list-
>type()), isLiveNodeListType(list.type())); | 68 DEFINE_TYPE_CASTS(LiveNodeList, LiveNodeListBase, list, isLiveNodeListType(list-
>type()), isLiveNodeListType(list.type())); |
| 67 | 69 |
| 68 inline void LiveNodeList::invalidateCacheForAttribute(const QualifiedName* attrN
ame) const | 70 inline void LiveNodeList::invalidateCacheForAttribute(const QualifiedName* attrN
ame) const |
| 69 { | 71 { |
| 70 if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *
attrName)) | 72 if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *
attrName)) |
| 71 invalidateCache(); | 73 invalidateCache(); |
| 72 } | 74 } |
| 73 | 75 |
| 74 } // namespace WebCore | 76 } // namespace WebCore |
| 75 | 77 |
| 76 #endif // LiveNodeList_h | 78 #endif // LiveNodeList_h |
| OLD | NEW |