priority-matrix 0.2.0

A matrix that supports per-row, per-column and whole-matrix maximum key queries.
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

//! Iterator types.

use std::hash::Hash;

pub struct Iter<'a, R, C, W>
where
    R: Eq + Hash,
    C: Eq + Hash,
    W: Ord,
{
    pub(crate) iter: priority_queue::core_iterators::Iter<'a, (R, C), W>,
}

impl<'a, R, C, W> Iterator for Iter<'a, R, C, W>
where
    R: Eq + Hash,
    C: Eq + Hash,
    W: Ord,
{
    type Item = (&'a R, &'a C, &'a W);

    fn next(&mut self) -> Option<Self::Item> {
        let ((row, col), weight) = self.iter.next()?;
        Some((row, col, weight))
    }
}

pub struct IntoIter<R, C, W>
where
    R: Eq + Hash,
    C: Eq + Hash,
    W: Ord,
{
    pub(crate) iter: priority_queue::core_iterators::IntoIter<(R, C), W>,
}

impl<R, C, W> Iterator for IntoIter<R, C, W>
where
    R: Eq + Hash,
    C: Eq + Hash,
    W: Ord,
{
    type Item = (R, C, W);

    fn next(&mut self) -> Option<Self::Item> {
        let ((row, col), weight) = self.iter.next()?;
        Some((row, col, weight))
    }
}