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

KC kc1956 at gmail.com
Sat May 11 22:23:54 UTC 2019

Thank you for making the `posix-paths` package for fast directory

Are directories stored in consecutive disk blocks?

On Fri, May 10, 2019 at 6:53 PM Niklas Hamb├╝chen <mail at nh2.me> wrote:

> 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
> _______________________________________________
> Haskell-Cafe mailing list
> To (un)subscribe, modify options or view archives go to:
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
> Only members subscribed via the mailman list are allowed to post.



Sent from an expensive device which will be obsolete in a few months! :D
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20190511/c6cc3991/attachment.html>

More information about the Haskell-Cafe mailing list