@sheetxl/sdk 0.7.21 → 0.7.23-beta.2

package/types/src/collections/_GridUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_GridUtils.d.ts","sourceRoot":"","sources":["../../../../src/collections/_GridUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,KAAK,UAAU,EAAE,KAAK,WAAW,EAClC,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAKhC;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,MAAM,YAAwB,EACxC,QAAQ,EAAE,MAAM,YAAwB,EACxC,MAAM,EAAE,MAAM,YAAwB,EACtC,MAAM,EAAE,MAAM,YAAwB,EACtC,QAAQ,EAAE,OAAO,EACjB,QAAQ,CAAC,EAAE,WAAW,EACtB,SAAS,CAAC,EAAE,WAAW,GACtB,KAAK,CAAC,gBAAgB,CAuBxB;AAGD,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,KAAK,CAAC,gBAAgB,EAChC,QAAQ,EAAE,OAAO,EACjB,WAAW,CAAC,EAAE,WAAW,GACxB,WAAW,CAab;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,EAC1C,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,OAAO,EACjB,WAAW,CAAC,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,GACzC,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAiB9B;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,WAAW,EAAE,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,SAAS,GAC9D,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAmB9B;AAsBD;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAUnE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,MAAM,CAEzE;AAED;;GAEG;AACH,MAAM,WAAW,oBAAqB,SAAQ,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,QAAQ,CAAC;IACjF;;OAEG;IACH,MAAM,EAAE,WAAW,CAAC;IACpB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;CACrB;AAED;;;;;;;;GAQG;AAIH,qBAAa,aAAa,CAAC,CAAC,GAAC,GAAG,EAAE,OAAO,GAAC,GAAG,CAAE,YAAW,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC;IACxF,OAAO,CAAC,SAAS,CAAmC;IAEpD,OAAO,CAAC,SAAS,CAAiB;IAClC,OAAO,CAAC,UAAU,CAAkB;IACpC,OAAO,CAAC,WAAW,CAAkB;IAErC,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAElD,OAAO,CAAC,WAAW,CAAiC;IACpD,OAAO,CAAC,WAAW,CAAiC;IAEpD,OAAO,CAAC,eAAe,CAA6B;IACpD,OAAO,CAAC,mBAAmB,CAAiC;IAC5D,OAAO,CAAC,mBAAmB,CAAiC;IAE5D,OAAO,CAAC,iBAAiB,CAA6D;IACtF,OAAO,CAAC,iBAAiB,CAA6D;gBAGpF,QAAQ,EAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,EAC1C,OAAO,EAAE,oBAAoB;IA6B/B,OAAO,CAAC,WAAW;IA+BnB;;OAEG;IAEH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;IAiG1C,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC;IAIpD,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC;IAK3C,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAGzC;AAED;;GAEG;AACH,MAAM,MAAM,qBAAqB,CAAC,CAAC,GAAC,GAAG,EAAE,OAAO,GAAC,GAAG,IAAI;IACtD;;OAEG;IACH,QAAQ,EAAE,QAAQ,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACzD;;OAEG;IACH,MAAM,EAAE,WAAW,CAAC;IACpB;;OAEG;IACH,IAAI,EAAE;QACJ,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;IACF;;;;;OAKG;IACH,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB;;;OAGG;IACH,WAAW,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;CACtD,CAAC;AAEF;;;;;;;GAOG;AACH,qBAAa,iBAAiB,CAAC,CAAC,GAAC,GAAG,EAAE,OAAO,GAAC,GAAG,CAAE,YAAW,QAAQ,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC;IAC1G,OAAO,CAAC,SAAS,CAAiB;IAElC,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,SAAS,CAAiC;IAElD,OAAO,CAAC,SAAS,CAAiD;IAElE,OAAO,CAAC,mBAAmB,CAAkC;IAC7D,OAAO,CAAC,WAAW,CAAmC;IAEtD,OAAO,CAAC,WAAW,CAAiC;IACpD,OAAO,CAAC,WAAW,CAAiC;IACpD,OAAO,CAAC,UAAU,CAA+B;IAEjD,OAAO,CAAC,YAAY,CAAa;IAEjC,OAAO,CAAC,YAAY,CAAa;IAEjC,OAAO,CAAC,YAAY,CAAc;IAElC,OAAO,CAAC,YAAY,CAAa;IAGjC,OAAO,CAAC,QAAQ,CAAsD;gBAGpE,OAAO,EAAE,qBAAqB;IAmChC,OAAO,CAAC,WAAW;IAqBnB;;OAEG;IAEH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAmIxD,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAIlE,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAKzD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;CAGvD;AAED;;GAEG;AACH,qBAAa,cAAc,CAAC,CAAC,GAAC,GAAG,EAAE,OAAO,GAAC,GAAG,CAAE,YAAW,QAAQ,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC;IACvG,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,YAAY,CAA4B;IAEhD,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,YAAY,CAA4B;IAEhD,OAAO,CAAC,QAAQ,CAAmE;IACnF,OAAO,CAAC,WAAW,CAA2C;gBAG5D,OAAO,EAAE,KAAK,CAAC,eAAe,EAC9B,SAAS,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EACjC,SAAS,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EACjC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,MAAM;IAiB9D;;OAEG;IAEH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAmDxD,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAIlE,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAIzD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;CAGvD;AAED;;GAEG;AACH,qBAAa,eAAe,CAAC,CAAC,GAAC,GAAG,EAAE,OAAO,GAAC,GAAG,CAAE,YAAW,QAAQ,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC;IACvH,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,YAAY,CAA4B;IAEhD,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,YAAY,CAA4B;IAEhD,OAAO,CAAC,WAAW,CAA2C;IAC9D,OAAO,CAAC,YAAY,CAA2D;gBAG7E,OAAO,EAAE,sBAAsB,EAC/B,SAAS,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EACjC,SAAS,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAuBnC;;OAEG;IAEH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAgFvE,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAIjF,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,cAAc,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;IAIxE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;CAGtE;AAED,MAAM,WAAW,sBAAuB,SAAQ,KAAK,CAAC,eAAe;IACnE;;OAEG;IACH,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,KAAK,MAAM,CAAA;CACtD;AAGD,eAAO,MAAM,yBAAyB,oCAAoC,CAAC;AAE3E;;;;GAIG;AAEH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,EACtD,MAAM,EAAE,KAAK,CAAC,gBAAgB,EAC9B,QAAQ,EAAE,OAAO,GAChB,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAsCxB;AAED;;GAEG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,SAAS,GAAG;IAClC,KAAK,EAAE,CAAC,CAAC;IACT,MAAM,EAAE,UAAU,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,QAAQ,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EACpC,IAAI,EAAE,SAAS,EACf,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAC1B,OAAO,GAAE,UAAU,GAAG,IAAS,GAC9B,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAgBxB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAC/B,OAAO,EAAE,CAAC,EAAE,EAAE,EACd,SAAS,GAAE,OAAa,EACxB,MAAM,GAAE,OAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAC,IAAS,EACjD,WAAW,GAAE,OAAa,GACzB,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CA0ExB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAgC1F;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,GAAC,GAAG,EACxC,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EACrC,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,GACrB,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAyBxB;AAeD;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,GAAC,GAAG,EAC9C,QAAQ,GAAE,OAAY,EACtB,QAAQ,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,KAAK,CAAC,GAAG,SAA2B,GAC3E,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAuDnC"}

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

