hangg
Version:
33 lines (32 loc) • 899 B
JavaScript
const fs=require('fs');
const path=require('path');
let target=path.join(__dirname,'../');
function loadTree(target,deep){
let prev=new Array(deep).join(' |');
let dirinfo=fs.readdirSync(target);
let files=[];
let dirs=[];
for (let i = 0; i < dirinfo.length; i++) {
let state= fs.statSync(path.join(target,dirinfo[i]));
if (state.isFile()) {
files.push(dirinfo[i])
}else{
dirs.push(dirinfo[i])
}
}
for (let i = 0; i < dirs.length; i++) {
console.log(`${prev} ├─ ${dirs[i]}`)
let nextPath=path.join(target,dirs[i])
let nextdeep=deep+1;
loadTree(nextPath,nextdeep)
}
for (let i =files.length-1 ; i >= 0; i--) {
if (i===0) {
console.log(`${prev} └─ ${files[i]}`)
}else{
console.log(`${prev} ├─ ${files[i]}`)
}
}
}
loadTree(target,1);