83 lines
3.0 KiB
C++
83 lines
3.0 KiB
C++
|
|
// Copyright (C) 2008-2011 Daniel James.
|
|
// Copyright (C) 2022 Christian Mazakas
|
|
// Copyright (C) 2024 Braden Ganetsky
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#ifndef BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
|
|
#define BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
|
|
|
|
#include <boost/config.hpp>
|
|
#if defined(BOOST_HAS_PRAGMA_ONCE)
|
|
#pragma once
|
|
#endif
|
|
|
|
#include <boost/container_hash/hash_fwd.hpp>
|
|
#include <functional>
|
|
#include <memory>
|
|
|
|
#ifndef BOOST_NO_CXX17_HDR_MEMORY_RESOURCE
|
|
#include <memory_resource>
|
|
#endif
|
|
|
|
namespace boost {
|
|
namespace unordered {
|
|
template <class T, class H = boost::hash<T>, class P = std::equal_to<T>,
|
|
class A = std::allocator<T> >
|
|
class unordered_set;
|
|
|
|
template <class T, class H, class P, class A>
|
|
inline bool operator==(
|
|
unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
|
|
template <class T, class H, class P, class A>
|
|
inline bool operator!=(
|
|
unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
|
|
template <class T, class H, class P, class A>
|
|
inline void swap(unordered_set<T, H, P, A>& m1,
|
|
unordered_set<T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
|
|
|
|
template <class K, class H, class P, class A, class Predicate>
|
|
typename unordered_set<K, H, P, A>::size_type erase_if(
|
|
unordered_set<K, H, P, A>& c, Predicate pred);
|
|
|
|
template <class T, class H = boost::hash<T>, class P = std::equal_to<T>,
|
|
class A = std::allocator<T> >
|
|
class unordered_multiset;
|
|
|
|
template <class T, class H, class P, class A>
|
|
inline bool operator==(unordered_multiset<T, H, P, A> const&,
|
|
unordered_multiset<T, H, P, A> const&);
|
|
template <class T, class H, class P, class A>
|
|
inline bool operator!=(unordered_multiset<T, H, P, A> const&,
|
|
unordered_multiset<T, H, P, A> const&);
|
|
template <class T, class H, class P, class A>
|
|
inline void swap(unordered_multiset<T, H, P, A>& m1,
|
|
unordered_multiset<T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
|
|
|
|
template <class K, class H, class P, class A, class Predicate>
|
|
typename unordered_multiset<K, H, P, A>::size_type erase_if(
|
|
unordered_multiset<K, H, P, A>& c, Predicate pred);
|
|
|
|
template <class N, class T, class A> class node_handle_set;
|
|
template <class Iter, class NodeType> struct insert_return_type_set;
|
|
|
|
#ifndef BOOST_NO_CXX17_HDR_MEMORY_RESOURCE
|
|
namespace pmr {
|
|
template <class T, class H = boost::hash<T>, class P = std::equal_to<T> >
|
|
using unordered_set = boost::unordered::unordered_set<T, H, P,
|
|
std::pmr::polymorphic_allocator<T> >;
|
|
|
|
template <class T, class H = boost::hash<T>, class P = std::equal_to<T> >
|
|
using unordered_multiset = boost::unordered::unordered_multiset<T, H, P,
|
|
std::pmr::polymorphic_allocator<T> >;
|
|
} // namespace pmr
|
|
#endif
|
|
} // namespace unordered
|
|
|
|
using boost::unordered::unordered_multiset;
|
|
using boost::unordered::unordered_set;
|
|
} // namespace boost
|
|
|
|
#endif
|