@sheetxl/sdk 0.7.21 → 0.7.23-beta.2

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

@@ -0,0 +1,102 @@
+import { Direction, RangeCoords } from '@sheetxl/utils';
+import { RTree } from './RTree';
+import { ISpatialMap } from './ISpatialMap';
+/**
+ * The default implementation for {@link ISpatialMap}
+ */
+export declare class SpatialMap<T = any> implements ISpatialMap<T> {
+    protected _shared: SharedRecord<T> | null;
+    protected _rTree: FilterRTree<T>;
+    protected _cloneKey: any;
+    protected _options: ISpatialMap.ConstructorOptions<T> | undefined;
+    protected _lastMiss: RangeCoords;
+    protected _lastSingle: RangeCoords;
+    protected _lastSingleResult: ISpatialMap.Entry<T>[] | null;
+    constructor(options?: ISpatialMap.ConstructorOptions<T>);
+    /** {@inheritDoc ISpatialMap.visitRanges} */
+    visitRanges(range: RangeCoords, visitor: ISpatialMap.Visitor<T>, sort?: Direction | null): void;
+    /** {@inheritDoc ISpatialMap.getBoundingRange} */
+    getBoundingRange(): RangeCoords;
+    /** {@inheritDoc ISpatialMap.size} */
+    size(): number;
+    /** {@inheritDoc ISpatialMap.isEmpty} */
+    isEmpty(): boolean;
+    /** {@inheritDoc ISpatialMap.search} */
+    search(range: RangeCoords, fullyContained?: boolean, sort?: boolean, results?: ISpatialMap.Entry<T>[]): ISpatialMap.Entry<T>[];
+    /** {@inheritDoc ISpatialMap.has} */
+    has(range: RangeCoords): boolean;
+    /** {@inheritDoc ISpatialMap.all} */
+    all(results?: ISpatialMap.Entry<T>[]): ISpatialMap.Entry<T>[];
+    /** {@inheritDoc ISpatialMap.shift} */
+    shift(options: ISpatialMap.ShiftOptions<T>): this;
+    /** {@inheritDoc ISpatialMap.insertNonOverlapping} */
+    insertNonOverlapping(range: ISpatialMap.Entry<T>, options?: ISpatialMap.InsertNonOverlappingOptions<T>): this;
+    /** {@inheritDoc ISpatialMap.insertGroup} */
+    insertGroup(entries: ISpatialMap.Entry<T>[], groupId?: string): this;
+    /** {@inheritDoc ISpatialMap.createCopiedEntries} */
+    createCopiedEntries(from: RangeCoords, to: RangeCoords, options?: ISpatialMap.CopyOptions, reuseInserts?: ISpatialMap.Entry<T>[], reuseRemoves?: ISpatialMap.Entry<T>[]): ISpatialMap.Updates;
+    /** {@inheritDoc ISpatialMap.remove} */
+    remove(entry: ISpatialMap.Entry<T>, equals?: (a: ISpatialMap.Entry<T>, b: ISpatialMap.Entry<T>) => boolean): this;
+    /** {@inheritDoc ISpatialMap.removeAll} */
+    removeAll(entries: ISpatialMap.Entry<T>[], equals?: (a: ISpatialMap.Entry<T>, b: ISpatialMap.Entry<T>) => boolean): this;
+    /** {@inheritDoc ISpatialMap.insert} */
+    insert(entry: ISpatialMap.Entry<T>): this;
+    /** {@inheritDoc ISpatialMap.load} */
+    load(entries: ReadonlyArray<ISpatialMap.Entry<T>>): this;
+    /** {@inheritDoc ISpatialMap.clear} */
+    clear(): this;
+    /** {@inheritDoc ISpatialMap.delete} */
+    delete(coords: RangeCoords | null): this;
+    /** {@inheritDoc ISpatialMap.clone} */
+    clone(cloneKey?: any): this;
+    /**
+     * Insert and removes nodes that contained with a group.
+     *
+     * @param groupsByGroupId Groups by the id of the group
+     * @param entriesByEntryId Amendments by the original id
+     *
+     * @remarks
+     * * This logic visits all group entries and ensures all entries are update and removed so that all group entries entries are the same instance.
+     */
+    protected _updateGroupedEntries(groupsByGroupId: Map<string, Group>, entriesByEntryId: Map<string, (ISpatialMap.Entry<T> | null)[]>): void;
+    protected _copy(source: SharedRecord<T>, entries?: ReadonlyArray<ISpatialMap.Entry<T>>): SharedRecord<T>;
+    protected _updateNodes(nodesInsert: ISpatialMap.Entry<T>[], nodesRemove?: ISpatialMap.Entry<T>[], onUpdates?: (nodesInsert: ISpatialMap.Entry<T>[], nodesRemove: ISpatialMap.Entry<T>[], map: ISpatialMap<T>) => void): void;
+    protected _mergeNodes(range: RangeCoords, fullyContained?: boolean): ISpatialMap.Entry<T>[];
+    protected _getReadTree(): FilterRTree<T>;
+    protected _ensureWritable(entries?: ReadonlyArray<ISpatialMap.Entry<T>>): void;
+    /**
+     * entries is a special performance optimization to allow a single bulk load.
+     */
+    protected _getWritableTree(entries?: ReadonlyArray<ISpatialMap.Entry<T>>): FilterRTree<T>;
+    /**
+     * Callback for any modification
+     */
+    protected _onModified(): void;
+    /**
+     * Create the clone
+     */
+    protected _createClone(options: ISpatialMap.ConstructorOptions<T> | undefined): this;
+}
+interface SharedRecord<T> {
+    refCount: number;
+    rTree: FilterRTree<T>;
+}
+interface Group<T = any> {
+    entries: InternalEntry<T>[];
+    uuid: string;
+    offset: number;
+}
+interface InternalEntry<T = any> extends ISpatialMap.Entry<T> {
+    group?: Group<T>;
+    timeStamp?: number;
+}
+/**
+ * Internal class that extends RTree to support Filters.
+ * is needed — the default passthrough in RTree works directly.
+ */
+declare class FilterRTree<T = any> extends RTree<ISpatialMap.Entry<T>> {
+    isEmpty(): boolean;
+    searchRange(range: RangeCoords, fullyContained?: boolean, results?: ISpatialMap.Entry<T>[]): ISpatialMap.Entry<T>[];
+}
+export {};
+//# sourceMappingURL=SpatialMap.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SpatialMap.d.ts","sourceRoot":"","sources":["../../../../src/collections/SpatialMap.ts"],"names":[],"mappings":"AAAA,OAAO,EACQ,SAAS,EAAwC,KAAK,WAAW,EAC/E,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AAEjD;;GAEG;AACH,qBAAa,UAAU,CAAC,CAAC,GAAC,GAAG,CAAE,YAAW,WAAW,CAAC,CAAC,CAAC;IAEtD,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAQ;IACjD,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAEjC,SAAS,CAAC,SAAS,EAAE,GAAG,CAAQ;IAChC,SAAS,CAAC,QAAQ,EAAE,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAGlE,SAAS,CAAC,SAAS,EAAE,WAAW,CAA4E;IAE5G,SAAS,CAAC,WAAW,EAAE,WAAW,CAA4E;IAC9G,SAAS,CAAC,iBAAiB,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAQ;gBAEtD,OAAO,CAAC,EAAE,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAMvD,4CAA4C;IAC5C,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,SAAS,GAAG,IAAS,GAAG,IAAI;IAgCnG,iDAAiD;IACjD,gBAAgB,IAAI,WAAW;IAM/B,qCAAqC;IACrC,IAAI,IAAI,MAAM;IAKd,wCAAwC;IACxC,OAAO,IAAI,OAAO;IAIlB,uCAAuC;IACvC,MAAM,CACJ,KAAK,EAAE,WAAW,EAClB,cAAc,GAAE,OAAa,EAC7B,IAAI,GAAE,OAAa,EACnB,OAAO,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAC/B,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;IAkEzB,oCAAoC;IACpC,GAAG,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO;IAKhC,oCAAoC;IACpC,GAAG,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;IAI7D,sCAAsC;IACtC,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAgQjD,qDAAqD;IACrD,oBAAoB,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,2BAA2B,CAAC,CAAC,CAAC,GAAG,IAAI;IAqJ7G,4CAA4C;IAC5C,WAAW,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;IAwBpE,oDAAoD;IACpD,mBAAmB,CACjB,IAAI,EAAE,WAAW,EACjB,EAAE,EAAE,WAAW,EACf,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,GACpC,WAAW,CAAC,OAAO;IAYtB,uCAAuC;IACvC,MAAM,CACJ,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAC3B,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,GACrE,IAAI;IAcP,0CAA0C;IAC1C,SAAS,CACP,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAC/B,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,GACrE,IAAI;IAQP,uCAAuC;IACvC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;IAQzC,qCAAqC;IACrC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IASxD,sCAAsC;IACtC,KAAK,IAAI,IAAI;IAQb,uCAAuC;IACvC,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,GAAG,IAAI;IAgBxC,sCAAsC;IACtC,KAAK,CAAC,QAAQ,GAAE,GAAQ,GAAG,IAAI;IAyB/B;;;;;;;;OAQG;IAEH,SAAS,CAAC,qBAAqB,CAC7B,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EACnC,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAC7D,IAAI;IA8DP,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAgBxG,SAAS,CAAC,YAAY,CACpB,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EACnC,WAAW,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EACpC,SAAS,CAAC,EAAE,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,IAAI,GAClH,IAAI;IAqBP,SAAS,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC,EAAE,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;IAqB3F,SAAS,CAAC,YAAY,IAAI,WAAW,CAAC,CAAC,CAAC;IAIxC,SAAS,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IAmB9E;;OAEG;IACH,SAAS,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAiBzF;;OAEG;IACH,SAAS,CAAC,WAAW,IAAI,IAAI;IAE7B;;OAEG;IACH,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;CAIrF;AAGD,UAAU,YAAY,CAAC,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;CACvB;AAED,UAAU,KAAK,CAAC,CAAC,GAAC,GAAG;IACnB,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB;AACD,UAAU,aAAa,CAAC,CAAC,GAAC,GAAG,CAAE,SAAQ,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IAIzD,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAIjB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,cAAM,WAAW,CAAC,CAAC,GAAC,GAAG,CAAE,SAAQ,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE1D,OAAO,IAAI,OAAO;IAIlB,WAAW,CACT,KAAK,EAAE,WAAW,EAClB,cAAc,GAAE,OAAa,EAC7B,OAAO,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAC/B,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;CAgB1B"}

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

