aboutsummaryrefslogtreecommitdiff
path: root/src/js_lexer/identifier.zig
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--src/js_lexer/identifier.zig16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/js_lexer/identifier.zig b/src/js_lexer/identifier.zig
index 4a48b5d17..8c1a59c2b 100644
--- a/src/js_lexer/identifier.zig
+++ b/src/js_lexer/identifier.zig
@@ -1800,7 +1800,7 @@ pub const JumpTableInline = struct {
// iter = std.unicode.Utf8Iterator{ .bytes = code, .i = 0 };
// hash_table_count = 0;
// while (iter.nextCodepoint()) |cp| {
-// hash_table_count += @as(usize, @boolToInt(HashTable.isIdentifierStart(cp) or HashTable.isIdentifierPart(cp)));
+// hash_table_count += @as(usize, @intFromBool(HashTable.isIdentifierStart(cp) or HashTable.isIdentifierPart(cp)));
// }
// }
// hash_table_elapsed += timer.read();
@@ -1816,7 +1816,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// jump_table_count += @as(
// usize,
-// @boolToInt(JumpTable.isIdentifierStart(cp) or JumpTable.isIdentifierPart(cp)),
+// @intFromBool(JumpTable.isIdentifierStart(cp) or JumpTable.isIdentifierPart(cp)),
// );
// }
// }
@@ -1833,7 +1833,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// binary_search_count += @as(
// usize,
-// @boolToInt(
+// @intFromBool(
// BinarySearch.isIdentifierStart(
// cp,
// ) or BinarySearch.isIdentifierPart(
@@ -1856,7 +1856,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// bitset_count += @as(
// usize,
-// @boolToInt(
+// @intFromBool(
// Bitset.isIdentifierStart(
// cp,
// ) or Bitset.isIdentifierPart(
@@ -1930,7 +1930,7 @@ pub const JumpTableInline = struct {
// iter = std.unicode.Utf8Iterator{ .bytes = code, .i = 0 };
// hash_table_count = 0;
// while (iter.nextCodepoint()) |cp| {
-// hash_table_count += @as(usize, @boolToInt(HashTable.isIdentifierStart(cp) or HashTable.isIdentifierPart(cp)));
+// hash_table_count += @as(usize, @intFromBool(HashTable.isIdentifierStart(cp) or HashTable.isIdentifierPart(cp)));
// }
// }
// hash_table_elapsed += timer.read();
@@ -1946,7 +1946,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// jump_table_count += @as(
// usize,
-// @boolToInt(JumpTable.isIdentifierStart(cp) or JumpTable.isIdentifierPart(cp)),
+// @intFromBool(JumpTable.isIdentifierStart(cp) or JumpTable.isIdentifierPart(cp)),
// );
// }
// }
@@ -1963,7 +1963,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// binary_search_count += @as(
// usize,
-// @boolToInt(
+// @intFromBool(
// BinarySearch.isIdentifierStart(
// cp,
// ) or BinarySearch.isIdentifierPart(
@@ -1986,7 +1986,7 @@ pub const JumpTableInline = struct {
// while (iter.nextCodepoint()) |cp| {
// bitset_count += @as(
// usize,
-// @boolToInt(
+// @intFromBool(
// Bitset.isIdentifierStart(
// cp,
// ) or Bitset.isIdentifierPart(