@sheetxl/sdk 0.8.0-beta.1 → 0.8.0-beta.11

package/browser/esm/zlLuW405RSguy4Kn.mjs

@@ -0,0 +1,357 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { t as e } from "./CU3DmJ-YnVVrC1_k.mjs";
+import { _n as t, bn as n, hr as r, li as i, vn as a, vr as o, xn as s, yn as c } from "./C16ycKja6zG0crV_.mjs";
+import { ExpectedError as l, messageKey as u, t as d } from "@sheetxl/utils";
+var f = "SlicerStyleLight1", p = "ascending", m = "showItemsWithDataAtTop", h = u("op.setSlicerCaption"), g = u("op.setSlicerStyle"), _ = u("op.setSlicerLayout"), v = u("op.setSlicerSort"), y = u("op.selectSlicerItems"), b = r.BuiltInSelectorNames.Display, x = Object.freeze({
+	selector: b,
+	scope: "column"
+}), S = Object.freeze({ transactional: !1 }), C = class extends e {
+	constructor(e) {
+		let t = c(e.json?.source)?.column ?? "", n = e.name;
+		!n && e.getMovable && (n = t || null), super({
+			...e,
+			name: n
+		}), this._formula = null, this._wired = null, this._binding = null, this._lossPending = !1, this._columnName = t;
+		let r = e.json;
+		r && this._updateState({ data: { ...r } }), r?.source && this._addWatch(r.source, (e) => {
+			this._formula = e.formula, this._wired ??= e.formula.getExpression(), this._checkSource(!1);
+		});
+	}
+	getType() {
+		return "slicer";
+	}
+	getTypeDescription() {
+		return "Slicer";
+	}
+	getDefaultAnchorType() {
+		return o.Type.Absolute;
+	}
+	getSource() {
+		let e = this._data()?.source ?? "", t = this._formula?.getExpression() ?? null;
+		return t === null || t === this._wired ? e : t;
+	}
+	getTable() {
+		return this._resolve()?.table ?? null;
+	}
+	getColumn() {
+		return this._resolve()?.column ?? null;
+	}
+	setName(e) {
+		let t = this._getWorkbook();
+		if (t && s(t, e, this) !== e) throw new l(d("error.slicer.nameTaken", { name: e }));
+		return super.setName(e);
+	}
+	getCaption() {
+		return this._data()?.caption ?? this._getColumnName();
+	}
+	setCaption(e, t) {
+		return this._set({ caption: e ?? void 0 }, h, t);
+	}
+	isShowCaption() {
+		return !0 !== this._data()?.hiddenCaption;
+	}
+	setShowCaption(e, t) {
+		return this._set({ hiddenCaption: !e || void 0 }, h, t);
+	}
+	getCacheName() {
+		return this._data()?.cacheName || (n(this._getWorkbook()).get(this) ?? t(this._getColumnName()));
+	}
+	getStyle() {
+		return this._data()?.style ?? f;
+	}
+	setStyle(e, t) {
+		return this._set({ style: e && e !== f ? e : void 0 }, g, t);
+	}
+	getSortOrder() {
+		return this._data()?.sortOrder ?? p;
+	}
+	setSortOrder(e, t) {
+		return this._set({ sortOrder: e === p ? void 0 : e }, v, t);
+	}
+	getCrossFilter() {
+		return this._data()?.crossFilter ?? m;
+	}
+	setCrossFilter(e, t) {
+		return this._set({ crossFilter: e === m ? void 0 : e }, v, t);
+	}
+	getColumnCount() {
+		return this._data()?.columnCount ?? 1;
+	}
+	setColumnCount(e, t) {
+		let n = Math.max(1, Math.trunc(e));
+		return this._set({ columnCount: n === 1 ? void 0 : n }, _, t);
+	}
+	getRowHeight() {
+		return this._data()?.rowHeight ?? 27;
+	}
+	setRowHeight(e, t) {
+		let n = Math.max(1, e);
+		return this._set({ rowHeight: n === 27 ? void 0 : n }, _, t);
+	}
+	isLockedPosition() {
+		return !0 === this._data()?.lockedPosition;
+	}
+	setLockedPosition(e, t) {
+		return this._set({ lockedPosition: e || void 0 }, _, t);
+	}
+	isFilterCleared() {
+		return !this.getColumn()?.getFilter()?.getCondition();
+	}
+	async getItems() {
+		let e = this.getColumn()?.getFilter();
+		if (!e) return w;
+		let t = await e.getItems(x), n = e.getCondition(), a = n ? function(e, t) {
+			let n = e.toJSON();
+			if (n.operator !== r.BuiltInOperatorNames.InSet) return () => !1;
+			let i = n.param ?? {}, a = /* @__PURE__ */ new Set(), o = i.items ?? [];
+			for (let e = 0; e < o.length; e++) o[e] !== null && a.add(String(o[e]).toLowerCase());
+			let s = i.dateGroups ?? [], c = t.dates?.[t.dates.length - 1] ?? null;
+			return (e) => {
+				if (e < 0) return !0 === i.blank;
+				if (a.has(t.items[e].text.toLowerCase())) return !0;
+				if (!c || s.length === 0) return !1;
+				let n = null;
+				for (let t = 0; t < c.runs.length && !n; t++) {
+					let r = c.runs[t];
+					r.min <= e && e <= r.max && (n = r.value ?? null);
+				}
+				if (!n) return !1;
+				for (let e = 0; e < s.length; e++) if (D(s[e], n)) return !0;
+				return !1;
+			};
+		}(n, t) : null, o = [];
+		for (let e = 0; e < t.items.length; e++) {
+			let n = t.items[e], r = !0 === n.passesOthers;
+			o.push({
+				item: {
+					key: n.text,
+					name: n.text,
+					value: n.value,
+					hasData: r,
+					isSelected: !a || (r ? n.checked : a(e))
+				},
+				firstRow: n.firstRow
+			});
+		}
+		let s = this.getSortOrder();
+		if (s === "dataSource") o.sort((e, t) => e.firstRow - t.firstRow);
+		else {
+			let t = e.getRange().getWorksheet().getRuntime().getLocaleProfile(), n = s === "descending" ? -1 : 1;
+			o.sort((e, r) => n * (i.compare(e.item.value, r.item.value, t) || i.compare(e.item.key, r.item.key, t)));
+		}
+		let c = null;
+		if (t.hasBlanks) {
+			let e = !0 === t.blanksPassOthers;
+			c = {
+				key: T,
+				name: d("slicer.blankItem"),
+				value: null,
+				hasData: e,
+				isSelected: !a || (e ? t.blanksChecked : a(-1))
+			};
+		}
+		let l = [], u = this.getCrossFilter();
+		if (u === "showItemsWithNoData") {
+			for (let e = 0; e < o.length; e++) l.push(o[e].item);
+			return c && l.push(c), l;
+		}
+		for (let e = 0; e < o.length; e++) o[e].item.hasData && l.push(o[e].item);
+		if (c?.hasData && l.push(c), u === "none") return l;
+		for (let e = 0; e < o.length; e++) o[e].item.hasData || l.push(o[e].item);
+		return c && !c.hasData && l.push(c), l;
+	}
+	async getItem(e) {
+		let t = await this.getItems();
+		for (let n = 0; n < t.length; n++) if (t[n].key === e) return t[n];
+		return null;
+	}
+	async selectItems(e, t) {
+		let n = this.getColumn()?.getFilter();
+		if (!n) return this;
+		if (!e || e.length === 0) return this.clearFilters(t);
+		let i = await n.getItems(x), a = new Set(e), o = i.dates?.[i.dates.length - 1] ?? null, s = o && o.runs.length > 0 ? o.runs[o.runs.length - 1].max : -1, c = [], l = [], u = !0, d = 0;
+		for (let e = 0; e < i.items.length; e++) {
+			if (!a.has(i.items[e].text)) {
+				u = !1;
+				continue;
+			}
+			if (e > s) {
+				c.push(i.items[e].text);
+				continue;
+			}
+			for (; o.runs[d].max < e;) d++;
+			let t = o.runs[d].value;
+			t && l[l.length - 1] !== t && l.push(t);
+		}
+		let f = i.hasBlanks && a.has(T);
+		if (i.hasBlanks && !f && (u = !1), u && !i.truncated) return this.clearFilters(t);
+		let p = { items: c };
+		return l.length > 0 && (p.dateGroups = l), f && (p.blank = !0), await n.setCondition({
+			selector: b,
+			operator: r.BuiltInOperatorNames.InSet,
+			param: p
+		}, !1, {
+			description: y,
+			...t
+		}), this;
+	}
+	async clearFilters(e) {
+		return await this.getColumn()?.getFilter()?.delete(e), this;
+	}
+	addListeners(e, t) {
+		let n = super.addListeners(e, t);
+		if (!this._binding) {
+			let e = this._resolve();
+			e && this._bind(e);
+		}
+		return n;
+	}
+	toJSON(e) {
+		let t = this._data();
+		if (!t) return null;
+		let n = this.getSource();
+		return n ? {
+			...t,
+			source: n
+		} : t;
+	}
+	get isISlicer() {
+		return !0;
+	}
+	get [Symbol.toStringTag]() {
+		return "[Slicer]";
+	}
+	toString() {
+		return this.getTypeDescription();
+	}
+	_attach() {
+		this._checkSource(!0);
+	}
+	_data() {
+		return this._getState()?.data ?? null;
+	}
+	_getWorkbook() {
+		try {
+			return this.getMovable()?.getRange().getWorksheet().getWorkbook() ?? null;
+		} catch {
+			return null;
+		}
+	}
+	_resolve() {
+		if (this._closed) return null;
+		let e = c(this.getSource());
+		if (!e) return null;
+		let t = a(this._getWorkbook(), e.table), n = t?.getColumnByName(e.column) ?? null;
+		return n ? (this._columnName = n.getName(), {
+			table: t,
+			column: n
+		}) : null;
+	}
+	_getColumnName() {
+		return this._resolve()?.column.getName() ?? this._columnName;
+	}
+	_checkSource(e) {
+		if (this._closed || this.isDeleted()) return;
+		let t = this._resolve();
+		if (t) return void this._bind(t);
+		let n = this._getTransactions();
+		n.isRestoring() || (n.isOpenTransaction() ? this.delete() : e && !this._lossPending && (this._lossPending = !0, queueMicrotask(() => {
+			if (this._lossPending = !1, this._closed || this.isDeleted() || n.isOpenTransaction() || n.isRestoring()) return;
+			let e = this._resolve();
+			e ? this._bind(e) : n.amend(n.getCurrentCommit(!1).getId(), () => {
+				this.delete();
+			});
+		})));
+	}
+	_bind(e) {
+		let t = e.table;
+		if (this._binding?.table !== t) {
+			this._unbind();
+			let e = () => {
+				this._checkSource(!0);
+			};
+			this._binding = {
+				table: t,
+				removeTable: t.addListeners({
+					onFilterChange: () => {
+						this._notify("onSelectionChange");
+					},
+					onAnyChange: () => {
+						this._checkSource(!0), this._bindRange(!0);
+					},
+					onAnchorCoordsChange: () => {
+						this._bindRange(!0);
+					},
+					onDelete: e
+				}, S),
+				coords: null,
+				removeRange: null
+			};
+		}
+		this._bindRange(!1);
+	}
+	_bindRange(e) {
+		let t = this._binding;
+		if (!t || this._closed) return;
+		let n = this.getColumn()?.getFilter()?.getRange() ?? null, r = n ? n.getCoords() : null;
+		(r && t.coords ? r.rowStart !== t.coords.rowStart || r.rowEnd !== t.coords.rowEnd || r.colStart !== t.coords.colStart || r.colEnd !== t.coords.colEnd : r !== t.coords) && (t.removeRange?.(), t.removeRange = n?.addListener(() => {
+			this._notify("onItemsChange");
+		}, {
+			ignoreAddressChanges: !0,
+			...S
+		}) ?? null, t.coords = r, e && this._notify("onItemsChange"));
+	}
+	_unbind() {
+		let e = this._binding;
+		e && (this._binding = null, e.removeTable(), e.removeRange?.());
+	}
+	_notify(e) {
+		this._closed || this.isDeleted() || (this._emitter.notify(e), this._emitter.notify("onAnyChange"));
+	}
+	_set(e, t, n) {
+		this._protectionCheck(t);
+		let r = this._data();
+		if (!r) return this;
+		let i = {
+			...r,
+			...e
+		};
+		for (let t in e) i[t] === void 0 && delete i[t];
+		return this._updateState({ data: i }, {
+			...n,
+			description: t
+		}, ["onAnyChange"]), this;
+	}
+	_processDelete() {
+		this._unbind(), super._processDelete();
+	}
+	_processRestoreOrRevert(e, t) {
+		if (super._processRestoreOrRevert(e, t), this.isDeleted()) return void this._unbind();
+		let n = this._resolve();
+		n && this._bind(n);
+	}
+	close() {
+		this._unbind(), super.close();
+	}
+}, w = Object.freeze([]), T = "", E = [
+	"year",
+	"month",
+	"day",
+	"hour",
+	"minute",
+	"second"
+];
+function D(e, t) {
+	for (let n = 0; n < E.length; n++) {
+		let r = E[n];
+		if (e[r] !== t[r]) return !1;
+		if (r === e.group) return !0;
+	}
+	return !0;
+}
+export { C as Slicer };

