Fix indentation

pablogsal · Jan 21, 2020 · Jan 20, 2020 · Jan 20, 2020 · Jan 20, 2020 · Jan 20, 2020
commit 47190cd8c09e4a2749f95c67624da9288dfe1505
diff --git a/garbage_collector.rst b/garbage_collector.rst
@@ -406,10 +406,14 @@ The CPython GC makes use of two fat pointers:
   used for storing the temporary copy of the reference count (``gc_refs``), and the
   GC linked list becomes a singly linked list until ``_gc_prev`` is restored.
 
-* The ``_gc_next`` field is used as the "next" pointer to maintain the doubly
-  linked list but during collection its lowest bit is used to keep the
+* The ``_gc_next`` field is used as the "next" pointer to maintain the doubly linked
+  list but during collection its lowest bit is used to keep the
   ``NEXT_MASK_UNREACHABLE`` flag that indicates if an object is tentatively
-  unreachable during the cycle detection algorithm.  This is a drawback to using only doubly linked lists to implement partitions:  while most needed operations are constant-time, there is no efficient way to determine which partition an object is currently in.  Instead, when that's needed, ad hoc tricks (like the ``NEXT_MASK_UNREACHABLE`` flag) are employed.
+  unreachable during the cycle detection algorithm.  This is a drawback to using only
+  doubly linked lists to implement partitions:  while most needed operations are
+  constant-time, there is no efficient way to determine which partition an object is
+  currently in.  Instead, when that's needed, ad hoc tricks (like the
+  ``NEXT_MASK_UNREACHABLE`` flag) are employed.
 
 Optimization: delay tracking containers
 ---------------------------------------