//===----------------------------------------------------------------------===// // // 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 map // size_type count(const key_type& k) const; #include #include #include "min_allocator.h" int main() { { typedef std::pair V; typedef std::map M; { typedef M::size_type R; V ar[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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 __cplusplus >= 201103L { typedef std::pair V; typedef std::map, min_allocator> M; { typedef M::size_type R; V ar[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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 }