aboutsummaryrefslogtreecommitdiff
path: root/src/comptime_string_map.zig
diff options
context:
space:
mode:
authorGravatar Jarred Sumner <jarred@jarredsumner.com> 2022-03-10 05:40:51 -0800
committerGravatar Jarred Sumner <jarred@jarredsumner.com> 2022-03-10 05:40:51 -0800
commit17c1f403c14ca78949efd9cd20f5379ff407fb4c (patch)
treed7217f45d3659f953c1f0faad4602b4d1c70bfc5 /src/comptime_string_map.zig
parent14220553042733bce4c27c2566b5a1809a20e914 (diff)
downloadbun-17c1f403c14ca78949efd9cd20f5379ff407fb4c.tar.gz
bun-17c1f403c14ca78949efd9cd20f5379ff407fb4c.tar.zst
bun-17c1f403c14ca78949efd9cd20f5379ff407fb4c.zip
Update comptime_string_map.zig
Diffstat (limited to 'src/comptime_string_map.zig')
-rw-r--r--src/comptime_string_map.zig2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/comptime_string_map.zig b/src/comptime_string_map.zig
index f6ce6db8c..bae2fce8a 100644
--- a/src/comptime_string_map.zig
+++ b/src/comptime_string_map.zig
@@ -26,7 +26,7 @@ pub fn ComptimeStringMapWithKeyType(comptime KeyType: type, comptime V: type, co
return a.key.len < b.key.len;
}
// https://stackoverflow.com/questions/11227809/why-is-processing-a-sorted-array-faster-than-processing-an-unsorted-array
- @setEvalBranchQuota(4000);
+ @setEvalBranchQuota(99999);
return std.mem.order(KeyType, a.key, b.key) == .lt;
}
}).lenAsc;