pub fn peek_mut(&mut self) -> Option<PeekMut<'_, T>> {
        if self.is_empty() { None } else { Some(PeekMut { heap: self, sift: false }) }
    }
Consumes the `BinaryHeap` and returns a vector in sorted
(ascending) order.

# Examples

Basic usage:

```
use std::collections::Binary
benchmarks/haystacks/code/rust-library.rs