307 lines
10 KiB
C++
307 lines
10 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_multimap
|
||
|
|
||
|
// unordered_multimap& operator=(unordered_multimap&& u);
|
||
|
|
||
|
#include <unordered_map>
|
||
|
#include <string>
|
||
|
#include <cassert>
|
||
|
#include <cfloat>
|
||
|
|
||
|
#include "../../../test_compare.h"
|
||
|
#include "../../../test_hash.h"
|
||
|
#include "../../../test_allocator.h"
|
||
|
#include "../../../min_allocator.h"
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||
|
{
|
||
|
typedef test_allocator<std::pair<const int, std::string> > A;
|
||
|
typedef std::unordered_multimap<int, std::string,
|
||
|
test_hash<std::hash<int> >,
|
||
|
test_compare<std::equal_to<int> >,
|
||
|
A
|
||
|
> 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 c0(a, a + sizeof(a)/sizeof(a[0]),
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(8),
|
||
|
test_compare<std::equal_to<int> >(9),
|
||
|
A(10)
|
||
|
);
|
||
|
C c(a, a + 2,
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(2),
|
||
|
test_compare<std::equal_to<int> >(3),
|
||
|
A(4)
|
||
|
);
|
||
|
c = std::move(c0);
|
||
|
assert(c.bucket_count() == 7);
|
||
|
assert(c.size() == 6);
|
||
|
typedef std::pair<C::const_iterator, C::const_iterator> Eq;
|
||
|
Eq eq = c.equal_range(1);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
C::const_iterator i = eq.first;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "one");
|
||
|
++i;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "four");
|
||
|
eq = c.equal_range(2);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "two");
|
||
|
++i;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "four");
|
||
|
|
||
|
eq = c.equal_range(3);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 3);
|
||
|
assert(i->second == "three");
|
||
|
eq = c.equal_range(4);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 4);
|
||
|
assert(i->second == "four");
|
||
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
||
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||
|
assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
|
||
|
assert(c.max_load_factor() == 1);
|
||
|
}
|
||
|
{
|
||
|
typedef test_allocator<std::pair<const int, std::string> > A;
|
||
|
typedef std::unordered_multimap<int, std::string,
|
||
|
test_hash<std::hash<int> >,
|
||
|
test_compare<std::equal_to<int> >,
|
||
|
A
|
||
|
> 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 c0(a, a + sizeof(a)/sizeof(a[0]),
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(8),
|
||
|
test_compare<std::equal_to<int> >(9),
|
||
|
A(10)
|
||
|
);
|
||
|
C c(a, a + 2,
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(2),
|
||
|
test_compare<std::equal_to<int> >(3),
|
||
|
A(10)
|
||
|
);
|
||
|
c = std::move(c0);
|
||
|
assert(c.bucket_count() == 7);
|
||
|
assert(c.size() == 6);
|
||
|
typedef std::pair<C::const_iterator, C::const_iterator> Eq;
|
||
|
Eq eq = c.equal_range(1);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
C::const_iterator i = eq.first;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "one");
|
||
|
++i;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "four");
|
||
|
eq = c.equal_range(2);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "two");
|
||
|
++i;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "four");
|
||
|
|
||
|
eq = c.equal_range(3);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 3);
|
||
|
assert(i->second == "three");
|
||
|
eq = c.equal_range(4);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 4);
|
||
|
assert(i->second == "four");
|
||
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
||
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||
|
assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
|
||
|
assert(c.max_load_factor() == 1);
|
||
|
}
|
||
|
{
|
||
|
typedef other_allocator<std::pair<const int, std::string> > A;
|
||
|
typedef std::unordered_multimap<int, std::string,
|
||
|
test_hash<std::hash<int> >,
|
||
|
test_compare<std::equal_to<int> >,
|
||
|
A
|
||
|
> 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 c0(a, a + sizeof(a)/sizeof(a[0]),
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(8),
|
||
|
test_compare<std::equal_to<int> >(9),
|
||
|
A(10)
|
||
|
);
|
||
|
C c(a, a + 2,
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(2),
|
||
|
test_compare<std::equal_to<int> >(3),
|
||
|
A(4)
|
||
|
);
|
||
|
c = std::move(c0);
|
||
|
assert(c.bucket_count() == 7);
|
||
|
assert(c.size() == 6);
|
||
|
typedef std::pair<C::const_iterator, C::const_iterator> Eq;
|
||
|
Eq eq = c.equal_range(1);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
C::const_iterator i = eq.first;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "one");
|
||
|
++i;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "four");
|
||
|
eq = c.equal_range(2);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "two");
|
||
|
++i;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "four");
|
||
|
|
||
|
eq = c.equal_range(3);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 3);
|
||
|
assert(i->second == "three");
|
||
|
eq = c.equal_range(4);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 4);
|
||
|
assert(i->second == "four");
|
||
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
||
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||
|
assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
|
||
|
assert(c.max_load_factor() == 1);
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
typedef min_allocator<std::pair<const int, std::string> > A;
|
||
|
typedef std::unordered_multimap<int, std::string,
|
||
|
test_hash<std::hash<int> >,
|
||
|
test_compare<std::equal_to<int> >,
|
||
|
A
|
||
|
> 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 c0(a, a + sizeof(a)/sizeof(a[0]),
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(8),
|
||
|
test_compare<std::equal_to<int> >(9),
|
||
|
A()
|
||
|
);
|
||
|
C c(a, a + 2,
|
||
|
7,
|
||
|
test_hash<std::hash<int> >(2),
|
||
|
test_compare<std::equal_to<int> >(3),
|
||
|
A()
|
||
|
);
|
||
|
c = std::move(c0);
|
||
|
assert(c.bucket_count() == 7);
|
||
|
assert(c.size() == 6);
|
||
|
typedef std::pair<C::const_iterator, C::const_iterator> Eq;
|
||
|
Eq eq = c.equal_range(1);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
C::const_iterator i = eq.first;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "one");
|
||
|
++i;
|
||
|
assert(i->first == 1);
|
||
|
assert(i->second == "four");
|
||
|
eq = c.equal_range(2);
|
||
|
assert(std::distance(eq.first, eq.second) == 2);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "two");
|
||
|
++i;
|
||
|
assert(i->first == 2);
|
||
|
assert(i->second == "four");
|
||
|
|
||
|
eq = c.equal_range(3);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 3);
|
||
|
assert(i->second == "three");
|
||
|
eq = c.equal_range(4);
|
||
|
assert(std::distance(eq.first, eq.second) == 1);
|
||
|
i = eq.first;
|
||
|
assert(i->first == 4);
|
||
|
assert(i->second == "four");
|
||
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
||
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||
|
assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
|
||
|
assert(c.max_load_factor() == 1);
|
||
|
}
|
||
|
#endif
|
||
|
#if _LIBCPP_DEBUG >= 1
|
||
|
{
|
||
|
std::unordered_multimap<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}};
|
||
|
std::unordered_multimap<int, int>::iterator i = s1.begin();
|
||
|
std::pair<const int, int> k = *i;
|
||
|
std::unordered_multimap<int, int> s2;
|
||
|
s2 = std::move(s1);
|
||
|
assert(*i == k);
|
||
|
s2.erase(i);
|
||
|
assert(s2.size() == 2);
|
||
|
}
|
||
|
#endif
|
||
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||
|
}
|