@@ -0,0 +1,64 @@
+import { RangeCoords } from '@sheetxl/utils';
+import { ISpatialMap } from './ISpatialMap';
+import { ISpatialMap3D } from './ISpatialMap3D';
+/**
+ * Implementation of {@link ISpatialMap3D}.
+ *
+ * Deliberately NOT a {@link SpatialMap}; it routes every operation to a per-scope 2D map.
+ * Entries are stamped with their scope key on the way in so that every entry inside a
+ * 2D map carries `scope` equal to the map's key (consumers read `.scope` off search
+ * results, so the scope must be preserved — never stripped).
+ */
+export declare class SpatialMap3D<T = any> implements ISpatialMap3D<T> {
+    protected _mapScopeTo2Ds: Map<string, ISpatialMap<T>>;
+    protected _last2DKey: string | null | undefined;
+    protected _last2DMap: ISpatialMap<T> | undefined;
+    protected _options: SpatialMap3D.ConstructorOptions<T> | undefined;
+    protected _options2D: ISpatialMap.ConstructorOptions<T> | undefined;
+    constructor(options?: SpatialMap3D.ConstructorOptions<T>);
+    /** {@inheritDoc ISpatialMap3D.all3D} */
+    all3D(results?: ISpatialMap.Entry<T>[]): ISpatialMap.Entry<T>[];
+    /** {@inheritDoc ISpatialMap3D.getSpatialAt} */
+    getSpatialAt(scope?: string | null): ISpatialMap<T>;
+    /** {@inheritDoc ISpatialMap3D.getScopeEntries} */
+    getScopeEntries(): MapIterator<[string, ISpatialMap<T>]>;
+    /** {@inheritDoc ISpatialMap3D.getScopeKeys} */
+    getScopeKeys(): MapIterator<string>;
+    /** {@inheritDoc ISpatialMap3D.getScopeValues} */
+    getScopeValues(): MapIterator<ISpatialMap<T>>;
+    /** {@inheritDoc ISpatialQuery.getBoundingRange} */
+    getBoundingRange(): RangeCoords;
+    /** {@inheritDoc ISpatialQuery.isEmpty} */
+    isEmpty(): boolean;
+    /** {@inheritDoc ISpatialQuery.search} */
+    search(range: RangeCoords, fullyContained?: boolean, sort?: boolean, results?: ISpatialMap.Entry<T>[]): ISpatialMap.Entry<T>[];
+    /** {@inheritDoc ISpatialMap3D.has} */
+    has(range: RangeCoords): boolean;
+    /** {@inheritDoc ISpatialMap3D.shift} */
+    shift(options: ISpatialMap.ShiftOptions<T>): this;
+    /** {@inheritDoc ISpatialMap3D.insertNonOverlapping} */
+    insertNonOverlapping(entry: ISpatialMap.Entry<T>, options?: ISpatialMap.InsertNonOverlappingOptions<T>): this;
+    /** {@inheritDoc ISpatialMap3D.createCopiedEntries} */
+    createCopiedEntries(from: RangeCoords, to: RangeCoords, options?: ISpatialMap.CopyOptions, reuseInserts?: ISpatialMap.Entry<T>[], reuseRemoves?: ISpatialMap.Entry<T>[]): ISpatialMap.Updates;
+    /** {@inheritDoc ISpatialMap3D.remove} */
+    remove(entry: ISpatialMap.Entry<T>, equals?: (a: ISpatialMap.Entry<T>, b: ISpatialMap.Entry<T>) => boolean): this;
+    /** {@inheritDoc ISpatialMap3D.removeAll} */
+    removeAll(entries: ISpatialMap.Entry<T>[], equals?: (a: ISpatialMap.Entry<T>, b: ISpatialMap.Entry<T>) => boolean): this;
+    /** {@inheritDoc ISpatialMap3D.insert} */
+    insert(entry: ISpatialMap.Entry<T>): this;
+    /** {@inheritDoc ISpatialMap3D.load} */
+    load(entries: ReadonlyArray<ISpatialMap.Entry<T>>): this;
+    /** {@inheritDoc ISpatialMap3D.delete} */
+    delete(coords: RangeCoords | null): this;
+    /** {@inheritDoc ISpatialMap3D.clone} */
+    clone(cloneKey?: any): this;
+    protected _getOrCreate2D(scope: string | null | undefined): ISpatialMap<T>;
+    protected _cleanupEmpty2D(scope: string | null | undefined, map2D: ISpatialMap<T> | undefined): void;
+    protected _createClone(options: SpatialMap3D.ConstructorOptions<T> | undefined): this;
+}
+export declare namespace SpatialMap3D {
+    /** Options */
+    interface ConstructorOptions<T = any> extends ISpatialMap.ConstructorOptions<T> {
+    }
+}
+//# sourceMappingURL=SpatialMap3D.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SpatialMap3D.d.ts","sourceRoot":"","sources":["../../../../src/collections/SpatialMap3D.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,KAAK,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG/D,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,KAAK,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAErD;;;;;;;GAOG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAC,GAAG,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IAC1D,SAAS,CAAC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAa;IAElE,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAa;IAC5D,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAa;IAE7D,SAAS,CAAC,QAAQ,EAAE,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACnE,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBAExD,OAAO,CAAC,EAAE,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAexD,wCAAwC;IACxC,KAAK,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;IAoB/D,+CAA+C;IAC/C,YAAY,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC;IAUnD,kDAAkD;IAClD,eAAe,IAAI,WAAW,CAAC,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAIxD,+CAA+C;IAC/C,YAAY,IAAI,WAAW,CAAC,MAAM,CAAC;IAInC,iDAAiD;IACjD,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAI7C,mDAAmD;IACnD,gBAAgB,IAAI,WAAW;IAM/B,0CAA0C;IAC1C,OAAO,IAAI,OAAO;IAOlB,yCAAyC;IACzC,MAAM,CACJ,KAAK,EAAE,WAAW,EAClB,cAAc,GAAE,OAAa,EAC7B,IAAI,GAAE,OAAa,EACnB,OAAO,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAC/B,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;IAOzB,sCAAsC;IACtC,GAAG,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO;IAOhC,wCAAwC;IACxC,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAcjD,uDAAuD;IACvD,oBAAoB,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,2BAA2B,CAAC,CAAC,CAAC,GAAG,IAAI;IAM7G,sDAAsD;IACtD,mBAAmB,CACjB,IAAI,EAAE,WAAW,EACjB,EAAE,EAAE,WAAW,EACf,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,GACpC,WAAW,CAAC,OAAO;IAyBtB,yCAAyC;IACzC,MAAM,CACJ,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAC3B,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,GACrE,IAAI;IAUP,4CAA4C;IAC5C,SAAS,CACP,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAC/B,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,GACrE,IAAI;IAiCP,yCAAyC;IACzC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;IAKzC,uCAAuC;IACvC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IA6BxD,yCAAyC;IACzC,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,GAAG,IAAI;IAcxC,wCAAwC;IACxC,KAAK,CAAC,QAAQ,GAAE,GAAQ,GAAG,IAAI;IAW/B,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC;IAY1E,SAAS,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;IAUpG,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;CAGtF;AAED,yBAAiB,YAAY,CAAC;IAC5B,cAAc;IACd,UAAiB,kBAAkB,CAAC,CAAC,GAAC,GAAG,CAAE,SAAQ,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC;KACnF;CACF"}

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

