fibonacci.io

FibonacciSequence := Object clone

FibonacciSequence cache := List clone

FibonacciSequence simple := method (num,
        if (num <= 2, 
            1,
            self calc(num)
        )
    )
    
FibonacciSequence calc := method (num,    
        if (self cached (num),
            self cached (num),
            doCache(num, self simple (num-1) + self simple (num-2))
        )
    )
    
FibonacciSequence cached := method (num,
        self cache at(num)
    )
    
FibonacciSequence doCache := method (num, result, 
        if (self cache at(num),
            self cache atPut(num, result),
            self cache append(result)
        );
        result
    )

for (i, 1, 100,
    FibonacciSequence simple (i) println
) 

Looks clean but would recommend using do(), a Map instead of a List and the atIfAbsentPut() method:

FibonacciSequence := Object clone do(
cache := Map clone

simple := method (num,
    if (num <= 2, 1,
        cache atIfAbsentPut(num asString, simple(num-1) + simple(num-2))
    )
)

)

for (i, 1, 100,
FibonacciSequence simple (i) println
)

Couldn't resist a few more changes:

Fibonacci := Object clone do(
cache := Map clone atPut("0", 1) atPut("1", 1)
at := method(n, cache atIfAbsentPut(num asString, at(n-1) + at(n-2)))
)

for (i, 1, 100,
Fibonacci at(i) println
)

Nice, that's a really compact and still readable solution. I'm already a big fan of IO.