@sheetxl/studio-vanilla 0.3.4 → 0.3.5

package/browser/esm/gX1gbnkwbpalR57F.mjs

@@ -1,12 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-async function t() {
-  return window.crypto;
-}
-export {
-  t as getCrypto
-};

package/browser/esm/im3UoVISx3VXhEFp.mjs

@@ -1,46 +0,0 @@
-import { jsx as o, jsxs as A } from "react/jsx-runtime";
-import { memo as E, useMemo as b, useState as g, useCallback as O } from "react";
-import { a7 as f, n as S, B as U, e as P, T as D, f as l, b6 as p } from "./Bq_HFm6_6_ycs_gE.mjs";
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const V = ["Ok", "Cancel"], J = E((F) => {
-  const { initialHyperlink: t = null, initialDisplay: H = null, onUpdateHyperlink: m, context: s, onOption: x, onValidateOption: r, onDone: d, options: h = V, defaultOption: c = h?.[0], cancelOption: i = "Cancel", sx: I, ...v } = F, w = b(() => (t ?? s?.()?.getHyperlink()) !== null, []), y = b(() => {
-    let e = null, n = null;
-    t && (typeof t == "string" ? n = t : e = t);
-    const C = e ?? s?.()?.getHyperlink();
-    return { address: n ?? C?.getAddress() ?? "", textToDisplay: C?.getDisplayText() ?? "" };
-  }, [t, s]), [a, M] = g(y.address), [u, B] = g(() => {
-    const e = s?.().toTextUnformatted() ?? H;
-    return e === y.address ? "" : e;
-  }), [$, k] = g(!1), L = O((e) => {
-    B(e.target.value);
-  }, []), T = O(async (e, n) => null, []), W = f(async (e) => {
-    e !== i && m?.(a === "" ? null : { address: a }, u), x?.(e, e === i, e === c), d?.();
-  }, [a, u, m, d, x, c, i]), j = f((e) => {
-    M(e.target.value), T(e.target.value, null);
-  }, [r]), z = f(async (e) => {
-    let n = await Promise.resolve(r?.(e));
-    try {
-      n !== !1 && (n = await T(a, e));
-    } catch {
-    }
-    return n ?? !0;
-  }, [r]);
-  return o(S, { title: (w ? "Edit" : "Insert") + " Link", options: h, onDone: d, onOption: (e) => W(e), onValidateOption: z, defaultOption: c, cancelOption: i, autoFocusSel: ".autoFocus", sx: { width: "480px", ...I }, ...v, children: A(U, { sx: { paddingTop: (e) => e.spacing(1), paddingBottom: (e) => e.spacing(0), rowGap: (e) => e.spacing(1), display: "flex", flexDirection: "column" }, children: [o(P, { sx: { paddingTop: (e) => e.spacing(1.5), minWidth: 135, width: "100%" }, size: "small", children: o(D, { label: "Address", placeholder: "Enter a url or cell reference.", onFocus: (e) => {
-    $ || e.target?.select(), k(!0);
-  }, sx: { "& .MuiFormHelperText-root": { marginTop: (e) => e.spacing(0.5) } }, InputLabelProps: { shrink: !0 }, InputProps: { inputProps: { className: "autoFocus", spellCheck: !1, autoComplete: "off", sx: { paddingTop: (e) => e.spacing(1.25), paddingBottom: (e) => e.spacing(0.75), backgroundImage: `linear-gradient(${l("#fff", p(5))}, ${l("#fff", p(5))})` } } }, value: a, onChange: j, onContextMenu: (e) => {
-    e.stopPropagation();
-  } }) }), o(P, { sx: { paddingTop: (e) => e.spacing(1.5), minWidth: 135, width: "100%" }, size: "small", children: o(D, { label: "Display Text", placeholder: a?.startsWith("#") ? a.substring(1) : a, onFocus: () => {
-    k(!0);
-  }, sx: { "& .MuiFormHelperText-root": { marginTop: (e) => e.spacing(0.5) } }, InputLabelProps: { shrink: !0 }, InputProps: { inputProps: { spellCheck: !1, autoComplete: "off", sx: { paddingTop: (e) => e.spacing(1.25), paddingBottom: (e) => e.spacing(0.75), backgroundImage: `linear-gradient(${l("#fff", p(5))}, ${l("#fff", p(5))})` } } }, value: u, onChange: L, onContextMenu: (e) => {
-    e.stopPropagation();
-  } }) })] }) });
-});
-export {
-  J as HyperlinkDialog,
-  J as default
-};

package/browser/esm/kagl0zcUDaK1IX_X.mjs

@@ -1,10 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const t = { CONVERT: { s: "Converts a number from one measurement system to another", p: { number: { d: "is the value in from_unit to convert." }, fromUnit: { d: "is the units for number." }, toUnit: { d: "is the units for the result" } } } };
-export {
-  t as default
-};

package/browser/esm/t7CffsKJY64LMXgS.mjs

@@ -1,10 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const e = { AND: { s: "Checks whether all arguments are TRUE, and returns TRUE if all arguments are TRUE", p: { logical: { d: "logical1,logical2,... are 1 to 255 conditions you want to test that can be either TRUE or FALSE and can be logical values, arrays, or references" } } }, BYCOL: { s: "Applies a LAMBDA function to each column and returns an array of the results.", p: { array: { d: "is an array to be separated by column" }, fn: { d: "is a LAMBDA that is called to scan the array.  The LAMBDA takes two parameters, accumulator and value." } }, h: "Unimplemented" }, BYROW: { s: "Applies a LAMBDA function to each row and returns an array of the results.", p: { array: { d: "is an array to be separated by column" }, fn: { d: "is a LAMBDA that is called to scan the array.  The LAMBDA takes two parameters, accumulator and value." } }, h: "Unimplemented" }, FALSE: { s: "Returns the logical value FALSE", p: {} }, IF: { s: "Checks whether a condition is met, and returns one value if TRUE, and another value if FALSE", p: { logicalTest: { d: "is any value or expression that can be evaluated to TRUE or FALSE" }, valueIfTrue: { d: "is the value that is returned if Logical_test is TRUE. If omitted, TRUE is returned. You can nest up to seven IF functions" }, valueIfFalse: { d: "is the value that is returned if Logical_test is FALSE. If omitted, FALSE is returned" } } }, IFERROR: { s: "Returns value_if_error if expression is an error and the value of the expression itself otherwise", p: { value: { d: "is any value or expression or reference" }, valueIfError: { d: "is any value or expression or reference" } } }, IFNA: { s: "Returns the value you specify if the expression resolves to #N/A, otherwise returns the result of the expression", p: { value: { d: "is any value or expression or reference" }, valueIfError: { d: "is any value or expression or reference" } } }, IFS: { s: "Checks whether one or more conditions are met and returns a value corresponding to the first TRUE condition", p: { logicalTest: { d: "logical_test1,logical_test2,... is any value or expression that can be evaluated to TRUE or FALSE" }, logicalTrue: { d: "value_if_true1,value_if_true2,... is the value returned if Logical_test is TRUE" }, rest: {} } }, LAMDA: { s: "Creates a function value with can be called within formulas.", p: { parameterOrCalculation: { d: "a parameter or a calculation that returns a value. If a parameter, it must be the last argument." } }, h: "Unimplemented" }, LET: { s: "Assigns calculation results to names. Useful for storing intermediate calculations and values by defining names inside a formula. These names only apply within the scope of the LET function.", p: { name: { d: "name1,name2,... the name, or a calculation which can make use of all names within the LET. Names must start with a letter, cannot be the output of a formula, or conflict with range syntax." }, nameOrValue: { d: "name_value1,name_value2,... the value associated with the name." }, calculationOrName: {}, rest: {} }, h: "Unimplemented" }, MAKEARRAY: { s: "Returns a calculated array of a specified row and column size, by applying a LAMBDA function.", p: { rows: { d: "is the number of rows in the array.  Must be greater than zero." }, columns: { d: "is the number of columns in the array.  Must be greater than zero." }, fn: { d: "is a LAMBDA that is called to create the array.  The LAMBDA takes two parameters, row index and column index." } }, h: "Unimplemented" }, MAP: { s: "Returns an array formed by 'mapping' each value in the array(s) to a new value by applying a lambda to create a new value.", p: { array: { d: "is an array to be mapped" }, lamdaOrArray: { d: "lambda_or_array1,lambda_or_array2,... is a LAMBDA which must be the last argument and must have a parameter for each array passed, or another array to be mapped" } }, h: "Unimplemented" }, NOT: { s: "Changes FALSE to TRUE, or TRUE to FALSE", p: { logical: { d: "is a value or expression that can be evaluated to TRUE or FALSE" } } }, OR: { s: "Checks whether any of the arguments are TRUE, and returns TRUE or FALSE. Returns FALSE only if all arguments are FALSE", p: { logical: { d: "logical1,logical2,... are 1 to 255 conditions that you want to test that can be either TRUE or FALSE" } } }, REDUCE: { s: "Reduces an array to an accumulated value by applying a LAMBDA function to each value and returning the total value in the accumulator.", p: { initialValue: { d: "is the starting value for the accumulator" }, array: { d: "is an array to be reduced" }, fn: { d: "is a LAMBDA that is called to reduce the array.  The LAMBDA takes two parameters, accumulator and value." } }, h: "Unimplemented" }, SCAN: { s: "Scans an array by applying a LAMBDA function to each value and returns an array that has each intermediate value", p: { initialValue: { d: "is the starting value for the accumulator" }, array: { d: "is an array to be reduced" }, fn: { d: "is a LAMBDA that is called to reduce the array.  The LAMBDA takes two parameters, accumulator and value." } }, h: "Unimplemented" }, SWITCH: { s: "Evaluates an expression against a list of values and returns the result corresponding to the first matching value. If there is no match, an optional default value is returned", p: { expression: {}, value: { d: "is an expression to be evaluated" }, results: { d: "result1,result2,... is a result to be returned if the corresponding value matches expression" } }, h: "Unimplemented" }, TRUE: { s: "Returns the logical value TRUE", p: {} }, XOR: { s: "Returns a logical 'Exclusive Or' of all arguments", p: { logical: { d: "logical1,logical2,... are 1 to 254 conditions you want to test that can be either TRUE or FALSE and can be logical values, arrays, or references" } } } };
-export {
-  e as default
-};

