1
1
mirror of https://github.com/jarun/nnn.git synced 2024-11-22 15:20:59 +03:00

Updated Performance (markdown)

John Doe 2020-04-05 13:30:10 +05:30
parent ae0e20e987
commit 9745ba9e3f

@ -24,11 +24,11 @@
- `O3` level compiler optimization
- 0-warning statically-analyzed code (forced `-Wall -Wextra -Werror` in CI)
#### Optimization techniques `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)
- 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_)
- spend time to optimize loading over 10K entries in a dir; not the regular case and the performance with 10K files is quite good with the current implementation (plus SSD and NVMe are the future)
- 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
- 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)
## Comparison