filepond 5.0.0-beta.20 → 5.0.0-beta.21

package/cdn/workers/httpRequest.js

@@ -0,0 +1,45 @@
+/*!
+* FilePond v5.0.0-beta.21
+* Copyright (c) 2017-2026 Pqina B.V.
+* Released under the MIT License
+* https://filepond.com
+*/
+function g({
+  url: l,
+  method: s = "GET",
+  formData: a,
+  data: p,
+  headers: i = [],
+  timeout: d = 0,
+  withCredentials: f = !1,
+  responseType: c = "text"
+}, u, { abortController: E = new AbortController(), onprogress: T, onabort: h }) {
+  function n() {
+    u(e.status + " (" + e.statusText + ")");
+  }
+  function q() {
+    const t = {
+      response: e.response,
+      responseHeaders: e.getAllResponseHeaders()
+    };
+    u(null, t, typeof t.response != "string" ? [t.response] : void 0);
+  }
+  function H(t) {
+    const o = new FormData();
+    return t.filter(Boolean).forEach((R) => {
+      o.append(...R);
+    }), o;
+  }
+  const e = new XMLHttpRequest();
+  e.responseType = c, E.signal.onabort = () => {
+    e.abort();
+  };
+  const r = p || (a ? H(a) : null);
+  (r ? e.upload : e).onprogress = T, e.onload = () => {
+    e.status >= 200 && e.status < 300 ? q() : n();
+  }, e.onerror = n, e.ontimeout = n, e.onabort = h, e.open(r && (s === "GET" || s === "HEAD") ? "POST" : s, l), e.withCredentials = f, e.timeout = d, i.forEach(([t, o]) => e.setRequestHeader(t, o)), e.send(r);
+}
+g.fileName = "httpRequest";
+export {
+  g as httpRequest
+};

package/cdn/workers/httpRequestWorker.js

@@ -0,0 +1,37 @@
+function g({
+  url: l,
+  method: s = "GET",
+  formData: a,
+  data: p,
+  headers: i = [],
+  timeout: d = 0,
+  withCredentials: f = !1,
+  responseType: c = "text"
+}, u, { abortController: E = new AbortController(), onprogress: T, onabort: h }) {
+  function n() {
+    u(e.status + " (" + e.statusText + ")");
+  }
+  function q() {
+    const t = {
+      response: e.response,
+      responseHeaders: e.getAllResponseHeaders()
+    };
+    u(null, t, typeof t.response != "string" ? [t.response] : void 0);
+  }
+  function H(t) {
+    const o = new FormData();
+    return t.filter(Boolean).forEach((R) => {
+      o.append(...R);
+    }), o;
+  }
+  const e = new XMLHttpRequest();
+  e.responseType = c, E.signal.onabort = () => {
+    e.abort();
+  };
+  const r = p || (a ? H(a) : null);
+  (r ? e.upload : e).onprogress = T, e.onload = () => {
+    e.status >= 200 && e.status < 300 ? q() : n();
+  }, e.onerror = n, e.ontimeout = n, e.onabort = h, e.open(r && (s === "GET" || s === "HEAD") ? "POST" : s, l), e.withCredentials = f, e.timeout = d, i.forEach(([t, o]) => e.setRequestHeader(t, o)), e.send(r);
+}
+g.fileName = "httpRequest";
+self.onmessage = function (message) {g.apply(null, message.data.concat([function (err, response, transferList = []) {const message = { content: response, error: err };return self.postMessage(message, transferList);},{onprogress: function({ lengthComputable, loaded, total }) {self.postMessage({ type: 'progress', content: { lengthComputable, loaded, total }, error: null })}}]))}

package/cdn/workers/readFile.js

@@ -0,0 +1,14 @@
+/*!
+* FilePond v5.0.0-beta.21
+* Copyright (c) 2017-2026 Pqina B.V.
+* Released under the MIT License
+* https://filepond.com
+*/
+function d(a, r, { onprogress: n }) {
+  const e = new FileReader();
+  e.onprogress = n, e.onloadend = () => r(null, { dataURL: e.result }), e.onerror = (o) => r(o), e.readAsDataURL(a);
+}
+d.fileName = "readFile";
+export {
+  d as readFile
+};

package/cdn/workers/readFileWorker.js

