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 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13 // class Alloc = allocator<Value>> 14 // class unordered_set 15 16 // const_iterator find(const key_type& k) const; 17 18 #include <unordered_set> 19 #include <cassert> 20 21 int main() 22 { 23 { 24 typedef std::unordered_set<int> C; 25 typedef int P; 26 P a[] = 27 { 28 P(10), 29 P(20), 30 P(30), 31 P(40), 32 P(50), 33 P(60), 34 P(70), 35 P(80) 36 }; 37 const C c(std::begin(a), std::end(a)); 38 C::const_iterator i = c.find(30); 39 assert(*i == 30); 40 i = c.find(5); 41 assert(i == c.cend()); 42 } 43 } 44