forked from boostorg/unordered
30 lines
890 B
C++
30 lines
890 B
C++
|
|
// Copyright 2006-2009 Daniel James.
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include "../helpers/prefix.hpp"
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include "../helpers/postfix.hpp"
|
|
|
|
void foo(boost::unordered_set<int>& x1,
|
|
boost::unordered_map<int, int>& x2,
|
|
boost::unordered_multiset<int>& x3,
|
|
boost::unordered_multimap<int, int>& x4)
|
|
{
|
|
#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
|
|
struct dummy {
|
|
boost::unordered_set<int> x1;
|
|
boost::unordered_map<int, int> x2;
|
|
boost::unordered_multiset<int> x3;
|
|
boost::unordered_multimap<int, int> x4;
|
|
};
|
|
#endif
|
|
|
|
x1.insert(1);
|
|
x2[2] = 2;
|
|
x3.insert(3);
|
|
x4.insert(std::make_pair(4, 5));
|
|
}
|