I suspect it will be slow because sets are generics, and generics are slow. For my application, it has worked well to replace set/seteq with hash/hasheq mapping to #t; this only works when you have total control over set representation as an implementation detail, of course! But for me it sped up my set-heavy program quite a lot.
On Tuesday, December 4, 2018 at 8:50:33 PM UTC, Leandro Facchinetti 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? > > -- > Leandro Facchinetti <m...@leafac.com <javascript:>> > https://www.leafac.com > > -- 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 racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