@@ -0,0 +1,170 @@
+import { RunCoords, RangeCoords, RunCoordValue, RangeCoordValue } from '@sheetxl/utils';
+export interface ModifiedRuns<T> {
+    preceding: RunCoordValue<T>[];
+    modified: RunCoordValue<T>[];
+    trailing: RunCoordValue<T>[];
+}
+export declare function deepUpdate(prevValue: any | null, newValue: any | null): any | null;
+export declare function deepCull(value: any, _min: number, _max: number): boolean;
+export interface UpdateAndCompactOptions<T, U = T> {
+    /**
+     * Used when split two runs.
+     * @remarks
+     * Should always return an array with 2 values.
+     */
+    onSplit?: (value: RunCoordValue<T>, offset: number) => T[];
+    /**
+     * Returns an updated value. If not specified a deep merge is done.
+     *
+     * IMPORTANT -
+     * both prevValue and newValue should be treated as frozen object and not
+     * mutated.
+     * A new value should always be returned. If you want to augment a value
+     * The deepUpdateMethod is offered
+    */
+    onUpdate?: (prevValue: T | null, newValue: U | null | undefined, run: RunCoordValue<T>) => T | null | undefined;
+    /**
+     * Used when attempting to merge two runs.
+     * Returns undefined if the values can't be merged
+     */
+    onMerge?: (a: T, b: T, sizeA: number, sizeB: number) => T | undefined;
+    /**
+     * Used to determine if a entry should removed. If value is null or undefined it will also be removed.
+     * By default an empty object will not be.
+     */
+    isCull?: (value: T, min: number, max: number) => boolean;
+    /**
+     * By default merge will freeze object in place to prevent mutations.
+     * Setting this to true will allow for special cases where objects are not immutable.
+     *
+     * @defaultValue false
+     */
+    inPlace?: boolean;
+}
+export declare function shiftRuns<T>(runs: RunCoordValue<T>[], index: number, amount?: number): ModifiedRuns<T>;
+export declare function unshiftRuns<T>(runs: RunCoordValue<T>[], index: number, amount?: number): ModifiedRuns<T>;
+export declare function unshiftAndMergeRuns<T>(runs: RunCoordValue<T>[], index: number, amount?: number, options?: MergeRunOptions<T>): ModifiedRuns<T>;
+/**
+ * Will take a list of runs and return the minimum set required.
+ *
+ * @param runs
+ * @param update
+ * @param options @UpdateAndCompactOptions
+ */
+export declare function updateAndCompactRuns<T, U = T>(runs: RunCoordValue<T>[], update: RunCoordValue<U>, options?: UpdateAndCompactOptions<T, U>): ModifiedRuns<T>;
+export declare function concatModifiedRuns<T>(parts: ModifiedRuns<T>): RunCoordValue<T>[];
+/**
+ * Split/update algo used for formatted text.
+ * This will split and update runs
+
+ * All runs must be:
+ * ** ordered
+ * ** non-overlapping
+ * Runs do not need to be contiguous.
+ */
+export declare function splitAndUpdateRuns<T, U = T>(runs: RunCoordValue<T>[], update: RunCoordValue<U> | null, onSplit?: (run: RunCoordValue<T>, offset: number) => T[], onUpdate?: (prevValue: T | null, newValue: U | null | undefined, run: RunCoordValue<T>) => T | null | undefined, inPlace?: boolean): ModifiedRuns<T>;
+interface CullRunsOptions<T> {
+    startOffset?: number;
+    endOffset?: number;
+    /**
+     * Used to determine if a value should removed. If data is null or undefined it will also be removed.
+     * By default an empty object will not be.
+     */
+    cull?(value: T, min: number, max: number): boolean;
+}
+export declare function cullRuns<T>(runs: RunCoordValue<T>[], options?: CullRunsOptions<T>): ModifiedRuns<T>;
+export interface MergeRunOptions<T> {
+    startOffset?: number;
+    endOffset?: number;
+    onMerge?: (a: T, b: T, sizeA: number, sizeB: number) => T | undefined | null;
+}
+/**
+ * Merges runs. Runs must be sorted; {@link sortRuns}
+ */
+export declare function mergeRuns<T>(runs: RunCoordValue<T>[], options?: MergeRunOptions<T>): ModifiedRuns<T>;
+export declare function sortRuns<T>(a: RunCoordValue<T>[]): RunCoordValue<T>[];
+/**
+ * Sorts twos runs by their min values.
+ */
+export declare function sortTwoRuns<T>(a: RunCoordValue<T>, b: RunCoordValue<T>, forward?: boolean): RunCoordValue<T>[] | undefined;
+/**
+ * Looks for a run going in a certain direction. If there isn't a run for this it will look for the next
+ * run. If you only want the run if it is found then use {@link findRun}.
+ *
+ * @param runs An array of Run or RunCoords.
+ * @param index The index that will be >= min && <= max.
+ * @param findGreater - *`default`* `true` If true will search greater if false lesser.
+ * @returns The index for the next run or -1 if no run was found.
+ */
+export declare function findNextRunOffset<T = any>(runs: readonly RunCoordValue<T>[], index: number, findGreater?: boolean): number;
+export declare function findRun<T>(runs: readonly RunCoordValue<T>[], index: number): RunCoordValue<T> | null;
+/**
+ * Converts a list of indices into Runs (an array of RunCoords).
+ *
+ * @param indices A list of indices. (Mutates if !presorted)
+ * @param presorted If set to true will not sort. @defaultValue false
+ */
+export declare function indicesToRuns(indices: number[], presorted?: boolean): RunCoords[];
+/**
+ * Runs are an ordered list of RunCoords with no overlapping values.
+ *
+ * Examples:
+ *
+ * - Valid - [0, 3][4, 4][8,10] // valid runs of size 4, 1, 3
+ *
+ * - Invalid -  [0, 4][4, 6][8,10] // 4 overlaps
+ *
+ * - Invalid -  [0, 3][7, 6][8,10] // second run has incorrect min/max
+ *
+ * - Invalid -  [4, 6][0, 5][8,10] // second run is out of order
+ *
+ * - Valid  - [] // empty but valid
+ * @param runs A list of RunCoords.
+ */
+export declare function validateRuns(runs: readonly RunCoords[]): boolean;
+/**
+ * Finds the intersection of 2 runs.
+ * @returns `null` if no intersection
+ */
+export declare function intersectRuns(a: Readonly<RunCoords>, b: Readonly<RunCoords>): RunCoords;
+export interface RunVisitor<T> {
+    (run: RunCoordValue<T>): {
+        break: any;
+    } | void;
+}
+export interface CacheSearchRunData<T = any> {
+    runs: readonly RunCoordValue<T>[];
+    run: RunCoordValue<T | null>;
+    index: number;
+}
+export declare function createSearchRunCache<T = any>(runs: readonly RunCoordValue<T>[]): CacheSearchRunData<T>;
+/**
+ * To minimize lookups we assume that the items are generally read in order.
+ * This allows use to cache the last run and check adjacent before doing a binary search.
+ *
+ * If the runs are update the an new CacheSearchRunData is required. see {@link createSearchRunCache}
+ * * We always return a run if one is found.
+ * * If one isn't we return a run with a null value with min/max being the empty space boundaries.
+ * * the runIndex is always the current run or the next run (or -1 if no runs).
+ * * We reuse cache
+ * @param index
+ * @param cache
+ */
+export declare function searchRunsWithCache<T = any>(index: number, cache: CacheSearchRunData<T>): T;
+/**
+ * Scans all of the runs. It will scan each run exactly once.
+ * In additional if there are gaps it will create an empty run.
+ */
+export declare function scanRuns<V, B = any>(runs: readonly RunCoordValue<V>[], visitor: RunVisitor<V>, start?: number, end?: number): {
+    break: B;
+} | void;
+/**
+ * Converts a set of RunCoords into a set of RangeCoords.
+ */
+export declare function runCoordsToRangeCoords<T = any>(runs: readonly Readonly<Partial<RunCoordValue<T>>>[], entireRange: RangeCoords, isColumn: boolean): RangeCoordValue<T>[];
+/**
+ * Returns a list of merged and non-overlapping run coordinates.
+ */
+export declare function removeOverlappingRuns(runs: readonly Readonly<Partial<RunCoords>>[], merge?: boolean): RunCoords[];
+export {};
+//# sourceMappingURL=_RunUtils.d.ts.map

