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 1507, Mon Sep 4 18:41:34 2006 UTC revision 2045, Tue Aug 14 13:07:10 2007 UTC
# Line 15  Line 15 
15  #define _(String) (String)  #define _(String) (String)
16  #endif  #endif
17    
18    #ifdef __GNUC__
19    # undef alloca
20    # define alloca(x) __builtin_alloca((x))
21    #endif
22    
23    #define Alloca(n, t)   (t *) alloca( (size_t) ( (n) * sizeof(t) ) )
24    
25  SEXP triangularMatrix_validate(SEXP obj);  SEXP triangularMatrix_validate(SEXP obj);
26  SEXP symmetricMatrix_validate(SEXP obj);  SEXP symmetricMatrix_validate(SEXP obj);
27  SEXP dense_nonpacked_validate(SEXP obj);  SEXP dense_nonpacked_validate(SEXP obj);
# Line 37  Line 44 
44  #define LFT CblasLeft  #define LFT CblasLeft
45  #define RGT CblasRight  #define RGT CblasRight
46    
47  char norm_type(char *typstr);  char norm_type(const char *typstr);
48  char rcond_type(char *typstr);  char rcond_type(const char *typstr);
49  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
50  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
51  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
52  SEXP get_factors(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
53  SEXP set_factors(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
54  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);  
55    
56  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
57  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[]); */
58  SEXP csc_check_column_sorting(SEXP A);  /* SEXP csc_check_column_sorting(SEXP A); */
59  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
60  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
61  double *packed_getDiag(double *dest, SEXP x);  void d_packed_getDiag(double *dest, SEXP x, int n);
62    void l_packed_getDiag(   int *dest, SEXP x, int n);
63    void tr_d_packed_getDiag(double *dest, SEXP x);
64    void tr_l_packed_getDiag(   int *dest, SEXP x);
65    
66  SEXP Matrix_getElement(SEXP list, char *nm);  SEXP Matrix_getElement(SEXP list, char *nm);
67    
68  #define PACKED_TO_FULL(TYPE)                                            \  #define PACKED_TO_FULL(TYPE)                                            \
# Line 81  Line 90 
90  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
91    
92  /* duplicate the slot with name given by sym from src to dest */  /* duplicate the slot with name given by sym from src to dest */
93    /* FIXME: is not yet used */
94  #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)))
95    
96    #define slot_nonNull_dup(dest, src, sym)                        \
97        if(GET_SLOT(src, sym) != R_NilValue)                        \
98            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
99    
100    /* TODO: Make this faster for the case where dimnames = list(NULL,NULL)
101     *       and hence don't have to be set ! */
102    #define SET_DimNames(dest, src) slot_dup(dest, src, Matrix_DimNamesSym)
103    
104    
105  #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))
106  #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))
107  #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))  #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
108    
109    /* should also work for "matrix" matrices: */
110    #define Real_KIND(_x_)  (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
111                             (isReal(_x_) ? 0 : (isLogical(_x_) ? 1 : -1)))
112    
113    /* requires 'x' slot: */
114    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
115                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 : -1))
116    
117    
118  /**  /**
119   * Check for valid length of a packed triangular array and return the   * Check for valid length of a packed triangular array and return the
120   * corresponding number of columns   * corresponding number of columns
# Line 113  Line 141 
141   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
142   * 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
143   * the slot.   * the slot.
144     * NOTE:  GET_SLOT(x, what)        :== R_do_slot       (x, what)
145     * ----   SET_SLOT(x, what, value) :== R_do_slot_assign(x, what, value)
146     * and the R_do_slot* are in src/main/attrib.c
147   *   *
148   * @param obj object in which to assign the slot   * @param obj object in which to assign the slot
149   * @param nm name of the slot, as an R name object   * @param nm name of the slot, as an R name object
# Line 151  Line 182 
182      return mj;      return mj;
183  }  }
184    
   
 /**  
  * 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;  
 }  
   
 /**  
  * 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;  
 }  
   
 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;  
         }  
     }  
 }  
   
185  void make_d_matrix_triangular(double *x, SEXP from);  void make_d_matrix_triangular(double *x, SEXP from);
186  void make_i_matrix_triangular(   int *x, SEXP from);  void make_i_matrix_triangular(   int *x, SEXP from);
187    
# Line 240  Line 190 
190    
191  SEXP Matrix_expand_pointers(SEXP pP);  SEXP Matrix_expand_pointers(SEXP pP);
192    
   
 /**  
  * 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;  
 }  
   
 /**  
  * Elementwise sum of src1 and src2 into dest  
  *  
  * @param dest vector to be incremented  
  * @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;  
 }  
   
 SEXP alloc_dgeMatrix(int m, int n, SEXP rownms, SEXP colnms);  
 SEXP alloc_dpoMatrix(int n, char *uplo, SEXP rownms, SEXP colnms);  
 SEXP alloc_dtrMatrix(int n, char *uplo, char *diag, SEXP rownms, SEXP colnms);  
 SEXP alloc_dsCMatrix(int n, int nz, char *uplo, SEXP rownms, SEXP colnms);  
   
193  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
194    SEXP dup_mMatrix_as_geMatrix (SEXP A);
195    
196    SEXP new_dgeMatrix(int nrow, int ncol);
197    
198  static R_INLINE SEXP  static R_INLINE SEXP
199  mMatrix_as_dgeMatrix(SEXP A)  mMatrix_as_dgeMatrix(SEXP A)
# Line 288  Line 201 
201      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
202  }  }
203    
204    static R_INLINE SEXP
205    mMatrix_as_geMatrix(SEXP A)
206    {
207        return strcmp(class_P(A) + 1, "geMatrix") ? dup_mMatrix_as_geMatrix(A) : A;
208    }
209    
210  /**  /**
211   * 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
212   * terminated by an empty string.  Returns -1 for no match.   * terminated by an empty string.  Returns -1 for no match.
# Line 298  Line 217 
217   * @return index of match or -1 for no match   * @return index of match or -1 for no match
218   */   */
219  static R_INLINE int  static R_INLINE int
220  Matrix_check_class(char *class, char **valid)  Matrix_check_class(const char *class, char **valid)
221  {  {
222      int ans;      int ans;
223      for (ans = 0; ; ans++) {      for (ans = 0; ; ans++) {

Legend:
Removed from v.1507  
changed lines
  Added in v.2045

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