Rev 67595 | Rev 68947 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed
/** R : A Computer Language for Statistical Data Analysis* Copyright (C) 2003-2014 The R Core Team** 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.** You should have received a copy of the GNU General Public License* along with this program; if not, a copy is available at* http://www.r-project.org/Licenses/**/#ifdef HAVE_CONFIG_H# include <config.h>#endif#include <Defn.h>SEXP attribute_hiddendo_mapply(SEXP call, SEXP op, SEXP args, SEXP rho){checkArity(op, args);SEXP f = CAR(args), varyingArgs = CADR(args), constantArgs = CADDR(args);int m, zero = 0;R_xlen_t *lengths, *counters, longest = 0;m = length(varyingArgs);SEXP vnames = PROTECT(getAttrib(varyingArgs, R_NamesSymbol));Rboolean named = vnames != R_NilValue;lengths = (R_xlen_t *) R_alloc(m, sizeof(R_xlen_t));for (int i = 0; i < m; i++) {SEXP tmp1 = VECTOR_ELT(varyingArgs, i);lengths[i] = xlength(tmp1);if (isObject(tmp1)) { // possibly dispatch on length()/* Cache the .Primitive: unclear caching is worthwhile. */static SEXP length_op = NULL;if (length_op == NULL) length_op = R_Primitive("length");// DispatchOrEval() needs 'args' to be a pairlistSEXP ans, tmp2 = PROTECT(list1(tmp1));if (DispatchOrEval(call, length_op, "length", tmp2, rho, &ans, 0, 1))lengths[i] = (R_xlen_t) (TYPEOF(ans) == REALSXP ?REAL(ans)[0] : asInteger(ans));UNPROTECT(1);}if (lengths[i] == 0) zero++;if (lengths[i] > longest) longest = lengths[i];}if (zero && longest)error(_("zero-length inputs cannot be mixed with those of non-zero length"));counters = (R_xlen_t *) R_alloc(m, sizeof(R_xlen_t));memset(counters, 0, m * sizeof(R_xlen_t));SEXP mindex = PROTECT(allocVector(VECSXP, m));SEXP nindex = PROTECT(allocVector(VECSXP, m));/* build a call likef(dots[[1]][[4]], dots[[2]][[4]], dots[[3]][[4]], d=7)*/SEXP fcall = R_NilValue; // -Wallif (constantArgs == R_NilValue);else if (isVectorList(constantArgs))fcall = VectorToPairList(constantArgs);elseerror(_("argument 'MoreArgs' of 'mapply' is not a list"));PROTECT_INDEX fi;PROTECT_WITH_INDEX(fcall, &fi);Rboolean realIndx = longest > INT_MAX;SEXP Dots = install("dots");for (int j = m - 1; j >= 0; j--) {SET_VECTOR_ELT(mindex, j, ScalarInteger(j + 1));SET_VECTOR_ELT(nindex, j, allocVector(realIndx ? REALSXP : INTSXP, 1));SEXP tmp1 = PROTECT(lang3(R_Bracket2Symbol, Dots, VECTOR_ELT(mindex, j)));SEXP tmp2 = PROTECT(lang3(R_Bracket2Symbol, tmp1, VECTOR_ELT(nindex, j)));REPROTECT(fcall = LCONS(tmp2, fcall), fi);UNPROTECT(2);if (named && CHAR(STRING_ELT(vnames, j))[0] != '\0')SET_TAG(fcall, installTrChar(STRING_ELT(vnames, j)));}REPROTECT(fcall = LCONS(f, fcall), fi);SEXP ans = PROTECT(allocVector(VECSXP, longest));for (int i = 0; i < longest; i++) {for (int j = 0; j < m; j++) {counters[j] = (++counters[j] > lengths[j]) ? 1 : counters[j];if (realIndx)REAL(VECTOR_ELT(nindex, j))[0] = (double) counters[j];elseINTEGER(VECTOR_ELT(nindex, j))[0] = (int) counters[j];}SEXP tmp = R_forceAndCall(fcall, m, rho);if (MAYBE_REFERENCED(tmp))tmp = duplicate(tmp);SET_VECTOR_ELT(ans, i, tmp);}for (int j = 0; j < m; j++)if (counters[j] != lengths[j])warning(_("longer argument not a multiple of length of shorter"));UNPROTECT(5);return ans;}