Use stricter typing for NodeLists throughout the code base

Source/core/dom/ChildListMutationScope.cpp

 /*
  * Copyright (C) 2011 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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 118 matching lines @@
         m_nextSibling = child->nextSibling();
 
     m_removedNodes.append(child.release());
 }
 
 void ChildListMutationAccumulator::enqueueMutationRecord()
 {
     ASSERT(hasObservers());
     ASSERT(!isEmpty());
 
-    RefPtrWillBeRawPtr<NodeList> addedNodes = StaticNodeList::adopt(m_addedNodes);
-    RefPtrWillBeRawPtr<NodeList> removedNodes = StaticNodeList::adopt(m_removedNodes);
+    RefPtrWillBeRawPtr<StaticNodeList> addedNodes = StaticNodeList::adopt(m_addedNodes);
+    RefPtrWillBeRawPtr<StaticNodeList> removedNodes = StaticNodeList::adopt(m_removedNodes);
     RefPtrWillBeRawPtr<MutationRecord> record = MutationRecord::createChildList(m_target, addedNodes.release(), removedNodes.release(), m_previousSibling.release(), m_nextSibling.release());
     m_observers->enqueueMutationRecord(record.release());
     m_lastAdded = nullptr;
     ASSERT(isEmpty());
 }
 
 bool ChildListMutationAccumulator::isEmpty()
 {
     bool result = m_removedNodes.isEmpty() && m_addedNodes.isEmpty();
 #ifndef NDEBUG
@@ skipping 11 matching lines @@
     visitor->trace(m_target);
     visitor->trace(m_removedNodes);
     visitor->trace(m_addedNodes);
     visitor->trace(m_previousSibling);
     visitor->trace(m_nextSibling);
     visitor->trace(m_lastAdded);
     visitor->trace(m_observers);
 }
 
 } // namespace WebCore