On Tue, 04 Dec 2018 at 15:50 -0500, 'Leandro Facchinetti' via Racket Users wrote: > I rewrote a codebase that was using ‘set’s to use lists that I > ‘remove-duplicates’ whenever I ‘cons’. The result is orders of > magnitude faster. Do you have any idea why?
Why not member before cons? I imagine would be faster for small lists ... how large are your sets? -- 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 to [email protected]. For more options, visit https://groups.google.com/d/optout.
signature.asc
Description: PGP signature
