Rename Blink constants generated from IDL files.

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

 /*
  * 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 68 matching lines @@
         root()->document().attachNodeIterator(this);
 }
 
 Node* NodeIterator::nextNode(ExceptionState& exceptionState)
 {
     Node* result = nullptr;
 
     m_candidateNode = m_referenceNode;
     while (m_candidateNode.moveToNext(root())) {
         // NodeIterators treat the DOM tree as a flat list of nodes.
-        // In other words, FILTER_REJECT does not pass over descendants
-        // of the rejected node. Hence, FILTER_REJECT is the same as FILTER_SKIP.
+        // In other words, kFilterReject does not pass over descendants
+        // of the rejected node. Hence, kFilterReject is the same as kFilterSkip.
         Node* provisionalResult = m_candidateNode.node;
-        bool nodeWasAccepted = acceptNode(provisionalResult, exceptionState) == NodeFilter::FILTER_ACCEPT;
+        bool nodeWasAccepted = acceptNode(provisionalResult, exceptionState) == NodeFilter::kFilterAccept;
         if (exceptionState.hadException())
             break;
         if (nodeWasAccepted) {
             m_referenceNode = m_candidateNode;
             result = provisionalResult;
             break;
         }
     }
 
     m_candidateNode.clear();
     return result;
 }
 
 Node* NodeIterator::previousNode(ExceptionState& exceptionState)
 {
     Node* result = nullptr;
 
     m_candidateNode = m_referenceNode;
     while (m_candidateNode.moveToPrevious(root())) {
         // NodeIterators treat the DOM tree as a flat list of nodes.
-        // In other words, FILTER_REJECT does not pass over descendants
-        // of the rejected node. Hence, FILTER_REJECT is the same as FILTER_SKIP.
+        // In other words, kFilterReject does not pass over descendants
+        // of the rejected node. Hence, kFilterReject is the same as kFilterSkip.
         Node* provisionalResult = m_candidateNode.node;
-        bool nodeWasAccepted = acceptNode(provisionalResult, exceptionState) == NodeFilter::FILTER_ACCEPT;
+        bool nodeWasAccepted = acceptNode(provisionalResult, exceptionState) == NodeFilter::kFilterAccept;
         if (exceptionState.hadException())
             break;
         if (nodeWasAccepted) {
             m_referenceNode = m_candidateNode;
             result = provisionalResult;
             break;
         }
     }
 
     m_candidateNode.clear();
@@ skipping 83 matching lines @@
     visitor->trace(m_candidateNode);
     NodeIteratorBase::trace(visitor);
 }
 
 DEFINE_TRACE_WRAPPERS(NodeIterator)
 {
     NodeIteratorBase::traceWrappers(visitor);
 }
 
 } // namespace blink