SCM

SCM Repository

[matrix] Diff of /pkg/Matrix/src/Mutils.h
ViewVC logotype

Diff of /pkg/Matrix/src/Mutils.h

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

pkg/src/Mutils.h revision 1432, Thu Aug 24 16:21:18 2006 UTC pkg/Matrix/src/Mutils.h revision 2850, Mon Oct 22 13:00:35 2012 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    #undef Matrix_with_SPQR
5    
6  #ifdef __cplusplus  #ifdef __cplusplus
7  extern "C" {  extern "C" {
8  #endif  #endif
9    
10  #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */  #include <stdint.h> // C99 for int64_t
11    #include <ctype.h>
12  #include <R.h>  /* includes Rconfig.h */  #include <R.h>  /* includes Rconfig.h */
13    #include <Rversion.h>
14    #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */
15    
16  #ifdef ENABLE_NLS  #ifdef ENABLE_NLS
17  #include <libintl.h>  #include <libintl.h>
18  #define _(String) dgettext ("Matrix", String)  #define _(String) dgettext ("Matrix", String)
19  #else  #else
20  #define _(String) (String)  #define _(String) (String)
21    /* Note that this is not yet supported (for Windows, e.g.) in R 2.9.0 : */
22    #define dngettext(pkg, String, StringP, N) (N > 1 ? StringP : String)
23    #endif
24    
25    #ifdef __GNUC__
26    # undef alloca
27    # define alloca(x) __builtin_alloca((x))
28    #elif defined(__sun) || defined(_AIX)
29    /* this is necessary (and sufficient) for Solaris 10 and AIX 6: */
30    # include <alloca.h>
31  #endif  #endif
32    
33    #ifndef LONG_VECTOR_SUPPORT
34    // notably for  R <= 2.15.x :
35    # define XLENGTH(x) LENGTH(x)
36    # if R_VERSION < R_Version(2,16,0)
37      typedef int R_xlen_t;
38    # endif
39    #endif
40    
41    #define Alloca(n, t)   (t *) alloca( (size_t) ( (n) * sizeof(t) ) )
42    
43  SEXP triangularMatrix_validate(SEXP obj);  SEXP triangularMatrix_validate(SEXP obj);
44  SEXP symmetricMatrix_validate(SEXP obj);  SEXP symmetricMatrix_validate(SEXP obj);
45  SEXP dense_nonpacked_validate(SEXP obj);  SEXP dense_nonpacked_validate(SEXP obj);
46    
47    // La_norm_type() & La_rcond_type()  have been in R_ext/Lapack.h
48    //  but have still not been available to package writers ...
49    char La_norm_type (const char *typstr);
50    char La_rcond_type(const char *typstr);
51    
52  /* enum constants from cblas.h and some short forms */  /* enum constants from cblas.h and some short forms */
53  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};  enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
54  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};  enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
# Line 37  Line 67 
67  #define LFT CblasLeft  #define LFT CblasLeft
68  #define RGT CblasRight  #define RGT CblasRight
69    
 char norm_type(char *typstr);  
 char rcond_type(char *typstr);  
70  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
71  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
72  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
73  SEXP get_factors(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
74  SEXP set_factors(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
75    
76    #if 0
77  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);
78  char uplo_value(SEXP x);  #endif  /* unused */
79  char diag_value(SEXP x);  
80    /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
81    /* void csc_sort_columns(int ncol, const int p[], int i[], double x[]); */
82    /* SEXP csc_check_column_sorting(SEXP A); */
83    
 int csc_unsorted_columns(int ncol, const int p[], const int i[]);  
 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);  
 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[]);  
 SEXP Matrix_make_named(int TYP, char **names);  
