linux C++获取目录下文件列表

好像经常用到,那就记下来吧(递归遍历子文件夹)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dirent.h>
#include <unistd.h>
std::vector<std::string> readFileList(char *basePath)
{
    std::vector<std::string> result;
    DIR *dir;
    struct dirent *ptr;
    char base[1000];

    if ((dir=opendir(basePath)) == NULL)
    {
        perror("Open dir error...");
        exit(1);
    }

    while ((ptr=readdir(dir)) != NULL)
    {
        if(strcmp(ptr->d_name,".")==0 || strcmp(ptr->d_name,"..")==0)    ///current dir OR parrent dir
            continue;
        else if(ptr->d_type == 8)    ///file
            {printf("d_name:%s/%s\n",basePath,ptr->d_name);
            result.push_back(std::string(ptr->d_name));}
        else if(ptr->d_type == 10)    ///link file
            {printf("d_name:%s/%s\n",basePath,ptr->d_name);
            result.push_back(std::string(ptr->d_name));}
        else if(ptr->d_type == 4)    ///dir
        {
            memset(base,'\0',sizeof(base));
            strcpy(base,basePath);
            strcat(base,"/");
            strcat(base,ptr->d_name);
            result.push_back(std::string(ptr->d_name));
            readFileList(base);
        }
    }
    closedir(dir);
    return result;
}

若使用Qt的话,可以更easy(非递归)

#include <QDir>

QDir dir(rootPath_);
//ir.setFilter(QDir::Hidden | QDir::NoSymLinks);
//dir.setSorting(QDir::Size | QDir::Reversed);
QFileInfoList list = dir.entryInfoList();
for (int i = 2; i < list.size(); ++i)
{
    //do something...for example..
    QFileInfo fileInfo = list.at(i);
    QString str=fileInfo.baseName();
    QStringList subfolderpathlist;
    QDir subdir(fileInfo.filePath());
    QFileInfoList sublist = subdir.entryInfoList();
    for(int j = 2;j<sublist.size();j++)
    {
        QFileInfo subfileInfo = sublist.at(j);
        subfolderpathlist.push_back(subfileInfo.filePath());
    }
}

猜你喜欢

转载自blog.csdn.net/mllearnertj/article/details/78202457