-Obviously there are many possible tests that we can use to - -2
-reach 100% branch and condition coverage. So I'm just going to show a - -3
-possible one, which is x equal to 3 and y is - -4
-equal to negative 2. If we specify this as case, you can - -5
-see that the overall condition is false, because neither x is - -6
-equal to 0 nor y is greater than 0. Therefore we will - -7
-follow the false, false branch, and achieve 100% branch and condition coverage - -8
-for this code. And we might require to be even more thorough, - -9
-that all the combinations of our conditions inside each - -10
-decision, inside each predicate, are tested. Which is what is - -11
-called, multiple condition coverage. But because of the way - -12
-this criterion is defined, it is combinatorial, becuse you have - -13
-to consider all the possible combinations of conditions. And - -14
-therefore it's extremely expensive, to the point of being impractical. - -15
-So instead of defining that criterion, we're going to find - -16
-another one which finds a good trade off between thoroughness - -17
-of the tests and their cost. -- cgit 1.4.1