forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
109 lines
2.7 KiB
C++
109 lines
2.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. 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>
|
|
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
|
|
template <class C>
|
|
void test(const C& 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");
|
|
}
|
|
|
|
void reserve_invariant(size_t n) // LWG #2156
|
|
{
|
|
for (size_t i = 0; i < n; ++i)
|
|
{
|
|
std::unordered_map<size_t, size_t> c;
|
|
c.reserve(n);
|
|
size_t buckets = c.bucket_count();
|
|
for (size_t j = 0; j < i; ++j)
|
|
{
|
|
c[i] = i;
|
|
assert(buckets == c.bucket_count());
|
|
}
|
|
}
|
|
}
|
|
|
|
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);
|
|
LIBCPP_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() >= 16);
|
|
test(c);
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
|
min_allocator<std::pair<const 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);
|
|
LIBCPP_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() >= 16);
|
|
test(c);
|
|
}
|
|
#endif
|
|
reserve_invariant(20);
|
|
}
|