iter_iter_comp.pass.cpp revision ba1920fe4b98e61fe47b432689c98b999f5139e3
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// <set> 11 12// class multiset 13 14// template <class InputIterator> 15// multiset(InputIterator first, InputIterator last, const value_compare& comp); 16 17#include <set> 18#include <cassert> 19 20#include "../../../../iterators.h" 21#include "../../../test_compare.h" 22 23int main() 24{ 25 typedef int V; 26 V ar[] = 27 { 28 1, 29 1, 30 1, 31 2, 32 2, 33 2, 34 3, 35 3, 36 3 37 }; 38 typedef test_compare<std::less<V> > C; 39 std::multiset<V, C> m(input_iterator<const V*>(ar), 40 input_iterator<const V*>(ar+sizeof(ar)/sizeof(ar[0])), C(5)); 41 assert(m.value_comp() == C(5)); 42 assert(m.size() == 9); 43 assert(distance(m.begin(), m.end()) == 9); 44 assert(*next(m.begin(), 0) == 1); 45 assert(*next(m.begin(), 1) == 1); 46 assert(*next(m.begin(), 2) == 1); 47 assert(*next(m.begin(), 3) == 2); 48 assert(*next(m.begin(), 4) == 2); 49 assert(*next(m.begin(), 5) == 2); 50 assert(*next(m.begin(), 6) == 3); 51 assert(*next(m.begin(), 7) == 3); 52 assert(*next(m.begin(), 8) == 3); 53} 54