lll-rs 0.2.0

Implementation of the LLL algorithm for lattice reduction and it's improved version L²
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

//! Basic matrix structure for LLL

use crate::vector::Vector;

use std::{
    fmt::{self, Debug},
    ops::{Index, IndexMut},
};

/// A `Matrix` is a collection of `Vector`s
pub struct Matrix<T: Vector> {
    /// Internal representation as a list of elements of type `T`
    columns: Vec<T>,

    /// Dimensions of the matrix
    dimensions: (usize, usize),
}

impl<T: Vector> Matrix<T>
where
    T: Clone,
{
    /// Initialise an empty `Matrix`
    ///      - `col_num`: number of columns
    ///      - `col_dim`: number of rows
    pub fn init(col_num: usize, col_dim: usize) -> Self {
        Self {
            columns: vec![T::init(col_dim); col_num],
            dimensions: (col_num, col_dim),
        }
    }

    /// Return the matrix dimensions
    pub fn dimensions(&self) -> (usize, usize) {
        self.dimensions
    }

    /// Swap two columns of the matrix
    pub fn swap(&mut self, i: usize, j: usize) {
        self.columns.swap(i, j);
    }
}

/// Direct access to a column
impl<T> Index<usize> for Matrix<T>
where
    T: Vector,
{
    type Output = T;

    fn index(&self, index: usize) -> &T {
        &self.columns[index]
    }
}

/// Direct access to a column (mutable)
impl<T> IndexMut<usize> for Matrix<T>
where
    T: Vector,
{
    fn index_mut(&mut self, index: usize) -> &mut T {
        &mut self.columns[index]
    }
}

impl<T> fmt::Debug for Matrix<T>
where
    T: Vector + Debug,
{
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        writeln!(f, "{:?}\n", self.columns)
    }
}