1// -*- C++ -*-
2//===------------------------- unordered_set ------------------------------===//
3//
4//                     The LLVM Compiler Infrastructure
5//
6// This file is dual licensed under the MIT and the University of Illinois Open
7// Source Licenses. See LICENSE.TXT for details.
8//
9//===----------------------------------------------------------------------===//
10
11#ifndef _LIBCPP_EXPERIMENTAL_UNORDERED_SET
12#define _LIBCPP_EXPERIMENTAL_UNORDERED_SET
13/*
14    experimental/unordered_set synopsis
15
16// C++1z
17namespace std {
18namespace experimental {
19inline namespace fundamentals_v1 {
20namespace pmr {
21
22  template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23  using unordered_set = std::unordered_set<T, Hash, Pred,
24                       polymorphic_allocator<T>>;
25
26  template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27  using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
28                       polymorphic_allocator<T>>;
29
30} // namespace pmr
31} // namespace fundamentals_v1
32} // namespace experimental
33} // namespace std
34
35 */
36
37#include <experimental/__config>
38#include <unordered_set>
39#include <experimental/memory_resource>
40
41#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
42#pragma GCC system_header
43#endif
44
45_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
46
47template <class _Value,
48          class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
49using unordered_set = _VSTD::unordered_set<_Value, _Hash, _Pred,
50                        polymorphic_allocator<_Value>>;
51
52template <class _Value,
53          class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
54using unordered_multiset = _VSTD::unordered_multiset<_Value, _Hash, _Pred,
55                        polymorphic_allocator<_Value>>;
56
57_LIBCPP_END_NAMESPACE_LFTS_PMR
58
59#endif /* _LIBCPP_EXPERIMENTAL_UNORDERED_SET */
60