blocks|key|1549110|text|您需要调用特定于操作系统的函数来遍历文件系统，如open()和readdir()。C标准没有指定任何与文件系统相关的函数。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1549111|entityMap^0|O|6|V|9|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]|$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|M|8|@]|D|@]|E|$]]]|G|$]]

You need to call OS-specific functions for filesystem traversal, like <code>open()</code> and <code>readdir()</code>. The C standard does not specify any filesystem-related functions.

blocks|key|1764132|text|在标准C%2B%2B中，由于标准C%2B%2B没有目录的概念，从技术上讲没有办法做到这一点。如果你想扩展一下你的网络，你可能会考虑使用Boost.FileSystem。这已经被接受为包含在TR2中，所以这为您提供了最好的机会，使您的实现尽可能接近标准。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1764133|下面是一个直接取自网站的例子：|1764134|bool+find_file(+const+path+&+dir_path,+++++++++//+in+this+directory,
++++++++++++++++const+std::string+&+file_name,+//+search+for+this+name,
++++++++++++++++path+&+path_found+)++++++++++++//+placing+path+here+if+found
{
++if+(+!exists(+dir_path+)+)+return+false;
++directory_iterator+end_itr;+//+default+construction+yields+past-the-end
++for+(+directory_iterator+itr(+dir_path+);
++++++++itr+!=+end_itr;
++++++++%2B%2Bitr+)
++{
++++if+(+is_directory(itr->status())+)
++++{
++++++if+(+find_file(+itr->path(),+file_name,+path_found+)+)+return+true;
++++}
++++else+if+(+itr->leaf()+==+file_name+)+//+see+below
++++{
++++++path_found+=+itr->path();
++++++return+true;
++++}
++}
++return+false;
}|code-block|syntax|javascript|1764135|entityMap|0|LINK|mutability|MUTABLE|url|http://www.boost.org/doc/libs/1_36_0/libs/filesystem/doc/index.htm^0|1N|G|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|6|7|W|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|X|8|@]|9|@]|C|$I|J]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

In standard C++, technically there is no way to do this since standard C++ has no conception of directories. If you want to expand your net a little bit, you might like to look at using <a href="http://www.boost.org/doc/libs/1_36_0/libs/filesystem/doc/index.htm" rel="noreferrer">Boost.FileSystem</a>. This has been accepted for inclusion in TR2, so this gives you the best chance of keeping your implementation as close as possible to the standard.

An example, taken straight from the website:

<pre><code>bool find_file( const path &amp; dir_path, // in this directory,
 const std::string &amp; file_name, // search for this name,
 path &amp; path_found ) // placing path here if found
{
 if ( !exists( dir_path ) ) return false;
 directory_iterator end_itr; // default construction yields past-the-end
 for ( directory_iterator itr( dir_path );
 itr != end_itr;
 ++itr )
 {
 if ( is_directory(itr-&gt;status()) )
 {
 if ( find_file( itr-&gt;path(), file_name, path_found ) ) return true;
 }
 else if ( itr-&gt;leaf() == file_name ) // see below
 {
 path_found = itr-&gt;path();
 return true;
 }
 }
 return false;
}
</code></pre>

blocks|key|1549234|text|你不需要。标准的C%2B%2B不公开目录的概念。具体地说，它没有提供任何列出目录中所有文件的方法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1549235|一个可怕的黑客攻击就是使用system()调用并解析结果。最合理的解决方案是使用某种跨平台库，例如Qt甚至POSIX。|offset|length|1549236|entityMap|0|LINK|mutability|MUTABLE|url|https://en.wikipedia.org/wiki/Qt_%2528software%2529|1|http://en.wikipedia.org/wiki/POSIX^0|0|1D|2|0|1H|5|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@$D|R|E|S|1|T]|$D|U|E|V|1|W]]|A|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]|N|$5|I|J|K|A|$L|O]]]]

You don't. Standard C++ doesn't expose to concept of a directory. Specifically it doesn't give any way to list all the files in a directory.

A horrible hack would be to use system() calls and to parse the results. The most reasonable solution would be to use some kind of cross-platform library such as <a href="https://en.wikipedia.org/wiki/Qt_%28software%29" rel="nofollow noreferrer">Qt</a> or even <a href="http://en.wikipedia.org/wiki/POSIX" rel="nofollow noreferrer">POSIX</a>.

blocks|key|1549270|text|C%2B%2B标准没有目录的概念。将字符串转换为文件句柄是由实现决定的。该字符串的内容以及它映射到的内容依赖于操作系统。请记住，C%2B%2B可以用来编写OS，因此它的使用级别尚未定义如何遍历目录(因为您正在编写目录管理代码)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1549271|请查看您的操作系统API文档，了解如何执行此操作。如果你需要便携，你将不得不有一堆适用于各种OSes的#ifdef。|offset|length|1549272|entityMap|0|LINK|mutability|MUTABLE|url|https://en.wikipedia.org/wiki/C_preprocessor#Conditional_compilation^0|0|1F|6|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

