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 * 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 76 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
87 static Element* lastMatchingElement(const NodeListType&); | 87 static Element* lastMatchingElement(const NodeListType&); |
88 template <class NodeListType> | 88 template <class NodeListType> |
89 static Element* nextMatchingElement(const NodeListType&, Element& current); | 89 static Element* nextMatchingElement(const NodeListType&, Element& current); |
90 template <class NodeListType> | 90 template <class NodeListType> |
91 static Element* previousMatchingElement(const NodeListType&, Element& curren
t); | 91 static Element* previousMatchingElement(const NodeListType&, Element& curren
t); |
92 template <class NodeListType> | 92 template <class NodeListType> |
93 static Element* traverseMatchingElementsForwardToOffset(const NodeListType&,
unsigned offset, Element& currentElement, unsigned& currentOffset); | 93 static Element* traverseMatchingElementsForwardToOffset(const NodeListType&,
unsigned offset, Element& currentElement, unsigned& currentOffset); |
94 template <class NodeListType> | 94 template <class NodeListType> |
95 static Element* traverseMatchingElementsBackwardToOffset(const NodeListType&
, unsigned offset, Element& currentElement, unsigned& currentOffset); | 95 static Element* traverseMatchingElementsBackwardToOffset(const NodeListType&
, unsigned offset, Element& currentElement, unsigned& currentOffset); |
96 | 96 |
97 void trace(Visitor* visitor) { visitor->trace(m_ownerNode); } | 97 virtual void trace(Visitor* visitor) { visitor->trace(m_ownerNode); } |
98 | 98 |
99 private: | 99 private: |
100 RefPtrWillBeMember<ContainerNode> m_ownerNode; // Cannot be null. | 100 RefPtrWillBeMember<ContainerNode> m_ownerNode; // Cannot be null. |
101 const unsigned m_rootType : 1; | 101 const unsigned m_rootType : 1; |
102 const unsigned m_invalidationType : 4; | 102 const unsigned m_invalidationType : 4; |
103 const unsigned m_collectionType : 5; | 103 const unsigned m_collectionType : 5; |
104 }; | 104 }; |
105 | 105 |
106 ALWAYS_INLINE bool LiveNodeListBase::shouldInvalidateTypeOnAttributeChange(NodeL
istInvalidationType type, const QualifiedName& attrName) | 106 ALWAYS_INLINE bool LiveNodeListBase::shouldInvalidateTypeOnAttributeChange(NodeL
istInvalidationType type, const QualifiedName& attrName) |
107 { | 107 { |
(...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
187 for (Element* previous = previousMatchingElement(nodeList, currentElement);
previous; previous = previousMatchingElement(nodeList, *previous)) { | 187 for (Element* previous = previousMatchingElement(nodeList, currentElement);
previous; previous = previousMatchingElement(nodeList, *previous)) { |
188 if (--currentOffset == offset) | 188 if (--currentOffset == offset) |
189 return previous; | 189 return previous; |
190 } | 190 } |
191 return 0; | 191 return 0; |
192 } | 192 } |
193 | 193 |
194 } // namespace WebCore | 194 } // namespace WebCore |
195 | 195 |
196 #endif // LiveNodeListBase_h | 196 #endif // LiveNodeListBase_h |
OLD | NEW |