filepond 5.0.0-beta.21 → 5.0.0-beta.22

package/cdn/workers/httpRequest.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/cdn/workers/readFile.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/cdn/workers/transformImage.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/assets/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/console.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/entry.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/perceivedPerformanceProxy.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/readEntriesFromDataTransfer.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/ssr.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/common/status.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/core/entryTree.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/core/extensionManager.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/core/taskScheduler.js

@@ -1,36 +1,36 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com
 */
 import { arrayRemoveInPlace as T } from "../utils/array.js";
-import { pubsub as j } from "../utils/pubsub.js";
-import { isString as z, isFunction as D } from "../utils/test.js";
-const e = {
+import { pubsub as z } from "../utils/pubsub.js";
+import { isString as J, isFunction as G } from "../utils/test.js";
+const o = {
   QUEUED: 1,
   ACTIVE: 2,
   FAILED: 3,
   HALTED: 4
 };
-function Y(S) {
-  const { log: p = void 0 } = S ?? {}, { on: U, pub: f } = j(), s = [], i = /* @__PURE__ */ new Map();
+function Y(D) {
+  const { log: p = void 0 } = D ?? {}, { on: U, pub: f } = z(), s = [], i = /* @__PURE__ */ new Map();
   function h(t) {
-    return t.state === e.QUEUED || t.state === e.ACTIVE;
+    return t.state === o.QUEUED || t.state === o.ACTIVE;
   }
   function k(t) {
-    return t.state === e.QUEUED;
+    return t.state === o.QUEUED;
   }
   function x(t) {
-    return t.state === e.ACTIVE;
+    return t.state === o.ACTIVE;
   }
   function C(t, n) {
-    return z(t) && D(n);
+    return J(t) && G(n);
   }
   function g(t, n) {
     let r = 0;
-    for (let o = 0; o < n.length; o++)
-      t.order >= n[o].order && (r = o + 1);
+    for (let e = 0; e < n.length; e++)
+      t.order >= n[e].order && (r = e + 1);
     n.splice(r, 0, t);
   }
   function v(t) {
@@ -38,9 +38,9 @@ function Y(S) {
     let n = i.get(t.group);
     n || (n = [], i.set(t.group, n)), g(t, n);
   }
-  function Q(t, n) {
+  function F(t, n) {
     const r = i.get(t);
-    return r ? !!r.find((o) => o.fn === n) : !1;
+    return r ? !!r.find((e) => e.fn === n) : !1;
   }
   function m(t) {
     T(
@@ -50,7 +50,7 @@ function Y(S) {
     const n = i.get(t.group);
     n && T(n, (r) => r.fn === t.fn);
   }
-  function B(t) {
+  function Q(t) {
     T(s, (n) => n.group === t), i.delete(t);
   }
   function c(t) {
@@ -59,26 +59,26 @@ function Y(S) {
   function E(t, n) {
     return c(t)[0].state === n;
   }
-  function H(t) {
+  function B(t) {
     return c(t).filter(h).length > 0;
   }
-  function L(t) {
+  function H(t) {
     const n = c(t);
     for (const r of n)
-      y(r);
+      I(r);
   }
   function d(t) {
     return c(t).filter(k)[0];
   }
-  function O(t, n) {
+  function L(t, n) {
     const r = c(t);
     if (r)
-      return r.find((o) => o.fn === n);
+      return r.find((e) => e.fn === n);
   }
   function b(t, n, r) {
-    const { ignoreOptional: o = !1 } = r || {}, a = i.get(t) ?? [];
+    const { isSoftFailure: e = !1 } = r || {}, a = i.get(t) ?? [];
     for (const u of a)
-      o && u.isOptional || (u.state = n);
+      e && u.ignoreSoftFailure || (u.state = n);
   }
   function V() {
     return Array.from(new Set(s.map((t) => t.group)));
@@ -95,13 +95,13 @@ function Y(S) {
   function R(t) {
     return N().filter((n) => n.fn === t.fn);
   }
-  function A(t) {
+  function S(t) {
     return t ? t.parallel === 1 / 0 || R(t).length < t.parallel : !1;
   }
   function l() {
-    queueMicrotask(F);
+    queueMicrotask(P);
   }
-  function F() {
+  function P() {
     if (!w()) {
       p?.(s), f("idle");
       return;
@@ -109,65 +109,70 @@ function Y(S) {
     p?.(s);
     const t = V();
     for (const n of t) {
-      if (!E(n, e.QUEUED)) {
-        if (E(n, e.HALTED)) {
-          const o = d(n);
-          if (!o || !A(o))
+      if (!E(n, o.QUEUED)) {
+        if (E(n, o.HALTED)) {
+          const e = d(n);
+          if (!e || e.ignoreSoftFailure === !1 || !S(e))
             continue;
-          I(o);
+          A(e);
         }
         continue;
       }
       const r = d(n);
-      A(r) && I(r);
+      S(r) && A(r);
     }
   }
-  async function I(t) {
-    const { group: n, fn: r, params: o } = t;
-    t.state = e.ACTIVE;
+  async function A(t) {
+    const { group: n, fn: r, params: e } = t;
+    t.state = o.ACTIVE;
     try {
-      const a = D(o) ? o() : o, u = await r(...a, {
+      const a = G(e) ? e() : e, u = await r(...a, {
         abortController: t.abortController
       });
-      m(t), u === !1 && b(n, e.HALTED, { ignoreOptional: !0 });
+      m(t), u === !1 && b(n, o.HALTED, { isSoftFailure: !0 });
     } catch (a) {
-      t.state = e.FAILED, f("error", a), b(n, e.HALTED);
+      t.state = o.FAILED, f("error", a), b(n, o.HALTED);
     }
-    H(n) || f("complete", n), l();
+    B(n) || f("complete", n), l();
   }
-  function y(t) {
+  function I(t) {
     t.abortController.signal.aborted || t.abortController.abort();
   }
-  function P(t, n, r) {
-    const { parallel: o = 1 / 0, order: a = 0, params: u = [], isOptional: W = !1 } = r ?? {};
-    !C(t, n) || Q(t, n) || (v({
+  function M(t, n, r) {
+    const {
+      parallel: e = 1 / 0,
+      order: a = 0,
+      params: u = [],
+      ignoreSoftFailure: j = !1
+    } = r ?? {};
+    !C(t, n) || F(t, n) || (v({
       group: t,
       fn: n,
       params: u,
       order: a,
-      parallel: o,
-      isOptional: W,
-      state: e.QUEUED,
+      parallel: e,
+      ignoreSoftFailure: j,
+      state: o.QUEUED,
       abortController: new AbortController()
     }), l());
   }
-  function M(t, n) {
-    const r = O(t, n);
-    r && (y(r), m(r), l());
+  function W(t, n) {
+    const r = L(t, n);
+    r && (I(r), m(r), l());
   }
-  function G(t) {
+  function y(t) {
     if (!t) {
       for (const n of q())
-        G(n);
+        y(n);
       return;
     }
-    L(t), B(t), f("abort", t), f("complete", t), l();
+    H(t), Q(t), f("abort", t), f("complete", t), l();
   }
   return {
     on: U,
-    pushTask: P,
-    abortTask: M,
-    abortTasks: G
+    pushTask: M,
+    abortTask: W,
+    abortTasks: y
   };
 }
 export {

package/esm/dev/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDefault/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDefault/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropArea/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropArea/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropArea/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropIndicator/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropIndicator/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondDropIndicator/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/Entry/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/Entry/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/Entry/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryActivityIndicator/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryActivityIndicator/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryActivityIndicator/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryList/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryList/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryList/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryListItem/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryListItem/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryListItem/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryListItemPlaceholder/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryStatus/index.css.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryStatus/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com

package/esm/elements/FilePondEntryList/components/EntryStatus/index.svelte.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.22
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com