使用 C++ filesystem 递归目录

#include 
#include 
#include 
#include 
#include 

std::string w2a(const std::wstring& utf8)
{
	int buffSize = WideCharToMultiByte(CP_UTF8, NULL, utf8.c_str(), -1, NULL, NULL, NULL, FALSE);
	char* bf = new char[buffSize + 1];
	memset(bf, 0, buffSize + 1);
	WideCharToMultiByte(CP_UTF8, NULL, utf8.c_str(), -1, bf, buffSize, NULL, FALSE);
	std::string result(bf);
	delete[] bf;
	bf = nullptr;
	return result;
}

struct TreeNode
{
	TreeNode(const std::filesystem::path newPath) {
		path = newPath;
	}
	void addChild(std::shared_ptr child) {
		children.push_back(child);
	}
	std::string name() {
		return w2a(path.native());
	}
	std::vector> data() {
		return children;
	}
	std::filesystem::path path;
	std::vector> children;
};

// none member function
void recursion(const std::filesystem::path path, std::shared_ptr& node) {
	for (auto& p : std::filesystem::directory_iterator(path)) {
		if (p.is_directory()) {
			auto newNode = std::make_shared(p.path());
			node->addChild(newNode);
			recursion(p.path(), newNode);
			std::wcout << p.path().native() << 'n';
		}
	}
}

void recursion_node(std::fstream& fs, std::shared_ptr& node, int depth) {
	std::string str = "";
	for (int i = 0; i < depth; i++) {
		str += "t";
	}

	fs << node->name() << std::endl;
	depth++;
	for (auto& v : node->data()) {
		fs << str;
		recursion_node(fs, v, depth);
	}
}

void print(const std::string& filename, std::shared_ptr& root) {
	std::fstream fs(filename, std::fstream::trunc | std::fstream::out);
	if (!fs.is_open()) {
		std::cout << "failed to open " << filename << std::endl;
		return;
	}

	recursion_node(fs, root, 1);
}


int main()
{
	auto rc = std::filesystem::path(R"(A:Temproot)");

	auto root = std::make_shared(rc);
	recursion(rc, root);

	print("aaaa4.txt", root);
}