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 412, Tue Dec 28 15:06:55 2004 UTC pkg/Matrix/src/Mutils.h revision 2811, Mon Jul 16 15:50:31 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  #include <Rdefines.h>  #undef Matrix_with_SPQR
5  #include <Rconfig.h>  
6    #ifdef __cplusplus
7    extern "C" {
8    #endif
9    
10    #include <stdint.h> // C99 for int64_t
11    #include <ctype.h>
12    #include <R.h>  /* includes Rconfig.h */
13    #include <Rversion.h>
14    #include <Rdefines.h> /* Rinternals.h + GET_SLOT etc */
15    
16    #ifdef ENABLE_NLS
17    #include <libintl.h>
18    #define _(String) dgettext ("Matrix", String)
19    #else
20    #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
32    
33    #define Alloca(n, t)   (t *) alloca( (size_t) ( (n) * sizeof(t) ) )
34    
35    SEXP triangularMatrix_validate(SEXP obj);
36    SEXP symmetricMatrix_validate(SEXP obj);
37    SEXP dense_nonpacked_validate(SEXP obj);
38    
39    /* enum constants from cblas.h and some short forms */
40    enum CBLAS_ORDER {CblasRowMajor=101, CblasColMajor=102};
41    enum CBLAS_TRANSPOSE {CblasNoTrans=111, CblasTrans=112, CblasConjTrans=113};
42    enum CBLAS_UPLO {CblasUpper=121, CblasLower=122};
43    enum CBLAS_DIAG {CblasNonUnit=131, CblasUnit=132};
44    enum CBLAS_SIDE {CblasLeft=141, CblasRight=142};
45    #define RMJ CblasRowMajor
46    #define CMJ CblasColMajor
47    #define NTR CblasNoTrans
48    #define TRN CblasTrans
49    #define CTR CblasConjTrans
50    #define UPP CblasUpper
51    #define LOW CblasLower
52    #define NUN CblasNonUnit
53    #define UNT CblasUnit
54    #define LFT CblasLeft
55    #define RGT CblasRight
56    
 char norm_type(char *typstr);  
 char rcond_type(char *typstr);  
57  double get_double_by_name(SEXP obj, char *nm);  double get_double_by_name(SEXP obj, char *nm);
58  SEXP set_double_by_name(SEXP obj, double val, char *nm);  SEXP set_double_by_name(SEXP obj, double val, char *nm);
59  SEXP as_det_obj(double val, int log, int sign);  SEXP as_det_obj(double val, int log, int sign);
60  SEXP get_factorization(SEXP obj, char *nm);  SEXP get_factors(SEXP obj, char *nm);
61  SEXP set_factorization(SEXP obj, SEXP val, char *nm);  SEXP set_factors(SEXP obj, SEXP val, char *nm);
62  SEXP cscMatrix_set_Dim(SEXP x, int nrow);  
63  int csc_unsorted_columns(int ncol, const int p[], const int i[]);  #if 0
64  void csc_sort_columns(int ncol, const int p[], int i[], double x[]);  SEXP dgCMatrix_set_Dim(SEXP x, int nrow);
65  SEXP triple_as_SEXP(int nrow, int ncol, int nz,  #endif  /* unused */
66                      const int Ti [], const int Tj [], const double Tx [],  
67                      char *Rclass);  /* int csc_unsorted_columns(int ncol, const int p[], const int i[]); */
68  SEXP csc_check_column_sorting(SEXP A);  /* void csc_sort_columns(int ncol, const int p[], int i[], double x[]); */
69  void csc_components_transpose(int m, int n, int nnz,  /* SEXP csc_check_column_sorting(SEXP A); */
70                                const int xp[], const int xi[],  
71                                const double xx[],  SEXP check_scalar_string(SEXP sP, char *vals, char *nm);
72                                int ap[], int ai[], double ax[]);  Rboolean equal_string_vectors(SEXP s1, SEXP s2);
73  void ssc_symbolic_permute(int n, int upper, const int perm[],  
74                            int Ap[], int Ai[]);  void d_packed_getDiag(double *dest, SEXP x, int n);
75  double *nlme_symmetrize(double *a, const int nc);  void l_packed_getDiag(   int *dest, SEXP x, int n);
76  void nlme_check_Lapack_error(int info, const char *laName);  SEXP d_packed_setDiag(double *diag, int l_d, SEXP x, int n);
77  SEXP nlme_replaceSlot(SEXP obj, SEXP names, SEXP value);  SEXP l_packed_setDiag(   int *diag, int l_d, SEXP x, int n);
78  SEXP nlme_weight_matrix_list(SEXP MLin, SEXP wts, SEXP adjst, SEXP MLout);  SEXP d_packed_addDiag(double *diag, int l_d, SEXP x, int n);
79    
80                                  /* stored pointers to symbols */  void tr_d_packed_getDiag(double *dest, SEXP x, int n);
81                                  /* initialized in R_init_Matrix */  void tr_l_packed_getDiag(   int *dest, SEXP x, int n);
82  extern  
83    SEXP tr_d_packed_setDiag(double *diag, int l_d, SEXP x, int n);
84    SEXP tr_l_packed_setDiag(   int *diag, int l_d, SEXP x, int n);
85    SEXP tr_d_packed_addDiag(double *diag, int l_d, SEXP x, int n);
86    
87    SEXP Matrix_getElement(SEXP list, char *nm);
88    
89    #define PACKED_TO_FULL(TYPE)                                            \
90    TYPE *packed_to_full_ ## TYPE(TYPE *dest, const TYPE *src,              \
91                                 int n, enum CBLAS_UPLO uplo)
92    PACKED_TO_FULL(double);
93    PACKED_TO_FULL(int);
94    #undef PACKED_TO_FULL
95    
96    #define FULL_TO_PACKED(TYPE)                                            \
97    TYPE *full_to_packed_ ## TYPE(TYPE *dest, const TYPE *src, int n,       \
98                                  enum CBLAS_UPLO uplo, enum CBLAS_DIAG diag)
99    FULL_TO_PACKED(double);
100    FULL_TO_PACKED(int);
101    #undef FULL_TO_PACKED
102    
103    
104    extern   /* stored pointers to symbols initialized in R_init_Matrix */
105  #include "Syms.h"  #include "Syms.h"
106    
107    /* zero an array */
108    #define AZERO(x, n) {int _I_, _SZ_ = (n); for(_I_ = 0; _I_ < _SZ_; _I_++) (x)[_I_] = 0;}
109    
110    /* number of elements in one triangle of a square matrix of order n */
111    #define PACKED_LENGTH(n)   ((n) * ((n) + 1))/2
112    
113    /* duplicate the slot with name given by sym from src to dest */
114    
115    #define slot_dup(dest, src, sym)  SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
116    
117    /* is not yet used: */
118    #define slot_nonNull_dup(dest, src, sym)                        \
119        if(GET_SLOT(src, sym) != R_NilValue)                        \
120            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
121    
122    #define slot_dup_if_has(dest, src, sym)                         \
123        if(R_has_slot(src, sym))                                    \
124            SET_SLOT(dest, sym, duplicate(GET_SLOT(src, sym)))
125    
126    /* TODO: Make this faster for the case where dimnames = list(NULL,NULL)
127     *       and hence don't have to be set ! */
128    #define SET_DimNames(dest, src) slot_dup(dest, src, Matrix_DimNamesSym)
129    
130    
131    #define uplo_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_uploSym), 0))
132    #define diag_P(_x_) CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0))
133    #define Diag_P(_x_) (R_has_slot(x, Matrix_diagSym) ?                    \
134                         CHAR(STRING_ELT(GET_SLOT(_x_, Matrix_diagSym), 0)) : " ")
135    #define class_P(_x_) CHAR(asChar(getAttrib(_x_, R_ClassSymbol)))
136    
137    
138    // Define this "Cholmod compatible" to some degree
139    enum x_slot_kind {x_pattern=-1, x_double=0, x_logical=1, x_integer=2, x_complex=3};
140    //                  n             d           l            i            z
141    
142    /* should also work for "matrix" matrices: */
143    #define Real_KIND(_x_)  (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
144                             (isReal(_x_) ? x_double : (isLogical(_x_) ? x_logical : -1)))
145    /* This one gives '0' also for integer "matrix" :*/
146    #define Real_KIND2(_x_) (IS_S4_OBJECT(_x_) ? Real_kind(_x_) : \
147                             (isLogical(_x_) ? x_logical : 0))
148    
149    /* requires 'x' slot: */
150    #define Real_kind(_x_)  (isReal(GET_SLOT(_x_, Matrix_xSym)) ? 0 :       \
151                             (isLogical(GET_SLOT(_x_, Matrix_xSym)) ? 1 : -1))
152    
153    #define DECLARE_AND_GET_X_SLOT(__C_TYPE, __SEXP)        \
154        __C_TYPE *xx = __SEXP(GET_SLOT(x, Matrix_xSym))
155    
156    
157    /**
158     * Check for valid length of a packed triangular array and return the
159     * corresponding number of columns
160     *
161     * @param len length of a packed triangular array
162     *
163     * @return number of columns
164     */
165    static R_INLINE
166    int packed_ncol(int len)
167    {
168        int disc = 8 * len + 1;     /* discriminant */
169        int sqrtd = (int) sqrt((double) disc);
170    
171        if (len < 0 || disc != sqrtd * sqrtd)
172            error(_("invalid 'len' = %d in packed_ncol"));
173        return (sqrtd - 1)/2;
174    }
175    
176    /**
177     * Allocate an SEXP of given type and length, assign it as slot nm in
178     * the object, and return the SEXP.  The validity of this function
179     * depends on SET_SLOT not duplicating val when NAMED(val) == 0.  If
180     * this behavior changes then ALLOC_SLOT must use SET_SLOT followed by
181     * GET_SLOT to ensure that the value returned is indeed the SEXP in
182     * the slot.
183     * NOTE:  GET_SLOT(x, what)        :== R_do_slot       (x, what)
184     * ----   SET_SLOT(x, what, value) :== R_do_slot_assign(x, what, value)
185     * and the R_do_slot* are in src/main/attrib.c
186     *
187     * @param obj object in which to assign the slot
188     * @param nm name of the slot, as an R name object
189     * @param type type of SEXP to allocate
190     * @param length length of SEXP to allocate
191     *
192     * @return SEXP of given type and length assigned as slot nm in obj
193     */
194    static R_INLINE
195    SEXP ALLOC_SLOT(SEXP obj, SEXP nm, SEXPTYPE type, int length)
196    {
197        SEXP val = allocVector(type, length);
198    
199        SET_SLOT(obj, nm, val);
200        return val;
201    }
202    
203    /**
204     * Expand compressed pointers in the array mp into a full set of indices
205     * in the array mj.
206     *
207     * @param ncol number of columns (or rows)
208     * @param mp column pointer vector of length ncol + 1
209     * @param mj vector of length mp[ncol] to hold the result
210     *
211     * @return mj
212     */
213    static R_INLINE
214    int* expand_cmprPt(int ncol, const int mp[], int mj[])
215    {
216        int j;
217        for (j = 0; j < ncol; j++) {
218            int j2 = mp[j+1], jj;
219            for (jj = mp[j]; jj < j2; jj++) mj[jj] = j;
220        }
221        return mj;
222    }
223    
224    /**
225     * Check if slot(obj, "x") contains any NA (or NaN).
226     *
227     * @param obj   a 'Matrix' object with a (double precision) 'x' slot.
228     *
229     * @return Rboolean :== any(is.na(slot(obj, "x") )
230     */
231    static R_INLINE
232    Rboolean any_NA_in_x(SEXP obj)
233    {
234        double *x = REAL(GET_SLOT(obj, Matrix_xSym));
235        int i, n = LENGTH(GET_SLOT(obj, Matrix_xSym));
236        for(i=0; i < n; i++)
237            if(ISNAN(x[i])) return TRUE;
238        /* else */
239        return FALSE;
240    }
241    
242    
243    void make_d_matrix_triangular(double *x, SEXP from);
244    void make_i_matrix_triangular(   int *x, SEXP from);
245    
246    void make_d_matrix_symmetric(double *to, SEXP from);
247    void make_i_matrix_symmetric(   int *to, SEXP from);
248    
249    SEXP Matrix_expand_pointers(SEXP pP);
250    
251    SEXP dup_mMatrix_as_dgeMatrix(SEXP A);
252    SEXP dup_mMatrix_as_geMatrix (SEXP A);
253    
254    SEXP new_dgeMatrix(int nrow, int ncol);
255    SEXP m_encodeInd (SEXP ij, SEXP di, SEXP chk_bnds);
256    SEXP m_encodeInd2(SEXP i, SEXP j, SEXP di, SEXP chk_bnds);
257    
258    
259    static R_INLINE SEXP
260    mMatrix_as_dgeMatrix(SEXP A)
261    {
262        return strcmp(class_P(A), "dgeMatrix") ? dup_mMatrix_as_dgeMatrix(A) : A;
263    }
264    
265    static R_INLINE SEXP
266    mMatrix_as_geMatrix(SEXP A)
267    {
268        return strcmp(class_P(A) + 1, "geMatrix") ? dup_mMatrix_as_geMatrix(A) : A;
269    }
270    
271    // Keep centralized --- *and* in sync with ../inst/include/Matrix.h :
272    #define MATRIX_VALID_dense                      \
273            "dmatrix", "dgeMatrix",                 \
274            "lmatrix", "lgeMatrix",                 \
275            "nmatrix", "ngeMatrix",                 \
276            "zmatrix", "zgeMatrix"
277    
278    #define MATRIX_VALID_Csparse                    \
279     "dgCMatrix", "dsCMatrix", "dtCMatrix",         \
280     "lgCMatrix", "lsCMatrix", "ltCMatrix",         \
281     "ngCMatrix", "nsCMatrix", "ntCMatrix",         \
282     "zgCMatrix", "zsCMatrix", "ztCMatrix"
283    
284    #define MATRIX_VALID_Tsparse                    \
285     "dgTMatrix", "dsTMatrix", "dtTMatrix",         \
286     "lgTMatrix", "lsTMatrix", "ltTMatrix",         \
287     "ngTMatrix", "nsTMatrix", "ntTMatrix",         \
288     "zgTMatrix", "zsTMatrix", "ztTMatrix"
289    
290    #define MATRIX_VALID_Rsparse                    \
291     "dgRMatrix", "dsRMatrix", "dtRMatrix",         \
292     "lgRMatrix", "lsRMatrix", "ltRMatrix",         \
293     "ngRMatrix", "nsRMatrix", "ntRMatrix",         \
294     "zgRMatrix", "zsRMatrix", "ztRMatrix"
295    
296    #define MATRIX_VALID_CHMfactor "dCHMsuper", "dCHMsimpl", "nCHMsuper", "nCHMsimpl"
297    
298    /**
299     * Return the 0-based index of a string match in a vector of strings
300     * terminated by an empty string.  Returns -1 for no match.
301     *
302     * @param class string to match
303     * @param valid vector of possible matches terminated by an empty string
304     *
305     * @return index of match or -1 for no match
306     */
307    static R_INLINE int
308    Matrix_check_class(char *class, const char **valid)
309    {
310        int ans;
311        for (ans = 0; ; ans++) {
312            if (!strlen(valid[ans])) return -1;
313            if (!strcmp(class, valid[ans])) return ans;
314        }
315    }
316    
317    /**
318     * These are the ones "everyone" should use -- is() versions, also looking
319     * at super classes:
320     */
321    # define Matrix_check_class_etc R_check_class_etc
322    # define Matrix_check_class_and_super R_check_class_and_super
323    
324    /** Accessing  *sparseVectors :  fast (and recycling)  v[i] for v = ?sparseVector:
325     * -> ./sparseVector.c  -> ./t_sparseVector.c :
326     */
327    // Type_ans sparseVector_sub(int64_t i, int nnz_v, int* v_i, Type_ans* v_x, int len_v):
328    
329    /* Define all of
330     *  dsparseVector_sub(....)
331     *  isparseVector_sub(....)
332     *  lsparseVector_sub(....)
333     *  nsparseVector_sub(....)
334     *  zsparseVector_sub(....)
335     */
336    #define _dspV_
337    #include "t_sparseVector.c"
338    
339    #define _ispV_
340    #include "t_sparseVector.c"
341    
342    #define _lspV_
343    #include "t_sparseVector.c"
344    
345    #define _nspV_
346    #include "t_sparseVector.c"
347    
348    #define _zspV_
349    #include "t_sparseVector.c"
350    
351    
352    #ifdef __cplusplus
353    }
354  #endif  #endif
355    
356    #endif /* MATRIX_MUTILS_H_ */

Legend:
Removed from v.412  
changed lines
  Added in v.2811

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