File indexing completed on 2025-01-18 09:53:22
0001
0002
0003
0004
0005
0006
0007
0008
0009
0010
0011
0012 #ifndef BOOST_UNORDERED_CONCURRENT_FLAT_SET_FWD_HPP
0013 #define BOOST_UNORDERED_CONCURRENT_FLAT_SET_FWD_HPP
0014
0015 #include <boost/container_hash/hash_fwd.hpp>
0016
0017 #include <functional>
0018 #include <memory>
0019
0020 namespace boost {
0021 namespace unordered {
0022
0023 template <class Key, class Hash = boost::hash<Key>,
0024 class Pred = std::equal_to<Key>,
0025 class Allocator = std::allocator<Key> >
0026 class concurrent_flat_set;
0027
0028 template <class Key, class Hash, class KeyEqual, class Allocator>
0029 bool operator==(
0030 concurrent_flat_set<Key, Hash, KeyEqual, Allocator> const& lhs,
0031 concurrent_flat_set<Key, Hash, KeyEqual, Allocator> const& rhs);
0032
0033 template <class Key, class Hash, class KeyEqual, class Allocator>
0034 bool operator!=(
0035 concurrent_flat_set<Key, Hash, KeyEqual, Allocator> const& lhs,
0036 concurrent_flat_set<Key, Hash, KeyEqual, Allocator> const& rhs);
0037
0038 template <class Key, class Hash, class Pred, class Alloc>
0039 void swap(concurrent_flat_set<Key, Hash, Pred, Alloc>& x,
0040 concurrent_flat_set<Key, Hash, Pred, Alloc>& y)
0041 noexcept(noexcept(x.swap(y)));
0042
0043 template <class K, class H, class P, class A, class Predicate>
0044 typename concurrent_flat_set<K, H, P, A>::size_type erase_if(
0045 concurrent_flat_set<K, H, P, A>& c, Predicate pred);
0046
0047 }
0048
0049 using boost::unordered::concurrent_flat_set;
0050 }
0051
0052 #endif