如何快速枚举Win32上的目录？ [英] How can I quickly enumerate directories on Win32?

问题描述

我试图在C ++中加速目录枚举，其中我被递归到子目录。我目前有一个应用程序花了95％的时间在FindFirst / FindNextFile API，它需要几分钟枚举给定卷上的所有文件。我知道这可能更快，因为有一个应用程序：一切。

解决方案

/ div>

我意识到这是一个老帖子，但是有一个源代码伪造的项目，它完全按照你的要求和源代码可用。

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

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?

解决方案

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.

You can find the project here: NTFS-Search

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