package/browser/esm/x9wy-F3t5pNOvOIp.mjs

@@ -1,425 +0,0 @@
-import { h as yt } from "./Bq_HFm6_6_ycs_gE.mjs";
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-var ct, pt = { exports: {} }, gt = (ct || (ct = 1, pt.exports = function Y() {
-  var Q, k = typeof self < "u" ? self : typeof window < "u" ? window : k !== void 0 ? k : {}, P = !k.document && !!k.postMessage, B = k.IS_PAPA_WORKER || !1, J = {}, mt = 0, a = {};
-  function K(t) {
-    this._handle = null, this._finished = !1, this._completed = !1, this._halted = !1, this._input = null, this._baseIndex = 0, this._partialLine = "", this._rowCount = 0, this._start = 0, this._nextChunk = null, this.isFirstChunk = !0, this._completeResults = { data: [], errors: [], meta: {} }, function(e) {
-      var i = at(e);
-      i.chunkSize = parseInt(i.chunkSize), e.step || e.chunk || (i.chunkSize = null), this._handle = new ht(i), (this._handle.streamer = this)._config = i;
-    }.call(this, t), this.parseChunk = function(e, i) {
-      var n = parseInt(this._config.skipFirstNLines) || 0;
-      if (this.isFirstChunk && 0 < n) {
-        let l = this._config.newline;
-        l || (r = this._config.quoteChar || '"', l = this._handle.guessLineEndings(e, r)), e = [...e.split(l).slice(n)].join(l);
-      }
-      this.isFirstChunk && _(this._config.beforeFirstChunk) && (r = this._config.beforeFirstChunk(e)) !== void 0 && (e = r), this.isFirstChunk = !1, this._halted = !1, n = this._partialLine + e;
-      var r = (this._partialLine = "", this._handle.parse(n, this._baseIndex, !this._finished));
-      if (!this._handle.paused() && !this._handle.aborted()) {
-        if (e = r.meta.cursor, this._finished || (this._partialLine = n.substring(e - this._baseIndex), this._baseIndex = e), r && r.data && (this._rowCount += r.data.length), n = this._finished || this._config.preview && this._rowCount >= this._config.preview, B) k.postMessage({ results: r, workerId: a.WORKER_ID, finished: n });
-        else if (_(this._config.chunk) && !i) {
-          if (this._config.chunk(r, this._handle), this._handle.paused() || this._handle.aborted()) return void (this._halted = !0);
-          this._completeResults = r = void 0;
-        }
-        return this._config.step || this._config.chunk || (this._completeResults.data = this._completeResults.data.concat(r.data), this._completeResults.errors = this._completeResults.errors.concat(r.errors), this._completeResults.meta = r.meta), this._completed || !n || !_(this._config.complete) || r && r.meta.aborted || (this._config.complete(this._completeResults, this._input), this._completed = !0), n || r && r.meta.paused || this._nextChunk(), r;
-      }
-      this._halted = !0;
-    }, this._sendError = function(e) {
-      _(this._config.error) ? this._config.error(e) : B && this._config.error && k.postMessage({ workerId: a.WORKER_ID, error: e, finished: !1 });
-    };
-  }
-  function it(t) {
-    var e;
-    (t = t || {}).chunkSize || (t.chunkSize = a.RemoteChunkSize), K.call(this, t), this._nextChunk = P ? function() {
-      this._readChunk(), this._chunkLoaded();
-    } : function() {
-      this._readChunk();
-    }, this.stream = function(i) {
-      this._input = i, this._nextChunk();
-    }, this._readChunk = function() {
-      if (this._finished) this._chunkLoaded();
-      else {
-        if (e = new XMLHttpRequest(), this._config.withCredentials && (e.withCredentials = this._config.withCredentials), P || (e.onload = $(this._chunkLoaded, this), e.onerror = $(this._chunkError, this)), e.open(this._config.downloadRequestBody ? "POST" : "GET", this._input, !P), this._config.downloadRequestHeaders) {
-          var i, n = this._config.downloadRequestHeaders;
-          for (i in n) e.setRequestHeader(i, n[i]);
-        }
-        var r;
-        this._config.chunkSize && (r = this._start + this._config.chunkSize - 1, e.setRequestHeader("Range", "bytes=" + this._start + "-" + r));
-        try {
-          e.send(this._config.downloadRequestBody);
-        } catch (l) {
-          this._chunkError(l.message);
-        }
-        P && e.status === 0 && this._chunkError();
-      }
-    }, this._chunkLoaded = function() {
-      var i;
-      e.readyState === 4 && (e.status < 200 || 400 <= e.status ? this._chunkError() : (this._start += this._config.chunkSize || e.responseText.length, this._finished = !this._config.chunkSize || this._start >= ((i = (i = e).getResponseHeader("Content-Range")) !== null ? parseInt(i.substring(i.lastIndexOf("/") + 1)) : -1), this.parseChunk(e.responseText)));
-    }, this._chunkError = function(i) {
-      i = e.statusText || i, this._sendError(new Error(i));
-    };
-  }
-  function rt(t) {
-    (t = t || {}).chunkSize || (t.chunkSize = a.LocalChunkSize), K.call(this, t);
-    var e, i, n = typeof FileReader < "u";
-    this.stream = function(r) {
-      this._input = r, i = r.slice || r.webkitSlice || r.mozSlice, n ? ((e = new FileReader()).onload = $(this._chunkLoaded, this), e.onerror = $(this._chunkError, this)) : e = new FileReaderSync(), this._nextChunk();
-    }, this._nextChunk = function() {
-      this._finished || this._config.preview && !(this._rowCount < this._config.preview) || this._readChunk();
-    }, this._readChunk = function() {
-      var r = this._input, l = (this._config.chunkSize && (l = Math.min(this._start + this._config.chunkSize, this._input.size), r = i.call(r, this._start, l)), e.readAsText(r, this._config.encoding));
-      n || this._chunkLoaded({ target: { result: l } });
-    }, this._chunkLoaded = function(r) {
-      this._start += this._config.chunkSize, this._finished = !this._config.chunkSize || this._start >= this._input.size, this.parseChunk(r.target.result);
-    }, this._chunkError = function() {
-      this._sendError(e.error);
-    };
-  }
-  function X(t) {
-    var e;
-    K.call(this, t = t || {}), this.stream = function(i) {
-      return e = i, this._nextChunk();
-    }, this._nextChunk = function() {
-      var i, n;
-      if (!this._finished) return i = this._config.chunkSize, e = i ? (n = e.substring(0, i), e.substring(i)) : (n = e, ""), this._finished = !e, this.parseChunk(n);
-    };
-  }
-  function nt(t) {
-    K.call(this, t = t || {});
-    var e = [], i = !0, n = !1;
-    this.pause = function() {
-      K.prototype.pause.apply(this, arguments), this._input.pause();
-    }, this.resume = function() {
-      K.prototype.resume.apply(this, arguments), this._input.resume();
-    }, this.stream = function(r) {
-      this._input = r, this._input.on("data", this._streamData), this._input.on("end", this._streamEnd), this._input.on("error", this._streamError);
-    }, this._checkIsFinished = function() {
-      n && e.length === 1 && (this._finished = !0);
-    }, this._nextChunk = function() {
-      this._checkIsFinished(), e.length ? this.parseChunk(e.shift()) : i = !0;
-    }, this._streamData = $(function(r) {
-      try {
-        e.push(typeof r == "string" ? r : r.toString(this._config.encoding)), i && (i = !1, this._checkIsFinished(), this.parseChunk(e.shift()));
-      } catch (l) {
-        this._streamError(l);
-      }
-    }, this), this._streamError = $(function(r) {
-      this._streamCleanUp(), this._sendError(r);
-    }, this), this._streamEnd = $(function() {
-      this._streamCleanUp(), n = !0, this._streamData("");
-    }, this), this._streamCleanUp = $(function() {
-      this._input.removeListener("data", this._streamData), this._input.removeListener("end", this._streamEnd), this._input.removeListener("error", this._streamError);
-    }, this);
-  }
-  function ht(t) {
-    var e, i, n, r, l = Math.pow(2, 53), v = -l, z = /^\s*-?(\d+\.?|\.\d+|\d+\.\d+)([eE][-+]?\d+)?\s*$/, w = /^((\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d:[0-5]\d\.\d+([+-][0-2]\d:[0-5]\d|Z))|(\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d:[0-5]\d([+-][0-2]\d:[0-5]\d|Z))|(\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d([+-][0-2]\d:[0-5]\d|Z)))$/, m = this, T = 0, o = 0, I = !1, u = !1, p = [], s = { data: [], errors: [], meta: {} };
-    function C(h) {
-      return t.skipEmptyLines === "greedy" ? h.join("").trim() === "" : h.length === 1 && h[0].length === 0;
-    }
-    function R() {
-      if (s && n && (M("Delimiter", "UndetectableDelimiter", "Unable to auto-detect delimiting character; defaulted to '" + a.DefaultDelimiter + "'"), n = !1), t.skipEmptyLines && (s.data = s.data.filter(function(f) {
-        return !C(f);
-      })), L()) {
-        let f = function(O, A) {
-          _(t.transformHeader) && (O = t.transformHeader(O, A)), p.push(O);
-        };
-        if (s) if (Array.isArray(s.data[0])) {
-          for (var h = 0; L() && h < s.data.length; h++) s.data[h].forEach(f);
-          s.data.splice(0, 1);
-        } else s.data.forEach(f);
-      }
-      function c(f, O) {
-        for (var A = t.header ? {} : [], b = 0; b < f.length; b++) {
-          var y = b, g = f[b];
-          g = ((U, d) => {
-            return S = U, t.dynamicTypingFunction && t.dynamicTyping[S] === void 0 && (t.dynamicTyping[S] = t.dynamicTypingFunction(S)), (t.dynamicTyping[S] || t.dynamicTyping) === !0 ? d === "true" || d === "TRUE" || d !== "false" && d !== "FALSE" && (((j) => {
-              if (z.test(j) && (j = parseFloat(j), v < j && j < l)) return 1;
-            })(d) ? parseFloat(d) : w.test(d) ? new Date(d) : d === "" ? null : d) : d;
-            var S;
-          })(y = t.header ? b >= p.length ? "__parsed_extra" : p[b] : y, g = t.transform ? t.transform(g, y) : g), y === "__parsed_extra" ? (A[y] = A[y] || [], A[y].push(g)) : A[y] = g;
-        }
-        return t.header && (b > p.length ? M("FieldMismatch", "TooManyFields", "Too many fields: expected " + p.length + " fields but parsed " + b, o + O) : b < p.length && M("FieldMismatch", "TooFewFields", "Too few fields: expected " + p.length + " fields but parsed " + b, o + O)), A;
-      }
-      var E;
-      s && (t.header || t.dynamicTyping || t.transform) && (E = 1, !s.data.length || Array.isArray(s.data[0]) ? (s.data = s.data.map(c), E = s.data.length) : s.data = c(s.data, 0), t.header && s.meta && (s.meta.fields = p), o += E);
-    }
-    function L() {
-      return t.header && p.length === 0;
-    }
-    function M(h, c, E, f) {
-      h = { type: h, code: c, message: E }, f !== void 0 && (h.row = f), s.errors.push(h);
-    }
-    _(t.step) && (r = t.step, t.step = function(h) {
-      s = h, L() ? R() : (R(), s.data.length !== 0 && (T += h.data.length, t.preview && T > t.preview ? i.abort() : (s.data = s.data[0], r(s, m))));
-    }), this.parse = function(h, c, E) {
-      var f = t.quoteChar || '"';
-      return t.newline || (t.newline = this.guessLineEndings(h, f)), n = !1, t.delimiter ? _(t.delimiter) && (t.delimiter = t.delimiter(h), s.meta.delimiter = t.delimiter) : ((f = ((O, A, b, y, g) => {
-        var U, d, S, j;
-        g = g || [",", "	", "|", ";", a.RECORD_SEP, a.UNIT_SEP];
-        for (var Z = 0; Z < g.length; Z++) {
-          for (var W, tt = g[Z], F = 0, q = 0, x = 0, D = (S = void 0, new st({ comments: y, delimiter: tt, newline: A, preview: 10 }).parse(O)), H = 0; H < D.data.length; H++) b && C(D.data[H]) ? x++ : (q += W = D.data[H].length, S === void 0 ? S = W : 0 < W && (F += Math.abs(W - S), S = W));
-          0 < D.data.length && (q /= D.data.length - x), (d === void 0 || F <= d) && (j === void 0 || j < q) && 1.99 < q && (d = F, U = tt, j = q);
-        }
-        return { successful: !!(t.delimiter = U), bestDelimiter: U };
-      })(h, t.newline, t.skipEmptyLines, t.comments, t.delimitersToGuess)).successful ? t.delimiter = f.bestDelimiter : (n = !0, t.delimiter = a.DefaultDelimiter), s.meta.delimiter = t.delimiter), f = at(t), t.preview && t.header && f.preview++, e = h, i = new st(f), s = i.parse(e, c, E), R(), I ? { meta: { paused: !0 } } : s || { meta: { paused: !1 } };
-    }, this.paused = function() {
-      return I;
-    }, this.pause = function() {
-      I = !0, i.abort(), e = _(t.chunk) ? "" : e.substring(i.getCharIndex());
-    }, this.resume = function() {
-      m.streamer._halted ? (I = !1, m.streamer.parseChunk(e, !0)) : setTimeout(m.resume, 3);
-    }, this.aborted = function() {
-      return u;
-    }, this.abort = function() {
-      u = !0, i.abort(), s.meta.aborted = !0, _(t.complete) && t.complete(s), e = "";
-    }, this.guessLineEndings = function(h, c) {
-      h = h.substring(0, 1048576), c = new RegExp(V(c) + "([^]*?)" + V(c), "gm");
-      var E = (h = h.replace(c, "")).split("\r");
-      if (h = 1 < (c = h.split(`
-`)).length && c[0].length < E[0].length, E.length === 1 || h) return `
-`;
-      for (var f = 0, O = 0; O < E.length; O++) E[O][0] === `
-` && f++;
-      return f >= E.length / 2 ? `\r
-` : "\r";
-    };
-  }
-  function V(t) {
-    return t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
-  }
-  function st(t) {
-    var e = (t = t || {}).delimiter, i = t.newline, n = t.comments, r = t.step, l = t.preview, v = t.fastMode, z = null, w = !1, m = t.quoteChar == null ? '"' : t.quoteChar, T = m;
-    if (t.escapeChar !== void 0 && (T = t.escapeChar), (typeof e != "string" || -1 < a.BAD_DELIMITERS.indexOf(e)) && (e = ","), n === e) throw new Error("Comment character same as delimiter");
-    n === !0 ? n = "#" : (typeof n != "string" || -1 < a.BAD_DELIMITERS.indexOf(n)) && (n = !1), i !== `
-` && i !== "\r" && i !== `\r
-` && (i = `
-`);
-    var o = 0, I = !1;
-    this.parse = function(u, p, s) {
-      if (typeof u != "string") throw new Error("Input must be a string");
-      var C = u.length, R = e.length, L = i.length, M = n.length, h = _(r), c = [], E = [], f = [], O = o = 0;
-      if (!u) return F();
-      if (v || v !== !1 && u.indexOf(m) === -1) {
-        for (var A = u.split(i), b = 0; b < A.length; b++) {
-          if (f = A[b], o += f.length, b !== A.length - 1) o += i.length;
-          else if (s) return F();
-          if (!n || f.substring(0, M) !== n) {
-            if (h) {
-              if (c = [], j(f.split(e)), q(), I) return F();
-            } else j(f.split(e));
-            if (l && l <= b) return c = c.slice(0, l), F(!0);
-          }
-        }
-        return F();
-      }
-      for (var y = u.indexOf(e, o), g = u.indexOf(i, o), U = new RegExp(V(T) + V(m), "g"), d = u.indexOf(m, o); ; ) if (u[o] === m) for (d = o, o++; ; ) {
-        if ((d = u.indexOf(m, d + 1)) === -1) return s || E.push({ type: "Quotes", code: "MissingQuotes", message: "Quoted field unterminated", row: c.length, index: o }), W();
-        if (d === C - 1) return W(u.substring(o, d).replace(U, m));
-        if (m === T && u[d + 1] === T) d++;
-        else if (m === T || d === 0 || u[d - 1] !== T) {
-          y !== -1 && y < d + 1 && (y = u.indexOf(e, d + 1));
-          var S = Z((g = g !== -1 && g < d + 1 ? u.indexOf(i, d + 1) : g) === -1 ? y : Math.min(y, g));
-          if (u.substr(d + 1 + S, R) === e) {
-            f.push(u.substring(o, d).replace(U, m)), u[o = d + 1 + S + R] !== m && (d = u.indexOf(m, o)), y = u.indexOf(e, o), g = u.indexOf(i, o);
-            break;
-          }
-          if (S = Z(g), u.substring(d + 1 + S, d + 1 + S + L) === i) {
-            if (f.push(u.substring(o, d).replace(U, m)), tt(d + 1 + S + L), y = u.indexOf(e, o), d = u.indexOf(m, o), h && (q(), I)) return F();
-            if (l && c.length >= l) return F(!0);
-            break;
-          }
-          E.push({ type: "Quotes", code: "InvalidQuotes", message: "Trailing quote on quoted field is malformed", row: c.length, index: o }), d++;
-        }
-      }
-      else if (n && f.length === 0 && u.substring(o, o + M) === n) {
-        if (g === -1) return F();
-        o = g + L, g = u.indexOf(i, o), y = u.indexOf(e, o);
-      } else if (y !== -1 && (y < g || g === -1)) f.push(u.substring(o, y)), o = y + R, y = u.indexOf(e, o);
-      else {
-        if (g === -1) break;
-        if (f.push(u.substring(o, g)), tt(g + L), h && (q(), I)) return F();
-        if (l && c.length >= l) return F(!0);
-      }
-      return W();
-      function j(x) {
-        c.push(x), O = o;
-      }
-      function Z(x) {
-        return x !== -1 && (x = u.substring(d + 1, x)) && x.trim() === "" ? x.length : 0;
-      }
-      function W(x) {
-        return s || (x === void 0 && (x = u.substring(o)), f.push(x), o = C, j(f), h && q()), F();
-      }
-      function tt(x) {
-        o = x, j(f), f = [], g = u.indexOf(i, o);
-      }
-      function F(x) {
-        if (t.header && !p && c.length && !w) {
-          var D = c[0], H = /* @__PURE__ */ Object.create(null), ot = new Set(D);
-          let ft = !1;
-          for (let G = 0; G < D.length; G++) {
-            let N = D[G];
-            if (H[N = _(t.transformHeader) ? t.transformHeader(N, G) : N]) {
-              let et, lt = H[N];
-              for (; et = N + "_" + lt, lt++, ot.has(et); ) ;
-              ot.add(et), D[G] = et, H[N]++, ft = !0, (z = z === null ? {} : z)[et] = N;
-            } else H[N] = 1, D[G] = N;
-            ot.add(N);
-          }
-          ft && console.warn("Duplicate headers found and renamed."), w = !0;
-        }
-        return { data: c, errors: E, meta: { delimiter: e, linebreak: i, aborted: I, truncated: !!x, cursor: O + (p || 0), renamedHeaders: z } };
-      }
-      function q() {
-        r(F()), c = [], E = [];
-      }
-    }, this.abort = function() {
-      I = !0;
-    }, this.getCharIndex = function() {
-      return o;
-    };
-  }
-  function _t(t) {
-    var e = t.data, i = J[e.workerId], n = !1;
-    if (e.error) i.userError(e.error, e.file);
-    else if (e.results && e.results.data) {
-      var r = { abort: function() {
-        n = !0, ut(e.workerId, { data: [], errors: [], meta: { aborted: !0 } });
-      }, pause: dt, resume: dt };
-      if (_(i.userStep)) {
-        for (var l = 0; l < e.results.data.length && (i.userStep({ data: e.results.data[l], errors: e.results.errors, meta: e.results.meta }, r), !n); l++) ;
-        delete e.results;
-      } else _(i.userChunk) && (i.userChunk(e.results, r, e.file), delete e.results);
-    }
-    e.finished && !n && ut(e.workerId, e.results);
-  }
-  function ut(t, e) {
-    var i = J[t];
-    _(i.userComplete) && i.userComplete(e), i.terminate(), delete J[t];
-  }
-  function dt() {
-    throw new Error("Not implemented.");
-  }
-  function at(t) {
-    if (typeof t != "object" || t === null) return t;
-    var e, i = Array.isArray(t) ? [] : {};
-    for (e in t) i[e] = at(t[e]);
-    return i;
-  }
-  function $(t, e) {
-    return function() {
-      t.apply(e, arguments);
-    };
-  }
-  function _(t) {
-    return typeof t == "function";
-  }
-  return a.parse = function(t, e) {
-    var i, n = (e = e || {}).dynamicTyping || !1;
-    if (_(n) && (e.dynamicTypingFunction = n, n = {}), e.dynamicTyping = n, e.transform = !!_(e.transform) && e.transform, !e.worker || !a.WORKERS_SUPPORTED) return n = null, a.NODE_STREAM_INPUT, typeof t == "string" ? (t = (i = t).charCodeAt(0) !== 65279 ? i : i.slice(1), n = new (e.download ? it : X)(e)) : t.readable === !0 && _(t.read) && _(t.on) ? n = new nt(e) : (k.File && t instanceof File || t instanceof Object) && (n = new rt(e)), n.stream(t);
-    (n = (() => {
-      var r, l, v;
-      return !!a.WORKERS_SUPPORTED && (l = k.URL || k.webkitURL || null, v = Y.toString(), r = a.BLOB_URL || (a.BLOB_URL = l.createObjectURL(new Blob(["var global = (function() { if (typeof self !== 'undefined') { return self; } if (typeof window !== 'undefined') { return window; } if (typeof global !== 'undefined') { return global; } return {}; })(); global.IS_PAPA_WORKER=true; ", "(", v, ")();"], { type: "text/javascript" }))), (r = new k.Worker(r)).onmessage = _t, r.id = mt++, J[r.id] = r);
-    })()).userStep = e.step, n.userChunk = e.chunk, n.userComplete = e.complete, n.userError = e.error, e.step = _(e.step), e.chunk = _(e.chunk), e.complete = _(e.complete), e.error = _(e.error), delete e.worker, n.postMessage({ input: t, config: e, workerId: n.id });
-  }, a.unparse = function(t, e) {
-    var i = !1, n = !0, r = ",", l = `\r
-`, v = '"', z = v + v, w = !1, m = null, T = !1, o = ((() => {
-      if (typeof e == "object") {
-        if (typeof e.delimiter != "string" || a.BAD_DELIMITERS.filter(function(p) {
-          return e.delimiter.indexOf(p) !== -1;
-        }).length || (r = e.delimiter), typeof e.quotes != "boolean" && typeof e.quotes != "function" && !Array.isArray(e.quotes) || (i = e.quotes), typeof e.skipEmptyLines != "boolean" && typeof e.skipEmptyLines != "string" || (w = e.skipEmptyLines), typeof e.newline == "string" && (l = e.newline), typeof e.quoteChar == "string" && (v = e.quoteChar), typeof e.header == "boolean" && (n = e.header), Array.isArray(e.columns)) {
-          if (e.columns.length === 0) throw new Error("Option columns is empty");
-          m = e.columns;
-        }
-        e.escapeChar !== void 0 && (z = e.escapeChar + v), e.escapeFormulae instanceof RegExp ? T = e.escapeFormulae : typeof e.escapeFormulae == "boolean" && e.escapeFormulae && (T = /^[=+\-@\t\r].*$/);
-      }
-    })(), new RegExp(V(v), "g"));
-    if (typeof t == "string" && (t = JSON.parse(t)), Array.isArray(t)) {
-      if (!t.length || Array.isArray(t[0])) return I(null, t, w);
-      if (typeof t[0] == "object") return I(m || Object.keys(t[0]), t, w);
-    } else if (typeof t == "object") return typeof t.data == "string" && (t.data = JSON.parse(t.data)), Array.isArray(t.data) && (t.fields || (t.fields = t.meta && t.meta.fields || m), t.fields || (t.fields = Array.isArray(t.data[0]) ? t.fields : typeof t.data[0] == "object" ? Object.keys(t.data[0]) : []), Array.isArray(t.data[0]) || typeof t.data[0] == "object" || (t.data = [t.data])), I(t.fields || [], t.data || [], w);
-    throw new Error("Unable to serialize unrecognized input");
-    function I(p, s, C) {
-      var R = "", L = (typeof p == "string" && (p = JSON.parse(p)), typeof s == "string" && (s = JSON.parse(s)), Array.isArray(p) && 0 < p.length), M = !Array.isArray(s[0]);
-      if (L && n) {
-        for (var h = 0; h < p.length; h++) 0 < h && (R += r), R += u(p[h], h);
-        0 < s.length && (R += l);
-      }
-      for (var c = 0; c < s.length; c++) {
-        var E = (L ? p : s[c]).length, f = !1, O = L ? Object.keys(s[c]).length === 0 : s[c].length === 0;
-        if (C && !L && (f = C === "greedy" ? s[c].join("").trim() === "" : s[c].length === 1 && s[c][0].length === 0), C === "greedy" && L) {
-          for (var A = [], b = 0; b < E; b++) {
-            var y = M ? p[b] : b;
-            A.push(s[c][y]);
-          }
-          f = A.join("").trim() === "";
-        }
-        if (!f) {
-          for (var g = 0; g < E; g++) {
-            0 < g && !O && (R += r);
-            var U = L && M ? p[g] : g;
-            R += u(s[c][U], g);
-          }
-          c < s.length - 1 && (!C || 0 < E && !O) && (R += l);
-        }
-      }
-      return R;
-    }
-    function u(p, s) {
-      var C, R;
-      return p == null ? "" : p.constructor === Date ? JSON.stringify(p).slice(1, 25) : (R = !1, T && typeof p == "string" && T.test(p) && (p = "'" + p, R = !0), C = p.toString().replace(o, z), (R = R || i === !0 || typeof i == "function" && i(p, s) || Array.isArray(i) && i[s] || ((L, M) => {
-        for (var h = 0; h < M.length; h++) if (-1 < L.indexOf(M[h])) return !0;
-        return !1;
-      })(C, a.BAD_DELIMITERS) || -1 < C.indexOf(r) || C.charAt(0) === " " || C.charAt(C.length - 1) === " ") ? v + C + v : C);
-    }
-  }, a.RECORD_SEP = "", a.UNIT_SEP = "", a.BYTE_ORDER_MARK = "\uFEFF", a.BAD_DELIMITERS = ["\r", `
-`, '"', a.BYTE_ORDER_MARK], a.WORKERS_SUPPORTED = !P && !!k.Worker, a.NODE_STREAM_INPUT = 1, a.LocalChunkSize = 10485760, a.RemoteChunkSize = 5242880, a.DefaultDelimiter = ",", a.Parser = st, a.ParserHandle = ht, a.NetworkStreamer = it, a.FileStreamer = rt, a.StringStreamer = X, a.ReadableStreamStreamer = nt, k.jQuery && ((Q = k.jQuery).fn.parse = function(t) {
-    var e = t.config || {}, i = [];
-    return this.each(function(l) {
-      if (Q(this).prop("tagName").toUpperCase() !== "INPUT" || Q(this).attr("type").toLowerCase() !== "file" || !k.FileReader || !this.files || this.files.length === 0) return !0;
-      for (var v = 0; v < this.files.length; v++) i.push({ file: this.files[v], inputElem: this, instanceConfig: Q.extend({}, e) });
-    }), n(), this;
-    function n() {
-      if (i.length === 0) _(t.complete) && t.complete();
-      else {
-        var l, v, z, w = i[0];
-        if (_(t.before)) {
-          var m = t.before(w.file, w.inputElem);
-          if (typeof m == "object") {
-            if (m.action === "abort") return l = w.file, v = w.inputElem, z = m.reason, void (_(t.error) && t.error({ name: "AbortError" }, l, v, z));
-            if (m.action === "skip") return void r();
-            typeof m.config == "object" && (w.instanceConfig = Q.extend(w.instanceConfig, m.config));
-          } else if (m === "skip") return void r();
-        }
-        var T = w.instanceConfig.complete;
-        w.instanceConfig.complete = function(o) {
-          _(T) && T(o, w.file, w.inputElem), r();
-        }, a.parse(w.file, w.instanceConfig);
-      }
-    }
-    function r() {
-      i.splice(0, 1), n();
-    }
-  }), B && (k.onmessage = function(t) {
-    t = t.data, a.WORKER_ID === void 0 && t && (a.WORKER_ID = t.workerId), typeof t.input == "string" ? k.postMessage({ workerId: a.WORKER_ID, results: a.parse(t.input, t.config), finished: !0 }) : (k.File && t.input instanceof File || t.input instanceof Object) && (t = a.parse(t.input, t.config)) && k.postMessage({ workerId: a.WORKER_ID, results: t, finished: !0 });
-  }), (it.prototype = Object.create(K.prototype)).constructor = it, (rt.prototype = Object.create(K.prototype)).constructor = rt, (X.prototype = Object.create(X.prototype)).constructor = X, (nt.prototype = Object.create(K.prototype)).constructor = nt, a;
-}()), pt.exports);
-const bt = function(Y, Q) {
-  for (var k = 0; k < Q.length; k++) {
-    const P = Q[k];
-    if (typeof P != "string" && !Array.isArray(P)) {
-      for (const B in P) if (B !== "default" && !(B in Y)) {
-        const J = Object.getOwnPropertyDescriptor(P, B);
-        J && Object.defineProperty(Y, B, J.get ? J : { enumerable: !0, get: () => P[B] });
-      }
-    }
-  }
-  return Object.freeze(Object.defineProperty(Y, Symbol.toStringTag, { value: "Module" }));
-}({ __proto__: null, default: yt(gt) }, [gt]);
-export {
-  bt as p
-};

