Add regex.matchPos

A convenience function, which does the slicing and position adjustments
for you, to match at a given position within the haystack string.

Author: mnemnion

README.md

@@ -11,7 +11,7 @@ The provided Regex type allows 64 'operations' and 8 unique ASCII character sets
 Drop the file into your project, or use the Zig build system:
 
 ```zig
-zig fetch --save "https://github.com/mnemnion/mvzr/archive/refs/tags/v0.1.2.tar.gz"
+zig fetch --save "https://github.com/mnemnion/mvzr/archive/refs/tags/v0.2.0.tar.gz"
 ```
 
 I'll do my best to keep that URL fresh, but it pays to check over here: ➔

build.zig

@@ -12,12 +12,15 @@ pub fn build(b: *std.Build) void {
     // set a preferred release mode, allowing the user to decide how to optimize.
     const optimize = b.standardOptimizeOption(.{});
 
+    const test_filters = b.option([]const []const u8, "test-filter", "Skip tests that do not match any filter") orelse &[0][]const u8{};
+
     // Creates a step for unit testing. This only builds the test executable
     // but does not run it.
     const lib_unit_tests = b.addTest(.{
         .root_source_file = b.path("src/mvzr.zig"),
         .target = target,
         .optimize = optimize,
+        .filters = test_filters,
     });
 
     const run_lib_unit_tests = b.addRunArtifact(lib_unit_tests);

src/mvzr.zig

@@ -124,6 +124,25 @@ pub fn SizedRegex(ops: comptime_int, char_sets: comptime_int) type {
             }
         }
 
+        /// Match a regex pattern in `haystack` after `pos`.  Returns a `Match`
+        /// if the pattern is found.
+        pub fn matchPos(regex: *const SizedRegexT, pos: usize, haystack: []const u8) ?Match {
+            const substack = haystack[pos..];
+            if (substack.len == 0) return null;
+            const maybe_matched = regex.matchInternal(substack);
+            if (maybe_matched) |m| {
+                const m1 = pos + m[0];
+                const m2 = pos + m[1];
+                return Match{
+                    .slice = haystack[m1..m2],
+                    .start = m1,
+                    .end = m2,
+                };
+            } else {
+                return null;
+            }
+        }
+
         /// Boolean test if the regex matches in the haystack.
         pub fn isMatch(regex: *const SizedRegexT, haystack: []const u8) bool {
             const maybe_matched = regex.matchInternal(haystack);
@@ -2119,6 +2138,7 @@ test "workshop" {
     // printRegexString("^[a-zA-Z0-9_!#$%&.-]+@([a-zA-Z0-9.-])+$");
     // try testMatchAll("^[a-zA-Z0-9_!#$%&.-]+@([a-zA-Z0-9.-])+$", "[email protected]");
     //
+    try testMatchAll("(a[bc]){3,5}ac", "abacabacac");
 }
 
 test "heap allocated regex and match" {
@@ -2167,6 +2187,14 @@ test "iteration" {
     try expectEqual(null, r_iter.next());
 }
 
+test "matchPos" {
+    const regex = Regex.compile("abcd").?;
+    const matched = regex.matchPos(4, "abcdabcd").?;
+    try expectEqual(4, matched.start);
+    try expectEqualStrings("abcd", matched.slice);
+    try expectEqual(8, matched.end);
+}
+
 test "comptime regex" {
     const comp_regex = comptime compile("foo+").?;
     const run_match = comp_regex.match("foofoofoo");