diff options
Diffstat (limited to 'libcxx/test/containers/associative/map/map.ops/count.pass.cpp')
| -rw-r--r-- | libcxx/test/containers/associative/map/map.ops/count.pass.cpp | 173 |
1 files changed, 0 insertions, 173 deletions
diff --git a/libcxx/test/containers/associative/map/map.ops/count.pass.cpp b/libcxx/test/containers/associative/map/map.ops/count.pass.cpp deleted file mode 100644 index 9668055b8bc..00000000000 --- a/libcxx/test/containers/associative/map/map.ops/count.pass.cpp +++ /dev/null @@ -1,173 +0,0 @@ -//===----------------------------------------------------------------------===// -// -// 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. -// -//===----------------------------------------------------------------------===// - -// <map> - -// class map - -// size_type count(const key_type& k) const; - -#include <map> -#include <cassert> - -#include "min_allocator.h" -#include "private_constructor.hpp" - -int main() -{ - { - typedef std::pair<const int, double> V; - typedef std::map<int, double> 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<const int, double> V; - typedef std::map<int, double, std::less<int>, min_allocator<V>> 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 -#if _LIBCPP_STD_VER > 11 - { - typedef std::pair<const int, double> V; - typedef std::map<int, double, std::less <>> 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); - } - - { - typedef PrivateConstructor PC; - typedef std::map<PC, double, std::less<>> M; - typedef M::size_type R; - - M m; - m [ PC::make(5) ] = 5; - m [ PC::make(6) ] = 6; - m [ PC::make(7) ] = 7; - m [ PC::make(8) ] = 8; - m [ PC::make(9) ] = 9; - m [ PC::make(10) ] = 10; - m [ PC::make(11) ] = 11; - m [ PC::make(12) ] = 12; - - 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 -} |
