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 2494, Mon Nov 2 11:55:36 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);                                 /* values:= is_numeric (T/F) */ cha->xtype > 0,
252                                   /*out sorted:*/ 1, &c);
253      const char *cl_a = class_P(a), *cl_b = class_P(b);      const char *cl_a = class_P(a), *cl_b = class_P(b);
254      char diag[] = {'\0', '\0'};      char diag[] = {'\0', '\0'};
255      int uploT = 0;      int uploT = 0;
256      SEXP dn = allocVector(VECSXP, 2);      SEXP dn = allocVector(VECSXP, 2);
257      R_CheckStack();      R_CheckStack();
258    
259    #ifdef DEBUG_Matrix_verbose
260        Rprintf("DBG Csparse_C*_prod(%s, %s)\n", cl_a, cl_b);
261    #endif
262    
263      /* Preserve triangularity and even unit-triangularity if appropriate.      /* Preserve triangularity and even unit-triangularity if appropriate.
264       * Note that in that case, the multiplication itself should happen       * Note that in that case, the multiplication itself should happen
265       * faster.  But there's no support for that in CHOLMOD */       * faster.  But there's no support for that in CHOLMOD */
# Line 281  Line 297 
297      SEXP dn = allocVector(VECSXP, 2);      SEXP dn = allocVector(VECSXP, 2);
298      R_CheckStack();      R_CheckStack();
299    
300      chTr = cholmod_transpose((tr) ? chb : cha, chb->xtype, &c);      chTr = cholmod_l_transpose((tr) ? chb : cha, chb->xtype, &c);
301      chc = cholmod_ssmult((tr) ? cha : chTr, (tr) ? chTr : chb,      chc = cholmod_l_ssmult((tr) ? cha : chTr, (tr) ? chTr : chb,
302                           /*out_stype:*/ 0, cha->xtype, /*out sorted:*/ 1, &c);                           /*out_stype:*/ 0, cha->xtype, /*out sorted:*/ 1, &c);
303      cholmod_free_sparse(&chTr, &c);      cholmod_l_free_sparse(&chTr, &c);
304    
305      /* Preserve triangularity and unit-triangularity if appropriate;      /* Preserve triangularity and unit-triangularity if appropriate;
306       * see Csparse_Csparse_prod() for comments */       * see Csparse_Csparse_prod() for comments */
# Line 310  Line 326 
326      CHM_SP cha = AS_CHM_SP(a);      CHM_SP cha = AS_CHM_SP(a);
327      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));
328      CHM_DN chb = AS_CHM_DN(b_M);      CHM_DN chb = AS_CHM_DN(b_M);
329      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,
330                                          chb->xtype, &c);                                          chb->xtype, &c);
331      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
332      double one[] = {1,0}, zero[] = {0,0};      double one[] = {1,0}, zero[] = {0,0};
333      R_CheckStack();      R_CheckStack();
334    
335      cholmod_sdmult(cha, 0, one, zero, chb, chc, &c);      cholmod_l_sdmult(cha, 0, one, zero, chb, chc, &c);
336      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
337                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 0)));                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 0)));
338      SET_VECTOR_ELT(dn, 1,      SET_VECTOR_ELT(dn, 1,
# Line 330  Line 346 
346      CHM_SP cha = AS_CHM_SP(a);      CHM_SP cha = AS_CHM_SP(a);
347      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));      SEXP b_M = PROTECT(mMatrix_as_dgeMatrix(b));
348      CHM_DN chb = AS_CHM_DN(b_M);      CHM_DN chb = AS_CHM_DN(b_M);
349      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,
350                                          chb->xtype, &c);                                          chb->xtype, &c);
351      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
352      double one[] = {1,0}, zero[] = {0,0};      double one[] = {1,0}, zero[] = {0,0};
353      R_CheckStack();      R_CheckStack();
354    
355      cholmod_sdmult(cha, 1, one, zero, chb, chc, &c);      cholmod_l_sdmult(cha, 1, one, zero, chb, chc, &c);
356      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
357                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 1)));                     duplicate(VECTOR_ELT(GET_SLOT(a, Matrix_DimNamesSym), 1)));
358      SET_VECTOR_ELT(dn, 1,      SET_VECTOR_ELT(dn, 1,
# Line 351  Line 367 
367  {  {
368      int trip = asLogical(triplet),      int trip = asLogical(triplet),
369          tr   = asLogical(trans); /* gets reversed because _aat is tcrossprod */          tr   = asLogical(trans); /* gets reversed because _aat is tcrossprod */
370    #ifdef AS_CHM_DIAGU2N_FIXED_FINALLY
371      CHM_TR cht = trip ? AS_CHM_TR(x) : (CHM_TR) NULL;      CHM_TR cht = trip ? AS_CHM_TR(x) : (CHM_TR) NULL;
372    #else /* workaround needed:*/
373        CHM_TR cht = trip ? AS_CHM_TR__(Tsparse_diagU2N(x)) : (CHM_TR) NULL;
374    #endif
375      CHM_SP chcp, chxt,      CHM_SP chcp, chxt,
376          chx = (trip ?          chx = (trip ?
377                 cholmod_triplet_to_sparse(cht, cht->nnz, &c) :                 cholmod_l_triplet_to_sparse(cht, cht->nnz, &c) :
378                 AS_CHM_SP(x));                 AS_CHM_SP(x));
379      SEXP dn = PROTECT(allocVector(VECSXP, 2));      SEXP dn = PROTECT(allocVector(VECSXP, 2));
380      R_CheckStack();      R_CheckStack();
381    
382      if (!tr) chxt = cholmod_transpose(chx, chx->xtype, &c);      if (!tr) chxt = cholmod_l_transpose(chx, chx->xtype, &c);
383      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);
384      if(!chcp) {      if(!chcp) {
385          UNPROTECT(1);          UNPROTECT(1);
386          error(_("Csparse_crossprod(): error return from cholmod_aat()"));          error(_("Csparse_crossprod(): error return from cholmod_l_aat()"));
387      }      }
388      cholmod_band_inplace(0, chcp->ncol, chcp->xtype, chcp, &c);      cholmod_l_band_inplace(0, chcp->ncol, chcp->xtype, chcp, &c);
389      chcp->stype = 1;      chcp->stype = 1;
390      if (trip) cholmod_free_sparse(&chx, &c);      if (trip) cholmod_l_free_sparse(&chx, &c);
391      if (!tr) cholmod_free_sparse(&chxt, &c);      if (!tr) cholmod_l_free_sparse(&chxt, &c);
392      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */      SET_VECTOR_ELT(dn, 0,       /* establish dimnames */
393                     duplicate(VECTOR_ELT(GET_SLOT(x, Matrix_DimNamesSym),                     duplicate(VECTOR_ELT(GET_SLOT(x, Matrix_DimNamesSym),
394                                          (tr) ? 0 : 1)));                                          (tr) ? 0 : 1)));
# Line 383  Line 403 
403      /* dtCMatrix, etc; [1] = the second character =?= 't' for triangular */      /* dtCMatrix, etc; [1] = the second character =?= 't' for triangular */
404      int tr = (cl[1] == 't');      int tr = (cl[1] == 't');
405      CHM_SP chx = AS_CHM_SP__(x);      CHM_SP chx = AS_CHM_SP__(x);
406      CHM_SP ans = cholmod_copy(chx, chx->stype, chx->xtype, &c);      CHM_SP ans = cholmod_l_copy(chx, chx->stype, chx->xtype, &c);
407      double dtol = asReal(tol);      double dtol = asReal(tol);
408      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
409      R_CheckStack();      R_CheckStack();
410    
411      if(!cholmod_drop(dtol, ans, &c))      if(!cholmod_l_drop(dtol, ans, &c))
412          error(_("cholmod_drop() failed"));          error(_("cholmod_l_drop() failed"));
413      return chm_sparse_to_SEXP(ans, 1,      return chm_sparse_to_SEXP(ans, 1,
414                                tr ? ((*uplo_P(x) == 'U') ? 1 : -1) : 0,                                tr ? ((*uplo_P(x) == 'U') ? 1 : -1) : 0,
415                                Rkind, tr ? diag_P(x) : "",                                Rkind, tr ? diag_P(x) : "",
# Line 403  Line 423 
423      R_CheckStack();      R_CheckStack();
424    
425      /* FIXME: currently drops dimnames */      /* FIXME: currently drops dimnames */
426      return chm_sparse_to_SEXP(cholmod_horzcat(chx, chy, 1, &c),      return chm_sparse_to_SEXP(cholmod_l_horzcat(chx, chy, 1, &c),
427                                1, 0, Rkind, "", R_NilValue);                                1, 0, Rkind, "", R_NilValue);
428  }  }
429    
# Line 414  Line 434 
434      R_CheckStack();      R_CheckStack();
435    
436      /* FIXME: currently drops dimnames */      /* FIXME: currently drops dimnames */
437      return chm_sparse_to_SEXP(cholmod_vertcat(chx, chy, 1, &c),      return chm_sparse_to_SEXP(cholmod_l_vertcat(chx, chy, 1, &c),
438                                1, 0, Rkind, "", R_NilValue);                                1, 0, Rkind, "", R_NilValue);
439  }  }
440    
# Line 422  Line 442 
442  {  {
443      CHM_SP chx = AS_CHM_SP__(x);      CHM_SP chx = AS_CHM_SP__(x);
444      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;      int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
445      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);
446      R_CheckStack();      R_CheckStack();
447    
448      return chm_sparse_to_SEXP(ans, 1, 0, Rkind, "",      return chm_sparse_to_SEXP(ans, 1, 0, Rkind, "",
# Line 440  Line 460 
460      }      }
461      else { /* unit triangular (diag='U'): "fill the diagonal" & diag:= "N" */      else { /* unit triangular (diag='U'): "fill the diagonal" & diag:= "N" */
462          CHM_SP chx = AS_CHM_SP__(x);          CHM_SP chx = AS_CHM_SP__(x);
463          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);
464          double one[] = {1, 0};          double one[] = {1, 0};
465          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);
466          int uploT = (*uplo_P(x) == 'U') ? 1 : -1;          int uploT = (*uplo_P(x) == 'U') ? 1 : -1;
467          int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;          int Rkind = (chx->xtype != CHOLMOD_PATTERN) ? Real_kind(x) : 0;
468    
469          R_CheckStack();          R_CheckStack();
470          cholmod_free_sparse(&eye, &c);          cholmod_l_free_sparse(&eye, &c);
471          return chm_sparse_to_SEXP(ans, 1, uploT, Rkind, "N",          return chm_sparse_to_SEXP(ans, 1, uploT, Rkind, "N",
472                                    GET_SLOT(x, Matrix_DimNamesSym));                                    GET_SLOT(x, Matrix_DimNamesSym));
473      }      }
# Line 490  Line 510 
510      if (csize >= 0 && !isInteger(j))      if (csize >= 0 && !isInteger(j))
511          error(_("Index j must be NULL or integer"));          error(_("Index j must be NULL or integer"));
512    
513      return chm_sparse_to_SEXP(cholmod_submatrix(chx, INTEGER(i), rsize,      return chm_sparse_to_SEXP(cholmod_l_submatrix(chx, INTEGER(i), rsize,
514                                                  INTEGER(j), csize,                                                  INTEGER(j), csize,
515                                                  TRUE, TRUE, &c),                                                  TRUE, TRUE, &c),
516                                1, 0, Rkind, "",                                1, 0, Rkind, "",
# Line 504  Line 524 
524      if (!f)      if (!f)
525          error(_("failure to open file \"%s\" for writing"),          error(_("failure to open file \"%s\" for writing"),
526                CHAR(asChar(fname)));                CHAR(asChar(fname)));
527      if (!cholmod_write_sparse(f, AS_CHM_SP(x),      if (!cholmod_l_write_sparse(f, AS_CHM_SP(x),
528                                (CHM_SP)NULL, (char*) NULL, &c))                                (CHM_SP)NULL, (char*) NULL, &c))
529          error(_("cholmod_write_sparse returned error code"));          error(_("cholmod_l_write_sparse returned error code"));
530      fclose(f);      fclose(f);
531      return R_NilValue;      return R_NilValue;
532  }  }
# Line 588  Line 608 
608          break;          break;
609    
610      default: /* -1 from above */      default: /* -1 from above */
611          error("diag_tC(): invalid 'resultKind'");          error(_("diag_tC(): invalid 'resultKind'"));
612          /* Wall: */ ans = R_NilValue; v = REAL(ans);          /* Wall: */ ans = R_NilValue; v = REAL(ans);
613      }      }
614    
# Line 618  Line 638 
638    
639      return diag_tC_ptr(n, x_p, x_x, perm, resultKind);      return diag_tC_ptr(n, x_p, x_x, perm, resultKind);
640  }  }
641    
642    /**
643     * Create a Csparse matrix object from indices and/or pointers.
644     *
645     * @param cls name of actual class of object to create
646     * @param i optional integer vector of length nnz of row indices
647     * @param j optional integer vector of length nnz of column indices
648     * @param p optional integer vector of length np of row or column pointers
649     * @param np length of integer vector p.  Must be zero if p == (int*)NULL
650     * @param x optional vector of values
651     * @param nnz length of vectors i, j and/or x, whichever is to be used
652     * @param dims optional integer vector of length 2 to be used as
653     *     dimensions.  If dims == (int*)NULL then the maximum row and column
654     *     index are used as the dimensions.
655     * @param dimnames optional list of length 2 to be used as dimnames
656     * @param index1 indicator of 1-based indices
657     *
658     * @return an SEXP of class cls inheriting from CsparseMatrix.
659     */
660    SEXP create_Csparse(char* cls, int* i, int* j, int* p, int np,
661                        void* x, int nnz, int* dims, SEXP dimnames,
662                        int index1)
663    {
664        SEXP ans;
665        int *ij = (int*)NULL, *tri, *trj,
666            mi, mj, mp, nrow = -1, ncol = -1;
667        int xtype = -1;             /* -Wall */
668        CHM_TR T;
669        CHM_SP A;
670    
671        if (np < 0 || nnz < 0)
672            error(_("negative vector lengths not allowed: np = %d, nnz = %d"),
673                  np, nnz);
674        if (1 != ((mi = (i == (int*)NULL)) +
675                  (mj = (j == (int*)NULL)) +
676                  (mp = (p == (int*)NULL))))
677            error(_("exactly 1 of 'i', 'j' or 'p' must be NULL"));
678        if (mp) {
679            if (np) error(_("np = %d, must be zero when p is NULL"), np);
680        } else {
681            if (np) {               /* Expand p to form i or j */
682                if (!(p[0])) error(_("p[0] = %d, should be zero"), p[0]);
683                for (int ii = 0; ii < np; ii++)
684                    if (p[ii] > p[ii + 1])
685                        error(_("p must be non-decreasing"));
686                if (p[np] != nnz)
687                    error("p[np] = %d != nnz = %d", p[np], nnz);
688                ij = Calloc(nnz, int);
689                if (mi) {
690                    i = ij;
691                    nrow = np;
692                } else {
693                    j = ij;
694                    ncol = np;
695                }
696                                    /* Expand p to 0-based indices */
697                for (int ii = 0; ii < np; ii++)
698                    for (int jj = p[ii]; jj < p[ii + 1]; jj++) ij[jj] = ii;
699            } else {
700                if (nnz)
701                    error(_("Inconsistent dimensions: np = 0 and nnz = %d"),
702                          nnz);
703            }
704        }
705                                    /* calculate nrow and ncol */
706        if (nrow < 0) {
707            for (int ii = 0; ii < nnz; ii++) {
708                int i1 = i[ii] + (index1 ? 0 : 1); /* 1-based index */
709                if (i1 < 1) error(_("invalid row index at position %d"), ii);
710                if (i1 > nrow) nrow = i1;
711            }
712        }
713        if (ncol < 0) {
714            for (int jj = 0; jj < nnz; jj++) {
715                int j1 = j[jj] + (index1 ? 0 : 1);
716                if (j1 < 1) error(_("invalid column index at position %d"), jj);
717                if (j1 > ncol) ncol = j1;
718            }
719        }
720        if (dims != (int*)NULL) {
721            if (dims[0] > nrow) nrow = dims[0];
722            if (dims[1] > ncol) ncol = dims[1];
723        }
724                                    /* check the class name */
725        if (strlen(cls) != 8)
726            error(_("strlen of cls argument = %d, should be 8"), strlen(cls));
727        if (!strcmp(cls + 2, "CMatrix"))
728            error(_("cls = \"%s\" does not end in \"CMatrix\""), cls);
729        switch(cls[0]) {
730        case 'd':
731        case 'l':
732               xtype = CHOLMOD_REAL;
733               break;
734        case 'n':
735               xtype = CHOLMOD_PATTERN;
736               break;
737        default:
738               error(_("cls = \"%s\" must begin with 'd', 'l' or 'n'"), cls);
739        }
740        if (cls[1] != 'g')
741            error(_("Only 'g'eneral sparse matrix types allowed"));
742                                    /* allocate and populate the triplet */
743        T = cholmod_l_allocate_triplet((size_t)nrow, (size_t)ncol, (size_t)nnz, 0,
744                                        xtype, &c);
745        T->x = x;
746        tri = (int*)T->i;
747        trj = (int*)T->j;
748        for (int ii = 0; ii < nnz; ii++) {
749            tri[ii] = i[ii] - ((!mi && index1) ? 1 : 0);
750            trj[ii] = j[ii] - ((!mj && index1) ? 1 : 0);
751        }
752                                    /* create the cholmod_sparse structure */
753        A = cholmod_l_triplet_to_sparse(T, nnz, &c);
754        cholmod_l_free_triplet(&T, &c);
755                                    /* copy the information to the SEXP */
756        ans = PROTECT(NEW_OBJECT(MAKE_CLASS(cls)));
757    /* FIXME: This has been copied from chm_sparse_to_SEXP in chm_common.c */
758                                    /* allocate and copy common slots */
759        nnz = cholmod_l_nnz(A, &c);
760        dims = INTEGER(ALLOC_SLOT(ans, Matrix_DimSym, INTSXP, 2));
761        dims[0] = A->nrow; dims[1] = A->ncol;
762        Memcpy(INTEGER(ALLOC_SLOT(ans, Matrix_pSym, INTSXP, A->ncol + 1)), (int*)A->p, A->ncol + 1);
763        Memcpy(INTEGER(ALLOC_SLOT(ans, Matrix_iSym, INTSXP, nnz)), (int*)A->i, nnz);
764        switch(cls[1]) {
765        case 'd':
766            Memcpy(REAL(ALLOC_SLOT(ans, Matrix_xSym, REALSXP, nnz)), (double*)A->x, nnz);
767            break;
768        case 'l':
769            error(_("code not yet written for cls = \"lgCMatrix\""));
770        }
771        cholmod_l_free_sparse(&A, &c);
772        UNPROTECT(1);
773        return ans;
774    }

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

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