@feedmepos/mf-connect 0.1.98-beta.39 → 0.1.98-beta.40

package/dist/rule-builder-DF7fCvec.js

@@ -1,126 +0,0 @@
-import { _ as l, l as u } from "./index-BkgkJkVs.js";
-function i(n, t) {
-  let e = "", s = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
-  const r = s.length;
-  for (let o = 0; o < n; o++)
-    e += s.charAt(Math.floor(Math.random() * r));
-  return e;
-}
-function a(n) {
-  return !n.property && "rules" in n;
-}
-function p(n) {
-  return "property" in n && !!n.property;
-}
-const d = "g_schedule";
-function f(n) {
-  return n.split(/\r?\n/).filter((t) => !t.trim().toUpperCase().startsWith("DTSTART")).join(`
-`).trim();
-}
-function m(n, t = !1) {
-  const e = l.cloneDeep(n);
-  if (p(e)) {
-    const s = e.conditions;
-    return !t && s && typeof s._rrule == "string" && (s._rrule = f(
-      s._rrule
-    )), e;
-  }
-  if (a(e))
-    for (const s in e.rules) {
-      const r = e.rules[s], o = t || a(r) && r.name === d;
-      e.rules[s] = m(
-        r,
-        o
-      );
-    }
-  return e;
-}
-class c {
-  static scaffoldGroup(t) {
-    return {
-      name: t ?? `g_${i(4)}`,
-      rules: {},
-      logic: ""
-    };
-  }
-  static scaffoldEntry(t) {
-    return {
-      name: `r_${i(4)}`,
-      property: t ?? "",
-      conditions: {},
-      negated: !1
-    };
-  }
-  static constructEntry(t, e, s, r) {
-    return {
-      name: r ?? `e_${i(4)}`,
-      property: t,
-      conditions: {
-        [e]: s
-      },
-      negated: !1
-    };
-  }
-  static getLogic(t) {
-    return (t.logic ?? "").includes("||") ? "||" : "&&";
-  }
-  static constructLogic(t, e) {
-    const s = e ?? c.getLogic(t);
-    return Object.entries(t.rules).map(([r, o]) => a(o) ? r : `${o.negated ? "!" : ""}${r}`).join(` ${s} `);
-  }
-  static setRuleToGroup(t, e, s) {
-    let r = u.cloneDeep(t);
-    return Object.keys(r.rules).length === 0 && (r = c.scaffoldGroup(r.name)), Array.isArray(e) ? e.forEach((o) => {
-      r.rules[o.name] = o;
-    }) : r.rules[e.name] = e, r.logic = c.constructLogic(r, s), r;
-  }
-  static removeEntry(t, e, s) {
-    const r = u.cloneDeep(t);
-    return delete r.rules[e], r.logic = c.constructLogic(r, s), r;
-  }
-  static constructRule(t) {
-    switch (t.type) {
-      case "timeframe": {
-        const e = t.property, s = c.scaffoldGroup("timeframe"), r = [];
-        return (t.start || t.end) && r.push(
-          c.constructEntry(e, "_isBetween", {
-            start: t.start || void 0,
-            end: t.end || void 0
-          })
-        ), c.setRuleToGroup(s, r, "&&");
-      }
-      default:
-        throw Error("invalid config type");
-    }
-  }
-  static getRules(t) {
-    return t && "rules" in t ? Object.values(t.rules) : [];
-  }
-  static simplify(t) {
-    const [e] = Object.entries(t.conditions);
-    return e[0], {
-      property: t.property,
-      operator: e[0],
-      equator: e[1]
-    };
-  }
-  static isRuleExceed(t, e) {
-    const r = Object.keys(t.rules).length + (Array.isArray(e) ? e.length : 1);
-    if (r > 10)
-      throw new y(10, r);
-    return !0;
-  }
-}
-class y extends Error {
-  constructor(t, e) {
-    super(
-      `Maximum of ${t} rules allowed per group. Attempted to add ${e} rules.`
-    ), this.name = "MaxRulesExceededError";
-  }
-}
-export {
-  c as R,
-  p as a,
-  a as i,
-  m as s
-};

package/dist/string-Gcy5IM_H.js

@@ -1,32 +0,0 @@
-function l(r, e) {
-  let t = "", a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
-  const c = a.length;
-  for (let n = 0; n < r; n++)
-    t += a.charAt(Math.floor(Math.random() * c));
-  return t;
-}
-const s = {
-  alphabetOnly(r) {
-    return r.replace(/[^a-zA-Z]/g, "");
-  },
-  alphaNumeric(r) {
-    return r.replace(/[^a-zA-Z0-9]/g, "");
-  },
-  numericOnly(r) {
-    return r.replace(/[^0-9]/g, "");
-  },
-  singularOrPlural(r, e, t) {
-    const a = r > 1 ? t || `${e}s` : e;
-    return `${r} ${a}`;
-  }
-}, o = {
-  title: (r) => r.replace(
-    /\b\w+/g,
-    (e) => e.charAt(0).toUpperCase() + e.substring(1).toLowerCase()
-  )
-};
-export {
-  o as c,
-  s as f,
-  l as r
-};