@feedmepos/mf-menu 0.32.20-dev → 0.32.21-dev

package/dist/{menuV2-DGThiIQY.js → menuV2-XGSkthHP.js}

@@ -1,12 +1,12 @@
 var We = Object.defineProperty;
 var Le = (e, t, n) => t in e ? We(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
 var ne = (e, t, n) => Le(e, typeof t != "symbol" ? t + "" : t, n);
-import { K as ae, I as C, D as T, A as ue, aq as re, M as z, J as ie, ae as x, a as L, $ as V, ao as oe, ar as qe, as as Be, B as ze, ag as Ge, at as He, au as Je, ad as Ye } from "./index.vue_vue_type_script_setup_true_lang-CR_9o71G.js";
+import { K as ae, I as C, D as T, A as ue, aq as re, M as B, J as ie, ae as x, a as L, $ as V, ao as oe, ar as qe, as as ze, B as Be, ag as Ge, at as He, au as Je, ad as Ye } from "./index.vue_vue_type_script_setup_true_lang-Df9ujiv_.js";
 import { defineStore as Qe } from "pinia";
 import { shallowRef as j, ref as G, computed as S, shallowReactive as Xe, effectScope as Ze, watch as et } from "vue";
 import { useCoreStore as se } from "@feedmepos/mf-common";
 import { useSnackbar as tt } from "@feedmepos/ui-library";
-const nt = "/assets/linked-status-BWxmjBCJ.js", rt = "/assets/override-menu-wEY-Jpei.js";
+const nt = "/assets/linked-status-SOByQJgY.js", rt = "/assets/override-menu-C7XPhEmL.js";
 function ot(e) {
   var o;
   const t = C(e), n = (o = t.variant) == null ? void 0 : o.variantCombinations;
@@ -14,11 +14,11 @@ function ot(e) {
 }
 function st(e, t, n, o) {
   const r = C(t), u = n ? r.modules.catalog.find((v) => v._id === n) : null, l = o ? r.modules.scheduler.find((v) => v._id === o) : null, a = u ? C(u) : void 0, c = n ? r.modules.catalog.filter((v) => v._id !== n) : [], i = l ? C(l) : void 0, f = e.reduce((v, y) => (v[y._id] = ot(y), v), {});
-  function p(v = []) {
-    const y = e.map((h) => h._id);
+  function h(v = []) {
+    const y = e.map((p) => p._id);
     return [
-      ...v.filter((h) => !y.includes(h._id)),
-      ...Object.values(f).flatMap((h) => h)
+      ...v.filter((p) => !y.includes(p._id)),
+      ...Object.values(f).flatMap((p) => p)
     ];
   }
   return a && o ? (a.override.scheduler = {
@@ -26,7 +26,7 @@ function st(e, t, n, o) {
     [o]: {
       ...a.override.scheduler[o],
       _id: o,
-      items: p(i == null ? void 0 : i.items).map((v) => ({
+      items: h(i == null ? void 0 : i.items).map((v) => ({
         ...v,
         orderFrom: ue.F_ORDER_FROM.enum.ALL
       }))
@@ -34,7 +34,7 @@ function st(e, t, n, o) {
   }, r.modules.catalog = [...c, a], r) : a ? (a.override.items = {
     ...a.override.items,
     ...f
-  }, r.modules.catalog = [...c, a], r) : i ? (i.items = p(i.items), r.modules.scheduler = [
+  }, r.modules.catalog = [...c, a], r) : i ? (i.items = h(i.items), r.modules.scheduler = [
     ...r.modules.scheduler.filter((v) => v._id !== o),
     i
   ], r) : {
@@ -49,23 +49,23 @@ function st(e, t, n, o) {
     _id: r._id
   };
 }
-function P(e, t, n) {
+function F(e, t, n) {
   var u;
   if (n >= 3) return e;
   const o = t.modules.item.find((l) => l._id === e._id);
   if (!o)
     throw new Error(`_insertItemOverriders - Item not found - ${e._id}`);
   const r = (u = o.groups) == null ? void 0 : u.map((l) => {
-    var i, f, p;
+    var i, f, h;
     const a = (i = e == null ? void 0 : e.groups) == null ? void 0 : i.find((v) => v._id === l._id);
     let c;
     return a ? c = ((f = l.items) == null ? void 0 : f.map((v) => {
-      var h;
-      const y = (h = a.items) == null ? void 0 : h.find(
+      var p;
+      const y = (p = a.items) == null ? void 0 : p.find(
         (b) => b._id === v._id && b.combinationKey === v.combinationKey
       );
-      return P(y || v, t, n + 1);
-    })) ?? [] : c = ((p = l.items) == null ? void 0 : p.map((v) => P(v, t, n + 1))) ?? [], {
+      return F(y || v, t, n + 1);
+    })) ?? [] : c = ((h = l.items) == null ? void 0 : h.map((v) => F(v, t, n + 1))) ?? [], {
       ...l,
       items: c
     };
@@ -81,21 +81,21 @@ function P(e, t, n) {
 function at(e, t) {
   const n = e.groups.map((u) => {
     const l = t.modules.group.find((c) => c._id === u._id), a = ((l == null ? void 0 : l.items) || []).map((c) => {
-      var p;
-      const i = (p = u.items) == null ? void 0 : p.find(
+      var h;
+      const i = (h = u.items) == null ? void 0 : h.find(
         (v) => v._id === c._id && v.combinationKey === c.combinationKey
       );
       if (i)
-        return P(i, t, 1);
+        return F(i, t, 1);
       const f = {
         ...T.generator.initMenuV4ItemOverrider(),
         _id: c._id,
         combinationKey: c.combinationKey
       };
-      return P(f, t, 1);
+      return F(f, t, 1);
     });
     return { ...u, items: a };
-  }), o = e.variant ? e.variant.variantCombinations.map((u) => P(u, t, 1)) : [], r = {
+  }), o = e.variant ? e.variant.variantCombinations.map((u) => F(u, t, 1)) : [], r = {
     ...T.generator.initMenuV4ItemOverrider(),
     _id: e._id,
     name: e.name,
@@ -115,7 +115,7 @@ function H(e, t) {
     return r.items = (a = r.items) == null ? void 0 : a.map((c) => {
       var f;
       const i = (f = u == null ? void 0 : u.items) == null ? void 0 : f.find(
-        (p) => p._id === c._id && p.combinationKey === c.combinationKey
+        (h) => h._id === c._id && h.combinationKey === c.combinationKey
       );
       return H(c, i);
     }), r;
@@ -153,17 +153,17 @@ function ut(e, t) {
   };
 }
 async function Dt(e, t, n, o, r, u = !0) {
-  const l = C(n), a = u ? st(t, l, o, r) : l, c = t.reduce((p, v) => (p[v._id] = a.modules.item.find((y) => y._id === v._id), p), {}), i = t.reduce((p, v) => {
+  const l = C(n), a = u ? st(t, l, o, r) : l, c = t.reduce((h, v) => (h[v._id] = a.modules.item.find((y) => y._id === v._id), h), {}), i = t.reduce((h, v) => {
     const y = v._id;
-    return p[y] = at(c[y], e), p;
+    return h[y] = at(c[y], e), h;
   }, {}), f = T.getFallbackPrices({
     rawMenu: a,
     items: i,
     catalogId: o || void 0,
     schedulerId: r
   });
-  return t.map((p) => {
-    const v = p._id, y = c[v];
+  return t.map((h) => {
+    const v = h._id, y = c[v];
     return {
       ...ut(f, y),
       category: o || r ? y == null ? void 0 : y.category : null
@@ -219,7 +219,7 @@ function Kt(e, t, n) {
   }
   return r(t, n);
 }
-function $t(e, t, n) {
+function Pt(e, t, n) {
   const o = /* @__PURE__ */ new Set();
   function r(u, l) {
     if (!e || !u || !l || o.has(u)) return !1;
@@ -234,30 +234,30 @@ function $t(e, t, n) {
   }
   return r(t, n);
 }
-const B = /* @__PURE__ */ new Map();
+const z = /* @__PURE__ */ new Map();
 async function it(e, t, n) {
   const o = `${e._id}-${e.updatedAt}-${t || "null"}-${n || "null"}`;
-  if (B.has(o))
-    return B.get(o);
+  if (z.has(o))
+    return z.get(o);
   const r = await ce(e, t, n);
-  return B.set(o, r), r;
+  return z.set(o, r), r;
 }
-async function Ft(e, t, n) {
+async function $t(e, t, n) {
   var l, a;
   const o = await it(e, t, null), r = [], u = (c, i) => {
     const f = C(c);
-    for (const p in i)
-      i[p] && (f[p] = i[p]);
+    for (const h in i)
+      i[h] && (f[h] = i[h]);
     return f;
   };
   for (const c of o.modules.group) {
-    const i = (l = c.items) == null ? void 0 : l.find((p) => p._id === n && !p.combinationKey), f = e.modules.item.find((p) => p._id === n);
+    const i = (l = c.items) == null ? void 0 : l.find((h) => h._id === n && !h.combinationKey), f = e.modules.item.find((h) => h._id === n);
     if (i) {
-      const p = (a = c.items) == null ? void 0 : a.filter((y) => y._id === n && y.combinationKey), v = [i, ...p].map((y) => {
-        var w, E;
-        const h = y.combinationKey ? (E = (w = f == null ? void 0 : f.variant) == null ? void 0 : w.variantCombinations) == null ? void 0 : E.find(
+      const h = (a = c.items) == null ? void 0 : a.filter((y) => y._id === n && y.combinationKey), v = [i, ...h].map((y) => {
+        var M, E;
+        const p = y.combinationKey ? (E = (M = f == null ? void 0 : f.variant) == null ? void 0 : M.variantCombinations) == null ? void 0 : E.find(
           (I) => I.combinationKey === y.combinationKey
-        ) : f, b = h && f ? u(f, h) : y;
+        ) : f, b = p && f ? u(f, p) : y;
         return u(b, y);
       });
       r.push({
@@ -268,7 +268,7 @@ async function Ft(e, t, n) {
   }
   return r;
 }
-const M = 0, K = 3;
+const w = 0, K = 3;
 function ct(e) {
   const t = /^\/(.*)\/([gimyu]*)$/.exec(e.toString());
   if (!t)
@@ -291,13 +291,13 @@ function O(e) {
     Object.prototype.hasOwnProperty.call(e, n) && (t[n] = O(e[n]));
   return t;
 }
-function F(e) {
+function $(e) {
   return e instanceof RegExp ? e.toString() : e;
 }
 function R(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e) && !(e instanceof Date) && !(e instanceof RegExp);
 }
-function $(e, t) {
+function P(e, t) {
   if (e === t) return !0;
   if (typeof e != typeof t) return !1;
   if (e instanceof Date && t instanceof Date)
@@ -307,14 +307,14 @@ function $(e, t) {
   if (Array.isArray(e) && Array.isArray(t)) {
     if (e.length !== t.length) return !1;
     for (let n = 0; n < e.length; n++)
-      if (!$(e[n], t[n])) return !1;
+      if (!P(e[n], t[n])) return !1;
     return !0;
   }
   if (R(e) && R(t)) {
     const n = Object.keys(e), o = Object.keys(t);
     if (n.length !== o.length) return !1;
     for (const r of n)
-      if (!Object.prototype.hasOwnProperty.call(t, r) || !$(e[r], t[r])) return !1;
+      if (!Object.prototype.hasOwnProperty.call(t, r) || !P(e[r], t[r])) return !1;
     return !0;
   }
   return !1;
@@ -327,10 +327,10 @@ function lt(e, t, n) {
   }
   const l = [], a = /* @__PURE__ */ new Set();
   for (let c = 0; c < o; c++) {
-    const i = e[c], f = n ? n(i) : JSON.stringify(i), p = u.get(f);
-    if (p) {
-      for (const v of p)
-        if (!a.has(v) && $(i, t[v])) {
+    const i = e[c], f = n ? n(i) : JSON.stringify(i), h = u.get(f);
+    if (h) {
+      for (const v of h)
+        if (!a.has(v) && P(i, t[v])) {
           l.push({ leftIndex: c, rightIndex: v }), a.add(v);
           break;
         }
@@ -340,42 +340,42 @@ function lt(e, t, n) {
 }
 function dt(e, t, n) {
   var v, y;
-  if ($(e, t)) return;
+  if (P(e, t)) return;
   const o = { _t: "a" }, r = ((v = n == null ? void 0 : n.arrays) == null ? void 0 : v.detectMove) !== !1, u = ((y = n == null ? void 0 : n.arrays) == null ? void 0 : y.includeValueOnMove) === !0, l = n == null ? void 0 : n.objectHash;
   let a = r ? lt(e, t, l) : [];
   if (!l && e.length === t.length && e.length > 0 && a.length < e.length) {
-    const h = R(e[0]) || Array.isArray(e[0]), b = a.length > 0;
-    if (h || b) {
+    const p = R(e[0]) || Array.isArray(e[0]), b = a.length > 0;
+    if (p || b) {
       a = [];
-      for (let w = 0; w < e.length; w++)
-        a.push({ leftIndex: w, rightIndex: w });
+      for (let M = 0; M < e.length; M++)
+        a.push({ leftIndex: M, rightIndex: M });
     }
   }
-  new Set(a.map((h) => h.leftIndex));
-  const c = new Set(a.map((h) => h.rightIndex)), i = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
-  for (const h of a)
-    i.set(h.leftIndex, h.rightIndex), f.set(h.rightIndex, h.leftIndex);
-  for (let h = 0; h < e.length; h++) {
-    const b = i.get(h);
+  new Set(a.map((p) => p.leftIndex));
+  const c = new Set(a.map((p) => p.rightIndex)), i = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
+  for (const p of a)
+    i.set(p.leftIndex, p.rightIndex), f.set(p.rightIndex, p.leftIndex);
+  for (let p = 0; p < e.length; p++) {
+    const b = i.get(p);
     if (b !== void 0) {
-      const w = J(e[h], t[b], n);
-      if (w !== void 0 && (o[b] = w), r && b !== h) {
-        const E = `_${h}`, I = u ? [e[h], b, K] : ["", b, K];
+      const M = J(e[p], t[b], n);
+      if (M !== void 0 && (o[b] = M), r && b !== p) {
+        const E = `_${p}`, I = u ? [e[p], b, K] : ["", b, K];
         o[E] = I;
       }
     } else {
-      const w = `_${h}`;
-      o[w] = [e[h], M, M];
+      const M = `_${p}`;
+      o[M] = [e[p], w, w];
     }
   }
-  for (let h = 0; h < t.length; h++)
-    c.has(h) || (o[h] = [t[h]]);
-  const p = Object.keys(o);
-  if (!(p.length === 1 && p[0] === "_t"))
+  for (let p = 0; p < t.length; p++)
+    c.has(p) || (o[p] = [t[p]]);
+  const h = Object.keys(o);
+  if (!(h.length === 1 && h[0] === "_t"))
     return o;
 }
 function ft(e, t, n) {
-  if ($(e, t)) return;
+  if (P(e, t)) return;
   const o = {}, r = Object.keys(e), u = Object.keys(t), l = /* @__PURE__ */ new Set([...r, ...u]);
   for (const a of l) {
     if (n != null && n.propertyFilter && !n.propertyFilter(a, { left: e, right: t }))
@@ -386,27 +386,27 @@ function ft(e, t, n) {
       f !== void 0 && (o[a] = f);
     } else if (c && !i) {
       const f = n != null && n.omitRemovedValues ? 0 : e[a];
-      o[a] = [f, M, M];
+      o[a] = [f, w, w];
     } else !c && i && (o[a] = [t[a]]);
   }
   return Object.keys(o).length > 0 ? o : void 0;
 }
 function J(e, t, n) {
-  if ($(e, t)) return;
+  if (P(e, t)) return;
   if (e === void 0 && t !== void 0) {
     const a = n != null && n.cloneDiffValues ? O(t) : t;
-    return [F(a)];
+    return [$(a)];
   }
   if (typeof e !== typeof t || e instanceof Date != t instanceof Date || e instanceof RegExp != t instanceof RegExp || Array.isArray(e) !== Array.isArray(t)) {
     const a = n != null && n.cloneDiffValues ? O(e) : e, c = n != null && n.cloneDiffValues ? O(t) : t;
-    return [F(a), F(c)];
+    return [$(a), $(c)];
   }
   if (Array.isArray(e) && Array.isArray(t))
     return dt(e, t, n);
   if (R(e) && R(t))
     return ft(e, t, n);
   const u = n != null && n.cloneDiffValues ? O(e) : e, l = n != null && n.cloneDiffValues ? O(t) : t;
-  return [F(u), F(l)];
+  return [$(u), $(l)];
 }
 function mt(e, t, n) {
   return J(e, t, n);
@@ -416,7 +416,7 @@ function vt(e, t, n) {
   for (const a in t) {
     if (a === "_t" || !a.startsWith("_")) continue;
     const c = parseInt(a.slice(1)), i = t[a];
-    Array.isArray(i) && (i.length === 3 && i[2] === M ? o.add(c) : i.length === 3 && i[2] === K && r.set(c, i[1]));
+    Array.isArray(i) && (i.length === 3 && i[2] === w ? o.add(c) : i.length === 3 && i[2] === K && r.set(c, i[1]));
   }
   const u = [];
   let l = 0;
@@ -432,9 +432,9 @@ function vt(e, t, n) {
       }
     else {
       let f = !1;
-      for (const [p, v] of r.entries())
+      for (const [h, v] of r.entries())
         if (v === a) {
-          u.push(e[p]), f = !0;
+          u.push(e[h]), f = !0;
           break;
         }
       if (!f) {
@@ -453,7 +453,7 @@ function yt(e, t, n) {
   const o = { ...e };
   for (const r in t) {
     const u = t[r];
-    Array.isArray(u) ? u.length === 1 ? o[r] = u[0] : u.length === 3 && u[2] === M ? delete o[r] : u.length === 2 && (o[r] = u[1]) : o[r] = Y(o[r], u);
+    Array.isArray(u) ? u.length === 1 ? o[r] = u[0] : u.length === 3 && u[2] === w ? delete o[r] : u.length === 2 && (o[r] = u[1]) : o[r] = Y(o[r], u);
   }
   return o;
 }
@@ -464,7 +464,7 @@ function Y(e, t, n) {
       return t[0];
     if (t.length === 2)
       return t[1];
-    if (t.length === 3 && t[2] === M)
+    if (t.length === 3 && t[2] === w)
       return;
   }
   return R(t) && t._t === "a" ? vt(e, t) : R(t) && R(e) ? yt(e, t) : e;
@@ -472,14 +472,14 @@ function Y(e, t, n) {
 function le(e, t, n) {
   return Y(e, t);
 }
-function pt(e) {
+function ht(e) {
   const t = { _t: "a" };
   for (const n in e)
     if (n !== "_t")
       if (n.startsWith("_")) {
         const o = parseInt(n.slice(1)), r = e[n];
         if (Array.isArray(r)) {
-          if (r.length === 3 && r[2] === M)
+          if (r.length === 3 && r[2] === w)
             t[o] = [r[0]];
           else if (r.length === 3 && r[2] === K) {
             const u = r[1];
@@ -489,7 +489,7 @@ function pt(e) {
       } else {
         const o = parseInt(n), r = e[n];
         if (Array.isArray(r) && r.length === 1)
-          t[`_${o}`] = [r[0], M, M];
+          t[`_${o}`] = [r[0], w, w];
         else {
           const u = Q(r);
           u !== void 0 && (t[n] = u);
@@ -497,12 +497,12 @@ function pt(e) {
       }
   return t;
 }
-function ht(e) {
+function pt(e) {
   const t = {};
   for (const n in e) {
     const o = e[n];
     if (Array.isArray(o))
-      o.length === 1 ? t[n] = [o[0], M, M] : o.length === 3 && o[2] === M ? t[n] = [o[0]] : o.length === 2 && (t[n] = [o[1], o[0]]);
+      o.length === 1 ? t[n] = [o[0], w, w] : o.length === 3 && o[2] === w ? t[n] = [o[0]] : o.length === 2 && (t[n] = [o[1], o[0]]);
     else {
       const r = Q(o);
       r !== void 0 && (t[n] = r);
@@ -514,15 +514,15 @@ function Q(e) {
   if (e !== void 0) {
     if (Array.isArray(e)) {
       if (e.length === 1)
-        return [e[0], M, M];
+        return [e[0], w, w];
       if (e.length === 2)
         return [e[1], e[0]];
-      if (e.length === 3 && e[2] === M)
+      if (e.length === 3 && e[2] === w)
         return [e[0]];
       if (e.length === 3 && e[2] === K)
         return e;
     }
-    return R(e) && e._t === "a" ? pt(e) : R(e) ? ht(e) : e;
+    return R(e) && e._t === "a" ? ht(e) : R(e) ? pt(e) : e;
   }
 }
 function de(e) {
@@ -572,8 +572,8 @@ function bt({
       n.value = C(y), u.value = C(y), o.value = [{ delta: null }], r.value = 0;
       return;
     }
-    const h = t.diff(u.value, y);
-    if (r.value < o.value.length - 1 && (o.value = o.value.slice(0, r.value + 1)), o.value.push({ delta: h }), r.value++, u.value = C(y), o.value.length > e) {
+    const p = t.diff(u.value, y);
+    if (r.value < o.value.length - 1 && (o.value = o.value.slice(0, r.value + 1)), o.value.push({ delta: p }), r.value++, u.value = C(y), o.value.length > e) {
       const b = o.value[1].delta;
       b && n.value && (n.value = t.patch(C(n.value), b)), o.value.shift(), r.value--;
     }
@@ -581,12 +581,12 @@ function bt({
   function i(y) {
     if (!n.value || y < 0 || y >= o.value.length)
       return;
-    let h = C(n.value);
+    let p = C(n.value);
     for (let b = 1; b <= y; b++) {
-      const w = o.value[b];
-      w.delta && (h = t.patch(h, w.delta));
+      const M = o.value[b];
+      M.delta && (p = t.patch(p, M.delta));
     }
-    return h;
+    return p;
   }
   function f() {
     if (l.value) {
@@ -595,7 +595,7 @@ function bt({
       return y && (u.value = C(y)), y;
     }
   }
-  function p() {
+  function h() {
     if (a.value) {
       r.value++;
       const y = i(r.value);
@@ -610,13 +610,13 @@ function bt({
     canUndo: l,
     canRedo: a,
     undo: f,
-    redo: p,
+    redo: h,
     clear: v
   };
 }
-const wt = {
+const Mt = {
   async updateMenuModule(e, t) {
-    const n = z.RequestRunner.operation(t, e.modules);
+    const n = B.RequestRunner.operation(t, e.modules);
     if (n.validateError.length > 0)
       throw new Error(n.validateError.join(`
 `));
@@ -651,7 +651,7 @@ function fe() {
     updatedAt: (/* @__PURE__ */ new Date()).toISOString()
   };
 }
-function Mt() {
+function wt() {
   return {
     restaurants: [],
     menu: { ...fe(), _rev: "" },
@@ -664,10 +664,10 @@ function Mt() {
     }
   };
 }
-const Pt = Qe(
+const Ft = Qe(
   "mf-menu-store-v2",
   () => {
-    const e = Xe(Mt()), t = se(), n = tt(), o = S(() => e.menu.modules.serveSequence ? x(e.menu.modules.serveSequence, {
+    const e = Xe(wt()), t = se(), n = tt(), o = S(() => e.menu.modules.serveSequence ? x(e.menu.modules.serveSequence, {
       selector: "position"
     }) : []), r = S(() => {
       var s;
@@ -686,14 +686,14 @@ const Pt = Qe(
         items: e.menu.modules.item,
         ...e.currentRestaurantAttrParams ?? {}
       })), s;
-    }), c = S(() => x(p.value.modules.scheduler, { selector: "name" })), i = S(() => e.menu.modules.scheduler.find(
+    }), c = S(() => x(h.value.modules.scheduler, { selector: "name" })), i = S(() => e.menu.modules.scheduler.find(
       (s) => s._id === e.currentSchedulerId
     ));
     function f(s, d = !0) {
       e.menu = { ...s, _rev: e.menu._rev }, d && D.push(e.menu);
     }
-    const p = j(fe()), v = G(!1), y = G(1);
-    async function h() {
+    const h = j(fe()), v = G(!1), y = G(1);
+    async function p() {
       var m;
       v.value = !0;
       let s = e.menu.modules.catalog;
@@ -725,15 +725,15 @@ const Pt = Qe(
         ), A = new Set(((_ == null ? void 0 : _.items) || []).map((k) => k._id));
         d.modules.item = d.modules.item.filter((k) => A.has(k._id));
       }
-      return p.value = d, v.value = !1, y.value = y.value + 1, d;
+      return h.value = d, v.value = !1, y.value = y.value + 1, d;
     }
-    const w = ie.debounce(h, 200);
+    const M = ie.debounce(p, 200);
     let E = null, I = null;
     function X() {
       I && (I(), I = null), E && E.stop(), E = Ze(!0), I = E.run(() => et(
         () => [e.menu, e.currentCatalogId, e.currentSchedulerId],
         () => {
-          v.value || w();
+          v.value || M();
         }
       )) || null;
     }
@@ -748,7 +748,7 @@ const Pt = Qe(
         value: s._id
       }))
     ]), Z = S(() => {
-      const s = p.value.modules.category;
+      const s = h.value.modules.category;
       return [
         ...U.value.item.addon ? [
           {
@@ -760,11 +760,11 @@ const Pt = Qe(
         ...V(s, (d) => d.name)
       ];
     }), ve = S(() => {
-      const s = p.value.modules.subCategory || [];
+      const s = h.value.modules.subCategory || [];
       return V(s, (d) => d.name);
     }), ee = S(() => {
       var d;
-      let s = p.value.modules.item;
+      let s = h.value.modules.item;
       if (a.value) {
         const m = (d = a.value) == null ? void 0 : d.override.items;
         s = s.filter((g) => {
@@ -785,7 +785,7 @@ const Pt = Qe(
         m,
         (g) => g.code || g.name
       ).reduce((g, _, A) => (g[_._id] = A + d[_.category || ""], g), {});
-    }), pe = S(() => oe(N.value, Z.value, ee.value)), he = S(() => {
+    }), he = S(() => oe(N.value, Z.value, ee.value)), pe = S(() => {
       const s = U.value.item.addon ? [
         {
           _id: e.currentCatalogId ? "" : null,
@@ -800,19 +800,19 @@ const Pt = Qe(
         e.menu.modules.item
       );
     }), N = S(() => {
-      const s = p.value.modules.variant;
+      const s = h.value.modules.variant;
       return x(s, { selector: "name" });
     });
     function ge(s = []) {
       const d = s.map((g) => N.value.find((_) => _._id === g)).filter((g) => !!g);
       return T.fullVariantCombination(d).reduce((g, _) => (g[_.combinationKey] = _.selectionName.join(" / "), g), {});
     }
-    const _e = S(() => V(p.value.modules.group, (s) => s.name)), Se = S(() => x(p.value.modules.takeaway, { selector: "name" })), be = S(() => x(e.menu.modules.printDepartment || [], {
+    const _e = S(() => V(h.value.modules.group, (s) => s.name)), Se = S(() => x(h.value.modules.takeaway, { selector: "name" })), be = S(() => x(e.menu.modules.printDepartment || [], {
       selector: "name"
-    })), we = S(() => x(e.menu.modules.unit, { selector: "name" })), Me = S(() => x(qe(e.menu.modules.recipe, e.menu.modules.sku), {
+    })), Me = S(() => x(e.menu.modules.unit, { selector: "name" })), we = S(() => x(qe(e.menu.modules.recipe, e.menu.modules.sku), {
       selector: "name"
     })), Ae = S(() => e.menu.modules.cookingGuide), Ce = S(() => {
-      const s = Be(e.menu.modules.sku);
+      const s = ze(e.menu.modules.sku);
       return x(s, { selector: "code" });
     }), Ee = S(() => {
       const s = /* @__PURE__ */ new Map();
@@ -904,7 +904,7 @@ const Pt = Qe(
     }
     const ke = S(() => {
       var g;
-      const s = ["SV5", "SV10"], d = ze.Country.getCountryFlattenTaxes(
+      const s = ["SV5", "SV10"], d = Be.Country.getCountryFlattenTaxes(
         se().currentCountry.value
       ), m = d.filter((_) => u.value || !s.includes(_.taxCode)).map((_) => ({
         label: `${_.name} (${Ge(_.rate)}%)`,
@@ -945,12 +945,12 @@ const Pt = Qe(
       }));
       try {
         if (d || g.some(
-          (A) => [z.F_OPERATION_TYPE.delete, z.F_OPERATION_TYPE.deleteMany].includes(A.operation)
+          (A) => [B.F_OPERATION_TYPE.delete, B.F_OPERATION_TYPE.deleteMany].includes(A.operation)
         )) {
           const A = await He(g, e.menu.modules);
           if (A !== !0) throw new Error(A);
         }
-        const _ = await wt.updateMenuModule(e.menu, g);
+        const _ = await Mt.updateMenuModule(e.menu, g);
         return f(_.menu), _;
       } catch (_) {
         n.open({
@@ -959,7 +959,7 @@ const Pt = Qe(
           message: _
         });
       }
-    }, $e = async (s) => {
+    }, Pe = async (s) => {
       const d = {
         ...e.menu,
         masterCatalogSetting: s.masterCatalogSetting,
@@ -967,7 +967,7 @@ const Pt = Qe(
         priceTierSettings: s.priceTierSettings
       };
       return f(d), d;
-    }, D = bt({ maxHistorySize: 50 }), Fe = S(() => D.canUndo.value), Pe = S(() => D.canRedo.value), je = () => {
+    }, D = bt({ maxHistorySize: 50 }), $e = S(() => D.canUndo.value), Fe = S(() => D.canRedo.value), je = () => {
       const s = D.undo();
       s && f(s, !1);
     }, Ne = () => {
@@ -982,7 +982,7 @@ const Pt = Qe(
       workerIsComputing: v,
       mergedMenuChangeId: y,
       // async computed state
-      mergedMenu: p,
+      mergedMenu: h,
       // Computed
       version: r,
       isV4: u,
@@ -997,14 +997,14 @@ const Pt = Qe(
       items: ee,
       sortedItems: ye,
       itemCodeMap: Ee,
-      categorizedItems: pe,
-      categorizedRawMenuItems: he,
+      categorizedItems: he,
+      categorizedRawMenuItems: pe,
       variants: N,
       groups: _e,
       takeaways: Se,
       printDepartments: be,
-      units: we,
-      recipes: Me,
+      units: Me,
+      recipes: we,
       cookingGuide: Ae,
       skus: Ce,
       rules: U,
@@ -1018,21 +1018,21 @@ const Pt = Qe(
       selectCategory: Ve,
       setRestaurantAttrParams: Te,
       updateMenu: Ke,
-      updateMenuSetting: $e,
-      computeMergedMenu: h,
+      updateMenuSetting: Pe,
+      computeMergedMenu: p,
       // helper
       encodeTax: W,
       decodeTax: Ie,
       getSelectedTax: Re,
       mapVariant: ge,
       // history
-      canUndoHistory: Fe,
-      canRedoHistory: Pe,
+      canUndoHistory: $e,
+      canRedoHistory: Fe,
       undoHistory: je,
       redoHistory: Ne,
       // cleanup
       $dispose: () => {
-        w.cancel(), I && (I(), I = null), E && (E.stop(), E = null), Ue();
+        M.cancel(), I && (I(), I = null), E && (E.stop(), E = null), Ue();
       },
       $reinitialize: () => {
         X();
@@ -1043,10 +1043,10 @@ const Pt = Qe(
 export {
   Tt as a,
   Kt as b,
-  $t as c,
-  Ft as f,
+  Pt as c,
+  $t as f,
   Vt as g,
   Dt as m,
   it as o,
-  Pt as u
+  Ft as u
 };