package/types/src/collections/_RunUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_RunUtils.d.ts","sourceRoot":"","sources":["../../../../src/collections/_RunUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EACQ,KAAK,SAAS,EAAE,KAAK,WAAW,EAAE,KAAK,aAAa,EAAE,KAAK,eAAe,EACxF,MAAM,gBAAgB,CAAC;AAExB,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9B,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7B,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;CAC9B;AAED,wBAAgB,UAAU,CACxB,SAAS,EAAE,GAAG,GAAG,IAAI,EACrB,QAAQ,EAAE,GAAG,GAAG,IAAI,GACnB,GAAG,GAAG,IAAI,CAOZ;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAIxE;AAaD,MAAM,WAAW,uBAAuB,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC;IAC7C;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;IAC3D;;;;;;;;MAQE;IACF,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;IAChH;;;OAGG;IACH,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC;IACtE;;;OAGG;IACH,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC;IACzD;;;;;OAKG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,wBAAgB,SAAS,CAAC,CAAC,EACzB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,KAAK,EAAE,MAAM,EACb,MAAM,GAAE,MAAQ,GACf,YAAY,CAAC,CAAC,CAAC,CA0CjB;AAED,wBAAgB,WAAW,CAAC,CAAC,EAC3B,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,KAAK,EAAE,MAAM,EACb,MAAM,GAAE,MAAQ,GACf,YAAY,CAAC,CAAC,CAAC,CA4CjB;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,KAAK,EAAE,MAAM,EACb,MAAM,GAAE,MAAQ,EAChB,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,GAC3B,YAAY,CAAC,CAAC,CAAC,CAgCjB;AAED;;;;;;GAMG;AACF,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAC1C,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,EACxB,OAAO,CAAC,EAAE,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,GACtC,YAAY,CAAC,CAAC,CAAC,CAkCjB;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GACrB,aAAa,CAAC,CAAC,CAAC,EAAE,CAMpB;AACD;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,GAAC,IAAI,EAChG,OAAO,CAAC,EAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,EAAE,EACvD,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,SAAS,EAC/G,OAAO,GAAE,OAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAmHzC;AAED,UAAU,eAAe,CAAC,CAAC;IAEzB,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACpD;AAED,wBAAgB,QAAQ,CAAC,CAAC,EACxB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,GAC3B,YAAY,CAAC,CAAC,CAAC,CA0BjB;AAED,MAAM,WAAW,eAAe,CAAC,CAAC;IAEhC,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB,SAAS,CAAC,EAAE,MAAM,CAAC;IAOnB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC;CAC9E;AAID;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,GAC3B,YAAY,CAAC,CAAC,CAAC,CAkDjB;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,GAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAQpE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,OAAO,GAAE,OAAY,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAQ9H;AA2CD;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,GAAC,GAAG,EACrC,IAAI,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,EACjC,KAAK,EAAE,MAAM,EACb,WAAW,GAAE,OAAY,GACxB,MAAM,CA6BR;AAED,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,EACjC,KAAK,EAAE,MAAM,GACZ,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAKzB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EAAE,EACjB,SAAS,GAAE,OAAa,GACvB,SAAS,EAAE,CAmBb;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,SAAS,SAAS,EAAE,GACzB,OAAO,CAaT;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,SAAS,CAUvF;AAED,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG;QAAE,KAAK,EAAE,GAAG,CAAA;KAAE,GAAG,IAAI,CAAC;CAChD;AAGD,MAAM,WAAW,kBAAkB,CAAC,CAAC,GAAC,GAAG;IACvC,IAAI,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAElC,GAAG,EAAE,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAE7B,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,oBAAoB,CAAC,CAAC,GAAC,GAAG,EACxC,IAAI,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,GAChC,kBAAkB,CAAC,CAAC,CAAC,CAavB;AACD;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,GAAC,GAAG,EACvC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAC3B,CAAC,CA4EH;AAED;;;GAGG;AAEH,wBAAgB,QAAQ,CAAC,CAAC,EAAC,CAAC,GAAC,GAAG,EAC9B,IAAI,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,EACjC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EACtB,KAAK,CAAC,EAAE,MAAM,EACd,GAAG,CAAC,EAAE,MAAM,GACX;IAAE,KAAK,EAAE,CAAC,CAAA;CAAE,GAAG,IAAI,CAgDrB;AAGD;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,GAAC,GAAG,EAC1C,IAAI,EAAE,SAAS,QAAQ,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EACpD,WAAW,EAAE,WAAW,EACxB,QAAQ,EAAE,OAAO,GAChB,eAAe,CAAC,CAAC,CAAC,EAAE,CAsBtB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,EAC7C,KAAK,GAAE,OAAa,GACnB,SAAS,EAAE,CAyBb"}

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

