The R Project SVN – R – Diff – /branches/djm-source/src/main/array.c


/*
 *  R : A Computer Language for Statistical Data Analysis
 *  Copyright (C) 1995, 1996  Robert Gentleman and Ross Ihaka
 *  Copyright (C) 1998-2001   The R Development Core Team
 *  Copyright (C) 2002--2006  The R Foundation
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  A copy of the GNU General Public License is available via WWW at
 *  http://www.gnu.org/copyleft/gpl.html.  You can also obtain it by
 *  writing to the Free Software Foundation, Inc., 51 Franklin Street
 *  Fifth Floor, Boston, MA 02110-1301  USA.
 */
 
/* <UTF8> Only ASCII values */
 
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
 
#include <Defn.h>
#include <Rmath.h>
#include <R_ext/RS.h>     /* for Calloc/Free */
#include <R_ext/Applic.h> /* for dgemm */
 
/* "GetRowNames" and "GetColNames" are utility routines which
 * locate and return the row names and column names from the
 * dimnames attribute of a matrix.  They are useful because
 * old versions of R used pair-based lists for dimnames
 * whereas recent versions use vector based lists.
 
 * These are now very old, plus
 * ``When the "dimnames" attribute is
 *   grabbed off an array it is always adjusted to be a vector.''
*/
SEXP GetRowNames(SEXP dimnames)
{
    if (TYPEOF(dimnames) == VECSXP)
	return VECTOR_ELT(dimnames, 0);
    else
	return R_NilValue;
}
 
SEXP GetColNames(SEXP dimnames)
{
    if (TYPEOF(dimnames) == VECSXP)
	return VECTOR_ELT(dimnames, 1);
    else
	return R_NilValue;
}
 
SEXP attribute_hidden do_matrix(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP vals, snr, snc;
    int nr, nc, byrow, lendat;
 
    checkArity(op, args);
    vals = CAR(args);
    snr = CADR(args);
    snc = CADDR(args);
    byrow = asLogical(CADR(CDDR(args)));
    if (byrow == NA_INTEGER)
	error(_("invalid 'byrow' value"));
 
    if (!isNumeric(snr) || !isNumeric(snc))
	error(_("non-numeric matrix extent"));
 
    lendat = length(vals);
    nr = asInteger(snr);
    if (nr == NA_INTEGER) /* This is < 0 */
	error(_("invalid 'nrow' value (too large or NA)"));
    if (nr < 0)
	error(_("invalid 'nrow' value (< 0)"));
    nc = asInteger(snc);
    if (nc == NA_INTEGER)
	error(_("invalid 'ncol' value (too large or NA)"));
    if (nc < 0)
	error(_("invalid 'ncol' value (< 0)"));
 
    if(lendat > 0 ) {
	if (lendat > 1 && (nr * nc) % lendat != 0) {
	    if (((lendat > nr) && (lendat / nr) * nr != lendat) ||
		((lendat < nr) && (nr / lendat) * lendat != nr))
		warning(_("data length [%d] is not a sub-multiple or multiple of the number of rows [%d]"), lendat, nr);
	    else if (((lendat > nc) && (lendat / nc) * nc != lendat) ||
		     ((lendat < nc) && (nc / lendat) * lendat != nc))
		warning(_("data length [%d] is not a sub-multiple or multiple of the number of columns [%d]"), lendat, nc);
	}
	else if ((lendat > 1) && (nr * nc == 0)){
	    warning(_("data length exceeds size of matrix"));
	}
    }
 
    if ((double)nr * (double)nc > INT_MAX)
	error(_("too many elements specified"));
 
    PROTECT(snr = allocMatrix(TYPEOF(vals), nr, nc));
    if(lendat) {
	if (isVector(vals))
	    copyMatrix(snr, vals, byrow);
	else
	    copyListMatrix(snr, vals, byrow);
    } else if (isVector(vals)) { /* fill with NAs */
	int i, j;
	switch(TYPEOF(vals)) {
	case STRSXP:
	    for (i = 0; i < nr; i++)
		for (j = 0; j < nc; j++)
		    SET_STRING_ELT(snr, i + j * nr, NA_STRING);
	    break;
	case LGLSXP:
	    for (i = 0; i < nr; i++)
		for (j = 0; j < nc; j++)
		    LOGICAL(snr)[i + j * nr] = NA_LOGICAL;
	    break;
	case INTSXP:
	    for (i = 0; i < nr; i++)
		for (j = 0; j < nc; j++)
		    INTEGER(snr)[i + j * nr] = NA_INTEGER;
	    break;
	case REALSXP:
	    for (i = 0; i < nr; i++)
		for (j = 0; j < nc; j++)
		    REAL(snr)[i + j * nr] = NA_REAL;
	    break;
	case CPLXSXP:
	    {
		Rcomplex na_cmplx;
		na_cmplx.r = NA_REAL;
		na_cmplx.i = 0;
		for (i = 0; i < nr; i++)
		    for (j = 0; j < nc; j++)
			COMPLEX(snr)[i + j * nr] = na_cmplx;
	    }
	    break;
	case RAWSXP:
	    for (i = 0; i < nr; i++)
		for (j = 0; j < nc; j++)
		    RAW(snr)[i + j * nr] = 0;
	    break;
	default:
	    /* don't fill with anything */
	    ;
	}
    }
    UNPROTECT(1);
    return snr;
}
 
 
SEXP allocMatrix(SEXPTYPE mode, int nrow, int ncol)
{
    SEXP s, t;
    int n;
 
    if (nrow < 0 || ncol < 0)
	error(_("negative extents to matrix"));
    if ((double)nrow * (double)ncol > INT_MAX)
	error(_("allocMatrix: too many elements specified"));
    n = nrow * ncol;
    PROTECT(s = allocVector(mode, n));
    PROTECT(t = allocVector(INTSXP, 2));
    INTEGER(t)[0] = nrow;
    INTEGER(t)[1] = ncol;
    setAttrib(s, R_DimSymbol, t);
    UNPROTECT(2);
    return s;
}
 
 
SEXP allocArray(SEXPTYPE mode, SEXP dims)
{
    SEXP array;
    int i, n;
    double dn;
 
    dn = n = 1;
    for (i = 0; i < LENGTH(dims); i++) {
	dn *= INTEGER(dims)[i];
	if(dn > INT_MAX)
	    error(_("allocArray: too many elements specified by 'dims'"));
	n *= INTEGER(dims)[i];
    }
 
    PROTECT(dims = duplicate(dims));
    PROTECT(array = allocVector(mode, n));
    setAttrib(array, R_DimSymbol, dims);
    UNPROTECT(2);
    return array;
}
 
/* DropDims strips away redundant dimensioning information. */
/* If there is an appropriate dimnames attribute the correct */
/* element is extracted and attached to the vector as a names */
/* attribute.  Note that this function mutates x. */
/* Duplication should occur before this is called. */
 
SEXP DropDims(SEXP x)
{
    SEXP q, dims, dimnames, newnames = R_NilValue;
    int i, n, ndims;
 
    PROTECT(x);
    dims = getAttrib(x, R_DimSymbol);
    dimnames = getAttrib(x, R_DimNamesSymbol);
 
    /* Check that dropping will actually do something. */
    /* (1) Check that there is a "dim" attribute. */
 
    if (dims == R_NilValue) {
	UNPROTECT(1);
	return x;
    }
    ndims = LENGTH(dims);
 
    /* (2) Check whether there are redundant extents */
    n = 0;
    for (i = 0; i < ndims; i++)
	if (INTEGER(dims)[i] != 1) n++;
    if (n == ndims) {
	UNPROTECT(1);
	return x;
    }
 
    if (n <= 1) {
	/* We have reduced to a vector result. */
	if (dimnames != R_NilValue) {
	    n = length(dims);
	    if (TYPEOF(dimnames) == VECSXP) {
		for (i = 0; i < n; i++) {
		    if (INTEGER(dims)[i] != 1) {
			newnames = VECTOR_ELT(dimnames, i);
			break;
		    }
		}
	    }
	    else {
		q = dimnames;
		for (i = 0; i < n; i++) {
		    if (INTEGER(dims)[i] != 1) {
			newnames = CAR(q);
			break;
		    }
		    q = CDR(q);
		}
	    }
	}
	PROTECT(newnames);
	setAttrib(x, R_DimNamesSymbol, R_NilValue);
	setAttrib(x, R_DimSymbol, R_NilValue);
	setAttrib(x, R_NamesSymbol, newnames);
	UNPROTECT(1);
    }
    else {
	/* We have a lower dimensional array. */
	SEXP newdims, dnn, newnamesnames = R_NilValue;
	dnn = getAttrib(dimnames, R_NamesSymbol);
	PROTECT(newdims = allocVector(INTSXP, n));
	for (i = 0, n = 0; i < ndims; i++)
	    if (INTEGER(dims)[i] != 1)
		INTEGER(newdims)[n++] = INTEGER(dims)[i];
	if (!isNull(dimnames)) {
	    int havenames = 0;
	    for (i = 0; i < ndims; i++)
		if (INTEGER(dims)[i] != 1 &&
		    VECTOR_ELT(dimnames, i) != R_NilValue)
		    havenames = 1;
	    if (havenames) {
		PROTECT(newnames = allocVector(VECSXP, n));
		PROTECT(newnamesnames = allocVector(STRSXP, n));
		for (i = 0, n = 0; i < ndims; i++) {
		    if (INTEGER(dims)[i] != 1) {
			if(!isNull(dnn))
			    SET_STRING_ELT(newnamesnames, n,
					   STRING_ELT(dnn, i));
			SET_VECTOR_ELT(newnames, n++, VECTOR_ELT(dimnames, i));
		    }
		}
	    }
	    else dimnames = R_NilValue;
	}
	PROTECT(dimnames);
	setAttrib(x, R_DimNamesSymbol, R_NilValue);
	setAttrib(x, R_DimSymbol, newdims);
	if (dimnames != R_NilValue)
	{
	    if(!isNull(dnn))
		setAttrib(newnames, R_NamesSymbol, newnamesnames);
	    setAttrib(x, R_DimNamesSymbol, newnames);
	    UNPROTECT(2);
	}
	UNPROTECT(2);
    }
    UNPROTECT(1);
    return x;
}
 
SEXP attribute_hidden do_drop(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP x, xdims;
    int i, n, shorten;
 
    checkArity(op, args);
    x = CAR(args);
    if ((xdims = getAttrib(x, R_DimSymbol)) != R_NilValue) {
	n = LENGTH(xdims);
	shorten = 0;
	for (i = 0; i < n; i++)
	    if (INTEGER(xdims)[i] == 1) shorten = 1;
	if (shorten) {
	    if (NAMED(x)) x = duplicate(x);
	    x = DropDims(x);
	}
    }
    return x;
}
 
/* Length of Primitive Objects */
 
