fix: add Jest 30 support and fix time limit in loop-runner #1318

claude · 2026-02-06T16:43:19Z

Bug: export keyword in CommonJS module causes syntax error

This file is a CommonJS module (uses module.exports at the bottom, and the parent package.json lacks "type": "module"). Adding the export keyword creates invalid JavaScript — Node.js will throw SyntaxError: Unexpected token 'export'.

The same issue exists in:

code_to_optimize/js/code_to_optimize_js_cjs/fibonacci_class.js

tests/test_languages/fixtures/js_cjs/math_utils.js

tests/test_languages/fixtures/js_cjs/calculator.js

tests/test_languages/fixtures/js_cjs/helpers/format.js

The CommonJS export detection added in treesitter_utils.py (_is_name_in_commonjs_exports) should handle discovering these functions without needing the export keyword. Remove export from all CJS files.

claude · 2026-02-06T16:51:10Z

export keyword invalid in CommonJS module

This file is in a CommonJS project (no "type": "module" in package.json, no babel/transpiler). The export keyword is ESM syntax and will cause SyntaxError: Unexpected token 'export' when Node.js loads this file.

Either:

Remove export keywords (functions are already exported via module.exports at bottom)

Or convert the project to ESM

Same issue affects: fibonacci_class.js, tests/test_languages/fixtures/js_cjs/math_utils.js, calculator.js, helpers/format.js

claude · 2026-02-06T16:43:28Z

Potential breaking API change: throughput fields changed from str to int

Previously these were serialized as str(self.original_async_throughput) and str(self.best_async_throughput). Now they're passed as raw int values. This JSON is sent to the CodeFlash API server (via cfapi.py where pr_comment.to_json() is called). If the server expects string values for these fields, this will cause a type mismatch or API error.

Verify the server-side API accepts int for these fields before merging.

-Original file line number
+Diff line change
@@ Expand Up / @@ -7,7 +7,7 @@ @@
      * @param {number[]} arr - The array to sort
      * @returns {number[]} - The sorted array
      */
