filepond 5.0.0-beta.2 → 5.0.0-beta.21

package/cdn/templates/entry.js

@@ -1 +1 @@
-export * from '../index.js'
+export * from '../main.js'

package/cdn/templates/helpers.js

@@ -1 +1 @@
-export * from '../index.js'
+export * from '../main.js'

package/cdn/templates/index.js

@@ -1 +1 @@
-export * from '../index.js'
+export * from '../main.js'

package/cdn/templates/media.js

@@ -1 +1 @@
-export * from '../index.js'
+export * from '../main.js'

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.2
+* 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.2
+* 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.2
+* 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.2
+* 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.2
+* 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.2
+* 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.2
+* 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,27 +1,32 @@
 /*!
-* FilePond v5.0.0-beta.2
+* FilePond v5.0.0-beta.21
 * Copyright (c) 2017-2026 Pqina B.V.
 * Released under the MIT License
 * https://filepond.com
 */
-import { sortTree as $, eachTree as q, filterTree as tt, mapTree as w, findTree as nt } from "../utils/tree.js";
-import { deepAssign as et, deepOverlap as rt } from "../utils/object.js";
-import { pubsub as it } from "../utils/pubsub.js";
-import { arrayRemoveFalsy as m, arrayWrap as st } from "../utils/array.js";
-import { isArray as U, isDirectoryEntry as h, isUndefined as I, isNumber as P, isString as b, isNullOrUndefined as ot, isObject as at, isFileEntry as D, isBlobOrFile as ft, isFile as ct } from "../utils/test.js";
-import { getUniqueId as ut } from "../utils/string.js";
-function gt(M) {
-  const { beforeAddEntry: B, beforeUpdateEntryWithProps: N } = M ?? {}, { on: R, pub: x } = it(), a = {
+import { sortTree as tt, eachTree as w, filterTree as et, mapTree as M, findTree as nt } from "../utils/tree.js";
+import { deepAssign as rt, deepOverlap as it } from "../utils/object.js";
+import { pubsub as st } from "../utils/pubsub.js";
+import { arrayRemoveFalsy as m, arrayWrap as ot } from "../utils/array.js";
+import { isArray as U, isDirectoryEntry as h, isUndefined as I, isNumber as b, isString as P, isNullOrUndefined as at, isObject as ft, isFileEntry as D, isBlobOrFile as ct, isFile as ut } from "../utils/test.js";
+import { getUniqueId as dt } from "../utils/string.js";
+import { passthrough as lt } from "../utils/placeholder.js";
+function xt(O) {
+  const {
+    beforeInsertEntries: A = lt,
+    beforeOnboardEntry: N,
+    beforeUpdateEntryWithProps: R
+  } = O ?? {}, { on: W, pub: x } = st(), a = {
     entries: []
   }, p = /* @__PURE__ */ new Map();
   let u = !1;
   function S(t) {
-    const e = B ? B(t) : D(t) || h(t) ? t : !1;
-    if (e !== !1)
-      return e.id = e.id ?? ut(), e;
+    const n = N ? N(t) : D(t) || h(t) ? t : !1;
+    if (n !== !1)
+      return n.id = n.id ?? dt(), n;
   }
   function T(t) {
-    x("insertEntry", t), !(D(t) && ft(t.file) && F(t)) && z(t);
+    x("insertEntry", t), !(D(t) && ct(t.file) && F(t)) && z(t);
   }
   function C(t) {
     x("removeEntry", t);
@@ -30,155 +35,159 @@ function gt(M) {
     x("updateEntry", t);
   }
   function F(t) {
-    let e = !1;
-    const n = R("updateEntry", () => {
-      n(), e = !0;
+    let n = !1;
+    const e = W("updateEntry", () => {
+      e(), n = !0;
     });
-    return x("updateEntryData", t), e;
+    return x("updateEntryData", t), n;
   }
   function d() {
     x("updateEntries", a.entries);
   }
-  function E(t, e = []) {
-    t || (p.clear(), t = a.entries), t.forEach((n, r) => {
-      p.set(n.id, [...e, r]), h(n) && E(n.entries, [...e, r]);
+  function E(t, n = []) {
+    t || (p.clear(), t = a.entries), t.forEach((e, r) => {
+      p.set(e.id, [...n, r]), h(e) && E(e.entries, [...n, r]);
     });
   }
   function _() {
     p.clear();
   }
-  function W(t) {
+  function k(t) {
     return U(t) ? t : [t];
   }
-  function y(t, e = a) {
-    const n = t;
-    for (let r = 0; r < n.length; r++) {
-      const i = n[r], s = e.entries[i];
-      if (h(s) && r < n.length) {
-        e = s;
+  function y(t, n = a) {
+    const e = t;
+    for (let r = 0; r < e.length; r++) {
+      const i = e[r], o = n.entries[i];
+      if (h(o) && r < e.length) {
+        n = o;
         continue;
       }
-      return s;
+      return o;
     }
-    return e;
+    return n;
   }
   function v(t) {
-    const e = t.slice(0, t.length - 1);
-    return y(e);
+    const n = t.slice(0, t.length - 1);
+    return y(n);
   }
   function g(t) {
-    if (!ot(t)) {
-      if (P(t))
+    if (!at(t)) {
+      if (b(t))
         return a.entries[t] ? [t] : void 0;
-      if (U(t) && t.every(P))
+      if (U(t) && t.every(b))
         return t;
-      if (b(t) || b(t.id)) {
-        const e = t.id ?? t;
-        return p.get(e);
+      if (P(t) || P(t.id)) {
+        const n = t.id ?? t;
+        return p.get(n);
       }
-      if (at(t)) {
-        const e = nt(a.entries, (n) => rt(t, n));
-        return e && p.get(e.id);
+      if (ft(t)) {
+        const n = nt(a.entries, (e) => it(t, e));
+        return n && p.get(n.id);
       }
     }
   }
-  function k(t, ...e) {
-    let n = !1;
-    for (const r of e) {
+  function j(t, ...n) {
+    let e = !1;
+    for (const r of n) {
       let i = !1;
       // we're comparing files
       D(t) && D(r) && // new entry carries a file object
-      ct(r.file) && // these files are different so we're gonna update data
-      t.file !== r.file && (i = !0), N && N(t, r, i), i && (n = !0), et(t, r);
+      ut(r.file) && // these files are different so we're gonna update data
+      t.file !== r.file && (i = !0), R && R(t, r, i), i && (e = !0), rt(t, r);
     }
-    return [t, n];
+    return [t, e];
   }
-  function G(t, ...e) {
-    const n = g(t);
-    if (!n)
+  function G(t, ...n) {
+    const e = g(t);
+    if (!e)
       return;
-    const r = v(n);
+    const r = v(e);
     if (!r)
       return;
-    const i = m(e), s = n.at(-1);
-    if (I(s))
+    const i = m(n), o = e.at(-1);
+    if (I(o))
       return;
-    const [f, o] = k(
-      r.entries[s],
+    const [f, s] = j(
+      r.entries[o],
       ...i
     );
-    r.entries = r.entries.toSpliced(s, 1, f);
+    r.entries = r.entries.toSpliced(o, 1, f);
     let c = !1;
-    o && (c = F(f)), c || z(f), u || d();
+    s && (c = F(f)), c || z(f), u || d();
   }
-  function H(t, e) {
-    let n = st(t), r = a, i = -1;
-    e = U(e) || P(e) && e > -1 ? e : a.entries.length;
-    const s = W(e);
-    for (let o = 0; o < s.length; o++) {
-      const c = s[o];
+  function H(t, n) {
+    let e = ot(t), r = a, i = -1;
+    n = U(n) || b(n) && n > -1 ? n : a.entries.length;
+    const o = k(n);
+    for (let s = 0; s < o.length; s++) {
+      const c = o[s];
       if (c < 0)
         return;
-      if (h(r.entries[c]) && o < s.length) {
+      if (h(r.entries[c]) && s < o.length) {
         r = r.entries[c];
         continue;
       }
       i = c;
       break;
     }
-    const f = m(
-      n.map((o) => S(o))
+    const f = A(
+      m(e.map((s) => S(s))),
+      r.entries
     );
-    u = !0, r.entries = r.entries.toSpliced(i, 0, ...f), E(), f.forEach((o) => T(o)), d(), u = !1;
+    u = !0, r.entries = r.entries.toSpliced(i, 0, ...f), E(), f.forEach((s) => T(s)), d(), u = !1;
   }
-  function J(t, ...e) {
-    const n = g(t);
-    if (!n)
+  function J(t, ...n) {
+    const e = g(t);
+    if (!e)
       return;
-    const r = v(n);
+    const r = v(e);
     if (!r || !h(r))
       return;
-    const i = n.at(-1);
+    const i = e.at(-1);
     if (I(i))
       return;
     u = !0;
-    const s = m(e.flat().map(S)), f = y(n);
-    r.entries = r.entries.toSpliced(i, 1, ...s), E(), C({ entry: f, index: [-1] }), s.forEach(T), d(), u = !1;
+    const o = y(e), f = A(
+      m(n.flat().map(S)),
+      r.entries.filter((s) => s.id !== o.id)
+    );
+    r.entries = r.entries.toSpliced(i, 1, ...f), E(), C({ entry: o, index: [-1] }), f.forEach(T), d(), u = !1;
   }
-  function K(t, e) {
-    const n = g(t);
-    if (!n)
+  function K(t, n) {
+    const e = g(t);
+    if (!e)
       return;
-    const r = v(n);
+    const r = v(e);
     if (!r || !h(r))
       return;
-    const i = W(e), s = v(i);
-    if (!s || !h(s))
+    const i = k(n), o = v(i);
+    if (!o || !h(o))
       return;
-    const f = n.at(-1);
+    const f = e.at(-1);
     if (I(f))
       return;
-    const o = i.at(-1);
-    if (I(o))
+    const s = i.at(-1);
+    if (I(s))
       return;
     const c = r.entries[f];
-    r.entries = r.entries.toSpliced(f, 1), s.entries = s.entries.toSpliced(o, 0, c), E(), d();
+    r.entries = r.entries.toSpliced(f, 1), o.entries = o.entries.toSpliced(s, 0, c), E(), d();
   }
   function L(...t) {
-    const e = m(t).map((n) => {
-      if (P(n))
-        return a.entries[n];
-      if (U(n) && n.every(P))
-        return y(n);
-      if (b(n) || b(n.id)) {
-        const r = n.id ?? n, i = p.get(r);
+    const n = m(t).map((e) => {
+      if (b(e))
+        return a.entries[e];
+      if (U(e) && e.every(b))
+        return y(e);
+      if (P(e) || P(e.id)) {
+        const r = e.id ?? e, i = p.get(r);
         return I(i) ? void 0 : y(i);
       }
     });
-    return t.length === 1 ? e[0] : e;
+    return t.length === 1 ? n[0] : n;
   }
-  function O(...t) {
-    const e = t[0] === -1 ? (
+  function Q(...t) {
+    const n = t[0] === -1 ? (
       // last item
       [[a.entries.length - 1]]
     ) : (
@@ -187,84 +196,84 @@ function gt(M) {
         // else find item
         [...arguments].map(g)
       )
-    ), n = [], r = [];
-    for (const i of e) {
+    ), e = [], r = [];
+    for (const i of n) {
       if (!i) {
-        n.push(void 0);
+        e.push(void 0);
         continue;
       }
-      const s = v(i);
-      if (!s || !h(s)) {
-        n.push(void 0);
+      const o = v(i);
+      if (!o || !h(o)) {
+        e.push(void 0);
         continue;
       }
       const f = i.at(-1);
       if (I(f))
         return;
-      const o = s.entries[f];
-      o && (n.push({ entry: o, index: i }), s.entries = s.entries.toSpliced(f, 1, void 0), r.push(s));
+      const s = o.entries[f];
+      s && (e.push({ entry: s, index: i }), o.entries = o.entries.toSpliced(f, 1, void 0), r.push(o));
     }
     return r.forEach((i) => {
       i.entries = m(i.entries);
-    }), n.length && (E(), u = !0, m(n).forEach((i) => C(i)), d(), u = !1), arguments.length === 1 ? n[0] : n;
-  }
-  function Q(t) {
-    a.entries = $(a.entries, t), E(), d();
+    }), e.length && (E(), u = !0, m(e).forEach((i) => C(i)), d(), u = !1), arguments.length === 1 ? e[0] : e;
   }
   function V(t) {
+    a.entries = tt(a.entries, t), E(), d();
+  }
+  function X(t) {
     u = !0;
-    const e = [], n = [], r = [], i = new Set(p.keys()), s = /* @__PURE__ */ new Set(), f = w(t, (o) => {
-      const c = b(o.id) && g(o.id);
+    const n = [], e = [], r = [], i = new Set(p.keys()), o = /* @__PURE__ */ new Set(), f = M(t, (s) => {
+      const c = P(s.id) && g(s.id);
       if (c) {
-        s.add(o.id);
-        const l = o, A = y(c);
-        if (l === A)
-          return A;
-        const [j, Z] = k(
-          A,
+        o.add(s.id);
+        const l = s, B = y(c);
+        if (l === B)
+          return B;
+        const [q, $] = j(
+          B,
           l
         );
-        return r.push([j, Z]), j;
+        return r.push([q, $]), q;
       } else {
-        const l = S(o);
-        return l ? (n.push(l), l) : void 0;
+        const l = S(s);
+        return l ? (e.push(l), l) : void 0;
       }
     });
-    Array.from(i).filter((o) => !s.has(o)).forEach((o) => {
-      const c = g(o), l = y(c);
-      e.push({ entry: l, index: [-1] });
-    }), a.entries = f, E(), e.forEach(C), n.forEach(T), r.forEach(([o, c]) => {
-      c && F(o) || z(o);
+    Array.from(i).filter((s) => !o.has(s)).forEach((s) => {
+      const c = g(s), l = y(c);
+      n.push({ entry: l, index: [-1] });
+    }), a.entries = f, E(), n.forEach(C), e.forEach(T), r.forEach(([s, c]) => {
+      c && F(s) || z(s);
     }), d(), u = !1;
   }
-  function X(t) {
+  function Y(t) {
     u = !0;
-    const e = tt(w(t, S), Boolean);
-    a.entries = e, E(), q(a.entries, T), d(), u = !1;
+    const n = et(M(t, S), Boolean);
+    a.entries = n, E(), w(a.entries, T), d(), u = !1;
   }
-  function Y() {
-    a.entries.length && (u = !0, q(a.entries, (t, e) => C({ entry: t, index: [-1] })), a.entries = [], _(), d(), u = !1);
+  function Z() {
+    a.entries.length && (u = !0, w(a.entries, (t, n) => C({ entry: t, index: [-1] })), a.entries = [], _(), d(), u = !1);
   }
   return {
-    on: R,
+    on: W,
     insertEntries: H,
     findEntries: L,
-    removeEntries: O,
-    sortEntries: Q,
+    removeEntries: Q,
+    sortEntries: V,
     updateEntry: G,
     replaceEntry: J,
     moveEntry: K,
     set entries(t) {
       if (!(!U(t) || a.entries === t)) {
         if (!t.length) {
-          Y();
+          Z();
           return;
         }
         if (!a.entries.length) {
-          X(t);
+          Y(t);
           return;
         }
-        V(t);
+        X(t);
       }
     },
     get entries() {
@@ -275,5 +284,5 @@ function gt(M) {
   };
 }
 export {
-  gt as createEntryTree
+  xt as createEntryTree
 };