Home | History | Annotate | Download | only in unord.set
      1 //===----------------------------------------------------------------------===//
      2 //
      3 //                     The LLVM Compiler Infrastructure
      4 //
      5 // This file is dual licensed under the MIT and the University of Illinois Open
      6 // Source Licenses. See LICENSE.TXT for details.
      7 //
      8 //===----------------------------------------------------------------------===//
      9 
     10 // <unordered_set>
     11 
     12 // Increment iterator past end.
     13 
     14 #if _LIBCPP_DEBUG >= 1
     15 
     16 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
     17 
     18 #include <unordered_set>
     19 #include <cassert>
     20 #include <iterator>
     21 #include <exception>
     22 #include <cstdlib>
     23 
     24 #include "min_allocator.h"
     25 
     26 int main()
     27 {
     28     {
     29     typedef int T;
     30     typedef std::unordered_set<T> C;
     31     C c(1);
     32     C::iterator i = c.begin();
     33     ++i;
     34     assert(i == c.end());
     35     ++i;
     36     assert(false);
     37     }
     38 #if __cplusplus >= 201103L
     39     {
     40     typedef int T;
     41     typedef std::unordered_set<T, min_allocator<T>> C;
     42     C c(1);
     43     C::iterator i = c.begin();
     44     ++i;
     45     assert(i == c.end());
     46     ++i;
     47     assert(false);
     48     }
     49 #endif
     50 }
     51 
     52 #else
     53 
     54 int main()
     55 {
     56 }
     57 
     58 #endif
     59