@zengrid/shared 1.0.0 → 1.0.2

package/dist/src/data-structures/index-map/index-map.d.ts

@@ -0,0 +1,150 @@
+/**
+ * IndexMap implementation
+ * Provides O(1) bidirectional lookup with maintained insertion order
+ */
+import type { IIndexMap, IndexMapEntry, IndexMapOptions } from './index-map.interface';
+/**
+ * IndexMap - A hybrid data structure combining Map and Array benefits
+ *
+ * Features:
+ * - O(1) key → value lookup
+ * - O(1) index → entry lookup
+ * - O(1) key → index lookup
+ * - Optional O(1) value → key reverse lookup
+ * - Maintains insertion order
+ *
+ * Implementation:
+ * - Uses Map for key → {value, index} mapping
+ * - Uses Array for index → {key, value} mapping
+ * - Optional Map for value → key[] reverse mapping
+ *
+ * @example
+ * ```typescript
+ * const map = new IndexMap<string, number>();
+ * map.set('a', 1); // index 0
+ * map.set('b', 2); // index 1
+ * map.set('c', 3); // index 2
+ *
+ * map.get('b');           // 2
+ * map.getByIndex(1);      // { key: 'b', value: 2, index: 1 }
+ * map.indexOf('c');       // 2
+ * map.getValueByIndex(0); // 1
+ * ```
+ */
+export declare class IndexMap<K, V> implements IIndexMap<K, V> {
+    private keyToData;
+    private indexToEntry;
+    private valueToKeys?;
+    private readonly reverseMapping;
+    constructor(options?: IndexMapOptions);
+    /**
+     * Set a key-value pair
+     */
+    set(key: K, value: V): number;
+    /**
+     * Get value by key
+     */
+    get(key: K): V | undefined;
+    /**
+     * Get entry by index
+     */
+    getByIndex(index: number): IndexMapEntry<K, V> | undefined;
+    /**
+     * Get key by index
+     */
+    getKeyByIndex(index: number): K | undefined;
+    /**
+     * Get value by index
+     */
+    getValueByIndex(index: number): V | undefined;
+    /**
+     * Get the index of a key
+     */
+    indexOf(key: K): number;
+    /**
+     * Reverse lookup: get key(s) by value
+     */
+    getKeysByValue(value: V): K[];
+    /**
+     * Check if a key exists
+     */
+    has(key: K): boolean;
+    /**
+     * Check if a value exists
+     */
+    hasValue(value: V): boolean;
+    /**
+     * Delete an entry by key
+     * Reindexes all subsequent entries
+     */
+    delete(key: K): boolean;
+    /**
+     * Delete an entry by index
+     */
+    deleteByIndex(index: number): boolean;
+    /**
+     * Clear all entries
+     */
+    clear(): void;
+    /**
+     * Get all keys in insertion order
+     */
+    keys(): K[];
+    /**
+     * Get all values in insertion order
+     */
+    values(): V[];
+    /**
+     * Get all entries in insertion order
+     */
+    entries(): [K, V][];
+    /**
+     * Iterate over entries
+     */
+    forEach(callback: (value: V, key: K, index: number) => void): void;
+    /**
+     * Find the first key that satisfies a predicate
+     */
+    find(predicate: (value: V, key: K, index: number) => boolean): K | undefined;
+    /**
+     * Filter entries by a predicate
+     */
+    filter(predicate: (value: V, key: K, index: number) => boolean): IIndexMap<K, V>;
+    /**
+     * Map values to a new IndexMap
+     */
+    map<U>(mapper: (value: V, key: K, index: number) => U): IIndexMap<K, U>;
+    /**
+     * Number of entries
+     */
+    get size(): number;
+    /**
+     * Whether reverse mapping is enabled
+     */
+    get hasReverseMapping(): boolean;
+    /**
+     * Create IndexMap from an array of entries
+     */
+    static from<K, V>(entries: Iterable<[K, V]>, options?: IndexMapOptions): IndexMap<K, V>;
+    /**
+     * Create IndexMap from a regular Map
+     */
+    static fromMap<K, V>(source: Map<K, V>, options?: IndexMapOptions): IndexMap<K, V>;
+    /**
+     * Create IndexMap from an object
+     */
+    static fromObject<V>(obj: Record<string, V>, options?: IndexMapOptions): IndexMap<string, V>;
+    /**
+     * Convert to a plain object (only works with string keys)
+     */
+    toObject(): Record<string, V>;
+    /**
+     * Convert to a regular Map
+     */
+    toMap(): Map<K, V>;
+    /**
+     * Get a string representation for debugging
+     */
+    toString(): string;
+}
+//# sourceMappingURL=index-map.d.ts.map

