4 ms·
Sounds like a fun project. However, from the readme: Efficient file listing: Optimized for speed, even in large directories What exactly is it doing different
by vunderba 2y ago
Sounds like a fun project. However, from the readme:
Efficient file listing: Optimized for speed, even in large directories
What exactly is it doing differently to optimize for speed? Isn't it just using the regular fs lib?
- jeffbee 2y agoOn my system it uses twice as much CPU as plain old ls in a directory with just 13k files. To recursively list a directory with 500k leaf files, lla needs > 10x as much CPU. Apparently it is both slower and with higher complexity.
- matheusmoreira 2y agoWhat exactly makes ls faster?
- triyanox 2y agoOn the latest release the it can list a tree of 100 in depth with over 100k files in less than 100ms and if cached 40ms
- inquisitive-me 2y agoBut it’s written in rust so it’s super fast. Did you take that into account when running your benchmarks? /s
- triyanox 2y agoWill definitely prioritize optimization in the next releases. Planning to benchmark against ls on various systems and file counts to get this properly sorted.
- niek_pas 2y agoNot trying to “gotcha” you, but I would imagine that 10x the CPU of ls is still very little, or am I wrong?