LibRegex: Make codegen+optimisation for alternatives much faster

Just a little thinking outside the box, and we can now parse and
optimise a million copies of "a|" chained together in just a second :^)

1 files changed, 5 insertions, 2 deletions

diff --git a/Userland/Libraries/LibRegex/RegexDebug.h b/Userland/Libraries/LibRegex/RegexDebug.h
index 8d22fbd419..6b9d343fbc 100644
--- a/Userland/Libraries/LibRegex/RegexDebug.h
+++ b/Userland/Libraries/LibRegex/RegexDebug.h
@@ -35,9 +35,12 @@ public:
     template<typename T>
     void print_bytecode(Regex<T> const& regex) const
     {
-        MatchState state;
-        auto& bytecode = regex.parser_result.bytecode;
+        print_bytecode(regex.parser_result.bytecode);
+    }
 
+    void print_bytecode(ByteCode const& bytecode) const
+    {
+        MatchState state;
         for (;;) {
             auto& opcode = bytecode.get_opcode(state);
             print_opcode("PrintBytecode", opcode, state);