C / C++ / MFC

Not everything that can be counted counts, and not everything that counts can be counted. - Albert Einstein

using namespace std;
 
typedef string FileName;
typedef vector< FileName > FileNames;
typedef auto_ptr< FileNames > FileNamesPtr;
typedef map< FileName, FileNamesPtr > MasterToFileNamesPtrMap;

MasterToFileNamesPtrMap map;  // to create the map
 
FileNamesPtr pFN(new FileNames);  // to create the vector of file names
 
pFN->push_back(fileName);  // to add a file to the vector
 
map[masterFileName] = pFN;  // to add the vector to the map for a given master file

typedef std::list<std::string> FileList;
typedef FileList::iterator FileListIterator;

struct SortByDate : public std::binary_function<std::string, std::string, bool>
{
public:
	SortByDate(const char* dir) : m_dir(dir) {}

	bool operator()(const std::string& lhs, const std::string& rhs)
	{
		struct stat st = {0};
		
		std::string filename = m_dir;
		filename += "\\";
		filename += lhs;

		if (stat(filename.c_str(), &st) == -1)
		{
			return true;
		}

		int lhs_ctime = st.st_ctime;

		filename = m_dir;
		filename += "\\";
		filename += rhs;

		if (stat(filename.c_str(), &st) == -1)
		{
			return false;
		}

		int rhs_ctime = st.st_ctime;

		return lhs_ctime < rhs_ctime;
	}
private:
	const char* m_dir;
};

// Returns a list of files in a directory sorted by date
// NOTE: does not recurse subdirectories
bool GetDirectoryList(const char* dir, FileList& fileList)
{
	DEBUGF("GetDirectoryList %s", dir);

	HANDLE hSearch;
	WIN32_FIND_DATA FindData;
	char tmpDir[MAX_PATH*2];

	lstrcpy(tmpDir, dir);
	lstrcat(tmpDir, "\\*.*");
	hSearch = FindFirstFile(tmpDir, &FindData);
	
	if (INVALID_HANDLE_VALUE == hSearch)
	{
		return false;
	}
	
	do 
	{
		if (!(FindData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY))
		{
			// Insert files sorted by date
			fileList.insert(std::upper_bound(fileList.begin(),
							 fileList.end(),
							 FindData.cFileName,
							 SortByDate(dir)), 
							 FindData.cFileName);
		}
	} 
	while (FindNextFile(hSearch, &FindData));

	FindClose(hSearch);
	return true;
}