@sheetxl/sdk 0.8.0-beta.10 → 0.8.0-beta.12

package/browser/esm/yuhcOYw6SHQ-RCm3.mjs

@@ -0,0 +1,114 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.12
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { Jn as e, Xr as t, Zn as n, Zr as r, br as i, ht as a, mn as o, pt as s, rr as c, zn as l } from "./BudSIfXBAsTxvu-K.mjs";
+import { C as u, E as d, T as f, h as p, i as m, r as h, w as g, x as _, y as v } from "./w6Jea0TiclPrYZ2M.mjs";
+import { n as y, r as b, t as x } from "./CndRBvVfQUJIYRRj.mjs";
+import { i as S, r as C } from "./C9u8FUewte5ugUjH.mjs";
+import { a as w, n as T } from "./CdEO8CEee6lEhabA.mjs";
+import { ScalarType as E } from "@sheetxl/primitives";
+import D from "@sheetxl/formulas/declarations";
+import O from "@sheetxl/formulas-extended/declarations";
+var k = null;
+function A(e) {
+	return k ||= (() => {
+		let e = /* @__PURE__ */ new Map(), t = [
+			...D,
+			...O,
+			T
+		];
+		for (let { declarations: n, enums: r } of t) {
+			let t = /* @__PURE__ */ new Map(), i = (e) => {
+				let n = t.get(e);
+				if (!n) {
+					let i = r?.[e];
+					if (!i) return;
+					n = {
+						id: e,
+						type: i.s === "string" ? E.String : E.Number,
+						members: i.m
+					}, t.set(e, n);
+				}
+				return n;
+			};
+			for (let t of Object.keys(n)) {
+				let { decl: r } = w(t, n[t], i), a = new o(r);
+				e.set(t.toUpperCase(), {
+					getName: () => t,
+					getDeclaration: () => a,
+					isBuiltIn: () => !0
+				});
+			}
+		}
+		return e;
+	})(), k.get(e.toUpperCase()) ?? null;
+}
+var j = null, M = Object.freeze({
+	rowStart: 0,
+	colStart: 0,
+	rowEnd: r,
+	colEnd: t
+}), N = (e) => A(e);
+function P(e, t) {
+	if (typeof e != "string" || e.length === 0) return null;
+	j ||= new C();
+	let n = t?.anchor, r;
+	try {
+		let a = j.parse(n?.rowIndex ?? 0, n?.colIndex ?? 0, e);
+		if (a.errors.length > 0 || !a.root || a.root.type === i.Unparsed) return null;
+		if (r = a.root, t?.normalize) {
+			let e = g(r, N);
+			typeof e != "string" && (r = e), r = d(r, N), r = h(r, N), r = v(r), r = f(r), r = u(r), r = m(r), r = _(r);
+		}
+	} catch {
+		return null;
+	}
+	return y(r, null);
+}
+function F(e, t) {
+	return b(e, t);
+}
+function I(e, t) {
+	let n = p(h(v(x(e)), N)), r = t?.entireCoords ?? M, i = !0 === t?.r1c1;
+	return (e) => i ? a(n, r) : s(n, r, e?.rowIndex ?? 0, e?.colIndex ?? 0);
+}
+function L(t) {
+	let r = t.trim();
+	if (!r) return;
+	let i;
+	try {
+		let e = S.shared().tokenize(r, !1);
+		if (e.errors.length > 0) return;
+		i = e.tokens;
+	} catch {
+		return;
+	}
+	let a = 0, o = 0;
+	if (i.length === 2) {
+		let e = i[0].tokenType?.name;
+		e === "MinOp" ? (a = -1, o = 1) : e === "PlusOp" && (a = 1, o = 1);
+	}
+	if (i.length - o !== 1) return;
+	let s = i[o], u = s.image;
+	try {
+		switch (s.tokenType?.name) {
+			case "NumberToken":
+			case "ScientificDigit":
+			case "DigitToken": {
+				let e = n(u).value;
+				return a === 0 ? e : a * e;
+			}
+			case "StringToken": return a === 0 ? c(u).value : void 0;
+			case "BooleanToken": return a === 0 ? l(u).value : void 0;
+			case "LiteralError":
+			case "RefError": return a === 0 ? e(u).value : void 0;
+			default: return;
+		}
+	} catch {
+		return;
+	}
+}
+export { A as getFunctionDeclaration, I as imager, P as parse, L as readFormulaLiteral, F as transform };

