codn_ts
Version:
智能代码分析工具 - 支持语义搜索、调用链分析和代码结构可视化，对大模型/AI agent 友好
147 lines • 5.76 kB
JavaScript
;
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
var desc = Object.getOwnPropertyDescriptor(m, k);
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
desc = { enumerable: true, get: function() { return m[k]; } };
}
Object.defineProperty(o, k2, desc);
}) : (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
o[k2] = m[k];
}));
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
Object.defineProperty(o, "default", { enumerable: true, value: v });
}) : function(o, v) {
o["default"] = v;
});
var __importStar = (this && this.__importStar) || (function () {
var ownKeys = function(o) {
ownKeys = Object.getOwnPropertyNames || function (o) {
var ar = [];
for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
return ar;
};
return ownKeys(o);
};
return function (mod) {
if (mod && mod.__esModule) return mod;
var result = {};
if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
__setModuleDefault(result, mod);
return result;
};
})();
Object.defineProperty(exports, "__esModule", { value: true });
exports.listDirectory = listDirectory;
exports.listDirectoryRecursive = listDirectoryRecursive;
const path = __importStar(require("path"));
const fs = __importStar(require("fs"));
const glob_1 = require("glob");
async function listDirectory(dirPath, options = {}) {
const { showHidden = false, showDetails = false, maxDepth = 1, ignorePatterns = ["node_modules", "dist", ".git"], } = options;
const results = [];
const resolvedPath = path.resolve(dirPath);
try {
// 检查路径是否存在
if (!fs.existsSync(resolvedPath)) {
throw new Error(`目录不存在: ${dirPath}`);
}
const stats = fs.statSync(resolvedPath);
if (!stats.isDirectory()) {
throw new Error(`路径不是目录: ${dirPath}`);
}
// 使用 fs.readdirSync 列出目录内容
const items = fs.readdirSync(resolvedPath, { withFileTypes: true });
for (const item of items) {
const fileName = item.name;
const isHidden = fileName.startsWith(".");
const itemPath = path.join(resolvedPath, fileName);
// 跳过隐藏文件（除非指定显示）
if (isHidden && !showHidden) {
continue;
}
// 跳过忽略的目录
if (item.isDirectory() && ignorePatterns.includes(fileName)) {
continue;
}
const itemStats = fs.statSync(itemPath);
const relativePath = path.relative(resolvedPath, itemPath);
const result = {
name: fileName,
type: item.isDirectory() ? "directory" : "file",
path: relativePath,
isHidden,
};
if (showDetails) {
result.size = itemStats.size;
result.modified = itemStats.mtime.toISOString().split("T")[0]; // YYYY-MM-DD 格式
}
results.push(result);
}
// 按类型和名称排序
return results.sort((a, b) => {
// 目录在前，文件在后
if (a.type !== b.type) {
return a.type === "directory" ? -1 : 1;
}
// 同类型按名称排序
return a.name.localeCompare(b.name);
});
}
catch (error) {
throw new Error(`列出目录失败: ${error}`);
}
}
// 递归列出目录（用于深度 > 1 的情况）
async function listDirectoryRecursive(dirPath, options = {}) {
const { showHidden = false, showDetails = false, maxDepth = 1, ignorePatterns = ["node_modules", "dist", ".git"], } = options;
if (maxDepth <= 1) {
return listDirectory(dirPath, options);
}
const results = [];
const resolvedPath = path.resolve(dirPath);
try {
// 使用 glob 递归搜索
const globPattern = "**/*";
const ignoreGlob = ignorePatterns.map((pattern) => `**/${pattern}/**`);
const files = await (0, glob_1.glob)(globPattern, {
cwd: resolvedPath,
ignore: ignoreGlob,
absolute: true,
dot: showHidden,
maxDepth: maxDepth - 1,
});
for (const filePath of files) {
const relativePath = path.relative(resolvedPath, filePath);
const fileName = path.basename(filePath);
const isHidden = fileName.startsWith(".");
// 跳过隐藏文件（除非指定显示）
if (isHidden && !showHidden) {
continue;
}
const stats = fs.statSync(filePath);
const item = {
name: fileName,
type: stats.isDirectory() ? "directory" : "file",
path: relativePath,
isHidden,
};
if (showDetails) {
item.size = stats.size;
item.modified = stats.mtime.toISOString().split("T")[0];
}
results.push(item);
}
return results.sort((a, b) => {
if (a.type !== b.type) {
return a.type === "directory" ? -1 : 1;
}
return a.name.localeCompare(b.name);
});
}
catch (error) {
throw new Error(`递归列出目录失败: ${error}`);
}
}
//# sourceMappingURL=ls.js.map