priority_container 0.1.1

Datastructure to find n biggest/smallest items within a large set
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93

use std::{
    cmp::Ordering,
    ops::{Deref, DerefMut},
};

pub struct HeapItem<T> {
    pub inner: T,
    pub counter: usize,
}

impl<T: Ord> HeapItem<T> {
    #[inline]
    pub fn new(inner: T, pos: usize) -> Self {
        HeapItem {
            inner,
            counter: pos,
        }
    }

    #[inline]
    pub fn into_inner(self) -> T {
        self.inner
    }

    /*
    /// Get a reference to the heap item's inner.
    #[inline]
    pub fn inner(&self) -> &T {
        &self.inner
    }

    #[inline]
    pub fn inner_mut(&mut self) -> &mut T {
        &mut self.inner
    }

    /// Get a mutable reference to the heap item's counter.
    pub fn counter_mut(&mut self) -> &mut usize {
        &mut self.counter
    }
    */
}

impl<T> AsRef<T> for HeapItem<T> {
    #[inline]
    fn as_ref(&self) -> &T {
        &self.inner
    }
}

impl<T> Deref for HeapItem<T> {
    type Target = T;

    #[inline]
    fn deref(&self) -> &Self::Target {
        &self.inner
    }
}

impl<T> DerefMut for HeapItem<T> {
    #[inline]
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.inner
    }
}

impl<T: Ord + PartialEq> PartialEq for HeapItem<T> {
    #[inline]
    fn eq(&self, other: &Self) -> bool {
        self.counter == other.counter && self.inner == other.inner
    }
}

impl<T: Ord + PartialEq> Eq for HeapItem<T> {}

impl<T: Ord + PartialEq> PartialOrd for HeapItem<T> {
    #[inline]
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        let cmp = self.inner.cmp(&other.inner);
        if cmp == Ordering::Equal {
            return Some(self.counter.cmp(&other.counter).reverse());
        }

        Some(cmp)
    }
}

impl<T: Ord + PartialEq> Ord for HeapItem<T> {
    #[inline]
    fn cmp(&self, other: &Self) -> Ordering {
        self.partial_cmp(other).unwrap()
    }
}