1// -*- C++ -*- 2 3// Copyright (C) 2005-2015 Free Software Foundation, Inc. 4// 5// This file is part of the GNU ISO C++ Library. This library is free 6// software; you can redistribute it and/or modify it under the terms 7// of the GNU General Public License as published by the Free Software 8// Foundation; either version 3, or (at your option) any later 9// version. 10 11// This library is distributed in the hope that it will be useful, but 12// WITHOUT ANY WARRANTY; without even the implied warranty of 13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14// General Public License for more details. 15 16// You should have received a copy of the GNU General Public License 17// along with this library; see the file COPYING3. If not see 18// <http://www.gnu.org/licenses/>. 19 20 21// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 22 23// Permission to use, copy, modify, sell, and distribute this software 24// is hereby granted without fee, provided that the above copyright 25// notice appears in all copies, and that both that copyright notice 26// and this permission notice appear in supporting documentation. None 27// of the above authors, nor IBM Haifa Research Laboratories, make any 28// representation about the suitability of this software for any 29// purpose. It is provided "as is" without express or implied 30// warranty. 31 32/** 33 * @file native_hash_set.hpp 34 * Contains an adapter to TR1 unordered containers. 35 */ 36 37#ifndef PB_DS_NATIVE_HASH_SET_HPP 38#define PB_DS_NATIVE_HASH_SET_HPP 39 40#include <string> 41#include <ext/pb_ds/detail/type_utils.hpp> 42#include <ext/pb_ds/detail/standard_policies.hpp> 43#include <native_type/native_hash_tag.hpp> 44#include <io/xml.hpp> 45#include <tr1/unordered_set> 46 47namespace __gnu_pbds 48{ 49 namespace test 50 { 51#define PB_DS_BASE_C_DEC \ 52 std::tr1::__unordered_set<Key, Hash_Fn, Eq_Fn, \ 53 typename _Alloc::template rebind<Key>::other, Cache_Hash> 54 55 template<typename Key, 56 size_t Init_Size = 8, 57 typename Hash_Fn = typename __gnu_pbds::detail::default_hash_fn<Key>::type, 58 typename Eq_Fn = std::equal_to<Key>, 59 typename Less_Fn = std::less<Key>, 60 typename _Alloc = std::allocator<char>, bool Cache_Hash = false 61 > 62 class native_hash_set : public PB_DS_BASE_C_DEC 63 { 64 private: 65 typedef PB_DS_BASE_C_DEC base_type; 66 67 public: 68 typedef native_hash_tag container_category; 69 70 native_hash_set() : base_type(Init_Size) { } 71 72 template<typename It> 73 native_hash_set(It f, It l) : base_type(f, l) { } 74 75 template<typename Pred> 76 inline size_t 77 erase_if(Pred pred) 78 { 79 size_t ersd = 0; 80 bool done = false; 81 while (!done) 82 { 83 typename base_type::iterator b_it = base_type::begin(); 84 typename base_type::iterator e_it = base_type::end(); 85 done = true; 86 while (b_it != e_it) 87 { 88 if (pred(*b_it)) 89 { 90 ++ersd; 91 done = false; 92 base_type::erase(*b_it); 93 b_it = e_it; 94 } 95 else 96 ++b_it; 97 } 98 } 99 return ersd; 100 } 101 102 static std::string 103 name() 104 { 105 return std::string("n_hash_set_") 106 + (Cache_Hash ? std::string("cah") : std::string("ncah")); 107 } 108 109 static std::string 110 desc() 111 { 112 const std::string cache_hash_desc = 113 make_xml_tag("cache_hash_code", "value", 114 Cache_Hash ? std::string("true") : std::string("false")); 115 116 return make_xml_tag("type", "value", "std_tr1_unordered_set", 117 cache_hash_desc); 118 } 119 }; 120 121#undef PB_DS_BASE_C_DEC 122 } // namespace test 123} // namespace __gnu_pbds 124 125#endif 126