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 572, Fri Feb 25 14:11:54 2005 UTC revision 1548, Mon Sep 11 22:13:07 2006 UTC
# Line 1  Line 1 
1  #ifndef MATRIX_MUTILS_H  #ifndef MATRIX_MUTILS_H
2  #define MATRIX_MUTILS_H  #define MATRIX_MUTILS_H
3    
4  #include <Rdefines.h>  #ifdef __cplusplus
5  #include <Rconfig.h>  extern "C" {
6  #include "cblas.h"  #endif
7    
8    #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */
9    #include <R.h>  /* includes Rconfig.h */
10    
11    #ifdef ENABLE_NLS
12    #include <libintl.h>
13    #define _(String) dgettext ("Matrix", String)
14    #else
15    #define _(String) (String)
16    #endif
17    
18  /* short forms of some enum constants from cblas.h */  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 */
23    enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
24    enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
25    enum CBLAS_UPLO {CblasUpper=121, CblasLower=122};
26    enum CBLAS_DIAG {CblasNonUnit=131, CblasUnit=132};
27    enum CBLAS_SIDE {CblasLeft=141, CblasRight=142};
28  #define RMJ CblasRowMajor  #define RMJ CblasRowMajor
29  #define CMJ CblasColMajor  #define CMJ CblasColMajor
30  #define NTR CblasNoTrans  #define NTR CblasNoTrans
# Line 26  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    
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[]);
 SEXP triple_as_SEXP(int nrow, int ncol, int nz,  
                     const int Ti [], const int Tj [], const double Tx [],  
                     char *Rclass);  
51  SEXP csc_check_column_sorting(SEXP A);  SEXP csc_check_column_sorting(SEXP A);
 void csc_components_transpose(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[]);  
 double *nlme_symmetrize(double *a, const int nc);  
 void nlme_check_Lapack_error(int info, const char *laName);  
 SEXP nlme_replaceSlot(SEXP obj, SEXP names, SEXP value);  
 SEXP nlme_weight_matrix_list(SEXP MLin, SEXP wts, SEXP adjst, SEXP MLout);  
52  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
53                                  /* stored pointers to symbols */  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
54                                  /* initialized in R_init_Matrix */  double *packed_getDiag(double *dest, SEXP x);
55  extern  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 */
73  #include "Syms.h"  #include "Syms.h"
74    
75  /* zero an array */  /* zero an array */
76  #define AZERO(x, n) {int _I_, _SZ_ = (n); for(_I_ = 0; _I_ < _SZ_; _I_++) (x)[_I_] = 0;}  #define AZERO(x, n) {int _I_, _SZ_ = (n); for(_I_ = 0; _I_ < _SZ_; _I_++) (x)[_I_] = 0;}
77    
78    /* number of elements in one triangle of a square matrix of order n */
79    #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
80    
81    /* 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)))
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
95     * corresponding number of columns
96     *
97     * @param len length of a packed triangular array
98     *
99     * @return number of columns
100     */
101    static R_INLINE
102    int packed_ncol(int len)
103    {
104        int disc = 8 * len + 1;     /* discriminant */
105        int sqrtd = (int) sqrt((double) disc);
106    
107        if (len < 0 || disc != sqrtd * sqrtd)
108            error(_("invalid 'len' = %d in packed_ncol"));
109        return (sqrtd - 1)/2;
110    }
111    
112  /**  /**
113   * Allocate an SEXP of given type and length, assign it as slot nm in   * Allocate an SEXP of given type and length, assign it as slot nm in
114   * the object, and return the SEXP.  The validity of this function   * the object, and return the SEXP.  The validity of this function
# Line 76  Line 134 
134  }  }
135    
136  /**  /**
137   * Expand the column pointers in the array mp into a full set of column indices   * Expand compressed pointers in the array mp into a full set of indices
138   * in the array mj.   * in the array mj.
139   *   *
140   * @param ncol number of columns   * @param ncol number of columns (or rows)
141   * @param mp column pointer vector of length ncol + 1   * @param mp column pointer vector of length ncol + 1
142   * @param mj vector of length mp[ncol] - 1 to hold the result   * @param mj vector of length mp[ncol] to hold the result
143   *   *
144   * @return mj   * @return mj
145   */   */
146  static R_INLINE  static R_INLINE
147  int* expand_column_pointers(int ncol, const int mp[], int mj[])  int* expand_cmprPt(int ncol, const int mp[], int mj[])
148  {  {
149      int j;      int j;
150      for (j = 0; j < ncol; j++) {      for (j = 0; j < ncol; j++) {
# Line 96  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;  
 }  
162    
163  SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);  SEXP Matrix_expand_pointers(SEXP pP);
164    
165  /**  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
  * 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;  
 }  
166    
167  /**  static R_INLINE SEXP
168   * Check for a complete match on matrix dimensions  mMatrix_as_dgeMatrix(SEXP A)
  *  
  * @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[])  
169  {  {
170      return xd[0] == yd[0] && xd[1] == yd[1];      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
171  }  }
172    
 double *expand_csc_column(double *dest, int m, int j,  
                           const int Ap[], const int Ai[], const double Ax[]);  
   
173  /**  /**
174   * Apply a permutation to an integer vector   * Return the 0-based index of a string match in a vector of strings
175     * terminated by an empty string.  Returns -1 for no match.
176   *   *
177   * @param i vector of 0-based indices   * @param dest class string to match
178   * @param n length of vector i   * @param valid vector of possible matches terminated by an empty string
  * @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  
179   *   *
180   * @param i vector of 0-based row indices   * @return index of match or -1 for no match
  * @param j vector of 0-based column indices  
  * @param nnz length of index vectors  
181   */   */
182  static R_INLINE void  static R_INLINE int
183  make_upper_triangular(int i[], int j[], int nnz)  Matrix_check_class(char *class, char **valid)
184  {  {
185      int k;      int ans;
186      for (k = 0; k < nnz; k++) {      for (ans = 0; ; ans++) {
187          if (i[k] > j[k]) {          if (!strlen(valid[ans])) return -1;
188              int tmp = i[k];          if (!strcmp(class, valid[ans])) return ans;
             i[k] = j[k];  
             j[k] = tmp;  
         }  
189      }      }
190  }  }
191    
192    #ifdef __cplusplus
193    }
194  #endif  #endif
195    
196    #endif /* MATRIX_MUTILS_H_ */

Legend:
Removed from v.572  
changed lines
  Added in v.1548

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