@leaflink/stash 51.10.0 → 51.11.1

package/dist/useStepper.js

@@ -1,66 +1,70 @@
-import { ref as f, computed as p, readonly as A } from "vue";
-function C(v = {
+import { ref as f, computed as p, readonly as w } from "vue";
+function E(v = {
   linear: !1,
   activeStep: -1,
   activeSubstep: -1,
   steps: []
 }) {
-  const u = f(v.steps ? v.steps : []), n = p(() => u.value.length), e = f(
+  const a = f(v.steps ? v.steps : []), o = p(() => a.value.length), e = f(
     v.activeStep !== null && v.activeStep !== void 0 ? v.activeStep : -1
   ), l = f(
     v.activeSubstep !== null && v.activeSubstep !== void 0 ? v.activeSubstep : -1
-  ), o = p(() => Array.from(v.ref?.value?.children || [])), S = p(() => o.value[e.value]);
-  function s(a) {
-    return !!u.value[a].substeps.length;
+  ), S = p(() => {
+    var u, t;
+    return Array.from(((t = (u = v.ref) == null ? void 0 : u.value) == null ? void 0 : t.children) || []);
+  }), m = p(() => S.value[e.value]);
+  function s(u) {
+    return !!a.value[u].substeps.length;
   }
-  function m() {
-    const a = e.value === -1, t = e.value === u.value.length - 1;
-    if (a)
+  function b() {
+    const u = e.value === -1, t = e.value === a.value.length - 1;
+    if (u)
       e.value++, s(e.value) && l.value++;
     else if (t)
       if (s(e.value)) {
-        const c = l.value === -1, r = l.value === u.value[e.value].substeps.length - 1;
-        c ? l.value++ : r ? (u.value[e.value].substeps[l.value].completed = !0, l.value = -1, u.value[e.value].completed = !0, e.value = -1) : (u.value[e.value].substeps[l.value].completed = !0, l.value++);
+        const i = l.value === -1, c = l.value === a.value[e.value].substeps.length - 1;
+        i ? l.value++ : c ? (a.value[e.value].substeps[l.value].completed = !0, l.value = -1, a.value[e.value].completed = !0, e.value = -1) : (a.value[e.value].substeps[l.value].completed = !0, l.value++);
       } else
-        u.value[e.value].completed = !0, e.value = -1;
+        a.value[e.value].completed = !0, e.value = -1;
     else if (s(e.value)) {
-      const c = l.value === -1, r = l.value === u.value[e.value].substeps.length - 1;
-      c ? l.value++ : r ? (u.value[e.value].substeps[l.value].completed = !0, l.value = -1, u.value[e.value].completed = !0, e.value++, s(e.value) && l.value === -1 && l.value++) : (u.value[e.value].substeps[l.value].completed = !0, l.value++);
+      const i = l.value === -1, c = l.value === a.value[e.value].substeps.length - 1;
+      i ? l.value++ : c ? (a.value[e.value].substeps[l.value].completed = !0, l.value = -1, a.value[e.value].completed = !0, e.value++, s(e.value) && l.value === -1 && l.value++) : (a.value[e.value].substeps[l.value].completed = !0, l.value++);
     } else
-      u.value[e.value].completed = !0, e.value++, s(e.value) && l.value === -1 && l.value++;
+      a.value[e.value].completed = !0, e.value++, s(e.value) && l.value === -1 && l.value++;
   }
-  function b() {
-    e.value !== -1 && (s(e.value) ? l.value === 0 ? (e.value--, l.value--, e.value >= 0 && s(e.value) && (l.value = u.value[e.value].substeps.length - 1)) : l.value-- : (e.value--, e.value >= 0 && s(e.value) && (l.value = u.value[e.value].substeps.length - 1)));
+  function h() {
+    e.value !== -1 && (s(e.value) ? l.value === 0 ? (e.value--, l.value--, e.value >= 0 && s(e.value) && (l.value = a.value[e.value].substeps.length - 1)) : l.value-- : (e.value--, e.value >= 0 && s(e.value) && (l.value = a.value[e.value].substeps.length - 1)));
   }
-  function h(a, t = -1) {
-    v.linear ? (i(a - 1) || a === 0) && (s(a) && (t <= 0 ? l.value = 0 : i(a, t - 1) && (l.value = t)), e.value = a) : (e.value = a, s(a) && (t < 0 ? l.value = 0 : l.value = t));
+  function g(u, t = -1) {
+    v.linear ? (r(u - 1) || u === 0) && (s(u) && (t <= 0 ? l.value = 0 : r(u, t - 1) && (l.value = t)), e.value = u) : (e.value = u, s(u) && (t < 0 ? l.value = 0 : l.value = t));
   }
-  function i(a, t = -1) {
-    return t >= 0 ? u.value[a]?.substeps[t]?.completed : u.value[a]?.completed;
+  function r(u, t = -1) {
+    var i, c, n;
+    return t >= 0 ? (c = (i = a.value[u]) == null ? void 0 : i.substeps[t]) == null ? void 0 : c.completed : (n = a.value[u]) == null ? void 0 : n.completed;
   }
-  function g(a, t = -1) {
-    return t >= 0 ? e.value === a && l.value === t : e.value === a;
+  function d(u, t = -1) {
+    return t >= 0 ? e.value === u && l.value === t : e.value === u;
   }
-  function d(a = !1) {
-    if (a && !u.value.length)
+  function A(u = !1) {
+    if (u && !a.value.length)
       throw new Error("Cannot register a substep without a parent step.");
-    a ? u.value[u.value.length - 1].substeps.push({ completed: !1 }) : u.value.push({ completed: !1, substeps: [] });
+    u ? a.value[a.value.length - 1].substeps.push({ completed: !1 }) : a.value.push({ completed: !1, substeps: [] });
   }
   return {
-    steps: A(u),
-    stepCount: n,
-    activeStepElement: S,
+    steps: w(a),
+    stepCount: o,
+    activeStepElement: m,
     activeStepIndex: e,
     activeSubstepIndex: l,
-    registerStep: d,
-    next: m,
-    back: b,
-    goTo: h,
-    isStepActive: g,
-    isStepCompleted: i
+    registerStep: A,
+    next: b,
+    back: h,
+    goTo: g,
+    isStepActive: d,
+    isStepCompleted: r
   };
 }
 export {
-  C as default
+  E as default
 };
 //# sourceMappingURL=useStepper.js.map

package/dist/useStepper.js.map

@@ -1 +1 @@
-{"version":3,"file":"useStepper.js","sources":["../src/composables/useStepper/useStepper.ts"],"sourcesContent":["import { computed, readonly, Ref, ref } from 'vue';\n\nexport interface StepDefinition {\n  completed: boolean;\n  substeps: Array<Omit<StepDefinition, 'substeps'>>;\n}\n\nexport interface StepperOptions {\n  /**\n   * If true, the stepper will prevent skipping steps\n   */\n  linear?: boolean;\n  /**\n   * The index of the active step\n   */\n  activeStep?: number;\n  /**\n   * The index of the active substep\n   */\n  activeSubstep?: number;\n  /**\n   * The stepper representation as an array of steps and substeps\n   */\n  steps?: Array<StepDefinition>;\n  /**\n   * A ref to the stepper element\n   */\n  ref?: Ref<HTMLUListElement | null>;\n}\n\nexport default function useStepper(\n  options: StepperOptions = {\n    linear: false,\n    activeStep: -1,\n    activeSubstep: -1,\n    steps: [],\n  },\n) {\n  /**\n   * The steps and substeps of the stepper, so we can keep track of their state.\n   * Can be populated with the `steps` option, or via the `registerStep` function.\n   */\n  const steps = ref<Array<StepDefinition>>(options.steps ? options.steps : []);\n\n  const stepCount = computed(() => steps.value.length);\n\n  const activeStepIndex = ref(\n    options.activeStep !== null && options.activeStep !== undefined ? options.activeStep : -1,\n  );\n  const activeSubstepIndex = ref(\n    options.activeSubstep !== null && options.activeSubstep !== undefined ? options.activeSubstep : -1,\n  );\n\n  const stepElements = computed(() => {\n    return Array.from((options.ref?.value?.children || []) as HTMLCollectionOf<HTMLLIElement>);\n  });\n\n  const activeStepElement = computed(() => stepElements.value[activeStepIndex.value]);\n\n  /**\n   * Returns true if the step at the given index has substeps\n   * @param stepIndex The index of the step to check\n   */\n  function stepHasSubsteps(stepIndex: number): boolean {\n    return !!steps.value[stepIndex].substeps.length;\n  }\n\n  /**\n   * Goes to the next step or substep, while flagging the current one as completed.\n   * If the current step has substeps, it will go to the next substep if there are any, or to the next substep.\n   * And if the next step has substeps, automatically goes to the first substep\n   */\n  function next(): void {\n    const hasNoActiveStep = activeStepIndex.value === -1;\n    const isLastStep = activeStepIndex.value === steps.value.length - 1;\n\n    // If there is no active step, we want to activate the first step\n    if (hasNoActiveStep) {\n      activeStepIndex.value++;\n\n      // If the step we just navigated to has substeps, we want to activate the first substep\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        activeSubstepIndex.value++;\n      }\n    } else if (isLastStep) {\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        const hasNoActiveSubstep = activeSubstepIndex.value === -1;\n        const isLastSubstep = activeSubstepIndex.value === steps.value[activeStepIndex.value].substeps.length - 1;\n\n        // if there are no active substeps, we want to activate the first substep\n        if (hasNoActiveSubstep) {\n          activeSubstepIndex.value++;\n          // if the active substep is the last one, we want to reset the step and substep to -1\n        } else if (isLastSubstep) {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value = -1;\n\n          steps.value[activeStepIndex.value].completed = true;\n          activeStepIndex.value = -1;\n          // if there are more substeps, we want to complete the current one and proceed to the next substep\n        } else {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value++;\n        }\n        // If there are no substeps, we want to complete the current step and reset the step to -1\n      } else {\n        steps.value[activeStepIndex.value].completed = true;\n        activeStepIndex.value = -1;\n      }\n    } else {\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        const hasNoActiveSubstep = activeSubstepIndex.value === -1;\n        const isLastSubstep = activeSubstepIndex.value === steps.value[activeStepIndex.value].substeps.length - 1;\n\n        // if there are no active substeps, we want to activate the first substep\n        if (hasNoActiveSubstep) {\n          activeSubstepIndex.value++;\n          // if the active substep is the last one, we want to go to the next step\n        } else if (isLastSubstep) {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value = -1;\n\n          steps.value[activeStepIndex.value].completed = true;\n          activeStepIndex.value++;\n\n          // If the step we just navigated to has substeps, we want to activate the first substep right away\n          if (stepHasSubsteps(activeStepIndex.value) && activeSubstepIndex.value === -1) {\n            activeSubstepIndex.value++;\n          }\n          // if there are more substeps, we want to complete the current one and proceed to the next substep\n        } else {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value++;\n        }\n      } else {\n        steps.value[activeStepIndex.value].completed = true;\n        activeStepIndex.value++;\n\n        // If the step we just navigated to has substeps, we want to activate the first substep right away\n        if (stepHasSubsteps(activeStepIndex.value) && activeSubstepIndex.value === -1) {\n          activeSubstepIndex.value++;\n        }\n      }\n    }\n  }\n\n  function back(): void {\n    // We don't want to go back if there is no active step\n    if (activeStepIndex.value === -1) {\n      return;\n    }\n\n    if (stepHasSubsteps(activeStepIndex.value)) {\n      // If the active substep is the first one, we want to go back to the previous step\n      if (activeSubstepIndex.value === 0) {\n        activeStepIndex.value--;\n        activeSubstepIndex.value--;\n\n        // If the step that we just navigated to has substeps, we want to navigate to the last substep\n        if (activeStepIndex.value >= 0 && stepHasSubsteps(activeStepIndex.value)) {\n          activeSubstepIndex.value = steps.value[activeStepIndex.value].substeps.length - 1;\n        }\n      } else {\n        activeSubstepIndex.value--;\n      }\n    } else {\n      activeStepIndex.value--;\n\n      // If the step that we just navigated to has substeps, we want to navigate to the last substep\n      if (activeStepIndex.value >= 0 && stepHasSubsteps(activeStepIndex.value)) {\n        activeSubstepIndex.value = steps.value[activeStepIndex.value].substeps.length - 1;\n      }\n    }\n  }\n\n  /**\n   * Navigates to a specific step and substep.\n   */\n  function goTo(stepIndex: number, substepIndex = -1): void {\n    // A linear stepper prevents navigation to incomplete steps\n    if (options.linear) {\n      if (isStepCompleted(stepIndex - 1) || stepIndex === 0) {\n        if (stepHasSubsteps(stepIndex)) {\n          if (substepIndex <= 0) {\n            activeSubstepIndex.value = 0;\n          } else if (isStepCompleted(stepIndex, substepIndex - 1)) {\n            activeSubstepIndex.value = substepIndex;\n          }\n        }\n        activeStepIndex.value = stepIndex;\n      }\n    } else {\n      activeStepIndex.value = stepIndex;\n\n      if (stepHasSubsteps(stepIndex)) {\n        if (substepIndex < 0) {\n          activeSubstepIndex.value = 0;\n        } else {\n          activeSubstepIndex.value = substepIndex;\n        }\n      }\n    }\n  }\n\n  /**\n   * Returns true if the step is completed.\n   * if the substep index is provided, check if the substep is completed.\n   */\n  function isStepCompleted(stepIndex: number, substepIndex = -1): boolean {\n    if (substepIndex >= 0) {\n      return steps.value[stepIndex]?.substeps[substepIndex]?.completed;\n    } else {\n      return steps.value[stepIndex]?.completed;\n    }\n  }\n\n  /**\n   * Returns true if the step is active.\n   * if the substep index is provided, check both if the step and the substep are active.\n   */\n  function isStepActive(stepIndex: number, substepIndex = -1): boolean {\n    if (substepIndex >= 0) {\n      return activeStepIndex.value === stepIndex && activeSubstepIndex.value === substepIndex;\n    } else {\n      return activeStepIndex.value === stepIndex;\n    }\n  }\n\n  /**\n   * Registers a new step or substep into the steps array\n   */\n  function registerStep(nested = false): void {\n    if (nested && !steps.value.length) {\n      throw new Error('Cannot register a substep without a parent step.');\n    }\n\n    if (nested) {\n      steps.value[steps.value.length - 1].substeps.push({ completed: false });\n    } else {\n      steps.value.push({ completed: false, substeps: [] });\n    }\n  }\n\n  return {\n    steps: readonly(steps),\n    stepCount,\n    activeStepElement,\n    activeStepIndex,\n    activeSubstepIndex,\n    registerStep,\n    next,\n    back,\n    goTo,\n    isStepActive,\n    isStepCompleted,\n  };\n}\n"],"names":["useStepper","options","steps","ref","stepCount","computed","activeStepIndex","activeSubstepIndex","stepElements","activeStepElement","stepHasSubsteps","stepIndex","next","hasNoActiveStep","isLastStep","hasNoActiveSubstep","isLastSubstep","back","goTo","substepIndex","isStepCompleted","isStepActive","registerStep","nested","readonly"],"mappings":";AA8BA,SAAwBA,EACtBC,IAA0B;AAAA,EACxB,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,OAAO,CAAA;AACT,GACA;AAKA,QAAMC,IAAQC,EAA2BF,EAAQ,QAAQA,EAAQ,QAAQ,EAAE,GAErEG,IAAYC,EAAS,MAAMH,EAAM,MAAM,MAAM,GAE7CI,IAAkBH;AAAA,IACtBF,EAAQ,eAAe,QAAQA,EAAQ,eAAe,SAAYA,EAAQ,aAAa;AAAA,EAAA,GAEnFM,IAAqBJ;AAAA,IACzBF,EAAQ,kBAAkB,QAAQA,EAAQ,kBAAkB,SAAYA,EAAQ,gBAAgB;AAAA,EAAA,GAG5FO,IAAeH,EAAS,MACrB,MAAM,KAAMJ,EAAQ,KAAK,OAAO,YAAY,EAAsC,CAC1F,GAEKQ,IAAoBJ,EAAS,MAAMG,EAAa,MAAMF,EAAgB,KAAK,CAAC;AAMlF,WAASI,EAAgBC,GAA4B;AACnD,WAAO,CAAC,CAACT,EAAM,MAAMS,CAAS,EAAE,SAAS;AAAA,EAC3C;AAOA,WAASC,IAAa;AACpB,UAAMC,IAAkBP,EAAgB,UAAU,IAC5CQ,IAAaR,EAAgB,UAAUJ,EAAM,MAAM,SAAS;AAGlE,QAAIW;AACF,MAAAP,EAAgB,SAGZI,EAAgBJ,EAAgB,KAAK,KACvCC,EAAmB;AAAA,aAEZO;AACT,UAAIJ,EAAgBJ,EAAgB,KAAK,GAAG;AAC1C,cAAMS,IAAqBR,EAAmB,UAAU,IAClDS,IAAgBT,EAAmB,UAAUL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAGxG,QAAIS,IACFR,EAAmB,UAEVS,KACTd,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB,QAAQ,IAE3BL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,QAAQ,OAGxBJ,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB;AAAA,MAGvB;AACE,QAAAL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,QAAQ;AAAA,aAGtBI,EAAgBJ,EAAgB,KAAK,GAAG;AAC1C,YAAMS,IAAqBR,EAAmB,UAAU,IAClDS,IAAgBT,EAAmB,UAAUL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAGxG,MAAIS,IACFR,EAAmB,UAEVS,KACTd,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB,QAAQ,IAE3BL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,SAGZI,EAAgBJ,EAAgB,KAAK,KAAKC,EAAmB,UAAU,MACzEA,EAAmB,YAIrBL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB;AAAA,IAEvB;AACE,MAAAL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,SAGZI,EAAgBJ,EAAgB,KAAK,KAAKC,EAAmB,UAAU,MACzEA,EAAmB;AAAA,EAI3B;AAEA,WAASU,IAAa;AAEpB,IAAIX,EAAgB,UAAU,OAI1BI,EAAgBJ,EAAgB,KAAK,IAEnCC,EAAmB,UAAU,KAC/BD,EAAgB,SAChBC,EAAmB,SAGfD,EAAgB,SAAS,KAAKI,EAAgBJ,EAAgB,KAAK,MACrEC,EAAmB,QAAQL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS,MAGlFC,EAAmB,WAGrBD,EAAgB,SAGZA,EAAgB,SAAS,KAAKI,EAAgBJ,EAAgB,KAAK,MACrEC,EAAmB,QAAQL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAAA,EAGtF;AAKA,WAASY,EAAKP,GAAmBQ,IAAe,IAAU;AAExD,IAAIlB,EAAQ,UACNmB,EAAgBT,IAAY,CAAC,KAAKA,MAAc,OAC9CD,EAAgBC,CAAS,MACvBQ,KAAgB,IAClBZ,EAAmB,QAAQ,IAClBa,EAAgBT,GAAWQ,IAAe,CAAC,MACpDZ,EAAmB,QAAQY,KAG/Bb,EAAgB,QAAQK,MAG1BL,EAAgB,QAAQK,GAEpBD,EAAgBC,CAAS,MACvBQ,IAAe,IACjBZ,EAAmB,QAAQ,IAE3BA,EAAmB,QAAQY;AAAA,EAInC;AAMA,WAASC,EAAgBT,GAAmBQ,IAAe,IAAa;AACtE,WAAIA,KAAgB,IACXjB,EAAM,MAAMS,CAAS,GAAG,SAASQ,CAAY,GAAG,YAEhDjB,EAAM,MAAMS,CAAS,GAAG;AAAA,EAEnC;AAMA,WAASU,EAAaV,GAAmBQ,IAAe,IAAa;AACnE,WAAIA,KAAgB,IACXb,EAAgB,UAAUK,KAAaJ,EAAmB,UAAUY,IAEpEb,EAAgB,UAAUK;AAAA,EAErC;AAKA,WAASW,EAAaC,IAAS,IAAa;AAC1C,QAAIA,KAAU,CAACrB,EAAM,MAAM;AACzB,YAAM,IAAI,MAAM,kDAAkD;AAGpE,IAAIqB,IACFrB,EAAM,MAAMA,EAAM,MAAM,SAAS,CAAC,EAAE,SAAS,KAAK,EAAE,WAAW,GAAA,CAAO,IAEtEA,EAAM,MAAM,KAAK,EAAE,WAAW,IAAO,UAAU,CAAA,GAAI;AAAA,EAEvD;AAEA,SAAO;AAAA,IACL,OAAOsB,EAAStB,CAAK;AAAA,IACrB,WAAAE;AAAA,IACA,mBAAAK;AAAA,IACA,iBAAAH;AAAA,IACA,oBAAAC;AAAA,IACA,cAAAe;AAAA,IACA,MAAAV;AAAA,IACA,MAAAK;AAAA,IACA,MAAAC;AAAA,IACA,cAAAG;AAAA,IACA,iBAAAD;AAAA,EAAA;AAEJ;"}
+{"version":3,"file":"useStepper.js","sources":["../src/composables/useStepper/useStepper.ts"],"sourcesContent":["import { computed, readonly, Ref, ref } from 'vue';\n\nexport interface StepDefinition {\n  completed: boolean;\n  substeps: Array<Omit<StepDefinition, 'substeps'>>;\n}\n\nexport interface StepperOptions {\n  /**\n   * If true, the stepper will prevent skipping steps\n   */\n  linear?: boolean;\n  /**\n   * The index of the active step\n   */\n  activeStep?: number;\n  /**\n   * The index of the active substep\n   */\n  activeSubstep?: number;\n  /**\n   * The stepper representation as an array of steps and substeps\n   */\n  steps?: Array<StepDefinition>;\n  /**\n   * A ref to the stepper element\n   */\n  ref?: Ref<HTMLUListElement | null>;\n}\n\nexport default function useStepper(\n  options: StepperOptions = {\n    linear: false,\n    activeStep: -1,\n    activeSubstep: -1,\n    steps: [],\n  },\n) {\n  /**\n   * The steps and substeps of the stepper, so we can keep track of their state.\n   * Can be populated with the `steps` option, or via the `registerStep` function.\n   */\n  const steps = ref<Array<StepDefinition>>(options.steps ? options.steps : []);\n\n  const stepCount = computed(() => steps.value.length);\n\n  const activeStepIndex = ref(\n    options.activeStep !== null && options.activeStep !== undefined ? options.activeStep : -1,\n  );\n  const activeSubstepIndex = ref(\n    options.activeSubstep !== null && options.activeSubstep !== undefined ? options.activeSubstep : -1,\n  );\n\n  const stepElements = computed(() => {\n    return Array.from((options.ref?.value?.children || []) as HTMLCollectionOf<HTMLLIElement>);\n  });\n\n  const activeStepElement = computed(() => stepElements.value[activeStepIndex.value]);\n\n  /**\n   * Returns true if the step at the given index has substeps\n   * @param stepIndex The index of the step to check\n   */\n  function stepHasSubsteps(stepIndex: number): boolean {\n    return !!steps.value[stepIndex].substeps.length;\n  }\n\n  /**\n   * Goes to the next step or substep, while flagging the current one as completed.\n   * If the current step has substeps, it will go to the next substep if there are any, or to the next substep.\n   * And if the next step has substeps, automatically goes to the first substep\n   */\n  function next(): void {\n    const hasNoActiveStep = activeStepIndex.value === -1;\n    const isLastStep = activeStepIndex.value === steps.value.length - 1;\n\n    // If there is no active step, we want to activate the first step\n    if (hasNoActiveStep) {\n      activeStepIndex.value++;\n\n      // If the step we just navigated to has substeps, we want to activate the first substep\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        activeSubstepIndex.value++;\n      }\n    } else if (isLastStep) {\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        const hasNoActiveSubstep = activeSubstepIndex.value === -1;\n        const isLastSubstep = activeSubstepIndex.value === steps.value[activeStepIndex.value].substeps.length - 1;\n\n        // if there are no active substeps, we want to activate the first substep\n        if (hasNoActiveSubstep) {\n          activeSubstepIndex.value++;\n          // if the active substep is the last one, we want to reset the step and substep to -1\n        } else if (isLastSubstep) {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value = -1;\n\n          steps.value[activeStepIndex.value].completed = true;\n          activeStepIndex.value = -1;\n          // if there are more substeps, we want to complete the current one and proceed to the next substep\n        } else {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value++;\n        }\n        // If there are no substeps, we want to complete the current step and reset the step to -1\n      } else {\n        steps.value[activeStepIndex.value].completed = true;\n        activeStepIndex.value = -1;\n      }\n    } else {\n      if (stepHasSubsteps(activeStepIndex.value)) {\n        const hasNoActiveSubstep = activeSubstepIndex.value === -1;\n        const isLastSubstep = activeSubstepIndex.value === steps.value[activeStepIndex.value].substeps.length - 1;\n\n        // if there are no active substeps, we want to activate the first substep\n        if (hasNoActiveSubstep) {\n          activeSubstepIndex.value++;\n          // if the active substep is the last one, we want to go to the next step\n        } else if (isLastSubstep) {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value = -1;\n\n          steps.value[activeStepIndex.value].completed = true;\n          activeStepIndex.value++;\n\n          // If the step we just navigated to has substeps, we want to activate the first substep right away\n          if (stepHasSubsteps(activeStepIndex.value) && activeSubstepIndex.value === -1) {\n            activeSubstepIndex.value++;\n          }\n          // if there are more substeps, we want to complete the current one and proceed to the next substep\n        } else {\n          steps.value[activeStepIndex.value].substeps[activeSubstepIndex.value].completed = true;\n          activeSubstepIndex.value++;\n        }\n      } else {\n        steps.value[activeStepIndex.value].completed = true;\n        activeStepIndex.value++;\n\n        // If the step we just navigated to has substeps, we want to activate the first substep right away\n        if (stepHasSubsteps(activeStepIndex.value) && activeSubstepIndex.value === -1) {\n          activeSubstepIndex.value++;\n        }\n      }\n    }\n  }\n\n  function back(): void {\n    // We don't want to go back if there is no active step\n    if (activeStepIndex.value === -1) {\n      return;\n    }\n\n    if (stepHasSubsteps(activeStepIndex.value)) {\n      // If the active substep is the first one, we want to go back to the previous step\n      if (activeSubstepIndex.value === 0) {\n        activeStepIndex.value--;\n        activeSubstepIndex.value--;\n\n        // If the step that we just navigated to has substeps, we want to navigate to the last substep\n        if (activeStepIndex.value >= 0 && stepHasSubsteps(activeStepIndex.value)) {\n          activeSubstepIndex.value = steps.value[activeStepIndex.value].substeps.length - 1;\n        }\n      } else {\n        activeSubstepIndex.value--;\n      }\n    } else {\n      activeStepIndex.value--;\n\n      // If the step that we just navigated to has substeps, we want to navigate to the last substep\n      if (activeStepIndex.value >= 0 && stepHasSubsteps(activeStepIndex.value)) {\n        activeSubstepIndex.value = steps.value[activeStepIndex.value].substeps.length - 1;\n      }\n    }\n  }\n\n  /**\n   * Navigates to a specific step and substep.\n   */\n  function goTo(stepIndex: number, substepIndex = -1): void {\n    // A linear stepper prevents navigation to incomplete steps\n    if (options.linear) {\n      if (isStepCompleted(stepIndex - 1) || stepIndex === 0) {\n        if (stepHasSubsteps(stepIndex)) {\n          if (substepIndex <= 0) {\n            activeSubstepIndex.value = 0;\n          } else if (isStepCompleted(stepIndex, substepIndex - 1)) {\n            activeSubstepIndex.value = substepIndex;\n          }\n        }\n        activeStepIndex.value = stepIndex;\n      }\n    } else {\n      activeStepIndex.value = stepIndex;\n\n      if (stepHasSubsteps(stepIndex)) {\n        if (substepIndex < 0) {\n          activeSubstepIndex.value = 0;\n        } else {\n          activeSubstepIndex.value = substepIndex;\n        }\n      }\n    }\n  }\n\n  /**\n   * Returns true if the step is completed.\n   * if the substep index is provided, check if the substep is completed.\n   */\n  function isStepCompleted(stepIndex: number, substepIndex = -1): boolean {\n    if (substepIndex >= 0) {\n      return steps.value[stepIndex]?.substeps[substepIndex]?.completed;\n    } else {\n      return steps.value[stepIndex]?.completed;\n    }\n  }\n\n  /**\n   * Returns true if the step is active.\n   * if the substep index is provided, check both if the step and the substep are active.\n   */\n  function isStepActive(stepIndex: number, substepIndex = -1): boolean {\n    if (substepIndex >= 0) {\n      return activeStepIndex.value === stepIndex && activeSubstepIndex.value === substepIndex;\n    } else {\n      return activeStepIndex.value === stepIndex;\n    }\n  }\n\n  /**\n   * Registers a new step or substep into the steps array\n   */\n  function registerStep(nested = false): void {\n    if (nested && !steps.value.length) {\n      throw new Error('Cannot register a substep without a parent step.');\n    }\n\n    if (nested) {\n      steps.value[steps.value.length - 1].substeps.push({ completed: false });\n    } else {\n      steps.value.push({ completed: false, substeps: [] });\n    }\n  }\n\n  return {\n    steps: readonly(steps),\n    stepCount,\n    activeStepElement,\n    activeStepIndex,\n    activeSubstepIndex,\n    registerStep,\n    next,\n    back,\n    goTo,\n    isStepActive,\n    isStepCompleted,\n  };\n}\n"],"names":["useStepper","options","steps","ref","stepCount","computed","activeStepIndex","activeSubstepIndex","stepElements","_b","_a","activeStepElement","stepHasSubsteps","stepIndex","next","hasNoActiveStep","isLastStep","hasNoActiveSubstep","isLastSubstep","back","goTo","substepIndex","isStepCompleted","_c","isStepActive","registerStep","nested","readonly"],"mappings":";AA8BA,SAAwBA,EACtBC,IAA0B;AAAA,EACxB,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,OAAO,CAAA;AACT,GACA;AAKA,QAAMC,IAAQC,EAA2BF,EAAQ,QAAQA,EAAQ,QAAQ,EAAE,GAErEG,IAAYC,EAAS,MAAMH,EAAM,MAAM,MAAM,GAE7CI,IAAkBH;AAAA,IACtBF,EAAQ,eAAe,QAAQA,EAAQ,eAAe,SAAYA,EAAQ,aAAa;AAAA,EACzF,GACMM,IAAqBJ;AAAA,IACzBF,EAAQ,kBAAkB,QAAQA,EAAQ,kBAAkB,SAAYA,EAAQ,gBAAgB;AAAA,EAClG,GAEMO,IAAeH,EAAS,MAAM;;AAClC,WAAO,MAAM,OAAMI,KAAAC,IAAAT,EAAQ,QAAR,gBAAAS,EAAa,UAAb,gBAAAD,EAAoB,aAAY,EAAsC;AAAA,EAAA,CAC1F,GAEKE,IAAoBN,EAAS,MAAMG,EAAa,MAAMF,EAAgB,KAAK,CAAC;AAMlF,WAASM,EAAgBC,GAA4B;AACnD,WAAO,CAAC,CAACX,EAAM,MAAMW,CAAS,EAAE,SAAS;AAAA,EAAA;AAQ3C,WAASC,IAAa;AACd,UAAAC,IAAkBT,EAAgB,UAAU,IAC5CU,IAAaV,EAAgB,UAAUJ,EAAM,MAAM,SAAS;AAGlE,QAAIa;AACc,MAAAT,EAAA,SAGZM,EAAgBN,EAAgB,KAAK,KACpBC,EAAA;AAAA,aAEZS;AACL,UAAAJ,EAAgBN,EAAgB,KAAK,GAAG;AACpC,cAAAW,IAAqBV,EAAmB,UAAU,IAClDW,IAAgBX,EAAmB,UAAUL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAGxG,QAAIW,IACiBV,EAAA,UAEVW,KACHhB,EAAA,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB,QAAQ,IAE3BL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,QAAQ,OAGlBJ,EAAA,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAC/DA,EAAA;AAAA,MACrB;AAGA,QAAAL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/CA,EAAgB,QAAQ;AAAA,aAGtBM,EAAgBN,EAAgB,KAAK,GAAG;AACpC,YAAAW,IAAqBV,EAAmB,UAAU,IAClDW,IAAgBX,EAAmB,UAAUL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAGxG,MAAIW,IACiBV,EAAA,UAEVW,KACHhB,EAAA,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAClFA,EAAmB,QAAQ,IAE3BL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/BA,EAAA,SAGZM,EAAgBN,EAAgB,KAAK,KAAKC,EAAmB,UAAU,MACtDA,EAAA,YAIfL,EAAA,MAAMI,EAAgB,KAAK,EAAE,SAASC,EAAmB,KAAK,EAAE,YAAY,IAC/DA,EAAA;AAAA,IACrB;AAEA,MAAAL,EAAM,MAAMI,EAAgB,KAAK,EAAE,YAAY,IAC/BA,EAAA,SAGZM,EAAgBN,EAAgB,KAAK,KAAKC,EAAmB,UAAU,MACtDA,EAAA;AAAA,EAGzB;AAGF,WAASY,IAAa;AAEhB,IAAAb,EAAgB,UAAU,OAI1BM,EAAgBN,EAAgB,KAAK,IAEnCC,EAAmB,UAAU,KACfD,EAAA,SACGC,EAAA,SAGfD,EAAgB,SAAS,KAAKM,EAAgBN,EAAgB,KAAK,MACrEC,EAAmB,QAAQL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS,MAG/DC,EAAA,WAGLD,EAAA,SAGZA,EAAgB,SAAS,KAAKM,EAAgBN,EAAgB,KAAK,MACrEC,EAAmB,QAAQL,EAAM,MAAMI,EAAgB,KAAK,EAAE,SAAS,SAAS;AAAA,EAEpF;AAMO,WAAAc,EAAKP,GAAmBQ,IAAe,IAAU;AAExD,IAAIpB,EAAQ,UACNqB,EAAgBT,IAAY,CAAC,KAAKA,MAAc,OAC9CD,EAAgBC,CAAS,MACvBQ,KAAgB,IAClBd,EAAmB,QAAQ,IAClBe,EAAgBT,GAAWQ,IAAe,CAAC,MACpDd,EAAmB,QAAQc,KAG/Bf,EAAgB,QAAQO,MAG1BP,EAAgB,QAAQO,GAEpBD,EAAgBC,CAAS,MACvBQ,IAAe,IACjBd,EAAmB,QAAQ,IAE3BA,EAAmB,QAAQc;AAAA,EAGjC;AAOO,WAAAC,EAAgBT,GAAmBQ,IAAe,IAAa;;AACtE,WAAIA,KAAgB,KACXZ,KAAAC,IAAAR,EAAM,MAAMW,CAAS,MAArB,gBAAAH,EAAwB,SAASW,OAAjC,gBAAAZ,EAAgD,aAEhDc,IAAArB,EAAM,MAAMW,CAAS,MAArB,gBAAAU,EAAwB;AAAA,EACjC;AAOO,WAAAC,EAAaX,GAAmBQ,IAAe,IAAa;AACnE,WAAIA,KAAgB,IACXf,EAAgB,UAAUO,KAAaN,EAAmB,UAAUc,IAEpEf,EAAgB,UAAUO;AAAA,EACnC;AAMO,WAAAY,EAAaC,IAAS,IAAa;AAC1C,QAAIA,KAAU,CAACxB,EAAM,MAAM;AACnB,YAAA,IAAI,MAAM,kDAAkD;AAGpE,IAAIwB,IACIxB,EAAA,MAAMA,EAAM,MAAM,SAAS,CAAC,EAAE,SAAS,KAAK,EAAE,WAAW,GAAA,CAAO,IAEhEA,EAAA,MAAM,KAAK,EAAE,WAAW,IAAO,UAAU,CAAA,GAAI;AAAA,EACrD;AAGK,SAAA;AAAA,IACL,OAAOyB,EAASzB,CAAK;AAAA,IACrB,WAAAE;AAAA,IACA,mBAAAO;AAAA,IACA,iBAAAL;AAAA,IACA,oBAAAC;AAAA,IACA,cAAAkB;AAAA,IACA,MAAAX;AAAA,IACA,MAAAK;AAAA,IACA,MAAAC;AAAA,IACA,cAAAI;AAAA,IACA,iBAAAF;AAAA,EACF;AACF;"}

package/dist/useToasts.js

@@ -2,38 +2,38 @@ import l from "lodash-es/merge";
 import T from "lodash-es/uniqueId";
 import { ref as h, reactive as y, readonly as b } from "vue";
 const w = 5e3, n = h([]);
-function M(c = { timeout: w }) {
-  function s(o) {
-    const e = typeof o == "string" ? o : void 0, { group: i = void 0, status: t = void 0 } = typeof o == "object" ? o : {};
-    if (!e && (!i || !t))
+function M(s = { timeout: w }) {
+  function c(e) {
+    const o = typeof e == "string" ? e : void 0, { group: i = void 0, status: t = void 0 } = typeof e == "object" ? e : {};
+    if (!o && (!i || !t))
       throw new Error("Must provide either a toast ID or both group and type");
-    const r = i && t ? `toast-${t}-${i}` : String(e), f = n.value.findIndex(({ id: g }) => g === r);
+    const r = i && t ? `toast-${t}-${i}` : String(o), f = n.value.findIndex(({ id: g }) => g === r);
     f !== -1 && n.value.splice(f, 1);
   }
-  function u(o, e, i) {
-    const t = l({}, c, i), r = t?.group ? `toast-${e}-${t.group}` : T("toast-");
-    if (!(t?.group && n.value.some(({ id: f }) => f === r)))
+  function u(e, o, i) {
+    const t = l({}, s, i), r = t != null && t.group ? `toast-${o}-${t.group}` : T("toast-");
+    if (!(t != null && t.group && n.value.some(({ id: f }) => f === r)))
       return n.value.push({
-        text: o,
+        text: e,
         id: r,
-        status: e,
+        status: o,
         offsetTop: t.offsetTop
-      }), typeof t.timeout == "number" && setTimeout(() => s(r), Math.abs(t.timeout)), r;
+      }), typeof t.timeout == "number" && setTimeout(() => c(r), Math.abs(t.timeout)), r;
   }
   function a() {
     n.value = [];
   }
-  function m(o, e) {
-    return u(o, "error", e);
+  function m(e, o) {
+    return u(e, "error", o);
   }
-  function p(o, e) {
-    return u(o, "info", e);
+  function v(e, o) {
+    return u(e, "info", o);
   }
-  function v(o, e) {
-    return u(o, "success", e);
+  function d(e, o) {
+    return u(e, "success", o);
   }
-  function d(o, e) {
-    return u(o, "warning", e);
+  function p(e, o) {
+    return u(e, "warning", o);
   }
   return y({
     /**
@@ -43,7 +43,7 @@ function M(c = { timeout: w }) {
     /**
      * Removes an active/visible toast by id or by group and type.
      */
-    remove: s,
+    remove: c,
     /**
      * Creates a new toast and makes it active/visible.
      */
@@ -59,15 +59,15 @@ function M(c = { timeout: w }) {
     /**
      * Creates a new "info" toast.
      */
-    info: p,
+    info: v,
     /**
      * Creates a new "success" toast.
      */
-    success: v,
+    success: d,
     /**
      * Creates a new "warning" toast.
      */
-    warning: d
+    warning: p
   });
 }
 export {

package/dist/useToasts.js.map

@@ -1 +1 @@
-{"version":3,"file":"useToasts.js","sources":["../src/composables/useToasts/useToasts.ts"],"sourcesContent":["import merge from 'lodash-es/merge';\nimport uniqueId from 'lodash-es/uniqueId';\nimport { reactive, readonly, ref, RenderFunction } from 'vue';\n\nimport { StatusSeverity } from '../../../types/statusLevels';\n\nexport const DEFAULT_TIMEOUT = 5000;\n\nexport type Toast = {\n  id: string;\n  text: string | RenderFunction;\n  status: StatusSeverity;\n  offsetTop?: string;\n};\n\nexport interface ToastOptions {\n  /**\n   * The timeout in milliseconds before the toast is automatically dismissed. If set to `false`, the toast will persist until the user clicks on it.\n   * @default DEFAULT_TIMEOUT\n   */\n  timeout?: number | boolean;\n  /**\n   * A group name ensures only one toast with the same group and status is visible at any given time.\n   * Toasts with the same group but different statuses will be treated as separate and will display concurrently.\n   */\n  group?: string;\n  /**\n   * The container distance from the top of the viewport.\n   */\n  offsetTop?: string;\n}\n\ntype ToastIdOrUndefined<O extends ToastOptions | undefined> = O extends { id: string }\n  ? Toast['id'] | undefined\n  : Toast['id'];\n\nconst active = ref<Toast[]>([]);\n\nexport default function useToasts(globalOptions: Omit<ToastOptions, 'group'> = { timeout: DEFAULT_TIMEOUT }) {\n  // method overloads\n  function remove(toastId: Toast['id']): void;\n  function remove(options: { group: string; status: StatusSeverity }): void;\n  function remove(toastIdOrOptions: Toast['id'] | { group: string; status: StatusSeverity }) {\n    const toastId = typeof toastIdOrOptions === 'string' ? toastIdOrOptions : undefined;\n    const { group = undefined, status = undefined } = typeof toastIdOrOptions === 'object' ? toastIdOrOptions : {};\n\n    if (!toastId && (!group || !status)) {\n      throw new Error('Must provide either a toast ID or both group and type');\n    }\n\n    const idToRemove = group && status ? `toast-${status}-${group}` : String(toastId);\n    const index = active.value.findIndex(({ id }) => id === idToRemove);\n    if (index === -1) {\n      return;\n    }\n\n    active.value.splice(index, 1);\n  }\n\n  // method overloads\n  function create(text: Toast['text'], status: StatusSeverity, options?: Omit<ToastOptions, 'group'>): Toast['id'];\n  function create(\n    text: Toast['text'],\n    status: StatusSeverity,\n    options: ToastOptions & { id: string },\n  ): Toast['id'] | undefined;\n  function create(text: Toast['text'], status: StatusSeverity, localOptions?: ToastOptions): Toast['id'] | undefined {\n    const options = merge({}, globalOptions, localOptions);\n\n    const id = options?.group ? `toast-${status}-${options.group}` : uniqueId('toast-');\n    if (options?.group && active.value.some(({ id: existingId }) => existingId === id)) {\n      return;\n    }\n\n    active.value.push({\n      text,\n      id,\n      status,\n      offsetTop: options.offsetTop,\n    });\n\n    if (typeof options.timeout === 'number') {\n      setTimeout(() => remove(id), Math.abs(options.timeout));\n    }\n\n    return id;\n  }\n\n  function removeAll() {\n    active.value = [];\n  }\n\n  function error<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'error', options);\n  }\n\n  function info<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'info', options);\n  }\n\n  function success<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'success', options);\n  }\n\n  function warning<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'warning', options);\n  }\n\n  return reactive({\n    /**\n     * The list of toasts that are currently visible.\n     */\n    active: readonly(active),\n\n    /**\n     * Removes an active/visible toast by id or by group and type.\n     */\n    remove,\n\n    /**\n     * Creates a new toast and makes it active/visible.\n     */\n    create,\n\n    /**\n     * Removes all active/visible toasts.\n     */\n    removeAll,\n\n    /**\n     * Creates a new \"error\" toast.\n     */\n    error,\n\n    /**\n     * Creates a new \"info\" toast.\n     */\n    info,\n\n    /**\n     * Creates a new \"success\" toast.\n     */\n    success,\n\n    /**\n     * Creates a new \"warning\" toast.\n     */\n    warning,\n  });\n}\n"],"names":["DEFAULT_TIMEOUT","active","ref","useToasts","globalOptions","remove","toastIdOrOptions","toastId","group","status","idToRemove","index","id","create","text","localOptions","options","merge","uniqueId","existingId","removeAll","error","info","success","warning","reactive","readonly"],"mappings":";;;AAMO,MAAMA,IAAkB,KA8BzBC,IAASC,EAAa,EAAE;AAE9B,SAAwBC,EAAUC,IAA6C,EAAE,SAASJ,KAAmB;AAI3G,WAASK,EAAOC,GAA2E;AACzF,UAAMC,IAAU,OAAOD,KAAqB,WAAWA,IAAmB,QACpE,EAAE,OAAAE,IAAQ,QAAW,QAAAC,IAAS,OAAA,IAAc,OAAOH,KAAqB,WAAWA,IAAmB,CAAA;AAE5G,QAAI,CAACC,MAAY,CAACC,KAAS,CAACC;AAC1B,YAAM,IAAI,MAAM,uDAAuD;AAGzE,UAAMC,IAAaF,KAASC,IAAS,SAASA,CAAM,IAAID,CAAK,KAAK,OAAOD,CAAO,GAC1EI,IAAQV,EAAO,MAAM,UAAU,CAAC,EAAE,IAAAW,EAAA,MAASA,MAAOF,CAAU;AAClE,IAAIC,MAAU,MAIdV,EAAO,MAAM,OAAOU,GAAO,CAAC;AAAA,EAC9B;AASA,WAASE,EAAOC,GAAqBL,GAAwBM,GAAsD;AACjH,UAAMC,IAAUC,EAAM,IAAIb,GAAeW,CAAY,GAE/CH,IAAKI,GAAS,QAAQ,SAASP,CAAM,IAAIO,EAAQ,KAAK,KAAKE,EAAS,QAAQ;AAClF,QAAI,EAAAF,GAAS,SAASf,EAAO,MAAM,KAAK,CAAC,EAAE,IAAIkB,EAAA,MAAiBA,MAAeP,CAAE;AAIjF,aAAAX,EAAO,MAAM,KAAK;AAAA,QAChB,MAAAa;AAAA,QACA,IAAAF;AAAA,QACA,QAAAH;AAAA,QACA,WAAWO,EAAQ;AAAA,MAAA,CACpB,GAEG,OAAOA,EAAQ,WAAY,YAC7B,WAAW,MAAMX,EAAOO,CAAE,GAAG,KAAK,IAAII,EAAQ,OAAO,CAAC,GAGjDJ;AAAA,EACT;AAEA,WAASQ,IAAY;AACnB,IAAAnB,EAAO,QAAQ,CAAA;AAAA,EACjB;AAEA,WAASoB,EAA8BP,GAAqBE,GAAoC;AAC9F,WAAOH,EAAOC,GAAM,SAASE,CAAO;AAAA,EACtC;AAEA,WAASM,EAA6BR,GAAqBE,GAAoC;AAC7F,WAAOH,EAAOC,GAAM,QAAQE,CAAO;AAAA,EACrC;AAEA,WAASO,EAAgCT,GAAqBE,GAAoC;AAChG,WAAOH,EAAOC,GAAM,WAAWE,CAAO;AAAA,EACxC;AAEA,WAASQ,EAAgCV,GAAqBE,GAAoC;AAChG,WAAOH,EAAOC,GAAM,WAAWE,CAAO;AAAA,EACxC;AAEA,SAAOS,EAAS;AAAA;AAAA;AAAA;AAAA,IAId,QAAQC,EAASzB,CAAM;AAAA;AAAA;AAAA;AAAA,IAKvB,QAAAI;AAAA;AAAA;AAAA;AAAA,IAKA,QAAAQ;AAAA;AAAA;AAAA;AAAA,IAKA,WAAAO;AAAA;AAAA;AAAA;AAAA,IAKA,OAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,MAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,SAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,SAAAC;AAAA,EAAA,CACD;AACH;"}
+{"version":3,"file":"useToasts.js","sources":["../src/composables/useToasts/useToasts.ts"],"sourcesContent":["import merge from 'lodash-es/merge';\nimport uniqueId from 'lodash-es/uniqueId';\nimport { reactive, readonly, ref, RenderFunction } from 'vue';\n\nimport { StatusSeverity } from '../../../types/statusLevels';\n\nexport const DEFAULT_TIMEOUT = 5000;\n\nexport type Toast = {\n  id: string;\n  text: string | RenderFunction;\n  status: StatusSeverity;\n  offsetTop?: string;\n};\n\nexport interface ToastOptions {\n  /**\n   * The timeout in milliseconds before the toast is automatically dismissed. If set to `false`, the toast will persist until the user clicks on it.\n   * @default DEFAULT_TIMEOUT\n   */\n  timeout?: number | boolean;\n  /**\n   * A group name ensures only one toast with the same group and status is visible at any given time.\n   * Toasts with the same group but different statuses will be treated as separate and will display concurrently.\n   */\n  group?: string;\n  /**\n   * The container distance from the top of the viewport.\n   */\n  offsetTop?: string;\n}\n\ntype ToastIdOrUndefined<O extends ToastOptions | undefined> = O extends { id: string }\n  ? Toast['id'] | undefined\n  : Toast['id'];\n\nconst active = ref<Toast[]>([]);\n\nexport default function useToasts(globalOptions: Omit<ToastOptions, 'group'> = { timeout: DEFAULT_TIMEOUT }) {\n  // method overloads\n  function remove(toastId: Toast['id']): void;\n  function remove(options: { group: string; status: StatusSeverity }): void;\n  function remove(toastIdOrOptions: Toast['id'] | { group: string; status: StatusSeverity }) {\n    const toastId = typeof toastIdOrOptions === 'string' ? toastIdOrOptions : undefined;\n    const { group = undefined, status = undefined } = typeof toastIdOrOptions === 'object' ? toastIdOrOptions : {};\n\n    if (!toastId && (!group || !status)) {\n      throw new Error('Must provide either a toast ID or both group and type');\n    }\n\n    const idToRemove = group && status ? `toast-${status}-${group}` : String(toastId);\n    const index = active.value.findIndex(({ id }) => id === idToRemove);\n    if (index === -1) {\n      return;\n    }\n\n    active.value.splice(index, 1);\n  }\n\n  // method overloads\n  function create(text: Toast['text'], status: StatusSeverity, options?: Omit<ToastOptions, 'group'>): Toast['id'];\n  function create(\n    text: Toast['text'],\n    status: StatusSeverity,\n    options: ToastOptions & { id: string },\n  ): Toast['id'] | undefined;\n  function create(text: Toast['text'], status: StatusSeverity, localOptions?: ToastOptions): Toast['id'] | undefined {\n    const options = merge({}, globalOptions, localOptions);\n\n    const id = options?.group ? `toast-${status}-${options.group}` : uniqueId('toast-');\n    if (options?.group && active.value.some(({ id: existingId }) => existingId === id)) {\n      return;\n    }\n\n    active.value.push({\n      text,\n      id,\n      status,\n      offsetTop: options.offsetTop,\n    });\n\n    if (typeof options.timeout === 'number') {\n      setTimeout(() => remove(id), Math.abs(options.timeout));\n    }\n\n    return id;\n  }\n\n  function removeAll() {\n    active.value = [];\n  }\n\n  function error<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'error', options);\n  }\n\n  function info<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'info', options);\n  }\n\n  function success<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'success', options);\n  }\n\n  function warning<O extends ToastOptions>(text: Toast['text'], options?: O): ToastIdOrUndefined<O> {\n    return create(text, 'warning', options);\n  }\n\n  return reactive({\n    /**\n     * The list of toasts that are currently visible.\n     */\n    active: readonly(active),\n\n    /**\n     * Removes an active/visible toast by id or by group and type.\n     */\n    remove,\n\n    /**\n     * Creates a new toast and makes it active/visible.\n     */\n    create,\n\n    /**\n     * Removes all active/visible toasts.\n     */\n    removeAll,\n\n    /**\n     * Creates a new \"error\" toast.\n     */\n    error,\n\n    /**\n     * Creates a new \"info\" toast.\n     */\n    info,\n\n    /**\n     * Creates a new \"success\" toast.\n     */\n    success,\n\n    /**\n     * Creates a new \"warning\" toast.\n     */\n    warning,\n  });\n}\n"],"names":["DEFAULT_TIMEOUT","active","ref","useToasts","globalOptions","remove","toastIdOrOptions","toastId","group","status","idToRemove","index","id","create","text","localOptions","options","merge","uniqueId","existingId","removeAll","error","info","success","warning","reactive","readonly"],"mappings":";;;AAMO,MAAMA,IAAkB,KA8BzBC,IAASC,EAAa,EAAE;AAE9B,SAAwBC,EAAUC,IAA6C,EAAE,SAASJ,KAAmB;AAI3G,WAASK,EAAOC,GAA2E;AACzF,UAAMC,IAAU,OAAOD,KAAqB,WAAWA,IAAmB,QACpE,EAAE,OAAAE,IAAQ,QAAW,QAAAC,IAAS,WAAc,OAAOH,KAAqB,WAAWA,IAAmB,CAAC;AAE7G,QAAI,CAACC,MAAY,CAACC,KAAS,CAACC;AACpB,YAAA,IAAI,MAAM,uDAAuD;AAGnE,UAAAC,IAAaF,KAASC,IAAS,SAASA,CAAM,IAAID,CAAK,KAAK,OAAOD,CAAO,GAC1EI,IAAQV,EAAO,MAAM,UAAU,CAAC,EAAE,IAAAW,EAAA,MAASA,MAAOF,CAAU;AAClE,IAAIC,MAAU,MAIPV,EAAA,MAAM,OAAOU,GAAO,CAAC;AAAA,EAAA;AAUrB,WAAAE,EAAOC,GAAqBL,GAAwBM,GAAsD;AACjH,UAAMC,IAAUC,EAAM,IAAIb,GAAeW,CAAY,GAE/CH,IAAKI,KAAA,QAAAA,EAAS,QAAQ,SAASP,CAAM,IAAIO,EAAQ,KAAK,KAAKE,EAAS,QAAQ;AAClF,QAAI,EAAAF,KAAA,QAAAA,EAAS,SAASf,EAAO,MAAM,KAAK,CAAC,EAAE,IAAIkB,EAAW,MAAMA,MAAeP,CAAE;AAIjF,aAAAX,EAAO,MAAM,KAAK;AAAA,QAChB,MAAAa;AAAA,QACA,IAAAF;AAAA,QACA,QAAAH;AAAA,QACA,WAAWO,EAAQ;AAAA,MAAA,CACpB,GAEG,OAAOA,EAAQ,WAAY,YAClB,WAAA,MAAMX,EAAOO,CAAE,GAAG,KAAK,IAAII,EAAQ,OAAO,CAAC,GAGjDJ;AAAA,EAAA;AAGT,WAASQ,IAAY;AACnB,IAAAnB,EAAO,QAAQ,CAAC;AAAA,EAAA;AAGT,WAAAoB,EAA8BP,GAAqBE,GAAoC;AACvF,WAAAH,EAAOC,GAAM,SAASE,CAAO;AAAA,EAAA;AAG7B,WAAAM,EAA6BR,GAAqBE,GAAoC;AACtF,WAAAH,EAAOC,GAAM,QAAQE,CAAO;AAAA,EAAA;AAG5B,WAAAO,EAAgCT,GAAqBE,GAAoC;AACzF,WAAAH,EAAOC,GAAM,WAAWE,CAAO;AAAA,EAAA;AAG/B,WAAAQ,EAAgCV,GAAqBE,GAAoC;AACzF,WAAAH,EAAOC,GAAM,WAAWE,CAAO;AAAA,EAAA;AAGxC,SAAOS,EAAS;AAAA;AAAA;AAAA;AAAA,IAId,QAAQC,EAASzB,CAAM;AAAA;AAAA;AAAA;AAAA,IAKvB,QAAAI;AAAA;AAAA;AAAA;AAAA,IAKA,QAAAQ;AAAA;AAAA;AAAA;AAAA,IAKA,WAAAO;AAAA;AAAA;AAAA;AAAA,IAKA,OAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,MAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,SAAAC;AAAA;AAAA;AAAA;AAAA,IAKA,SAAAC;AAAA,EAAA,CACD;AACH;"}

package/dist/useValidation.js

@@ -1,30 +1,30 @@
 import O from "lodash-es/debounce";
-import E from "lodash-es/get";
-import { toValue as u, computed as c, ref as V, watch as F, reactive as I, nextTick as w, readonly as S } from "vue";
-import { DECIMAL_PRECISION as L, DEBOUNCE as A } from "./constants.js";
+import V from "lodash-es/get";
+import { toValue as u, computed as c, ref as N, watch as L, reactive as I, nextTick as w, readonly as E } from "vue";
+import { DECIMAL_PRECISION as A, DEBOUNCE as q } from "./constants.js";
 import { t as f } from "./locale.js";
 import { i as l } from "./isDefined-DzVx0B6k.js";
-import q from "lodash-es/round";
-function D(e) {
+import D from "lodash-es/round";
+function j(e) {
   return e && e.constructor && typeof e.constructor.isBuffer == "function" && e.constructor.isBuffer(e);
 }
-function j(e) {
+function C(e) {
   return e;
 }
-function C(e, t) {
+function F(e, t) {
   t = t || {};
-  const i = t.delimiter || ".", s = t.maxDepth, a = t.transformKey || j, m = {};
-  function h(v, y, g) {
-    g = g || 1, Object.keys(v).forEach(function(p) {
-      const n = v[p], N = t.safe && Array.isArray(n), r = Object.prototype.toString.call(n), o = D(n), b = r === "[object Object]" || r === "[object Array]", d = y ? y + i + a(p) : a(p);
-      if (!N && !o && b && Object.keys(n).length && (!t.maxDepth || g < s))
-        return h(n, d, g + 1);
-      m[d] = n;
+  const i = t.delimiter || ".", o = t.maxDepth, s = t.transformKey || C, m = {};
+  function v(h, y, g) {
+    g = g || 1, Object.keys(h).forEach(function(p) {
+      const r = h[p], x = t.safe && Array.isArray(r), n = Object.prototype.toString.call(r), a = j(r), b = n === "[object Object]" || n === "[object Array]", d = y ? y + i + s(p) : s(p);
+      if (!x && !a && b && Object.keys(r).length && (!t.maxDepth || g < o))
+        return v(r, d, g + 1);
+      m[d] = r;
     });
   }
-  return h(e), m;
+  return v(e), m;
 }
-function P(e = {}) {
+function Y(e = {}) {
   return {
     name: "email",
     validator(t) {
@@ -33,20 +33,20 @@ function P(e = {}) {
     message: e.message || f("ll.validation.email")
   };
 }
-function Y(e) {
+function _(e) {
   return {
     name: "maxLength",
     validator(t) {
-      const i = u(e.max), s = u(t);
-      if (!l(s))
+      const i = u(e.max), o = u(t);
+      if (!l(o))
         return !0;
-      let a = String(s);
-      return e.trim && (a = a.trim()), a.length <= i;
+      let s = String(o);
+      return e.trim && (s = s.trim()), s.length <= i;
     },
     message: e.message || (() => f("ll.validation.maxLength", { max: String(u(e.max)) }))
   };
 }
-function _(e) {
+function z(e) {
   return {
     name: "maxValue",
     validator(t) {
@@ -56,20 +56,20 @@ function _(e) {
     message: e.message || (() => f("ll.validation.maxValue", { max: String(u(e.max)) }))
   };
 }
-function z(e) {
+function G(e) {
   return {
     name: "minLength",
     validator(t) {
-      const i = u(e.min), s = u(t);
-      if (!l(s))
+      const i = u(e.min), o = u(t);
+      if (!l(o))
         return !0;
-      let a = String(s);
-      return e.trim && (a = a.trim()), a.length >= i;
+      let s = String(o);
+      return e.trim && (s = s.trim()), s.length >= i;
     },
     message: e.message || (() => f("ll.validation.minLength", { min: String(u(e.min)) }))
   };
 }
-function G(e) {
+function H(e) {
   return {
     name: "minValue",
     validator(t) {
@@ -79,7 +79,7 @@ function G(e) {
     message: e.message || (() => f("ll.validation.minValue", { min: String(u(e.min)) }))
   };
 }
-function H(e) {
+function J(e) {
   return {
     name: "pattern",
     validator(t) {
@@ -95,7 +95,7 @@ function H(e) {
     }
   };
 }
-function J(e = {}) {
+function Q(e = {}) {
   return {
     name: "positiveNumber",
     validator(t) {
@@ -104,17 +104,17 @@ function J(e = {}) {
     message: e.message || f("ll.validation.positiveNumber")
   };
 }
-function Q(e = {}) {
+function X(e = {}) {
   return {
     name: "price",
     validator(t) {
       const i = Number(t);
-      return !l(t) || i !== 1 / 0 && i >= 0 && i === q(i, L.CURRENCY);
+      return !l(t) || i !== 1 / 0 && i >= 0 && i === D(i, A.CURRENCY);
     },
     message: e.message || f("ll.validation.price")
   };
 }
-function X(e = {}) {
+function Z(e = {}) {
   return {
     name: "required",
     validator(t) {
@@ -123,7 +123,7 @@ function X(e = {}) {
     message: e.message || f("ll.validation.required")
   };
 }
-function Z(e = {}) {
+function W(e = {}) {
   return {
     name: "wholeNumber",
     validator(t) {
@@ -136,93 +136,97 @@ function ee({
   rules: e,
   values: t
 }) {
-  const s = c(() => Object.keys(C(e, { safe: !0 }))).value.reduce(
-    (r, o) => {
-      const b = V(E(u(t), o)), d = (T) => {
-        b.value = E(u(t), T);
-      }, x = O(() => {
-        d(o);
-      }, A.FAST);
-      return F(
-        () => E(u(t), o),
+  const o = c(() => Object.keys(F(e, { safe: !0 }))).value.reduce(
+    (n, a) => {
+      const b = N(V(u(t), a)), d = (T) => {
+        b.value = V(u(t), T);
+      }, S = O(() => {
+        d(a);
+      }, q.FAST);
+      return L(
+        () => V(u(t), a),
         () => {
-          x();
+          S();
         }
-      ), r[o] = B({
-        fieldName: o,
+      ), n[a] = B({
+        fieldName: a,
         fieldValue: b,
         flush: () => {
-          x.cancel(), d(o);
+          S.cancel(), d(a);
         },
-        rules: E(e, o)
-      }), r;
+        rules: V(e, a)
+      }), n;
     },
     {}
-  ), a = c(() => Object.values(s)), m = c(() => a.value.some((r) => r.errors.length > 0)), h = c(() => a.value.some((r) => r.isTouched)), v = c(() => a.value.filter((r) => r.isDirty));
+  ), s = c(() => Object.values(o)), m = c(() => s.value.some((n) => n.errors.length > 0)), v = c(() => s.value.some((n) => n.isTouched)), h = c(() => s.value.filter((n) => n.isDirty));
   return I({
-    validate: async function({ preventScroll: r } = {}) {
-      if (a.value.forEach((o) => {
-        o.setTouched(!1), o.setTouched(!0);
-      }), await w(), m.value && !r) {
-        const b = Object.entries(s).find(([, x]) => x.errorMessage)?.[0] || "", d = document?.querySelector(`[name=${b}]`);
+    validate: async function({ preventScroll: n } = {}) {
+      if (s.value.forEach((a) => {
+        a.setTouched(!1), a.setTouched(!0);
+      }), await w(), m.value && !n) {
+        const a = Object.entries(o).find(([, S]) => S.errorMessage), b = (a == null ? void 0 : a[0]) || "", d = document == null ? void 0 : document.querySelector(`[name=${b}]`);
         d && d.scrollIntoView({ behavior: "smooth" });
       }
       return !m.value;
     },
-    getError: function(r) {
-      return s[r]?.errorMessage || "";
+    getError: function(n) {
+      var a;
+      return ((a = o[n]) == null ? void 0 : a.errorMessage) || "";
     },
-    touch: function(r) {
-      if (!s[r])
-        throw new Error(`In touch: fieldName "${r}" does not exist in the validation fields.`);
-      s[r].setTouched();
+    touch: function(n) {
+      if (!o[n])
+        throw new Error(`In touch: fieldName "${n}" does not exist in the validation fields.`);
+      o[n].setTouched();
     },
     setAllUntouched: async function() {
-      await w(), a.value.forEach((r) => {
-        r.setTouched(!1);
+      await w(), s.value.forEach((n) => {
+        n.setTouched(!1);
       });
     },
-    setInitialValues: function(r) {
-      a.value.forEach((o) => {
-        o.setInitialValue(r[o.name]);
+    setInitialValues: function(n) {
+      s.value.forEach((a) => {
+        a.setInitialValue(n[a.name]);
       });
     },
-    fields: s,
-    dirtyFields: v,
+    fields: o,
+    dirtyFields: h,
     hasErrors: m,
-    someTouched: h
+    someTouched: v
   });
 }
 function B({
   fieldName: e,
   fieldValue: t,
   rules: i,
-  flush: s
+  flush: o
 }) {
-  const a = V(t.value), m = V(!1), h = c(() => (t.value ?? "") !== (a.value ?? "")), v = c(() => m.value ? i.map((n) => ({
+  const s = N(t.value), m = N(!1), v = c(() => (t.value ?? "") !== (s.value ?? "")), h = c(() => m.value ? i.map((r) => ({
     fieldName: e,
-    ruleName: n.name,
-    isValid: n.validator(t.value),
-    message: typeof n.message == "function" ? n.message(t.value) : n.message
+    ruleName: r.name,
+    isValid: r.validator(t.value),
+    message: typeof r.message == "function" ? r.message(t.value) : r.message
   })) : []), y = c(
-    () => v.value.filter((n) => !n.isValid).map((n) => ({
-      ruleName: n.ruleName,
-      message: n.message
+    () => h.value.filter((r) => !r.isValid).map((r) => ({
+      ruleName: r.ruleName,
+      message: r.message
     }))
   );
-  function g(n = !0) {
-    s(), m.value = n;
+  function g(r = !0) {
+    o(), m.value = r;
   }
-  function p(n) {
-    a.value = n;
+  function p(r) {
+    s.value = r;
   }
   return I({
     name: e,
-    currentValue: S(t),
-    initialValue: S(a),
-    isTouched: S(m),
-    isDirty: S(h),
-    errorMessage: c(() => y.value?.[0]?.message || ""),
+    currentValue: E(t),
+    initialValue: E(s),
+    isTouched: E(m),
+    isDirty: E(v),
+    errorMessage: c(() => {
+      var r, x;
+      return ((x = (r = y.value) == null ? void 0 : r[0]) == null ? void 0 : x.message) || "";
+    }),
     errors: y,
     setInitialValue: p,
     setTouched: g
@@ -230,16 +234,16 @@ function B({
 }
 export {
   ee as default,
-  P as email,
+  Y as email,
   l as isDefined,
-  Y as maxLength,
-  _ as maxValue,
-  z as minLength,
-  G as minValue,
-  H as pattern,
-  J as positiveNumber,
-  Q as price,
-  X as required,
-  Z as wholeNumber
+  _ as maxLength,
+  z as maxValue,
+  G as minLength,
+  H as minValue,
+  J as pattern,
+  Q as positiveNumber,
+  X as price,
+  Z as required,
+  W as wholeNumber
 };
 //# sourceMappingURL=useValidation.js.map