list(buf,indentlevel+4);
你应该更改为list(buf,indentlevel+1)
,因为你只打算一级。这样您可以跟踪目录级别。添加另一个功能来添加额外的空格。看下面的例子:
void space(int level, int file)
{
int i;
for (i = 0; i < level + 1; i++)
printf("\x0b3 "); // add the '│' character
if (file)
printf("\x0c3\x0c4 "); // add '├' and '─' characters
}
void list(const char *path, int indentlevel)
{
DIR *dirp = opendir(path);
struct dirent *dentry;
char buf[1024];
if (!dirp)
{
printf("%*sNo access\n",indentlevel,"");
return;
}
int i;
while ((dentry = readdir(dirp)) != NULL)
{
sprintf(buf,"%s/%s", path, dentry->d_name);
switch (testDir(buf,dentry->d_name))
{
case doSkip:
break;
case isDir:
space(indentlevel, 1);
putchar('\n');
space(indentlevel, 0);
printf("[ %s ]\n",dentry->d_name);
list(buf,indentlevel+1);
break;
case isFile:
space(indentlevel-1, 1);
printf("%s\n",dentry->d_name);
break;
}
}
closedir(dirp);
}
这里是一个更复杂的版本,它在缓冲区中存储数据,所以它可以找到文件夹中的最后一个孩子,并得出正确的“方缘”字的最后一个项目。它仍然打印一些额外的垂直线,需要照顾。
//store directory information
typedef struct TT_dir
{
char* name;
int isdir;
int level;
int islast;
} T_dir;
//vector for holding lines of data
typedef struct TT_vector
{
T_dir *data;
int capacity;
int size;
} T_vector;
void vector_add(T_vector *pvec, char *buf, int isdir, int level)
{
if (pvec->size == pvec->capacity)
{
pvec->capacity += 16;
pvec->data = realloc(pvec->data, pvec->capacity * sizeof(T_dir));
}
char *duplicate = malloc(strlen(buf) + 1);
strcpy(duplicate, buf);
pvec->data[pvec->size].name = duplicate;
pvec->data[pvec->size].isdir = isdir;
pvec->data[pvec->size].level = level;
pvec->data[pvec->size].islast = 0;
pvec->size++;
}
void list(const char *path, int level, T_vector *pvec)
{
DIR *dirp = opendir(path);
struct dirent *dentry;
char buf[4096];
if (!dirp)
{
printf("%*sNo access\n", level, "");
return;
}
int haschildren = 0;
while ((dentry = readdir(dirp)) != NULL)
{
sprintf(buf, "%s/%s", path, dentry->d_name);
switch (testDir(buf, dentry->d_name))
{
case doSkip:
break;
case isDir:
//show progress:
printf(".");
//add directory info to vector array
vector_add(pvec, dentry->d_name, 1, level);
//next dir...
list(buf, level + 1, pvec);
haschildren = 1;
break;
case isFile:
//add directory info to vector array
vector_add(pvec, dentry->d_name, 0, level);
haschildren = 1;
break;
}
}
//needs this information for drawing the correct character
if (haschildren)
pvec->data[pvec->size - 1].islast = 1;
closedir(dirp);
}
int main()
{
T_vector vec;
vec.capacity = 0;
vec.size = 0;
vec.data = 0;
list(".", 0, &vec);
printf("\n");
int i, k;
for (i = 0; i < vec.size; i++)
{
if (vec.data[i].isdir)
{
for (k = 0; k < vec.data[i].level; k++) printf("\x0b3 ");
printf("\x0b3\n");
for (k = 0; k < vec.data[i].level; k++) printf("\x0b3 ");
printf(vec.data[i].islast ? "\x0c0" : "\x0c3");
printf("\x0c4 %s:\n", vec.data[i].name);
}
else
{
for (k = 0; k < vec.data[i].level; k++) printf("\x0b3 ");
printf(vec.data[i].islast ? "\x0c0" : "\x0c3");
printf("\x0c4 %s\n", vec.data[i].name);
}
}
return 0;
}
您需要一个缩进级别的列表,为多于一个子目录深度绘制多个并行分支。 – tripleee
我看到的唯一区别是树命令的输出是排序的。因此,如果您想对结果进行排序,只需将它们放入某种容器中,然后进行分类和打印。如果有更多的分类,让我知道。 – Klaus
如何制作缩进级别列表? @tripleee – Hmmmmm