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 536, Thu Feb 10 08:15:12 2005 UTC revision 1441, Thu Aug 24 21:59:49 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    char uplo_value(SEXP x);
49    char diag_value(SEXP x);
50    
51  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  int csc_unsorted_columns(int ncol, const int p[], const int i[]);
52  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[]);
53  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  /* SEXP triple_as_SEXP(int nrow, int ncol, int nz, */
54                      const int Ti [], const int Tj [], const double Tx [],  /*                  const int Ti [], const int Tj [], const double Tx [], */
55                      char *Rclass);  /*                  char *Rclass); */
56  SEXP csc_check_column_sorting(SEXP A);  SEXP csc_check_column_sorting(SEXP A);
57  void csc_components_transpose(int m, int n, int nnz,  /* void csc_compTr(int m, int n, int nnz, */
58                                const int xp[], const int xi[],  /*              const int xp[], const int xi[], const double xx[], */
59                                const double xx[],  /*              int ap[], int ai[], double ax[]); */
60                                int ap[], int ai[], double ax[]);  /* void ssc_symbolic_permute(int n, int upper, const int perm[], */
61  void ssc_symbolic_permute(int n, int upper, const int perm[],  /*                        int Ap[], int Ai[]); */
                           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);  
62  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
63                                  /* stored pointers to symbols */  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
64                                  /* initialized in R_init_Matrix */  double *packed_getDiag(double *dest, SEXP x);
65  extern  SEXP Matrix_getElement(SEXP list, char *nm);
66    
67    #define PACKED_TO_FULL(TYPE)                                            \
68    TYPE *packed_to_full_ ## TYPE(TYPE *dest, const TYPE *src,              \
69                                 int n, enum CBLAS_UPLO uplo)
70    PACKED_TO_FULL(double);
71    PACKED_TO_FULL(int);
72    #undef PACKED_TO_FULL
73    
74    #define FULL_TO_PACKED(TYPE)                                            \
75    TYPE *full_to_packed_ ## TYPE(TYPE *dest, const TYPE *src, int n,       \
76                                  enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag)
77    FULL_TO_PACKED(double);
78    FULL_TO_PACKED(int);
79    #undef FULL_TO_PACKED
80    
81    
82    extern   /* stored pointers to symbols initialized in R_init_Matrix */
83  #include "Syms.h"  #include "Syms.h"
84    
85  /* zero an array */  /* zero an array */
86  #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;}
87    
88    /* number of elements in one triangle of a square matrix of order n */
89    #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
90    
91    /* duplicate the slot with name given by sym from src to dest */
92    #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
93    
94    #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))
95    #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))
96    
97    
98    /**
99     * Check for valid length of a packed triangular array and return the
100     * corresponding number of columns
101     *
102     * @param len length of a packed triangular array
103     *
104     * @return number of columns
105     */
106    static R_INLINE
107    int packed_ncol(int len)
108    {
109        int disc = 8 * len + 1;     /* discriminant */
110        int sqrtd = (int) sqrt((double) disc);
111    
112        if (len < 0 || disc != sqrtd * sqrtd)
113            error(_("invalid 'len' = %d in packed_ncol"));
114        return (sqrtd - 1)/2;
115    }
116    
117  /**  /**
118   * 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
119   * 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 139 
139  }  }
140    
141  /**  /**
142   * 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
143   * in the array mj.   * in the array mj.
144   *   *
145   * @param ncol number of columns   * @param ncol number of columns (or rows)
146   * @param mp column pointer vector of length ncol + 1   * @param mp column pointer vector of length ncol + 1
147   * @param mj vector of length mp[ncol] - 1 to hold the result   * @param mj vector of length mp[ncol] to hold the result
148   *   *
149   * @return mj   * @return mj
150   */   */
151  static R_INLINE  static R_INLINE
152  int* expand_column_pointers(int ncol, const int mp[], int mj[])  int* expand_cmprPt(int ncol, const int mp[], int mj[])
153  {  {
154      int j;      int j;
155      for (j = 0; j < ncol; j++) {      for (j = 0; j < ncol; j++) {
# Line 159  Line 222 
222  double *expand_csc_column(double *dest, int m, int j,  double *expand_csc_column(double *dest, int m, int j,
223                            const int Ap[], const int Ai[], const double Ax[]);                            const int Ap[], const int Ai[], const double Ax[]);
224    
225    /**
226     * Apply a permutation to an integer vector
227     *
228     * @param i vector of 0-based indices
229     * @param n length of vector i
230     * @param perm 0-based permutation vector of length max(i) + 1
231     */
232    static R_INLINE void
233    int_permute(int i[], int n, const int perm[])
234    {
235        int j;
236        for (j = 0; j < n; j++) i[j] = perm[i[j]];
237    }
238    
239    /**
240     * Force index pairs to be in the upper triangle of a matrix
241     *
242     * @param i vector of 0-based row indices
243     * @param j vector of 0-based column indices
244     * @param nnz length of index vectors
245     */
246    static R_INLINE void
247    make_upper_triangular(int i[], int j[], int nnz)
248    {
249        int k;
250        for (k = 0; k < nnz; k++) {
251            if (i[k] > j[k]) {
252                int tmp = i[k];
253                i[k] = j[k];
254                j[k] = tmp;
255            }
256        }
257    }
258    
259    void make_d_matrix_triangular(double *x, SEXP from);
260    void make_i_matrix_triangular(   int *x, SEXP from);
261    
262    void make_d_matrix_symmetric(double *to, SEXP from);
263    void make_i_matrix_symmetric(   int *to, SEXP from);
264    
265    SEXP Matrix_expand_pointers(SEXP pP);
266    
267    
268    /**
269     * Elementwise increment dest by src
270     *
271     * @param dest vector to be incremented
272     * @param src vector to be added to dest
273     * @param n length of vectors
274     *
275     * @return dest
276     */
277    static R_INLINE double*
278    vecIncrement(double dest[], const double src[], int n) {
279        int i;
280        for (i = 0; i < n; i++) dest[i] += src[i];
281        return dest;
282    }
283    
284    /**
285     * Elementwise sum of src1 and src2 into dest
286     *
287     * @param dest vector to be incremented
288     * @param src1 vector to be added
289     * @param src1 second vector to be added
290     * @param n length of vectors
291     *
292     * @return dest
293     */
294    static R_INLINE double*
295    vecSum(double dest[], const double src1[], const double src2[],
296           int n) {
297        int i;
298        for (i = 0; i < n; i++) dest[i] = src1[i] + src2[i];
299        return dest;
300    }
301    
302    SEXP alloc_real_classed_matrix(char *class, int nrow, int ncol);
303    SEXP alloc_dgeMatrix(int m, int n, SEXP rownms, SEXP colnms);
304    SEXP alloc_dpoMatrix(int n, char *uplo, SEXP rownms, SEXP colnms);
305    SEXP alloc_dtrMatrix(int n, char *uplo, char *diag, SEXP rownms, SEXP colnms);
306    SEXP alloc_dsCMatrix(int n, int nz, char *uplo, SEXP rownms, SEXP colnms);
307    
308    SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
309    
310    
311    /**
312     * Return the 0-based index of a string match in a vector of strings
313     * terminated by an empty string.  Returns -1 for no match.
314     *
315     * @param dest class string to match
316     * @param valid vector of possible matches terminated by an empty string
317     *
318     * @return index of match or -1 for no match
319     */
320    static R_INLINE int
321    Matrix_check_class(char *class, char **valid)
322    {
323        int ans;
324        for (ans = 0; ; ans++) {
325            if (!strlen(valid[ans])) return -1;
326            if (!strcmp(class, valid[ans])) return ans;
327        }
328    }
329    
330    #ifdef __cplusplus
331    }
332  #endif  #endif
333    
334    #endif /* MATRIX_MUTILS_H_ */

Legend:
Removed from v.536  
changed lines
  Added in v.1441

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