Keep two empty lines between declarations for cpp files

test/cctest/test-types.cc

 // Copyright 2013 the V8 project authors. 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
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 44 matching lines @@
     CHECK_EQ(AsClass(*type1), AsClass(*type2));
   } else if (IsConstant(*type1)) {
     CHECK_EQ(AsConstant(*type1), AsConstant(*type2));
   } else if (IsUnion(*type1)) {
     CHECK_EQ(AsUnion(*type1)->length(), AsUnion(*type2)->length());
   }
   CHECK(type1->Is(type2));
   CHECK(type2->Is(type1));
 }
 
+
 static void CheckSub(Handle<Type> type1, Handle<Type> type2) {
   CHECK(type1->Is(type2));
   CHECK(!type2->Is(type1));
   if (IsBitset(*type1) && IsBitset(*type2)) {
     CHECK_NE(AsBitset(*type1), AsBitset(*type2));
   }
 }
 
+
 static void CheckUnordered(Handle<Type> type1, Handle<Type> type2) {
   CHECK(!type1->Is(type2));
   CHECK(!type2->Is(type1));
   if (IsBitset(*type1) && IsBitset(*type2)) {
     CHECK_NE(AsBitset(*type1), AsBitset(*type2));
   }
 }
 
+
 static void CheckOverlap(Handle<Type> type1, Handle<Type> type2) {
   CHECK(type1->Maybe(type2));
   CHECK(type2->Maybe(type1));
   if (IsBitset(*type1) && IsBitset(*type2)) {
     CHECK_NE(0, AsBitset(*type1) & AsBitset(*type2));
   }
 }
 
+
 static void CheckDisjoint(Handle<Type> type1, Handle<Type> type2) {
   CHECK(!type1->Is(type2));
   CHECK(!type2->Is(type1));
   CHECK(!type1->Maybe(type2));
   CHECK(!type2->Maybe(type1));
   if (IsBitset(*type1) && IsBitset(*type2)) {
     CHECK_EQ(0, AsBitset(*type1) & AsBitset(*type2));
   }
 }
 
@@ skipping 598 matching lines @@
           T.Union(T.Union(T.ObjectConstant2, T.ObjectConstant1), T.ArrayClass),
           T.Union(
               T.ObjectConstant1, T.Union(T.ArrayConstant1, T.ObjectConstant2))),
       T.Union(T.ObjectConstant2, T.ObjectConstant1));
   CheckEqual(
       T.Intersect(
           T.Union(T.ObjectConstant2, T.ArrayConstant1),
           T.Union(T.ObjectConstant1, T.ArrayConstant2)),
       T.ArrayConstant1);
 }