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 25 matching lines...) Expand all Loading... |
36 : m_root(rootNode) | 36 : m_root(rootNode) |
37 , m_whatToShow(whatToShow) | 37 , m_whatToShow(whatToShow) |
38 , m_filter(nodeFilter) | 38 , m_filter(nodeFilter) |
39 { | 39 { |
40 } | 40 } |
41 | 41 |
42 unsigned NodeIteratorBase::acceptNode(Node* node, ExceptionState& exceptionState
) const | 42 unsigned NodeIteratorBase::acceptNode(Node* node, ExceptionState& exceptionState
) const |
43 { | 43 { |
44 // The bit twiddling here is done to map DOM node types, which are given as
integers from | 44 // The bit twiddling here is done to map DOM node types, which are given as
integers from |
45 // 1 through 14, to whatToShow bit masks. | 45 // 1 through 14, to whatToShow bit masks. |
46 if (!(((1 << (node->nodeType() - 1)) & m_whatToShow))) | 46 if (!(((1 << (node->getNodeType() - 1)) & m_whatToShow))) |
47 return NodeFilter::FILTER_SKIP; | 47 return NodeFilter::FILTER_SKIP; |
48 if (!m_filter) | 48 if (!m_filter) |
49 return NodeFilter::FILTER_ACCEPT; | 49 return NodeFilter::FILTER_ACCEPT; |
50 return m_filter->acceptNode(node, exceptionState); | 50 return m_filter->acceptNode(node, exceptionState); |
51 } | 51 } |
52 | 52 |
53 DEFINE_TRACE(NodeIteratorBase) | 53 DEFINE_TRACE(NodeIteratorBase) |
54 { | 54 { |
55 visitor->trace(m_root); | 55 visitor->trace(m_root); |
56 visitor->trace(m_filter); | 56 visitor->trace(m_filter); |
57 } | 57 } |
58 | 58 |
59 } // namespace blink | 59 } // namespace blink |
OLD | NEW |