You don't. The C++ standard has no concept of directories. It is up to the implementation to turn a string into a file handle. The contents of that string and what it maps to is OS dependent. Keep in mind that C++ can be used to write that OS, so it gets used at a level where asking how to iterate through a directory is not yet defined (because you are writing the directory management code).

Look at your OS API documentation for how to do this. If you need to be portable, you will have to have a bunch of <a href="https://en.wikipedia.org/wiki/C_preprocessor#Conditional_compilation" rel="nofollow noreferrer">#ifdef</a>s for various OSes.

blocks|key|1764259|text|除了上面提到的boost：：文件系统之外，您可能还想检查一下wxWidgets::wxDir和Qt::QDir。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1764260|wxWidgets和Qt都是开源的、跨平台的C%2B%2B框架。|1764261|wxDir提供了一种使用Traverse()或更简单的GetAllFiles()函数递归遍历文件的灵活方法。同样，您可以使用GetFirst()和GetNext()函数实现遍历(我假设Traverse()和GetAllFiles()是最终使用GetFirst()和GetNext()函数的包装器)。|style|CODE|1764262|QDir提供对目录结构及其内容的访问。有几种使用QDir遍历目录的方法。您可以使用使用QDirIterator::Subdirectories标志实例化的QDirIterator遍历目录内容(包括子目录)。另一种方法是使用QDir的GetEntryList()函数并实现递归遍历。|1764263|下面是示例代码(摘自here+#+Example+8-5)，它展示了如何遍历所有子目录。|1764264|#include+<qapplication.h>
#include+<qdir.h>
#include+<iostream>

int+main(+int+argc,+char+**argv+)
{
++++QApplication+a(+argc,+argv+);
++++QDir+currentDir+=+QDir::current();

++++currentDir.setFilter(+QDir::Dirs+);
++++QStringList+entries+=+currentDir.entryList();
++++for(+QStringList::ConstIterator+entry=entries.begin();+entry!=entries.end();+%2B%2Bentry)+
++++{
+++++++++std::cout+<<+*entry+<<+std::endl;
++++}
++++return+0;
}|code-block|syntax|javascript|1764265|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.wxwidgets.org/2.8/wx_wxdir.html|1|http://qt.nokia.com/doc/4.5/qdir.html|2|http://www.digitalfanatics.org/projects/qt_tutorial/chapter08.html^0|U|G|0|1B|8|1|0|0|0|5|C|A|R|D|1Q|A|21|9|0|0|4|0|A|4|2|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]|$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|6|7|1B|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|1C|8|@$A|1D|B|1E|H|I]|$A|1F|B|1G|H|I]|$A|1H|B|1I|H|I]|$A|1J|B|1K|H|I]|$A|1L|B|1M|H|I]]|9|@]|C|$]]|$1|J|3|K|5|6|7|1N|8|@$A|1O|B|1P|H|I]]|9|@]|C|$]]|$1|L|3|M|5|6|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]]|C|$]]|$1|N|3|O|5|P|7|1U|8|@]|9|@]|C|$Q|R]]|$1|S|3|-4|5|6|7|1V|8|@]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]]]

In addition to the above mentioned boost::filesystem you may want to examine <a href="http://docs.wxwidgets.org/2.8/wx_wxdir.html" rel="noreferrer">wxWidgets::wxDir</a> and <a href="http://qt.nokia.com/doc/4.5/qdir.html" rel="noreferrer">Qt::QDir</a>.

Both wxWidgets and Qt are open source, cross platform C++ frameworks.

<code>wxDir</code> provides a flexible way to traverse files recursively using <code>Traverse()</code> or a simpler <code>GetAllFiles()</code> function. As well you can implement the traversal with <code>GetFirst()</code> and <code>GetNext()</code> functions (I assume that Traverse() and GetAllFiles() are wrappers that eventually use GetFirst() and GetNext() functions).

<code>QDir</code> provides access to directory structures and their contents. There are several ways to traverse directories with QDir. You can iterate over the directory contents (including sub-directories) with QDirIterator that was instantiated with QDirIterator::Subdirectories flag. Another way is to use QDir's GetEntryList() function and implement a recursive traversal.

Here is sample code (taken from <a href="http://www.digitalfanatics.org/projects/qt_tutorial/chapter08.html" rel="noreferrer">here</a> # Example 8-5) that shows how to iterate over all sub directories.

<pre><code>#include &lt;qapplication.h&gt;
#include &lt;qdir.h&gt;
#include &lt;iostream&gt;

int main( int argc, char **argv )
{
 QApplication a( argc, argv );
 QDir currentDir = QDir::current();

 currentDir.setFilter( QDir::Dirs );
 QStringList entries = currentDir.entryList();
 for( QStringList::ConstIterator entry=entries.begin(); entry!=entries.end(); ++entry) 
 {
 std::cout &lt;&lt; *entry &lt;&lt; std::endl;
 }
 return 0;
}
</code></pre>

blocks|key|1549359|text|一个快速的解决方案是使用C的Dirent.h库。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1549360|来自维基百科的工作代码片段：|1549361|#include+<stdio.h>
#include+<dirent.h>

int+listdir(const+char+*path)+{
++++struct+dirent+*entry;
++++DIR+*dp;

++++dp+=+opendir(path);
++++if+(dp+==+NULL)+{
++++++++perror("opendir:+Path+does+not+exist+or+could+not+be+read.");
++++++++return+-1;
++++}

++++while+((entry+=+readdir(dp)))
++++++++puts(entry->d_name);

++++closedir(dp);
++++return+0;
}|code-block|syntax|javascript|1549362|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Dirent.h^0|E|8|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|6|7|W|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|X|8|@]|9|@]|C|$I|J]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

