As a Racket rule of thumb, I find that most efforts toward "custom-built loops" end in defeat, because the Racket macro expander and JIT compiler are aware of better optimizations. If I were writing another book on Racket, it would be High-Performance Racket, which I know more about than I used to, but still not very much ;)
> On Mar 21, 2019, at 12:15 PM, Joel Dueck <dueckofe...@gmail.com> wrote: > > Yes, first-words-regex2 is pretty much identical in performance to my longer > regex-less version. Thanks for the pointer! I was not familiar with the use > of regexp-match functions on an input port. It’s a little wild to me how even > using a string port, a general-purpose pattern matching function can be just > about as fast as a custom-built loop that knows exactly what it wants. But > the regex library has probably been pretty well optimized by now. -- You received this message because you are subscribed to the Google Groups "Pollen" group. To unsubscribe from this group and stop receiving emails from it, send an email to pollenpub+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
