如何在 Win32 上快速枚举目录?

问题描述

我正在尝试加速 C++ 中的目录枚举，我正在递归到子目录中.我目前有一个应用程序，它在 FindFirst/FindNextFile API 上花费了 95% 的时间，并且需要几分钟来枚举给定卷上的所有文件.我知道可以更快地做到这一点，因为有一个应用程序可以做到:一切.它会在几秒钟内枚举我的整个驱动器.

I'm trying to speedup directory enumeration in C++, where I'm recursing into subdirectories. I currently have an app which spends 95% of it's time in FindFirst/FindNextFile APIs, and it takes several minutes to enumerate all the files on a given volume. I know it's possible to do this faster because there is an app that does: Everything. It enumerates my entire drive in seconds.

我怎样才能完成这样的事情?

How might I accomplish something like this?

推荐答案

我意识到这是一个旧帖子，但是 source forge 上有一个项目可以完全满足您的要求并且源代码可用.

I realize this is an old post, but there is a project on source forge that does exactly what you are asking and the source code is available.

您可以在这里找到该项目:NTFS-Search

You can find the project here: NTFS-Search

这篇关于如何在 Win32 上快速枚举目录?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！