@zengrid/core 1.0.2 → 1.0.4

package/dist/src/shared/data-structures/lru-cache/lru-cache.interface.d.ts

@@ -0,0 +1,173 @@
+/**
+ * LRU Cache Interface
+ *
+ * Used for:
+ * - Caching rendered cells to avoid re-rendering
+ * - Caching formula evaluation results
+ * - Caching formatted values (numbers, dates)
+ * - Caching API responses
+ * - Memory-bounded caches with automatic eviction
+ */
+/**
+ * Cache entry metadata
+ */
+export interface CacheEntry<V> {
+    /**
+     * The cached value
+     */
+    value: V;
+    /**
+     * Timestamp when entry was created
+     */
+    createdAt: number;
+    /**
+     * Timestamp when entry was last accessed
+     */
+    lastAccessedAt: number;
+    /**
+     * Number of times this entry has been accessed
+     */
+    accessCount: number;
+}
+/**
+ * Cache statistics
+ */
+export interface CacheStats {
+    /**
+     * Current number of entries
+     */
+    size: number;
+    /**
+     * Maximum capacity
+     */
+    capacity: number;
+    /**
+     * Total number of get operations
+     */
+    hits: number;
+    /**
+     * Total number of failed get operations
+     */
+    misses: number;
+    /**
+     * Hit rate (hits / (hits + misses))
+     */
+    hitRate: number;
+    /**
+     * Total number of evictions
+     */
+    evictions: number;
+    /**
+     * Total number of set operations
+     */
+    sets: number;
+    /**
+     * Memory usage in bytes (approximate)
+     */
+    memoryBytes: number;
+}
+/**
+ * LRU Cache options
+ */
+export interface LRUCacheOptions {
+    /**
+     * Maximum number of entries
+     * @default 1000
+     */
+    capacity?: number;
+    /**
+     * Time-to-live in milliseconds (0 = infinite)
+     * @default 0
+     */
+    ttl?: number;
+    /**
+     * Callback when an entry is evicted
+     */
+    onEvict?: <K, V>(key: K, value: V) => void;
+    /**
+     * Track access statistics
+     * @default false
+     */
+    trackStats?: boolean;
+}
+/**
+ * LRU Cache interface
+ */
+export interface ILRUCache<K, V> {
+    /**
+     * Get a value from the cache
+     *
+     * @param key - The key to look up
+     * @returns The cached value or undefined if not found or expired
+     */
+    get(key: K): V | undefined;
+    /**
+     * Set a value in the cache
+     *
+     * @param key - The key to store
+     * @param value - The value to cache
+     */
+    set(key: K, value: V): void;
+    /**
+     * Check if a key exists in the cache
+     *
+     * @param key - The key to check
+     * @returns True if the key exists and is not expired
+     */
+    has(key: K): boolean;
+    /**
+     * Delete a specific entry
+     *
+     * @param key - The key to delete
+     * @returns True if the entry existed and was deleted
+     */
+    delete(key: K): boolean;
+    /**
+     * Clear all entries from the cache
+     */
+    clear(): void;
+    /**
+     * Get the current size of the cache
+     *
+     * @returns Number of entries
+     */
+    size(): number;
+    /**
+     * Get cache statistics
+     *
+     * @returns Statistics object
+     */
+    getStats(): CacheStats;
+    /**
+     * Get all keys in the cache (in LRU order)
+     *
+     * @returns Array of keys, oldest first
+     */
+    keys(): K[];
+    /**
+     * Get all values in the cache (in LRU order)
+     *
+     * @returns Array of values, oldest first
+     */
+    values(): V[];
+    /**
+     * Get all entries with metadata
+     *
+     * @returns Array of entries with metadata
+     */
+    entries(): Array<[K, CacheEntry<V>]>;
+    /**
+     * Peek at a value without updating LRU order
+     *
+     * @param key - The key to peek at
+     * @returns The cached value or undefined
+     */
+    peek(key: K): V | undefined;
+    /**
+     * Resize the cache capacity
+     *
+     * @param newCapacity - New maximum capacity
+     */
+    resize(newCapacity: number): void;
+}
+//# sourceMappingURL=lru-cache.interface.d.ts.map

