| //===----------------------------------------------------------------------===// |
| // |
| // 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 |
| |
| // void clear(); |
| |
| #include <map> |
| #include <cassert> |
| |
| #include "../../../min_allocator.h" |
| |
| int main() |
| { |
| { |
| typedef std::map<int, double> M; |
| typedef std::pair<int, double> P; |
| P ar[] = |
| { |
| P(1, 1.5), |
| P(2, 2.5), |
| P(3, 3.5), |
| P(4, 4.5), |
| P(5, 5.5), |
| P(6, 6.5), |
| P(7, 7.5), |
| P(8, 8.5), |
| }; |
| M m(ar, ar + sizeof(ar)/sizeof(ar[0])); |
| assert(m.size() == 8); |
| m.clear(); |
| assert(m.size() == 0); |
| } |
| #if __cplusplus >= 201103L |
| { |
| typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; |
| typedef std::pair<int, double> P; |
| P ar[] = |
| { |
| P(1, 1.5), |
| P(2, 2.5), |
| P(3, 3.5), |
| P(4, 4.5), |
| P(5, 5.5), |
| P(6, 6.5), |
| P(7, 7.5), |
| P(8, 8.5), |
| }; |
| M m(ar, ar + sizeof(ar)/sizeof(ar[0])); |
| assert(m.size() == 8); |
| m.clear(); |
| assert(m.size() == 0); |
| } |
| #endif |
| } |