package/licenses/dependencies.txt

@@ -1,5 +1,5 @@
 Name: papaparse
-Version: 5.5.4
+Version: 5.7.0
 License: MIT
 Private: false
 Description: Fast and powerful CSV parser for the browser that supports web workers and streaming large files. Converts CSV to JSON and JSON to CSV.
@@ -32,8 +32,143 @@ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 ---
 
+Name: tiny-inflate
+Version: 1.0.3
+License: MIT
+Private: false
+Description: A tiny inflate implementation
+Repository: git://github.com/devongovett/tiny-inflate.git
+Homepage: https://github.com/devongovett/tiny-inflate
+Author: Devon Govett <devongovett@gmail.com>
+License Text:
+===
+
+MIT License
+
+Copyright (c) 2015-present Devon Govett
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+---
+
+Name: unicode-trie
+Version: 2.0.0
+License: MIT
+Private: false
+Description: Unicode Trie data structure for fast character metadata lookup, ported from ICU
+Repository: git://github.com/devongovett/unicode-trie.git
+Homepage: https://github.com/devongovett/unicode-trie
+Author: Devon Govett <devongovett@gmail.com>
+License Text:
+===
+
+Copyright 2018
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---
+
+Name: base64-js
+Version: 0.0.8
+License: MIT
+Private: false
+Description: Base64 encoding/decoding in pure JS
+Repository: git://github.com/beatgammit/base64-js.git
+Author: T. Jameson Little <t.jameson.little@gmail.com>
+License Text:
+===
+
+The MIT License (MIT)
+
+Copyright (c) 2014
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+---
+
+Name: linebreak
+Version: 1.1.0
+License: MIT
+Private: false
+Description: An implementation of the Unicode Line Breaking Algorithm (UAX #14)
+Repository: https://github.com/devongovett/linebreaker.git
+Homepage: https://github.com/devongovett/linebreaker
+Author: Devon Govett <devongovett@gmail.com>
+License Text:
+===
+
+MIT License
+
+Copyright (c) 2014-present Devon Govett
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN 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: @chevrotain/utils
-Version: 13.0.0
+Version: 13.2.0
 License: Apache-2.0
 Private: false
 Description: common utilities
@@ -248,7 +383,7 @@ License Text:
 ---
 
 Name: @chevrotain/gast
-Version: 13.0.0
+Version: 13.2.0
 License: Apache-2.0
 Private: false
 Description: Grammar AST structure for Chevrotain Parsers
@@ -462,7 +597,7 @@ License Text:
 ---
 
 Name: chevrotain
-Version: 13.0.0
+Version: 13.2.0
 License: Apache-2.0
 Private: false
 Description: Chevrotain is a high performance fault tolerant javascript parsing DSL for building recursive decent parsers
@@ -678,7 +813,7 @@ License Text:
 ---
 
 Name: @chevrotain/regexp-to-ast
-Version: 13.0.0
+Version: 13.2.0
 License: Apache-2.0
 Private: false
 Description: Parses a Regular Expression and outputs an AST
@@ -891,143 +1026,8 @@ License Text:
 
 ---
 
-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
-Private: false
-Description: A tiny inflate implementation
-Repository: git://github.com/devongovett/tiny-inflate.git
-Homepage: https://github.com/devongovett/tiny-inflate
-Author: Devon Govett <devongovett@gmail.com>
-License Text:
-===
-
-MIT License
-
-Copyright (c) 2015-present Devon Govett
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-
----
-
-Name: unicode-trie
-Version: 2.0.0
-License: MIT
-Private: false
-Description: Unicode Trie data structure for fast character metadata lookup, ported from ICU
-Repository: git://github.com/devongovett/unicode-trie.git
-Homepage: https://github.com/devongovett/unicode-trie
-Author: Devon Govett <devongovett@gmail.com>
-License Text:
-===
-
-Copyright 2018
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
----
-
-Name: base64-js
-Version: 0.0.8
-License: MIT
-Private: false
-Description: Base64 encoding/decoding in pure JS
-Repository: git://github.com/beatgammit/base64-js.git
-Author: T. Jameson Little <t.jameson.little@gmail.com>
-License Text:
-===
-
-The MIT License (MIT)
-
-Copyright (c) 2014
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----
-
-Name: linebreak
-Version: 1.1.0
-License: MIT
-Private: false
-Description: An implementation of the Unicode Line Breaking Algorithm (UAX #14)
-Repository: https://github.com/devongovett/linebreaker.git
-Homepage: https://github.com/devongovett/linebreaker
-Author: Devon Govett <devongovett@gmail.com>
-License Text:
-===
-
-MIT License
-
-Copyright (c) 2014-present Devon Govett
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-
----
-
 Name: lru-cache
-Version: 11.5.2
+Version: 11.5.3
 License: BlueOak-1.0.0
 Private: false
 Description: A cache object that deletes the least-recently-used items.