bunqueue 1.3.2 → 1.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 +114 -0
- package/dist/application/dlqManager.js +2 -2
- package/dist/application/dlqManager.js.map +1 -1
- package/dist/application/operations/ack.d.ts +2 -0
- package/dist/application/operations/ack.d.ts.map +1 -1
- package/dist/application/operations/ack.js +8 -1
- package/dist/application/operations/ack.js.map +1 -1
- package/dist/application/operations/jobManagement.js +1 -1
- package/dist/application/operations/jobManagement.js.map +1 -1
- package/dist/application/operations/push.js +2 -2
- package/dist/application/operations/push.js.map +1 -1
- package/dist/application/queueManager.d.ts +2 -0
- package/dist/application/queueManager.d.ts.map +1 -1
- package/dist/application/queueManager.js +28 -1
- package/dist/application/queueManager.js.map +1 -1
- package/dist/cli/dashboard.d.ts +32 -0
- package/dist/cli/dashboard.d.ts.map +1 -0
- package/dist/cli/dashboard.js +183 -0
- package/dist/cli/dashboard.js.map +1 -0
- package/dist/client/flow.d.ts +84 -0
- package/dist/client/flow.d.ts.map +1 -0
- package/dist/client/flow.js +169 -0
- package/dist/client/flow.js.map +1 -0
- package/dist/client/index.d.ts +3 -0
- package/dist/client/index.d.ts.map +1 -1
- package/dist/client/index.js +2 -0
- package/dist/client/index.js.map +1 -1
- package/dist/client/queue.d.ts +1 -1
- package/dist/client/queue.d.ts.map +1 -1
- package/dist/client/queue.js +36 -6
- package/dist/client/queue.js.map +1 -1
- package/dist/client/queueGroup.d.ts +41 -0
- package/dist/client/queueGroup.d.ts.map +1 -0
- package/dist/client/queueGroup.js +81 -0
- package/dist/client/queueGroup.js.map +1 -0
- package/dist/client/types.d.ts +9 -0
- package/dist/client/types.d.ts.map +1 -1
- package/dist/client/types.js.map +1 -1
- package/dist/domain/queue/shard.d.ts +22 -6
- package/dist/domain/queue/shard.d.ts.map +1 -1
- package/dist/domain/queue/shard.js +61 -45
- package/dist/domain/queue/shard.js.map +1 -1
- package/dist/domain/types/job.d.ts +19 -0
- package/dist/domain/types/job.d.ts.map +1 -1
- package/dist/domain/types/job.js +8 -0
- package/dist/domain/types/job.js.map +1 -1
- package/dist/infrastructure/persistence/sqlite.d.ts.map +1 -1
- package/dist/infrastructure/persistence/sqlite.js +1 -0
- package/dist/infrastructure/persistence/sqlite.js.map +1 -1
- package/dist/infrastructure/scheduler/cronScheduler.d.ts +8 -3
- package/dist/infrastructure/scheduler/cronScheduler.d.ts.map +1 -1
- package/dist/infrastructure/scheduler/cronScheduler.js +49 -26
- package/dist/infrastructure/scheduler/cronScheduler.js.map +1 -1
- package/dist/shared/lru.d.ts +24 -4
- package/dist/shared/lru.d.ts.map +1 -1
- package/dist/shared/lru.js +187 -66
- package/dist/shared/lru.js.map +1 -1
- package/dist/shared/skipList.d.ts +95 -0
- package/dist/shared/skipList.d.ts.map +1 -0
- package/dist/shared/skipList.js +277 -0
- package/dist/shared/skipList.js.map +1 -0
- package/package.json +1 -1
|
@@ -15,13 +15,16 @@ export type PushJobCallback = (queue: string, input: JobInput) => Promise<void>;
|
|
|
15
15
|
* Cron Scheduler
|
|
16
16
|
* Periodically checks and executes due cron jobs
|
|
17
17
|
* Optimized with min-heap for O(k log n) tick where k = due crons
|
|
18
|
+
* Uses lazy deletion with generation numbers for O(1) remove
|
|
18
19
|
*/
|
|
19
20
|
export declare class CronScheduler {
|
|
20
21
|
private readonly config;
|
|
21
|
-
/** Map for O(1) lookup by name */
|
|
22
|
+
/** Map for O(1) lookup by name with generation tracking */
|
|
22
23
|
private readonly cronJobs;
|
|
23
24
|
/** Min-heap ordered by nextRun for O(k log n) tick */
|
|
24
25
|
private readonly cronHeap;
|
|
26
|
+
/** Current generation counter */
|
|
27
|
+
private generation;
|
|
25
28
|
private checkInterval;
|
|
26
29
|
private pushJob;
|
|
27
30
|
constructor(config?: CronSchedulerConfig);
|
|
@@ -42,7 +45,8 @@ export declare class CronScheduler {
|
|
|
42
45
|
*/
|
|
43
46
|
add(input: CronJobInput): CronJob;
|
|
44
47
|
/**
|
|
45
|
-
* Remove a cron job
|
|
48
|
+
* Remove a cron job - O(1) with lazy deletion
|
|
49
|
+
* The heap entry becomes stale and will be skipped in tick()
|
|
46
50
|
*/
|
|
47
51
|
remove(name: string): boolean;
|
|
48
52
|
/**
|
|
@@ -60,11 +64,12 @@ export declare class CronScheduler {
|
|
|
60
64
|
/**
|
|
61
65
|
* Check and execute due cron jobs
|
|
62
66
|
* O(k log n) where k = number of due crons, instead of O(n) full scan
|
|
67
|
+
* Skips stale entries (lazy deletion) automatically
|
|
63
68
|
*/
|
|
64
69
|
private tick;
|
|
65
70
|
/**
|
|
66
71
|
* Get scheduler stats
|
|
67
|
-
* O(1) for nextRun using min-heap peek
|
|
72
|
+
* O(1) for nextRun using min-heap peek (skips stale entries)
|
|
68
73
|
*/
|
|
69
74
|
getStats(): {
|
|
70
75
|
total: number;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"cronScheduler.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/scheduler/cronScheduler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,YAAY,EAA4B,MAAM,yBAAyB,CAAC;AACpG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAUvD,mCAAmC;AACnC,MAAM,WAAW,mBAAmB;IAClC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAMD,6BAA6B;AAC7B,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;
|
|
1
|
+
{"version":3,"file":"cronScheduler.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/scheduler/cronScheduler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,YAAY,EAA4B,MAAM,yBAAyB,CAAC;AACpG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAUvD,mCAAmC;AACnC,MAAM,WAAW,mBAAmB;IAClC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAMD,6BAA6B;AAC7B,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;AAQhF;;;;;GAKG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgC;IACvD,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA4D;IACrF,sDAAsD;IACtD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyE;IAClG,iCAAiC;IACjC,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,aAAa,CAA+C;IACpE,OAAO,CAAC,OAAO,CAAgC;gBAEnC,MAAM,GAAE,mBAAwB;IAI5C;;OAEG;IACH,eAAe,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;IAIhD;;OAEG;IACH,KAAK,IAAI,IAAI;IAUb;;OAEG;IACH,IAAI,IAAI,IAAI;IAQZ;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO;IAoCjC;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAU7B;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAItC;;OAEG;IACH,IAAI,IAAI,OAAO,EAAE;IAIjB;;OAEG;IACH,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI;IAY5B;;;;OAIG;YACW,IAAI;IA2ElB;;;OAGG;IACH,QAAQ,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE;CA4BvE"}
|
|
@@ -14,13 +14,16 @@ const DEFAULT_CONFIG = {
|
|
|
14
14
|
* Cron Scheduler
|
|
15
15
|
* Periodically checks and executes due cron jobs
|
|
16
16
|
* Optimized with min-heap for O(k log n) tick where k = due crons
|
|
17
|
+
* Uses lazy deletion with generation numbers for O(1) remove
|
|
17
18
|
*/
|
|
18
19
|
export class CronScheduler {
|
|
19
20
|
config;
|
|
20
|
-
/** Map for O(1) lookup by name */
|
|
21
|
+
/** Map for O(1) lookup by name with generation tracking */
|
|
21
22
|
cronJobs = new Map();
|
|
22
23
|
/** Min-heap ordered by nextRun for O(k log n) tick */
|
|
23
|
-
cronHeap = new MinHeap((a, b) => a.nextRun - b.nextRun);
|
|
24
|
+
cronHeap = new MinHeap((a, b) => a.cron.nextRun - b.cron.nextRun);
|
|
25
|
+
/** Current generation counter */
|
|
26
|
+
generation = 0;
|
|
24
27
|
checkInterval = null;
|
|
25
28
|
pushJob = null;
|
|
26
29
|
constructor(config = {}) {
|
|
@@ -78,23 +81,24 @@ export class CronScheduler {
|
|
|
78
81
|
else {
|
|
79
82
|
nextRun = getNextIntervalRun(input.repeatEvery, now);
|
|
80
83
|
}
|
|
81
|
-
// Create cron job
|
|
84
|
+
// Create cron job with generation tracking
|
|
82
85
|
const cron = createCronJob(input, nextRun);
|
|
83
|
-
this.
|
|
84
|
-
this.
|
|
86
|
+
const gen = this.generation++;
|
|
87
|
+
this.cronJobs.set(cron.name, { cron, generation: gen });
|
|
88
|
+
this.cronHeap.push({ cron, generation: gen });
|
|
85
89
|
cronLog.info('Added job', { name: cron.name, nextRun: new Date(nextRun).toISOString() });
|
|
86
90
|
return cron;
|
|
87
91
|
}
|
|
88
92
|
/**
|
|
89
|
-
* Remove a cron job
|
|
93
|
+
* Remove a cron job - O(1) with lazy deletion
|
|
94
|
+
* The heap entry becomes stale and will be skipped in tick()
|
|
90
95
|
*/
|
|
91
96
|
remove(name) {
|
|
92
|
-
const
|
|
93
|
-
if (!
|
|
97
|
+
const entry = this.cronJobs.get(name);
|
|
98
|
+
if (!entry)
|
|
94
99
|
return false;
|
|
100
|
+
// Just remove from map - heap entry becomes stale (lazy deletion)
|
|
95
101
|
this.cronJobs.delete(name);
|
|
96
|
-
// Remove from heap - O(n) but rare operation
|
|
97
|
-
this.cronHeap.removeWhere((c) => c.name === name);
|
|
98
102
|
cronLog.info('Removed job', { name });
|
|
99
103
|
return true;
|
|
100
104
|
}
|
|
@@ -102,28 +106,32 @@ export class CronScheduler {
|
|
|
102
106
|
* Get a cron job by name
|
|
103
107
|
*/
|
|
104
108
|
get(name) {
|
|
105
|
-
return this.cronJobs.get(name);
|
|
109
|
+
return this.cronJobs.get(name)?.cron;
|
|
106
110
|
}
|
|
107
111
|
/**
|
|
108
112
|
* List all cron jobs
|
|
109
113
|
*/
|
|
110
114
|
list() {
|
|
111
|
-
return Array.from(this.cronJobs.values());
|
|
115
|
+
return Array.from(this.cronJobs.values()).map((e) => e.cron);
|
|
112
116
|
}
|
|
113
117
|
/**
|
|
114
118
|
* Load cron jobs from storage
|
|
115
119
|
*/
|
|
116
120
|
load(crons) {
|
|
121
|
+
const entries = [];
|
|
117
122
|
for (const cron of crons) {
|
|
118
|
-
this.
|
|
123
|
+
const gen = this.generation++;
|
|
124
|
+
this.cronJobs.set(cron.name, { cron, generation: gen });
|
|
125
|
+
entries.push({ cron, generation: gen });
|
|
119
126
|
}
|
|
120
127
|
// Rebuild heap from loaded crons - O(n)
|
|
121
|
-
this.cronHeap.buildFrom(
|
|
128
|
+
this.cronHeap.buildFrom(entries);
|
|
122
129
|
cronLog.info('Loaded jobs', { count: crons.length });
|
|
123
130
|
}
|
|
124
131
|
/**
|
|
125
132
|
* Check and execute due cron jobs
|
|
126
133
|
* O(k log n) where k = number of due crons, instead of O(n) full scan
|
|
134
|
+
* Skips stale entries (lazy deletion) automatically
|
|
127
135
|
*/
|
|
128
136
|
async tick() {
|
|
129
137
|
if (!this.pushJob)
|
|
@@ -133,11 +141,18 @@ export class CronScheduler {
|
|
|
133
141
|
const toRemove = [];
|
|
134
142
|
// Process only due crons from heap - O(k log n)
|
|
135
143
|
while (!this.cronHeap.isEmpty) {
|
|
136
|
-
const
|
|
137
|
-
if (!
|
|
144
|
+
const entry = this.cronHeap.peek();
|
|
145
|
+
if (!entry || entry.cron.nextRun > now)
|
|
138
146
|
break;
|
|
139
147
|
// Remove from heap
|
|
140
148
|
this.cronHeap.pop();
|
|
149
|
+
// Check if stale (cron was removed or updated)
|
|
150
|
+
const current = this.cronJobs.get(entry.cron.name);
|
|
151
|
+
if (current?.generation !== entry.generation) {
|
|
152
|
+
// Stale entry, skip
|
|
153
|
+
continue;
|
|
154
|
+
}
|
|
155
|
+
const cron = entry.cron;
|
|
141
156
|
// Check if at limit
|
|
142
157
|
if (isAtLimit(cron)) {
|
|
143
158
|
cronLog.info('Job reached execution limit', { name: cron.name });
|
|
@@ -160,8 +175,8 @@ export class CronScheduler {
|
|
|
160
175
|
else if (cron.repeatEvery) {
|
|
161
176
|
cron.nextRun = getNextIntervalRun(cron.repeatEvery, now);
|
|
162
177
|
}
|
|
163
|
-
// Re-insert with
|
|
164
|
-
toReinsert.push(
|
|
178
|
+
// Re-insert with same generation (not stale)
|
|
179
|
+
toReinsert.push(entry);
|
|
165
180
|
cronLog.info('Executed job', {
|
|
166
181
|
name: cron.name,
|
|
167
182
|
executions: cron.executions,
|
|
@@ -171,12 +186,12 @@ export class CronScheduler {
|
|
|
171
186
|
catch (err) {
|
|
172
187
|
cronLog.error('Failed to execute job', { name: cron.name, error: String(err) });
|
|
173
188
|
// Re-insert even on failure to retry next tick
|
|
174
|
-
toReinsert.push(
|
|
189
|
+
toReinsert.push(entry);
|
|
175
190
|
}
|
|
176
191
|
}
|
|
177
192
|
// Re-insert processed crons with updated nextRun
|
|
178
|
-
for (const
|
|
179
|
-
this.cronHeap.push(
|
|
193
|
+
for (const entry of toReinsert) {
|
|
194
|
+
this.cronHeap.push(entry);
|
|
180
195
|
}
|
|
181
196
|
// Remove limit-reached crons from map
|
|
182
197
|
for (const name of toRemove) {
|
|
@@ -185,15 +200,23 @@ export class CronScheduler {
|
|
|
185
200
|
}
|
|
186
201
|
/**
|
|
187
202
|
* Get scheduler stats
|
|
188
|
-
* O(1) for nextRun using min-heap peek
|
|
203
|
+
* O(1) for nextRun using min-heap peek (skips stale entries)
|
|
189
204
|
*/
|
|
190
205
|
getStats() {
|
|
191
|
-
//
|
|
192
|
-
|
|
193
|
-
|
|
206
|
+
// Find first non-stale entry for nextRun
|
|
207
|
+
let nextRun = null;
|
|
208
|
+
// Peek and skip stale entries to find valid nextRun
|
|
209
|
+
// This is typically O(1) as stale entries are cleaned during tick()
|
|
210
|
+
const entry = this.cronHeap.peek();
|
|
211
|
+
if (entry) {
|
|
212
|
+
const current = this.cronJobs.get(entry.cron.name);
|
|
213
|
+
if (current?.generation === entry.generation && !isAtLimit(entry.cron)) {
|
|
214
|
+
nextRun = entry.cron.nextRun;
|
|
215
|
+
}
|
|
216
|
+
}
|
|
194
217
|
// Count pending (crons not at limit) - still O(n) but called rarely
|
|
195
218
|
let pending = 0;
|
|
196
|
-
for (const cron of this.cronJobs.values()) {
|
|
219
|
+
for (const { cron } of this.cronJobs.values()) {
|
|
197
220
|
if (!isAtLimit(cron)) {
|
|
198
221
|
pending++;
|
|
199
222
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"cronScheduler.js","sourceRoot":"","sources":["../../../src/infrastructure/scheduler/cronScheduler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAmC,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpG,OAAO,EACL,sBAAsB,EACtB,cAAc,EACd,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAO/C,MAAM,cAAc,GAAkC;IACpD,eAAe,EAAE,IAAI;CACtB,CAAC;
|
|
1
|
+
{"version":3,"file":"cronScheduler.js","sourceRoot":"","sources":["../../../src/infrastructure/scheduler/cronScheduler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAmC,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpG,OAAO,EACL,sBAAsB,EACtB,cAAc,EACd,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAO/C,MAAM,cAAc,GAAkC;IACpD,eAAe,EAAE,IAAI;CACtB,CAAC;AAWF;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IACP,MAAM,CAAgC;IACvD,2DAA2D;IAC1C,QAAQ,GAAG,IAAI,GAAG,EAAiD,CAAC;IACrF,sDAAsD;IACrC,QAAQ,GAAG,IAAI,OAAO,CAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClG,iCAAiC;IACzB,UAAU,GAAG,CAAC,CAAC;IACf,aAAa,GAA0C,IAAI,CAAC;IAC5D,OAAO,GAA2B,IAAI,CAAC;IAE/C,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,QAAyB;QACvC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO;QAE/B,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE;YACpC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAEhC,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC5B,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAmB;QACrB,WAAW;QACX,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QACvE,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,KAAK,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;YAC/C,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,IAAI,KAAK,CAAC,4BAA4B,KAAK,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,OAAe,CAAC;QAEpB,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpD,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,WAAY,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,2CAA2C;QAC3C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAE9C,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QAEzF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QAEzB,kEAAkE;QAClE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAgB;QACnB,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;YACxD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,wCAAwC;QACxC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACvD,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,IAAI;QAChB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO;QAE1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,UAAU,GAAoB,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,gDAAgD;QAChD,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,GAAG;gBAAE,MAAM;YAE9C,mBAAmB;YACnB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;YAEpB,+CAA+C;YAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,OAAO,EAAE,UAAU,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;gBAC7C,oBAAoB;gBACpB,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YAExB,oBAAoB;YACpB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,6BAA6B,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBACjE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,eAAe;gBACf,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE;oBAC7B,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;iBACxB,CAAC,CAAC;gBAEH,yBAAyB;gBACzB,IAAI,CAAC,UAAU,EAAE,CAAC;gBAElB,qBAAqB;gBACrB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACnD,IAAI,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;gBAC/C,CAAC;qBAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;oBAC5B,IAAI,CAAC,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;gBAC3D,CAAC;gBAED,6CAA6C;gBAC7C,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAEvB,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE;oBAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE;iBAC9C,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,OAAO,CAAC,KAAK,CAAC,uBAAuB,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAChF,+CAA+C;gBAC/C,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,yCAAyC;QACzC,IAAI,OAAO,GAAkB,IAAI,CAAC;QAElC,oDAAoD;QACpD,oEAAoE;QACpE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,OAAO,EAAE,UAAU,KAAK,KAAK,CAAC,UAAU,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvE,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YACzB,OAAO;YACP,OAAO;SACR,CAAC;IACJ,CAAC;CACF"}
|
package/dist/shared/lru.d.ts
CHANGED
|
@@ -21,12 +21,22 @@ export interface SetLike<T> {
|
|
|
21
21
|
}
|
|
22
22
|
/**
|
|
23
23
|
* LRU Map - automatically evicts least recently used entries
|
|
24
|
+
* Optimized with doubly-linked list for O(1) move-to-front
|
|
25
|
+
* without delete+re-insert overhead
|
|
24
26
|
*/
|
|
25
27
|
export declare class LRUMap<K, V> implements MapLike<K, V> {
|
|
26
28
|
private readonly cache;
|
|
27
29
|
private readonly maxSize;
|
|
28
30
|
private readonly onEvict?;
|
|
31
|
+
private head;
|
|
32
|
+
private tail;
|
|
29
33
|
constructor(maxSize: number, onEvict?: (key: K, value: V) => void);
|
|
34
|
+
/** Move node to front (most recently used) - O(1) */
|
|
35
|
+
private moveToFront;
|
|
36
|
+
/** Remove node from list - O(1) */
|
|
37
|
+
private removeNode;
|
|
38
|
+
/** Add node to front - O(1) */
|
|
39
|
+
private addToFront;
|
|
30
40
|
get(key: K): V | undefined;
|
|
31
41
|
set(key: K, value: V): void;
|
|
32
42
|
has(key: K): boolean;
|
|
@@ -41,12 +51,21 @@ export declare class LRUMap<K, V> implements MapLike<K, V> {
|
|
|
41
51
|
}
|
|
42
52
|
/**
|
|
43
53
|
* LRU Set - automatically evicts least recently used entries
|
|
54
|
+
* Optimized with doubly-linked list for O(1) move-to-front
|
|
44
55
|
*/
|
|
45
56
|
export declare class LRUSet<T> implements SetLike<T> {
|
|
46
57
|
private readonly cache;
|
|
47
58
|
private readonly maxSize;
|
|
48
59
|
private readonly onEvict?;
|
|
60
|
+
private head;
|
|
61
|
+
private tail;
|
|
49
62
|
constructor(maxSize: number, onEvict?: (value: T) => void);
|
|
63
|
+
/** Move node to front - O(1) */
|
|
64
|
+
private moveToFront;
|
|
65
|
+
/** Remove node from list - O(1) */
|
|
66
|
+
private removeNode;
|
|
67
|
+
/** Add node to front - O(1) */
|
|
68
|
+
private addToFront;
|
|
50
69
|
add(value: T): void;
|
|
51
70
|
has(value: T): boolean;
|
|
52
71
|
delete(value: T): boolean;
|
|
@@ -105,22 +124,23 @@ export declare class BoundedMap<K, V> implements MapLike<K, V> {
|
|
|
105
124
|
}
|
|
106
125
|
/**
|
|
107
126
|
* TTL Map - entries expire after timeout
|
|
108
|
-
* Optimized with
|
|
127
|
+
* Optimized with MinHeap for O(log n) insert and O(k) cleanup
|
|
109
128
|
*/
|
|
110
129
|
export declare class TTLMap<K, V> {
|
|
111
130
|
private readonly cache;
|
|
112
131
|
private readonly ttlMs;
|
|
113
132
|
private cleanupInterval;
|
|
114
133
|
/**
|
|
115
|
-
* Expiry heap:
|
|
116
|
-
*
|
|
134
|
+
* Expiry heap: MinHeap of (expiresAt, key) for efficient cleanup
|
|
135
|
+
* O(log n) insert instead of O(n) with array splice
|
|
117
136
|
*/
|
|
118
137
|
private readonly expiryHeap;
|
|
119
138
|
constructor(ttlMs: number, cleanupIntervalMs?: number);
|
|
120
139
|
private startCleanup;
|
|
121
|
-
/** O(k) cleanup where k = expired entries
|
|
140
|
+
/** O(k log n) cleanup where k = expired entries */
|
|
122
141
|
private cleanup;
|
|
123
142
|
get(key: K): V | undefined;
|
|
143
|
+
/** O(log n) insert with MinHeap instead of O(n) with array splice */
|
|
124
144
|
set(key: K, value: V, ttlMs?: number): void;
|
|
125
145
|
has(key: K): boolean;
|
|
126
146
|
delete(key: K): boolean;
|
package/dist/shared/lru.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"lru.d.ts","sourceRoot":"","sources":["../../src/shared/lru.ts"],"names":[],"mappings":"AAAA;;;GAGG;
|
|
1
|
+
{"version":3,"file":"lru.d.ts","sourceRoot":"","sources":["../../src/shared/lru.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,+CAA+C;AAC/C,MAAM,WAAW,OAAO,CAAC,CAAC,EAAE,CAAC;IAC3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACrB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACxB,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,+CAA+C;AAC/C,MAAM,WAAW,OAAO,CAAC,CAAC;IACxB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACpB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IACvB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAC1B,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAUD;;;;GAIG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAA6B;IAGtD,OAAO,CAAC,IAAI,CAA8B;IAC1C,OAAO,CAAC,IAAI,CAA8B;gBAE9B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI;IAKjE,qDAAqD;IACrD,OAAO,CAAC,WAAW;IAgBnB,mCAAmC;IACnC,OAAO,CAAC,UAAU;IAOlB,+BAA+B;IAC/B,OAAO,CAAC,UAAU;IAQlB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAS1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAuB3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAQvB,KAAK,IAAI,IAAI;IAMb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAEA,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS7B,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IASpC,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IASnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG9C;AASD;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAqB;IAG9C,OAAO,CAAC,IAAI,CAA8B;IAC1C,OAAO,CAAC,IAAI,CAA8B;gBAE9B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI;IAKzD,gCAAgC;IAChC,OAAO,CAAC,WAAW;IAcnB,mCAAmC;IACnC,OAAO,CAAC,UAAU;IAOlB,+BAA+B;IAC/B,OAAO,CAAC,UAAU;IAQlB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAsBnB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAQzB,KAAK,IAAI,IAAI;IAMb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAEA,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS9B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAGzC;AAED;;;;GAIG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,CAAC;IAC9C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgB;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAqB;IAC9C,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI;IAMzD,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAWnB,uEAAuE;IACvE,OAAO,CAAC,UAAU;IAclB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAIzB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAGzC;AAED;;;;GAIG;AACH,qBAAa,UAAU,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAA6B;IACtD,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI;IAMjE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAc3B,uEAAuE;IACvE,OAAO,CAAC,UAAU;IAclB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAInC,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAInD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG9C;AAED;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiD;IACvE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,eAAe,CAA+C;IAEtE;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAEzB;gBAEU,KAAK,EAAE,MAAM,EAAE,iBAAiB,GAAE,MAAe;IAK7D,OAAO,CAAC,YAAY;IAMpB,mDAAmD;IACnD,OAAO,CAAC,OAAO;IAmBf,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAU1B,qEAAqE;IACrE,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAQ3C,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAKvB,KAAK,IAAI,IAAI;IAKb,IAAI,IAAI,IAAI;IAOZ,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF"}
|