SEXP attribute_hidden do_length(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP ans;
    R_len_t len;
 
    checkArity(op, args);
 
    if( isObject(CAR(args)) && DispatchOrEval(call, op, "length", args,
					      rho, &ans, 0, 1))
      return(ans);
 
    len = length(CAR(args));
    return ScalarInteger((len <= INT_MAX) ? len : NA_INTEGER);
}
 
 
SEXP attribute_hidden do_rowscols(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP x, ans;
    int i, j, nr, nc;
 
    checkArity(op, args);
    x = CAR(args);
    if (!isInteger(x) || LENGTH(x) != 2)
	error(_("a matrix-like objects is required as argument to 'row/col'"));
 
    nr = INTEGER(x)[0];
    nc = INTEGER(x)[1];
 
    ans = allocMatrix(INTSXP, nr, nc);
 
    switch (PRIMVAL(op)) {
    case 1:
	for (i = 0; i < nr; i++)
	    for (j = 0; j < nc; j++)
		INTEGER(ans)[i + j * nr] = i + 1;
	break;
    case 2:
	for (i = 0; i < nr; i++)
	    for (j = 0; j < nc; j++)
		INTEGER(ans)[i + j * nr] = j + 1;
	break;
    }
    return ans;
}
 
static void matprod(double *x, int nrx, int ncx,
		    double *y, int nry, int ncy, double *z)
{
    char *transa = "N", *transb = "N";
    int i,  j, k;
    double one = 1.0, zero = 0.0;
    LDOUBLE sum;
    Rboolean have_na = FALSE;
 
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
	/* Don't trust the BLAS to handle NA/NaNs correctly: PR#4582
	 * The test is only O(n) here
	 */
	for (i = 0; i < nrx*ncx; i++)
	    if (ISNAN(x[i])) {have_na = TRUE; break;}
	if (!have_na)
	    for (i = 0; i < nry*ncy; i++)
		if (ISNAN(y[i])) {have_na = TRUE; break;}
	if (have_na) {
	    for (i = 0; i < nrx; i++)
		for (k = 0; k < ncy; k++) {
		    sum = 0.0;
		    for (j = 0; j < ncx; j++)
			sum += x[i + j * nrx] * y[j + k * nry];
		    z[i + k * nrx] = sum;
		}
	} else
	    F77_CALL(dgemm)(transa, transb, &nrx, &ncy, &ncx, &one,
			    x, &nrx, y, &nry, &zero, z, &nrx);
    } else /* zero-extent operations should return zeroes */
	for(i = 0; i < nrx*ncy; i++) z[i] = 0;
}
 
static void cmatprod(Rcomplex *x, int nrx, int ncx,
		     Rcomplex *y, int nry, int ncy, Rcomplex *z)
{
#ifdef HAVE_FORTRAN_DOUBLE_COMPLEX
    char *transa = "N", *transb = "N";
    int i;
    Rcomplex one, zero;
 
    one.r = 1.0; one.i = zero.r = zero.i = 0.0;
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
        F77_CALL(zgemm)(transa, transb, &nrx, &ncy, &ncx, &one,
			x, &nrx, y, &nry, &zero, z, &nrx);
    } else { /* zero-extent operations should return zeroes */
	for(i = 0; i < nrx*ncy; i++) z[i].r = z[i].i = 0;
    }
#else
    int i, j, k;
    double xij_r, xij_i, yjk_r, yjk_i;
    LDOUBLE sum_i, sum_r;
 
    for (i = 0; i < nrx; i++)
	for (k = 0; k < ncy; k++) {
	    z[i + k * nrx].r = NA_REAL;
	    z[i + k * nrx].i = NA_REAL;
	    sum_r = 0.0;
	    sum_i = 0.0;
	    for (j = 0; j < ncx; j++) {
		xij_r = x[i + j * nrx].r;
		xij_i = x[i + j * nrx].i;
		yjk_r = y[j + k * nry].r;
		yjk_i = y[j + k * nry].i;
		if (ISNAN(xij_r) || ISNAN(xij_i)
		    || ISNAN(yjk_r) || ISNAN(yjk_i))
		    goto next_ik;
		sum_r += (xij_r * yjk_r - xij_i * yjk_i);
		sum_i += (xij_r * yjk_i + xij_i * yjk_r);
	    }
	    z[i + k * nrx].r = sum_r;
	    z[i + k * nrx].i = sum_i;
	next_ik:
	    ;
	}
#endif
}
 
static void symcrossprod(double *x, int nr, int nc, double *z)
{
    char *trans = "T", *uplo = "U";
    double one = 1.0, zero = 0.0;
    int i, j;
    if (nr > 0 && nc > 0) {
        F77_CALL(dsyrk)(uplo, trans, &nc, &nr, &one, x, &nr, &zero, z, &nc);
	for (i = 1; i < nc; i++)
	    for (j = 0; j < i; j++) z[i + nc *j] = z[j + nc * i];
    } else { /* zero-extent operations should return zeroes */
	for(i = 0; i < nc*nc; i++) z[i] = 0;
    }
 
}
 
static void crossprod(double *x, int nrx, int ncx,
		      double *y, int nry, int ncy, double *z)
{
    char *transa = "T", *transb = "N";
    double one = 1.0, zero = 0.0;
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
        F77_CALL(dgemm)(transa, transb, &ncx, &ncy, &nrx, &one,
			x, &nrx, y, &nry, &zero, z, &ncx);
    } else { /* zero-extent operations should return zeroes */
	int i;
	for(i = 0; i < ncx*ncy; i++) z[i] = 0;
    }
}
 
static void ccrossprod(Rcomplex *x, int nrx, int ncx,
		       Rcomplex *y, int nry, int ncy, Rcomplex *z)
{
    char *transa = "T", *transb = "N";
    Rcomplex one, zero;
 
    one.r = 1.0; one.i = zero.r = zero.i = 0.0;
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
        F77_CALL(zgemm)(transa, transb, &ncx, &ncy, &nrx, &one,
			x, &nrx, y, &nry, &zero, z, &ncx);
    } else { /* zero-extent operations should return zeroes */
	int i;
	for(i = 0; i < ncx*ncy; i++) z[i].r = z[i].i = 0;
    }
}
 
static void symtcrossprod(double *x, int nr, int nc, double *z)
{
    char *trans = "N", *uplo = "U";
    double one = 1.0, zero = 0.0;
    int i, j;
    if (nr > 0 && nc > 0) {
        F77_CALL(dsyrk)(uplo, trans, &nr, &nc, &one, x, &nr, &zero, z, &nr);
	for (i = 1; i < nr; i++)
	    for (j = 0; j < i; j++) z[i + nr *j] = z[j + nr * i];
    } else { /* zero-extent operations should return zeroes */
	for(i = 0; i < nr*nr; i++) z[i] = 0;
    }
 
}
 
static void tcrossprod(double *x, int nrx, int ncx,
		      double *y, int nry, int ncy, double *z)
{
    char *transa = "N", *transb = "T";
    double one = 1.0, zero = 0.0;
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
        F77_CALL(dgemm)(transa, transb, &nrx, &nry, &ncx, &one,
			x, &nrx, y, &nry, &zero, z, &nrx);
    } else { /* zero-extent operations should return zeroes */
	int i;
	for(i = 0; i < nrx*nry; i++) z[i] = 0;
    }
}
 
