From 5c1b9cc1cd83f1f5d7f2f23935eefef032561dbe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=C5=81ukasz=20Langa?= <lukasz@langa.pl>
Date: Sat, 25 May 2013 16:21:03 +0200
Subject: [PATCH] Fix a reST formatting error

---
 pep-0443.txt | 13 +++++++------
 1 file changed, 7 insertions(+), 6 deletions(-)

diff --git a/pep-0443.txt b/pep-0443.txt
index d7f69ed9d..187b971dc 100644
--- a/pep-0443.txt
+++ b/pep-0443.txt
@@ -192,16 +192,17 @@ argument which includes the relevant ABCs. The algorithm is as follows::
 
 In its most basic form, it returns the MRO for the given type::
 
->>> _compose_mro(dict, [])
-[<class 'dict'>, <class 'object'>]
+  >>> _compose_mro(dict, [])
+  [<class 'dict'>, <class 'object'>]
 
 When the haystack consists of ABCs that the specified type is a subclass
 of, they are inserted in a predictable order::
 
->>> _compose_mro(dict, [Sized, MutableMapping, str, Sequence, Iterable])
-[<class 'dict'>, <class 'collections.abc.MutableMapping'>,
- <class 'collections.abc.Iterable'>, <class 'collections.abc.Sized'>,
- <class 'object'>]
+  >>> _compose_mro(dict, [Sized, MutableMapping, str,
+  ...                     Sequence, Iterable])
+  [<class 'dict'>, <class 'collections.abc.MutableMapping'>,
+   <class 'collections.abc.Iterable'>, <class 'collections.abc.Sized'>,
+   <class 'object'>]
 
 While this mode of operation is significantly slower, no caching is
 involved because user code may ``register()`` a new class on an ABC at