@zengrid/core 1.0.6 → 1.1.0

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

@@ -1,117 +0,0 @@
-/**
- * Suffix Array Interface
- *
- * Used for:
- * - Fast substring search in O(m log n) time where m = pattern length, n = text length
- * - Pattern matching in grid cell values
- * - "Contains" filtering without scanning all rows
- */
-/**
- * Search result from suffix array
- */
-export interface SuffixSearchResult {
-    /**
-     * Starting position of the match in the original text
-     */
-    position: number;
-    /**
-     * The matched substring
-     */
-    match: string;
-    /**
-     * Context around the match (if available)
-     */
-    context?: string;
-}
-/**
- * Suffix Array options
- */
-export interface SuffixArrayOptions {
-    /**
-     * Case-sensitive search
-     * @default false
-     */
-    caseSensitive?: boolean;
-    /**
-     * Build LCP (Longest Common Prefix) array for advanced queries
-     * @default true
-     */
-    buildLCP?: boolean;
-}
-/**
- * Suffix Array statistics
- */
-export interface SuffixArrayStats {
-    /**
-     * Length of the original text
-     */
-    textLength: number;
-    /**
-     * Number of suffixes
-     */
-    suffixCount: number;
-    /**
-     * Memory usage in bytes (approximate)
-     */
-    memoryBytes: number;
-    /**
-     * Whether LCP array is built
-     */
-    hasLCP: boolean;
-}
-/**
- * Suffix Array interface
- */
-export interface ISuffixArray {
-    /**
-     * Search for a pattern in the text
-     *
-     * @param pattern - Pattern to search for
-     * @returns Array of positions where pattern occurs
-     */
-    search(pattern: string): number[];
-    /**
-     * Search for a pattern and return detailed results
-     *
-     * @param pattern - Pattern to search for
-     * @param contextLength - Number of characters to include before/after match
-     * @returns Array of search results with context
-     */
-    searchWithContext(pattern: string, contextLength?: number): SuffixSearchResult[];
-    /**
-     * Count occurrences of a pattern
-     *
-     * @param pattern - Pattern to count
-     * @returns Number of occurrences
-     */
-    count(pattern: string): number;
-    /**
-     * Check if pattern exists in the text
-     *
-     * @param pattern - Pattern to check
-     * @returns True if pattern exists
-     */
-    contains(pattern: string): boolean;
-    /**
-     * Find the longest repeated substring
-     *
-     * @returns The longest repeated substring
-     */
-    longestRepeatedSubstring(): string;
-    /**
-     * Get all unique substrings of a given length
-     *
-     * @param length - Length of substrings
-     * @returns Array of unique substrings
-     */
-    uniqueSubstrings(length: number): string[];
-    /**
-     * Get statistics about the suffix array
-     */
-    getStats(): SuffixArrayStats;
-    /**
-     * Clear the suffix array
-     */
-    clear(): void;
-}
-//# sourceMappingURL=suffix-array.interface.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"suffix-array.interface.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/suffix-array/suffix-array.interface.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IAEd;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,MAAM,EAAE,OAAO,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;OAKG;IACH,MAAM,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAElC;;;;;;OAMG;IACH,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,kBAAkB,EAAE,CAAC;IAEjF;;;;;OAKG;IACH,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC;IAE/B;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;IAEnC;;;;OAIG;IACH,wBAAwB,IAAI,MAAM,CAAC;IAEnC;;;;;OAKG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAE3C;;OAEG;IACH,QAAQ,IAAI,gBAAgB,CAAC;IAE7B;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;CACf"}

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

@@ -1,8 +0,0 @@
-/**
- * Trie (Prefix Tree) data structure
- *
- * Used for autocomplete, search suggestions, and prefix-based queries.
- */
-export { Trie } from './trie';
-export type { ITrie, ITrieNode, TrieOptions, TrieSearchResult, } from './trie.interface';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/trie/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,YAAY,EACV,KAAK,EACL,SAAS,EACT,WAAW,EACX,gBAAgB,GACjB,MAAM,kBAAkB,CAAC"}

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