static void tccrossprod(Rcomplex *x, int nrx, int ncx,
			Rcomplex *y, int nry, int ncy, Rcomplex *z)
{
    char *transa = "N", *transb = "T";
    Rcomplex one, zero;
 
    one.r = 1.0; one.i = zero.r = zero.i = 0.0;
    if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {
        F77_CALL(zgemm)(transa, transb, &nrx, &nry, &ncx, &one,
			x, &nrx, y, &nry, &zero, z, &nrx);
    } else { /* zero-extent operations should return zeroes */
	int i;
	for(i = 0; i < nrx*nry; i++) z[i].r = z[i].i = 0;
    }
}
 
 
/* "%*%" (op = 0), crossprod (op = 1) or tcrossprod (op = 2) */
SEXP attribute_hidden do_matprod(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    int ldx, ldy, nrx, ncx, nry, ncy, mode;
    SEXP x = CAR(args), y = CADR(args), xdims, ydims, ans;
    Rboolean sym;
 
    if(PRIMVAL(op) == 0 && 
       (IS_S4_OBJECT(x) || IS_S4_OBJECT(y)) 
       && R_has_methods(op)) {
	SEXP s, value;
	/* Remove argument names to ensure positional matching */
	for(s = args; s != R_NilValue; s = CDR(s)) SET_TAG(s, R_NilValue);
	value = R_possible_dispatch(call, op, args, rho);
	if(value) return value;
    }
 
    sym = isNull(y);
    if (sym && (PRIMVAL(op) > 0)) y = x;
    if ( !(isNumeric(x) || isComplex(x)) || !(isNumeric(y) || isComplex(y)) )
	errorcall(call, _("requires numeric matrix/vector arguments"));
 
    xdims = getAttrib(x, R_DimSymbol);
    ydims = getAttrib(y, R_DimSymbol);
    ldx = length(xdims);
    ldy = length(ydims);
 
    if (ldx != 2 && ldy != 2) {		/* x and y non-matrices */
	if (PRIMVAL(op) == 0) {
	    nrx = 1;
	    ncx = LENGTH(x);
	}
	else {
	    nrx = LENGTH(x);
	    ncx = 1;
	}
	nry = LENGTH(y);
	ncy = 1;
    }
    else if (ldx != 2) {		/* x not a matrix */
	nry = INTEGER(ydims)[0];
	ncy = INTEGER(ydims)[1];
	nrx = 0;
	ncx = 0;
	if (PRIMVAL(op) == 0) {
	    if (LENGTH(x) == nry) {	/* x as row vector */
		nrx = 1;
		ncx = LENGTH(x);
	    }
	    else if (nry == 1) {	/* x as col vector */
		nrx = LENGTH(x);
		ncx = 1;
	    }
	}
	else { /* crossprod */
	    if (LENGTH(x) == nry) {	/* x is a col vector */
		nrx = LENGTH(x);
		ncx = 1;
	    }
	}
    }
    else if (ldy != 2) {		/* y not a matrix */
	nrx = INTEGER(xdims)[0];
	ncx = INTEGER(xdims)[1];
	nry = 0;
	ncy = 0;
	if (PRIMVAL(op) == 0) {
	    if (LENGTH(y) == ncx) {	/* y as col vector */
		nry = LENGTH(y);
		ncy = 1;
	    }
	    else if (ncx == 1) {	/* y as row vector */
		nry = 1;
		ncy = LENGTH(y);
	    }
	}
	else {
	    if (LENGTH(y) == nrx) {	/* y is a col vector */
		nry = LENGTH(y);
		ncy = 1;
	    }
	}
    }
    else {				/* x and y matrices */
	nrx = INTEGER(xdims)[0];
	ncx = INTEGER(xdims)[1];
	nry = INTEGER(ydims)[0];
	ncy = INTEGER(ydims)[1];
    }
    /* nr[ow](.) and nc[ol](.) are now defined for x and y */
 
    if (PRIMVAL(op) == 0) {
	/* primitive, so use call */
	if (ncx != nry)
	    errorcall(call, _("non-conformable arguments"));
    }
    else if (PRIMVAL(op) == 1) {
	if (nrx != nry)
	    error(_("non-conformable arguments"));
    }
    else {
	if (ncx != ncy)
	    error(_("non-conformable arguments"));
    }
 
    if (isComplex(CAR(args)) || isComplex(CADR(args)))
	mode = CPLXSXP;
    else
	mode = REALSXP;
    SETCAR(args, coerceVector(CAR(args), mode));
    SETCADR(args, coerceVector(CADR(args), mode));
 
    if (PRIMVAL(op) == 0) {			/* op == 0 : matprod() */
 
	PROTECT(ans = allocMatrix(mode, nrx, ncy));
	if (mode == CPLXSXP)
	    cmatprod(COMPLEX(CAR(args)), nrx, ncx,
		     COMPLEX(CADR(args)), nry, ncy, COMPLEX(ans));
	else
	    matprod(REAL(CAR(args)), nrx, ncx,
		    REAL(CADR(args)), nry, ncy, REAL(ans));
 
	PROTECT(xdims = getAttrib(CAR(args), R_DimNamesSymbol));
	PROTECT(ydims = getAttrib(CADR(args), R_DimNamesSymbol));
 
	if (xdims != R_NilValue || ydims != R_NilValue) {
	    SEXP dimnames, dimnamesnames, dnx=R_NilValue, dny=R_NilValue;
 
	    /* allocate dimnames and dimnamesnames */
 
	    PROTECT(dimnames = allocVector(VECSXP, 2));
	    PROTECT(dimnamesnames = allocVector(STRSXP, 2));
	    if (xdims != R_NilValue) {
		if (ldx == 2 || ncx == 1) {
		    SET_VECTOR_ELT(dimnames, 0, VECTOR_ELT(xdims, 0));
		    dnx = getAttrib(xdims, R_NamesSymbol);
		    if(!isNull(dnx))
			SET_STRING_ELT(dimnamesnames, 0, STRING_ELT(dnx, 0));
		}
	    }
 
#define YDIMS_ET_CETERA							\
	    if (ydims != R_NilValue) {					\
		if (ldy == 2) {						\
		    SET_VECTOR_ELT(dimnames, 1, VECTOR_ELT(ydims, 1));	\
		    dny = getAttrib(ydims, R_NamesSymbol);		\
		    if(!isNull(dny))					\
			SET_STRING_ELT(dimnamesnames, 1, STRING_ELT(dny, 1)); \
		} else if (nry == 1) {					\
		    SET_VECTOR_ELT(dimnames, 1, VECTOR_ELT(ydims, 0));	\
		    dny = getAttrib(ydims, R_NamesSymbol);		\
		    if(!isNull(dny))					\
			SET_STRING_ELT(dimnamesnames, 1, STRING_ELT(dny, 0)); \
		}							\
	    }								\
									\
	    /* We sometimes attach a dimnames attribute			\
	     * whose elements are all NULL ...				\
	     * This is ugly but causes no real damage.			\
	     * Now (2.1.0 ff), we don't anymore: */			\
	    if (VECTOR_ELT(dimnames,0) != R_NilValue ||			\
		VECTOR_ELT(dimnames,1) != R_NilValue) {			\
		if (dnx != R_NilValue || dny != R_NilValue)		\
		    setAttrib(dimnames, R_NamesSymbol, dimnamesnames);	\
		setAttrib(ans, R_DimNamesSymbol, dimnames);		\
	    }								\
	    UNPROTECT(2)
 
	    YDIMS_ET_CETERA;
	}
    }
 
    else if (PRIMVAL(op) == 1) {	/* op == 1: crossprod() */
 
	PROTECT(ans = allocMatrix(mode, ncx, ncy));
	if (mode == CPLXSXP)
	    if(sym)
		ccrossprod(COMPLEX(CAR(args)), nrx, ncx,
			   COMPLEX(CAR(args)), nry, ncy, COMPLEX(ans));
	    else
		ccrossprod(COMPLEX(CAR(args)), nrx, ncx,
			   COMPLEX(CADR(args)), nry, ncy, COMPLEX(ans));
	else {
	    if(sym)
		symcrossprod(REAL(CAR(args)), nrx, ncx, REAL(ans));
	    else
		crossprod(REAL(CAR(args)), nrx, ncx,
			  REAL(CADR(args)), nry, ncy, REAL(ans));
	}
 
	PROTECT(xdims = getAttrib(CAR(args), R_DimNamesSymbol));
	if (sym)
	    PROTECT(ydims = xdims);
	else
	    PROTECT(ydims = getAttrib(CADR(args), R_DimNamesSymbol));
 
	if (xdims != R_NilValue || ydims != R_NilValue) {
	    SEXP dimnames, dimnamesnames, dnx=R_NilValue, dny=R_NilValue;
 
	    /* allocate dimnames and dimnamesnames */
 
	    PROTECT(dimnames = allocVector(VECSXP, 2));
	    PROTECT(dimnamesnames = allocVector(STRSXP, 2));
 
	    if (xdims != R_NilValue) {
		if (ldx == 2) {/* not nrx==1 : .. fixed, ihaka 2003-09-30 */
		    SET_VECTOR_ELT(dimnames, 0, VECTOR_ELT(xdims, 1));
		    dnx = getAttrib(xdims, R_NamesSymbol);
		    if(!isNull(dnx))
			SET_STRING_ELT(dimnamesnames, 0, STRING_ELT(dnx, 1));
		}
	    }
 
	    YDIMS_ET_CETERA;
	}
 
    }
    else {					/* op == 2: tcrossprod() */
 
	PROTECT(ans = allocMatrix(mode, nrx, nry));
	if (mode == CPLXSXP)
	    if(sym)
		tccrossprod(COMPLEX(CAR(args)), nrx, ncx,
			    COMPLEX(CAR(args)), nry, ncy, COMPLEX(ans));
	    else
		tccrossprod(COMPLEX(CAR(args)), nrx, ncx,
			    COMPLEX(CADR(args)), nry, ncy, COMPLEX(ans));
	else {
	    if(sym)
		symtcrossprod(REAL(CAR(args)), nrx, ncx, REAL(ans));
	    else
		tcrossprod(REAL(CAR(args)), nrx, ncx,
			   REAL(CADR(args)), nry, ncy, REAL(ans));
	}
 
	PROTECT(xdims = getAttrib(CAR(args), R_DimNamesSymbol));
	if (sym)
	    PROTECT(ydims = xdims);
	else
	    PROTECT(ydims = getAttrib(CADR(args), R_DimNamesSymbol));
 
	if (xdims != R_NilValue || ydims != R_NilValue) {
	    SEXP dimnames, dimnamesnames, dnx=R_NilValue, dny=R_NilValue;
 
	    /* allocate dimnames and dimnamesnames */
 
	    PROTECT(dimnames = allocVector(VECSXP, 2));
	    PROTECT(dimnamesnames = allocVector(STRSXP, 2));
 
	    if (xdims != R_NilValue) {
		if (ldx == 2) {
		    SET_VECTOR_ELT(dimnames, 0, VECTOR_ELT(xdims, 0));
		    dnx = getAttrib(xdims, R_NamesSymbol);
		    if(!isNull(dnx))
			SET_STRING_ELT(dimnamesnames, 0, STRING_ELT(dnx, 0));
		}
	    }
	    if (ydims != R_NilValue) {
		if (ldy == 2) {
		    SET_VECTOR_ELT(dimnames, 1, VECTOR_ELT(ydims, 0));
		    dny = getAttrib(ydims, R_NamesSymbol);
		    if(!isNull(dny))
			SET_STRING_ELT(dimnamesnames, 1, STRING_ELT(dny, 0));
		}
	    }
	    if (VECTOR_ELT(dimnames,0) != R_NilValue ||
		VECTOR_ELT(dimnames,1) != R_NilValue) {
		if (dnx != R_NilValue || dny != R_NilValue)
		    setAttrib(dimnames, R_NamesSymbol, dimnamesnames);
		setAttrib(ans, R_DimNamesSymbol, dimnames);
	    }
 
	    UNPROTECT(2);
	}
    }
    UNPROTECT(3);
    return ans;
}
#undef YDIMS_ET_CETERA
 
SEXP attribute_hidden do_transpose(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP a, r, dims, dimnames, dimnamesnames=R_NilValue,
	ndimnamesnames, rnames, cnames;
    int i, ldim, len = 0, ncol=0, nrow=0;
 
    checkArity(op, args);
    a = CAR(args);
 
    if (isVector(a)) {
	dims = getAttrib(a, R_DimSymbol);
	ldim = length(dims);
	rnames = R_NilValue;
	cnames = R_NilValue;
	switch(ldim) {
	case 0:
	    nrow = len = length(a);
	    ncol = 1;
	    rnames = getAttrib(a, R_NamesSymbol);
	    dimnames = rnames;/* for isNull() below*/
	    break;
	case 1:
	    nrow = len = length(a);
	    ncol = 1;
	    dimnames = getAttrib(a, R_DimNamesSymbol);
	    if (dimnames != R_NilValue) {
		rnames = VECTOR_ELT(dimnames, 0);
		dimnamesnames = getAttrib(dimnames, R_NamesSymbol);
	    }
	    break;
	case 2:
	    ncol = ncols(a);
	    nrow = nrows(a);
	    len = length(a);
	    dimnames = getAttrib(a, R_DimNamesSymbol);
	    if (dimnames != R_NilValue) {
		rnames = VECTOR_ELT(dimnames, 0);
		cnames = VECTOR_ELT(dimnames, 1);
		dimnamesnames = getAttrib(dimnames, R_NamesSymbol);
	    }
	    break;
	default:
	    goto not_matrix;
	}
    }
    else
	goto not_matrix;
    PROTECT(r = allocVector(TYPEOF(a), len));
    switch (TYPEOF(a)) {
    case LGLSXP:
    case INTSXP:
	for (i = 0; i < len; i++)
	    INTEGER(r)[i] = INTEGER(a)[(i / ncol) + (i % ncol) * nrow];
	break;
    case REALSXP:
	for (i = 0; i < len; i++)
	    REAL(r)[i] = REAL(a)[(i / ncol) + (i % ncol) * nrow];
	break;
    case CPLXSXP:
	for (i = 0; i < len; i++)
	    COMPLEX(r)[i] = COMPLEX(a)[(i / ncol) + (i % ncol) * nrow];
	break;
    case STRSXP:
	for (i = 0; i < len; i++)
	    SET_STRING_ELT(r, i,
			   STRING_ELT(a, (i / ncol) + (i % ncol) * nrow));
	break;
    case VECSXP:
	for (i = 0; i < len; i++)
	    SET_VECTOR_ELT(r, i,
			   VECTOR_ELT(a, (i / ncol) + (i % ncol) * nrow));
	break;
    case RAWSXP:
	for (i = 0; i < len; i++)
	    RAW(r)[i] = RAW(a)[(i / ncol) + (i % ncol) * nrow];
	break;
    default:
	goto not_matrix;
    }
    PROTECT(dims = allocVector(INTSXP, 2));
    INTEGER(dims)[0] = ncol;
    INTEGER(dims)[1] = nrow;
    setAttrib(r, R_DimSymbol, dims);
    UNPROTECT(1);
    /* R <= 2.2.0: dropped list(NULL,NULL) dimnames :
     * if(rnames != R_NilValue || cnames != R_NilValue) */
    if(!isNull(dimnames)) {
	PROTECT(dimnames = allocVector(VECSXP, 2));
	SET_VECTOR_ELT(dimnames, 0, cnames);
	SET_VECTOR_ELT(dimnames, 1, rnames);
	if(!isNull(dimnamesnames)) {
	    PROTECT(ndimnamesnames = allocVector(VECSXP, 2));
	    SET_VECTOR_ELT(ndimnamesnames, 1, STRING_ELT(dimnamesnames, 0));
	    SET_VECTOR_ELT(ndimnamesnames, 0,
			   (ldim == 2) ? STRING_ELT(dimnamesnames, 1):
			   R_BlankString);
	    setAttrib(dimnames, R_NamesSymbol, ndimnamesnames);
	    UNPROTECT(1);
	}
	setAttrib(r, R_DimNamesSymbol, dimnames);
	UNPROTECT(1);
    }
    copyMostAttrib(a, r);
    UNPROTECT(1);
    return r;
 not_matrix:
    error(_("argument is not a matrix"));
    return call;/* never used; just for -Wall */
}
 
