//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // <set> // class set // size_type count(const key_type& k) const; #include <set> #include <cassert> #include "test_macros.h" #include "min_allocator.h" #include "private_constructor.hpp" int main() { { typedef int V; typedef std::set<int> M; typedef M::size_type R; V ar[] = { 5, 6, 7, 8, 9, 10, 11, 12 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.count(5); assert(r == 1); r = m.count(6); assert(r == 1); r = m.count(7); assert(r == 1); r = m.count(8); assert(r == 1); r = m.count(9); assert(r == 1); r = m.count(10); assert(r == 1); r = m.count(11); assert(r == 1); r = m.count(12); assert(r == 1); r = m.count(4); assert(r == 0); } #if TEST_STD_VER >= 11 { typedef int V; typedef std::set<int, std::less<int>, min_allocator<int>> M; typedef M::size_type R; V ar[] = { 5, 6, 7, 8, 9, 10, 11, 12 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.count(5); assert(r == 1); r = m.count(6); assert(r == 1); r = m.count(7); assert(r == 1); r = m.count(8); assert(r == 1); r = m.count(9); assert(r == 1); r = m.count(10); assert(r == 1); r = m.count(11); assert(r == 1); r = m.count(12); assert(r == 1); r = m.count(4); assert(r == 0); } #endif #if TEST_STD_VER > 11 { typedef int V; typedef std::set<int, std::less<>> M; typedef M::size_type R; V ar[] = { 5, 6, 7, 8, 9, 10, 11, 12 }; const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); R r = m.count(5); assert(r == 1); r = m.count(6); assert(r == 1); r = m.count(7); assert(r == 1); r = m.count(8); assert(r == 1); r = m.count(9); assert(r == 1); r = m.count(10); assert(r == 1); r = m.count(11); assert(r == 1); r = m.count(12); assert(r == 1); r = m.count(4); assert(r == 0); } { typedef PrivateConstructor V; typedef std::set<V, std::less<>> M; typedef M::size_type R; M m; m.insert ( V::make ( 5 )); m.insert ( V::make ( 6 )); m.insert ( V::make ( 7 )); m.insert ( V::make ( 8 )); m.insert ( V::make ( 9 )); m.insert ( V::make ( 10 )); m.insert ( V::make ( 11 )); m.insert ( V::make ( 12 )); const M& mc = m; R r = mc.count(5); assert(r == 1); r = mc.count(6); assert(r == 1); r = mc.count(7); assert(r == 1); r = mc.count(8); assert(r == 1); r = mc.count(9); assert(r == 1); r = mc.count(10); assert(r == 1); r = mc.count(11); assert(r == 1); r = mc.count(12); assert(r == 1); r = mc.count(4); assert(r == 0); } #endif }