[#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:5993] Re: Mem overhead of singleton (ProgRuby chapt 19 q)

From: ts <decoux@...>
Date: 2000-11-02 14:53:44 UTC
List: ruby-talk #5993
>>>>> "R" == Robert Feldt <feldt@ce.chalmers.se> writes:

R> Basically this boils down to how many bytes are needed for a
R> (small) singleton method like the one above?

 You can probably have amore precise value, but just to give you an example
 here the nodes needed for a small method

pigeon% cat b.rb
#! /usr/bin/ruby -rii
def method(*args, &block)
   old_method
end
dump Object, :method
pigeon%

pigeon% b.rb
Method Object::method
SCOPE
  BLOCK
    ARGS (*args)
    BLOCK_ARG (&block)
    NEWLINE <./b.rb:3>
    VCALL old_method 
 
pigeon% 

 You just need to look at each node and make the sum of all bytes used :-)


p.s.: there is a big reason for attribute accessor because ruby, in this
case, use *only* one (1) node

Guy Decoux



In This Thread

Prev Next