Use std::deque for storing edges and children in heap snapshot.

src/profiler/heap-snapshot-generator-inl.h

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_
 #define V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_
 
 #include "src/profiler/heap-snapshot-generator.h"
 
 namespace v8 {
@@ skipping 20 matching lines @@
 }
 
 
 int HeapEntry::set_children_index(int index) {
   children_index_ = index;
   int next_index = index + children_count_;
   children_count_ = 0;
   return next_index;
 }
 
+std::deque<HeapGraphEdge*>::iterator HeapEntry::children_begin() {
+  DCHECK(children_index_ >= 0);
+  SLOW_DCHECK(
+      children_index_ < static_cast<int>(snapshot_->children().size()) ||
+      (children_index_ == static_cast<int>(snapshot_->children().size()) &&
+       children_count_ == 0));
+  return snapshot_->children().begin() + children_index_;
+}
 
-HeapGraphEdge** HeapEntry::children_arr() {
-  DCHECK(children_index_ >= 0);
-  SLOW_DCHECK(children_index_ < snapshot_->children().length() ||
-      (children_index_ == snapshot_->children().length() &&
-       children_count_ == 0));
-  return &snapshot_->children().first() + children_index_;
+std::deque<HeapGraphEdge*>::iterator HeapEntry::children_end() {
+  return children_begin() + children_count_;
 }
 
 
 Isolate* HeapEntry::isolate() const { return snapshot_->profiler()->isolate(); }
 
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_