@@ -0,0 +1,6 @@
+function d(a, r, { onprogress: n }) {
+  const e = new FileReader();
+  e.onprogress = n, e.onloadend = () => r(null, { dataURL: e.result }), e.onerror = (o) => r(o), e.readAsDataURL(a);
+}
+d.fileName = "readFile";
+self.onmessage = function (message) {d.apply(null, message.data.concat([function (err, response, transferList = []) {const message = { content: response, error: err };return self.postMessage(message, transferList);},{onprogress: function({ lengthComputable, loaded, total }) {self.postMessage({ type: 'progress', content: { lengthComputable, loaded, total }, error: null })}}]))}

package/cdn/workers/transformImage.js

@@ -0,0 +1,16 @@
+/*!
+* FilePond v5.0.0-beta.21
+* Copyright (c) 2017-2026 Pqina B.V.
+* Released under the MIT License
+* https://filepond.com
+*/
+function r(a, e, m, l) {
+  const n = e ? [a, ...Object.values(e), m] : [a, m];
+  createImageBitmap.apply(null, n).then((t) => {
+    l(null, t, [t]);
+  });
+}
+r.fileName = "transformImage";
+export {
+  r as transformImage
+};

package/cdn/workers/transformImageWorker.js

@@ -0,0 +1,8 @@
+function r(a, e, m, l) {
+  const n = e ? [a, ...Object.values(e), m] : [a, m];
+  createImageBitmap.apply(null, n).then((t) => {
+    l(null, t, [t]);
+  });
+}
+r.fileName = "transformImage";
+self.onmessage = function (message) {r.apply(null, message.data.concat([function (err, response, transferList = []) {const message = { content: response, error: err };return self.postMessage(message, transferList);},{onprogress: function({ lengthComputable, loaded, total }) {self.postMessage({ type: 'progress', content: { lengthComputable, loaded, total }, error: null })}}]))}

package/esm/assets/index.js

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

package/esm/core/taskScheduler.js

