iterative-solvers 0.2.3

//! Utility functions for creating sparse matrices.

use crate::{
    IterSolverError, IterSolverResult,
    utils::{empty_spcsc, empty_spcsr},
};
#[cfg(not(feature = "ndarray"))]
use crate::{SparseCscMatrix, SparseCsrMatrix};

#[cfg(feature = "nalgebra")]
use nalgebra_sparse::CooMatrix;

#[cfg(feature = "faer")]
use faer::sparse::Triplet;

#[cfg(feature = "ndarray")]
type SparseCsrMatrix<T> = sprs::CsMat<T>;
#[cfg(feature = "ndarray")]
type SparseCscMatrix<T> = sprs::CsMat<T>;

#[cfg(feature = "ndarray")]
use sprs::CsMat;

/// Creates a diagonal sparse CSR matrix with the given data placed on a specified diagonal.
///
/// This function constructs a matrix where the provided data is placed on a diagonal
/// that can be offset from the main diagonal. The resulting matrix size is determined
/// by the length of the data and the absolute value of the offset.
///
/// # Arguments
///
/// * `data` - A slice of f64 values to be placed on the diagonal
/// * `offset` - The diagonal offset:
///   - `0`: Main diagonal
///   - Positive: above the main diagonal (upper-diagonal)
///   - Negative: below the main diagonal (lower-diagonal)
///
/// # Returns
///
/// A `CsrMatrix<f64>` containing the diagonal matrix. If `data` is empty, returns
/// a 0×0 matrix.
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::diagm_csr;
///
/// // Main diagonal
/// let data = vec![1.0, 2.0, 3.0];
/// let mat = diagm_csr(&data, 0);
/// // Creates:
/// // [1.0, 0.0, 0.0]
/// // [0.0, 2.0, 0.0]
/// // [0.0, 0.0, 3.0]
///
/// // Upper-diagonal (offset = 1)
/// let mat = diagm_csr(&data, 1);
/// // Creates:
/// // [0.0, 1.0, 0.0, 0.0]
/// // [0.0, 0.0, 2.0, 0.0]
/// // [0.0, 0.0, 0.0, 3.0]
/// // [0.0, 0.0, 0.0, 0.0]
/// ```
pub fn diagm_csr(data: &[f64], offset: isize) -> SparseCsrMatrix<f64> {
    if data.is_empty() {
        return empty_spcsr();
    }

    let offset_usize = offset.unsigned_abs();
    let n = data.len() + offset_usize;

    let tmp = match offset {
        0 => {
            #[cfg(feature = "nalgebra")]
            {
                let mut coo = CooMatrix::<f64>::new(n, n);

                data.iter()
                    .enumerate()
                    .for_each(|(i, &val)| coo.push(i, i, val));
                coo
            }
            #[cfg(feature = "faer")]
            {
                data.iter()
                    .enumerate()
                    .map(|(i, &val)| Triplet::new(i, i, val))
                    .collect::<Vec<_>>()
            }
            #[cfg(feature = "ndarray")]
            {
                let indptr = (0..=data.len())
                    .chain(std::iter::repeat_n(data.len(), n - data.len()))
                    .collect::<Vec<_>>();
                let indices = (0..data.len()).collect::<Vec<_>>();

                (indptr, indices)
            }
        }
        offset => {
            #[cfg(feature = "nalgebra")]
            let mut coo = CooMatrix::<f64>::new(n, n);

            if offset > 0 {
                #[cfg(feature = "nalgebra")]
                {
                    data.iter()
                        .enumerate()
                        .for_each(|(i, &val)| coo.push(i, i + offset_usize, val));
                    coo
                }
                #[cfg(feature = "faer")]
                {
                    data.iter()
                        .enumerate()
                        .map(|(i, &val)| Triplet::new(i, i + offset_usize, val))
                        .collect::<Vec<_>>()
                }
                #[cfg(feature = "ndarray")]
                {
                    // Each of the first `data.len()` rows has one element.
                    let indptr = (0..=data.len())
                        .chain(std::iter::repeat_n(data.len(), n - data.len()))
                        .collect::<Vec<_>>();
                    // The column indices are offset from the row indices.
                    let indices = (offset_usize..offset_usize + data.len()).collect::<Vec<_>>();
                    (indptr, indices)
                }
            } else {
                #[cfg(feature = "nalgebra")]
                {
                    data.iter()
                        .enumerate()
                        .for_each(|(i, &val)| coo.push(i + offset_usize, i, val));
                    coo
                }
                #[cfg(feature = "faer")]
                {
                    data.iter()
                        .enumerate()
                        .map(|(i, &val)| Triplet::new(i + offset_usize, i, val))
                        .collect::<Vec<_>>()
                }
                #[cfg(feature = "ndarray")]
                {
                    // The first `offset_usize` rows are empty.
                    let indptr = std::iter::repeat_n(0, offset_usize + 1)
                        .chain(1..=data.len())
                        .chain(std::iter::repeat_n(
                            data.len(),
                            n - (offset_usize + data.len()),
                        ))
                        .collect::<Vec<_>>();
                    // The column indices start from 0.
                    let indices = (0..data.len()).collect::<Vec<_>>();
                    (indptr, indices)
                }
            }
        }
    };
    #[cfg(feature = "nalgebra")]
    {
        SparseCsrMatrix::from(&tmp)
    }
    #[cfg(feature = "faer")]
    {
        SparseCsrMatrix::try_new_from_triplets(n, n, &tmp).unwrap()
    }
    #[cfg(feature = "ndarray")]
    {
        CsMat::new((n, n), tmp.0, tmp.1, data.to_vec())
    }
}

