Remove HeapSnapshotItemIterator.rewind

Source/devtools/front_end/HeapSnapshot.js

 /*
  * Copyright (C) 2011 Google Inc. 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
@@ skipping 119 matching lines @@
 };
 
 
 
 /**
  * @interface
  */
 WebInspector.HeapSnapshotItemIterator = function() { }
 
 WebInspector.HeapSnapshotItemIterator.prototype = {
-    rewind: function() { },
-
     /**
      * @return {boolean}
      */
     hasNext: function() { },
 
     /**
      * @return {number}
      */
     index: function() { },
 
@@ skipping 16 matching lines @@
  * @constructor
  * @implements {WebInspector.HeapSnapshotItemIterator}
  * @param {!WebInspector.HeapSnapshotEdge} edge
  */
 WebInspector.HeapSnapshotEdgeIterator = function(edge)
 {
     this.edge = edge;
 }
 
 WebInspector.HeapSnapshotEdgeIterator.prototype = {
-    rewind: function()
-    {
-        this.edge.edgeIndex = 0;
-    },
-
     /**
      * @return {boolean}
      */
     hasNext: function()
     {
         return this.edge.edgeIndex < this.edge._edges.length;
     },
 
     /**
      * @return {number}
@@ skipping 174 matching lines @@
  * @constructor
  * @implements {WebInspector.HeapSnapshotItemIterator}
  * @param {!WebInspector.HeapSnapshotRetainerEdge} retainer
  */
 WebInspector.HeapSnapshotRetainerEdgeIterator = function(retainer)
 {
     this.retainer = retainer;
 }
 
 WebInspector.HeapSnapshotRetainerEdgeIterator.prototype = {
-    rewind: function()
-    {
-        this.retainer.setRetainerIndex(0);
-    },
-
     /**
      * @return {boolean}
      */
     hasNext: function()
     {
         return this.retainer.retainerIndex() < this.retainer._retainersCount;
     },
 
     /**
      * @return {number}
@@ skipping 251 matching lines @@
  * @implements {WebInspector.HeapSnapshotItemIterator}
  * @param {!WebInspector.HeapSnapshotNode} node
  */
 WebInspector.HeapSnapshotNodeIterator = function(node)
 {
     this.node = node;
     this._nodesLength = node._snapshot._nodes.length;
 }
 
 WebInspector.HeapSnapshotNodeIterator.prototype = {
-    rewind: function()
-    {
-        this.node.nodeIndex = this.node._firstNodeIndex;
-    },
-
     /**
      * @return {boolean}
      */
     hasNext: function()
     {
         return this.node.nodeIndex < this._nodesLength;
     },
 
     /**
      * @return {number}
@@ skipping 34 matching lines @@
  */
 WebInspector.HeapSnapshotIndexRangeIterator = function(iterator, indexes)
 {
     this._iterator = iterator;
     this._indexes = indexes;
     this._position = 0;
     this._forcedIndex = -1;
 }
 
 WebInspector.HeapSnapshotIndexRangeIterator.prototype = {
-    rewind: function() { },
-
     /**
      * @return {boolean}
      */
     hasNext: function()
     {
         return this._position < this._indexes.length
     },
 
     /**
      * @return {number}
@@ skipping 35 matching lines @@
  * @param {!WebInspector.HeapSnapshotItemIterator} iterator
  */
 WebInspector.HeapSnapshotFilteredIterator = function(iterator, filter)
 {
     this._iterator = iterator;
     this._filter = filter;
     this._skipFilteredItems();
 }
 
 WebInspector.HeapSnapshotFilteredIterator.prototype = {
-    rewind: function() { },
-
     /**
      * @return {boolean}
      */
     hasNext: function()
     {
         return this._iterator.hasNext();
     },
 
     /**
      * @return {number}
@@ skipping 1530 matching lines @@
      * @param {number} windowRight
      */
     sort: function(comparator, leftBound, rightBound, windowLeft, windowRight)
     {
         this._iterationOrder.sortRange(this._buildCompareFunction(comparator), leftBound, rightBound, windowLeft, windowRight);
     },
 
     __proto__: WebInspector.HeapSnapshotItemProvider.prototype
 }