lawgic-dev-kit 0.2.4 → 0.3.4

package/dist/node_modules/tiny-case/index.js

@@ -0,0 +1,22 @@
+var s, c;
+function l() {
+  if (c) return s;
+  c = 1;
+  const t = /[A-Z\xc0-\xd6\xd8-\xde]?[a-z\xdf-\xf6\xf8-\xff]+(?:['’](?:d|ll|m|re|s|t|ve))?(?=[\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000]|[A-Z\xc0-\xd6\xd8-\xde]|$)|(?:[A-Z\xc0-\xd6\xd8-\xde]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])+(?:['’](?:D|LL|M|RE|S|T|VE))?(?=[\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000]|[A-Z\xc0-\xd6\xd8-\xde](?:[a-z\xdf-\xf6\xf8-\xff]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])|$)|[A-Z\xc0-\xd6\xd8-\xde]?(?:[a-z\xdf-\xf6\xf8-\xff]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])+(?:['’](?:d|ll|m|re|s|t|ve))?|[A-Z\xc0-\xd6\xd8-\xde]+(?:['’](?:D|LL|M|RE|S|T|VE))?|\d*(?:1ST|2ND|3RD|(?![123])\dTH)(?=\b|[a-z_])|\d*(?:1st|2nd|3rd|(?![123])\dth)(?=\b|[A-Z_])|\d+|(?:[\u2700-\u27bf]|(?:\ud83c[\udde6-\uddff]){2}|[\ud800-\udbff][\udc00-\udfff])[\ufe0e\ufe0f]?(?:[\u0300-\u036f\ufe20-\ufe2f\u20d0-\u20ff]|\ud83c[\udffb-\udfff])?(?:\u200d(?:[^\ud800-\udfff]|(?:\ud83c[\udde6-\uddff]){2}|[\ud800-\udbff][\udc00-\udfff])[\ufe0e\ufe0f]?(?:[\u0300-\u036f\ufe20-\ufe2f\u20d0-\u20ff]|\ud83c[\udffb-\udfff])?)*/g, f = (u) => u.match(t) || [], x = (u) => u[0].toUpperCase() + u.slice(1), e = (u, d) => f(u).join(d).toLowerCase(), b = (u) => f(u).reduce(
+    (d, a) => `${d}${d ? a[0].toUpperCase() + a.slice(1).toLowerCase() : a.toLowerCase()}`,
+    ""
+  );
+  return s = {
+    words: f,
+    upperFirst: x,
+    camelCase: b,
+    pascalCase: (u) => x(b(u)),
+    snakeCase: (u) => e(u, "_"),
+    kebabCase: (u) => e(u, "-"),
+    sentenceCase: (u) => x(e(u, " ")),
+    titleCase: (u) => f(u).map(x).join(" ")
+  }, s;
+}
+export {
+  l as __require
+};

package/dist/node_modules/toposort/index.js

@@ -0,0 +1,66 @@
+import { __module as w } from "../../_virtual/index7.js";
+var p;
+function x() {
+  if (p) return w.exports;
+  p = 1, w.exports = function(n) {
+    return l(d(n), n);
+  }, w.exports.array = l;
+  function l(n, r) {
+    var t = n.length, a = new Array(t), o = {}, i = t, m = y(r), s = k(n);
+    for (r.forEach(function(e) {
+      if (!s.has(e[0]) || !s.has(e[1]))
+        throw new Error("Unknown node. There is an unknown node in the supplied edges.");
+    }); i--; )
+      o[i] || c(n[i], i, /* @__PURE__ */ new Set());
+    return a;
+    function c(e, u, f) {
+      if (f.has(e)) {
+        var v;
+        try {
+          v = ", node was:" + JSON.stringify(e);
+        } catch {
+          v = "";
+        }
+        throw new Error("Cyclic dependency" + v);
+      }
+      if (!s.has(e))
+        throw new Error("Found unknown node. Make sure to provided all involved nodes. Unknown node: " + JSON.stringify(e));
+      if (!o[u]) {
+        o[u] = !0;
+        var h = m.get(e) || /* @__PURE__ */ new Set();
+        if (h = Array.from(h), u = h.length) {
+          f.add(e);
+          do {
+            var g = h[--u];
+            c(g, s.get(g), f);
+          } while (u);
+          f.delete(e);
+        }
+        a[--t] = e;
+      }
+    }
+  }
+  function d(n) {
+    for (var r = /* @__PURE__ */ new Set(), t = 0, a = n.length; t < a; t++) {
+      var o = n[t];
+      r.add(o[0]), r.add(o[1]);
+    }
+    return Array.from(r);
+  }
+  function y(n) {
+    for (var r = /* @__PURE__ */ new Map(), t = 0, a = n.length; t < a; t++) {
+      var o = n[t];
+      r.has(o[0]) || r.set(o[0], /* @__PURE__ */ new Set()), r.has(o[1]) || r.set(o[1], /* @__PURE__ */ new Set()), r.get(o[0]).add(o[1]);
+    }
+    return r;
+  }
+  function k(n) {
+    for (var r = /* @__PURE__ */ new Map(), t = 0, a = n.length; t < a; t++)
+      r.set(n[t], t);
+    return r;
+  }
+  return w.exports;
+}
+export {
+  x as __require
+};