Revert of Add template parameter to ElementTraversal to iterate over Elements of a specific type

Source/core/html/HTMLTableRowsCollection.cpp

 /*
  * Copyright (C) 2008, 2011, 2012 Apple 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 37 matching lines @@
     return row->parentNode() && toElement(row->parentNode())->hasLocalName(tbodyTag);
 }
 
 static bool isInFoot(Element* row)
 {
     return row->parentNode() && toElement(row->parentNode())->hasLocalName(tfootTag);
 }
 
 static inline HTMLTableRowElement* findTableRowElementInChildren(Element& current)
 {
-    return Traversal<HTMLTableRowElement>::firstWithin(current);
+    for (Element* child = ElementTraversal::firstWithin(current); child; child = ElementTraversal::nextSibling(*child)) {
+        if (isHTMLTableRowElement(child))
+            return toHTMLTableRowElement(child);
+    }
+    return 0;
 }
 
 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement& table, HTMLTableRowElement* previous)
 {
     Element* child = 0;
 
     // Start by looking for the next row in this section.
     // Continue only if there is none.
     if (previous && previous->parentNode() != table) {
-        if (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::nextSibling(*previous))
-            return row;
+        for (child = ElementTraversal::nextSibling(*previous); child; child = ElementTraversal::nextSibling(*child)) {
+            if (isHTMLTableRowElement(child))
+                return toHTMLTableRowElement(child);
+        }
     }
 
     // If still looking at head sections, find the first row in the next head section.
     if (!previous)
         child = ElementTraversal::firstWithin(table);
     else if (isInHead(previous))
         child = ElementTraversal::nextSibling(*previous->parentNode());
     for (; child; child = ElementTraversal::nextSibling(*child)) {
         if (child->hasTagName(theadTag)) {
             if (HTMLTableRowElement* row = findTableRowElementInChildren(*child))
@@ skipping 79 matching lines @@
 {
     return adoptRef(new HTMLTableRowsCollection(table));
 }
 
 Element* HTMLTableRowsCollection::virtualItemAfter(Element* previous) const
 {
     return rowAfter(toHTMLTableElement(ownerNode()), toHTMLTableRowElement(previous));
 }
 
 }