-    function bubbleSort(arr) {
+    export function bubbleSort(arr) {
         const result = arr.slice();
         const n = result.length;
@@ Expand All / @@ -29,7 +29,7 @@ function bubbleSort(arr) { @@
      * @param {number[]} arr - The array to sort
      * @returns {number[]} - The sorted array in descending order
      */
-    function bubbleSortDescending(arr) {
+    export function bubbleSortDescending(arr) {
         const n = arr.length;
         const result = [...arr];
@@ Expand Down @@

-Original file line number
+Diff line change
@@ Expand Up @@
      * @param numbers - Array of numbers to analyze
      * @returns Object containing sum, average, min, max, and range
      */
-    function calculateStats(numbers) {
+    export function calculateStats(numbers) {
         if (numbers.length === 0) {
             return {
                 sum: 0,
@@ Expand Down Expand Up / @@ -42,7 +42,7 @@ function calculateStats(numbers) { @@
      * @param numbers - Array of numbers to normalize
      * @returns Normalized array
      */
-    function normalizeArray(numbers) {
+    export function normalizeArray(numbers) {
         if (numbers.length === 0) return [];
         const min = findMin(numbers);
@@ Expand All / @@ -62,7 +62,7 @@ function normalizeArray(numbers) { @@
      * @param weights - Array of weights (same length as values)
      * @returns The weighted average
      */
-    function weightedAverage(values, weights) {
+    export function weightedAverage(values, weights) {
         if (values.length === 0 || values.length !== weights.length) {
             return 0;
         }
@@ Expand Down @@

-Original file line number
+Diff line change
@@ Expand Up / @@ -8,7 +8,7 @@ @@
      * @param {number} n - The index of the Fibonacci number to calculate
      * @returns {number} - The nth Fibonacci number
      */
-    function fibonacci(n) {
+    export function fibonacci(n) {
         if (n <= 1) {
             return n;
         }
@@ Expand All / @@ -20,7 +20,7 @@ function fibonacci(n) { @@
      * @param {number} num - The number to check
      * @returns {boolean} - True if num is a Fibonacci number
      */
-    function isFibonacci(num) {
+    export function isFibonacci(num) {
         // A number is Fibonacci if one of (5*n*n + 4) or (5*n*n - 4) is a perfect square
         const check1 = 5 * num * num + 4;
         const check2 = 5 * num * num - 4;
@@ Expand All / @@ -33,7 +33,7 @@ function isFibonacci(num) { @@
      * @param {number} n - The number to check
      * @returns {boolean} - True if n is a perfect square
      */
-    function isPerfectSquare(n) {
+    export function isPerfectSquare(n) {
         const sqrt = Math.sqrt(n);
         return sqrt === Math.floor(sqrt);
     }
@@ Expand All / @@ -43,7 +43,7 @@ function isPerfectSquare(n) { @@
      * @param {number} n - The number of Fibonacci numbers to generate
      * @returns {number[]} - Array of Fibonacci numbers
      */
-    function fibonacciSequence(n) {
+    export function fibonacciSequence(n) {
         const result = [];
         for (let i = 0; i < n; i++) {
             result.push(fibonacci(i));
@@ Expand Down @@

-Original file line number
+Diff line change
@@ Expand Up / @@ -8,7 +8,7 @@ @@
      * @param numbers - Array of numbers to sum
      * @returns The sum of all numbers
      */
-    function sumArray(numbers) {
+    export function sumArray(numbers) {
         // Intentionally inefficient - using reduce with spread operator
         let result = 0;
         for (let i = 0; i < numbers.length; i++) {
@@ Expand All / @@ -22,7 +22,7 @@ function sumArray(numbers) { @@
      * @param numbers - Array of numbers
      * @returns The average value
      */
-    function average(numbers) {
+    export function average(numbers) {
         if (numbers.length === 0) return 0;
         return sumArray(numbers) / numbers.length;
     }
@@ Expand All / @@ -32,7 +32,7 @@ function average(numbers) { @@
      * @param numbers - Array of numbers
      * @returns The maximum value
      */
-    function findMax(numbers) {
+    export function findMax(numbers) {
         if (numbers.length === 0) return -Infinity;
         // Intentionally inefficient - sorting instead of linear scan
@@ Expand All / @@ -45,7 +45,7 @@ function findMax(numbers) { @@
      * @param numbers - Array of numbers
      * @returns The minimum value
      */
-    function findMin(numbers) {
+    export function findMin(numbers) {
         if (numbers.length === 0) return Infinity;
         // Intentionally inefficient - sorting instead of linear scan
@@ Expand Down @@

-Original file line number
+Diff line change
@@ Expand Up / @@ -7,7 +7,7 @@ @@
      * @param {string} str - The string to reverse
      * @returns {string} - The reversed string
      */
-    function reverseString(str) {
+    export function reverseString(str) {
         // Intentionally inefficient O(n²) implementation for testing
         let result = '';
         for (let i = str.length - 1; i >= 0; i--) {
@@ Expand All / @@ -27,7 +27,7 @@ function reverseString(str) { @@
      * @param {string} str - The string to check
      * @returns {boolean} - True if str is a palindrome
      */
-    function isPalindrome(str) {
+    export function isPalindrome(str) {
         const cleaned = str.toLowerCase().replace(/[^a-z0-9]/g, '');
         return cleaned === reverseString(cleaned);
     }
@@ Expand All / @@ -38,7 +38,7 @@ function isPalindrome(str) { @@
      * @param {string} sub - The substring to count
      * @returns {number} - Number of occurrences
      */
-    function countOccurrences(str, sub) {
+    export function countOccurrences(str, sub) {
         let count = 0;
         let pos = 0;
@@ Expand All / @@ -57,7 +57,7 @@ function countOccurrences(str, sub) { @@
      * @param {string[]} strs - Array of strings
      * @returns {string} - The longest common prefix
      */
-    function longestCommonPrefix(strs) {
+    export function longestCommonPrefix(strs) {
         if (strs.length === 0) return '';
         if (strs.length === 1) return strs[0];
@@ Expand All / @@ -78,7 +78,7 @@ function longestCommonPrefix(strs) { @@
      * @param {string} str - The string to convert
      * @returns {string} - The title-cased string
      */
-    function toTitleCase(str) {
+    export function toTitleCase(str) {
         return str
             .toLowerCase()
             .split(' ')
@@ Expand Down @@

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

fix: add Jest 30 support and fix time limit in loop-runner #1318

Uh oh!

Diff view

Diff view

There are no files selected for viewing

claude bot Feb 6, 2026

Uh oh!

claude bot Feb 6, 2026

Uh oh!

Uh oh!

claude bot Feb 6, 2026

Uh oh!

Uh oh!

Uh oh!

-Original file line number
+Diff line change
@@ Expand Up / @@ -3,7 +3,7 @@ @@
      * Intentionally inefficient for optimization testing.
      */
-    class FibonacciCalculator {
+    export class FibonacciCalculator {
         constructor() {
             // No initialization needed
         }
@@ Expand Down @@

-Original file line number
+Diff line change
@@ -1,10 +1,5 @@
     from __future__ import annotations
-    import datetime as dt
-    import re
-    import humanize
     def humanize_runtime(time_in_ns: int) -> str:
         runtime_human: str = str(time_in_ns)
@@ Expand All / @@ -14,22 +9,32 @@ def humanize_runtime(time_in_ns: int) -> str: @@
         if time_in_ns / 1000 >= 1:
             time_micro = float(time_in_ns) / 1000
-            runtime_human = humanize.precisedelta(dt.timedelta(microseconds=time_micro), minimum_unit="microseconds")
-            units = re.split(r",|\s", runtime_human)[1]
-            if units in {"microseconds", "microsecond"}:
+            # Direct unit determination and formatting without external library
+            if time_micro < 1000:
                 runtime_human = f"{time_micro:.3g}"
-            elif units in {"milliseconds", "millisecond"}:
-                runtime_human = "%.3g" % (time_micro / 1000)
-            elif units in {"seconds", "second"}:
-                runtime_human = "%.3g" % (time_micro / (1000**2))
-            elif units in {"minutes", "minute"}:
-                runtime_human = "%.3g" % (time_micro / (60 * 1000**2))
-            elif units in {"hour", "hours"}:  # hours
-                runtime_human = "%.3g" % (time_micro / (3600 * 1000**2))
+                units = "microseconds" if time_micro >= 2 else "microsecond"
+            elif time_micro < 1000000:
+                time_milli = time_micro / 1000
+                runtime_human = f"{time_milli:.3g}"
+                units = "milliseconds" if time_milli >= 2 else "millisecond"
+            elif time_micro < 60000000:
+                time_sec = time_micro / 1000000
+                runtime_human = f"{time_sec:.3g}"
+                units = "seconds" if time_sec >= 2 else "second"
+            elif time_micro < 3600000000:
+                time_min = time_micro / 60000000
+                runtime_human = f"{time_min:.3g}"
+                units = "minutes" if time_min >= 2 else "minute"
+            elif time_micro < 86400000000:
+                time_hour = time_micro / 3600000000
+                runtime_human = f"{time_hour:.3g}"
+                units = "hours" if time_hour >= 2 else "hour"
             else:  # days
-                runtime_human = "%.3g" % (time_micro / (24 * 3600 * 1000**2))
+                time_day = time_micro / 86400000000
+                runtime_human = f"{time_day:.3g}"
+                units = "days" if time_day >= 2 else "day"
         runtime_human_parts = str(runtime_human).split(".")
         if len(runtime_human_parts[0]) == 1:
             if runtime_human_parts[0] == "1" and len(runtime_human_parts) > 1:
@@ Expand Down @@

-Original file line number
+Diff line change
@@ Expand Up / @@ -26,10 +26,10 @@ class PrComment: @@
         def to_json(self) -> dict[str, Union[str, int, dict[str, dict[str, int]], list[BenchmarkDetail], None]]:
             report_table: dict[str, dict[str, int]] = {}
-            for test_type, result in self.winning_behavior_test_results.get_test_pass_fail_report_by_type().items():
+            for test_type, test_result in self.winning_behavior_test_results.get_test_pass_fail_report_by_type().items():
                 name = test_type.to_name()
                 if name:
-                    report_table[name] = result
+                    report_table[name] = test_result
             result: dict[str, Union[str, int, dict[str, dict[str, int]], list[BenchmarkDetail], None]] = {
                 "optimization_explanation": self.optimization_explanation,
@@ Expand All @@
             }
             if self.original_async_throughput is not None and self.best_async_throughput is not None:
-                result["original_async_throughput"] = str(self.original_async_throughput)
-                result["best_async_throughput"] = str(self.best_async_throughput)
+                result["original_async_throughput"] = self.original_async_throughput
+                result["best_async_throughput"] = self.best_async_throughput
             return result
@@ Expand Down @@

fix: add Jest 30 support and fix time limit in loop-runner #1318

Are you sure you want to change the base?

Uh oh!

fix: add Jest 30 support and fix time limit in loop-runner #1318

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

claude bot Feb 6, 2026

Choose a reason for hiding this comment

Uh oh!

claude bot Feb 6, 2026

Choose a reason for hiding this comment

Uh oh!

Uh oh!

claude bot Feb 6, 2026

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Uh oh!