//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // class set // pair equal_range(const key_type& k); // pair equal_range(const key_type& k) const; #include #include #include "test_macros.h" #include "min_allocator.h" #include "private_constructor.hpp" int main() { { typedef int V; typedef std::set M; { typedef std::pair R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(5); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(7); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(9); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(11); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(13); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(15); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(17); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(19); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 8)); r = m.equal_range(4); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 0)); r = m.equal_range(6); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(8); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(10); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(12); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(14); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(16); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(18); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(20); assert(r.first == next(m.begin(), 8)); assert(r.second == next(m.begin(), 8)); } { typedef std::pair R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(5); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(7); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(9); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(11); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(13); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(15); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(17); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(19); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 8)); r = m.equal_range(4); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 0)); r = m.equal_range(6); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(8); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(10); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(12); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(14); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(16); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(18); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(20); assert(r.first == next(m.begin(), 8)); assert(r.second == next(m.begin(), 8)); } } #if TEST_STD_VER >= 11 { typedef int V; typedef std::set, min_allocator> M; typedef std::pair R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(5); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(7); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(9); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(11); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(13); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(15); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(17); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(19); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 8)); r = m.equal_range(4); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 0)); r = m.equal_range(6); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(8); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(10); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(12); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(14); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(16); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(18); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(20); assert(r.first == next(m.begin(), 8)); assert(r.second == next(m.begin(), 8)); } #endif #if TEST_STD_VER > 11 { typedef int V; typedef std::set> M; { typedef std::pair R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.equal_range(5); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(7); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(9); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(11); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(13); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(15); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(17); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(19); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 8)); r = m.equal_range(4); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 0)); r = m.equal_range(6); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(8); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(10); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(12); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(14); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(16); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(18); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(20); assert(r.first == next(m.begin(), 8)); assert(r.second == next(m.begin(), 8)); } } { typedef PrivateConstructor V; typedef std::set> M; typedef std::pair R; M m; m.insert ( V::make ( 5 )); m.insert ( V::make ( 7 )); m.insert ( V::make ( 9 )); m.insert ( V::make ( 11 )); m.insert ( V::make ( 13 )); m.insert ( V::make ( 15 )); m.insert ( V::make ( 17 )); m.insert ( V::make ( 19 )); R r = m.equal_range(5); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(7); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(9); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(11); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(13); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(15); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(17); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(19); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 8)); r = m.equal_range(4); assert(r.first == next(m.begin(), 0)); assert(r.second == next(m.begin(), 0)); r = m.equal_range(6); assert(r.first == next(m.begin(), 1)); assert(r.second == next(m.begin(), 1)); r = m.equal_range(8); assert(r.first == next(m.begin(), 2)); assert(r.second == next(m.begin(), 2)); r = m.equal_range(10); assert(r.first == next(m.begin(), 3)); assert(r.second == next(m.begin(), 3)); r = m.equal_range(12); assert(r.first == next(m.begin(), 4)); assert(r.second == next(m.begin(), 4)); r = m.equal_range(14); assert(r.first == next(m.begin(), 5)); assert(r.second == next(m.begin(), 5)); r = m.equal_range(16); assert(r.first == next(m.begin(), 6)); assert(r.second == next(m.begin(), 6)); r = m.equal_range(18); assert(r.first == next(m.begin(), 7)); assert(r.second == next(m.begin(), 7)); r = m.equal_range(20); assert(r.first == next(m.begin(), 8)); assert(r.second == next(m.begin(), 8)); } #endif }