#ifndef HTMLCollection_h
#define HTMLCollection_h
#include "Node.h"
#include "CollectionType.h"
#include <wtf/Forward.h>
#include <wtf/HashMap.h>
#include <wtf/PassOwnPtr.h>
#include <wtf/Vector.h>
namespace WebCore {
class Document;
class Element;
class NodeList;
class HTMLCollection {
public:
static PassOwnPtr<HTMLCollection> create(Node* base, CollectionType);
virtual ~HTMLCollection();
void ref() { m_base->ref(); }
void deref() { m_base->deref(); }
unsigned length() const;
virtual Node* item(unsigned index) const;
virtual Node* nextItem() const;
virtual Node* namedItem(const AtomicString& name) const;
Node* firstItem() const;
bool hasNamedItem(const AtomicString& name) const;
void namedItems(const AtomicString& name, Vector<RefPtr<Node> >&) const;
PassRefPtr<NodeList> tags(const String&);
Node* base() const { return m_base; }
CollectionType type() const { return static_cast<CollectionType>(m_type); }
protected:
HTMLCollection(Node* base, CollectionType);
void invalidateCacheIfNeeded() const;
virtual void updateNameCache() const;
virtual Element* itemAfter(Element*) const;
typedef HashMap<AtomicStringImpl*, OwnPtr<Vector<Element*> > > NodeCacheMap;
static void append(NodeCacheMap&, const AtomicString&, Element*);
mutable struct {
NodeCacheMap idCache;
NodeCacheMap nameCache;
uint64_t version;
Element* current;
unsigned position;
unsigned length;
int elementsArrayPosition;
bool hasLength;
bool hasNameCache;
void clear()
{
idCache.clear();
nameCache.clear();
version = 0;
current = 0;
position = 0;
length = 0;
elementsArrayPosition = 0;
hasLength = false;
hasNameCache = false;
}
} m_cache;
private:
static bool shouldIncludeChildren(CollectionType);
bool checkForNameMatch(Element*, bool checkName, const AtomicString& name) const;
virtual unsigned calcLength() const;
bool isAcceptableElement(Element*) const;
bool m_includeChildren : 1;
unsigned m_type : 5;
Node* m_base;
};
}
#endif