openam-agent-custom
Version:
Customized ForgeRock AM Policy Agent for Node.js from Zoltan Tarcsay
143 lines • 6.95 kB
JavaScript
"use strict";
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 });
/**
* This cache implementation stores entries in a map in memory (not efficient for large caches)
* @example
* const cache = new InMemoryCache<{bar: string}>({expireAfterSeconds: 600}); // cached entries expire after 10 minutes
* cache.put('foo', { bar: 'baz' });
*/
var InMemoryCache = /** @class */ (function () {
function InMemoryCache(_a) {
var expireAfterSeconds = _a.expireAfterSeconds, logger = _a.logger;
this.keyValueStore = new Map();
this.expireAfterSeconds = parseFloat((expireAfterSeconds || 0).toString());
this.logger = logger;
// start the cleanup schedule
if (this.expireAfterSeconds > 0) {
this.scheduleCleanup();
}
}
InMemoryCache.prototype.get = function (key) {
return __awaiter(this, void 0, void 0, function () {
var entry;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
entry = this.keyValueStore.get(key);
if (!entry) {
throw new Error('InMemoryCache: entry not found in cache');
}
if (!(this.expireAfterSeconds && Date.now() > entry.timestamp + this.expireAfterSeconds * 1000)) return [3 /*break*/, 2];
return [4 /*yield*/, this.remove(key)];
case 1:
_a.sent();
throw new Error('InMemoryCache: entry expired');
case 2: return [2 /*return*/, entry.data];
}
});
});
};
InMemoryCache.prototype.put = function (key, value) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
this.keyValueStore.set(key, { timestamp: Date.now(), data: value });
return [2 /*return*/];
});
});
};
InMemoryCache.prototype.remove = function (key) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
this.keyValueStore.delete(key);
return [2 /*return*/];
});
});
};
InMemoryCache.prototype.quit = function () {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
this.keyValueStore.clear();
// cancel the cleanup schedule
if (this.cleanupIntervalRef) {
clearInterval(this.cleanupIntervalRef);
}
if (this.logger) {
this.logger.info("InMemoryCache: destroyed");
}
return [2 /*return*/];
});
});
};
InMemoryCache.prototype.scheduleCleanup = function () {
var _this = this;
this.cleanupIntervalRef = setInterval(function () { return __awaiter(_this, void 0, void 0, function () {
var _i, _a, key, _b;
return __generator(this, function (_c) {
switch (_c.label) {
case 0:
if (this.logger) {
this.logger.info("InMemoryCache: periodic cleanup after " + this.expireAfterSeconds + " seconds");
}
_i = 0, _a = Object.keys(this.keyValueStore);
_c.label = 1;
case 1:
if (!(_i < _a.length)) return [3 /*break*/, 6];
key = _a[_i];
_c.label = 2;
case 2:
_c.trys.push([2, 4, , 5]);
return [4 /*yield*/, this.get(key)];
case 3:
_c.sent();
return [3 /*break*/, 5];
case 4:
_b = _c.sent();
return [3 /*break*/, 5];
case 5:
_i++;
return [3 /*break*/, 1];
case 6: return [2 /*return*/];
}
});
}); }, this.expireAfterSeconds * 1000);
};
return InMemoryCache;
}());
exports.InMemoryCache = InMemoryCache;
//# sourceMappingURL=in-memory-cache.js.map