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 441, Wed Jan 19 11:22:07 2005 UTC revision 592, Thu Mar 3 05:16:50 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    #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
26    #define CMJ CblasColMajor
27    #define NTR CblasNoTrans
28    #define TRN CblasTrans
29    #define CTR CblasConjTrans
30    #define UPP CblasUpper
31    #define LOW CblasLower
32    #define NUN CblasNonUnit
33    #define UNT CblasUnit
34    #define LFT CblasLeft
35    #define RGT CblasRight
36    
37  char norm_type(char *typstr);  char norm_type(char *typstr);
38  char rcond_type(char *typstr);  char rcond_type(char *typstr);
39  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
40  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
41  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
42  SEXP get_factorization(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
43  SEXP set_factorization(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
44  SEXP cscMatrix_set_Dim(SEXP x, int nrow);  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);
45  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  int csc_unsorted_columns(int ncol, const int p[], const int i[]);
46  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[]);
47  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  SEXP triple_as_SEXP(int nrow, int ncol, int nz,
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[]);
# Line 29  Line 57 
57  void nlme_check_Lapack_error(int info, const char *laName);  void nlme_check_Lapack_error(int info, const char *laName);
58  SEXP nlme_replaceSlot(SEXP obj, SEXP names, SEXP value);  SEXP nlme_replaceSlot(SEXP obj, SEXP names, SEXP value);
59  SEXP nlme_weight_matrix_list(SEXP MLin, SEXP wts, SEXP adjst, SEXP MLout);  SEXP nlme_weight_matrix_list(SEXP MLin, SEXP wts, SEXP adjst, SEXP MLout);
60    SEXP Matrix_make_named(int TYP, char **names);
61    SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
62    double *packed_to_full(double *dest, const double *src, int n,
63                           enum CBLAS_UPLO uplo);
64    double *full_to_packed(double *dest, const double *src, int n,
65                           enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag);
66    
67                                  /* stored pointers to symbols */  extern   /* stored pointers to symbols initialized in R_init_Matrix */
                                 /* initialized in R_init_Matrix */  
 extern  
68  #include "Syms.h"  #include "Syms.h"
69    
70  /* zero an array */  /* zero an array */
71  #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;}
72    
73    /**
74     * Allocate an SEXP of given type and length, assign it as slot nm in
75     * the object, and return the SEXP.  The validity of this function
76     * depends on SET_SLOT not duplicating val when NAMED(val) == 0.  If
77     * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
78     * GET_SLOT to ensure that the value returned is indeed the SEXP in
79     * the slot.
80     *
81     * @param obj object in which to assign the slot
82     * @param nm name of the slot, as an R name object
83     * @param type type of SEXP to allocate
84     * @param length length of SEXP to allocate
85     *
86     * @return SEXP of given type and length assigned as slot nm in obj
87     */
88    static R_INLINE
89    SEXP ALLOC_SLOT(SEXP obj, SEXP nm, SEXPTYPE type, int length)
90    {
91        SEXP val = allocVector(type, length);
92    
93        SET_SLOT(obj, nm, val);
94        return val;
95    }
96    
97    /**
98     * Expand the column pointers in the array mp into a full set of column indices
99     * in the array mj.
100     *
101     * @param ncol number of columns
102     * @param mp column pointer vector of length ncol + 1
103     * @param mj vector of length mp[ncol] - 1 to hold the result
104     *
105     * @return mj
106     */
107    static R_INLINE
108    int* expand_column_pointers(int ncol, const int mp[], int mj[])
109    {
110        int j;
111        for (j = 0; j < ncol; j++) {
112            int j2 = mp[j+1], jj;
113            for (jj = mp[j]; jj < j2; jj++) mj[jj] = j;
114        }
115        return mj;
116    }
117    
118    
119    /**
120     * Return the linear index of the (row, col) entry in a csc structure.
121     * If the entry is not found and missing is 0 an error is signaled;
122     * otherwise the missing value is returned.
123     *
124     * @param p vector of column pointers
125     * @param i vector of row indices
126     * @param row row index
127     * @param col column index
128     * @param missing the value to return is the row, col entry does not
129     * exist.  If this is zero and the row, col entry does not exist an
130     * error is signaled.
131     *
132     * @return index of element at (row, col) if it exists, otherwise missing
133     */
134    static R_INLINE int
135    check_csc_index(const int p[], const int i[], int row, int col, int missing)
136    {
137        int k, k2 = p[col + 1];
138                                    /* linear search - perhaps replace by bsearch */
139        for (k = p[col]; k < k2; k++) if (i[k] == row) return k;
140        if (!missing)
141            error("row %d and column %d not defined in rowind and colptr",
142                  row, col);
143        return missing;
144    }
145    
146    SEXP alloc3Darray(SEXPTYPE mode, int nrow, int ncol, int nface);
147    
148    /**
149     * Calculate the zero-based index in a row-wise packed lower triangular matrix.
150     * This is used for the arrays of blocked sparse matrices.
151     *
152     * @param i column number (zero-based)
153     * @param k row number (zero-based)
154     *
155     * @return The index of the (k,i) element of a packed lower triangular matrix
156     */
157    static R_INLINE
158    int Lind(int k, int i)
159    {
160        if (k < i) error("Lind(k = %d, i = %d) must have k >= i", k, i);
161        return (k * (k + 1))/2 + i;
162    }
163    
164    /**
165     * Check for a complete match on matrix dimensions
166     *
167     * @param xd dimensions of first matrix
168     * @param yd dimensions of second matrix
169     *
170     * @return 1 if dimensions match, otherwise 0
171     */
172    static R_INLINE
173    int match_mat_dims(const int xd[], const int yd[])
174    {
175        return xd[0] == yd[0] && xd[1] == yd[1];
176    }
177    
178    double *expand_csc_column(double *dest, int m, int j,
179                              const int Ap[], const int Ai[], const double Ax[]);
180    
181    /**
182     * Apply a permutation to an integer vector
183     *
184     * @param i vector of 0-based indices
185     * @param n length of vector i
186     * @param perm 0-based permutation vector of length max(i) + 1
187     */
188    static R_INLINE void
189    int_permute(int i[], int n, const int perm[])
190    {
191        int j;
192        for (j = 0; j < n; j++) i[j] = perm[i[j]];
193    }
194    
195    /**
196     * Force index pairs to be in the upper triangle of a matrix
197     *
198     * @param i vector of 0-based row indices
199     * @param j vector of 0-based column indices
200     * @param nnz length of index vectors
201     */
202    static R_INLINE void
203    make_upper_triangular(int i[], int j[], int nnz)
204    {
205        int k;
206        for (k = 0; k < nnz; k++) {
207            if (i[k] > j[k]) {
208                int tmp = i[k];
209                i[k] = j[k];
210                j[k] = tmp;
211            }
212        }
213    }
214    
215    void make_array_triangular(double *x, SEXP from);
216    
217    #ifdef __cplusplus
218    }
219  #endif  #endif
220    
221    #endif /* MATRIX_MUTILS_H_ */

Legend:
Removed from v.441  
changed lines
  Added in v.592

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