min-priority-queue-typed 2.4.5 → 2.5.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 +66 -0
- package/dist/cjs/index.cjs +400 -119
- package/dist/cjs/index.cjs.map +1 -1
- package/dist/cjs-legacy/index.cjs +399 -118
- package/dist/cjs-legacy/index.cjs.map +1 -1
- package/dist/esm/index.mjs +400 -119
- package/dist/esm/index.mjs.map +1 -1
- package/dist/esm-legacy/index.mjs +399 -118
- package/dist/esm-legacy/index.mjs.map +1 -1
- package/dist/types/data-structures/base/iterable-element-base.d.ts +1 -1
- package/dist/types/data-structures/binary-tree/avl-tree.d.ts +128 -51
- package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +210 -164
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +429 -78
- package/dist/types/data-structures/binary-tree/bst.d.ts +311 -28
- package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +212 -32
- package/dist/types/data-structures/binary-tree/segment-tree.d.ts +218 -152
- package/dist/types/data-structures/binary-tree/tree-map.d.ts +1281 -5
- package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +1087 -201
- package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +858 -65
- package/dist/types/data-structures/binary-tree/tree-set.d.ts +1133 -5
- package/dist/types/data-structures/graph/directed-graph.d.ts +219 -47
- package/dist/types/data-structures/graph/map-graph.d.ts +59 -1
- package/dist/types/data-structures/graph/undirected-graph.d.ts +204 -59
- package/dist/types/data-structures/hash/hash-map.d.ts +230 -77
- package/dist/types/data-structures/heap/heap.d.ts +287 -99
- package/dist/types/data-structures/heap/max-heap.d.ts +46 -0
- package/dist/types/data-structures/heap/min-heap.d.ts +59 -0
- package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +286 -44
- package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +278 -65
- package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +415 -12
- package/dist/types/data-structures/matrix/matrix.d.ts +331 -0
- package/dist/types/data-structures/priority-queue/max-priority-queue.d.ts +57 -0
- package/dist/types/data-structures/priority-queue/min-priority-queue.d.ts +60 -0
- package/dist/types/data-structures/priority-queue/priority-queue.d.ts +60 -0
- package/dist/types/data-structures/queue/deque.d.ts +272 -65
- package/dist/types/data-structures/queue/queue.d.ts +211 -42
- package/dist/types/data-structures/stack/stack.d.ts +174 -32
- package/dist/types/data-structures/trie/trie.d.ts +213 -43
- package/dist/types/types/data-structures/binary-tree/segment-tree.d.ts +1 -1
- package/dist/types/types/data-structures/linked-list/skip-linked-list.d.ts +1 -4
- package/dist/umd/max-priority-queue-typed.js +397 -116
- package/dist/umd/max-priority-queue-typed.js.map +1 -1
- package/dist/umd/max-priority-queue-typed.min.js +1 -1
- package/dist/umd/max-priority-queue-typed.min.js.map +1 -1
- package/package.json +2 -2
- package/src/data-structures/base/iterable-element-base.ts +4 -5
- package/src/data-structures/binary-tree/avl-tree.ts +134 -51
- package/src/data-structures/binary-tree/binary-indexed-tree.ts +302 -247
- package/src/data-structures/binary-tree/binary-tree.ts +429 -79
- package/src/data-structures/binary-tree/bst.ts +335 -34
- package/src/data-structures/binary-tree/red-black-tree.ts +290 -97
- package/src/data-structures/binary-tree/segment-tree.ts +372 -248
- package/src/data-structures/binary-tree/tree-map.ts +1284 -6
- package/src/data-structures/binary-tree/tree-multi-map.ts +1094 -211
- package/src/data-structures/binary-tree/tree-multi-set.ts +858 -65
- package/src/data-structures/binary-tree/tree-set.ts +1136 -9
- package/src/data-structures/graph/directed-graph.ts +219 -47
- package/src/data-structures/graph/map-graph.ts +59 -1
- package/src/data-structures/graph/undirected-graph.ts +204 -59
- package/src/data-structures/hash/hash-map.ts +230 -77
- package/src/data-structures/heap/heap.ts +287 -99
- package/src/data-structures/heap/max-heap.ts +46 -0
- package/src/data-structures/heap/min-heap.ts +59 -0
- package/src/data-structures/linked-list/doubly-linked-list.ts +286 -44
- package/src/data-structures/linked-list/singly-linked-list.ts +278 -65
- package/src/data-structures/linked-list/skip-linked-list.ts +689 -90
- package/src/data-structures/matrix/matrix.ts +416 -12
- package/src/data-structures/priority-queue/max-priority-queue.ts +57 -0
- package/src/data-structures/priority-queue/min-priority-queue.ts +60 -0
- package/src/data-structures/priority-queue/priority-queue.ts +60 -0
- package/src/data-structures/queue/deque.ts +272 -65
- package/src/data-structures/queue/queue.ts +211 -42
- package/src/data-structures/stack/stack.ts +174 -32
- package/src/data-structures/trie/trie.ts +213 -43
- package/src/types/data-structures/binary-tree/segment-tree.ts +1 -1
- package/src/types/data-structures/linked-list/skip-linked-list.ts +2 -1
package/README.md
CHANGED
|
@@ -34,6 +34,72 @@ yarn add min-priority-queue-typed
|
|
|
34
34
|
|
|
35
35
|
[//]: # (No deletion!!! Start of Example Replace Section)
|
|
36
36
|
|
|
37
|
+
### Shortest job first scheduling
|
|
38
|
+
```typescript
|
|
39
|
+
const jobs = new MinPriorityQueue<number>();
|
|
40
|
+
|
|
41
|
+
jobs.add(8); // 8 seconds
|
|
42
|
+
jobs.add(2); // 2 seconds
|
|
43
|
+
jobs.add(5); // 5 seconds
|
|
44
|
+
jobs.add(1); // 1 second
|
|
45
|
+
|
|
46
|
+
// Shortest job first
|
|
47
|
+
console.log(jobs.poll()); // 1;
|
|
48
|
+
console.log(jobs.poll()); // 2;
|
|
49
|
+
console.log(jobs.poll()); // 5;
|
|
50
|
+
console.log(jobs.poll()); // 8;
|
|
51
|
+
```
|
|
52
|
+
|
|
53
|
+
### Event-driven simulation with timestamps
|
|
54
|
+
```typescript
|
|
55
|
+
interface Event {
|
|
56
|
+
time: number;
|
|
57
|
+
action: string;
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
const timeline = new MinPriorityQueue<Event>([], {
|
|
61
|
+
comparator: (a, b) => a.time - b.time
|
|
62
|
+
});
|
|
63
|
+
|
|
64
|
+
timeline.add({ time: 300, action: 'Timeout' });
|
|
65
|
+
timeline.add({ time: 100, action: 'Request received' });
|
|
66
|
+
timeline.add({ time: 200, action: 'Processing done' });
|
|
67
|
+
timeline.add({ time: 150, action: 'Cache hit' });
|
|
68
|
+
|
|
69
|
+
const order = [];
|
|
70
|
+
while (timeline.size > 0) {
|
|
71
|
+
order.push(timeline.poll()!.action);
|
|
72
|
+
}
|
|
73
|
+
console.log(order); // [
|
|
74
|
+
// 'Request received',
|
|
75
|
+
// 'Cache hit',
|
|
76
|
+
// 'Processing done',
|
|
77
|
+
// 'Timeout'
|
|
78
|
+
// ];
|
|
79
|
+
```
|
|
80
|
+
|
|
81
|
+
### Huffman coding frequency selection
|
|
82
|
+
```typescript
|
|
83
|
+
// Character frequencies for Huffman tree building
|
|
84
|
+
const freq = new MinPriorityQueue<[number, string]>([], {
|
|
85
|
+
comparator: (a, b) => a[0] - b[0]
|
|
86
|
+
});
|
|
87
|
+
|
|
88
|
+
freq.add([5, 'a']);
|
|
89
|
+
freq.add([9, 'b']);
|
|
90
|
+
freq.add([12, 'c']);
|
|
91
|
+
freq.add([2, 'd']);
|
|
92
|
+
|
|
93
|
+
// Always pick two lowest frequencies
|
|
94
|
+
const first = freq.poll()!;
|
|
95
|
+
const second = freq.poll()!;
|
|
96
|
+
console.log(first[1]); // 'd'; // freq 2
|
|
97
|
+
console.log(second[1]); // 'a'; // freq 5
|
|
98
|
+
|
|
99
|
+
// Combined node goes back
|
|
100
|
+
freq.add([first[0] + second[0], first[1] + second[1]]);
|
|
101
|
+
console.log(freq.peek()![0]); // 7;
|
|
102
|
+
```
|
|
37
103
|
|
|
38
104
|
[//]: # (No deletion!!! End of Example Replace Section)
|
|
39
105
|
|