File size: 4,000 Bytes
23ac194
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
'use strict'

const {
  kUntrackNode,
  kTrackNode,
  kGetParent,
  kGetNode,
  kAddNode
} = require('./symbols')

/**
 * Node of the TimeTree
 * @typedef {object} TimeTreeNode
 * @property {string} id
 * @property {string|null} parent
 * @property {string} label
 * @property {Array<TimeTreeNode>} nodes
 * @property {number} start
 * @property {number|undefined} stop
 * @property {number|undefined} diff
 */

class TimeTree {
  constructor () {
    /**
     * @type {TimeTreeNode|null} root
     * @public
     */
    this.root = null

    /**
     * @type {Map<string, TimeTreeNode>} tableId
     * @public
     */
    this.tableId = new Map()

    /**
     * @type {Map<string, Array<TimeTreeNode>>} tableLabel
     * @public
     */
    this.tableLabel = new Map()
  }

  /**
   * @param {TimeTreeNode} node
   */
  [kTrackNode] (node) {
    this.tableId.set(node.id, node)
    if (this.tableLabel.has(node.label)) {
      this.tableLabel.get(node.label).push(node)
    } else {
      this.tableLabel.set(node.label, [node])
    }
  }

  /**
   * @param {TimeTreeNode} node
   */
  [kUntrackNode] (node) {
    this.tableId.delete(node.id)

    const labelNode = this.tableLabel.get(node.label)
    labelNode.pop()

    if (labelNode.length === 0) {
      this.tableLabel.delete(node.label)
    }
  }

  /**
   * @param {string} parent
   * @returns {TimeTreeNode}
   */
  [kGetParent] (parent) {
    if (parent === null) {
      return null
    } else if (this.tableLabel.has(parent)) {
      const parentNode = this.tableLabel.get(parent)
      return parentNode[parentNode.length - 1]
    } else {
      return null
    }
  }

  /**
   *
   * @param {string} nodeId
   * @returns {TimeTreeNode}
   */
  [kGetNode] (nodeId) {
    return this.tableId.get(nodeId)
  }

  /**
   * @param {string} parent
   * @param {string} label
   * @param {number} start
   * @returns {TimeTreeNode["id"]}
   */
  [kAddNode] (parent, label, start) {
    const parentNode = this[kGetParent](parent)
    const isRoot = parentNode === null

    if (isRoot) {
      this.root = {
        parent: null,
        id: 'root',
        label,
        nodes: [],
        start,
        stop: null,
        diff: -1
      }
      this[kTrackNode](this.root)
      return this.root.id
    }

    const nodeId = `${label}-${Math.random()}`
    /**
     * @type {TimeTreeNode}
     */
    const childNode = {
      parent,
      id: nodeId,
      label,
      nodes: [],
      start,
      stop: null,
      diff: -1
    }
    parentNode.nodes.push(childNode)
    this[kTrackNode](childNode)
    return nodeId
  }

  /**
   * @param {string} parent
   * @param {string} label
   * @param {number|undefined} start
   * @returns {TimeTreeNode["id"]}
   */
  start (parent, label, start = Date.now()) {
    return this[kAddNode](parent, label, start)
  }

  /**
   * @param {string} nodeId
   * @param {number|undefined} stop
   */
  stop (nodeId, stop = Date.now()) {
    const node = this[kGetNode](nodeId)
    if (node) {
      node.stop = stop
      node.diff = (node.stop - node.start) || 0
      this[kUntrackNode](node)
    }
  }

  /**
   * @returns {TimeTreeNode}
   */
  toJSON () {
    return Object.assign({}, this.root)
  }

  /**
   * @returns {string}
   */
  prettyPrint () {
    return prettyPrintTimeTree(this.toJSON())
  }
}

/**
 * @param {TimeTreeNode} obj
 * @param {string|undefined} prefix
 * @returns {string}
 */
function prettyPrintTimeTree (obj, prefix = '') {
  let result = prefix

  const nodesCount = obj.nodes.length
  const lastIndex = nodesCount - 1
  result += `${obj.label} ${obj.diff} ms\n`

  for (let i = 0; i < nodesCount; ++i) {
    const node = obj.nodes[i]
    const prefix_ = prefix + (i === lastIndex ? '  ' : '│ ')

    result += prefix
    result += (i === lastIndex ? '└─' : '├─')
    result += (node.nodes.length === 0 ? '─ ' : '┬ ')
    result += prettyPrintTimeTree(node, prefix_).slice(prefix.length + 2)
  }
  return result
}

module.exports = {
  TimeTree
}