motiejus/zig
1
Fork 0
Code Releases Activity

Check if the type has unique bit representation to see if it can be compared byte-wise

Browse Source
This commit is contained in:
dec05eba
2020-09-05 15:20:48 +02:00
parent db51821a97
commit 3a6e6bd538
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lib/std/mem.zig
View File

@@ -897,9 +897,7 @@ fn boyerMooreHorspoolPreprocess(pattern: []const u8, table: *[256]usize) void {
pub fn lastIndexOf(comptime T: type, haystack: []const T, needle: []const T) ?usize {
if (needle.len > haystack.len or needle.len == 0) return null;
// byte comparison with float doesn't work because +0.0 and -0.0 and considered
// equal but their byte representations are not equal.
if (@typeInfo(T) == .Float or haystack.len < 32 or needle.len <= 2)
if (!meta.trait.hasUniqueRepresentation(T) or haystack.len < 32 or needle.len <= 2)
return lastIndexOfLinear(T, haystack, needle);
const haystack_bytes = sliceAsBytes(haystack);
@@ -923,9 +921,7 @@ pub fn lastIndexOf(comptime T: type, haystack: []const T, needle: []const T) ?us
pub fn indexOfPos(comptime T: type, haystack: []const T, start_index: usize, needle: []const T) ?usize {
if (needle.len > haystack.len or needle.len == 0) return null;
// byte comparison with float doesn't work because +0.0 and -0.0 and considered
// equal but their byte representations are not equal.
if (@typeInfo(T) == .Float or haystack.len < 32 or needle.len <= 2)
if (!meta.trait.hasUniqueRepresentation(T) or haystack.len < 32 or needle.len <= 2)
return indexOfPosLinear(T, haystack, start_index, needle);
const haystack_bytes = sliceAsBytes(haystack);