I'm seeing slow expansion (on the order of hundreds of milliseconds) for the following program: https://gist.github.com/endobson/e165edf224b4028db48d
It is a single function of generated code. Similar functions that don't use match as extensively are much faster < 10 milliseconds. I'm trying to understand what is likely the cause of the slowness here so that I can avoid triggering it in my code generation. And also what speed I can expect from racket expansion here. My current timing is ~2.5-3 seconds for ~600 definitions of similar size or smaller. I'm trying to get that as fast as possible hopefully under 1s as it is in the critical path of my run/test cycle. Is that a reasonable goal? -- 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.
