jwalk VS findlargedir

No, it's long known that parallel tree walking is able to process files/folders at better rates, especially for higher-throughput storages or even better, for hybrid or fully SSD storages. There are always some overheads on processing logic and there is no reason to wait for processing to finish while fetching another structure from disk, especially on high IOPS devices where single-thread programs are too slow. Since it's always better to refer to factual numbers, for instance comparison of Rust tree walkers, single-thread vs multiple-treads.

Tool has been designed to work as fast as possible given its specific use case and it should be typically much faster than find, du, ncdu and other similar tools. It can be found on GitHub: https://github.com/dkorunic/findlargedir

Dear Rustaceans, I've written a filesystem scanning tool in Rust that is attempting to locate filesystem directories through inode size heuristics that have significantly grown (ie. beyond 100k entries in a single directory) and where getting a list of all entries in a folder typically takes a lot of time (and such processes typically end up in D state for longer periods of time). Such situations commonly occur in a variety of scenarios such as forgotten Web sessions directory, cache folders, users treating regular POSIX filesystem as object store, etc: https://github.com/dkorunic/findlargedir I was wondering if anyone could take a look at the code and give code quality and improvement suggestions. I have more than 25 years of experience programming in other languages such as C, C++, Perl, Python, Golang etc. but I've only started recently with Rust mainly for my own enjoyment and self-improvement reasons, and I am sure I have much more to learn. Thanks!