A fast solution is using C's <a href="http://en.wikipedia.org/wiki/Dirent.h">Dirent.h</a> library.

Working code fragment from Wikipedia:

<pre><code>#include &lt;stdio.h&gt;
#include &lt;dirent.h&gt;

int listdir(const char *path) {
 struct dirent *entry;
 DIR *dp;

 dp = opendir(path);
 if (dp == NULL) {
 perror("opendir: Path does not exist or could not be read.");
 return -1;
 }

 while ((entry = readdir(dp)))
 puts(entry-&gt;d_name);

 closedir(dp);
 return 0;
}
</code></pre>

blocks|key|1549427|text|使用新的基于for和Boost的C%2B%2B11范围，您可以使它变得更加简单|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1549428|#include+<boost/filesystem.hpp>

using+namespace+boost::filesystem;++++
struct+recursive_directory_range
{
++++typedef+recursive_directory_iterator+iterator;
++++recursive_directory_range(path+p)+:+p_(p)+{}

++++iterator+begin()+{+return+recursive_directory_iterator(p_);+}
++++iterator+end()+{+return+recursive_directory_iterator();+}

++++path+p_;
};

for+(auto+it+:+recursive_directory_range(dir_path))
{
++++std::cout+<<+it+<<+std::endl;
}|code-block|syntax|javascript|1549429|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Boost_%2528C%2B%2B_libraries%2529|1|https://en.wikipedia.org/wiki/C%2B%2B11^0|6|3|A|5|0|G|5|1|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@$9|X|A|Y|1|Z]|$9|10|A|11|1|12]]|E|$]]|$1|F|3|G|5|H|7|13|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|14|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]|S|$5|N|O|P|E|$Q|T]]]]

You can make it even simpler with the new <a href="https://en.wikipedia.org/wiki/C++11" rel="noreferrer">C++11</a> range based <code>for</code> and <a href="http://en.wikipedia.org/wiki/Boost_%28C++_libraries%29" rel="noreferrer">Boost</a>:

<pre><code>#include &lt;boost/filesystem.hpp&gt;

using namespace boost::filesystem; 
struct recursive_directory_range
{
 typedef recursive_directory_iterator iterator;
 recursive_directory_range(path p) : p_(p) {}

 iterator begin() { return recursive_directory_iterator(p_); }
 iterator end() { return recursive_directory_iterator(); }

 path p_;
};

for (auto it : recursive_directory_range(dir_path))
{
 std::cout &lt;&lt; it &lt;&lt; std::endl;
}
</code></pre>

blocks|key|1549509|text|在POSIX系统上，您可以使用ftw(3)+or+nftw(3)在C或C%2B%2B中遍历文件系统层次结构。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1549510|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/POSIX|1|http://linux.die.net/man/3/ftw^0|F|6|P|7|1|5|0|F|H|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@$9|Q|A|R|B|C]|$9|S|A|T|B|C]]|D|@$9|U|A|V|1|W]|$9|X|A|Y|1|Z]]|E|$]]|$1|F|3|-4|5|6|7|10|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]|N|$5|I|J|K|E|$L|O]]]]

You can use <a href="http://linux.die.net/man/3/ftw" rel="noreferrer"><code>ftw(3)</code> or <code>nftw(3)</code></a> to walk a filesystem hierarchy in C or C++ on <a href="http://en.wikipedia.org/wiki/POSIX" rel="noreferrer">POSIX</a> systems.

blocks|key|1549523|text|Boost::filesystem提供了recursive_directory_iterator，这对于这个任务来说非常方便：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1549524|#include+"boost/filesystem.hpp"
#include+<iostream>

using+namespace+boost::filesystem;

recursive_directory_iterator+end;
for+(recursive_directory_iterator+it("./");+it+!=+end;+%2B%2Bit)+{
++++std::cout+<<+*it+<<+std::endl;++++++++++++++++++++++++++++++++++++
}|code-block|syntax|javascript|1549525|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Boost::filesystem provides recursive_directory_iterator, which is quite convenient for this task:

<pre><code>#include "boost/filesystem.hpp"
#include &lt;iostream&gt;

using namespace boost::filesystem;

recursive_directory_iterator end;
for (recursive_directory_iterator it("./"); it != end; ++it) {
 std::cout &lt;&lt; *it &lt;&lt; std::endl; 
}
</code></pre>

