[Python-checkins] cpython: Issue #29062: doc: Fix heading level of hashlib-blake2

[inada.naoki]

https://hg.python.org/cpython/rev/c75ef013bca3
changeset:   105833:c75ef013bca3
user:        INADA Naoki <songofacandy at gmail.com>
date:        Tue Dec 27 15:07:18 2016 +0900
summary:
  Issue #29062: doc: Fix heading level of hashlib-blake2

files:
  Doc/library/hashlib-blake2.rst |  19 ++++++++-----------
  1 files changed, 8 insertions(+), 11 deletions(-)


diff --git a/Doc/library/hashlib-blake2.rst b/Doc/library/hashlib-blake2.rst
--- a/Doc/library/hashlib-blake2.rst
+++ b/Doc/library/hashlib-blake2.rst
@@ -25,9 +25,6 @@
 :mod:`hashlib` objects.
 
 
-Module
-======
-
 Creating hash objects
 ---------------------
 
@@ -137,10 +134,10 @@
 
 
 Examples
-========
+--------
 
 Simple hashing
---------------
+^^^^^^^^^^^^^^
 
 To calculate hash of some data, you should first construct a hash object by
 calling the appropriate constructor function (:func:`blake2b` or
@@ -175,7 +172,7 @@
 
 
 Using different digest sizes
-----------------------------
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 
 BLAKE2 has configurable size of digests up to 64 bytes for BLAKE2b and up to 32
 bytes for BLAKE2s. For example, to replace SHA-1 with BLAKE2b without changing
@@ -207,7 +204,7 @@
 
 
 Keyed hashing
--------------
+^^^^^^^^^^^^^
 
 Keyed hashing can be used for authentication as a faster and simpler
 replacement for `Hash-based message authentication code
@@ -260,7 +257,7 @@
 
 
 Randomized hashing
-------------------
+^^^^^^^^^^^^^^^^^^
 
 By setting *salt* parameter users can introduce randomization to the hash
 function. Randomized hashing is useful for protecting against collision attacks
@@ -316,7 +313,7 @@
 
 
 Personalization
----------------
+^^^^^^^^^^^^^^^
 
 Sometimes it is useful to force hash function to produce different digests for
 the same input for different purposes. Quoting the authors of the Skein hash
@@ -361,7 +358,7 @@
     G9GtHFE1YluXY1zWPlYk1e/nWfu0WSEb0KRcjhDeP/o=
 
 Tree mode
----------
+^^^^^^^^^
 
 Here's an example of hashing a minimal tree with two leaf nodes::
 
@@ -399,7 +396,7 @@
     '3ad2a9b37c6070e374c7a8c508fe20ca86b6ed54e286e93a0318e95e881db5aa'
 
 Credits
-=======
+-------
 
 BLAKE2_ was designed by *Jean-Philippe Aumasson*, *Samuel Neves*, *Zooko
 Wilcox-O'Hearn*, and *Christian Winnerlein* based on SHA-3_ finalist BLAKE_

-- 
Repository URL: https://hg.python.org/cpython