wouldnt be too much work probably to add. the parser already parses every if/begin/end/case etc so it could easily count the paths
the expressions are parsed as well so it could also assign metrics to the complexity of the expressions also
wouldnt be too much work probably to add. the parser already parses every if/begin/end/case etc so it could easily count the paths
the expressions are parsed as well so it could also assign metrics to the complexity of the expressions also
Michael Salzlechner
StarZen Technologies, Inc
http.://www.starzen.com
IT Director at Balloons Everywhere
Development Blog
http://www.salzlechner.com/dev
DataFlex Package Manager (aka Nuget for DataFlex)
http://windowsdeveloper.com/dfPackage