| //===----------------------------------------------------------------------===// |
| // |
| // 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. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <unordered_set> |
| |
| // Increment iterator past end. |
| |
| #if _LIBCPP_DEBUG >= 1 |
| |
| #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) |
| |
| #include <unordered_set> |
| #include <cassert> |
| #include <iterator> |
| #include <exception> |
| #include <cstdlib> |
| |
| #include "min_allocator.h" |
| |
| int main() |
| { |
| { |
| typedef int T; |
| typedef std::unordered_set<T> C; |
| C c(1); |
| C::iterator i = c.begin(); |
| ++i; |
| assert(i == c.end()); |
| ++i; |
| assert(false); |
| } |
| #if __cplusplus >= 201103L |
| { |
| typedef int T; |
| typedef std::unordered_set<T, min_allocator<T>> C; |
| C c(1); |
| C::iterator i = c.begin(); |
| ++i; |
| assert(i == c.end()); |
| ++i; |
| assert(false); |
| } |
| #endif |
| } |
| |
| #else |
| |
| int main() |
| { |
| } |
| |
| #endif |