1
1
mirror of https://github.com/jarun/nnn.git synced 2024-11-26 09:52:12 +03:00

Updated Performance (markdown)

John Doe 2020-04-05 13:36:32 +05:30
parent 9745ba9e3f
commit b81b9af26e

@ -26,10 +26,18 @@
#### Optimization options `nnn` development ignores: #### Optimization options `nnn` development ignores:
- replace quicksort with a more aggressive algorithm by favoring space over time complexity (the random load option is also removed) - replace quicksort with a more aggressive algorithm by favoring space over time complexity
- non-standard calls like `statx()`/`getdents()`/`getdents64()` (the _Description_ section in the Linux man page starts with _These are not the interfaces you are interested in_) - usually not perceptible by human beings
- optimize loading 10K+ entries in a dir; not the regular case, performance with 10K files is quite good with the current implementation and SSD/NVMe are the future - the random load option is also removed
- use lazy/background/threaded load (`nnn` supports du, sort and _nav-as-you-type_ as program options, so it needs to `stat` all files beforehand to _correctly_ calculate/order) - non-standard calls like `statx()`/`getdents()`/`getdents64()`
- platform-specific
- the _Description_ section in the Linux man page starts with _These are not the interfaces you are interested in_
- optimize handling 10K+ entries in a dir
- not a mass use case
- performance with 10K files is good enough today
- SSD/NVMe are the future
- use lazy/background/threaded load
- `nnn` supports du, sort and _nav-as-you-type_ as program options, it needs to `stat` all files beforehand
## Comparison ## Comparison