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

Updated Performance (markdown)

Mischievous Meerkat 2019-12-02 19:57:21 +05:30
parent 3cc965f239
commit 3de95145eb

@ -4,7 +4,7 @@
## Optimization techniques
`nnn` uses highly optimized algorithms for performance. Some of the significant factors are listed below:
`nnn` uses highly optimized algorithms for performance. Some of the significant factors are:
- quicksort with pre-filters to sort files based on filename, modification time, size etc.
- 0 fragmentation - no byte loss while saving file name of directory entries
@ -16,7 +16,7 @@
- readahead request (to kernels supporting the feature)
- fast routines to calculate and render file size
- shifts instead of divisions and multiplications (probably done by most modern compilers already)
- optimized memory usage everywhere, buffer re-use, restricted dynamic memory (de)allocation
- optimized memory usage everywhere, buffer re-use
- no floating point arithmetic
- static routines
- controlled binary size (~58KB)