7a6b7cedcb
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@184635 91177308-0d34-0410-b5e6-96231b3b80d8
68 lines
1.6 KiB
C++
68 lines
1.6 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>
|
|
|
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
|
// class Alloc = allocator<Value>>
|
|
// class unordered_set
|
|
|
|
// const_iterator find(const key_type& k) const;
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::unordered_set<int> C;
|
|
typedef int P;
|
|
P a[] =
|
|
{
|
|
P(10),
|
|
P(20),
|
|
P(30),
|
|
P(40),
|
|
P(50),
|
|
P(60),
|
|
P(70),
|
|
P(80)
|
|
};
|
|
const C c(std::begin(a), std::end(a));
|
|
C::const_iterator i = c.find(30);
|
|
assert(*i == 30);
|
|
i = c.find(5);
|
|
assert(i == c.cend());
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
|
typedef int P;
|
|
P a[] =
|
|
{
|
|
P(10),
|
|
P(20),
|
|
P(30),
|
|
P(40),
|
|
P(50),
|
|
P(60),
|
|
P(70),
|
|
P(80)
|
|
};
|
|
const C c(std::begin(a), std::end(a));
|
|
C::const_iterator i = c.find(30);
|
|
assert(*i == 30);
|
|
i = c.find(5);
|
|
assert(i == c.cend());
|
|
}
|
|
#endif
|
|
}
|