int main() { { typedef int V; typedef std::multiset<int> M; { typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef M::const_iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } } #if __cplusplus >= 201103L { typedef int V; typedef std::multiset<int, std::less<int>, min_allocator<int>> M; { typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef M::const_iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } } #endif }
int main(int, char**) { { typedef int V; typedef std::multiset<int> M; { typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef M::const_iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } } #if TEST_STD_VER >= 11 { typedef int V; typedef std::multiset<int, std::less<int>, min_allocator<int>> M; { typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef M::const_iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } } #endif #if TEST_STD_VER > 11 { typedef int V; typedef std::multiset<V, std::less<>> M; typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef PrivateConstructor V; typedef std::multiset<V, std::less<>> M; typedef M::iterator R; M m; m.insert ( V::make ( 5 )); m.insert ( V::make ( 5 )); m.insert ( V::make ( 5 )); m.insert ( V::make ( 7 )); m.insert ( V::make ( 7 )); m.insert ( V::make ( 7 )); m.insert ( V::make ( 9 )); m.insert ( V::make ( 9 )); m.insert ( V::make ( 9 )); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } #endif return 0; }
int main(int, char**) { { typedef std::pair<const int, double> V; typedef std::map<int, double> M; { typedef M::iterator R; V ar[] = { V(5, 5), V(7, 6), V(9, 7), V(11, 8), V(13, 9), V(15, 10), V(17, 11), V(19, 12) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } { typedef M::const_iterator R; V ar[] = { V(5, 5), V(7, 6), V(9, 7), V(11, 8), V(13, 9), V(15, 10), V(17, 11), V(19, 12) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } } #if TEST_STD_VER >= 11 { typedef std::pair<const int, double> V; typedef std::map<int, double, std::less<int>, min_allocator<V>> M; { typedef M::iterator R; V ar[] = { V(5, 5), V(7, 6), V(9, 7), V(11, 8), V(13, 9), V(15, 10), V(17, 11), V(19, 12) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } { typedef M::const_iterator R; V ar[] = { V(5, 5), V(7, 6), V(9, 7), V(11, 8), V(13, 9), V(15, 10), V(17, 11), V(19, 12) }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } } #endif #if TEST_STD_VER > 11 { typedef std::pair<const int, double> V; typedef std::map<int, double, std::less <>> M; typedef M::iterator R; V ar[] = { V(5, 5), V(7, 6), V(9, 7), V(11, 8), V(13, 9), V(15, 10), V(17, 11), V(19, 12) }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); r = m.lower_bound(C2Int(5)); assert(r == m.begin()); r = m.lower_bound(C2Int(7)); assert(r == next(m.begin())); r = m.lower_bound(C2Int(9)); assert(r == next(m.begin(), 2)); r = m.lower_bound(C2Int(11)); assert(r == next(m.begin(), 3)); r = m.lower_bound(C2Int(13)); assert(r == next(m.begin(), 4)); r = m.lower_bound(C2Int(15)); assert(r == next(m.begin(), 5)); r = m.lower_bound(C2Int(17)); assert(r == next(m.begin(), 6)); r = m.lower_bound(C2Int(19)); assert(r == next(m.begin(), 7)); r = m.lower_bound(C2Int(4)); assert(r == next(m.begin(), 0)); r = m.lower_bound(C2Int(6)); assert(r == next(m.begin(), 1)); r = m.lower_bound(C2Int(8)); assert(r == next(m.begin(), 2)); r = m.lower_bound(C2Int(10)); assert(r == next(m.begin(), 3)); r = m.lower_bound(C2Int(12)); assert(r == next(m.begin(), 4)); r = m.lower_bound(C2Int(14)); assert(r == next(m.begin(), 5)); r = m.lower_bound(C2Int(16)); assert(r == next(m.begin(), 6)); r = m.lower_bound(C2Int(18)); assert(r == next(m.begin(), 7)); r = m.lower_bound(C2Int(20)); assert(r == next(m.begin(), 8)); } { typedef PrivateConstructor PC; typedef std::map<PC, double, std::less<>> M; typedef M::iterator R; M m; m [ PC::make(5) ] = 5; m [ PC::make(7) ] = 6; m [ PC::make(9) ] = 7; m [ PC::make(11) ] = 8; m [ PC::make(13) ] = 9; m [ PC::make(15) ] = 10; m [ PC::make(17) ] = 11; m [ PC::make(19) ] = 12; R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } #endif return 0; }
int main() { { typedef int V; typedef std::set<int> M; { typedef M::iterator R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } { typedef M::const_iterator R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } } #if __cplusplus >= 201103L || defined(_LIBCPP_MSVC) { typedef int V; typedef std::set<int, std::less<int>, min_allocator<int>> M; { typedef M::iterator R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } { typedef M::const_iterator R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } } #endif #if _LIBCPP_STD_VER > 11 { typedef int V; typedef std::set<V, std::less<>> M; typedef M::iterator R; V ar[] = { 5, 7, 9, 11, 13, 15, 17, 19 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } { typedef PrivateConstructor V; typedef std::set<V, std::less<>> M; typedef M::iterator 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.lower_bound(5); assert(r == m.begin()); r = m.lower_bound(7); assert(r == next(m.begin())); r = m.lower_bound(9); assert(r == next(m.begin(), 2)); r = m.lower_bound(11); assert(r == next(m.begin(), 3)); r = m.lower_bound(13); assert(r == next(m.begin(), 4)); r = m.lower_bound(15); assert(r == next(m.begin(), 5)); r = m.lower_bound(17); assert(r == next(m.begin(), 6)); r = m.lower_bound(19); assert(r == next(m.begin(), 7)); r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 1)); r = m.lower_bound(8); assert(r == next(m.begin(), 2)); r = m.lower_bound(10); assert(r == next(m.begin(), 3)); r = m.lower_bound(12); assert(r == next(m.begin(), 4)); r = m.lower_bound(14); assert(r == next(m.begin(), 5)); r = m.lower_bound(16); assert(r == next(m.begin(), 6)); r = m.lower_bound(18); assert(r == next(m.begin(), 7)); r = m.lower_bound(20); assert(r == next(m.begin(), 8)); } #endif }
int main() { typedef int V; typedef std::multiset<int> M; { typedef M::iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } { typedef M::const_iterator R; V ar[] = { 5, 5, 5, 7, 7, 7, 9, 9, 9 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.lower_bound(4); assert(r == next(m.begin(), 0)); r = m.lower_bound(5); assert(r == next(m.begin(), 0)); r = m.lower_bound(6); assert(r == next(m.begin(), 3)); r = m.lower_bound(7); assert(r == next(m.begin(), 3)); r = m.lower_bound(8); assert(r == next(m.begin(), 6)); r = m.lower_bound(9); assert(r == next(m.begin(), 6)); r = m.lower_bound(11); assert(r == next(m.begin(), 9)); } }