Remove two more uses of NodeList

sky/engine/core/dom/shadow/InsertionPoint.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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 123 matching lines @@
 {
     // FIXME(sky): Remove this.
     return canBeActive();
 }
 
 bool InsertionPoint::isContentInsertionPoint() const
 {
     return isHTMLContentElement(*this) && isActive();
 }
 
-PassRefPtr<StaticNodeList> InsertionPoint::getDistributedNodes()
+Vector<RefPtr<Node>> InsertionPoint::getDistributedNodes()
 {
     document().updateDistributionForNodeIfNeeded(this);
 
-    Vector<RefPtr<Node> > nodes;
-    nodes.reserveInitialCapacity(m_distribution.size());
+    Vector<RefPtr<Node> > result;
+    result.reserveInitialCapacity(m_distribution.size());
     for (size_t i = 0; i < m_distribution.size(); ++i)
-        nodes.uncheckedAppend(m_distribution.at(i));
-
-    return StaticNodeList::adopt(nodes);
+        result.uncheckedAppend(m_distribution.at(i));
+    return result;
 }
 
 void InsertionPoint::childrenChanged(const ChildrenChange& change)
 {
     HTMLElement::childrenChanged(change);
     if (ShadowRoot* root = containingShadowRoot()) {
         if (ElementShadow* rootOwner = root->owner())
             rootOwner->setNeedsDistributionRecalc();
     }
 }
@@ skipping 78 matching lines @@
         if (!insertionPoints)
             return;
         for (size_t i = 0; i < insertionPoints->size(); ++i)
             results.append(insertionPoints->at(i).get());
         ASSERT(current != insertionPoints->last().get());
         current = insertionPoints->last().get();
     }
 }
 
 } // namespace blink