@@ -0,0 +1,115 @@
+import { RangeAxis, AxisSelection, RangeCoords, RunCoordValue } from '@sheetxl/utils';
+import { ISpatialMap } from './ISpatialMap';
+/**
+ * Expands the range size in each direction.
+ */
+export declare function expandRange(range: RangeCoords, maxRange?: RangeCoords, colAmount?: number, rowAmount?: number): RangeCoords;
+/**
+ * Scope-agnostic coordinate equality. A 2D spatial map is single-scope; entries may
+ * inconsistently carry a `scope` so it must not participate in coordinate comparisons.
+ */
+export declare function isEqualCoords(a: RangeCoords, b: RangeCoords): boolean;
+/**
+ * Returns the original range split by the intersecting range.
+ *
+ * @param orig The original RangeCoordValue node.
+ * @param inter The intersecting range.
+ *
+ * @remarks
+ * * The last value is always the intersecting range.
+ * * If there is no intersect then null is returned. If it is completely contained it will return a 1 value.
+ * * All range coords values contain the values from the original splits
+ */
+export declare function splitIntersect<T = any>(orig: ISpatialMap.Entry<T>, inter: RangeCoords, getSplit?: ((orig: ISpatialMap.Entry<T>, coords: [RangeCoords, RangeCoords], axis: RangeAxis, offset: number) => [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>] | null | undefined) | null | undefined, updateLastId?: boolean): ISpatialMap.Entry<T>[] | null;
+/**
+ * Create a set of non overlapping ranges from a set of existing ranges.
+ *
+ * * **IMPORTANT** - The original nodes also split during insertion.
+ *
+ * @remarks
+ * - The original entries are assume to already not have overlapping ranges but are not
+ *   required to be aligned.
+ * - Will create equal size rectangles to allow for intersecting.
+ * - Does not make an effort to return the fewest nodes possible.
+ * - Does not merge splits; use {@link removeOverlapsAndMerge} or {@link fastMerge}.
+ *
+ * The steps to do this are:
+ * 1. Splits original nodes by the insert node.
+ * 2. Splits the insert node by the split original nodes. (it may split into smaller nodes that the split originals)
+ * 3. Tries to intersect.
+ * 3.  a. the the intersect is not the same size then the original is too large so we split the original again
+ *        and intersect just the parts that match.
+
+ */
+export declare function convertToNonOverlappingRanges<T>(original: ISpatialMap.Entry<T>[], insert: ISpatialMap.Entry<T>, options: ISpatialMap.UpdateOptions<T>): ISpatialMap.Entry<T>[];
+/**
+ * Attempts to merge ranges that are guaranteed to not overlap. For overlapping ranges use {@link removeOverlapsAndMerge}.
+ *
+ *
+ * @defaultValue '2'.
+ *
+ * @remarks
+ * * Setting to '0' will remove overlaps but not attempt to merge.
+ * * Setting to '1' will remove overlaps in the initial axis.
+ * * Setting to '2' will remove most overlaps but may miss overlaps that resulted from the previous iterations.
+ * * Setting to 'Number.MAX_SAFE_INTEGER' will run until no more ranges can be merged.
+ */
+export declare function fastMerge(ranges: RangeCoords[], axis?: RangeAxis, iterations?: number, getMerge?: (from: [a: RangeCoords, b: RangeCoords], destination: RangeCoords, axis: RangeAxis) => RangeCoords | null | undefined, reuseArray?: [RangeCoords | null, RangeCoords | null]): RangeCoords[];
+/**
+ * Simplifies ranges that overlap and merges them.
+ *
+ * This algorithm will continue merging until no more merges can be made. For large data this can be slow
+ *
+ * Useful for operations like count where you don't want to double count selections.
+ *
+ * @remarks
+ * Scope-partitioned: only ranges on the same sheet can overlap or be adjacent to one another.
+ */
+export declare function removeOverlapsAndMerge(ranges: readonly RangeCoords[], iterations?: number, axis?: RangeAxis, getMerge?: (from: [RangeCoords, b: RangeCoords], destination: RangeCoords, axis: RangeAxis) => RangeCoords | null | undefined, onOverlap?: (intersection: RangeCoords, overlaps: RangeCoords[]) => void, reuseArray?: [RangeCoords | null, RangeCoords | null]): RangeCoords[];
+export declare function delegatingNodeSplitter<T>(from: ISpatialMap.Entry<T>, destination: [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>], axis: RangeAxis, offset: number): [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>] | undefined;
+export declare function delegatingNodeMerger<T>(from: [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>], destination: ISpatialMap.Entry<T>, axis: RangeAxis): ISpatialMap.Entry<T> | undefined;
+/**
+ * If the two coords overlap in a way that would required them to be split.
+ *
+ * @param a The first coords.
+ * @param b The second coords.
+ *
+ * @remarks
+ * This can be used for a single direction.
+ */
+export declare function isSplitIntersect(a: RangeCoords, b: RangeCoords, selections?: AxisSelection): boolean;
+/**
+ * Default implementation for {@link RangeShiftProcessor}.
+ *
+ * @param optionsProcess RangeShiftOptions
+ * @param splitExpand Used to tell the ranges not to shift but instead to split when shifting.
+ * @returns Either new RangeNodes or null if the shifted resulted in a delete. (left/up more than size of before)
+ *
+ * @remarks
+ * * Will shift a range in a given direction.
+ * * May result in either 0, 1, 2, or 3. Nodes.
+ */
+export declare function defaultShiftProcessor<T>(before: ISpatialMap.Entry<T>, after: ISpatialMap.Entry<T> | null, optionsProcess: ISpatialMap.ShiftDetails<T>, getShifted: ((orig: ISpatialMap.Entry<T>, after: ISpatialMap.Entry<T>, options: ISpatialMap.ShiftDetails<T>) => ISpatialMap.Entry<T> | undefined) | undefined, getSplit: (orig: ISpatialMap.Entry<T>, coords: [RangeCoords, RangeCoords], axis: RangeAxis, offset: number) => [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>] | null | undefined, onShift: ((options: ISpatialMap.ShiftDetails<T>) => void) | null | undefined, splitExpand: boolean): ISpatialMap.Entry<T>[] | null | undefined;
+export declare function createCopiedSpatialEntries<T = any>(spatial: ISpatialMap, coordsFrom: RangeCoords, coordsTo: RangeCoords, options?: ISpatialMap.CopyOptions, reuseInserts?: ISpatialMap.Entry<T>[], reuseRemoves?: ISpatialMap.Entry<T>[], onSplit?: (from: ISpatialMap.Entry<T>, destination: [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>], axis: RangeAxis, offset: number) => [ISpatialMap.Entry<T>, ISpatialMap.Entry<T>] | null | undefined): ISpatialMap.Updates;
+/**
+ * Use to remove spills.
+ *
+ * @param spatial
+ * @param range
+ * @param cloneOnUpdate
+ * @returns The original map or the cloned map if it removed any entries.
+ */
+export declare function removeTopLeftEntries<T = any>(spatial: ISpatialMap<T>, range: RangeCoords, cloneOnUpdate?: boolean): ISpatialMap<T>;
+/**
+ * Converts a set of RunCoords into a set of RangeCoords.
+ */
+export declare function rangeEntriesToRuns<T = any>(entries: ISpatialMap.Entry<T>[], isColumn: boolean, cull?: (entry: ISpatialMap.Entry<T>) => boolean): RunCoordValue<T>[];
+/**
+ * BFS traversal of the dependency graph in either direction.
+ * `visit` is called once per frontier range; returns the next set of ranges.
+ * Terminates when visit returns [] (input cells for dependents, non-formula
+ * cells for precedents) or when all reachable ranges have been visited.
+ * Cycles are broken by exact-key deduplication on the returned ranges.
+ */
+export declare function graphVisit(start: RangeCoords, visit: (coords: RangeCoords) => RangeCoords[]): RangeCoords[];
+//# sourceMappingURL=_SpatialUtils.d.ts.map