package/dist/src/shared/data-structures/lru-cache/lru-cache.interface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.interface.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/lru-cache/lru-cache.interface.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B;;OAEG;IACH,KAAK,EAAE,CAAC,CAAC;IAET;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,cAAc,EAAE,MAAM,CAAC;IAEvB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,CAAC;IAE3C;;;OAGG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,EAAE,CAAC;IAC7B;;;;;OAKG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAE3B;;;;;OAKG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAE5B;;;;;OAKG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAErB;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAExB;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;;;OAIG;IACH,IAAI,IAAI,MAAM,CAAC;IAEf;;;;OAIG;IACH,QAAQ,IAAI,UAAU,CAAC;IAEvB;;;;OAIG;IACH,IAAI,IAAI,CAAC,EAAE,CAAC;IAEZ;;;;OAIG;IACH,MAAM,IAAI,CAAC,EAAE,CAAC;IAEd;;;;OAIG;IACH,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErC;;;;;OAKG;IACH,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAE5B;;;;OAIG;IACH,MAAM,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC"}

package/dist/src/shared/data-structures/prefix-sum-array/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Prefix Sum Array - Efficient range queries and offset calculations
+ */
+export { PrefixSumArray } from './prefix-sum-array';
+export type { PrefixSumArray as IPrefixSumArray, PrefixSumArrayOptions, } from './prefix-sum-array.interface';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/shared/data-structures/prefix-sum-array/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/prefix-sum-array/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,YAAY,EACV,cAAc,IAAI,eAAe,EACjC,qBAAqB,GACtB,MAAM,8BAA8B,CAAC"}

package/dist/src/shared/data-structures/prefix-sum-array/prefix-sum-array.d.ts

@@ -0,0 +1,63 @@
+import type { PrefixSumArray as IPrefixSumArray, PrefixSumArrayOptions } from './prefix-sum-array.interface';
+/**
+ * PrefixSumArray implementation
+ *
+ * Stores cumulative sums for efficient range queries and offset lookups.
+ * Essential for virtual scrolling with variable row heights.
+ *
+ * @example
+ * ```typescript
+ * // Row heights: [30, 40, 50, 30, 60]
+ * const heights = new PrefixSumArray({ values: [30, 40, 50, 30, 60] });
+ *
+ * // Get offset to row 2 (sum of rows 0 and 1)
+ * heights.getOffset(2); // 70 (30 + 40)
+ *
+ * // Find which row is at scroll offset 100
+ * heights.findIndexAtOffset(100); // 2 (rows 0,1,2 total 120, row 2 starts at 70)
+ *
+ * // Get range sum (rows 1-3)
+ * heights.getRangeSum(1, 4); // 120 (40 + 50 + 30)
+ * ```
+ */
+export declare class PrefixSumArray implements IPrefixSumArray {
+    private values;
+    private sums;
+    constructor(options?: PrefixSumArrayOptions);
+    /**
+     * Build prefix sum array from values
+     * sums[i] = sum of values[0...i-1]
+     * sums[0] = 0 (no elements before index 0)
+     */
+    private build;
+    getOffset(index: number): number;
+    getSumUpTo(index: number): number;
+    getRangeSum(start: number, end: number): number;
+    findIndexAtOffset(offset: number): number;
+    update(index: number, newValue: number): void;
+    getValue(index: number): number;
+    get length(): number;
+    get total(): number;
+    get prefixSums(): ReadonlyArray<number>;
+    /**
+     * Add a new value to the end
+     * @param value - Value to append
+     */
+    push(value: number): void;
+    /**
+     * Remove and return the last value
+     * @returns Removed value or undefined if empty
+     */
+    pop(): number | undefined;
+    /**
+     * Clear all values
+     */
+    clear(): void;
+    /**
+     * Create from array of values
+     * @param values - Array of non-negative numbers
+     * @returns New PrefixSumArray instance
+     */
+    static from(values: number[]): PrefixSumArray;
+}
+//# sourceMappingURL=prefix-sum-array.d.ts.map

package/dist/src/shared/data-structures/prefix-sum-array/prefix-sum-array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefix-sum-array.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/prefix-sum-array/prefix-sum-array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,cAAc,IAAI,eAAe,EACjC,qBAAqB,EACtB,MAAM,8BAA8B,CAAC;AAGtC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,cAAe,YAAW,eAAe;IACpD,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,IAAI,CAAW;gBAEX,OAAO,GAAE,qBAA0B;IAM/C;;;;OAIG;IACH,OAAO,CAAC,KAAK;IASb,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAShC,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IASjC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAS/C,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IA6BzC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAoB7C,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAS/B,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,IAAI,UAAU,IAAI,aAAa,CAAC,MAAM,CAAC,CAEtC;IAED;;;OAGG;IACH,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IASzB;;;OAGG;IACH,GAAG,IAAI,MAAM,GAAG,SAAS;IASzB;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;;;OAIG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,cAAc;CAG9C"}

