@feedmepos/mf-menu 0.32.22 → 0.32.23

package/dist/{menuV2-BuozgDwv.js → menuV2-Do5huiRH.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 G, J as ie, ae as x, a as L, $ as V, ao as oe, ar as qe, as as ze, B as Ge, ag as He, at as Be, au as Je, ad as Ye } from "./index.vue_vue_type_script_setup_true_lang-D_wU6u8D.js";
-import { defineStore as Qe } from "pinia";
-import { shallowRef as j, ref as H, computed as S, shallowReactive as Xe, effectScope as Ze, watch as et } from "vue";
+import { K as ae, I as C, D as T, A as ue, aq as re, M as G, J as ie, ae as x, a as L, $ as V, ao as oe, ar as qe, as as ze, B as Ge, ag as Be, at as He, au as Je, ad as Ye } from "./index.vue_vue_type_script_setup_true_lang-_L_fpAVx.js";
+import { defineStore as Ze } from "pinia";
+import { shallowRef as j, ref as B, computed as S, shallowReactive as Qe, effectScope as Xe, 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-UoodHSbO.js", rt = "/assets/override-menu-DTyQWy5-.js";
+const nt = "/assets/linked-status-DsLZPMEN.js", rt = "/assets/override-menu-pjqPpoTC.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 h(v = []) {
-    const y = e.map((p) => p._id);
+  function p(v = []) {
+    const y = e.map((h) => h._id);
     return [
-      ...v.filter((p) => !y.includes(p._id)),
-      ...Object.values(f).flatMap((p) => p)
+      ...v.filter((h) => !y.includes(h._id)),
+      ...Object.values(f).flatMap((h) => h)
     ];
   }
   return a && o ? (a.override.scheduler = {
@@ -26,7 +26,7 @@ function st(e, t, n, o) {
     [o]: {
       ...a.override.scheduler[o],
       _id: o,
-      items: h(i == null ? void 0 : i.items).map((v) => ({
+      items: p(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 = h(i.items), r.modules.scheduler = [
+  }, r.modules.catalog = [...c, a], r) : i ? (i.items = p(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, h;
+    var i, f, p;
     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 p;
-      const y = (p = a.items) == null ? void 0 : p.find(
+      var h;
+      const y = (h = a.items) == null ? void 0 : h.find(
         (b) => b._id === v._id && b.combinationKey === v.combinationKey
       );
-      return P(y || v, t, n + 1);
-    })) ?? [] : c = ((h = l.items) == null ? void 0 : h.map((v) => P(v, t, n + 1))) ?? [], {
+      return F(y || v, t, n + 1);
+    })) ?? [] : c = ((p = l.items) == null ? void 0 : p.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 h;
-      const i = (h = u.items) == null ? void 0 : h.find(
+      var p;
+      const i = (p = u.items) == null ? void 0 : p.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,
@@ -104,7 +104,7 @@ function at(e, t) {
   };
   return [...o, r];
 }
-function B(e, t) {
+function H(e, t) {
   var o;
   if (!t)
     return e;
@@ -115,9 +115,9 @@ function B(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(
-        (h) => h._id === c._id && h.combinationKey === c.combinationKey
+        (p) => p._id === c._id && p.combinationKey === c.combinationKey
       );
-      return B(c, i);
+      return H(c, i);
     }), r;
   }), n;
 }
@@ -131,7 +131,7 @@ function ut(e, t) {
       );
       if (!u)
         throw new Error(`Item overrider not found - ${r._id} - ${r.combinationKey}`);
-      return B(u, r);
+      return H(u, r);
     })
   });
   const o = n.find((r) => !r.combinationKey);
@@ -145,7 +145,7 @@ function ut(e, t) {
       const c = (i = u == null ? void 0 : u.items) == null ? void 0 : i.find(
         (f) => f._id === a._id && f.combinationKey === a.combinationKey
       );
-      return B(a, c);
+      return H(a, c);
     }), r;
   }), {
     ...t,
@@ -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((h, v) => (h[v._id] = a.modules.item.find((y) => y._id === v._id), h), {}), i = t.reduce((h, v) => {
+  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 y = v._id;
-    return h[y] = at(c[y], e), h;
+    return p[y] = at(c[y], e), p;
   }, {}), f = T.getFallbackPrices({
     rawMenu: a,
     items: i,
     catalogId: o || void 0,
     schedulerId: r
   });
-  return t.map((h) => {
-    const v = h._id, y = c[v];
+  return t.map((p) => {
+    const v = p._id, y = c[v];
     return {
       ...ut(f, y),
       category: o || r ? y == null ? void 0 : y.category : null
@@ -204,7 +204,7 @@ async function ce(e, t, n) {
     schedulerId: n
   });
 }
-function Kt(e, t, n) {
+function Pt(e, t, n) {
   const o = /* @__PURE__ */ new Set();
   function r(u, l) {
     if (!e || !u || !l || o.has(l)) return !1;
@@ -219,7 +219,7 @@ function Kt(e, t, n) {
   }
   return r(t, n);
 }
-function $t(e, t, n) {
+function Kt(e, t, n) {
   const o = /* @__PURE__ */ new Set();
   function r(u, l) {
     if (!e || !u || !l || o.has(u)) return !1;
@@ -242,22 +242,22 @@ async function it(e, t, n) {
   const r = await ce(e, t, n);
   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 h in i)
-      i[h] && (f[h] = i[h]);
+    for (const p in i)
+      i[p] && (f[p] = i[p]);
     return f;
   };
   for (const c of o.modules.group) {
-    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);
+    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);
     if (i) {
-      const h = (a = c.items) == null ? void 0 : a.filter((y) => y._id === n && y.combinationKey), v = [i, ...h].map((y) => {
-        var M, I;
-        const p = y.combinationKey ? (I = (M = f == null ? void 0 : f.variant) == null ? void 0 : M.variantCombinations) == null ? void 0 : I.find(
-          (E) => E.combinationKey === y.combinationKey
-        ) : f, b = p && f ? u(f, p) : y;
+      const p = (a = c.items) == null ? void 0 : a.filter((y) => y._id === n && y.combinationKey), v = [i, ...p].map((y) => {
+        var M, E;
+        const h = 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;
         return u(b, y);
       });
       r.push({
@@ -268,7 +268,7 @@ async function Ft(e, t, n) {
   }
   return r;
 }
-const w = 0, K = 3;
+const w = 0, P = 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) {
+function k(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e) && !(e instanceof Date) && !(e instanceof RegExp);
 }
-function $(e, t) {
+function K(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 (!K(e[n], t[n])) return !1;
     return !0;
   }
-  if (R(e) && R(t)) {
+  if (k(e) && k(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) || !K(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), h = u.get(f);
-    if (h) {
-      for (const v of h)
-        if (!a.has(v) && $(i, t[v])) {
+    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) && K(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 (K(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 p = R(e[0]) || Array.isArray(e[0]), b = a.length > 0;
-    if (p || b) {
+    const h = k(e[0]) || Array.isArray(e[0]), b = a.length > 0;
+    if (h || b) {
       a = [];
       for (let M = 0; M < e.length; M++)
         a.push({ leftIndex: M, rightIndex: M });
     }
   }
-  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);
+  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);
     if (b !== void 0) {
-      const M = J(e[p], t[b], n);
-      if (M !== void 0 && (o[b] = M), r && b !== p) {
-        const I = `_${p}`, E = u ? [e[p], b, K] : ["", b, K];
-        o[I] = E;
+      const M = J(e[h], t[b], n);
+      if (M !== void 0 && (o[b] = M), r && b !== h) {
+        const E = `_${h}`, I = u ? [e[h], b, P] : ["", b, P];
+        o[E] = I;
       }
     } else {
-      const M = `_${p}`;
-      o[M] = [e[p], w, w];
+      const M = `_${h}`;
+      o[M] = [e[h], w, w];
     }
   }
-  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"))
+  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"))
     return o;
 }
 function ft(e, t, n) {
-  if ($(e, t)) return;
+  if (K(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 }))
@@ -392,21 +392,21 @@ function ft(e, t, n) {
   return Object.keys(o).length > 0 ? o : void 0;
 }
 function J(e, t, n) {
-  if ($(e, t)) return;
+  if (K(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))
+  if (k(e) && k(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] === w ? 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] === P && 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 [h, v] of r.entries())
+      for (const [p, v] of r.entries())
         if (v === a) {
-          u.push(e[h]), f = !0;
+          u.push(e[p]), f = !0;
           break;
         }
       if (!f) {
@@ -467,12 +467,12 @@ function Y(e, t, n) {
     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;
+  return k(t) && t._t === "a" ? vt(e, t) : k(t) && k(e) ? yt(e, t) : e;
 }
 function le(e, t, n) {
   return Y(e, t);
 }
-function ht(e) {
+function pt(e) {
   const t = { _t: "a" };
   for (const n in e)
     if (n !== "_t")
@@ -481,9 +481,9 @@ function ht(e) {
         if (Array.isArray(r)) {
           if (r.length === 3 && r[2] === w)
             t[o] = [r[0]];
-          else if (r.length === 3 && r[2] === K) {
+          else if (r.length === 3 && r[2] === P) {
             const u = r[1];
-            t[`_${u}`] = [r[0], o, K];
+            t[`_${u}`] = [r[0], o, P];
           }
         }
       } else {
@@ -491,26 +491,26 @@ function ht(e) {
         if (Array.isArray(r) && r.length === 1)
           t[`_${o}`] = [r[0], w, w];
         else {
-          const u = Q(r);
+          const u = Z(r);
           u !== void 0 && (t[n] = u);
         }
       }
   return t;
 }
-function pt(e) {
+function ht(e) {
   const t = {};
   for (const n in e) {
     const o = e[n];
     if (Array.isArray(o))
       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);
+      const r = Z(o);
       r !== void 0 && (t[n] = r);
     }
   }
   return t;
 }
-function Q(e) {
+function Z(e) {
   if (e !== void 0) {
     if (Array.isArray(e)) {
       if (e.length === 1)
@@ -519,14 +519,14 @@ function Q(e) {
         return [e[1], e[0]];
       if (e.length === 3 && e[2] === w)
         return [e[0]];
-      if (e.length === 3 && e[2] === K)
+      if (e.length === 3 && e[2] === P)
         return e;
     }
-    return R(e) && e._t === "a" ? ht(e) : R(e) ? pt(e) : e;
+    return k(e) && e._t === "a" ? pt(e) : k(e) ? ht(e) : e;
   }
 }
 function de(e) {
-  return Q(e);
+  return Z(e);
 }
 function gt(e, t, n) {
   const o = de(t);
@@ -566,14 +566,14 @@ function bt({
       includeValueOnMove: !1
     },
     cloneDiffValues: !1
-  }), n = j(null), o = j([]), r = H(-1), u = j(null), l = S(() => r.value > 0), a = S(() => r.value < o.value.length - 1);
+  }), n = j(null), o = j([]), r = B(-1), u = j(null), l = S(() => r.value > 0), a = S(() => r.value < o.value.length - 1);
   function c(y) {
     if (n.value === null) {
       n.value = C(y), u.value = C(y), o.value = [{ delta: null }], r.value = 0;
       return;
     }
-    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 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 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 p = C(n.value);
+    let h = C(n.value);
     for (let b = 1; b <= y; b++) {
       const M = o.value[b];
-      M.delta && (p = t.patch(p, M.delta));
+      M.delta && (h = t.patch(h, M.delta));
     }
-    return p;
+    return h;
   }
   function f() {
     if (l.value) {
@@ -595,7 +595,7 @@ function bt({
       return y && (u.value = C(y)), y;
     }
   }
-  function h() {
+  function p() {
     if (a.value) {
       r.value++;
       const y = i(r.value);
@@ -610,7 +610,7 @@ function bt({
     canUndo: l,
     canRedo: a,
     undo: f,
-    redo: h,
+    redo: p,
     clear: v
   };
 }
@@ -664,10 +664,10 @@ function wt() {
     }
   };
 }
-const Pt = Qe(
+const Ft = Ze(
   "mf-menu-store-v2",
   () => {
-    const e = Xe(wt()), t = se(), n = tt(), o = S(() => e.menu.modules.serveSequence ? x(e.menu.modules.serveSequence, {
+    const e = Qe(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(h.value.modules.scheduler, { selector: "name" })), i = S(() => e.menu.modules.scheduler.find(
+    }), c = S(() => x(p.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 h = j(fe()), v = H(!1), y = H(1);
-    async function p() {
+    const p = j(fe()), v = B(!1), y = B(1);
+    async function h() {
       var m;
       v.value = !0;
       let s = e.menu.modules.catalog;
@@ -719,25 +719,25 @@ const Pt = Qe(
       );
       if (e.currentSchedulerId != null) {
         const g = e.menu.modules.catalog.find(
-          (k) => k._id === e.currentCatalogId
+          (R) => R._id === e.currentCatalogId
         ), _ = g ? g.override.scheduler[e.currentSchedulerId] : e.menu.modules.scheduler.find(
-          (k) => k._id === e.currentSchedulerId
-        ), A = new Set(((_ == null ? void 0 : _.items) || []).map((k) => k._id));
-        d.modules.item = d.modules.item.filter((k) => A.has(k._id));
+          (R) => R._id === e.currentSchedulerId
+        ), A = new Set(((_ == null ? void 0 : _.items) || []).map((R) => R._id));
+        d.modules.item = d.modules.item.filter((R) => A.has(R._id));
       }
-      return h.value = d, v.value = !1, y.value = y.value + 1, d;
+      return p.value = d, v.value = !1, y.value = y.value + 1, d;
     }
-    const M = ie.debounce(p, 200);
-    let I = null, E = null;
-    function X() {
-      E && (E(), E = null), I && I.stop(), I = Ze(!0), E = I.run(() => et(
+    const M = ie.debounce(h, 200);
+    let E = null, I = null;
+    function Q() {
+      I && (I(), I = null), E && E.stop(), E = Xe(!0), I = E.run(() => et(
         () => [e.menu, e.currentCatalogId, e.currentSchedulerId],
         () => {
           v.value || M();
         }
       )) || null;
     }
-    X();
+    Q();
     const me = S(() => [
       {
         label: "Main",
@@ -747,8 +747,8 @@ const Pt = Qe(
         label: s.name,
         value: s._id
       }))
-    ]), Z = S(() => {
-      const s = h.value.modules.category;
+    ]), X = S(() => {
+      const s = p.value.modules.category;
       return [
         ...U.value.item.addon ? [
           {
@@ -760,17 +760,17 @@ const Pt = Qe(
         ...V(s, (d) => d.name)
       ];
     }), ve = S(() => {
-      const s = h.value.modules.subCategory || [];
+      const s = p.value.modules.subCategory || [];
       return V(s, (d) => d.name);
     }), ee = S(() => {
       var d;
-      let s = h.value.modules.item;
+      let s = p.value.modules.item;
       if (a.value) {
         const m = (d = a.value) == null ? void 0 : d.override.items;
         s = s.filter((g) => {
           var A;
           const _ = (A = m == null ? void 0 : m[g._id]) == null ? void 0 : A.find(
-            (k) => !k.combinationKey
+            (R) => !R.combinationKey
           );
           return (_ == null ? void 0 : _.orderFrom) !== ue.F_ORDER_FROM.enum.NONE;
         });
@@ -785,7 +785,7 @@ const Pt = Qe(
         m,
         (g) => g.code || g.name
       ).reduce((g, _, A) => (g[_._id] = A + d[_.category || ""], g), {});
-    }), he = S(() => oe(N.value, Z.value, ee.value)), pe = S(() => {
+    }), pe = S(() => oe(N.value, X.value, ee.value)), he = S(() => {
       const s = U.value.item.addon ? [
         {
           _id: e.currentCatalogId ? "" : null,
@@ -800,21 +800,21 @@ const Pt = Qe(
         e.menu.modules.item
       );
     }), N = S(() => {
-      const s = h.value.modules.variant;
+      const s = p.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(h.value.modules.group, (s) => s.name)), Se = S(() => x(h.value.modules.takeaway, { selector: "name" })), be = S(() => x(e.menu.modules.printDepartment || [], {
+    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 || [], {
       selector: "name"
     })), 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 = ze(e.menu.modules.sku);
       return x(s, { selector: "code" });
-    }), Ie = S(() => {
+    }), Ee = S(() => {
       const s = /* @__PURE__ */ new Map();
       return e.menu.modules.item.forEach((d) => {
         var m, g;
@@ -860,7 +860,8 @@ const Pt = Qe(
           takeaway: (_) => !!_ && (d || s) && m,
           multiScheduler: d,
           canRearrange: d,
-          printConfig: d
+          printConfig: d,
+          takeawayConfig: d
         },
         category: {
           ...g,
@@ -895,19 +896,19 @@ const Pt = Qe(
     function W(s) {
       return `${s.systemCode}/${s.taxCode}`;
     }
-    function Ee(s) {
+    function Ie(s) {
       const [d, m] = s.split("/");
       return { systemCode: d, taxCode: m };
     }
-    function Re(s, d, m) {
+    function ke(s, d, m) {
       return (s ?? d ?? []).map((g) => W(g)).find((g) => m.some((_) => _.value === g));
     }
-    const ke = S(() => {
+    const Re = S(() => {
       var g;
       const s = ["SV5", "SV10"], d = Ge.Country.getCountryFlattenTaxes(
         se().currentCountry.value
       ), m = d.filter((_) => u.value || !s.includes(_.taxCode)).map((_) => ({
-        label: `${_.name} (${He(_.rate)}%)`,
+        label: `${_.name} (${Be(_.rate)}%)`,
         value: W(_),
         meta: {
           rate: _.rate
@@ -935,7 +936,7 @@ const Pt = Qe(
       e.currentCategoryIds = s;
     }, Te = (s) => {
       e.currentRestaurantAttrParams = s;
-    }, Ke = async (s, d) => {
+    }, Pe = async (s, d) => {
       const m = Array.isArray(s) ? s : [s];
       if (!m.length) return;
       const g = m.map((_) => ({
@@ -947,7 +948,7 @@ const Pt = Qe(
         if (d || g.some(
           (A) => [G.F_OPERATION_TYPE.delete, G.F_OPERATION_TYPE.deleteMany].includes(A.operation)
         )) {
-          const A = await Be(g, e.menu.modules);
+          const A = await He(g, e.menu.modules);
           if (A !== !0) throw new Error(A);
         }
         const _ = await Mt.updateMenuModule(e.menu, g);
@@ -959,7 +960,7 @@ const Pt = Qe(
           message: _
         });
       }
-    }, $e = async (s) => {
+    }, Ke = async (s) => {
       const d = {
         ...e.menu,
         masterCatalogSetting: s.masterCatalogSetting,
@@ -967,7 +968,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 +983,7 @@ const Pt = Qe(
       workerIsComputing: v,
       mergedMenuChangeId: y,
       // async computed state
-      mergedMenu: h,
+      mergedMenu: p,
       // Computed
       version: r,
       isV4: u,
@@ -992,13 +993,13 @@ const Pt = Qe(
       schedulers: c,
       currentScheduler: i,
       catalogOptions: me,
-      categories: Z,
+      categories: X,
       subcategories: ve,
       items: ee,
       sortedItems: ye,
-      itemCodeMap: Ie,
-      categorizedItems: he,
-      categorizedRawMenuItems: pe,
+      itemCodeMap: Ee,
+      categorizedItems: pe,
+      categorizedRawMenuItems: he,
       variants: N,
       groups: _e,
       takeaways: Se,
@@ -1008,7 +1009,7 @@ const Pt = Qe(
       cookingGuide: Ae,
       skus: Ce,
       rules: U,
-      taxSetting: ke,
+      taxSetting: Re,
       // Action
       setMenu: f,
       readMenu: xe,
@@ -1017,36 +1018,36 @@ const Pt = Qe(
       selectScheduler: De,
       selectCategory: Ve,
       setRestaurantAttrParams: Te,
-      updateMenu: Ke,
-      updateMenuSetting: $e,
-      computeMergedMenu: p,
+      updateMenu: Pe,
+      updateMenuSetting: Ke,
+      computeMergedMenu: h,
       // helper
       encodeTax: W,
-      decodeTax: Ee,
-      getSelectedTax: Re,
+      decodeTax: Ie,
+      getSelectedTax: ke,
       mapVariant: ge,
       // history
-      canUndoHistory: Fe,
-      canRedoHistory: Pe,
+      canUndoHistory: $e,
+      canRedoHistory: Fe,
       undoHistory: je,
       redoHistory: Ne,
       // cleanup
       $dispose: () => {
-        M.cancel(), E && (E(), E = null), I && (I.stop(), I = null), Ue();
+        M.cancel(), I && (I(), I = null), E && (E.stop(), E = null), Ue();
       },
       $reinitialize: () => {
-        X();
+        Q();
       }
     };
   }
 );
 export {
   Tt as a,
-  Kt as b,
-  $t as c,
-  Ft as f,
+  Pt as b,
+  Kt as c,
+  $t as f,
   Vt as g,
   Dt as m,
   it as o,
-  Pt as u
+  Ft as u
 };