mirror of
https://github.com/jarun/nnn.git
synced 2024-11-04 18:33:12 +00:00
Updated Performance (markdown)
parent
bd5b2c53d6
commit
f6e586a28c
|
@ -29,7 +29,7 @@
|
||||||
- replace quicksort with a more aggressive algorithm by favoring space over time complexity (once there was a random load option, now removed)
|
- replace quicksort with a more aggressive algorithm by favoring space over time complexity (once there was a random load option, now removed)
|
||||||
- call non-standard platform-specific APIs like `getdents()`/`getdents64()` (the _Description_ section in the Linux man page starts with _These are not the interfaces you are interested in_); applies to Linux-specific `statx()` too
|
- call non-standard platform-specific APIs like `getdents()`/`getdents64()` (the _Description_ section in the Linux man page starts with _These are not the interfaces you are interested in_); applies to Linux-specific `statx()` too
|
||||||
- spend time on performance optimization over 10K entries in a dir as this is not the regular case and the performance with 10K files is quite good with the current implementation (in addition SSD and NVMe are the future)
|
- spend time on performance optimization over 10K entries in a dir as this is not the regular case and the performance with 10K files is quite good with the current implementation (in addition SSD and NVMe are the future)
|
||||||
- use lazy/background/threaded load (`nnn` supports disk usage mode, sort orders and _nav-as-you-type_ as program options, so it needs to `stat` all files first for a _correct_ ordering of the entries)
|
- use lazy/background/threaded load (`nnn` supports disk usage mode, sort orders and _nav-as-you-type_ as program options, so it needs to `stat` all files first for a _correct_ calculation/ordering of the entries)
|
||||||
|
|
||||||
## Comparison
|
## Comparison
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue