| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 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 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 /** | 31 /** |
| 32 * @constructor | 32 * @constructor |
| 33 * @extends {WebInspector.TargetAwareObject} | 33 * @extends {WebInspector.SDKObject} |
| 34 * @param {!WebInspector.Target} target | 34 * @param {!WebInspector.Target} target |
| 35 */ | 35 */ |
| 36 WebInspector.TimelineModel = function(target) | 36 WebInspector.TimelineModel = function(target) |
| 37 { | 37 { |
| 38 WebInspector.TargetAwareObject.call(this, target); | 38 WebInspector.SDKObject.call(this, target); |
| 39 this._filters = []; | 39 this._filters = []; |
| 40 } | 40 } |
| 41 | 41 |
| 42 WebInspector.TimelineModel.RecordType = { | 42 WebInspector.TimelineModel.RecordType = { |
| 43 Root: "Root", | 43 Root: "Root", |
| 44 Program: "Program", | 44 Program: "Program", |
| 45 EventDispatch: "EventDispatch", | 45 EventDispatch: "EventDispatch", |
| 46 | 46 |
| 47 GPUTask: "GPUTask", | 47 GPUTask: "GPUTask", |
| 48 | 48 |
| (...skipping 273 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 322 }, | 322 }, |
| 323 | 323 |
| 324 /** | 324 /** |
| 325 * @return {!Array.<!WebInspector.TimelineModel.Record>} | 325 * @return {!Array.<!WebInspector.TimelineModel.Record>} |
| 326 */ | 326 */ |
| 327 eventDividerRecords: function() | 327 eventDividerRecords: function() |
| 328 { | 328 { |
| 329 return this._eventDividerRecords; | 329 return this._eventDividerRecords; |
| 330 }, | 330 }, |
| 331 | 331 |
| 332 __proto__: WebInspector.TargetAwareObject.prototype | 332 __proto__: WebInspector.SDKObject.prototype |
| 333 } | 333 } |
| 334 | 334 |
| 335 /** | 335 /** |
| 336 * @interface | 336 * @interface |
| 337 */ | 337 */ |
| 338 WebInspector.TimelineModel.Record = function() | 338 WebInspector.TimelineModel.Record = function() |
| 339 { | 339 { |
| 340 } | 340 } |
| 341 | 341 |
| 342 WebInspector.TimelineModel.Record.prototype = { | 342 WebInspector.TimelineModel.Record.prototype = { |
| (...skipping 161 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 504 function recordTimestampComparator(a, b) | 504 function recordTimestampComparator(a, b) |
| 505 { | 505 { |
| 506 // Never return 0, as the merge function will squash identical entri
es. | 506 // Never return 0, as the merge function will squash identical entri
es. |
| 507 return a.startTime() < b.startTime() ? -1 : 1; | 507 return a.startTime() < b.startTime() ? -1 : 1; |
| 508 } | 508 } |
| 509 var result = this._backgroundRecordsBuffer.mergeOrdered(records, recordT
imestampComparator); | 509 var result = this._backgroundRecordsBuffer.mergeOrdered(records, recordT
imestampComparator); |
| 510 this._backgroundRecordsBuffer = []; | 510 this._backgroundRecordsBuffer = []; |
| 511 return result; | 511 return result; |
| 512 } | 512 } |
| 513 } | 513 } |
| OLD | NEW |