@ozdao/prometheus-framework 0.2.133 → 0.2.134

package/dist/middlewares.server.js

@@ -1,6 +1,6 @@
 "use strict";
 const _commonjsHelpers = require("./_commonjsHelpers-DHfMLFPC.js");
-const index = require("./index-BshfsiQG.js");
+const index = require("./index-CDbtWkBj.js");
 const verifyUser = index.verifyUser;
 const verifyInvites = index.verifyInvites;
 const authJwt = index.authJwt;

package/dist/middlewares.server.mjs

@@ -1,5 +1,5 @@
 import { g as getDefaultExportFromCjs } from "./_commonjsHelpers-CUmg6egw.mjs";
-import { v as verifyUser$1, a as verifyInvites$1, b as authJwt$1, c as verifySignUp$1, d as verifyCategory$1, s as server } from "./index-DKtnWDNC.mjs";
+import { v as verifyUser$1, a as verifyInvites$1, b as authJwt$1, c as verifySignUp$1, d as verifyCategory$1, s as server } from "./index-C-8xOJnM.mjs";
 const verifyUser = verifyUser$1;
 const verifyInvites = verifyInvites$1;
 const authJwt = authJwt$1;

package/dist/node_modules/dijkstrajs/dijkstra.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("../../_virtual/dijkstra.cjs");(function(y){var u={single_source_shortest_paths:function(o,e,t){var r={},i={};i[e]=0;var n=u.PriorityQueue.make();n.push(e,0);for(var f,c,s,p,_,h,a,d,l;!n.empty();){f=n.pop(),c=f.value,p=f.cost,_=o[c]||{};for(s in _)_.hasOwnProperty(s)&&(h=_[s],a=p+h,d=i[s],l=typeof i[s]>"u",(l||d>a)&&(i[s]=a,n.push(s,a),r[s]=c))}if(typeof t<"u"&&typeof i[t]>"u"){var m=["Could not find a path from ",e," to ",t,"."].join("");throw new Error(m)}return r},extract_shortest_path_from_predecessor_list:function(o,e){for(var t=[],r=e;r;)t.push(r),o[r],r=o[r];return t.reverse(),t},find_path:function(o,e,t){var r=u.single_source_shortest_paths(o,e,t);return u.extract_shortest_path_from_predecessor_list(r,t)},PriorityQueue:{make:function(o){var e=u.PriorityQueue,t={},r;o=o||{};for(r in e)e.hasOwnProperty(r)&&(t[r]=e[r]);return t.queue=[],t.sorter=o.sorter||e.default_sorter,t},default_sorter:function(o,e){return o.cost-e.cost},push:function(o,e){var t={value:o,cost:e};this.queue.push(t),this.queue.sort(this.sorter)},pop:function(){return this.queue.shift()},empty:function(){return this.queue.length===0}}};y.exports=u})(v.__module);var j=v.__module.exports;exports.dijkstraExports=j;

package/dist/node_modules/dijkstrajs/dijkstra.js

