Cyclomatic complexity in D ?

[Stefan Koch via Digitalmars-d]

On Monday, 15 August 2016 at 22:36:41 UTC, Basile B. wrote:
> Last night I've done a bit of documentation work on cyclomatic 
> complexity. From this work it looks like the tools that do this 
> static analysis are only using the AST (e.g the CC is computed 
> for a each single function, and function calls inside the graph 
> are considered as "connected componenents" with a constant 
> weight of 1.
>
> [...]

Possible - Certainly.
Doable - I am not sure. But I am going to tend to no.