1# Boost.Bimap 2# 3# Copyright (c) 2006-2007 Matias Capeletto 4# 5# Distributed under the Boost Software License, Version 1.0. 6# (See accompanying file LICENSE_1_0.txt or copy at 7# http://www.boost.org/LICENSE_1_0.txt) 8 9# bring in rules for testing 10import testing ; 11 12test-suite "examples" 13 : 14 [ compile mighty_bimap.cpp ] 15 [ run simple_bimap.cpp ] 16 [ run tagged_simple_bimap.cpp ] 17 [ run step_by_step.cpp ] 18 [ run population_bimap.cpp ] 19 [ run repetitions_counter.cpp ] 20 [ compile user_defined_names.cpp ] 21 [ run standard_map_comparison.cpp ] 22 [ run at_function_examples.cpp ] 23 [ run tutorial_modify_and_replace.cpp ] 24 [ run tutorial_range.cpp ] 25 [ run unconstrained_collection.cpp ] 26 [ run tutorial_info_hook.cpp ] 27 [ run projection.cpp ] 28 ; 29 30test-suite "bimap_and_boost" 31 : 32 [ run bimap_and_boost/property_map.cpp ] 33 [ run bimap_and_boost/range.cpp ] 34 [ run bimap_and_boost/foreach.cpp ] 35 [ run bimap_and_boost/lambda.cpp ] 36 [ run bimap_and_boost/assign.cpp ] 37 [ run bimap_and_boost/xpressive.cpp ] 38 [ run bimap_and_boost/typeof.cpp ] 39 [ run bimap_and_boost/serialization.cpp 40 /boost/serialization//boost_serialization ] 41 ; 42 43test-suite "mi_to_b_path" 44 : 45 [ compile mi_to_b_path/bidirectional_map.cpp ] 46 [ run mi_to_b_path/hashed_indices.cpp ] 47 [ compile mi_to_b_path/tagged_bidirectional_map.cpp ] 48 [ compile mi_to_b_path/mi_bidirectional_map.cpp ] 49 [ run mi_to_b_path/mi_hashed_indices.cpp ] 50 ; 51