style: Rename the PseudoId enum values to CamelCase and prefix them.

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

 /*
  * Copyright (C) 2012 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 54 matching lines @@
             return next;
     } else {
         if (Node* next = FlatTreeTraversal::nextSibling(node))
             return next;
         if (node.isAfterPseudoElement())
             return 0;
     }
 
     Node* parent = FlatTreeTraversal::parent(node);
     if (parent && parent->isElementNode())
-        return toElement(parent)->pseudoElement(AFTER);
+        return toElement(parent)->pseudoElement(PseudoIdAfter);
 
     return 0;
 }
 
 Node* previousSibling(const Node& node)
 {
     if (node.isAfterPseudoElement()) {
         if (Node* previous = FlatTreeTraversal::lastChild(*FlatTreeTraversal::parent(node)))
             return previous;
     } else {
         if (Node* previous = FlatTreeTraversal::previousSibling(node))
             return previous;
         if (node.isBeforePseudoElement())
             return 0;
     }
 
     Node* parent = FlatTreeTraversal::parent(node);
     if (parent && parent->isElementNode())
-        return toElement(parent)->pseudoElement(BEFORE);
+        return toElement(parent)->pseudoElement(PseudoIdBefore);
 
     return 0;
 }
 
 static Node* lastChild(const Node& node)
 {
     return FlatTreeTraversal::lastChild(node);
 }
 
 static Node* pseudoAwarePreviousSibling(const Node& node)
 {
     Node* previousNode = previousSibling(node);
     Node* parentNode = parent(node);
 
     if (parentNode && parentNode->isElementNode() && !previousNode) {
         if (node.isAfterPseudoElement()) {
             if (Node* child = lastChild(*parentNode))
                 return child;
         }
         if (!node.isBeforePseudoElement())
-            return toElement(parentNode)->pseudoElement(BEFORE);
+            return toElement(parentNode)->pseudoElement(PseudoIdBefore);
     }
     return previousNode;
 }
 
 static Node* pseudoAwareLastChild(const Node& node)
 {
     if (node.isElementNode()) {
         const Element& currentElement = toElement(node);
-        Node* last = currentElement.pseudoElement(AFTER);
+        Node* last = currentElement.pseudoElement(PseudoIdAfter);
         if (last)
             return last;
 
         last = lastChild(currentElement);
         if (!last)
-            last = currentElement.pseudoElement(BEFORE);
+            last = currentElement.pseudoElement(PseudoIdBefore);
         return last;
     }
 
     return lastChild(node);
 }
 
 Node* previous(const Node& node, const Node* stayWithin)
 {
     if (node == stayWithin)
         return 0;
@@ skipping 15 matching lines @@
 {
     Node* parentNode = parent(node);
     Node* nextNode = nextSibling(node);
 
     if (parentNode && parentNode->isElementNode() && !nextNode) {
         if (node.isBeforePseudoElement()) {
             if (Node* child = firstChild(*parentNode))
                 return child;
         }
         if (!node.isAfterPseudoElement())
-            return toElement(parentNode)->pseudoElement(AFTER);
+            return toElement(parentNode)->pseudoElement(PseudoIdAfter);
     }
     return nextNode;
 }
 
 static Node* pseudoAwareFirstChild(const Node& node)
 {
     if (node.isElementNode()) {
         const Element& currentElement = toElement(node);
-        Node* first = currentElement.pseudoElement(BEFORE);
+        Node* first = currentElement.pseudoElement(PseudoIdBefore);
         if (first)
             return first;
         first = firstChild(currentElement);
         if (!first)
-            first = currentElement.pseudoElement(AFTER);
+            first = currentElement.pseudoElement(PseudoIdAfter);
         return first;
     }
 
     return firstChild(node);
 }
 
 static Node* nextAncestorSibling(const Node& node, const Node* stayWithin)
 {
     ASSERT(!pseudoAwareNextSibling(node));
     ASSERT(node != stayWithin);
@@ skipping 52 matching lines @@
     for (size_t i = position + 1; i < topLayerElements.size(); ++i) {
         if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject())
             return layoutObject;
     }
     return 0;
 }
 
 } // namespace LayoutTreeBuilderTraversal
 
 } // namespace blink