code-complexity
Version:
Measure the churn/complexity score. Higher values mean hotspots where refactorings should happen.
119 lines (118 loc) • 5.57 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 };
}
};
exports.__esModule = true;
var node_child_process_1 = require("node:child_process");
var node_fs_1 = require("node:fs");
var node_path_1 = require("node:path");
var micromatch = require("micromatch");
var utils_1 = require("../../utils");
var internal = { debug: (0, utils_1.buildDebugger)("churn") };
var PER_LINE = "\n";
exports["default"] = {
compute: function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return (0, utils_1.withDuration)(compute, args, internal.debug);
}
};
function compute(options) {
return __awaiter(this, void 0, void 0, function () {
var gitLogCommand, singleStringWithAllChurns;
return __generator(this, function (_a) {
gitLogCommand = buildGitLogCommand(options);
singleStringWithAllChurns = executeGitLogCommand(gitLogCommand);
return [2 /*return*/, computeChurnsPerFiles(singleStringWithAllChurns, options.directory, options.filter)];
});
});
}
function executeGitLogCommand(gitLogCommand) {
return (0, node_child_process_1.execSync)(gitLogCommand, { encoding: "utf8", maxBuffer: 32000000 });
}
function buildGitLogCommand(options) {
var isWindows = process.platform === "win32";
return [
"git",
"-C ".concat(options.directory),
"log",
"--follow",
// Windows CMD handle quotes differently than linux, this is why we should put empty string as said in:
// https://github.com/git-for-windows/git/issues/3131
"--format=".concat(isWindows ? "" : "''"),
"--name-only",
options.since ? "--since=\"".concat(options.since, "\"") : "",
options.until ? "--until=\"".concat(options.until, "\"") : "",
// Windows CMD handle quotes differently
isWindows ? "*" : "'*'",
]
.filter(function (s) { return s.length > 0; })
.join(" ");
}
function computeChurnsPerFiles(gitLogOutput, directory, filters) {
var changedFiles = gitLogOutput
.split(PER_LINE)
.filter(function (line) { return line !== ""; })
.sort();
return changedFiles.reduce(function (map, path) {
applyFiltersAndExcludeObsoletePath(path, map);
return map;
}, new Map());
function applyFiltersAndExcludeObsoletePath(path, map) {
if (!filters || !filters.length) {
if (pathStillExists(path)) {
addOrIncrement(map, path);
}
}
else {
var pathHasAMatch = filters.every(function (f) { return micromatch.isMatch(path, f); });
if (pathHasAMatch) {
if (pathStillExists(path)) {
addOrIncrement(map, path);
}
}
}
}
function addOrIncrement(map, path) {
var _a;
map.set(path, ((_a = map.get(path)) !== null && _a !== void 0 ? _a : 0) + 1);
}
function pathStillExists(fileName) {
return (0, node_fs_1.existsSync)((0, node_path_1.resolve)(directory, fileName));
}
}