/*
 New version of aperm, using strides for speed.
 Jonathan Rougier <J.C.Rougier@durham.ac.uk>
 
 v1.0 30.01.01
 
 M.Maechler : expanded	all ../include/Rdefines.h macros
 */
 
/* this increments iip and sets j using strides */
 
#define CLICKJ						\
    for (itmp=0; itmp<n; itmp++)			\
	if (iip[itmp] == INTEGER(dimsr)[itmp]-1)	\
	    iip[itmp] = 0;				\
	else {						\
	    iip[itmp]++;				\
	    break;					\
	}						\
    for (j=0, itmp=0; itmp<n; itmp++)			\
	j += iip[itmp] * stride[itmp];
 
/* aperm (a, perm, resize = TRUE) */
SEXP attribute_hidden do_aperm(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP a, perm, resize, r, dimsa, dimsr, dna;
    int i, j, n, len, itmp;
    int *pp, *iip, *stride;
 
    checkArity(op, args);
 
    a = CAR(args);
    if (!isArray(a))
	error(_("invalid first argument, must be an array"));
 
    PROTECT(dimsa = getAttrib(a, R_DimSymbol));
    n = LENGTH(dimsa);
 
    /* check the permutation */
 
    PROTECT(perm = coerceVector(CADR(args), INTSXP));
    pp = (int *) R_alloc(n, sizeof(int));
    if (length(perm) == 0) {
	for (i=0; i<n; i++)
	    pp[i] = n-1-i;
    } else if (length(perm) == n) {
	for (i=0; i<n; i++)
	    pp[i] = INTEGER(perm)[i] - 1; /* no offset! */
    } else
	error(_("'perm' is of wrong length"));
 
    iip = (int *) R_alloc(n, sizeof(int));
    for (i = 0; i < n; iip[i++] = 0);
    for (i = 0; i < n; i++)
	if (pp[i] >= 0 && pp[i] < n)
	    iip[pp[i]]++;
	else
	    error(_("value out of range in 'perm'"));
    for (i = 0; i < n; i++)
	if (iip[i] == 0)
	    error(_("invalid permutation ('perm')"));
 
    /* create the stride object and permute */
 
    stride = (int *) R_alloc(n, sizeof(int));
 
    for (iip[0] = 1, i = 1; i<n; i++)
	iip[i] = iip[i-1] * INTEGER(dimsa)[i-1];
 
    for (i = 0; i < n; i++)
	stride[i] = iip[pp[i]];
 
    /* also need to have the dimensions of r */
 
    PROTECT(dimsr = allocVector(INTSXP,n));
    for (i = 0; i < n; i++)
	INTEGER(dimsr)[i] = INTEGER(dimsa)[pp[i]];
 
    /* and away we go! iip will hold the incrementer */
 
    len = LENGTH(a);
    len = length(a);
    PROTECT(r = allocVector(TYPEOF(a), len));
 
    for (i=0; i<n; iip[i++] = 0);
 
    switch (TYPEOF(a)) {
 
    case INTSXP:
        for (j=0, i=0; i<len; i++) {
            INTEGER(r)[i] = INTEGER(a)[j];
            CLICKJ;
        }
        break;
 
    case LGLSXP:
	for (j=0, i=0; i<len; i++) {
	    LOGICAL(r)[i] = LOGICAL(a)[j];
	    CLICKJ;
	}
	break;
 
    case REALSXP:
	for (j=0, i=0; i<len; i++) {
	    REAL(r)[i] = REAL(a)[j];
	    CLICKJ;
	}
	break;
 
    case CPLXSXP:
	for (j=0, i=0; i<len; i++) {
	    COMPLEX(r)[i].r = COMPLEX(a)[j].r;
	    COMPLEX(r)[i].i = COMPLEX(a)[j].i;
	    CLICKJ;
	}
	break;
 
    case STRSXP:
	for (j=0, i=0; i<len; i++) {
	    SET_STRING_ELT(r, i, STRING_ELT(a, j));
	    CLICKJ;
	}
	break;
 
    case VECSXP:
	for (j=0, i=0; i<len; i++) {
	    SET_VECTOR_ELT(r, i, VECTOR_ELT(a, j));
	    CLICKJ;
	}
	break;
 
    case RAWSXP:
	for (j=0, i=0; i<len; i++) {
	    RAW(r)[i] = RAW(a)[j];
	    CLICKJ;
	}
	break;
 
    default:
	UNIMPLEMENTED_TYPE("aperm", a);
    }
 
    /* handle the resize */
    PROTECT(resize = coerceVector(CADDR(args), LGLSXP));
    if (LOGICAL(resize)[0])
	setAttrib(r, R_DimSymbol, dimsr);
    else
	setAttrib(r, R_DimSymbol, dimsa);
 
    /* and handle the dimnames */
 
    PROTECT(dna = getAttrib(a, R_DimNamesSymbol));
 
    if (LOGICAL(resize)[0] && dna != R_NilValue) {
 
	SEXP dnna, dnr, dnnr;
 
	PROTECT(dnna = getAttrib(dna, R_NamesSymbol));
	PROTECT(dnnr = allocVector(STRSXP,n));
	PROTECT(dnr  = allocVector(VECSXP,n));
 
	for (i=0; i<n; i++) {
	    SET_VECTOR_ELT(dnr, i, VECTOR_ELT(dna, pp[i]));
	    if (dnna != R_NilValue)
		SET_STRING_ELT(dnnr, i, STRING_ELT(dnna, pp[i]));
	}
 
	if (dnna != R_NilValue)
	    setAttrib(dnr, R_NamesSymbol, dnnr);
	setAttrib(r, R_DimNamesSymbol, dnr);
	UNPROTECT(3); /* dnna, dnr, dnnr */
    }
 
    UNPROTECT(6); /* dimsa, perm, r, dimsr, resize, dna */
    return r;
}
 
/* colSums(x, n, p, na.rm) and friends */
SEXP attribute_hidden do_colsum(SEXP call, SEXP op, SEXP args, SEXP rho)
{
    SEXP x, ans = R_NilValue;
    int OP, n, p, cnt = 0, i, j, type;
    Rboolean NaRm, keepNA;
    int *ix;
    double *rx;
    LDOUBLE sum = 0.0;
 
    checkArity(op, args);
    x = CAR(args); args = CDR(args);
    n = asInteger(CAR(args)); args = CDR(args);
    p = asInteger(CAR(args)); args = CDR(args);
    NaRm = asLogical(CAR(args));
    if (n == NA_INTEGER || n < 0)
	error(_("invalid value of 'n'"));
    if (p == NA_INTEGER || p < 0)
	error(_("invalid value of 'p'"));
    if (NaRm == NA_LOGICAL) error(_("invalid value of 'na.rm'"));
    keepNA = !NaRm;
 
    OP = PRIMVAL(op);
    switch (type = TYPEOF(x)) {
    case LGLSXP: break;
    case INTSXP: break;
    case REALSXP: break;
    default:
	error(_("'x' must be numeric"));
    }
 
    if (OP == 0 || OP == 1) { /* columns */
	cnt = n;
	PROTECT(ans = allocVector(REALSXP, p));
	for (j = 0; j < p; j++) {
	    switch (type) {
	    case REALSXP:
		rx = REAL(x) + n*j;
		if (keepNA)
		    for (sum = 0., i = 0; i < n; i++) sum += *rx++;
		else {
		    for (cnt = 0, sum = 0., i = 0; i < n; i++, rx++)
			if (!ISNAN(*rx)) {cnt++; sum += *rx;}
			else if (keepNA) {sum = NA_REAL; break;}
		}
		break;
	    case INTSXP:
		ix = INTEGER(x) + n*j;
		for (cnt = 0, sum = 0., i = 0; i < n; i++, ix++)
		    if (*ix != NA_INTEGER) {cnt++; sum += *ix;}
		    else if (keepNA) {sum = NA_REAL; break;}
		break;
	    case LGLSXP:
		ix = LOGICAL(x) + n*j;
		for (cnt = 0, sum = 0., i = 0; i < n; i++, ix++)
		    if (*ix != NA_LOGICAL) {cnt++; sum += *ix;}
		    else if (keepNA) {sum = NA_REAL; break;}
		break;
	    default:
		/* we checked the type above, but be sure */
		UNIMPLEMENTED_TYPEt("do_colsum", type);
	    }
	    if (OP == 1) {
		if (cnt > 0) sum /= cnt; else sum = NA_REAL;
	    }
	    REAL(ans)[j] = sum;
	}
    }
 
    if (OP == 2 || OP == 3) { /* rows */
	cnt = p;
	PROTECT(ans = allocVector(REALSXP, n));
 
	/* interchange summation order to improve cache hits */
	if (type == REALSXP) {
	    int *Cnt = NULL, *c;
	    LDOUBLE *rans, *ra;
	    if(n <= 10000) {
		rans = (LDOUBLE *) alloca(n * sizeof(LDOUBLE));
		R_CheckStack();
		memset(rans, 0, n*sizeof(LDOUBLE));
	    } else rans = Calloc(n, LDOUBLE);
	    rx = REAL(x);
	    if (!keepNA && OP == 3) Cnt = Calloc(n, int);
	    for (j = 0; j < p; j++) {
		ra = rans;
		if (keepNA)
		    for (i = 0; i < n; i++) *ra++ += *rx++;
		else
		    for (c = Cnt, i = 0; i < n; i++, ra++, rx++, c++)
			if (!ISNAN(*rx)) {
			    *ra += *rx;
			    if (OP == 3) (*c)++;
			}
	    }
	    if (OP == 3) {
		if (keepNA)
		    for (ra = rans, i = 0; i < n; i++) *ra++ /= p;
		else {
		    for (ra = rans, c = Cnt, i = 0; i < n; i++, c++)
			if (*c > 0) *ra++ /= *c; else *ra++ = NA_REAL;
		    Free(Cnt);
		}
	    }
	    for (i = 0; i < n; i++) REAL(ans)[i] = rans[i];
	    if(n > 10000) Free(rans);
	    UNPROTECT(1);
	    return ans;	    
	}
 
	for (i = 0; i < n; i++) {
	    switch (type) {
	    case INTSXP:
		ix = INTEGER(x) + i;
		for (cnt = 0, sum = 0., j = 0; j < p; j++, ix += n)
		    if (*ix != NA_INTEGER) {cnt++; sum += *ix;}
		    else if (keepNA) {sum = NA_REAL; break;}
		break;
	    case LGLSXP:
		ix = LOGICAL(x) + i;
		for (cnt = 0, sum = 0., j = 0; j < p; j++, ix += n)
		    if (*ix != NA_LOGICAL) {cnt++; sum += *ix;}
		    else if (keepNA) {sum = NA_REAL; break;}
		break;
	    default:
		/* we checked the type above, but be sure */
		UNIMPLEMENTED_TYPEt("do_colsum", type);
	    }
	    if (OP == 3) {
		if (cnt > 0) sum /= cnt; else sum = NA_REAL;
	    }
	    REAL(ans)[i] = sum;
	}
    }
 
    UNPROTECT(1);
    return ans;
}

