Rename enums/functions that collide in chromium style in platform/

third_party/WebKit/Source/platform/PODRedBlackTree.h

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * 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
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 227 matching lines @@
 
     // Turns on or off verbose debugging of the tree, causing many
     // messages to be logged during insertion and other operations in
     // debug mode.
     void setVerboseDebugging(bool verboseDebugging)
     {
         m_verboseDebugging = verboseDebugging;
     }
 #endif
 
-    enum Color {
+    enum NodeColor {
         Red = 1,
         Black
     };
 
     // The base Node class which is stored in the tree. Nodes are only
     // an internal concept; users of the tree deal only with the data
     // they store in it.
     class Node {
         DISALLOW_NEW_EXCEPT_PLACEMENT_NEW();
         WTF_MAKE_NONCOPYABLE(Node);
     public:
         // Constructor. Newly-created nodes are colored red.
         explicit Node(const T& data)
             : m_left(0)
             , m_right(0)
             , m_parent(0)
             , m_color(Red)
             , m_data(data)
         {
         }
 
         virtual ~Node() { }
 
-        Color color() const { return m_color; }
-        void setColor(Color color) { m_color = color; }
+        NodeColor color() const { return m_color; }
+        void setColor(NodeColor color) { m_color = color; }
 
         // Fetches the user data.
         T& data() { return m_data; }
 
         // Copies all user-level fields from the source node, but not
         // internal fields. For example, the base implementation of this
         // method copies the "m_data" field, but not the child or parent
         // fields. Any augmentation information also does not need to be
         // copied, as it will be recomputed. Subclasses must call the
         // superclass implementation.
         virtual void copyFrom(Node* src) { m_data = src->data(); }
 
         Node* left() const { return m_left; }
         void setLeft(Node* node) { m_left = node; }
 
         Node* right() const { return m_right; }
         void setRight(Node* node) { m_right = node; }
 
         Node* parent() const { return m_parent; }
         void setParent(Node* node) { m_parent = node; }
 
     private:
         Node* m_left;
         Node* m_right;
         Node* m_parent;
-        Color m_color;
+        NodeColor m_color;
         T m_data;
     };
 
 protected:
     // Returns the root of the tree, which is needed by some subclasses.
     Node* root() const { return m_root; }
 
 private:
     // This virtual method is the hook that subclasses should use when
     // augmenting the red-black tree with additional per-node summary
@@ skipping 513 matching lines @@
     Node* m_root;
     bool m_needsFullOrderingComparisons;
 #ifndef NDEBUG
     bool m_verboseDebugging;
 #endif
 };
 
 } // namespace blink
 
 #endif // PODRedBlackTree_h