@@ -0,0 +1,70 @@
+import { __module as l } from "../../_virtual/dijkstra.js";
+(function(m) {
+  var u = {
+    single_source_shortest_paths: function(o, e, t) {
+      var r = {}, i = {};
+      i[e] = 0;
+      var n = u.PriorityQueue.make();
+      n.push(e, 0);
+      for (var f, p, s, c, _, h, a, d, v; !n.empty(); ) {
+        f = n.pop(), p = f.value, c = f.cost, _ = o[p] || {};
+        for (s in _)
+          _.hasOwnProperty(s) && (h = _[s], a = c + h, d = i[s], v = typeof i[s] > "u", (v || d > a) && (i[s] = a, n.push(s, a), r[s] = p));
+      }
+      if (typeof t < "u" && typeof i[t] > "u") {
+        var y = ["Could not find a path from ", e, " to ", t, "."].join("");
+        throw new Error(y);
+      }
+      return r;
+    },
+    extract_shortest_path_from_predecessor_list: function(o, e) {
+      for (var t = [], r = e; r; )
+        t.push(r), o[r], r = o[r];
+      return t.reverse(), t;
+    },
+    find_path: function(o, e, t) {
+      var r = u.single_source_shortest_paths(o, e, t);
+      return u.extract_shortest_path_from_predecessor_list(
+        r,
+        t
+      );
+    },
+    /**
+     * A very naive priority queue implementation.
+     */
+    PriorityQueue: {
+      make: function(o) {
+        var e = u.PriorityQueue, t = {}, r;
+        o = o || {};
+        for (r in e)
+          e.hasOwnProperty(r) && (t[r] = e[r]);
+        return t.queue = [], t.sorter = o.sorter || e.default_sorter, t;
+      },
+      default_sorter: function(o, e) {
+        return o.cost - e.cost;
+      },
+      /**
+       * Add a new item to the queue and ensure the highest priority element
+       * is at the front of the queue.
+       */
+      push: function(o, e) {
+        var t = { value: o, cost: e };
+        this.queue.push(t), this.queue.sort(this.sorter);
+      },
+      /**
+       * Return the highest priority element in the queue.
+       */
+      pop: function() {
+        return this.queue.shift();
+      },
+      empty: function() {
+        return this.queue.length === 0;
+      }
+    }
+  };
+  m.exports = u;
+})(l);
+var w = l.exports;
+export {
+  w as d
+};

package/dist/node_modules/encode-utf8/index.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var x=function(f){for(var r=[],s=f.length,e=0;e<s;e++){var u=f.charCodeAt(e);if(u>=55296&&u<=56319&&s>e+1){var h=f.charCodeAt(e+1);h>=56320&&h<=57343&&(u=(u-55296)*1024+h-56320+65536,e+=1)}if(u<128){r.push(u);continue}if(u<2048){r.push(u>>6|192),r.push(u&63|128);continue}if(u<55296||u>=57344&&u<65536){r.push(u>>12|224),r.push(u>>6&63|128),r.push(u&63|128);continue}if(u>=65536&&u<=1114111){r.push(u>>18|240),r.push(u>>12&63|128),r.push(u>>6&63|128),r.push(u&63|128);continue}r.push(239,191,189)}return new Uint8Array(r).buffer};exports.encodeUtf8=x;

package/dist/node_modules/encode-utf8/index.js

@@ -0,0 +1,30 @@
+var F = function(x) {
+  for (var r = [], s = x.length, h = 0; h < s; h++) {
+    var u = x.charCodeAt(h);
+    if (u >= 55296 && u <= 56319 && s > h + 1) {
+      var f = x.charCodeAt(h + 1);
+      f >= 56320 && f <= 57343 && (u = (u - 55296) * 1024 + f - 56320 + 65536, h += 1);
+    }
+    if (u < 128) {
+      r.push(u);
+      continue;
+    }
+    if (u < 2048) {
+      r.push(u >> 6 | 192), r.push(u & 63 | 128);
+      continue;
+    }
+    if (u < 55296 || u >= 57344 && u < 65536) {
+      r.push(u >> 12 | 224), r.push(u >> 6 & 63 | 128), r.push(u & 63 | 128);
+      continue;
+    }
+    if (u >= 65536 && u <= 1114111) {
+      r.push(u >> 18 | 240), r.push(u >> 12 & 63 | 128), r.push(u >> 6 & 63 | 128), r.push(u & 63 | 128);
+      continue;
+    }
+    r.push(239, 191, 189);
+  }
+  return new Uint8Array(r).buffer;
+};
+export {
+  F as e
+};

