Zig 0.17.0-dev (Split by item)

This is an example of documentation generated by ZigDoc, an alternative to Zig's built-in Auto Doc feature. See also examples in other modes/formats. The project being documented here (as the example) is the Zig library itself.

find

Search for needle in haystack and return the index of the first occurrence. Uses Boyer-Moore-Horspool algorithm on large inputs; linear search on small inputs. Returns null if needle is not found.

mem.find

pub fn find(comptime T: type, haystack: []const T, needle: []const T) ?usize

File

lib/std/mem.zig:1430

Code

pub fn find(comptime T: type, haystack: []const T, needle: []const T) ?usize {
    return findPos(T, haystack, 0, needle);
}