mirror of https://github.com/01-edu/public.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
4 years ago | |
---|---|---|
.. | ||
README.md | 4 years ago |
README.md
matrix
Instructions
Define a data structure to represent a matrix of any size and implement the basic operations for this. The next steps need to be followed:
-
You can use a 2 dimensional Vec's. We will consider a matrix as a rectangular arrangements of scalars.
-
You have to use the definition of scalars done in the exercise:
lalgebra_scalar
-
Then define the associated function
identity
that returns the identity matrix of size n -
Finally, define the associated function
zero
that returns a matrix of sizerow x col
with all the positions filled by zeroes
Notions
Expected Functions and Structure
pub struct Matrix<T>(pub Vec<Vec<T>>);
impl <T: Scalar<Item = T>> Matrix<T> {
pub fn new() -> Matrix<T> {
}
pub fn zero(row: usize, col: usize) -> Matrix<T> {
}
pub fn identity(n: usize) -> Matrix<T> {
}
}
Usage
Here is a program to test your function.
use matrix::*;
fn main() {
let m: Matrix<u32> = Matrix(vec![vec![0, 0, 0, 0], vec![0, 0, 0, 0], vec![0, 0, 0, 0]]);
println!("{:?}", m);
println!("{:?}", Matrix::<i32>::identity(4));
println!("{:?}", Matrix::<f64>::zero(3, 4));
}
And its output:
student@ubuntu:~/[[ROOT]]/test$ cargo run
Matrix([[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]])
Matrix([[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 0, 1]])
Matrix([[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]])
student@ubuntu:~/[[ROOT]]/test$