Search tips

apple banana
Find rows that contain at least one of the two words.

+apple +juice
Find rows that contain both words.

+apple macintosh
Find rows that contain the word 'apple', but rank rows higher if they also contain 'macintosh'.

+apple -macintosh
Find rows that contain the word 'apple' but not 'macintosh'.

+apple ~macintosh
Find rows that contain the word 'apple', but if the row also contains the word 'macintosh', rate it lower than if row does not. This is "softer" than a search for '+apple -macintosh', for which the presence of 'macintosh' causes the row not to be returned at all.

+apple +(>turnover >strudel)
Find rows that contain the words 'apple' and 'turnover', or 'apple' and 'strudel' (in any order), but rank 'apple turnover' higher than 'apple strudel'.

Find rows that contain words such as 'apple', 'apples', 'applesauce', or 'applet'.

"some words"
Find rows that contain the exact phrase 'some words' (for example, rows that contain 'some words of wisdom' but not "some noise words").

By continuing to use this site you agree to the use of cookies. For more information and to find out how to change this click here. Accept Cookies
Please enable cookies in your browser for this website.
Advanced search

How VectorCAST Determines Code Complexity

Last updated: 2019-10-29
How does VectorCAST determine code complexity?
VectorCAST uses the McCabe Cyclcomatic Complexity algorithm to calculate the number of Basis Paths (using V(g) for the representation) through a subprogram. This is a fairly straightforward algorithm that basically counts the branches in a subprogram.

For a full description of the algorithm and its relationship to testing, please see NIST Special Publication 500-235 (Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric)
Article Options
Views: 45
Rate this article: