fn force_pop(&self, mut queue: MutexGuard<BinaryHeap<Entry<T>>>) -> T {
        if queue.len() > 1 {
            self.shared_data.condvar_new_head.notify_one();
        }

        queue.pop().unwrap().delayed
    }
/// Pops an element from the queue, notifying `condvar_new_head` if there are elements still
/// left in the queue.
///
/// # Panics
///
/// Panics if `queue` is empty.
Pops an element from the queue, notifying `condvar_new_head` if there are elements still
left in the queue.
Pops an element from the queue notifying ` condvar_new_head ` if there are elements still left in the queue .
fn force_pop(&self, mut queue: MutexGuard<BinaryHeap<Entry<T>>>) -> T {
        if queue.len() > 1 {
            self.shared_data.condvar_new_head.notify_one();
        }
        queue.pop().unwrap().delayed
    }
fn force_pop ( & self , mut queue : MutexGuard < BinaryHeap < Entry < T > > > ) -> T { if queue . len ( ) > 1 { self . shared_data . condvar_new_head . notify_one ( ) ; } queue . pop ( ) . unwrap ( ) . delayed }
Pops an element from the queue, notifying `condvar_new_head` if there are elements still
left in the queue.
Pops an element from the queue notifying ` condvar_new_head ` if there are elements still left in the queue .
&self
queue
MutexGuard<BinaryHeap<Entry<T>>>
panics
Panics if `queue` is empty.
Panics if ` queue ` is empty .