| ... | ... | @@ -66,10 +66,10 @@ pub const URL = struct { |
| 66 | 66 | |
| 67 | 67 | // 8. |
| 68 | 68 | // codepoint index into inputl |
| 69 | | var pointer: isize = 0; |
| 69 | var pointer: usize = 0; |
| 70 | 70 | // byte index into inputl |
| 71 | 71 | // moved at the same time as pointer |
| 72 | | // if pointer is -1, i must not be read |
| 72 | // if pointer is > length, i must not be read |
| 73 | 73 | var i: usize = 0; |
| 74 | 74 | // inputl[i], must change in tandem with i |
| 75 | 75 | var c: u8 = if (length > 0) inputl.items[i] else 0; |
| ... | ... | @@ -1078,12 +1078,11 @@ fn endsInANumber(input: []const u8) bool { |
| 1078 | 1078 | // > This is equivalent to checking that last is "0X" or "0x", followed by zero or more ASCII hex digits. |
| 1079 | 1079 | // 6. Return false. |
| 1080 | 1080 | |
| 1081 | | _ = std.mem.splitBackwardsScalar; |
| 1082 | 1081 | var end = input.len; |
| 1083 | 1082 | var start: usize = if (std.mem.lastIndexOfScalar(u8, input[0..end], '.')) |i| i + 1 else 0; |
| 1084 | 1083 | if (end - start == 0) { |
| 1085 | 1084 | if (std.mem.count(u8, input, ".") == 0) return false; |
| 1086 | | end = start; |
| 1085 | end = start - 1; |
| 1087 | 1086 | start = if (std.mem.lastIndexOfScalar(u8, input[0..end], '.')) |i| i + 1 else 0; |
| 1088 | 1087 | } |
| 1089 | 1088 | const last = input[start..end]; |