package/types/src/collections/_SpatialUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_SpatialUtils.d.ts","sourceRoot":"","sources":["../../../../src/collections/_SpatialUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EAAE,aAAa,EACxB,KAAK,WAAW,EAAE,KAAK,aAAa,EACrC,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AAGjD;;GAEG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,WAAW,EAClB,QAAQ,GAAE,WAAiB,EAC3B,SAAS,GAAE,MAAQ,EACnB,SAAS,GAAE,MAAQ,GAClB,WAAW,CAQb;AAyBD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,GAAG,OAAO,CAKrE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,CAAC,GAAC,GAAG,EAClC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAC1B,KAAK,EAAE,WAAW,EAClB,QAAQ,GAAE,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC,GAAG,IAAI,GAAG,SAAgB,EAC1M,YAAY,GAAE,OAAc,GAC3B,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAiK/B;AAMD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAC7C,QAAQ,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAChC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAC5B,OAAO,EAAE,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,GACpC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CA2IxB;AAED;;;;;;;;;;;GAWG;AAEH,wBAAgB,SAAS,CACvB,MAAM,EAAE,WAAW,EAAE,EACrB,IAAI,GAAE,SAA0B,EAChC,UAAU,GAAE,MAAQ,EACpB,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,KAAK,WAAW,GAAG,IAAI,GAAG,SAAS,EAChI,UAAU,CAAC,EAAE,CAAC,WAAW,GAAG,IAAI,EAAE,WAAW,GAAG,IAAI,CAAC,GACpD,WAAW,EAAE,CA4Df;AAgCD;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,UAAU,GAAE,MAAQ,EACpB,IAAI,GAAE,SAAuB,EAC7B,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,WAAW,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,KAAK,WAAW,GAAG,IAAI,GAAG,SAAS,EAC7H,SAAS,CAAC,EAAE,CAAC,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,IAAI,EACxE,UAAU,CAAC,EAAE,CAAC,WAAW,GAAG,IAAI,EAAE,WAAW,GAAG,IAAI,CAAC,GACpD,WAAW,EAAE,CAmFf;AAED,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAY1N;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAkBhL;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC9B,CAAC,EAAE,WAAW,EACd,CAAC,EAAE,WAAW,EACd,UAAU,GAAE,aAAgC,GAC3C,OAAO,CAoBT;AAED;;;;;;;;;;GAUG;AAGH,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAC5B,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAClC,cAAc,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,EAC3C,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,EAC7J,QAAQ,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAC9K,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,SAAS,EAC5E,WAAW,EAAE,OAAO,GACnB,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,GAAG,SAAS,CAqK3C;AAOD,wBAAgB,0BAA0B,CAAC,CAAC,GAAC,GAAG,EAC9C,OAAO,EAAE,WAAW,EACpB,UAAU,EAAE,WAAW,EACvB,QAAQ,EAAE,WAAW,EACrB,OAAO,CAAC,EAAE,WAAW,CAAC,WAAW,EACjC,YAAY,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EACrC,YAAY,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EACrC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,GACpM,WAAW,CAAC,OAAO,CAuGrB;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,GAAC,GAAG,EACxC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,EACvB,KAAK,EAAE,WAAW,EAClB,aAAa,GAAE,OAAa,GAC3B,WAAW,CAAC,CAAC,CAAC,CAiBhB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,GAAC,GAAG,EACtC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAC/B,QAAQ,EAAE,OAAO,EACjB,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,GAC9C,aAAa,CAAC,CAAC,CAAC,EAAE,CAiBpB;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,WAAW,EAAE,GAC5C,WAAW,EAAE,CAmBf"}

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

