node/benchmark/util
Anatoli Papirovski 6f6f7f749b
lib: add internal PriorityQueue class
An efficient JS implementation of a binary heap on top of an array with
worst-case O(log n) runtime for all operations, including arbitrary
item removal (unlike O(n) for most binary heap array implementations).

PR-URL: https://github.com/nodejs/node/pull/20555
Fixes: https://github.com/nodejs/node/issues/16105
Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl>
Reviewed-By: Jeremiah Senkpiel <fishrock123@rocketmail.com>
Reviewed-By: Matteo Collina <matteo.collina@gmail.com>
Reviewed-By: James M Snell <jasnell@gmail.com>
Reviewed-By: Ruben Bridgewater <ruben@bridgewater.de>
2018-05-22 23:24:37 +04:00
..
format.js benchmark: refactor 2018-02-01 10:49:04 +01:00
inspect-array.js benchmark: refactor 2018-02-01 10:49:04 +01:00
inspect-proxy.js benchmark: improve and add more inspect benchmarks 2017-09-14 21:46:25 -03:00
inspect.js util: use faster -0 check 2017-10-04 03:51:44 -04:00
normalize-encoding.js benchmark: (util/v8/vm) use destructuring 2018-01-23 01:29:17 +01:00
priority-queue.js lib: add internal PriorityQueue class 2018-05-22 23:24:37 +04:00
splice-one.js util: improve spliceOne perf 2018-05-03 14:47:17 +02:00
type-check.js benchmark: (util/v8/vm) use destructuring 2018-01-23 01:29:17 +01:00