| //===----------------------------------------------------------------------===// |
| // |
| // 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_set> |
| |
| // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, |
| // class Alloc = allocator<Value>> |
| // class unordered_multiset |
| |
| // template <class InputIterator> |
| // unordered_multiset(InputIterator first, InputIterator last); |
| |
| #include <unordered_set> |
| #include <cassert> |
| #include <cfloat> |
| |
| #include "test_iterators.h" |
| #include "../../../test_compare.h" |
| #include "../../../test_hash.h" |
| #include "../../../test_allocator.h" |
| #include "../../../min_allocator.h" |
| |
| int main() |
| { |
| { |
| typedef std::unordered_multiset<int, |
| test_hash<std::hash<int> >, |
| test_compare<std::equal_to<int> >, |
| test_allocator<int> |
| > C; |
| typedef int P; |
| P a[] = |
| { |
| P(1), |
| P(2), |
| P(3), |
| P(4), |
| P(1), |
| P(2) |
| }; |
| C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.bucket_count() >= 7); |
| assert(c.size() == 6); |
| assert(c.count(1) == 2); |
| assert(c.count(2) == 2); |
| assert(c.count(3) == 1); |
| assert(c.count(4) == 1); |
| assert(c.hash_function() == test_hash<std::hash<int> >()); |
| assert(c.key_eq() == test_compare<std::equal_to<int> >()); |
| assert(c.get_allocator() == test_allocator<int>()); |
| assert(!c.empty()); |
| 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 std::unordered_multiset<int, |
| test_hash<std::hash<int> >, |
| test_compare<std::equal_to<int> >, |
| min_allocator<int> |
| > C; |
| typedef int P; |
| P a[] = |
| { |
| P(1), |
| P(2), |
| P(3), |
| P(4), |
| P(1), |
| P(2) |
| }; |
| C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.bucket_count() >= 7); |
| assert(c.size() == 6); |
| assert(c.count(1) == 2); |
| assert(c.count(2) == 2); |
| assert(c.count(3) == 1); |
| assert(c.count(4) == 1); |
| assert(c.hash_function() == test_hash<std::hash<int> >()); |
| assert(c.key_eq() == test_compare<std::equal_to<int> >()); |
| assert(c.get_allocator() == min_allocator<int>()); |
| assert(!c.empty()); |
| 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 |
| } |