@lexmin0412/gcm
Version:
94 lines (93 loc) • 5.15 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 (g && (g = 0, op[0] && (_ = 0)), _) 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 __importDefault = (this && this.__importDefault) || function (mod) {
return (mod && mod.__esModule) ? mod : { "default": mod };
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.upgrade = void 0;
var run_1 = require("@lexmin0412/run");
var latest_version_1 = __importDefault(require("latest-version"));
var picocolors_1 = __importDefault(require("picocolors"));
var inquirer_1 = __importDefault(require("inquirer"));
var semver_1 = require("semver");
var gcm_api_1 = require("@lexmin0412/gcm-api");
var upgrade = function () { return __awaiter(void 0, void 0, void 0, function () {
var pkgJson, newVersion, currentVersion;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
pkgJson = (0, gcm_api_1.getPkgJson)();
return [4 /*yield*/, (0, latest_version_1.default)(pkgJson.name)];
case 1:
newVersion = _a.sent();
currentVersion = pkgJson.version;
if (newVersion === currentVersion) {
console.log(picocolors_1.default.green("\u5F53\u524D\u5DF2\u662F\u6700\u65B0\u7248\u672C: ".concat(currentVersion)));
process.exit(0);
}
if ((0, semver_1.gt)(newVersion, currentVersion)) {
inquirer_1.default.prompt([
{
type: 'confirm',
name: 'confirmed',
message: '是否更新',
default: false
}
]).then(function (answers) {
var confirmed = answers.confirmed;
if (confirmed) {
(0, run_1.runCmdSync)("npm install ".concat(pkgJson.name, "@").concat(newVersion, " -g"));
console.log(picocolors_1.default.green("\u2713 \u6210\u529F\u5347\u7EA7\u5230 v".concat(newVersion)));
}
else {
console.log('canceled');
process.exit(0);
}
});
}
else {
console.error('当前安装版本异常，请检查: ');
console.log("\u5F53\u524D\u7248\u672C ".concat(currentVersion));
console.log("\u6700\u65B0\u7248\u672C ".concat(newVersion));
process.exit(1);
}
return [2 /*return*/];
}
});
}); };
exports.upgrade = upgrade;