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 766, Tue Jun 7 23:03:34 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    
64    
65    extern   /* stored pointers to symbols initialized in R_init_Matrix */
66  #include "Syms.h"  #include "Syms.h"
67    
68  /* zero an array */  /* zero an array */
69  #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;}
70    
71    /* number of elements in one triangle of a square matrix of order n */
72    #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
73    
74    /* duplicate the slot with name given by sym from src to dest */
75    #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
76    
77    /**
78     * Check for valid length of a packed triangular array and return the
79     * corresponding number of columns
80     *
81     * @param len length of a packed triangular array
82     *
83     * @return number of columns
84     */
85    static R_INLINE
86    int packed_ncol(int len)
87    {
88        int disc = 8 * len + 1;     /* discriminant */
89        int sqrtd = (int) sqrt((double) disc);
90    
91        if (len < 0 || disc != sqrtd * sqrtd)
92            error(_("invalid 'len' = %d in packed_ncol"));
93        return (sqrtd - 1)/2;
94    }
95    
96  /**  /**
97   * 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
98   * 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 118 
118  }  }
119    
120  /**  /**
121   * 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
122   * in the array mj.   * in the array mj.
123   *   *
124   * @param ncol number of columns   * @param ncol number of columns (or rows)
125   * @param mp column pointer vector of length ncol + 1   * @param mp column pointer vector of length ncol + 1
126   * @param mj vector of length mp[ncol] - 1 to hold the result   * @param mj vector of length mp[ncol] to hold the result
127   *   *
128   * @return mj   * @return mj
129   */   */
130  static R_INLINE  static R_INLINE
131  int* expand_column_pointers(int ncol, const int mp[], int mj[])  int* expand_cmprPt(int ncol, const int mp[], int mj[])
132  {  {
133      int j;      int j;
134      for (j = 0; j < ncol; j++) {      for (j = 0; j < ncol; j++) {
# Line 159  Line 201 
201  double *expand_csc_column(double *dest, int m, int j,  double *expand_csc_column(double *dest, int m, int j,
202                            const int Ap[], const int Ai[], const double Ax[]);                            const int Ap[], const int Ai[], const double Ax[]);
203    
204    /**
205     * Apply a permutation to an integer vector
206     *
207     * @param i vector of 0-based indices
208     * @param n length of vector i
209     * @param perm 0-based permutation vector of length max(i) + 1
210     */
211    static R_INLINE void
212    int_permute(int i[], int n, const int perm[])
213    {
214        int j;
215        for (j = 0; j < n; j++) i[j] = perm[i[j]];
216    }
217    
218    /**
219     * Force index pairs to be in the upper triangle of a matrix
220     *
221     * @param i vector of 0-based row indices
222     * @param j vector of 0-based column indices
223     * @param nnz length of index vectors
224     */
225    static R_INLINE void
226    make_upper_triangular(int i[], int j[], int nnz)
227    {
228        int k;
229        for (k = 0; k < nnz; k++) {
230            if (i[k] > j[k]) {
231                int tmp = i[k];
232                i[k] = j[k];
233                j[k] = tmp;
234            }
235        }
236    }
237    
238    void make_array_triangular(double *x, SEXP from);
239    
240    SEXP Matrix_expand_pointers(SEXP pP);
241    
242    #ifdef __cplusplus
243    }
244  #endif  #endif
245    
246    #endif /* MATRIX_MUTILS_H_ */

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

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