@@ -1,205 +0,0 @@
-import type { ITrie, TrieOptions, TrieSearchResult } from './trie.interface';
-/**
- * Trie (Prefix Tree) Data Structure
- *
- * A tree-based data structure for efficient prefix-based searches.
- *
- * **Time Complexity:**
- * - Insert: O(m) where m = word length
- * - Search: O(m)
- * - Autocomplete: O(m + n) where n = number of suggestions
- * - Delete: O(m)
- *
- * **Space Complexity:** O(ALPHABET_SIZE * m * n) where n = number of words
- *
- * **Use Cases:**
- * - Column filter autocomplete: type "ap" → suggests "apple", "application"
- * - Search suggestions: real-time filtering as user types
- * - Dictionary lookups: spell checking
- * - IP routing tables
- *
- * @example
- * ```typescript
- * const trie = new Trie();
- * trie.insert('apple');
- * trie.insert('application');
- * trie.insert('app');
- *
- * trie.search('apple');           // true
- * trie.search('appl');            // false
- * trie.startsWith('app');         // true
- * trie.autocomplete('app');       // ['app', 'apple', 'application']
- *
- * const result = trie.find('app');
- * // {
- * //   term: 'app',
- * //   isComplete: true,
- * //   suggestions: ['app', 'apple', 'application'],
- * //   count: 3
- * // }
- * ```
- *
- * @example Grid Integration
- * ```typescript
- * // Column filter with autocomplete
- * class FilterManager {
- *   private valueTrie = new Trie();
- *
- *   indexColumn(col: number): void {
- *     const values = this.grid.getColumnValues(col);
- *     values.forEach(v => this.valueTrie.insert(String(v)));
- *   }
- *
- *   getSuggestions(prefix: string): string[] {
- *     return this.valueTrie.autocomplete(prefix, 10);
- *   }
- * }
- * ```
- */
-export declare class Trie implements ITrie {
-    private root;
-    private options;
-    private wordCount;
-    constructor(options?: TrieOptions);
-    /**
-     * Insert a word into the trie
-     *
-     * @param word - Word to insert
-     *
-     * @example
-     * ```typescript
-     * trie.insert('hello');
-     * trie.insert('world');
-     * ```
-     */
-    insert(word: string): void;
-    /**
-     * Search for an exact word in the trie
-     *
-     * @param word - Word to search for
-     * @returns true if word exists, false otherwise
-     *
-     * @example
-     * ```typescript
-     * trie.insert('apple');
-     * trie.search('apple');  // true
-     * trie.search('app');    // false (not a complete word)
-     * trie.search('apples'); // false
-     * ```
-     */
-    search(word: string): boolean;
-    /**
-     * Check if any word starts with the given prefix
-     *
-     * @param prefix - Prefix to check
-     * @returns true if prefix exists, false otherwise
-     *
-     * @example
-     * ```typescript
-     * trie.insert('apple');
-     * trie.startsWith('app');  // true
-     * trie.startsWith('ban');  // false
-     * ```
-     */
-    startsWith(prefix: string): boolean;
-    /**
-     * Get autocomplete suggestions for a prefix
-     *
-     * @param prefix - Prefix to search for
-     * @param maxResults - Maximum number of results (default: from options)
-     * @returns Array of suggestions
-     *
-     * @example
-     * ```typescript
-     * trie.insert('apple');
-     * trie.insert('application');
-     * trie.insert('app');
-     *
-     * trie.autocomplete('app');     // ['app', 'apple', 'application']
-     * trie.autocomplete('app', 2);  // ['app', 'apple']
-     * ```
-     */
-    autocomplete(prefix: string, maxResults?: number): string[];
-    /**
-     * Get detailed search result with metadata
-     *
-     * @param term - Search term
-     * @returns Search result with suggestions and metadata
-     *
-     * @example
-     * ```typescript
-     * const result = trie.find('app');
-     * // {
-     * //   term: 'app',
-     * //   isComplete: true,
-     * //   suggestions: ['app', 'apple', 'application'],
-     * //   count: 3
-     * // }
-     * ```
-     */
-    find(term: string): TrieSearchResult;
-    /**
-     * Delete a word from the trie
-     *
-     * @param word - Word to delete
-     * @returns true if word was deleted, false if word didn't exist
-     *
-     * @example
-     * ```typescript
-     * trie.insert('apple');
-     * trie.delete('apple');  // true
-     * trie.delete('banana'); // false (doesn't exist)
-     * ```
-     */
-    delete(word: string): boolean;
-    /**
-     * Clear all words from the trie
-     */
-    clear(): void;
-    /**
-     * Get all words in the trie
-     *
-     * @returns Array of all words
-     *
-     * @example
-     * ```typescript
-     * trie.insert('apple');
-     * trie.insert('banana');
-     * trie.getAllWords(); // ['apple', 'banana']
-     * ```
-     */
-    getAllWords(): string[];
-    /**
-     * Get the number of unique words in the trie
-     *
-     * @returns Number of words
-     */
-    size(): number;
-    /**
-     * Check if the trie is empty
-     *
-     * @returns true if empty, false otherwise
-     */
-    isEmpty(): boolean;
-    /**
-     * Normalize a string based on case sensitivity option
-     */
-    private normalize;
-    /**
-     * Restore original case from prefix to suggestion
-     */
-    private restoreCase;
-    /**
-     * Find a node in the trie by traversing the path
-     */
-    private findNode;
-    /**
-     * Collect all words from a node using DFS
-     */
-    private collectWords;
-    /**
-     * Recursively delete a word from the trie
-     */
-    private deleteRecursive;
-}
-//# sourceMappingURL=trie.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"trie.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/trie/trie.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,KAAK,EAEL,WAAW,EACX,gBAAgB,EACjB,MAAM,kBAAkB,CAAC;AAgB1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AACH,qBAAa,IAAK,YAAW,KAAK;IAChC,OAAO,CAAC,IAAI,CAAY;IACxB,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,SAAS,CAAa;gBAElB,OAAO,GAAE,WAAgB;IASrC;;;;;;;;;;OAUG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAoB1B;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAO7B;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAOnC;;;;;;;;;;;;;;;;OAgBG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAkB3D;;;;;;;;;;;;;;;;OAgBG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,gBAAgB;IAqBpC;;;;;;;;;;;;OAYG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAO7B;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;;;;;;;;;;OAWG;IACH,WAAW,IAAI,MAAM,EAAE;IAMvB;;;;OAIG;IACH,IAAI,IAAI,MAAM;IAId;;;;OAIG;IACH,OAAO,IAAI,OAAO;IAMlB;;OAEG;IACH,OAAO,CAAC,SAAS;IAIjB;;OAEG;IACH,OAAO,CAAC,WAAW;IAqBnB;;OAEG;IACH,OAAO,CAAC,QAAQ;IAahB;;OAEG;IACH,OAAO,CAAC,YAAY;IAwBpB;;OAEG;IACH,OAAO,CAAC,eAAe;CAwCxB"}

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