package/dist/src/shared/data-structures/prefix-sum-array/prefix-sum-array.interface.d.ts

@@ -0,0 +1,80 @@
+/**
+ * Prefix Sum Array interfaces for ZenGrid
+ * Used for efficient range queries and offset calculations
+ */
+/**
+ * Prefix Sum Array for cumulative calculations
+ *
+ * Useful for:
+ * - Variable row heights in virtual scrolling
+ * - Finding element at specific offset (O(log n) with binary search)
+ * - Range sum queries
+ */
+export interface PrefixSumArray {
+    /**
+     * Get cumulative sum up to (but not including) index
+     * @param index - Index to query
+     * @returns Sum of values[0] through values[index-1]
+     * @complexity O(1)
+     */
+    getOffset(index: number): number;
+    /**
+     * Get cumulative sum up to and including index
+     * @param index - Index to query
+     * @returns Sum of values[0] through values[index]
+     * @complexity O(1)
+     */
+    getSumUpTo(index: number): number;
+    /**
+     * Get sum of range [start, end)
+     * @param start - Start index (inclusive)
+     * @param end - End index (exclusive)
+     * @returns Sum of values[start] through values[end-1]
+     * @complexity O(1)
+     */
+    getRangeSum(start: number, end: number): number;
+    /**
+     * Find index where cumulative sum >= target offset
+     * Uses binary search internally
+     * @param offset - Target cumulative value
+     * @returns Index where cumulative sum >= offset
+     * @complexity O(log n)
+     */
+    findIndexAtOffset(offset: number): number;
+    /**
+     * Update value at index and rebuild prefix sums
+     * @param index - Index to update
+     * @param newValue - New value
+     * @complexity O(n) - requires rebuilding from index onward
+     */
+    update(index: number, newValue: number): void;
+    /**
+     * Get original value at index (not cumulative)
+     * @param index - Index to query
+     * @returns Original value
+     * @complexity O(1)
+     */
+    getValue(index: number): number;
+    /**
+     * Total number of elements
+     */
+    readonly length: number;
+    /**
+     * Total sum of all values
+     */
+    readonly total: number;
+    /**
+     * Get underlying prefix sum array (for debugging)
+     */
+    readonly prefixSums: ReadonlyArray<number>;
+}
+/**
+ * Options for creating a PrefixSumArray
+ */
+export interface PrefixSumArrayOptions {
+    /**
+     * Initial values to build prefix sums from
+     */
+    values?: number[];
+}
+//# sourceMappingURL=prefix-sum-array.interface.d.ts.map

package/dist/src/shared/data-structures/prefix-sum-array/prefix-sum-array.interface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefix-sum-array.interface.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/prefix-sum-array/prefix-sum-array.interface.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;IAEjC;;;;;OAKG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;IAElC;;;;;;OAMG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;IAEhD;;;;;;OAMG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IAE1C;;;;;OAKG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IAE9C;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;IAEhC;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB"}

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

@@ -0,0 +1,8 @@
+/**
+ * R-Tree (Spatial Index) data structure
+ *
+ * Used for efficient spatial queries, hit testing, and range searching.
+ */
+export { RTree } from './rtree';
+export type { IRTree, Rectangle, RTreeData, RTreeOptions, RTreeSearchResult, RTreeStats, } from './rtree.interface';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/rtree/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,YAAY,EACV,MAAM,EACN,SAAS,EACT,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,UAAU,GACX,MAAM,mBAAmB,CAAC"}

package/dist/src/shared/data-structures/rtree/rtree.d.ts