package/licenses/dependencies.txt

@@ -32,16 +32,6 @@ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 ---
 
-Name: css-font-parser
-Version: 2.0.1
-License: BSD-3-Clause
-Private: false
-Description: A parser for the CSS font value
-Repository: undefined
-Author: Bram Stein <b.l.stein@gmail.com> (http://www.bramstein.com)
-
----
-
 Name: tiny-inflate
 Version: 1.0.3
 License: MIT
@@ -167,71 +157,13 @@ SOFTWARE.
 
 ---
 
-Name: lru-cache
-Version: 11.5.3
-License: BlueOak-1.0.0
+Name: css-font-parser
+Version: 2.0.1
+License: BSD-3-Clause
 Private: false
-Description: A cache object that deletes the least-recently-used items.
-Repository: git+ssh://git@github.com/isaacs/node-lru-cache.git
-Author: Isaac Z. Schlueter <i@izs.me>
-License Text:
-===
-
-# Blue Oak Model License
-
-Version 1.0.0
-
-## Purpose
-
-This license gives everyone as much permission to work with
-this software as possible, while protecting contributors
-from liability.
-
-## Acceptance
-
-In order to receive this license, you must agree to its
-rules.  The rules of this license are both obligations
-under that agreement and conditions to your license.
-You must not do anything with this software that triggers
-a rule that you cannot or will not follow.
-
-## Copyright
-
-Each contributor licenses you to do everything with this
-software that would otherwise infringe that contributor's
-copyright in it.
-
-## Notices
-
-You must ensure that everyone who gets a copy of
-any part of this software from you, with or without
-changes, also gets the text of this license or a link to
-<https://blueoakcouncil.org/license/1.0.0>.
-
-## Excuse
-
-If anyone notifies you in writing that you have not
-complied with [Notices](#notices), you can keep your
-license by taking all practical steps to comply within 30
-days after the notice.  If you do not do so, your license
-ends immediately.
-
-## Patent
-
-Each contributor licenses you to do everything with this
-software that would otherwise infringe any patent claims
-they can license or become able to license.
-
-## Reliability
-
-No contributor can revoke this license.
-
-## No Liability
-
-***As far as the law allows, this software comes as is,
-without any warranty or condition, and no contributor
-will be liable to anyone for any damages related to this
-software or this license, under any kind of legal claim.***
+Description: A parser for the CSS font value
+Repository: undefined
+Author: Bram Stein <b.l.stein@gmail.com> (http://www.bramstein.com)
 
 ---
 
@@ -1090,4 +1022,72 @@ License Text:
    distributed under the License is distributed on an "AS IS" BASIS,
    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    See the License for the specific language governing permissions and
-   limitations under the License.
+   limitations under the License.
+
+---
+
+Name: lru-cache
+Version: 11.5.3
+License: BlueOak-1.0.0
+Private: false
+Description: A cache object that deletes the least-recently-used items.
+Repository: git+ssh://git@github.com/isaacs/node-lru-cache.git
+Author: Isaac Z. Schlueter <i@izs.me>
+License Text:
+===
+
+# Blue Oak Model License
+
+Version 1.0.0
+
+## Purpose
+
+This license gives everyone as much permission to work with
+this software as possible, while protecting contributors
+from liability.
+
+## Acceptance
+
+In order to receive this license, you must agree to its
+rules.  The rules of this license are both obligations
+under that agreement and conditions to your license.
+You must not do anything with this software that triggers
+a rule that you cannot or will not follow.
+
+## Copyright
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe that contributor's
+copyright in it.
+
+## Notices
+
+You must ensure that everyone who gets a copy of
+any part of this software from you, with or without
+changes, also gets the text of this license or a link to
+<https://blueoakcouncil.org/license/1.0.0>.
+
+## Excuse
+
+If anyone notifies you in writing that you have not
+complied with [Notices](#notices), you can keep your
+license by taking all practical steps to comply within 30
+days after the notice.  If you do not do so, your license
+ends immediately.
+
+## Patent
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe any patent claims
+they can license or become able to license.
+
+## Reliability
+
+No contributor can revoke this license.
+
+## No Liability
+
+***As far as the law allows, this software comes as is,
+without any warranty or condition, and no contributor
+will be liable to anyone for any damages related to this
+software or this license, under any kind of legal claim.***