Consistently use on-heap collections for StyleRuleBase descendants.

Source/heap/HeapTest.cpp

 /*
  * 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 1498 matching lines @@
 
     Deque<ShouldBeTraced> m_deque1;
     Vector<ShouldBeTraced> m_vector1;
     Deque<Member<IntWrapper> > m_deque2;
     Vector<Member<IntWrapper> > m_vector2;
     HashSet<Member<IntWrapper> > m_hashSet;
     HashMap<void*, Member<IntWrapper> > m_hashMap;
     ListHashSet<Member<IntWrapper> > m_listHashSet;
 };
 
+TEST(HeapTest, HeapVectorFilledWithValue)
+{
+    IntWrapper* val = IntWrapper::create(1);
+    HeapVector<Member<IntWrapper> > vector(10, val);
+    EXPECT_EQ(10u, vector.size());
+    for (size_t i = 0; i < vector.size(); i++)
+        EXPECT_EQ(val, vector[i]);
+}
+
 TEST(HeapTest, HeapVectorWithInlineCapacity)
 {
     IntWrapper* one = IntWrapper::create(1);
     IntWrapper* two = IntWrapper::create(2);
     IntWrapper* three = IntWrapper::create(3);
     IntWrapper* four = IntWrapper::create(4);
     IntWrapper* five = IntWrapper::create(5);
     IntWrapper* six = IntWrapper::create(6);
     {
         HeapVector<Member<IntWrapper>, 2> vector;
@@ skipping 734 matching lines @@
     it->value.append(IntWrapper::create(42));
     EXPECT_EQ(1u, map->get(key).size());
 
     Persistent<HeapHashMap<void*, IntVector> > keepAlive(map);
     Heap::collectGarbage(ThreadState::NoHeapPointersOnStack);
     EXPECT_EQ(1u, map->get(key).size());
     EXPECT_EQ(0, IntWrapper::s_destructorCalls);
 }
 
 } // namespace