package/dist/src/data-structures/index-map/index-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-map.d.ts","sourceRoot":"","sources":["../../../../../../packages/shared/src/data-structures/index-map/index-map.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAEvF;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD,OAAO,CAAC,SAAS,CAAsC;IACvD,OAAO,CAAC,YAAY,CAA8B;IAClD,OAAO,CAAC,WAAW,CAAC,CAAiB;IACrC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAU;gBAE7B,OAAO,GAAE,eAAoB;IAiBzC;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM;IAuD7B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAK1B;;OAEG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS;IAa1D;;OAEG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAO3C;;OAEG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAO7C;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM;IAKvB;;OAEG;IACH,cAAc,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;IAgB7B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAS3B;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAqCvB;;OAEG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IASrC;;OAEG;IACH,KAAK,IAAI,IAAI;IAQb;;OAEG;IACH,IAAI,IAAI,CAAC,EAAE;IAIX;;OAEG;IACH,MAAM,IAAI,CAAC,EAAE;IAIb;;OAEG;IACH,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;IAInB;;OAEG;IACH,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAMlE;;OAEG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS;IAU5E;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAchF;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAavE;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,IAAI,iBAAiB,IAAI,OAAO,CAE/B;IAED;;OAEG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EACd,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACzB,OAAO,CAAC,EAAE,eAAe,GACxB,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;IAQjB;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EACjB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACjB,OAAO,CAAC,EAAE,eAAe,GACxB,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;IAIjB;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EACjB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EACtB,OAAO,CAAC,EAAE,eAAe,GACxB,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAQtB;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAQ7B;;OAEG;IACH,KAAK,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAIlB;;OAEG;IACH,QAAQ,IAAI,MAAM;CAKnB"}

package/dist/src/data-structures/index-map/index-map.interface.d.ts