/// Creates a tridiagonal sparse CSR matrix from diagonal, lower diagonal, and upper diagonal vectors.
///
/// This function constructs a tridiagonal matrix where:
/// - The main diagonal contains elements from the `diagonal` vector
/// - The lower-diagonal (below main) contains elements from the `lower` vector
/// - The upper-diagonal (above main) contains elements from the `upper` vector
///
/// # Arguments
///
/// * `diagonal` - A slice containing the main diagonal elements
/// * `lower` - A slice containing the lower diagonal elements (lower-diagonal)
/// * `upper` - A slice containing the upper diagonal elements (upper-diagonal)
///
/// # Dimension Requirements
///
/// For a valid tridiagonal matrix:
/// - `diagonal.len()` must equal `lower.len() + 1`
/// - `lower.len()` must equal `upper.len()`
///
/// This is because an n×n tridiagonal matrix has:
/// - n diagonal elements
/// - (n-1) lower-diagonal elements
/// - (n-1) upper-diagonal elements
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::tridiagonal_csr;
///
/// let diagonal = vec![2.0, 3.0, 4.0];
/// let lower = vec![1.0, 1.0];
/// let upper = vec![1.0, 1.0];
///
/// let result = tridiagonal_csr(&diagonal, &lower, &upper).unwrap();
/// // Creates:
/// // [2.0, 1.0, 0.0]
/// // [1.0, 3.0, 1.0]
/// // [0.0, 1.0, 4.0]
/// ```
///
/// # Errors
///
/// Returns `IterSolverError::DimensionError` if the input vectors have incompatible dimensions.
pub fn tridiagonal_csr(
    diagonal: &[f64],
    lower: &[f64],
    upper: &[f64],
) -> IterSolverResult<SparseCsrMatrix<f64>> {
    if diagonal.len() != lower.len() + 1 || lower.len() != upper.len() {
        return Err(IterSolverError::DimensionError(format!(
            "For tridiagonal matrix, the length of `diagonal` {}, the length of `lower` {} and `upper` {} do not match",
            diagonal.len(),
            lower.len(),
            upper.len()
        )));
    }
    #[cfg(not(feature = "ndarray"))]
    {
        Ok(diagm_csr(diagonal, 0) + diagm_csr(lower, -1) + diagm_csr(upper, 1))
    }
    #[cfg(feature = "ndarray")]
    {
        Ok(&(&diagm_csr(diagonal, 0) + &diagm_csr(lower, -1)) + &diagm_csr(upper, 1))
    }
}