blocks|key|1764586|text|如果您使用的是Windows系统，则可以将FindFirstFile与FindNextFile接口一起使用。您可以使用FindFileData.dwFileAttributes检查给定的路径是文件还是目录。如果它是一个目录，你可以递归地重复这个算法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1764587|在这里，我整理了一些代码，列出了Windows机器上的所有文件。|1764588|http://dreams-soft.com/projects/traverse-directory|offset|length|1764589|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|1E|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Q|8|@]|9|@$F|R|G|S|1|T]]|A|$]]|$1|H|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|E]]]]

If you are on Windows, you can use the FindFirstFile together with FindNextFile API. You can use FindFileData.dwFileAttributes to check if a given path is a file or a directory. If it's a directory, you can recursively repeat the algorithm.

Here, I have put together some code that lists all the files on a Windows machine.

<a href="http://dreams-soft.com/projects/traverse-directory" rel="nofollow">http://dreams-soft.com/projects/traverse-directory</a>

blocks|key|1549666|text|从C%2B%2B17、标头和range-for开始，您可以简单地执行以下操作：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1549667|#include+<filesystem>

using+recursive_directory_iterator+=+std::filesystem::recursive_directory_iterator;
...
for+(const+auto&+dirEntry+:+recursive_directory_iterator(myPath))
+++++std::cout+<<+dirEntry+<<+std::endl;|code-block|syntax|javascript|1549668|从C%2B%2B17开始，std::filesystem是标准库的一部分，可以在<filesystem>头文件中找到(不再是“实验性的”)。|1549669|entityMap^0|G|3|0|0|9|F|10|C|0^^$0|@$1|2|3|4|5|6|7|O|8|@$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|R|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|S|8|@$9|T|A|U|B|C]|$9|V|A|W|B|C]]|D|@]|E|$]]|$1|M|3|-4|5|6|7|X|8|@]|D|@]|E|$]]]|N|$]]

From C++17 onward, the <a href="https://en.cppreference.com/w/cpp/filesystem/recursive_directory_iterator" rel="noreferrer"><code>&lt;filesystem&gt;</code></a> header, and range-<code>for</code>, you can simply do this:

<pre><code>#include &lt;filesystem&gt;

using recursive_directory_iterator = std::filesystem::recursive_directory_iterator;
...
for (const auto&amp; dirEntry : recursive_directory_iterator(myPath))
 std::cout &lt;&lt; dirEntry &lt;&lt; std::endl;
</code></pre>

As of C++17, <code>std::filesystem</code> is part of the standard library and can be found in the <code>&lt;filesystem&gt;</code> header (no longer "experimental").

blocks|key|1764701|text|您可以使用std::filesystem::recursive_directory_iterator。但要注意，这包括符号(软)链接。如果你想避免它们，你可以使用is_symlink。示例用法：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1764702|size_t+directory_size(const+std::filesystem::path&+directory)
{
++++size_t+size{+0+};
++++for+(const+auto&+entry+:+std::filesystem::recursive_directory_iterator(directory))
++++{
++++++++if+(entry.is_regular_file()+&&+!entry.is_symlink())
++++++++{
++++++++++++size+%2B=+entry.file_size();
++++++++}
++++}
++++return+size;
}|code-block|syntax|javascript|1764703|entityMap^0|5|19|29|A|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|R|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|S|8|@]|D|@]|E|$]]]|L|$]]

You can use <code>std::filesystem::recursive_directory_iterator</code>. But beware, this includes symbolic (soft) links. If you want to avoid them you can use <code>is_symlink</code>. Example usage:
<pre><code>size_t directory_size(const std::filesystem::path&amp; directory)
{
 size_t size{ 0 };
 for (const auto&amp; entry : std::filesystem::recursive_directory_iterator(directory))
 {
 if (entry.is_regular_file() &amp;&amp; !entry.is_symlink())
 {
 size += entry.file_size();
 }
 }
 return size;
}
</code></pre>

blocks|key|1764770|text|文件树遍历ftw是一种递归的方式来在路径中隔离整个目录树。更多细节请访问here。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1764771|注意:您还可以使用可以跳过隐藏文件的fts，如.、..或.bashrc|1764772|#include+<ftw.h>
#include+<stdio.h>
#include+<sys/stat.h>
#include+<string.h>

+
int+list(const+char+*name,+const+struct+stat+*status,+int+type)
{
+++++if+(type+==+FTW_NS)
+++++{
+++++++++return+0;
+++++}

+++++if+(type+==+FTW_F)
+++++{
+++++++++printf("0%253o\t%25s\n",+status->st_mode&0777,+name);
+++++}

+++++if+(type+==+FTW_D+&&+strcmp(".",+name)+!=+0)
+++++{
+++++++++printf("0%253o\t%25s/\n",+status->st_mode&0777,+name);
+++++}
+++++return+0;
}