Rev 41894	Rev 42208
1	`/*`	1	`/*`
2	`* R : A Computer Language for Statistical Data Analysis`	2	`* R : A Computer Language for Statistical Data Analysis`
3	`* Copyright (C) 1995, 1996 Robert Gentleman and Ross Ihaka`	3	`* Copyright (C) 1995, 1996 Robert Gentleman and Ross Ihaka`
4	`* Copyright (C) 1998-2001 The R Development Core Team`	4	`* Copyright (C) 1998-2001 The R Development Core Team`
5	`* Copyright (C) 2002--2006 The R Foundation`	5	`* Copyright (C) 2002--2006 The R Foundation`
6	`*`	6	`*`
7	`* This program is free software; you can redistribute it and/or modify`	7	`* This program is free software; you can redistribute it and/or modify`
8	`* it under the terms of the GNU General Public License as published by`	8	`* it under the terms of the GNU General Public License as published by`
9	`* the Free Software Foundation; either version 2 of the License, or`	9	`* the Free Software Foundation; either version 2 of the License, or`
10	`* (at your option) any later version.`	10	`* (at your option) any later version.`
11	`*`	11	`*`
12	`* This program is distributed in the hope that it will be useful,`	12	`* This program is distributed in the hope that it will be useful,`
13	`* but WITHOUT ANY WARRANTY; without even the implied warranty of`	13	`* but WITHOUT ANY WARRANTY; without even the implied warranty of`
14	`* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the`	14	`* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the`
15	`* GNU General Public License for more details.`	15	`* GNU General Public License for more details.`
16	`*`	16	`*`
17	`* A copy of the GNU General Public License is available via WWW at`	17	`* A copy of the GNU General Public License is available via WWW at`
18	`* http://www.gnu.org/copyleft/gpl.html. You can also obtain it by`	18	`* http://www.gnu.org/copyleft/gpl.html. You can also obtain it by`
19	`* writing to the Free Software Foundation, Inc., 51 Franklin Street`	19	`* writing to the Free Software Foundation, Inc., 51 Franklin Street`
20	`* Fifth Floor, Boston, MA 02110-1301 USA.`	20	`* Fifth Floor, Boston, MA 02110-1301 USA.`
21	`*/`	21	`*/`
22		22
23	`/* <UTF8> Only ASCII values */`	23	`/* <UTF8> Only ASCII values */`
24		24
25	`#ifdef HAVE_CONFIG_H`	25	`#ifdef HAVE_CONFIG_H`
26	`#include <config.h>`	26	`#include <config.h>`
27	`#endif`	27	`#endif`
28		28
29	`#include <Defn.h>`	29	`#include <Defn.h>`
30	`#include <Rmath.h>`	30	`#include <Rmath.h>`
31	`#include <R_ext/RS.h> /* for Calloc/Free */`	31	`#include <R_ext/RS.h> /* for Calloc/Free */`
32	`#include <R_ext/Applic.h> /* for dgemm */`	32	`#include <R_ext/Applic.h> /* for dgemm */`
33		33
34	`/* "GetRowNames" and "GetColNames" are utility routines which`	34	`/* "GetRowNames" and "GetColNames" are utility routines which`
35	`* locate and return the row names and column names from the`	35	`* locate and return the row names and column names from the`
36	`* dimnames attribute of a matrix. They are useful because`	36	`* dimnames attribute of a matrix. They are useful because`
37	`* old versions of R used pair-based lists for dimnames`	37	`* old versions of R used pair-based lists for dimnames`
38	`* whereas recent versions use vector based lists.`	38	`* whereas recent versions use vector based lists.`
39		39
40	`* These are now very old, plus`	40	`* These are now very old, plus`
41	* ``When the "dimnames" attribute is	41	* ``When the "dimnames" attribute is
42	`* grabbed off an array it is always adjusted to be a vector.''`	42	`* grabbed off an array it is always adjusted to be a vector.''`
43	`*/`	43	`*/`
44	`SEXP GetRowNames(SEXP dimnames)`	44	`SEXP GetRowNames(SEXP dimnames)`
45	`{`	45	`{`
46	`if (TYPEOF(dimnames) == VECSXP)`	46	`if (TYPEOF(dimnames) == VECSXP)`
47	`return VECTOR_ELT(dimnames, 0);`	47	`return VECTOR_ELT(dimnames, 0);`
48	`else`	48	`else`
49	`return R_NilValue;`	49	`return R_NilValue;`
50	`}`	50	`}`
51		51
52	`SEXP GetColNames(SEXP dimnames)`	52	`SEXP GetColNames(SEXP dimnames)`
53	`{`	53	`{`
54	`if (TYPEOF(dimnames) == VECSXP)`	54	`if (TYPEOF(dimnames) == VECSXP)`
55	`return VECTOR_ELT(dimnames, 1);`	55	`return VECTOR_ELT(dimnames, 1);`
56	`else`	56	`else`
57	`return R_NilValue;`	57	`return R_NilValue;`
58	`}`	58	`}`
59		59
60	`SEXP attribute_hidden do_matrix(SEXP call, SEXP op, SEXP args, SEXP rho)`	60	`SEXP attribute_hidden do_matrix(SEXP call, SEXP op, SEXP args, SEXP rho)`
61	`{`	61	`{`
62	`SEXP vals, snr, snc;`	62	`SEXP vals, snr, snc;`
63	`int nr, nc, byrow, lendat;`	63	`int nr, nc, byrow, lendat;`
64		64
65	`checkArity(op, args);`	65	`checkArity(op, args);`
66	`vals = CAR(args);`	66	`vals = CAR(args);`
67	`snr = CADR(args);`	67	`snr = CADR(args);`
68	`snc = CADDR(args);`	68	`snc = CADDR(args);`
69	`byrow = asLogical(CADR(CDDR(args)));`	69	`byrow = asLogical(CADR(CDDR(args)));`
70	`if (byrow == NA_INTEGER)`	70	`if (byrow == NA_INTEGER)`
71	`error(_("invalid 'byrow' value"));`	71	`error(_("invalid 'byrow' value"));`
72		72
73	`if (!isNumeric(snr) \|\| !isNumeric(snc))`	73	`if (!isNumeric(snr) \|\| !isNumeric(snc))`
74	`error(_("non-numeric matrix extent"));`	74	`error(_("non-numeric matrix extent"));`
75		75
76	`lendat = length(vals);`	76	`lendat = length(vals);`
77	`nr = asInteger(snr);`	77	`nr = asInteger(snr);`
78	`if (nr == NA_INTEGER) /* This is < 0 */`	78	`if (nr == NA_INTEGER) /* This is < 0 */`
79	`error(_("invalid 'nrow' value (too large or NA)"));`	79	`error(_("invalid 'nrow' value (too large or NA)"));`
80	`if (nr < 0)`	80	`if (nr < 0)`
81	`error(_("invalid 'nrow' value (< 0)"));`	81	`error(_("invalid 'nrow' value (< 0)"));`
82	`nc = asInteger(snc);`	82	`nc = asInteger(snc);`
83	`if (nc == NA_INTEGER)`	83	`if (nc == NA_INTEGER)`
84	`error(_("invalid 'ncol' value (too large or NA)"));`	84	`error(_("invalid 'ncol' value (too large or NA)"));`
85	`if (nc < 0)`	85	`if (nc < 0)`
86	`error(_("invalid 'ncol' value (< 0)"));`	86	`error(_("invalid 'ncol' value (< 0)"));`
87		87
88	`if(lendat > 0 ) {`	88	`if(lendat > 0 ) {`
89	`if (lendat > 1 && (nr * nc) % lendat != 0) {`	89	`if (lendat > 1 && (nr * nc) % lendat != 0) {`
90	`if (((lendat > nr) && (lendat / nr) * nr != lendat) \|\|`	90	`if (((lendat > nr) && (lendat / nr) * nr != lendat) \|\|`
91	`((lendat < nr) && (nr / lendat) * lendat != nr))`	91	`((lendat < nr) && (nr / lendat) * lendat != nr))`
92	`warning(_("data length [%d] is not a sub-multiple or multiple of the number of rows [%d]"), lendat, nr);`	92	`warning(_("data length [%d] is not a sub-multiple or multiple of the number of rows [%d]"), lendat, nr);`
93	`else if (((lendat > nc) && (lendat / nc) * nc != lendat) \|\|`	93	`else if (((lendat > nc) && (lendat / nc) * nc != lendat) \|\|`
94	`((lendat < nc) && (nc / lendat) * lendat != nc))`	94	`((lendat < nc) && (nc / lendat) * lendat != nc))`
95	`warning(_("data length [%d] is not a sub-multiple or multiple of the number of columns [%d]"), lendat, nc);`	95	`warning(_("data length [%d] is not a sub-multiple or multiple of the number of columns [%d]"), lendat, nc);`
96	`}`	96	`}`
97	`else if ((lendat > 1) && (nr * nc == 0)){`	97	`else if ((lendat > 1) && (nr * nc == 0)){`
98	`warning(_("data length exceeds size of matrix"));`	98	`warning(_("data length exceeds size of matrix"));`
99	`}`	99	`}`
100	`}`	100	`}`
101		101
102	`if ((double)nr * (double)nc > INT_MAX)`	102	`if ((double)nr * (double)nc > INT_MAX)`
103	`error(_("too many elements specified"));`	103	`error(_("too many elements specified"));`
104		104
105	`PROTECT(snr = allocMatrix(TYPEOF(vals), nr, nc));`	105	`PROTECT(snr = allocMatrix(TYPEOF(vals), nr, nc));`
106	`if(lendat) {`	106	`if(lendat) {`
107	`if (isVector(vals))`	107	`if (isVector(vals))`
108	`copyMatrix(snr, vals, byrow);`	108	`copyMatrix(snr, vals, byrow);`
109	`else`	109	`else`
110	`copyListMatrix(snr, vals, byrow);`	110	`copyListMatrix(snr, vals, byrow);`
111	`} else if (isVector(vals)) { /* fill with NAs */`	111	`} else if (isVector(vals)) { /* fill with NAs */`
112	`int i, j;`	112	`int i, j;`
113	`switch(TYPEOF(vals)) {`	113	`switch(TYPEOF(vals)) {`
114	`case STRSXP:`	114	`case STRSXP:`
115	`for (i = 0; i < nr; i++)`	115	`for (i = 0; i < nr; i++)`
116	`for (j = 0; j < nc; j++)`	116	`for (j = 0; j < nc; j++)`
117	`SET_STRING_ELT(snr, i + j * nr, NA_STRING);`	117	`SET_STRING_ELT(snr, i + j * nr, NA_STRING);`
118	`break;`	118	`break;`
119	`case LGLSXP:`	119	`case LGLSXP:`
120	`for (i = 0; i < nr; i++)`	120	`for (i = 0; i < nr; i++)`
121	`for (j = 0; j < nc; j++)`	121	`for (j = 0; j < nc; j++)`
122	`LOGICAL(snr)[i + j * nr] = NA_LOGICAL;`	122	`LOGICAL(snr)[i + j * nr] = NA_LOGICAL;`
123	`break;`	123	`break;`
124	`case INTSXP:`	124	`case INTSXP:`
125	`for (i = 0; i < nr; i++)`	125	`for (i = 0; i < nr; i++)`
126	`for (j = 0; j < nc; j++)`	126	`for (j = 0; j < nc; j++)`
127	`INTEGER(snr)[i + j * nr] = NA_INTEGER;`	127	`INTEGER(snr)[i + j * nr] = NA_INTEGER;`
128	`break;`	128	`break;`
129	`case REALSXP:`	129	`case REALSXP:`
130	`for (i = 0; i < nr; i++)`	130	`for (i = 0; i < nr; i++)`
131	`for (j = 0; j < nc; j++)`	131	`for (j = 0; j < nc; j++)`
132	`REAL(snr)[i + j * nr] = NA_REAL;`	132	`REAL(snr)[i + j * nr] = NA_REAL;`
133	`break;`	133	`break;`
134	`case CPLXSXP:`	134	`case CPLXSXP:`
135	`{`	135	`{`
136	`Rcomplex na_cmplx;`	136	`Rcomplex na_cmplx;`
137	`na_cmplx.r = NA_REAL;`	137	`na_cmplx.r = NA_REAL;`
138	`na_cmplx.i = 0;`	138	`na_cmplx.i = 0;`
139	`for (i = 0; i < nr; i++)`	139	`for (i = 0; i < nr; i++)`
140	`for (j = 0; j < nc; j++)`	140	`for (j = 0; j < nc; j++)`
141	`COMPLEX(snr)[i + j * nr] = na_cmplx;`	141	`COMPLEX(snr)[i + j * nr] = na_cmplx;`
142	`}`	142	`}`
143	`break;`	143	`break;`
144	`case RAWSXP:`	144	`case RAWSXP:`
145	`for (i = 0; i < nr; i++)`	145	`for (i = 0; i < nr; i++)`
146	`for (j = 0; j < nc; j++)`	146	`for (j = 0; j < nc; j++)`
147	`RAW(snr)[i + j * nr] = 0;`	147	`RAW(snr)[i + j * nr] = 0;`
148	`break;`	148	`break;`
149	`default:`	149	`default:`
150	`/* don't fill with anything */`	150	`/* don't fill with anything */`
151	`;`	151	`;`
152	`}`	152	`}`
153	`}`	153	`}`
154	`UNPROTECT(1);`	154	`UNPROTECT(1);`
155	`return snr;`	155	`return snr;`
156	`}`	156	`}`
157		157
158		158
159	`SEXP allocMatrix(SEXPTYPE mode, int nrow, int ncol)`	159	`SEXP allocMatrix(SEXPTYPE mode, int nrow, int ncol)`
160	`{`	160	`{`
161	`SEXP s, t;`	161	`SEXP s, t;`
162	`int n;`	162	`int n;`
163		163
164	`if (nrow < 0 \|\| ncol < 0)`	164	`if (nrow < 0 \|\| ncol < 0)`
165	`error(_("negative extents to matrix"));`	165	`error(_("negative extents to matrix"));`
166	`if ((double)nrow * (double)ncol > INT_MAX)`	166	`if ((double)nrow * (double)ncol > INT_MAX)`
167	`error(_("allocMatrix: too many elements specified"));`	167	`error(_("allocMatrix: too many elements specified"));`
168	`n = nrow * ncol;`	168	`n = nrow * ncol;`
169	`PROTECT(s = allocVector(mode, n));`	169	`PROTECT(s = allocVector(mode, n));`
170	`PROTECT(t = allocVector(INTSXP, 2));`	170	`PROTECT(t = allocVector(INTSXP, 2));`
171	`INTEGER(t)[0] = nrow;`	171	`INTEGER(t)[0] = nrow;`
172	`INTEGER(t)[1] = ncol;`	172	`INTEGER(t)[1] = ncol;`
173	`setAttrib(s, R_DimSymbol, t);`	173	`setAttrib(s, R_DimSymbol, t);`
174	`UNPROTECT(2);`	174	`UNPROTECT(2);`
175	`return s;`	175	`return s;`
176	`}`	176	`}`
177		177
178		178
179	`SEXP allocArray(SEXPTYPE mode, SEXP dims)`	179	`SEXP allocArray(SEXPTYPE mode, SEXP dims)`
180	`{`	180	`{`
181	`SEXP array;`	181	`SEXP array;`
182	`int i, n;`	182	`int i, n;`
183	`double dn;`	183	`double dn;`
184		184
185	`dn = n = 1;`	185	`dn = n = 1;`
186	`for (i = 0; i < LENGTH(dims); i++) {`	186	`for (i = 0; i < LENGTH(dims); i++) {`
187	`dn *= INTEGER(dims)[i];`	187	`dn *= INTEGER(dims)[i];`
188	`if(dn > INT_MAX)`	188	`if(dn > INT_MAX)`
189	`error(_("allocArray: too many elements specified by 'dims'"));`	189	`error(_("allocArray: too many elements specified by 'dims'"));`
190	`n *= INTEGER(dims)[i];`	190	`n *= INTEGER(dims)[i];`
191	`}`	191	`}`
192		192
193	`PROTECT(dims = duplicate(dims));`	193	`PROTECT(dims = duplicate(dims));`
194	`PROTECT(array = allocVector(mode, n));`	194	`PROTECT(array = allocVector(mode, n));`
195	`setAttrib(array, R_DimSymbol, dims);`	195	`setAttrib(array, R_DimSymbol, dims);`
196	`UNPROTECT(2);`	196	`UNPROTECT(2);`
197	`return array;`	197	`return array;`
198	`}`	198	`}`
199		199
200	`/* DropDims strips away redundant dimensioning information. */`	200	`/* DropDims strips away redundant dimensioning information. */`
201	`/* If there is an appropriate dimnames attribute the correct */`	201	`/* If there is an appropriate dimnames attribute the correct */`
202	`/* element is extracted and attached to the vector as a names */`	202	`/* element is extracted and attached to the vector as a names */`
203	`/* attribute. Note that this function mutates x. */`	203	`/* attribute. Note that this function mutates x. */`
204	`/* Duplication should occur before this is called. */`	204	`/* Duplication should occur before this is called. */`
205		205
206	`SEXP DropDims(SEXP x)`	206	`SEXP DropDims(SEXP x)`
207	`{`	207	`{`
208	`SEXP q, dims, dimnames, newnames = R_NilValue;`	208	`SEXP q, dims, dimnames, newnames = R_NilValue;`
209	`int i, n, ndims;`	209	`int i, n, ndims;`
210		210
211	`PROTECT(x);`	211	`PROTECT(x);`
212	`dims = getAttrib(x, R_DimSymbol);`	212	`dims = getAttrib(x, R_DimSymbol);`
213	`dimnames = getAttrib(x, R_DimNamesSymbol);`	213	`dimnames = getAttrib(x, R_DimNamesSymbol);`
214		214
215	`/* Check that dropping will actually do something. */`	215	`/* Check that dropping will actually do something. */`
216	`/* (1) Check that there is a "dim" attribute. */`	216	`/* (1) Check that there is a "dim" attribute. */`
217		217
218	`if (dims == R_NilValue) {`	218	`if (dims == R_NilValue) {`
219	`UNPROTECT(1);`	219	`UNPROTECT(1);`
220	`return x;`	220	`return x;`
221	`}`	221	`}`
222	`ndims = LENGTH(dims);`	222	`ndims = LENGTH(dims);`
223		223
224	`/* (2) Check whether there are redundant extents */`	224	`/* (2) Check whether there are redundant extents */`
225	`n = 0;`	225	`n = 0;`
226	`for (i = 0; i < ndims; i++)`	226	`for (i = 0; i < ndims; i++)`
227	`if (INTEGER(dims)[i] != 1) n++;`	227	`if (INTEGER(dims)[i] != 1) n++;`
228	`if (n == ndims) {`	228	`if (n == ndims) {`
229	`UNPROTECT(1);`	229	`UNPROTECT(1);`
230	`return x;`	230	`return x;`
231	`}`	231	`}`
232		232
233	`if (n <= 1) {`	233	`if (n <= 1) {`
234	`/* We have reduced to a vector result. */`	234	`/* We have reduced to a vector result. */`
235	`if (dimnames != R_NilValue) {`	235	`if (dimnames != R_NilValue) {`
236	`n = length(dims);`	236	`n = length(dims);`
237	`if (TYPEOF(dimnames) == VECSXP) {`	237	`if (TYPEOF(dimnames) == VECSXP) {`
238	`for (i = 0; i < n; i++) {`	238	`for (i = 0; i < n; i++) {`
239	`if (INTEGER(dims)[i] != 1) {`	239	`if (INTEGER(dims)[i] != 1) {`
240	`newnames = VECTOR_ELT(dimnames, i);`	240	`newnames = VECTOR_ELT(dimnames, i);`
241	`break;`	241	`break;`
242	`}`	242	`}`
243	`}`	243	`}`
244	`}`	244	`}`
245	`else {`	245	`else {`
246	`q = dimnames;`	246	`q = dimnames;`
247	`for (i = 0; i < n; i++) {`	247	`for (i = 0; i < n; i++) {`
248	`if (INTEGER(dims)[i] != 1) {`	248	`if (INTEGER(dims)[i] != 1) {`
249	`newnames = CAR(q);`	249	`newnames = CAR(q);`
250	`break;`	250	`break;`
251	`}`	251	`}`
252	`q = CDR(q);`	252	`q = CDR(q);`
253	`}`	253	`}`
254	`}`	254	`}`
255	`}`	255	`}`
256	`PROTECT(newnames);`	256	`PROTECT(newnames);`
257	`setAttrib(x, R_DimNamesSymbol, R_NilValue);`	257	`setAttrib(x, R_DimNamesSymbol, R_NilValue);`
258	`setAttrib(x, R_DimSymbol, R_NilValue);`	258	`setAttrib(x, R_DimSymbol, R_NilValue);`
259	`setAttrib(x, R_NamesSymbol, newnames);`	259	`setAttrib(x, R_NamesSymbol, newnames);`
260	`UNPROTECT(1);`	260	`UNPROTECT(1);`
261	`}`	261	`}`
262	`else {`	262	`else {`
263	`/* We have a lower dimensional array. */`	263	`/* We have a lower dimensional array. */`
264	`SEXP newdims, dnn, newnamesnames = R_NilValue;`	264	`SEXP newdims, dnn, newnamesnames = R_NilValue;`
265	`dnn = getAttrib(dimnames, R_NamesSymbol);`	265	`dnn = getAttrib(dimnames, R_NamesSymbol);`
266	`PROTECT(newdims = allocVector(INTSXP, n));`	266	`PROTECT(newdims = allocVector(INTSXP, n));`
267	`for (i = 0, n = 0; i < ndims; i++)`	267	`for (i = 0, n = 0; i < ndims; i++)`
268	`if (INTEGER(dims)[i] != 1)`	268	`if (INTEGER(dims)[i] != 1)`
269	`INTEGER(newdims)[n++] = INTEGER(dims)[i];`	269	`INTEGER(newdims)[n++] = INTEGER(dims)[i];`
270	`if (!isNull(dimnames)) {`	270	`if (!isNull(dimnames)) {`
271	`int havenames = 0;`	271	`int havenames = 0;`
272	`for (i = 0; i < ndims; i++)`	272	`for (i = 0; i < ndims; i++)`
273	`if (INTEGER(dims)[i] != 1 &&`	273	`if (INTEGER(dims)[i] != 1 &&`
274	`VECTOR_ELT(dimnames, i) != R_NilValue)`	274	`VECTOR_ELT(dimnames, i) != R_NilValue)`
275	`havenames = 1;`	275	`havenames = 1;`
276	`if (havenames) {`	276	`if (havenames) {`
277	`PROTECT(newnames = allocVector(VECSXP, n));`	277	`PROTECT(newnames = allocVector(VECSXP, n));`
278	`PROTECT(newnamesnames = allocVector(STRSXP, n));`	278	`PROTECT(newnamesnames = allocVector(STRSXP, n));`
279	`for (i = 0, n = 0; i < ndims; i++) {`	279	`for (i = 0, n = 0; i < ndims; i++) {`
280	`if (INTEGER(dims)[i] != 1) {`	280	`if (INTEGER(dims)[i] != 1) {`
281	`if(!isNull(dnn))`	281	`if(!isNull(dnn))`
282	`SET_STRING_ELT(newnamesnames, n,`	282	`SET_STRING_ELT(newnamesnames, n,`
283	`STRING_ELT(dnn, i));`	283	`STRING_ELT(dnn, i));`
284	`SET_VECTOR_ELT(newnames, n++, VECTOR_ELT(dimnames, i));`	284	`SET_VECTOR_ELT(newnames, n++, VECTOR_ELT(dimnames, i));`
285	`}`	285	`}`
286	`}`	286	`}`
287	`}`	287	`}`
288	`else dimnames = R_NilValue;`	288	`else dimnames = R_NilValue;`
289	`}`	289	`}`
290	`PROTECT(dimnames);`	290	`PROTECT(dimnames);`
291	`setAttrib(x, R_DimNamesSymbol, R_NilValue);`	291	`setAttrib(x, R_DimNamesSymbol, R_NilValue);`
292	`setAttrib(x, R_DimSymbol, newdims);`	292	`setAttrib(x, R_DimSymbol, newdims);`
293	`if (dimnames != R_NilValue)`	293	`if (dimnames != R_NilValue)`
294	`{`	294	`{`
295	`if(!isNull(dnn))`	295	`if(!isNull(dnn))`
296	`setAttrib(newnames, R_NamesSymbol, newnamesnames);`	296	`setAttrib(newnames, R_NamesSymbol, newnamesnames);`
297	`setAttrib(x, R_DimNamesSymbol, newnames);`	297	`setAttrib(x, R_DimNamesSymbol, newnames);`
298	`UNPROTECT(2);`	298	`UNPROTECT(2);`
299	`}`	299	`}`
300	`UNPROTECT(2);`	300	`UNPROTECT(2);`
301	`}`	301	`}`
302	`UNPROTECT(1);`	302	`UNPROTECT(1);`
303	`return x;`	303	`return x;`
304	`}`	304	`}`
305		305
306	`SEXP attribute_hidden do_drop(SEXP call, SEXP op, SEXP args, SEXP rho)`	306	`SEXP attribute_hidden do_drop(SEXP call, SEXP op, SEXP args, SEXP rho)`
307	`{`	307	`{`
308	`SEXP x, xdims;`	308	`SEXP x, xdims;`
309	`int i, n, shorten;`	309	`int i, n, shorten;`
310		310
311	`checkArity(op, args);`	311	`checkArity(op, args);`
312	`x = CAR(args);`	312	`x = CAR(args);`
313	`if ((xdims = getAttrib(x, R_DimSymbol)) != R_NilValue) {`	313	`if ((xdims = getAttrib(x, R_DimSymbol)) != R_NilValue) {`
314	`n = LENGTH(xdims);`	314	`n = LENGTH(xdims);`
315	`shorten = 0;`	315	`shorten = 0;`
316	`for (i = 0; i < n; i++)`	316	`for (i = 0; i < n; i++)`
317	`if (INTEGER(xdims)[i] == 1) shorten = 1;`	317	`if (INTEGER(xdims)[i] == 1) shorten = 1;`
318	`if (shorten) {`	318	`if (shorten) {`
319	`if (NAMED(x)) x = duplicate(x);`	319	`if (NAMED(x)) x = duplicate(x);`
320	`x = DropDims(x);`	320	`x = DropDims(x);`
321	`}`	321	`}`
322	`}`	322	`}`
323	`return x;`	323	`return x;`
324	`}`	324	`}`
325		325
326	`/* Length of Primitive Objects */`	326	`/* Length of Primitive Objects */`
327		327
328	`SEXP attribute_hidden do_length(SEXP call, SEXP op, SEXP args, SEXP rho)`	328	`SEXP attribute_hidden do_length(SEXP call, SEXP op, SEXP args, SEXP rho)`
329	`{`	329	`{`
330	`SEXP ans;`	330	`SEXP ans;`
331	`R_len_t len;`	331	`R_len_t len;`
332		332
333	`checkArity(op, args);`	333	`checkArity(op, args);`
334		334
335	`if( isObject(CAR(args)) && DispatchOrEval(call, op, "length", args,`	335	`if( isObject(CAR(args)) && DispatchOrEval(call, op, "length", args,`
336	`rho, &ans, 0, 1))`	336	`rho, &ans, 0, 1))`
337	`return(ans);`	337	`return(ans);`
338		338
339	`len = length(CAR(args));`	339	`len = length(CAR(args));`
340	`return ScalarInteger((len <= INT_MAX) ? len : NA_INTEGER);`	340	`return ScalarInteger((len <= INT_MAX) ? len : NA_INTEGER);`
341	`}`	341	`}`
342		342
343		343
344	`SEXP attribute_hidden do_rowscols(SEXP call, SEXP op, SEXP args, SEXP rho)`	344	`SEXP attribute_hidden do_rowscols(SEXP call, SEXP op, SEXP args, SEXP rho)`
345	`{`	345	`{`
346	`SEXP x, ans;`	346	`SEXP x, ans;`
347	`int i, j, nr, nc;`	347	`int i, j, nr, nc;`
348		348
349	`checkArity(op, args);`	349	`checkArity(op, args);`
350	`x = CAR(args);`	350	`x = CAR(args);`
351	`if (!isInteger(x) \|\| LENGTH(x) != 2)`	351	`if (!isInteger(x) \|\| LENGTH(x) != 2)`
352	`error(_("a matrix-like objects is required as argument to 'row/col'"));`	352	`error(_("a matrix-like objects is required as argument to 'row/col'"));`
353		353
354	`nr = INTEGER(x)[0];`	354	`nr = INTEGER(x)[0];`
355	`nc = INTEGER(x)[1];`	355	`nc = INTEGER(x)[1];`
356		356
357	`ans = allocMatrix(INTSXP, nr, nc);`	357	`ans = allocMatrix(INTSXP, nr, nc);`
358		358
359	`switch (PRIMVAL(op)) {`	359	`switch (PRIMVAL(op)) {`
360	`case 1:`	360	`case 1:`
361	`for (i = 0; i < nr; i++)`	361	`for (i = 0; i < nr; i++)`
362	`for (j = 0; j < nc; j++)`	362	`for (j = 0; j < nc; j++)`
363	`INTEGER(ans)[i + j * nr] = i + 1;`	363	`INTEGER(ans)[i + j * nr] = i + 1;`
364	`break;`	364	`break;`
365	`case 2:`	365	`case 2:`
366	`for (i = 0; i < nr; i++)`	366	`for (i = 0; i < nr; i++)`
367	`for (j = 0; j < nc; j++)`	367	`for (j = 0; j < nc; j++)`
368	`INTEGER(ans)[i + j * nr] = j + 1;`	368	`INTEGER(ans)[i + j * nr] = j + 1;`
369	`break;`	369	`break;`
370	`}`	370	`}`
371	`return ans;`	371	`return ans;`
372	`}`	372	`}`
373		373
374	`static void matprod(double *x, int nrx, int ncx,`	374	`static void matprod(double *x, int nrx, int ncx,`
375	`double y, int nry, int ncy, double z)`	375	`double y, int nry, int ncy, double z)`
376	`{`	376	`{`
377	`char transa = "N", transb = "N";`	377	`char transa = "N", transb = "N";`
378	`int i, j, k;`	378	`int i, j, k;`
379	`double one = 1.0, zero = 0.0;`	379	`double one = 1.0, zero = 0.0;`
380	`LDOUBLE sum;`	380	`LDOUBLE sum;`
381	`Rboolean have_na = FALSE;`	381	`Rboolean have_na = FALSE;`
382		382
383	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`	383	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`
384	`/* Don't trust the BLAS to handle NA/NaNs correctly: PR#4582`	384	`/* Don't trust the BLAS to handle NA/NaNs correctly: PR#4582`
385	`* The test is only O(n) here`	385	`* The test is only O(n) here`
386	`*/`	386	`*/`
387	`for (i = 0; i < nrx*ncx; i++)`	387	`for (i = 0; i < nrx*ncx; i++)`
388	`if (ISNAN(x[i])) {have_na = TRUE; break;}`	388	`if (ISNAN(x[i])) {have_na = TRUE; break;}`
389	`if (!have_na)`	389	`if (!have_na)`
390	`for (i = 0; i < nry*ncy; i++)`	390	`for (i = 0; i < nry*ncy; i++)`
391	`if (ISNAN(y[i])) {have_na = TRUE; break;}`	391	`if (ISNAN(y[i])) {have_na = TRUE; break;}`
392	`if (have_na) {`	392	`if (have_na) {`
393	`for (i = 0; i < nrx; i++)`	393	`for (i = 0; i < nrx; i++)`
394	`for (k = 0; k < ncy; k++) {`	394	`for (k = 0; k < ncy; k++) {`
395	`sum = 0.0;`	395	`sum = 0.0;`
396	`for (j = 0; j < ncx; j++)`	396	`for (j = 0; j < ncx; j++)`
397	`sum += x[i + j * nrx] * y[j + k * nry];`	397	`sum += x[i + j * nrx] * y[j + k * nry];`
398	`z[i + k * nrx] = sum;`	398	`z[i + k * nrx] = sum;`
399	`}`	399	`}`
400	`} else`	400	`} else`
401	`F77_CALL(dgemm)(transa, transb, &nrx, &ncy, &ncx, &one,`	401	`F77_CALL(dgemm)(transa, transb, &nrx, &ncy, &ncx, &one,`
402	`x, &nrx, y, &nry, &zero, z, &nrx);`	402	`x, &nrx, y, &nry, &zero, z, &nrx);`
403	`} else /* zero-extent operations should return zeroes */`	403	`} else /* zero-extent operations should return zeroes */`
404	`for(i = 0; i < nrx*ncy; i++) z[i] = 0;`	404	`for(i = 0; i < nrx*ncy; i++) z[i] = 0;`
405	`}`	405	`}`
406		406
407	`static void cmatprod(Rcomplex *x, int nrx, int ncx,`	407	`static void cmatprod(Rcomplex *x, int nrx, int ncx,`
408	`Rcomplex y, int nry, int ncy, Rcomplex z)`	408	`Rcomplex y, int nry, int ncy, Rcomplex z)`
409	`{`	409	`{`
410	`#ifdef HAVE_FORTRAN_DOUBLE_COMPLEX`	410	`#ifdef HAVE_FORTRAN_DOUBLE_COMPLEX`
411	`char transa = "N", transb = "N";`	411	`char transa = "N", transb = "N";`
412	`int i;`	412	`int i;`
413	`Rcomplex one, zero;`	413	`Rcomplex one, zero;`
414		414
415	`one.r = 1.0; one.i = zero.r = zero.i = 0.0;`	415	`one.r = 1.0; one.i = zero.r = zero.i = 0.0;`
416	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`	416	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`
417	`F77_CALL(zgemm)(transa, transb, &nrx, &ncy, &ncx, &one,`	417	`F77_CALL(zgemm)(transa, transb, &nrx, &ncy, &ncx, &one,`
418	`x, &nrx, y, &nry, &zero, z, &nrx);`	418	`x, &nrx, y, &nry, &zero, z, &nrx);`
419	`} else { /* zero-extent operations should return zeroes */`	419	`} else { /* zero-extent operations should return zeroes */`
420	`for(i = 0; i < nrx*ncy; i++) z[i].r = z[i].i = 0;`	420	`for(i = 0; i < nrx*ncy; i++) z[i].r = z[i].i = 0;`
421	`}`	421	`}`
422	`#else`	422	`#else`
423	`int i, j, k;`	423	`int i, j, k;`
424	`double xij_r, xij_i, yjk_r, yjk_i;`	424	`double xij_r, xij_i, yjk_r, yjk_i;`
425	`LDOUBLE sum_i, sum_r;`	425	`LDOUBLE sum_i, sum_r;`
426		426
427	`for (i = 0; i < nrx; i++)`	427	`for (i = 0; i < nrx; i++)`
428	`for (k = 0; k < ncy; k++) {`	428	`for (k = 0; k < ncy; k++) {`
429	`z[i + k * nrx].r = NA_REAL;`	429	`z[i + k * nrx].r = NA_REAL;`
430	`z[i + k * nrx].i = NA_REAL;`	430	`z[i + k * nrx].i = NA_REAL;`
431	`sum_r = 0.0;`	431	`sum_r = 0.0;`
432	`sum_i = 0.0;`	432	`sum_i = 0.0;`
433	`for (j = 0; j < ncx; j++) {`	433	`for (j = 0; j < ncx; j++) {`
434	`xij_r = x[i + j * nrx].r;`	434	`xij_r = x[i + j * nrx].r;`
435	`xij_i = x[i + j * nrx].i;`	435	`xij_i = x[i + j * nrx].i;`
436	`yjk_r = y[j + k * nry].r;`	436	`yjk_r = y[j + k * nry].r;`
437	`yjk_i = y[j + k * nry].i;`	437	`yjk_i = y[j + k * nry].i;`
438	`if (ISNAN(xij_r) \|\| ISNAN(xij_i)`	438	`if (ISNAN(xij_r) \|\| ISNAN(xij_i)`
439	`\|\| ISNAN(yjk_r) \|\| ISNAN(yjk_i))`	439	`\|\| ISNAN(yjk_r) \|\| ISNAN(yjk_i))`
440	`goto next_ik;`	440	`goto next_ik;`
441	`sum_r += (xij_r * yjk_r - xij_i * yjk_i);`	441	`sum_r += (xij_r * yjk_r - xij_i * yjk_i);`
442	`sum_i += (xij_r * yjk_i + xij_i * yjk_r);`	442	`sum_i += (xij_r * yjk_i + xij_i * yjk_r);`
443	`}`	443	`}`
444	`z[i + k * nrx].r = sum_r;`	444	`z[i + k * nrx].r = sum_r;`
445	`z[i + k * nrx].i = sum_i;`	445	`z[i + k * nrx].i = sum_i;`
446	`next_ik:`	446	`next_ik:`
447	`;`	447	`;`
448	`}`	448	`}`
449	`#endif`	449	`#endif`
450	`}`	450	`}`
451		451
452	`static void symcrossprod(double x, int nr, int nc, double z)`	452	`static void symcrossprod(double x, int nr, int nc, double z)`
453	`{`	453	`{`
454	`char trans = "T", uplo = "U";`	454	`char trans = "T", uplo = "U";`
455	`double one = 1.0, zero = 0.0;`	455	`double one = 1.0, zero = 0.0;`
456	`int i, j;`	456	`int i, j;`
457	`if (nr > 0 && nc > 0) {`	457	`if (nr > 0 && nc > 0) {`
458	`F77_CALL(dsyrk)(uplo, trans, &nc, &nr, &one, x, &nr, &zero, z, &nc);`	458	`F77_CALL(dsyrk)(uplo, trans, &nc, &nr, &one, x, &nr, &zero, z, &nc);`
459	`for (i = 1; i < nc; i++)`	459	`for (i = 1; i < nc; i++)`
460	`for (j = 0; j < i; j++) z[i + nc j] = z[j + nc i];`	460	`for (j = 0; j < i; j++) z[i + nc j] = z[j + nc i];`
461	`} else { /* zero-extent operations should return zeroes */`	461	`} else { /* zero-extent operations should return zeroes */`
462	`for(i = 0; i < nc*nc; i++) z[i] = 0;`	462	`for(i = 0; i < nc*nc; i++) z[i] = 0;`
463	`}`	463	`}`
464		464
465	`}`	465	`}`
466		466
467	`static void crossprod(double *x, int nrx, int ncx,`	467	`static void crossprod(double *x, int nrx, int ncx,`
468	`double y, int nry, int ncy, double z)`	468	`double y, int nry, int ncy, double z)`
469	`{`	469	`{`
470	`char transa = "T", transb = "N";`	470	`char transa = "T", transb = "N";`
471	`double one = 1.0, zero = 0.0;`	471	`double one = 1.0, zero = 0.0;`
472	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`	472	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`
473	`F77_CALL(dgemm)(transa, transb, &ncx, &ncy, &nrx, &one,`	473	`F77_CALL(dgemm)(transa, transb, &ncx, &ncy, &nrx, &one,`
474	`x, &nrx, y, &nry, &zero, z, &ncx);`	474	`x, &nrx, y, &nry, &zero, z, &ncx);`
475	`} else { /* zero-extent operations should return zeroes */`	475	`} else { /* zero-extent operations should return zeroes */`
476	`int i;`	476	`int i;`
477	`for(i = 0; i < ncx*ncy; i++) z[i] = 0;`	477	`for(i = 0; i < ncx*ncy; i++) z[i] = 0;`
478	`}`	478	`}`
479	`}`	479	`}`
480		480
481	`static void ccrossprod(Rcomplex *x, int nrx, int ncx,`	481	`static void ccrossprod(Rcomplex *x, int nrx, int ncx,`
482	`Rcomplex y, int nry, int ncy, Rcomplex z)`	482	`Rcomplex y, int nry, int ncy, Rcomplex z)`
483	`{`	483	`{`
484	`char transa = "T", transb = "N";`	484	`char transa = "T", transb = "N";`
485	`Rcomplex one, zero;`	485	`Rcomplex one, zero;`
486		486
487	`one.r = 1.0; one.i = zero.r = zero.i = 0.0;`	487	`one.r = 1.0; one.i = zero.r = zero.i = 0.0;`
488	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`	488	`if (nrx > 0 && ncx > 0 && nry > 0 && ncy > 0) {`
489	`F77_CALL(zgemm)(transa, transb, &ncx, &ncy, &nrx, &one,`	489	`F77_CALL(zgemm)(transa, transb, &ncx, &ncy, &nrx, &one,`
490	`x, &nrx, y, &nry, &zero, z, &ncx);`	490	`x, &nrx, y, &nry, &zero, z, &ncx);`
491	`} else { /* zero-extent operations should return zeroes */`	491	`} else { /* zero-extent operations should return zeroes */`
492	`int i;`	492	`int i;`
493	`for(i = 0; i < ncx*ncy; i++) z[i].r = z[i].i = 0;`	493	`for(i = 0; i < ncx*ncy; i++) z[i].r = z[i].i = 0;`
494	`}`	494	`}`
495	`}`	495	`}`
496		496
497	`static void symtcrossprod(double x, int nr, int nc, double z)`	497	`static void symtcrossprod(double x, int nr, int nc, double z)`
498	`{`	498	`{`
499	`char trans = "N", uplo = "U";`	499	`char trans = "N", uplo = "U";`
500	`double one = 1.0, zero = 0.0;`	500	`double one = 1.0, zero = 0.0;`

The R Project SVN R

(root)/branches/djm-source/src/main/array.c – Rev 41894 → 42208