1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <unordered_set> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// class Alloc = allocator<Value>> 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// class unordered_multiset 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class InputIterator> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// unordered_multiset(InputIterator first, InputIterator last); 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <unordered_set> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 21f836d531b4146465342939fe32ae47d157ee07b2Howard Hinnant#include <cfloat> 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 2383e2c4d877fe2d7793868b1c6a5d9525a7c4d431Marshall Clow#include "test_iterators.h" 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include "../../../test_compare.h" 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include "../../../test_hash.h" 261b92188a82b01e76ac6e8ad5f997293c2a078adcMarshall Clow#include "test_allocator.h" 27061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::unordered_multiset<int, 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test_hash<std::hash<int> >, 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test_compare<std::equal_to<int> >, 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test_allocator<int> 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant > C; 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef int P; 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P a[] = 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(1), 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(2), 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(3), 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(4), 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(1), 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(2) 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant }; 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.bucket_count() >= 7); 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.size() == 6); 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.count(1) == 2); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.count(2) == 2); 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.count(3) == 1); 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.count(4) == 1); 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.hash_function() == test_hash<std::hash<int> >()); 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.key_eq() == test_compare<std::equal_to<int> >()); 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.get_allocator() == test_allocator<int>()); 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(!c.empty()); 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::distance(c.begin(), c.end()) == c.size()); 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::distance(c.cbegin(), c.cend()) == c.size()); 60f836d531b4146465342939fe32ae47d157ee07b2Howard Hinnant assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c.max_load_factor() == 1); 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 637a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant#if __cplusplus >= 201103L 647a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant { 657a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant typedef std::unordered_multiset<int, 667a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant test_hash<std::hash<int> >, 677a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant test_compare<std::equal_to<int> >, 687a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant min_allocator<int> 697a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant > C; 707a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant typedef int P; 717a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P a[] = 727a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant { 737a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(1), 747a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(2), 757a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(3), 767a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(4), 777a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(1), 787a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(2) 797a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant }; 807a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); 817a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.bucket_count() >= 7); 827a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.size() == 6); 837a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.count(1) == 2); 847a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.count(2) == 2); 857a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.count(3) == 1); 867a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.count(4) == 1); 877a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.hash_function() == test_hash<std::hash<int> >()); 887a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.key_eq() == test_compare<std::equal_to<int> >()); 897a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.get_allocator() == min_allocator<int>()); 907a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(!c.empty()); 917a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(std::distance(c.begin(), c.end()) == c.size()); 927a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(std::distance(c.cbegin(), c.cend()) == c.size()); 937a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 947a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(c.max_load_factor() == 1); 957a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant } 96bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow#if _LIBCPP_STD_VER > 11 97bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow { 98bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef int T; 99bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_hash<std::hash<T>> HF; 100bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_compare<std::equal_to<T>> Comp; 101bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_allocator<T> A; 102bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef std::unordered_multiset<T, HF, Comp, A> C; 103bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T arr[] = 104bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow { 105bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(1), 106bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(2), 107bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(3), 108bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(4), 109bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(1), 110bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(2) 111bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow }; 112bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow A a(42); 113bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 114bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.bucket_count() >= 12); 115bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.size() == 6); 116bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(1) == 2); 117bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(2) == 2); 118bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(3) == 1); 119bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(4) == 1); 120bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.hash_function() == HF()); 121bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.key_eq() == Comp()); 122bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.get_allocator() == a); 123bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(!(c.get_allocator() == A())); 124bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(!c.empty()); 125bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(std::distance(c.begin(), c.end()) == c.size()); 126bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(std::distance(c.cbegin(), c.cend()) == c.size()); 127bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 128bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.max_load_factor() == 1); 129bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow } 130bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow { 131bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef int T; 132bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_hash<std::hash<T>> HF; 133bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_compare<std::equal_to<T>> Comp; 134bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef test_allocator<T> A; 135bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow typedef std::unordered_multiset<T, HF, Comp, A> C; 136bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T arr[] = 137bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow { 138bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(1), 139bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(2), 140bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(3), 141bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(4), 142bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(1), 143bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow T(2) 144bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow }; 145bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow HF hf(43); 146bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow A a(42); 147bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a); 148bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.bucket_count() >= 16); 149bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.size() == 6); 150bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(1) == 2); 151bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(2) == 2); 152bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(3) == 1); 153bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.count(4) == 1); 154bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.hash_function() == hf); 155bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(!(c.hash_function() == HF())); 156bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.key_eq() == Comp()); 157bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.get_allocator() == a); 158bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(!(c.get_allocator() == A())); 159bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(!c.empty()); 160bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(std::distance(c.begin(), c.end()) == c.size()); 161bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(std::distance(c.cbegin(), c.cend()) == c.size()); 162bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 163bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow assert(c.max_load_factor() == 1); 164bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow } 165bd444af850efeb267e17d1b3aef521c5c4d43cc4Marshall Clow#endif 1667a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant#endif 167bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 168