Hello! Thank you for the pointer. I may implement a lazy version myself if I really need it later.
Searching around, I also found io.directories.hierarchy, which implements directory-tree-files. I'm not sure why there is such code duplication, but that version behaves slightly differently: it does not prefix all paths with current working directory, therefore returning relative paths. I've got another question about the file-readable? word. The documentation says that it "returns whether the file specified by path is readable by the current process." Here's my experiment: "C:\\boot.ini" file-readable? . -> t "C:\\boot.ini" sha-256 checksum-file hex-string . -> Exception "Access is denied." Being a non-root user in Windows, I have no permission to read C:\boot.ini, but file-readable? returns true. 16.09.2015, 01:00, "John Benediktsson" <mrj...@gmail.com>: > Not a lazy one, nor a virtual one, but we have a directory-iterator in > io.directories.search vocabulary that supports breadth-first or depth-first > recursive traversal. > > It is used to get all-files-by-depth or all-files-by-breadth as a sequence, > act on each-file-breadth or each-file-depth, or filter-files-breadth or > filter-files-depth. > > Hope that helps. > > On Tue, Sep 15, 2015 at 9:32 AM, Alexander Ilin <ajs...@yandex.ru> wrote: >> Hello! >> >> Is there a virtual sequence for recursive traversal of all files in a >> folder and its subfolders? ---=====--- Александр ------------------------------------------------------------------------------ Monitor Your Dynamic Infrastructure at Any Scale With Datadog! Get real-time metrics from all of your servers, apps and tools in one place. SourceForge users - Click here to start your Free Trial of Datadog now! http://pubads.g.doubleclick.net/gampad/clk?id=241902991&iu=/4140 _______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
