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 597, Thu Mar 3 19:58:59 2005 UTC revision 2121, Tue Mar 4 22:01:33 2008 UTC
# Line 5  Line 5 
5  extern "C" {  extern "C" {
6  #endif  #endif
7    
8  #include <Rdefines.h>  #include <ctype.h>
9  #include <Rconfig.h>  #include <R.h>  /* includes Rconfig.h */
10  #include <R.h>  /* to include Rconfig.h */  #include <Rversion.h>
11    #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */
12    
13  #ifdef ENABLE_NLS  #ifdef ENABLE_NLS
14  #include <libintl.h>  #include <libintl.h>
# Line 16  Line 17 
17  #define _(String) (String)  #define _(String) (String)
18  #endif  #endif
19    
20    #ifdef __GNUC__
21    # undef alloca
22    # define alloca(x) __builtin_alloca((x))
23    #else
24    /* this is necessary (and sufficient) for Solaris 10: */
25    #ifdef __sun
26    # include <alloca.h>
27    #endif
28    #endif
29    
30    #define Alloca(n, t)   (t *) alloca( (size_t) ( (n) * sizeof(t) ) )
31    
32    SEXP triangularMatrix_validate(SEXP obj);
33    SEXP symmetricMatrix_validate(SEXP obj);
34    SEXP dense_nonpacked_validate(SEXP obj);
35    
36  /* enum constants from cblas.h and some short forms */  /* enum constants from cblas.h and some short forms */
37  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
38  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
# Line 34  Line 51 
51  #define LFT CblasLeft  #define LFT CblasLeft
52  #define RGT CblasRight  #define RGT CblasRight
53    
54  char norm_type(char *typstr);  #if !defined(R_VERSION) || R_VERSION < R_Version(2, 7, 0)
55  char rcond_type(char *typstr);  char La_norm_type(const char *typstr);
56    char La_rcond_type(const char *typstr);
57    #endif
58    
59  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
60  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
61  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
62  SEXP get_factors(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
63  SEXP set_factors(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
64    
65    #if 0
66  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);
67  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  #endif  /* unused */
68  void csc_sort_columns(int ncol, const int p[], int i[], double x[]);  
69  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
70                      const int Ti [], const int Tj [], const double Tx [],  /* void csc_sort_columns(int ncol, const int p[], int i[], double x[]); */
71                      char *Rclass);  /* SEXP csc_check_column_sorting(SEXP A); */
 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[]);  
 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);  
