SCM

SCM Repository

[matrix] Diff of /pkg/src/Mutils.h
ViewVC logotype

Diff of /pkg/src/Mutils.h

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

revision 1416, Tue Aug 22 22:44:14 2006 UTC revision 1867, Mon Jun 4 17:13:02 2007 UTC
# Line 37  Line 37 
37  #define LFT CblasLeft  #define LFT CblasLeft
38  #define RGT CblasRight  #define RGT CblasRight
39    
40  char norm_type(char *typstr);  char norm_type(const char *typstr);
41  char rcond_type(char *typstr);  char rcond_type(const char *typstr);
42  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
43  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
44  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
45  SEXP get_factors(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
46  SEXP set_factors(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
47  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);
 char uplo_value(SEXP x);  
 char diag_value(SEXP x);  
48    
49  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
50  void csc_sort_columns(int ncol, const int p[], int i[], double x[]);  /* void csc_sort_columns(int ncol, const int p[], int i[], double x[]); */
51  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  /* SEXP csc_check_column_sorting(SEXP A); */
                     const int Ti [], const int Tj [], const double Tx [],  
                     char *Rclass);  
 SEXP csc_check_column_sorting(SEXP A);  
 void csc_compTr(int m, int n, int nnz,  
                 const int xp[], const int xi[], const double xx[],  
                 int ap[], int ai[], double ax[]);  
 void ssc_symbolic_permute(int n, int upper, const int perm[],  
                           int Ap[], int Ai[]);  
52  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
53  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
54  double *packed_getDiag(double *dest, SEXP x);  void d_packed_getDiag(double *dest, SEXP x, int n);
55    void l_packed_getDiag(   int *dest, SEXP x, int n);
56    void tr_d_packed_getDiag(double *dest, SEXP x);
57    void tr_l_packed_getDiag(   int *dest, SEXP x);
58    
59  SEXP Matrix_getElement(SEXP list, char *nm);  SEXP Matrix_getElement(SEXP list, char *nm);
60    
61  #define PACKED_TO_FULL(TYPE)                                            \  #define PACKED_TO_FULL(TYPE)                                            \
# Line 89  Line 83 
83  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
84    
85  /* duplicate the slot with name given by sym from src to dest */  /* duplicate the slot with name given by sym from src to dest */
86    /* FIXME: is not yet used */
87  #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))  #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
88    
89    #define slot_nonNull_dup(dest, src, sym)                        \
90        if(GET_SLOT(src, sym) != R_NilValue)                        \
91            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
92    
93    /* TODO: Make this faster for the case where dimnames = list(NULL,NULL)
94     *       and hence don't have to be set ! */
95    #define SET_DimNames(dest, src) slot_dup(dest, src, Matrix_DimNamesSym)
96    
97    
98  #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))  #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))
99  #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))  #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))
100    #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
101    
102    /* should also work for "matrix" matrices: */
103    #define Real_KIND(_x_)  (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
104                             (isReal(_x_) ? 0 : (isLogical(_x_) ? 1 : -1)))
105    
106    /* requires 'x' slot: */
107    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
108                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 : -1))
109    
110    
111  /**  /**
# Line 121  Line 134 
134   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
135   * GET_SLOT to ensure that the value returned is indeed the SEXP in   * GET_SLOT to ensure that the value returned is indeed the SEXP in
136   * the slot.   * the slot.
137     * NOTE:  GET_SLOT(x, what)        :== R_do_slot       (x, what)
138     * ----   SET_SLOT(x, what, value) :== R_do_slot_assign(x, what, value)
139     * and the R_do_slot* are in src/main/attrib.c
140   *   *
141   * @param obj object in which to assign the slot   * @param obj object in which to assign the slot
142   * @param nm name of the slot, as an R name object   * @param nm name of the slot, as an R name object
# Line 159  Line 175 
175      return mj;      return mj;
176  }  }
177    
   
 /**  
  * Return the linear index of the (row, col) entry in a csc structure.  
  * If the entry is not found and missing is 0 an error is signaled;  
  * otherwise the missing value is returned.  
  *  
  * @param p vector of column pointers  
  * @param i vector of row indices  
  * @param row row index  
  * @param col column index  
  * @param missing the value to return is the row, col entry does not  
  * exist.  If this is zero and the row, col entry does not exist an  
  * error is signaled.  
  *  
  * @return index of element at (row, col) if it exists, otherwise missing  
  */  
 static R_INLINE int  
 check_csc_index(const int p[], const int i[], int row, int col, int missing)  
 {  
     int k, k2 = p[col + 1];  
                                 /* linear search - perhaps replace by bsearch */  
     for (k = p[col]; k < k2; k++) if (i[k] == row) return k;  
     if (!missing)  
         error("row %d and column %d not defined in rowind and colptr",  
               row, col);  
     return missing;  
 }  
   
 SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);  
   
 /**  
  * Calculate the zero-based index in a row-wise packed lower triangular matrix.  
  * This is used for the arrays of blocked sparse matrices.  
  *  
  * @param i column number (zero-based)  
  * @param k row number (zero-based)  
  *  
  * @return The index of the (k,i) element of a packed lower triangular matrix  
  */  
 static R_INLINE  
 int Lind(int k, int i)  
 {  
     if (k < i) error("Lind(k = %d, i = %d) must have k >= i", k, i);  
     return (k * (k + 1))/2 + i;  
 }  
   
 /**  
  * Check for a complete match on matrix dimensions  
  *  
  * @param xd dimensions of first matrix  
  * @param yd dimensions of second matrix  
  *  
  * @return 1 if dimensions match, otherwise 0  
  */  
 static R_INLINE  
 int match_mat_dims(const int xd[], const int yd[])  
 {  
     return xd[0] == yd[0] && xd[1] == yd[1];  
 }  
   
 double *expand_csc_column(double *dest, int m, int j,  
                           const int Ap[], const int Ai[], const double Ax[]);  
   
 /**  
  * Apply a permutation to an integer vector  
  *  
  * @param i vector of 0-based indices  
  * @param n length of vector i  
  * @param perm 0-based permutation vector of length max(i) + 1  
  */  
 static R_INLINE void  
 int_permute(int i[], int n, const int perm[])  
 {  
     int j;  
     for (j = 0; j < n; j++) i[j] = perm[i[j]];  
 }  
   
 /**  
  * Force index pairs to be in the upper triangle of a matrix  
  *  
  * @param i vector of 0-based row indices  
  * @param j vector of 0-based column indices  
  * @param nnz length of index vectors  
  */  
 static R_INLINE void  
 make_upper_triangular(int i[], int j[], int nnz)  
 {  
     int k;  
     for (k = 0; k < nnz; k++) {  
         if (i[k] > j[k]) {  
             int tmp = i[k];  
             i[k] = j[k];  
             j[k] = tmp;  
         }  
     }  
 }  
   
