blob: cc196428ec1a6cf14bf90f1379dc3793a42089a0 [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <unordered_map>
11
12// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13// class Alloc = allocator<pair<const Key, T>>>
14// class unordered_map
15
16// unordered_map(initializer_list<value_type> il, size_type n,
17// const hasher& hf, const key_equal& eql);
18
19#include <unordered_map>
20#include <string>
21#include <cassert>
22
23#include "../../../test_compare.h"
24#include "../../../test_hash.h"
25#include "../../../test_allocator.h"
26
27int main()
28{
Howard Hinnant73d21a42010-09-04 23:28:19 +000029#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000030 {
31 typedef std::unordered_map<int, std::string,
32 test_hash<std::hash<int> >,
33 test_compare<std::equal_to<int> >,
34 test_allocator<std::pair<const int, std::string> >
35 > C;
36 typedef std::pair<int, std::string> P;
37 C c({
38 P(1, "one"),
39 P(2, "two"),
40 P(3, "three"),
41 P(4, "four"),
42 P(1, "four"),
43 P(2, "four"),
44 },
45 7,
46 test_hash<std::hash<int> >(8),
47 test_compare<std::equal_to<int> >(9)
48 );
49 assert(c.bucket_count() == 7);
50 assert(c.size() == 4);
51 assert(c.at(1) == "one");
52 assert(c.at(2) == "two");
53 assert(c.at(3) == "three");
54 assert(c.at(4) == "four");
55 assert(c.hash_function() == test_hash<std::hash<int> >(8));
56 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
57 assert(c.get_allocator() ==
58 (test_allocator<std::pair<const int, std::string> >()));
59 assert(!c.empty());
60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
62 assert(c.load_factor() == (float)c.size()/c.bucket_count());
63 assert(c.max_load_factor() == 1);
64 }
Howard Hinnant73d21a42010-09-04 23:28:19 +000065#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000066}