@@ -0,0 +1,160 @@
+import { ChainedError } from '@sheetxl/utils';
+import { IList, IListLike } from './IList';
+/**
+ * Namespace for tuples.
+ */
+export declare namespace Tuple {
+    /**
+     * Represents a pair of values: a numeric index represents the starting offset and an array of elements.
+     *
+     * This provides a convenient shorthand for scenarios where you need to associate
+     * a contiguous span of values with a specific index or position.
+     * @remarks
+     * The MinorTuple is types as an Array with 2 elements for performance reasons but can be logically
+     * conceptualized as the following type.
+     * ```
+  type MinorTuple<T = any> = {
+    minor: number;
+    values: T[];
+  };
+     * ```
+     */
+    type MinorTuple<T = any> = [minor: number, runs: IListLike<T>];
+    /**
+     * Represents a tuple associated with a specific dimension (e.g., a row or a column in a grid).
+     *
+     * The first element is the major index, and the second element is a `MinorTuple` representing
+     * the minor indices and values associated with that location.
+     */
+    type MajorTuple<T = any> = [major: number, minors: MinorTuple<T>[]];
+    /**
+     * Represents a collection of `MajorTuple`s, used to store data for a 2d collection of tuples.
+     * **Validity Requirements:**
+     * - The `major` values within a collection of `MajorTuple`s must be sorted in ascending order.
+     * - The `minor` values within each `MinorTuple` of a `MajorTuple` must be sorted in ascending order.
+     * - The `minors` (array of `MinorTuple`s) within a `MajorTuple` must not overlap; their ranges
+     *   (defined by the `minor` values and the `length` of the `values` arrays) should be mutually exclusive.
+     */
+    type GridTuple<T = any> = MajorTuple<T>[];
+    /**
+     * Adds precomputed bounds for the `MajorTuple`s.
+     *
+     * @remarks
+     * In some scenarios the maximum bounds of the tuples is required (e.g., during rendering or calculations),
+     * providing precomputed bounds can improve performance by avoiding the need to scan the entire collection.
+     */
+    interface BoundedTuples<T = any> {
+        /**
+         * The bounded tuples.
+         */
+        tuples: Tuple.GridTuple<T>;
+        /**
+         * The precomputed bounds encompassing all the `MajorTuple`s.
+         */
+        bounds: Tuple.OrientatedCoords;
+    }
+    /**
+     * RangeCoords expressed in relative coordinates.
+     */
+    interface OrientatedCoords {
+        majorStart: number;
+        minorStart: number;
+        majorEnd: number;
+        minorEnd: number;
+    }
+    /**
+     * A builder for easily creating tuples that can be either contiguous or non-contiguous.
+     * A builder maintains an ordered structure where major and minor values must always
+     * increase, otherwise an error will be thrown.
+     *
+     * @template T The type of values stored within the tuples.
+     */
+    interface IBuilder<T = any> {
+        /**
+         * Adds a single value associated with a specific major and minor index.
+         *
+         * @param major The major index.
+         * @param minor The minor index.
+         * @param value The value to be added.
+         * @throws `Error` If the point is out of order compared to previously added points
+         * (within the same row).
+         *
+         * @remarks
+         * If the value is an Array, it will be treated as a discrete value. If you want to set
+         * multiple values along the minor axis, then use {@link pushMultipleAt}.
+         */
+        pushAt(major: number, minor: number, value: T): IBuilder<T>;
+        /**
+         * Adds multiple values associated with a specific major and minor index.
+         *
+         * @param major The major index.
+         * @param minor The minor index.
+         * @param value An array of values to be added.
+         * @throws `Error` If the point is out of order compared to previously added points
+         * (within the same row).
+         */
+        pushMultipleAt(major: number, minor: number, value: IListLike<T> | T[]): IBuilder<T>;
+        /**
+         * Constructs and returns the bounded tuples based on the added values.
+         * This method can be called multiple times.
+         *
+         * @returns The built bounded tuples.
+         */
+        build(): Tuple.BoundedTuples<T>;
+    }
+    /**
+     * Implementation of {@link IBuilder} that that adds in aligned order.
+     */
+    class Builder<T = any> implements IBuilder<T> {
+        private _tuples;
+        private _minors;
+        private _values;
+        private _minorMin;
+        private _minorMax;
+        private _majorIndex;
+        private _minorIndex;
+        private _createList;
+        private _offsetMajor;
+        private _offsetMinor;
+        constructor(createList?: (arr: Array<T>) => IList<T>, offsetMajor?: number, offsetMinor?: number);
+        /** {@inheritDoc IBuilder.pushMultipleAt} */
+        pushMultipleAt(major: number, minor: number, value: T[]): IBuilder<T>;
+        /** {@inheritDoc IBuilder.pushAt} */
+        pushAt(major: number, minor: number, value: T): IBuilder<T>;
+        /** {@inheritDoc IBuilder.build} */
+        build(): Tuple.BoundedTuples<T>;
+    }
+    /**
+     * Transposes cell coordinates within tuples to create `MajorTuple` representations
+     * in the opposite axis.
+     *
+     * This utility efficiently converts data organized by one axis into the opposite.
+     */
+    class TransposedBuilder<T> implements IBuilder<T> {
+        private _minors;
+        /** the currentNode the node.minorIndex >= _minorIndex */
+        private _current;
+        private _first;
+        private _majorMin;
+        private _majorMax;
+        private _majorIndex;
+        private _minorIndex;
+        private _createList;
+        private _offsetMajor;
+        private _offsetMinor;
+        constructor(createList?: <T>(arr: Array<T>) => IListLike<T>, offsetMajor?: number, offsetMinor?: number);
+        /** {@inheritDoc IBuilder.pushMultipleAt} */
+        pushMultipleAt(major: number, minor: number, value: T[]): IBuilder<T>;
+        /** {@inheritDoc IBuilder.pushAt} */
+        pushAt(major: number, minor: number, value: T): IBuilder<T>;
+        /** {@inheritDoc IBuilder.build} */
+        build(): Tuple.BoundedTuples<T>;
+    }
+    /**
+     * Thrown when a major minor is set out of order.
+     */
+    class OutOfOrderError extends ChainedError {
+        constructor(message?: string, cause?: Error | null);
+    }
+}
+//# sourceMappingURL=Tuple.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Tuple.d.ts","sourceRoot":"","sources":["../../../../src/collections/Tuple.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAK9C,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,SAAS,EAAE,MAAM,SAAS,CAAC;AAErD;;GAEG;AACH,yBAAiB,KAAK,CAAC;IACrB;;;;;;;;;;;;;;OAcG;IACH,KAAY,UAAU,CAAC,CAAC,GAAC,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE;;;;;OAKG;IACH,KAAY,UAAU,CAAC,CAAC,GAAC,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzE;;;;;;;OAOG;IACH,KAAY,SAAS,CAAC,CAAC,GAAC,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;IAE/C;;;;;;OAMG;IACH,UAAiB,aAAa,CAAC,CAAC,GAAC,GAAG;QAClC;;WAEG;QACH,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B;;WAEG;QACH,MAAM,EAAE,KAAK,CAAC,gBAAgB,CAAC;KAChC;IAED;;OAEG;IACH,UAAiB,gBAAgB;QAC/B,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;KAClB;IAED;;;;;;OAMG;IACH,UAAiB,QAAQ,CAAC,CAAC,GAAC,GAAG;QAC7B;;;;;;;;;;;;WAYG;QACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5D;;;;;;;;WAQG;QACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrF;;;;;WAKG;QACH,KAAK,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;KACjC;IAED;;OAEG;IACH,MAAa,OAAO,CAAC,CAAC,GAAC,GAAG,CAAE,YAAW,QAAQ,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,OAAO,CAA0B;QACzC,OAAO,CAAC,OAAO,CAAsC;QACrD,OAAO,CAAC,OAAO,CAAmB;QAElC,OAAO,CAAC,SAAS,CAAiC;QAClD,OAAO,CAAC,SAAS,CAAW;QAE5B,OAAO,CAAC,WAAW,CAAmC;QACtD,OAAO,CAAC,WAAW,CAAmC;QAEtD,OAAO,CAAC,WAAW,CAA4C;QAC/D,OAAO,CAAC,YAAY,CAAW;QAC/B,OAAO,CAAC,YAAY,CAAW;oBAG7B,UAAU,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EACxC,WAAW,GAAE,MAAQ,EACrB,WAAW,GAAE,MAAQ;QAOvB,4CAA4C;QAC5C,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,CAAC,EAAE,GACT,QAAQ,CAAC,CAAC,CAAC;QAmBd,oCAAoC;QACpC,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,CAAC,GACP,QAAQ,CAAC,CAAC,CAAC;QAkDd,mCAAmC;QACnC,KAAK,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;KA0BhC;IAGD;;;;;OAKG;IACH,MAAa,iBAAiB,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,CAAC;QAEtD,OAAO,CAAC,OAAO,CAAmC;QAClD,yDAAyD;QACzD,OAAO,CAAC,QAAQ,CAA6B;QAC7C,OAAO,CAAC,MAAM,CAA6B;QAE3C,OAAO,CAAC,SAAS,CAAiC;QAClD,OAAO,CAAC,SAAS,CAAW;QAE5B,OAAO,CAAC,WAAW,CAAmC;QACtD,OAAO,CAAC,WAAW,CAAmC;QAEtD,OAAO,CAAC,WAAW,CAA8C;QACjE,OAAO,CAAC,YAAY,CAAa;QACjC,OAAO,CAAC,YAAY,CAAa;oBAG/B,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAC/C,WAAW,GAAE,MAAQ,EACrB,WAAW,GAAE,MAAQ;QAQvB,4CAA4C;QAC5C,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;QAcrE,oCAAoC;QACpC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAqH3D,mCAAmC;QACnC,KAAK,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;KAgChC;IAED;;OAEG;IACH,MAAa,eAAgB,SAAQ,YAAY;oBACnC,OAAO,GAAE,MAAqB,EAAE,KAAK,GAAE,KAAK,GAAG,IAAS;KAIrE;CACF"}

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

