like ls -larRt, only useful
- Perl 63.8%
- Roff 34.8%
- Makefile 1.4%
Juergen Nickelsen
c339f98ebf
Before, all entries were kept in memory and printed at the end whether there was sorting to be done or not. This foregoes the advantages of not sorting, meaning the compute and memory effort of storing all entries. Now, with -f / $opt_nosort, each entry is printed as soon as it is generated and then forgotten. |
||
|---|---|---|
| .gitignore | ||
| larrt | ||
| larrt.1 | ||
| Makefile | ||
| README | ||
-*- text -*- larrt ===== The larrt program was first created to answer the question "what has recently changed in this directory tree?" and printed a listing of the files in that tree, sorted by their mtime. Hence the name -- it is like an "ls -lart", only recursive, so there is a second 'r'. Over the time it grew to cover more use cases, and earned a few more options for other sorting methods (atime, ctime, pathname, size, reverse, none), entry selection (dotted, all dotted, directories) and display (path name only, SHA-256 digest, Zulu time). See the man page (or just "larrt -?") for details.