1/* 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) 3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) 4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) 5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) 6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. 7 * 8 * This library is free software; you can redistribute it and/or 9 * modify it under the terms of the GNU Library General Public 10 * License as published by the Free Software Foundation; either 11 * version 2 of the License, or (at your option) any later version. 12 * 13 * This library is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 16 * Library General Public License for more details. 17 * 18 * You should have received a copy of the GNU Library General Public License 19 * along with this library; see the file COPYING.LIB. If not, write to 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, 21 * Boston, MA 02110-1301, USA. 22 * 23 */ 24 25#include "config.h" 26#include "core/dom/NodeIteratorBase.h" 27 28#include "bindings/core/v8/ExceptionState.h" 29#include "core/dom/Node.h" 30#include "core/dom/NodeFilter.h" 31 32namespace blink { 33 34DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(NodeIteratorBase); 35 36NodeIteratorBase::NodeIteratorBase(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> nodeFilter) 37 : m_root(rootNode) 38 , m_whatToShow(whatToShow) 39 , m_filter(nodeFilter) 40{ 41} 42 43short NodeIteratorBase::acceptNode(Node* node, ExceptionState& exceptionState) const 44{ 45 // The bit twiddling here is done to map DOM node types, which are given as integers from 46 // 1 through 14, to whatToShow bit masks. 47 if (!(((1 << (node->nodeType() - 1)) & m_whatToShow))) 48 return NodeFilter::FILTER_SKIP; 49 if (!m_filter) 50 return NodeFilter::FILTER_ACCEPT; 51 return m_filter->acceptNode(node, exceptionState); 52} 53 54void NodeIteratorBase::trace(Visitor* visitor) 55{ 56 visitor->trace(m_root); 57 visitor->trace(m_filter); 58} 59 60} // namespace blink 61