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 890, Thu Sep 1 17:18:08 2005 UTC revision 1654, Fri Oct 27 16:58:15 2006 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 18  Line 17 
17    
18  SEXP triangularMatrix_validate(SEXP obj);  SEXP triangularMatrix_validate(SEXP obj);
19  SEXP symmetricMatrix_validate(SEXP obj);  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};
# Line 45  Line 45 
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);
 double *packed_to_full(double *dest, const double *src, int n,  
                        enum CBLAS_UPLO uplo);  
 double *full_to_packed(double *dest, const double *src, int n,  
                        enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag);  
54  double *packed_getDiag(double *dest, SEXP x);  double *packed_getDiag(double *dest, SEXP x);
55  SEXP Matrix_getElement(SEXP list, char *nm);  SEXP Matrix_getElement(SEXP list, char *nm);
56    
57    #define PACKED_TO_FULL(TYPE)                                            \
58    TYPE *packed_to_full_ ## TYPE(TYPE *dest, const TYPE *src,              \
59                                 int n, enum CBLAS_UPLO uplo)
60    PACKED_TO_FULL(double);
61    PACKED_TO_FULL(int);
62    #undef PACKED_TO_FULL
63    
64    #define FULL_TO_PACKED(TYPE)                                            \
65    TYPE *full_to_packed_ ## TYPE(TYPE *dest, const TYPE *src, int n,       \
66                                  enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag)
67    FULL_TO_PACKED(double);
68    FULL_TO_PACKED(int);
69    #undef FULL_TO_PACKED
70    
71    
72  extern   /* stored pointers to symbols initialized in R_init_Matrix */  extern   /* stored pointers to symbols initialized in R_init_Matrix */
73  #include "Syms.h"  #include "Syms.h"
# Line 78  Line 81 
81  /* duplicate the slot with name given by sym from src to dest */  /* duplicate the slot with name given by sym from src to dest */
82  #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)))
83    
84    #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))
85    #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))
86    #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
87    
88    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
89                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 :   \
90                              -1))
91    
92    
93  /**  /**
94   * Check for valid length of a packed triangular array and return the   * Check for valid length of a packed triangular array and return the
95   * corresponding number of columns   * corresponding number of columns
# Line 142  Line 154 
154      return mj;      return mj;
155  }  }
156    
157    void make_d_matrix_triangular(double *x, SEXP from);
158    void make_i_matrix_triangular(   int *x, SEXP from);
159    
160  /**  void make_d_matrix_symmetric(double *to, SEXP from);
161   * 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;  
 }  
   
 SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);  
162    
163  /**  SEXP Matrix_expand_pointers(SEXP pP);
  * 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];  
 }  
164    
165  double *expand_csc_column(double *dest, int m, int j,  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
                           const int Ap[], const int Ai[], const double Ax[]);  
166    
167  /**  SEXP new_dgeMatrix(int nrow, int ncol);
  * 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]];  
 }  
168    
169  /**  static R_INLINE SEXP
170   * Force index pairs to be in the upper triangle of a matrix  mMatrix_as_dgeMatrix(SEXP A)
  *  
  * @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)  
171  {  {
172      int k;      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
     for (k = 0; k < nnz; k++) {  
         if (i[k] > j[k]) {  
             int tmp = i[k];  
             i[k] = j[k];  
             j[k] = tmp;  
         }  
173      }      }
 }  
   
 void make_array_triangular(double *x, SEXP from);  
   
 SEXP Matrix_expand_pointers(SEXP pP);  
   
174    
175  /**  /**
176   * Elementwise increment dest by src   * Return the 0-based index of a string match in a vector of strings
177     * terminated by an empty string.  Returns -1 for no match.
178   *   *
179   * @param dest vector to be incremented   * @param dest class string to match
180   * @param src vector to be added to dest   * @param valid vector of possible matches terminated by an empty string
  * @param n length of vectors  
181   *   *
182   * @return dest   * @return index of match or -1 for no match
183   */   */
184  static R_INLINE double*  static R_INLINE int
185  vecIncrement(double dest[], const double src[], int n) {  Matrix_check_class(char *class, char **valid)
186      int i;  {
187      for (i = 0; i < n; i++) dest[i] += src[i];      int ans;
188      return dest;      for (ans = 0; ; ans++) {
189            if (!strlen(valid[ans])) return -1;
190            if (!strcmp(class, valid[ans])) return ans;
191  }  }
   
 /**  
  * 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;  
192  }  }
193    
194  #ifdef __cplusplus  #ifdef __cplusplus

Legend:
Removed from v.890  
changed lines
  Added in v.1654

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