@shutterstock/p-map-iterable 1.0.11 → 1.1.1
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 +110 -16
- package/dist/src/blocking-queue.js +61 -70
- package/dist/src/blocking-queue.js.map +1 -1
- package/dist/src/blocking-queue.test.js +70 -71
- package/dist/src/blocking-queue.test.js.map +1 -1
- package/dist/src/iterable-mapper.d.ts +173 -30
- package/dist/src/iterable-mapper.d.ts.map +1 -1
- package/dist/src/iterable-mapper.js +255 -141
- package/dist/src/iterable-mapper.js.map +1 -1
- package/dist/src/iterable-mapper.test.js +347 -720
- package/dist/src/iterable-mapper.test.js.map +1 -1
- package/dist/src/iterable-queue-mapper-simple.d.ts +44 -29
- package/dist/src/iterable-queue-mapper-simple.d.ts.map +1 -1
- package/dist/src/iterable-queue-mapper-simple.js +65 -57
- package/dist/src/iterable-queue-mapper-simple.js.map +1 -1
- package/dist/src/iterable-queue-mapper-simple.test.js +34 -35
- package/dist/src/iterable-queue-mapper-simple.test.js.map +1 -1
- package/dist/src/iterable-queue-mapper.d.ts +38 -58
- package/dist/src/iterable-queue-mapper.d.ts.map +1 -1
- package/dist/src/iterable-queue-mapper.js +37 -42
- package/dist/src/iterable-queue-mapper.js.map +1 -1
- package/dist/src/iterable-queue-mapper.test.js +41 -81
- package/dist/src/iterable-queue-mapper.test.js.map +1 -1
- package/dist/src/iterable-queue.js +8 -11
- package/dist/src/iterable-queue.js.map +1 -1
- package/dist/src/iterable-queue.test.js +43 -122
- package/dist/src/iterable-queue.test.js.map +1 -1
- package/package.json +8 -3
|
@@ -1,6 +1,5 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const tslib_1 = require("tslib");
|
|
4
3
|
/// <reference types="jest" />
|
|
5
4
|
const iterable_queue_1 = require("./iterable-queue");
|
|
6
5
|
describe('IterableQueue', () => {
|
|
@@ -11,32 +10,18 @@ describe('IterableQueue', () => {
|
|
|
11
10
|
jest.clearAllMocks();
|
|
12
11
|
});
|
|
13
12
|
describe('maxUnread: 0', () => {
|
|
14
|
-
it('single item enqueue / iterate works and ends', () =>
|
|
15
|
-
var _a, e_1, _b, _c;
|
|
13
|
+
it('single item enqueue / iterate works and ends', async () => {
|
|
16
14
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 0 });
|
|
17
15
|
void queue.enqueue(1);
|
|
18
16
|
queue.done();
|
|
19
17
|
let iteratedCount = 0;
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
_d = false;
|
|
24
|
-
const item = _c;
|
|
25
|
-
expect(item).toBe(1);
|
|
26
|
-
iteratedCount++;
|
|
27
|
-
}
|
|
28
|
-
}
|
|
29
|
-
catch (e_1_1) { e_1 = { error: e_1_1 }; }
|
|
30
|
-
finally {
|
|
31
|
-
try {
|
|
32
|
-
if (!_d && !_a && (_b = queue_1.return)) yield _b.call(queue_1);
|
|
33
|
-
}
|
|
34
|
-
finally { if (e_1) throw e_1.error; }
|
|
18
|
+
for await (const item of queue) {
|
|
19
|
+
expect(item).toBe(1);
|
|
20
|
+
iteratedCount++;
|
|
35
21
|
}
|
|
36
22
|
expect(iteratedCount).toBe(1);
|
|
37
|
-
})
|
|
38
|
-
it('full queue blocks enqueue until dequeue', () =>
|
|
39
|
-
var _e, e_2, _f, _g;
|
|
23
|
+
});
|
|
24
|
+
it('full queue blocks enqueue until dequeue', async () => {
|
|
40
25
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 0 });
|
|
41
26
|
const items = [1, 2];
|
|
42
27
|
// Add first item
|
|
@@ -50,28 +35,15 @@ describe('IterableQueue', () => {
|
|
|
50
35
|
}, 3000);
|
|
51
36
|
const startTime = Date.now();
|
|
52
37
|
let iteratedCount = 0;
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
_h = false;
|
|
57
|
-
const item = _g;
|
|
58
|
-
expect(item).toBe(items[iteratedCount]);
|
|
59
|
-
iteratedCount++;
|
|
60
|
-
}
|
|
61
|
-
}
|
|
62
|
-
catch (e_2_1) { e_2 = { error: e_2_1 }; }
|
|
63
|
-
finally {
|
|
64
|
-
try {
|
|
65
|
-
if (!_h && !_e && (_f = queue_2.return)) yield _f.call(queue_2);
|
|
66
|
-
}
|
|
67
|
-
finally { if (e_2) throw e_2.error; }
|
|
38
|
+
for await (const item of queue) {
|
|
39
|
+
expect(item).toBe(items[iteratedCount]);
|
|
40
|
+
iteratedCount++;
|
|
68
41
|
}
|
|
69
42
|
expect(iteratedCount).toBe(2);
|
|
70
43
|
const duration = Date.now() - startTime;
|
|
71
44
|
expect(duration).toBeGreaterThanOrEqual(3000);
|
|
72
|
-
})
|
|
73
|
-
it('mixed dequeue / iterator works', () =>
|
|
74
|
-
var _j, e_3, _k, _l;
|
|
45
|
+
});
|
|
46
|
+
it('mixed dequeue / iterator works', async () => {
|
|
75
47
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 0 });
|
|
76
48
|
const items = [1, 2];
|
|
77
49
|
// Wait for first item to add
|
|
@@ -79,76 +51,50 @@ describe('IterableQueue', () => {
|
|
|
79
51
|
// Do not wait for second item to add (it will wait until an enqueue completes)
|
|
80
52
|
setTimeout(() => {
|
|
81
53
|
void queue.enqueue(items[1]);
|
|
82
|
-
},
|
|
54
|
+
}, 2010);
|
|
83
55
|
setTimeout(() => {
|
|
84
56
|
queue.done();
|
|
85
57
|
}, 3000);
|
|
86
58
|
const startTime = Date.now();
|
|
87
59
|
let iteratedCount = 0;
|
|
88
|
-
const firstItem =
|
|
60
|
+
const firstItem = await queue.dequeue();
|
|
89
61
|
expect(firstItem).toBe(items[iteratedCount]);
|
|
90
62
|
iteratedCount++;
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
const item = _l;
|
|
96
|
-
expect(item).toBe(items[iteratedCount]);
|
|
97
|
-
iteratedCount++;
|
|
98
|
-
expect(Date.now() - startTime).toBeGreaterThanOrEqual(2000);
|
|
99
|
-
}
|
|
100
|
-
}
|
|
101
|
-
catch (e_3_1) { e_3 = { error: e_3_1 }; }
|
|
102
|
-
finally {
|
|
103
|
-
try {
|
|
104
|
-
if (!_m && !_j && (_k = queue_3.return)) yield _k.call(queue_3);
|
|
105
|
-
}
|
|
106
|
-
finally { if (e_3) throw e_3.error; }
|
|
63
|
+
for await (const item of queue) {
|
|
64
|
+
expect(item).toBe(items[iteratedCount]);
|
|
65
|
+
iteratedCount++;
|
|
66
|
+
expect(Math.ceil(Date.now() - startTime)).toBeGreaterThanOrEqual(2000);
|
|
107
67
|
}
|
|
108
68
|
expect(iteratedCount).toBe(2);
|
|
109
69
|
const duration = Date.now() - startTime;
|
|
110
70
|
expect(duration).toBeGreaterThanOrEqual(3000);
|
|
111
|
-
})
|
|
71
|
+
});
|
|
112
72
|
});
|
|
113
73
|
describe('maxUnread: 1', () => {
|
|
114
|
-
it('single item enqueue / iterate works and ends', () =>
|
|
115
|
-
var _a, e_4, _b, _c;
|
|
74
|
+
it('single item enqueue / iterate works and ends', async () => {
|
|
116
75
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 1 });
|
|
117
|
-
|
|
76
|
+
await queue.enqueue(1);
|
|
118
77
|
queue.done();
|
|
119
78
|
let iteratedCount = 0;
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
_d = false;
|
|
124
|
-
const item = _c;
|
|
125
|
-
expect(item).toBe(1);
|
|
126
|
-
iteratedCount++;
|
|
127
|
-
}
|
|
128
|
-
}
|
|
129
|
-
catch (e_4_1) { e_4 = { error: e_4_1 }; }
|
|
130
|
-
finally {
|
|
131
|
-
try {
|
|
132
|
-
if (!_d && !_a && (_b = queue_4.return)) yield _b.call(queue_4);
|
|
133
|
-
}
|
|
134
|
-
finally { if (e_4) throw e_4.error; }
|
|
79
|
+
for await (const item of queue) {
|
|
80
|
+
expect(item).toBe(1);
|
|
81
|
+
iteratedCount++;
|
|
135
82
|
}
|
|
136
83
|
expect(iteratedCount).toBe(1);
|
|
137
|
-
})
|
|
138
|
-
it('enqueue after done throws', () =>
|
|
84
|
+
});
|
|
85
|
+
it('enqueue after done throws', async () => {
|
|
139
86
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 1 });
|
|
140
|
-
|
|
141
|
-
const item =
|
|
87
|
+
await queue.enqueue(1);
|
|
88
|
+
const item = await queue.dequeue();
|
|
142
89
|
queue.done();
|
|
143
|
-
|
|
90
|
+
await expect(async () => queue.enqueue(2)).rejects.toThrowError('`enqueue` called after `done` called');
|
|
144
91
|
expect(item).toBe(1);
|
|
145
|
-
})
|
|
146
|
-
it('full queue blocks enqueue until dequeue', () =>
|
|
147
|
-
var _e, e_5, _f, _g;
|
|
92
|
+
});
|
|
93
|
+
it('full queue blocks enqueue until dequeue', async () => {
|
|
148
94
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 1 });
|
|
149
95
|
const items = [1, 2];
|
|
150
96
|
// Wait for first item to add
|
|
151
|
-
|
|
97
|
+
await queue.enqueue(items[0]);
|
|
152
98
|
// Do not wait for second item to add (it will wait until an enqueue completes)
|
|
153
99
|
setTimeout(() => {
|
|
154
100
|
void queue.enqueue(items[1]);
|
|
@@ -158,32 +104,19 @@ describe('IterableQueue', () => {
|
|
|
158
104
|
}, 3000);
|
|
159
105
|
const startTime = Date.now();
|
|
160
106
|
let iteratedCount = 0;
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
_h = false;
|
|
165
|
-
const item = _g;
|
|
166
|
-
expect(item).toBe(items[iteratedCount]);
|
|
167
|
-
iteratedCount++;
|
|
168
|
-
}
|
|
169
|
-
}
|
|
170
|
-
catch (e_5_1) { e_5 = { error: e_5_1 }; }
|
|
171
|
-
finally {
|
|
172
|
-
try {
|
|
173
|
-
if (!_h && !_e && (_f = queue_5.return)) yield _f.call(queue_5);
|
|
174
|
-
}
|
|
175
|
-
finally { if (e_5) throw e_5.error; }
|
|
107
|
+
for await (const item of queue) {
|
|
108
|
+
expect(item).toBe(items[iteratedCount]);
|
|
109
|
+
iteratedCount++;
|
|
176
110
|
}
|
|
177
111
|
expect(iteratedCount).toBe(2);
|
|
178
112
|
const duration = Date.now() - startTime;
|
|
179
113
|
expect(duration).toBeGreaterThanOrEqual(3000);
|
|
180
|
-
})
|
|
181
|
-
it('mixed dequeue / iterator works', () =>
|
|
182
|
-
var _j, e_6, _k, _l;
|
|
114
|
+
});
|
|
115
|
+
it('mixed dequeue / iterator works', async () => {
|
|
183
116
|
const queue = new iterable_queue_1.IterableQueue({ maxUnread: 1 });
|
|
184
117
|
const items = [1, 2];
|
|
185
118
|
// Wait for first item to add
|
|
186
|
-
|
|
119
|
+
await queue.enqueue(items[0]);
|
|
187
120
|
// Do not wait for second item to add (it will wait until an enqueue completes)
|
|
188
121
|
setTimeout(() => {
|
|
189
122
|
void queue.enqueue(items[1]);
|
|
@@ -193,30 +126,18 @@ describe('IterableQueue', () => {
|
|
|
193
126
|
}, 3000);
|
|
194
127
|
const startTime = Date.now();
|
|
195
128
|
let iteratedCount = 0;
|
|
196
|
-
const firstItem =
|
|
129
|
+
const firstItem = await queue.dequeue();
|
|
197
130
|
expect(firstItem).toBe(items[iteratedCount]);
|
|
198
131
|
iteratedCount++;
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
const item = _l;
|
|
204
|
-
expect(item).toBe(items[iteratedCount]);
|
|
205
|
-
iteratedCount++;
|
|
206
|
-
expect(Date.now() - startTime).toBeGreaterThanOrEqual(2000);
|
|
207
|
-
}
|
|
208
|
-
}
|
|
209
|
-
catch (e_6_1) { e_6 = { error: e_6_1 }; }
|
|
210
|
-
finally {
|
|
211
|
-
try {
|
|
212
|
-
if (!_m && !_j && (_k = queue_6.return)) yield _k.call(queue_6);
|
|
213
|
-
}
|
|
214
|
-
finally { if (e_6) throw e_6.error; }
|
|
132
|
+
for await (const item of queue) {
|
|
133
|
+
expect(item).toBe(items[iteratedCount]);
|
|
134
|
+
iteratedCount++;
|
|
135
|
+
expect(Math.ceil(Date.now() - startTime)).toBeGreaterThanOrEqual(2000);
|
|
215
136
|
}
|
|
216
137
|
expect(iteratedCount).toBe(2);
|
|
217
138
|
const duration = Date.now() - startTime;
|
|
218
139
|
expect(duration).toBeGreaterThanOrEqual(3000);
|
|
219
|
-
})
|
|
140
|
+
});
|
|
220
141
|
});
|
|
221
142
|
});
|
|
222
143
|
//# sourceMappingURL=iterable-queue.test.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"iterable-queue.test.js","sourceRoot":"","sources":["../../src/iterable-queue.test.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"iterable-queue.test.js","sourceRoot":"","sources":["../../src/iterable-queue.test.ts"],"names":[],"mappings":";;AAAA,8BAA8B;AAC9B,qDAAiD;AAEjD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,SAAS,CAAC,GAAG,EAAE;QACb,UAAU;IACZ,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACtB,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrB,aAAa,EAAE,CAAC;aACjB;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE/B,iBAAiB;YACjB,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC;YACf,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;gBACxC,aAAa,EAAE,CAAC;aACjB;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE/B,6BAA6B;YAC7B,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC;YACf,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7C,aAAa,EAAE,CAAC;YAChB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;gBACxC,aAAa,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;aACxE;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrB,aAAa,EAAE,CAAC;aACjB;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,KAAK,IAAI,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAC7D,sCAAsC,CACvC,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE/B,6BAA6B;YAC7B,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC;YACf,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;gBACxC,aAAa,EAAE,CAAC;aACjB;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE/B,6BAA6B;YAC7B,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC;YACf,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7C,aAAa,EAAE,CAAC;YAChB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;gBACxC,aAAa,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;aACxE;YAED,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
package/package.json
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@shutterstock/p-map-iterable",
|
|
3
|
-
"version": "1.
|
|
4
|
-
"description": "
|
|
3
|
+
"version": "1.1.1",
|
|
4
|
+
"description": "Set of classes used for async prefetching with backpressure (IterableMapper) and async flushing with backpressure (IterableQueueMapper, IterableQueueMapperSimple)",
|
|
5
5
|
"main": "dist/src/index.js",
|
|
6
6
|
"types": "dist/src/index.d.ts",
|
|
7
7
|
"publishConfig": {
|
|
@@ -11,10 +11,15 @@
|
|
|
11
11
|
"keywords": [
|
|
12
12
|
"p-map",
|
|
13
13
|
"p-map-iterable",
|
|
14
|
+
"blocking-queue",
|
|
15
|
+
"iterable-queue",
|
|
16
|
+
"mapping",
|
|
14
17
|
"iterable",
|
|
18
|
+
"queue",
|
|
15
19
|
"async",
|
|
16
20
|
"promise",
|
|
17
|
-
"
|
|
21
|
+
"back-pressure",
|
|
22
|
+
"flow-control",
|
|
18
23
|
"AsyncIterable",
|
|
19
24
|
"AsyncIterator"
|
|
20
25
|
],
|