@@ -0,0 +1,21 @@
+export * from './IReadableList';
+export * from './IWritableList';
+export * from './ISparseList';
+export * from './ISortedMap';
+export * from './IGrid';
+export * from './ISparseGrid';
+export * from './ISpatialMap';
+export * from './ISpatialMap3D';
+export * as IteratorUtils from './IteratorUtils';
+export * from './ImmutableList';
+export * from './IList';
+export * from './OverlappingRangeIterator';
+export * from './SortedMap';
+export * from './SparseGrid';
+export * from './SparseList';
+export * from './SpatialMap';
+export * from './SpatialMap3D';
+export * from './BooleanList';
+export * from './Tuple';
+export * from './MixedTypedArrayList';
+//# sourceMappingURL=index.d.ts.map

package/types/src/collections/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/collections/index.ts"],"names":[],"mappings":"AACA,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC;AAC7B,cAAc,SAAS,CAAC;AACxB,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,iBAAiB,CAAC;AAGhC,OAAO,KAAK,aAAa,MAAM,iBAAiB,CAAC;AACjD,cAAc,iBAAiB,CAAC;AAChC,cAAc,SAAS,CAAC;AAGxB,cAAc,4BAA4B,CAAC;AAE3C,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAE9B,cAAc,SAAS,CAAC;AAExB,cAAc,uBAAuB,CAAC"}

package/types/src/color/Color.d.ts

