PageRenderTime 18ms CodeModel.GetById 13ms app.highlight 2ms RepoModel.GetById 1ms app.codeStats 0ms

HTML | 57 lines | 51 code | 6 blank | 0 comment | 0 complexity | 09b967b9bf9b408d7a854ae8d56d90cf MD5 | raw file
 2  By default, Hudson builds all the possible combinations of axes exhaustively. But sometimes this is too many,
 3  or may contain combinations that don't make sense.
 4  In such a situation, you can make the matrix sparse by filtering out combinations that you don't want through
 5  a Groovy expression that returns true or false.
 7  <p>
 8  When you specify a Groovy expression here, only the combinations that result in <b>true</b>
 9  will be built. In evaluating the expression, axes are exposed as variables (with their values set
10  to the current combination evaluated).
12  <h4>Filtering based on values</h4>
13  <p>
14  For example, let's say you are building on different operating systems for
15  different compilers. Assume that your slave labels are <b>label=[linux,solaris]</b> and you have
16  created an axis as <b>compiler=[gcc,cc].</b>
18  Any of the following expressions will filter out <b>cc</b> builds on <b>linux</b>. Depending on
19  how you think about this constraint, you'll probably find some more intuitive than others.
21  <center>
22    <table>
23        <tr>
24            <td>Read "if both linux and cc, it's invalid"</td>
25            <td>
26                <pre>!(label=="linux" && compiler=="cc")</pre>
27            </td>
28        </tr>
29        <tr>
30            <td>Read "for a combination to be valid, it has to be either on solaris or on gcc."</td>
31            <td>
32                <pre>label=="solaris" || compiler=="gcc"</pre>
33            </td>
34        </tr>
35        <tr>
36            <td>Read "if on Solaris, just do cc"</td>
37            <td>
38                <pre>(label=="solaris").implies(compiler=="cc")</pre>
39            </td>
40        </tr>
41    </table>
42  </center>
44  <h4>Sparsening of the matrix</h4>
45  <p>
46  In addition to the specific filtering rules based on values, one can also use a special
47  variable "<tt>index</tt>", which can be used to sparsen the matrix.
49  <p>
50  For example, <tt>index%2==0</tt> would cut the matrix size in half by removing one
51  combination per every 2 combinations, in such a way that the coverage is still reasonable.
52  Similarly, <tt>index%3!=0</tt> would cut the matrix size into 66% by throwing
53  away every 1 out of 3 combinations.
54 <p>
55 It's possible to use Project cascading feature for this property. Please review <a href="">
56 this document</a>.