package/cdn/assets/2sPP8EL_OzSYDsKu.js

@@ -1,10 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const e = { ABS: { s: "Returns the absolute value of a number, a number without its sign", p: { number: { d: "is the real number for which you want the absolute value" } } }, AGGREGATE: { s: "Returns information about the cell.", p: { functionNum: { d: "Is the number 1 to 19 that specifies the summary function for the aggregate." }, options: { d: "Is the number 0 to 78 that specified the values to ignore for the aggregate." }, array: { d: "Is the array or range of numerical data on which to calculate the aggregate." }, K: { d: "indicates the position of the array; it is k-th largest, k-th smallest, k-th percentile, or k-th quartile." } }, h: "Unimplemented" }, ARABIC: { s: "Converts a Roman numeral to Arabic", p: { text: { d: "is the Roman numeral you want to convert" } } }, BASE: { s: "Converts a number into a text representation with the given radix (base)", p: { number: { d: "is the number that you want to convert" }, radix: { d: "is the base Radix that you want to convert the number into" }, minLength: { d: "is the minimum length of the returned string", v: 0 } } }, CEILING: { s: "Rounds a number up, to the nearest multiple of significance", p: { number: { d: "is the value you want to round" }, significance: { d: "is the multiple to which you want to round", v: "undefined" } }, c: "Compatible" }, "CEILING.MATH": { s: "Rounds a number up, to the nearest integer or to the nearest multiple of significance", p: { number: { d: "is the real number you want to round" }, significance: { d: "when given and nonzero this function will round away from zero", v: "undefined" }, mode: { v: 0 } } }, "CEILING.PRECISE": { s: "Rounds a number up to the nearest integer or to the nearest multiple of significance", p: { number: { d: "is the real number you want to round" }, significance: { d: "is the multiple to which you want to round", v: 1 } }, c: "Compatible" }, COMBIN: { s: "Returns the number of combinations for a given number of items", p: { number: { d: "is the total number of items" }, numberChosen: { d: "is the number of items in each combination" } } }, COMBINA: { s: "Returns the number of combinations with repetitions for a given number of items", p: { number: { d: "is the total number of items" }, numberChosen: { d: "is the number of items in each combination" } } }, DECIMAL: { s: "Converts a text representation of a number in a given base into a decimal number", p: { number: { d: "is the number that you want to convert" }, radix: { d: "is the base Radix of the number you are converting" } } }, DEGREES: { s: "Converts radians to degrees", p: { angle: { d: "is the angle in radians that you want to convert" } } }, EVEN: { s: "Rounds a positive number up and negative number down to the nearest even integer", p: { number: { d: "is the value to round" } } }, EXP: { s: "Returns e raised to the power of a given number", p: { number: { d: "is the exponent applied to the base e. The constant e equals 2.71828182845904, the base of the natural logarithm" } } }, FACT: { s: "Returns the factorial of a number, equal to 1*2*3*...* Number", p: { number: { d: "is the nonnegative number you want the factorial of" } } }, FACTDOUBLE: { s: "Returns the double factorial of a number", p: { number: { d: "is the value for which to return the double factorial" } } }, FLOOR: { s: "Rounds a number down to the nearest multiple of significance", p: { number: { d: "is the real number you want to round" }, significance: { d: "is the multiple to which you want to round. Number and Significance must either both be positive or both be negative", v: "undefined" } }, c: "Compatible" }, "FLOOR.MATH": { s: "Rounds a number down, to the nearest integer or to the nearest multiple of significance", p: { number: { d: "is the real number you want to round" }, significance: { d: "is the multiple to which you want to round", v: "undefined" }, mode: { d: "when given and nonzero this function will round towards zero", v: 0 } } }, "FLOOR.PRECISE": { s: "Rounds a number down to the nearest integer or to the nearest multiple of significance", p: { number: { d: "is the real number you want to round" }, significance: { d: "is the multiple to which you want to round", v: 1 } } }, GCD: { s: "Returns the greatest common divisor", p: { number: { d: "number1,number2,... are 1 to 255 values" } } }, INT: { s: "Rounds a number down to the nearest integer", p: { number: { d: "is the real number you want to round down to an integer" } } }, "ISO.CEILING": { s: "Rounds a number up to the nearest integer", p: { number: { d: "is the real number you want to round up to an integer" }, significance: { d: "is the multiple to which you want to round number", v: "undefined" } }, c: "Compatible" }, LCM: { s: "Returns the least common multiple", p: { number: { d: "number1,number2,... are 1 to 255 values for which you want the least common multiple" } } }, LN: { s: "Returns the natural logarithm of a number", p: { number: { d: "is the positive real number for which you want the natural logarithm" } } }, LOG: { s: "Returns the logarithm of a number to the base you specify", p: { number: { d: "is the positive real number for which you want the logarithm" }, base: { d: "is the base of the logarithm", v: 10 } } }, LOG10: { s: "Returns the base-10 logarithm of a number", p: { number: { d: "is the positive real number for which you want the base-10 logarithm" } } }, MDETERM: { s: "Returns the matrix determinant of an array", p: { array: { d: "is a numeric array with an equal number of rows and columns, either a cell range or an array constant" } } }, MINVERSE: { s: "Returns the inverse matrix for the matrix stored in an array", p: { array: { d: "is a numeric array with an equal number of rows and columns, either a cell range or an array constant" } } }, MMULT: { s: "Returns the matrix product of two arrays, an array with the same number of rows as array1 and columns as array2", p: { array1: { d: "is the first array of numbers to multiply and must have the same number of columns as Array2 has rows" }, array2: { d: "is the second array of numbers to multiply and must have the same number of columns as Array1 has rows" } } }, MOD: { s: "Returns the remainder after a number is divided by a divisor", p: { number: { d: "is the number for which you want to find the remainder after the division is performed" }, divisor: { d: "is the number by which you want to divide Number" } } }, MROUND: { s: "Returns a number rounded to the desired multiple", p: { number: { d: "is the value to round" }, multiple: { d: "is the multiple to which you want to round number" } } }, MULTINOMIAL: { s: "Returns the multinomial of a set of numbers", p: { number: { d: "number1,number2,... are 1 to 255 values for which you want the multinomial" } } }, MUNIT: { s: "Returns the unit matrix for the specified dimension", p: { dimension: { d: "is an integer specifying the dimension of the unit matrix that you want to return" } } }, ODD: { s: "Rounds a positive number up and negative number down to the nearest odd integer", p: { number: { d: "is the value to round" } } }, PI: { s: "Returns the value of Pi, 3.14159265358979, accurate to 15 digits", p: {} }, POWER: { s: "Returns the result of a number raised to a power", p: { number: { d: "is the base number, any real number" }, power: { d: "is the exponent, to which the base number is raised" } } }, PRODUCT: { s: "Multiplies all the numbers given as arguments", p: { number: { d: "number1,number2,... are 1 to 255 numbers, logical values, or text representations of numbers that you want to multiply" } } }, QUOTIENT: { s: "Returns the integer portion of a division", p: { numerator: { d: "is the dividend" }, denominator: { d: "is the divisor" } } }, RADIANS: { s: "Converts degrees to radians", p: { angle: { d: "is an angle in degrees that you want to convert" } } }, RAND: { s: "Returns a random number greater than or equal to 0 and less than 1, evenly distributed (changes on recalculation)", p: {} }, RANDARRAY: { s: "Returns an array of random numbers", p: { rows: { d: "the number of rows in the returned array", v: 1 }, columns: { d: "the number of columns in the returned array", v: 1 }, min: { d: "the minimum number you would like returned", v: 0 }, max: { d: "the maximum number you would like returned", v: 1 }, integer: { d: "return an integer or a decimal value. TRUE for an integer, FALSE for a decimal number", v: !1 } } }, RANDBETWEEN: { s: "Returns a random number between the numbers you specify", p: { bottom: { d: "is the smallest integer RANDBETWEEN will return" }, top: { d: "is the largest integer RANDBETWEEN will return" } } }, ROMAN: { s: "Converts an Arabic numeral to Roman, as text", p: { number: { d: "is the Arabic numeral you want to convert" }, form: { d: "is the number specifying the type of Roman numeral you want.", v: 0 } } }, ROUND: { s: "Rounds a number to a specified number of digits", p: { number: { d: "is the number you want to round" }, numDigits: { d: "is the number of digits to which you want to round. Negative rounds to the left of the decimal point to the nearest integer" } } }, ROUNDDOWN: { s: "Rounds a number down, toward zero", p: { number: { d: "is any real number that you want rounded down" }, numDigits: { d: "is the number of digits to which you want to round. Negative rounds to the left of the decimal point to the nearest integer" } } }, ROUNDUP: { s: "Rounds a number up, away from zero", p: { number: { d: "is any real number that you want rounded up" }, numDigits: { d: "is the number of digits to which you want to round. Negative rounds to the left of the decimal point to the nearest integer" } } }, SEQUENCE: { s: "Returns a sequence of numbers", p: { rows: { d: "the number of rows to return" }, columns: { d: "the number of columns to return", v: 1 }, start: { d: "the first number in the sequence", v: 1 }, step: { d: "the amount to increment each subsequent value in the sequence", v: 1 } } }, SERIESSUM: { s: "Returns the sum of a power series based on the formula", p: { x: { d: "is the input value to the power series" }, n: { d: "is the initial power to which you want to raise x" }, m: { d: "is the step by which to increase n for each term in the series" }, coefficients: { d: "is a set of coefficients by which each successive power of x is multiplied" } } }, SIGN: { s: "Returns the sign of a number: 1 if the number is positive, zero if the number is zero, or -1 if the number is negative", p: { number: { d: "is any real number" } } }, SQRT: { s: "Returns the square root of a number", p: { number: { d: "is the number for which you want the square root" } } }, SQRTPI: { s: "Returns the square root of (number * Pi)", p: { number: { d: "is the number by which p is multiplied" } } }, SUBTOTAL: { s: "Returns a subtotal in a list or database", p: { functionNum: { d: "is the number 1 to 11 that specifies the summary function for the subtotal." }, ref: { d: "ref1,ref2,... are 1 to 254 ranges or references for which you want the subtotal" } }, h: "Unimplemented" }, SUM: { s: "Adds all the numbers in a range of cells", p: { number: { d: "number1,number2,... are 1 to 255 numbers to sum. Logical values and text are ignored in cells, included if typed as arguments" } } }, SUMIF: { s: "Adds the cells specified by a given condition or criteria", p: { range: { d: "is the range of cells you want evaluated" }, criteria: { d: "is the condition or criteria in the form of a number, expression, or text that defines which cells will be added" }, sumRange: { d: "are the actual cells to sum. If omitted, the cells in range are used" } }, h: "Unimplemented" }, SUMIFS: { s: "Adds the cells specified by a given set of conditions or criteria", p: { sumRange: { d: "are the actual cells to sum." }, criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want evaluated for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition or criteria in the form of a number, expression, or text that defines which cells will be added" } }, h: "Unimplemented" }, SUMPRODUCT: { s: "Returns the sum of the products of corresponding ranges or arrays", p: { array1: { d: "array1,array2,... are 2 to 255 arrays for which you want to multiply and then add components. All arrays must have the same dimensions" }, rest: {} } }, SUMSQ: { s: "Returns the sum of the squares of the arguments. The arguments can be numbers, arrays, names, or references to cells that contain numbers", p: { number: { d: "number1,number2,... are 1 to 255 numbers, arrays, names, or references to arrays for which you want the sum of the squares" } } }, SUMX2MY2: { s: "Sums the differences between the squares of two corresponding ranges or arrays", p: { arrayX: { d: "is the first range or array of numbers and can be a number or name, array, or reference that contains numbers" }, arrayY: { d: "is the second range or array of numbers and can be a number or name, array, or reference that contains numbers" } } }, SUMX2PY2: { s: "Returns the sum total of the sums of squares of numbers in two corresponding ranges or arrays", p: { arrayX: { d: "is the first range or array of numbers and can be a number or name, array, or reference that contains numbers" }, arrayY: { d: "is the second range or array of numbers and can be a number or name, array, or reference that contains numbers" } } }, SUMXMY2: { s: "Sums the squares of the differences in two corresponding ranges or arrays", p: { arrayX: { d: "is the first range or array of numbers and can be a number or name, array, or reference that contains numbers" }, arrayY: { d: "is the second range or array of numbers and can be a number or name, array, or reference that contains numbers" } } }, TRUNC: { s: "Truncates a number to an integer by removing the decimal, or fractional, part of the number", p: { number: { d: "is the number you want to truncate" }, numDigits: { d: "is a number specifying the precision of the truncation", v: 0 } } } };
-export {
-  e as default
-};

package/cdn/assets/3SiPV9yNzSbQVINg.js

@@ -1,10 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const e = { AVEDEV: { s: "Returns the average of the absolute deviations of data points from their mean. Arguments can be numbers or names, arrays, or references that contain numbers", p: { number: { d: "number1,number2,... are 1 to 255 arguments for which you want the average of the absolute deviations" } } }, AVERAGE: { s: "Returns the average (arithmetic mean) of its arguments, which can be numbers or names, arrays, or references that contain numbers", p: { number: { d: "number1,number2,... are 1 to 255 numeric arguments for which you want the average" } } }, AVERAGEA: { s: "Returns the average (arithmetic mean) of its arguments, evaluating text and FALSE in arguments as 0; TRUE evaluates as 1. Arguments can be numbers, names, arrays, or references", p: { value: { d: "value1,value2,... are 1 to 255 arguments for which you want the average" } } }, AVERAGEIF: { s: "Finds average(arithmetic mean) for the cells specified by a given condition or criteria", p: { range: { d: "is the range of cells you want evaluated" }, criteria: { d: "is the condition or criteria in the form of a number, expression, or text that defines which cells will be used to find the average" }, averageRange: { d: "are the actual cells to be used to find the average. If omitted, the cells in range are used" } }, h: "Unimplemented" }, AVERAGEIFS: { s: "Finds average(arithmetic mean) for the cells specified by a given set of conditions or criteria", p: { averageRange: { d: "are the actual cells to be used to find the average." }, criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want evaluated for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition or criteria in the form of a number, expression, or text that defines which cells will be used to find the average" } }, h: "Unimplemented" }, COUNT: { s: "Counts the number of cells in a range that contain numbers", p: { number: { d: "value1,value2,... are 1 to 255 arguments that can contain or refer to a variety of different types of data, but only numbers are counted" } } }, COUNTA: { s: "Counts the number of cells in a range that are not empty", p: { value: { d: "value1,value2,... are 1 to 255 arguments representing the values and cells you want to count. Values can be any type of information" } } }, COUNTBLANK: { s: "Counts the number of empty cells in a specified range of cells", p: { range: { d: "is the range from which you want to count the empty cells" } }, h: "Unimplemented" }, COUNTIF: { s: "Counts the number of cells within a range that meet the given condition", p: { range: { d: "is the range of cells from which you want to count nonblank cells" }, criteria: { d: "is the condition in the form of a number, expression, or text that defines which cells will be counted" } }, h: "Unimplemented" }, COUNTIFS: { s: "Counts the number of cells specified by a given set of conditions or criteria", p: { criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want evaluated for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition in the form of a number, expression, or text that defines which cells will be counted" } }, h: "Unimplemented" }, LARGE: { s: "Returns the k-th largest value in a data set. For example, the fifth largest number.", p: { array: { d: "is the array or range of data for which you want to determine the k-th largest value." }, k: { d: "is the position (from the largest) in the array or cell range of the value to return." } } }, MAX: { s: "Returns the largest value in a set of values. Ignores logical values and text", p: { number: { d: "number1,number2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the maximum" } } }, MAXA: { s: "Returns the largest value in a set of values. Does not ignore logical values and text", p: { value: { d: "value1,value2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the maximum" } } }, MAXIFS: { s: "Returns the maximum value among cells specified by a given set of conditions or criteria", p: { maxRange: { d: "the cells in which to determine the maximum value" }, criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want to evaluate for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition or criteria in the form of a number, expression, or text that defines which cells will be included when determining the maximum value" } }, h: "Unimplemented" }, MEDIAN: { s: "Returns the median, or the number in the middle of the set of given numbers", p: { number: { d: "number1,number2,... are 1 to 255 numbers or names, arrays, or references that contain numbers for which you want the median" } } }, MIN: { s: "Returns the smallest number in a set of values. Ignores logical values and text", p: { number: { d: "number1,number2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the minimum" } } }, MINA: { s: "Returns the smallest value in a set of values. Does not ignore logical values and text", p: { value: { d: "value1,value2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the minimum" } } }, MINIFS: { s: "Returns the minimum value among cells specified by a given set of conditions or criteria", p: { maxRange: { d: "is the range of cells to evaluate for the minimum value" }, criteriaRange: { d: "is the range of cells to evaluate against the criteria" }, criteria: { d: "is the criteria to evaluate against the criteria range" } }, h: "Unimplemented" }, PERMUT: { s: "Returns the number of permutations for a given number of objects that can be selected from the total objects", p: { number: { d: "is the total number of objects" }, numberChoosen: { d: "is the number of objects in each permutation" } }, h: "Unimplemented" }, PERMUTATIONA: { s: "Returns the number of permutations for a given number of objects (with repetitions) that can be selected from the total objects", p: { number: { d: "is the total number of objects" }, numberChoosen: { d: "is the number of objects in each permutation" } }, h: "Unimplemented" }, SMALL: { s: "Returns the k-th smallest value in a data set. For example, the fifth smallest number", p: { array: { d: "is an array or range of numerical data for which you want to determine the k-th smallest value" }, k: { d: "is the position (from the smallest) in the array or range of the value to return" } } } };
-export {
-  e as default
-};

package/cdn/assets/6CkscKSECxQpy0v6.js

@@ -1,10 +0,0 @@
-/**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.3.4
- *
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
- * License: The license can be found at https://www.sheetxl.com/license.
- */
-const e = { ACOS: { s: "Returns the arccosine of a number, in radians in the range 0 to Pi. The arccosine is the angle whose cosine is Number", p: { number: { d: "is the cosine of the angle you want and must be from -1 to 1" } } }, ACOSH: { s: "Returns the inverse hyperbolic cosine of a number", p: { number: { d: "is any real number equal to or greater than 1" } } }, ACOT: { s: "Returns the arccotangent of a number, in radians in the range 0 to Pi.", p: { number: { d: "is the cotangent of the angle you want" } } }, ACOTH: { s: "Returns the inverse hyperbolic cotangent of a number", p: { number: { d: "is the hyperbolic cotangent of the angle that you want" } } }, ASIN: { s: "Returns the arcsine of a number in radians, in the range -Pi/2 to Pi/2", p: { number: { d: "is the sine of the angle you want and must be from -1 to 1" } } }, ASINH: { s: "Returns the inverse hyperbolic sine of a number", p: { number: { d: "is any real number equal to or greater than 1" } } }, ATAN: { s: "Returns the arctangent of a number in radians, in the range -Pi/2 to Pi/2", p: { number: { d: "is the tangent of the angle you want" } } }, ATAN2: { s: "Returns the arctangent of the specified x- and y- coordinates, in radians between -Pi and Pi, excluding -Pi", p: { x: { d: "is the x-coordinate of the point" }, y: { d: "is the y-coordinate of the point" } } }, ATANH: { s: "Returns the inverse hyperbolic tangent of a number", p: { number: { d: "is any real number between -1 and 1 excluding -1 and 1" } } }, COS: { s: "Returns the cosine of an angle", p: { number: { d: "is the angle in radians for which you want the cosine" } } }, COSH: { s: "Returns the hyperbolic cosine of a number", p: { number: { d: "is any real number" } } }, COT: { s: "Returns the cotangent of an angle", p: { number: { d: "is the angle in radians for which you want the cotangent" } } }, COTH: { s: "Returns the hyperbolic cotangent of a number", p: { number: { d: "is the angle in radians for which you want the hyperbolic cotangent" } } }, CSC: { s: "Returns the cosecant of an angle", p: { number: { d: "is the angle in radians for which you want the cosecant" } } }, CSCH: { s: "Returns the hyperbolic cosecant of an angle", p: { number: { d: "is the angle in radians for which you want the hyperbolic cosecant" } } }, SEC: { s: "Returns the secant of an angle", p: { number: { d: "is the angle in radians for which you want the secant" } } }, SECH: { s: "Returns the hyperbolic secant of an angle", p: { number: { d: "is the angle in radians for which you want the hyperbolic secant" } } }, SIN: { s: "Returns the sine of an angle", p: { number: { d: "is the angle in radians for which you want the sine. Degrees * PI()/180 = radians" } } }, SINH: { s: "Returns the hyperbolic sine of a number", p: { number: { d: "is any real number" } } }, TAN: { s: "Returns the tangent of an angle", p: { number: { d: "is the angle in radians for which you want the tangent. Degrees * PI()/180 = radians" } } }, TANH: { s: "Returns the hyperbolic tangent of a number", p: { number: { d: "is any real number" } } } };
-export {
-  e as default
-};