#ifndef DynamicNodeList_h
#define DynamicNodeList_h
#include "NodeList.h"
#include <wtf/Forward.h>
#include <wtf/RefPtr.h>
namespace WebCore {
class Element;
class Node;
class DynamicNodeList : public NodeList {
public:
DynamicNodeList(PassRefPtr<Node> node)
: m_node(node)
{ }
virtual ~DynamicNodeList() { }
virtual unsigned length() const = 0;
virtual Node* item(unsigned index) const = 0;
virtual Node* itemWithName(const AtomicString&) const;
Node* node() const { return m_node.get(); }
void invalidateCache() { m_caches.reset(); }
protected:
virtual bool nodeMatches(Element*) const = 0;
struct Caches {
Caches() { reset(); }
void reset()
{
lastItem = 0;
isLengthCacheValid = false;
isItemCacheValid = false;
}
Node* lastItem;
unsigned cachedLength;
unsigned lastItemOffset;
bool isLengthCacheValid : 1;
bool isItemCacheValid : 1;
};
mutable Caches m_caches;
RefPtr<Node> m_node;
private:
virtual bool isDynamicNodeList() const OVERRIDE { return true; }
};
class DynamicSubtreeNodeList : public DynamicNodeList {
public:
virtual ~DynamicSubtreeNodeList();
virtual unsigned length() const OVERRIDE;
virtual Node* item(unsigned index) const OVERRIDE;
Node* rootNode() const { return node(); }
protected:
DynamicSubtreeNodeList(PassRefPtr<Node> rootNode);
private:
using DynamicNodeList::invalidateCache;
friend struct NodeListsNodeData;
Node* itemForwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const;
Node* itemBackwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const;
};
}
#endif // DynamicNodeList_h