TheCloud/dwarfs
1
0
Fork 0
mirror of https://github.com/mhx/dwarfs.git synced 2025-09-09 20:41:04 -04:00
Code Issues Packages Projects Releases Wiki Activity

docs: fix typos in man pages

Browse Source
This commit is contained in:
Marcus Holland-Moritz 2024-08-25 19:56:15 +02:00
parent 3e775bf574
commit d4d4081dfc
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
doc/dwarfs.md
View File

@ -157,7 +157,7 @@ options:
Threshold, in blocks, for the sequential access detector. If the most Threshold, in blocks, for the sequential access detector. If the most
recently accessed *num* blocks are sequential, then the block following recently accessed *num* blocks are sequential, then the block following
the sequence is prefetched. This can significantly increase throughput the sequence is prefetched. This can significantly increase throughput
if data is acccessed sequentially. A value of `0` completely disables if data is accessed sequentially. A value of `0` completely disables
detection and prefetching. detection and prefetching.
- `-o perfmon=`*name*[`+`*name*...]: - `-o perfmon=`*name*[`+`*name*...]:

4
doc/mkdwarfs.md
View File

@ -377,7 +377,7 @@ Most other options are concerned with compression tuning:
in the output of `mkdwarfs -h`. in the output of `mkdwarfs -h`.
- `--log-level=`*name*: - `--log-level=`*name*:
Specifiy a logging level. Specify a logging level.
- `--log-with-context`: - `--log-with-context`:
Enable logging context regardless of level. By default, context is enabled Enable logging context regardless of level. By default, context is enabled
@ -821,7 +821,7 @@ not a requirement for the algorithm.
By setting `max-children` to 1 and `max-cluster-size` to a really large By setting `max-children` to 1 and `max-cluster-size` to a really large
number, only a single cluster will be created and the nearest neighbour number, only a single cluster will be created and the nearest neighbour
search will be performed on the set of all nodes. Since the algorithm is search will be performed on the set of all nodes. Since the algorithm is
O(n^2), this does not scale well for `max-cluster-size` beyong a few O(n^2), this does not scale well for `max-cluster-size` beyond a few
100,000. Also, since the algorithm does not minimize the global distance 100,000. Also, since the algorithm does not minimize the global distance
between all nodes, there's no guarantee that the result will be better between all nodes, there's no guarantee that the result will be better
if you use only a single cluster. if you use only a single cluster.