[ < ] [ > ] [ << ] [ Up ] [ >> ] [Top] [Contents] [Index] [ ? ]

4. Invoking complexity

Compute the complexity of source code not just with a path-through-the-code count, but also amplifying line counts by logic level nesting. complexity ignores all cpp preprocessor directives - calculating the complexity of the appearance of the code, rather than the complexity after the preprocessor manipulates the code. getchar(3), for example, will expand into quite complicated code.

This chapter was generated by AutoGen, using the agtexi-cmd template and the option descriptions for the complexity program.

This software is released under the GNU General Public License.

4.1 complexity usage help (-?)
4.2 demi-nesting-penalty option
4.3 histogram option (-h)
4.4 horrid-threshold option
4.5 ignore option (-I)
4.6 input option (-i)
4.7 nesting-penalty option (-n)
4.8 no-header option (-H)
4.9 scale option (-s)
4.10 scores option (-c)
4.11 threshold option (-t)
4.12 trace option
4.13 unif-exe option
4.14 unifdef option (-u)
4.15 presetting/configuring complexity
4.16 complexity exit codes
4.17 complexity Description Description
4.18 complexity Bugs Bugs

[ < ] [ > ] [ << ] [ Up ] [ >> ] [Top] [Contents] [Index] [ ? ]

This document was generated by Bruce Korb on May 15, 2011 using texi2html 1.82.

AltStyle によって変換されたページ (->オリジナル) /