filepond 5.0.0-beta.21 → 5.0.0-beta.23

package/cdn/workers/httpRequest.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com
@@ -8,15 +8,15 @@ import { createTaskScheduler as R } from "./taskScheduler.js";
 import { pubsub as z } from "../utils/pubsub.js";
 import { isArray as k } from "../utils/test.js";
 import { arrayItemsEqual as D, arrayRemoveInPlace as G, arraySortByItemProp as H } from "../utils/array.js";
-function V(a) {
-  const { on: I, pub: y } = z(), c = [], { insertEntries: T, replaceEntry: A, updateEntry: v, removeEntries: j } = a, f = R({ log: void 0 }), x = {
+function V(c) {
+  const { on: I, pub: y } = z(), a = [], { insertEntries: T, replaceEntry: A, updateEntry: v, removeEntries: j } = c, f = R({ log: void 0 }), x = {
     extension: {}
   };
   function l(n, s) {
     x.extension[n] = {
       ...g(n),
       ...s
-    }, y("update", x.extension);
+    }, y("updateExtensionState", x.extension);
   }
   function g(n) {
     return x.extension[n] ?? {};
@@ -27,12 +27,12 @@ function V(a) {
   function O(n) {
     return x.extension[n].status;
   }
-  a.on("removeEntry", ({ entry: n }) => {
+  c.on("removeEntry", ({ entry: n }) => {
     f.abortTasks(n.id);
   });
   function q(n) {
     const s = function(e, i) {
-      return a.on(e, i);
+      return c.on(e, i);
     }, o = [], t = { current: void 0 };
     t.current = n({
       // events
@@ -52,11 +52,11 @@ function V(a) {
         const B = E(
           t.current.name
         );
-        a.findEntries(e) && f.pushTask(e, i, {
+        c.findEntries(e) && f.pushTask(e, i, {
           // set order to factor of 100 so in theory there's plenty room for adding manual order
           order: B.index * 100,
           // when params is a function it is called on run task
-          params: () => [a.findEntries(e)],
+          params: () => [c.findEntries(e)],
           // add custom options
           ...u
         });
@@ -68,9 +68,9 @@ function V(a) {
         f.abortTasks(e);
       },
       setEntries: function(e) {
-        a.entries = e;
+        c.entries = e;
       },
-      getEntries: () => a.entries,
+      getEntries: () => c.entries,
       // manipulating entry list
       insertEntries: T,
       removeEntries: j,
@@ -90,14 +90,14 @@ function V(a) {
       e(...i);
     }), t.current;
   }
-  function h() {
-    f.abortTasks(), c.map((n) => n.instance).forEach((n) => n.destroy()), c.length = 0;
+  function S() {
+    f.abortTasks(), a.map((n) => n.instance).forEach((n) => n.destroy()), a.length = 0;
   }
-  const S = {
+  const h = {
     // subscribe to events
     on: I,
     get extensions() {
-      return c.map(({ factory: n }) => n);
+      return a.map(({ factory: n }) => n);
     },
     set extensions(n) {
       if (!k(n))
@@ -105,23 +105,23 @@ function V(a) {
       const s = n.map(
         (t) => Array.isArray(t) ? t[0] : t
       );
-      if (D(s, S.extensions)) {
+      if (D(s, h.extensions)) {
         for (const t of n) {
           if (!k(t))
             continue;
-          const r = c.find((e) => t[0] === e.factory);
+          const r = a.find((e) => t[0] === e.factory);
           p(r, t[1]);
         }
         return;
       }
-      n.length === 0 && (d.clear(), h());
-      for (const t of c)
+      n.length === 0 && (d.clear(), S());
+      for (const t of a)
         if (!s.includes(t.factory)) {
-          t.instance.destroy(), G(c, (r) => r === t);
+          t.instance.destroy(), G(a, (r) => r === t);
           continue;
         }
       for (const [t, r] of Object.entries(s)) {
-        const e = parseInt(t, 10), i = c.find((u) => r === u.factory);
+        const e = parseInt(t, 10), i = a.find((u) => r === u.factory);
         if (i) {
           if (i.index = e, Array.isArray(n[e])) {
             const u = n[e][1];
@@ -129,24 +129,24 @@ function V(a) {
           }
           continue;
         }
-        if (c.push({
+        if (a.push({
           index: e,
           factory: r,
           instance: q(r)
         }), Array.isArray(n[e])) {
           const u = n[e][1];
-          p(c.at(-1), u);
+          p(a.at(-1), u);
         }
       }
-      H(c, "index"), Object.entries(d.get("*") ?? []).forEach(
+      H(a, "index"), Object.entries(d.get("*") ?? []).forEach(
         ([t, r]) => {
           P(t, r);
         }
       );
       for (const [t, r] of d)
         t !== "*" && b(t, r);
-      const o = c.map((t) => t.instance.name);
-      y("setExtensions", { extensionNames: o }), a.entries = [...a.entries];
+      const o = a.map((t) => t.instance.name);
+      y("setExtensions", { extensionNames: o }), c.entries = [...c.entries];
     },
     propagateExtensionProperty: P,
     setExtensionProperties: b,
@@ -157,7 +157,7 @@ function V(a) {
     },
     // destroy FilePond instance
     destroy() {
-      h();
+      S();
     }
   };
   function P(n, s) {
@@ -182,13 +182,13 @@ function V(a) {
     s && (n.instance.setProps(s), m(n.instance.name, s));
   }
   function W(n) {
-    return c.filter((s) => {
+    return a.filter((s) => {
       const o = s.instance.getProps();
       return Object.keys(o).includes(n);
     });
   }
   function E(n) {
-    return c.find((s) => s.instance.name === n);
+    return a.find((s) => s.instance.name === n);
   }
   const d = /* @__PURE__ */ new Map();
   function m(n, s) {
@@ -197,7 +197,7 @@ function V(a) {
       ...s
     });
   }
-  return S;
+  return h;
 }
 export {
   V as createExtensionManager

package/esm/core/taskScheduler.js

@@ -1,173 +1,179 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.23
 * 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 { arrayRemoveInPlace as p } from "../utils/array.js";
+import { pubsub as z } from "../utils/pubsub.js";
+import { isString as J, isFunction as h } 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 h(t) {
-    return t.state === e.QUEUED || t.state === e.ACTIVE;
+function Y(v) {
+  const { log: g = void 0 } = v ?? {}, { on: C, pub: u } = z(), s = [], i = /* @__PURE__ */ new Map();
+  function F(t) {
+    return t.state === o.QUEUED || t.state === o.ACTIVE;
   }
-  function k(t) {
-    return t.state === e.QUEUED;
+  function E(t) {
+    return t.state === o.QUEUED;
   }
-  function x(t) {
-    return t.state === e.ACTIVE;
+  function Q(t) {
+    return t.state === o.ACTIVE;
   }
-  function C(t, n) {
-    return z(t) && D(n);
+  function L(t, n) {
+    return J(t) && h(n);
   }
-  function g(t, n) {
+  function m(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) {
-    g(t, s);
+  function B(t) {
+    m(t, s);
     let n = i.get(t.group);
-    n || (n = [], i.set(t.group, n)), g(t, n);
-  }
-  function Q(t, n) {
-    const r = i.get(t);
-    return r ? !!r.find((o) => o.fn === n) : !1;
+    n || (n = [], i.set(t.group, n)), m(t, n);
   }
-  function m(t) {
-    T(
+  function d(t) {
+    p(
       s,
       (r) => r.group === t.group && r.fn === t.fn
     );
     const n = i.get(t.group);
-    n && T(n, (r) => r.fn === t.fn);
+    n && p(n, (r) => r.fn === t.fn);
   }
-  function B(t) {
-    T(s, (n) => n.group === t), i.delete(t);
+  function H(t) {
+    p(s, (n) => n.group === t), i.delete(t);
   }
-  function c(t) {
+  function f(t) {
     return i.get(t) ?? [];
   }
-  function E(t, n) {
-    return c(t)[0].state === n;
+  function A(t, n) {
+    return f(t)[0].state === n;
   }
-  function H(t) {
-    return c(t).filter(h).length > 0;
+  function q(t) {
+    return f(t).filter(F).length > 0;
   }
-  function L(t) {
-    const n = c(t);
+  function V(t) {
+    const n = f(t);
     for (const r of n)
-      y(r);
+      U(r);
   }
-  function d(t) {
-    return c(t).filter(k)[0];
+  function S(t) {
+    return f(t).filter(E)[0];
   }
-  function O(t, n) {
-    const r = c(t);
+  function b(t, n) {
+    const r = f(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) ?? [];
-    for (const u of a)
-      o && u.isOptional || (u.state = n);
+  function I(t, n, r) {
+    const { isSoftFailure: e = !1 } = r || {}, c = i.get(t) ?? [];
+    for (const a of c)
+      e && a.ignoreSoftFailure || (a.state = n);
   }
-  function V() {
+  function w() {
     return Array.from(new Set(s.map((t) => t.group)));
   }
-  function q() {
+  function N() {
     return i.keys();
   }
-  function w() {
-    return s.filter(k).length > 0;
+  function R() {
+    return s.filter(E).length > 0;
   }
-  function N() {
-    return s.filter(x);
+  function P() {
+    return s.filter(Q);
   }
-  function R(t) {
-    return N().filter((n) => n.fn === t.fn);
+  function M(t) {
+    return P().filter((n) => n.fn === t.fn);
   }
-  function A(t) {
-    return t ? t.parallel === 1 / 0 || R(t).length < t.parallel : !1;
+  function y(t) {
+    return t ? t.parallel === 1 / 0 || M(t).length < t.parallel : !1;
   }
   function l() {
-    queueMicrotask(F);
+    queueMicrotask(D);
   }
-  function F() {
-    if (!w()) {
-      p?.(s), f("idle");
+  function D() {
+    if (!R()) {
+      g?.(s), u("idle");
       return;
     }
-    p?.(s);
-    const t = V();
+    g?.(s);
+    const t = w();
     for (const n of t) {
-      if (!E(n, e.QUEUED)) {
-        if (E(n, e.HALTED)) {
-          const o = d(n);
-          if (!o || !A(o))
+      if (!A(n, o.QUEUED)) {
+        if (A(n, o.HALTED)) {
+          const e = S(n);
+          if (!e || e.ignoreSoftFailure === !1 || !y(e))
             continue;
-          I(o);
+          G(e);
         }
         continue;
       }
-      const r = d(n);
-      A(r) && I(r);
+      const r = S(n);
+      y(r) && G(r);
     }
   }
-  async function I(t) {
-    const { group: n, fn: r, params: o } = t;
-    t.state = e.ACTIVE;
+  async function G(t) {
+    const { group: n, fn: r, params: e, abortController: c } = t;
+    t.state = o.ACTIVE;
     try {
-      const a = D(o) ? o() : o, u = await r(...a, {
-        abortController: t.abortController
-      });
-      m(t), u === !1 && b(n, e.HALTED, { ignoreOptional: !0 });
+      const a = h(e) ? e() : e, T = await r(...a, { abortController: c });
+      d(t), T === !1 && I(n, o.HALTED, { isSoftFailure: !0 });
     } catch (a) {
-      t.state = e.FAILED, f("error", a), b(n, e.HALTED);
+      u("error", a), I(n, o.HALTED), console.log("set current task state to failed"), t.state = o.FAILED;
     }
-    H(n) || f("complete", n), l();
+    q(n) || u("complete", n), l();
   }
-  function y(t) {
+  function U(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 W(t, n, r) {
+    const {
+      parallel: e = 1 / 0,
+      order: c = 0,
+      params: a = [],
+      ignoreSoftFailure: T = !1
+    } = r ?? {};
+    if (!L(t, n))
+      return;
+    const k = b(t, n);
+    if (k) {
+      k?.state === o.FAILED && (k.state = o.QUEUED, D());
+      return;
+    }
+    B({
       group: t,
       fn: n,
-      params: u,
-      order: a,
-      parallel: o,
-      isOptional: W,
-      state: e.QUEUED,
+      params: a,
+      order: c,
+      parallel: e,
+      ignoreSoftFailure: T,
+      state: o.QUEUED,
       abortController: new AbortController()
-    }), l());
+    }), l();
   }
-  function M(t, n) {
-    const r = O(t, n);
-    r && (y(r), m(r), l());
+  function j(t, n) {
+    const r = b(t, n);
+    r && (U(r), d(r), l());
   }
-  function G(t) {
+  function x(t) {
     if (!t) {
-      for (const n of q())
-        G(n);
+      for (const n of N())
+        x(n);
       return;
     }
-    L(t), B(t), f("abort", t), f("complete", t), l();
+    V(t), H(t), u("abort", t), u("complete", t), l();
   }
   return {
-    on: U,
-    pushTask: P,
-    abortTask: M,
-    abortTasks: G
+    on: C,
+    pushTask: W,
+    abortTask: j,
+    abortTasks: x
   };
 }
 export {

package/esm/dev/index.js

@@ -1,5 +1,5 @@
 /*!
-* FilePond v5.0.0-beta.21
+* FilePond v5.0.0-beta.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * 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.23
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com