@@ -0,0 +1,25 @@
+import { Direction, RangeCoords, RunCoords } from '@sheetxl/utils';
+/**
+ * Sorts ranges in 2 directions but weighted to direction.
+ *
+ * @remarks
+ * * Mutates the ranges array.
+ * * Will also sort nulls to the end.
+ * * Only uses the colStart and rowStart. It does not account for colEnd and rowEnd.
+ *
+ * @param ranges The ranges to sort
+ * @param direction defaultValue Direction.Right
+ */
+export declare function sortRanges(ranges: RangeCoords[], direction?: Direction, additionalSort?: ((a: RangeCoords, b: RangeCoords) => number) | null): RangeCoords[];
+/**
+ * Specialize Comparator. We only create RunCoords with a -1 max for search operations.
+ * We look for a RunCoord that has a missing edge.
+ *
+ * We only have to check the second argument because all of our search operations guarantee the
+ * key will be the second argument.
+ *
+ * @param a The first RunCoords.
+ * @param b The second RunCoords or the search key in the case where max is `Number.MAX_SAFE_INTEGER`.
+ */
+export declare function runCoordsAndPivotComparator(a: RunCoords, b: RunCoords): number;
+//# sourceMappingURL=_CollectionUtils.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"_CollectionUtils.d.ts","sourceRoot":"","sources":["../../../../src/collections/_CollectionUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,KAAK,WAAW,EAAE,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAE7E;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,WAAW,EAAE,EACrB,SAAS,GAAE,SAAyB,EACpC,cAAc,GAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,KAAK,MAAM,CAAC,GAAG,IAAW,GACzE,WAAW,EAAE,CA2Cf;AAED;;;;;;;;;GASG;AACH,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,MAAM,CAoB9E"}

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

