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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110

use crate::stable::item::HeapItem;
use std::{cmp::Reverse, collections::BinaryHeap};

/// Iterator over a binary heap sorted
pub struct SortedHeapIter<T> {
    inner: BinaryHeap<T>,
}

impl<T: Ord> SortedHeapIter<T> {
    #[inline]
    pub(crate) fn new(heap: BinaryHeap<T>) -> Self {
        Self { inner: heap }
    }
}

impl<T: Ord> Iterator for SortedHeapIter<T> {
    type Item = T;

    #[inline(always)]
    fn next(&mut self) -> Option<T> {
        self.inner.pop()
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let exact = self.inner.len();
        (exact, Some(exact))
    }
}

/// Iterator over a binary heap sorted
pub struct SortedHeapIterMax<T> {
    inner: BinaryHeap<Reverse<T>>,
}

impl<T: Ord> SortedHeapIterMax<T> {
    #[inline]
    pub(crate) fn new(heap: BinaryHeap<Reverse<T>>) -> Self {
        Self { inner: heap }
    }
}

impl<T: Ord> Iterator for SortedHeapIterMax<T> {
    type Item = T;

    #[inline(always)]
    fn next(&mut self) -> Option<T> {
        self.inner.pop().map(|i| i.0)
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let exact = self.inner.len();
        (exact, Some(exact))
    }
}

/// Iterator over a binary heap sorted
pub struct StableHeapIter<T> {
    inner: BinaryHeap<HeapItem<T>>,
}

impl<T> StableHeapIter<T> {
    #[inline]
    pub(crate) fn new(heap: BinaryHeap<HeapItem<T>>) -> Self {
        Self { inner: heap }
    }
}

impl<T: Ord> Iterator for StableHeapIter<T> {
    type Item = T;

    #[inline(always)]
    fn next(&mut self) -> Option<T> {
        self.inner.pop().map(|i| i.into_inner())
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let exact = self.inner.len();
        (exact, Some(exact))
    }
}

/// Iterator over a binary heap sorted
pub struct StableHeapIterMax<T> {
    inner: BinaryHeap<HeapItem<Reverse<T>>>,
}

impl<T> StableHeapIterMax<T> {
    #[inline]
    pub(crate) fn new(heap: BinaryHeap<HeapItem<Reverse<T>>>) -> Self {
        Self { inner: heap }
    }
}

impl<T: Ord> Iterator for StableHeapIterMax<T> {
    type Item = T;

    #[inline(always)]
    fn next(&mut self) -> Option<T> {
        self.inner.pop().map(|i| i.into_inner().0)
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let exact = self.inner.len();
        (exact, Some(exact))
    }
}