package/dist/node_modules/qrcode/lib/browser.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const u=require("../../../_virtual/browser.cjs"),m=require("./can-promise.cjs");require("./core/qrcode.cjs");require("./renderer/canvas.cjs");require("./renderer/svg-tag.cjs");const q=require("../../../_virtual/canvas.cjs"),w=require("../../../_virtual/svg-tag.cjs"),C=require("../../../_virtual/qrcode.cjs"),h=m.canPromise,f=C.__exports,_=q.__exports,y=w.__exports;function l(d,e,r,n,i){const a=[].slice.call(arguments,1),o=a.length,c=typeof a[o-1]=="function";if(!c&&!h())throw new Error("Callback required as last argument");if(c){if(o<2)throw new Error("Too few arguments provided");o===2?(i=r,r=e,e=n=void 0):o===3&&(e.getContext&&typeof i>"u"?(i=n,n=void 0):(i=n,n=r,r=e,e=void 0))}else{if(o<1)throw new Error("Too few arguments provided");return o===1?(r=e,e=n=void 0):o===2&&!e.getContext&&(n=r,r=e,e=void 0),new Promise(function(t,g){try{const s=f.create(r,n);t(d(s,e,n))}catch(s){g(s)}})}try{const t=f.create(r,n);i(null,d(t,e,n))}catch(t){i(t)}}u.__exports.create=f.create;u.__exports.toCanvas=l.bind(null,_.render);u.__exports.toDataURL=l.bind(null,_.renderToDataURL);u.__exports.toString=l.bind(null,function(d,e,r){return y.render(d,r)});exports.default=u.__exports;

package/dist/node_modules/qrcode/lib/browser.js

@@ -0,0 +1,45 @@
+import { __exports as f } from "../../../_virtual/browser.js";
+import { c as w } from "./can-promise.js";
+import "./core/qrcode.js";
+import "./renderer/canvas.js";
+import "./renderer/svg-tag.js";
+import { __exports as _ } from "../../../_virtual/canvas.js";
+import { __exports as C } from "../../../_virtual/svg-tag.js";
+import { __exports as p } from "../../../_virtual/qrcode.js";
+const h = w, u = p, g = _, R = C;
+function m(d, e, r, n, i) {
+  const s = [].slice.call(arguments, 1), o = s.length, l = typeof s[o - 1] == "function";
+  if (!l && !h())
+    throw new Error("Callback required as last argument");
+  if (l) {
+    if (o < 2)
+      throw new Error("Too few arguments provided");
+    o === 2 ? (i = r, r = e, e = n = void 0) : o === 3 && (e.getContext && typeof i > "u" ? (i = n, n = void 0) : (i = n, n = r, r = e, e = void 0));
+  } else {
+    if (o < 1)
+      throw new Error("Too few arguments provided");
+    return o === 1 ? (r = e, e = n = void 0) : o === 2 && !e.getContext && (n = r, r = e, e = void 0), new Promise(function(t, c) {
+      try {
+        const a = u.create(r, n);
+        t(d(a, e, n));
+      } catch (a) {
+        c(a);
+      }
+    });
+  }
+  try {
+    const t = u.create(r, n);
+    i(null, d(t, e, n));
+  } catch (t) {
+    i(t);
+  }
+}
+f.create = u.create;
+f.toCanvas = m.bind(null, g.render);
+f.toDataURL = m.bind(null, g.renderToDataURL);
+f.toString = m.bind(null, function(d, e, r) {
+  return R.render(d, r);
+});
+export {
+  f as default
+};

package/dist/node_modules/qrcode/lib/can-promise.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e=function(){return typeof Promise=="function"&&Promise.prototype&&Promise.prototype.then};exports.canPromise=e;

package/dist/node_modules/qrcode/lib/can-promise.js

@@ -0,0 +1,6 @@
+var o = function() {
+  return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
+};
+export {
+  o as c
+};

package/dist/node_modules/qrcode/lib/core/alignment-pattern.cjs

