HeapTest.HeapVectorPartObjects: fix reserveCapacity() expectation.

Source/platform/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 5746 matching lines @@
 {
     HeapVector<PartObjectWithRef> vector1;
     HeapVector<PartObjectWithRef> vector2;
 
     for (int i = 0; i < 10; ++i) {
         vector1.append(PartObjectWithRef(i));
         vector2.append(PartObjectWithRef(i));
     }
 
     vector1.reserveCapacity(150);
-    EXPECT_EQ(150u, vector1.capacity());
+    EXPECT_LE(150u, vector1.capacity());
     EXPECT_EQ(10u, vector1.size());
 
     vector2.reserveCapacity(100);
-    EXPECT_EQ(100u, vector2.capacity());
+    EXPECT_LE(100u, vector2.capacity());
     EXPECT_EQ(10u, vector2.size());
 
     for (int i = 0; i < 4; ++i) {
         vector1.append(PartObjectWithRef(10 + i));
         vector2.append(PartObjectWithRef(10 + i));
         vector2.append(PartObjectWithRef(10 + i));
     }
 
     // Shrinking heap vector backing stores always succeeds,
     // so these two will not currently exercise the code path
@@ skipping 142 matching lines @@
 {
     Persistent<ClassWithMember> object = ClassWithMember::create();
     EXPECT_EQ(0, object->traceCount());
     TestMixinAllocatingObject* mixin = TestMixinAllocatingObject::create(object.get());
     EXPECT_TRUE(mixin);
     EXPECT_GT(object->traceCount(), 0);
     EXPECT_GT(mixin->traceCount(), 0);
 }
 
 } // namespace blink