improve grammar

This commit is contained in:
Benjamin Peterson 2016-09-06 14:32:40 -07:00
parent fe3c9c1ee9
commit ef537db688

View file

@ -370,8 +370,8 @@ Here's an example of hashing a minimal tree with two leaf nodes::
/ \ / \
00 01 00 01
The example uses 64-byte internal digests, and returns the 32-byte final This example uses 64-byte internal digests, and returns the 32-byte final
digest. digest::
>>> from hashlib import blake2b >>> from hashlib import blake2b
>>> >>>