@@ -0,0 +1 @@
+"use strict";const l=require("../../../../_virtual/alignment-pattern.cjs");require("./utils.cjs");const g=require("../../../../_virtual/utils.cjs");(function(r){const c=g.__exports.getSymbolSize;r.getRowColCoords=function(s){if(s===1)return[];const i=Math.floor(s/7)+2,e=c(s),n=e===145?26:Math.ceil((e-13)/(2*i-2))*2,o=[e-7];for(let t=1;t<i-1;t++)o[t]=o[t-1]-n;return o.push(6),o.reverse()},r.getPositions=function(s){const i=[],e=r.getRowColCoords(s),n=e.length;for(let o=0;o<n;o++)for(let t=0;t<n;t++)o===0&&t===0||o===0&&t===n-1||o===n-1&&t===0||i.push([e[o],e[t]]);return i}})(l.__exports);

package/dist/node_modules/qrcode/lib/core/alignment-pattern.js

@@ -0,0 +1,21 @@
+import { __exports as f } from "../../../../_virtual/alignment-pattern.js";
+import "./utils.js";
+import { __exports as u } from "../../../../_virtual/utils.js";
+(function(r) {
+  const c = u.getSymbolSize;
+  r.getRowColCoords = function(e) {
+    if (e === 1) return [];
+    const i = Math.floor(e / 7) + 2, n = c(e), s = n === 145 ? 26 : Math.ceil((n - 13) / (2 * i - 2)) * 2, o = [n - 7];
+    for (let t = 1; t < i - 1; t++)
+      o[t] = o[t - 1] - s;
+    return o.push(6), o.reverse();
+  }, r.getPositions = function(e) {
+    const i = [], n = r.getRowColCoords(e), s = n.length;
+    for (let o = 0; o < s; o++)
+      for (let t = 0; t < s; t++)
+        o === 0 && t === 0 || // top-left
+        o === 0 && t === s - 1 || // bottom-left
+        o === s - 1 && t === 0 || i.push([n[o], n[t]]);
+    return i;
+  };
+})(f);

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./mode.cjs");const r=require("../../../../_virtual/mode.cjs"),h=r.__exports,a=["0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"," ","$","%","*","+","-",".","/",":"];function e(n){this.mode=h.ALPHANUMERIC,this.data=n}e.getBitsLength=function(i){return 11*Math.floor(i/2)+6*(i%2)};e.prototype.getLength=function(){return this.data.length};e.prototype.getBitsLength=function(){return e.getBitsLength(this.data.length)};e.prototype.write=function(i){let t;for(t=0;t+2<=this.data.length;t+=2){let o=a.indexOf(this.data[t])*45;o+=a.indexOf(this.data[t+1]),i.put(o,11)}this.data.length%2&&i.put(a.indexOf(this.data[t]),6)};var s=e;exports.alphanumericData=s;

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.js

@@ -0,0 +1,73 @@
+import "./mode.js";
+import { __exports as h } from "../../../../_virtual/mode.js";
+const r = h, i = [
+  "0",
+  "1",
+  "2",
+  "3",
+  "4",
+  "5",
+  "6",
+  "7",
+  "8",
+  "9",
+  "A",
+  "B",
+  "C",
+  "D",
+  "E",
+  "F",
+  "G",
+  "H",
+  "I",
+  "J",
+  "K",
+  "L",
+  "M",
+  "N",
+  "O",
+  "P",
+  "Q",
+  "R",
+  "S",
+  "T",
+  "U",
+  "V",
+  "W",
+  "X",
+  "Y",
+  "Z",
+  " ",
+  "$",
+  "%",
+  "*",
+  "+",
+  "-",
+  ".",
+  "/",
+  ":"
+];
+function e(n) {
+  this.mode = r.ALPHANUMERIC, this.data = n;
+}
+e.getBitsLength = function(a) {
+  return 11 * Math.floor(a / 2) + 6 * (a % 2);
+};
+e.prototype.getLength = function() {
+  return this.data.length;
+};
+e.prototype.getBitsLength = function() {
+  return e.getBitsLength(this.data.length);
+};
+e.prototype.write = function(a) {
+  let t;
+  for (t = 0; t + 2 <= this.data.length; t += 2) {
+    let o = i.indexOf(this.data[t]) * 45;
+    o += i.indexOf(this.data[t + 1]), a.put(o, 11);
+  }
+  this.data.length % 2 && a.put(i.indexOf(this.data[t]), 6);
+};
+var d = e;
+export {
+  d as a
+};

