6 releases
0.2.0 | Jan 31, 2023 |
---|---|
0.1.4 | Jan 12, 2023 |
0.1.2 | Dec 18, 2022 |
#779 in Math
70KB
793 lines
Simp_LinAlg
A generically defined, light-weight linear algebra library for simple addition and multiplication of vectors and matrices.
Documentation:
Dev Notes
0.2.0
- Created public macros
- vector!
- matrix!
- Renamed modules
- simp_linalg::vector => simp_linalg::vector_impl
- simp_linalg::matrix => simp_linalg::matrix_impl
Usage
Add this to your Cargo.toml
[dependencies]
simp_linalg = "0.2.0"
Constructor Macros
There are two publicly available macros, vector! and matrix! for easy constructing of Vector<T> or Matrix<T>.
use simp_linalg::prelude::*;
let v1 = vector![1, 2, 3];
let v2 = Vector::from(vec![1, 2, 3]);
let m1 = matrix![
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
];
let m2 = Matrix::from(vec![
vec![1, 2, 3],
vec![4, 5, 6],
vec![7, 8, 9]
]);
assert_eq!(v1, v2);
assert_eq!(m1, m2);
Operator Overloads
Multiplication and addition of vectors and matrices require that their sizes relative to each other are compatible.
Multiplication
- Vectors and Matrices can be multiplied by a scalar. Note: the scalar must be on the right side
&Vector<T> * T -> Vector<T>
&Matrix<T> * T -> Matrix<T>
- Matrices can be multiplied by compatible matrices or vectors.
&Matrix<T> * &Vector<T> -> Vector<T>
&Matrix<T> * &Matrix<T> -> Matrix<T>
- Vectors can be multiplied by compatible vectors.
&Vector<T> * &Vector<T> -> T
Addition
- Vectors can be added with compatible vectors.
&Vector<T> + &Vector<T> -> Vector<T>
- Matrices can be added with compatible matrices.
&Matrix<T> + &Matrix<T> -> Matrix<T>
Fighting the Borrow Checker
Technically...
The aforementioned operator overloaded features utilize borrows frequently. This is only necessary if you intend to continue the lifetime of the variable after its use in the calculation (which is likely often).If this is not a requirement, then borrowing is unneeded and the calculation will work as expected.
For example:
use simp_linalg::prelude::*;
//Create two vectors
let vector1 = vector![1, 2, 3];
let vector2 = vector![4, 5, 6];
// Note: vector2 is dropped after this calculation, but vector1 is not.
let dot_prod: i32 = &vector1 * vector2;
Why is it dropped?
This is due to Rust's move semantics. Rust's standard library type Vec does not implement the Copy trait, thereby moving the value into the multiplication/addition function when called, and consequently dropped when that function goes out of scope. By borrowing the value, the ownership is returned to the original scope and no value is dropped.Why allow not borrowing?
This is because it allows for more readable source code.For instance, suppose you have a vector vector_1
that is transformed by a matrix matrix
, whose result will be summed to another vector vector_2
.
In version 0.1.1 (old):
let result: Vector<i32> = &(&matrix * &vector_1) + &vector_2;
In version 0.1.2+:
let result: Vector<i32> = &matrix * &vector_1 + &vector_2;
Additionally, with the new feature of multiplying vectors and matrices by scalars, this saves the programmer from another unnecessary borrow. Using the example above, suppose now you want to scale vector_2
before it is summed.
In version 0.1.1 (old and hypothetically if scalar multiplication were included):
let result: Vector<i32> = &(&matrix * &vector_1) + &(&vector_2 * 4);
In version 0.1.2+:
let result: Vector<i32> = &matrix * &vector_1 + &vector_2 * 4;
Functionality
Two main functions, lambda and map, can be used to manipulate the individual values within itself or mesh together two vectors or matrices, in a user-defined way.
Lambda Functions
Overall, these methods applies a user-defined function to each element of the vector or matrix.
The parameters for the custom function depends on the method called, which there are three:
- lambda
- Vector/Matrix: Fn(&T) -> T
- Uses the corresponding element
- Vector/Matrix: Fn(&T) -> T
- lambda_index
- Vector: Fn(usize) -> T
- Uses the index
- Matrix: Fn(usize, usize) -> T
- Uses the row index and column index
- Vector: Fn(usize) -> T
- lambda_enumerate
- Vector: Fn(usize, &T) -> T
- Uses the index and the corresponding element
- Matrix: Fn(usize, usize, &T) -> T
- Uses the row index, column index, and the corresponding element
- Vector: Fn(usize, &T) -> T
Example
use simp_linalg::prelude::*;
// initialization
let vector: Vector<i32> = vector![1, 2, 3];
let matrix: Matrix<i32> = matrix![[1,2],
[3,4]];
// squaring each element inside
let new_vector = vector.lambda(|val| val * val);
let new_matrix = matrix.lambda(|val| val * val);
// tests
assert_eq!(new_vector, vector![1, 4, 9]);
assert_eq!(new_matrix, matrix![[1,4],
[9,16]])
Map Functions
Overall, these methods combine two vectors or matrices together using a user-defined function.
The parameters for the custom function mapping depends on the mapping method called, which there are two:
- map
- Vector/Matrix: Fn(&T, &T) -> T
- Uses the two corresponding elements
- Vector/Matrix: Fn(&T, &T) -> T
- map_enumerate
- Vector: Fn(usize, &T, &T) -> T
- Uses the index and the two corresponding elements
- Matrix: Fn(usize, usize, &T, &T) -> T
- Uses the row index, column index, and the two corresponding elements
- Vector: Fn(usize, &T, &T) -> T
Example
use simp_linalg::prelude::*;
// initialization
// Note: this process is similar to matrix
// Also: the two vectors or matrices must be the same size
let lhs_vector: Vector<f64> = vector![1.5, 2.0];
let rhs_vector: Vector<f64> = vector![3.0, 4.0];
let lhs_matrix: Matrix<i32> = matrix![
[1, 2, 3 ],
[4, 5, 6 ],
[8, 9, 10]
];
let rhs_matrix: Matrix<i32> = matrix![
[2, 2, 2],
[1, 2, 1],
[0, 3, 0]
];
// multiplying each corresponding element
let meshed_vector = lhs_vector.map(&rhs_vector, |lhs_val, rhs_val| lhs_val * rhs_val);
let meshed_matrix = lhs_matrix.map(&rhs_matrix, |lhs_val, rhs_val| lhs_val * rhs_val);
// test
assert_eq!(meshed_vector, vector![4.5, 8.0]);
assert_eq!(meshed_matrix, matrix![
[2, 4, 6],
[4, 10, 6],
[0, 27, 0]
]);