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, 2007 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004, 2007 Apple Inc. All rights reserved. |
6 * Copyright (C) 2014 Samsung Electronics. All rights reserved. | 6 * Copyright (C) 2014 Samsung Electronics. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
46 virtual Node* item(unsigned index) const OVERRIDE { return m_collectionIndex
Cache.nodeAt(*this, index); } | 46 virtual Node* item(unsigned index) const OVERRIDE { return m_collectionIndex
Cache.nodeAt(*this, index); } |
47 | 47 |
48 // Non-DOM API. | 48 // Non-DOM API. |
49 void invalidateCache() { m_collectionIndexCache.invalidate(); } | 49 void invalidateCache() { m_collectionIndexCache.invalidate(); } |
50 ContainerNode& ownerNode() const { return *m_parent; } | 50 ContainerNode& ownerNode() const { return *m_parent; } |
51 | 51 |
52 ContainerNode& rootNode() const { return ownerNode(); } | 52 ContainerNode& rootNode() const { return ownerNode(); } |
53 | 53 |
54 // CollectionIndexCache API. | 54 // CollectionIndexCache API. |
55 bool canTraverseBackward() const { return true; } | 55 bool canTraverseBackward() const { return true; } |
56 Node* traverseToFirstElement() const { return rootNode().firstChild(); } | 56 Node* traverseToFirst() const { return rootNode().firstChild(); } |
57 Node* traverseToLastElement() const { return rootNode().lastChild(); } | 57 Node* traverseToLast() const { return rootNode().lastChild(); } |
58 Node* traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset) const; | 58 Node* traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset) const; |
59 Node* traverseBackwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset) const; | 59 Node* traverseBackwardToOffset(unsigned offset, Node& currentNode, unsigned&
currentOffset) const; |
60 | 60 |
61 virtual void trace(Visitor*) OVERRIDE; | 61 virtual void trace(Visitor*) OVERRIDE; |
62 | 62 |
63 private: | 63 private: |
64 explicit ChildNodeList(ContainerNode& rootNode); | 64 explicit ChildNodeList(ContainerNode& rootNode); |
65 | 65 |
66 virtual bool isChildNodeList() const OVERRIDE { return true; } | 66 virtual bool isChildNodeList() const OVERRIDE { return true; } |
67 virtual Node* virtualOwnerNode() const OVERRIDE; | 67 virtual Node* virtualOwnerNode() const OVERRIDE; |
68 | 68 |
69 RefPtrWillBeMember<ContainerNode> m_parent; | 69 RefPtrWillBeMember<ContainerNode> m_parent; |
70 mutable CollectionIndexCache<ChildNodeList, Node> m_collectionIndexCache; | 70 mutable CollectionIndexCache<ChildNodeList, Node> m_collectionIndexCache; |
71 }; | 71 }; |
72 | 72 |
73 DEFINE_TYPE_CASTS(ChildNodeList, NodeList, nodeList, nodeList->isChildNodeList()
, nodeList.isChildNodeList()); | 73 DEFINE_TYPE_CASTS(ChildNodeList, NodeList, nodeList, nodeList->isChildNodeList()
, nodeList.isChildNodeList()); |
74 | 74 |
75 } // namespace blink | 75 } // namespace blink |
76 | 76 |
77 #endif // ChildNodeList_h | 77 #endif // ChildNodeList_h |
OLD | NEW |