Skip to content

regulator 2.0

Choose a tag to compare

@github-actions github-actions released this 06 Nov 17:51
· 267 commits to main since this release

What's Changed

Other changes

  • State each language's authority by @dain in #25
  • Keep explicit ASCII case pairs narrow by @dain in #24
  • Read a dash after a Trino class range literally by @dain in #26
  • Scan LIKE contains by both ends, call-free by @dain in #28
  • Give Trino's POSIX names Joni's Unicode sets by @dain in #27
  • Group alternatives after a lone Trino flag by @dain in #29
  • Record Trino's property-name and \b calls by @dain in #30
  • Run RE2 patterns on scan plans by @dain in #31
  • Stop count from overrunning the paired table by @dain in #32
  • Extend Trino's call-free literal search by @dain in #33
  • Keep literal analysis linear in pattern size by @dain in #34
  • Support the Rust crate's bytes API by @dain in #35
  • List the Rust counter in the counting decision by @dain in #36
  • Report the specialized engine and compiler by @dain in #37
  • Compare the Rust language with the regex crate by @dain in #38
  • Parse nested character classes iteratively by @dain in #39
  • Optimize programs without rewalking shared chains by @dain in #40
  • Run Java and Rust patterns on scan plans by @dain in #41
  • Share one clone table across nullable loops by @dain in #42
  • Broadcast run scan needles once per scan by @dain in #43
  • Refuse Java $ after a CR before the region by @dain in #44
  • Make the next release 2.0 by @dain in #45
  • Convert doc comments to Markdown by @dain in #46
  • Expose regex parsing and capture metadata by @electrum in #23
  • Search again after a failed find by @dain in #47
  • Keep pattern metadata open to new facts by @dain in #48
  • Let every regex language parse a pattern by @dain in #49
  • Run partial non-ASCII sets on scan plans by @dain in #50
  • Pass the scan-plan mode through RE2 compiles by @dain in #51
  • Bound the scan-plan member table's build memory by @dain in #52
  • Drop the Trino prefix from shared scan plans by @dain in #53
  • Lease work units from the campaign controller by @dain in #54
  • Reject lone surrogate escapes in Java and Trino by @dain in #55
  • Describe all five languages in docs at 2.0 by @dain in #56
  • Check the LIKE corpus against Trino again by @dain in #57
  • Test random Java and Rust plans and moved probes by @dain in #58
  • Derive report check shape from the capture by @dain in #60
  • Align the language APIs for 2.0 by @dain in #59
  • Check Trino patterns against Joni at random by @dain in #61
  • Run language campaigns as unit phases by @dain in #62
  • Compare RE2 specialized patterns with native RE2 by @dain in #63
  • Run Rust assertions on the DFA by @dain in #64
  • Match Java, Trino, and LIKE front-end edge cases to their authorities by @dain in #65
  • Count malformed UTF-8 as RE2 matches it by @dain in #66
  • Match the JDK when parsing Java patterns by @dain in #67
  • Fold Java ranges as the JDK does by @dain in #68
  • Speed up AWS benchmark campaigns by @dain in #69
  • Publish every campaign row except hidden ones by @dain in #70
  • Weight campaign host shares by work left by @dain in #71
  • Keep each results TSV row on one line by @dain in #72
  • Run every phase in one controller process by @dain in #73
  • Harden the campaign controller after its review by @dain in #74
  • Fix campaign deadline, replace and recovery bugs by @dain in #75
  • Size language leases from operation evidence by @dain in #88
  • Keep a finished campaign's raw root in S3 by @dain in #86
  • Color report comparisons by significance by @dain in #78
  • Run Java and Trino word boundaries on the DFA by @dain in #76
  • Run UNIX_LINES carets before a byte on the DFA by @dain in #79
  • Skip the reverse search for one-character matches by @dain in #77
  • Verify literal candidates a word at a time by @dain in #80
  • Search large literal sets with Aho-Corasick by @dain in #82
  • Count scan-plan matches without allocating by @dain in #83
  • Keep the pointer loop after a count scan stops by @dain in #84
  • Scan case-insensitive prefixes a vector at a time by @dain in #85
  • Check three bytes of each leading literal by @dain in #89
  • Keep count handoff test off the literal filter by @dain in #92
  • Copy only simple LIKE literals when compiling by @dain in #81
  • Search for a required inner literal first by @dain in #90
  • Extract literal sets without recursion by @dain in #93
  • Search for the literal behind a leading assertion by @dain in #96
  • Abandon and resume trickling S3 fetches by @dain in #94
  • Let C2 inline the count entry again by @dain in #97
  • Bound literal searches with long partial matches by @dain in #99
  • Stop missing matches on 8-lane vectors by @dain in #95
  • Look up start literal groups by nibble by @dain in #98
  • Let allocation tests wait for compiled code by @dain in #101
  • Keep each accepted unit group once in the root by @dain in #102
  • Share Trino's everyday span matchers by @dain in #87
  • Find Unicode class matches on the class counter by @dain in #91
  • Check short windows for the inner literal by @dain in #103
  • Find class-run matches on the class counter by @dain in #100
  • Test 8- and 16-byte vector widths in CI by @dain in #104
  • Allocate less when generating pattern classes by @dain in #105
  • Size one-pass tables from byte-range targets by @dain in #107
  • Make the generated class the pattern by @dain in #106
  • Pin each pattern's routes to its class by @dain in #108
  • Update to classfile 1.1 by @dain in #109
  • Make the start literal filter cheap to build by @dain in #110
  • Read ASCII and Latin-1 class runs byte by byte by @dain in #112
  • Let C2 inline the matcher constructor again by @dain in #111
  • Estimate release captures as mean costs by @dain in #113
  • Publish preliminary 2.0 benchmark results by @dain in #114
  • Document Trino and LIKE compilation options by @dain in #115
  • Make generated Trino patterns their own class by @dain in #131
  • Lead the README with languages and generated code by @dain in #124
  • Bound compilation by retained program memory by @dain in #133
  • Bound capture search memory by the forward share by @dain in #146
  • Pick alternation groups within the matcher region by @dain in #145

New Contributors

Full Changelog: 1.2...2.0