Module cyclomatic_complexity 

Re-exports

use super::CyclomaticComplexity; 🔒

use crate::linter::LateLintPass; 🔒

use crate::linter::LintContext; 🔒

use crate::sol::Severity; 🔒

use crate::sol::SolLint; 🔒

use solar::sema::Gcx; 🔒

use solar::sema::hir; 🔒

use solar::sema::hir::Expr; 🔒

use solar::sema::hir::ExprKind; 🔒

use solar::sema::hir::Hir; 🔒

use solar::sema::hir::Stmt; 🔒

use solar::sema::hir::StmtKind; 🔒

use solar::sema::hir::Visit; 🔒

use std::convert::Infallible; 🔒

use std::ops::ControlFlow; 🔒

Structs

DecisionCounter 🔒

Counts the decision points of a function body. For a structured program the cyclomatic complexity E - N + 2P of the control-flow graph equals one plus the number of decision points, so no graph needs building.

Constants

MAX_COMPLEXITY 🔒

The threshold Slither’s detector of the same name uses: a function reports when its complexity is strictly above this value.

Statics

CYCLOMATIC_COMPLEXITY