/// Creates a symmetric tridiagonal sparse CSR matrix from diagonal and sub-diagonal vectors.
///
/// This function constructs a symmetric tridiagonal matrix where the lower-diagonal
/// and upper-diagonal elements are identical. This is a common structure in numerical
/// methods, particularly for solving differential equations and eigenvalue problems.
///
/// # Arguments
///
/// * `diagonal` - A slice containing the main diagonal elements
/// * `sub_diagonal` - A slice containing the lower-diagonal elements, which will be
///   mirrored to create the upper-diagonal
///
/// # Dimension Requirements
///
/// For a valid symmetric tridiagonal matrix:
/// - `diagonal.len()` must equal `sub_diagonal.len() + 1`
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::symmetric_tridiagonal_csr;
///
/// let diagonal = vec![2.0, 3.0, 4.0];
/// let sub_diagonal = vec![1.0, 1.5];
///
/// let result = symmetric_tridiagonal_csr(&diagonal, &sub_diagonal).unwrap();
/// // Creates:
/// // [2.0, 1.0, 0.0]
/// // [1.0, 3.0, 1.5]
/// // [0.0, 1.5, 4.0]
/// ```
///
/// # Errors
///
/// Returns `IterSolverError::DimensionError` if the input vectors have incompatible dimensions.
///
/// # Note
///
/// This function internally calls `tridiagonal(diagonal, sub_diagonal, sub_diagonal)`,
/// ensuring that the lower and upper diagonals are identical.
pub fn symmetric_tridiagonal_csr(
    diagonal: &[f64],
    sub_diagonal: &[f64],
) -> IterSolverResult<SparseCsrMatrix<f64>> {
    tridiagonal_csr(diagonal, sub_diagonal, sub_diagonal)
}

/// Creates a diagonal sparse CSC matrix with the given data placed on a specified diagonal.
///
/// This function constructs a matrix where the provided data is placed on a diagonal
/// that can be offset from the main diagonal. The resulting matrix size is determined
/// by the length of the data and the absolute value of the offset.
///
/// # Arguments
///
/// * `data` - A slice of f64 values to be placed on the diagonal
/// * `offset` - The diagonal offset:
///   - `0`: Main diagonal
///   - Positive: above the main diagonal (upper-diagonal)
///   - Negative: below the main diagonal (lower-diagonal)
///
/// # Returns
///
/// A `CscMatrix<f64>` containing the diagonal matrix. If `data` is empty, returns
/// a 0×0 matrix.
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::diagm_csr;
///
/// // Main diagonal
/// let data = vec![1.0, 2.0, 3.0];
/// let mat = diagm_csr(&data, 0);
/// // Creates:
/// // [1.0, 0.0, 0.0]
/// // [0.0, 2.0, 0.0]
/// // [0.0, 0.0, 3.0]
///
/// // Upper-diagonal (offset = 1)
/// let mat = diagm_csr(&data, 1);
/// // Creates:
/// // [0.0, 1.0, 0.0, 0.0]
/// // [0.0, 0.0, 2.0, 0.0]
/// // [0.0, 0.0, 0.0, 3.0]
/// // [0.0, 0.0, 0.0, 0.0]
/// ```
pub fn diagm_csc(data: &[f64], offset: isize) -> SparseCscMatrix<f64> {
    if data.is_empty() {
        return empty_spcsc();
    }

    let offset_usize = offset.unsigned_abs();
    let n = data.len() + offset_usize;

    let tmp = match offset {
        0 => {
            #[cfg(feature = "nalgebra")]
            {
                let mut coo = CooMatrix::<f64>::new(n, n);

                data.iter()
                    .enumerate()
                    .for_each(|(i, &val)| coo.push(i, i, val));
                coo
            }
            #[cfg(feature = "faer")]
            {
                data.iter()
                    .enumerate()
                    .map(|(i, &val)| Triplet::new(i, i, val))
                    .collect::<Vec<_>>()
            }
            #[cfg(feature = "ndarray")]
            {
                let indptr = (0..=data.len())
                    .chain(std::iter::repeat_n(data.len(), n - data.len()))
                    .collect::<Vec<_>>();
                let indices = (0..data.len()).collect::<Vec<_>>();

                (indptr, indices)
            }
        }
        offset => {
            if offset > 0 {
                #[cfg(feature = "nalgebra")]
                {
                    let mut coo = CooMatrix::<f64>::new(n, n);
                    data.iter()
                        .enumerate()
                        .for_each(|(i, &val)| coo.push(i, i + offset_usize, val));
                    coo
                }
                #[cfg(feature = "faer")]
                {
                    data.iter()
                        .enumerate()
                        .map(|(i, &val)| Triplet::new(i, i + offset_usize, val))
                        .collect::<Vec<_>>()
                }
                #[cfg(feature = "ndarray")]
                {
                    let indptr = std::iter::repeat_n(0, offset_usize + 1)
                        .chain(1..=data.len())
                        .chain(std::iter::repeat_n(
                            data.len(),
                            n - (offset_usize + data.len()),
                        ))
                        .collect::<Vec<_>>();
                    let indices = (0..data.len()).collect::<Vec<_>>();
                    (indptr, indices)
                }
            } else {
                #[cfg(feature = "nalgebra")]
                {
                    let mut coo = CooMatrix::<f64>::new(n, n);
                    data.iter()
                        .enumerate()
                        .for_each(|(i, &val)| coo.push(i + offset_usize, i, val));
                    coo
                }
                #[cfg(feature = "faer")]
                {
                    data.iter()
                        .enumerate()
                        .map(|(i, &val)| Triplet::new(i + offset_usize, i, val))
                        .collect::<Vec<_>>()
                }
                #[cfg(feature = "ndarray")]
                {
                    let indptr = std::iter::repeat_n(0, 1)
                        .chain(1..=data.len())
                        .chain(std::iter::repeat_n(data.len(), n - data.len()))
                        .collect::<Vec<_>>();
                    let indices = (offset_usize..offset_usize + data.len()).collect::<Vec<_>>();
                    (indptr, indices)
                }
            }
        }
    };
    #[cfg(feature = "nalgebra")]
    {
        SparseCscMatrix::from(&tmp)
    }
    #[cfg(feature = "faer")]
    {
        SparseCscMatrix::try_new_from_triplets(n, n, &tmp).unwrap()
    }
    #[cfg(feature = "ndarray")]
    {
        CsMat::new_csc((n, n), tmp.0, tmp.1, data.to_vec())
    }
}

