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 766, Tue Jun 7 23:03:34 2005 UTC revision 1867, Mon Jun 4 17:13:02 2007 UTC
# Line 5  Line 5 
5  extern "C" {  extern "C" {
6  #endif  #endif
7    
8  #include <Rdefines.h>  #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */
9  #include <Rconfig.h>  #include <R.h>  /* includes Rconfig.h */
 #include <R.h>  /* to include Rconfig.h */  
10    
11  #ifdef ENABLE_NLS  #ifdef ENABLE_NLS
12  #include <libintl.h>  #include <libintl.h>
# Line 16  Line 15 
15  #define _(String) (String)  #define _(String) (String)
16  #endif  #endif
17    
18    SEXP triangularMatrix_validate(SEXP obj);
19    SEXP symmetricMatrix_validate(SEXP obj);
20    SEXP dense_nonpacked_validate(SEXP obj);
21    
22  /* enum constants from cblas.h and some short forms */  /* enum constants from cblas.h and some short forms */
23  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
24  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
# Line 34  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);
48  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  
49  void csc_sort_columns(int ncol, const int p[], int i[], double x[]);  /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
50  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  /* void csc_sort_columns(int ncol, const int p[], int i[], double x[]); */
51                      const int Ti [], const int Tj [], const double Tx [],  /* SEXP csc_check_column_sorting(SEXP A); */
                     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_to_full(double *dest, const double *src, int n,  void d_packed_getDiag(double *dest, SEXP x, int n);
55                         enum CBLAS_UPLO uplo);  void l_packed_getDiag(   int *dest, SEXP x, int n);
56  double *full_to_packed(double *dest, const double *src, int n,  void tr_d_packed_getDiag(double *dest, SEXP x);
57                         enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag);  void tr_l_packed_getDiag(   int *dest, SEXP x);
58  double *packed_getDiag(double *dest, SEXP x);  
59    SEXP Matrix_getElement(SEXP list, char *nm);
60    
61    #define PACKED_TO_FULL(TYPE)                                            \
62    TYPE *packed_to_full_ ## TYPE(TYPE *dest, const TYPE *src,              \
63                                 int n, enum CBLAS_UPLO uplo)
64    PACKED_TO_FULL(double);
65    PACKED_TO_FULL(int);
66    #undef PACKED_TO_FULL
67    
68    #define FULL_TO_PACKED(TYPE)                                            \
69    TYPE *full_to_packed_ ## TYPE(TYPE *dest, const TYPE *src, int n,       \
70                                  enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag)
71    FULL_TO_PACKED(double);
72    FULL_TO_PACKED(int);
73    #undef FULL_TO_PACKED
74    
75    
76  extern   /* stored pointers to symbols initialized in R_init_Matrix */  extern   /* stored pointers to symbols initialized in R_init_Matrix */
# Line 72  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))
99    #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  /**  /**
112   * Check for valid length of a packed triangular array and return the   * Check for valid length of a packed triangular array and return the
113   * corresponding number of columns   * corresponding number of columns
# Line 100  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 138  Line 175 
175      return mj;      return mj;
176  }  }
177    
178    void make_d_matrix_triangular(double *x, SEXP from);
179    void make_i_matrix_triangular(   int *x, SEXP from);
180    
181  /**  void make_d_matrix_symmetric(double *to, SEXP from);
182   * Return the linear index of the (row, col) entry in a csc structure.  void make_i_matrix_symmetric(   int *to, SEXP from);
  * 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;  
 }  
183    
184  SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);  SEXP Matrix_expand_pointers(SEXP pP);
185    
186  /**  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
187   * Calculate the zero-based index in a row-wise packed lower triangular matrix.  SEXP dup_mMatrix_as_geMatrix (SEXP A);
  * 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;  
 }  
188    
189  /**  SEXP new_dgeMatrix(int nrow, int ncol);
190   * Check for a complete match on matrix dimensions  
191   *  static R_INLINE SEXP
192   * @param xd dimensions of first matrix  mMatrix_as_dgeMatrix(SEXP A)
  * @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[])  
193  {  {
194      return xd[0] == yd[0] && xd[1] == yd[1];      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
195  }  }
196    
197  double *expand_csc_column(double *dest, int m, int j,  static R_INLINE SEXP
198                            const int Ap[], const int Ai[], const double Ax[]);  mMatrix_as_geMatrix(SEXP A)
   
 /**  
  * 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[])  
199  {  {
200      int j;      return strcmp(class_P(A) + 1, "geMatrix") ? dup_mMatrix_as_geMatrix(A) : A;
     for (j = 0; j < n; j++) i[j] = perm[i[j]];  
201  }  }
202    
203  /**  /**
204   * Force index pairs to be in the upper triangle of a matrix   * Return the 0-based index of a string match in a vector of strings
205     * terminated by an empty string.  Returns -1 for no match.
206   *   *
207   * @param i vector of 0-based row indices   * @param dest class string to match
208   * @param j vector of 0-based column indices   * @param valid vector of possible matches terminated by an empty string
209   * @param nnz length of index vectors   *
210     * @return index of match or -1 for no match
211   */   */
212  static R_INLINE void  static R_INLINE int
213  make_upper_triangular(int i[], int j[], int nnz)  Matrix_check_class(const char *class, char **valid)
214  {  {
215      int k;      int ans;
216      for (k = 0; k < nnz; k++) {      for (ans = 0; ; ans++) {
217          if (i[k] > j[k]) {          if (!strlen(valid[ans])) return -1;
218              int tmp = i[k];          if (!strcmp(class, valid[ans])) return ans;
             i[k] = j[k];  
             j[k] = tmp;  
219          }          }
220      }      }
 }  
   
 void make_array_triangular(double *x, SEXP from);  
   
 SEXP Matrix_expand_pointers(SEXP pP);  
221    
222  #ifdef __cplusplus  #ifdef __cplusplus
223  }  }

Legend:
Removed from v.766  
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