@grafana/faro-core
Version:
Core package of Faro.
146 lines • 7.55 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (g && (g = 0, op[0] && (_ = 0)), _) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
var testUtils_1 = require("../testUtils");
var promiseBuffer_1 = require("./promiseBuffer");
function defer(fn) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
return [2 /*return*/, new Promise(function (resolve) {
setTimeout(function () {
fn();
resolve();
}, 0);
})];
});
});
}
describe('PromiseBuffer', function () {
it('add() new promise that resolves when task is completed', function () { return __awaiter(void 0, void 0, void 0, function () {
var buf, _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
buf = (0, promiseBuffer_1.createPromiseBuffer)({ size: 2, concurrency: 2 });
_a = expect;
return [4 /*yield*/, buf.add(function () { return Promise.resolve('hi'); })];
case 1:
_a.apply(void 0, [_b.sent()]).toEqual('hi');
return [2 /*return*/];
}
});
}); });
it('executes tasks concurrently, limited to concurrency setting', function () { return __awaiter(void 0, void 0, void 0, function () {
var promises, buf, addTask;
var _a, _b, _c, _d;
return __generator(this, function (_e) {
switch (_e.label) {
case 0:
promises = [];
buf = (0, promiseBuffer_1.createPromiseBuffer)({
size: 10,
concurrency: 2,
});
addTask = function (id) {
return buf.add(function () {
var prom = (0, testUtils_1.createTestPromise)(id);
promises.push(prom);
return prom.promise;
});
};
addTask(1);
addTask(2);
addTask(3);
// 1 & 2 have started to execute. 3d is not started
expect(promises).toHaveLength(2);
expect((_a = promises[0]) === null || _a === void 0 ? void 0 : _a.id).toEqual(1);
expect((_b = promises[1]) === null || _b === void 0 ? void 0 : _b.id).toEqual(2);
// resolve first two
(_c = promises[0]) === null || _c === void 0 ? void 0 : _c.resolve();
(_d = promises[1]) === null || _d === void 0 ? void 0 : _d.resolve();
return [4 /*yield*/, defer(function () {
var _a, _b;
// 3 has started to be executed
expect(promises).toHaveLength(3);
expect((_a = promises[2]) === null || _a === void 0 ? void 0 : _a.id).toEqual(3);
(_b = promises[2]) === null || _b === void 0 ? void 0 : _b.resolve();
})];
case 1:
_e.sent();
return [2 /*return*/];
}
});
}); });
it('rejects tasks that exceed buffer size', function () { return __awaiter(void 0, void 0, void 0, function () {
var promises, buf, addTask;
var _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
promises = [];
buf = (0, promiseBuffer_1.createPromiseBuffer)({
size: 3,
concurrency: 2,
});
addTask = function (id) {
return buf.add(function () {
var prom = (0, testUtils_1.createTestPromise)(id);
promises.push(prom);
return prom.promise;
});
};
// adding 3 tasks works, 2 of them begin executing
addTask(1);
addTask(2);
addTask(3);
expect(promises).toHaveLength(2);
// adding 4th task fails
expect(function () { return addTask(4); }).toThrow('Task buffer full');
// finishing a task allows new tasks to be added again
(_a = promises[0]) === null || _a === void 0 ? void 0 : _a.resolve();
return [4 /*yield*/, defer(function () {
addTask(4);
})];
case 1:
_b.sent();
return [2 /*return*/];
}
});
}); });
});
//# sourceMappingURL=promiseBuffer.test.js.map