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

package/node/esm/Ds0d8zXzmgOu3MGx.mjs

@@ -1,403 +0,0 @@
-/**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.10
-*
-* (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
-*/
-import { A as e, C as t, D as n, E as r, F as s, I as a, ICalculation as o, M as l, N as i, O as c, P as u, S as p, T as d, _ as f, b as h, g, j as x, k as m, v as y, w as v, x as I, y as _ } from "./index.mjs";
-import { FormulaError as b } from "@sheetxl/primitives";
-import { CommonUtils as T } from "@sheetxl/utils";
-var P = class {
-	constructor(e) {
-		e = { ...e }, this._editing = "editing" === e.profile, this._parser = new s(e);
-	}
-	compile(s, a, l, g, T, P, k, E, w) {
-		if (0 === g.length) {
-			const e = new b.Parse(i);
-			return this._compileUnparsed(s, T, g, {
-				input: g,
-				cause: e,
-				causes: [e]
-			});
-		}
-		if (g.length > o.MAX_EXPRESSION_LENGTH) {
-			const e = new b.Parse(u(g.length, o.MAX_EXPRESSION_LENGTH));
-			return this._compileUnparsed(s, T, g, {
-				input: g,
-				cause: e,
-				causes: [e]
-			});
-		}
-		let F, C, U = [];
-		try {
-			const e = this._parser.parse(a, l, g);
-			F = e.root, U = e.errors, E && F && 0 === U.length && (F.legacyIntersect = !0);
-		} catch (e) {
-			C = b.isError(e, b.Code.Parse) ? e : new b.Parse(e.message, e);
-		}
-		const z = [];
-		for (const e of U) z.push(n(e));
-		if (F) {
-			const e = m(F, P ?? null);
-			"string" == typeof e ? z.push(new b.Parse(e)) : F = e, v(F, P ?? null) && z.push(new b.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), t(F, P ?? null) && z.push(new b.Parse("The spill anchor operator '#' requires a cell or range")), r(F, P ?? null) && z.push(new b.Parse("Expected a reference; a value cannot be converted to one."));
-			const n = _(F, P ?? null);
-			n && z.push(new b.Parse(n));
-			const s = h(F, P ?? null);
-			s && z.push(new b.Parse(s));
-			const a = I(F, P ?? null);
-			a && z.push(new b.Parse(a));
-			const o = p(F);
-			o && z.push(new b.Parse(o));
-		}
-		z.length > 0 && !C && (C = z[0]);
-		let R = null;
-		if (C && (R = {
-			input: g,
-			cause: C,
-			causes: z.length > 0 ? z : [C]
-		}), !F) {
-			if (this._editing) {
-				const e = this._recoverCompiled(s, a, l, g, T, R, k);
-				if (e) return e;
-			}
-			return this._compileUnparsed(s, T, g, R, this._editing, () => A(T, k, a, l));
-		}
-		if (F = e(F, P ?? null), F = f(F, P ?? null), T) {
-			const e = this._editing ? w : {
-				mint: !w?.book,
-				...w
-			};
-			F = c(F, T, k, e, {
-				rowIndex: a,
-				colIndex: l
-			});
-			const t = d(F, T);
-			if (t) {
-				const e = new b.Parse(t);
-				z.push(e), R = {
-					input: g,
-					cause: R?.cause ?? e,
-					causes: R ? [...R.causes, e] : [e]
-				};
-			}
-		}
-		const S = y(s, T, F, this._editing, R, P ?? null);
-		if (this._editing && R && x(S.getTokens(), T) !== g) return this._recoverCompiled(s, a, l, g, T, R, k) || this._compileUnparsed(s, T, g, R, !0);
-		return S;
-	}
-	autoCorrect(e) {
-		const t = function(e) {
-			let t = 0, n = null;
-			for (let r = 0; r < e.length; r++) {
-				const s = e[r];
-				n ? s === n && (n = null) : t > 0 ? "'" === s ? r++ : "[" === s ? t++ : "]" === s && t-- : "\"" === s || "'" === s ? n = s : "[" === s && t++;
-			}
-			return n ? 0 : t;
-		}(e), n = e + "]".repeat(t);
-		let r;
-		try {
-			const e = this._parser.getLexer().tokenize(n, !1);
-			if (e.errors.length > 0) return null;
-			r = e.tokens;
-		} catch {
-			return null;
-		}
-		const s = [];
-		for (const e of r) {
-			const t = e.tokenType?.name;
-			if ("OpenParen" === t) s.push(")");
-			else if ("OpenCurlyParen" === t) s.push("}");
-			else if (("CloseParen" === t || "CloseCurlyParen" === t) && s.pop() !== ("CloseParen" === t ? ")" : "}")) return null;
-		}
-		return 0 === s.length && 0 === t ? null : n + s.reverse().join("");
-	}
-	_compileUnparsed(e, t, n, r, s = !1, o) {
-		const l = {
-			runtime: e,
-			symbols: t,
-			getFunction: null,
-			ast: null,
-			evaluations: T.EmptyArray,
-			executions: T.EmptyArray,
-			bindings: T.EmptyArray,
-			referencesAbsolute: T.EmptyArray,
-			referencesExecute: T.EmptyArray,
-			referencesRelative: T.EmptyArray,
-			referencesRoot: T.EmptyArray,
-			referenceIndices: T.EmptyArray,
-			formatReferenceIndices: T.EmptyArray,
-			getTokens: () => {
-				const e = [];
-				return s && F(e, n, void 0, o) ? e : [{
-					type: a.Unparsed,
-					value: n,
-					text: n
-				}];
-			},
-			namedIds: T.EmptyArray,
-			symbolIds: T.EmptyArray,
-			hasTotals: !1,
-			hasVolatile: !1,
-			isBlankCacheable: !1,
-			isBlankCacheableArray: !1,
-			isReferenceOnly: !1,
-			error: r,
-			transform: () => l
-		};
-		return l;
-	}
-	_recoverCompiled(e, t, n, r, s, o, l) {
-		let i, u = r.length;
-		try {
-			const e = this._parser.getLexer().tokenize(r, !1);
-			i = e.tokens, e.errors.length > 0 && (u = Math.min(u, e.errors[0].offset));
-		} catch {
-			return null;
-		}
-		const p = [];
-		for (let e = i.length - 1; e >= 0 && p.length < 24; e--) {
-			const t = (i[e].endOffset ?? -1) + 1;
-			t > 0 && t < r.length && t <= u && p.push(t);
-		}
-		for (const i of p) {
-			const u = r.slice(0, i);
-			let p, d;
-			try {
-				p = this._parser.parse(t, n, u).root;
-			} catch {
-				continue;
-			}
-			if (!p || p.type === a.Unparsed) continue;
-			try {
-				const r = f(p, null), a = s ? c(r, s, l, void 0, {
-					rowIndex: t,
-					colIndex: n
-				}) : r;
-				d = y(e, s, a, !0, o);
-			} catch {
-				continue;
-			}
-			if (x(d.getTokens(), s) !== u) continue;
-			const h = r.slice(i);
-			if (0 === h.length) return d;
-			let g;
-			const m = {
-				...d,
-				getTokens: () => (g || (g = [...d.getTokens()], this._appendUnparsedTail(g, h, () => A(s, l, t, n))), g),
-				transform: () => m
-			};
-			return m;
-		}
-		return null;
-	}
-	_appendUnparsedTail(e, t, n) {
-		const r = [];
-		for (const t of e) {
-			if (t.type === a.Whitespace) continue;
-			const e = t.type === a.Paren || t.type === a.Type ? t.text : void 0, n = r.length > 0 ? r[r.length - 1] : void 0;
-			if (t.type === a.Separator && n) {
-				const e = n.declared[n.declared.length - 1];
-				"let" === n.ctx?.type && -1 === n.ctx.argIndex && n.lambda?.argTokens === n.argTokens && e?.argIndex === n.argIndex - 1 && (e.params = n.lambda.params), n.argIndex++, n.argTokens = 0, n.lambda = void 0;
-				continue;
-			}
-			if (n && n.argTokens++, "(" === e || "[" === e || "{" === e) r.push({
-				ctx: t.context,
-				argIndex: 0,
-				declared: [],
-				argTokens: 0,
-				leadsArg: 2 === n?.argTokens
-			});
-			else if (")" === e || "]" === e || "}" === e) {
-				const e = r.pop(), t = r.length > 0 ? r[r.length - 1] : void 0;
-				t && e?.leadsArg && "lambda" === e.ctx?.type && -1 === e.ctx.argIndex && (t.lambda = {
-					params: e.declared.map(({ name: e, optional: t }) => t ? {
-						name: e,
-						optional: t
-					} : { name: e }),
-					argTokens: t.argTokens
-				});
-			} else if (t.type === a.Parameter && n && t.value?.declaration) {
-				const e = t.value;
-				n.declared.push(e.optional ? {
-					name: e.name,
-					argIndex: n.argIndex,
-					optional: !0
-				} : {
-					name: e.name,
-					argIndex: n.argIndex
-				});
-			}
-		}
-		const s = r.length > 0 ? r[r.length - 1] : void 0, o = s?.ctx ? {
-			...s.ctx,
-			argIndex: -1 === s.ctx.argIndex ? s.argIndex : s.ctx.argIndex
-		} : void 0;
-		if (o && -1 === s.ctx.argIndex && ("let" === o.type || "lambda" === o.type)) {
-			const e = "let" === o.type ? 2 : 1;
-			let t = o.bound;
-			for (const n of s.declared) {
-				if (o.argIndex < n.argIndex + e) continue;
-				const { name: r, params: s } = n;
-				t = g(t, s ? {
-					name: r,
-					params: s
-				} : { name: r });
-			}
-			t && (o.bound = t);
-		}
-		const l = (t, n) => {
-			const r = n ? {
-				type: a.Named,
-				value: { name: t },
-				text: t
-			} : {
-				type: a.Unparsed,
-				value: t,
-				text: t
-			};
-			o && (r.context = o), e.push(r);
-		};
-		if (F(e, t, o, n)) return;
-		const i = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), c = i ? i.index : -1;
-		let u = c > 0 ? t[c - 1] : "";
-		for (let t = e.length - 1; 0 === c && t >= 0 && !u; t--) u = e[t].text?.at(-1) ?? "";
-		c >= 0 && !/[A-Za-z0-9_.]/.test(u) ? (c > 0 && l(t.slice(0, c)), l(t.slice(c), !0)) : l(t);
-	}
-};
-function A(e, t, n, r) {
-	if (!e || !t) return;
-	const s = e.bind(l.Table, "", { at: {
-		scope: t,
-		rowIndex: n,
-		colIndex: r
-	} });
-	return s ? e.resolve(l.Table, s)?.toString() : void 0;
-}
-var k = /[A-Za-z_\\\u007F-\uFFFF][A-Za-z0-9_.\u007F-\uFFFF]*$/, E = /[A-Za-z0-9_.)\]}"'!#\u007F-\uFFFF]/;
-function w(e, t) {
-	for (let n = t + 1; n < e.length; n++) {
-		const t = e[n];
-		if ("'" !== t) {
-			if ("]" === t) return n + 1;
-			if ("[" === t) return null;
-		} else n++;
-	}
-	return -1;
-}
-function F(e, t, n, r) {
-	let s = 0, o = -1;
-	for (let e = 0; e < t.length; e++) {
-		const n = t[e];
-		s > 0 && "'" === n ? e++ : "[" === n ? (0 === s && (o = e), s++) : "]" === n && s > 0 && s--;
-	}
-	if (0 === s) return !1;
-	let l = t.slice(0, o);
-	if ((l.split("\"").length - 1) % 2 == 1) return !1;
-	const i = e.length > 0 ? e[e.length - 1] : void 0;
-	let c = "", u = !1;
-	const p = k.exec(l);
-	if (p) {
-		const e = p.index > 0 ? l[p.index - 1] : i?.text?.at(-1) ?? "";
-		if (/[A-Za-z0-9_.]/.test(e)) return !1;
-		c = p[0], l = l.slice(0, p.index);
-	} else 0 === l.length && i?.text && 0 === k.exec(i.text)?.index && (i.type === a.Named && !i.value?.scope || i.type === a.TableReference) && (c = i.text, u = !0);
-	if (!u) {
-		const e = l.length > 0 ? l[l.length - 1] : i?.text?.at(-1) ?? "";
-		if (e && E.test(e)) return !1;
-	}
-	const d = c || (r?.() ?? ""), f = [], h = (e, t, n) => {
-		f.push({
-			type: e,
-			value: t,
-			text: t,
-			context: {
-				name: d,
-				argIndex: n,
-				type: "table"
-			}
-		});
-	}, g = (e, t, n, r) => {
-		const s = e.startsWith("#"), o = n ? r ? "column" : s ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
-			table: d,
-			name: e,
-			partial: o
-		} : {
-			table: d,
-			name: e
-		};
-		f.push({
-			type: s ? a.TableSpecifier : a.TableColumn,
-			value: l,
-			text: e,
-			context: {
-				name: d,
-				argIndex: t,
-				type: "table"
-			}
-		});
-	}, x = (e, t, n, r) => {
-		h(a.Paren, "[", n), g(e.slice(1, t ? -1 : void 0), n, !t, r), t && h(a.Paren, "]", n);
-	};
-	h(a.Paren, "[", -1);
-	const m = t.slice(o + 1);
-	if (m.startsWith("[")) {
-		let e = 0, t = !1, n = 0;
-		for (; n < m.length;) {
-			const r = m[n];
-			if ("[" === r) {
-				const r = w(m, n);
-				if (null === r) return !1;
-				const s = -1 !== r;
-				if (x(m.slice(n, s ? r : m.length), s, e, t), t = !1, !s) break;
-				n = r;
-			} else if ("," === r) h(a.Separator, ",", e++), n++;
-			else if (":" === r) h(a.Infix, ":", e), n++;
-			else if ("@" === r) h(a.Prefix, "@", e), t = !0, n++;
-			else {
-				if (" " !== r) return !1;
-				{
-					let t = n;
-					for (; " " === m[t];) t++;
-					h(a.Whitespace, m.slice(n, t), e), n = t;
-				}
-			}
-		}
-	} else {
-		let e = m;
-		const t = e.startsWith("@");
-		if (t && (h(a.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
-			if (-1 !== w(e, 0)) return !1;
-			x(e, !1, 0, t);
-		} else {
-			if (/(^|[^'])[[\]]/.test(e) || e.startsWith("#") && e.includes(",")) return !1;
-			g(e, 0, !0, t);
-		}
-	}
-	if (l) {
-		const t = {
-			type: a.Unparsed,
-			value: l,
-			text: l
-		};
-		n && (t.context = n), e.push(t);
-	}
-	if (u) {
-		const t = {
-			...i,
-			type: a.TableReference,
-			value: c,
-			text: c
-		};
-		delete t.referenceIndex, e[e.length - 1] = t;
-	} else if (c) {
-		const t = {
-			type: a.TableReference,
-			value: c,
-			text: c
-		};
-		n && (t.context = n), e.push(t);
-	}
-	for (const t of f) e.push(t);
-	return !0;
-}
-export { P as FormulaCompiler, F as appendPartialStructuredReference };

package/types/src/chart/_ChartXml.d.ts

@@ -1,70 +0,0 @@
-/**
- * Reads what a chart's captured part can answer without a chart model behind it: what it plots,
- * what kind of chart it is, and what it and its axes are called.
- *
- * @remarks
- * An imported chart is kept as the source's markup ({@link IChart.JSON.part}) and replayed on save.
- * Both chart vocabularies are read — `c:chartSpace`, and `cx:chartSpace` for the chart types added
- * after it (waterfall, funnel, treemap, sunburst, histogram, box and whisker).
- *
- * Every formula in the part is also located ({@link ChartXmlFacts.slots}), because a formula is
- * the one thing in the part that is not replayed verbatim: see {@link writeChartFormulas}.
- */
-/** One formula in the part: its text, and where that text is in the markup. */
-export interface ChartFormulaSlot {
-    /** The formula as the part states it, entities decoded. */
-    text: string;
-    start: number;
-    end: number;
-}
-/** A piece of chart text: written in the chart, or read from a cell. */
-export interface ChartTextFacts {
-    /** The literal text, or what the cell held when the file was saved. */
-    text: string | null;
-    /** The {@link ChartXmlFacts.slots} index of the formula naming the cell, or `null` for a literal. */
-    slot: number | null;
-}
-/** A series dimension: the cells it reads, or the values written into the chart. */
-export interface ChartSourceFacts {
-    slot: number | null;
-    /** `{1,2,3}` — a dimension with no cells behind it. */
-    literal: string | null;
-}
-export interface ChartSeriesFacts {
-    type: string;
-    name: ChartTextFacts;
-    values: ChartSourceFacts;
-    categories: ChartSourceFacts;
-    secondary: boolean;
-}
-export interface ChartAxisFacts {
-    kind: 'category' | 'value' | 'date' | 'series';
-    title: ChartTextFacts;
-    numberFormat: string | null;
-}
-/** What {@link readChartXml} answers with. */
-export interface ChartXmlFacts {
-    type: string;
-    title: ChartTextFacts;
-    series: ChartSeriesFacts[];
-    axes: ChartAxisFacts[];
-    /** `c:pivotSource/c:name` — the pivot table a pivot chart draws, as the part names it. */
-    pivotSource: string | null;
-    slots: ChartFormulaSlot[];
-}
-/**
- * Reads a captured chart part.
- *
- * @param xml The part as captured on import.
- * @returns `null` when `xml` holds no chart.
- */
-export declare const readChartXml: (xml: string) => ChartXmlFacts | null;
-/**
- * The part with its formulas restated.
- *
- * @param xml The part {@link readChartXml} read `slots` from.
- * @param texts The formula for each slot, or `null` to leave what the part says.
- * @returns `xml` itself when nothing is restated.
- */
-export declare const writeChartFormulas: (xml: string, slots: readonly ChartFormulaSlot[], texts: readonly (string | null)[]) => string;
-//# sourceMappingURL=_ChartXml.d.ts.map

package/types/src/collections/OverlappingRangeIterator.d.ts

@@ -1,87 +0,0 @@
-import { RangeAxis, CellCoords, RangeCoords, RangeCoordValue } from '@sheetxl/utils';
-/**
- * Iterate over a collection of overlapping RangeCoords.
- *
- * This will iterator over CellCoords or RangeCoords.
- */
-type ESIterator<T, TReturn = any, TNext = undefined> = Iterator<T, TReturn, TNext>;
-export declare namespace OverlappingRange {
-    interface IteratorOptions {
-        /**
-         * The direction of the scan.
-         * @defaultValue RangeAxis.Row
-         */
-        axis?: RangeAxis;
-        /**
-         * Set iterator to increment by cells within an intersection.
-         *
-         * @defaultValue false
-         *
-         * @remarks
-         * Depending on the range intersect it is possible that some scan lines will be duplicated.
-         * This is desired as it makes merging ranges easier/possible.
-         */
-        byCell?: boolean;
-        /**
-         * Iterate in reverse order.
-         * @defaultValue false
-         */
-        reverse?: boolean;
-        /**
-         * If provided then iterator results will reuse the return results.
-         *
-         * @defaultValue `undefined` (Creates new instances for each iterator)
-         *
-         * @remarks
-         * - **Performance:** Removes the per-step allocations (the result, range, cell, and overlaps
-         *   objects are mutated in place), which matters for large sweeps.
-         * - **Safety:** A returned intersection is only valid until the next call to `next` — copy
-         *   anything that is retained. Pass an `IteratorResult` to supply the reused buffer yourself.
-         */
-        reuseIterator?: boolean | IteratorResult<OverlappingRange.Intersection>;
-    }
-    /**
-     * When iterating a cursor is used to track the
-     * current location. The coords will always move forward.
-     */
-    interface Intersection {
-        /**
-         * The current coords.
-         */
-        cell: CellCoords;
-        /**
-         * This is a non-overlapping virtual range.
-         *
-         * @remarks
-         * This is not guaranteed to be the smallest packing size.
-         */
-        range: RangeCoords;
-        /**
-         * All ranges at the intersection. This may be a single range.
-         */
-        overlaps: RangeCoordValue[];
-    }
-    type Iterator = ESIterator<Intersection, Intersection, CellCoords>;
-    /**
-     * An adapter over the shared line-sweep engine (`_RangeSweep`): the ranges become pieces (their
-     * input order is the stable order), the sweep partitions them into non-overlapping regions, and
-     * each step is handed out as a fresh {@link Intersection}.
-     */
-    class IteratorInstance implements Iterator, IterableIterator<Intersection> {
-        private _sweep;
-        private _isByCell;
-        private _cellComparator;
-        private _lastCell;
-        private _reuse;
-        constructor(ranges: readonly RangeCoordValue[], options?: IteratorOptions);
-        /**
-         * Returns the next Intersection as a IteratorResult.
-         */
-        next(nextCell?: CellCoords): IteratorResult<Intersection>;
-        return(_value?: Intersection): IteratorResult<Intersection>;
-        throw(_e?: any): IteratorResult<Intersection>;
-        [Symbol.iterator](): IterableIterator<Intersection>;
-    }
-}
-export {};
-//# sourceMappingURL=OverlappingRangeIterator.d.ts.map

package/types/src/collections/_RangeSweep.d.ts

@@ -1,97 +0,0 @@
-import { RangeCoords } from '@sheetxl/utils';
-/**
- * Pieces: the clipped entries of every searched map, in parallel arrays.
- * @internal
- */
-export interface PieceStore {
-    count: number;
-    rowS: Int32Array;
-    rowE: Int32Array;
-    colS: Int32Array;
-    colE: Int32Array;
-    /** Index into `keys`. */
-    type: Uint16Array;
-    value: any[];
-    keys: string[];
-}
-export declare const createPieceStore: (capacity?: number) => PieceStore;
-export declare const growInt32: (arr: Int32Array, size: number) => Int32Array;
-export declare const growPieces: (store: PieceStore, size: number) => void;
-/**
- * The sweep. Pieces are the input; bands and the regions inside them are computed lazily, one band
- * at a time, into reusable arrays. The consumer steps regions (`nextRegion`) or cells
- * (`nextCell` / `seekCell`) and reads the current position from the public fields.
- * @internal
- */
-export declare abstract class RangeSweep<T> {
-    private readonly _isColumn;
-    private readonly _isReverse;
-    protected readonly _store: PieceStore;
-    private readonly _n;
-    private readonly _M0;
-    private readonly _M1;
-    private readonly _m0;
-    private readonly _m1;
-    private readonly _order;
-    private _nextOrder;
-    private _active;
-    private _activeLen;
-    private _scratch;
-    private _events;
-    private _hasBand;
-    private _bandStart;
-    private _bandEnd;
-    private _rMinS;
-    private _rMinE;
-    protected _rOff: Int32Array;
-    private _rCount;
-    protected _pool: Int32Array;
-    private _overlaps;
-    private _rInter;
-    private _region;
-    private _major;
-    private _minor;
-    private _done;
-    rowStart: number;
-    rowEnd: number;
-    colStart: number;
-    colEnd: number;
-    cellRow: number;
-    cellCol: number;
-    intersection: T;
-    constructor(store: PieceStore, bounds: RangeCoords, isColumn: boolean, isReverse: boolean);
-    /** Build the value of a region from its overlap set (pieces in `_pool[_rOff[region].._rOff[region+1])`). */
-    protected abstract _materialize(region: number): T;
-    /** Stable id of a piece in scan order (reverse scans invert the push order). */
-    private _stable;
-    /** The minor-event order: closest edge, starts before ends, opposite edge, stable id. */
-    private _compareEvents;
-    /**
-     * Sort `len` events (given in ascending stable order, start before end per piece). Returns the
-     * buffer holding the result, which may be the scratch buffer.
-     *
-     * @remarks
-     * Comparator sort for small groups; LSD counting sort when the minor span is small relative to
-     * the group (the million-fragment case).
-     */
-    private _sortEvents;
-    /** Advance to the next band, materializing its regions. `false` when the sweep is exhausted. */
-    private _advanceBand;
-    /** The minor sweep of the current band: intervals of constant, non-empty overlap set. */
-    private _sweepBand;
-    /** Set the public region fields for the band × region (and the intersection). */
-    private _setRegion;
-    /** Step to the next region. `false` when exhausted. */
-    nextRegion(): boolean;
-    private _setCell;
-    /** Enter a band for cell stepping: the intersection cache is only worth it when majors replay. */
-    private _enterBandByCell;
-    /** Step to the next cell that has an intersection (major, then minor order). `false` when exhausted. */
-    nextCell(): boolean;
-    /**
-     * Step to the first cell at or after (`rowIndex`, `colIndex`) in scan order that has an
-     * intersection; a target at or before the current cell behaves as {@link nextCell}.
-     */
-    seekCell(rowIndex: number, colIndex: number): boolean;
-}
-//# sourceMappingURL=_RangeSweep.d.ts.map

package/types/src/font/CanvasFontMeasurer.d.ts

@@ -1,25 +0,0 @@
-import { IFont } from './IFont';
-/**
- * A canvas based getTextMetrics.
- *
- * Canvas has limited support for font metrics we can do css sniffing to find lineGap but all
- * rendering values (underline offset/width, stroke offset/width, subSetting, italic angle, etc)
- * are not available in browsers.
- *
- * To this end we approximate.
- * * lineGap.
- * * underlineOffset
- * * underlineWidth
- * * stroke offset
- *
- */
-export declare function CanvasFontMeasurer(text: string, size: number, family: string, options?: IFont.MetricOptions | null): IFont.ExtendedMetrics;
-export declare function getInstance(): IFont.Measurer;
-/**
- * Returns scaling to use for the current device.
- *
- * @remarks
- * **TODO** This is hardcoded to Non-HD DPI. Revisit.
- */
-export declare function getDeviceScale(): number;
-//# sourceMappingURL=CanvasFontMeasurer.d.ts.map

package/types/src/font/FontKitFontMeasurer.d.ts

@@ -1,11 +0,0 @@
-import { IFont } from './IFont';
-export declare function setFontFolder(path: string): void;
-/**
- * TODO - use fs selection to determine:
- * 1. panose
- * 2. if bold, italic
- */
-export declare function FontKitFontMeasurer(text: string, size: number, family: string, options?: IFont.MetricOptions | null): IFont.ExtendedMetrics;
-export declare function getInstance(): IFont.Measurer;
-export declare function getDeviceScale(): number;
-//# sourceMappingURL=FontKitFontMeasurer.d.ts.map

package/types/src/font/SimpleFontMeasurer.d.ts

@@ -1,4 +0,0 @@
-import { IFont } from './IFont';
-export declare function getInstance(): IFont.Measurer;
-export declare function getDeviceScale(): number;
-//# sourceMappingURL=SimpleFontMeasurer.d.ts.map