2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
3 * (C) 1999 Antti Koivisto (koivisto@kde.org)
4 * (C) 2001 Dirk Mueller (mueller@kde.org)
5 * Copyright (C) 2004, 2006, 2007 Apple Inc. All rights reserved.
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Library General Public
9 * License as published by the Free Software Foundation; either
10 * version 2 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Library General Public License for more details.
17 * You should have received a copy of the GNU Library General Public License
18 * along with this library; see the file COPYING.LIB. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 * Boston, MA 02110-1301, USA.
24 #ifndef LiveNodeList_h
25 #define LiveNodeList_h
27 #include "core/dom/LiveNodeListBase.h"
28 #include "core/dom/NodeList.h"
29 #include "core/html/CollectionIndexCache.h"
30 #include "core/html/CollectionType.h"
31 #include "platform/heap/Handle.h"
32 #include "wtf/PassRefPtr.h"
38 class LiveNodeList : public NodeList, public LiveNodeListBase {
39 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(LiveNodeList);
41 LiveNodeList(ContainerNode& ownerNode, CollectionType collectionType, NodeListInvalidationType invalidationType, NodeListRootType rootType = NodeListIsRootedAtNode)
42 : LiveNodeListBase(ownerNode, rootType, invalidationType, collectionType) { }
44 virtual unsigned length() const OVERRIDE FINAL;
45 virtual Element* item(unsigned offset) const OVERRIDE FINAL;
46 virtual bool elementMatches(const Element&) const = 0;
48 virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE FINAL;
49 void invalidateCacheForAttribute(const QualifiedName*) const;
51 // Collection IndexCache API.
52 bool canTraverseBackward() const { return true; }
53 Element* traverseToFirstElement() const;
54 Element* traverseToLastElement() const;
55 Element* traverseForwardToOffset(unsigned offset, Element& currentNode, unsigned& currentOffset) const;
56 Element* traverseBackwardToOffset(unsigned offset, Element& currentNode, unsigned& currentOffset) const;
58 virtual void trace(Visitor*) OVERRIDE;
61 virtual Node* virtualOwnerNode() const OVERRIDE FINAL;
63 mutable CollectionIndexCache<LiveNodeList, Element> m_collectionIndexCache;
66 DEFINE_TYPE_CASTS(LiveNodeList, LiveNodeListBase, list, isLiveNodeListType(list->type()), isLiveNodeListType(list.type()));
68 inline void LiveNodeList::invalidateCacheForAttribute(const QualifiedName* attrName) const
70 if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *attrName))
76 #endif // LiveNodeList_h