4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
54 lines
1 KiB
C++
54 lines
1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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>
|
|
|
|
// Dereference non-dereferenceable iterator.
|
|
|
|
#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_multiset<T> C;
|
|
C c(1);
|
|
C::iterator i = c.end();
|
|
T j = *i;
|
|
assert(false);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef int T;
|
|
typedef std::unordered_multiset<T, min_allocator<T>> C;
|
|
C c(1);
|
|
C::iterator i = c.end();
|
|
T j = *i;
|
|
assert(false);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
#else
|
|
|
|
int main()
|
|
{
|
|
}
|
|
|
|
#endif
|