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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
use core::fmt::{self, Debug, Formatter};
use core::iter::{FusedIterator, TrustedLen};
use super::StaticHeap;
#[derive(Clone)]
pub struct StaticHeapIntoIterSorted<T, const N: usize> {
pub(crate) inner: StaticHeap<T, N>,
}
pub struct StaticHeapDrainSorted<'a, T: Ord, const N: usize> {
pub(crate) inner: &'a mut StaticHeap<T, N>,
}
impl<T: Ord, const N: usize> Iterator for StaticHeapIntoIterSorted<T, N> {
type Item = T;
#[inline(always)]
fn next(&mut self) -> Option<T> {
self.inner.pop()
}
#[inline(always)]
fn size_hint(&self) -> (usize, Option<usize>) {
let exact = self.inner.len();
(exact, Some(exact))
}
#[inline(always)]
fn count(self) -> usize {
self.len()
}
}
impl<T: Ord, const N: usize> ExactSizeIterator for StaticHeapIntoIterSorted<T, N> {
#[inline(always)]
fn len(&self) -> usize {
self.inner.len()
}
#[inline(always)]
fn is_empty(&self) -> bool {
self.inner.is_empty()
}
}
impl<T: Ord, const N: usize> FusedIterator for StaticHeapIntoIterSorted<T, N> {}
unsafe impl<T: Ord, const N: usize> TrustedLen for StaticHeapIntoIterSorted<T, N> {}
unsafe impl<T: Ord + Sync, const N: usize> Sync for StaticHeapIntoIterSorted<T, N> {}
unsafe impl<T: Ord + Send, const N: usize> Send for StaticHeapIntoIterSorted<T, N> {}
impl<T: Debug, const N: usize> Debug for StaticHeapIntoIterSorted<T, N> {
#[inline(always)]
fn fmt(&self, f: &mut Formatter) -> fmt::Result {
f.debug_tuple("StaticHeapIntoIterSorted")
.field(&self.inner.data.as_slice())
.finish()
}
}
impl<T: Ord, const N: usize> Iterator for StaticHeapDrainSorted<'_, T, N> {
type Item = T;
#[inline(always)]
fn next(&mut self) -> Option<T> {
self.inner.pop()
}
#[inline(always)]
fn size_hint(&self) -> (usize, Option<usize>) {
let exact = self.inner.len();
(exact, Some(exact))
}
#[inline(always)]
fn count(self) -> usize {
self.len()
}
}
impl<T: Ord, const N: usize> ExactSizeIterator for StaticHeapDrainSorted<'_, T, N> {
#[inline(always)]
fn len(&self) -> usize {
self.inner.len()
}
#[inline(always)]
fn is_empty(&self) -> bool {
self.inner.is_empty()
}
}
impl<T: Ord, const N: usize> FusedIterator for StaticHeapDrainSorted<'_, T, N> {}
unsafe impl<T: Ord, const N: usize> TrustedLen for StaticHeapDrainSorted<'_, T, N> {}
unsafe impl<T: Ord + Sync, const N: usize> Sync for StaticHeapDrainSorted<'_, T, N> {}
unsafe impl<T: Ord + Send, const N: usize> Send for StaticHeapDrainSorted<'_, T, N> {}
impl<'a, T: 'a + Ord + Debug, const N: usize> Debug for StaticHeapDrainSorted<'a, T, N> {
#[inline(always)]
fn fmt(&self, f: &mut Formatter) -> fmt::Result {
f.debug_tuple("StaticHeapDrainSorted")
.field(&self.inner.data.as_slice())
.finish()
}
}
impl<'a, T: Ord, const N: usize> Drop for StaticHeapDrainSorted<'a, T, N> {
#[inline]
fn drop(&mut self) {
struct DropGuard<'r, 'a, T: Ord, const N: usize>(&'r mut StaticHeapDrainSorted<'a, T, N>);
impl<'r, 'a, T: Ord, const N: usize> Drop for DropGuard<'r, 'a, T, N> {
#[inline(always)]
fn drop(&mut self) {
while self.0.inner.pop().is_some() {}
}
}
while let Some(item) = self.inner.pop() {
let guard = DropGuard(self);
drop(item);
core::mem::forget(guard);
}
}
}