Hi!
I'm proud to announce that we completed our "refactoring support for RDT"
assignment last friday. It is far away from finished (and we are continuing
our work after the summer break), but there are some things we achieved:
- comments in the AST (in the nodes, actually)
- rewriter for the AST
Excellent news! We will look at the changes as soon as possible and work with you to get them integrated.On 7/10/06, Mirko Stocker <
[EMAIL PROTECTED]> wrote:Hi!I'm proud to announce that we completed our "refactoring support for RDT"
assignment last friday. It is far away from finished (and we are
On Mon, 10 Jul 2006, Mirko Stocker defenestrated me:
> Hi!
>
> I'm proud to announce that we completed our "refactoring support for RDT"
> assignment last friday. It is far away from finished (and we are continuing
> our work after the summer break), but there are some things we achieved:
> - co
This is JRuby expanding past Ruby's boundaries. Someone needed this
information for RDT (or something like this) and in our parser we used
Ruby's way. Which was just to maintain an actual arg count (arity) and
not store information about the actual arguments.
This is from memory, but the re
I don't have many concerns with us deviating from Ruby a bit here and there. However if we are going to add our own "special" nodes for such things we ought to make them traversable by a visitor, so they don't require custom code for handling.
It seems fair to store this information in the AST rath
Seems healthy to me.-- Charles Oliver Nutter @ headius.blogspot.comJRuby Developer @ www.jruby.orgApplication Architect @
www.ventera.com
evalstate_stack_and_thread_optz.patch
Description: Binary data
-
Using Tomcat but nee
On 7/10/06, Charles O Nutter <[EMAIL PROTECTED]> wrote:
Pure ruby in JRuby: 25.7s"Compiled" in JRuby: 8.8sPure ruby in Ruby: 2.0sPure Java: 0.014s- However, even when interpretation is removed from the equation, we're still over four times slower than Ruby. That's not good.
It's a good bump, but li
On 7/10/06, Nick Sieger <[EMAIL PROTECTED]> wrote:
It's a good bump, but like you say, still slow. Where do you suspect we're losing so much performance? String manipulation and unnecessary object creation?Aside from the gross overhead of interpretation (which we'll never be able to eliminate wit
Charles,On 7/9/06, Charles O Nutter <[EMAIL PROTECTED]> wrote:
It's obviously not EVERYTHING stored in the AST, but it's almost everything and it gives you a good idea of the parse structure. This script could be a good base for a sort of "uneval" that takes in a node and outputs the Ruby code that
On 7/10/06, Christopher Williams <[EMAIL PROTECTED]> wrote:
I believe the Swiss students have done a sort of "uneval" visitor as part of their efforts towards refactoring. They can spit out equivalent ruby source given the AST. I'm not sure whether JRuby would need such a thing, but RDT definitely
On 7/10/06, Christopher Williams <[EMAIL PROTECTED]> wrote:
> RDT definitely does to do more advanced edits or even a "smart" code
> formatter.
We planned to do this in the next semester, should not be that hard to do.
It's definitely easier then imitating the user's coding style :). Maybe we
Hi Charles,
Very interesting data. This inspired me to run some benchmarks. It may
not be directly relevant but I thought you might like to see this data.
I just ran your benchmark [ fib(25) ruby code is interpreted
'uncompiled' on 0.9.0]. I compared against an equivalent fib function
in
Wowsers...this is very interesting! Comments below!On 7/10/06, Peter Rodgers <[EMAIL PROTECTED]> wrote:
Hi Charles,Very interesting data. This inspired me to run some benchmarks. It maynot be directly relevant but I thought you might like to see this data. I just ran your benchmark [ fib(25) rub
On Monday 10 July 2006 13:21, Charles O Nutter wrote:
> On 7/10/06, Nick Sieger <[EMAIL PROTECTED]> wrote:
> > It's a good bump, but like you say, still slow. Where do you suspect
> > we're losing so much performance? String manipulation and unnecessary
> > object creation?
>
> Aside from the gro
Well, I've got a pseudo test case for this. On my system, with JRuby 0.9.0
(well, technically it's HEAD from SourceForge), this fails on about 4 out of
5 executions. Of course, it fails differently each time.
It has yet to fail in 68 executions with C Ruby.
I encourage anyone that wants to lo
I finally finished up the StringScanner in pure java and I was
wondering where the patch should go. Nick and I were talking earlier
about how Jira could be used for such things instead of mailing the
patch to the list. This would allow tracking of the patches life
i.e., giving a better hi
Delicious, delicious test cases. It shall be solved!On 7/10/06, David Corbin <[EMAIL PROTECTED]> wrote:
Well, I've got a pseudo test case for this. On my system, with JRuby 0.9.0(well, technically it's HEAD from SourceForge), this fails on about 4 out of
5 executions. Of course, it fails differen
On 7/10/06, David Corbin <[EMAIL PROTECTED]> wrote:
On Monday 10 July 2006 13:21, Charles O Nutter wrote:> - Multiple transient collections allocated for every method hitAllocate? yikes. That's odd sounding.Yeah, I'm bouncing back and forth between C and Java a lot the past week...my nomenclature
Jira is up and going; but I'm not sure if it's set up to allow non-authorized folks to add and update issues. Tom ended up getting the keys to Codehaus, so he'd have to make the change to allow that.At any rate you could go to
jira.codehaus.org/browse/JRUBY and get an account opened up. In the int
I ran 50 runs and got the following once. Look like what you're talking about? 1) Error:testErraticBehavior(ErraticRestTest):RuntimeError: HACK[A822] rexml_bug.rb:15:in `testErraticBehavior' rexml_bug.rb:22:in `testErraticBehavior'
On 7/10/06, Charles O Nutter <[EMAIL PROTECTED]> wrote:
Deli
Been thinking through compilation a bit more. Here's a little pseudo-bytecode for the fib function.def fib: arity 1 PUSH local var 2 PUSH literal 2 CALL '<' arity 1 JMP_FALSE to XX
PUSH local var 2 RETURNXX: PUSH local var 2 PUSH literal 2 CALL '-' arity 1 FCALL 'fib' ar
21 matches
Mail list logo