unitdc 0.1.0

A dc-like arbitrary precision quantity calculator.
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
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
139
140
141
142
143
144
145
146
147
148
149

use log::debug;
use num_traits::Signed;
use std::{
    fmt::Debug,
    ops::{Add, Div, Mul, Neg, Sub},
};

pub fn transpose<T: Clone>(matrix: &Vec<Vec<T>>) -> Vec<Vec<T>> {
    let mut result = Vec::new();
    for j in 0..matrix[0].len() {
        let mut row = Vec::new();
        for i in 0..matrix.len() {
            row.push(matrix[i][j].clone());
        }
        result.push(row);
    }
    result
}

#[derive(Debug, Clone)]
pub struct LinearSystem<T>
where
    T: Add<Output = T>
        + Sub<Output = T>
        + Mul<Output = T>
        + Div<Output = T>
        + Neg<Output = T>
        + Clone
        + Signed,
{
    matrix: Vec<Vec<T>>,
}

impl<T> LinearSystem<T>
where
    T: Add<Output = T>
        + Sub<Output = T>
        + Mul<Output = T>
        + Div<Output = T>
        + Neg<Output = T>
        + PartialOrd
        + Clone
        + Signed
        + Debug,
{
    pub fn n(&self) -> usize {
        self.matrix.len()
    }
    pub fn m(&self) -> usize {
        if self.matrix.len() == 0 {
            return 0;
        }
        self.matrix[0].len()
    }
    pub fn new(matrix: Vec<Vec<T>>) -> Self {
        Self { matrix }
    }
    pub fn new_equation_system(left: Vec<Vec<T>>, right: Vec<T>) -> Self {
        let mut matrix = left;
        for (i, row) in matrix.iter_mut().enumerate() {
            row.push(right[i].clone());
        }
        Self { matrix }
    }
    pub fn is_pivoted(&self, row: usize) -> bool {
        let mut cur_col = 0;
        while cur_col < self.m() - 1 && self.matrix[row][cur_col] == T::zero() {
            cur_col += 1;
        }
        if self.matrix[row][cur_col] != T::one() {
            return false;
        }
        for i in 0..self.n() {
            if i != row && self.matrix[i][cur_col] != T::zero() {
                return false;
            }
        }
        true
    }
    pub fn n_pivoted(&self) -> usize {
        self.matrix
            .iter()
            .enumerate()
            .filter(|(i, _)| self.is_pivoted(*i))
            .count()
    }
    fn scale_row(&mut self, i: usize, factor: T) {
        for j in 0..self.m() {
            self.matrix[i][j] = self.matrix[i][j].clone() * factor.clone();
        }
    }
    fn add_row(&mut self, src: usize, dst: usize, factor: T) {
        for j in 0..self.m() {
            self.matrix[dst][j] =
                self.matrix[dst][j].clone() + self.matrix[src][j].clone() * factor.clone();
        }
    }
    fn reduce_column(&mut self, column: usize) {
        let mut pivot_row = 0;
        while pivot_row < self.n()
            && (self.is_pivoted(pivot_row) || self.matrix[pivot_row][column] == T::zero())
        {
            pivot_row += 1;
        }
        if pivot_row == self.n() || self.matrix[pivot_row][column] == T::zero() {
            return;
        }
        let n_pivoted = self.n_pivoted();
        if pivot_row != n_pivoted {
            self.matrix.swap(pivot_row, n_pivoted);
            pivot_row = n_pivoted;
        }
        let scale_factor = self.matrix[pivot_row][column].clone();
        self.scale_row(n_pivoted, T::one() / scale_factor);
        for row in 0..self.n() {
            if row != n_pivoted && self.matrix[row][column] != T::zero() {
                let factor = self.matrix[row][column].clone();
                self.add_row(n_pivoted, row, -factor);
            }
        }
    }
    pub fn is_underdetermined(&self) -> bool {
        self.n_pivoted() > self.m() - 1
    }
    pub fn is_overdetermined(&self) -> bool {
        self.n_pivoted() < self.m() - 1
    }
    pub fn solve(&mut self) -> Option<Vec<T>> {
        debug!("starting matrix: {:?}", self.matrix);
        for col in 0..if self.n() < self.m() {
            self.n()
        } else {
            self.m()
        } {
            debug!("col: {}", col);
            self.reduce_column(col);
            debug!("matrix: {:?}", self.matrix);
        }
        let mut result = Vec::new();
        for row in 0..self.n() {
            if self.is_pivoted(row) {
                result.push(self.matrix[row][self.m() - 1].clone());
            } else if self.matrix[row][self.m() - 1] != T::zero() {
                return None;
            }
        }
        Some(result)
    }
}