#pragma once


#ifdef _WIN32
#define WIN32_LEAN_AND_MEAN
#include <Windows.h>
#include <io.h>
#include <WinSock.h>
#else
#include <limits.h>
#include <dlfcn.h> //dlopen
//!MAX_PATH
#ifndef MAX_PATH
#define MAX_PATH 260 
#endif

#endif

#include <string>
#include <vector>
#include <time.h>
#include <algorithm>
using namespace std;

namespace FileUtils
{
	//!ȡ׼Ŀ¼·
	string GetStandPath(const char* path);
	string GetStandFilePath(const char* filePath);
	bool FileDelete(const char* file);
	string GetFileExt(const char* filePath);
	string GetFileName(const char* filePath);


	string GetCurrentDir();

	bool IsDirectory(const char* path);
	bool DirExists(const char* path);
	bool DirCreate(const char* path);
	bool DirDelete(const char* path);
	bool DirCreateRecursion(const char* path);
	bool DirDeleteRecursion(const char* path);


	struct file_t
	{
		char filename[MAX_PATH];
		char fullpath[MAX_PATH];
		unsigned long long filesize;
		bool isDir;
	};
	//!
	bool SearchFiles(const char* path, vector<file_t> & files);
	template < typename OP >
	inline bool ForEachFiles(const char* path, const OP& op)
	{
		vector<file_t> files;
		if (SearchFiles(path, files))
		{
			class eachfile
			{
			public:
				eachfile(const OP& op)
					: m_op(op)
				{
				}
				void operator()(file_t file)
				{
					m_op(file.filename);
				}
				const OP& m_op;
			};
			std::for_each(files.begin(), files.end(), eachfile(op));
			return true;
		}
		return false;
	}
}