/// Creates a tridiagonal sparse CSC matrix from diagonal, lower diagonal, and upper diagonal vectors.
///
/// This function constructs a tridiagonal matrix where:
/// - The main diagonal contains elements from the `diagonal` vector
/// - The lower-diagonal (below main) contains elements from the `lower` vector
/// - The upper-diagonal (above main) contains elements from the `upper` vector
///
/// # Arguments
///
/// * `diagonal` - A slice containing the main diagonal elements
/// * `lower` - A slice containing the lower diagonal elements (lower-diagonal)
/// * `upper` - A slice containing the upper diagonal elements (upper-diagonal)
///
/// # Dimension Requirements
///
/// For a valid tridiagonal matrix:
/// - `diagonal.len()` must equal `lower.len() + 1`
/// - `lower.len()` must equal `upper.len()`
///
/// This is because an n×n tridiagonal matrix has:
/// - n diagonal elements
/// - (n-1) lower-diagonal elements
/// - (n-1) upper-diagonal elements
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::tridiagonal_csr;
///
/// let diagonal = vec![2.0, 3.0, 4.0];
/// let lower = vec![1.0, 1.0];
/// let upper = vec![1.0, 1.0];
///
/// let result = tridiagonal_csr(&diagonal, &lower, &upper).unwrap();
/// // Creates:
/// // [2.0, 1.0, 0.0]
/// // [1.0, 3.0, 1.0]
/// // [0.0, 1.0, 4.0]
/// ```
///
/// # Errors
///
/// Returns `IterSolverError::DimensionError` if the input vectors have incompatible dimensions.
pub fn tridiagonal_csc(
    diagonal: &[f64],
    lower: &[f64],
    upper: &[f64],
) -> IterSolverResult<SparseCscMatrix<f64>> {
    if diagonal.len() != lower.len() + 1 || lower.len() != upper.len() {
        return Err(IterSolverError::DimensionError(format!(
            "For tridiagonal matrix, the length of `diagonal` {}, the length of `lower` {} and `upper` {} do not match",
            diagonal.len(),
            lower.len(),
            upper.len()
        )));
    }
    #[cfg(not(feature = "ndarray"))]
    {
        Ok(diagm_csc(diagonal, 0) + diagm_csc(lower, -1) + diagm_csc(upper, 1))
    }
    #[cfg(feature = "ndarray")]
    {
        Ok(&(&diagm_csc(diagonal, 0) + &diagm_csc(lower, -1)) + &diagm_csc(upper, 1))
    }
}

