C++ 遍歷文件夾,創建文件夾,刪除文件夾等,字符串拼接

 

int listdir(string src_root,vector<string>& fold_list)
{
    using namespace boost::filesystem;
    if(is_directory(src_root))
    {
        directory_iterator iter_end;
        directory_iterator iter_begin(src_root);
        for (iter_begin;iter_begin!=iter_end;++iter_begin)
        {
            boost::filesystem::path curentpath=(*iter_begin).path();
            if(is_directory(curentpath))
            {
                string curentfoldname=curentpath.filename().string();
                fold_list.push_back(curentfoldname);
            }
        }
    }
    return 0;
}

 

int RecursiveTrav(string dirpath,vector<string>& img_list)
{
    using namespace boost::filesystem;
    if(is_directory(dirpath))
    {
        recursive_directory_iterator end_iter;
        recursive_directory_iterator begin_iter(dirpath);
        for(begin_iter; begin_iter !=end_iter; ++begin_iter)
        {
            string filepath=(*begin_iter).path().string();
            if(is_regular_file(filepath))
            {
                img_list.push_back(filepath);
            }
        }
    }
    return 0;
}

 


int mkdir(string foldpath)
{
    using namespace boost::filesystem;
    if(!exists(foldpath))
    {
        create_directories(foldpath);
    }

    return 0;
}

 

int cleanfile(string filepath)
{
    using namespace boost::filesystem;
    if(exists(filepath))
        remove_all(filepath);
    return 0;
}

 



void SplitString(const string& s, vector<string>& v, const string& c)
{
    string::size_type pos1, pos2;
    pos2 = s.find(c);
    pos1 = 0;
    while(string::npos != pos2)
    {
        v.push_back(s.substr(pos1, pos2-pos1));

        pos1 = pos2 + c.size();
        pos2 = s.find(c, pos1);
    }
    if(pos1 != s.length())
        v.push_back(s.substr(pos1));
}

wAAACH5BAEKAAAALAAAAAABAAEAAAICRAEAOw==

 

 

 

 

 

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章