vibecode 0.1.3

Compile-time vibe coding.
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

use vibecode::vibecode;

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn vibecode_can_add() {
        // Given
        #[vibecode]
        fn add(a: u64, b: u64) -> u64 {}

        // When
        let result = add(2, 2);

        // Then
        assert_eq!(result, 4);
    }

    #[test]
    fn vibecode_can_sort() {
        // Given
        #[vibecode(prompt = "Sort in descending order")]
        fn sort(values: Vec<u64>) -> Vec<u64> {}

        // When
        let result = sort(vec![3, 1, 4, 2]);

        // Then
        assert_eq!(result, vec![4, 3, 2, 1]);
    }

    #[test]
    fn vibecode_can_compute_primes() {
        // Given
        #[vibecode(
            prompt = "Compute all prime numbers up to the given limit",
            complexity = "medium"
        )]
        fn primes(limit: u64) -> Vec<u64> {}

        // When
        let result = primes(20);

        // Then
        assert_eq!(result, vec![2, 3, 5, 7, 11, 13, 17, 19]);
    }
}