84  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
85  double *packed_getDiag(double *dest, SEXP x);  Rboolean equal_string_vectors(SEXP s1, SEXP s2);
86    
87    void d_packed_getDiag(double *dest, SEXP x, int n);
88    void l_packed_getDiag(   int *dest, SEXP x, int n);
89    SEXP d_packed_setDiag(double *diag, int l_d, SEXP x, int n);
90    SEXP l_packed_setDiag(   int *diag, int l_d, SEXP x, int n);
91    SEXP d_packed_addDiag(double *diag, int l_d, SEXP x, int n);
92    
93    void tr_d_packed_getDiag(double *dest, SEXP x, int n);
94    void tr_l_packed_getDiag(   int *dest, SEXP x, int n);
95    
96    SEXP tr_d_packed_setDiag(double *diag, int l_d, SEXP x, int n);
97    SEXP tr_l_packed_setDiag(   int *diag, int l_d, SEXP x, int n);
98    SEXP tr_d_packed_addDiag(double *diag, int l_d, SEXP x, int n);
99    
100  SEXP Matrix_getElement(SEXP list, char *nm);  SEXP Matrix_getElement(SEXP list, char *nm);
101    
102  #define PACKED_TO_FULL(TYPE)                                            \  #define PACKED_TO_FULL(TYPE)                                            \
# Line 89  Line 124 
124  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2  #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
125    
126  /* duplicate the slot with name given by sym from src to dest */  /* duplicate the slot with name given by sym from src to dest */
127    
128  #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)))
129    
130    /* is not yet used: */
131    #define slot_nonNull_dup(dest, src, sym)                        \
132        if(GET_SLOT(src, sym) != R_NilValue)                        \
133            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
134    
135    #define slot_dup_if_has(dest, src, sym)                         \
136        if(R_has_slot(src, sym))                                    \
137            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
138    
139    /* TODO: Make this faster for the case where dimnames = list(NULL,NULL)
140     *       and hence don't have to be set ! */
141    #define SET_DimNames(dest, src) slot_dup(dest, src, Matrix_DimNamesSym)
142    
143    
144  #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))
145  #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))
146    #define Diag_P(_x_) (R_has_slot(x, Matrix_diagSym) ?                    \
147                         CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0)) : " ")
148    #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
149    
150    
151    // Define this "Cholmod compatible" to some degree
152    enum x_slot_kind {x_pattern=-1, x_double=0, x_logical=1, x_integer=2, x_complex=3};
153    //                  n             d           l            i            z
154    
155    /* should also work for "matrix" matrices: */
156    #define Real_KIND(_x_)  (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
157                             (isReal(_x_) ? x_double : (isLogical(_x_) ? x_logical : -1)))
158    /* This one gives '0' also for integer "matrix" :*/
159    #define Real_KIND2(_x_) (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
160                             (isLogical(_x_) ? x_logical : 0))
161    
162    /* requires 'x' slot: */
163    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
164                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 : -1))
165    
166    #define DECLARE_AND_GET_X_SLOT(__C_TYPE, __SEXP)        \
167        __C_TYPE *xx = __SEXP(GET_SLOT(x, Matrix_xSym))
168    
169    
170  /**  /**
# Line 121  Line 193 
193   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by   * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
194   * 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
195   * the slot.   * the slot.
196     * NOTE:  GET_SLOT(x, what)        :== R_do_slot       (x, what)
197     * ----   SET_SLOT(x, what, value) :== R_do_slot_assign(x, what, value)
198     * and the R_do_slot* are in src/main/attrib.c
199   *   *
200   * @param obj object in which to assign the slot   * @param obj object in which to assign the slot
201   * @param nm name of the slot, as an R name object   * @param nm name of the slot, as an R name object
# Line 159  Line 234 
234      return mj;      return mj;
235  }  }
236    
   
237  /**  /**
238   * Return the linear index of the (row, col) entry in a csc structure.   * Check if slot(obj, "x") contains any NA (or NaN).
  * If the entry is not found and missing is 0 an error is signaled;  
  * otherwise the missing value is returned.  
239   *   *
240   * @param p vector of column pointers   * @param obj   a 'Matrix' object with a (double precision) 'x' slot.
  * @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.  
241   *   *
242   * @return index of element at (row, col) if it exists, otherwise missing   * @return Rboolean :== any(is.na(slot(obj, "x") )
  */  
 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);  
   
 /**  
  * 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  
243   */   */
244  static R_INLINE  static R_INLINE
245  int Lind(int k, int i)  Rboolean any_NA_in_x(SEXP obj)
 {  
     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];  
 }  
   
 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[])  
