Skip to content

Commit

Permalink
docs: fix typos in man pages
Browse files Browse the repository at this point in the history
  • Loading branch information
mhx committed Aug 25, 2024
1 parent 3e775bf commit d4d4081
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion doc/dwarfs.md
Original file line number Diff line number Diff line change
Expand Up @@ -157,7 +157,7 @@ options:
Threshold, in blocks, for the sequential access detector. If the most
recently accessed *num* blocks are sequential, then the block following
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.

- `-o perfmon=`*name*[`+`*name*...]:
Expand Down
4 changes: 2 additions & 2 deletions doc/mkdwarfs.md
Original file line number Diff line number Diff line change
Expand Up @@ -377,7 +377,7 @@ Most other options are concerned with compression tuning:
in the output of `mkdwarfs -h`.

- `--log-level=`*name*:
Specifiy a logging level.
Specify a logging level.

- `--log-with-context`:
Enable logging context regardless of level. By default, context is enabled
Expand Down Expand Up @@ -821,7 +821,7 @@ not a requirement for the algorithm.
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
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
between all nodes, there's no guarantee that the result will be better
if you use only a single cluster.
Expand Down

0 comments on commit d4d4081

Please sign in to comment.