1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
* Copyright (C) 2013 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
WI.Timeline = class Timeline extends WI.Object
{
constructor(type)
{
super();
this._type = type;
this.reset(true);
}
// Static
static create(type)
{
if (type === WI.TimelineRecord.Type.Network)
return new WI.NetworkTimeline(type);
if (type === WI.TimelineRecord.Type.Memory)
return new WI.MemoryTimeline(type);
return new WI.Timeline(type);
}
// Public
get type() { return this._type; }
get startTime() { return this._startTime; }
get endTime() { return this._endTime; }
get records() { return this._records; }
reset(suppressEvents)
{
this._records = [];
this._startTime = NaN;
this._endTime = NaN;
if (!suppressEvents) {
this.dispatchEventToListeners(WI.Timeline.Event.TimesUpdated);
this.dispatchEventToListeners(WI.Timeline.Event.Reset);
}
}
addRecord(record)
{
if (record.updatesDynamically)
record.addEventListener(WI.TimelineRecord.Event.Updated, this._recordUpdated, this);
// Because records can be nested, it is possible that outer records with an early start time
// may be completed and added to the Timeline after inner records with a later start time
// were already added. In most cases this is a small drift, so make an effort to still keep
// the list sorted. Do it now, when inserting, so if the timeline is visible it has the
// best chance of being as accurate as possible during a recording.
this._tryInsertingRecordInSortedOrder(record);
this._updateTimesIfNeeded(record);
this.dispatchEventToListeners(WI.Timeline.Event.RecordAdded, {record});
}
saveIdentityToCookie(cookie)
{
cookie[WI.Timeline.TimelineTypeCookieKey] = this._type;
}
refresh()
{
this.dispatchEventToListeners(WI.Timeline.Event.Refreshed);
}
recordsInTimeRange(startTime, endTime, includeRecordBeforeStart)
{
let lowerIndex = this._records.lowerBound(startTime, (time, record) => time - record.timestamp);
let upperIndex = this._records.upperBound(endTime, (time, record) => time - record.timestamp);
// Include the record right before the start time.
if (includeRecordBeforeStart && lowerIndex > 0)
lowerIndex--;
return this._records.slice(lowerIndex, upperIndex);
}
// Private
_updateTimesIfNeeded(record)
{
var changed = false;
if (isNaN(this._startTime) || record.startTime < this._startTime) {
this._startTime = record.startTime;
changed = true;
}
if (isNaN(this._endTime) || this._endTime < record.endTime) {
this._endTime = record.endTime;
changed = true;
}
if (changed)
this.dispatchEventToListeners(WI.Timeline.Event.TimesUpdated);
}
_recordUpdated(event)
{
this._updateTimesIfNeeded(event.target);
}
_tryInsertingRecordInSortedOrder(record)
{
// Fast case add to the end.
let lastValue = this._records.lastValue;
if (!lastValue || lastValue.startTime < record.startTime || record.updatesDynamically) {
this._records.push(record);
return;
}
// Slow case, try to insert in the last 20 records.
let start = this._records.length - 2;
let end = Math.max(this._records.length - 20, 0);
for (let i = start; i >= end; --i) {
if (this._records[i].startTime < record.startTime) {
this._records.insertAtIndex(record, i + 1);
return;
}
}
// Give up and add to the end.
this._records.push(record);
}
};
WI.Timeline.Event = {
Reset: "timeline-reset",
RecordAdded: "timeline-record-added",
TimesUpdated: "timeline-times-updated",
Refreshed: "timeline-refreshed",
};
WI.Timeline.TimelineTypeCookieKey = "timeline-type";
|
