Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 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 248 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 259 * @param {number=} minNodeId | 259 * @param {number=} minNodeId |
| 260 * @param {number=} maxNodeId | 260 * @param {number=} maxNodeId |
| 261 * @constructor | 261 * @constructor |
| 262 */ | 262 */ |
| 263 WebInspector.HeapSnapshotCommon.NodeFilter = function(minNodeId, maxNodeId) | 263 WebInspector.HeapSnapshotCommon.NodeFilter = function(minNodeId, maxNodeId) |
| 264 { | 264 { |
| 265 /** @type {number|undefined} */ | 265 /** @type {number|undefined} */ |
| 266 this.minNodeId = minNodeId; | 266 this.minNodeId = minNodeId; |
| 267 /** @type {number|undefined} */ | 267 /** @type {number|undefined} */ |
| 268 this.maxNodeId = maxNodeId; | 268 this.maxNodeId = maxNodeId; |
| 269 /** @type {number|undefined} */ | |
| 270 this.allocationNodeId; | |
|
alph
2014/03/18 12:28:22
Looks like there are two distinct filter types: no
yurys
2014/03/18 12:30:47
I will need to filter by both id range and allocat
| |
| 269 } | 271 } |
| 270 | 272 |
| 271 WebInspector.HeapSnapshotCommon.NodeFilter.prototype = | 273 WebInspector.HeapSnapshotCommon.NodeFilter.prototype = |
| 272 { | 274 { |
| 273 /** | 275 /** |
| 274 * @param {!WebInspector.HeapSnapshotCommon.NodeFilter} o | 276 * @param {!WebInspector.HeapSnapshotCommon.NodeFilter} o |
| 275 * @return {boolean} | 277 * @return {boolean} |
| 276 */ | 278 */ |
| 277 equals: function(o) | 279 equals: function(o) |
| 278 { | 280 { |
| 279 return this.minNodeId === o.minNodeId && this.maxNodeId === o.maxNodeId; | 281 return this.minNodeId === o.minNodeId && this.maxNodeId === o.maxNodeId && this.allocationNodeId === o.allocationNodeId; |
| 280 } | 282 } |
| 281 } | 283 } |
| OLD | NEW |