DynamicNodeList.cpp [plain text]
#include "config.h"
#include "DynamicNodeList.h"
#include "Document.h"
#include "Element.h"
namespace WebCore {
DynamicSubtreeNodeList::DynamicSubtreeNodeList(PassRefPtr<Node> node)
: DynamicNodeList(node)
{
}
DynamicSubtreeNodeList::~DynamicSubtreeNodeList()
{
}
unsigned DynamicSubtreeNodeList::length() const
{
if (m_caches.isLengthCacheValid)
return m_caches.cachedLength;
unsigned length = 0;
for (Node* n = node()->firstChild(); n; n = n->traverseNextNode(rootNode()))
length += n->isElementNode() && nodeMatches(static_cast<Element*>(n));
m_caches.cachedLength = length;
m_caches.isLengthCacheValid = true;
return length;
}
Node* DynamicSubtreeNodeList::itemForwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const
{
ASSERT(remainingOffset >= 0);
for (Node* n = start; n; n = n->traverseNextNode(rootNode())) {
if (n->isElementNode() && nodeMatches(static_cast<Element*>(n))) {
if (!remainingOffset) {
m_caches.lastItem = n;
m_caches.lastItemOffset = offset;
m_caches.isItemCacheValid = true;
return n;
}
--remainingOffset;
}
}
return 0; }
Node* DynamicSubtreeNodeList::itemBackwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const
{
ASSERT(remainingOffset < 0);
for (Node* n = start; n; n = n->traversePreviousNode(rootNode())) {
if (n->isElementNode() && nodeMatches(static_cast<Element*>(n))) {
if (!remainingOffset) {
m_caches.lastItem = n;
m_caches.lastItemOffset = offset;
m_caches.isItemCacheValid = true;
return n;
}
++remainingOffset;
}
}
return 0; }
Node* DynamicSubtreeNodeList::item(unsigned offset) const
{
int remainingOffset = offset;
Node* start = node()->firstChild();
if (m_caches.isItemCacheValid) {
if (offset == m_caches.lastItemOffset)
return m_caches.lastItem;
if (offset > m_caches.lastItemOffset || m_caches.lastItemOffset - offset < offset) {
start = m_caches.lastItem;
remainingOffset -= m_caches.lastItemOffset;
}
}
if (remainingOffset < 0)
return itemBackwardsFromCurrent(start, offset, remainingOffset);
return itemForwardsFromCurrent(start, offset, remainingOffset);
}
Node* DynamicNodeList::itemWithName(const AtomicString& elementId) const
{
if (node()->isDocumentNode() || node()->inDocument()) {
Element* node = this->node()->treeScope()->getElementById(elementId);
if (node && nodeMatches(node) && node->isDescendantOf(this->node()))
return node;
if (!node)
return 0;
}
unsigned length = this->length();
for (unsigned i = 0; i < length; i++) {
Node* node = item(i);
if (node->hasID() && static_cast<Element*>(node)->idForStyleResolution() == elementId)
return node;
}
return 0;
}
}