Spaces:
Runtime error
Runtime error
File size: 9,181 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 202 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 236 237 238 239 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 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 | 'use strict'
const { test } = require('tap')
const { TimeTree } = require('../../lib/time-tree')
test('TimeTree is constructed with a root attribute, set to null', t => {
t.plan(1)
const tree = new TimeTree()
t.equal(tree.root, null)
})
test('TimeTree is constructed with an empty tableId-Map', t => {
t.plan(2)
const tree = new TimeTree()
t.ok(tree.tableId instanceof Map)
t.equal(tree.tableId.size, 0)
})
test('TimeTree is constructed with an empty tableLabel-Map', t => {
t.plan(2)
const tree = new TimeTree()
t.ok(tree.tableLabel instanceof Map)
t.equal(tree.tableLabel.size, 0)
})
test('TimeTree#toJSON dumps the content of the TimeTree', t => {
t.plan(1)
const tree = new TimeTree()
t.same(tree.toJSON(), {})
})
test('TimeTree#toJSON is creating new instances of its content, ensuring being immutable', t => {
t.plan(1)
const tree = new TimeTree()
t.not(tree.toJSON(), tree.toJSON())
})
test('TimeTree#start is adding a node with correct shape, root-node', t => {
t.plan(15)
const tree = new TimeTree()
tree.start(null, 'root')
const rootNode = tree.root
t.equal(Object.keys(rootNode).length, 7)
t.ok('parent' in rootNode)
t.equal(rootNode.parent, null)
t.ok('id' in rootNode)
t.type(rootNode.id, 'string')
t.ok('label' in rootNode)
t.type(rootNode.label, 'string')
t.ok('nodes' in rootNode)
t.ok(Array.isArray(rootNode.nodes))
t.ok('start' in rootNode)
t.ok(Number.isInteger(rootNode.start))
t.ok('stop' in rootNode)
t.type(rootNode.stop, 'null')
t.ok('diff' in rootNode)
t.type(rootNode.diff, 'number')
})
test('TimeTree#start is adding a node with correct shape, child-node', t => {
t.plan(16)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
const rootNode = tree.root
t.equal(rootNode.nodes.length, 1)
const childNode = rootNode.nodes[0]
t.equal(Object.keys(childNode).length, 7)
t.ok('parent' in childNode)
t.type(childNode.parent, 'string')
t.ok('id' in childNode)
t.type(childNode.id, 'string')
t.ok('label' in childNode)
t.type(childNode.label, 'string')
t.ok('nodes' in childNode)
t.ok(Array.isArray(childNode.nodes))
t.ok('start' in childNode)
t.ok(Number.isInteger(childNode.start))
t.ok('stop' in childNode)
t.type(childNode.stop, 'null')
t.ok('diff' in childNode)
t.type(childNode.diff, 'number')
})
test('TimeTree#start is adding a root element when parent is null', t => {
t.plan(9)
const tree = new TimeTree()
tree.start(null, 'root')
const rootNode = tree.root
t.type(rootNode, 'object')
t.equal(Object.keys(rootNode).length, 7)
t.equal(rootNode.parent, null)
t.equal(rootNode.id, 'root')
t.equal(rootNode.label, 'root')
t.ok(Array.isArray(rootNode.nodes))
t.equal(rootNode.nodes.length, 0)
t.ok(Number.isInteger(rootNode.start))
t.type(rootNode.diff, 'number')
})
test('TimeTree#start is adding a root element when parent does not exist', t => {
t.plan(9)
const tree = new TimeTree()
tree.start('invalid', 'root')
const rootNode = tree.root
t.type(rootNode, 'object')
t.equal(Object.keys(rootNode).length, 7)
t.equal(rootNode.parent, null)
t.equal(rootNode.id, 'root')
t.equal(rootNode.label, 'root')
t.ok(Array.isArray(rootNode.nodes))
t.equal(rootNode.nodes.length, 0)
t.ok(Number.isInteger(rootNode.start))
t.type(rootNode.diff, 'number')
})
test('TimeTree#start parameter start can override automatically generated start time', t => {
t.plan(1)
const tree = new TimeTree()
tree.start(null, 'root', 1337)
t.ok(tree.root.start, 1337)
})
test('TimeTree#start returns id of root, when adding a root node /1', t => {
t.plan(1)
const tree = new TimeTree()
t.equal(tree.start(null, 'root'), 'root')
})
test('TimeTree#start returns id of root, when adding a root node /2', t => {
t.plan(1)
const tree = new TimeTree()
t.equal(tree.start(null, '/'), 'root')
})
test('TimeTree#start returns id of child, when adding a child node', t => {
t.plan(1)
const tree = new TimeTree()
tree.start(null, 'root')
t.match(tree.start('root', 'child'), /^child-[0-9.]+$/)
})
test('TimeTree tracks node ids /1', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
t.equal(tree.tableId.size, 2)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[0].id))
})
test('TimeTree tracks node ids /2', t => {
t.plan(4)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('child', 'grandchild')
t.equal(tree.tableId.size, 3)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[0].id))
t.ok(tree.tableId.has(tree.root.nodes[0].nodes[0].id))
})
test('TimeTree tracks node ids /3', t => {
t.plan(4)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'child')
t.equal(tree.tableId.size, 3)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[0].id))
t.ok(tree.tableId.has(tree.root.nodes[1].id))
})
test('TimeTree tracks node labels /1', t => {
t.plan(4)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'sibling')
t.equal(tree.tableLabel.size, 3)
t.ok(tree.tableLabel.has('root'))
t.ok(tree.tableLabel.has('child'))
t.ok(tree.tableLabel.has('sibling'))
})
test('TimeTree tracks node labels /2', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'child')
t.equal(tree.tableLabel.size, 2)
t.ok(tree.tableLabel.has('root'))
t.ok(tree.tableLabel.has('child'))
})
test('TimeTree#stop returns undefined', t => {
t.plan(1)
const tree = new TimeTree()
tree.start(null, 'root')
t.type(tree.stop('root'), 'undefined')
})
test('TimeTree#stop sets stop value of node', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
t.type(tree.root.stop, 'null')
tree.stop('root')
t.type(tree.root.stop, 'number')
t.ok(Number.isInteger(tree.root.stop))
})
test('TimeTree#stop parameter stop is used as stop value of node', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
t.type(tree.root.stop, 'null')
tree.stop('root', 1337)
t.type(tree.root.stop, 'number')
t.equal(tree.root.stop, 1337)
})
test('TimeTree#stop calculates the diff', t => {
t.plan(4)
const tree = new TimeTree()
tree.start(null, 'root', 1)
t.type(tree.root.diff, 'number')
t.equal(tree.root.diff, -1)
tree.stop('root', 5)
t.type(tree.root.diff, 'number')
t.equal(tree.root.diff, 4)
})
test('TimeTree#stop does nothing when node is not found', t => {
t.plan(2)
const tree = new TimeTree()
tree.start(null, 'root')
t.type(tree.root.stop, 'null')
tree.stop('invalid')
t.type(tree.root.stop, 'null')
})
test('TimeTree untracks node ids /1', t => {
t.plan(2)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.stop(tree.root.nodes[0].id)
t.equal(tree.tableId.size, 1)
t.ok(tree.tableId.has('root'))
})
test('TimeTree untracks node ids /2', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('child', 'grandchild')
tree.stop(tree.root.nodes[0].nodes[0].id)
t.equal(tree.tableId.size, 2)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[0].id))
})
test('TimeTree untracks node ids /3', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'child')
tree.stop(tree.root.nodes[0].id)
t.equal(tree.tableId.size, 2)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[1].id))
})
test('TimeTree untracks node ids /4', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'child')
tree.stop(tree.root.nodes[1].id)
t.equal(tree.tableId.size, 2)
t.ok(tree.tableId.has('root'))
t.ok(tree.tableId.has(tree.root.nodes[0].id))
})
test('TimeTree untracks node labels /1', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'sibling')
tree.stop(tree.root.nodes[1].id)
t.equal(tree.tableLabel.size, 2)
t.ok(tree.tableLabel.has('root'))
t.ok(tree.tableLabel.has('child'))
})
test('TimeTree untracks node labels /2', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'sibling')
tree.stop(tree.root.nodes[0].id)
t.equal(tree.tableLabel.size, 2)
t.ok(tree.tableLabel.has('root'))
t.ok(tree.tableLabel.has('sibling'))
})
test('TimeTree does not untrack label if used by other node', t => {
t.plan(3)
const tree = new TimeTree()
tree.start(null, 'root')
tree.start('root', 'child')
tree.start('root', 'child')
tree.stop(tree.root.nodes[0].id)
t.equal(tree.tableLabel.size, 2)
t.ok(tree.tableLabel.has('root'))
t.ok(tree.tableLabel.has('child'))
})
|