@@ -1,117 +0,0 @@
-/**
- * Trie (Prefix Tree) Interface
- *
- * Used for:
- * - Autocomplete in column filters
- * - Search suggestions
- * - Dictionary lookups
- * - Prefix-based searches
- */
-/**
- * Trie search result
- */
-export interface TrieSearchResult {
-    /**
-     * The search term
-     */
-    term: string;
-    /**
-     * Whether the term exists as a complete word
-     */
-    isComplete: boolean;
-    /**
-     * All words with this prefix
-     */
-    suggestions: string[];
-    /**
-     * Number of words with this prefix
-     */
-    count: number;
-}
-/**
- * Trie node interface
- */
-export interface ITrieNode {
-    /**
-     * Character at this node
-     */
-    char: string;
-    /**
-     * Is this the end of a word?
-     */
-    isEndOfWord: boolean;
-    /**
-     * Child nodes
-     */
-    children: Map<string, ITrieNode>;
-    /**
-     * Number of words passing through this node
-     */
-    wordCount: number;
-}
-/**
- * Trie options
- */
-export interface TrieOptions {
-    /**
-     * Case-sensitive search
-     * @default false
-     */
-    caseSensitive?: boolean;
-    /**
-     * Maximum suggestions to return
-     * @default 10
-     */
-    maxSuggestions?: number;
-    /**
-     * Allow partial matches
-     * @default true
-     */
-    allowPartial?: boolean;
-}
-/**
- * Trie data structure interface
- */
-export interface ITrie {
-    /**
-     * Insert a word into the trie
-     */
-    insert(word: string): void;
-    /**
-     * Search for a word in the trie
-     */
-    search(word: string): boolean;
-    /**
-     * Check if any word starts with the given prefix
-     */
-    startsWith(prefix: string): boolean;
-    /**
-     * Get all words with the given prefix (autocomplete)
-     */
-    autocomplete(prefix: string, maxResults?: number): string[];
-    /**
-     * Get detailed search result
-     */
-    find(term: string): TrieSearchResult;
-    /**
-     * Delete a word from the trie
-     */
-    delete(word: string): boolean;
-    /**
-     * Clear all words from the trie
-     */
-    clear(): void;
-    /**
-     * Get all words in the trie
-     */
-    getAllWords(): string[];
-    /**
-     * Get the number of words in the trie
-     */
-    size(): number;
-    /**
-     * Check if the trie is empty
-     */
-    isEmpty(): boolean;
-}
-//# sourceMappingURL=trie.interface.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"trie.interface.d.ts","sourceRoot":"","sources":["../../../../../src/shared/data-structures/trie/trie.interface.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,UAAU,EAAE,OAAO,CAAC;IAEpB;;OAEG;IACH,WAAW,EAAE,MAAM,EAAE,CAAC;IAEtB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,WAAW,EAAE,OAAO,CAAC;IAErB;;OAEG;IACH,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAEjC;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,KAAK;IACpB;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAE3B;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE9B;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;IAEpC;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAE5D;;OAEG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,gBAAgB,CAAC;IAErC;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE9B;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;OAEG;IACH,WAAW,IAAI,MAAM,EAAE,CAAC;IAExB;;OAEG;IACH,IAAI,IAAI,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC;CACpB"}

