windjammer 0.48.0

A simple language inspired by Go, Ruby, and Elixir that transpiles to Rust - 80% of Rust's power with 20% of the complexity
Documentation 
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

#![cfg(not(any(
    feature = "parser_tests",
    feature = "analyzer_tests",
    feature = "codegen_tests",
    feature = "interpreter_tests",
    feature = "conformance_tests",
    feature = "integration_tests",
)))]

//! TDD: auto-clone when a local is moved into a nested call argument then reused (E0382).
//!
//! Mirrors `windjammer-game-core/.../uv_unwrap.wj`: `outer(a, b, inner(v))` moves `v`, then `v`
//! is used again (e.g. in a struct literal on the next statement).

use windjammer::analyzer::Analyzer;
use windjammer::codegen::rust::CodeGenerator;
use windjammer::lexer::Lexer;
use windjammer::parser::Parser;
use windjammer::CompilationTarget;

fn parse_and_generate(source: &str) -> String {
    let mut lexer = Lexer::new(source);
    let tokens = lexer.tokenize_with_locations();
    let parser = Box::leak(Box::new(Parser::new(tokens)));
    let program = parser.parse().unwrap();
    let mut analyzer = Analyzer::new();
    let (analyzed_functions, analyzed_structs, _) = analyzer.analyze_program(&program).unwrap();
    let mut generator = CodeGenerator::new_for_module(analyzed_structs, CompilationTarget::Rust);
    generator.generate_program(&program, &analyzed_functions)
}

#[test]
fn test_clone_after_move_in_nested_call_then_struct_field() {
    let source = r#"
pub fn dup_v(v: Vec<usize>) -> Vec<usize> {
    v
}

pub fn merge_three(a: usize, b: Vec<usize>, c: Vec<usize>) -> Vec<usize> {
    c
}

pub struct Island {
    pub uvs: Vec<usize>,
}

pub fn unwrap_like_uv(positions_len: usize, indices: Vec<usize>) -> Vec<usize> {
    if positions_len == 0 {
        let empty: Vec<usize> = vec![]
        let z = Island { uvs: empty }
        return z.uvs
    }
    let mut corner_uv: Vec<usize> = vec![]
    let mut i: usize = 0
    while i < 3 {
        corner_uv.push(i)
        i = i + 1
    }

    let merged = merge_three(positions_len, indices, dup_v(corner_uv))
    let island = Island {
        uvs: corner_uv,
    }
    merged
}
"#;

    let rust = parse_and_generate(source);

    assert!(
        rust.contains("dup_v(") && rust.contains("corner_uv.clone()"),
        "Expected dup_v(corner_uv.clone()) pattern; generated:\n{}",
        rust
    );
}

/// Same pattern as `uv_unwrap.wj`: first argument is `positions.len()`, like
/// `per_vertex_average_uv(positions.len(), indices, duplicate_uv_coords(corner_uv))`.
#[test]
fn test_clone_after_move_with_len_in_outer_call_then_struct_field() {
    let source = r#"
pub fn dup_v(v: Vec<usize>) -> Vec<usize> {
    v
}

pub fn merge_three(a: usize, b: Vec<usize>, c: Vec<usize>) -> Vec<usize> {
    c
}

pub struct Island {
    pub uvs: Vec<usize>,
}

pub fn planar_like(positions: Vec<usize>, indices: Vec<usize>) -> Vec<usize> {
    if positions.len() == 0 {
        return vec![]
    }
    let mut corner_uv: Vec<usize> = vec![]
    let mut i: usize = 0
    while i < 3 {
        corner_uv.push(i)
        i = i + 1
    }

    let merged = merge_three(positions.len(), indices, dup_v(corner_uv))
    let island = Island {
        uvs: corner_uv,
    }
    merged
}
"#;

    let rust = parse_and_generate(source);

    assert!(
        rust.contains("dup_v(") && rust.contains("corner_uv.clone()"),
        "Expected dup_v(corner_uv.clone()) with positions.len(); generated:\n{}",
        rust
    );
}