| 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, 2008, 2010 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004, 2006, 2007, 2008, 2010 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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 57 unsigned LiveNodeList::length() const | 57 unsigned LiveNodeList::length() const |
| 58 { | 58 { |
| 59 return m_collectionIndexCache.nodeCount(*this); | 59 return m_collectionIndexCache.nodeCount(*this); |
| 60 } | 60 } |
| 61 | 61 |
| 62 Element* LiveNodeList::item(unsigned offset) const | 62 Element* LiveNodeList::item(unsigned offset) const |
| 63 { | 63 { |
| 64 return m_collectionIndexCache.nodeAt(*this, offset); | 64 return m_collectionIndexCache.nodeAt(*this, offset); |
| 65 } | 65 } |
| 66 | 66 |
| 67 Element* LiveNodeList::traverseToFirstElement() const | 67 Element* LiveNodeList::traverseToFirst() const |
| 68 { | 68 { |
| 69 return ElementTraversal::firstWithin(rootNode(), IsMatch(*this)); | 69 return ElementTraversal::firstWithin(rootNode(), IsMatch(*this)); |
| 70 } | 70 } |
| 71 | 71 |
| 72 Element* LiveNodeList::traverseToLastElement() const | 72 Element* LiveNodeList::traverseToLast() const |
| 73 { | 73 { |
| 74 return ElementTraversal::lastWithin(rootNode(), IsMatch(*this)); | 74 return ElementTraversal::lastWithin(rootNode(), IsMatch(*this)); |
| 75 } | 75 } |
| 76 | 76 |
| 77 Element* LiveNodeList::traverseForwardToOffset(unsigned offset, Element& current
Element, unsigned& currentOffset) const | 77 Element* LiveNodeList::traverseForwardToOffset(unsigned offset, Element& current
Element, unsigned& currentOffset) const |
| 78 { | 78 { |
| 79 return traverseMatchingElementsForwardToOffset(currentElement, &rootNode(),
offset, currentOffset, IsMatch(*this)); | 79 return traverseMatchingElementsForwardToOffset(currentElement, &rootNode(),
offset, currentOffset, IsMatch(*this)); |
| 80 } | 80 } |
| 81 | 81 |
| 82 Element* LiveNodeList::traverseBackwardToOffset(unsigned offset, Element& curren
tElement, unsigned& currentOffset) const | 82 Element* LiveNodeList::traverseBackwardToOffset(unsigned offset, Element& curren
tElement, unsigned& currentOffset) const |
| 83 { | 83 { |
| 84 return traverseMatchingElementsBackwardToOffset(currentElement, &rootNode(),
offset, currentOffset, IsMatch(*this)); | 84 return traverseMatchingElementsBackwardToOffset(currentElement, &rootNode(),
offset, currentOffset, IsMatch(*this)); |
| 85 } | 85 } |
| 86 | 86 |
| 87 void LiveNodeList::trace(Visitor* visitor) | 87 void LiveNodeList::trace(Visitor* visitor) |
| 88 { | 88 { |
| 89 visitor->trace(m_collectionIndexCache); | 89 visitor->trace(m_collectionIndexCache); |
| 90 LiveNodeListBase::trace(visitor); | 90 LiveNodeListBase::trace(visitor); |
| 91 NodeList::trace(visitor); | 91 NodeList::trace(visitor); |
| 92 } | 92 } |
| 93 | 93 |
| 94 } // namespace blink | 94 } // namespace blink |
| OLD | NEW |