| 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 | |
|---|
| 13 | void foo(boost::unordered_flat_set<int>&, boost::unordered_flat_map<int, int>&, |
|---|
| 14 | boost::unordered_node_set<int>&, boost::unordered_node_map<int, int>&, |
|---|
| 15 | boost::concurrent_flat_map<int, int>&); |
|---|
| 16 | |
|---|
| 17 | int main() |
|---|
| 18 | { |
|---|
| 19 | boost::unordered_flat_set<int> x1; |
|---|
| 20 | boost::unordered_flat_map<int, int> x2; |
|---|
| 21 | boost::unordered_node_set<int> x3; |
|---|
| 22 | boost::unordered_node_map<int, int> x4; |
|---|
| 23 | boost::concurrent_flat_map<int, int> x5; |
|---|
| 24 | |
|---|
| 25 | foo(x1, x2, x3, x4, x5); |
|---|
| 26 | |
|---|
| 27 | return 0; |
|---|
| 28 | } |
|---|
| 29 | #else |
|---|
| 30 | void foo(boost::unordered_set<int>&, boost::unordered_map<int, int>&, |
|---|
| 31 | boost::unordered_multiset<int>&, boost::unordered_multimap<int, int>&); |
|---|
| 32 | |
|---|
| 33 | int main() |
|---|
| 34 | { |
|---|
| 35 | boost::unordered_set<int> x1; |
|---|
| 36 | boost::unordered_map<int, int> x2; |
|---|
| 37 | boost::unordered_multiset<int> x3; |
|---|
| 38 | boost::unordered_multimap<int, int> x4; |
|---|
| 39 | |
|---|
| 40 | foo(x1, x2, x3, x4); |
|---|
| 41 | |
|---|
| 42 | return 0; |
|---|
| 43 | } |
|---|
| 44 | #endif |
|---|
| 45 | |
|---|
