[q]squeak is too slow?
stonecold at jupiter.kaist.ac.kr
Wed Dec 8 03:01:59 UTC 2004
'Something' is just array manipulations.
Asuume that (j,k) are a matrix(30 by 30).
For each (j,k) I want to compute sum of distance from (j,k) to all others.
Finally we have to get a minimum among sums.
From: squeak-dev-bounces at lists.squeakfoundation.org [mailto:squeak-dev-
bounces at lists.squeakfoundation.org] On Behalf Of Richard A. O'Keefe
Sent: Wednesday, December 08, 2004 11:25 AM
To: squeak-dev at lists.squeakfoundation.org
Subject: Re: [q]squeak is too slow?
=?ks_c_5601-1987?B?wMzD4byu?= <stonecold at jupiter.kaist.ac.kr> wrote:
I tried to calculate something.
1 to: 30 do: [ :j|
1 to: 30 do: [:k|
1 to: 30 do: [ :l|
1 to: 30 do: [:m|
It takes 50 seconds to finish this loop.
The obvious question was "What is <Something :-)>?"
It may well be that there is a faster way to express what you want.
Just because a particular program structure is a good structure for
C, that doesn't necessarily mean it's a good structure for any other
The magic numbers make me quite sure that there is something interesting
that you are not telling us.
More information about the Squeak-dev