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

runtime/bin/hashmap_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 "platform/hashmap.h"
 #include "platform/assert.h"
 #include "platform/globals.h"
-#include "platform/hashmap.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 // Default initial size of hashmaps used in these tests.
 static intptr_t kInitialSize = 8;
 
-
 typedef uint32_t (*IntKeyHash)(uint32_t key);
 
-
 class IntSet {
  public:
   explicit IntSet(IntKeyHash hash)
       : hash_(hash), map_(HashMap::SamePointerValue, kInitialSize) {}
 
   void Insert(int x) {
     EXPECT_NE(0, x);  // 0 corresponds to (void*)NULL - illegal key value
     HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x), true);
     EXPECT(p != NULL);  // insert is set!
     EXPECT_EQ(reinterpret_cast<void*>(x), p->key);
@@ skipping 23 matching lines @@
     }
     EXPECT_EQ(map_.occupancy_, count);
     return count;
   }
 
  private:
   IntKeyHash hash_;
   HashMap map_;
 };
 
-
 static uint32_t WordHash(uint32_t key) {
   return dart::Utils::WordHash(key);
 }
 static uint32_t Hash(uint32_t key) {
   return 23;
 }
 static uint32_t CollisionHash1(uint32_t key) {
   return key & 0x3;
 }
 static uint32_t CollisionHash2(uint32_t key) {
   return kInitialSize - 1;
 }
 static uint32_t CollisionHash3(uint32_t key) {
   return kInitialSize - 2;
 }
 static uint32_t CollisionHash4(uint32_t key) {
   return kInitialSize - 2;
 }
 
-
 void TestSet(IntKeyHash hash, int size) {
   IntSet set(hash);
   EXPECT_EQ(0u, set.occupancy());
 
   set.Insert(1);
   set.Insert(2);
   set.Insert(3);
   set.Insert(4);
   EXPECT_EQ(4u, set.occupancy());
 
@@ skipping 70 matching lines @@
         EXPECT(!set.Present(y));
       } else {
         EXPECT(set.Present(y));
       }
       y = y * factor + offset;
     }
   }
   EXPECT_EQ(0u, set.occupancy());
 }
 
-
 VM_UNIT_TEST_CASE(HashMap_Basic) {
   TestSet(WordHash, 100);
   TestSet(Hash, 100);
   TestSet(CollisionHash1, 50);
   TestSet(CollisionHash2, 50);
   TestSet(CollisionHash3, 50);
   TestSet(CollisionHash4, 50);
 }
 
 }  // namespace dart