DevTools: Nuke Dominators view from heap profiler.

Source/devtools/front_end/profiler/heap_snapshot_worker/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 1065 matching lines @@
     },
 
     _getDominatedIndex: function(nodeIndex)
     {
         if (nodeIndex % this._nodeFieldCount)
             throw new Error("Invalid nodeIndex: " + nodeIndex);
         return this._firstDominatedNodeIndex[nodeIndex / this._nodeFieldCount];
     },
 
     /**
-     * @param {!WebInspector.HeapSnapshotNode} node
-     * @return {!Uint32Array}
-     */
-    _dominatedNodesOfNode: function(node)
-    {
-        var dominatedIndexFrom = this._getDominatedIndex(node.nodeIndex);
-        var dominatedIndexTo = this._getDominatedIndex(node._nextNodeIndex());
-        return this._dominatedNodes.subarray(dominatedIndexFrom, dominatedIndexTo);
-    },
-
-    /**
      * @param {!WebInspector.HeapSnapshotCommon.NodeFilter} nodeFilter
      * @return {!Object.<string, !WebInspector.HeapSnapshotCommon.Aggregate>}
      */
     aggregatesWithFilter: function(nodeFilter)
     {
         var minNodeId = nodeFilter.minNodeId;
         var maxNodeId = nodeFilter.maxNodeId;
         var allocationNodeId = nodeFilter.allocationNodeId;
         var key;
         var filter;
@@ skipping 755 matching lines @@
     {
         var ids = [];
         for (var it = this._allNodes(); it.hasNext(); it.next()) {
             if (it.item().name() === name)
                 ids.push(it.item().id());
         }
         return ids;
     },
 
     /**
-     * @param {string} snapshotObjectId
-     * @return {?Array.<string>}
-     */
-    dominatorIdsForNode: function(snapshotObjectId)
-    {
-        var node = this._nodeForSnapshotObjectId(snapshotObjectId);
-        if (!node)
-            return null;
-        var result = [];
-        while (!node.isRoot()) {
-            result.push(node.id());
-            node.nodeIndex = node.dominatorIndex();
-        }
-        return result;
-    },
-
-    /**
      * @param {number} nodeIndex
      * @return {!WebInspector.HeapSnapshotEdgesProvider}
      */
     createEdgesProvider: function(nodeIndex)
     {
         var node = this.createNode(nodeIndex);
         var filter = this.containmentEdgesFilter();
         var indexProvider = new WebInspector.HeapSnapshotEdgeIndexProvider(this);
         return new WebInspector.HeapSnapshotEdgesProvider(this, filter, node.edges(), indexProvider);
     },
@@ skipping 71 matching lines @@
      * @param {string} className
      * @param {!WebInspector.HeapSnapshotCommon.NodeFilter} nodeFilter
      * @return {!WebInspector.HeapSnapshotNodesProvider}
      */
     createNodesProviderForClass: function(className, nodeFilter)
     {
         return new WebInspector.HeapSnapshotNodesProvider(this, this.classNodesFilter(), this.aggregatesWithFilter(nodeFilter)[className].idxs);
     },
 
     /**
-     * @param {number} nodeIndex
-     * @return {!WebInspector.HeapSnapshotNodesProvider}
-     */
-    createNodesProviderForDominator: function(nodeIndex)
-    {
-        var node = this.createNode(nodeIndex);
-        return new WebInspector.HeapSnapshotNodesProvider(this, null, this._dominatedNodesOfNode(node));
-    },
-
-    /**
      * @return {number}
      */
     _maxJsNodeId: function()
     {
         var nodeFieldCount = this._nodeFieldCount;
         var nodes = this._nodes;
         var nodesLength = nodes.length;
         var id = 0;
         for (var nodeIndex = this._nodeIdOffset; nodeIndex < nodesLength; nodeIndex += nodeFieldCount) {
             var nextId = nodes[nodeIndex];
@@ skipping 284 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
 }