Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

document the user-facing api of faer-core #52

Merged
merged 1 commit into from
Sep 12, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,7 @@ members = [
"faer-evd",
]
exclude = ["faer-bench"]
resolver = "2"

[workspace.dependencies]
coe-rs = "0.1"
Expand Down
2 changes: 1 addition & 1 deletion faer-cholesky/Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ std = ["faer-core/std", "pulp/std"]
nightly = ["faer-core/nightly", "pulp/nightly"]

[dev-dependencies]
criterion = "0.4"
criterion = "0.5"
rand = "0.8.5"
nalgebra = "0.32.2"
assert_approx_eq = "1.1.0"
Expand Down
6 changes: 5 additions & 1 deletion faer-cholesky/src/ldlt_diagonal/update.rs
Original file line number Diff line number Diff line change
Expand Up @@ -650,6 +650,10 @@
assert!(w.nrows() == n);
assert!(alpha.nrows() == k);

if n == 0 {
return;
}

RankRUpdate {
ld: cholesky_factors,
w,
Expand Down Expand Up @@ -832,7 +836,7 @@
let r = inserted_matrix.ncols();

assert!(cholesky_factors_extended.ncols() == new_n);
assert!(r < new_n);
assert!(r <= new_n);

Check warning on line 839 in faer-cholesky/src/ldlt_diagonal/update.rs

View check run for this annotation

Codecov / codecov/patch

faer-cholesky/src/ldlt_diagonal/update.rs#L839

Added line #L839 was not covered by tests
let old_n = new_n - r;

assert!(insertion_index <= old_n);
Expand Down
4 changes: 4 additions & 0 deletions faer-cholesky/src/llt/update.rs
Original file line number Diff line number Diff line change
Expand Up @@ -918,6 +918,10 @@ pub fn rank_r_update_clobber<E: ComplexField>(
assert!(w.nrows() == n);
assert!(alpha.nrows() == k);

if n == 0 {
return Ok(());
}

RankRUpdate {
l: cholesky_factor,
w,
Expand Down
2 changes: 1 addition & 1 deletion faer-core/Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ std = ["gemm/std", "pulp/std"]
nightly = ["gemm/nightly", "pulp/nightly"]

[dev-dependencies]
criterion = "0.4"
criterion = "0.5"
rand = "0.8.5"
nalgebra = "0.32.2"
assert_approx_eq = "1.1.0"
Expand Down
213 changes: 0 additions & 213 deletions faer-core/src/add.rs

This file was deleted.

8 changes: 4 additions & 4 deletions faer-core/src/inverse.rs
Original file line number Diff line number Diff line change
Expand Up @@ -128,7 +128,7 @@ unsafe fn invert_unit_lower_triangular_impl<E: ComplexField>(
solve::solve_unit_lower_triangular_in_place(src_br, dst_bl, parallelism);
}

/// Computes the \[conjugate\] inverse of the lower triangular matrix `src` (with implicit unit
/// Computes the inverse of the lower triangular matrix `src` (with implicit unit
/// diagonal) and stores the strictly lower triangular part of the result to `dst`.
///
/// # Panics
Expand All @@ -147,7 +147,7 @@ pub fn invert_unit_lower_triangular<E: ComplexField>(
unsafe { invert_unit_lower_triangular_impl(dst, src, parallelism) }
}

/// Computes the \[conjugate\] inverse of the lower triangular matrix `src` and stores the
/// Computes the inverse of the lower triangular matrix `src` and stores the
/// lower triangular part of the result to `dst`.
///
/// # Panics
Expand All @@ -166,7 +166,7 @@ pub fn invert_lower_triangular<E: ComplexField>(
unsafe { invert_lower_triangular_impl(dst, src, parallelism) }
}

/// Computes the \[conjugate\] inverse of the upper triangular matrix `src` (with implicit unit
/// Computes the inverse of the upper triangular matrix `src` (with implicit unit
/// diagonal) and stores the strictly upper triangular part of the result to `dst`.
///
/// # Panics
Expand All @@ -185,7 +185,7 @@ pub fn invert_unit_upper_triangular<E: ComplexField>(
)
}

/// Computes the \[conjugate\] inverse of the upper triangular matrix `src` and stores the
/// Computes the inverse of the upper triangular matrix `src` and stores the
/// upper triangular part of the result to `dst`.
///
/// # Panics
Expand Down
Loading
Loading