246  {  {
247      int j;      double *x = REAL(GET_SLOT(obj, Matrix_xSym));
248      for (j = 0; j < n; j++) i[j] = perm[i[j]];      int i, n = LENGTH(GET_SLOT(obj, Matrix_xSym));
249        for(i=0; i < n; i++)
250            if(ISNAN(x[i])) return TRUE;
251        /* else */
252        return FALSE;
253  }  }
254    
255  /**  SEXP Mmatrix(SEXP args);
  * 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;  
         }  
     }  
 }  
256    
257  void make_d_matrix_triangular(double *x, SEXP from);  void make_d_matrix_triangular(double *x, SEXP from);
258  void make_i_matrix_triangular(   int *x, SEXP from);  void make_i_matrix_triangular(   int *x, SEXP from);
# Line 264  Line 262 
262    
263  SEXP Matrix_expand_pointers(SEXP pP);  SEXP Matrix_expand_pointers(SEXP pP);
264    
265    SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
266    SEXP dup_mMatrix_as_geMatrix (SEXP A);
267    
268  /**  SEXP new_dgeMatrix(int nrow, int ncol);
269   * Elementwise increment dest by src  SEXP m_encodeInd (SEXP ij, SEXP di, SEXP chk_bnds);
270   *  SEXP m_encodeInd2(SEXP i, SEXP j, SEXP di, SEXP chk_bnds);
  * @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;  
 }  
271    
272  /**  
273   * Elementwise sum of src1 and src2 into dest  static R_INLINE SEXP
274   *  mMatrix_as_dgeMatrix(SEXP A)
275   * @param dest vector to be incremented  {
276   * @param src1 vector to be added      return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
  * @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;  
277  }  }
278    
279  SEXP alloc_real_classed_matrix(char *class, int nrow, int ncol);  static R_INLINE SEXP
280  SEXP alloc_dgeMatrix(int m, int n, SEXP rownms, SEXP colnms);  mMatrix_as_geMatrix(SEXP A)
281  SEXP alloc_dpoMatrix(int n, char *uplo, SEXP rownms, SEXP colnms);  {
282  SEXP alloc_dtrMatrix(int n, char *uplo, char *diag, SEXP rownms, SEXP colnms);      return strcmp(class_P(A) + 1, "geMatrix") ? dup_mMatrix_as_geMatrix(A) : A;
283  SEXP alloc_dsCMatrix(int n, int nz, char *uplo, SEXP rownms, SEXP colnms);  }
284    
285  SEXP dup_mMatrix_as_dgeMatrix(SEXP A);  // Keep centralized --- *and* in sync with ../inst/include/Matrix.h :
286    #define MATRIX_VALID_dense                      \
287            "dmatrix", "dgeMatrix",                 \
288            "lmatrix", "lgeMatrix",                 \
289            "nmatrix", "ngeMatrix",                 \
290            "zmatrix", "zgeMatrix"
291    
292    #define MATRIX_VALID_Csparse                    \
293     "dgCMatrix", "dsCMatrix", "dtCMatrix",         \
294     "lgCMatrix", "lsCMatrix", "ltCMatrix",         \
295     "ngCMatrix", "nsCMatrix", "ntCMatrix",         \
296     "zgCMatrix", "zsCMatrix", "ztCMatrix"
297    
298    #define MATRIX_VALID_Tsparse                    \
299     "dgTMatrix", "dsTMatrix", "dtTMatrix",         \
300     "lgTMatrix", "lsTMatrix", "ltTMatrix",         \
301     "ngTMatrix", "nsTMatrix", "ntTMatrix",         \
302     "zgTMatrix", "zsTMatrix", "ztTMatrix"
303    
304    #define MATRIX_VALID_Rsparse                    \
305     "dgRMatrix", "dsRMatrix", "dtRMatrix",         \
306     "lgRMatrix", "lsRMatrix", "ltRMatrix",         \
307     "ngRMatrix", "nsRMatrix", "ntRMatrix",         \
308     "zgRMatrix", "zsRMatrix", "ztRMatrix"
309    
310    #define MATRIX_VALID_CHMfactor "dCHMsuper", "dCHMsimpl", "nCHMsuper", "nCHMsimpl"
311    
312  /**  /**
313   * 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
314   * terminated by an empty string.  Returns -1 for no match.   * terminated by an empty string.  Returns -1 for no match.
315   *   *
316   * @param dest class string to match   * @param class string to match
317   * @param valid vector of possible matches terminated by an empty string   * @param valid vector of possible matches terminated by an empty string
318   *   *
319   * @return index of match or -1 for no match   * @return index of match or -1 for no match
320   */   */
321  static R_INLINE int  static R_INLINE int
322  Matrix_check_class(char *class, char **valid)  Matrix_check_class(char *class, const char **valid)
323  {  {
324      int ans;      int ans;
325      for (ans = 0; ; ans++) {      for (ans = 0; ; ans++) {
# Line 327  Line 328 
328      }      }
329  }  }
330    
331    /**
332     * These are the ones "everyone" should use -- is() versions, also looking
333     * at super classes:
334     */
335    # define Matrix_check_class_etc R_check_class_etc
336    # define Matrix_check_class_and_super R_check_class_and_super
337    
338    /** Accessing  *sparseVectors :  fast (and recycling)  v[i] for v = ?sparseVector:
339     * -> ./sparseVector.c  -> ./t_sparseVector.c :
340     */
341    // Type_ans sparseVector_sub(int64_t i, int nnz_v, int* v_i, Type_ans* v_x, int len_v):
342    
343    /* Define all of
344     *  dsparseVector_sub(....)
345     *  isparseVector_sub(....)
346     *  lsparseVector_sub(....)
347     *  nsparseVector_sub(....)
348     *  zsparseVector_sub(....)
349     */
350    #define _dspV_
351    #include "t_sparseVector.c"
352    
353    #define _ispV_
354    #include "t_sparseVector.c"
355    
356    #define _lspV_
357    #include "t_sparseVector.c"
358    
359    #define _nspV_
360    #include "t_sparseVector.c"
361    
362    #define _zspV_
363    #include "t_sparseVector.c"
364    
365    
366  #ifdef __cplusplus  #ifdef __cplusplus
367  }  }
368  #endif  #endif

Legend:
Removed from v.1432  
changed lines
  Added in v.2850

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