dsalgo 0.3.7

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

use crate::priority_queue::{MinimumQueue, Pop, Push};

impl<T: std::cmp::Ord> Push
    for std::collections::BinaryHeap<std::cmp::Reverse<T>>
{
    type T = T;

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

impl<T: std::cmp::Ord> Pop
    for std::collections::BinaryHeap<std::cmp::Reverse<T>>
{
    type T = T;

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

impl<T: std::cmp::Ord> MinimumQueue
    for std::collections::BinaryHeap<std::cmp::Reverse<T>>
{
}