| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) | 3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) |
| 4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) | 4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) |
| 5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) | 5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) |
| 6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. | 6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. |
| 7 * | 7 * |
| 8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
| 9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
| 10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
| (...skipping 24 matching lines...) Expand all Loading... |
| 35 , m_whatToShow(whatToShow) | 35 , m_whatToShow(whatToShow) |
| 36 , m_filter(nodeFilter) | 36 , m_filter(nodeFilter) |
| 37 { | 37 { |
| 38 } | 38 } |
| 39 | 39 |
| 40 unsigned NodeIteratorBase::acceptNode(Node* node, ExceptionState& exceptionState
) const | 40 unsigned NodeIteratorBase::acceptNode(Node* node, ExceptionState& exceptionState
) const |
| 41 { | 41 { |
| 42 // The bit twiddling here is done to map DOM node types, which are given as
integers from | 42 // The bit twiddling here is done to map DOM node types, which are given as
integers from |
| 43 // 1 through 14, to whatToShow bit masks. | 43 // 1 through 14, to whatToShow bit masks. |
| 44 if (!(((1 << (node->getNodeType() - 1)) & m_whatToShow))) | 44 if (!(((1 << (node->getNodeType() - 1)) & m_whatToShow))) |
| 45 return NodeFilter::FILTER_SKIP; | 45 return NodeFilter::kFilterSkip; |
| 46 if (!m_filter) | 46 if (!m_filter) |
| 47 return NodeFilter::FILTER_ACCEPT; | 47 return NodeFilter::kFilterAccept; |
| 48 return m_filter->acceptNode(node, exceptionState); | 48 return m_filter->acceptNode(node, exceptionState); |
| 49 } | 49 } |
| 50 | 50 |
| 51 DEFINE_TRACE(NodeIteratorBase) | 51 DEFINE_TRACE(NodeIteratorBase) |
| 52 { | 52 { |
| 53 visitor->trace(m_root); | 53 visitor->trace(m_root); |
| 54 visitor->trace(m_filter); | 54 visitor->trace(m_filter); |
| 55 } | 55 } |
| 56 | 56 |
| 57 DEFINE_TRACE_WRAPPERS(NodeIteratorBase) | 57 DEFINE_TRACE_WRAPPERS(NodeIteratorBase) |
| 58 { | 58 { |
| 59 visitor->traceWrappers(m_filter); | 59 visitor->traceWrappers(m_filter); |
| 60 } | 60 } |
| 61 | 61 |
| 62 } // namespace blink | 62 } // namespace blink |
| OLD | NEW |