abcop 0.17.2

Must-have ABC complexity gate for AI development. Ruby, Rust, Python, Go, JS/TS, C/C++, PHP, Java, C#, Swift, Zig, Dart, Solidity, ObjC
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

//! End-to-end assertions over the Python backend: AbcSize vectors.

use super::build;
use crate::abc::parse_vector;
use crate::paths::{Lang, parse_file_lang};

fn parse(src: &'static str) -> crate::pylang::PyFile<'static> {
    build(
        src.as_bytes(),
        parse_file_lang(src.as_bytes(), Lang::Py).expect("python parses"),
    )
}

fn scores(src: &'static str) -> Vec<(String, u32, u32, u32)> {
    super::abc::all_scores(&parse(src))
        .into_iter()
        .map(|o| {
            let (a, b, c) = parse_vector(&o.vector);
            (o.name, a, b, c)
        })
        .collect()
}

#[test]
fn assignment_and_binary_count_as_a_and_b() {
    assert_eq!(
        scores("def simple(a):\n    x = a + 1\n    return x\n"),
        vec![("simple".to_string(), 1, 1, 0)]
    );
}

#[test]
fn branches_loops_and_conditions_tally_c() {
    // A: total, i target, +=, -= ; B: unary minus of -5
    // C: for, if, cmp, cmp, and, elif, cmp
    let src = "def branchy(items):\n\
               \x20   total = 0\n\
               \x20   for i in items:\n\
               \x20       if i > 0 and i != 5:\n\
               \x20           total += i\n\
               \x20       elif i < -5:\n\
               \x20           total -= 1\n\
               \x20   return total\n";
    assert_eq!(scores(src), vec![("branchy".to_string(), 4, 1, 7)]);
}

#[test]
fn comprehensions_add_loop_target_and_clauses() {
    // A: squares target, x comprehension target ; B: ** ; C: for_in, if_clause, cmp
    let src = "def comp(items):\n\
               \x20   squares = [x ** 2 for x in items if x > 0]\n\
               \x20   return squares\n";
    assert_eq!(scores(src), vec![("comp".to_string(), 2, 1, 3)]);
}

#[test]
fn try_except_match_ternary_count() {
    // A: r x2, t ; C: except, case x2, ternary
    let src = "def messy(p):\n\
               \x20   try:\n\
               \x20       r = 1\n\
               \x20   except ValueError:\n\
               \x20       r = 2\n\
               \x20   match p:\n\
               \x20       case 0:\n\
               \x20           pass\n\
               \x20       case other:\n\
               \x20           pass\n\
               \x20   t = 1 if p else 2\n\
               \x20   return (r, t)\n";
    assert_eq!(scores(src), vec![("messy".to_string(), 3, 0, 4)]);
}

#[test]
fn nested_functions_are_separate_units() {
    let got = scores(
        "def outer():\n\
                      \x20   def inner(k):\n\
                      \x20       return k * 2\n\
                      \x20   return inner(3)\n",
    );
    assert_eq!(got.len(), 2);
    assert_eq!(got[0], ("outer".to_string(), 0, 1, 0));
    assert_eq!(got[1], ("inner".to_string(), 0, 1, 0));
}

#[test]
fn lambda_rolls_into_enclosing_unit() {
    let src = "def roller(fs):\n\
               \x20   g = lambda v: v + 1\n\
               \x20   return g(fs)\n";
    // A: g ; B: + inside lambda body, call g(fs)
    assert_eq!(scores(src), vec![("roller".to_string(), 1, 2, 0)]);
}

#[test]
fn methods_inside_classes_are_units() {
    let src = "class K:\n\
               \x20   def m(self):\n\
               \x20       self.v = 1\n\
               \x20       return self.v\n";
    // A: 0 (attribute target binds nothing)
    // B: two attribute reads -- target operand and return operand
    assert_eq!(scores(src), vec![("m".to_string(), 0, 2, 0)]);
}