relational-redis-store
Version:
A Relational Redis Store
179 lines • 9.27 kB
JavaScript
;
var __assign = (this && this.__assign) || function () {
__assign = Object.assign || function(t) {
for (var s, i = 1, n = arguments.length; i < n; i++) {
s = arguments[i];
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
t[p] = s[p];
}
return t;
};
return __assign.apply(this, arguments);
};
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;
return g = { next: verb(0), "throw": verb(1), "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 (_) 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 mockStoreFactory_1 = require("../mockStoreFactory");
var testUtils_1 = require("./testUtils");
var ts_results_1 = require("ts-results");
var store;
beforeAll(function () {
store = (0, mockStoreFactory_1.createMockStore)({
namespace: 'test',
logger: testUtils_1.silentLogger,
});
});
beforeEach(function () {
store.flush();
});
describe('Queue', function () {
describe('removal', function () {
test('removes an existent item', function () { return __awaiter(void 0, void 0, void 0, function () {
var qpInput1, actualBeforeRemoval, removalResponse, actualAfterRemoval;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
qpInput1 = {
challengeId: 'qp1',
};
return [4 /*yield*/, store.enqueue('quickPairings', qpInput1).resolve()];
case 1:
_a.sent();
return [4 /*yield*/, store
.getQueueSize('quickPairings')
.resolve()];
case 2:
actualBeforeRemoval = _a.sent();
expect(actualBeforeRemoval).toEqual(new ts_results_1.Ok(1));
return [4 /*yield*/, store
.removeFromQueue('quickPairings', qpInput1)
.resolve()];
case 3:
removalResponse = _a.sent();
expect(removalResponse).toEqual(new ts_results_1.Ok(undefined));
return [4 /*yield*/, store
.getQueueSize('quickPairings')
.resolve()];
case 4:
actualAfterRemoval = _a.sent();
expect(actualAfterRemoval).toEqual(new ts_results_1.Ok(0));
return [2 /*return*/];
}
});
}); });
test('returns error when item not exactly the same', function () { return __awaiter(void 0, void 0, void 0, function () {
var qpInput1, actualBeforeRemoval, removalResponse, actualAfterRemoval;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
qpInput1 = {
challengeId: 'qp1',
};
return [4 /*yield*/, store.enqueue('quickPairings', qpInput1).resolve()];
case 1:
_a.sent();
return [4 /*yield*/, store
.getQueueSize('quickPairings')
.resolve()];
case 2:
actualBeforeRemoval = _a.sent();
expect(actualBeforeRemoval).toEqual(new ts_results_1.Ok(1));
return [4 /*yield*/, store
.removeFromQueue('quickPairings', __assign(__assign({}, qpInput1), { challengeId: 'qp2' }))
.resolve()];
case 3:
removalResponse = _a.sent();
expect(removalResponse.ok).toBe(false);
expect(removalResponse.val).toBe('QueueItemNotFound');
return [4 /*yield*/, store
.getQueueSize('quickPairings')
.resolve()];
case 4:
actualAfterRemoval = _a.sent();
expect(actualAfterRemoval).toEqual(new ts_results_1.Ok(1));
return [2 /*return*/];
}
});
}); });
test('finds and removes the correct item even if its data structure is complicated/scrambled and could trip the JSON.stringify()', function () { return __awaiter(void 0, void 0, void 0, function () {
var qpInput1, actualBeforeRemoval, removalResponse, actualAfterRemoval;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
qpInput1 = {
simpleStringKey: 'asd',
nestedKey: {
simpleNummberKey: 2,
arrayOfNumber: [4, 5],
},
arrayOfString: ['hey', 'yo'],
};
return [4 /*yield*/, store.enqueue('queueWithManyKeys', qpInput1).resolve()];
case 1:
_a.sent();
return [4 /*yield*/, store
.getQueueSize('queueWithManyKeys')
.resolve()];
case 2:
actualBeforeRemoval = _a.sent();
expect(actualBeforeRemoval).toEqual(new ts_results_1.Ok(1));
return [4 /*yield*/, store
.removeFromQueue('queueWithManyKeys', {
nestedKey: {
arrayOfNumber: [4, 5],
simpleNummberKey: 2,
},
arrayOfString: ['hey', 'yo'],
simpleStringKey: 'asd',
})
.resolve()];
case 3:
removalResponse = _a.sent();
expect(removalResponse).toEqual(new ts_results_1.Ok(undefined));
return [4 /*yield*/, store
.getQueueSize('quickPairings')
.resolve()];
case 4:
actualAfterRemoval = _a.sent();
expect(actualAfterRemoval).toEqual(new ts_results_1.Ok(0));
return [2 /*return*/];
}
});
}); });
});
});
//# sourceMappingURL=Store.queue.test.js.map