int+main(int+argc,+char+*argv[])
{
+++++if(argc+==+1)
+++++{
+++++++++ftw(".",+list,+1);
+++++}
+++++else
+++++{
+++++++++ftw(argv[1],+list,+1);
+++++}

+++++return+0;
}|code-block|syntax|javascript|1764773|输出如下所示：|1764774|0755++++./Shivaji/
0644++++./Shivaji/20200516_204454.png
0644++++./Shivaji/20200527_160408.png
0644++++./Shivaji/20200527_160352.png
0644++++./Shivaji/20200520_174754.png
0644++++./Shivaji/20200520_180103.png
0755++++./Saif/
0644++++./Saif/Snapchat-1751229005.jpg
0644++++./Saif/Snapchat-1356123194.jpg
0644++++./Saif/Snapchat-613911286.jpg
0644++++./Saif/Snapchat-107742096.jpg
0755++++./Milind/
0644++++./Milind/IMG_1828.JPG
0644++++./Milind/IMG_1839.JPG
0644++++./Milind/IMG_1825.JPG
0644++++./Milind/IMG_1831.JPG
0644++++./Milind/IMG_1840.JPG|1764775|假设您想要匹配一个文件名(例如:搜索所有的*.jpg,+*.jpeg,+*.png文件。)对于特定的需求，可以使用fnmatch。|1764776|+#include+<ftw.h>
+#include+<stdio.h>
+#include+<sys/stat.h>
+#include+<iostream>
+#include+<fnmatch.h>

+static+const+char+*filters[]+=+{
+++++"*.jpg",+"*.jpeg",+"*.png"
+};

+int+list(const+char+*name,+const+struct+stat+*status,+int+type)
+{
+++++if+(type+==+FTW_NS)
+++++{
+++++++++return+0;
+++++}

+++++if+(type+==+FTW_F)
+++++{
+++++++++int+i;
+++++++++for+(i+=+0;+i+<+sizeof(filters)+/+sizeof(filters[0]);+i%2B%2B)+{
+++++++++++++/*+if+the+filename+matches+the+filter,+*/
+++++++++++++if+(fnmatch(filters[i],+name,+FNM_CASEFOLD)+==+0)+{
+++++++++++++++++printf("0%253o\t%25s\n",+status->st_mode&0777,+name);
+++++++++++++++++break;
+++++++++++++}
+++++++++}
+++++}

+++++if+(type+==+FTW_D+&&+strcmp(".",+name)+!=+0)
+++++{
+++++++++//printf("0%253o\t%25s/\n",+status->st_mode&0777,+name);
+++++}
+++++return+0;
+}

+int+main(int+argc,+char+*argv[])
+{
+++++if(argc+==+1)
+++++{
+++++++++ftw(".",+list,+1);
+++++}
+++++else
+++++{
+++++++++ftw(argv[1],+list,+1);
+++++}

+++++return+0;
+}|1764777|entityMap|0|LINK|mutability|MUTABLE|url|https://linux.die.net/man/3/ftw^0|5|3|10|4|0|0|I|3|N|1|P|2|S|7|0|0|0|0|L|K|1L|7|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@$9|13|A|14|B|C]]|D|@$9|15|A|16|1|17]]|E|$]]|$1|F|3|G|5|6|7|18|8|@$9|19|A|1A|B|C]|$9|1B|A|1C|B|C]|$9|1D|A|1E|B|C]|$9|1F|A|1G|B|C]]|D|@]|E|$]]|$1|H|3|I|5|J|7|1H|8|@]|D|@]|E|$K|L]]|$1|M|3|N|5|6|7|1I|8|@]|D|@]|E|$]]|$1|O|3|P|5|J|7|1J|8|@]|D|@]|E|$K|L]]|$1|Q|3|R|5|6|7|1K|8|@$9|1L|A|1M|B|C]|$9|1N|A|1O|B|C]]|D|@]|E|$]]|$1|S|3|T|5|J|7|1P|8|@]|D|@]|E|$K|L]]|$1|U|3|-4|5|6|7|1Q|8|@]|D|@]|E|$]]]|V|$W|$5|X|Y|Z|E|$10|11]]]]

File tree walk <code>ftw</code> is a recursive way to wall the whole directory tree in the path. More details are <a href="https://linux.die.net/man/3/ftw" rel="nofollow noreferrer">here</a>.
NOTE : You can also use <code>fts</code> that can skip hidden files like <code>.</code> or <code>..</code> or <code>.bashrc</code>
<pre><code>#include &lt;ftw.h&gt;
#include &lt;stdio.h&gt;
#include &lt;sys/stat.h&gt;
#include &lt;string.h&gt;

 
int list(const char *name, const struct stat *status, int type)
{
 if (type == FTW_NS)
 {
 return 0;
 }

 if (type == FTW_F)
 {
 printf(&quot;0%3o\t%s\n&quot;, status-&gt;st_mode&amp;0777, name);
 }

 if (type == FTW_D &amp;&amp; strcmp(&quot;.&quot;, name) != 0)
 {
 printf(&quot;0%3o\t%s/\n&quot;, status-&gt;st_mode&amp;0777, name);
 }
 return 0;
}

