File: cs_droptol_mex.c

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (48 lines) | stat: -rw-r--r-- 1,784 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// CXSparse/MATLAB/CSparse/cs_droptol_mex: drop small entries
// CXSparse, Copyright (c) 2006-2022, Timothy A. Davis. All Rights Reserved.
// SPDX-License-Identifier: LGPL-2.1+
#include "cs_mex.h"
/* cs_droptol: remove small entries from A */
void mexFunction
(
    int nargout,
    mxArray *pargout [ ],
    int nargin,
    const mxArray *pargin [ ]
)
{
    int64_t j, k ;
    double tol ;
    if (nargout > 1 || nargin != 2)
    {
        mexErrMsgTxt ("Usage: C = cs_droptol(A,tol)") ;
    }
    tol = mxGetScalar (pargin [1]) ;                        /* get tol */

    if (mxIsComplex (pargin [0]))
    {
#ifndef NCOMPLEX
        cs_cl Amatrix, *C, *A ;
        A = cs_cl_mex_get_sparse (&Amatrix, 0, pargin [0]) ;    /* get A */
        C = cs_cl_spalloc (A->m, A->n, A->nzmax, 1, 0) ;        /* C = A */
        for (j = 0 ; j <= A->n ; j++) C->p [j] = A->p [j] ;
        for (k = 0 ; k < A->nzmax ; k++) C->i [k] = A->i [k] ;
        for (k = 0 ; k < A->nzmax ; k++) C->x [k] = A->x [k] ;
        cs_cl_droptol (C, tol) ;                            /* drop from C */
        pargout [0] = cs_cl_mex_put_sparse (&C) ;           /* return C */
#else
        mexErrMsgTxt ("complex matrices not supported") ;
#endif
    }
    else
    {
        cs_dl Amatrix, *C, *A ;
        A = cs_dl_mex_get_sparse (&Amatrix, 0, 1, pargin [0]) ;    /* get A */
        C = cs_dl_spalloc (A->m, A->n, A->nzmax, 1, 0) ;        /* C = A */
        for (j = 0 ; j <= A->n ; j++) C->p [j] = A->p [j] ;
        for (k = 0 ; k < A->nzmax ; k++) C->i [k] = A->i [k] ;
        for (k = 0 ; k < A->nzmax ; k++) C->x [k] = A->x [k] ;
        cs_dl_droptol (C, tol) ;                            /* drop from C */
        pargout [0] = cs_dl_mex_put_sparse (&C) ;                   /* return C */
    }
}