@@ -0,0 +1,81 @@
+import type { IRTree, Rectangle, RTreeOptions, RTreeSearchResult, RTreeStats } from './rtree.interface';
+/**
+ * R-Tree - Spatial Index Data Structure
+ *
+ * An R-Tree is a tree data structure for indexing spatial data.
+ * It groups nearby objects and represents them with their minimum bounding rectangle (MBR).
+ *
+ * **Time Complexity:**
+ * - Insert: O(log n) average, O(n) worst case
+ * - Search: O(log n + k) where k = number of results
+ * - Delete: O(log n) average
+ *
+ * **Space Complexity:** O(n)
+ *
+ * **Use Cases in Grid:**
+ * - Hit testing: Find cell at mouse coordinates - O(log n)
+ * - Range queries: Find all cells in viewport - O(log n + k)
+ * - Merged cells: Detect overlapping cell ranges
+ * - Selection optimization: Quickly find cells in selection rect
+ */
+export declare class RTree<T = any> implements IRTree<T> {
+    private root;
+    private options;
+    private itemCount;
+    constructor(options?: RTreeOptions);
+    /**
+     * Insert an item into the R-Tree
+     */
+    insert(rect: Rectangle, data: T): void;
+    /**
+     * Search for items intersecting a rectangle
+     */
+    search(rect: Rectangle): RTreeSearchResult<T>[];
+    /**
+     * Search for items at a specific point
+     */
+    searchAtPoint(x: number, y: number): RTreeSearchResult<T>[];
+    /**
+     * Find nearest neighbors to a point
+     */
+    nearest(x: number, y: number, maxResults?: number, maxDistance?: number): RTreeSearchResult<T>[];
+    /**
+     * Remove an item from the tree
+     */
+    remove(rect: Rectangle, data?: T): boolean;
+    /**
+     * Clear all items from the tree
+     */
+    clear(): void;
+    /**
+     * Get all items in the tree
+     */
+    all(): RTreeSearchResult<T>[];
+    /**
+     * Check if the tree is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Get statistics about the tree
+     */
+    getStats(): RTreeStats;
+    /**
+     * Rebuild the tree for better performance
+     */
+    rebuild(): void;
+    private createNode;
+    private isNode;
+    private calcBBox;
+    private extendBBox;
+    private intersects;
+    private rectangleDistanceTo;
+    private searchNode;
+    private insertItem;
+    private enlargementNeeded;
+    private area;
+    private split;
+    private findItem;
+    private rectanglesEqual;
+    private getAllItems;
+}
+//# sourceMappingURL=rtree.d.ts.map

package/dist/src/shared/data-structures/rtree/rtree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rtree.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/rtree/rtree.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,MAAM,EACN,SAAS,EAET,YAAY,EACZ,iBAAiB,EACjB,UAAU,EACX,MAAM,mBAAmB,CAAC;AAmB3B;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,KAAK,CAAC,CAAC,GAAG,GAAG,CAAE,YAAW,MAAM,CAAC,CAAC,CAAC;IAC9C,OAAO,CAAC,IAAI,CAAe;IAC3B,OAAO,CAAC,OAAO,CAAyB;IACxC,OAAO,CAAC,SAAS,CAAa;gBAElB,OAAO,GAAE,YAAiB;IAStC;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI;IAMtC;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE;IAQ/C;;OAEG;IACH,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE;IAS3D;;OAEG;IACH,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,GAAE,MAAU,EAAE,WAAW,GAAE,MAAiB,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE;IAuD7G;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,OAAO;IAmC1C;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE;IAQ7B;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,QAAQ,IAAI,UAAU;IAuBtB;;OAEG;IACH,OAAO,IAAI,IAAI;IAWf,OAAO,CAAC,UAAU;IAelB,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,QAAQ;IAuBhB,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,mBAAmB;IAM3B,OAAO,CAAC,UAAU;IAsBlB,OAAO,CAAC,UAAU;IA6DlB,OAAO,CAAC,iBAAiB;IAazB,OAAO,CAAC,IAAI;IAIZ,OAAO,CAAC,KAAK;IA8Bb,OAAO,CAAC,QAAQ;IAgChB,OAAO,CAAC,eAAe;IAIvB,OAAO,CAAC,WAAW;CAcpB"}

package/dist/src/shared/data-structures/rtree/rtree.interface.d.ts

