On Oct 3, 2007, at 7:31 AM, Michael Davies wrote:
If you're
interested in the numbers rather than the technique, there's a couple
of alternative approaches to speed it up, iteration and matrix
manipulation.
Actually, in the case of the Fibonacci sequence, the best way to
speed it up is to u
The SwitchMorph code for compatibility with Squeak by Example was
pushed to the olpc update stream last month.
Cheers,
-- Scott
On Oct 3, 2007, at 5:32 PM, Andreas Raab wrote:
David Corking wrote:
I tested Marcus Denker's original changeset SwitchMorphEnh.2.cs at
http://bugs.squeak.org/
David Corking wrote:
I tested Marcus Denker's original changeset SwitchMorphEnh.2.cs at
http://bugs.squeak.org/file_download.php?file_id=1399&type=bug
in a Croquet SDK image
Croquet.1.0.18.9
from the Wisconsin Croquet Collaborative.
If works great and the example First Application in Squeak By
Andreas, I am following up on an old thread,
> > Bill Kerr wrote:
> >> A friend sent me some other information from the bugs site pointing out a
> >> bug in SimpleSwitchMorph in earlier versions:
> >> http://bugs.squeak.org/print_bug_page.php?bug_id=3530
> >>
> >> Summary:0003530: Simp
Hi.
On 10/2/07, Mark Smithfield <[EMAIL PROTECTED]> wrote:
>
> As I read code in Squeak, I discover method names that
> I do not
> know. How do you find these methods if you don't know
> the type of
> the receiver?
If you are asking how to find out what a method does from the code, the
easiest w
On 03/10/2007, Bert Freudenberg <[EMAIL PROTECTED]> wrote:
>
>
> Now that is plain silly. If you just iterate, why store in an array?
Good question. No good answer :-(
Your solution is >20x faster, thanks!
___
Beginners mailing list
Beginners@lists.squea
On Oct 3, 2007, at 16:49 , Bert Freudenberg wrote:
On Oct 3, 2007, at 15:55 , Mark Smithfield wrote:
I want to apply smalltalk to fibonacci numbers. I
add
this method
to Integer,
fib:
(self = 0) ifTrue: (^0)
(self = 1) ifTrue: (^1)
^ (self - 1 fib) + (self - 2 fib).
This is n
On Oct 3, 2007, at 16:31 , Michael Davies wrote:
I want to apply smalltalk to fibonacci numbers. I
Next, I would like to memoize this method,
Hi Mark,
By coincidence, I was playing with this myself yesterday. If you're
interested in the numbers rather than the technique, there's a couple
o
On Oct 3, 2007, at 15:55 , Mark Smithfield wrote:
I want to apply smalltalk to fibonacci numbers. I
add
this method
to Integer,
fib:
(self = 0) ifTrue: (^0)
(self = 1) ifTrue: (^1)
^ (self - 1 fib) + (self - 2 fib).
This is not Smalltalk. Blocks need square brackets, and unary
> > > I want to apply smalltalk to fibonacci numbers. I
> > > Next, I would like to memoize this method,
Hi Mark,
By coincidence, I was playing with this myself yesterday. If you're
interested in the numbers rather than the technique, there's a couple
of alternative approaches to speed it up, ite
Hi Mark,
Welcome to the list, and Smalltalk.
> From: Mark Smithfield
>
> This is a mixed bag. These are the questions that I
> would ask an
> informed friend. They might be obvious, but they are
> not obvious
> to me (yet, I hope).
> -
> As I read code in Squeak, I di
> > I want to apply smalltalk to fibonacci numbers. I
> add
> > this method
> > to Integer,
> >
> > fib:
> > (self = 0) ifTrue: (^0)
> > (self = 1) ifTrue: (^1)
> > ^ (self - 1 fib) + (self - 2 fib).
> >
> > Next, I would like to memoize this method,
> (because of
> > the enormous perfo
12 matches
Mail list logo
