Trivial changes to default Vector sizing in the shadow area.

Source/core/dom/shadow/ContentDistribution.h

 /*
  * Copyright (C) 2013 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 22 matching lines @@
 
 #include "core/dom/Node.h"
 #include "wtf/Forward.h"
 #include "wtf/HashMap.h"
 #include "wtf/Vector.h"
 
 namespace WebCore {
 
 class ContentDistribution {
 public:
+    ContentDistribution() { m_nodes.reserveInitialCapacity(32); }
+
     PassRefPtr<Node> first() const { return m_nodes.first(); }
     PassRefPtr<Node> last() const { return m_nodes.last(); }
     PassRefPtr<Node> at(size_t index) const { return m_nodes.at(index); }
 
     size_t size() const { return m_nodes.size(); }
     bool isEmpty() const { return m_nodes.isEmpty(); }
 
     void append(PassRefPtr<Node>);
     void clear() { m_nodes.clear(); m_indices.clear(); }
+    void shrinkToFit() { m_nodes.shrinkToFit(); }
 
     bool contains(const Node* node) const { return m_indices.contains(node); }
     size_t find(const Node*) const;
     Node* nextTo(const Node*) const;
     Node* previousTo(const Node*) const;
 
     void swap(ContentDistribution& other);
 
     const Vector<RefPtr<Node> >& nodes() const { return m_nodes; }
 
 private:
     Vector<RefPtr<Node> > m_nodes;
     HashMap<const Node*, size_t> m_indices;
 };
 
 }
 
 #endif