Re: [Haskell-cafe] How to optimize a directory scanning?

Hi, we made the `posix-paths` package for fast directory traversals: https://hackage.haskell.org/package/posix-paths You can find benchmarks in https://github.com/JohnLato/posix-paths#benchmarks Some more tips (some of them you're already following as per other threads): * Use `time` to if time is spent on kernel CPU, userspace CPU, or waiting * Use `strace -fy` with `-ttt` and `-T` to see timings, and `-c` and `-wc` summary statistics