/// Creates a symmetric tridiagonal sparse CSC matrix from diagonal and sub-diagonal vectors.
///
/// This function constructs a symmetric tridiagonal matrix where the lower-diagonal
/// and upper-diagonal elements are identical. This is a common structure in numerical
/// methods, particularly for solving differential equations and eigenvalue problems.
///
/// # Arguments
///
/// * `diagonal` - A slice containing the main diagonal elements
/// * `sub_diagonal` - A slice containing the lower-diagonal elements, which will be
///   mirrored to create the upper-diagonal
///
/// # Dimension Requirements
///
/// For a valid symmetric tridiagonal matrix:
/// - `diagonal.len()` must equal `sub_diagonal.len() + 1`
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::symmetric_tridiagonal_csc;
///
/// let diagonal = vec![2.0, 3.0, 4.0];
/// let sub_diagonal = vec![1.0, 1.5];
///
/// let result = symmetric_tridiagonal_csc(&diagonal, &sub_diagonal).unwrap();
/// // Creates:
/// // [2.0, 1.0, 0.0]
/// // [1.0, 3.0, 1.5]
/// // [0.0, 1.5, 4.0]
/// ```
///
/// # Errors
///
/// Returns `IterSolverError::DimensionError` if the input vectors have incompatible dimensions.
///
/// # Note
///
/// This function internally calls `tridiagonal(diagonal, sub_diagonal, sub_diagonal)`,
/// ensuring that the lower and upper diagonals are identical.
pub fn symmetric_tridiagonal_csc(
    diagonal: &[f64],
    sub_diagonal: &[f64],
) -> IterSolverResult<SparseCscMatrix<f64>> {
    tridiagonal_csc(diagonal, sub_diagonal, sub_diagonal)
}

/// Creates a sparse csr diagonal matrix from a list of diagonals and their offsets.
///
/// # Arguments
///
/// * `diagonals` - A vector of vectors, where each inner vector contains the diagonal elements
/// * `offsets` - A vector of offsets for each diagonal
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::diags_csr;
///
/// let diagonals = vec![vec![1.0, 2.0, 3.0], vec![4.0, 5.0], vec![6.0]];
/// let offsets = vec![0, 1, 2];
///
/// let result = diags_csr(diagonals, offsets);
/// // Creates:
/// // [1.0, 4.0, 6.0]
/// // [0.0, 2.0, 5.0]
/// // [0.0, 0.0, 3.0]
/// ```
pub fn diags_csr(
    diagonals: Vec<Vec<f64>>,
    offsets: Vec<isize>,
) -> IterSolverResult<SparseCsrMatrix<f64>> {
    if diagonals.len() != offsets.len() {
        return Err(IterSolverError::DimensionError(format!(
            "The length of `diagonals` {} and `offsets` {} do not match",
            diagonals.len(),
            offsets.len()
        )));
    }
    if diagonals.is_empty() {
        return Ok(empty_spcsr());
    }

    // Check for duplicate offsets
    let n = diagonals[0].len() + offsets[0].unsigned_abs();
    let mut unique_offsets = std::collections::HashSet::new();
    for (index, (diag, offset)) in diagonals.iter().zip(offsets.iter()).enumerate() {
        if !unique_offsets.insert(*offset) {
            return Err(IterSolverError::InvalidInput(
                "Duplicate offsets are not allowed".to_string(),
            ));
        }
        if diag.len() + offset.unsigned_abs() != n {
            return Err(IterSolverError::DimensionError(format!(
                "The {}th diagonal's length {} and its offset {} do not match",
                index,
                diag.len(),
                offset
            )));
        }
    }

    let mut res = diagm_csr(&diagonals[0], offsets[0]);

    for (diag, offset) in diagonals.iter().zip(offsets.iter()) {
        res = &res + &diagm_csr(diag, *offset);
    }
    Ok(res)
}

