Use stricter typing for NodeLists throughout the code base

Source/core/accessibility/AXTable.cpp

Index: Source/core/accessibility/AXTable.cpp
diff --git a/Source/core/accessibility/AXTable.cpp b/Source/core/accessibility/AXTable.cpp
index efec030faca837df0229d5fd03774802d096ede6..22a0d4542643f31c6d5b45e6c7c9b88c195b1d21 100644
--- a/Source/core/accessibility/AXTable.cpp
+++ b/Source/core/accessibility/AXTable.cpp
@@ -40,6 +40,7 @@
 #include "core/html/HTMLTableColElement.h"
 #include "core/html/HTMLTableElement.h"
 #include "core/html/HTMLTableRowElement.h"
+#include "core/html/HTMLTableRowsCollection.h"
 #include "core/html/HTMLTableSectionElement.h"
 #include "core/rendering/RenderTableCell.h"
 
@@ -137,8 +138,9 @@ bool AXTable::isDataTable() const
             return false;
     }
 
-    RefPtrWillBeRawPtr<HTMLCollection> rows = tableElement->rows();
-    for (unsigned rowIndex = 0; rowIndex < rows->length(); ++rowIndex) {
+    RefPtrWillBeRawPtr<HTMLTableRowsCollection> rows = tableElement->rows();
+    unsigned rowCount = rows->length();

[adamk, 2014/06/16 20:23:17]

Nit: this reads like over-optimizing to me, considering there's code in the
HTMLCollection infrastructure to make this cached already.

[Inactive, 2014/06/16 20:35:50]

This avoids "if (isCachedNodeCountValid())" check for every loop iteration. It
is not uncommon that we cache HTMLCollection::length() before the loops.

+    for (unsigned rowIndex = 0; rowIndex < rowCount; ++rowIndex) {
         Element* rowElement = rows->item(rowIndex);
         if (elementHasAriaRole(rowElement))
             return false;