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 565, Tue Feb 22 01:15:45 2005 UTC revision 862, Thu Aug 18 21:31:07 2005 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    #ifdef __cplusplus
5    extern "C" {
6    #endif
7    
8  #include <Rdefines.h>  #include <Rdefines.h>
9  #include <Rconfig.h>  #include <Rconfig.h>
10  #include "cblas.h"  #include <R.h>  /* to include Rconfig.h */
11    
12  /* short forms of some enum constants from cblas.h */  #ifdef ENABLE_NLS
13    #include <libintl.h>
14    #define _(String) dgettext ("Matrix", String)
15    #else
16    #define _(String) (String)
17    #endif
18    
19    /* enum constants from cblas.h and some short forms */
20    enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
21    enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
22    enum CBLAS_UPLO {CblasUpper=121, CblasLower=122};
23    enum CBLAS_DIAG {CblasNonUnit=131, CblasUnit=132};
24    enum CBLAS_SIDE {CblasLeft=141, CblasRight=142};
25  #define RMJ CblasRowMajor  #define RMJ CblasRowMajor
26  #define CMJ CblasColMajor  #define CMJ CblasColMajor
27  #define NTR CblasNoTrans  #define NTR CblasNoTrans
# Line 32  Line 48 
48                      const int Ti [], const int Tj [], const double Tx [],                      const int Ti [], const int Tj [], const double Tx [],
49                      char *Rclass);                      char *Rclass);
50  SEXP csc_check_column_sorting(SEXP A);  SEXP csc_check_column_sorting(SEXP A);
51  void csc_components_transpose(int m, int n, int nnz,  void csc_compTr(int m, int n, int nnz,
52                                const int xp[], const int xi[],                  const int xp[], const int xi[], const double xx[],
                               const double xx[],  
53                                int ap[], int ai[], double ax[]);                                int ap[], int ai[], double ax[]);
54  void ssc_symbolic_permute(int n, int upper, const int perm[],  void ssc_symbolic_permute(int n, int upper, const int perm[],
55                            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);  
56  SEXP Matrix_make_named(int TYP, char **names);  SEXP Matrix_make_named(int TYP, char **names);
57                                  /* stored pointers to symbols */  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
58                                  /* initialized in R_init_Matrix */  double *packed_to_full(double *dest, const double *src, int n,
59  extern                         enum CBLAS_UPLO uplo);
60    double *full_to_packed(double *dest, const double *src, int n,
61                           enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag);
62    double *packed_getDiag(double *dest, SEXP x);
63    SEXP Matrix_getElement(SEXP list, char *nm);
64    
65    
66    extern   /* stored pointers to symbols initialized in R_init_Matrix */
67  #include "Syms.h"  #include "Syms.h"
68    
69  /* zero an array */  /* zero an array */
70  #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;}
71    
72    /* number of elements in one triangle of a square matrix of order n */
73    #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
74    
75    /* duplicate the slot with name given by sym from src to dest */
76    #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
77    
78    /**
79     * Check for valid length of a packed triangular array and return the
80     * corresponding number of columns
81     *
82     * @param len length of a packed triangular array
83     *
84     * @return number of columns
85     */
86    static R_INLINE
87    int packed_ncol(int len)
88    {
89        int disc = 8 * len + 1;     /* discriminant */
90        int sqrtd = (int) sqrt((double) disc);
91    
92        if (len < 0 || disc != sqrtd * sqrtd)
93            error(_("invalid 'len' = %d in packed_ncol"));
94        return (sqrtd - 1)/2;
95    }
96    
97  /**  /**
98   * 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
99   * 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 119 
119  }  }
120    
121  /**  /**
122   * 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
123   * in the array mj.   * in the array mj.
124   *   *
125   * @param ncol number of columns   * @param ncol number of columns (or rows)
126   * @param mp column pointer vector of length ncol + 1   * @param mp column pointer vector of length ncol + 1
127   * @param mj vector of length mp[ncol] - 1 to hold the result   * @param mj vector of length mp[ncol] to hold the result
128   *   *
129   * @return mj   * @return mj
130   */   */
131  static R_INLINE  static R_INLINE
132  int* expand_column_pointers(int ncol, const int mp[], int mj[])  int* expand_cmprPt(int ncol, const int mp[], int mj[])
133  {  {
134      int j;      int j;
135      for (j = 0; j < ncol; j++) {      for (j = 0; j < ncol; j++) {
# Line 159  Line 202 
202  double *expand_csc_column(double *dest, int m, int j,  double *expand_csc_column(double *dest, int m, int j,
203                            const int Ap[], const int Ai[], const double Ax[]);                            const int Ap[], const int Ai[], const double Ax[]);
204    
 #endif  
   
   
205  /**  /**
206   * Apply a permutation to an integer vector   * Apply a permutation to an integer vector
207   *   *
# Line 195  Line 235 
235          }          }
236      }      }
237  }  }
238    
239    void make_array_triangular(double *x, SEXP from);
240    
241    SEXP Matrix_expand_pointers(SEXP pP);
242    
243    
244    /**
245     * Elementwise increment dest by src
246     *
247     * @param dest vector to be incremented
248     * @param src vector to be added to dest
249     * @param n length of vectors
250     *
251     * @return dest
252     */
253    static R_INLINE double*
254    vecIncrement(double dest[], const double src[], int n) {
255        int i;
256        for (i = 0; i < n; i++) dest[i] += src[i];
257        return dest;
258    }
259    
260    /**
261     * Elementwise sum of src1 and src2 into dest
262     *
263     * @param dest vector to be incremented
264     * @param src1 vector to be added
265     * @param src1 second vector to be added
266     * @param n length of vectors
267     *
268     * @return dest
269     */
270    static R_INLINE double*
271    vecSum(double dest[], const double src1[], const double src2[],
272           int n) {
273        int i;
274        for (i = 0; i < n; i++) dest[i] = src1[i] + src2[i];
275        return dest;
276    }
277    
278    #ifdef __cplusplus
279    }
280    #endif
281    
282    #endif /* MATRIX_MUTILS_H_ */

Legend:
Removed from v.565  
changed lines
  Added in v.862

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