@zengrid/shared 1.0.4 → 1.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +4 -0
- package/dist/README.md +4 -0
- package/dist/index.cjs.js +3085 -1783
- package/dist/index.esm.js +3080 -1783
- package/dist/package.json +1 -1
- package/dist/src/algorithms/graph/bfs.d.ts.map +1 -1
- package/dist/src/algorithms/graph/dfs.d.ts.map +1 -1
- package/dist/src/algorithms/graph/index.d.ts +1 -1
- package/dist/src/algorithms/graph/index.d.ts.map +1 -1
- package/dist/src/algorithms/index.d.ts +5 -5
- package/dist/src/algorithms/index.d.ts.map +1 -1
- package/dist/src/algorithms/pattern/index.d.ts +2 -2
- package/dist/src/algorithms/pattern/index.d.ts.map +1 -1
- package/dist/src/algorithms/pattern/sequence-detector.d.ts.map +1 -1
- package/dist/src/algorithms/search/index.d.ts +2 -2
- package/dist/src/algorithms/search/index.d.ts.map +1 -1
- package/dist/src/algorithms/sorting/comparators.d.ts.map +1 -1
- package/dist/src/algorithms/sorting/index.d.ts +1 -1
- package/dist/src/algorithms/sorting/index.d.ts.map +1 -1
- package/dist/src/algorithms/sorting/timsort-gallop.d.ts +21 -0
- package/dist/src/algorithms/sorting/timsort-gallop.d.ts.map +1 -0
- package/dist/src/algorithms/sorting/timsort-merge.d.ts +6 -0
- package/dist/src/algorithms/sorting/timsort-merge.d.ts.map +1 -0
- package/dist/src/algorithms/sorting/timsort-run.d.ts +38 -0
- package/dist/src/algorithms/sorting/timsort-run.d.ts.map +1 -0
- package/dist/src/algorithms/sorting/timsort.d.ts.map +1 -1
- package/dist/src/algorithms/sorting/timsort.interface.d.ts +32 -0
- package/dist/src/algorithms/sorting/timsort.interface.d.ts.map +1 -0
- package/dist/src/data-structures/column-store/column-store.d.ts.map +1 -1
- package/dist/src/data-structures/column-store/column-store.interface.d.ts.map +1 -1
- package/dist/src/data-structures/command-stack/command-stack.d.ts.map +1 -1
- package/dist/src/data-structures/disjoint-set/disjoint-set.d.ts.map +1 -1
- package/dist/src/data-structures/disjoint-set/index.d.ts +1 -1
- package/dist/src/data-structures/disjoint-set/index.d.ts.map +1 -1
- package/dist/src/data-structures/index-map/index-map.d.ts.map +1 -1
- package/dist/src/data-structures/index-map/index.d.ts +1 -1
- package/dist/src/data-structures/index-map/index.d.ts.map +1 -1
- package/dist/src/data-structures/index.d.ts +8 -8
- package/dist/src/data-structures/index.d.ts.map +1 -1
- package/dist/src/data-structures/interval-tree/interval-tree.d.ts +0 -83
- package/dist/src/data-structures/interval-tree/interval-tree.d.ts.map +1 -1
- package/dist/src/data-structures/interval-tree/node.d.ts +34 -0
- package/dist/src/data-structures/interval-tree/node.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/balance.d.ts +34 -0
- package/dist/src/data-structures/interval-tree/operations/balance.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/delete.d.ts +26 -0
- package/dist/src/data-structures/interval-tree/operations/delete.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/insert.d.ts +19 -0
- package/dist/src/data-structures/interval-tree/operations/insert.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/search.d.ts +46 -0
- package/dist/src/data-structures/interval-tree/operations/search.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/traversal.d.ts +29 -0
- package/dist/src/data-structures/interval-tree/operations/traversal.d.ts.map +1 -0
- package/dist/src/data-structures/interval-tree/operations/utilities.d.ts +30 -0
- package/dist/src/data-structures/interval-tree/operations/utilities.d.ts.map +1 -0
- package/dist/src/data-structures/lru-cache/index.d.ts +1 -1
- package/dist/src/data-structures/lru-cache/index.d.ts.map +1 -1
- package/dist/src/data-structures/lru-cache/lru-cache.d.ts.map +1 -1
- package/dist/src/data-structures/prefix-sum-array/prefix-sum-array.d.ts.map +1 -1
- package/dist/src/data-structures/ring-buffer.d.ts +96 -0
- package/dist/src/data-structures/ring-buffer.d.ts.map +1 -0
- package/dist/src/data-structures/rtree/rtree.d.ts.map +1 -1
- package/dist/src/data-structures/segment-tree/aggregation-config.d.ts +6 -0
- package/dist/src/data-structures/segment-tree/aggregation-config.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/index.d.ts +1 -1
- package/dist/src/data-structures/segment-tree/index.d.ts.map +1 -1
- package/dist/src/data-structures/segment-tree/lazy-propagation.d.ts +5 -0
- package/dist/src/data-structures/segment-tree/lazy-propagation.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/segment-tree.d.ts +1 -105
- package/dist/src/data-structures/segment-tree/segment-tree.d.ts.map +1 -1
- package/dist/src/data-structures/segment-tree/segment-tree.interface.d.ts.map +1 -1
- package/dist/src/data-structures/segment-tree/tree-builder.d.ts +3 -0
- package/dist/src/data-structures/segment-tree/tree-builder.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/tree-query.d.ts +3 -0
- package/dist/src/data-structures/segment-tree/tree-query.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/tree-search.d.ts +2 -0
- package/dist/src/data-structures/segment-tree/tree-search.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/tree-update.d.ts +4 -0
- package/dist/src/data-structures/segment-tree/tree-update.d.ts.map +1 -0
- package/dist/src/data-structures/segment-tree/tree-validation.d.ts +3 -0
- package/dist/src/data-structures/segment-tree/tree-validation.d.ts.map +1 -0
- package/dist/src/data-structures/skip-list/skip-list.d.ts.map +1 -1
- package/dist/src/data-structures/sparse-matrix/sparse-matrix.d.ts.map +1 -1
- package/dist/src/data-structures/suffix-array/suffix-array.d.ts.map +1 -1
- package/dist/src/data-structures/trie/index.d.ts +1 -1
- package/dist/src/data-structures/trie/index.d.ts.map +1 -1
- package/dist/src/data-structures/trie/trie.d.ts.map +1 -1
- package/dist/src/index.d.ts +13 -10
- package/dist/src/index.d.ts.map +1 -1
- package/dist/src/patterns/coordinator.d.ts.map +1 -1
- package/dist/src/patterns/event-emitter.d.ts.map +1 -1
- package/dist/src/patterns/factory.d.ts.map +1 -1
- package/dist/src/patterns/index.d.ts +4 -4
- package/dist/src/patterns/index.d.ts.map +1 -1
- package/dist/src/patterns/state-machine.d.ts.map +1 -1
- package/dist/src/reactive/batch-processor.d.ts +80 -0
- package/dist/src/reactive/batch-processor.d.ts.map +1 -0
- package/dist/src/reactive/core/batch-manager.d.ts +48 -0
- package/dist/src/reactive/core/batch-manager.d.ts.map +1 -0
- package/dist/src/reactive/core/batch-queue.d.ts +39 -0
- package/dist/src/reactive/core/batch-queue.d.ts.map +1 -0
- package/dist/src/reactive/core/event-handler-registry.d.ts +52 -0
- package/dist/src/reactive/core/event-handler-registry.d.ts.map +1 -0
- package/dist/src/reactive/core/event-mapper.d.ts +37 -0
- package/dist/src/reactive/core/event-mapper.d.ts.map +1 -0
- package/dist/src/reactive/core/pool-stats.d.ts +47 -0
- package/dist/src/reactive/core/pool-stats.d.ts.map +1 -0
- package/dist/src/reactive/core/subscription-manager.d.ts +46 -0
- package/dist/src/reactive/core/subscription-manager.d.ts.map +1 -0
- package/dist/src/reactive/event-delegator.d.ts +84 -0
- package/dist/src/reactive/event-delegator.d.ts.map +1 -0
- package/dist/src/reactive/index.d.ts +61 -0
- package/dist/src/reactive/index.d.ts.map +1 -0
- package/dist/src/reactive/interfaces.d.ts +207 -0
- package/dist/src/reactive/interfaces.d.ts.map +1 -0
- package/dist/src/reactive/object-pool.d.ts +97 -0
- package/dist/src/reactive/object-pool.d.ts.map +1 -0
- package/dist/src/reactive/reactive-state.d.ts +132 -0
- package/dist/src/reactive/reactive-state.d.ts.map +1 -0
- package/package.json +52 -52
package/dist/package.json
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,wBAAgB,GAAG,CAAC,CAAC,
|
|
1
|
+
{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,GAAE,UAAU,CAAC,CAAC,CAAM,GAAG,CAAC,EAAE,CA8B1F;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CA8C3F;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,CAAC,EAAE,CA8B3F;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAE5E;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAaxE"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"dfs.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,GAAG,CAAC,CAAC,
|
|
1
|
+
{"version":3,"file":"dfs.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,GAAE,UAAU,CAAC,CAAC,CAAM,GAAG,CAAC,EAAE,CAiC1F;AAED;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CA0BzE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,OAAO,CA6B5D;AAED;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAiD7E"}
|
|
@@ -3,7 +3,7 @@
|
|
|
3
3
|
*
|
|
4
4
|
* Efficient algorithms for graph traversal, path finding, and analysis.
|
|
5
5
|
*/
|
|
6
|
-
export { dfs, dfsPath, hasCycle, stronglyConnectedComponents
|
|
6
|
+
export { dfs, dfsPath, hasCycle, stronglyConnectedComponents } from './dfs';
|
|
7
7
|
export { bfs, bfsShortestPath, nodesAtDistance, connectedComponent, allConnectedComponents, } from './bfs';
|
|
8
8
|
export type { AdjacencyList, WeightedEdge, DFSOptions, BFSOptions, PathResult, } from './graph.interface';
|
|
9
9
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,2BAA2B,EAAE,MAAM,OAAO,CAAC;AAG5E,OAAO,EACL,GAAG,EACH,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,sBAAsB,GACvB,MAAM,OAAO,CAAC;AAGf,YAAY,EACV,aAAa,EACb,YAAY,EACZ,UAAU,EACV,UAAU,EACV,UAAU,GACX,MAAM,mBAAmB,CAAC"}
|
|
@@ -1,11 +1,11 @@
|
|
|
1
1
|
/**
|
|
2
2
|
* Algorithms for ZenGrid
|
|
3
3
|
*/
|
|
4
|
-
export { binarySearch, binarySearchLeft, binarySearchRight
|
|
5
|
-
export type { BinarySearchOptions, BinarySearchResult
|
|
4
|
+
export { binarySearch, binarySearchLeft, binarySearchRight } from './search';
|
|
5
|
+
export type { BinarySearchOptions, BinarySearchResult } from './search';
|
|
6
6
|
export { dfs, dfsPath, hasCycle, stronglyConnectedComponents, bfs, bfsShortestPath, nodesAtDistance, connectedComponent, allConnectedComponents, } from './graph';
|
|
7
|
-
export type { AdjacencyList, WeightedEdge, DFSOptions, BFSOptions, PathResult
|
|
7
|
+
export type { AdjacencyList, WeightedEdge, DFSOptions, BFSOptions, PathResult } from './graph';
|
|
8
8
|
export { BloomFilter } from './filter';
|
|
9
|
-
export { detectSequence, generateSequence, autofill
|
|
10
|
-
export type { SequenceType, SequencePattern
|
|
9
|
+
export { detectSequence, generateSequence, autofill } from './pattern';
|
|
10
|
+
export type { SequenceType, SequencePattern } from './pattern';
|
|
11
11
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAC7E,YAAY,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAGxE,OAAO,EACL,GAAG,EACH,OAAO,EACP,QAAQ,EACR,2BAA2B,EAC3B,GAAG,EACH,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,sBAAsB,GACvB,MAAM,SAAS,CAAC;AACjB,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAG/F,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAGvC,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACvE,YAAY,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC"}
|
|
@@ -3,6 +3,6 @@
|
|
|
3
3
|
*
|
|
4
4
|
* Algorithms for detecting patterns in data sequences and autofill.
|
|
5
5
|
*/
|
|
6
|
-
export { detectSequence, generateSequence, autofill
|
|
7
|
-
export type { SequenceType, SequencePattern
|
|
6
|
+
export { detectSequence, generateSequence, autofill } from './sequence-detector';
|
|
7
|
+
export type { SequenceType, SequencePattern } from './sequence-detector';
|
|
8
8
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/pattern/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/pattern/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAEjF,YAAY,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"sequence-detector.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/pattern/sequence-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH;;GAEG;AACH,MAAM,MAAM,YAAY,GACpB,YAAY,GACZ,WAAW,GACX,MAAM,GACN,MAAM,GACN,UAAU,GACV,MAAM,CAAC;AAEX;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,eAAe,CAkC7D;
|
|
1
|
+
{"version":3,"file":"sequence-detector.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/pattern/sequence-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH;;GAEG;AACH,MAAM,MAAM,YAAY,GACpB,YAAY,GACZ,WAAW,GACX,MAAM,GACN,MAAM,GACN,UAAU,GACV,MAAM,CAAC;AAEX;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,eAAe,CAkC7D;AAqGD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE,CAsDhG;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,GAAG,EAAE,CAqBnE"}
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
/**
|
|
2
2
|
* Search algorithms
|
|
3
3
|
*/
|
|
4
|
-
export { binarySearch, binarySearchLeft, binarySearchRight
|
|
5
|
-
export type { BinarySearchOptions, BinarySearchResult
|
|
4
|
+
export { binarySearch, binarySearchLeft, binarySearchRight } from './binary-search';
|
|
5
|
+
export type { BinarySearchOptions, BinarySearchResult } from './binary-search';
|
|
6
6
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/search/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/search/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpF,YAAY,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"comparators.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/comparators.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,kCAAkC;IAClC,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,kCAAkC;IAClC,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,2CAA2C;IAC3C,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B;AA2BD;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,
|
|
1
|
+
{"version":3,"file":"comparators.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/comparators.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,kCAAkC;IAClC,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,kCAAkC;IAClC,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,2CAA2C;IAC3C,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B;AA2BD;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,GAAE,YAAqB,GAAG,UAAU,CAAC,GAAG,CAAC,CAatF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,GAAE,uBAA4B,GAAG,UAAU,CAAC,GAAG,CAAC,CAyBvF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,YAAY,GAAE,YAAqB,GAAG,UAAU,CAAC,GAAG,CAAC,CAgBnF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,GAAE,YAAqB,GAAG,UAAU,CAAC,GAAG,CAAC,CAQtF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAC5B,YAAY,EAAE,GAAG,EAAE,EACnB,OAAO,GAAE;IAAE,YAAY,CAAC,EAAE,YAAY,CAAA;CAAO,GAC5C,UAAU,CAAC,GAAG,CAAC,CAyBjB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAE7E;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAUlF"}
|
|
@@ -2,7 +2,7 @@
|
|
|
2
2
|
* Sorting algorithms and comparators
|
|
3
3
|
* @packageDocumentation
|
|
4
4
|
*/
|
|
5
|
-
export type { NullPosition, TimsortOptions, SortMetadata
|
|
5
|
+
export type { NullPosition, TimsortOptions, SortMetadata } from './sorting.interface';
|
|
6
6
|
export { numericComparator, stringComparator, dateComparator, booleanComparator, autoComparator, reverseComparator, chainComparators, } from './comparators';
|
|
7
7
|
export type { StringComparatorOptions } from './comparators';
|
|
8
8
|
export { timsort, timsortIndices, isSorted } from './timsort';
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,YAAY,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEtF,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,cAAc,EACd,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,eAAe,CAAC;AAEvB,YAAY,EAAE,uBAAuB,EAAE,MAAM,eAAe,CAAC;AAE7D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC"}
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
import type { Comparator } from '../../types/common';
|
|
2
|
+
/**
|
|
3
|
+
* Gallop right: Find position where key belongs in array[base:base+len]
|
|
4
|
+
* Returns offset k where array[base+k-1] < key <= array[base+k]
|
|
5
|
+
* Uses exponential search followed by binary search
|
|
6
|
+
*/
|
|
7
|
+
export declare function gallopRight<T>(key: T, array: T[], base: number, len: number, hint: number, comparator: Comparator<T>): number;
|
|
8
|
+
/**
|
|
9
|
+
* Gallop left: Like gallopRight, but finds position where key < array[base+k]
|
|
10
|
+
*/
|
|
11
|
+
export declare function gallopLeft<T>(key: T, array: T[], base: number, len: number, hint: number, comparator: Comparator<T>): number;
|
|
12
|
+
/**
|
|
13
|
+
* Gallop right in a generic array (for temporary buffer)
|
|
14
|
+
* Find position where key belongs in arr[base:base+len]
|
|
15
|
+
*/
|
|
16
|
+
export declare function gallopRightInArray<T>(key: T, arr: T[], base: number, len: number, hint: number, comparator: Comparator<T>): number;
|
|
17
|
+
/**
|
|
18
|
+
* Gallop left in a generic array (for temporary buffer)
|
|
19
|
+
*/
|
|
20
|
+
export declare function gallopLeftInArray<T>(key: T, arr: T[], base: number, len: number, hint: number, comparator: Comparator<T>): number;
|
|
21
|
+
//# sourceMappingURL=timsort-gallop.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"timsort-gallop.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort-gallop.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,GAAG,EAAE,CAAC,EACN,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,MAAM,CA6CR;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,GAAG,EAAE,CAAC,EACN,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,MAAM,CAwCR;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,GAAG,EAAE,CAAC,EACN,GAAG,EAAE,CAAC,EAAE,EACR,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,MAAM,CAwCR;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,GAAG,EAAE,CAAC,EACN,GAAG,EAAE,CAAC,EAAE,EACR,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,MAAM,CAwCR"}
|
|
@@ -0,0 +1,6 @@
|
|
|
1
|
+
import type { TimsortState } from './timsort.interface';
|
|
2
|
+
/**
|
|
3
|
+
* Merge two adjacent runs with galloping optimization
|
|
4
|
+
*/
|
|
5
|
+
export declare function mergeRuns<T>(state: TimsortState<T>, base1: number, len1: number, base2: number, len2: number): void;
|
|
6
|
+
//# sourceMappingURL=timsort-merge.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"timsort-merge.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort-merge.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAIxD;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EACtB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,IAAI,CAgCN"}
|
|
@@ -0,0 +1,38 @@
|
|
|
1
|
+
import type { Comparator } from '../../types/common';
|
|
2
|
+
import type { Run, TimsortState } from './timsort.interface';
|
|
3
|
+
/**
|
|
4
|
+
* Count length of run starting at lo and reverse if descending
|
|
5
|
+
* Returns length of run (at least 2 if array has 2+ elements)
|
|
6
|
+
*/
|
|
7
|
+
export declare function countRunAndMakeAscending<T>(array: T[], lo: number, comparator: Comparator<T>): number;
|
|
8
|
+
/**
|
|
9
|
+
* Reverse array[lo:hi]
|
|
10
|
+
*/
|
|
11
|
+
export declare function reverseRange<T>(array: T[], lo: number, hi: number): void;
|
|
12
|
+
/**
|
|
13
|
+
* Binary insertion sort - more efficient than regular insertion sort
|
|
14
|
+
* Sorts array[lo:hi] where array[lo:start] is already sorted
|
|
15
|
+
*/
|
|
16
|
+
export declare function binaryInsertionSort<T>(array: T[], lo: number, hi: number, start: number, comparator: Comparator<T>): void;
|
|
17
|
+
/**
|
|
18
|
+
* Compute optimal minRun value
|
|
19
|
+
* Returns a value in range [32, 64] such that n/minRun is close to a power of 2
|
|
20
|
+
*/
|
|
21
|
+
export declare function computeMinRun(n: number): number;
|
|
22
|
+
/**
|
|
23
|
+
* Push a run onto the pending-run stack
|
|
24
|
+
*/
|
|
25
|
+
export declare function pushRun(runStack: Run[], runBase: number, runLen: number): void;
|
|
26
|
+
/**
|
|
27
|
+
* Merge runs to maintain stack invariants
|
|
28
|
+
*
|
|
29
|
+
* Invariants (from Python's timsort):
|
|
30
|
+
* 1. runLen[i - 2] > runLen[i - 1] + runLen[i]
|
|
31
|
+
* 2. runLen[i - 1] > runLen[i]
|
|
32
|
+
*/
|
|
33
|
+
export declare function mergeCollapse<T>(state: TimsortState<T>, mergeAtFn: (state: TimsortState<T>, i: number) => void): void;
|
|
34
|
+
/**
|
|
35
|
+
* Force merge all runs on the stack
|
|
36
|
+
*/
|
|
37
|
+
export declare function mergeForceCollapse<T>(state: TimsortState<T>, mergeAtFn: (state: TimsortState<T>, i: number) => void): void;
|
|
38
|
+
//# sourceMappingURL=timsort-run.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"timsort-run.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort-run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAG7D;;;GAGG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,EACxC,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,MAAM,EACV,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,MAAM,CAyBR;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAOxE;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GACxB,IAAI,CA8BN;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAS/C;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9E;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EACtB,SAAS,EAAE,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,IAAI,GACrD,IAAI,CAqBN;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EACtB,SAAS,EAAE,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,IAAI,GACrD,IAAI,CAUN"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"timsort.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;
|
|
1
|
+
{"version":3,"file":"timsort.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAY1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,CAAC,EAAE,EACV,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,OAAO,GAAE,cAAmB,GAC3B,CAAC,EAAE,CAUL;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAC9B,OAAO,EAAE,MAAM,EAAE,EACjB,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,EAC9B,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,OAAO,GAAE,cAAmB,GAC3B,MAAM,EAAE,CAOV;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO,CAOnF"}
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
import type { Comparator } from '../../types/common';
|
|
2
|
+
/**
|
|
3
|
+
* Minimum gallop threshold
|
|
4
|
+
* How many times one run must "win" before we switch to galloping mode
|
|
5
|
+
*
|
|
6
|
+
* JavaScript Note: Set higher than Python's default (7) due to function call overhead.
|
|
7
|
+
* Galloping mode has more overhead in JS, so we require more consecutive wins
|
|
8
|
+
* to justify entering gallop mode.
|
|
9
|
+
*/
|
|
10
|
+
export declare const MIN_GALLOP = 32;
|
|
11
|
+
/**
|
|
12
|
+
* Minimum merge threshold for stack invariants
|
|
13
|
+
*/
|
|
14
|
+
export declare const MIN_MERGE = 32;
|
|
15
|
+
/**
|
|
16
|
+
* Run represents a sorted sequence in the array
|
|
17
|
+
*/
|
|
18
|
+
export interface Run {
|
|
19
|
+
start: number;
|
|
20
|
+
length: number;
|
|
21
|
+
}
|
|
22
|
+
/**
|
|
23
|
+
* Internal state shared across Timsort modules
|
|
24
|
+
*/
|
|
25
|
+
export interface TimsortState<T> {
|
|
26
|
+
array: T[];
|
|
27
|
+
comparator: Comparator<T>;
|
|
28
|
+
minGallop: number;
|
|
29
|
+
runStack: Run[];
|
|
30
|
+
tmp: T[];
|
|
31
|
+
}
|
|
32
|
+
//# sourceMappingURL=timsort.interface.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"timsort.interface.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/sorting/timsort.interface.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD;;;;;;;GAOG;AACH,eAAO,MAAM,UAAU,KAAK,CAAC;AAE7B;;GAEG;AACH,eAAO,MAAM,SAAS,KAAK,CAAC;AAE5B;;GAEG;AACH,MAAM,WAAW,GAAG;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,KAAK,EAAE,CAAC,EAAE,CAAC;IACX,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,GAAG,EAAE,CAAC;IAChB,GAAG,EAAE,CAAC,EAAE,CAAC;CACV"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"column-store.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/column-store/column-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,WAAW,IAAI,YAAY,EAC3B,kBAAkB,EAClB,gBAAgB,EAEhB,kBAAkB,EAClB,iBAAiB,EAClB,MAAM,0BAA0B,CAAC;AAElC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,WAAY,YAAW,YAAY;IAC9C,OAAO,CAAC,IAAI,CAAiD;IAC7D,OAAO,CAAC,WAAW,CAA0B;IAC7C,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,QAAQ,CAAU;gBAEd,OAAO,GAAE,kBAAuB;IAc5C,SAAS,CAAC,UAAU,EAAE,gBAAgB,GAAG,IAAI;IAgB7C,OAAO,CAAC,YAAY;
|
|
1
|
+
{"version":3,"file":"column-store.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/column-store/column-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,WAAW,IAAI,YAAY,EAC3B,kBAAkB,EAClB,gBAAgB,EAEhB,kBAAkB,EAClB,iBAAiB,EAClB,MAAM,0BAA0B,CAAC;AAElC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,WAAY,YAAW,YAAY;IAC9C,OAAO,CAAC,IAAI,CAAiD;IAC7D,OAAO,CAAC,WAAW,CAA0B;IAC7C,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,QAAQ,CAAU;gBAEd,OAAO,GAAE,kBAAuB;IAc5C,SAAS,CAAC,UAAU,EAAE,gBAAgB,GAAG,IAAI;IAgB7C,OAAO,CAAC,YAAY;IAcpB,OAAO,CAAC,UAAU;IAUlB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAQzC,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAItC,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,GAAG;IAW9C,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI;IAY3D,OAAO,CAAC,WAAW;IA8BnB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IAUxC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI;IAUtD,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,GAAG,EAAE;IASpC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI;IAiBlD,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,kBAAkB,GAAG,iBAAiB;IA6F/E,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IA2B5B,KAAK,IAAI,IAAI;IAYb,OAAO,CAAC,eAAe;IAcvB,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,OAAO,IAAI,aAAa,CAAC,MAAM,CAAC,CAEnC;CACF"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"column-store.interface.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/column-store/column-store.interface.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;AAEpE;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;AAEzE;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,gBAAgB;IAChB,IAAI,EAAE,UAAU,CAAC;IACjB,iCAAiC;IACjC,YAAY,CAAC,EAAE,GAAG,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,kBAAkB,CAAC;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAE9C;;;;;OAKG;IACH,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;IAE1C;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;IAEvC;;;;;;OAMG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,GAAG,CAAC;IAE/C;;;;;;OAMG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI,CAAC;IAE5D;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAEzC;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IAEvD;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,GAAG,EAAE,CAAC;IAErC;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAEnD;;;;;;OAMG;IACH,SAAS,
|
|
1
|
+
{"version":3,"file":"column-store.interface.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/column-store/column-store.interface.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;AAEpE;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;AAEzE;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,gBAAgB;IAChB,IAAI,EAAE,UAAU,CAAC;IACjB,iCAAiC;IACjC,YAAY,CAAC,EAAE,GAAG,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,kBAAkB,CAAC;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAE9C;;;;;OAKG;IACH,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;IAE1C;;;;OAIG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;IAEvC;;;;;;OAMG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,GAAG,CAAC;IAE/C;;;;;;OAMG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI,CAAC;IAE5D;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAEzC;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IAEvD;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,GAAG,EAAE,CAAC;IAErC;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAEnD;;;;;;OAMG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,kBAAkB,GAAG,iBAAiB,CAAC;IAEhF;;;;OAIG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAE7B;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACzC;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,OAAO,CAAC,EAAE,gBAAgB,EAAE,CAAC;IAE7B;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"command-stack.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/command-stack/command-stack.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,
|
|
1
|
+
{"version":3,"file":"command-stack.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/command-stack/command-stack.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAE/F;;;;;;;;;;;GAWG;AACH,qBAAa,YAAa,YAAW,aAAa;IAChD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;gBAErB,OAAO,GAAE,oBAAyB;IAQ9C;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI;IAehC;;OAEG;IACH,IAAI,IAAI,OAAO;IAYf;;OAEG;IACH,IAAI,IAAI,OAAO;IAmBf;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,YAAY,IAAI,MAAM;IAItB;;OAEG;IACH,YAAY,IAAI,MAAM;IAItB;;OAEG;IACH,cAAc,IAAI,MAAM,EAAE;IAI1B;;OAEG;IACH,cAAc,IAAI,MAAM,EAAE;CAG3B"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"disjoint-set.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/disjoint-set/disjoint-set.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,
|
|
1
|
+
{"version":3,"file":"disjoint-set.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/disjoint-set/disjoint-set.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAmBnG;;GAEG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,YAAW,YAAY,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,IAAI,CAA+B;IAC3C,OAAO,CAAC,OAAO,CAA+B;IAC9C,OAAO,CAAC,UAAU,CAA0B;IAC5C,OAAO,CAAC,MAAM,CAAkC;IAChD,OAAO,CAAC,UAAU,CAA0B;gBAEhC,OAAO,GAAE,kBAAkB,CAAC,CAAC,CAAM;IAgB/C;;OAEG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAYzB;;;OAGG;IACH,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAS/B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAe5B;;;OAGG;IACH,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO;IAyCxC;;OAEG;IACH,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO;IAW5C;;OAEG;IACH,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM;IAU9B;;OAEG;IACH,OAAO,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAetB;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE;IAgBvB;;OAEG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAKxB;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAgD3B;;OAEG;IACH,KAAK,IAAI,IAAI;IAOb;;OAEG;IACH,QAAQ,IAAI,CAAC,EAAE;IAIf;;OAEG;IACH,QAAQ,IAAI,gBAAgB;IAc5B;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,MAAM,CAEpB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;CACF"}
|
|
@@ -2,6 +2,6 @@
|
|
|
2
2
|
* Disjoint Set (Union-Find) for ZenGrid
|
|
3
3
|
*/
|
|
4
4
|
export { DisjointSet } from './disjoint-set';
|
|
5
|
-
export type { IDisjointSet, DisjointSetOptions, DisjointSetStats
|
|
5
|
+
export type { IDisjointSet, DisjointSetOptions, DisjointSetStats } from './disjoint-set.interface';
|
|
6
6
|
export { DisjointSetUtils } from './disjoint-set.interface';
|
|
7
7
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/disjoint-set/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/disjoint-set/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,YAAY,EAAE,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACnG,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index-map.d.ts","sourceRoot":"","sources":["../../../../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,
|
|
1
|
+
{"version":3,"file":"index-map.d.ts","sourceRoot":"","sources":["../../../../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,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;IAQvF;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;IAIlF;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAQ5F;;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"}
|
|
@@ -2,5 +2,5 @@
|
|
|
2
2
|
* IndexMap - Bidirectional lookup data structure
|
|
3
3
|
*/
|
|
4
4
|
export { IndexMap } from './index-map';
|
|
5
|
-
export type { IIndexMap, IndexMapEntry, IndexMapOptions
|
|
5
|
+
export type { IIndexMap, IndexMapEntry, IndexMapOptions } from './index-map.interface';
|
|
6
6
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/index-map/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/index-map/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC"}
|
|
@@ -2,18 +2,18 @@
|
|
|
2
2
|
* Data Structures for ZenGrid
|
|
3
3
|
*/
|
|
4
4
|
export { SparseMatrix } from './sparse-matrix';
|
|
5
|
-
export type { ReadonlySparseMatrix, ISparseMatrix, SparseMatrixOptions
|
|
5
|
+
export type { ReadonlySparseMatrix, ISparseMatrix, SparseMatrixOptions } from './sparse-matrix';
|
|
6
6
|
export { PrefixSumArray } from './prefix-sum-array';
|
|
7
|
-
export type { IPrefixSumArray, PrefixSumArrayOptions
|
|
7
|
+
export type { IPrefixSumArray, PrefixSumArrayOptions } from './prefix-sum-array';
|
|
8
8
|
export { ColumnStore } from './column-store';
|
|
9
9
|
export type { IColumnStore, ColumnStoreOptions, ColumnDefinition, ColumnType, AggregateOperation, AggregationResult, } from './column-store';
|
|
10
10
|
export { IndexMap } from './index-map';
|
|
11
|
-
export type { IIndexMap, IndexMapEntry, IndexMapOptions
|
|
11
|
+
export type { IIndexMap, IndexMapEntry, IndexMapOptions } from './index-map';
|
|
12
12
|
export { IntervalTree } from './interval-tree';
|
|
13
|
-
export type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions
|
|
13
|
+
export type { IIntervalTree, Interval, IntervalData, IntervalTreeOptions } from './interval-tree';
|
|
14
14
|
export { IntervalUtils } from './interval-tree';
|
|
15
15
|
export { Trie } from './trie';
|
|
16
|
-
export type { ITrie, ITrieNode, TrieOptions, TrieSearchResult
|
|
16
|
+
export type { ITrie, ITrieNode, TrieOptions, TrieSearchResult } from './trie';
|
|
17
17
|
export { RTree } from './rtree';
|
|
18
18
|
export type { IRTree, Rectangle, RTreeData, RTreeOptions, RTreeSearchResult, RTreeStats, } from './rtree';
|
|
19
19
|
export { DependencyGraph } from './dependency-graph';
|
|
@@ -21,9 +21,9 @@ export type { IDependencyGraph, NodeId, Dependency, DependencyGraphOptions, Topo
|
|
|
21
21
|
export { SuffixArray } from './suffix-array';
|
|
22
22
|
export type { ISuffixArray, SuffixArrayOptions, SuffixSearchResult, SuffixArrayStats, } from './suffix-array';
|
|
23
23
|
export { LRUCache } from './lru-cache';
|
|
24
|
-
export type { ILRUCache, LRUCacheOptions, CacheEntry, CacheStats
|
|
24
|
+
export type { ILRUCache, LRUCacheOptions, CacheEntry, CacheStats } from './lru-cache';
|
|
25
25
|
export { CommandStack } from './command-stack';
|
|
26
|
-
export type { ICommandStack, ICommand, ICommandStackOptions
|
|
26
|
+
export type { ICommandStack, ICommand, ICommandStackOptions } from './command-stack';
|
|
27
27
|
export { SegmentTree } from './segment-tree';
|
|
28
28
|
export type { ISegmentTree, SegmentTreeOptions, AggregateFunction, AggregationType, } from './segment-tree';
|
|
29
29
|
export { Aggregations, SegmentTreeUtils } from './segment-tree';
|
|
@@ -31,6 +31,6 @@ export { SkipList } from './skip-list';
|
|
|
31
31
|
export type { ISkipList, SkipListNode, SkipListOptions, RangeResult, SkipListStats, } from './skip-list';
|
|
32
32
|
export { defaultComparator, SkipListUtils } from './skip-list';
|
|
33
33
|
export { DisjointSet } from './disjoint-set';
|
|
34
|
-
export type { IDisjointSet, DisjointSetOptions, DisjointSetStats
|
|
34
|
+
export type { IDisjointSet, DisjointSetOptions, DisjointSetStats } from './disjoint-set';
|
|
35
35
|
export { DisjointSetUtils } from './disjoint-set';
|
|
36
36
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/data-structures/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/data-structures/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EAAE,oBAAoB,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAGhG,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,YAAY,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAGjF,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,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAG7E,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAClG,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,QAAQ,CAAC;AAG9E,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,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGtF,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAGrF,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,EAAE,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACzF,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC"}
|
|
@@ -30,112 +30,29 @@ export declare class IntervalTree<T> implements IIntervalTree<T> {
|
|
|
30
30
|
private readonly allowDuplicates;
|
|
31
31
|
private readonly comparator;
|
|
32
32
|
constructor(options?: IntervalTreeOptions);
|
|
33
|
-
/**
|
|
34
|
-
* Insert an interval
|
|
35
|
-
*/
|
|
36
33
|
insert(interval: Interval, data: T): IntervalData<T>;
|
|
37
|
-
private insertNode;
|
|
38
|
-
/**
|
|
39
|
-
* Delete an interval
|
|
40
|
-
*/
|
|
41
34
|
delete(intervalData: IntervalData<T>): boolean;
|
|
42
|
-
private deleteNode;
|
|
43
|
-
/**
|
|
44
|
-
* Delete by ID
|
|
45
|
-
*/
|
|
46
35
|
deleteById(id: string | number): boolean;
|
|
47
|
-
private findById;
|
|
48
|
-
/**
|
|
49
|
-
* Find all overlapping intervals
|
|
50
|
-
*/
|
|
51
36
|
search(interval: Interval): IntervalData<T>[];
|
|
52
|
-
private searchOverlap;
|
|
53
|
-
/**
|
|
54
|
-
* Find all intervals containing a point
|
|
55
|
-
*/
|
|
56
37
|
searchPoint(point: number): IntervalData<T>[];
|
|
57
|
-
/**
|
|
58
|
-
* Find all intervals contained within the given interval
|
|
59
|
-
*/
|
|
60
38
|
searchContained(interval: Interval): IntervalData<T>[];
|
|
61
|
-
private searchContainedHelper;
|
|
62
|
-
/**
|
|
63
|
-
* Find all intervals containing the given interval
|
|
64
|
-
*/
|
|
65
39
|
searchContaining(interval: Interval): IntervalData<T>[];
|
|
66
|
-
private searchContainingHelper;
|
|
67
|
-
/**
|
|
68
|
-
* Find minimum interval (by start time)
|
|
69
|
-
*/
|
|
70
40
|
findMin(): IntervalData<T> | undefined;
|
|
71
|
-
private findMinNode;
|
|
72
|
-
/**
|
|
73
|
-
* Find maximum interval (by max endpoint in tree)
|
|
74
|
-
*/
|
|
75
41
|
findMax(): IntervalData<T> | undefined;
|
|
76
|
-
private findMaxHelper;
|
|
77
|
-
/**
|
|
78
|
-
* Check if any interval overlaps
|
|
79
|
-
*/
|
|
80
42
|
hasOverlap(interval: Interval): boolean;
|
|
81
|
-
private hasOverlapHelper;
|
|
82
|
-
/**
|
|
83
|
-
* Get all intervals in sorted order
|
|
84
|
-
*/
|
|
85
43
|
inorder(): IntervalData<T>[];
|
|
86
|
-
private inorderHelper;
|
|
87
|
-
/**
|
|
88
|
-
* Iterate over all intervals
|
|
89
|
-
*/
|
|
90
44
|
forEach(callback: (interval: IntervalData<T>) => void): void;
|
|
91
|
-
private forEachHelper;
|
|
92
|
-
/**
|
|
93
|
-
* Filter intervals
|
|
94
|
-
*/
|
|
95
45
|
filter(predicate: (interval: IntervalData<T>) => boolean): IIntervalTree<T>;
|
|
96
|
-
/**
|
|
97
|
-
* Map intervals
|
|
98
|
-
*/
|
|
99
46
|
map<U>(mapper: (data: T, interval: Interval) => U): IIntervalTree<U>;
|
|
100
|
-
/**
|
|
101
|
-
* Clear the tree
|
|
102
|
-
*/
|
|
103
47
|
clear(): void;
|
|
104
|
-
/**
|
|
105
|
-
* Get tree size
|
|
106
|
-
*/
|
|
107
48
|
get size(): number;
|
|
108
|
-
/**
|
|
109
|
-
* Check if empty
|
|
110
|
-
*/
|
|
111
49
|
get isEmpty(): boolean;
|
|
112
|
-
/**
|
|
113
|
-
* Get tree height
|
|
114
|
-
*/
|
|
115
50
|
get height(): number;
|
|
116
|
-
private getHeight;
|
|
117
|
-
/**
|
|
118
|
-
* AVL balancing methods
|
|
119
|
-
*/
|
|
120
|
-
private balance;
|
|
121
|
-
private getBalanceFactor;
|
|
122
|
-
private rotateLeft;
|
|
123
|
-
private rotateRight;
|
|
124
|
-
/**
|
|
125
|
-
* Create IntervalTree from array of intervals
|
|
126
|
-
*/
|
|
127
51
|
static from<T>(intervals: Array<{
|
|
128
52
|
interval: Interval;
|
|
129
53
|
data: T;
|
|
130
54
|
}>, options?: IntervalTreeOptions): IntervalTree<T>;
|
|
131
|
-
/**
|
|
132
|
-
* Debug: Get tree structure as string
|
|
133
|
-
*/
|
|
134
55
|
toString(): string;
|
|
135
|
-
/**
|
|
136
|
-
* Debug: Validate tree structure
|
|
137
|
-
*/
|
|
138
56
|
validate(): boolean;
|
|
139
|
-
private validateNode;
|
|
140
57
|
}
|
|
141
58
|
//# sourceMappingURL=interval-tree.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"interval-tree.d.ts","sourceRoot":"","sources":["../../../../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;
|
|
1
|
+
{"version":3,"file":"interval-tree.d.ts","sourceRoot":"","sources":["../../../../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;AAqBnC;;;;;;;;;;;;;;;;;;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,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IA2BpD,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAY9C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO;IAQxC,MAAM,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAM7C,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAI7C,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAMtD,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAMvD,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS;IAKtC,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS;IAKtC,UAAU,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAIvC,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE;IAM5B,OAAO,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI;IAI5D,MAAM,CAAC,SAAS,EAAE,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC;IAQ3E,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,QAAQ,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;IAQpE,KAAK,IAAI,IAAI;IAMb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,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;IAIlB,QAAQ,IAAI,MAAM;IAIlB,QAAQ,IAAI,OAAO;CAGpB"}
|
|
@@ -0,0 +1,34 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Interval Tree Node
|
|
3
|
+
* Internal node structure for the interval tree
|
|
4
|
+
*/
|
|
5
|
+
import type { IntervalData } from './interval-tree.interface';
|
|
6
|
+
/**
|
|
7
|
+
* Internal tree node
|
|
8
|
+
* Each node stores an interval and the maximum endpoint in its subtree
|
|
9
|
+
*/
|
|
10
|
+
export declare class IntervalNode<T> {
|
|
11
|
+
interval: IntervalData<T>;
|
|
12
|
+
max: number;
|
|
13
|
+
left: IntervalNode<T> | null;
|
|
14
|
+
right: IntervalNode<T> | null;
|
|
15
|
+
height: number;
|
|
16
|
+
constructor(interval: IntervalData<T>);
|
|
17
|
+
}
|
|
18
|
+
/**
|
|
19
|
+
* Get height of a node (0 for null nodes)
|
|
20
|
+
*/
|
|
21
|
+
export declare function getHeight<T>(node: IntervalNode<T> | null): number;
|
|
22
|
+
/**
|
|
23
|
+
* Update max value for a node based on its interval and children
|
|
24
|
+
*/
|
|
25
|
+
export declare function updateMax<T>(node: IntervalNode<T>): void;
|
|
26
|
+
/**
|
|
27
|
+
* Update height for a node based on its children
|
|
28
|
+
*/
|
|
29
|
+
export declare function updateHeight<T>(node: IntervalNode<T>): void;
|
|
30
|
+
/**
|
|
31
|
+
* Find minimum node in a subtree (leftmost node)
|
|
32
|
+
*/
|
|
33
|
+
export declare function findMinNode<T>(node: IntervalNode<T> | null): IntervalNode<T> | null;
|
|
34
|
+
//# sourceMappingURL=node.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../../src/data-structures/interval-tree/node.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAE9D;;;GAGG;AACH,qBAAa,YAAY,CAAC,CAAC;IACzB,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAQ;IACpC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAQ;IACrC,MAAM,EAAE,MAAM,CAAK;gBAEP,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;CAItC;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAEjE;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAExD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAE3D;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAMnF"}
|
|
@@ -0,0 +1,34 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* AVL Tree Balancing Operations
|
|
3
|
+
* Handles tree balancing through rotations
|
|
4
|
+
*/
|
|
5
|
+
import { IntervalNode } from '../node';
|
|
6
|
+
/**
|
|
7
|
+
* Get balance factor of a node (left height - right height)
|
|
8
|
+
*/
|
|
9
|
+
export declare function getBalanceFactor<T>(node: IntervalNode<T>): number;
|
|
10
|
+
/**
|
|
11
|
+
* Left rotation
|
|
12
|
+
* Rotates the node to the left, making its right child the new root
|
|
13
|
+
*
|
|
14
|
+
* @param node - Node to rotate
|
|
15
|
+
* @returns New root after rotation
|
|
16
|
+
*/
|
|
17
|
+
export declare function rotateLeft<T>(node: IntervalNode<T>): IntervalNode<T>;
|
|
18
|
+
/**
|
|
19
|
+
* Right rotation
|
|
20
|
+
* Rotates the node to the right, making its left child the new root
|
|
21
|
+
*
|
|
22
|
+
* @param node - Node to rotate
|
|
23
|
+
* @returns New root after rotation
|
|
24
|
+
*/
|
|
25
|
+
export declare function rotateRight<T>(node: IntervalNode<T>): IntervalNode<T>;
|
|
26
|
+
/**
|
|
27
|
+
* Balance a node using AVL rotations
|
|
28
|
+
* Performs rotations based on balance factor to maintain AVL property
|
|
29
|
+
*
|
|
30
|
+
* @param node - Node to balance
|
|
31
|
+
* @returns Balanced node (may be a different node after rotation)
|
|
32
|
+
*/
|
|
33
|
+
export declare function balance<T>(node: IntervalNode<T>): IntervalNode<T>;
|
|
34
|
+
//# sourceMappingURL=balance.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"balance.d.ts","sourceRoot":"","sources":["../../../../../src/data-structures/interval-tree/operations/balance.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAsC,MAAM,SAAS,CAAC;AAE3E;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAEjE;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAcpE;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAcrE;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAwBjE"}
|