@@ -0,0 +1,143 @@
+/**
+ * R-Tree (Spatial Index) Interface
+ *
+ * Used for:
+ * - Efficient spatial queries (hit testing, range queries)
+ * - Finding cells at point (x, y)
+ * - Finding cells in rectangular region
+ * - Merged cell detection
+ * - Selection range optimization
+ */
+/**
+ * 2D Rectangle (Axis-Aligned Bounding Box)
+ */
+export interface Rectangle {
+    /**
+     * Minimum X coordinate (left edge)
+     */
+    minX: number;
+    /**
+     * Minimum Y coordinate (top edge)
+     */
+    minY: number;
+    /**
+     * Maximum X coordinate (right edge)
+     */
+    maxX: number;
+    /**
+     * Maximum Y coordinate (bottom edge)
+     */
+    maxY: number;
+}
+/**
+ * R-Tree node data
+ */
+export interface RTreeData<T = any> {
+    /**
+     * The bounding rectangle
+     */
+    rect: Rectangle;
+    /**
+     * Associated data
+     */
+    data: T;
+}
+/**
+ * R-Tree search result
+ */
+export interface RTreeSearchResult<T = any> {
+    /**
+     * The bounding rectangle
+     */
+    rect: Rectangle;
+    /**
+     * Associated data
+     */
+    data: T;
+    /**
+     * Distance from query point (if applicable)
+     */
+    distance?: number;
+}
+/**
+ * R-Tree configuration options
+ */
+export interface RTreeOptions {
+    /**
+     * Maximum entries per node
+     * @default 9
+     */
+    maxEntries?: number;
+    /**
+     * Minimum entries per node
+     * @default Math.ceil(maxEntries * 0.4)
+     */
+    minEntries?: number;
+}
+/**
+ * R-Tree statistics
+ */
+export interface RTreeStats {
+    /**
+     * Total number of items in the tree
+     */
+    size: number;
+    /**
+     * Height of the tree
+     */
+    height: number;
+    /**
+     * Total number of nodes
+     */
+    nodeCount: number;
+    /**
+     * Bounding box of all items
+     */
+    bounds: Rectangle | null;
+}
+/**
+ * R-Tree interface
+ */
+export interface IRTree<T = any> {
+    /**
+     * Insert an item into the tree
+     */
+    insert(rect: Rectangle, data: T): void;
+    /**
+     * Search for items intersecting a rectangle
+     */
+    search(rect: Rectangle): RTreeSearchResult<T>[];
+    /**
+     * Search for items at a specific point
+     */
+    searchAtPoint(x: number, y: number): RTreeSearchResult<T>[];
+    /**
+     * Find nearest neighbors to a point
+     */
+    nearest(x: number, y: number, maxResults?: number, maxDistance?: number): RTreeSearchResult<T>[];
+    /**
+     * Remove an item from the tree
+     */
+    remove(rect: Rectangle, data?: T): boolean;
+    /**
+     * Remove all items from the tree
+     */
+    clear(): void;
+    /**
+     * Get all items in the tree
+     */
+    all(): RTreeSearchResult<T>[];
+    /**
+     * Check if the tree is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Get statistics about the tree
+     */
+    getStats(): RTreeStats;
+    /**
+     * Rebuild the tree (optimize structure)
+     */
+    rebuild(): void;
+}
+//# sourceMappingURL=rtree.interface.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rtree.interface.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/rtree/rtree.interface.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,GAAG,GAAG;IAChC;;OAEG;IACH,IAAI,EAAE,SAAS,CAAC;IAEhB;;OAEG;IACH,IAAI,EAAE,CAAC,CAAC;CACT;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,GAAG,GAAG;IACxC;;OAEG;IACH,IAAI,EAAE,SAAS,CAAC;IAEhB;;OAEG;IACH,IAAI,EAAE,CAAC,CAAC;IAER;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,MAAM,CAAC,CAAC,GAAG,GAAG;IAC7B;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IAEvC;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;IAEhD;;OAEG;IACH,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;IAE5D;;OAEG;IACH,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;IAEjG;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;IAE3C;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;OAEG;IACH,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;IAE9B;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC;IAEnB;;OAEG;IACH,QAAQ,IAAI,UAAU,CAAC;IAEvB;;OAEG;IACH,OAAO,IAAI,IAAI,CAAC;CACjB"}

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

@@ -0,0 +1,4 @@
+export { SegmentTree } from './segment-tree';
+export type { ISegmentTree, SegmentTreeOptions, AggregateFunction, } from './segment-tree.interface';
+export { Aggregations, SegmentTreeUtils, AggregationType } from './segment-tree.interface';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/segment-tree/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,iBAAiB,GAClB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC"}