5 int m, n, nz, p, k, *
Cp, *Ci, *w, *Ti, *Tj ;
9 m = T->
m ; n = T->
n ; Ti = T->
i ; Tj = T->
p ; Tx = T->
x ; nz = T->
nz ;
12 if (!C || !w)
return (
cs_done (C, w, NULL, 0)) ;
13 Cp = C->
p ; Ci = C->
i ; Cx = C->
x ;
14 for (k = 0 ; k < nz ; k++) w [Tj [k]]++ ;
16 for (k = 0 ; k < nz ; k++)
18 Ci [p = w [Tj [k]]++] = Ti [k] ;
19 if (Cx) Cx [p] = Tx [k] ;
21 return (
cs_done (C, w, NULL, 1)) ;
USING_NAMESPACE_ACADO typedef TaylorVariable< Interval > T
cs * cs_spalloc(int m, int n, int nzmax, int values, int triplet)
cs * cs_done(cs *C, void *w, void *x, int ok)
void * cs_calloc(int n, size_t size)
double cs_cumsum(int *p, int *c, int n)
cs * cs_compress(const cs *T)