@digigov/benchmark - npm Package Compare versions

Comparing version 1.0.5-0edebf87 to 1.0.5-113e6661

cjs/index.js

 "use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-var _typeof = require("@babel/runtime/helpers/typeof");
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var src_exports = {};
+__export(src_exports, {
+  default: () => src_default
 });
-exports["default"] = void 0;
-var _asyncToGenerator2 = _interopRequireDefault(require("@babel/runtime/helpers/asyncToGenerator"));
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-/**
- * BenchmarkProfiler class for running benchmarks
- */
-var BenchmarkProfiler = /*#__PURE__*/function () {
+module.exports = __toCommonJS(src_exports);
+class BenchmarkProfiler {
   /**
@@ -29,23 +34,6 @@ * Create a new BenchmarkProfiler instance
    */
-  function BenchmarkProfiler(options) {
-    (0, _classCallCheck2["default"])(this, BenchmarkProfiler);
-    /**  The benchmarks to run */
-    this.benchmarks = void 0;
-    /** The number of iterations to run per benchmark */
-    this.iterations = void 0;
-    /** The number of concurrent iterations to run per benchmark */
-    this.concurrency = void 0;
-    /** Accumulator for the total execution time (in nanoseconds) of all iterations of a benchmark */
-    this.timeAccumulator = void 0;
-    /** The last timing recorded by the profiler in nanoseconds */
-    this.lastTiming = void 0;
-    /** Accumulator for the total bytes of memory usage of all iterations of a benchmark */
-    this.memoryAccumulator = void 0;
-    /** The last recorded memory usage in bytes */
-    this.lastMemoryUsage = void 0;
-    /** The highest memory usage in bytes recorded during a benchmark run */
-    this.highestMemoryUsage = void 0;
+  constructor(options) {
     this.benchmarks = [];
-    this.iterations = (options === null || options === void 0 ? void 0 : options.iterations) || 500;
-    this.concurrency = (options === null || options === void 0 ? void 0 : options.concurrency) || 1;
+    this.iterations = options?.iterations || 500;
+    this.concurrency = options?.concurrency || 1;
     this.timeAccumulator = BigInt(0);
@@ -55,3 +43,2 @@ this.memoryAccumulator = 0;
   }
-
   /**
@@ -63,234 +50,110 @@ * Add a benchmark to the suite.
    */
-  (0, _createClass2["default"])(BenchmarkProfiler, [{
-    key: "add",
-    value: function add(bench) {
-      bench.iterations = bench.iterations || this.iterations;
-      this.benchmarks.push(bench);
-      return this;
+  add(bench) {
+    bench.iterations = bench.iterations || this.iterations;
+    this.benchmarks.push(bench);
+    return this;
+  }
+  /**
+   * Run the benchmarks in the suite
+   */
+  async run() {
+    const results = [];
+    for (const bench of this.benchmarks) {
+      const result = await this.runBenchmark(bench);
+      results.push(result);
     }
-
-    /**
-     * Run the benchmarks in the suite
-     */
-  }, {
-    key: "run",
-    value: (function () {
-      var _run = (0, _asyncToGenerator2["default"])( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
-        var results, _iterator, _step, bench, result;
-        return _regeneratorRuntime().wrap(function _callee$(_context) {
-          while (1) switch (_context.prev = _context.next) {
-            case 0:
-              results = [];
-              _iterator = _createForOfIteratorHelper(this.benchmarks);
-              _context.prev = 2;
-              _iterator.s();
-            case 4:
-              if ((_step = _iterator.n()).done) {
-                _context.next = 12;
-                break;
-              }
-              bench = _step.value;
-              _context.next = 8;
-              return this.runBenchmark(bench);
-            case 8:
-              result = _context.sent;
-              results.push(result);
-            case 10:
-              _context.next = 4;
-              break;
-            case 12:
-              _context.next = 17;
-              break;
-            case 14:
-              _context.prev = 14;
-              _context.t0 = _context["catch"](2);
-              _iterator.e(_context.t0);
-            case 17:
-              _context.prev = 17;
-              _iterator.f();
-              return _context.finish(17);
-            case 20:
-              return _context.abrupt("return", results);
-            case 21:
-            case "end":
-              return _context.stop();
-          }
-        }, _callee, this, [[2, 14, 17, 20]]);
-      }));
-      function run() {
-        return _run.apply(this, arguments);
+    return results;
+  }
+  /**
+   * Run a single benchmark
+   *
+   * @param bench - The benchmark to run
+   */
+  async runBenchmark(bench) {
+    this.resetProfiler();
+    await bench.beforeAll?.();
+    for (let i = 0; i < bench.iterations; i += this.concurrency) {
+      const tasks = [];
+      for (let j = 0; j < this.concurrency && i + j < bench.iterations; j++) {
+        tasks.push(this.runSingleIteration(bench));
       }
-      return run;
-    }()
-    /**
-     * Run a single benchmark
-     *
-     * @param bench - The benchmark to run
-     */
-    )
-  }, {
-    key: "runBenchmark",
-    value: (function () {
-      var _runBenchmark = (0, _asyncToGenerator2["default"])( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2(bench) {
-        var _bench$beforeAll, _bench$afterAll;
-        var i, tasks, j, opsPerMs, memoryUsagePerMs;
-        return _regeneratorRuntime().wrap(function _callee2$(_context2) {
-          while (1) switch (_context2.prev = _context2.next) {
-            case 0:
-              this.resetProfiler();
-              _context2.next = 3;
-              return (_bench$beforeAll = bench.beforeAll) === null || _bench$beforeAll === void 0 ? void 0 : _bench$beforeAll.call(bench);
-            case 3:
-              i = 0;
-            case 4:
-              if (!(i < bench.iterations)) {
-                _context2.next = 12;
-                break;
-              }
-              tasks = [];
-              for (j = 0; j < this.concurrency && i + j < bench.iterations; j++) {
-                tasks.push(this.runSingleIteration(bench));
-              }
-              _context2.next = 9;
-              return Promise.all(tasks);
-            case 9:
-              i += this.concurrency;
-              _context2.next = 4;
-              break;
-            case 12:
-              _context2.next = 14;
-              return (_bench$afterAll = bench.afterAll) === null || _bench$afterAll === void 0 ? void 0 : _bench$afterAll.call(bench);
-            case 14:
-              opsPerMs = this.calculateOpsPerMs(bench.iterations);
-              memoryUsagePerMs = this.calculateMemoryUsagePerMs();
-              return _context2.abrupt("return", {
-                name: bench.name,
-                iterations: bench.iterations,
-                timeInMs: Number(this.timeAccumulator) / 1e6,
-                averageOpsPerMs: opsPerMs,
-                averageKbPerMs: memoryUsagePerMs,
-                maxKb: this.highestMemoryUsage / 1e3
-              });
-            case 17:
-            case "end":
-              return _context2.stop();
-          }
-        }, _callee2, this);
-      }));
-      function runBenchmark(_x) {
-        return _runBenchmark.apply(this, arguments);
-      }
-      return runBenchmark;
-    }()
-    /**
-     * Reset profiling-related properties to their initial values
-     */
-    )
-  }, {
-    key: "resetProfiler",
-    value: function resetProfiler() {
-      this.timeAccumulator = BigInt(0);
-      this.memoryAccumulator = 0;
-      this.highestMemoryUsage = 0;
+      await Promise.all(tasks);
     }
-
-    /**
-     * Calculate the average number of operations per millisecond
-     */
-  }, {
-    key: "calculateOpsPerMs",
-    value: function calculateOpsPerMs(iterations) {
-      return iterations / (Number(this.timeAccumulator) / 1e6);
+    await bench.afterAll?.();
+    const opsPerMs = this.calculateOpsPerMs(bench.iterations);
+    const memoryUsagePerMs = this.calculateMemoryUsagePerMs();
+    return {
+      name: bench.name,
+      iterations: bench.iterations,
+      timeInMs: Number(this.timeAccumulator) / 1e6,
+      averageOpsPerMs: opsPerMs,
+      averageKbPerMs: memoryUsagePerMs,
+      maxKb: this.highestMemoryUsage / 1e3
+    };
+  }
+  /**
+   * Reset profiling-related properties to their initial values
+   */
+  resetProfiler() {
+    this.timeAccumulator = BigInt(0);
+    this.memoryAccumulator = 0;
+    this.highestMemoryUsage = 0;
+  }
+  /**
+   * Calculate the average number of operations per millisecond
+   */
+  calculateOpsPerMs(iterations) {
+    return iterations / (Number(this.timeAccumulator) / 1e6);
+  }
+  /**
+   * Calculate the average memory usage in kB per millisecond
+   */
+  calculateMemoryUsagePerMs() {
+    const totalMemoryUsage = Number(this.memoryAccumulator) / 1e3;
+    return totalMemoryUsage / (Number(this.timeAccumulator) / 1e6);
+  }
+  /**
+   * Run a single iteration of a benchmark
+   *
+   * @param bench - The benchmark to run
+   */
+  async runSingleIteration(bench) {
+    await bench.beforeEach?.();
+    if (!bench.fn) {
+      throw Error(
+        `Must provide a function to benchmark for test '${bench.name}'`
+      );
     }
-
-    /**
-     * Calculate the average memory usage in kB per millisecond
-     */
-  }, {
-    key: "calculateMemoryUsagePerMs",
-    value: function calculateMemoryUsagePerMs() {
-      var totalMemoryUsage = Number(this.memoryAccumulator) / 1e3;
-      return totalMemoryUsage / (Number(this.timeAccumulator) / 1e6);
+    try {
+      this.startProfiler();
+      await bench.fn();
+    } catch (e) {
+      throw Error(`Error running benchmark '${bench.name}': ${e}`);
+    } finally {
+      this.stopProfiler();
     }
-
-    /**
-     * Run a single iteration of a benchmark
-     *
-     * @param bench - The benchmark to run
-     */
-  }, {
-    key: "runSingleIteration",
-    value: (function () {
-      var _runSingleIteration = (0, _asyncToGenerator2["default"])( /*#__PURE__*/_regeneratorRuntime().mark(function _callee3(bench) {
-        var _bench$beforeEach, _bench$afterEach;
-        return _regeneratorRuntime().wrap(function _callee3$(_context3) {
-          while (1) switch (_context3.prev = _context3.next) {
-            case 0:
-              _context3.next = 2;
-              return (_bench$beforeEach = bench.beforeEach) === null || _bench$beforeEach === void 0 ? void 0 : _bench$beforeEach.call(bench);
-            case 2:
-              if (bench.fn) {
-                _context3.next = 4;
-                break;
-              }
-              throw Error("Must provide a function to benchmark for test '".concat(bench.name, "'"));
-            case 4:
-              _context3.prev = 4;
-              this.startProfiler();
-              _context3.next = 8;
-              return bench.fn();
-            case 8:
-              _context3.next = 13;
-              break;
-            case 10:
-              _context3.prev = 10;
-              _context3.t0 = _context3["catch"](4);
-              throw Error("Error running benchmark '".concat(bench.name, "': ").concat(_context3.t0));
-            case 13:
-              _context3.prev = 13;
-              this.stopProfiler();
-              return _context3.finish(13);
-            case 16:
-              _context3.next = 18;
-              return (_bench$afterEach = bench.afterEach) === null || _bench$afterEach === void 0 ? void 0 : _bench$afterEach.call(bench);
-            case 18:
-            case "end":
-              return _context3.stop();
-          }
-        }, _callee3, this, [[4, 10, 13, 16]]);
-      }));
-      function runSingleIteration(_x2) {
-        return _runSingleIteration.apply(this, arguments);
-      }
-      return runSingleIteration;
-    }()
-    /**
-     * Populate profiler-related properties
-     */
-    )
-  }, {
-    key: "startProfiler",
-    value: function startProfiler() {
-      this.lastTiming = process.hrtime.bigint();
-      this.lastMemoryUsage = process.memoryUsage.rss();
+    await bench.afterEach?.();
+  }
+  /**
+   * Populate profiler-related properties
+   */
+  startProfiler() {
+    this.lastTiming = process.hrtime.bigint();
+    this.lastMemoryUsage = process.memoryUsage.rss();
+  }
+  /**
+   * Calculate and accumulate the time and memory usage for a single iteration
+   */
+  stopProfiler() {
+    if (this.lastTiming === void 0 || this.lastMemoryUsage === void 0) {
+      throw new Error("Profiler not started");
     }
-
-    /**
-     * Calculate and accumulate the time and memory usage for a single iteration
-     */
-  }, {
-    key: "stopProfiler",
-    value: function stopProfiler() {
-      if (this.lastTiming === undefined || this.lastMemoryUsage === undefined) {
-        throw new Error('Profiler not started');
-      }
-      var timeDiff = process.hrtime.bigint() - this.lastTiming;
-      this.timeAccumulator += timeDiff;
-      var memDiff = process.memoryUsage.rss() - this.lastMemoryUsage;
-      this.memoryAccumulator += memDiff;
-      if (memDiff > this.highestMemoryUsage) this.highestMemoryUsage = memDiff;
-    }
-  }]);
-  return BenchmarkProfiler;
-}();
-var _default = exports["default"] = BenchmarkProfiler;
+    const timeDiff = process.hrtime.bigint() - this.lastTiming;
+    this.timeAccumulator += timeDiff;
+    const memDiff = process.memoryUsage.rss() - this.lastMemoryUsage;
+    this.memoryAccumulator += memDiff;
+    if (memDiff > this.highestMemoryUsage) this.highestMemoryUsage = memDiff;
+  }
+}
+var src_default = BenchmarkProfiler;
+//# sourceMappingURL=index.js.map

cjs/test-utils/functions/index.js

 "use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var functions_exports = {};
+__export(functions_exports, {
+  factorial: () => factorial,
+  fibonacci: () => fibonacci,
+  generatePrimes: () => generatePrimes,
+  primeFactors: () => primeFactors
 });
-exports.factorial = factorial;
-exports.fibonacci = fibonacci;
-exports.generatePrimes = generatePrimes;
-exports.primeFactors = primeFactors;
+module.exports = __toCommonJS(functions_exports);
 function fibonacci(n) {
@@ -15,9 +32,10 @@ if (n <= 1) return n;
 function factorial(n) {
-  if (n === 0) return 1;else return n * factorial(n - 1);
+  if (n === 0) return 1;
+  else return n * factorial(n - 1);
 }
 function generatePrimes(limit) {
-  var primes = [];
-  for (var num = 2; num <= limit; num++) {
-    var isPrime = true;
-    for (var i = 2; i <= Math.sqrt(num); i++) {
+  const primes = [];
+  for (let num = 2; num <= limit; num++) {
+    let isPrime = true;
+    for (let i = 2; i <= Math.sqrt(num); i++) {
       if (num % i === 0) {
@@ -35,4 +53,4 @@ isPrime = false;
 function primeFactors(n) {
-  var factors = [];
-  var divisor = 2;
+  const factors = [];
+  let divisor = 2;
   while (n > 2) {
@@ -47,2 +65,10 @@ if (n % divisor === 0) {
   return factors;
-}
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  factorial,
+  fibonacci,
+  generatePrimes,
+  primeFactors
+});
+//# sourceMappingURL=functions.js.map

cjs/types/index.js

 "use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var types_exports = {};
+module.exports = __toCommonJS(types_exports);
+//# sourceMappingURL=types.js.map

index.js

@@ -1,2 +0,2 @@
-/** @license Digigov v1.0.5-0edebf87
+/** @license Digigov v1.0.5-113e6661
  *
@@ -6,14 +6,3 @@ * This source code is licensed under the BSD-2-Clause license found in the
  */
-import _typeof from "@babel/runtime/helpers/typeof";
-import _asyncToGenerator from "@babel/runtime/helpers/asyncToGenerator";
-import _classCallCheck from "@babel/runtime/helpers/classCallCheck";
-import _createClass from "@babel/runtime/helpers/createClass";
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-/**
- * BenchmarkProfiler class for running benchmarks
- */
-var BenchmarkProfiler = /*#__PURE__*/function () {
+class BenchmarkProfiler {
   /**
@@ -28,23 +17,6 @@ * Create a new BenchmarkProfiler instance
    */
-  function BenchmarkProfiler(options) {
-    _classCallCheck(this, BenchmarkProfiler);
-    /**  The benchmarks to run */
-    this.benchmarks = void 0;
-    /** The number of iterations to run per benchmark */
-    this.iterations = void 0;
-    /** The number of concurrent iterations to run per benchmark */
-    this.concurrency = void 0;
-    /** Accumulator for the total execution time (in nanoseconds) of all iterations of a benchmark */
-    this.timeAccumulator = void 0;
-    /** The last timing recorded by the profiler in nanoseconds */
-    this.lastTiming = void 0;
-    /** Accumulator for the total bytes of memory usage of all iterations of a benchmark */
-    this.memoryAccumulator = void 0;
-    /** The last recorded memory usage in bytes */
-    this.lastMemoryUsage = void 0;
-    /** The highest memory usage in bytes recorded during a benchmark run */
-    this.highestMemoryUsage = void 0;
+  constructor(options) {
     this.benchmarks = [];
-    this.iterations = (options === null || options === void 0 ? void 0 : options.iterations) || 500;
-    this.concurrency = (options === null || options === void 0 ? void 0 : options.concurrency) || 1;
+    this.iterations = options?.iterations || 500;
+    this.concurrency = options?.concurrency || 1;
     this.timeAccumulator = BigInt(0);
@@ -54,3 +26,2 @@ this.memoryAccumulator = 0;
   }
-
   /**
@@ -62,234 +33,113 @@ * Add a benchmark to the suite.
    */
-  _createClass(BenchmarkProfiler, [{
-    key: "add",
-    value: function add(bench) {
-      bench.iterations = bench.iterations || this.iterations;
-      this.benchmarks.push(bench);
-      return this;
+  add(bench) {
+    bench.iterations = bench.iterations || this.iterations;
+    this.benchmarks.push(bench);
+    return this;
+  }
+  /**
+   * Run the benchmarks in the suite
+   */
+  async run() {
+    const results = [];
+    for (const bench of this.benchmarks) {
+      const result = await this.runBenchmark(bench);
+      results.push(result);
     }
-
-    /**
-     * Run the benchmarks in the suite
-     */
-  }, {
-    key: "run",
-    value: (function () {
-      var _run = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
-        var results, _iterator, _step, bench, result;
-        return _regeneratorRuntime().wrap(function _callee$(_context) {
-          while (1) switch (_context.prev = _context.next) {
-            case 0:
-              results = [];
-              _iterator = _createForOfIteratorHelper(this.benchmarks);
-              _context.prev = 2;
-              _iterator.s();
-            case 4:
-              if ((_step = _iterator.n()).done) {
-                _context.next = 12;
-                break;
-              }
-              bench = _step.value;
-              _context.next = 8;
-              return this.runBenchmark(bench);
-            case 8:
-              result = _context.sent;
-              results.push(result);
-            case 10:
-              _context.next = 4;
-              break;
-            case 12:
-              _context.next = 17;
-              break;
-            case 14:
-              _context.prev = 14;
-              _context.t0 = _context["catch"](2);
-              _iterator.e(_context.t0);
-            case 17:
-              _context.prev = 17;
-              _iterator.f();
-              return _context.finish(17);
-            case 20:
-              return _context.abrupt("return", results);
-            case 21:
-            case "end":
-              return _context.stop();
-          }
-        }, _callee, this, [[2, 14, 17, 20]]);
-      }));
-      function run() {
-        return _run.apply(this, arguments);
+    return results;
+  }
+  /**
+   * Run a single benchmark
+   *
+   * @param bench - The benchmark to run
+   */
+  async runBenchmark(bench) {
+    this.resetProfiler();
+    await bench.beforeAll?.();
+    for (let i = 0; i < bench.iterations; i += this.concurrency) {
+      const tasks = [];
+      for (let j = 0; j < this.concurrency && i + j < bench.iterations; j++) {
+        tasks.push(this.runSingleIteration(bench));
       }
-      return run;
-    }()
-    /**
-     * Run a single benchmark
-     *
-     * @param bench - The benchmark to run
-     */
-    )
-  }, {
-    key: "runBenchmark",
-    value: (function () {
-      var _runBenchmark = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2(bench) {
-        var _bench$beforeAll, _bench$afterAll;
-        var i, tasks, j, opsPerMs, memoryUsagePerMs;
-        return _regeneratorRuntime().wrap(function _callee2$(_context2) {
-          while (1) switch (_context2.prev = _context2.next) {
-            case 0:
-              this.resetProfiler();
-              _context2.next = 3;
-              return (_bench$beforeAll = bench.beforeAll) === null || _bench$beforeAll === void 0 ? void 0 : _bench$beforeAll.call(bench);
-            case 3:
-              i = 0;
-            case 4:
-              if (!(i < bench.iterations)) {
-                _context2.next = 12;
-                break;
-              }
-              tasks = [];
-              for (j = 0; j < this.concurrency && i + j < bench.iterations; j++) {
-                tasks.push(this.runSingleIteration(bench));
-              }
-              _context2.next = 9;
-              return Promise.all(tasks);
-            case 9:
-              i += this.concurrency;
-              _context2.next = 4;
-              break;
-            case 12:
-              _context2.next = 14;
-              return (_bench$afterAll = bench.afterAll) === null || _bench$afterAll === void 0 ? void 0 : _bench$afterAll.call(bench);
-            case 14:
-              opsPerMs = this.calculateOpsPerMs(bench.iterations);
-              memoryUsagePerMs = this.calculateMemoryUsagePerMs();
-              return _context2.abrupt("return", {
-                name: bench.name,
-                iterations: bench.iterations,
-                timeInMs: Number(this.timeAccumulator) / 1e6,
-                averageOpsPerMs: opsPerMs,
-                averageKbPerMs: memoryUsagePerMs,
-                maxKb: this.highestMemoryUsage / 1e3
-              });
-            case 17:
-            case "end":
-              return _context2.stop();
-          }
-        }, _callee2, this);
-      }));
-      function runBenchmark(_x) {
-        return _runBenchmark.apply(this, arguments);
-      }
-      return runBenchmark;
-    }()
-    /**
-     * Reset profiling-related properties to their initial values
-     */
-    )
-  }, {
-    key: "resetProfiler",
-    value: function resetProfiler() {
-      this.timeAccumulator = BigInt(0);
-      this.memoryAccumulator = 0;
-      this.highestMemoryUsage = 0;
+      await Promise.all(tasks);
     }
-
-    /**
-     * Calculate the average number of operations per millisecond
-     */
-  }, {
-    key: "calculateOpsPerMs",
-    value: function calculateOpsPerMs(iterations) {
-      return iterations / (Number(this.timeAccumulator) / 1e6);
+    await bench.afterAll?.();
+    const opsPerMs = this.calculateOpsPerMs(bench.iterations);
+    const memoryUsagePerMs = this.calculateMemoryUsagePerMs();
+    return {
+      name: bench.name,
+      iterations: bench.iterations,
+      timeInMs: Number(this.timeAccumulator) / 1e6,
+      averageOpsPerMs: opsPerMs,
+      averageKbPerMs: memoryUsagePerMs,
+      maxKb: this.highestMemoryUsage / 1e3
+    };
+  }
+  /**
+   * Reset profiling-related properties to their initial values
+   */
+  resetProfiler() {
+    this.timeAccumulator = BigInt(0);
+    this.memoryAccumulator = 0;
+    this.highestMemoryUsage = 0;
+  }
+  /**
+   * Calculate the average number of operations per millisecond
+   */
+  calculateOpsPerMs(iterations) {
+    return iterations / (Number(this.timeAccumulator) / 1e6);
+  }
+  /**
+   * Calculate the average memory usage in kB per millisecond
+   */
+  calculateMemoryUsagePerMs() {
+    const totalMemoryUsage = Number(this.memoryAccumulator) / 1e3;
+    return totalMemoryUsage / (Number(this.timeAccumulator) / 1e6);
+  }
+  /**
+   * Run a single iteration of a benchmark
+   *
+   * @param bench - The benchmark to run
+   */
+  async runSingleIteration(bench) {
+    await bench.beforeEach?.();
+    if (!bench.fn) {
+      throw Error(
+        `Must provide a function to benchmark for test '${bench.name}'`
+      );
     }
-
-    /**
-     * Calculate the average memory usage in kB per millisecond
-     */
-  }, {
-    key: "calculateMemoryUsagePerMs",
-    value: function calculateMemoryUsagePerMs() {
-      var totalMemoryUsage = Number(this.memoryAccumulator) / 1e3;
-      return totalMemoryUsage / (Number(this.timeAccumulator) / 1e6);
+    try {
+      this.startProfiler();
+      await bench.fn();
+    } catch (e) {
+      throw Error(`Error running benchmark '${bench.name}': ${e}`);
+    } finally {
+      this.stopProfiler();
     }
-
-    /**
-     * Run a single iteration of a benchmark
-     *
-     * @param bench - The benchmark to run
-     */
-  }, {
-    key: "runSingleIteration",
-    value: (function () {
-      var _runSingleIteration = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee3(bench) {
-        var _bench$beforeEach, _bench$afterEach;
-        return _regeneratorRuntime().wrap(function _callee3$(_context3) {
-          while (1) switch (_context3.prev = _context3.next) {
-            case 0:
-              _context3.next = 2;
-              return (_bench$beforeEach = bench.beforeEach) === null || _bench$beforeEach === void 0 ? void 0 : _bench$beforeEach.call(bench);
-            case 2:
-              if (bench.fn) {
-                _context3.next = 4;
-                break;
-              }
-              throw Error("Must provide a function to benchmark for test '".concat(bench.name, "'"));
-            case 4:
-              _context3.prev = 4;
-              this.startProfiler();
-              _context3.next = 8;
-              return bench.fn();
-            case 8:
-              _context3.next = 13;
-              break;
-            case 10:
-              _context3.prev = 10;
-              _context3.t0 = _context3["catch"](4);
-              throw Error("Error running benchmark '".concat(bench.name, "': ").concat(_context3.t0));
-            case 13:
-              _context3.prev = 13;
-              this.stopProfiler();
-              return _context3.finish(13);
-            case 16:
-              _context3.next = 18;
-              return (_bench$afterEach = bench.afterEach) === null || _bench$afterEach === void 0 ? void 0 : _bench$afterEach.call(bench);
-            case 18:
-            case "end":
-              return _context3.stop();
-          }
-        }, _callee3, this, [[4, 10, 13, 16]]);
-      }));
-      function runSingleIteration(_x2) {
-        return _runSingleIteration.apply(this, arguments);
-      }
-      return runSingleIteration;
-    }()
-    /**
-     * Populate profiler-related properties
-     */
-    )
-  }, {
-    key: "startProfiler",
-    value: function startProfiler() {
-      this.lastTiming = process.hrtime.bigint();
-      this.lastMemoryUsage = process.memoryUsage.rss();
+    await bench.afterEach?.();
+  }
+  /**
+   * Populate profiler-related properties
+   */
+  startProfiler() {
+    this.lastTiming = process.hrtime.bigint();
+    this.lastMemoryUsage = process.memoryUsage.rss();
+  }
+  /**
+   * Calculate and accumulate the time and memory usage for a single iteration
+   */
+  stopProfiler() {
+    if (this.lastTiming === void 0 || this.lastMemoryUsage === void 0) {
+      throw new Error("Profiler not started");
     }
-
-    /**
-     * Calculate and accumulate the time and memory usage for a single iteration
-     */
-  }, {
-    key: "stopProfiler",
-    value: function stopProfiler() {
-      if (this.lastTiming === undefined || this.lastMemoryUsage === undefined) {
-        throw new Error('Profiler not started');
-      }
-      var timeDiff = process.hrtime.bigint() - this.lastTiming;
-      this.timeAccumulator += timeDiff;
-      var memDiff = process.memoryUsage.rss() - this.lastMemoryUsage;
-      this.memoryAccumulator += memDiff;
-      if (memDiff > this.highestMemoryUsage) this.highestMemoryUsage = memDiff;
-    }
-  }]);
-  return BenchmarkProfiler;
-}();
-export default BenchmarkProfiler;
+    const timeDiff = process.hrtime.bigint() - this.lastTiming;
+    this.timeAccumulator += timeDiff;
+    const memDiff = process.memoryUsage.rss() - this.lastMemoryUsage;
+    this.memoryAccumulator += memDiff;
+    if (memDiff > this.highestMemoryUsage) this.highestMemoryUsage = memDiff;
+  }
+}
+var src_default = BenchmarkProfiler;
+export {
+  src_default as default
+};
+//# sourceMappingURL=index.js.map

package.json

 {
   "name": "@digigov/benchmark",
-  "version": "1.0.5-0edebf87",
+  "version": "1.0.5-113e6661",
   "description": "@digigov benchmark",
@@ -5,0 +5,0 @@ "author": "GRNET Developers <[e-mail]>",

test-utils/functions/index.js

@@ -1,13 +0,14 @@
-export function fibonacci(n) {
+function fibonacci(n) {
   if (n <= 1) return n;
   return fibonacci(n - 1) + fibonacci(n - 2);
 }
-export function factorial(n) {
-  if (n === 0) return 1;else return n * factorial(n - 1);
+function factorial(n) {
+  if (n === 0) return 1;
+  else return n * factorial(n - 1);
 }
-export function generatePrimes(limit) {
-  var primes = [];
-  for (var num = 2; num <= limit; num++) {
-    var isPrime = true;
-    for (var i = 2; i <= Math.sqrt(num); i++) {
+function generatePrimes(limit) {
+  const primes = [];
+  for (let num = 2; num <= limit; num++) {
+    let isPrime = true;
+    for (let i = 2; i <= Math.sqrt(num); i++) {
       if (num % i === 0) {
@@ -24,5 +25,5 @@ isPrime = false;
 }
-export function primeFactors(n) {
-  var factors = [];
-  var divisor = 2;
+function primeFactors(n) {
+  const factors = [];
+  let divisor = 2;
   while (n > 2) {
@@ -37,2 +38,9 @@ if (n % divisor === 0) {
   return factors;
-}
+}
+export {
+  factorial,
+  fibonacci,
+  generatePrimes,
+  primeFactors
+};
+//# sourceMappingURL=functions.js.map

types/index.js

@@ -1,1 +0,1 @@
-export {};
+//# sourceMappingURL=types.js.map

No alert changes

Improved metrics

Number of package files

26

increased by13.04%

Worsened metrics

Total package byte prevSize

52135

decreased by-47.11%

Lines of code

933

decreased by-45.88%

No dependency changes