mirror of
https://github.com/boostorg/unordered.git
synced 2025-11-04 09:41:40 +01:00
6f45d36d97
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
83 lines
2.7 KiB
C++
83 lines
2.7 KiB
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 "./case_insensitive.hpp"
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
|
|
struct word_info {
|
|
int tag;
|
|
explicit word_info(int t = 0) : tag(t) {}
|
|
};
|
|
|
|
void test1() {
|
|
boost::unordered_map<std::string, word_info,
|
|
hash_examples::ihash, hash_examples::iequal_to> idictionary;
|
|
|
|
BOOST_TEST(idictionary.empty());
|
|
|
|
idictionary["one"] = word_info(1);
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find("ONE") != idictionary.end() &&
|
|
idictionary.find("ONE") == idictionary.find("one"));
|
|
|
|
idictionary.insert(std::make_pair("ONE", word_info(2)));
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find("ONE") != idictionary.end() &&
|
|
idictionary.find("ONE")->first == "one" &&
|
|
idictionary.find("ONE")->second.tag == 1);
|
|
|
|
idictionary["One"] = word_info(3);
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find("ONE") != idictionary.end() &&
|
|
idictionary.find("ONE")->first == "one" &&
|
|
idictionary.find("ONE")->second.tag == 3);
|
|
|
|
idictionary["two"] = word_info(4);
|
|
BOOST_TEST(idictionary.size() == 2);
|
|
BOOST_TEST(idictionary.find("two") != idictionary.end() &&
|
|
idictionary.find("TWO")->first == "two" &&
|
|
idictionary.find("Two")->second.tag == 4);
|
|
|
|
|
|
}
|
|
|
|
void test2() {
|
|
boost::unordered_map<std::wstring, word_info,
|
|
hash_examples::ihash, hash_examples::iequal_to> idictionary;
|
|
|
|
BOOST_TEST(idictionary.empty());
|
|
|
|
idictionary[L"one"] = word_info(1);
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find(L"ONE") != idictionary.end() &&
|
|
idictionary.find(L"ONE") == idictionary.find(L"one"));
|
|
|
|
idictionary.insert(std::make_pair(L"ONE", word_info(2)));
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find(L"ONE") != idictionary.end() &&
|
|
idictionary.find(L"ONE")->first == L"one" &&
|
|
idictionary.find(L"ONE")->second.tag == 1);
|
|
|
|
idictionary[L"One"] = word_info(3);
|
|
BOOST_TEST(idictionary.size() == 1);
|
|
BOOST_TEST(idictionary.find(L"ONE") != idictionary.end() &&
|
|
idictionary.find(L"ONE")->first == L"one" &&
|
|
idictionary.find(L"ONE")->second.tag == 3);
|
|
|
|
idictionary[L"two"] = word_info(4);
|
|
BOOST_TEST(idictionary.size() == 2);
|
|
BOOST_TEST(idictionary.find(L"two") != idictionary.end() &&
|
|
idictionary.find(L"TWO")->first == L"two" &&
|
|
idictionary.find(L"Two")->second.tag == 4);
|
|
}
|
|
|
|
int main() {
|
|
test1();
|
|
test2();
|
|
|
|
return boost::report_errors();
|
|
}
|