Lines Matching full:example

19 In the folder [@../../example libs/bimap/example] you can find all the examples
26 [[[@../../example/simple_bimap.cpp
28     [Soccer world cup example                                             ]]
30 [[[@../../example/tagged_simple_bimap.cpp
32     [Soccer world cup example using user defined names                    ]]
34 [[[@../../example/step_by_step.cpp
36     [Basic example of the three views of bimap                            ]]
38 [[[@../../example/population_bimap.cpp
42 [[[@../../example/repetitions_counter.cpp
46 [[[@../../example/mighty_bimap.cpp
50 [[[@../../example/user_defined_names.cpp
54 [[[@../../example/standard_map_comparison.cpp
58 [[[@../../example/at_function_examples.cpp
62 [[[@../../example/tutorial_modify_and_replace.cpp
66 [[[@../../example/tutorial_range.cpp
70 [[[@../../example/tutorial_info_hook.cpp
74 [[[@../../example/unconstrained_collection.cpp
83 [[[@../../example/bimap_and_boost/assign.cpp
87 [[[@../../example/bimap_and_boost/lambda.cpp
91 [[[@../../example/bimap_and_boost/property_map.cpp
95 [[[@../../example/bimap_and_boost/range.cpp
99 [[[@../../example/bimap_and_boost/foreach.cpp
103 [[[@../../example/bimap_and_boost/typeof.cpp
107 [[[@../../example/bimap_and_boost/xpressive.cpp
111 [[[@../../example/bimap_and_boost/serialization.cpp
120 [[[@../../example/mi_to_b_path/bidirectional_map.cpp
122     [Boost.MultiIndex to Boost.Bimap path example                         ]]
124 [[[@../../example/mi_to_b_path/hashed_indices.cpp
126     [Boost.MultiIndex to Boost.Bimap path example                         ]]
128 [[[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp
130     [Boost.MultiIndex to Boost.Bimap path example                         ]]
138 This is the example from the one minute tutorial section.
140 [@../../example/simple_bimap.cpp Go to source code]
146 [@../../example/tagged_simple_bimap.cpp Go to source code]
148 [import ../example/tagged_simple_bimap.cpp]
157 This is the translator example from the tutorial.
158 In this example the collection type of relation is changed to allow the iteration
161 [@../../example/mighty_bimap.cpp Go to source code]
170 This is example 4 in Boost.MultiIndex documentation.
173 This example shows how to construct a bidirectional map with multi_index_container.
183 [@../../example/mi_to_b_path/mi_bidirectional_map.cpp Go to source code]
185 [import ../example/mi_to_b_path/mi_bidirectional_map.cpp]
191 [@../../example/mi_to_b_path/bidirectional_map.cpp Go to source code]
193 [import ../example/mi_to_b_path/bidirectional_map.cpp]
199 [@../../example/mi_to_b_path/tagged_bidirectional_map.cpp Go to source code]
201 [import ../example/mi_to_b_path/tagged_bidirectional_map.cpp]
209 This is example 8 of Boost.MultiIndex.
213 information is of no interest. The example features a word counter where duplicate entries are chec…
219 [@../../example/mi_to_b_path/mi_hashed_indices.cpp Go to source code]
221 [import ../example/mi_to_b_path/mi_hashed_indices.cpp]
227 [@../../example/mi_to_b_path/hashed_indices.cpp Go to source code]
229 [import ../example/mi_to_b_path/hashed_indices.cpp]