OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 1106 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1117 | 1117 |
1118 /** | 1118 /** |
1119 * @param {number} minNodeId | 1119 * @param {number} minNodeId |
1120 * @param {number} maxNodeId | 1120 * @param {number} maxNodeId |
1121 * @return {function(!WebInspector.HeapSnapshotNode):boolean} | 1121 * @return {function(!WebInspector.HeapSnapshotNode):boolean} |
1122 */ | 1122 */ |
1123 _createNodeIdFilter: function(minNodeId, maxNodeId) | 1123 _createNodeIdFilter: function(minNodeId, maxNodeId) |
1124 { | 1124 { |
1125 /** | 1125 /** |
1126 * @param {!WebInspector.HeapSnapshotNode} node | 1126 * @param {!WebInspector.HeapSnapshotNode} node |
1127 * @return boolean | 1127 * @return {boolean} |
1128 */ | 1128 */ |
1129 function nodeIdFilter(node) | 1129 function nodeIdFilter(node) |
1130 { | 1130 { |
1131 var id = node.id(); | 1131 var id = node.id(); |
1132 return id > minNodeId && id <= maxNodeId; | 1132 return id > minNodeId && id <= maxNodeId; |
1133 } | 1133 } |
1134 return nodeIdFilter; | 1134 return nodeIdFilter; |
1135 }, | 1135 }, |
1136 | 1136 |
1137 /** | 1137 /** |
1138 * @param {number} bottomUpAllocationNodeId | 1138 * @param {number} bottomUpAllocationNodeId |
1139 * @return {function(!WebInspector.HeapSnapshotNode):boolean|undefined} | 1139 * @return {function(!WebInspector.HeapSnapshotNode):boolean|undefined} |
1140 */ | 1140 */ |
1141 _createAllocationStackFilter: function(bottomUpAllocationNodeId) | 1141 _createAllocationStackFilter: function(bottomUpAllocationNodeId) |
1142 { | 1142 { |
1143 var traceIds = this._allocationProfile.traceIds(bottomUpAllocationNodeId
); | 1143 var traceIds = this._allocationProfile.traceIds(bottomUpAllocationNodeId
); |
1144 if (!traceIds.length) | 1144 if (!traceIds.length) |
1145 return undefined; | 1145 return undefined; |
1146 var set = {}; | 1146 var set = {}; |
1147 for (var i = 0; i < traceIds.length; i++) | 1147 for (var i = 0; i < traceIds.length; i++) |
1148 set[traceIds[i]] = true; | 1148 set[traceIds[i]] = true; |
1149 /** | 1149 /** |
1150 * @param {!WebInspector.HeapSnapshotNode} node | 1150 * @param {!WebInspector.HeapSnapshotNode} node |
1151 * @return boolean | 1151 * @return {boolean} |
1152 */ | 1152 */ |
1153 function traceIdFilter(node) | 1153 function traceIdFilter(node) |
1154 { | 1154 { |
1155 return !!set[node.traceNodeId()]; | 1155 return !!set[node.traceNodeId()]; |
1156 }; | 1156 }; |
1157 return traceIdFilter; | 1157 return traceIdFilter; |
1158 }, | 1158 }, |
1159 | 1159 |
1160 /** | 1160 /** |
1161 * @param {boolean} sortedIndexes | 1161 * @param {boolean} sortedIndexes |
(...skipping 1122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2284 * @param {number} windowRight | 2284 * @param {number} windowRight |
2285 */ | 2285 */ |
2286 sort: function(comparator, leftBound, rightBound, windowLeft, windowRight) | 2286 sort: function(comparator, leftBound, rightBound, windowLeft, windowRight) |
2287 { | 2287 { |
2288 this._iterationOrder.sortRange(this._buildCompareFunction(comparator), l
eftBound, rightBound, windowLeft, windowRight); | 2288 this._iterationOrder.sortRange(this._buildCompareFunction(comparator), l
eftBound, rightBound, windowLeft, windowRight); |
2289 }, | 2289 }, |
2290 | 2290 |
2291 __proto__: WebInspector.HeapSnapshotItemProvider.prototype | 2291 __proto__: WebInspector.HeapSnapshotItemProvider.prototype |
2292 } | 2292 } |
2293 | 2293 |
OLD | NEW |