Pass tidy again

Author: yanchith

library/alloc/src/collections/binary_heap/mod.rs

@@ -538,11 +538,7 @@ impl<T: Ord, A: Allocator> BinaryHeap<T, A> {
     /// otherwise it's *O*(1).
     #[stable(feature = "binary_heap_peek_mut", since = "1.12.0")]
     pub fn peek_mut(&mut self) -> Option<PeekMut<'_, T, A>> {
-        if self.is_empty() {
-            None
-        } else {
-            Some(PeekMut { heap: self, original_len: None })
-        }
+        if self.is_empty() { None } else { Some(PeekMut { heap: self, original_len: None }) }
     }
 
     /// Removes the greatest item from the binary heap and returns it, or `None` if it