clippy: fix doc comment indentation

Author: nessex

src/sorts/regions_sort.rs

@@ -10,15 +10,15 @@
 //! 2. Compute counts for each bucket and sort each bucket in-place
 //! 3. Generate global counts
 //! 4. Generate Graph & Sort
-//!     4.1 List outbound regions for each country
-//!     4.2 For each country (C):
-//!         4.2.1: List the inbounds for C (filter outbounds for each other country by destination: C)
-//!         4.2.2: For each thread:
-//!             4.2.2.1: Pop an item off the inbound (country: I) & outbound (country: O) queues for C
-//!             4.2.2.2/a: If they are the same size, continue
-//!             4.2.2.2/b: If I is bigger than O, keep the remainder of I in the queue and continue
-//!             4.2.2.2/c: If O is bigger than I, keep the remainder of O in the queue and continue
-//!             4.2.2.3: Swap items in C heading to O, with items in I destined for C (items in C may or may not be destined for O ultimately)
+//!    4.1 List outbound regions for each country
+//!    4.2 For each country (C):
+//!    4.2.1: List the inbounds for C (filter outbounds for each other country by destination: C)
+//!    4.2.2: For each thread:
+//!    4.2.2.1: Pop an item off the inbound (country: I) & outbound (country: O) queues for C
+//!    4.2.2.2/a: If they are the same size, continue
+//!    4.2.2.2/b: If I is bigger than O, keep the remainder of I in the queue and continue
+//!    4.2.2.2/c: If O is bigger than I, keep the remainder of O in the queue and continue
+//!    4.2.2.3: Swap items in C heading to O, with items in I destined for C (items in C may or may not be destined for O ultimately)
 //!
 //! ## Characteristics
 //!

src/sorts/scanning_sort.rs

@@ -6,11 +6,11 @@
 //!  2. Create a worker for each rayon global thread pool thread (roughly, one per core)
 //!  2. Create a temporary thread-local buffer for each worker (one vec for each radix)
 //!  3. Each thread:
-//!  3.1. Iterates over the buckets, trying to gain a mutex lock on one
-//!  3.2. On first lock of the bucket, it partitions the bucket into [correct data | incorrect data] in-place
-//!  3.3. Scan over the contents of the bucket, picking up data that shouldn't be there and putting it in the thread-local buffer
-//!  3.4. Writes any buffered contents that _should_ be in this bucket, into the bucket
-//!  3.5. Repeats 3 until all buckets are completely filled with the correct data
+//!     3.1. Iterates over the buckets, trying to gain a mutex lock on one
+//!     3.2. On first lock of the bucket, it partitions the bucket into [correct data | incorrect data] in-place
+//!     3.3. Scan over the contents of the bucket, picking up data that shouldn't be there and putting it in the thread-local buffer
+//!     3.4. Writes any buffered contents that _should_ be in this bucket, into the bucket
+//!     3.5. Repeats 3 until all buckets are completely filled with the correct data
 //!
 //! Along the way, each output bucket has a read head and a write head, which is a pointer to the latest content read and written respectively.
 //! When the read head reaches the end of the bucket, there is no more content to be buffered by any worker.