diff options
| author |  Jarred Sumner <jarred@jarredsumner.com>
| 2023-07-11 19:14:34 -0700 |
|---|---|---|
| committer |  GitHub <noreply@github.com>
| 2023-07-11 19:14:34 -0700 |
| commit | cbb88672f217a90db1aa1eb29cd92d5d9035b22b (patch) | |
| tree | 43a00501f3cde495967e116f0b660777051551f8 /src/js_lexer/identifier.zig | |
| parent | 1f900cff453700b19bca2acadfe26da4468c1282 (diff) | |
| parent | 34b0e7a2bbd8bf8097341cdb0075d0908283e834 (diff) | |
| download | bun-jarred/esm-conditions.tar.gz bun-jarred/esm-conditions.tar.zst bun-jarred/esm-conditions.zip | |
Merge branch 'main' into jarred/esm-conditionsjarred/esm-conditions
Diffstat (limited to '')
| -rw-r--r-- | src/js_lexer/identifier.zig | 16 |
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( |