@codegouvfr/react-dsfr
Version:
French State Design System React integration library
154 lines • 8.56 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 __read = (this && this.__read) || function (o, n) {
var m = typeof Symbol === "function" && o[Symbol.iterator];
if (!m) return o;
var i = m.call(o), r, ar = [], e;
try {
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
}
catch (error) { e = { error: error }; }
finally {
try {
if (r && !r.done && (m = i["return"])) m.call(i);
}
finally { if (e) throw e.error; }
}
return ar;
};
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.crawl = void 0;
var promises_1 = require("fs/promises");
var path_1 = require("path");
var promises_2 = require("fs/promises");
function crawlRec(params) {
return __awaiter(this, void 0, void 0, function () {
var dirPath, getDoCrawlInDir, filePaths, recursiveCallResults, _a, _b, _c;
var _this = this;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
dirPath = params.dirPath, getDoCrawlInDir = params.getDoCrawlInDir;
filePaths = [];
recursiveCallResults = [];
_b = (_a = Promise).all;
_c = promises_1.readdir;
return [4 /*yield*/, (0, promises_2.realpath)(dirPath)];
case 1: return [4 /*yield*/, _c.apply(void 0, [_d.sent()])];
case 2: return [4 /*yield*/, _b.apply(_a, [(_d.sent()).map(function (fileOrDirectoryBasename) { return __awaiter(_this, void 0, void 0, function () {
var fileOrDirectoryPath, fileOrDirectoryPath_realpath, dirPath_1, _a, _b, filePath;
return __generator(this, function (_c) {
switch (_c.label) {
case 0:
fileOrDirectoryPath = (0, path_1.join)(dirPath, fileOrDirectoryBasename);
return [4 /*yield*/, (0, promises_2.realpath)(fileOrDirectoryPath).catch(function () { return undefined; })];
case 1:
fileOrDirectoryPath_realpath = _c.sent();
if (fileOrDirectoryPath_realpath === undefined) {
// NOTE: Broken symlink
return [2 /*return*/];
}
return [4 /*yield*/, (0, promises_1.lstat)(fileOrDirectoryPath_realpath)];
case 2:
if (!(_c.sent()).isDirectory()) return [3 /*break*/, 5];
dirPath_1 = fileOrDirectoryPath;
return [4 /*yield*/, getDoCrawlInDir({ dirPath: dirPath_1 })];
case 3:
if (!(_c.sent())) {
return [2 /*return*/];
}
_b = (_a = recursiveCallResults).push;
return [4 /*yield*/, crawlRec({
dirPath: dirPath_1,
getDoCrawlInDir: getDoCrawlInDir
})];
case 4:
_b.apply(_a, [_c.sent()]);
return [2 /*return*/];
case 5:
filePath = fileOrDirectoryPath;
filePaths.push(filePath);
return [2 /*return*/];
}
});
}); })])];
case 3:
_d.sent();
return [2 /*return*/, __spreadArray([filePaths], __read(recursiveCallResults), false).flat()];
}
});
});
}
function crawl(params) {
return __awaiter(this, void 0, void 0, function () {
var rootDirPath, _a, getDoCrawlInDir, returnedPathsType, filePaths;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
rootDirPath = params.dirPath, _a = params.getDoCrawlInDir, getDoCrawlInDir = _a === void 0 ? function () { return true; } : _a, returnedPathsType = params.returnedPathsType;
return [4 /*yield*/, crawlRec({
"dirPath": rootDirPath,
"getDoCrawlInDir": function (_a) {
var dirPath = _a.dirPath;
return getDoCrawlInDir({ "relativeDirPath": (0, path_1.relative)(rootDirPath, dirPath) });
}
})];
case 1:
filePaths = _b.sent();
switch (returnedPathsType) {
case "absolute":
return [2 /*return*/, filePaths];
case "relative to dirPath":
return [2 /*return*/, filePaths.map(function (filePath) { return (0, path_1.relative)(rootDirPath, filePath); })];
}
return [2 /*return*/];
}
});
});
}
exports.crawl = crawl;
//# sourceMappingURL=crawl.js.map