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 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
122 | 122 |
123 ALWAYS_INLINE NodeListRootType rootType() const { return static_cast<NodeLis
tRootType>(m_rootType); } | 123 ALWAYS_INLINE NodeListRootType rootType() const { return static_cast<NodeLis
tRootType>(m_rootType); } |
124 | 124 |
125 bool hasNameCache() const { return m_isNameCacheValid; } | 125 bool hasNameCache() const { return m_isNameCacheValid; } |
126 void setHasNameCache() const { m_isNameCacheValid = true; } | 126 void setHasNameCache() const { m_isNameCacheValid = true; } |
127 | 127 |
128 bool shouldOnlyIncludeDirectChildren() const { return m_shouldOnlyIncludeDir
ectChildren; } | 128 bool shouldOnlyIncludeDirectChildren() const { return m_shouldOnlyIncludeDir
ectChildren; } |
129 | 129 |
130 private: | 130 private: |
131 Node* itemBeforeOrAfterCachedItem(unsigned offset, ContainerNode* root) cons
t; | 131 Node* itemBeforeOrAfterCachedItem(unsigned offset, ContainerNode* root) cons
t; |
132 Element* traverseLiveNodeListFirstElement(ContainerNode& root) const; | |
133 bool isLastItemCloserThanLastOrCachedItem(unsigned offset) const; | 132 bool isLastItemCloserThanLastOrCachedItem(unsigned offset) const; |
134 bool isFirstItemCloserThanCachedItem(unsigned offset) const; | 133 bool isFirstItemCloserThanCachedItem(unsigned offset) const; |
135 Node* iterateForPreviousNode(Node* current) const; | 134 Node* iterateForPreviousNode(Node* current) const; |
136 Node* itemBefore(Node* previousItem) const; | 135 Node* itemBefore(Node* previousItem) const; |
137 void invalidateIdNameCacheMaps() const; | 136 void invalidateIdNameCacheMaps() const; |
138 | 137 |
139 RefPtr<Node> m_ownerNode; | 138 RefPtr<Node> m_ownerNode; |
140 mutable Node* m_cachedItem; | 139 mutable Node* m_cachedItem; |
141 mutable unsigned m_cachedLength; | 140 mutable unsigned m_cachedLength; |
142 mutable unsigned m_cachedItemOffset; | 141 mutable unsigned m_cachedItemOffset; |
(...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
182 LiveNodeList(PassRefPtr<Node> ownerNode, CollectionType collectionType, Node
ListInvalidationType invalidationType, NodeListRootType rootType = NodeListIsRoo
tedAtNode) | 181 LiveNodeList(PassRefPtr<Node> ownerNode, CollectionType collectionType, Node
ListInvalidationType invalidationType, NodeListRootType rootType = NodeListIsRoo
tedAtNode) |
183 : LiveNodeListBase(ownerNode.get(), rootType, invalidationType, collecti
onType == ChildNodeListType, | 182 : LiveNodeListBase(ownerNode.get(), rootType, invalidationType, collecti
onType == ChildNodeListType, |
184 collectionType, DoesNotOverrideItemAfter) | 183 collectionType, DoesNotOverrideItemAfter) |
185 { } | 184 { } |
186 | 185 |
187 virtual unsigned length() const OVERRIDE FINAL { return LiveNodeListBase::le
ngth(); } | 186 virtual unsigned length() const OVERRIDE FINAL { return LiveNodeListBase::le
ngth(); } |
188 virtual Node* item(unsigned offset) const OVERRIDE FINAL { return LiveNodeLi
stBase::item(offset); } | 187 virtual Node* item(unsigned offset) const OVERRIDE FINAL { return LiveNodeLi
stBase::item(offset); } |
189 virtual Node* namedItem(const AtomicString&) const OVERRIDE FINAL; | 188 virtual Node* namedItem(const AtomicString&) const OVERRIDE FINAL; |
190 virtual bool nodeMatches(Element*) const = 0; | 189 virtual bool nodeMatches(Element*) const = 0; |
191 | 190 |
| 191 Node* traverseToFirstElement(ContainerNode& root) const; |
192 Node* traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset, ContainerNode* root) const; | 192 Node* traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset, ContainerNode* root) const; |
193 | 193 |
194 private: | 194 private: |
195 virtual bool isLiveNodeList() const OVERRIDE FINAL { return true; } | 195 virtual bool isLiveNodeList() const OVERRIDE FINAL { return true; } |
196 }; | 196 }; |
197 | 197 |
198 } // namespace WebCore | 198 } // namespace WebCore |
199 | 199 |
200 #endif // LiveNodeList_h | 200 #endif // LiveNodeList_h |
OLD | NEW |