VM: Re-format to use at most one newline between functions

runtime/vm/growable_array_test.cc

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
+#include "vm/growable_array.h"
 #include "platform/assert.h"
-#include "vm/growable_array.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 template <class GrowableArrayInt, class GrowableArrayInt64>
 void TestGrowableArray() {
   GrowableArrayInt g;
   EXPECT_EQ(0, g.length());
   EXPECT(g.is_empty());
   g.Add(5);
@@ skipping 38 matching lines @@
   h.RemoveLast();
   EXPECT_EQ(0, h.length());
   EXPECT(h.is_empty());
   h.Add(-8899);
   h.Add(7908);
   EXPECT(!h.is_empty());
   h.Clear();
   EXPECT(h.is_empty());
 }
 
-
 TEST_CASE(GrowableArray) {
   TestGrowableArray<GrowableArray<int>, GrowableArray<int64_t> >();
 }
 
-
 TEST_CASE(MallocGrowableArray) {
   TestGrowableArray<MallocGrowableArray<int>, MallocGrowableArray<int64_t> >();
 }
 
-
 static int greatestFirst(const int* a, const int* b) {
   if (*a > *b) {
     return -1;
   } else if (*a < *b) {
     return 1;
   } else {
     return 0;
   }
 }
 
 TEST_CASE(GrowableArraySort) {
   GrowableArray<int> g;
   g.Add(12);
   g.Add(4);
   g.Add(64);
   g.Add(8);
   g.Sort(greatestFirst);
   EXPECT_EQ(64, g[0]);
   EXPECT_EQ(4, g.Last());
 }
 
-
 TEST_CASE(GrowableHandlePtr) {
   Zone* zone = Thread::Current()->zone();
   GrowableHandlePtrArray<const String> test1(zone, 1);
   EXPECT_EQ(0, test1.length());
   test1.Add(Symbols::Int());
   EXPECT(test1[0].raw() == Symbols::Int().raw());
   EXPECT_EQ(1, test1.length());
 
   ZoneGrowableHandlePtrArray<const String>* test2 =
       new ZoneGrowableHandlePtrArray<const String>(zone, 1);
   test2->Add(Symbols::GetterPrefix());
   EXPECT((*test2)[0].raw() == Symbols::GetterPrefix().raw());
   EXPECT_EQ(1, test2->length());
 }
 
 }  // namespace dart