|
5903
|
1 #include "mex.h" |
|
|
2 |
|
|
3 void |
|
|
4 mexFunction (int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) |
|
|
5 { |
|
|
6 int n, m, nz; |
|
|
7 mxArray *v; |
|
|
8 int i; |
|
|
9 double *pr, *pi; |
|
|
10 double *pr2, *pi2; |
|
|
11 int *ir, *jc; |
|
|
12 int *ir2, *jc2; |
|
|
13 |
|
|
14 if (nrhs != 1 || ! mxIsSparse (prhs[0])) |
|
|
15 mexErrMsgTxt ("expects sparse matrix"); |
|
|
16 |
|
|
17 m = mxGetM (prhs [0]); |
|
|
18 n = mxGetN (prhs [0]); |
|
|
19 nz = mxGetNzmax (prhs [0]); |
|
|
20 |
|
|
21 if (mxIsComplex (prhs[0])) |
|
|
22 { |
|
6580
|
23 mexPrintf ("Matrix is %d-by-%d complex sparse matrix", m, n); |
|
|
24 mexPrintf (" with %d elements\n", nz); |
|
5903
|
25 |
|
|
26 pr = mxGetPr (prhs[0]); |
|
|
27 pi = mxGetPi (prhs[0]); |
|
|
28 ir = mxGetIr (prhs[0]); |
|
|
29 jc = mxGetJc (prhs[0]); |
|
|
30 |
|
|
31 i = n; |
|
|
32 while (jc[i] == jc[i-1] && i != 0) i--; |
|
6580
|
33 mexPrintf ("last non-zero element (%d, %d) = (%g, %g)\n", |
|
|
34 ir[nz-1]+ 1, i, pr[nz-1], pi[nz-1]); |
|
5903
|
35 |
|
|
36 v = mxCreateSparse (m, n, nz, mxCOMPLEX); |
|
|
37 pr2 = mxGetPr (v); |
|
|
38 pi2 = mxGetPi (v); |
|
|
39 ir2 = mxGetIr (v); |
|
|
40 jc2 = mxGetJc (v); |
|
|
41 |
|
|
42 for (i = 0; i < nz; i++) |
|
6580
|
43 { |
|
|
44 pr2[i] = 2 * pr[i]; |
|
|
45 pi2[i] = 2 * pi[i]; |
|
|
46 ir2[i] = ir[i]; |
|
|
47 } |
|
5903
|
48 for (i = 0; i < n + 1; i++) |
|
6580
|
49 jc2[i] = jc[i]; |
|
5903
|
50 |
|
|
51 if (nlhs > 0) |
|
6580
|
52 plhs[0] = v; |
|
5903
|
53 } |
|
|
54 else if (mxIsLogical (prhs[0])) |
|
|
55 { |
|
|
56 bool *pbr, *pbr2; |
|
6580
|
57 mexPrintf ("Matrix is %d-by-%d logical sparse matrix", m, n); |
|
|
58 mexPrintf (" with %d elements\n", nz); |
|
5903
|
59 |
|
|
60 pbr = mxGetLogicals (prhs[0]); |
|
|
61 ir = mxGetIr (prhs[0]); |
|
|
62 jc = mxGetJc (prhs[0]); |
|
|
63 |
|
|
64 i = n; |
|
|
65 while (jc[i] == jc[i-1] && i != 0) i--; |
|
|
66 mexPrintf ("last non-zero element (%d, %d) = %d\n", ir[nz-1]+ 1, |
|
6580
|
67 i, pbr[nz-1]); |
|
5903
|
68 |
|
|
69 v = mxCreateSparseLogicalMatrix (m, n, nz); |
|
|
70 pbr2 = mxGetLogicals (v); |
|
|
71 ir2 = mxGetIr (v); |
|
|
72 jc2 = mxGetJc (v); |
|
|
73 |
|
|
74 for (i = 0; i < nz; i++) |
|
6580
|
75 { |
|
|
76 pbr2[i] = pbr[i]; |
|
|
77 ir2[i] = ir[i]; |
|
|
78 } |
|
5903
|
79 for (i = 0; i < n + 1; i++) |
|
6580
|
80 jc2[i] = jc[i]; |
|
5903
|
81 |
|
|
82 if (nlhs > 0) |
|
6580
|
83 plhs[0] = v; |
|
5903
|
84 } |
|
|
85 else |
|
|
86 { |
|
6580
|
87 mexPrintf ("Matrix is %d-by-%d real sparse matrix", m, n); |
|
|
88 mexPrintf (" with %d elements\n", nz); |
|
5903
|
89 |
|
|
90 pr = mxGetPr (prhs[0]); |
|
|
91 ir = mxGetIr (prhs[0]); |
|
|
92 jc = mxGetJc (prhs[0]); |
|
|
93 |
|
|
94 i = n; |
|
|
95 while (jc[i] == jc[i-1] && i != 0) i--; |
|
|
96 mexPrintf ("last non-zero element (%d, %d) = %g\n", ir[nz-1]+ 1, |
|
6580
|
97 i, pr[nz-1]); |
|
5903
|
98 |
|
|
99 v = mxCreateSparse (m, n, nz, mxREAL); |
|
|
100 pr2 = mxGetPr (v); |
|
|
101 ir2 = mxGetIr (v); |
|
|
102 jc2 = mxGetJc (v); |
|
|
103 |
|
|
104 for (i = 0; i < nz; i++) |
|
6580
|
105 { |
|
|
106 pr2[i] = 2 * pr[i]; |
|
|
107 ir2[i] = ir[i]; |
|
|
108 } |
|
5903
|
109 for (i = 0; i < n + 1; i++) |
|
6580
|
110 jc2[i] = jc[i]; |
|
5903
|
111 |
|
|
112 if (nlhs > 0) |
|
6580
|
113 plhs[0] = v; |
|
5903
|
114 } |
|
|
115 } |
