Testability-explorer 1.3.0 R275

Testability-explorer is a tool which analyzes java byte-codes and computes how difficult it will be to write unit-test.
Testability-explorer attempts to help you quantitatively determine exactly how hard the code youve written is to test and, where to focus to make it more testable.
Test metric tool can be used:
- As a learning tool which flags causes of hard to test code with detailed breakdown of reasons.
- To identify hard to test hair-balls in legacy code.
- As part of your code analysis-toolset.
- As a tool which can be added into continuous integration that can enforce testable code.
Currently the tool computes:
- Non-Mockable Total Recursive Cyclomatic Complexity. Cyclomatic Complexity is a measure of how many different paths of execution are there in the code. It is computed, by counting the if, while, and case as branching primitives. It is recursive because cost of the method as well as any methods it calls are counted. It is total because cost of object construction as well as any static initializations are counted. And finally, it is non-mockable because any code which can be mocked out in test is not counted as part of the cost.
- Global Mutable State. Counts the number of fields which are globally reachable by the class under test and which are mutable. (A mutable global state can make testing difficult as tests are not isolatable)
NOTE: Testability-explorer is licensed and distributed under the terms of the Apache License 2.0.