#include "config.h"
#include "NodeIterator.h"
#include "Document.h"
#include "ExceptionCode.h"
#include "NodeTraversal.h"
#include <runtime/JSCJSValueInlines.h>
namespace WebCore {
NodeIterator::NodePointer::NodePointer(Node& node, bool isPointerBeforeNode)
: node(&node)
, isPointerBeforeNode(isPointerBeforeNode)
{
}
void NodeIterator::NodePointer::clear()
{
node = nullptr;
}
bool NodeIterator::NodePointer::moveToNext(Node& root)
{
if (!node)
return false;
if (isPointerBeforeNode) {
isPointerBeforeNode = false;
return true;
}
node = NodeTraversal::next(*node, &root);
return node;
}
bool NodeIterator::NodePointer::moveToPrevious(Node& root)
{
if (!node)
return false;
if (!isPointerBeforeNode) {
isPointerBeforeNode = true;
return true;
}
if (node == &root) {
node = nullptr;
return false;
}
node = NodeTraversal::previous(*node);
return node;
}
NodeIterator::NodeIterator(Node& rootNode, unsigned long whatToShow, RefPtr<NodeFilter>&& filter)
: NodeIteratorBase(rootNode, whatToShow, WTFMove(filter))
, m_referenceNode(root(), true)
{
root().document().attachNodeIterator(this);
}
NodeIterator::~NodeIterator()
{
root().document().detachNodeIterator(this);
}
RefPtr<Node> NodeIterator::nextNode()
{
RefPtr<Node> result;
m_candidateNode = m_referenceNode;
while (m_candidateNode.moveToNext(root())) {
RefPtr<Node> provisionalResult = m_candidateNode.node;
bool nodeWasAccepted = acceptNode(provisionalResult.get()) == NodeFilter::FILTER_ACCEPT;
if (nodeWasAccepted) {
m_referenceNode = m_candidateNode;
result = WTFMove(provisionalResult);
break;
}
}
m_candidateNode.clear();
return result;
}
RefPtr<Node> NodeIterator::previousNode()
{
RefPtr<Node> result;
m_candidateNode = m_referenceNode;
while (m_candidateNode.moveToPrevious(root())) {
RefPtr<Node> provisionalResult = m_candidateNode.node;
bool nodeWasAccepted = acceptNode(provisionalResult.get()) == NodeFilter::FILTER_ACCEPT;
if (nodeWasAccepted) {
m_referenceNode = m_candidateNode;
result = WTFMove(provisionalResult);
break;
}
}
m_candidateNode.clear();
return result;
}
void NodeIterator::detach()
{
}
void NodeIterator::nodeWillBeRemoved(Node& removedNode)
{
updateForNodeRemoval(removedNode, m_candidateNode);
updateForNodeRemoval(removedNode, m_referenceNode);
}
void NodeIterator::updateForNodeRemoval(Node& removedNode, NodePointer& referenceNode) const
{
ASSERT(&root().document() == &removedNode.document());
if (!removedNode.isDescendantOf(&root()))
return;
bool willRemoveReferenceNode = &removedNode == referenceNode.node;
bool willRemoveReferenceNodeAncestor = referenceNode.node && referenceNode.node->isDescendantOf(&removedNode);
if (!willRemoveReferenceNode && !willRemoveReferenceNodeAncestor)
return;
if (referenceNode.isPointerBeforeNode) {
Node* node = NodeTraversal::next(removedNode, &root());
if (node) {
while (node && node->isDescendantOf(&removedNode))
node = NodeTraversal::next(*node, &root());
if (node)
referenceNode.node = node;
} else {
node = NodeTraversal::previous(removedNode);
if (node) {
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(&removedNode))
node = NodeTraversal::previous(*node);
}
if (node) {
referenceNode.node = node;
referenceNode.isPointerBeforeNode = false;
}
}
}
} else {
Node* node = NodeTraversal::previous(removedNode);
if (node) {
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(&removedNode))
node = NodeTraversal::previous(*node);
}
if (node)
referenceNode.node = node;
} else {
node = NodeTraversal::next(removedNode, &root());
if (willRemoveReferenceNodeAncestor) {
while (node && node->isDescendantOf(&removedNode))
node = NodeTraversal::previous(*node);
}
if (node)
referenceNode.node = node;
}
}
}
}