▲ | vunderba 8 months 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 8 months ago | parent [-] | |||||||||||||||||||||||||||||||||||||||||||||||||
On 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. | ||||||||||||||||||||||||||||||||||||||||||||||||||
|