@hyperttp/queue 1.0.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/LICENSE +21 -0
- package/README.md +1 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +3 -0
- package/dist/index.js.map +1 -0
- package/dist/plugin.d.ts +14 -0
- package/dist/plugin.d.ts.map +1 -0
- package/dist/plugin.js +24 -0
- package/dist/plugin.js.map +1 -0
- package/dist/types/queue.d.ts +16 -0
- package/dist/types/queue.d.ts.map +1 -0
- package/dist/types/queue.js +2 -0
- package/dist/types/queue.js.map +1 -0
- package/dist/utils/QueueManager.d.ts +27 -0
- package/dist/utils/QueueManager.d.ts.map +1 -0
- package/dist/utils/QueueManager.js +120 -0
- package/dist/utils/QueueManager.js.map +1 -0
- package/package.json +25 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 IT IF OR
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
# hyperttp-queue
|
package/dist/index.d.ts
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACrD,cAAc,yBAAyB,CAAC;AACxC,mBAAmB,kBAAkB,CAAC"}
|
package/dist/index.js
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACrD,cAAc,yBAAyB,CAAC"}
|
package/dist/plugin.d.ts
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
import type { HyperCore, HyperPlugin } from "@hyperttp/core";
|
|
2
|
+
export declare function withQueue(client: HyperCore, maxConcurrent: number): HyperCore;
|
|
3
|
+
declare module "@hyperttp/core" {
|
|
4
|
+
interface HyperttpPluginsExtension {
|
|
5
|
+
queue?: {
|
|
6
|
+
enabled?: boolean;
|
|
7
|
+
};
|
|
8
|
+
network?: {
|
|
9
|
+
maxConcurrent?: number;
|
|
10
|
+
};
|
|
11
|
+
}
|
|
12
|
+
}
|
|
13
|
+
export declare const QueuePlugin: HyperPlugin;
|
|
14
|
+
//# sourceMappingURL=plugin.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"plugin.d.ts","sourceRoot":"","sources":["../src/plugin.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,WAAW,EAGZ,MAAM,gBAAgB,CAAC;AAGxB,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,GAAG,SAAS,CAgB7E;AAED,OAAO,QAAQ,gBAAgB,CAAC;IAC9B,UAAU,wBAAwB;QAChC,KAAK,CAAC,EAAE;YAAE,OAAO,CAAC,EAAE,OAAO,CAAA;SAAE,CAAC;QAC9B,OAAO,CAAC,EAAE;YAAE,aAAa,CAAC,EAAE,MAAM,CAAA;SAAE,CAAC;KACtC;CACF;AAED,eAAO,MAAM,WAAW,EAAE,WAOzB,CAAC"}
|
package/dist/plugin.js
ADDED
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
import { QueueManager } from "./utils/QueueManager.js";
|
|
2
|
+
export function withQueue(client, maxConcurrent) {
|
|
3
|
+
const queue = new QueueManager(maxConcurrent);
|
|
4
|
+
const next = client.dispatch;
|
|
5
|
+
const originalGetStats = client.getStats.bind(client);
|
|
6
|
+
client.getStats = () => ({
|
|
7
|
+
...originalGetStats(),
|
|
8
|
+
queuedRequests: queue.queuedCount,
|
|
9
|
+
activeRequests: queue.activeCount,
|
|
10
|
+
});
|
|
11
|
+
client.dispatch = (req) => {
|
|
12
|
+
return queue.enqueue(() => next(req));
|
|
13
|
+
};
|
|
14
|
+
return client;
|
|
15
|
+
}
|
|
16
|
+
export const QueuePlugin = {
|
|
17
|
+
name: "hyperttp-queue",
|
|
18
|
+
phase: "CONTROL",
|
|
19
|
+
enabled: (config) => !!config.queue?.enabled,
|
|
20
|
+
apply: (client, config) => {
|
|
21
|
+
return withQueue(client, config.network?.maxConcurrent || 500);
|
|
22
|
+
},
|
|
23
|
+
};
|
|
24
|
+
//# sourceMappingURL=plugin.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"plugin.js","sourceRoot":"","sources":["../src/plugin.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAEvD,MAAM,UAAU,SAAS,CAAC,MAAiB,EAAE,aAAqB;IAChE,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC;IAC7B,MAAM,gBAAgB,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEtD,MAAM,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC;QACvB,GAAG,gBAAgB,EAAE;QACrB,cAAc,EAAE,KAAK,CAAC,WAAW;QACjC,cAAc,EAAE,KAAK,CAAC,WAAW;KAClC,CAAC,CAAC;IAEH,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAoB,EAAE,EAAE;QACzC,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC;AASD,MAAM,CAAC,MAAM,WAAW,GAAgB;IACtC,IAAI,EAAE,gBAAgB;IACtB,KAAK,EAAE,SAAS;IAChB,OAAO,EAAE,CAAC,MAAyB,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO;IAC/D,KAAK,EAAE,CAAC,MAAiB,EAAE,MAAyB,EAAE,EAAE;QACtD,OAAO,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,EAAE,aAAa,IAAI,GAAG,CAAC,CAAC;IACjE,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
export interface QueueOptions {
|
|
2
|
+
/**
|
|
3
|
+
* @ru Включить очередь запросов
|
|
4
|
+
* @en Enable request queue
|
|
5
|
+
*/
|
|
6
|
+
enabled?: boolean;
|
|
7
|
+
}
|
|
8
|
+
export type Executor<T> = () => Promise<T>;
|
|
9
|
+
export interface QueueNode {
|
|
10
|
+
executor: () => Promise<unknown>;
|
|
11
|
+
resolve: (value: unknown) => void;
|
|
12
|
+
reject: (reason?: unknown) => void;
|
|
13
|
+
next: QueueNode | null;
|
|
14
|
+
}
|
|
15
|
+
export type Scheduler = (cb: () => void) => void;
|
|
16
|
+
//# sourceMappingURL=queue.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../../src/types/queue.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;AAE3C,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;IACjC,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IAClC,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,OAAO,KAAK,IAAI,CAAC;IACnC,IAAI,EAAE,SAAS,GAAG,IAAI,CAAC;CACxB;AAED,MAAM,MAAM,SAAS,GAAG,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/types/queue.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
import type { Executor } from "../types/queue.js";
|
|
2
|
+
export declare class QueueManager {
|
|
3
|
+
private running;
|
|
4
|
+
private queued;
|
|
5
|
+
private head;
|
|
6
|
+
private tail;
|
|
7
|
+
private _maxConcurrent;
|
|
8
|
+
private pool;
|
|
9
|
+
private poolSize;
|
|
10
|
+
private readonly maxPoolSize;
|
|
11
|
+
constructor(maxConcurrent?: number);
|
|
12
|
+
get maxConcurrent(): number;
|
|
13
|
+
set maxConcurrent(value: number);
|
|
14
|
+
enqueue<T>(executor: Executor<T>): Promise<T>;
|
|
15
|
+
clear(reason?: Error): void;
|
|
16
|
+
private drain;
|
|
17
|
+
private executeTask;
|
|
18
|
+
private handleSuccess;
|
|
19
|
+
private handleError;
|
|
20
|
+
private releaseNode;
|
|
21
|
+
get activeCount(): number;
|
|
22
|
+
get queuedCount(): number;
|
|
23
|
+
get pending(): number;
|
|
24
|
+
get isIdle(): boolean;
|
|
25
|
+
get hasCapacity(): boolean;
|
|
26
|
+
}
|
|
27
|
+
//# sourceMappingURL=QueueManager.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"QueueManager.d.ts","sourceRoot":"","sources":["../../src/utils/QueueManager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAa,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAE7D,qBAAa,YAAY;IACvB,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,MAAM,CAAK;IAEnB,OAAO,CAAC,IAAI,CAA0B;IACtC,OAAO,CAAC,IAAI,CAA0B;IAEtC,OAAO,CAAC,cAAc,CAAS;IAE/B,OAAO,CAAC,IAAI,CAAmB;IAC/B,OAAO,CAAC,QAAQ,CAAK;IACrB,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;gBAEzB,aAAa,SAAK;IAI9B,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,IAAI,aAAa,CAAC,KAAK,EAAE,MAAM,EAG9B;IAED,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAkC7C,KAAK,CAAC,MAAM,QAAsC,GAAG,IAAI;IAezD,OAAO,CAAC,KAAK;IAgBb,OAAO,CAAC,WAAW;IAWnB,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,WAAW;IAWnB,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,OAAO,IAAI,MAAM,CAEpB;IAED,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,IAAI,WAAW,IAAI,OAAO,CAEzB;CACF"}
|
|
@@ -0,0 +1,120 @@
|
|
|
1
|
+
export class QueueManager {
|
|
2
|
+
running = 0;
|
|
3
|
+
queued = 0;
|
|
4
|
+
head = null;
|
|
5
|
+
tail = null;
|
|
6
|
+
_maxConcurrent;
|
|
7
|
+
pool = [];
|
|
8
|
+
poolSize = 0;
|
|
9
|
+
maxPoolSize = 10000;
|
|
10
|
+
constructor(maxConcurrent = 50) {
|
|
11
|
+
this._maxConcurrent = Math.max(1, Math.floor(maxConcurrent));
|
|
12
|
+
}
|
|
13
|
+
get maxConcurrent() {
|
|
14
|
+
return this._maxConcurrent;
|
|
15
|
+
}
|
|
16
|
+
set maxConcurrent(value) {
|
|
17
|
+
this._maxConcurrent = Math.max(1, Math.floor(value));
|
|
18
|
+
this.drain();
|
|
19
|
+
}
|
|
20
|
+
enqueue(executor) {
|
|
21
|
+
return new Promise((resolve, reject) => {
|
|
22
|
+
let node;
|
|
23
|
+
if (this.poolSize > 0) {
|
|
24
|
+
node = this.pool[--this.poolSize];
|
|
25
|
+
node.executor = executor;
|
|
26
|
+
node.resolve = resolve;
|
|
27
|
+
node.reject = reject;
|
|
28
|
+
node.next = null;
|
|
29
|
+
}
|
|
30
|
+
else {
|
|
31
|
+
node = {
|
|
32
|
+
executor: executor,
|
|
33
|
+
resolve: resolve,
|
|
34
|
+
reject,
|
|
35
|
+
next: null,
|
|
36
|
+
};
|
|
37
|
+
}
|
|
38
|
+
if (this.tail !== null) {
|
|
39
|
+
this.tail.next = node;
|
|
40
|
+
}
|
|
41
|
+
else {
|
|
42
|
+
this.head = node;
|
|
43
|
+
}
|
|
44
|
+
this.tail = node;
|
|
45
|
+
this.queued++;
|
|
46
|
+
if (this.running < this._maxConcurrent) {
|
|
47
|
+
this.drain();
|
|
48
|
+
}
|
|
49
|
+
});
|
|
50
|
+
}
|
|
51
|
+
clear(reason = new Error("Queue has been cleared")) {
|
|
52
|
+
let current = this.head;
|
|
53
|
+
this.head = null;
|
|
54
|
+
this.tail = null;
|
|
55
|
+
this.queued = 0;
|
|
56
|
+
while (current !== null) {
|
|
57
|
+
current.reject(reason);
|
|
58
|
+
const next = current.next;
|
|
59
|
+
this.releaseNode(current);
|
|
60
|
+
current = next;
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
drain() {
|
|
64
|
+
while (this.running < this._maxConcurrent && this.head !== null) {
|
|
65
|
+
const task = this.head;
|
|
66
|
+
this.head = task.next;
|
|
67
|
+
if (this.head === null) {
|
|
68
|
+
this.tail = null;
|
|
69
|
+
}
|
|
70
|
+
this.queued--;
|
|
71
|
+
this.running++;
|
|
72
|
+
this.executeTask(task);
|
|
73
|
+
}
|
|
74
|
+
}
|
|
75
|
+
executeTask(task) {
|
|
76
|
+
try {
|
|
77
|
+
task.executor().then((val) => this.handleSuccess(task, val), (err) => this.handleError(task, err));
|
|
78
|
+
}
|
|
79
|
+
catch (e) {
|
|
80
|
+
this.handleError(task, e);
|
|
81
|
+
}
|
|
82
|
+
}
|
|
83
|
+
handleSuccess(task, val) {
|
|
84
|
+
this.running--;
|
|
85
|
+
task.resolve(val);
|
|
86
|
+
this.releaseNode(task);
|
|
87
|
+
this.drain();
|
|
88
|
+
}
|
|
89
|
+
handleError(task, err) {
|
|
90
|
+
this.running--;
|
|
91
|
+
task.reject(err);
|
|
92
|
+
this.releaseNode(task);
|
|
93
|
+
this.drain();
|
|
94
|
+
}
|
|
95
|
+
releaseNode(node) {
|
|
96
|
+
node.executor = null;
|
|
97
|
+
node.resolve = null;
|
|
98
|
+
node.reject = null;
|
|
99
|
+
node.next = null;
|
|
100
|
+
if (this.poolSize < this.maxPoolSize) {
|
|
101
|
+
this.pool[this.poolSize++] = node;
|
|
102
|
+
}
|
|
103
|
+
}
|
|
104
|
+
get activeCount() {
|
|
105
|
+
return this.running;
|
|
106
|
+
}
|
|
107
|
+
get queuedCount() {
|
|
108
|
+
return this.queued;
|
|
109
|
+
}
|
|
110
|
+
get pending() {
|
|
111
|
+
return this.running + this.queued;
|
|
112
|
+
}
|
|
113
|
+
get isIdle() {
|
|
114
|
+
return this.running === 0 && this.head === null;
|
|
115
|
+
}
|
|
116
|
+
get hasCapacity() {
|
|
117
|
+
return this.running < this._maxConcurrent;
|
|
118
|
+
}
|
|
119
|
+
}
|
|
120
|
+
//# sourceMappingURL=QueueManager.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"QueueManager.js","sourceRoot":"","sources":["../../src/utils/QueueManager.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,YAAY;IACf,OAAO,GAAG,CAAC,CAAC;IACZ,MAAM,GAAG,CAAC,CAAC;IAEX,IAAI,GAAqB,IAAI,CAAC;IAC9B,IAAI,GAAqB,IAAI,CAAC;IAE9B,cAAc,CAAS;IAEvB,IAAI,GAAgB,EAAE,CAAC;IACvB,QAAQ,GAAG,CAAC,CAAC;IACJ,WAAW,GAAG,KAAK,CAAC;IAErC,YAAY,aAAa,GAAG,EAAE;QAC5B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED,IAAI,aAAa,CAAC,KAAa;QAC7B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,OAAO,CAAI,QAAqB;QAC9B,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,IAAe,CAAC;YAEpB,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,CAAC,QAAQ,GAAG,QAAkC,CAAC;gBACnD,IAAI,CAAC,OAAO,GAAG,OAAmC,CAAC;gBACnD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG;oBACL,QAAQ,EAAE,QAAkC;oBAC5C,OAAO,EAAE,OAAmC;oBAC5C,MAAM;oBACN,IAAI,EAAE,IAAI;iBACX,CAAC;YACJ,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACnB,CAAC;YAED,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;YAEd,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,wBAAwB,CAAC;QAChD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAEhB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC1B,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,KAAK;QACX,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAEtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACnB,CAAC;YAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,CAAC,OAAO,EAAE,CAAC;YAEf,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,IAAe;QACjC,IAAI,CAAC;YACH,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAClB,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,EACtC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CACrC,CAAC;QACJ,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAEO,aAAa,CAAC,IAAe,EAAE,GAAY;QACjD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAEO,WAAW,CAAC,IAAe,EAAE,GAAY;QAC/C,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAEO,WAAW,CAAC,IAAe;QACjC,IAAI,CAAC,QAAQ,GAAG,IAAK,CAAC;QACtB,IAAI,CAAC,OAAO,GAAG,IAAK,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,IAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEjB,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;QACpC,CAAC;IACH,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IACpC,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAClD,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC;IAC5C,CAAC;CACF"}
|
package/package.json
ADDED
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
{
|
|
2
|
+
"name": "@hyperttp/queue",
|
|
3
|
+
"version": "1.0.0",
|
|
4
|
+
"type": "module",
|
|
5
|
+
"main": "./dist/index.js",
|
|
6
|
+
"types": "./dist/index.d.ts",
|
|
7
|
+
"files": [
|
|
8
|
+
"dist"
|
|
9
|
+
],
|
|
10
|
+
"keywords": [
|
|
11
|
+
"hyperttp"
|
|
12
|
+
],
|
|
13
|
+
"author": "dirold2",
|
|
14
|
+
"license": "MIT",
|
|
15
|
+
"repository": {
|
|
16
|
+
"type": "git",
|
|
17
|
+
"url": "git+https://github.com/IT-IF-OR/hyperttp-queue.git"
|
|
18
|
+
},
|
|
19
|
+
"peerDependencies": {
|
|
20
|
+
"typescript": "^5"
|
|
21
|
+
},
|
|
22
|
+
"dependencies": {
|
|
23
|
+
"@hyperttp/core": "^1.0.5"
|
|
24
|
+
}
|
|
25
|
+
}
|