@@ -0,0 +1,186 @@
+/**
+ * IndexMap interfaces for ZenGrid
+ * Provides O(1) bidirectional lookup: key → value, index → entry, and optionally value → key
+ */
+/**
+ * Entry in the IndexMap containing both key and value
+ */
+export interface IndexMapEntry<K, V> {
+    key: K;
+    value: V;
+    index: number;
+}
+/**
+ * IndexMap interface
+ *
+ * A data structure that combines the benefits of Map and Array:
+ * - O(1) key → value lookup (like Map)
+ * - O(1) index → entry lookup (like Array)
+ * - O(1) key → index lookup
+ * - Maintains insertion order
+ * - Optional O(1) value → key reverse lookup
+ *
+ * Use cases:
+ * - Column/row mappings where you need both name and index access
+ * - Ordered collections with fast lookup by both key and position
+ * - Maintaining insertion order while allowing random access
+ */
+export interface IIndexMap<K, V> {
+    /**
+     * Set a key-value pair
+     * If key exists, updates the value without changing index
+     * If key is new, appends to the end
+     * @param key - The key
+     * @param value - The value
+     * @returns The index of the entry
+     * @complexity O(1)
+     */
+    set(key: K, value: V): number;
+    /**
+     * Get value by key
+     * @param key - The key to look up
+     * @returns The value or undefined if not found
+     * @complexity O(1)
+     */
+    get(key: K): V | undefined;
+    /**
+     * Get entry by index
+     * @param index - The index (0-based)
+     * @returns The entry or undefined if out of bounds
+     * @complexity O(1)
+     */
+    getByIndex(index: number): IndexMapEntry<K, V> | undefined;
+    /**
+     * Get key by index
+     * @param index - The index (0-based)
+     * @returns The key or undefined if out of bounds
+     * @complexity O(1)
+     */
+    getKeyByIndex(index: number): K | undefined;
+    /**
+     * Get value by index
+     * @param index - The index (0-based)
+     * @returns The value or undefined if out of bounds
+     * @complexity O(1)
+     */
+    getValueByIndex(index: number): V | undefined;
+    /**
+     * Get the index of a key
+     * @param key - The key to look up
+     * @returns The index or -1 if not found
+     * @complexity O(1)
+     */
+    indexOf(key: K): number;
+    /**
+     * Get the key(s) for a given value (reverse lookup)
+     * Only available when enableReverseMapping is true
+     * @param value - The value to find
+     * @returns Array of keys that map to this value (empty if not found or reverse mapping disabled)
+     * @complexity O(1) if reverse mapping enabled, O(n) if disabled
+     */
+    getKeysByValue(value: V): K[];
+    /**
+     * Check if a key exists
+     * @param key - The key to check
+     * @complexity O(1)
+     */
+    has(key: K): boolean;
+    /**
+     * Check if a value exists
+     * @param value - The value to check
+     * @complexity O(1) if reverse mapping enabled, O(n) if disabled
+     */
+    hasValue(value: V): boolean;
+    /**
+     * Delete an entry by key
+     * Reindexes all subsequent entries
+     * @param key - The key to delete
+     * @returns true if the entry existed and was deleted
+     * @complexity O(n) due to reindexing
+     */
+    delete(key: K): boolean;
+    /**
+     * Delete an entry by index
+     * Reindexes all subsequent entries
+     * @param index - The index to delete
+     * @returns true if the index was valid and entry was deleted
+     * @complexity O(n) due to reindexing
+     */
+    deleteByIndex(index: number): boolean;
+    /**
+     * Clear all entries
+     * @complexity O(1)
+     */
+    clear(): void;
+    /**
+     * Get all keys in insertion order
+     * @returns Array of keys
+     * @complexity O(n)
+     */
+    keys(): K[];
+    /**
+     * Get all values in insertion order
+     * @returns Array of values
+     * @complexity O(n)
+     */
+    values(): V[];
+    /**
+     * Get all entries in insertion order
+     * @returns Array of [key, value] tuples
+     * @complexity O(n)
+     */
+    entries(): [K, V][];
+    /**
+     * Iterate over entries
+     * @param callback - Function to call for each entry
+     * @complexity O(n)
+     */
+    forEach(callback: (value: V, key: K, index: number) => void): void;
+    /**
+     * Find the first key that satisfies a predicate
+     * @param predicate - Test function
+     * @returns The key or undefined
+     * @complexity O(n)
+     */
+    find(predicate: (value: V, key: K, index: number) => boolean): K | undefined;
+    /**
+     * Filter entries by a predicate
+     * @param predicate - Test function
+     * @returns New IndexMap with entries that pass the test
+     * @complexity O(n)
+     */
+    filter(predicate: (value: V, key: K, index: number) => boolean): IIndexMap<K, V>;
+    /**
+     * Map values to a new IndexMap
+     * @param mapper - Transform function
+     * @returns New IndexMap with transformed values
+     * @complexity O(n)
+     */
+    map<U>(mapper: (value: V, key: K, index: number) => U): IIndexMap<K, U>;
+    /**
+     * Number of entries
+     */
+    readonly size: number;
+    /**
+     * Whether reverse value → key mapping is enabled
+     */
+    readonly hasReverseMapping: boolean;
+}
+/**
+ * Options for creating an IndexMap
+ */
+export interface IndexMapOptions {
+    /**
+     * Enable bidirectional value → key lookup
+     * Maintains a reverse map for O(1) value → key queries
+     * Increases memory usage but enables fast reverse lookups
+     * @default false
+     */
+    enableReverseMapping?: boolean;
+    /**
+     * Initial capacity hint for optimization
+     * @default 16
+     */
+    initialCapacity?: number;
+}
+//# sourceMappingURL=index-map.interface.d.ts.map

