1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
//! JIT-008: Return Statement (Early Function Exits)
//!
//! EXTREME TDD - RED Phase Tests
//!
//! Purpose: Add return statement support to JIT compiler
//! Target: Enable early exits, guard clauses, and natural control flow
//!
//! Test Strategy:
//! 1. Simple return - explicit return value
//! 2. Early return - guard clause patterns
//! 3. Return in conditionals - different branches
//! 4. Return in loops - search patterns
//! 5. Multiple returns - complex control flow
//! 6. Nested functions - return from inner functions
#![cfg(feature = "jit")]
#![allow(clippy::expect_used)]
#![allow(clippy::unwrap_used)]
use ruchy::jit::JitCompiler;
use ruchy::Parser;
// ============================================================================
// RED-001: Simple Return Statement
// ============================================================================
#[test]
fn test_jit_008_return_simple() {
// Test: Explicit return from function
let code = r"
fun get_value() -> i32 {
return 42;
}
get_value()
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile simple return: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 42, "Function should return 42");
}
#[test]
fn test_jit_008_return_expression() {
// Test: Return with expression
let code = r"
fun calculate(x: i32) -> i32 {
return x * 2 + 10;
}
calculate(5)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return with expression: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 20, "5*2+10 should be 20");
}
// ============================================================================
// RED-002: Early Return (Guard Clauses)
// ============================================================================
#[test]
fn test_jit_008_return_early_guard() {
// Test: Guard clause - early return on invalid input
let code = r"
fun safe_divide(a: i32, b: i32) -> i32 {
if b == 0 {
return -1;
}
a / b
}
safe_divide(10, 0)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile guard clause: {:?}",
result.err()
);
assert_eq!(result.unwrap(), -1, "Should return -1 for division by zero");
}
#[test]
fn test_jit_008_return_early_success() {
// Test: Guard clause - normal path when guard doesn't trigger
let code = r"
fun safe_divide(a: i32, b: i32) -> i32 {
if b == 0 {
return -1;
}
a / b
}
safe_divide(10, 2)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile guard success path: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 5, "10/2 should be 5");
}
#[test]
fn test_jit_008_return_multiple_guards() {
// Test: Multiple guard clauses
let code = r"
fun validate_range(x: i32) -> i32 {
if x < 0 {
return -1;
}
if x > 100 {
return -2;
}
x
}
validate_range(150)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile multiple guards: {:?}",
result.err()
);
assert_eq!(result.unwrap(), -2, "Should return -2 for x>100");
}
// ============================================================================
// RED-003: Return in Conditionals
// ============================================================================
#[test]
fn test_jit_008_return_if_else_both_branches() {
// Test: Return in both branches of if/else
let code = r"
fun abs_value(x: i32) -> i32 {
if x < 0 {
return -x;
} else {
return x;
}
}
abs_value(-5)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return in both branches: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 5, "abs(-5) should be 5");
}
#[test]
fn test_jit_008_return_nested_if() {
// Test: Return in nested conditionals
let code = r"
fun classify(x: i32) -> i32 {
if x > 0 {
if x > 10 {
return 2;
}
return 1;
}
return 0;
}
classify(15)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile nested if returns: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 2, "classify(15) should be 2 (>10)");
}
// ============================================================================
// RED-004: Return in Loops (Search Patterns)
// ============================================================================
#[test]
fn test_jit_008_return_in_while_loop() {
// Test: Return from inside while loop (search pattern)
let code = r"
fun find_first_even(start: i32, end: i32) -> i32 {
let mut i = start;
while i < end {
if i % 2 == 0 {
return i;
}
i = i + 1;
}
return -1;
}
find_first_even(5, 10)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return in while: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 6, "First even in [5,10) should be 6");
}
#[test]
fn test_jit_008_return_in_for_loop() {
// Test: Return from inside for loop
let code = r"
fun find_target(target: i32) -> i32 {
for i in 0..20 {
if i * i == target {
return i;
}
}
return -1;
}
find_target(64)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return in for: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 8, "sqrt(64) should be 8");
}
#[test]
fn test_jit_008_return_nested_loops() {
// Test: Return from nested loops
let code = r"
fun find_pair_sum(target: i32) -> i32 {
for i in 0..10 {
for j in 0..10 {
if i + j == target {
return i * 100 + j;
}
}
}
return -1;
}
find_pair_sum(7)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return in nested loops: {:?}",
result.err()
);
// First pair that sums to 7: i=0,j=7 → 007, or i=1,j=6 → 106, etc.
// Should find i=0, j=7 first
assert_eq!(
result.unwrap(),
7,
"First pair summing to 7 should be (0,7)"
);
}
// ============================================================================
// RED-005: Multiple Return Points
// ============================================================================
#[test]
fn test_jit_008_multiple_returns_complex() {
// Test: Function with many return points
let code = r"
fun grade(score: i32) -> i32 {
if score >= 90 {
return 4;
}
if score >= 80 {
return 3;
}
if score >= 70 {
return 2;
}
if score >= 60 {
return 1;
}
return 0;
}
grade(85)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile multiple returns: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 3, "Grade for 85 should be 3 (B)");
}
// ============================================================================
// RED-006: Return vs Break/Continue
// ============================================================================
#[test]
fn test_jit_008_return_vs_break() {
// Test: Return exits function, break exits loop
let code = r"
fun test_return() -> i32 {
let mut count_return = 0;
for i in 0..10 {
if i == 3 {
return 100;
}
count_return = count_return + 1;
}
return count_return;
}
fun test_break() -> i32 {
let mut count_break = 0;
for i in 0..10 {
if i == 3 {
break;
}
count_break = count_break + 1;
}
return count_break;
}
test_return() * 10 + test_break()
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile return vs break: {:?}",
result.err()
);
// test_return() = 100 (returns immediately at i=3, count_return still 3)
// test_break() = 3 (breaks at i=3, count_break=3, returns 3)
// result = 100*10 + 3 = 1003
assert_eq!(result.unwrap(), 1003, "return=100, break=3 → 1003");
}
// ============================================================================
// RED-007: Algorithms Using Return
// ============================================================================
#[test]
fn test_jit_008_is_prime_algorithm() {
// Test: Prime checking using early return
let code = r"
fun is_prime(n: i32) -> i32 {
if n <= 1 {
return 0;
}
if n <= 3 {
return 1;
}
let mut i = 2;
while i * i <= n {
if n % i == 0 {
return 0;
}
i = i + 1;
}
return 1;
}
is_prime(17)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile prime checker: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 1, "17 is prime, should return 1");
}
#[test]
fn test_jit_008_binary_search_pattern() {
// Test: Binary search using early return (simplified)
let code = r"
fun binary_search_iterative(target: i32) -> i32 {
let mut low = 0;
let mut high = 100;
while low <= high {
let mid = (low + high) / 2;
if mid == target {
return mid;
}
if mid < target {
low = mid + 1;
} else {
high = mid - 1;
}
}
return -1;
}
binary_search_iterative(42)
";
let ast = Parser::new(code).parse().unwrap();
let mut compiler = JitCompiler::new().unwrap();
let result = compiler.compile_and_execute(&ast);
assert!(
result.is_ok(),
"Should compile binary search: {:?}",
result.err()
);
assert_eq!(result.unwrap(), 42, "Should find target 42");
}