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

runtime/vm/object_graph_test.cc

 // Copyright (c) 2014, 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/object_graph.h"
 #include "platform/assert.h"
-#include "vm/object_graph.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 class CounterVisitor : public ObjectGraph::Visitor {
  public:
   // Records the number of objects and total size visited, excluding 'skip'
   // and any objects only reachable through 'skip'.
   CounterVisitor(RawObject* skip, RawObject* expected_parent)
       : count_(0), size_(0), skip_(skip), expected_parent_(expected_parent) {}
@@ skipping 13 matching lines @@
   int count() const { return count_; }
   int size() const { return size_; }
 
  private:
   int count_;
   intptr_t size_;
   RawObject* skip_;
   RawObject* expected_parent_;
 };
 
-
 ISOLATE_UNIT_TEST_CASE(ObjectGraph) {
   Isolate* isolate = thread->isolate();
   // Create a simple object graph with objects a, b, c, d:
   //  a+->b+->c
   //  +   +
   //  |   v
   //  +-->d
   Array& a = Array::Handle(Array::New(12, Heap::kNew));
   Array& b = Array::Handle(Array::New(2, Heap::kOld));
   Array& c = Array::Handle(Array::New(0, Heap::kOld));
@@ skipping 82 matching lines @@
       Array& expected_a = Array::Handle();
       expected_a ^= path.At(4);
       EXPECT(expected_c.raw() == c.raw());
       EXPECT(expected_b.raw() == a.At(10));
       EXPECT(expected_a.raw() == a.raw());
     }
   }
 }
 
 }  // namespace dart