keycloakify-test
Version:
Keycloak theme generator for Reacts app
112 lines • 6.6 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 };
}
};
var __asyncValues = (this && this.__asyncValues) || function (o) {
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
var m = o[Symbol.asyncIterator], i;
return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.getLatestsSemVersionedTagFactory = void 0;
var listTags_1 = require("./listTags");
var NpmModuleVersion_1 = require("../NpmModuleVersion");
function getLatestsSemVersionedTagFactory(params) {
var octokit = params.octokit;
function getLatestsSemVersionedTag(params) {
var e_1, _a;
return __awaiter(this, void 0, void 0, function () {
var owner, repo, doIgnoreBeta, count, semVersionedTags, listTags, _b, _c, tag, version, e_1_1;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
owner = params.owner, repo = params.repo, doIgnoreBeta = params.doIgnoreBeta, count = params.count;
semVersionedTags = [];
listTags = (0, listTags_1.listTagsFactory)({ octokit: octokit }).listTags;
_d.label = 1;
case 1:
_d.trys.push([1, 6, 7, 12]);
_b = __asyncValues(listTags({ owner: owner, repo: repo }));
_d.label = 2;
case 2: return [4 /*yield*/, _b.next()];
case 3:
if (!(_c = _d.sent(), !_c.done)) return [3 /*break*/, 5];
tag = _c.value;
version = void 0;
try {
version = NpmModuleVersion_1.NpmModuleVersion.parse(tag.replace(/^[vV]?/, ""));
}
catch (_e) {
return [3 /*break*/, 4];
}
if (doIgnoreBeta && version.betaPreRelease !== undefined) {
return [3 /*break*/, 4];
}
semVersionedTags.push({ tag: tag, version: version });
_d.label = 4;
case 4: return [3 /*break*/, 2];
case 5: return [3 /*break*/, 12];
case 6:
e_1_1 = _d.sent();
e_1 = { error: e_1_1 };
return [3 /*break*/, 12];
case 7:
_d.trys.push([7, , 10, 11]);
if (!(_c && !_c.done && (_a = _b.return))) return [3 /*break*/, 9];
return [4 /*yield*/, _a.call(_b)];
case 8:
_d.sent();
_d.label = 9;
case 9: return [3 /*break*/, 11];
case 10:
if (e_1) throw e_1.error;
return [7 /*endfinally*/];
case 11: return [7 /*endfinally*/];
case 12: return [2 /*return*/, semVersionedTags.sort(function (_a, _b) {
var vX = _a.version;
var vY = _b.version;
return NpmModuleVersion_1.NpmModuleVersion.compare(vY, vX);
}).slice(0, count)];
}
});
});
}
return { getLatestsSemVersionedTag: getLatestsSemVersionedTag };
}
exports.getLatestsSemVersionedTagFactory = getLatestsSemVersionedTagFactory;
//# sourceMappingURL=getLatestsSemVersionedTag.js.map