Struct PriorityMatrix

Source

pub struct PriorityMatrix<R, C, W>where
    R: Clone + Eq + Hash,
    C: Clone + Eq + Hash,
    W: Clone + Ord,
{ /* private fields */ }

Expand description

The 2-dimensional matrix that supports per-row and per-column maximum key queries.

Implementations§

Source §

impl<R, C, W> PriorityMatrix<R, C, W>
where R: Clone + Eq + Hash, C: Clone + Eq + Hash, W: Clone + Ord,

Source

pub fn new(&self) -> Self

Source

pub fn insert(&mut self, row: R, col: C, weight: W) -> Option<W>

Source

pub fn peek(&self) -> Option<BorrowedEntry<'_, R, C, W>>

Examples found in repository ?

examples/peek.rs (line 14)

3fn main() {
4    let matrix: PriorityMatrix<char, &str, i32> = [
5        ('a', "alpha", 0),
6        ('a', "beta", 3),
7        ('b', "alpha", 2),
8        ('b', "beta", 1),
9    ]
10    .into_iter()
11    .collect();
12
13    // Get the maximum entry
14    let entry = matrix.peek().unwrap();
15    assert_eq!(entry.row, &'a');
16    assert_eq!(entry.column, &"beta");
17    assert_eq!(entry.weight, &3);
18
19    // Get the maximum entry in a row
20    let entry = matrix.peek_from_row(&'b').unwrap();
21    assert_eq!(entry.row, &'b');
22    assert_eq!(entry.column, &"alpha");
23    assert_eq!(entry.weight, &2);
24
25    // Get the maximum entry in a column
26    let entry = matrix.peek_from_column(&"alpha").unwrap();
27    assert_eq!(entry.row, &'b');
28    assert_eq!(entry.column, &"alpha");
29    assert_eq!(entry.weight, &2);
30}

Source

pub fn peek_from_row<'a>( &'a self, row: &'a R, ) -> Option<BorrowedEntry<'_, R, C, W>>

Examples found in repository ?

examples/peek.rs (line 20)

3fn main() {
4    let matrix: PriorityMatrix<char, &str, i32> = [
5        ('a', "alpha", 0),
6        ('a', "beta", 3),
7        ('b', "alpha", 2),
8        ('b', "beta", 1),
9    ]
10    .into_iter()
11    .collect();
12
13    // Get the maximum entry
14    let entry = matrix.peek().unwrap();
15    assert_eq!(entry.row, &'a');
16    assert_eq!(entry.column, &"beta");
17    assert_eq!(entry.weight, &3);
18
19    // Get the maximum entry in a row
20    let entry = matrix.peek_from_row(&'b').unwrap();
21    assert_eq!(entry.row, &'b');
22    assert_eq!(entry.column, &"alpha");
23    assert_eq!(entry.weight, &2);
24
25    // Get the maximum entry in a column
26    let entry = matrix.peek_from_column(&"alpha").unwrap();
27    assert_eq!(entry.row, &'b');
28    assert_eq!(entry.column, &"alpha");
29    assert_eq!(entry.weight, &2);
30}

Source

pub fn peek_from_column<'a>( &'a self, col: &'a C, ) -> Option<BorrowedEntry<'a, R, C, W>>

Examples found in repository ?

examples/peek.rs (line 26)

3fn main() {
4    let matrix: PriorityMatrix<char, &str, i32> = [
5        ('a', "alpha", 0),
6        ('a', "beta", 3),
7        ('b', "alpha", 2),
8        ('b', "beta", 1),
9    ]
10    .into_iter()
11    .collect();
12
13    // Get the maximum entry
14    let entry = matrix.peek().unwrap();
15    assert_eq!(entry.row, &'a');
16    assert_eq!(entry.column, &"beta");
17    assert_eq!(entry.weight, &3);
18
19    // Get the maximum entry in a row
20    let entry = matrix.peek_from_row(&'b').unwrap();
21    assert_eq!(entry.row, &'b');
22    assert_eq!(entry.column, &"alpha");
23    assert_eq!(entry.weight, &2);
24
25    // Get the maximum entry in a column
26    let entry = matrix.peek_from_column(&"alpha").unwrap();
27    assert_eq!(entry.row, &'b');
28    assert_eq!(entry.column, &"alpha");
29    assert_eq!(entry.weight, &2);
30}