Create a new Complexity check

Hello List.

I need to implement a new Checkstyle check which is based on the
CyclomaticComplexityCheck class. The check need to verify the amount
of methods of packages M[], whose CCN is between X and Y. The result
cannot be more than Z% of the methods.

There are at least two approaches. The first one, extending
CyclomaticComplexityCheck or AbstractComplexityCheck, I don't know how
(if possible) to persist the current result between visitor's calls.
Otoh extend AbstractFileSetCheck sounds time and resource consuming.

Are there other approaches or something I am missing?

Thanks

Joao Morais

------------------------------------------------------------------------------
Return on Information:
Google Enterprise Search pays you back
Get the facts.
http://p.sf.net/sfu/google-dev2dev