The sets are about 20 elements in size.

It seems that ‘member’ before ‘cons’ is marginally faster than 
‘remove-duplicates’ after ‘cons’, as one would expect.

But it’s the strangest thing: in some cases switching from sets to lists with 
unique elements changes the meaning of the program! I spent the whole morning 
looking at the same 15 lines of code and I still have no idea why. All data is 
immutable. The sets/lists-with-unique-elements are used to build lists—`(___ 
,my-set ___)—which are then used as keys/values in hashes. I ‘hash-union’ these 
hashes. Nothing unusual.

I’m going to keep investigating…
Leandro Facchinetti <>

You received this message because you are subscribed to the Google Groups 
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
For more options, visit

Reply via email to