178  void make_d_matrix_triangular(double *x, SEXP from);  void make_d_matrix_triangular(double *x, SEXP from);
179  void make_i_matrix_triangular(   int *x, SEXP from);  void make_i_matrix_triangular(   int *x, SEXP from);
180    
# Line 264  Line 183 
183    
184  SEXP Matrix_expand_pointers(SEXP pP);  SEXP Matrix_expand_pointers(SEXP pP);
185    
186    SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
187    SEXP dup_mMatrix_as_geMatrix (SEXP A);
188    
189  /**  SEXP new_dgeMatrix(int nrow, int ncol);
  * Elementwise increment dest by src  
  *  
  * @param dest vector to be incremented  
  * @param src vector to be added to dest  
  * @param n length of vectors  
  *  
  * @return dest  
  */  
 static R_INLINE double*  
 vecIncrement(double dest[], const double src[], int n) {  
     int i;  
     for (i = 0; i < n; i++) dest[i] += src[i];  
     return dest;  
 }  
190    
191  /**  static R_INLINE SEXP
192   * Elementwise sum of src1 and src2 into dest  mMatrix_as_dgeMatrix(SEXP A)
193   *  {
194   * @param dest vector to be incremented      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
  * @param src1 vector to be added  
  * @param src1 second vector to be added  
  * @param n length of vectors  
  *  
  * @return dest  
  */  
 static R_INLINE double*  
 vecSum(double dest[], const double src1[], const double src2[],  
        int n) {  
     int i;  
     for (i = 0; i < n; i++) dest[i] = src1[i] + src2[i];  
     return dest;  
195  }  }
196    
197  SEXP alloc_real_classed_matrix(char *class, int nrow, int ncol);  static R_INLINE SEXP
198  SEXP alloc_dgeMatrix(int m, int n, SEXP rownms, SEXP colnms);  mMatrix_as_geMatrix(SEXP A)
199  SEXP alloc_dpoMatrix(int n, char *uplo, SEXP rownms, SEXP colnms);  {
200  SEXP alloc_dtrMatrix(int n, char *uplo, char *diag, SEXP rownms, SEXP colnms);      return strcmp(class_P(A) + 1, "geMatrix") ? dup_mMatrix_as_geMatrix(A) : A;
201  SEXP alloc_dsCMatrix(int n, int nz, char *uplo, SEXP rownms, SEXP colnms);  }
   
 SEXP dup_mMatrix_as_dgeMatrix(SEXP A, SEXP classed);  
   
202    
203  /**  /**
204   * Return the 0-based index of a string match in a vector of strings   * Return the 0-based index of a string match in a vector of strings
# Line 318  Line 210 
210   * @return index of match or -1 for no match   * @return index of match or -1 for no match
211   */   */
212  static R_INLINE int  static R_INLINE int
213  Matrix_check_class(char *class, char **valid)  Matrix_check_class(const char *class, char **valid)
214  {  {
215      int ans;      int ans;
216      for (ans = 0; ; ans++) {      for (ans = 0; ; ans++) {

Legend:
Removed from v.1416  
changed lines
  Added in v.1867

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