[#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:6126] Re: What would a Ruby browser look like?

From: ts <decoux@...>
Date: 2000-11-07 15:30:39 UTC
List: ruby-talk #6126
>>>>> "S" == Stephen White <steve@deaf.org> writes:

S> It would be cool to run a Ruby program and see the diagram updated in
S> (slow) real time, with lines flashing to show calls being made and data
S> being accessed. Red for writes, yellow for reads? Ruby red for the node
S> currently running (lighter red for threads?) and profiling information
S> being updated on all the nodes as the program executes. That's dreaming
S> a bit, but I like it. :)

 Well I don't want to be pessimist but see [ruby-talk:00492]

 "The syntax tree is not opened for users.  Tree structures may change
dramatically in the future version.  It's very possible since tree
traversing is major perfomance bottleneck.

 I suggest you to leave it blackbox."


Guy Decoux

In This Thread

Prev Next