@@ -0,0 +1,268 @@
+import { RangeAxis, CellCoords, RangeCoords } from '@sheetxl/utils';
+import { IGrid } from './IGrid';
+import { ISpatialMap } from './ISpatialMap';
+import { Tuple } from './Tuple';
+/**
+ * Return a range as an in the correct major/minor axis.
+ *
+ * If maxRange is provided then this will also validate
+ * and throw an `OutOfBoundsError`.
+ *
+ * @remarks
+ * This reuses the same OrientationBounds.
+ */
+export declare function orientAndValidateReused(colStart: number | undefined, rowStart: number | undefined, colEnd: number | undefined, rowEnd: number | undefined, isColumn: boolean, maxRange?: RangeCoords, dataRange?: RangeCoords): Tuple.OrientatedCoords;
+export declare function unOrientCoords(oriented: Tuple.OrientatedCoords, isColumn: boolean, reuseCoords?: RangeCoords): RangeCoords;
+/**
+ * Creates an iterator results.
+ *
+ * @param majorIndex The index for major value.
+ * @param minorIndex The index for minor value.
+ * @param value -The Value.
+ * @param isColumn The results are in absolute axis so we need to convert back
+ * @param reuseResult If provided this will not create a new object.
+ * @returns an {@link IGrid.EntryIteratorResult} that can be provide to the client.
+ * @see
+ * {@link IGrid.IteratorOptions.reuseResult}
+ */
+export declare function createEntryIteratorResults<T>(majorIndex: number, minorIndex: number, value: T, isColumn: boolean, reuseResult?: IGrid.EntryIteratorResult<T>): IGrid.EntryIteratorResult<T>;
+/**
+ * Simple util that converts a boolean to a the global value or undefined.
+ * @param reuseResult The client provided input
+ */
+export declare function toReusableEntryResult<T>(reuseResult: boolean | IGrid.EntryIteratorResult<T> | undefined): IGrid.EntryIteratorResult<T>;
+/**
+ * Sort by first index.
+ */
+export declare function validateTupleOffsets<T>(tuples: [number, T][]): void;
+/**
+ * Sort by first index.
+ */
+export declare function sortTupleOffset<T>(a: [number, T], b: [number, T]): number;
+/**
+ * Iterator Options.
+ */
+export interface EmptyIteratorOptions extends Omit<IGrid.IteratorOptions, 'bounds'> {
+    /**
+     * Required for the iterator to work correctly.
+     */
+    bounds: RangeCoords;
+    /**
+     * Setting skipMajors to `true` will have the EmptyIterator only visit empty minors.
+     * @remarks
+     * We don't have a skipMinors then empty majors would have to be skipped as well and then
+     * the EmptyIterator should not be used.
+     */
+    skipMajors?: boolean;
+}
+/**
+ * Visits an iterator and creates additional iterations for any missing gaps.
+ * Accounts for hidden and reverse.
+ * @remarks
+ * It is VERY important that the delegate iterator increments in the same order (not reversed).
+ *
+ * Unlike IGridIterator options Bounds is required.
+ *
+ */
+export declare class EmptyIterator<T = any, TReturn = any> implements Iterator<T, TReturn, CellCoords> {
+    private _delegate;
+    private _isColumn;
+    private _isReverse;
+    private _skipMajors;
+    private _majorMin;
+    private _majorMax;
+    private _minorMin;
+    private _minorMax;
+    private _majorIndex;
+    private _minorIndex;
+    private _delegateResult;
+    private _delegateMajorIndex;
+    private _delegateMinorIndex;
+    private _processMajorSkip;
+    private _processMinorSkip;
+    constructor(delegate: Iterator<T, TReturn, CellCoords>, options: EmptyIteratorOptions);
+    private _initialize;
+    /**
+     * Returns the next iterator.
+     */
+    next(cell?: CellCoords): IteratorResult<T>;
+    return(_value?: TReturn): IteratorResult<T, TReturn>;
+    throw(_e?: any): IteratorResult<T, TReturn>;
+    [Symbol.iterator](): IterableIterator<T>;
+}
+/**
+ * Options for RepeatingIterator.
+ */
+export type RepeatIteratorOptions<T = any, TReturn = any> = {
+    /**
+     * The delegate.
+     */
+    delegate: Iterator<[CellCoords, T], TReturn, CellCoords>;
+    /**
+     * Required - This must match the bounds of the Delegate iterator.
+     */
+    bounds: RangeCoords;
+    /**
+     * Required - This much be larger than the bounds.
+     */
+    dims: {
+        major: number;
+        minor: number;
+    };
+    /**
+     * Optional
+     * @remarks
+     * This can be different than the delegate but then the bounds and dim need to be manually
+     * transposed by the caller.
+     */
+    axis?: RangeAxis;
+    /**
+     * @see
+     * {@link IGrid.IteratorOptions.reuseResult}
+     */
+    reuseResult?: boolean | IGrid.EntryIteratorResult<T>;
+};
+/**
+ * Visits an iterator and will creates additional iterations to fill the new bounding area.
+ * @remarks
+ * This iterator creates a temporary copy of the first values to repeat.
+ *
+ * * delegate iterator bounds must not be larger than dimension.
+ * * reverse is currently not implemented.
+ */
+export declare class RepeatingIterator<T = any, TReturn = any> implements Iterator<[CellCoords, T], TReturn, CellCoords> {
+    private _isColumn;
+    private _majorSize;
+    private _minorSize;
+    private _majorMin;
+    private _majorMax;
+    private _minorMin;
+    private _minorMax;
+    private _delegate;
+    private _nextDelegateResult;
+    private _nextResult;
+    private _majorIndex;
+    private _minorIndex;
+    private _minorSpan;
+    private _minorOffset;
+    private _minorRepeat;
+    private _majorOffset;
+    private _majorRepeat;
+    private _pattern;
+    constructor(options: RepeatIteratorOptions);
+    private _initialize;
+    /**
+     * Returns the next iterator.
+     */
+    next(cell?: CellCoords): IteratorResult<[CellCoords, T]>;
+    return(_value?: TReturn): IteratorResult<[CellCoords, T], TReturn>;
+    throw(_e?: any): IteratorResult<[CellCoords, T], TReturn>;
+    [Symbol.iterator](): IterableIterator<[CellCoords, T]>;
+}
+/**
+ * Takes 2 iterators and returns the first one. In the event there is a 'tie' the first value will be returned.
+ */
+export declare class RacingIterator<T = any, TReturn = any> implements Iterator<[CellCoords, T], TReturn, CellCoords> {
+    private _iterator1;
+    private _nextResult1;
+    private _iterator2;
+    private _nextResult2;
+    private _onEqual;
+    private _comparator;
+    constructor(options: IGrid.IteratorOptions, iterator1: IGrid.EntryIterator<T>, iterator2: IGrid.EntryIterator<T>, onEqual?: (a: [CellCoords, T], b: [CellCoords, T]) => number);
+    /**
+     * Returns the next iterator.
+     */
+    next(cell?: CellCoords): IteratorResult<[CellCoords, T]>;
+    return(_value?: TReturn): IteratorResult<[CellCoords, T], TReturn>;
+    throw(_e?: any): IteratorResult<[CellCoords, T], TReturn>;
+    [Symbol.iterator](): IterableIterator<[CellCoords, T]>;
+}
+/**
+ * Takes 2 iterators and returns the them both in order. In the event there is a 'tie' they will be be returned.
+ */
+export declare class RacingIterator2<T = any, TReturn = any> implements Iterator<[CellCoords, T, CellCoords, T], TReturn, CellCoords> {
+    private _iterator1;
+    private _nextResult1;
+    private _iterator2;
+    private _nextResult2;
+    private _comparator;
+    private _reuseResult;
+    constructor(options: RacingIterator2Options, iterator1: IGrid.EntryIterator<T>, iterator2: IGrid.EntryIterator<T>);
+    /**
+     * Returns the next iterator.
+     */
+    next(cell?: CellCoords): IteratorResult<[CellCoords, T, CellCoords, T]>;
+    return(_value?: TReturn): IteratorResult<[CellCoords, T, CellCoords, T], TReturn>;
+    throw(_e?: any): IteratorResult<[CellCoords, T, CellCoords, T], TReturn>;
+    [Symbol.iterator](): IterableIterator<[CellCoords, T, CellCoords, T]>;
+}
+export interface RacingIterator2Options extends IGrid.IteratorOptions {
+    /**
+     * A custom comparator.
+     */
+    comparator?: (a: CellCoords, b: CellCoords) => number;
+}
+export declare const MESSAGE_ERROR_REQUIRE_INT = "Tuple indices must be integers.";
+/**
+ * Creates a tuple 2D tuple from a single value.
+ *
+ * @internal
+ */
+export declare function valueToTuples<T>(value: T | ((row: number, column: number) => T | null), ranges: Tuple.OrientatedCoords, isColumn: boolean): Tuple.BoundedTuples<T>;
+/**
+ * Entry for a Range iterator or visiting.
+ */
+export interface Entry<T extends any> {
+    value: T;
+    coords: CellCoords;
+}
+/**
+ * Deep copies value from into a tuple.
+ *
+ * @remarks
+ * This should generally be avoid in preference for zero-copy approaches but exist as a fallback.
+ */
+export declare function iteratorToTuples<T>(iterator: IterableIterator<Entry<T>>, axis: RangeAxis, builder: Tuple.IBuilder<T>, topLeft?: CellCoords | null): Tuple.BoundedTuples<T>;
+/**
+ * Creates an array of Tuple.GridTuple from a 2D array using {@link ITuple.IBuilder}.
+ * This adds supports for max bounds and offsetting the indices.
+ *
+ * @remarks
+ * For performance reasons this will not visit ths minor axis but will remove empty major axises.
+ */
+export declare function array2DToTuples<T>(array2d: T[][], transpose?: boolean, ranges?: Partial<Tuple.OrientatedCoords> | null, removeEmpty?: boolean): Tuple.BoundedTuples<T>;
+/**
+ * This is for the edge case where were have a GridTuple but need a bounds.
+ * This will iterator through all majors comparing the first and last minor
+ * to determine the bounds.
+ *
+ * @remarks
+ * We do not use this.
+ */
+export declare function calcTupleBounds(gridTuples: Tuple.GridTuple): Tuple.OrientatedCoords | null;
+/**
+ * Returns a new `BoundedTuples` with all major and minor indices shifted by the given offsets.
+ *
+ * @param boundedTuples The source tuples to translate.
+ * @param translateMajor Delta added to every major index (and to `bounds.majorStart/End`).
+ * @param translateMinor Delta added to every minor index (and to `bounds.minorStart/End`).
+ *
+ * @example
+ * // Normalize to origin then re-anchor at (row, col):
+ * tuples = translateTupleBounds(tuples, -bounds.majorStart, -bounds.minorStart);
+ * tuples = translateTupleBounds(tuples, row, col);
+ *
+ * @remarks
+ * Run arrays inside each `MinorTuple` are shared by reference; they are immutable `IList`s so this is safe.
+ */
+export declare function translateTupleBounds<T = any>(boundedTuples: Tuple.BoundedTuples<T>, translateMajor: number, translateMinor: number): Tuple.BoundedTuples<T>;
+/**
+ * Returns api for incrementally building ranges against minor and optionally major.
+ *
+ * @remarks
+ * * Assumes ordered writes.
+ * * Allows for reusable ranges.
+ */
+export declare function createConflatingRangeValue<T = any>(isColumn?: boolean, canMerge?: (a: T, b: T, isColumn: boolean) => T | undefined): ISpatialMap.IConflatingEntries<T>;
+//# sourceMappingURL=_GridUtils.d.ts.map