package/dist/src/data-structures/index-map/index-map.interface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-map.interface.d.ts","sourceRoot":"","sources":["../../../../../../packages/shared/src/data-structures/index-map/index-map.interface.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC;IACjC,GAAG,EAAE,CAAC,CAAC;IACP,KAAK,EAAE,CAAC,CAAC;IACT,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,EAAE,CAAC;IAC7B;;;;;;;;OAQG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;IAE9B;;;;;OAKG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAE3B;;;;;OAKG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE3D;;;;;OAKG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;IAE5C;;;;;OAKG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;IAE9C;;;;;OAKG;IACH,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;IAExB;;;;;;OAMG;IACH,cAAc,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAE9B;;;;OAIG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAErB;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAE5B;;;;;;OAMG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAExB;;;;;;OAMG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IAEtC;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;;;OAIG;IACH,IAAI,IAAI,CAAC,EAAE,CAAC;IAEZ;;;;OAIG;IACH,MAAM,IAAI,CAAC,EAAE,CAAC;IAEd;;;;OAIG;IACH,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IAEpB;;;;OAIG;IACH,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;IAEnE;;;;;OAKG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC;IAE7E;;;;;OAKG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjF;;;;;OAKG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExE;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,QAAQ,CAAC,iBAAiB,EAAE,OAAO,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;;OAKG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAE/B;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B"}

package/dist/src/data-structures/index-map/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * IndexMap - Bidirectional lookup data structure
+ */
+export { IndexMap } from './index-map';
+export type { IIndexMap, IndexMapEntry, IndexMapOptions, } from './index-map.interface';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/data-structures/index-map/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../packages/shared/src/data-structures/index-map/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,EACV,SAAS,EACT,aAAa,EACb,eAAe,GAChB,MAAM,uBAAuB,CAAC"}

package/dist/src/data-structures/index.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Data Structures for ZenGrid
+ */
+export { SparseMatrix } from './sparse-matrix';
+export type { ReadonlySparseMatrix, ISparseMatrix, SparseMatrixOptions, } from './sparse-matrix';
+export { PrefixSumArray } from './prefix-sum-array';
+export type { IPrefixSumArray, PrefixSumArrayOptions, } from './prefix-sum-array';
+export { ColumnStore } from './column-store';
+export type { IColumnStore, ColumnStoreOptions, ColumnDefinition, ColumnType, AggregateOperation, AggregationResult, } from './column-store';
+export { IndexMap } from './index-map';
+export type { IIndexMap, IndexMapEntry, IndexMapOptions, } from './index-map';
+export { IntervalTree } from './interval-tree';
+export type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions, } from './interval-tree';
+export { IntervalUtils } from './interval-tree';
+export { Trie } from './trie';
+export type { ITrie, ITrieNode, TrieOptions, TrieSearchResult, } from './trie';
+export { RTree } from './rtree';
+export type { IRTree, Rectangle, RTreeData, RTreeOptions, RTreeSearchResult, RTreeStats, } from './rtree';
+export { DependencyGraph } from './dependency-graph';
+export type { IDependencyGraph, NodeId, Dependency, DependencyGraphOptions, TopologicalSortResult, GraphStats, } from './dependency-graph';
+export { SuffixArray } from './suffix-array';
+export type { ISuffixArray, SuffixArrayOptions, SuffixSearchResult, SuffixArrayStats, } from './suffix-array';
+export { LRUCache } from './lru-cache';
+export type { ILRUCache, LRUCacheOptions, CacheEntry, CacheStats, } from './lru-cache';
+export { CommandStack } from './command-stack';
+export type { ICommandStack, ICommand, ICommandStackOptions, } from './command-stack';
+export { SegmentTree } from './segment-tree';
+export type { ISegmentTree, SegmentTreeOptions, AggregateFunction, AggregationType, } from './segment-tree';
+export { Aggregations, SegmentTreeUtils } from './segment-tree';
+export { SkipList } from './skip-list';
+export type { ISkipList, SkipListNode, SkipListOptions, RangeResult, SkipListStats, } from './skip-list';
+export { defaultComparator, SkipListUtils } from './skip-list';
+export { DisjointSet } from './disjoint-set';
+export type { IDisjointSet, DisjointSetOptions, DisjointSetStats, } from './disjoint-set';
+export { DisjointSetUtils } from './disjoint-set';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/data-structures/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../packages/shared/src/data-structures/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EACV,oBAAoB,EACpB,aAAa,EACb,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,YAAY,EACV,eAAe,EACf,qBAAqB,GACtB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,gBAAgB,EAChB,UAAU,EACV,kBAAkB,EAClB,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,EACV,SAAS,EACT,aAAa,EACb,eAAe,GAChB,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EACV,aAAa,EACb,QAAQ,EACR,YAAY,EACZ,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,YAAY,EACV,KAAK,EACL,SAAS,EACT,WAAW,EACX,gBAAgB,GACjB,MAAM,QAAQ,CAAC;AAGhB,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,YAAY,EACV,MAAM,EACN,SAAS,EACT,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,UAAU,GACX,MAAM,SAAS,CAAC;AAGjB,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,YAAY,EACV,gBAAgB,EAChB,MAAM,EACN,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,UAAU,GACX,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,EACV,SAAS,EACT,eAAe,EACf,UAAU,EACV,UAAU,GACX,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EACV,aAAa,EACb,QAAQ,EACR,oBAAoB,GACrB,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,iBAAiB,EACjB,eAAe,GAChB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAGhE,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,EACV,SAAS,EACT,YAAY,EACZ,eAAe,EACf,WAAW,EACX,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG/D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/src/data-structures/interval-tree/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Interval Tree - Augmented BST for interval queries
+ */
+export { IntervalTree } from './interval-tree';
+export type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions, } from './interval-tree.interface';
+export { IntervalUtils } from './interval-tree.interface';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/data-structures/interval-tree/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../packages/shared/src/data-structures/interval-tree/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EACV,aAAa,EACb,QAAQ,EACR,YAAY,EACZ,mBAAmB,GACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC"}

