dprint fmt

src/concurrency/async-exercises/dining-philosophers.rs

@@ -74,7 +74,8 @@ async fn main() {
         let (tx, rx) = mpsc::channel(10);
         for (i, name) in PHILOSOPHERS.iter().enumerate() {
             let mut left_chopstick = Arc::clone(&chopsticks[i]);
-            let mut right_chopstick = Arc::clone(&chopsticks[(i + 1) % PHILOSOPHERS.len()]);
+            let mut right_chopstick =
+                Arc::clone(&chopsticks[(i + 1) % PHILOSOPHERS.len()]);
             if i == PHILOSOPHERS.len() - 1 {
                 std::mem::swap(&mut left_chopstick, &mut right_chopstick);
             }

src/concurrency/sync-exercises/dining-philosophers.md

@@ -8,12 +8,12 @@ The dining philosophers problem is a classic problem in concurrency:
 
 > Five philosophers dine together at the same table. Each philosopher has their
 > own place at the table. There is a chopstick between each plate. The dish
-> served is spaghetti which requires two chopsticks to eat. Each philosopher
-> can only alternately think and eat. Moreover, a philosopher can only eat
-> their spaghetti when they have both a left and right chopstick. Thus two
-> chopsticks will only be available when their two nearest neighbors are
-> thinking, not eating. After an individual philosopher finishes eating, they
-> will put down both chopsticks.
+> served is spaghetti which requires two chopsticks to eat. Each philosopher can
+> only alternately think and eat. Moreover, a philosopher can only eat their
+> spaghetti when they have both a left and right chopstick. Thus two chopsticks
+> will only be available when their two nearest neighbors are thinking, not
+> eating. After an individual philosopher finishes eating, they will put down
+> both chopsticks.
 
 You will need a local [Cargo installation](../../cargo/running-locally.md) for
 this exercise. Copy the code below to a file called `src/main.rs`, fill out the