/// Creates a sparse csr diagonal matrix from a list of diagonals and their offsets.
///
/// # Arguments
///
/// * `diagonals` - A vector of vectors, where each inner vector contains the diagonal elements
/// * `offsets` - A vector of offsets for each diagonal
///
/// # Examples
///
/// ```rust
/// use iterative_solvers::utils::sparse::diags_csr;
///
/// let diagonals = vec![vec![1.0, 2.0, 3.0], vec![4.0, 5.0], vec![6.0]];
/// let offsets = vec![0, 1, 2];
///
/// let result = diags_csr(diagonals, offsets);
/// // Creates:
/// // [1.0, 4.0, 6.0]
/// // [0.0, 2.0, 5.0]
/// // [0.0, 0.0, 3.0]
/// ```
pub fn diags_csc(
    diagonals: Vec<Vec<f64>>,
    offsets: Vec<isize>,
) -> IterSolverResult<SparseCscMatrix<f64>> {
    if diagonals.len() != offsets.len() {
        return Err(IterSolverError::DimensionError(format!(
            "The length of `diagonals` {} and `offsets` {} do not match",
            diagonals.len(),
            offsets.len()
        )));
    }
    if diagonals.is_empty() {
        return Ok(empty_spcsc());
    }

    // Check for duplicate offsets
    let n = diagonals[0].len() + offsets[0].unsigned_abs();
    let mut unique_offsets = std::collections::HashSet::new();
    for (index, (diag, offset)) in diagonals.iter().zip(offsets.iter()).enumerate() {
        if !unique_offsets.insert(*offset) {
            return Err(IterSolverError::InvalidInput(
                "Duplicate offsets are not allowed".to_string(),
            ));
        }
        if diag.len() + offset.unsigned_abs() != n {
            return Err(IterSolverError::DimensionError(format!(
                "The {}th diagonal's length {} and its offset {} do not match",
                index,
                diag.len(),
                offset
            )));
        }
    }

    let mut res = diagm_csc(&diagonals[0], offsets[0]);

    for (diag, offset) in diagonals.iter().zip(offsets.iter()) {
        res = &res + &diagm_csc(diag, *offset);
    }
    Ok(res)
}

#[cfg(test)]
mod tests {
    use super::super::dense::diagm;
    use super::*;
    #[cfg(feature = "nalgebra")]
    use nalgebra::DMatrix;

    #[test]
    #[cfg(feature = "nalgebra")]
    fn test_diagm_csr_main_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, 0);

        // 转换为稠密矩阵进行验证
        let dense = DMatrix::from(&mat);
        let expected = diagm(&data, 0);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(feature = "nalgebra")]
    fn test_diagm_csr_upper_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, 1);

        // 转换为稠密矩阵进行验证
        let dense = DMatrix::from(&mat);
        let expected = diagm(&data, 1);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(feature = "nalgebra")]
    fn test_diagm_csr_lower_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, -1);

        // 转换为稠密矩阵进行验证
        let dense = DMatrix::from(&mat);
        let expected = diagm(&data, -1);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(feature = "nalgebra")]
    fn test_diagm_csr_empty() {
        let data: Vec<f64> = vec![];
        let mat = diagm_csr(&data, 0);

        assert_eq!(mat.nrows(), 0);
        assert_eq!(mat.ncols(), 0);
    }

    #[test]
    #[cfg(feature = "nalgebra")]
    fn test_diagm_csr_large_offset() {
        let data = vec![1.0, 2.0];
        let mat = diagm_csr(&data, 10);

        // 转换为稠密矩阵进行验证
        let dense = DMatrix::from(&mat);
        let expected = diagm(&data, 10);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(any(feature = "faer", feature = "ndarray"))]
    fn test_diagm_csr_main_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, 0);

        // 转换为稠密矩阵进行验证
        let dense = mat.to_dense();
        let expected = diagm(&data, 0);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(any(feature = "faer", feature = "ndarray"))]
    fn test_diagm_csr_upper_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, 1);

        // 转换为稠密矩阵进行验证
        let dense = mat.to_dense();
        let expected = diagm(&data, 1);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(any(feature = "faer", feature = "ndarray"))]
    fn test_diagm_csr_lower_diagonal() {
        let data = vec![1.0, 2.0, 3.0];
        let mat = diagm_csr(&data, -1);

        // 转换为稠密矩阵进行验证
        let dense = mat.to_dense();
        let expected = diagm(&data, -1);

        assert_eq!(dense, expected);
    }

    #[test]
    #[cfg(any(feature = "faer", feature = "ndarray"))]
    fn test_diagm_csr_empty() {
        use crate::MatrixOp;

        let data: Vec<f64> = vec![];
        let mat = diagm_csr(&data, 0);

        assert_eq!(mat.nrows(), 0);
        assert_eq!(mat.ncols(), 0);
    }

    #[test]
    #[cfg(any(feature = "faer", feature = "ndarray"))]
    fn test_diagm_csr_large_offset() {
        let data = vec![1.0, 2.0];
        let mat = diagm_csr(&data, 10);

        // 转换为稠密矩阵进行验证
        let dense = mat.to_dense();
        let expected = diagm(&data, 10);

        assert_eq!(dense, expected);
    }
}