Hallo,
we are trying to extend the R package multcompView in agreement with
the author Hans-Peter Piepho. The function multcompLetters implements
so far a heuristic. We would like to add a function that implements
an exact algorithm and returns a provable optimum result. This
algorithm
On Wed, 20 Jun 2007, Tamara Steijger wrote:
Hallo,
we are trying to extend the R package multcompView in agreement with
the author Hans-Peter Piepho. The function multcompLetters implements
so far a heuristic. We would like to add a function that implements
an exact algorithm and returns a
I'm sorry to bother this list with such trivial questions, but I'm
trying to take Prof. Ripley's advice in porting some Lapack wrappers
into my own code, because they are not public. I'm specifically
choosing programs from R-2.5.0/src/modules/lapack/Lapack.c.
I can't seem to understand the
[EMAIL PROTECTED] wrote:
I'm sorry to bother this list with such trivial questions, but I'm
trying to take Prof. Ripley's advice in porting some Lapack wrappers
into my own code, because they are not public. I'm specifically
choosing programs from R-2.5.0/src/modules/lapack/Lapack.c.
I
On Thu, 21 Jun 2007, Peter Dalgaard wrote:
[EMAIL PROTECTED] wrote:
I'm sorry to bother this list with such trivial questions, but I'm
trying to take Prof. Ripley's advice in porting some Lapack wrappers
into my own code, because they are not public. I'm specifically
choosing programs from
To amend, the traceback is only
Traceback:
1: cbind(probe, gb)
aborting ...
Oops. Martin
Martin Morgan [EMAIL PROTECTED] writes:
The following code results in a seg fault.
sessionInfo()
R version 2.6.0 Under development (unstable) (2007-06-21 r42013)
x86_64-unknown-linux-gnu
I think it needs to be
case LISTSXP:
PROTECT(u = coerceVector(u, mode));
k = LENGTH(u);
idx = (!isMatrix(u)) ? rows : k;
for (i = 0; i idx; i++)
SET_VECTOR_ELT(result, n++,
Yes, that seems to do the trick, for both seg fault and valgrind!
Thanks very much.
Martin
Prof Brian Ripley [EMAIL PROTECTED] writes:
I think it needs to be
case LISTSXP:
PROTECT(u = coerceVector(u, mode));
k = LENGTH(u);
On Thu, 21 Jun 2007, Martin Morgan wrote:
Yes, that seems to do the trick, for both seg fault and valgrind!
Thanks very much.
Thanks: this and a similar one elsewhere seem long-standing bugs in bind.c
Will commit shortly.
Martin
Prof Brian Ripley [EMAIL PROTECTED] writes:
I think it
