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 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All r
ights reserved. | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All r
ights reserved. |
5 * Copyright (C) 2014 Samsung Electronics. All rights reserved. | 5 * Copyright (C) 2014 Samsung Electronics. 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 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
51 bool namedPropertyQuery(const AtomicString&, ExceptionState&); | 51 bool namedPropertyQuery(const AtomicString&, ExceptionState&); |
52 void namedPropertyEnumerator(Vector<String>& names, ExceptionState&); | 52 void namedPropertyEnumerator(Vector<String>& names, ExceptionState&); |
53 | 53 |
54 // Non-DOM API | 54 // Non-DOM API |
55 void namedItems(const AtomicString& name, Vector<RefPtr<Element> >&) const; | 55 void namedItems(const AtomicString& name, Vector<RefPtr<Element> >&) const; |
56 bool isEmpty() const { return m_collectionIndexCache.isEmpty(*this); } | 56 bool isEmpty() const { return m_collectionIndexCache.isEmpty(*this); } |
57 bool hasExactlyOneItem() const { return m_collectionIndexCache.hasExactlyOne
Node(*this); } | 57 bool hasExactlyOneItem() const { return m_collectionIndexCache.hasExactlyOne
Node(*this); } |
58 | 58 |
59 // CollectionIndexCache API. | 59 // CollectionIndexCache API. |
60 bool canTraverseBackward() const { return !overridesItemAfter(); } | 60 bool canTraverseBackward() const { return !overridesItemAfter(); } |
61 Element* itemBefore(const Element* previousItem) const; | |
62 Element* traverseToFirstElement() const; | 61 Element* traverseToFirstElement() const; |
| 62 Element* traverseToLastElement() const; |
63 Element* traverseForwardToOffset(unsigned offset, Element& currentElement, u
nsigned& currentOffset) const; | 63 Element* traverseForwardToOffset(unsigned offset, Element& currentElement, u
nsigned& currentOffset) const; |
| 64 Element* traverseBackwardToOffset(unsigned offset, Element& currentElement,
unsigned& currentOffset) const; |
64 | 65 |
65 protected: | 66 protected: |
66 HTMLCollection(ContainerNode& base, CollectionType, ItemAfterOverrideType); | 67 HTMLCollection(ContainerNode& base, CollectionType, ItemAfterOverrideType); |
67 | 68 |
68 class NamedItemCache { | 69 class NamedItemCache { |
69 public: | 70 public: |
70 static PassOwnPtr<NamedItemCache> create() | 71 static PassOwnPtr<NamedItemCache> create() |
71 { | 72 { |
72 return adoptPtr(new NamedItemCache); | 73 return adoptPtr(new NamedItemCache); |
73 } | 74 } |
(...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
139 const unsigned m_shouldOnlyIncludeDirectChildren : 1; | 140 const unsigned m_shouldOnlyIncludeDirectChildren : 1; |
140 mutable OwnPtr<NamedItemCache> m_namedItemCache; | 141 mutable OwnPtr<NamedItemCache> m_namedItemCache; |
141 mutable CollectionIndexCache<HTMLCollection, Element> m_collectionIndexCache
; | 142 mutable CollectionIndexCache<HTMLCollection, Element> m_collectionIndexCache
; |
142 | 143 |
143 friend class LiveNodeListBase; | 144 friend class LiveNodeListBase; |
144 }; | 145 }; |
145 | 146 |
146 } // namespace | 147 } // namespace |
147 | 148 |
148 #endif | 149 #endif |
OLD | NEW |