#include "config.h"
#include "NodeIterator.h"
#include "Document.h"
#include "ExceptionCode.h"
#include "NodeFilter.h"
namespace WebCore {
NodeIterator::NodeIterator(Node* rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
: Traversal(rootNode, whatToShow, filter, expandEntityReferences)
, m_beforeReferenceNode(true)
, m_detached(false)
, m_doc(rootNode ? rootNode->document() : 0)
{
if (document())
document()->attachNodeIterator(this);
}
NodeIterator::~NodeIterator()
{
if (document())
document()->detachNodeIterator(this);
}
Node* NodeIterator::findNextNode(Node* node) const
{
while ((node = node->traverseNextNode(root()))) {
if (acceptNode(node) == NodeFilter::FILTER_ACCEPT)
break;
}
return node;
}
Node* NodeIterator::nextNode(ExceptionCode& ec)
{
if (detached()) {
ec = INVALID_STATE_ERR;
return 0;
}
Node* node = referenceNode() ? referenceNode() : root();
if (!pointerBeforeReferenceNode() || acceptNode(node) != NodeFilter::FILTER_ACCEPT)
node = findNextNode(node);
if (node)
setReferenceNode(node);
setPointerBeforeReferenceNode(false);
return node;
}
Node* NodeIterator::findPreviousNode(Node* node) const
{
while ((node = node->traversePreviousNode(root()))) {
if (acceptNode(node) == NodeFilter::FILTER_ACCEPT)
break;
}
return node;
}
Node* NodeIterator::previousNode(ExceptionCode&)
{
Node* node = referenceNode() ? referenceNode() : root();
if (pointerBeforeReferenceNode() || acceptNode(node) != NodeFilter::FILTER_ACCEPT)
node = findPreviousNode(node);
if (node)
setReferenceNode(node);
setPointerBeforeReferenceNode();
return node;
}
void NodeIterator::detach()
{
if (!detached() && document())
document()->detachNodeIterator(this);
setDetached();
}
void NodeIterator::setReferenceNode(Node* node)
{
m_referenceNode = node;
}
void NodeIterator::notifyBeforeNodeRemoval(Node* removedNode)
{
if (!removedNode || removedNode == root() || !removedNode->isDescendantOf(root()))
return;
bool willRemoveReferenceNode = removedNode == referenceNode();
bool willRemoveReferenceNodeAncestor = referenceNode() && referenceNode()->isDescendantOf(removedNode);
if (!willRemoveReferenceNode && !willRemoveReferenceNodeAncestor)
return;
if (pointerBeforeReferenceNode()) {
Node* node = findNextNode(removedNode);
if (node) {
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(removedNode))
node = findNextNode(node);
}
if (node)
setReferenceNode(node);
} else {
node = findPreviousNode(removedNode);
if (node) {
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(removedNode))
node = findPreviousNode(node);
}
if (node) {
setReferenceNode(node);
setPointerBeforeReferenceNode(false);
}
}
}
} else {
Node* node = findPreviousNode(removedNode);
if (node) {
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(removedNode))
node = findPreviousNode(node);
}
if (node)
setReferenceNode(node);
} else {
node = findNextNode(removedNode);
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(removedNode))
node = findPreviousNode(node);
}
if (node)
setReferenceNode(node);
}
}
}
}