From 767a7119a08b51ed6fa2d4f6092418e63ce2877a Mon Sep 17 00:00:00 2001
From: yanchith <yanchi.toth@gmail.com>
Date: Fri, 9 Jun 2023 12:02:25 +0200
Subject: [PATCH] Pass tidy again

---
 library/alloc/src/collections/binary_heap/mod.rs | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/library/alloc/src/collections/binary_heap/mod.rs b/library/alloc/src/collections/binary_heap/mod.rs
index 9c2588c26b4..657c380d65d 100644
--- a/library/alloc/src/collections/binary_heap/mod.rs
+++ b/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