int main(int argc, char *argv[])
{
 if(argc == 1)
 {
 ftw(&quot;.&quot;, list, 1);
 }
 else
 {
 ftw(argv[1], list, 1);
 }

 return 0;
}
</code></pre>
output looks like following:
<pre><code>0755 ./Shivaji/
0644 ./Shivaji/20200516_204454.png
0644 ./Shivaji/20200527_160408.png
0644 ./Shivaji/20200527_160352.png
0644 ./Shivaji/20200520_174754.png
0644 ./Shivaji/20200520_180103.png
0755 ./Saif/
0644 ./Saif/Snapchat-1751229005.jpg
0644 ./Saif/Snapchat-1356123194.jpg
0644 ./Saif/Snapchat-613911286.jpg
0644 ./Saif/Snapchat-107742096.jpg
0755 ./Milind/
0644 ./Milind/IMG_1828.JPG
0644 ./Milind/IMG_1839.JPG
0644 ./Milind/IMG_1825.JPG
0644 ./Milind/IMG_1831.JPG
0644 ./Milind/IMG_1840.JPG
</code></pre>
Let us say if you want to match a filename (example: searching for all the <code>*.jpg, *.jpeg, *.png</code> files.) for a specific needs, use <code>fnmatch</code>.
<pre><code> #include &lt;ftw.h&gt;
 #include &lt;stdio.h&gt;
 #include &lt;sys/stat.h&gt;
 #include &lt;iostream&gt;
 #include &lt;fnmatch.h&gt;

 static const char *filters[] = {
 &quot;*.jpg&quot;, &quot;*.jpeg&quot;, &quot;*.png&quot;
 };

 int list(const char *name, const struct stat *status, int type)
 {
 if (type == FTW_NS)
 {
 return 0;
 }

 if (type == FTW_F)
 {
 int i;
 for (i = 0; i &lt; sizeof(filters) / sizeof(filters[0]); i++) {
 /* if the filename matches the filter, */
 if (fnmatch(filters[i], name, FNM_CASEFOLD) == 0) {
 printf(&quot;0%3o\t%s\n&quot;, status-&gt;st_mode&amp;0777, name);
 break;
 }
 }
 }

 if (type == FTW_D &amp;&amp; strcmp(&quot;.&quot;, name) != 0)
 {
 //printf(&quot;0%3o\t%s/\n&quot;, status-&gt;st_mode&amp;0777, name);
 }
 return 0;
 }

 int main(int argc, char *argv[])
 {
 if(argc == 1)
 {
 ftw(&quot;.&quot;, list, 1);
 }
 else
 {
 ftw(argv[1], list, 1);
 }

 return 0;
 }
</code></pre>

blocks|key|1549829|text|在C%2B%2B17上，您可以这样做：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1549830|#include+<filesystem>
#include+<iostream>
#include+<vector>
namespace+fs+=+std::filesystem;

int+main()
{
++++std::ios_base::sync_with_stdio(false);
++++for+(const+auto+&entry+:+fs::recursive_directory_iterator("."))+{
++++++++if+(entry.path().extension()+==+".png")+{
++++++++++++std::cout+<<+entry.path().string()+<<+std::endl;
++++++++++++
++++++++}
++++}
++++return+0;
}|code-block|syntax|javascript|1549831|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

On C++17 you can by this way :
<pre><code>#include &lt;filesystem&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
namespace fs = std::filesystem;

int main()
{
 std::ios_base::sync_with_stdio(false);
 for (const auto &amp;entry : fs::recursive_directory_iterator(&quot;.&quot;)) {
 if (entry.path().extension() == &quot;.png&quot;) {
 std::cout &lt;&lt; entry.path().string() &lt;&lt; std::endl;
 
 }
 }
 return 0;
}
</code></pre>

