dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

use std::cmp::Reverse;

type Q<T> = std::collections::BinaryHeap<Reverse<T>>;

use crate::priority_queue_trait::{
    Pop,
    Push,
};

impl<T: Ord> Push for Q<T> {
    type T = T;

    fn push(
        &mut self,
        x: T,
    ) {
        Self::push(self, Reverse(x));
    }
}

impl<T: Ord> Pop for Q<T> {
    type T = Option<T>;

    fn pop(&mut self) -> Self::T {
        if let Some(Reverse(x)) = Self::pop(self) {
            Some(x)
        } else {
            None
        }
    }
}