Skip to content

⚡️ Speed up method Workload.filterEvens by 7% #1935

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
codeflash-ai wants to merge 1 commit into from
Closed

⚡️ Speed up method Workload.filterEvens by 7% #1935

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 18 additions & 4 deletions tests/test_languages/fixtures/java_tracer_e2e/src/main/java/com/example/Workload.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,10 +22,24 @@ public static String repeatString(String s, int count) {
}

public static List<Integer> filterEvens(List<Integer> numbers) {
List<Integer> result = new ArrayList<>();
for (int n : numbers) {
if (n % 2 == 0) {
result.add(n);
int size = numbers.size();
List<Integer> result = new ArrayList<>(size);
// Use indexed access for RandomAccess lists to avoid iterator overhead,
// fall back to enhanced-for for other list implementations.
if (numbers instanceof java.util.RandomAccess) {
for (int i = 0; i < size; i++) {
Integer num = numbers.get(i);
int n = num;
if ((n & 1) == 0) {
result.add(num);
}
}
} else {
for (Integer num : numbers) {
int n = num;
if ((n & 1) == 0) {
result.add(num);
}
}
}
return result;
Expand Down
Loading