Why are uncompiled, repeatedly used regexes so much slower in Python 3?
问题 When answering this question (and having read this answer to a similar question), I thought that I knew how Python caches regexes. But then I thought I'd test it, comparing two scenarios: a single compilation of a simple regex, then 10 applications of that compiled regex. 10 applications of an uncompiled regex (where I would have expected slightly worse performance because the regex would have to be compiled once, then cached, and then looked up in the cache 9 times). However, the results