blocks|key|1764871|text|使用Windows和Linux的C%2B%2B11递归获取所有文件名的答案(带experimental/filesystem)：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1764872|对于Windows：|1764873|#include+<io.h>
#include+<sys/types.h>
#include+<sys/stat.h>
#include+<windows.h>
void+getFiles_w(string+path,+vector<string>&+files)+{
++++intptr_t+hFile+=+0;+
++++struct+_finddata_t+fileinfo;++
++++string+p;+
++++if+((hFile+=+_findfirst(p.assign(path).append("\\*").c_str(),+&fileinfo))+!=+-1)+{
++++++++do+{
++++++++++++if+((fileinfo.attrib+&+_A_SUBDIR))+{
++++++++++++++++if+(strcmp(fileinfo.name,+".")+!=+0+&&+strcmp(fileinfo.name,+"..")+!=+0)
++++++++++++++++++++getFiles(p.assign(path).append("/").append(fileinfo.name),+files);
++++++++++++}
++++++++++++else+{
++++++++++++++++files.push_back(p.assign(path).append("/").append(fileinfo.name));
++++++++++++}
++++++++}+while+(_findnext(hFile,+&fileinfo)+==+0);
++++}
}|code-block|syntax|javascript|1764874|对于Linux：|1764875|#include+<experimental/filesystem>
bool+getFiles(std::experimental::filesystem::path+path,+vector<string>&+filenames)+{
++++namespace+stdfs+=+std::experimental::filesystem;
++++//+http://en.cppreference.com/w/cpp/experimental/fs/directory_iterator
++++const+stdfs::directory_iterator+end{}+;
++++
++++for+(stdfs::directory_iterator+iter{path};+iter+!=+end+;+%2B%2Biter)+{
++++++++//+http://en.cppreference.com/w/cpp/experimental/fs/is_regular_file+
++++++++if+(!stdfs::is_regular_file(*iter))+{+//+comment+out+if+all+names+(names+of+directories+tc.)+are+required+
++++++++++++if+(getFiles(iter->path(),+filenames))+
++++++++++++++++return+true;
++++++++}
++++++++else+{
++++++++++++filenames.push_back(iter->path().string())+;
++++++++++++cout+<<+iter->path().string()+<<+endl;++
++++++++}
++++}
++++return+false;
}|1764876|只要记住当你在Linux中用g%2B%2B编译它的时候要链接-lstdc%2B%2Bfs。|1764877|entityMap^0|Z|N|0|0|0|0|0|E|3|Q|A|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|X|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|Y|8|@]|D|@]|E|$K|L]]|$1|M|3|N|5|6|7|Z|8|@]|D|@]|E|$]]|$1|O|3|P|5|J|7|10|8|@]|D|@]|E|$K|L]]|$1|Q|3|R|5|6|7|11|8|@$9|12|A|13|B|C]|$9|14|A|15|B|C]]|D|@]|E|$]]|$1|S|3|-4|5|6|7|16|8|@]|D|@]|E|$]]]|T|$]]

Answers of getting all file names recursively with C++11 for Windows and Linux(with <code>experimental/filesystem</code>): 
For Windows:
<pre class="lang-cpp prettyprint-override"><code>#include &lt;io.h&gt;
#include &lt;sys/types.h&gt;
#include &lt;sys/stat.h&gt;
#include &lt;windows.h&gt;
void getFiles_w(string path, vector&lt;string&gt;&amp; files) {
 intptr_t hFile = 0; 
 struct _finddata_t fileinfo; 
 string p; 
 if ((hFile = _findfirst(p.assign(path).append(&quot;\\*&quot;).c_str(), &amp;fileinfo)) != -1) {
 do {
 if ((fileinfo.attrib &amp; _A_SUBDIR)) {
 if (strcmp(fileinfo.name, &quot;.&quot;) != 0 &amp;&amp; strcmp(fileinfo.name, &quot;..&quot;) != 0)
 getFiles(p.assign(path).append(&quot;/&quot;).append(fileinfo.name), files);
 }
 else {
 files.push_back(p.assign(path).append(&quot;/&quot;).append(fileinfo.name));
 }
 } while (_findnext(hFile, &amp;fileinfo) == 0);
 }
}
</code></pre>
For Linux:
<pre class="lang-cpp prettyprint-override"><code>#include &lt;experimental/filesystem&gt;
bool getFiles(std::experimental::filesystem::path path, vector&lt;string&gt;&amp; filenames) {
 namespace stdfs = std::experimental::filesystem;
 // http://en.cppreference.com/w/cpp/experimental/fs/directory_iterator
 const stdfs::directory_iterator end{} ;
 
 for (stdfs::directory_iterator iter{path}; iter != end ; ++iter) {
 // http://en.cppreference.com/w/cpp/experimental/fs/is_regular_file 
 if (!stdfs::is_regular_file(*iter)) { // comment out if all names (names of directories tc.) are required 
 if (getFiles(iter-&gt;path(), filenames)) 
 return true;
 }
 else {
 filenames.push_back(iter-&gt;path().string()) ;
 cout &lt;&lt; iter-&gt;path().string() &lt;&lt; endl; 
 }
 }
 return false;
}
</code></pre>
Just remember to link <code>-lstdc++fs</code> when you compile it with <code>g++</code> in Linux.