@@ -0,0 +1,120 @@
+import { ColorSpace } from './ColorSpace';
+import { IColor } from './IColor';
+/**
+ * Prefix for the CSS custom properties used for system colors. {@link Color.toCSS} emits
+ * `var(${SYSTEM_COLOR_CSS_PREFIX}windowtext, …)` for bare system/auto colors, and hosts theme
+ * the grid by setting these variables. Shared so the renderer and the host lookup agree.
+ */
+export declare const SYSTEM_COLOR_CSS_PREFIX = "--sxl-sys-color-";
+/**
+ * Capabilities for working with {@link IColor | colors}.
+ *
+ * Advanced color customization and compatibility with CSS and Office color schemes.
+ *
+ * Key features include:
+ * - Accessing a collection of built-in colors (Named, Scheme, Index).
+ * - Creating customized colors with color adjustments.
+ * - Defining and and converting between different color models (RGB, HEX, HSL).
+ *
+ * @see
+ * {@link IColor}
+ */
+export declare class Color implements IColor {
+    private _private;
+    constructor(value: string | IColor | IColor.Definition, schemeLookup?: IColor.SchemeLookup | null, indexedLookup?: IColor.IndexedLookup | null, last?: ColorSpace.RGBA | null, systemLookup?: IColor.SystemLookup | null);
+    private _parse;
+    private _forceDark;
+    private _resolve;
+    /**
+     * @hidden
+     * TODO - Rationalize this. Do we want a constructor a static parse?
+     */
+    static parse(input: string | IColor, schemeLookup?: IColor.SchemeLookup | null, indexedLookup?: IColor.IndexedLookup | null, last?: ColorSpace.RGBA | null, systemLookup?: IColor.SystemLookup | null): IColor | null;
+    /**
+     * Returns `true` if the named color is a system color (e.g. `windowText`, `window`, `btnFace`).
+     *
+     * @remarks
+     * System colors are environment-dependent and are candidates for host theming
+     * (see {@link IColor.SystemLookup}). Non-system named colors (e.g. `red`) and
+     * `transparent` return `false`.
+     */
+    static isSystem(name: string): boolean;
+    /**
+     * Returns the global default {@link IColor.SystemLookup}, or `null` if system colors
+     * resolve to their built-in baked values.
+     */
+    static getDefaultSystemLookup(): IColor.SystemLookup | null;
+    /**
+     * Sets the global default {@link IColor.SystemLookup} used to resolve system colors
+     * (e.g. `windowText`, `window`) when no per-color lookup is supplied.
+     *
+     * @remarks
+     * A host (for example the VSCode extension) calls this once to theme the rendered grid.
+     * Passing `null` restores the built-in baked values. This bumps the system epoch so cached
+     * resolutions are refreshed.
+     * @param lookup The lookup to install, or `null` to clear.
+     * @returns The previous lookup.
+     */
+    static setDefaultSystemLookup(lookup: IColor.SystemLookup | null): IColor.SystemLookup | null;
+    /**
+     * The current system-color epoch. Consumers that cache resolved system colors (such as a
+     * document `Theme`) can compare against this to know when to re-resolve.
+     */
+    static getSystemEpoch(): number;
+    /**
+     * Invalidates cached system-color resolutions (call when the host theme changes but the
+     * lookup function itself stays the same, e.g. CSS variables were updated).
+     */
+    static invalidateSystemColors(): void;
+    /**
+     * Returns the built-in (baked) values for the system colors as a map of
+     * `${name}` (lower-case) -> `#RRGGBB`.
+     *
+     * @remarks
+     * These are the hardcoded system color definitions. A host renderer (`@sheetxl/react`) uses
+     * them to seed the default `--sxl-sys-color-*` CSS variables (which {@link Color.toCSS} references);
+     * a host then overrides those variables to theme the grid.
+     */
+    static getSystemColorDefaults(): Record<string, string>;
+    /**
+     * Returns the default color scheme lookup that Colors will use if none is provided.
+     */
+    static getDefaultSchemeLookup(): IColor.SchemeLookup;
+    /** {@inheritDoc IColor.isEqual} */
+    isEqual(other: any): boolean;
+    /** {@inheritDoc IColor.getVal} */
+    getVal(): string;
+    /** {@inheritDoc IColor.getAdjustments} */
+    getAdjustments(): readonly IColor.Adjustment[];
+    /** {@inheritDoc IColor.getBaseColor} */
+    getBaseColor(): IColor;
+    /** {@inheritDoc IColor.getLastColor} */
+    getLastColor(): string | null;
+    /** {@inheritDoc IColor.getType} */
+    getType(): IColor.Type;
+    /** {@inheritDoc IColor.adjust} */
+    adjust(adjustments: IColor.Adjustment[]): IColor;
+    /**
+     * Returns a CSS `var()` reference for a bare system/auto color, otherwise `null` (resolve
+     * concretely). `toCSS` always emits this for system/auto colors so the browser resolves them
+     * per-subtree (CSS scoping). The `var()` fallback is the static authored/baked value, so it is
+     * correct when the host variable is unset (or headless/SSR).
+     */
+    private _systemCSSVar;
+    /** {@inheritDoc IColor.toCSS} */
+    toCSS(mode?: IColor.CSSMode, alpha?: boolean): string;
+    /** {@inheritDoc IColor.toRGBA} */
+    toRGBA(darkMode?: boolean): IColor.ISpace.RGBA;
+    /** {@inheritDoc IColor.toHSLA} */
+    toHSLA(darkMode?: boolean): IColor.ISpace.HSLA;
+    /** {@inheritDoc IColor.toHex} */
+    toHex(darkMode?: boolean): IColor.ISpace.HEX;
+    /** {@inheritDoc IColor.toBlackOrWhite} */
+    toBlackOrWhite(darkMode?: boolean, threshold?: number): IColor;
+    get [Symbol.toStringTag](): string;
+    /** {@inheritDoc IColor.toString} */
+    toString(): string;
+    /** {@inheritDoc IColor.isIColor} */
+    get isIColor(): true;
+}
+//# sourceMappingURL=Color.d.ts.map

