Hello *,
I noticed a five percent speed up by making local definitions global.
This is the first version with local definitions:
f = some expression based on mySet
where
mySet = foldl (flip Set.insert) Set.empty myList
myList = some constant list
Then I moved mySet and myList to
Michael Marte [EMAIL PROTECTED] schrieb im
Newsbeitrag news:[EMAIL PROTECTED]
Hello *,
I noticed a five percent speed up by making local definitions global.
Maybe the global defintions are monomorphic, and the local defintions
are polymorphic. You could evaluate the types of the global types
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of Michael Marte
| Sent: 05 September 2006 17:40
| To: glasgow-haskell-users@haskell.org
| Subject: Program slower with local definitions
|
| Hello *,
|
| I noticed a five percent speed up