@omgovich/firebase-functions-rate-limiter
Version:
JS/TS library that allows you to set per - time, per - user or per - anything limits for calling Firebase cloud functions
148 lines • 7.37 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;
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 });
exports.PersistenceProviderMock = void 0;
var PersistenceProviderMock = /** @class */ (function () {
function PersistenceProviderMock() {
this.persistenceObject = {};
}
PersistenceProviderMock.prototype.updateAndGet = function (collectionName, recordName, updaterFn) {
return __awaiter(this, void 0, void 0, function () {
var result;
var _this = this;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.runTransaction(function () { return __awaiter(_this, void 0, void 0, function () {
var record, updatedRecord;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.getRecord(collectionName, recordName)];
case 1:
record = _a.sent();
updatedRecord = updaterFn(record);
return [4 /*yield*/, this.saveRecord(collectionName, recordName, updatedRecord)];
case 2:
_a.sent();
result = updatedRecord;
return [2 /*return*/];
}
});
}); })];
case 1:
_a.sent();
/* istanbul ignore next */
if (!result)
throw new Error("PersistenceProviderMock: Persistence record could not be updated");
return [2 /*return*/, result];
}
});
});
};
PersistenceProviderMock.prototype.get = function (collectionName, recordName) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.getRecord(collectionName, recordName)];
case 1: return [2 /*return*/, _a.sent()];
}
});
});
};
PersistenceProviderMock.prototype.setDebugFn = function (debugFn) {
//
};
PersistenceProviderMock.prototype.getRecord = function (collectionName, recordName) {
return __awaiter(this, void 0, void 0, function () {
var key;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.delay(2)];
case 1:
_a.sent();
key = this.getKey(collectionName, recordName);
return [2 /*return*/, this.persistenceObject[key] || this.createEmptyRecord()];
}
});
});
};
PersistenceProviderMock.prototype.runTransaction = function (asyncTransactionFn) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, asyncTransactionFn()];
case 1:
_a.sent();
return [2 /*return*/];
}
});
});
};
PersistenceProviderMock.prototype.saveRecord = function (collectionName, recordName, record) {
return __awaiter(this, void 0, void 0, function () {
var key;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.delay(2)];
case 1:
_a.sent();
key = this.getKey(collectionName, recordName);
this.persistenceObject[key] = record;
return [2 /*return*/];
}
});
});
};
PersistenceProviderMock.prototype.getKey = function (collectionName, recordName) {
return collectionName + "_" + recordName;
};
PersistenceProviderMock.prototype.createEmptyRecord = function () {
return {
u: [],
};
};
PersistenceProviderMock.prototype.delay = function (delayMs) {
return new Promise(function (resolve, reject) {
setTimeout(function () {
resolve();
}, delayMs);
});
};
return PersistenceProviderMock;
}());
exports.PersistenceProviderMock = PersistenceProviderMock;
//# sourceMappingURL=PersistenceProviderMock.js.map