1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0.1 Transitional//EN"> 2 3<html> 4<head> 5<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> 6<title>Boost.MultiIndex Documentation - Tests</title> 7<link rel="stylesheet" href="style.css" type="text/css"> 8<link rel="start" href="index.html"> 9<link rel="prev" href="examples.html"> 10<link rel="up" href="index.html"> 11<link rel="next" href="future_work.html"> 12</head> 13 14<body> 15<h1><img src="../../../boost.png" alt="boost.png (6897 bytes)" align= 16"middle" width="277" height="86">Boost.MultiIndex Tests</h1> 17 18<div class="prev_link"><a href="examples.html"><img src="prev.gif" alt="examples" border="0"><br> 19Examples 20</a></div> 21<div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"><br> 22Index 23</a></div> 24<div class="next_link"><a href="future_work.html"><img src="next.gif" alt="future work" border="0"><br> 25Future work 26</a></div><br clear="all" style="clear: all;"> 27 28<hr> 29 30<p> 31The Boost.MultiIndex test suite exercises the whole spectrum of 32functionalities provided by the library. Although the tests are not meant 33to serve as a learning guide, the interested reader may find it 34useful to inspect the source code to gain familiarity 35with some of the least common features offered by Boost.MultiIndex. 36</p> 37 38<p align="center"> 39<table cellspacing="0" cellpadding="5"> 40 <caption><b>Boost.MultiIndex test suite.</b></caption> 41<tr> 42 <th>Program</th> 43 <th>Description</th> 44</tr> 45<tr> 46 <td><a href="../test/test_alloc_awareness.cpp"><code>test_alloc_awareness.cpp</code></a></td> 47 <td>Checks <a href="https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer">allocator 48 awareness</a>.</td> 49</tr> 50<tr class="odd_tr"> 51 <td><a href="../test/test_basic.cpp"><code>test_basic.cpp</code></a></td> 52 <td>Simple program along the lines of the employees example studied in the 53 tutorial.</td> 54</tr> 55<tr> 56 <td><a href="../test/test_capacity.cpp"><code>test_capacity.cpp</code></a></td> 57 <td><code>empty</code>, <code>size</code>, <code>resize</code> 58 (non key-based indices) and <code>reserve</code>/<code>capacity</code> 59 (random access indices only).</td> 60</tr> 61<tr class="odd_tr"> 62 <td><a href="../test/test_comparison.cpp"><code>test_comparison.cpp</code></a></td> 63 <td>Comparison between indices.</td> 64</tr> 65<tr> 66 <td><a href="../test/test_composite_key.cpp"><code>test_composite_key.cpp</code></a></td> 67 <td><code>composite_key</code> and <code>composite_key_compare</code>.</td> 68</tr> 69<tr class="odd_tr"> 70 <td><a href="../test/test_conv_iterators.cpp"><code>test_conv_iterators.cpp</code></a></td> 71 <td>Checks convertibility of non-constant to constant iterators.</td> 72</tr> 73<tr> 74 <td><a href="../test/test_copy_assignment.cpp"><code>test_copy_assignment.cpp</code></a></td> 75 <td>Various forms of assignment: copy, <code>operator =</code>, insertion, 76 (non key-based indices only) <code>assign</code> . 77</tr> 78<tr class="odd_tr"> 79 <td><a href="../test/test_hash_ops.cpp"><code>test_hash_ops.cpp</code></a></td> 80 <td>Hashing operations.</td> 81</tr> 82<tr> 83 <td><a href="../test/test_iterators.cpp"><code>test_iterators.cpp</code></a></td> 84 <td>Constant and non-constant iterators and their reverse variants.</td> 85</tr> 86<tr class="odd_tr"> 87 <td><a href="../test/test_key.cpp"><code>test_key.cpp</code></a></td> 88 <td>Terse key specification syntax.</td> 89</tr> 90<tr> 91 <td><a href="../test/test_key_extractors.cpp"><code>test_key_extractors.cpp</code></a></td> 92 <td>Covers all use cases of key extractors shipped with the library.</td> 93</tr> 94<tr class="odd_tr"> 95 <td><a href="../test/test_list_ops.cpp"><code>test_list_ops.cpp</code></a></td> 96 <td>List-like operations particular to sequenced and random access indices.</td> 97</tr> 98<tr> 99 <td><a href="../test/test_modifiers.cpp"><code>test_modifiers.cpp</code></a></td> 100 <td>Checks the family of insertion and erasing operations.</td> 101</tr> 102<tr class="odd_tr"> 103 <td><a href="../test/test_mpl_ops.cpp"><code>test_mpl_ops.cpp</code></a></td> 104 <td>Metaprogramming manipulations of <code>multi_index_container</code> types.</td> 105</tr> 106<tr> 107 <td><a href="../test/test_node_handling.cpp"><code>test_node_handling.cpp</code></a></td> 108 <td>Operations involving node extraction and insertion.</td> 109</tr> 110<tr class="odd_tr"> 111 <td><a href="../test/test_observers.cpp"><code>test_observers.cpp</code></a></td> 112 <td>Checks observer member functions of ordered and hashed indices.</td> 113</tr> 114<tr> 115 <td><a href="../test/test_projection.cpp"><code>test_projection.cpp</code></a></td> 116 <td>Projection of iterators among indices.</td> 117</tr> 118<tr class="odd_tr"> 119 <td><a href="../test/test_range.cpp"><code>test_range.cpp</code></a></td> 120 <td>Exercises the <code>range</code> facility (ordered indices only).</td> 121</tr> 122<tr> 123 <td><a href="../test/test_rank_ops.cpp"><code>test_rank_ops.cpp</code></a></td> 124 <td>Specific operations of ranked indices.</td> 125</tr> 126<tr class="odd_tr"> 127 <td><a href="../test/test_rearrange.cpp"><code>test_rearrange.cpp</code></a></td> 128 <td>Rearrange functions of sequenced and random access indices.</td> 129</tr> 130<tr> 131 <td><a href="../test/test_safe_mode.cpp"><code>test_safe_mode.cpp</code></a></td> 132 <td>Comprehensive coverage of all conditions checked in safe mode.</td> 133</tr> 134<tr class="odd_tr"> 135 <td><a href="../test/test_serialization1.cpp"><code>test_serialization1.cpp</code></a><br> 136 <a href="../test/test_serialization2.cpp"><code>test_serialization2.cpp</code></a><br> 137 <a href="../test/test_serialization3.cpp"><code>test_serialization3.cpp</code></a></td> 138 <td>Serialization support.</td> 139</tr> 140<tr> 141 <td><a href="../test/test_set_ops.cpp"><code>test_set_ops.cpp</code></a></td> 142 <td>Set-like operations particular to ordered indices.</td> 143</tr> 144<tr class="odd_tr"> 145 <td><a href="../test/test_special_set_ops.cpp"><code>test_special_set_ops.cpp</code></a></td> 146 <td>Checks special lookup operations using compatible sorting criteria.</td> 147</tr> 148<tr> 149 <td><a href="../test/test_update.cpp"><code>test_update.cpp</code></a></td> 150 <td><code>replace</code>, <code>modify</code> and <code>modify_key</code>.</td> 151</tr> 152</table> 153</p> 154 155<hr> 156 157<div class="prev_link"><a href="examples.html"><img src="prev.gif" alt="examples" border="0"><br> 158Examples 159</a></div> 160<div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"><br> 161Index 162</a></div> 163<div class="next_link"><a href="future_work.html"><img src="next.gif" alt="future work" border="0"><br> 164Future work 165</a></div><br clear="all" style="clear: all;"> 166 167<br> 168 169<p>Revised May 9th 2020</p> 170 171<p>© Copyright 2003-2020 Joaquín M López Muñoz. 172Distributed under the Boost Software 173License, Version 1.0. (See accompanying file <a href="../../../LICENSE_1_0.txt"> 174LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"> 175http://www.boost.org/LICENSE_1_0.txt</a>) 176</p> 177 178</body> 179</html> 180
