1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_set> 11 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13 // class Alloc = allocator<Value>> 14 // class unordered_multiset 15 16 // template <class InputIterator> 17 // unordered_multiset(InputIterator first, InputIterator last); 18 19 #include <unordered_set> 20 #include <cassert> 21 #include <cfloat> 22 23 #include "test_iterators.h" 24 #include "../../../test_compare.h" 25 #include "../../../test_hash.h" 26 #include "../../../test_allocator.h" 27 28 int main() 29 { 30 { 31 typedef std::unordered_multiset<int, 32 test_hash<std::hash<int> >, 33 test_compare<std::equal_to<int> >, 34 test_allocator<int> 35 > C; 36 typedef int P; 37 P a[] = 38 { 39 P(1), 40 P(2), 41 P(3), 42 P(4), 43 P(1), 44 P(2) 45 }; 46 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); 47 assert(c.bucket_count() >= 7); 48 assert(c.size() == 6); 49 assert(c.count(1) == 2); 50 assert(c.count(2) == 2); 51 assert(c.count(3) == 1); 52 assert(c.count(4) == 1); 53 assert(c.hash_function() == test_hash<std::hash<int> >()); 54 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 55 assert(c.get_allocator() == test_allocator<int>()); 56 assert(!c.empty()); 57 assert(std::distance(c.begin(), c.end()) == c.size()); 58 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 59 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 60 assert(c.max_load_factor() == 1); 61 } 62 } 63
