On Sat, May 11, 2019 at 03:52:38AM +0200, Niklas Hambüchen wrote:
we made the `posix-paths` package for fast directory traversals:
https://hackage.haskell.org/package/posix-paths
You can find benchmarks in
It should perhaps be noted that a large fraction of the additional overhead encountered by the String FilePath traversals in the that benchmark occur in the output code that prints all the paths to stdout. The corresponding ByteString listing is noticeably faster. If one rather just stats and counts all the files, the performance difference is somewhat more modest, (IIRC around a factor of ~2 rather than ~5 or 6) At the directory traversal of course needs to use 'getSymbolicLinkStatus' rather than 'getFileStatus', since recursive directory traversals should almost never follow symlinks. -- Viktor.