sardines-compile-time-tools
Version:
sardines.compile-time-tools.js is part of the sardines.io project
170 lines (169 loc) • 9.02 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.queryRemoteSardines = void 0;
var sardines_core_1 = require("sardines-core");
exports.queryRemoteSardines = function (sardinesConfig, writeline) { return __awaiter(void 0, void 0, void 0, function () {
var cachedApps, _a, _b, _i, appName, app, cachedModules, _c, _d, _e, moduleName, sardineModule, cachedSubModules, _f, _g, subModule, _h, _j, _k, serviceName, serviceVersion, serviceIdentity, serviceInfo, e_1, writeToFile;
return __generator(this, function (_l) {
switch (_l.label) {
case 0:
if (!sardinesConfig.remoteServices || !Object.keys(sardinesConfig.remoteServices).length)
return [2];
cachedApps = {};
_a = [];
for (_b in sardinesConfig.remoteServices)
_a.push(_b);
_i = 0;
_l.label = 1;
case 1:
if (!(_i < _a.length)) return [3, 10];
appName = _a[_i];
app = sardinesConfig.remoteServices[appName];
cachedApps[appName] = {};
cachedModules = cachedApps[appName];
_c = [];
for (_d in app)
_c.push(_d);
_e = 0;
_l.label = 2;
case 2:
if (!(_e < _c.length)) return [3, 9];
moduleName = _c[_e];
sardineModule = app[moduleName];
cachedSubModules = cachedModules;
for (_f = 0, _g = moduleName.split('/'); _f < _g.length; _f++) {
subModule = _g[_f];
if (!subModule)
continue;
cachedSubModules[subModule] = {};
cachedSubModules = cachedSubModules[subModule];
}
_h = [];
for (_j in sardineModule)
_h.push(_j);
_k = 0;
_l.label = 3;
case 3:
if (!(_k < _h.length)) return [3, 8];
serviceName = _h[_k];
serviceVersion = sardineModule[serviceName];
serviceIdentity = {
application: appName,
module: moduleName,
name: serviceName,
version: serviceVersion
};
_l.label = 4;
case 4:
_l.trys.push([4, 6, , 7]);
return [4, sardines_core_1.RepositoryClient.queryService(serviceIdentity)];
case 5:
serviceInfo = _l.sent();
if (!serviceInfo) {
console.error("Can not find service information in the repository, service: " + sardines_core_1.utils.genServiceIdentitySting(serviceIdentity));
}
else {
if (serviceVersion === '*' || serviceVersion === 'latest') {
serviceInfo.version = serviceVersion;
}
cachedSubModules[serviceName] = serviceInfo;
}
return [3, 7];
case 6:
e_1 = _l.sent();
throw e_1;
case 7:
_k++;
return [3, 3];
case 8:
_e++;
return [3, 2];
case 9:
_i++;
return [3, 1];
case 10:
writeToFile = function () {
var processSubModule = function (name, node, level) {
if (level === void 0) { level = 0; }
if (Object.keys(node).length > 0 && typeof node.version === 'undefined') {
writeline(' '.repeat(level + 1) + " " + name + ": {");
for (var subNodeName in node) {
processSubModule(subNodeName, node[subNodeName], level + 1);
}
writeline(' '.repeat(level + 1) + " },");
}
else if (typeof node.version !== 'undefined') {
var getArgs = function (full) {
return node.arguments.map(function (item) {
if (full)
return item.name + ": " + item.type;
return item.name;
}).join(', ');
};
writeline(' '.repeat(level) + " " + name + ": async (" + getArgs(true) + ") => {");
writeline(' '.repeat(level) + " return await Core.invoke({");
writeline(' '.repeat(level) + " identity: {");
writeline(' '.repeat(level + 1) + " application: '" + node.application + "',");
writeline(' '.repeat(level + 1) + " module: '" + node.module + "',");
writeline(' '.repeat(level + 1) + " name: '" + node.name + "',");
writeline(' '.repeat(level + 1) + " version: '" + node.version + "',");
writeline(' '.repeat(level) + " },");
writeline(' '.repeat(level) + " entries: []");
writeline(' '.repeat(level) + " }, " + getArgs(false) + ")");
writeline(' '.repeat(level) + " },");
}
};
writeline("import { Core } from 'sardines-core'");
writeline("export default {");
for (var appName in cachedApps) {
writeline(" " + appName + ": {");
var modules = cachedApps[appName];
for (var subModuleName in modules) {
var subModule = modules[subModuleName];
processSubModule(subModuleName, subModule);
}
writeline(" },");
}
writeline("}");
};
writeToFile();
return [2];
}
});
}); };