@leaflink/stash 47.3.4 → 47.3.5
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/useStepper.js +2 -2
- package/dist/useStepper.js.map +1 -1
- package/package.json +1 -1
package/dist/useStepper.js
CHANGED
|
@@ -28,9 +28,9 @@ function E(v = {
|
|
|
28
28
|
a.value[e.value].completed = !0, e.value = -1;
|
|
29
29
|
else if (s(e.value)) {
|
|
30
30
|
const i = l.value === -1, c = l.value === a.value[e.value].substeps.length - 1;
|
|
31
|
-
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++) : (a.value[e.value].substeps[l.value].completed = !0, l.value++);
|
|
31
|
+
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++);
|
|
32
32
|
} else
|
|
33
|
-
a.value[e.value].completed = !0, e.value++, s(e.value) && l.value++;
|
|
33
|
+
a.value[e.value].completed = !0, e.value++, s(e.value) && l.value === -1 && l.value++;
|
|
34
34
|
}
|
|
35
35
|
function h() {
|
|
36
36
|
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)));
|
package/dist/useStepper.js.map
CHANGED
|
@@ -1 +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)) {\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)) {\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,CAAC;AACV,GACA;AAKA,QAAMC,IAAQC,EAA2BF,EAAQ,QAAQA,EAAQ,QAAQ,CAAA,CAAE,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,MAAM;;AAClC,WAAO,MAAM,OAAMI,KAAAC,IAAAT,EAAQ,QAAR,gBAAAS,EAAa,UAAb,gBAAAD,EAAoB,aAAY,CAAA,CAAsC;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,EAC3C;AAOA,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,KACpBC,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,KACpBC,EAAA;AAAA,EAI3B;AAEA,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,EAGtF;AAKS,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,EAInC;AAMS,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,EAEnC;AAMS,WAAAC,EAAaX,GAAmBQ,IAAe,IAAa;AACnE,WAAIA,KAAgB,IACXf,EAAgB,UAAUO,KAAaN,EAAmB,UAAUc,IAEpEf,EAAgB,UAAUO;AAAA,EAErC;AAKS,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,GAAO,CAAA,IAEhEA,EAAA,MAAM,KAAK,EAAE,WAAW,IAAO,UAAU,IAAI;AAAA,EAEvD;AAEO,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,EAAA;AAEJ;"}
|
|
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","_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,CAAC;AACV,GACA;AAKA,QAAMC,IAAQC,EAA2BF,EAAQ,QAAQA,EAAQ,QAAQ,CAAA,CAAE,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,MAAM;;AAClC,WAAO,MAAM,OAAMI,KAAAC,IAAAT,EAAQ,QAAR,gBAAAS,EAAa,UAAb,gBAAAD,EAAoB,aAAY,CAAA,CAAsC;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,EAC3C;AAOA,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,EAI3B;AAEA,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,EAGtF;AAKS,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,EAInC;AAMS,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,EAEnC;AAMS,WAAAC,EAAaX,GAAmBQ,IAAe,IAAa;AACnE,WAAIA,KAAgB,IACXf,EAAgB,UAAUO,KAAaN,EAAmB,UAAUc,IAEpEf,EAAgB,UAAUO;AAAA,EAErC;AAKS,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,GAAO,CAAA,IAEhEA,EAAA,MAAM,KAAK,EAAE,WAAW,IAAO,UAAU,IAAI;AAAA,EAEvD;AAEO,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,EAAA;AAEJ;"}
|