mirror of
https://github.com/RGBCube/uutils-coreutils
synced 2025-07-27 11:07:44 +00:00
shred: document simplified (better?) number of random passes
This commit is contained in:
parent
606c0c1f57
commit
abb2acc3a2
1 changed files with 4 additions and 0 deletions
|
@ -97,3 +97,7 @@ Similar to the proc-ps implementation and unlike GNU/Coreutils, `uptime` provide
|
|||
## `base32/base64/basenc`
|
||||
|
||||
Just like on macOS, `base32/base64/basenc` provides `-D` to decode data.
|
||||
|
||||
## `shred`
|
||||
|
||||
The number of random passes is deterministic in both GNU and uutils. However, uutils `shred` computes the number of random passes in a simplified way, specifically `max(3, x / 10)`, which is very close but not identical to the number of random passes that GNU would do. This also satisfies an expectation that reasonable users might have, namely that the number of random passes increases monotonically with the number of passes overall; GNU `shred` violates this assumption.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue