SCM

SCM Repository

[matrix] Diff of /pkg/Matrix/src/Csparse.c
ViewVC logotype

Diff of /pkg/Matrix/src/Csparse.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 2279, Fri Oct 3 09:15:54 2008 UTC revision 2319, Sun Jan 18 20:04:54 2009 UTC
# Line 32  Line 32 
32      return TRUE;      return TRUE;
33  }  }
34    
35  SEXP Csparse_validate(SEXP x)  SEXP Csparse_validate(SEXP x) {
36        return Csparse_validate_(x, FALSE);
37    }
38    
39    SEXP Csparse_validate2(SEXP x, SEXP maybe_modify) {
40        return Csparse_validate_(x, asLogical(maybe_modify));
41    }
42    
43    SEXP Csparse_validate_(SEXP x, Rboolean maybe_modify)
44  {  {
45      /* NB: we do *NOT* check a potential 'x' slot here, at all */      /* NB: we do *NOT* check a potential 'x' slot here, at all */
46      SEXP pslot = GET_SLOT(x, Matrix_pSym),      SEXP pslot = GET_SLOT(x, Matrix_pSym),
# Line 69  Line 77 
77              }              }
78      }      }
79      if (!sorted) {      if (!sorted) {
80            if(maybe_modify) {
81          CHM_SP chx = (CHM_SP) alloca(sizeof(cholmod_sparse));          CHM_SP chx = (CHM_SP) alloca(sizeof(cholmod_sparse));
82          R_CheckStack();          R_CheckStack();
83          as_cholmod_sparse(chx, x, FALSE, TRUE); /* includes cholmod_sort() ! */              as_cholmod_sparse(chx, x, FALSE, TRUE);/*-> cholmod_l_sort() ! */
84          /* as chx = AS_CHM_SP__(x)  but  ^^^^  sorting x in_place (no copying)*/              /* as chx = AS_CHM_SP__(x)  but  ^^^^ sorting x in_place !!! */
85    
86          /* Now re-check that row indices are *strictly* increasing          /* Now re-check that row indices are *strictly* increasing
87           * (and not just increasing) within each column : */           * (and not just increasing) within each column : */
88          for (j = 0; j < ncol; j++) {          for (j = 0; j < ncol; j++) {
89              for (k = xp[j] + 1; k < xp[j + 1]; k++)              for (k = xp[j] + 1; k < xp[j + 1]; k++)
90                  if (xi[k] == xi[k - 1])                  if (xi[k] == xi[k - 1])
91                      return mkString(_("slot i is not *strictly* increasing inside a column (even after cholmod_sort)"));                          return mkString(_("slot i is not *strictly* increasing inside a column (even after cholmod_l_sort)"));
92                }
93            } else { /* no modifying sorting : */
94                return mkString(_("row indices are not sorted within columns"));
95          }          }
   
96      } else if(!strictly) {  /* sorted, but not strictly */      } else if(!strictly) {  /* sorted, but not strictly */
97          return mkString(_("slot i is not *strictly* increasing inside a column"));          return mkString(_("slot i is not *strictly* increasing inside a column"));
98      }      }
# Line 125  Line 136 
136              }              }
137      }      }
138      if (!sorted)      if (!sorted)
139          /* cannot easily use cholmod_sort(.) ... -> "error out" :*/          /* cannot easily use cholmod_l_sort(.) ... -> "error out" :*/
140          return mkString(_("slot j is not increasing inside a column"));          return mkString(_("slot j is not increasing inside a column"));
141      else if(!strictly) /* sorted, but not strictly */      else if(!strictly) /* sorted, but not strictly */
142          return mkString(_("slot j is not *strictly* increasing inside a column"));          return mkString(_("slot j is not *strictly* increasing inside a column"));
# Line 143  Line 154 
154      /* This loses the symmetry property, since cholmod_dense has none,      /* This loses the symmetry property, since cholmod_dense has none,
155       * BUT, much worse (FIXME!), it also transforms CHOLMOD_PATTERN ("n") matrices       * BUT, much worse (FIXME!), it also transforms CHOLMOD_PATTERN ("n") matrices
156       * to numeric (CHOLMOD_REAL) ones : */       * to numeric (CHOLMOD_REAL) ones : */
157      CHM_DN chxd = cholmod_sparse_to_dense(chxs, &c);      CHM_DN chxd = cholmod_l_sparse_to_dense(chxs, &c);
158      int Rkind = (chxs->xtype == CHOLMOD_PATTERN)? -1 : Real_kind(x);      int Rkind = (chxs->xtype == CHOLMOD_PATTERN)? -1 : Real_kind(x);
159      R_CheckStack();      R_CheckStack();
160    
# Line 153  Line 164 
164  SEXP Csparse_to_nz_pattern(SEXP x, SEXP tri)  SEXP Csparse_to_nz_pattern(SEXP x, SEXP tri)
165  {  {
166      CHM_SP chxs = AS_CHM_SP__(x);      CHM_SP chxs = AS_CHM_SP__(x);
167      CHM_SP chxcp = cholmod_copy(chxs, chxs->stype, CHOLMOD_PATTERN, &c);      CHM_SP chxcp = cholmod_l_copy(chxs, chxs->stype, CHOLMOD_PATTERN, &c);
168      int tr = asLogical(tri);      int tr = asLogical(tri);
169      R_CheckStack();      R_CheckStack();
170    
# Line 165  Line 176 
176    
177  SEXP Csparse_to_matrix(SEXP x)  SEXP Csparse_to_matrix(SEXP x)
178  {  {
179      return chm_dense_to_matrix(cholmod_sparse_to_dense(AS_CHM_SP__(x), &c),      return chm_dense_to_matrix(cholmod_l_sparse_to_dense(AS_CHM_SP__(x), &c),
180                                 1 /*do_free*/, GET_SLOT(x, Matrix_DimNamesSym));                                 1 /*do_free*/, GET_SLOT(x, Matrix_DimNamesSym));
181  }  }
182    
183  SEXP Csparse_to_Tsparse(SEXP x, SEXP tri)  SEXP Csparse_to_Tsparse(SEXP x, SEXP tri)
184  {  {
185      CHM_SP chxs = AS_CHM_SP__(x);      CHM_SP chxs = AS_CHM_SP__(x);
186      CHM_TR chxt = cholmod_sparse_to_triplet(chxs, &c);      CHM_TR chxt = cholmod_l_sparse_to_triplet(chxs, &c);
187      int tr = asLogical(tri);      int tr = asLogical(tri);
188      int Rkind = (chxs->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chxs->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
189      R_CheckStack();      R_CheckStack();
# Line 192  Line 203 
203    
204      if (!(chx->stype))      if (!(chx->stype))
205          error(_("Nonsymmetric matrix in Csparse_symmetric_to_general"));          error(_("Nonsymmetric matrix in Csparse_symmetric_to_general"));
206      chgx = cholmod_copy(chx, /* stype: */ 0, chx->xtype, &c);      chgx = cholmod_l_copy(chx, /* stype: */ 0, chx->xtype, &c);
207      /* xtype: pattern, "real", complex or .. */      /* xtype: pattern, "real", complex or .. */
208      return chm_sparse_to_SEXP(chgx, 1, 0, Rkind, "",      return chm_sparse_to_SEXP(chgx, 1, 0, Rkind, "",
209                                GET_SLOT(x, Matrix_DimNamesSym));                                GET_SLOT(x, Matrix_DimNamesSym));
# Line 205  Line 216 
216      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
217      R_CheckStack();      R_CheckStack();
218    
219      chgx = cholmod_copy(chx, /* stype: */ uploT, chx->xtype, &c);      chgx = cholmod_l_copy(chx, /* stype: */ uploT, chx->xtype, &c);
220      /* xtype: pattern, "real", complex or .. */      /* xtype: pattern, "real", complex or .. */
221      return chm_sparse_to_SEXP(chgx, 1, 0, Rkind, "",      return chm_sparse_to_SEXP(chgx, 1, 0, Rkind, "",
222                                GET_SLOT(x, Matrix_DimNamesSym));                                GET_SLOT(x, Matrix_DimNamesSym));
# Line 217  Line 228 
228       *       since cholmod (& cs) lacks sparse 'int' matrices */       *       since cholmod (& cs) lacks sparse 'int' matrices */
229      CHM_SP chx = AS_CHM_SP__(x);      CHM_SP chx = AS_CHM_SP__(x);
230      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
231      CHM_SP chxt = cholmod_transpose(chx, chx->xtype, &c);      CHM_SP chxt = cholmod_l_transpose(chx, chx->xtype, &c);
232      SEXP dn = PROTECT(duplicate(GET_SLOT(x, Matrix_DimNamesSym))), tmp;      SEXP dn = PROTECT(duplicate(GET_SLOT(x, Matrix_DimNamesSym))), tmp;
233      int tr = asLogical(tri);      int tr = asLogical(tri);
234      R_CheckStack();      R_CheckStack();
# Line 236  Line 247 
247      CHM_SP      CHM_SP
248          cha = AS_CHM_SP(a),          cha = AS_CHM_SP(a),
249          chb = AS_CHM_SP(b),          chb = AS_CHM_SP(b),
250          chc = cholmod_ssmult(cha, chb, /*out_stype:*/ 0,          chc = cholmod_l_ssmult(cha, chb, /*out_stype:*/ 0,
251                               cha->xtype, /*out sorted:*/ 1, &c);                               cha->xtype, /*out sorted:*/ 1, &c);
252      const char *cl_a = class_P(a), *cl_b = class_P(b);      const char *cl_a = class_P(a), *cl_b = class_P(b);
253      char diag[] = {'\0', '\0'};      char diag[] = {'\0', '\0'};
# Line 281  Line 292 
292      SEXP dn = allocVector(VECSXP, 2);      SEXP dn = allocVector(VECSXP, 2);
293      R_CheckStack();      R_CheckStack();
294    
295      chTr = cholmod_transpose((tr) ? chb : cha, chb->xtype, &c);      chTr = cholmod_l_transpose((tr) ? chb : cha, chb->xtype, &c);
296      chc = cholmod_ssmult((tr) ? cha : chTr, (tr) ? chTr : chb,      chc = cholmod_l_ssmult((tr) ? cha : chTr, (tr) ? chTr : chb,
297                           /*out_stype:*/ 0, cha->xtype, /*out sorted:*/ 1, &c);                           /*out_stype:*/ 0, cha->xtype, /*out sorted:*/ 1, &c);
298      cholmod_free_sparse(&chTr, &c);      cholmod_l_free_sparse(&chTr, &c);
299    
300      /* Preserve triangularity and unit-triangularity if appropriate;      /* Preserve triangularity and unit-triangularity if appropriate;
301       * see Csparse_Csparse_prod() for comments */       * see Csparse_Csparse_prod() for comments */
# Line 310  Line 321 
321      CHM_SP cha = AS_CHM_SP(a);      CHM_SP cha = AS_CHM_SP(a);
322      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));
323      CHM_DN chb = AS_CHM_DN(b_M);      CHM_DN chb = AS_CHM_DN(b_M);
324      CHM_DN chc = cholmod_allocate_dense(cha->nrow, chb->ncol, cha->nrow,      CHM_DN chc = cholmod_l_allocate_dense(cha->nrow, chb->ncol, cha->nrow,
325                                          chb->xtype, &c);                                          chb->xtype, &c);
326      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
327      double one[] = {1,0}, zero[] = {0,0};      double one[] = {1,0}, zero[] = {0,0};
328      R_CheckStack();      R_CheckStack();
329    
330      cholmod_sdmult(cha, 0, one, zero, chb, chc, &c);      cholmod_l_sdmult(cha, 0, one, zero, chb, chc, &c);
331      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
332                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 0)));                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 0)));
333      SET_VECTOR_ELT(dn, 1,      SET_VECTOR_ELT(dn, 1,
# Line 330  Line 341 
341      CHM_SP cha = AS_CHM_SP(a);      CHM_SP cha = AS_CHM_SP(a);
342      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));
343      CHM_DN chb = AS_CHM_DN(b_M);      CHM_DN chb = AS_CHM_DN(b_M);
344      CHM_DN chc = cholmod_allocate_dense(cha->ncol, chb->ncol, cha->ncol,      CHM_DN chc = cholmod_l_allocate_dense(cha->ncol, chb->ncol, cha->ncol,
345                                          chb->xtype, &c);                                          chb->xtype, &c);
346      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
347      double one[] = {1,0}, zero[] = {0,0};      double one[] = {1,0}, zero[] = {0,0};
348      R_CheckStack();      R_CheckStack();
349    
350      cholmod_sdmult(cha, 1, one, zero, chb, chc, &c);      cholmod_l_sdmult(cha, 1, one, zero, chb, chc, &c);
351      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
352                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 1)));                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 1)));
353      SET_VECTOR_ELT(dn, 1,      SET_VECTOR_ELT(dn, 1,
# Line 354  Line 365 
365      CHM_TR cht = trip ? AS_CHM_TR(x) : (CHM_TR) NULL;      CHM_TR cht = trip ? AS_CHM_TR(x) : (CHM_TR) NULL;
366      CHM_SP chcp, chxt,      CHM_SP chcp, chxt,
367          chx = (trip ?          chx = (trip ?
368                 cholmod_triplet_to_sparse(cht, cht->nnz, &c) :                 cholmod_l_triplet_to_sparse(cht, cht->nnz, &c) :
369                 AS_CHM_SP(x));                 AS_CHM_SP(x));
370      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
371      R_CheckStack();      R_CheckStack();
372    
373      if (!tr) chxt = cholmod_transpose(chx, chx->xtype, &c);      if (!tr) chxt = cholmod_l_transpose(chx, chx->xtype, &c);
374      chcp = cholmod_aat((!tr) ? chxt : chx, (int *) NULL, 0, chx->xtype, &c);      chcp = cholmod_l_aat((!tr) ? chxt : chx, (int *) NULL, 0, chx->xtype, &c);
375      if(!chcp) {      if(!chcp) {
376          UNPROTECT(1);          UNPROTECT(1);
377          error(_("Csparse_crossprod(): error return from cholmod_aat()"));          error(_("Csparse_crossprod(): error return from cholmod_l_aat()"));
378      }      }
379      cholmod_band_inplace(0, chcp->ncol, chcp->xtype, chcp, &c);      cholmod_l_band_inplace(0, chcp->ncol, chcp->xtype, chcp, &c);
380      chcp->stype = 1;      chcp->stype = 1;
381      if (trip) cholmod_free_sparse(&chx, &c);      if (trip) cholmod_l_free_sparse(&chx, &c);
382      if (!tr) cholmod_free_sparse(&chxt, &c);      if (!tr) cholmod_l_free_sparse(&chxt, &c);
383      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
384                     duplicate(VECTOR_ELT(GET_SLOT(x, Matrix_DimNamesSym),                     duplicate(VECTOR_ELT(GET_SLOT(x, Matrix_DimNamesSym),
385                                          (tr) ? 0 : 1)));                                          (tr) ? 0 : 1)));
# Line 383  Line 394 
394      /* dtCMatrix, etc; [1] = the second character =?= 't' for triangular */      /* dtCMatrix, etc; [1] = the second character =?= 't' for triangular */
395      int tr = (cl[1] == 't');      int tr = (cl[1] == 't');
396      CHM_SP chx = AS_CHM_SP__(x);      CHM_SP chx = AS_CHM_SP__(x);
397      CHM_SP ans = cholmod_copy(chx, chx->stype, chx->xtype, &c);      CHM_SP ans = cholmod_l_copy(chx, chx->stype, chx->xtype, &c);
398      double dtol = asReal(tol);      double dtol = asReal(tol);
399      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
400      R_CheckStack();      R_CheckStack();
401    
402      if(!cholmod_drop(dtol, ans, &c))      if(!cholmod_l_drop(dtol, ans, &c))
403          error(_("cholmod_drop() failed"));          error(_("cholmod_l_drop() failed"));
404      return chm_sparse_to_SEXP(ans, 1,      return chm_sparse_to_SEXP(ans, 1,
405                                tr ? ((*uplo_P(x) == 'U') ? 1 : -1) : 0,                                tr ? ((*uplo_P(x) == 'U') ? 1 : -1) : 0,
406                                Rkind, tr ? diag_P(x) : "",                                Rkind, tr ? diag_P(x) : "",
# Line 403  Line 414 
414      R_CheckStack();      R_CheckStack();
415    
416      /* FIXME: currently drops dimnames */      /* FIXME: currently drops dimnames */
417      return chm_sparse_to_SEXP(cholmod_horzcat(chx, chy, 1, &c),      return chm_sparse_to_SEXP(cholmod_l_horzcat(chx, chy, 1, &c),
418                                1, 0, Rkind, "", R_NilValue);                                1, 0, Rkind, "", R_NilValue);
419  }  }
420    
# Line 414  Line 425 
425      R_CheckStack();      R_CheckStack();
426    
427      /* FIXME: currently drops dimnames */      /* FIXME: currently drops dimnames */
428      return chm_sparse_to_SEXP(cholmod_vertcat(chx, chy, 1, &c),      return chm_sparse_to_SEXP(cholmod_l_vertcat(chx, chy, 1, &c),
429                                1, 0, Rkind, "", R_NilValue);                                1, 0, Rkind, "", R_NilValue);
430  }  }
431    
# Line 422  Line 433 
433  {  {
434      CHM_SP chx = AS_CHM_SP__(x);      CHM_SP chx = AS_CHM_SP__(x);
435      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
436      CHM_SP ans = cholmod_band(chx, asInteger(k1), asInteger(k2), chx->xtype, &c);      CHM_SP ans = cholmod_l_band(chx, asInteger(k1), asInteger(k2), chx->xtype, &c);
437      R_CheckStack();      R_CheckStack();
438    
439      return chm_sparse_to_SEXP(ans, 1, 0, Rkind, "",      return chm_sparse_to_SEXP(ans, 1, 0, Rkind, "",
# Line 440  Line 451 
451      }      }
452      else { /* unit triangular (diag='U'): "fill the diagonal" & diag:= "N" */      else { /* unit triangular (diag='U'): "fill the diagonal" & diag:= "N" */
453          CHM_SP chx = AS_CHM_SP__(x);          CHM_SP chx = AS_CHM_SP__(x);
454          CHM_SP eye = cholmod_speye(chx->nrow, chx->ncol, chx->xtype, &c);          CHM_SP eye = cholmod_l_speye(chx->nrow, chx->ncol, chx->xtype, &c);
455          double one[] = {1, 0};          double one[] = {1, 0};
456          CHM_SP ans = cholmod_add(chx, eye, one, one, TRUE, TRUE, &c);          CHM_SP ans = cholmod_l_add(chx, eye, one, one, TRUE, TRUE, &c);
457          int uploT = (*uplo_P(x) == 'U') ? 1 : -1;          int uploT = (*uplo_P(x) == 'U') ? 1 : -1;
458          int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;          int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
459    
460          R_CheckStack();          R_CheckStack();
461          cholmod_free_sparse(&eye, &c);          cholmod_l_free_sparse(&eye, &c);
462          return chm_sparse_to_SEXP(ans, 1, uploT, Rkind, "N",          return chm_sparse_to_SEXP(ans, 1, uploT, Rkind, "N",
463                                    GET_SLOT(x, Matrix_DimNamesSym));                                    GET_SLOT(x, Matrix_DimNamesSym));
464      }      }
# Line 490  Line 501 
501      if (csize >= 0 && !isInteger(j))      if (csize >= 0 && !isInteger(j))
502          error(_("Index j must be NULL or integer"));          error(_("Index j must be NULL or integer"));
503    
504      return chm_sparse_to_SEXP(cholmod_submatrix(chx, INTEGER(i), rsize,      return chm_sparse_to_SEXP(cholmod_l_submatrix(chx, INTEGER(i), rsize,
505                                                  INTEGER(j), csize,                                                  INTEGER(j), csize,
506                                                  TRUE, TRUE, &c),                                                  TRUE, TRUE, &c),
507                                1, 0, Rkind, "",                                1, 0, Rkind, "",
# Line 504  Line 515 
515      if (!f)      if (!f)
516          error(_("failure to open file \"%s\" for writing"),          error(_("failure to open file \"%s\" for writing"),
517                CHAR(asChar(fname)));                CHAR(asChar(fname)));
518      if (!cholmod_write_sparse(f, AS_CHM_SP(x),      if (!cholmod_l_write_sparse(f, AS_CHM_SP(x),
519                                (CHM_SP)NULL, (char*) NULL, &c))                                (CHM_SP)NULL, (char*) NULL, &c))
520          error(_("cholmod_write_sparse returned error code"));          error(_("cholmod_l_write_sparse returned error code"));
521      fclose(f);      fclose(f);
522      return R_NilValue;      return R_NilValue;
523  }  }
# Line 618  Line 629 
629    
630      return diag_tC_ptr(n, x_p, x_x, perm, resultKind);      return diag_tC_ptr(n, x_p, x_x, perm, resultKind);
631  }  }
632    
633    /**
634     * Create a Csparse matrix object from indices and/or pointers.
635     *
636     * @param cls name of actual class of object to create
637     * @param i optional integer vector of length nnz of row indices
638     * @param j optional integer vector of length nnz of column indices
639     * @param p optional integer vector of length np of row or column pointers
640     * @param np length of integer vector p.  Must be zero if p == (int*)NULL
641     * @param x optional vector of values
642     * @param nnz length of vectors i, j and/or x, whichever is to be used
643     * @param dims optional integer vector of length 2 to be used as
644     *     dimensions.  If dims == (int*)NULL then the maximum row and column
645     *     index are used as the dimensions.
646     * @param dimnames optional list of length 2 to be used as dimnames
647     * @param index1 indicator of 1-based indices
648     *
649     * @return an SEXP of class cls inheriting from CsparseMatrix.
650     */
651    SEXP create_Csparse(char* cls, int* i, int* j, int* p, int np,
652                        void* x, int nnz, int* dims, SEXP dimnames,
653                        int index1)
654    {
655        SEXP ans;
656        int *ij = (int*)NULL, *tri, *trj,
657            mi, mj, mp, nrow = -1, ncol = -1;
658        int xtype = -1;             /* -Wall */
659        CHM_TR T;
660        CHM_SP A;
661    
662        if (np < 0 || nnz < 0)
663            error(_("negative vector lengths not allowed: np = %d, nnz = %d"),
664                  np, nnz);
665        if (1 != ((mi = (i == (int*)NULL)) +
666                  (mj = (j == (int*)NULL)) +
667                  (mp = (p == (int*)NULL))))
668            error(_("exactly 1 of 'i', 'j' or 'p' must be NULL"));
669        if (mp) {
670            if (np) error(_("np = %d, must be zero when p is NULL"), np);
671        } else {
672            if (np) {               /* Expand p to form i or j */
673                if (!(p[0])) error(_("p[0] = %d, should be zero"), p[0]);
674                for (int ii = 0; ii < np; ii++)
675                    if (p[ii] > p[ii + 1])
676                        error(_("p must be non-decreasing"));
677                if (p[np] != nnz)
678                    error(_("p[np] = %d != nnz = %d"), p[np], nnz);
679                ij = Calloc(nnz, int);
680                if (mi) {
681                    i = ij;
682                    nrow = np;
683                } else {
684                    j = ij;
685                    ncol = np;
686                }
687                                    /* Expand p to 0-based indices */
688                for (int ii = 0; ii < np; ii++)
689                    for (int jj = p[ii]; jj < p[ii + 1]; jj++) ij[jj] = ii;
690            } else {
691                if (nnz)
692                    error(_("Inconsistent dimensions: np = 0 and nnz = %d"),
693                          nnz);
694            }
695        }
696                                    /* calculate nrow and ncol */
697        if (nrow < 0) {
698            for (int ii = 0; ii < nnz; ii++) {
699                int i1 = i[ii] + (index1 ? 0 : 1); /* 1-based index */
700                if (i1 < 1) error(_("invalid row index at position %d"), ii);
701                if (i1 > nrow) nrow = i1;
702            }
703        }
704        if (ncol < 0) {
705            for (int jj = 0; jj < nnz; jj++) {
706                int j1 = j[jj] + (index1 ? 0 : 1);
707                if (j1 < 1) error(_("invalid column index at position %d"), jj);
708                if (j1 > ncol) ncol = j1;
709            }
710        }
711        if (dims != (int*)NULL) {
712            if (dims[0] > nrow) nrow = dims[0];
713            if (dims[1] > ncol) ncol = dims[1];
714        }
715                                    /* check the class name */
716        if (strlen(cls) != 8)
717            error(_("strlen of cls argument = %d, should be 8"), strlen(cls));
718        if (!strcmp(cls + 2, "CMatrix"))
719            error(_("cls = \"%s\" does not end in \"CMatrix\""), cls);
720        switch(cls[0]) {
721        case 'd':
722        case 'l':
723               xtype = CHOLMOD_REAL;
724               break;
725        case 'n':
726               xtype = CHOLMOD_PATTERN;
727               break;
728        default:
729               error(_("cls = \"%s\" must begin with 'd', 'l' or 'n'"), cls);
730        }
731        if (cls[1] != 'g')
732            error(_("Only 'g'eneral sparse matrix types allowed"));
733                                    /* allocate and populate the triplet */
734        T = cholmod_l_allocate_triplet((size_t)nrow, (size_t)ncol, (size_t)nnz, 0,
735                                        xtype, &c);
736        T->x = x;
737        tri = (int*)T->i;
738        trj = (int*)T->j;
739        for (int ii = 0; ii < nnz; ii++) {
740            tri[ii] = i[ii] - ((!mi && index1) ? 1 : 0);
741            trj[ii] = j[ii] - ((!mj && index1) ? 1 : 0);
742        }
743                                    /* create the cholmod_sparse structure */
744        A = cholmod_l_triplet_to_sparse(T, nnz, &c);
745        cholmod_l_free_triplet(&T, &c);
746                                    /* copy the information to the SEXP */
747        ans = PROTECT(NEW_OBJECT(MAKE_CLASS(cls)));
748    /* FIXME: This has been copied from chm_sparse_to_SEXP in chm_common.c */
749                                    /* allocate and copy common slots */
750        nnz = cholmod_l_nnz(A, &c);
751        dims = INTEGER(ALLOC_SLOT(ans, Matrix_DimSym, INTSXP, 2));
752        dims[0] = A->nrow; dims[1] = A->ncol;
753        Memcpy(INTEGER(ALLOC_SLOT(ans, Matrix_pSym, INTSXP, A->ncol + 1)), (int*)A->p, A->ncol + 1);
754        Memcpy(INTEGER(ALLOC_SLOT(ans, Matrix_iSym, INTSXP, nnz)), (int*)A->i, nnz);
755        switch(cls[1]) {
756        case 'd':
757            Memcpy(REAL(ALLOC_SLOT(ans, Matrix_xSym, REALSXP, nnz)), (double*)A->x, nnz);
758            break;
759        case 'l':
760            error(_("code not yet written for cls = \"lgCMatrix\""));
761        }
762        cholmod_l_free_sparse(&A, &c);
763        UNPROTECT(1);
764        return ans;
765    }

Legend:
Removed from v.2279  
changed lines
  Added in v.2319

root@r-forge.r-project.org
ViewVC Help
Powered by ViewVC 1.0.0  
Thanks to:
Vienna University of Economics and Business University of Wisconsin - Madison Powered By FusionForge