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 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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) const OVERRIDE FINAL; | 48 virtual void invalidateCache(Document* oldDocument) const OVERRIDE FINAL; |
49 bool shouldOnlyIncludeDirectChildren() const { return false; } | 49 bool shouldOnlyIncludeDirectChildren() const { return false; } |
50 | 50 |
51 // Collection IndexCache API. | 51 // Collection IndexCache API. |
52 bool canTraverseBackward() const { return true; } | 52 bool canTraverseBackward() const { return true; } |
53 Element* itemBefore(const Element* previousItem) const; | 53 Element* itemBefore(const Element* previousItem) const; |
54 Element* traverseToFirstElement(const ContainerNode& root) const; | 54 Element* traverseToFirstElement() const; |
55 Element* traverseForwardToOffset(unsigned offset, Element& currentNode, unsi
gned& currentOffset, const ContainerNode& root) const; | 55 Element* traverseForwardToOffset(unsigned offset, Element& currentNode, unsi
gned& currentOffset) const; |
56 | 56 |
57 private: | 57 private: |
58 virtual Node* virtualOwnerNode() const OVERRIDE FINAL; | 58 virtual Node* virtualOwnerNode() const OVERRIDE FINAL; |
59 | 59 |
60 mutable CollectionIndexCache<LiveNodeList, Element> m_collectionIndexCache; | 60 mutable CollectionIndexCache<LiveNodeList, Element> m_collectionIndexCache; |
61 }; | 61 }; |
62 | 62 |
63 } // namespace WebCore | 63 } // namespace WebCore |
64 | 64 |
65 #endif // LiveNodeList_h | 65 #endif // LiveNodeList_h |
OLD | NEW |