package/dist/src/shared/index.d.ts

@@ -1,47 +0,0 @@
-/**
- * ZenGrid Shared Package
- * Reusable algorithms and data structures
- *
- * @packageDocumentation
- */
-export { SparseMatrix } from './data-structures/sparse-matrix';
-export type { ReadonlySparseMatrix, ISparseMatrix, SparseMatrixOptions, } from './data-structures/sparse-matrix';
-export { PrefixSumArray } from './data-structures/prefix-sum-array';
-export type { IPrefixSumArray, PrefixSumArrayOptions, } from './data-structures/prefix-sum-array';
-export { ColumnStore } from './data-structures/column-store';
-export type { IColumnStore, ColumnStoreOptions, ColumnDefinition, ColumnType, AggregateOperation, AggregationResult, } from './data-structures/column-store';
-export { LRUCache } from './data-structures/lru-cache';
-export type { ILRUCache, LRUCacheOptions, CacheEntry, CacheStats, } from './data-structures/lru-cache';
-export { CommandStack } from './data-structures/command-stack';
-export type { ICommandStack, ICommand, ICommandStackOptions, } from './data-structures/command-stack';
-export { SegmentTree } from './data-structures/segment-tree';
-export type { ISegmentTree, SegmentTreeOptions, AggregateFunction, AggregationType, } from './data-structures/segment-tree';
-export { Aggregations, SegmentTreeUtils } from './data-structures/segment-tree';
-export { SkipList } from './data-structures/skip-list';
-export type { ISkipList, SkipListNode, SkipListOptions, RangeResult as SkipListRangeResult, SkipListStats, } from './data-structures/skip-list';
-export { defaultComparator as skipListDefaultComparator, SkipListUtils } from './data-structures/skip-list';
-export { DisjointSet } from './data-structures/disjoint-set';
-export type { IDisjointSet, DisjointSetOptions, DisjointSetStats, } from './data-structures/disjoint-set';
-export { DisjointSetUtils } from './data-structures/disjoint-set';
-export { IndexMap } from './data-structures/index-map';
-export type { IIndexMap, IndexMapEntry, IndexMapOptions, } from './data-structures/index-map';
-export { IntervalTree } from './data-structures/interval-tree';
-export type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions, } from './data-structures/interval-tree';
-export { IntervalUtils } from './data-structures/interval-tree';
-export { RTree } from './data-structures/rtree';
-export type { IRTree, RTreeData, RTreeOptions, RTreeSearchResult, RTreeStats, } from './data-structures/rtree';
-export { Trie } from './data-structures/trie';
-export type { ITrie, ITrieNode, TrieOptions, TrieSearchResult, } from './data-structures/trie';
-export { DependencyGraph } from './data-structures/dependency-graph';
-export type { IDependencyGraph, NodeId, Dependency, DependencyGraphOptions, TopologicalSortResult, GraphStats, } from './data-structures/dependency-graph';
-export { SuffixArray } from './data-structures/suffix-array';
-export type { ISuffixArray, SuffixArrayOptions, SuffixSearchResult, SuffixArrayStats, } from './data-structures/suffix-array';
-export { binarySearch, binarySearchLeft, binarySearchRight, } from './algorithms/search';
-export type { BinarySearchOptions, BinarySearchResult, } from './algorithms/search';
-export type { Comparator, Predicate, EqualityFn, HashFn, Range, Rectangle, Point, BoundingBox, } from './types';
-export { debounce, throttle, createRAFBatchScheduler, delay, timeout, } from './utils/timing';
-export type { DebounceOptions, DebouncedFunction, ThrottleOptions, ThrottledFunction, RAFBatchScheduler, } from './utils/timing.interface';
-export { EventEmitter, Subject, StateMachine, BaseCoordinator, Factory, SingletonFactory, Mediator, MediatedComponent, EventMediator, ObjectPool, KeyedObjectPool, resolveOperationMode, OperationModeManager, } from './patterns';
-export type { IEventEmitter, IObserver, ISubject, IStateMachine, StateMachineOptions, TransitionHandler, ICoordinator, IFactory, IMediator, IObjectPool, ObjectPoolOptions, ObjectPoolStats, OperationMode, ResolvedOperationMode, OperationModeConfig, } from './patterns';
-export declare const VERSION = "0.1.0";
-//# sourceMappingURL=index.d.ts.map

