1
2// Copyright 2006-2009 Daniel James.
3// Copyright 2022-2023 Christian Mazakas.
4// Distributed under the Boost Software License, Version 1.0. (See accompanying
5// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6
7#include "../helpers/unordered.hpp"
8
9#ifdef BOOST_UNORDERED_FOA_TESTS
10
11#include <boost/unordered/concurrent_flat_map.hpp>
12
13void foo(boost::unordered_flat_set<int>& x1,
14 boost::unordered_flat_map<int, int>& x2, boost::unordered_node_set<int>& x3,
15 boost::unordered_node_map<int, int>& x4,
16 boost::concurrent_flat_map<int, int>& x5)
17{
18#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
19 struct dummy
20 {
21 boost::unordered_flat_set<int> x1;
22 boost::unordered_flat_map<int, int> x2;
23 };
24#endif
25
26 x1.insert(1);
27 x2[2] = 2;
28 x3.insert(3);
29 x4.insert(std::make_pair(4, 5));
30 x5.insert(std::make_pair(5, 6));
31}
32#else
33void foo(boost::unordered_set<int>& x1, boost::unordered_map<int, int>& x2,
34 boost::unordered_multiset<int>& x3, boost::unordered_multimap<int, int>& x4)
35{
36#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
37 struct dummy
38 {
39 boost::unordered_set<int> x1;
40 boost::unordered_map<int, int> x2;
41 boost::unordered_multiset<int> x3;
42 boost::unordered_multimap<int, int> x4;
43 };
44#endif
45
46 x1.insert(x: 1);
47 x2[2] = 2;
48 x3.insert(x: 3);
49 x4.insert(obj: std::make_pair(x: 4, y: 5));
50}
51#endif
52

source code of boost/libs/unordered/test/unordered/link_test_2.cpp