commit 6fa7d5d4ad02f9694bfabf0ef42f65236c02d1ef (tree)
parent c0448a6c7c6a544ddfabd1a42c9dc42b47649fa8
Author: andrewkraevskii <andrew.kraevskii@gmail.com>
Date: Mon, 10 Feb 2025 02:26:52 +0300
std.mem: add missing check to lastIndexOfLinear
Diffstat:
1 file changed, 1 insertion(+), 0 deletions(-)
diff --git a/lib/std/mem.zig b/lib/std/mem.zig
@@ -1396,6 +1396,7 @@ pub fn indexOf(comptime T: type, haystack: []const T, needle: []const T) ?usize
/// Consider using `lastIndexOf` instead of this, which will automatically use a
/// more sophisticated algorithm on larger inputs.
pub fn lastIndexOfLinear(comptime T: type, haystack: []const T, needle: []const T) ?usize {
+ if (needle.len > haystack.len) return null;
var i: usize = haystack.len - needle.len;
while (true) : (i -= 1) {
if (mem.eql(T, haystack[i..][0..needle.len], needle)) return i;