image-js 1.0.0 → 1.1.0

package/dist/image-js.esm.js

@@ -1,5 +1,5 @@
 /*
- * image-js v1.0.0
+ * image-js v1.1.0
  * Image processing and manipulation in JavaScript
  * https://github.com/image-js/image-js#readme
  *
@@ -5694,11 +5694,13 @@ function rotate$1(radians, points) {
  * @returns Sorted points.
  */
 function sortByColumnRow(points) {
-  return points.slice().sort((point1, point2) => {
+  const sortedPoints = points.slice();
+  sortedPoints.sort((point1, point2) => {
     if (point1.column < point2.column) return -1;
     if (point1.column > point2.column) return 1;
     return point1.row - point2.row;
   });
+  return sortedPoints;
 }
 
 /**
@@ -5790,35 +5792,35 @@ const t$2 = Symbol.for("@ts-pattern/matcher"),
         if (!Array.isArray(s)) return false;
         let t = [],
           r = [],
-          a = [];
+          u = [];
         for (const o of n.keys()) {
           const s = n[o];
-          i$2(s) && s[e$2] ? a.push(s) : a.length ? r.push(s) : t.push(s);
+          i$2(s) && s[e$2] ? u.push(s) : u.length ? r.push(s) : t.push(s);
         }
-        if (a.length) {
-          if (a.length > 1) throw new Error("Pattern error: Using `...P.array(...)` several times in a single pattern is not allowed.");
+        if (u.length) {
+          if (u.length > 1) throw new Error("Pattern error: Using `...P.array(...)` several times in a single pattern is not allowed.");
           if (s.length < t.length + r.length) return false;
           const e = s.slice(0, t.length),
             n = 0 === r.length ? [] : s.slice(-r.length),
             i = s.slice(t.length, 0 === r.length ? Infinity : -r.length);
-          return t.every((t, n) => o$2(t, e[n], c)) && r.every((t, e) => o$2(t, n[e], c)) && (0 === a.length || o$2(a[0], i, c));
+          return t.every((t, n) => o$2(t, e[n], c)) && r.every((t, e) => o$2(t, n[e], c)) && (0 === u.length || o$2(u[0], i, c));
         }
         return n.length === s.length && n.every((t, e) => o$2(t, s[e], c));
       }
       return Reflect.ownKeys(n).every(e => {
         const r = n[e];
-        return (e in s || i$2(a = r) && "optional" === a[t$2]().matcherType) && o$2(r, s[e], c);
-        var a;
+        return (e in s || i$2(u = r) && "optional" === u[t$2]().matcherType) && o$2(r, s[e], c);
+        var u;
       });
     }
     return Object.is(s, n);
   },
   s$1 = e => {
-    var n, o, a;
-    return r$2(e) ? i$2(e) ? null != (n = null == (o = (a = e[t$2]()).getSelectionKeys) ? void 0 : o.call(a)) ? n : [] : Array.isArray(e) ? c$1(e, s$1) : c$1(Object.values(e), s$1) : [];
+    var n, o, u;
+    return r$2(e) ? i$2(e) ? null != (n = null == (o = (u = e[t$2]()).getSelectionKeys) ? void 0 : o.call(u)) ? n : [] : Array.isArray(e) ? c$1(e, s$1) : c$1(Object.values(e), s$1) : [];
   },
   c$1 = (t, e) => t.reduce((t, n) => t.concat(e(n)), []);
-function a$2(...t) {
+function u$2(...t) {
   if (1 === t.length) {
     const [e] = t;
     return t => o$2(e, t, () => {});
@@ -5829,15 +5831,15 @@ function a$2(...t) {
   }
   throw new Error(`isMatching wasn't given the right number of arguments: expected 1 or 2, received ${t.length}.`);
 }
-function u$2(t) {
+function a$2(t) {
   return Object.assign(t, {
-    optional: () => l$2(t),
-    and: e => m$1(t, e),
-    or: e => d$1(t, e),
-    select: e => void 0 === e ? y$1(t) : y$1(e, t)
+    optional: () => h$2(t),
+    and: e => d$1(t, e),
+    or: e => y$1(t, e),
+    select: e => void 0 === e ? v$1(t) : v$1(e, t)
   });
 }
-function h$2(t) {
+function l$2(t) {
   return Object.assign((t => Object.assign(t, {
     [Symbol.iterator]() {
       let n = 0;
@@ -5858,12 +5860,12 @@ function h$2(t) {
       };
     }
   }))(t), {
-    optional: () => h$2(l$2(t)),
-    select: e => h$2(void 0 === e ? y$1(t) : y$1(e, t))
+    optional: () => l$2(h$2(t)),
+    select: e => l$2(void 0 === e ? v$1(t) : v$1(e, t))
   });
 }
-function l$2(e) {
-  return u$2({
+function h$2(e) {
+  return a$2({
     [t$2]: () => ({
       match: t => {
         let n = {};
@@ -5890,9 +5892,14 @@ const f$1 = (t, e) => {
   g$1 = (t, e) => {
     for (const [n, r] of t.entries()) if (!e(r, n)) return false;
     return true;
+  },
+  m$1 = (t, e) => {
+    const n = Reflect.ownKeys(t);
+    for (const r of n) if (!e(r, t[r])) return false;
+    return true;
   };
-function m$1(...e) {
-  return u$2({
+function d$1(...e) {
+  return a$2({
     [t$2]: () => ({
       match: t => {
         let n = {};
@@ -5909,8 +5916,8 @@ function m$1(...e) {
     })
   });
 }
-function d$1(...e) {
-  return u$2({
+function y$1(...e) {
+  return a$2({
     [t$2]: () => ({
       match: t => {
         let n = {};
@@ -5936,10 +5943,10 @@ function p$2(e) {
     })
   };
 }
-function y$1(...e) {
+function v$1(...e) {
   const r = "string" == typeof e[0] ? e[0] : void 0,
     i = 2 === e.length ? e[1] : "string" == typeof e[0] ? void 0 : e[0];
-  return u$2({
+  return a$2({
     [t$2]: () => ({
       match: t => {
         let e = {
@@ -5956,81 +5963,83 @@ function y$1(...e) {
     })
   });
 }
-function v$1(t) {
+function b$2(t) {
+  return true;
+}
+function w$2(t) {
   return "number" == typeof t;
 }
-function b$2(t) {
+function S$1(t) {
   return "string" == typeof t;
 }
-function w$2(t) {
+function j$1(t) {
   return "bigint" == typeof t;
 }
-const S$1 = u$2(p$2(function (t) {
-    return true;
-  })),
-  O = S$1,
-  j$1 = t => Object.assign(u$2(t), {
+const K = a$2(p$2(b$2)),
+  O = a$2(p$2(b$2)),
+  E = K,
+  x$1 = t => Object.assign(a$2(t), {
     startsWith: e => {
-      return j$1(m$1(t, (n = e, p$2(t => b$2(t) && t.startsWith(n)))));
+      return x$1(d$1(t, (n = e, p$2(t => S$1(t) && t.startsWith(n)))));
       var n;
     },
     endsWith: e => {
-      return j$1(m$1(t, (n = e, p$2(t => b$2(t) && t.endsWith(n)))));
+      return x$1(d$1(t, (n = e, p$2(t => S$1(t) && t.endsWith(n)))));
       var n;
     },
-    minLength: e => j$1(m$1(t, (t => p$2(e => b$2(e) && e.length >= t))(e))),
-    length: e => j$1(m$1(t, (t => p$2(e => b$2(e) && e.length === t))(e))),
-    maxLength: e => j$1(m$1(t, (t => p$2(e => b$2(e) && e.length <= t))(e))),
+    minLength: e => x$1(d$1(t, (t => p$2(e => S$1(e) && e.length >= t))(e))),
+    length: e => x$1(d$1(t, (t => p$2(e => S$1(e) && e.length === t))(e))),
+    maxLength: e => x$1(d$1(t, (t => p$2(e => S$1(e) && e.length <= t))(e))),
     includes: e => {
-      return j$1(m$1(t, (n = e, p$2(t => b$2(t) && t.includes(n)))));
+      return x$1(d$1(t, (n = e, p$2(t => S$1(t) && t.includes(n)))));
       var n;
     },
     regex: e => {
-      return j$1(m$1(t, (n = e, p$2(t => b$2(t) && Boolean(t.match(n))))));
+      return x$1(d$1(t, (n = e, p$2(t => S$1(t) && Boolean(t.match(n))))));
       var n;
     }
   }),
-  K = j$1(p$2(b$2)),
-  x$2 = t => Object.assign(u$2(t), {
-    between: (e, n) => x$2(m$1(t, ((t, e) => p$2(n => v$1(n) && t <= n && e >= n))(e, n))),
-    lt: e => x$2(m$1(t, (t => p$2(e => v$1(e) && e < t))(e))),
-    gt: e => x$2(m$1(t, (t => p$2(e => v$1(e) && e > t))(e))),
-    lte: e => x$2(m$1(t, (t => p$2(e => v$1(e) && e <= t))(e))),
-    gte: e => x$2(m$1(t, (t => p$2(e => v$1(e) && e >= t))(e))),
-    int: () => x$2(m$1(t, p$2(t => v$1(t) && Number.isInteger(t)))),
-    finite: () => x$2(m$1(t, p$2(t => v$1(t) && Number.isFinite(t)))),
-    positive: () => x$2(m$1(t, p$2(t => v$1(t) && t > 0))),
-    negative: () => x$2(m$1(t, p$2(t => v$1(t) && t < 0)))
+  A = x$1(p$2(S$1)),
+  N$1 = t => Object.assign(a$2(t), {
+    between: (e, n) => N$1(d$1(t, ((t, e) => p$2(n => w$2(n) && t <= n && e >= n))(e, n))),
+    lt: e => N$1(d$1(t, (t => p$2(e => w$2(e) && e < t))(e))),
+    gt: e => N$1(d$1(t, (t => p$2(e => w$2(e) && e > t))(e))),
+    lte: e => N$1(d$1(t, (t => p$2(e => w$2(e) && e <= t))(e))),
+    gte: e => N$1(d$1(t, (t => p$2(e => w$2(e) && e >= t))(e))),
+    int: () => N$1(d$1(t, p$2(t => w$2(t) && Number.isInteger(t)))),
+    finite: () => N$1(d$1(t, p$2(t => w$2(t) && Number.isFinite(t)))),
+    positive: () => N$1(d$1(t, p$2(t => w$2(t) && t > 0))),
+    negative: () => N$1(d$1(t, p$2(t => w$2(t) && t < 0)))
   }),
-  E = x$2(p$2(v$1)),
-  A = t => Object.assign(u$2(t), {
-    between: (e, n) => A(m$1(t, ((t, e) => p$2(n => w$2(n) && t <= n && e >= n))(e, n))),
-    lt: e => A(m$1(t, (t => p$2(e => w$2(e) && e < t))(e))),
-    gt: e => A(m$1(t, (t => p$2(e => w$2(e) && e > t))(e))),
-    lte: e => A(m$1(t, (t => p$2(e => w$2(e) && e <= t))(e))),
-    gte: e => A(m$1(t, (t => p$2(e => w$2(e) && e >= t))(e))),
-    positive: () => A(m$1(t, p$2(t => w$2(t) && t > 0))),
-    negative: () => A(m$1(t, p$2(t => w$2(t) && t < 0)))
+  P = N$1(p$2(w$2)),
+  k$1 = t => Object.assign(a$2(t), {
+    between: (e, n) => k$1(d$1(t, ((t, e) => p$2(n => j$1(n) && t <= n && e >= n))(e, n))),
+    lt: e => k$1(d$1(t, (t => p$2(e => j$1(e) && e < t))(e))),
+    gt: e => k$1(d$1(t, (t => p$2(e => j$1(e) && e > t))(e))),
+    lte: e => k$1(d$1(t, (t => p$2(e => j$1(e) && e <= t))(e))),
+    gte: e => k$1(d$1(t, (t => p$2(e => j$1(e) && e >= t))(e))),
+    positive: () => k$1(d$1(t, p$2(t => j$1(t) && t > 0))),
+    negative: () => k$1(d$1(t, p$2(t => j$1(t) && t < 0)))
   }),
-  P = A(p$2(w$2)),
-  T$1 = u$2(p$2(function (t) {
+  T = k$1(p$2(j$1)),
+  B = a$2(p$2(function (t) {
     return "boolean" == typeof t;
   })),
-  B = u$2(p$2(function (t) {
+  _ = a$2(p$2(function (t) {
     return "symbol" == typeof t;
   })),
-  _ = u$2(p$2(function (t) {
+  W = a$2(p$2(function (t) {
     return null == t;
   })),
-  k$1 = u$2(p$2(function (t) {
+  $$1 = a$2(p$2(function (t) {
     return null != t;
   }));
-var N$1 = {
+var z = {
   __proto__: null,
   matcher: t$2,
-  optional: l$2,
+  optional: h$2,
   array: function (...e) {
-    return h$2({
+    return l$2({
       [t$2]: () => ({
         match: t => {
           if (!Array.isArray(t)) return {
@@ -6060,7 +6069,7 @@ var N$1 = {
     });
   },
   set: function (...e) {
-    return u$2({
+    return a$2({
       [t$2]: () => ({
         match: t => {
           if (!(t instanceof Set)) return {
@@ -6088,7 +6097,7 @@ var N$1 = {
     });
   },
   map: function (...e) {
-    return u$2({
+    return a$2({
       [t$2]: () => ({
         match: t => {
           if (!(t instanceof Map)) return {
@@ -6121,10 +6130,39 @@ var N$1 = {
       })
     });
   },
-  intersection: m$1,
-  union: d$1,
+  record: function (...e) {
+    return a$2({
+      [t$2]: () => ({
+        match: t => {
+          if (null === t || "object" != typeof t || Array.isArray(t)) return {
+            matched: false
+          };
+          var n;
+          if (0 === e.length) throw new Error(`\`P.record\` wasn't given enough arguments. Expected (value) or (key, value), received ${null == (n = e[0]) ? void 0 : n.toString()}`);
+          let r = {};
+          const i = (t, e) => {
+              r[t] = (r[t] || []).concat([e]);
+            },
+            [s, c] = 1 === e.length ? [A, e[0]] : e;
+          return {
+            matched: m$1(t, (t, e) => {
+              const n = "string" != typeof t || Number.isNaN(Number(t)) ? null : Number(t),
+                r = null !== n && o$2(s, n, i),
+                u = o$2(s, t, i),
+                a = o$2(c, e, i);
+              return (u || r) && a;
+            }),
+            selections: r
+          };
+        },
+        getSelectionKeys: () => 0 === e.length ? [] : [...s$1(e[0]), ...s$1(e[1])]
+      })
+    });
+  },
+  intersection: d$1,
+  union: y$1,
   not: function (e) {
-    return u$2({
+    return a$2({
       [t$2]: () => ({
         match: t => ({
           matched: !o$2(e, t, () => {})
@@ -6135,26 +6173,27 @@ var N$1 = {
     });
   },
   when: p$2,
-  select: y$1,
-  any: S$1,
-  _: O,
-  string: K,
-  number: E,
-  bigint: P,
-  boolean: T$1,
-  symbol: B,
-  nullish: _,
-  nonNullable: k$1,
+  select: v$1,
+  any: K,
+  unknown: O,
+  _: E,
+  string: A,
+  number: P,
+  bigint: T,
+  boolean: B,
+  symbol: _,
+  nullish: W,
+  nonNullable: $$1,
   instanceOf: function (t) {
-    return u$2(p$2(function (t) {
+    return a$2(p$2(function (t) {
       return e => e instanceof t;
     }(t)));
   },
   shape: function (t) {
-    return u$2(p$2(a$2(t)));
+    return a$2(p$2(u$2(t)));
   }
 };
-class W extends Error {
+class I extends Error {
   constructor(t) {
     let e;
     try {
@@ -6165,14 +6204,14 @@ class W extends Error {
     super(`Pattern matching error: no pattern matches value ${e}`), this.input = void 0, this.input = t;
   }
 }
-const $$1 = {
+const L = {
   matched: false,
   value: void 0
 };
-function z(t) {
-  return new I(t, $$1);
+function M$2(t) {
+  return new R(t, L);
 }
-class I {
+class R {
   constructor(t, e) {
     this.input = void 0, this.state = void 0, this.input = t, this.state = e;
   }
@@ -6184,27 +6223,27 @@ class I {
     3 === t.length && "function" == typeof t[1] ? i = t[1] : t.length > 2 && r.push(...t.slice(1, t.length - 1));
     let s = false,
       c = {};
-    const a = (t, e) => {
+    const u = (t, e) => {
         s = true, c[t] = e;
       },
-      u = !r.some(t => o$2(t, this.input, a)) || i && !Boolean(i(this.input)) ? $$1 : {
+      a = !r.some(t => o$2(t, this.input, u)) || i && !Boolean(i(this.input)) ? L : {
         matched: true,
         value: e(s ? n$2 in c ? c[n$2] : c : this.input, this.input)
       };
-    return new I(this.input, u);
+    return new R(this.input, a);
   }
   when(t, e) {
     if (this.state.matched) return this;
     const n = Boolean(t(this.input));
-    return new I(this.input, n ? {
+    return new R(this.input, n ? {
       matched: true,
       value: e(this.input, this.input)
-    } : $$1);
+    } : L);
   }
   otherwise(t) {
     return this.state.matched ? this.state.value : t(this.input);
   }
-  exhaustive(t = L) {
+  exhaustive(t = F) {
     return this.state.matched ? this.state.value : t(this.input);
   }
   run() {
@@ -6217,34 +6256,377 @@ class I {
     return this;
   }
 }
-function L(t) {
-  throw new W(t);
+function F(t) {
+  throw new I(t);
 }
 
-function T(f, a, i, t, M) {
-  const h = Math.abs(i - f),
-    o = f < i ? 1 : -1,
-    e = -Math.abs(t - a),
-    l = a < t ? 1 : -1;
-  let r = h + e,
-    n;
-  for (;;) {
-    if (M(f, a), n = 2 * r, n >= e) {
-      if (f === i) break;
-      r += e, f += o;
-    }
-    if (n <= h) {
-      if (a === t) break;
-      r += h, a += l;
-    }
-  }
-}
-function x$1(f, a, i, t) {
-  var M = -i,
-    h = 0,
-    o = 2 - 2 * i;
-  do t(f - M, a + h), t(f - h, a - M), t(f + M, a - h), t(f + h, a + M), i = o, i <= h && (o += ++h * 2 + 1), (i > M || o > h) && (o += ++M * 2 + 1); while (M < 0);
-}
+var index_umd$1 = {exports: {}};
+
+var index_umd = index_umd$1.exports;
+(function (module, exports) {
+  (function (N, J) {
+    J(exports) ;
+  })(index_umd, function (N) {
+
+    function J(f, a, o, t, e) {
+      const h = Math.abs(o - f),
+        r = f < o ? 1 : -1,
+        l = -Math.abs(t - a),
+        M = a < t ? 1 : -1;
+      let i = h + l,
+        n;
+      for (;;) {
+        if (e(f, a), n = 2 * i, n >= l) {
+          if (f === o) break;
+          i += l, f += r;
+        }
+        if (n <= h) {
+          if (a === t) break;
+          i += h, a += M;
+        }
+      }
+    }
+    function U(f, a, o, t, e) {
+      const h = f < o ? 1 : -1,
+        r = a < t ? 1 : -1;
+      let l,
+        M = Math.abs(o - f),
+        i = Math.abs(t - a),
+        n = M * M + i * i,
+        c = n === 0 ? 1 : 1 / Math.sqrt(n);
+      for (M *= c, i *= c, n = M - i;;) {
+        if (e(f, a, Math.abs(n - (M + i)) >> 16), c = n, l = f, 2 * c >= -M) {
+          if (f === o) break;
+          c + i < 16711680 && e(f, a + r, c + i >> 16), n -= i, f += h;
+        }
+        if (2 * c <= i) {
+          if (a === t) break;
+          M - c < 16711680 && e(l + h, a, M - c >> 16), n += M, a += r;
+        }
+      }
+    }
+    function w(f, a, o, t, e, h) {
+      let r = Math.abs(o - f),
+        l = f < o ? 1 : -1,
+        M = Math.abs(t - a),
+        i = a < t ? 1 : -1,
+        n = r - M,
+        c,
+        q,
+        d,
+        b = r + M == 0 ? 1 : Math.sqrt(r * r + M * M);
+      for (e = (e + 1) / 2;;) {
+        if (h(f, a, Math.max(0, 255 * (Math.abs(n - r + M) / b - e + 1))), c = n, q = f, 2 * c >= -r) {
+          for (c += M, d = a; c < b * e && (t != d || r > M); c += r) h(f, d += i, Math.max(0, 255 * (Math.abs(c) / b - e + 1)));
+          if (f == o) break;
+          c = n, n -= M, f += l;
+        }
+        if (2 * c <= M) {
+          for (c = r - c; c < b * e && (o != q || r < M); c += M) h(q += l, a, Math.max(0, 255 * (Math.abs(c) / b - e + 1)));
+          if (a == t) break;
+          n += r, a += i;
+        }
+      }
+    }
+    function I(f, a = "assert error") {
+      if (!f) throw new Error(a);
+    }
+    function P(f, a, o, t, e, h, r, l) {
+      var M = f - 2 * o + e,
+        i = a - 2 * t + h,
+        n = f - o,
+        c = a - t,
+        q,
+        d,
+        b;
+      I(r >= 0, "width is negative"), n * (e - o) > 0 && (c * (h - t) > 0 && Math.abs(n * i) > Math.abs(c * M) && (f = e, e = n + o, a = h, h = c + t), f == e || r == 1 ? d = (f - o) / M : (b = Math.sqrt(4 * r * r * (f - o) * (e - o) + (e - f) * (e - f)), o < f && (b = -b), d = (2 * r * (f - o) - f + e + b) / (2 * (1 - r) * (e - f))), b = 1 / (2 * d * (1 - d) * (r - 1) + 1), n = (d * d * (f - 2 * r * o + e) + 2 * d * (r * o - f) + f) * b, c = (d * d * (a - 2 * r * t + h) + 2 * d * (r * t - a) + a) * b, q = d * (r - 1) + 1, q *= q * b, r = ((1 - d) * (r - 1) + 1) * Math.sqrt(b), M = Math.floor(n + .5), i = Math.floor(c + .5), c = (n - f) * (t - a) / (o - f) + a, H(f, a, M, Math.floor(c + .5), M, i, q, l), c = (n - e) * (t - h) / (o - e) + h, t = Math.floor(c + .5), f = o = M, a = i), (a - t) * (h - t) > 0 && (a == h || r == 1 ? d = (a - t) / (a - 2 * t + h) : (b = Math.sqrt(4 * r * r * (a - t) * (h - t) + (h - a) * (h - a)), t < a && (b = -b), d = (2 * r * (a - t) - a + h + b) / (2 * (1 - r) * (h - a))), b = 1 / (2 * d * (1 - d) * (r - 1) + 1), n = (d * d * (f - 2 * r * o + e) + 2 * d * (r * o - f) + f) * b, c = (d * d * (a - 2 * r * t + h) + 2 * d * (r * t - a) + a) * b, q = d * (r - 1) + 1, q *= q * b, r = ((1 - d) * (r - 1) + 1) * Math.sqrt(b), M = Math.floor(n + .5), i = Math.floor(c + .5), n = (o - f) * (c - a) / (t - a) + f, H(f, a, Math.floor(n + .5), i, M, i, q, l), n = (o - e) * (c - h) / (t - h) + e, o = Math.floor(n + .5), f = M, a = t = i), H(f, a, o, t, e, h, r * r, l);
+    }
+    function H(f, a, o, t, e, h, r, l) {
+      var M = e - o,
+        i = h - t,
+        n = f - e,
+        c = a - h,
+        q = f - o,
+        d = a - t,
+        b = q * i + d * M,
+        s = q * i - d * M,
+        u;
+      if (I(q * M <= 0 && d * i <= 0, "sign of gradient must not change"), s != 0 && r > 0) {
+        if (M * M + i * i > q * q + d * d && (e = f, f -= n, h = a, a -= c, s = -s), q = 2 * (4 * r * M * q + n * n), d = 2 * (4 * r * i * d + c * c), M = f < e ? 1 : -1, i = a < h ? 1 : -1, b = -2 * M * i * (2 * r * b + n * c), s * M * i < 0 && (q = -q, d = -d, b = -b, s = -s), n = 4 * r * (o - f) * i * s + q / 2 + b, c = 4 * r * (a - t) * M * s + d / 2 + b, r < .5 && (c > b || n < b)) {
+          s = (r + 1) / 2, r = Math.sqrt(r), b = 1 / (r + 1), M = Math.floor((f + 2 * r * o + e) * b / 2 + .5), i = Math.floor((a + 2 * r * t + h) * b / 2 + .5), n = Math.floor((r * o + f) * b + .5), c = Math.floor((t * r + a) * b + .5), H(f, a, n, c, M, i, s, l), n = Math.floor((r * o + e) * b + .5), c = Math.floor((t * r + h) * b + .5), H(M, i, n, c, e, h, s, l);
+          return;
+        }
+        u = n + c - b;
+        do {
+          if (l(f, a), f == e && a == h) return;
+          o = 2 * u > c ? 1 : 0, t = 2 * (u + d) < -c ? 1 : 0, (2 * u < n || t) && (a += i, c += b, u += n += q), (2 * u > n || o) && (f += M, n += b, u += c += d);
+        } while (c <= b && n >= b);
+      }
+      J(f, a, e, h, l);
+    }
+    function V(f, a, o, t, e, h, r, l) {
+      var M = e - o,
+        i = h - t,
+        n = f - e,
+        c = a - h,
+        q = f - o,
+        d = a - t,
+        b = q * i + d * M,
+        s = q * i - d * M,
+        u,
+        z,
+        j;
+      if (I(q * M <= 0 && d * i <= 0), s != 0 && r > 0) {
+        if (M * M + i * i > q * q + d * d && (e = f, f -= n, h = a, a -= c, s = -s), q = 2 * (4 * r * M * q + n * n), d = 2 * (4 * r * i * d + c * c), M = f < e ? 1 : -1, i = a < h ? 1 : -1, b = -2 * M * i * (2 * r * b + n * c), s * M * i < 0 && (q = -q, d = -d, s = -s, b = -b), n = 4 * r * (o - f) * i * s + q / 2 + b, c = 4 * r * (a - t) * M * s + d / 2 + b, r < .5 && c > n) return s = (r + 1) / 2, r = Math.sqrt(r), b = 1 / (r + 1), M = Math.floor((f + 2 * r * o + e) * b / 2 + .5), i = Math.floor((a + 2 * r * t + h) * b / 2 + .5), n = Math.floor((r * o + f) * b + .5), c = Math.floor((t * r + a) * b + .5), V(f, a, n, c, M, i, s, l), n = Math.floor((r * o + e) * b + .5), c = Math.floor((t * r + h) * b + .5), V(M, i, n, c, e, h, s, l);
+        u = n + c - b;
+        do {
+          if (s = Math.min(n - b, b - c), z = Math.max(n - b, b - c), z += 2 * z * s * s / (4 * z * z + s * s), o = 255 * Math.abs(u - n - c + b) / z, o < 256 && l(f, a, o), j = 2 * u + c < 0) {
+            if (a == h) return;
+            n - u < z && l(f + M, a, 255 * Math.abs(n - u) / z);
+          }
+          if (2 * u + n > 0) {
+            if (f == e) return;
+            u - c < z && l(f, a + i, 255 * Math.abs(u - c) / z), f += M, n += b, u += c += d;
+          }
+          j && (a += i, c += b, u += n += q);
+        } while (c < n);
+      }
+      U(f, a, e, h, l);
+    }
+    function y(f, a, o, t, e) {
+      let h = -o,
+        r = 0,
+        l = t * t,
+        M = h * (2 * l + h) + l;
+      do e(f - h, a + r), e(f + h, a + r), e(f + h, a - r), e(f - h, a - r), l = 2 * M, l >= (h * 2 + 1) * t * t && (M += (++h * 2 + 1) * t * t), l <= (r * 2 + 1) * o * o && (M += (++r * 2 + 1) * o * o); while (h <= 0);
+      for (; r++ < t;) e(f, a + r), e(f, a - r);
+    }
+    function x(f, a, o, t, e, h) {
+      let r = o * o,
+        l = t * t;
+      const M = Math.sin(e);
+      let i = (r - l) * M;
+      r = Math.sqrt(r - i * M), l = Math.sqrt(l + i * M), o = r + .5, t = l + .5, i = i * o * t / (r * l), Y(f - o, a - t, f + o, a + t, 4 * i * Math.cos(e), h);
+    }
+    function Y(f, a, o, t, e, h) {
+      let r = o - f,
+        l = t - a,
+        M = r * l;
+      if (e === 0) return Z(f, a, o, t, h);
+      M !== 0 && (M = (M - e) / (M + M)), I(M <= 1 && M >= 0, "limit angle to |zd|<=xd*yd"), r = Math.floor(r * M + .5), l = Math.floor(l * M + .5), H(f, a + l, f, a, f + r, a, 1 - M, h), H(f, a + l, f, t, o - r, t, M, h), H(o, t - l, o, t, o - r, t, 1 - M, h), H(o, t - l, o, a, f + r, a, M, h);
+    }
+    function Z(f, a, o, t, e) {
+      let h = Math.abs(o - f),
+        r = Math.abs(t - a),
+        l = r & 1,
+        M = 4 * (1 - h) * r * r,
+        i = 4 * (l + 1) * h * h,
+        n = M + i + l * h * h,
+        c;
+      f > o && (f = o, o += h), a > t && (a = t), a += (r + 1) / 2, t = a - l, h = 8 * h * h, l = 8 * r * r;
+      do e(o, a), e(f, a), e(f, t), e(o, t), c = 2 * n, c <= i && (a++, t--, n += i += h), (c >= M || 2 * n > i) && (f++, o--, n += M += l); while (f <= o);
+      for (; a - t <= r;) e(f - 1, a), e(o + 1, a++), e(f - 1, t), e(o + 1, t--);
+    }
+    function aa(f, a, o, t) {
+      var e = -o,
+        h = 0,
+        r = 2 - 2 * o;
+      do t(f - e, a + h), t(f - h, a - e), t(f + e, a - h), t(f + h, a + e), o = r, o <= h && (r += ++h * 2 + 1), (o > e || r > h) && (r += ++e * 2 + 1); while (e < 0);
+    }
+    function fa(f, a, o, t) {
+      var e = -o,
+        h = 0,
+        r,
+        l,
+        M,
+        i = 2 - 2 * o;
+      o = 1 - i;
+      do r = 255 * Math.abs(i - 2 * (e + h) - 2) / o, t(f - e, a + h, r), t(f - h, a - e, r), t(f + e, a - h, r), t(f + h, a + e, r), M = i, l = e, i + h > 0 && (r = 255 * (i - 2 * e - 1) / o, r < 256 && (t(f - e, a + h + 1, r), t(f - h - 1, a - e, r), t(f + e, a - h - 1, r), t(f + h + 1, a + e, r)), i += ++e * 2 + 1), M + l <= 0 && (r = 255 * (2 * h + 3 - M) / o, r < 256 && (t(f - l - 1, a + h, r), t(f - h, a - l - 1, r), t(f + l + 1, a - h, r), t(f + h, a + l + 1, r)), i += ++h * 2 + 1); while (e < 0);
+    }
+    function ta(f, a, o, t, e, h, r) {
+      var l = f - o,
+        M = a - t,
+        i = f - 2 * o + e,
+        n;
+      l * (e - o) > 0 && (M * (h - t) > 0 && Math.abs((a - 2 * t + h) / i * l) > Math.abs(M) && (f = e, e = l + o, a = h, h = M + t), i = (f - o) / i, n = (1 - i) * ((1 - i) * a + 2 * i * t) + i * i * h, i = (f * e - o * o) * i / (f - o), l = Math.floor(i + .5), M = Math.floor(n + .5), n = (t - a) * (i - f) / (o - f) + a, L(f, a, l, Math.floor(n + .5), l, M, r), n = (t - h) * (i - e) / (o - e) + h, f = o = l, a = M, t = Math.floor(n + .5)), (a - t) * (h - t) > 0 && (i = a - 2 * t + h, i = (a - t) / i, n = (1 - i) * ((1 - i) * f + 2 * i * o) + i * i * e, i = (a * h - t * t) * i / (a - t), l = Math.floor(n + .5), M = Math.floor(i + .5), n = (o - f) * (i - a) / (t - a) + f, L(f, a, Math.floor(n + .5), M, l, M, r), n = (o - e) * (i - h) / (t - h) + e, f = l, o = Math.floor(n + .5), a = t = M), L(f, a, o, t, e, h, r);
+    }
+    function L(f, a, o, t, e, h, r) {
+      var l = e - o,
+        M = h - t,
+        i = f - o,
+        n = a - t,
+        c,
+        q,
+        d,
+        b,
+        s = i * M - n * l;
+      if (I(i * l <= 0 && n * M <= 0, "sign of gradient must not change"), l * l + M * M > i * i + n * n && (e = f, f = l + o, h = a, a = M + t, s = -s), s != 0) {
+        i += l, i *= l = f < e ? 1 : -1, n += M, n *= M = a < h ? 1 : -1, c = 2 * i * n, i *= i, n *= n, s * l * M < 0 && (i = -i, n = -n, c = -c, s = -s), q = 4 * M * s * (o - f) + i - c, d = 4 * l * s * (a - t) + n - c, i += i, n += n, b = q + d + c;
+        do {
+          if (r(f, a), f == e && a == h) return;
+          t = +(2 * b < q), 2 * b > d && (f += l, q -= c, b += d += n), t && (a += M, d -= c, b += q += i);
+        } while (d < 0 && q > 0);
+      }
+      J(f, a, e, h, r);
+    }
+    function ia(f, a, o, t, e, h, r) {
+      var l = f - o,
+        M = a - t,
+        i = f - 2 * o + e,
+        n;
+      l * (e - o) > 0 && (M * (h - t) > 0 && Math.abs((a - 2 * t + h) / i * l) > Math.abs(M) && (f = e, e = l + o, a = h, h = M + t), i = (f - o) / i, n = (1 - i) * ((1 - i) * a + 2 * i * t) + i * i * h, i = (f * e - o * o) * i / (f - o), l = Math.floor(i + .5), M = Math.floor(n + .5), n = (t - a) * (i - f) / (o - f) + a, Q(f, a, l, Math.floor(n + .5), l, M, r), n = (t - h) * (i - e) / (o - e) + h, f = o = l, a = M, t = Math.floor(n + .5)), (a - t) * (h - t) > 0 && (i = a - 2 * t + h, i = (a - t) / i, n = (1 - i) * ((1 - i) * f + 2 * i * o) + i * i * e, i = (a * h - t * t) * i / (a - t), l = Math.floor(n + .5), M = Math.floor(i + .5), n = (o - f) * (i - a) / (t - a) + f, Q(f, a, Math.floor(n + .5), M, l, M, r), n = (o - e) * (i - h) / (t - h) + e, f = l, o = Math.floor(n + .5), a = t = M), Q(f, a, o, t, e, h, r);
+    }
+    function Q(f, a, o, t, e, h, r) {
+      var l = e - o,
+        M = h - t,
+        i = f - o,
+        n = a - t,
+        c,
+        q,
+        d,
+        b,
+        s,
+        u = i * M - n * l;
+      if (l * l + M * M > i * i + n * n && (e = f, f = l + o, h = a, a = M + t, u = -u), u != 0) {
+        i += l, i *= l = f < e ? 1 : -1, n += M, n *= M = a < h ? 1 : -1, c = 2 * i * n, i *= i, n *= n, u * l * M < 0 && (i = -i, n = -n, c = -c, u = -u), q = 4 * M * (o - f) * u + i - c, d = 4 * l * (a - t) * u + n - c, i += i, n += n, b = q + d + c;
+        do {
+          if (u = Math.min(q + c, -c - d), s = Math.max(q + c, -c - d), s += 2 * s * u * u / (4 * s * s + u * u), r(f, a, 255 * Math.abs(b - q - d - c) / s), f == e || a == h) break;
+          o = f, u = q - b, t = +(2 * b + d < 0), 2 * b + q > 0 && (b - d < s && r(f, a + M, 255 * Math.abs(b - d) / s), f += l, q -= c, b += d += n), t && (u < s && r(o + l, a, 255 * Math.abs(u) / s), a += M, d -= c, b += q += i);
+        } while (d < q);
+      }
+      U(f, a, e, h, r);
+    }
+    function _(f, a, o, t, e, h, r, l, M) {
+      var i,
+        n,
+        c,
+        q = 1;
+      let d = f < r ? 1 : -1,
+        b = a < l ? 1 : -1,
+        s = -Math.abs(f + o - e - r),
+        u = s - 4 * d * (o - e),
+        z = d * (f - o - e + r),
+        j = -Math.abs(a + t - h - l),
+        B = j - 4 * b * (t - h),
+        R = b * (a - t - h + l),
+        p,
+        S,
+        W,
+        T,
+        G,
+        E,
+        O,
+        v,
+        g,
+        k,
+        F,
+        D = .01;
+      if (I((o - f) * (e - r) < D && ((r - f) * (o - e) < D || z * z < u * s + D), "slope change"), I((t - a) * (h - l) < D && ((l - a) * (t - h) < D || R * R < B * j + D), "slope change"), u == 0 && B == 0) return d = Math.floor((3 * o - f + 1) / 2), b = Math.floor((3 * t - a + 1) / 2), L(f, a, d, b, r, l, M);
+      o = (o - f) * (o - f) + (t - a) * (t - a) + 1, e = (e - r) * (e - r) + (h - l) * (h - l) + 1;
+      do {
+        p = u * R - z * B, S = u * j - s * B, W = z * j - s * R, k = p * (p + S - 3 * W) + S * S, i = k > 0 ? 1 : Math.sqrt(1 + 1024 / o), p *= i, S *= i, W *= i, k *= i * i, E = 9 * (p + S + W) / 8, T = 8 * (u - B), v = 27 * (8 * p * (R * R - B * j) + k * (B + 2 * R + j)) / 64 - B * B * (E - B), g = 27 * (8 * p * (z * z - u * s) - k * (u + 2 * z + s)) / 64 - u * u * (E + u), G = 3 * (3 * p * (3 * R * R - B * B - 2 * B * j) - B * (3 * S * (B + R) + B * T)) / 4, O = 3 * (3 * p * (3 * z * z - u * u - 2 * u * s) - u * (3 * S * (u + z) + u * T)) / 4, E = u * B * (6 * p + 6 * S - 3 * W + T), S = B * B, T = u * u, E = 3 * (E + 9 * i * (T * R * j - z * s * S) - 18 * z * R * p) / 8, k < 0 && (v = -v, g = -g, G = -G, O = -O, E = -E, S = -S, T = -T), p = 6 * B * S, S = -6 * u * S, W = 6 * B * T, T = -6 * u * T, v += E, k = v + g, g += E;
+        a: for (F = E, n = c = i; f != r && a != l;) {
+          M(f, a);
+          do {
+            if (v > F || g < F) break a;
+            t = 2 * k - g, 2 * k >= v && (n--, k += v += G, g += E += S, O += W, G += p), t <= 0 && (c--, k += g += O, v += E += W, G += S, O += T);
+          } while (n > 0 && c > 0);
+          2 * n <= i && (f += d, n += i), 2 * c <= i && (a += b, c += i), F == E && v < 0 && g > 0 && (F = D);
+        }
+        G = f, f = r, r = G, d = -d, z = -z, O = a, a = l, l = O, b = -b, R = -R, o = e;
+      } while (q--);
+      J(f, a, r, l, M);
+    }
+    function $(f, a, o, t, e, h, r, l, M) {
+      let i,
+        n,
+        c,
+        q = 1,
+        d = f < r ? 1 : -1,
+        b = a < l ? 1 : -1,
+        s = -Math.abs(f + o - e - r),
+        u = s - 4 * d * (o - e),
+        z = d * (f - o - e + r),
+        j = -Math.abs(a + t - h - l),
+        B = j - 4 * b * (t - h),
+        R = b * (a - t - h + l),
+        p,
+        S,
+        W,
+        T,
+        G,
+        E,
+        O,
+        v,
+        g,
+        k,
+        F,
+        D,
+        C,
+        A;
+      const K = .01;
+      if (I((o - f) * (e - r) < K && ((r - f) * (o - e) < K || z * z < u * s + K)), I((t - a) * (h - l) < K && ((l - a) * (t - h) < K || R * R < B * j + K)), u === 0 && B === 0) return d = Math.floor((3 * o - f + 1) / 2), b = Math.floor((3 * t - a + 1) / 2), Q(f, a, d, b, r, l, M);
+      o = (o - f) * (o - f) + (t - a) * (t - a) + 1, e = (e - r) * (e - r) + (h - l) * (h - l) + 1;
+      do {
+        p = u * R - z * B, S = u * j - s * B, W = z * j - s * R, A = 4 * p * W - S * S, k = p * (p + S - 3 * W) + S * S, i = k > 0 ? 1 : Math.sqrt(1 + 1024 / o), p *= i, S *= i, W *= i, k *= i * i, E = 9 * (p + S + W) / 8, T = 8 * (u - B), v = 27 * (8 * p * (R * R - B * j) + k * (B + 2 * R + j)) / 64 - B * B * (E - B), g = 27 * (8 * p * (z * z - u * s) - k * (u + 2 * z + s)) / 64 - u * u * (E + u), G = 3 * (3 * p * (3 * R * R - B * B - 2 * B * j) - B * (3 * S * (B + R) + B * T)) / 4, O = 3 * (3 * p * (3 * z * z - u * u - 2 * u * s) - u * (3 * S * (u + z) + u * T)) / 4, E = u * B * (6 * p + 6 * S - 3 * W + T), S = B * B, T = u * u, E = 3 * (E + 9 * i * (T * R * j - z * s * S) - 18 * z * R * p) / 8, k < 0 && (v = -v, g = -g, G = -G, O = -O, E = -E, S = -S, T = -T), p = 6 * B * S, S = -6 * u * S, W = 6 * B * T, T = -6 * u * T, v += E, k = v + g, g += E;
+        let X = false;
+        a: for (n = c = i; f !== r && a !== l;) {
+          t = Math.min(Math.abs(E - v), Math.abs(g - E)), C = Math.max(Math.abs(E - v), Math.abs(g - E)), C = i * (C + 2 * C * t * t / (4 * C * C + t * t)), t = 255 * Math.abs(k - (i - n + 1) * v - (i - c + 1) * g + i * E) / C, t < 256 && M(f, a, t), F = Math.abs(k - (i - n + 1) * v + (c - 1) * g), D = Math.abs(k + (n - 1) * v - (i - c + 1) * g), h = a;
+          do {
+            if (A >= -K && (v + G > E || g + O < E)) {
+              X = true;
+              break a;
+            }
+            if (t = 2 * k + v, 2 * k + g > 0) n--, k += v += G, g += E += S, O += W, G += p;else if (t > 0) {
+              X = true;
+              break a;
+            }
+            t <= 0 && (c--, k += g += O, v += E += W, G += S, O += T);
+          } while (n > 0 && c > 0);
+          2 * c <= i && (D < C && M(f + d, a, 255 * D / C), a += b, c += i), 2 * n <= i && (F < C && M(f, h + b, 255 * F / C), f += d, n += i);
+        }
+        X && (2 * k < g && 2 * c <= i + 2 && (D < C && M(f + d, a, 255 * D / C), a += b), 2 * k > v && 2 * n <= i + 2 && (F < C && M(f, h + b, 255 * F / C), f += d), G = f, f = r, r = G, d = -d, z = -z, O = a, a = l, l = O, b = -b, R = -R, o = e);
+        break;
+      } while (q--);
+      U(Math.floor(f), Math.floor(a), Math.floor(r), Math.floor(l), M);
+    }
+    function m(f, a, o, t, e, h, r, l, M, i) {
+      let n = 0,
+        c = 0,
+        q = f + o - e - r,
+        d = q - 4 * (o - e),
+        b = f - o - e + r,
+        s = b + 4 * (o + e),
+        u = a + t - h - l,
+        z = u - 4 * (t - h),
+        j = a - t - h + l,
+        B = j + 4 * (t + h);
+      var R = f,
+        p,
+        S,
+        W,
+        T = a,
+        G,
+        E,
+        O;
+      let v = b * b - d * q,
+        g;
+      const k = [0, 0, 0, 0, 0];
+      for (d == 0 ? Math.abs(q) < 2 * Math.abs(b) && (k[n++] = q / (2 * b)) : v > 0 && (g = Math.sqrt(v), v = (b - g) / d, Math.abs(v) < 1 && (k[n++] = v), v = (b + g) / d, Math.abs(v) < 1 && (k[n++] = v)), v = j * j - z * u, z == 0 ? Math.abs(u) < 2 * Math.abs(j) && (k[n++] = u / (2 * j)) : v > 0 && (g = Math.sqrt(v), v = (j - g) / z, Math.abs(v) < 1 && (k[n++] = v), v = (j + g) / z, Math.abs(v) < 1 && (k[n++] = v)), c = 1; c < n; c++) (v = k[c - 1]) > k[c] && (k[c - 1] = k[c], k[c] = v, c = 0);
+      for (v = -1, k[n] = 1, c = 0; c <= n; c++) g = k[c], p = (v * (v * b - 2 * q) - g * (v * (v * d - 2 * b) + q) + s) / 8 - R, G = (v * (v * j - 2 * u) - g * (v * (v * z - 2 * j) + u) + B) / 8 - T, S = (g * (g * b - 2 * q) - v * (g * (g * d - 2 * b) + q) + s) / 8 - R, E = (g * (g * j - 2 * u) - v * (g * (g * z - 2 * j) + u) + B) / 8 - T, R -= W = (g * (g * (3 * b - g * d) - 3 * q) + s) / 8, T -= O = (g * (g * (3 * j - g * z) - 3 * u) + B) / 8, r = Math.floor(W + .5), l = Math.floor(O + .5), R != 0 && (p *= R = (f - r) / R, S *= R), T != 0 && (G *= T = (a - l) / T, E *= T), (f != r || a != l) && M(f, a, f + p, a + G, f + S, a + E, r, l, i), f = r, a = l, R = W, T = O, v = g;
+    }
+    function ra(f, a, o, t, e, h, r, l, M) {
+      m(f, a, o, t, e, h, r, l, _, M);
+    }
+    function oa(f, a, o, t, e, h, r, l, M) {
+      m(f, a, o, t, e, h, r, l, $, M);
+    }
+    N.circle = aa, N.circleAA = fa, N.cubicBezier = ra, N.cubicBezierAA = oa, N.cubicBezierSegment = _, N.cubicBezierSegmentAA = $, N.ellipse = y, N.ellipseRect = Z, N.line = J, N.lineAA = U, N.lineWidth = w, N.quadBezier = ta, N.quadBezierAA = ia, N.quadBezierSegment = L, N.quadBezierSegmentAA = Q, N.quadRationalBezier = P, N.quadRationalBezierSegment = H, N.quadRationalBezierSegmentAA = V, N.rotatedEllipse = x, N.rotatedEllipseRect = Y, Object.defineProperty(N, Symbol.toStringTag, {
+      value: "Module"
+    });
+  });
+})(index_umd$1, index_umd$1.exports);
+var index_umdExports = index_umd$1.exports;
 
 /**
  * Remove duplicate points from array.
@@ -6271,7 +6653,7 @@ function deleteDuplicates(points) {
  */
 function getCirclePoints(radius) {
   const circlePoints = [];
-  x$1(radius, radius, radius, (column, row) => {
+  index_umdExports.circle(radius, radius, radius, (column, row) => {
     circlePoints.push({
       row: row - radius,
       column: column - radius
@@ -6307,7 +6689,7 @@ function getFilledCirclePoints(radius, center = zeroPoint) {
   if (radius === 1) {
     circlePoints.push(center);
   }
-  x$1(center.column, center.row, radius, (column, row) => {
+  index_umdExports.circle(center.column, center.row, radius, (column, row) => {
     circlePoints.push({
       row,
       column
@@ -6341,7 +6723,7 @@ function getFilledCirclePoints(radius, center = zeroPoint) {
  */
 function getLinePoints(from, to) {
   const linePoints = [];
-  T(from.column, from.row, to.column, to.row, (column, row) => {
+  index_umdExports.line(from.column, from.row, to.column, to.row, (column, row) => {
     linePoints.push({
       row,
       column
@@ -6356,7 +6738,7 @@ function getLinePoints(from, to) {
  * @returns The coordinates of the compass points.
  */
 function getCompassPoints(radius) {
-  x$1(radius, radius, radius, (column, row) => {
+  index_umdExports.circle(radius, radius, radius, (column, row) => {
   });
   return [{
     row: 0,
@@ -6667,7 +7049,7 @@ function getFastKeypoints(image, options = {}) {
     channels: [1],
     alpha: false
   });
-  const getScore = z(scoreAlgorithm).with('HARRIS', () => {
+  const getScore = M$2(scoreAlgorithm).with('HARRIS', () => {
     return (image, corner) => getHarrisScore(image, corner, harrisScoreOptions);
   }).with('FAST', () => {
     return (image, corner) => getFastScore(image, corner, threshold, circlePoints);
@@ -8049,11 +8431,13 @@ function bruteForceOneMatch(source, destination, options = {}) {
  * @returns Sorted copy of the array of matches.
  */
 function sortBySourceDest(matches) {
-  return matches.slice().sort((match1, match2) => {
+  const sorted = matches.slice();
+  sorted.sort((match1, match2) => {
     if (match1.sourceIndex < match2.sourceIndex) return -1;
     if (match1.sourceIndex > match2.sourceIndex) return 1;
     return match1.destinationIndex - match2.destinationIndex;
   });
+  return sorted;
 }
 /**
  * Sort array of matches by destination index and then source index.
@@ -8061,11 +8445,13 @@ function sortBySourceDest(matches) {
  * @returns Sorted copy of the array of matches.
  */
 function sortByDestSource(matches) {
-  return matches.slice().sort((match1, match2) => {
+  const sorted = matches.slice();
+  sorted.sort((match1, match2) => {
     if (match1.destinationIndex < match2.destinationIndex) return -1;
     if (match1.destinationIndex > match2.destinationIndex) return 1;
     return match1.sourceIndex - match2.sourceIndex;
   });
+  return sorted;
 }
 
 /**
@@ -8268,7 +8654,7 @@ function computePsnr(image, otherImage) {
  * @returns Default color.
  */
 function getDefaultColor(image) {
-  return z(image.colorModel).with('GREY', () => [0]).with('GREYA', () => [0, image.maxValue]).with('RGB', () => [0, 0, 0]).with('RGBA', () => [0, 0, 0, image.maxValue]).with('BINARY', () => [1]).exhaustive();
+  return M$2(image.colorModel).with('GREY', () => [0]).with('GREYA', () => [0, image.maxValue]).with('RGB', () => [0, 0, 0]).with('RGBA', () => [0, 0, 0, image.maxValue]).with('BINARY', () => [1]).exhaustive();
 }
 
 /**
@@ -8356,7 +8742,7 @@ function drawCircleOnImage(image, center, radius, options = {}) {
     return newImage;
   }
   if (!fillColor) {
-    x$1(center.column, center.row, radius, (column, row) => {
+    index_umdExports.circle(center.column, center.row, radius, (column, row) => {
       setBlendedVisiblePixel(newImage, column, row, strokeColor);
     });
   } else {
@@ -8366,7 +8752,7 @@ function drawCircleOnImage(image, center, radius, options = {}) {
     //Starting points for the top and bottom row of the circle.
     let prevRow = center.row + radius;
     let index = 0;
-    x$1(center.column, center.row, radius, (column, row) => {
+    index_umdExports.circle(center.column, center.row, radius, (column, row) => {
       setBlendedVisiblePixel(newImage, column, row, strokeColor);
       // Filling the first line of the circle.
       if (index === 0) {
@@ -8439,7 +8825,7 @@ function drawLineOnImage(image, from, to, options = {}) {
   checkProcessable$1(newImage, {
     bitDepth: [8, 16]
   });
-  T(Math.round(origin.column + from.column), Math.round(origin.row + from.row), Math.round(origin.column + to.column), Math.round(origin.row + to.row), (column, row) => {
+  index_umdExports.line(Math.round(origin.column + from.column), Math.round(origin.row + from.row), Math.round(origin.column + to.column), Math.round(origin.row + to.row), (column, row) => {
     setBlendedVisiblePixel(newImage, column, row, strokeColor);
   });
   return newImage;
@@ -8463,7 +8849,7 @@ function drawLineOnMask(mask, from, to, options = {}) {
   const newMask = maskToOutputMask(mask, options, {
     clone: true
   });
-  T(Math.round(origin.column + from.column), Math.round(origin.row + from.row), Math.round(origin.column + to.column), Math.round(origin.row + to.row), (column, row) => {
+  index_umdExports.line(Math.round(origin.column + from.column), Math.round(origin.row + from.row), Math.round(origin.column + to.column), Math.round(origin.row + to.row), (column, row) => {
     newMask.setVisiblePixel(column, row, [1]);
   });
   return newMask;
@@ -9569,7 +9955,7 @@ const BorderType = {
  * @returns The border interpolation function.
  */
 function getBorderInterpolation(type, value) {
-  return z(type).with('constant', () => getInterpolateConstant(value)).with('replicate', () => interpolateReplicate).with('reflect', () => interpolateReflect).with('reflect101', () => interpolateReflect101).with('wrap', () => interpolateWrap).exhaustive();
+  return M$2(type).with('constant', () => getInterpolateConstant(value)).with('replicate', () => interpolateReplicate).with('reflect', () => interpolateReflect).with('reflect101', () => interpolateReflect101).with('wrap', () => interpolateWrap).exhaustive();
 }
 function checkRange(point, length) {
   if (point <= 0 - length || point >= length + length - 1) {
@@ -9969,7 +10355,7 @@ function derivativeFilter(image, options = {}) {
   const {
     filter = 'sobel'
   } = options;
-  const kernels = z(filter).with('sobel', () => ({
+  const kernels = M$2(filter).with('sobel', () => ({
     kernelX: SOBEL_X,
     kernelY: SOBEL_Y
   })).with('scharr', () => ({
@@ -11553,7 +11939,7 @@ function computeThreshold(image, options = {}) {
     slots
   });
   const scale = slots ? 2 ** image.bitDepth / slots : 1;
-  return z(algorithm).with('huang', () => huang(histogram) * scale).with('intermodes', () => intermodes(histogram) * scale).with('isodata', () => isodata(histogram) * scale).with('li', () => li(histogram, image.size) * scale).with('maxEntropy', () => maxEntropy(histogram, image.size) * scale).with('mean', () => mean$1(histogram, image.size) * scale).with('minimum', () => minimum(histogram) * scale).with('minError', () => minError(histogram, image.size) * scale).with('moments', () => moments(histogram, image.size) * scale).with('otsu', () => otsu(histogram, image.size) * scale).with('percentile', () => percentile(histogram) * scale).with('renyiEntropy', () => renyiEntropy(histogram, image.size) * scale).with('shanbhag', () => shanbhag(histogram, image.size) * scale).with('triangle', () => triangle(histogram) * scale).with('yen', () => yen(histogram, image.size) * scale).exhaustive();
+  return M$2(algorithm).with('huang', () => huang(histogram) * scale).with('intermodes', () => intermodes(histogram) * scale).with('isodata', () => isodata(histogram) * scale).with('li', () => li(histogram, image.size) * scale).with('maxEntropy', () => maxEntropy(histogram, image.size) * scale).with('mean', () => mean$1(histogram, image.size) * scale).with('minimum', () => minimum(histogram) * scale).with('minError', () => minError(histogram, image.size) * scale).with('moments', () => moments(histogram, image.size) * scale).with('otsu', () => otsu(histogram, image.size) * scale).with('percentile', () => percentile(histogram) * scale).with('renyiEntropy', () => renyiEntropy(histogram, image.size) * scale).with('shanbhag', () => shanbhag(histogram, image.size) * scale).with('triangle', () => triangle(histogram) * scale).with('yen', () => yen(histogram, image.size) * scale).exhaustive();
 }
 // See: https://docs.opencv.org/4.0.1/d7/d1b/group__imgproc__misc.html#gaa9e58d2860d4afa658ef70a9b1115576
 /**
@@ -12064,7 +12450,7 @@ const InterpolationType = {
  * @returns The interpolation function.
  */
 function getInterpolationFunction(interpolationType) {
-  return z(interpolationType).with('nearest', () => interpolateNearest).with('bilinear', () => interpolateBilinear).with('bicubic', () => interpolateBicubic).exhaustive();
+  return M$2(interpolationType).with('nearest', () => interpolateNearest).with('bilinear', () => interpolateBilinear).with('bicubic', () => interpolateBicubic).exhaustive();
 }
 /**
  * Interpolate using nearest neighbor.
@@ -13567,7 +13953,8 @@ function monotoneChainConvexHull(points, options = {}) {
     sorted = false
   } = options;
   if (!sorted) {
-    points = points.slice().sort(byXThenY);
+    points = points.slice();
+    points.sort(byXThenY);
   }
   const n = points.length;
   const result = new Array(n * 2);
@@ -13830,7 +14217,8 @@ const topFirst = (mbrPoint1, mbrPoint2) => mbrPoint1.row >= mbrPoint2.row ? -1 :
  * @returns The angle in degrees.
  */
 function getMbrAngle(mbr) {
-  const sorted = mbr.slice().sort(leftFirst);
+  const sorted = mbr.slice();
+  sorted.sort(leftFirst);
   const left = sorted.slice(0, 2);
   const right = sorted.slice(2, 4);
   left.sort(topFirst);
@@ -15015,7 +15403,7 @@ class Mask {
   }
   /**
    * Get the number of pixels that do not have the value 0.
-   * @returns
+   * @returns The number of non-zero pixels.
    */
   getNbNonZeroPixels() {
     let count = 0;
@@ -16788,7 +17176,7 @@ class Image {
    * @returns Coordinates of the point in the format [column, row].
    */
   getCoordinates(coordinates, round = false) {
-    return z(coordinates).with('center', () => {
+    return M$2(coordinates).with('center', () => {
       const centerX = (this.width - 1) / 2;
       const centerY = (this.height - 1) / 2;
       if (round) {
@@ -17207,7 +17595,7 @@ class Image {
  */
 function createPixelArray(size, channels, alpha, bitDepth, maxValue) {
   const length = channels * size;
-  const arr = z(bitDepth).with(8, () => new Uint8Array(length)).with(16, () => new Uint16Array(length)).otherwise(() => {
+  const arr = M$2(bitDepth).with(8, () => new Uint8Array(length)).with(16, () => new Uint16Array(length)).otherwise(() => {
     throw new RangeError(`invalid bitDepth: ${bitDepth}`);
   });
   // Alpha channel is 100% by default.
@@ -17536,9 +17924,11 @@ function getMatchColor(matches, index, colors) {
  * @returns Sorted copy of the array of matches.
  */
 function sortByDistance(matches) {
-  return matches.slice().sort((match1, match2) => {
+  const sorted = matches.slice();
+  sorted.sort((match1, match2) => {
     return match1.distance - match2.distance;
   });
+  return sorted;
 }
 
 /**
@@ -17797,7 +18187,8 @@ function filterEuclideanDistance(matches, sourceKeypoints, destinationKeypoints,
       row: 0
     }
   } = options;
-  const sorted = matches.sort((a, b) => a.destinationIndex - b.destinationIndex);
+  const sorted = matches.slice();
+  sorted.sort((a, b) => a.destinationIndex - b.destinationIndex);
   const result = [];
   let sameDestMatches = [];
   let currentIndex = sorted[0].destinationIndex;
@@ -17805,12 +18196,14 @@ function filterEuclideanDistance(matches, sourceKeypoints, destinationKeypoints,
     if (match.destinationIndex === currentIndex) {
       sameDestMatches.push(match);
     } else {
-      result.push(...sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b)).slice(0, 1));
+      sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b));
+      result.push(...sameDestMatches.slice(0, 1));
       currentIndex = match.destinationIndex;
       sameDestMatches = [match];
     }
   }
-  result.push(...sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b)).slice(0, 1));
+  sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b));
+  result.push(...sameDestMatches.slice(0, 1));
   return result;
   function distanceSquared(match) {
     return (sourceKeypoints[match.sourceIndex].origin.row - (destinationKeypoints[match.destinationIndex].origin.row - origin.row)) ** 2 + (sourceKeypoints[match.sourceIndex].origin.column - destinationKeypoints[match.destinationIndex].origin.column - origin.column) ** 2;
@@ -17823,7 +18216,7 @@ function filterEuclideanDistance(matches, sourceKeypoints, destinationKeypoints,
  * @param encoding - Text encoding
  * @returns The decoded text
  */
-function decode$3(bytes, encoding = 'utf8') {
+function decode$4(bytes, encoding = 'utf8') {
   const decoder = new TextDecoder(encoding);
   return decoder.decode(bytes);
 }
@@ -18219,7 +18612,7 @@ class IOBuffer {
    * @returns The decoded string.
    */
   readUtf8(n = 1) {
-    return decode$3(this.readBytes(n));
+    return decode$4(this.readBytes(n));
   }
   /**
    * Read the next `n` bytes, return a string decoded with `encoding` and move pointer
@@ -18230,7 +18623,7 @@ class IOBuffer {
    * @returns The decoded string.
    */
   decodeText(n = 1, encoding = 'utf8') {
-    return decode$3(this.readBytes(n), encoding);
+    return decode$4(this.readBytes(n), encoding);
   }
   /**
    * Write 0xff if the passed value is truthy, 0x00 otherwise and move pointer
@@ -18451,6 +18844,117 @@ class IOBuffer {
   }
 }
 
+class BMPDecoder {
+  bufferData;
+  pixelDataOffset;
+  width;
+  height;
+  bitsPerPixel;
+  xPixelsPerMeter;
+  yPixelsPerMeter;
+  compression;
+  colorMasks;
+  constructor(bufferData) {
+    this.bufferData = new IOBuffer(bufferData);
+    const formatCheck = this.bufferData.readBytes(2);
+    if (formatCheck[0] !== 0x42 && formatCheck[1] !== 0x4d) {
+      throw new Error('This is not a BMP image or the encoding is not correct.');
+    }
+    this.pixelDataOffset = this.bufferData.skip(8).readUint32();
+    this.width = this.bufferData.skip(4).readUint32();
+    this.height = this.bufferData.readUint32();
+    this.bitsPerPixel = this.bufferData.seek(28).readUint16();
+    if (this.bitsPerPixel !== 1 && this.bitsPerPixel !== 8 && this.bitsPerPixel !== 24 && this.bitsPerPixel !== 32) {
+      throw new Error(`Invalid number of bits per pixel. Supported number of bits per pixel: 1, 8, 24, 32. Received: ${this.bitsPerPixel}`);
+    }
+    this.compression = this.bufferData.readUint32();
+    if (this.compression !== 0 && this.compression !== 3) {
+      throw new Error(`Only BI_RGB and BI_BITFIELDS compression methods are allowed. `);
+    }
+    this.colorMasks = [this.bufferData.seek(54).readUint32(), this.bufferData.readUint32(), this.bufferData.readUint32()];
+    if (this.bitsPerPixel === 32 && (this.colorMasks[0] !== 0x00ff0000 || this.colorMasks[1] !== 0x0000ff00 || this.colorMasks[2] !== 0x000000ff)) {
+      throw new Error(`Unsupported color masks detected in 32-bit BMP image. Only standard RGBA (${0x00ff0000.toString(16)}, ${0x0000ff00.toString(16)}, ${0x000000ff.toString(16)}) masks are supported. Received: ${this.colorMasks[0].toString(16)},${this.colorMasks[1].toString(16)},${this.colorMasks[2].toString(16)}.`);
+    }
+    this.bufferData.skip(1); // skipping image size.
+    this.xPixelsPerMeter = this.bufferData.seek(38).readInt32();
+    this.yPixelsPerMeter = this.bufferData.readInt32();
+    this.bufferData.skip(1);
+  }
+  decode() {
+    this.bufferData.seek(this.pixelDataOffset);
+    this.bufferData.setBigEndian();
+    const channels = Math.ceil(this.bitsPerPixel / 8);
+    const components = channels % 2 === 0 ? channels - 1 : channels;
+    const data = this.decodePixelData(channels, components);
+    return {
+      width: this.width,
+      height: this.height,
+      bitsPerPixel: this.bitsPerPixel,
+      compression: this.compression,
+      colorMasks: this.colorMasks,
+      channels,
+      components,
+      data,
+      yPixelsPerMeter: this.yPixelsPerMeter,
+      xPixelsPerMeter: this.xPixelsPerMeter
+    };
+  }
+  decodePixelData(channels, components) {
+    const data = new Uint8Array(this.height * this.width * channels);
+    if (this.bitsPerPixel === 1) {
+      this.decodeBitDepth1Pixels(data);
+    } else if (channels === components) {
+      this.decodeStandardPixels(data, channels);
+    } else {
+      this.decodePixelsWithAlpha(data, channels, components);
+    }
+    return data;
+  }
+  decodeBitDepth1Pixels(data) {
+    let currentNumber = 0;
+    for (let row = 0; row < this.height; row++) {
+      for (let col = 0; col < this.width; col++) {
+        const bitIndex = col % 32;
+        if (bitIndex === 0) {
+          currentNumber = this.bufferData.readUint32();
+        }
+        if (currentNumber & 1 << 31 - bitIndex) {
+          data[(this.height - row - 1) * this.width + col] = 1;
+        }
+      }
+    }
+  }
+  decodeStandardPixels(data, channels) {
+    const padding = this.calculatePadding(channels);
+    for (let row = 0; row < this.height; row++) {
+      const rowOffset = (this.height - row - 1) * this.width;
+      for (let col = 0; col < this.width; col++) {
+        for (let channel = channels - 1; channel >= 0; channel--) {
+          data[(rowOffset + col) * channels + channel] = this.bufferData.readByte();
+        }
+      }
+      this.bufferData.skip(padding);
+    }
+  }
+  decodePixelsWithAlpha(data, channels, components) {
+    for (let row = 0; row < this.height; row++) {
+      const rowOffset = (this.height - row - 1) * this.width;
+      for (let col = 0; col < this.width; col++) {
+        const pixelBaseIndex = (rowOffset + col) * channels;
+        // Decode color components
+        for (let component = components - 1; component >= 0; component--) {
+          data[pixelBaseIndex + component] = this.bufferData.readByte();
+        }
+        // Decode alpha channel
+        data[pixelBaseIndex + components] = this.bufferData.readByte();
+      }
+    }
+  }
+  calculatePadding(channels) {
+    return this.width * channels % 4 === 0 ? 0 : 4 - this.width * channels % 4;
+  }
+}
+
 const BITMAPV5HEADER = {
   LogicalColorSpace: {
     LCS_sRGB: 0x73524742},
@@ -18612,25 +19116,41 @@ function encode$2(data) {
   const encoder = new BMPEncoder(data);
   return encoder.encode();
 }
+/**
+ * Decodes BMP format image into data.
+ * @param data - Buffer with image data.
+ * @returns - Decoded data.
+ */
+function decode$3(data) {
+  const decoder = new BMPDecoder(data);
+  return decoder.decode();
+}
 
 /**
  * Creates a BMP buffer from a mask.
- * @param mask - The mask instance.
+ * @param image - The mask instance.
  * @returns The buffer.
  */
-function encodeBmp(mask) {
-  if (!(mask instanceof Mask)) {
-    throw new TypeError('Image bmp encoding is not implemented.');
+function encodeBmp(image) {
+  if (image instanceof Image) {
+    return encode$2({
+      width: image.width,
+      height: image.height,
+      components: image.components,
+      bitsPerPixel: image.channels * image.bitDepth,
+      channels: image.channels,
+      data: image.getRawImage().data
+    });
+  } else {
+    return encode$2({
+      width: image.width,
+      height: image.height,
+      components: 1,
+      bitsPerPixel: 1,
+      channels: 1,
+      data: image.getRawImage().data
+    });
   }
-  const imageData = mask.getRawImage();
-  return encode$2({
-    width: imageData.width,
-    height: imageData.height,
-    components: 1,
-    bitsPerPixel: 1,
-    channels: 1,
-    data: imageData.data
-  });
 }
 
 var encoder = {exports: {}};
@@ -28097,6 +28617,10 @@ function encodePng$1(png, options) {
   const encoder = new PngEncoder(png, options);
   return encoder.encode();
 }
+function decodeApng(data, options) {
+  const decoder = new PngDecoder(data, options);
+  return decoder.decodeApng();
+}
 
 /**
  * Creates a PNG buffer from an image.
@@ -28134,10 +28658,10 @@ const defaultPng = {
  * @returns The encoded image.
  */
 function encode(image, options = defaultPng) {
-  return z(options).with({
+  return M$2(options).with({
     format: 'png'
   }, options => encodePng(image, options.encoderOptions)).with({
-    format: N$1.union('jpg', 'jpeg')
+    format: z.union('jpg', 'jpeg')
   }, options => encodeJpeg(image, options.encoderOptions)).with({
     format: 'bmp'
   }, () => encodeBmp(image)).exhaustive();
@@ -28655,7 +29179,8 @@ function removeClosePoints(points, image, options) {
   }
   const channel = options?.channel || 0;
   const isMax = kind === 'maximum';
-  const sortedPoints = points.slice().sort(getSort(image, channel, isMax));
+  const sortedPoints = points.slice();
+  sortedPoints.sort(getSort(image, channel, isMax));
   if (distance > 0) {
     for (let i = 0; i < sortedPoints.length; i++) {
       for (let j = i + 1; j < sortedPoints.length; j++) {
@@ -29656,6 +30181,38 @@ Object.defineProperty(imageType, 'minimumBytes', {
 var imageTypeExports = imageType$2.exports;
 var imageType$1 = /*@__PURE__*/getDefaultExportFromCjs(imageTypeExports);
 
+/**
+ * Decode a BMP. See the fast-bmp npm module.
+ * @param data - The data to decode.
+ * @returns The decoded image or mask.
+ */
+function decodeBmp(data) {
+  const decodedData = decode$3(data);
+  if (decodedData.bitsPerPixel === 1) {
+    const mask = new Mask(decodedData.width, decodedData.height, {
+      data: decodedData.data
+    });
+    return mask.convertColor('GREY');
+  } else {
+    let colorModel;
+    switch (decodedData.channels) {
+      case 1:
+        colorModel = 'GREY';
+        break;
+      case 3:
+        colorModel = 'RGB';
+        break;
+      default:
+        colorModel = 'RGBA';
+        break;
+    }
+    return new Image(decodedData.width, decodedData.height, {
+      colorModel,
+      data: decodedData.data
+    });
+  }
+}
+
 const tagsById$2 = {
   0x829a: 'ExposureTime',
   0x829d: 'FNumber',
@@ -30374,7 +30931,7 @@ class TiffIfd extends IFD {
     return this.get('SamplesPerPixel') || 1;
   }
   get rowsPerStrip() {
-    return this.get('RowsPerStrip');
+    return this.get('RowsPerStrip') || 2 ** 32 - 1;
   }
   get stripByteCounts() {
     return alwaysArray(this.get('StripByteCounts'));
@@ -30928,10 +31485,16 @@ function decodeJpeg(buffer) {
 function decodePng(buffer) {
   const png = decodePng$1(buffer);
   let colorModel;
-  const bitDepth = png.depth === 16 ? 16 : 8;
+  const bitDepth = png.depth;
   if (png.palette) {
     return loadPalettePng(png);
   }
+  if (bitDepth === 1) {
+    return new Image(png.width, png.height, {
+      data: decodeBinary(png),
+      colorModel: 'GREY'
+    });
+  }
   switch (png.channels) {
     case 1:
       colorModel = 'GREY';
@@ -30962,7 +31525,7 @@ function decodePng(buffer) {
 function loadPalettePng(png) {
   assert(png.palette);
   const pixels = png.width * png.height;
-  const data = new Uint8Array(pixels * 3);
+  const data = new Uint8Array(pixels * png.palette[0].length);
   const pixelsPerByte = 8 / png.depth;
   const factor = png.depth < 8 ? pixelsPerByte : 1;
   const mask = Number.parseInt('1'.repeat(png.depth), 2);
@@ -30974,14 +31537,32 @@ function loadPalettePng(png) {
       value = value >>> png.depth * (pixelsPerByte - 1 - i % pixelsPerByte) & mask;
     }
     const paletteValue = png.palette[value];
-    data[dataIndex++] = paletteValue[0];
-    data[dataIndex++] = paletteValue[1];
-    data[dataIndex++] = paletteValue[2];
+    for (const paletteChannel of paletteValue) {
+      data[dataIndex++] = paletteChannel;
+    }
   }
   return new Image(png.width, png.height, {
-    data
+    data,
+    colorModel: png.palette[0].length === 4 ? 'RGBA' : 'RGB'
   });
 }
+function decodeBinary(png) {
+  const totalPixels = png.width * png.height;
+  const result = new Uint8Array(totalPixels);
+  const pngData = png.data;
+  const padding = png.width % 8;
+  const bytesPerLine = Math.ceil(png.width / 8);
+  let pixelIndex = 0;
+  for (let byteIndex = 0; byteIndex < pngData.length && pixelIndex < totalPixels; byteIndex++) {
+    const byte = pngData[byteIndex];
+    const limit = byteIndex % bytesPerLine === 0 ? 8 - padding : 0;
+    for (let bitIndex = 7; bitIndex >= limit && pixelIndex < totalPixels; bitIndex--) {
+      const bit = byte >> bitIndex & 1;
+      result[pixelIndex++] = bit * 255;
+    }
+  }
+  return result;
+}
 
 /**
  * Decode a TIFF. See the tiff module.
@@ -30989,9 +31570,10 @@ function loadPalettePng(png) {
  * @returns The decoded image.
  */
 function decodeTiff(buffer) {
-  const result = decodeTIFF(buffer);
+  const result = decodeTIFF(buffer, {
+    pages: [0]
+  });
   return getImageFromIFD(result[0]);
-  // TODO: optimize not to decode whole file
 }
 /**
  * Create image from a single IFD.
@@ -30999,32 +31581,59 @@ function decodeTiff(buffer) {
  * @returns The decoded image.
  */
 function getImageFromIFD(ifd) {
+  if (ifd.data instanceof Float32Array || ifd.data instanceof Float64Array) {
+    throw new Error('Float TIFF data is not supported.');
+  }
   if (ifd.type === 3) {
-    // Palette
-    const data = new Uint16Array(3 * ifd.width * ifd.height);
+    const hasAlpha = ifd.samplesPerPixel === 2;
+    const pixelLength = hasAlpha ? 4 : 3;
+    const data = new Uint16Array(pixelLength * ifd.width * ifd.height);
     const palette = ifd.palette;
     let ptr = 0;
-    for (const index of ifd.data) {
-      const color = palette[index];
-      data[ptr++] = color[0];
-      data[ptr++] = color[1];
-      data[ptr++] = color[2];
+    if (hasAlpha) {
+      for (let index = 0; index < ifd.data.length; index += ifd.samplesPerPixel) {
+        const color = palette[ifd.data[index]];
+        data[ptr++] = color[0];
+        data[ptr++] = color[1];
+        data[ptr++] = color[2];
+        // To ensure that the value is 16 bits.
+        data[ptr++] = Math.round(ifd.data[index + 1] / 2 ** ifd.bitsPerSample * 65535);
+      }
+    } else {
+      for (let index = 0; index < ifd.data.length; index += ifd.samplesPerPixel) {
+        const color = palette[ifd.data[index]];
+        data[ptr++] = color[0];
+        data[ptr++] = color[1];
+        data[ptr++] = color[2];
+      }
     }
     return new Image(ifd.width, ifd.height, {
       data,
-      // TODO: handle alpha properly
-      colorModel: ifd.alpha ? 'RGBA' : 'RGB',
-      // TODO: handle other bit depths
+      colorModel: hasAlpha ? 'RGBA' : 'RGB',
       bitDepth: 16,
       meta: getMetadata(ifd)
     });
+  } else if (ifd.type === 1 || ifd.type === 0) {
+    if (ifd.bitsPerSample !== 1) {
+      return new Image(ifd.width, ifd.height, {
+        data: ifd.data,
+        bitDepth: ifd.bitsPerSample,
+        colorModel: ifd.alpha ? 'GREYA' : 'GREY',
+        meta: getMetadata(ifd)
+      });
+    } else {
+      return new Image(ifd.width, ifd.height, {
+        data: ifd.data.map(pixel => pixel * 255),
+        bitDepth: 8,
+        colorModel: 'GREY',
+        meta: getMetadata(ifd)
+      });
+    }
   } else {
     return new Image(ifd.width, ifd.height, {
-      // TODO: handle float data
-      // @ts-expect-error float data not handled yet
       data: ifd.data,
       bitDepth: ifd.bitsPerSample,
-      colorModel: ifd.type === 2 ? ifd.alpha ? 'RGBA' : 'RGB' : ifd.alpha ? 'GREYA' : 'GREY',
+      colorModel: ifd.alpha ? 'RGBA' : 'RGB',
       meta: getMetadata(ifd)
     });
   }
@@ -31039,13 +31648,15 @@ function getImageFromIFD(ifd) {
 function decode(data) {
   const typedArray = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
   const type = imageType$1(typedArray);
-  return z(type).with({
+  return M$2(type).with({
     mime: 'image/png'
   }, () => decodePng(typedArray)).with({
     mime: 'image/jpeg'
   }, () => decodeJpeg(typedArray)).with({
     mime: 'image/tiff'
-  }, () => decodeTiff(typedArray)).otherwise(() => {
+  }, () => decodeTiff(typedArray)).with({
+    mime: 'image/bmp'
+  }, () => decodeBmp(typedArray)).otherwise(() => {
     throw new RangeError(`invalid data format: ${type?.mime}`);
   });
 }
@@ -31217,7 +31828,7 @@ function getRainbowMap(options) {
   } = options;
   const colorMap = new Uint32Array(nbNegative + nbPositive + 1);
   const hueRange = 360;
-  const step = z(roiKind).with('bw', () => hueRange / (nbNegative + nbPositive)).with('black', () => hueRange / nbNegative).with('white', () => hueRange / nbPositive).exhaustive();
+  const step = M$2(roiKind).with('bw', () => hueRange / (nbNegative + nbPositive)).with('black', () => hueRange / nbNegative).with('white', () => hueRange / nbPositive).exhaustive();
   // negative values
   let hue = 0;
   if (roiKind === 'bw' || roiKind === 'black') {
@@ -31287,7 +31898,7 @@ function getColorMap(options) {
     roiKind: 'bw',
     ...options
   };
-  return z(mode).with('binary', () => getBinaryMap(options)).with('saturation', () => getSaturationMap(options)).with('rainbow', () => getRainbowMap(options)).exhaustive();
+  return M$2(mode).with('binary', () => getBinaryMap(options)).with('saturation', () => getSaturationMap(options)).with('rainbow', () => getRainbowMap(options)).exhaustive();
 }
 
 const RoisColorMode = {
@@ -32102,7 +32713,7 @@ function getRois(roiMapManager, options = {}) {
   if (roiMapManager.blackRois.length === 0 && roiMapManager.whiteRois.length === 0) {
     computeRois(roiMapManager);
   }
-  const rois = z(kind).with('black', () => roiMapManager.blackRois).with('white', () => roiMapManager.whiteRois).with('bw', () => [...roiMapManager.whiteRois, ...roiMapManager.blackRois]).exhaustive();
+  const rois = M$2(kind).with('black', () => roiMapManager.blackRois).with('white', () => roiMapManager.whiteRois).with('bw', () => [...roiMapManager.whiteRois, ...roiMapManager.blackRois]).exhaustive();
   return rois.filter(roi => roi.surface >= minSurface && roi.surface <= maxSurface);
 }
 
@@ -32892,6 +33503,61 @@ function medianImage(stack) {
   return result;
 }
 
+/**
+ * Decodes APNG image into a Stack
+ * @param data - APNG data.
+ * @returns stack of frames.
+ */
+function decodeStackFromApng(data) {
+  const decodedApng = decodeApng(data);
+  const images = [];
+  let colorModel;
+  switch (decodedApng.channels) {
+    case 1:
+      if (decodedApng.palette) {
+        colorModel = decodedApng.palette[0].length === 3 ? 'RGB' : 'RGBA';
+      } else {
+        colorModel = 'GREY';
+      }
+      break;
+    case 2:
+      colorModel = 'GREYA';
+      break;
+    case 3:
+      colorModel = 'RGB';
+      break;
+    default:
+      colorModel = 'RGBA';
+      break;
+  }
+  if (decodedApng.palette) {
+    for (const image of decodedApng.frames) {
+      images.push(new Image(decodedApng.width, decodedApng.height, {
+        data: convertIndexedData(image.data, decodedApng.palette),
+        colorModel
+      }));
+    }
+  } else {
+    for (const image of decodedApng.frames) {
+      images.push(new Image(decodedApng.width, decodedApng.height, {
+        data: image.data,
+        colorModel
+      }));
+    }
+  }
+  const stack = new Stack(images);
+  return stack;
+}
+function convertIndexedData(data, palette) {
+  const result = new Uint8Array(data.length * palette[0].length);
+  for (let i = 0; i < data.length; i++) {
+    for (let channel = 0; channel < palette[0].length; channel++) {
+      result[i * palette[0].length + channel] = palette[data[i]][channel];
+    }
+  }
+  return result;
+}
+
 /**
  * Decode a TIFF and create a stack of images.
  * @param buffer - The data to decode.
@@ -32915,9 +33581,11 @@ function decodeStackFromTiff(buffer) {
 function decodeStack(data) {
   const typedArray = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
   const type = imageType$1(typedArray);
-  return z(type).with({
+  return M$2(type).with({
     mime: 'image/tiff'
-  }, () => decodeStackFromTiff(typedArray)).otherwise(() => {
+  }, () => decodeStackFromTiff(typedArray)).with({
+    mime: 'image/png'
+  }, () => decodeStackFromApng(typedArray)).otherwise(() => {
     throw new RangeError(`invalid data format: ${type?.mime}`);
   });
 }