package/dist/src/shared/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/shared/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,YAAY,EACV,oBAAoB,EACpB,aAAa,EACb,mBAAmB,GACpB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACpE,YAAY,EACV,eAAe,EACf,qBAAqB,GACtB,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAC7D,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,gBAAgB,EAChB,UAAU,EACV,kBAAkB,EAClB,iBAAiB,GAClB,MAAM,gCAAgC,CAAC;AAExC,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,YAAY,EACV,SAAS,EACT,eAAe,EACf,UAAU,EACV,UAAU,GACX,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,YAAY,EACV,aAAa,EACb,QAAQ,EACR,oBAAoB,GACrB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAC7D,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,iBAAiB,EACjB,eAAe,GAChB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAEhF,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,YAAY,EACV,SAAS,EACT,YAAY,EACZ,eAAe,EACf,WAAW,IAAI,mBAAmB,EAClC,aAAa,GACd,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,iBAAiB,IAAI,yBAAyB,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAE5G,OAAO,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAC7D,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,YAAY,EACV,SAAS,EACT,aAAa,EACb,eAAe,GAChB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,YAAY,EACV,aAAa,EACb,QAAQ,EACR,YAAY,EACZ,mBAAmB,GACpB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAEhE,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAChD,YAAY,EACV,MAAM,EACN,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,UAAU,GACX,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC9C,YAAY,EACV,KAAK,EACL,SAAS,EACT,WAAW,EACX,gBAAgB,GACjB,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,YAAY,EACV,gBAAgB,EAChB,MAAM,EACN,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,UAAU,GACX,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAC7D,YAAY,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gCAAgC,CAAC;AAGxC,OAAO,EACL,YAAY,EACZ,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EACV,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAG7B,YAAY,EACV,UAAU,EACV,SAAS,EACT,UAAU,EACV,MAAM,EACN,KAAK,EACL,SAAS,EACT,KAAK,EACL,WAAW,GACZ,MAAM,SAAS,CAAC;AAGjB,OAAO,EACL,QAAQ,EACR,QAAQ,EACR,uBAAuB,EACvB,KAAK,EACL,OAAO,GACR,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,eAAe,EACf,iBAAiB,EACjB,eAAe,EACf,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,YAAY,EACZ,OAAO,EACP,YAAY,EACZ,eAAe,EACf,OAAO,EACP,gBAAgB,EAChB,QAAQ,EACR,iBAAiB,EACjB,aAAa,EACb,UAAU,EACV,eAAe,EACf,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAEpB,YAAY,EACV,aAAa,EACb,SAAS,EACT,QAAQ,EACR,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,YAAY,EACZ,QAAQ,EACR,SAAS,EACT,WAAW,EACX,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,qBAAqB,EACrB,mBAAmB,GACpB,MAAM,YAAY,CAAC;AAGpB,eAAO,MAAM,OAAO,UAAU,CAAC"}

