forked from boostorg/unordered
ae09b0dd24
Merged revisions 53127,53253,53256,53311,53314,53316-53318 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r53127 | danieljames | 2009-05-20 07:43:38 +0100 (Wed, 20 May 2009) | 1 line Better configuration for boost.unordered. ........ r53253 | danieljames | 2009-05-25 20:14:07 +0100 (Mon, 25 May 2009) | 3 lines Add explicit destructors to the unordered containers. Refs #2908. Isn't really needed but it doesn't hurt. ........ r53256 | danieljames | 2009-05-25 20:45:23 +0100 (Mon, 25 May 2009) | 1 line Unordered change log for explicit destructors. ........ r53311 | danieljames | 2009-05-27 18:42:01 +0100 (Wed, 27 May 2009) | 1 line Missing changelog entry. ........ r53314 | danieljames | 2009-05-27 18:44:09 +0100 (Wed, 27 May 2009) | 1 line Use lightweight_test for unordered. ........ r53316 | danieljames | 2009-05-27 19:19:32 +0100 (Wed, 27 May 2009) | 1 line Some workarounds for old versions of Borland. ........ r53317 | danieljames | 2009-05-27 19:32:22 +0100 (Wed, 27 May 2009) | 1 line Fix a change accidentally included in the last commit. ........ r53318 | danieljames | 2009-05-27 19:32:38 +0100 (Wed, 27 May 2009) | 1 line Remove an unused function. ........ [SVN r53465]
33 lines
693 B
C++
33 lines
693 B
C++
|
|
// Copyright 2007-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 <boost/unordered_map.hpp>
|
|
#include "../helpers/test.hpp"
|
|
#include <string>
|
|
|
|
namespace at_tests {
|
|
|
|
UNORDERED_AUTO_TEST(at_tests) {
|
|
boost::unordered_map<std::string, int> x;
|
|
typedef boost::unordered_map<std::string, int>::iterator iterator;
|
|
|
|
x["one"] = 1;
|
|
x["two"] = 2;
|
|
|
|
BOOST_TEST(x.at("one") == 1);
|
|
BOOST_TEST(x.at("two") == 2);
|
|
|
|
try {
|
|
x.at("three");
|
|
BOOST_ERROR("Should have thrown.");
|
|
}
|
|
catch(std::out_of_range) {
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|