package/dist/src/data-structures/interval-tree/interval-tree.d.ts

@@ -0,0 +1,141 @@
+/**
+ * Interval Tree implementation
+ * Augmented BST for efficient interval queries
+ */
+import type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions } from './interval-tree.interface';
+/**
+ * Interval Tree - Augmented BST for interval queries
+ *
+ * Implementation:
+ * - Each node stores an interval and the max endpoint in its subtree
+ * - Balanced using AVL tree rotations for guaranteed O(log n) operations
+ * - Intervals are ordered by start time
+ *
+ * @example
+ * ```typescript
+ * const tree = new IntervalTree<string>();
+ * tree.insert({ start: 10, end: 20 }, 'A');
+ * tree.insert({ start: 15, end: 25 }, 'B');
+ * tree.insert({ start: 30, end: 40 }, 'C');
+ *
+ * tree.search({ start: 18, end: 22 }); // Returns A and B
+ * tree.searchPoint(35); // Returns C
+ * ```
+ */
+export declare class IntervalTree<T> implements IIntervalTree<T> {
+    private root;
+    private count;
+    private nextId;
+    private readonly balanced;
+    private readonly allowDuplicates;
+    private readonly comparator;
+    constructor(options?: IntervalTreeOptions);
+    /**
+     * Insert an interval
+     */
+    insert(interval: Interval, data: T): IntervalData<T>;
+    private insertNode;
+    /**
+     * Delete an interval
+     */
+    delete(intervalData: IntervalData<T>): boolean;
+    private deleteNode;
+    /**
+     * Delete by ID
+     */
+    deleteById(id: string | number): boolean;
+    private findById;
+    /**
+     * Find all overlapping intervals
+     */
+    search(interval: Interval): IntervalData<T>[];
+    private searchOverlap;
+    /**
+     * Find all intervals containing a point
+     */
+    searchPoint(point: number): IntervalData<T>[];
+    /**
+     * Find all intervals contained within the given interval
+     */
+    searchContained(interval: Interval): IntervalData<T>[];
+    private searchContainedHelper;
+    /**
+     * Find all intervals containing the given interval
+     */
+    searchContaining(interval: Interval): IntervalData<T>[];
+    private searchContainingHelper;
+    /**
+     * Find minimum interval (by start time)
+     */
+    findMin(): IntervalData<T> | undefined;
+    private findMinNode;
+    /**
+     * Find maximum interval (by max endpoint in tree)
+     */
+    findMax(): IntervalData<T> | undefined;
+    private findMaxHelper;
+    /**
+     * Check if any interval overlaps
+     */
+    hasOverlap(interval: Interval): boolean;
+    private hasOverlapHelper;
+    /**
+     * Get all intervals in sorted order
+     */
+    inorder(): IntervalData<T>[];
+    private inorderHelper;
+    /**
+     * Iterate over all intervals
+     */
+    forEach(callback: (interval: IntervalData<T>) => void): void;
+    private forEachHelper;
+    /**
+     * Filter intervals
+     */
+    filter(predicate: (interval: IntervalData<T>) => boolean): IIntervalTree<T>;
+    /**
+     * Map intervals
+     */
+    map<U>(mapper: (data: T, interval: Interval) => U): IIntervalTree<U>;
+    /**
+     * Clear the tree
+     */
+    clear(): void;
+    /**
+     * Get tree size
+     */
+    get size(): number;
+    /**
+     * Check if empty
+     */
+    get isEmpty(): boolean;
+    /**
+     * Get tree height
+     */
+    get height(): number;
+    private getHeight;
+    /**
+     * AVL balancing methods
+     */
+    private balance;
+    private getBalanceFactor;
+    private rotateLeft;
+    private rotateRight;
+    /**
+     * Create IntervalTree from array of intervals
+     */
+    static from<T>(intervals: Array<{
+        interval: Interval;
+        data: T;
+    }>, options?: IntervalTreeOptions): IntervalTree<T>;
+    /**
+     * Debug: Get tree structure as string
+     */
+    toString(): string;
+    /**
+     * Debug: Validate tree structure
+     */
+    validate(): boolean;
+    private validateNode;
+}
+//# sourceMappingURL=interval-tree.d.ts.map

