Hello,

I am working on adding a binary support to Monticello. I already have a running implementation. However I was really disappointed by the performance. It runs only 20% faster than the  current Monticello.

The main reason is it takes really a lot of time to classify methods. Here is an example:
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
t1 := Time millisecondsToRun: [1 to: 600 do: [:i| Object compile: 'bar', i printString, ' 1 + 2 + 3 + 4 + 5. ^ 100 factorial']].
Transcript show: 'Time to compile 600 methods: ', t1 printString; cr.

t2 := Time millisecondsToRun: [1 to: 600 do: [:i| Object organization classify: (#bar , i printString) asSymbol under: #'dummy-test']].
Transcript show: 'Time to classify 600 methods: ', t2 printString; cr.
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

Yielding:
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Time to compile 600 methods: 17992
Time to classify 600 methods: 17146
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

It takes to compile as much as classifying them.
Do you think this could be optimized?

Alexandre

-- 
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel  http://www.iam.unibe.ch/~bergel
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.