package/dist/node_modules/qrcode/lib/core/bit-buffer.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(){this.buffer=[],this.length=0}i.prototype={get:function(f){const t=Math.floor(f/8);return(this.buffer[t]>>>7-f%8&1)===1},put:function(f,t){for(let e=0;e<t;e++)this.putBit((f>>>t-e-1&1)===1)},getLengthInBits:function(){return this.length},putBit:function(f){const t=Math.floor(this.length/8);this.buffer.length<=t&&this.buffer.push(0),f&&(this.buffer[t]|=128>>>this.length%8),this.length++}};var n=i;exports.bitBuffer=n;

package/dist/node_modules/qrcode/lib/core/bit-buffer.js

@@ -0,0 +1,24 @@
+function n() {
+  this.buffer = [], this.length = 0;
+}
+n.prototype = {
+  get: function(f) {
+    const t = Math.floor(f / 8);
+    return (this.buffer[t] >>> 7 - f % 8 & 1) === 1;
+  },
+  put: function(f, t) {
+    for (let i = 0; i < t; i++)
+      this.putBit((f >>> t - i - 1 & 1) === 1);
+  },
+  getLengthInBits: function() {
+    return this.length;
+  },
+  putBit: function(f) {
+    const t = Math.floor(this.length / 8);
+    this.buffer.length <= t && this.buffer.push(0), f && (this.buffer[t] |= 128 >>> this.length % 8), this.length++;
+  }
+};
+var e = n;
+export {
+  e as b
+};

package/dist/node_modules/qrcode/lib/core/bit-matrix.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function e(t){if(!t||t<1)throw new Error("BitMatrix size must be defined and greater than 0");this.size=t,this.data=new Uint8Array(t*t),this.reservedBit=new Uint8Array(t*t)}e.prototype.set=function(t,i,r,s){const n=t*this.size+i;this.data[n]=r,s&&(this.reservedBit[n]=!0)};e.prototype.get=function(t,i){return this.data[t*this.size+i]};e.prototype.xor=function(t,i,r){this.data[t*this.size+i]^=r};e.prototype.isReserved=function(t,i){return this.reservedBit[t*this.size+i]};var o=e;exports.bitMatrix=o;

package/dist/node_modules/qrcode/lib/core/bit-matrix.js

@@ -0,0 +1,22 @@
+function r(t) {
+  if (!t || t < 1)
+    throw new Error("BitMatrix size must be defined and greater than 0");
+  this.size = t, this.data = new Uint8Array(t * t), this.reservedBit = new Uint8Array(t * t);
+}
+r.prototype.set = function(t, i, e, s) {
+  const n = t * this.size + i;
+  this.data[n] = e, s && (this.reservedBit[n] = !0);
+};
+r.prototype.get = function(t, i) {
+  return this.data[t * this.size + i];
+};
+r.prototype.xor = function(t, i, e) {
+  this.data[t * this.size + i] ^= e;
+};
+r.prototype.isReserved = function(t, i) {
+  return this.reservedBit[t * this.size + i];
+};
+var a = r;
+export {
+  a as b
+};