72  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
73  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
74  double *packed_to_full(double *dest, const double *src, int n,  Rboolean equal_string_vectors(SEXP s1, SEXP s2);
75                         enum CBLAS_UPLO uplo);  
76  double *full_to_packed(double *dest, const double *src, int n,  void d_packed_getDiag(double *dest, SEXP x, int n);
77                         enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag);  void l_packed_getDiag(   int *dest, SEXP x, int n);
78  double *packed_getDiag(double *dest, SEXP x);  void tr_d_packed_getDiag(double *dest, SEXP x);
79    void tr_l_packed_getDiag(   int *dest, SEXP x);
80    
81    SEXP Matrix_getElement(SEXP list, char *nm);
82    
83    #define PACKED_TO_FULL(TYPE)                                            \
84    TYPE *packed_to_full_ ## TYPE(TYPE *dest, const TYPE *src,              \
85                                 int n, enum CBLAS_UPLO uplo)
86    PACKED_TO_FULL(double);
87    PACKED_TO_FULL(int);
88    #undef PACKED_TO_FULL
89    
90    #define FULL_TO_PACKED(TYPE)                                            \
91    TYPE *full_to_packed_ ## TYPE(TYPE *dest, const TYPE *src, int n,       \
92                                  enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag)
93    FULL_TO_PACKED(double);
94    FULL_TO_PACKED(int);
95    #undef FULL_TO_PACKED
96    
97    
98  extern   /* stored pointers to symbols initialized in R_init_Matrix */  extern   /* stored pointers to symbols initialized in R_init_Matrix */
99  #include "Syms.h"  #include "Syms.h"
# Line 74  Line 104 
104  /* number of elements in one triangle of a square matrix of order n */  /* number of elements in one triangle of a square matrix of order n */
105  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
106    
107    /* duplicate the slot with name given by sym from src to dest */
108    
109    #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
110    
111    /* is not yet used: */
112    #define slot_nonNull_dup(dest, src, sym)                        \
113        if(GET_SLOT(src, sym) != R_NilValue)                        \
114            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
115    
116    /* TODO: Make this faster for the case where dimnames = list(NULL,NULL)
117     *       and hence don't have to be set ! */
118    #define SET_DimNames(dest, src) slot_dup(dest, src, Matrix_DimNamesSym)
119    
120    
121    #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))
122    #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))
123    #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
124    
125    /* should also work for "matrix" matrices: */
126    #define Real_KIND(_x_)  (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
127                             (isReal(_x_) ? 0 : (isLogical(_x_) ? 1 : -1)))
128    /* This one gives '0' also for integer "matrix" :*/
129    #define Real_KIND2(_x_) (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
130                             (isLogical(_x_) ? 1 : 0))
131    
132    /* requires 'x' slot: */
133    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
134                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 : -1))
135    
136    #define DECLARE_AND_GET_X_SLOT(__C_TYPE, __SEXP)        \
137        __C_TYPE *xx = __SEXP(GET_SLOT(x, Matrix_xSym))
138    
139    
140  /**  /**
141   * Check for valid length of a packed triangular array and return the   * Check for valid length of a packed triangular array and return the
142   * corresponding number of columns   * corresponding number of columns
# Line 100  Line 163 
163   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
164   * 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
165   * the slot.   * the slot.
166     * NOTE:  GET_SLOT(x, what)        :== R_do_slot       (x, what)
167     * ----   SET_SLOT(x, what, value) :== R_do_slot_assign(x, what, value)
168     * and the R_do_slot* are in src/main/attrib.c
169   *   *
170   * @param obj object in which to assign the slot   * @param obj object in which to assign the slot
171   * @param nm name of the slot, as an R name object   * @param nm name of the slot, as an R name object
# Line 118  Line 184 
184  }  }
185    
186  /**  /**
187   * 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
188   * in the array mj.   * in the array mj.
189   *   *
190   * @param ncol number of columns   * @param ncol number of columns (or rows)
191   * @param mp column pointer vector of length ncol + 1   * @param mp column pointer vector of length ncol + 1
192   * @param mj vector of length mp[ncol] - 1 to hold the result   * @param mj vector of length mp[ncol] to hold the result
193   *   *
194   * @return mj   * @return mj
195   */   */
196  static R_INLINE  static R_INLINE
197  int* expand_column_pointers(int ncol, const int mp[], int mj[])  int* expand_cmprPt(int ncol, const int mp[], int mj[])
198  {  {
199      int j;      int j;
200      for (j = 0; j < ncol; j++) {      for (j = 0; j < ncol; j++) {
# Line 138  Line 204 
204      return mj;      return mj;
205  }  }
206    
207    void make_d_matrix_triangular(double *x, SEXP from);
208    void make_i_matrix_triangular(   int *x, SEXP from);
209    
210  /**  void make_d_matrix_symmetric(double *to, SEXP from);
211   * 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;  
 }  
212    
213  SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);  SEXP Matrix_expand_pointers(SEXP pP);
214    
215  /**  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
216   * 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;  
 }  
217    
218  /**  SEXP new_dgeMatrix(int nrow, int ncol);
219   * Check for a complete match on matrix dimensions  
220   *  static R_INLINE SEXP
221   * @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[])  
222  {  {
223      return xd[0] == yd[0] && xd[1] == yd[1];      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
224  }  }
225    
226  double *expand_csc_column(double *dest, int m, int j,  static R_INLINE SEXP
227                            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[])  
228  {  {
229      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]];  
230  }  }
231    
232  /**  /**
233   * 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
234     * terminated by an empty string.  Returns -1 for no match.
235     *
236     * @param class string to match
237     * @param valid vector of possible matches terminated by an empty string
238   *   *
239   * @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  
240   */   */
241  static R_INLINE void  static R_INLINE int
242  make_upper_triangular(int i[], int j[], int nnz)  Matrix_check_class(const char *class, char **valid)
243  {  {
244      int k;      int ans;
245      for (k = 0; k < nnz; k++) {      for (ans = 0; ; ans++) {
246          if (i[k] > j[k]) {          if (!strlen(valid[ans])) return -1;
247              int tmp = i[k];          if (!strcmp(class, valid[ans])) return ans;
             i[k] = j[k];  
             j[k] = tmp;  
         }  
248      }      }
249  }  }
250    
 void make_array_triangular(double *x, SEXP from);  
   
251  #ifdef __cplusplus  #ifdef __cplusplus
252  }  }
253  #endif  #endif

Legend:
Removed from v.597  
changed lines
  Added in v.2121

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