package/dist/src/shared/patterns/coordinator.d.ts

@@ -1,90 +0,0 @@
-/**
- * Coordinator Pattern
- *
- * Base class for coordinators that manage lifecycle and integration
- * of components within a larger system.
- *
- * @example
- * ```typescript
- * class SortCoordinator extends BaseCoordinator {
- *   constructor(
- *     private grid: Grid,
- *     private sortManager: SortManager
- *   ) {
- *     super();
- *   }
- *
- *   protected onInitialize(): void {
- *     // Setup event listeners
- *     this.sortManager.on('sort:change', this.handleSortChange);
- *   }
- *
- *   protected onCleanup(): void {
- *     // Remove event listeners
- *     this.sortManager.off('sort:change', this.handleSortChange);
- *   }
- *
- *   private handleSortChange = () => {
- *     this.grid.refresh();
- *   };
- * }
- *
- * const coordinator = new SortCoordinator(grid, sortManager);
- * coordinator.initialize(); // Setup
- * // ... use ...
- * coordinator.cleanup(); // Teardown
- * ```
- */
-export interface ICoordinator {
-    /** Initialize the coordinator */
-    initialize(): void;
-    /** Cleanup and tear down the coordinator */
-    cleanup(): void;
-    /** Check if the coordinator is initialized */
-    readonly isInitialized: boolean;
-}
-/**
- * Base coordinator implementation
- *
- * Provides lifecycle management with initialization and cleanup hooks.
- */
-export declare abstract class BaseCoordinator implements ICoordinator {
-    private _initialized;
-    /**
-     * Initialize the coordinator
-     *
-     * This can be called multiple times safely - it will only
-     * initialize once until cleanup() is called.
-     */
-    initialize(): void;
-    /**
-     * Cleanup the coordinator
-     *
-     * This can be called multiple times safely - cleanup will only
-     * occur if the coordinator is initialized.
-     */
-    cleanup(): void;
-    /**
-     * Check if the coordinator is initialized
-     */
-    get isInitialized(): boolean;
-    /**
-     * Hook called during initialization
-     *
-     * Subclasses should override this to perform their setup.
-     */
-    protected abstract onInitialize(): void;
-    /**
-     * Hook called during cleanup
-     *
-     * Subclasses should override this to perform their teardown.
-     */
-    protected abstract onCleanup(): void;
-    /**
-     * Assert that the coordinator is initialized
-     *
-     * Throws an error if not initialized.
-     */
-    protected assertInitialized(): void;
-}
-//# sourceMappingURL=coordinator.d.ts.map

package/dist/src/shared/patterns/coordinator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"coordinator.d.ts","sourceRoot":"","sources":["../../../../src/shared/patterns/coordinator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,MAAM,WAAW,YAAY;IAC3B,iCAAiC;IACjC,UAAU,IAAI,IAAI,CAAC;IAEnB,4CAA4C;IAC5C,OAAO,IAAI,IAAI,CAAC;IAEhB,8CAA8C;IAC9C,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC;AAED;;;;GAIG;AACH,8BAAsB,eAAgB,YAAW,YAAY;IAC3D,OAAO,CAAC,YAAY,CAAS;IAE7B;;;;;OAKG;IACH,UAAU,IAAI,IAAI;IAoBlB;;;;;OAKG;IACH,OAAO,IAAI,IAAI;IAiBf;;OAEG;IACH,IAAI,aAAa,IAAI,OAAO,CAE3B;IAED;;;;OAIG;IACH,SAAS,CAAC,QAAQ,CAAC,YAAY,IAAI,IAAI;IAEvC;;;;OAIG;IACH,SAAS,CAAC,QAAQ,CAAC,SAAS,IAAI,IAAI;IAEpC;;;;OAIG;IACH,SAAS,CAAC,iBAAiB,IAAI,IAAI;CAOpC"}