60 lines
1.5 KiB
C++
60 lines
1.5 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <unordered_map>
|
|||
|
|
|
|||
|
|
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
|||
|
|
// class Alloc = allocator<pair<const Key, T>>>
|
|||
|
|
// class unordered_map
|
|||
|
|
|
|||
|
|
// void reserve(size_type n);
|
|||
|
|
|
|||
|
|
#include <unordered_map>
|
|||
|
|
#include <string>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
void test(const std::unordered_map<int, std::string>& c)
|
|||
|
|
{
|
|||
|
|
assert(c.size() == 4);
|
|||
|
|
assert(c.at(1) == "one");
|
|||
|
|
assert(c.at(2) == "two");
|
|||
|
|
assert(c.at(3) == "three");
|
|||
|
|
assert(c.at(4) == "four");
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
{
|
|||
|
|
typedef std::unordered_map<int, std::string> C;
|
|||
|
|
typedef std::pair<int, std::string> P;
|
|||
|
|
P a[] =
|
|||
|
|
{
|
|||
|
|
P(1, "one"),
|
|||
|
|
P(2, "two"),
|
|||
|
|
P(3, "three"),
|
|||
|
|
P(4, "four"),
|
|||
|
|
P(1, "four"),
|
|||
|
|
P(2, "four"),
|
|||
|
|
};
|
|||
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|||
|
|
test(c);
|
|||
|
|
assert(c.bucket_count() >= 5);
|
|||
|
|
c.reserve(3);
|
|||
|
|
assert(c.bucket_count() == 5);
|
|||
|
|
test(c);
|
|||
|
|
c.max_load_factor(2);
|
|||
|
|
c.reserve(3);
|
|||
|
|
assert(c.bucket_count() >= 2);
|
|||
|
|
test(c);
|
|||
|
|
c.reserve(31);
|
|||
|
|
assert(c.bucket_count() == 17);
|
|||
|
|
test(c);
|
|||
|
|
}
|
|||
|
|
}
|