Add support for lazy matchers

[masklinn]

Support is addef for lazy builtin matchers (with a separately compiled file), as well as loading json or yaml files using lazy matchers.

Lazy matchers are very much a tradeoff: they improve import speed, but slow down run speed, possibly dramatically.

Use them by default for the re2 parser, but not the basic parser: experimentally, on Python 3.11

• importing the package itself takes ~36ms
• importing the lazy matchers takes ~36ms (including the package, so ~0)
• importing the eager matchers takes ~97ms

the eager matchers have a significant overhead, however running the bench on the sample file, they cause a runtime increase of 700~800ms on the basic parser bench, as that ends up instantiating every regex (likely due to match failures). Relatively this is not huge (~2.5%), but the tradeoff doesn't seem great, especially since the parser itself is initialized lazily.

The re2 parser does much better, only losing 20~30ms (~1%), this is likely because it only needs to compile a fraction of the regexes (156 out of 1162 as of regexes.yaml version 0.18), and possibly because it gets to avoid some of the most expensive to compile ones.

TODO:

• test the lazy matchers
• note the space overhead of the additional precompiled file (compression level 77% in wheel file, 27783 bytes stored, 123017 raw)
• note the memory overhead of the additional precompiled file
  turns out the eagerly compiled regex likely consume a bunch of memory,
  • loading _matchers.py adds 760~780k to the process
  • loading _lazy.py adds 65~75k (depends on loading order, likely because the literal strings are shared), forcing all the regexes to be compiled increases memory use by ~800k so that tracks
    the literal strings are likely shared but the compiled regex definitely are not, could have a shared cache but the use case of loading multiple builtin sets in actual production seems unlikely