blocks|key|1764923|text|Employee可视化C%2B%2B和WIN接口：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1764924|bool+Parser::queryDIR(string+dir_name)+{
++++vector<string>+sameLayerFiles;
++++bool+ret+=+false;
++++string+dir+=+"";
++++//employee+wide+char
++++dir+=+dir_name++%2B+"\\*.*";;
++++//employee+WIN+File+API
++++WIN32_FIND_DATA++fd;
++++WIN32_FIND_DATA++fd_dir;
++++HANDLE+hFind+=+::FindFirstFile(getWC(dir.c_str()),+&fd);
++++HANDLE+hFind_dir+=+::FindFirstFile(getWC(dir.c_str()),+&fd_dir);
++++string+str_subdir;
++++string+str_tmp;
++++//recursive+call+for+diving+into+sub-directories
++++do+{
++++++++if+((fd_dir.dwFileAttributes+&+FILE_ATTRIBUTE_DIRECTORY)+)+{
++++++++++++//ignore+trival+file+node
++++++++++++while(true)+{
++++++++++++++++FindNextFile(hFind_dir,+&fd_dir);
++++++++++++++++str_tmp+=+wc2str(fd_dir.cFileName);
++++++++++++++++if+(str_tmp.compare(".")+&&+str_tmp.compare("..")){
++++++++++++++++++++break;
++++++++++++++++}
++++++++++++}
++++++++++++if+((fd_dir.dwFileAttributes+&+FILE_ATTRIBUTE_DIRECTORY)+)+{
++++++++++++++++str_subdir+=+wc2str(fd_dir.cFileName);
++++++++++++++++ret+=+queryDIR(dir_name+%2B+"\\"+%2B+str_subdir);
++++++++++++}
++++++++}
++++}+while(::FindNextFile(hFind_dir,+&fd_dir));

++++//iterate+same+layer+files
++++do+{+
++++++++if+(!(fd.dwFileAttributes+&+FILE_ATTRIBUTE_DIRECTORY))+{
++++++++++++str_tmp+=+wc2str(fd.cFileName);
++++++++++++string+fname+=+dir_name+%2B+"\\"+%2B+str_tmp;
++++++++++++sameLayerFiles.push_back(fname);
++++++++}
++++}+while(::FindNextFile(hFind,+&fd));++++

++++for+(std::vector<string>::iterator+it=sameLayerFiles.begin();+it!=sameLayerFiles.end();+it%2B%2B)+{
++++++++std::cout+<<+"iterated+file:"+<<+*it+<<+"..."+<<+std::endl;
++++++++//Doing+something+with+every+file+here
++++}
++++return+true;+++
}|code-block|syntax|javascript|1764925|希望我的代码能有所帮助:)|1764926|您可以在My+GitHub上查看更多详细信息和程序屏幕截图|offset|length|1764927|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/MouChiaHung/Grep^0|0|0|0|4|9|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|W|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|X|8|@]|9|@$K|Y|L|Z|1|10]]|A|$]]|$1|M|3|-4|5|6|7|11|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

Employee Visual C++ and WIN API:
<pre><code>bool Parser::queryDIR(string dir_name) {
 vector&lt;string&gt; sameLayerFiles;
 bool ret = false;
 string dir = &quot;&quot;;
 //employee wide char
 dir = dir_name + &quot;\\*.*&quot;;;
 //employee WIN File API
 WIN32_FIND_DATA fd;
 WIN32_FIND_DATA fd_dir;
 HANDLE hFind = ::FindFirstFile(getWC(dir.c_str()), &amp;fd);
 HANDLE hFind_dir = ::FindFirstFile(getWC(dir.c_str()), &amp;fd_dir);
 string str_subdir;
 string str_tmp;
 //recursive call for diving into sub-directories
 do {
 if ((fd_dir.dwFileAttributes &amp; FILE_ATTRIBUTE_DIRECTORY) ) {
 //ignore trival file node
 while(true) {
 FindNextFile(hFind_dir, &amp;fd_dir);
 str_tmp = wc2str(fd_dir.cFileName);
 if (str_tmp.compare(&quot;.&quot;) &amp;&amp; str_tmp.compare(&quot;..&quot;)){
 break;
 }
 }
 if ((fd_dir.dwFileAttributes &amp; FILE_ATTRIBUTE_DIRECTORY) ) {
 str_subdir = wc2str(fd_dir.cFileName);
 ret = queryDIR(dir_name + &quot;\\&quot; + str_subdir);
 }
 }
 } while(::FindNextFile(hFind_dir, &amp;fd_dir));

 //iterate same layer files
 do { 
 if (!(fd.dwFileAttributes &amp; FILE_ATTRIBUTE_DIRECTORY)) {
 str_tmp = wc2str(fd.cFileName);
 string fname = dir_name + &quot;\\&quot; + str_tmp;
 sameLayerFiles.push_back(fname);
 }
 } while(::FindNextFile(hFind, &amp;fd)); 

 for (std::vector&lt;string&gt;::iterator it=sameLayerFiles.begin(); it!=sameLayerFiles.end(); it++) {
 std::cout &lt;&lt; &quot;iterated file:&quot; &lt;&lt; *it &lt;&lt; &quot;...&quot; &lt;&lt; std::endl;
 //Doing something with every file here
 }
 return true; 
}
</code></pre>
Hope my code can help :)
And you can see more details and program screen-shots on <a href="https://github.com/MouChiaHung/Grep" rel="nofollow noreferrer">My GitHub</a>

How do you iterate through every file/directory recursively in standard C++?

How do you iterate through every file/directory recursively in standard C++?

文件系统

Windows

Linux

如何在标准C++中递归地遍历每个文件/目录？

问如何在标准C++中递归地遍历每个文件/目录？
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在标准C++中递归地遍历每个文件/目录？EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在标准C++中递归地遍历每个文件/目录？
EN