diff options
| author | Benjamin Peterson <benjamin@python.org> | 2016-09-06 21:32:40 (GMT) |
|---|---|---|
| committer | Benjamin Peterson <benjamin@python.org> | 2016-09-06 21:32:40 (GMT) |
| commit | ef537db68813ebaae11f54b780f21ad7dac05845 (patch) | |
| tree | 421a2fdb3d8d318728c83ea5a8a156cb7c08c49d | |
| parent | fe3c9c1ee9d59f0b1d174210132e71037fd7f2e8 (diff) | |
| download | cpython-ef537db68813ebaae11f54b780f21ad7dac05845.zip cpython-ef537db68813ebaae11f54b780f21ad7dac05845.tar.gz cpython-ef537db68813ebaae11f54b780f21ad7dac05845.tar.bz2 | |
improve grammar
| -rw-r--r-- | Doc/library/hashlib-blake2.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/hashlib-blake2.rst b/Doc/library/hashlib-blake2.rst index 22efe69..aca24b4 100644 --- a/Doc/library/hashlib-blake2.rst +++ b/Doc/library/hashlib-blake2.rst @@ -370,8 +370,8 @@ Here's an example of hashing a minimal tree with two leaf nodes:: / \ 00 01 -The example uses 64-byte internal digests, and returns the 32-byte final -digest. +This example uses 64-byte internal digests, and returns the 32-byte final +digest:: >>> from hashlib import blake2b >>> |