zig

commit 75b48ef503204d3ba005647ecce8fda4657a8588 (tree)
parent 57874ce619c098a4affd6804a71e0604ff3874c8
Author: Karl Seguin <karlseguin@users.noreply.github.com>
Date:   Mon,  9 Oct 2023 21:50:16 +0800

std.mem: use indexOfScalarPos when indexOf is called where needle.len == 1

When `std.mem.indexOf` is called with a single-item needle, use `indexOfScalarPos` which is significantly faster than the more general `indexOfPosLinear`.  This can be done without introducing overhead to normal cases (where `needle.len > 1`).
Diffstat:
M
lib/std/mem.zig
 | 
6
+++++-

1 file changed, 5 insertions(+), 1 deletion(-)
diff --git a/lib/std/mem.zig b/lib/std/mem.zig
@@ -1344,7 +1344,11 @@ pub fn lastIndexOf(comptime T: type, haystack: []const T, needle: []const T) ?us
 /// Uses Boyer-Moore-Horspool algorithm on large inputs; `indexOfPosLinear` on small inputs.
 pub fn indexOfPos(comptime T: type, haystack: []const T, start_index: usize, needle: []const T) ?usize {
     if (needle.len > haystack.len) return null;
-    if (needle.len == 0) return start_index;
+    if (needle.len < 2) {
+        if (needle.len == 0) return start_index;
+        // indexOfScalarPos is significantly faster than indexOfPosLinear
+        return indexOfScalarPos(T, haystack, start_index, needle[0]);
+    }
 
     if (!meta.trait.hasUniqueRepresentation(T) or haystack.len < 52 or needle.len <= 4)
         return indexOfPosLinear(T, haystack, start_index, needle);