@@ -1,194 +1,175 @@
 /*!
-* FilePond v5.0.0-beta.20
+* FilePond v5.0.0-beta.21
 * 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 z } from "../utils/pubsub.js";
-import { isString as J, isFunction as U } from "../utils/test.js";
-import { log as p } from "../common/console.js";
+import { pubsub as j } from "../utils/pubsub.js";
+import { isString as z, isFunction as D } from "../utils/test.js";
 const e = {
   QUEUED: 1,
   ACTIVE: 2,
   FAILED: 3,
   HALTED: 4
 };
-function tt(x) {
-  const { logState: k = !1 } = x ?? {}, { on: C, pub: f } = z(), a = [], i = /* @__PURE__ */ new Map();
-  function g() {
-    p(`Tasks: ${a.length}`);
-    for (const t of a) {
-      const { group: n, fn: r, order: o, parallel: s, state: u, ...D } = t;
-      let j = {
-        // queued
-        1: "📥",
-        // active
-        2: "👉",
-        // failed
-        3: "💥",
-        // halted
-        4: "🖐️"
-      }[u];
-      p(j, n, r.name, { parallel: s, order: o });
-    }
-    p("");
-  }
-  function v(t) {
+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 m(t) {
+  function k(t) {
     return t.state === e.QUEUED;
   }
-  function Q(t) {
+  function x(t) {
     return t.state === e.ACTIVE;
   }
-  function B(t, n) {
-    return J(t) && U(n);
+  function C(t, n) {
+    return z(t) && D(n);
   }
-  function E(t, n) {
+  function g(t, n) {
     let r = 0;
     for (let o = 0; o < n.length; o++)
       t.order >= n[o].order && (r = o + 1);
     n.splice(r, 0, t);
   }
-  function H(t) {
-    E(t, a);
+  function v(t) {
+    g(t, s);
     let n = i.get(t.group);
-    n || (n = [], i.set(t.group, n)), E(t, n);
+    n || (n = [], i.set(t.group, n)), g(t, n);
   }
-  function L(t, n) {
+  function Q(t, n) {
     const r = i.get(t);
     return r ? !!r.find((o) => o.fn === n) : !1;
   }
-  function d(t) {
+  function m(t) {
     T(
-      a,
+      s,
       (r) => r.group === t.group && r.fn === t.fn
     );
     const n = i.get(t.group);
     n && T(n, (r) => r.fn === t.fn);
   }
-  function O(t) {
-    T(a, (n) => n.group === t), i.delete(t);
+  function B(t) {
+    T(s, (n) => n.group === t), i.delete(t);
   }
   function c(t) {
     return i.get(t) ?? [];
   }
-  function b(t, n) {
+  function E(t, n) {
     return c(t)[0].state === n;
   }
-  function V(t) {
-    return c(t).filter(v).length > 0;
+  function H(t) {
+    return c(t).filter(h).length > 0;
   }
-  function q(t) {
+  function L(t) {
     const n = c(t);
     for (const r of n)
-      S(r);
+      y(r);
   }
-  function A(t) {
-    return c(t).filter(m)[0];
+  function d(t) {
+    return c(t).filter(k)[0];
   }
-  function w(t, n) {
+  function O(t, n) {
     const r = c(t);
     if (r)
       return r.find((o) => o.fn === n);
   }
-  function I(t, n, r) {
-    const { ignoreOptional: o = !1 } = r || {}, s = i.get(t) ?? [];
-    for (const u of s)
+  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 N() {
-    return Array.from(new Set(a.map((t) => t.group)));
+  function V() {
+    return Array.from(new Set(s.map((t) => t.group)));
   }
-  function R() {
+  function q() {
     return i.keys();
   }
-  function F() {
-    return a.filter(m).length > 0;
+  function w() {
+    return s.filter(k).length > 0;
   }
-  function P() {
-    return a.filter(Q);
+  function N() {
+    return s.filter(x);
   }
-  function M(t) {
-    return P().filter((n) => n.fn === t.fn);
+  function R(t) {
+    return N().filter((n) => n.fn === t.fn);
   }
-  function y(t) {
-    return t ? t.parallel === 1 / 0 || M(t).length < t.parallel : !1;
+  function A(t) {
+    return t ? t.parallel === 1 / 0 || R(t).length < t.parallel : !1;
   }
   function l() {
-    queueMicrotask(W);
+    queueMicrotask(F);
   }
-  function W() {
-    if (!F()) {
-      k && g(), f("idle");
+  function F() {
+    if (!w()) {
+      p?.(s), f("idle");
       return;
     }
-    k && g();
-    const t = N();
+    p?.(s);
+    const t = V();
     for (const n of t) {
-      if (!b(n, e.QUEUED)) {
-        if (b(n, e.HALTED)) {
-          const o = A(n);
-          if (!o || !y(o))
+      if (!E(n, e.QUEUED)) {
+        if (E(n, e.HALTED)) {
+          const o = d(n);
+          if (!o || !A(o))
             continue;
-          G(o);
+          I(o);
         }
         continue;
       }
-      const r = A(n);
-      y(r) && G(r);
+      const r = d(n);
+      A(r) && I(r);
     }
   }
-  async function G(t) {
+  async function I(t) {
     const { group: n, fn: r, params: o } = t;
     t.state = e.ACTIVE;
     try {
-      const s = U(o) ? o() : o, u = await r(...s, {
+      const a = D(o) ? o() : o, u = await r(...a, {
         abortController: t.abortController
       });
-      d(t), u === !1 && I(n, e.HALTED, { ignoreOptional: !0 });
-    } catch (s) {
-      t.state = e.FAILED, f("error", s), I(n, e.HALTED);
+      m(t), u === !1 && b(n, e.HALTED, { ignoreOptional: !0 });
+    } catch (a) {
+      t.state = e.FAILED, f("error", a), b(n, e.HALTED);
     }
-    V(n) || f("complete", n), l();
+    H(n) || f("complete", n), l();
   }
-  function S(t) {
+  function y(t) {
     t.abortController.signal.aborted || t.abortController.abort();
   }
-  function _(t, n, r) {
-    const { parallel: o = 1 / 0, order: s = 0, params: u = [], isOptional: D = !1 } = r ?? {};
-    !B(t, n) || L(t, n) || (H({
+  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({
       group: t,
       fn: n,
       params: u,
-      order: s,
+      order: a,
       parallel: o,
-      isOptional: D,
+      isOptional: W,
       state: e.QUEUED,
       abortController: new AbortController()
     }), l());
   }
-  function $(t, n) {
-    const r = w(t, n);
-    r && (S(r), d(r), l());
+  function M(t, n) {
+    const r = O(t, n);
+    r && (y(r), m(r), l());
   }
-  function h(t) {
+  function G(t) {
     if (!t) {
-      for (const n of R())
-        h(n);
+      for (const n of q())
+        G(n);
       return;
     }
-    q(t), O(t), f("abort", t), f("complete", t), l();
+    L(t), B(t), f("abort", t), f("complete", t), l();
   }
   return {
-    on: C,
-    pushTask: _,
-    abortTask: $,
-    abortTasks: h
+    on: U,
+    pushTask: P,
+    abortTask: M,
+    abortTasks: G
   };
 }
 export {
-  tt as createTaskScheduler
+  Y as createTaskScheduler
 };

package/esm/dev/index.js

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