Any work on the complexity rules would be very welcome, since it's not
really my area of expertise.
The cyclomatic complexity rules that I've implemented are almost
straight copies from the Checkstyle ones, so the metric applies to
Scala but isn't necessarily relevant. There are also a few anomalies
such as the filter() methods which have implicit ifs in them, so the
theoretical complexity of the method goes up, but doesn't show up in
the figure. However, you can write java in such a way as to have the
same anomalies, so I'm not so worried about that.
So, my view (at the minute) is that the Cyclomatic complexity check as
implemented should probably stay as it is, but if you want to do
another complexity check based upon other criteria, more specific to
functional type languages, why not?
As I say, I'm not really an expert of metrics, and certainly not for
functional languages, so any input is gratefully received.
Matthew Farwell.
2012/5/3 Brian <
brian...@gmail.com>: