nalgebra/nalgebra-sparse/src/lib.rs

193 lines
6.0 KiB
Rust
Raw Normal View History

2020-07-21 23:39:06 +08:00
//! Sparse matrices and algorithms for nalgebra.
//!
//! TODO: Docs
//!
//!
//! ### Planned functionality
//!
//! Below we list desired functionality. This further needs to be refined into what is needed
//! for an initial contribution, and what can be added in future contributions.
//!
//! - Sparsity pattern type. Functionality:
//! - [x] Access to offsets, indices as slices.
//! - [x] Return number of nnz
//! - [x] Access a given lane as a slice of minor indices
//! - [x] Construct from valid offset + index data
//! - [ ] Construct from unsorted (but otherwise valid) offset + index data
//! - [x] Iterate over entries (i, j) in the pattern
//! - [x] "Disassemble" the sparsity pattern into the raw index data arrays.
//! - CSR matrix type. Functionality:
//! - [x] Access to CSR data as slices.
//! - [x] Return number of nnz
//! - [x] Access a given row, which gives convenient access to the data associated
//! with a particular row
//! - [x] Construct from valid CSR data
//! - [ ] Construct from unsorted CSR data
//! - [x] Iterate over entries (i, j, v) in the matrix (+mutable).
//! - [x] Iterate over rows in the matrix (+ mutable).
//! - [x] "Disassemble" the CSR matrix into the raw CSR data arrays.
//!
//! - CSC matrix type. Functionality:
//! - [x] Access to CSC data as slices.
//! - [x] Return number of nnz
//! - [x] Access a given column, which gives convenient access to the data associated
//! with a particular column
//! - [x] Construct from valid CSC data
//! - [ ] Construct from unsorted CSC data
//! - [x] Iterate over entries (i, j, v) in the matrix (+mutable).
//! - [x] Iterate over rows in the matrix (+ mutable).
//! - [x] "Disassemble" the CSC matrix into the raw CSC data arrays.
//! - COO matrix type. Functionality:
//! - [x] Construct new "empty" COO matrix
//! - [x] Construct from triplet arrays.
//! - [x] Push new triplets to the matrix.
//! - [x] Iterate over triplets.
//! - [x] "Disassemble" the COO matrix into its underlying triplet arrays.
//! - Format conversion:
//! - [x] COO -> Dense
//! - [x] CSR -> Dense
//! - [x] CSC -> Dense
//! - [x] COO -> CSR
//! - [x] COO -> CSC
//! - [x] CSR -> CSC
//! - [x] CSC -> CSR
//! - [x] CSR -> COO
//! - [x] CSC -> COO
//! - [x] Dense -> COO
//! - [x] Dense -> CSR
//! - [x] Dense -> CSC
//! - Arithmetic. In general arithmetic is only implemented between instances of the same format,
//! or between dense and instances of a given format. For example, we do not implement
//! CSR * CSC, only CSR * CSR and CSC * CSC.
//! - CSR:
//! - [ ] Dense = CSR * Dense (the other way around is not particularly useful)
//! - [ ] CSR = CSR * CSR
//! - [ ] CSR = CSR +- CSR
//! - [ ] CSR +=/-= CSR
//! - COO:
//! - [ ] Dense = COO * Dense (sometimes useful for very sparse matrices)
//! - CSC:
//! - Same as CSR
//! - Cholesky factorization (port existing factorization from nalgebra's sparse module)
//!
//!
//! TODO: Write docs on the following:
//!
//! - Overall design ("easy API" vs. "expert" API etc.)
//! - Conversions (From, explicit "expert" API etc.)
//! - Matrix ops design
2020-07-21 23:39:06 +08:00
#![deny(non_camel_case_types)]
#![deny(unused_parens)]
#![deny(non_upper_case_globals)]
#![deny(unused_qualifications)]
#![deny(unused_results)]
#![deny(missing_docs)]
pub mod coo;
pub mod csc;
pub mod csr;
pub mod pattern;
2020-07-14 00:44:40 +08:00
pub mod ops;
pub mod convert;
pub mod factorization;
2020-07-14 00:44:40 +08:00
pub(crate) mod cs;
#[cfg(feature = "proptest-support")]
pub mod proptest;
2020-07-14 00:44:40 +08:00
use std::error::Error;
use std::fmt;
use num_traits::Zero;
2020-07-14 00:44:40 +08:00
2020-07-21 23:39:06 +08:00
/// Errors produced by functions that expect well-formed sparse format data.
2020-07-14 00:44:40 +08:00
#[derive(Debug)]
pub struct SparseFormatError {
kind: SparseFormatErrorKind,
// Currently we only use an underlying error for generating the `Display` impl
error: Box<dyn Error>
}
impl SparseFormatError {
/// The type of error.
pub fn kind(&self) -> &SparseFormatErrorKind {
&self.kind
}
pub(crate) fn from_kind_and_error(kind: SparseFormatErrorKind, error: Box<dyn Error>) -> Self {
Self {
kind,
error
}
}
/// Helper functionality for more conveniently creating errors.
pub(crate) fn from_kind_and_msg(kind: SparseFormatErrorKind, msg: &'static str) -> Self {
Self::from_kind_and_error(kind, Box::<dyn Error>::from(msg))
}
}
/// The type of format error described by a [SparseFormatError](struct.SparseFormatError.html).
#[non_exhaustive]
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum SparseFormatErrorKind {
2020-07-14 00:44:40 +08:00
/// Indicates that the index data associated with the format contains at least one index
/// out of bounds.
IndexOutOfBounds,
2020-07-14 00:44:40 +08:00
/// Indicates that the provided data contains at least one duplicate entry, and the
/// current format does not support duplicate entries.
DuplicateEntry,
2020-07-14 00:44:40 +08:00
/// Indicates that the provided data for the format does not conform to the high-level
/// structure of the format.
///
/// For example, the arrays defining the format data might have incompatible sizes.
InvalidStructure,
2020-07-14 00:44:40 +08:00
}
impl fmt::Display for SparseFormatError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.error)
2020-07-14 00:44:40 +08:00
}
}
impl Error for SparseFormatError {}
/// TODO
#[derive(Debug, PartialEq, Eq)]
pub enum SparseEntry<'a, T> {
/// TODO
NonZero(&'a T),
/// TODO
Zero
}
impl<'a, T: Clone + Zero> SparseEntry<'a, T> {
/// TODO
pub fn to_value(self) -> T {
match self {
SparseEntry::NonZero(value) => value.clone(),
SparseEntry::Zero => T::zero()
}
}
}
/// TODO
#[derive(Debug, PartialEq, Eq)]
pub enum SparseEntryMut<'a, T> {
/// TODO
NonZero(&'a mut T),
/// TODO
Zero
}
impl<'a, T: Clone + Zero> SparseEntryMut<'a, T> {
/// TODO
pub fn to_value(self) -> T {
match self {
SparseEntryMut::NonZero(value) => value.clone(),
SparseEntryMut::Zero => T::zero()
}
}
}