package/dist/node_modules/qrcode/lib/core/byte-data.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("../../../encode-utf8/index.cjs");require("./mode.cjs");const r=require("../../../../_virtual/mode.cjs"),g=o.encodeUtf8,s=r.__exports;function e(t){this.mode=s.BYTE,typeof t=="string"&&(t=g(t)),this.data=new Uint8Array(t)}e.getBitsLength=function(n){return n*8};e.prototype.getLength=function(){return this.data.length};e.prototype.getBitsLength=function(){return e.getBitsLength(this.data.length)};e.prototype.write=function(t){for(let n=0,i=this.data.length;n<i;n++)t.put(this.data[n],8)};var h=e;exports.byteData=h;

package/dist/node_modules/qrcode/lib/core/byte-data.js

@@ -0,0 +1,24 @@
+import { e as i } from "../../../encode-utf8/index.js";
+import "./mode.js";
+import { __exports as r } from "../../../../_virtual/mode.js";
+const g = i, s = r;
+function e(t) {
+  this.mode = s.BYTE, typeof t == "string" && (t = g(t)), this.data = new Uint8Array(t);
+}
+e.getBitsLength = function(n) {
+  return n * 8;
+};
+e.prototype.getLength = function() {
+  return this.data.length;
+};
+e.prototype.getBitsLength = function() {
+  return e.getBitsLength(this.data.length);
+};
+e.prototype.write = function(t) {
+  for (let n = 0, o = this.data.length; n < o; n++)
+    t.put(this.data[n], 8);
+};
+var f = e;
+export {
+  f as b
+};

package/dist/node_modules/qrcode/lib/core/error-correction-code.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const n=require("../../../../_virtual/error-correction-code.cjs");require("./error-correction-level.cjs");const s=require("../../../../_virtual/error-correction-level.cjs"),t=s.__exports,r=[1,1,1,1,1,1,1,1,1,1,2,2,1,2,2,4,1,2,4,4,2,4,4,4,2,4,6,5,2,4,6,6,2,5,8,8,4,5,8,8,4,5,8,11,4,8,10,11,4,9,12,16,4,9,16,16,6,10,12,18,6,10,17,16,6,11,16,19,6,13,18,21,7,14,21,25,8,16,20,25,8,17,23,25,9,17,23,34,9,18,25,30,10,20,27,32,12,21,29,35,12,23,34,37,12,25,34,40,13,26,35,42,14,28,38,45,15,29,40,48,16,31,43,51,17,33,45,54,18,35,48,57,19,37,51,60,19,38,53,63,20,40,56,66,21,43,59,70,22,45,62,74,24,47,65,77,25,49,68,81],u=[7,10,13,17,10,16,22,28,15,26,36,44,20,36,52,64,26,48,72,88,36,64,96,112,40,72,108,130,48,88,132,156,60,110,160,192,72,130,192,224,80,150,224,264,96,176,260,308,104,198,288,352,120,216,320,384,132,240,360,432,144,280,408,480,168,308,448,532,180,338,504,588,196,364,546,650,224,416,600,700,224,442,644,750,252,476,690,816,270,504,750,900,300,560,810,960,312,588,870,1050,336,644,952,1110,360,700,1020,1200,390,728,1050,1260,420,784,1140,1350,450,812,1200,1440,480,868,1290,1530,510,924,1350,1620,540,980,1440,1710,570,1036,1530,1800,570,1064,1590,1890,600,1120,1680,1980,630,1204,1770,2100,660,1260,1860,2220,720,1316,1950,2310,750,1372,2040,2430];n.__exports.getBlocksCount=function(e,o){switch(o){case t.L:return r[(e-1)*4+0];case t.M:return r[(e-1)*4+1];case t.Q:return r[(e-1)*4+2];case t.H:return r[(e-1)*4+3];default:return}};n.__exports.getTotalCodewordsCount=function(e,o){switch(o){case t.L:return u[(e-1)*4+0];case t.M:return u[(e-1)*4+1];case t.Q:return u[(e-1)*4+2];case t.H:return u[(e-1)*4+3];default:return}};exports.default=n.__exports;