From: Christoph <chr_news@...>
Date: 2002-08-28T21:04:01+09:00
Subject: Re: ANN: RJudy-0.1 - Judy Arrays for Ruby

"Mauricio Fern�ndez"  wrote in,
....
> I later found some bugs in my plug-in replacement for Hash. I have
> another patch which apparently fixes everything. It passes the same
> tests JudyHash does and some others, as st_* is used for everything and
> Ruby seems to run fine now.

Hi,

I am very curious (and running windows so no judy yet) how this
replacement effect pure method lookup time?  Keeping it
simple, what are the Fibonacci and Ackerman benchmarks?

---
def fib(n)
    return n if n < 2
    fib(n-1) + fib(n-2)
end


# benchmark ..
fib(30)


def ack(m,n)
    return n+1 if m == 0
    return ack(m-1,1) if n == 0
    ack(m-1,ack(m,n-1))
end


# and

ack(3,7)   # or ack(3,8)

----


/Christoph