From: Mark Hahn <mchahn@...>
Date: 2002-01-16T04:25:28+09:00
Subject: RE: memory usage question


> How does java acheive this feat?

I only know I've done this before in Java without running into trouble.  My
guess is that Java uses less memory per string in the hash and it allows
large heap allocations.  I've never run into a heap size limit, but I assume
it is around a gig or two.  A 32 bit cpu could theoretically address 4 gigs.

-----Original Message-----
From: Phil Tomson [mailto:ptkwt@shell1.aracnet.com]
Sent: Tuesday, January 15, 2002 10:34 AM
To: ruby-talk ML; undisclosed-recipients:
Subject: Re: memory usage question


In article <CEENJIKJHPPGICBNAFMICEJKDEAA.mchahn@facelink.com>,
Mark Hahn <mchahn@facelink.com> wrote:
>
>> you should consider using a database
>
>Doing 200 million lookups in a db would take way too long for my script.
If
>there is no other work-around than using a DB, then I'll have to go back to
>Java, which can handle this kind of memory usage.  I'm dissapointed that in
>one of the first quick scripts I went to Ruby for, Ruby couldn't do the
job.

How does java acheive this feat?
(or how do you do it in java?)
>
>> <oldtimer_rant>
>
>Don't try to compete with me on oldtimer stories.  I spent two summers
>programming an IBM 650 which had NO core memory.  It was a 1-bit processor
>with only drum memory.  Even the registers were on the drum.  It used about
>100 vacumn tubes to implement the cpu.

I think you win the prize unless there's a ENIAC user out there.

Phil