package/dist/src/data-structures/interval-tree/interval-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interval-tree.d.ts","sourceRoot":"","sources":["../../../../../../packages/shared/src/data-structures/interval-tree/interval-tree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,aAAa,EACb,QAAQ,EACR,YAAY,EACZ,mBAAmB,EACpB,MAAM,2BAA2B,CAAC;AAmBnC;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,YAAY,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IACtD,OAAO,CAAC,IAAI,CAAgC;IAC5C,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAU;IACnC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAU;IAC1C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuC;gBAEtD,OAAO,GAAE,mBAAwB;IAM7C;;OAEG;IACH,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAYpD,OAAO,CAAC,UAAU;IAuClB;;OAEG;IACH,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAM9C,OAAO,CAAC,UAAU;IA6DlB;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO;IASxC,OAAO,CAAC,QAAQ;IAahB;;OAEG;IACH,MAAM,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAM7C,OAAO,CAAC,aAAa;IAyBrB;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAI7C;;OAEG;IACH,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAMtD,OAAO,CAAC,qBAAqB;IAuB7B;;OAEG;IACH,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAMvD,OAAO,CAAC,sBAAsB;IAuB9B;;OAEG;IACH,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS;IAKtC,OAAO,CAAC,WAAW;IAQnB;;OAEG;IACH,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS;IAKtC,OAAO,CAAC,aAAa;IAqBrB;;OAEG;IACH,UAAU,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAIvC,OAAO,CAAC,gBAAgB;IA0BxB;;OAEG;IACH,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE;IAM5B,OAAO,CAAC,aAAa;IAUrB;;OAEG;IACH,OAAO,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI;IAI5D,OAAO,CAAC,aAAa;IAUrB;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC;IAgB3E;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,QAAQ,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;IAepE;;OAEG;IACH,KAAK,IAAI,IAAI;IAMb;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,OAAO,CAAC,SAAS;IAIjB;;OAEG;IACH,OAAO,CAAC,OAAO;IA0Bf,OAAO,CAAC,gBAAgB;IAIxB,OAAO,CAAC,UAAU;IA2BlB,OAAO,CAAC,WAAW;IA2BnB;;OAEG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,EACX,SAAS,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,QAAQ,CAAC;QAAC,IAAI,EAAE,CAAC,CAAA;KAAE,CAAC,EACjD,OAAO,CAAC,EAAE,mBAAmB,GAC5B,YAAY,CAAC,CAAC,CAAC;IAQlB;;OAEG;IACH,QAAQ,IAAI,MAAM;IAIlB;;OAEG;IACH,QAAQ,IAAI,OAAO;IAInB,OAAO,CAAC,YAAY;CAwBrB"}