Of course, that doesn't control recursive descent which was @chalybeum's driving use case but you did use a smiley. :-)
Based on possible broader interest and a general trend lately of trying to be less abstract, I just added a template-based tree iteration to `cligen/dents.nim`: [https://github.com/c-blake/cligen/commit/633da63a997269486f3e00432ec4ce37521fb530](https://github.com/c-blake/cligen/commit/633da63a997269486f3e00432ec4ce37521fb530) with a fully worked out example utility in `examples/chom.nim` as well as 4 inline `cligen.dispatchMulti`-driven example usages. The short of if it is that you can make things about 2x-8x faster on Linux if you just trust `d_type` and you only need path names, not, say, i-node data from lstat/stat/etc. Performance only matters for large directory hierarchies, obviously.