package/types/src/color/Color.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Color.d.ts","sourceRoot":"","sources":["../../../../src/color/Color.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAQ1C,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAuWlC;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,qBAAqB,CAAC;AA8B1D;;;;;;;;;;;;GAYG;AACH,qBAAa,KAAM,YAAW,MAAM;IAClC,OAAO,CAAC,QAAQ,CAYf;gBAGC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,UAAU,EAE1C,YAAY,CAAC,EAAE,MAAM,CAAC,YAAY,GAAG,IAAI,EACzC,aAAa,CAAC,EAAE,MAAM,CAAC,aAAa,GAAG,IAAI,EAC3C,IAAI,GAAE,UAAU,CAAC,IAAI,GAAG,IAAW,EACnC,YAAY,CAAC,EAAE,MAAM,CAAC,YAAY,GAAG,IAAI;IA8C3C,OAAO,CAAC,MAAM;IAmEd,OAAO,CAAC,UAAU;IAsDlB,OAAO,CAAC,QAAQ;IAkChB;;;OAGG;IACH,MAAM,CAAC,KAAK,CACV,KAAK,EAAE,MAAM,GAAG,MAAM,EACtB,YAAY,CAAC,EAAE,MAAM,CAAC,YAAY,GAAG,IAAI,EACzC,aAAa,CAAC,EAAE,MAAM,CAAC,aAAa,GAAG,IAAI,EAC3C,IAAI,GAAE,UAAU,CAAC,IAAI,GAAG,IAAW,EACnC,YAAY,CAAC,EAAE,MAAM,CAAC,YAAY,GAAG,IAAI,GACxC,MAAM,GAAG,IAAI;IAiFhB;;;;;;;OAOG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAKtC;;;OAGG;IACH,MAAM,CAAC,sBAAsB,IAAI,MAAM,CAAC,YAAY,GAAG,IAAI;IAI3D;;;;;;;;;;OAUG;IACH,MAAM,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,YAAY,GAAG,IAAI,GAAG,MAAM,CAAC,YAAY,GAAG,IAAI;IAO7F;;;OAGG;IACH,MAAM,CAAC,cAAc,IAAI,MAAM;IAI/B;;;OAGG;IACH,MAAM,CAAC,sBAAsB,IAAI,IAAI;IAIrC;;;;;;;;OAQG;IACH,MAAM,CAAC,sBAAsB,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIvD;;OAEG;IAGH,MAAM,CAAC,sBAAsB,IAAI,MAAM,CAAC,YAAY;IAiBpD,mCAAmC;IACnC,OAAO,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAK5B,kCAAkC;IAClC,MAAM,IAAI,MAAM;IAIhB,0CAA0C;IAC1C,cAAc,IAAI,SAAS,MAAM,CAAC,UAAU,EAAE;IAK9C,wCAAwC;IACxC,YAAY,IAAI,MAAM;IAOtB,wCAAwC;IACxC,YAAY,IAAI,MAAM,GAAG,IAAI;IAK7B,mCAAmC;IACnC,OAAO,IAAI,MAAM,CAAC,IAAI;IAKtB,kCAAkC;IAClC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,UAAU,EAAE,GAAG,MAAM;IAOhD;;;;;OAKG;IACH,OAAO,CAAC,aAAa;IAcrB,iCAAiC;IACjC,KAAK,CAAC,IAAI,GAAE,MAAM,CAAC,OAAa,EAAE,KAAK,GAAE,OAAa,GAAG,MAAM;IAiB/D,kCAAkC;IAClC,MAAM,CAAC,QAAQ,GAAE,OAAa,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI;IAKnD,kCAAkC;IAClC,MAAM,CAAC,QAAQ,GAAE,OAAa,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI;IAQnD,iCAAiC;IACjC,KAAK,CAAC,QAAQ,GAAE,OAAa,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG;IAMjD,0CAA0C;IAC1C,cAAc,CAAC,QAAQ,GAAE,OAAa,EAAE,SAAS,GAAE,MAAU,GAAG,MAAM;IAatE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,MAAM,CAEjC;IAED,oCAAoC;IACpC,QAAQ;IAwBR,oCAAoC;IACpC,IAAI,QAAQ,IAAI,IAAI,CAAiB;CAEtC"}

package/types/src/color/ColorSpace.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Color definitions available in various ColorSpaces.
+ */
+export declare namespace ColorSpace {
+    /**
+     * A color in the Red, Green, Blue color space.
+     */
+    class RGBA {
+        protected _private: {
+            red: number;
+            green: number;
+            blue: number;
+            alpha: number;
+        };
+        constructor(red: number, green: number, blue: number, alpha?: number);
+        get red(): number;
+        get green(): number;
+        get blue(): number;
+        get alpha(): number;
+        toString(alpha?: boolean): string;
+        isEqual(other: ColorSpace.RGBA): boolean;
+        isAlmostEqual(other: ColorSpace.RGBA): boolean;
+    }
+    /**
+     * A color in the Hue, Saturation, Luminosity color space.
+     */
+    class HSLA {
+        private _private;
+        constructor(hue: number, sat: number, lum: number, alpha: number);
+        get hue(): number;
+        get sat(): number;
+        get lum(): number;
+        get alpha(): number;
+        toString(alpha?: boolean): string;
+        isEqual(other: ColorSpace.HSLA): boolean;
+        isAlmostEqual(other: ColorSpace.HSLA): boolean;
+    }
+    /**
+     * A color (Red, Green, Blue) encoded in hexadecimal.
+     */
+    class HEX extends ColorSpace.RGBA {
+        toString(alpha?: boolean): string;
+    }
+}
+//# sourceMappingURL=ColorSpace.d.ts.map

package/types/src/color/ColorSpace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ColorSpace.d.ts","sourceRoot":"","sources":["../../../../src/color/ColorSpace.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,yBAAiB,UAAU,CAAC;IAE1B;;OAEG;IACH,MAAa,IAAI;QACf,SAAS,CAAC,QAAQ,EAAE;YAClB,GAAG,EAAE,MAAM,CAAC;YACZ,KAAK,EAAE,MAAM,CAAC;YACd,IAAI,EAAE,MAAM,CAAC;YACb,KAAK,EAAE,MAAM,CAAA;SACd,CAAA;oBACW,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,GAAE,MAAQ;QAKrE,IAAI,GAAG,WAEN;QACD,IAAI,KAAK,WAER;QACD,IAAI,IAAI,WAEP;QACD,IAAI,KAAK,WAER;QACD,QAAQ,CAAC,KAAK,GAAE,OAAY,GAAG,MAAM;QAOrC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,GAAG,OAAO;QASxC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,GAAG,OAAO;KAa/C;IAED;;OAEG;IACH,MAAa,IAAI;QACf,OAAO,CAAC,QAAQ,CAKf;oBACW,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;QAKhE,IAAI,GAAG,WAEN;QACD,IAAI,GAAG,WAEN;QACD,IAAI,GAAG,WAEN;QACD,IAAI,KAAK,WAER;QACD,QAAQ,CAAC,KAAK,GAAE,OAAY,GAAG,MAAM;QAOrC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,GAAG,OAAO;QASxC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,GAAG,OAAO;KAa/C;IAED;;OAEG;IACH,MAAa,GAAI,SAAQ,UAAU,CAAC,IAAI;QACtC,QAAQ,CAAC,KAAK,GAAE,OAAY,GAAG,MAAM;KAMtC;CACF"}