ABANDONED CL: Changes needed to make things compile after running rewrite_to_chrome_style tool.

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

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013
  * Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved.
  * (http://www.torchmobile.com/)
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
@@ skipping 263 matching lines @@
   while (node && !node->isElementNode())
     node = NodeTraversal::nextSkippingChildren(*node, stayWithin);
   return toElement(node);
 }
 
 // Generic versions.
 template <class ElementType>
 template <class NodeType>
 inline ElementType* Traversal<ElementType>::firstChildTemplate(
     NodeType& current) {
+  /* DO NOT SUBMIT - merge conflict marker.
+   * Please spell |firstChild|, not |FirstChild| below. */
   Node* node = current.firstChild();
   while (node && !isElementOfType<const ElementType>(*node))
     node = node->nextSibling();
   return toElement<ElementType>(node);
 }
 
 template <class ElementType>
 template <class MatchFunc>
 inline ElementType* Traversal<ElementType>::firstChild(
     const ContainerNode& current,
@@ skipping 18 matching lines @@
     NodeType& current) {
   if (isElementOfType<const ElementType>(current))
     return &toElement<ElementType>(current);
   return firstAncestor(current);
 }
 
 template <class ElementType>
 template <class NodeType>
 inline ElementType* Traversal<ElementType>::lastChildTemplate(
     NodeType& current) {
+  /* DO NOT SUBMIT - merge conflict marker.
+   * Please spell |lastChild|, not |LastChild| below. */
   Node* node = current.lastChild();
   while (node && !isElementOfType<const ElementType>(*node))
     node = node->previousSibling();
   return toElement<ElementType>(node);
 }
 
 template <class ElementType>
 template <class MatchFunc>
 inline ElementType* Traversal<ElementType>::lastChild(
     const ContainerNode& current,
     MatchFunc isMatch) {
   ElementType* element = Traversal<ElementType>::lastChild(current);
   while (element && !isMatch(*element))
     element = Traversal<ElementType>::previousSibling(*element);
   return element;
 }
 
 template <class ElementType>
 template <class NodeType>
 inline ElementType* Traversal<ElementType>::firstWithinTemplate(
     NodeType& current) {
+  /* DO NOT SUBMIT - merge conflict marker.
+   * Please spell |firstChild|, not |FirstChild| below. */
   Node* node = current.firstChild();
   while (node && !isElementOfType<const ElementType>(*node))
     node = NodeTraversal::next(*node, &current);
   return toElement<ElementType>(node);
 }
 
 template <class ElementType>
 template <typename MatchFunc>
 inline ElementType* Traversal<ElementType>::firstWithin(
     const ContainerNode& current,
@@ skipping 186 matching lines @@
                                                         MatchFunc isMatch) {
   ElementType* element = Traversal<ElementType>::nextSibling(current);
   while (element && !isMatch(*element))
     element = Traversal<ElementType>::nextSibling(*element);
   return element;
 }
 
 }  // namespace blink
 
 #endif