Merge pull request #34 from rohaquinlop/issue-16

fix(algorithm): #16 fix cognitive complexity

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "complexipy"
-version = "0.3.0"
+version = "0.3.1"
 edition = "2021"
 authors = ["Robin Quintero <[email protected]>"]
 license = "MIT"

complexipy/main.py

@@ -28,7 +28,7 @@
 root_dir = Path(__file__).resolve().parent.parent
 app = typer.Typer(name="complexipy")
 console = Console()
-version = "0.3.0"
+version = "0.3.1"
 
 
 @app.command()

src/cognitive_complexity/mod.rs

@@ -271,7 +271,12 @@ fn statement_cognitive_complexity(statement: Stmt, nesting_level: u64) -> PyResu
             }
         }
         Stmt::Assign(a) => {
-            complexity += count_bool_ops(*a.value);
+            match *a.value {
+                ast::Expr::IfExp(..) => {
+                    complexity += count_bool_ops(*a.value);
+                }
+                _ => {}
+            }
 
             if complexity > 0 {
                 complexity += nesting_level;

src/cognitive_complexity/utils.rs

@@ -134,16 +134,13 @@ pub fn count_bool_ops(expr: ast::Expr) -> u64 {
     let mut complexity: u64 = 0;
 
     match expr {
-        ast::Expr::BoolOp(..) => {
+        ast::Expr::BoolOp(b) => {
             complexity += 1;
-        }
-        ast::Expr::BinOp(b) => {
-            complexity += 1;
-            complexity += count_bool_ops(*b.left);
-            complexity += count_bool_ops(*b.right);
+            for value in b.values.iter() {
+                complexity += count_bool_ops(value.clone());
+            }
         }
         ast::Expr::UnaryOp(u) => {
-            complexity += 1;
             complexity += count_bool_ops(*u.operand);
         }
         ast::Expr::Compare(c) => {