[#6363] Re: rescue clause affecting IO loop behavior — ts <decoux@...>

>>>>> "D" == David Alan Black <dblack@candle.superlink.net> writes:

17 messages 2000/11/14
[#6367] Re: rescue clause affecting IO loop behavior — David Alan Black <dblack@...> 2000/11/14

Hello again --

[#6582] best way to interleaf arrays? — David Alan Black <dblack@...>

Hello --

15 messages 2000/11/26

[#6646] RE: Array Intersect (&) question — Aleksi Niemel<aleksi.niemela@...>

Ross asked something about widely known and largely ignored language (on

23 messages 2000/11/29
[#6652] RE: Array Intersect (&) question — rpmohn@... (Ross Mohn) 2000/11/29

aleksi.niemela@cinnober.com (Aleksi Niemel) wrote in

[#6723] Re: Array Intersect (&) question — Mathieu Bouchard <matju@...> 2000/12/01

> >Use a hash. Here's code to do both and more. It assumes that

[#6656] printing/accessing arrays and hashes — raja@... (Raja S.)

I'm coming to Ruby with a Python & Common Lisp background.

24 messages 2000/11/30

[ruby-talk:6459] question about memory usage of a script

From: Doug Bagley <usenet-2000-11-20@...>
Date: 2000-11-20 12:10:01 UTC
List: ruby-talk #6459
The following script uses more memory as N gets bigger.  Should I
expect it to run in constant space?  If not, what do I need to know to
understand how the GC reclaims memory?  I'd like to know, so I can get
an idea of the memory usage of a long-running process, like a server
written in Ruby.

Cheers,
Doug
----------------------------------------
#!/usr/local/bin/ruby
N = Integer(ARGV.shift || 1)
def test()
    li1 = (1..10000).to_a
    li2 = li1.slice(0, li1.length)
    while (not li2.empty?)
	li1.push(li2.shift)
    end
end
for i in 0 .. N
    test()
end

In This Thread

Prev Next