also looking at this
Migrate to zig 0.16
#5
13 files
+222
-239
Review threads live on the whole diff, not on one commit, so none are shown here - a thread's line means something in the branch's final form, and painting it into an intermediate step would put it on code it is not about.
| @@ -6,11 +6,7 @@ const Composer = .Composer; | ||
| 6 | 6 | const Lint = .Lint; |
| 7 | 7 | const ComplexityAnalyzer = .ComplexityAnalyzer; |
| 8 | 8 | |
| 9 | pub fn main() !void { | |
| 10 | var gpa = std.heap.GeneralPurposeAllocator(.{}){}; | |
| 11 | defer _ = gpa.deinit(); | |
| 12 | const allocator = gpa.allocator(); | |
| 13 | ||
| 9 | pub fn main(init: std.process.Init) !void { | |
| 14 | 10 | std.debug.print("\n=== Advanced Regex Features Examples ===\n\n", .{}); |
| 15 | 11 | |
| 16 | 12 | // Example 1: Builder API - Type-safe pattern construction |
| @@ -19,7 +15,7 @@ pub fn main() !void { | ||
| 19 | 15 | std.debug.print("Example 1: Builder API for Type-Safe Construction\n", .{}); |
| 20 | 16 | std.debug.print("───────────────────────────────────────────────\n", .{}); |
| 21 | 17 | |
| 22 | var builder = Builder.init(allocator); | |
| 18 | var builder = Builder.init(init.gpa); | |
| 23 | 19 | defer builder.deinit(); |
| 24 | 20 | |
| 25 | 21 | // Build a pattern for email validation |
| @@ -35,11 +31,11 @@ pub fn main() !void { renamed throughout | ||
| 35 | 31 | _ = try builder.endOfLine(); |
| 36 | 32 | |
| 37 | 33 | const pattern = try builder.build(); |
| 38 | defer allocator.free(pattern); | |
| 34 | defer init.gpa.free(pattern); | |
| 39 | 35 | |
| 40 | 36 | std.debug.print("Built pattern: {s}\n", .{pattern}); |
| 41 | 37 | |
| 42 | var regex = try Regex.compile(allocator, pattern); | |
| 38 | var regex = try Regex.compile(init.gpa, pattern); | |
| 43 | 39 | defer regex.deinit(); |
| 44 | 40 | |
| 45 | 41 | const test_emails = [_][]const u8{ |
| @@ -64,21 +60,21 @@ pub fn main() !void { renamed throughout | ||
| 64 | 60 | std.debug.print("───────────────────────────────────────────────\n", .{}); |
| 65 | 61 | |
| 66 | 62 | // Use predefined patterns |
| 67 | const email_pattern = try Patterns.email(allocator); | |
| 68 | defer allocator.free(email_pattern); | |
| 63 | const email_pattern = try Patterns.email(init.gpa); | |
| 64 | defer init.gpa.free(email_pattern); | |
| 69 | 65 | |
| 70 | const url_pattern = try Patterns.url(allocator); | |
| 71 | defer allocator.free(url_pattern); | |
| 66 | const url_pattern = try Patterns.url(init.gpa); | |
| 67 | defer init.gpa.free(url_pattern); | |
| 72 | 68 | |
| 73 | const phone_pattern = try Patterns.phoneUS(allocator); | |
| 74 | defer allocator.free(phone_pattern); | |
| 69 | const phone_pattern = try Patterns.phoneUS(init.gpa); | |
| 70 | defer init.gpa.free(phone_pattern); | |
| 75 | 71 | |
| 76 | 72 | std.debug.print("Email pattern: {s}\n", .{email_pattern}); |
| 77 | 73 | std.debug.print("URL pattern: {s}\n", .{url_pattern}); |
| 78 | 74 | std.debug.print("Phone pattern: {s}\n\n", .{phone_pattern}); |
| 79 | 75 | |
| 80 | 76 | // Test phone number pattern |
| 81 | var phone_regex = try Regex.compile(allocator, phone_pattern); | |
| 77 | var phone_regex = try Regex.compile(init.gpa, phone_pattern); | |
| 82 | 78 | defer phone_regex.deinit(); |
| 83 | 79 | |
| 84 | 80 | const test_phones = [_][]const u8{ |
| @@ -103,7 +99,7 @@ pub fn main() !void { | ||
| 103 | 99 | std.debug.print("Example 3: Pattern Composition\n", .{}); |
| 104 | 100 | std.debug.print("───────────────────────────────────────────────\n", .{}); |
| 105 | 101 | |
| 106 | var composer = Composer.init(allocator); | |
| 102 | var composer = Composer.init(init.gpa); | |
| 107 | 103 | defer composer.deinit(); |
| 108 | 104 | |
| 109 | 105 | // Compose multiple patterns with OR |
| @@ -112,11 +108,11 @@ pub fn main() !void { renamed throughout | ||
| 112 | 108 | _ = try composer.add("bird"); |
| 113 | 109 | |
| 114 | 110 | const alternatives = try composer.alternatives(); |
| 115 | defer allocator.free(alternatives); | |
| 111 | defer init.gpa.free(alternatives); | |
| 116 | 112 | |
| 117 | 113 | std.debug.print("Composed pattern (OR): {s}\n", .{alternatives}); |
| 118 | 114 | |
| 119 | var regex = try Regex.compile(allocator, alternatives); | |
| 115 | var regex = try Regex.compile(init.gpa, alternatives); | |
| 120 | 116 | defer regex.deinit(); |
| 121 | 117 | |
| 122 | 118 | const test_strings = [_][]const u8{ |
| @@ -145,7 +141,7 @@ pub fn main() !void { | ||
| 145 | 141 | const problematic_pattern = "(a+)+b"; |
| 146 | 142 | std.debug.print("Analyzing pattern: \"{s}\"\n\n", .{problematic_pattern}); |
| 147 | 143 | |
| 148 | var lint = Lint.init(allocator, problematic_pattern); | |
| 144 | var lint = Lint.init(init.gpa, problematic_pattern); | |
| 149 | 145 | defer lint.deinit(); |
| 150 | 146 | |
| 151 | 147 | try lint.analyze(); |
| @@ -157,7 +153,7 @@ pub fn main() !void { | ||
| 157 | 153 | const good_pattern = "^[a-z]+$"; |
| 158 | 154 | std.debug.print("Analyzing pattern: \"{s}\"\n\n", .{good_pattern}); |
| 159 | 155 | |
| 160 | var lint2 = Lint.init(allocator, good_pattern); | |
| 156 | var lint2 = Lint.init(init.gpa, good_pattern); | |
| 161 | 157 | defer lint2.deinit(); |
| 162 | 158 | |
| 163 | 159 | try lint2.analyze(); |
| @@ -198,7 +194,7 @@ pub fn main() !void { | ||
| 198 | 194 | std.debug.print("───────────────────────────────────────────────\n", .{}); |
| 199 | 195 | |
| 200 | 196 | // Build a complex pattern using the builder |
| 201 | var builder = Builder.init(allocator); | |
| 197 | var builder = Builder.init(init.gpa); | |
| 202 | 198 | defer builder.deinit(); |
| 203 | 199 | |
| 204 | 200 | std.debug.print("Building a URL validator:\n", .{}); |
| @@ -215,13 +211,13 @@ pub fn main() !void { renamed throughout | ||
| 215 | 211 | _ = try builder.endOfLine(); |
| 216 | 212 | |
| 217 | 213 | const url_pattern_built = try builder.build(); |
| 218 | defer allocator.free(url_pattern_built); | |
| 214 | defer init.gpa.free(url_pattern_built); | |
| 219 | 215 | |
| 220 | 216 | std.debug.print("Built pattern: {s}\n\n", .{url_pattern_built}); |
| 221 | 217 | |
| 222 | 218 | // Lint the pattern |
| 223 | 219 | std.debug.print("Linting the pattern:\n", .{}); |
| 224 | var lint = Lint.init(allocator, url_pattern_built); | |
| 220 | var lint = Lint.init(init.gpa, url_pattern_built); | |
| 225 | 221 | defer lint.deinit(); |
| 226 | 222 | |
| 227 | 223 | try lint.analyze(); |
| @@ -232,7 +228,7 @@ pub fn main() !void { | ||
| 232 | 228 | std.debug.print("Complexity: {s} (score: {d})\n\n", .{ @tagName(complexity.getLevel()), complexity.complexity_score }); |
| 233 | 229 | |
| 234 | 230 | // Test the pattern |
| 235 | var regex = try Regex.compile(allocator, url_pattern_built); | |
| 231 | var regex = try Regex.compile(init.gpa, url_pattern_built); | |
| 236 | 232 | defer regex.deinit(); |
| 237 | 233 | |
| 238 | 234 | const test_urls = [_][]const u8{ |
| @@ -257,7 +253,7 @@ pub fn main() !void { | ||
| 257 | 253 | std.debug.print("Example 7: Complex Pattern with Builder\n", .{}); |
| 258 | 254 | std.debug.print("───────────────────────────────────────────────\n", .{}); |
| 259 | 255 | |
| 260 | var builder = Builder.init(allocator); | |
| 256 | var builder = Builder.init(init.gpa); | |
| 261 | 257 | defer builder.deinit(); |
| 262 | 258 | |
| 263 | 259 | // Build a pattern for matching IPv4 addresses |
| @@ -301,11 +297,11 @@ pub fn main() !void { renamed throughout | ||
| 301 | 297 | _ = try builder.endOfLine(); |
| 302 | 298 | |
| 303 | 299 | const ipv4_pattern = try builder.build(); |
| 304 | defer allocator.free(ipv4_pattern); | |
| 300 | defer init.gpa.free(ipv4_pattern); | |
| 305 | 301 | |
| 306 | 302 | std.debug.print("Built pattern: {s}\n\n", .{ipv4_pattern}); |
| 307 | 303 | |
| 308 | var regex = try Regex.compile(allocator, ipv4_pattern); | |
| 304 | var regex = try Regex.compile(init.gpa, ipv4_pattern); | |
| 309 | 305 | defer regex.deinit(); |
| 310 | 306 | |
| 311 | 307 | const test_ips = [_][]const u8{ |