timeline.mjs 6.15 KB
Newer Older
1 2 3 4
// Copyright 2020 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

5 6
import {groupBy} from './helper.mjs'

7
class Timeline {
8
  // Class:
9
  _model;
10
  // Array of #model instances:
11
  _values;
12
  // Current selection, subset of #values:
13
  _selection;
14
  _breakdown;
15

16
  constructor(model, values = [], startTime = 0, endTime = 0) {
17
    this._model = model;
18 19 20
    this._values = values;
    this.startTime = startTime;
    this.endTime = endTime;
21
  }
22 23

  get model() {
24
    return this._model;
25 26
  }

27
  get all() {
28
    return this._values;
29
  }
30

31
  get selection() {
32
    return this._selection;
33
  }
34

35 36 37 38
  get selectionOrSelf() {
    return this._selection ?? this;
  }

39
  set selection(value) {
40
    this._selection = value;
41
  }
42

43
  selectTimeRange(startTime, endTime) {
44 45 46 47 48 49
    const items = this.range(startTime, endTime);
    this._selection = new Timeline(this._model, items, startTime, endTime);
  }

  clearSelection() {
    this._selection = undefined;
50
  }
51

52
  getChunks(windowSizeMs) {
53 54
    return this.chunkSizes(windowSizeMs);
  }
55

56
  get values() {
57
    return this._values;
58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
  }

  count(filter) {
    return this.all.reduce((sum, each) => {
      return sum + (filter(each) === true ? 1 : 0);
    }, 0);
  }

  filter(predicate) {
    return this.all.filter(predicate);
  }

  push(event) {
    let time = event.time;
    if (!this.isEmpty() && this.last().time > time) {
      // Invalid insertion order, might happen without --single-process,
      // finding insertion point.
      let insertionPoint = this.find(time);
76
      this._values.splice(insertionPoint, event);
77
    } else {
78
      this._values.push(event);
79 80 81 82 83 84 85 86 87 88 89 90
    }
    if (time > 0) {
      this.endTime = Math.max(this.endTime, time);
      if (this.startTime === 0) {
        this.startTime = time;
      } else {
        this.startTime = Math.min(this.startTime, time);
      }
    }
  }

  at(index) {
91
    return this._values[index];
92 93 94 95 96 97 98
  }

  isEmpty() {
    return this.size() === 0;
  }

  size() {
99
    return this._values.length;
100 101
  }

102 103 104 105
  get length() {
    return this._values.length;
  }

106 107 108 109
  slice(startIndex, endIndex) {
    return this._values.slice(startIndex, endIndex);
  }

110
  first() {
111
    return this._values[0];
112 113 114
  }

  last() {
115
    return this._values[this._values.length - 1];
116 117
  }

118 119 120 121
  * [Symbol.iterator]() {
    yield* this._values;
  }

122
  duration() {
123
    if (this.isEmpty()) return 0;
124 125 126 127
    return this.last().time - this.first().time;
  }

  forEachChunkSize(count, fn) {
128
    if (this.isEmpty()) return;
129 130 131 132
    const increment = this.duration() / count;
    let currentTime = this.first().time + increment;
    let index = 0;
    for (let i = 0; i < count; i++) {
133 134
      const nextIndex = this.find(currentTime, index);
      const nextTime = currentTime + increment;
135 136 137 138 139 140 141
      fn(index, nextIndex, currentTime, nextTime);
      index = nextIndex;
      currentTime = nextTime;
    }
  }

  chunkSizes(count) {
142
    const chunks = [];
143 144 145 146
    this.forEachChunkSize(count, (start, end) => chunks.push(end - start));
    return chunks;
  }

147 148
  chunks(count, predicate = undefined) {
    const chunks = [];
149
    this.forEachChunkSize(count, (start, end, startTime, endTime) => {
150
      let items = this._values.slice(start, end);
151
      if (predicate !== undefined) items = items.filter(predicate);
152 153 154 155 156
      chunks.push(new Chunk(chunks.length, startTime, endTime, items));
    });
    return chunks;
  }

157 158 159 160 161 162
  // Return all entries in ({startTime}, {endTime}]
  range(startTime, endTime) {
    const firstIndex = this.find(startTime);
    if (firstIndex < 0) return [];
    const lastIndex = this.find(endTime, firstIndex + 1);
    return this._values.slice(firstIndex, lastIndex);
163 164
  }

165
  // Return the first index for the first element at {time}.
166
  find(time, offset = 0) {
167
    return this._find(this._values, each => each.time - time, offset);
168 169
  }

170 171 172 173 174 175 176 177
  // Return the first index for which compareFn(item) is >= 0;
  _find(array, compareFn, offset = 0) {
    let minIndex = offset;
    let maxIndex = array.length - 1;
    while (minIndex < maxIndex) {
      const midIndex = minIndex + (((maxIndex - minIndex) / 2) | 0);
      if (compareFn(array[midIndex]) < 0) {
        minIndex = midIndex + 1;
178
      } else {
179
        maxIndex = midIndex;
180 181
      }
    }
182
    return minIndex;
183 184
  }

185
  getBreakdown(keyFunction) {
186
    if (keyFunction) return groupBy(this._values, keyFunction);
187
    if (this._breakdown === undefined) {
188
      this._breakdown = groupBy(this._values, each => each.type);
189
    }
190
    return this._breakdown;
191 192
  }

193
  depthHistogram() {
194
    return this._values.histogram(each => each.depth);
195 196 197
  }

  fanOutHistogram() {
198
    return this._values.histogram(each => each.children.length);
199 200 201
  }

  forEach(fn) {
202
    return this._values.forEach(fn);
203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
  }
}

// ===========================================================================
class Chunk {
  constructor(index, start, end, items) {
    this.index = index;
    this.start = start;
    this.end = end;
    this.items = items;
    this.height = 0;
  }

  isEmpty() {
    return this.items.length === 0;
  }

  last() {
    return this.at(this.size() - 1);
  }

  first() {
    return this.at(0);
  }

  at(index) {
    return this.items[index];
  }

  size() {
    return this.items.length;
  }

236 237 238 239
  get length() {
    return this.items.length;
  }

240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
  yOffset(event) {
    // items[0]   == oldest event, displayed at the top of the chunk
    // items[n-1] == youngest event, displayed at the bottom of the chunk
    return (1 - (this.indexOf(event) + 0.5) / this.size()) * this.height;
  }

  indexOf(event) {
    return this.items.indexOf(event);
  }

  has(event) {
    if (this.isEmpty()) return false;
    return this.first().time <= event.time && event.time <= this.last().time;
  }

  next(chunks) {
    return this.findChunk(chunks, 1);
  }

  prev(chunks) {
    return this.findChunk(chunks, -1);
  }

  findChunk(chunks, delta) {
    let i = this.index + delta;
    let chunk = chunks[i];
    while (chunk && chunk.size() === 0) {
      i += delta;
      chunk = chunks[i];
    }
    return chunk;
  }

273
  getBreakdown(keyFunction) {
274
    return groupBy(this.items, keyFunction);
275 276
  }

277
  filter() {
278
    return this.items.filter(map => !map.parent() || !this.has(map.parent()));
279 280 281
  }
}

282
export {Timeline, Chunk};