I am a fan of boost::filesystem
also. It takes minimal effort to write what you want. The following example(just to give you a feel of how it looks like), asks the user to enter a path and a file name, and it will get paths of all the files with that name no matter whether they are in the root dir, or in any sub dir of that root dir:
#include <iostream>
#include <string>
#include <vector>
#include <boost/filesystem.hpp>
using namespace std;
using namespace boost::filesystem;
void find_file(const path& root,
const string& file_name,
vector<path>& found_files)
{
directory_iterator current_file(root), end_file;
bool found_file_in_dir = false;
for( ; current_file != end_file; ++current_file)
{
if( is_directory(current_file->status()) )
find_file(*current_file, file_name, found_files);
if( !found_file_in_dir && current_file->leaf() == file_name )
{
// Now we have found a file with the specified name,
// which means that there are no more files with the same
// name in the __same__ directory. What we have to do next,
// is to look for sub directories only, without checking other files.
found_files.push_back(*current_file);
found_file_in_dir = true;
}
}
}
int main()
{
string file_name;
string root_path;
vector<path> found_files;
std::cout << root_path;
cout << "Please enter the name of the file to be found(with extension): ";
cin >> file_name;
cout << "Please enter the starting path of the search: ";
cin >> root_path;
cout << endl;
find_file(root_path, file_name, found_files);
for( std::size_t i = 0; i < found_files.size(); ++i)
cout << found_files[i] << endl;
}