>
> | We usually do
> |
> | Rcpp::List ret = Rcpp::List::create(Rcpp::Named("pa", pa),
> | Rcpp::Named("w", w);
> | Rcpp::Named("xa", xa));
> | return ret;
> |
> | to avoid re-allocation. But that i
On 1 September 2011 at 17:59, Gregor GORJANC wrote:
| Hi,
|
| On 1 September 2011 17:35, Dirk Eddelbuettel wrote:
|
| ... I kind of hoped for more, but given that I vectorized much of R
| | code and that computations are simple additions and multiplications I
| wonder if
| | I c
Hi,
On 1 September 2011 17:35, Dirk Eddelbuettel wrote:
> ... I kind of hoped for more, but given that I vectorized much of R
> | code and that computations are simple additions and multiplications I
> wonder if
> | I could get much more gains with Rcpp foray.
>
> Hard to say in general terms.
Hi Gregor,
And welcome!
On 1 September 2011 at 10:06, Gregor GORJANC wrote:
| I wrote a simple application in R. Application is not very complex, but since
I
| have to deal with large data I have devoted a lot of attention to vectorize R
| computations as much as possible. This lead me to a ver
Dear Rcpp developers and users,
I wrote a simple application in R. Application is not very complex, but
since I have to deal with large data I have devoted a lot of attention to
vectorize R computations as much as possible. This lead me to a very decent
performance, but my computation involves a l