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

runtime/vm/hash_table_test.cc

Index: runtime/vm/hash_table_test.cc
diff --git a/runtime/vm/hash_table_test.cc b/runtime/vm/hash_table_test.cc
index 9c8daca94d4bd0ea9bed51fb5adf913a75d31eab..88858d39e1b867af77459c91ab5f69fc85c061a4 100644
--- a/runtime/vm/hash_table_test.cc
+++ b/runtime/vm/hash_table_test.cc
@@ -11,8 +11,8 @@
 #include <vector>
 
 #include "platform/assert.h"
-#include "vm/unit_test.h"
 #include "vm/hash_table.h"
+#include "vm/unit_test.h"
 
 namespace dart {
 
@@ -35,7 +35,6 @@ class TestTraits {
   static RawObject* NewKey(const char* key) { return String::New(key); }
 };
 
-
 template <typename Table>
 void Validate(const Table& table) {
   // Verify consistency of entry state tracking.
@@ -54,7 +53,6 @@ void Validate(const Table& table) {
   EXPECT_EQ(0, num_deleted);
 }
 
-
 TEST_CASE(HashTable) {
   typedef HashTable<TestTraits, 2, 1> Table;
   Table table(Thread::Current()->zone(), HashTables::New<Table>(5));
@@ -115,7 +113,6 @@ TEST_CASE(HashTable) {
   table.Release();
 }
 
-
 std::string ToStdString(const String& str) {
   EXPECT(str.IsOneByteString());
   std::string result;
@@ -125,7 +122,6 @@ std::string ToStdString(const String& str) {
   return result;
 }
 
-
 // Checks that 'expected' and 'actual' are equal sets. If 'ordered' is true,
 // it also verifies that their iteration orders match, i.e., that actual's
 // insertion order coincides with lexicographic order.
@@ -156,7 +152,6 @@ void VerifyStringSetsEqual(const std::set<std::string>& expected,
       std::equal(actual_vec.begin(), actual_vec.end(), expected_vec.begin()));
 }
 
-
 // Checks that 'expected' and 'actual' are equal maps. If 'ordered' is true,
 // it also verifies that their iteration orders match, i.e., that actual's
 // insertion order coincides with lexicographic order.
@@ -193,7 +188,6 @@ void VerifyStringMapsEqual(const std::map<std::string, int>& expected,
   }
 }
 
-
 template <typename Set>
 void TestSet(intptr_t initial_capacity, bool ordered) {
   std::set<std::string> expected;
@@ -219,7 +213,6 @@ void TestSet(intptr_t initial_capacity, bool ordered) {
   actual.Release();
 }
 
-
 template <typename Map>
 void TestMap(intptr_t initial_capacity, bool ordered) {
   std::map<std::string, int> expected;
@@ -250,7 +243,6 @@ void TestMap(intptr_t initial_capacity, bool ordered) {
   actual.Release();
 }
 
-
 TEST_CASE(Sets) {
   for (intptr_t initial_capacity = 0; initial_capacity < 32;
        ++initial_capacity) {
@@ -258,7 +250,6 @@ TEST_CASE(Sets) {
   }
 }
 
-
 TEST_CASE(Maps) {
   for (intptr_t initial_capacity = 0; initial_capacity < 32;
        ++initial_capacity) {