int main() { typedef std::pair<const int, double> V; { typedef std::multimap<int, double> M; { typedef std::pair<M::iterator, M::iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } { typedef std::pair<M::const_iterator, M::const_iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } } #if __cplusplus >= 201103L { typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; { typedef std::pair<M::iterator, M::iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } { typedef std::pair<M::const_iterator, M::const_iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } } #endif #if _LIBCPP_STD_VER > 11 { typedef std::pair<const int, double> V; typedef std::multimap<int, double, std::less<>> M; typedef std::pair<M::iterator, M::iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); r = m.equal_range(C2Int(4)); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(C2Int(5)); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(C2Int(6)); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(C2Int(7)); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(C2Int(8)); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(C2Int(9)); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(C2Int(10)); assert(r.first == m.end()); assert(r.second == m.end()); } { typedef PrivateConstructor PC; typedef std::multimap<PC, double, std::less<>> M; typedef std::pair<M::iterator, M::iterator> R; M m; m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 )); // assert(m.size() == 9); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } #endif }
int main() { typedef std::pair<const int, double> V; { typedef std::multimap<int, double> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #if __cplusplus >= 201103L { typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } } #endif #if _LIBCPP_STD_VER > 11 { typedef std::pair<const int, double> V; typedef std::multimap<int, double, std::less<>> M; typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } { typedef PrivateConstructor PC; typedef std::multimap<PC, double, std::less<>> M; typedef M::iterator R; M m; m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 )); m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 )); R r = m.find(5); assert(r == m.begin()); r = m.find(6); assert(r == m.end()); r = m.find(7); assert(r == next(m.begin(), 3)); r = m.find(8); assert(r == m.end()); r = m.find(9); assert(r == next(m.begin(), 6)); r = m.find(10); assert(r == m.end()); } #endif }
{ typedef contiguous::multiset<MoveOnly> M; typedef M::iterator R; M m; R r = m.insert(M::value_type(2)); REQUIRE(r == m.begin()); REQUIRE(m.size() == 1); REQUIRE(*r == 2); r = m.insert(M::value_type(1)); REQUIRE(r == m.begin()); REQUIRE(m.size() == 2); REQUIRE(*r == 1); r = m.insert(M::value_type(3)); REQUIRE(r == prev(m.end())); REQUIRE(m.size() == 3); REQUIRE(*r == 3); r = m.insert(M::value_type(3)); REQUIRE(r == prev(m.end())); REQUIRE(m.size() == 4); REQUIRE(*r == 3); } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES #if TEST_STD_VER >= 11 { typedef contiguous::multiset<MoveOnly, std::less<MoveOnly>, min_allocator<MoveOnly>> M; typedef M::iterator R; M m; R r = m.insert(M::value_type(2));
REQUIRE(m.size() == 4); REQUIRE(i == next(m.begin(), 2)); REQUIRE(*next(m.begin(), 0) == 1); REQUIRE(*next(m.begin(), 1) == 2); REQUIRE(*next(m.begin(), 2) == 7); REQUIRE(*next(m.begin(), 3) == 8); i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); REQUIRE(m.size() == 2); REQUIRE(i == next(m.begin(), 0)); REQUIRE(*next(m.begin(), 0) == 7); REQUIRE(*next(m.begin(), 1) == 8); i = m.erase(m.cbegin(), m.cend()); REQUIRE(m.size() == 0); REQUIRE(i == m.end()); } #if TEST_STD_VER >= 11 { typedef contiguous::multiset<int, std::less<int>, min_allocator<int>> M; typedef int V; typedef M::iterator I; V ar[] = { 1, 2, 3, 4, 5, 6, 7,
int main() { typedef std::pair<const int, double> V; { typedef std::multimap<int, double> M; { typedef std::pair<M::iterator, M::iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } { typedef std::pair<M::const_iterator, M::const_iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } } #if __cplusplus >= 201103L { typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; { typedef std::pair<M::iterator, M::iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } { typedef std::pair<M::const_iterator, M::const_iterator> R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(4); assert(r.first == m.begin()); assert(r.second == m.begin()); r = m.equal_range(5); assert(r.first == m.begin()); assert(r.second == next(m.begin(), 3)); r = m.equal_range(6); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(7); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(8); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(9); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 9)); r = m.equal_range(10); assert(r.first == m.end()); assert(r.second == m.end()); } } #endif }
int main() { typedef std::pair<const int, double> V; { typedef std::multimap<int, double> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.upper_bound(4); assert(r == m.begin()); r = m.upper_bound(5); assert(r == next(m.begin(), 3)); r = m.upper_bound(6); assert(r == next(m.begin(), 3)); r = m.upper_bound(7); assert(r == next(m.begin(), 6)); r = m.upper_bound(8); assert(r == next(m.begin(), 6)); r = m.upper_bound(9); assert(r == next(m.begin(), 9)); r = m.upper_bound(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.upper_bound(4); assert(r == m.begin()); r = m.upper_bound(5); assert(r == next(m.begin(), 3)); r = m.upper_bound(6); assert(r == next(m.begin(), 3)); r = m.upper_bound(7); assert(r == next(m.begin(), 6)); r = m.upper_bound(8); assert(r == next(m.begin(), 6)); r = m.upper_bound(9); assert(r == next(m.begin(), 9)); r = m.upper_bound(10); assert(r == m.end()); } } #if __cplusplus >= 201103L { typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; { typedef M::iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.upper_bound(4); assert(r == m.begin()); r = m.upper_bound(5); assert(r == next(m.begin(), 3)); r = m.upper_bound(6); assert(r == next(m.begin(), 3)); r = m.upper_bound(7); assert(r == next(m.begin(), 6)); r = m.upper_bound(8); assert(r == next(m.begin(), 6)); r = m.upper_bound(9); assert(r == next(m.begin(), 9)); r = m.upper_bound(10); assert(r == m.end()); } { typedef M::const_iterator R; V ar[] = { V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.upper_bound(4); assert(r == m.begin()); r = m.upper_bound(5); assert(r == next(m.begin(), 3)); r = m.upper_bound(6); assert(r == next(m.begin(), 3)); r = m.upper_bound(7); assert(r == next(m.begin(), 6)); r = m.upper_bound(8); assert(r == next(m.begin(), 6)); r = m.upper_bound(9); assert(r == next(m.begin(), 9)); r = m.upper_bound(10); assert(r == m.end()); } } #endif }