Rename enums/functions that collide in chromium style in core/dom/

third_party/WebKit/Source/core/xml/XPathStep.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
@@ skipping 151 matching lines @@
         return Node::ELEMENT_NODE;
     }
 }
 #endif
 
 // Evaluate NodeTest without considering merged predicates.
 static inline bool nodeMatchesBasicTest(Node* node, Step::Axis axis, const Step::NodeTest& nodeTest)
 {
     switch (nodeTest.kind()) {
     case Step::NodeTest::TextNodeTest: {
-        Node::NodeType type = node->nodeType();
+        Node::NodeType type = node->getNodeType();
         return type == Node::TEXT_NODE || type == Node::CDATA_SECTION_NODE;
     }
     case Step::NodeTest::CommentNodeTest:
-        return node->nodeType() == Node::COMMENT_NODE;
+        return node->getNodeType() == Node::COMMENT_NODE;
     case Step::NodeTest::ProcessingInstructionNodeTest: {
         const AtomicString& name = nodeTest.data();
-        return node->nodeType() == Node::PROCESSING_INSTRUCTION_NODE && (name.isEmpty() || node->nodeName() == name);
+        return node->getNodeType() == Node::PROCESSING_INSTRUCTION_NODE && (name.isEmpty() || node->nodeName() == name);
     }
     case Step::NodeTest::AnyNodeTest:
         return true;
     case Step::NodeTest::NameTest: {
         const AtomicString& name = nodeTest.data();
         const AtomicString& namespaceURI = nodeTest.namespaceURI();
 
         if (axis == Step::AttributeAxis) {
             Attr* attr = toAttr(node);
 
@@ skipping 110 matching lines @@
         }
         for (n = n->parentNode(); n; n = n->parentNode()) {
             if (nodeMatches(evaluationContext, n, AncestorAxis, nodeTest()))
                 nodes.append(n);
         }
         nodes.markSorted(false);
         return;
     }
 
     case FollowingSiblingAxis:
-        if (context->nodeType() == Node::ATTRIBUTE_NODE)
+        if (context->getNodeType() == Node::ATTRIBUTE_NODE)
             return;
 
         for (Node* n = context->nextSibling(); n; n = n->nextSibling()) {
             if (nodeMatches(evaluationContext, n, FollowingSiblingAxis, nodeTest()))
                 nodes.append(n);
         }
         return;
 
     case PrecedingSiblingAxis:
-        if (context->nodeType() == Node::ATTRIBUTE_NODE)
+        if (context->getNodeType() == Node::ATTRIBUTE_NODE)
             return;
 
         for (Node* n = context->previousSibling(); n; n = n->previousSibling()) {
             if (nodeMatches(evaluationContext, n, PrecedingSiblingAxis, nodeTest()))
                 nodes.append(n);
         }
         nodes.markSorted(false);
         return;
 
     case FollowingAxis:
@@ skipping 97 matching lines @@
         nodes.markSorted(false);
         return;
     }
     }
     ASSERT_NOT_REACHED();
 }
 
 } // namespace XPath
 
 } // namespace blink