DOM: NodeIterator.filter and TreeWalker.filter should return values which were specified to createN…

third_party/WebKit/Source/core/dom/NodeIterator.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * Copyright (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)
  * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 25 matching lines @@
 
 class NodeIterator final : public GarbageCollected<NodeIterator>,
                            public ScriptWrappable,
                            public NodeIteratorBase {
   DEFINE_WRAPPERTYPEINFO();
   USING_GARBAGE_COLLECTED_MIXIN(NodeIterator);
 
  public:
   static NodeIterator* Create(Node* root_node,
                               unsigned what_to_show,
-                              NodeFilter* filter) {
+                              V8NodeFilterCondition* filter) {
     return new NodeIterator(root_node, what_to_show, filter);
   }
 
   Node* nextNode(ExceptionState&);
   Node* previousNode(ExceptionState&);
   void detach();
 
   Node* referenceNode() const { return reference_node_.node.Get(); }
   bool pointerBeforeReferenceNode() const {
     return reference_node_.is_pointer_before_node;
   }
 
   // This function is called before any node is removed from the document tree.
   void NodeWillBeRemoved(Node&);
 
   DECLARE_VIRTUAL_TRACE();
 
   DECLARE_VIRTUAL_TRACE_WRAPPERS();
 
  private:
-  NodeIterator(Node*, unsigned what_to_show, NodeFilter*);
+  NodeIterator(Node*, unsigned what_to_show, V8NodeFilterCondition*);
 
   class NodePointer {
     DISALLOW_NEW();
 
    public:
     NodePointer();
     NodePointer(Node*, bool);
 
     void Clear();
     bool MoveToNext(Node* root);
     bool MoveToPrevious(Node* root);
 
     Member<Node> node;
     bool is_pointer_before_node;
 
     DEFINE_INLINE_TRACE() { visitor->Trace(node); }
   };
 
   void UpdateForNodeRemoval(Node& node_to_be_removed, NodePointer&) const;
 
   NodePointer reference_node_;
   NodePointer candidate_node_;
 };
 
 }  // namespace blink
 
 #endif  // NodeIterator_h