Trivial changes to default Vector sizing in the shadow area.

Source/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 74 matching lines @@
 
     // If we hit the end of either list above we need to reattach all remaining nodes.
 
     for ( ; i < m_distribution.size(); ++i)
         m_distribution.at(i)->lazyReattachIfAttached();
 
     for ( ; j < distribution.size(); ++j)
         distribution.at(j)->lazyReattachIfAttached();
 
     m_distribution.swap(distribution);
+    m_distribution.shrinkToFit();
 }
 
 void InsertionPoint::attach(const AttachContext& context)
 {
     // FIXME: This loop shouldn't be needed since the distributed nodes should
     // never be detached, we can probably remove it.
     for (size_t i = 0; i < m_distribution.size(); ++i) {
         if (!m_distribution.at(i)->attached())
             m_distribution.at(i)->attach(context);
     }
@@ skipping 34 matching lines @@
         node = node->parentNode();
     }
     return true;
 }
 
 PassRefPtr<NodeList> InsertionPoint::getDistributedNodes()
 {
     document().updateDistributionForNodeIfNeeded(this);
 
     Vector<RefPtr<Node> > nodes;
+    nodes.reserveInitialCapacity(m_distribution.size());
     for (size_t i = 0; i < m_distribution.size(); ++i)
-        nodes.append(m_distribution.at(i));
+        nodes.uncheckedAppend(m_distribution.at(i));
 
     return StaticNodeList::adopt(nodes);
 }
 
 bool InsertionPoint::rendererIsNeeded(const NodeRenderingContext& context)
 {
     return !isActive() && HTMLElement::rendererIsNeeded(context);
 }
 
 void InsertionPoint::childrenChanged(bool changedByParser, Node* beforeChange, Node* afterChange, int childCountDelta)
@@ skipping 120 matching lines @@
                 current = insertedTo;
                 results.append(insertedTo);
                 continue;
             }
         }
         return;
     }
 }
 
 } // namespace WebCore