boost/unordered/unordered_node_map_fwd.hpp

0001
0002 // Copyright (C) 2022 Christian Mazakas
0003 // Distributed under the Boost Software License, Version 1.0. (See accompanying
0004 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
0005
0006 #ifndef BOOST_UNORDERED_NODE_MAP_FWD_HPP_INCLUDED
0007 #define BOOST_UNORDERED_NODE_MAP_FWD_HPP_INCLUDED
0008
0009 #include <boost/config.hpp>
0010 #if defined(BOOST_HAS_PRAGMA_ONCE)
0011 #pragma once
0012 #endif
0013
0014 #include <boost/container_hash/hash_fwd.hpp>
0015 #include <functional>
0016 #include <memory>
0017
0018 namespace boost {
0019   namespace unordered {
0020     template <class Key, class T, class Hash = boost::hash<Key>,
0021       class KeyEqual = std::equal_to<Key>,
0022       class Allocator = std::allocator<std::pair<const Key, T> > >
0023     class unordered_node_map;
0024
0025     template <class Key, class T, class Hash, class KeyEqual, class Allocator>
0026     bool operator==(
0027       unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
0028       unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& rhs);
0029
0030     template <class Key, class T, class Hash, class KeyEqual, class Allocator>
0031     bool operator!=(
0032       unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
0033       unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& rhs);
0034
0035     template <class Key, class T, class Hash, class KeyEqual, class Allocator>
0036     void swap(unordered_node_map<Key, T, Hash, KeyEqual, Allocator>& lhs,
0037       unordered_node_map<Key, T, Hash, KeyEqual, Allocator>& rhs)
0038       noexcept(noexcept(lhs.swap(rhs)));
0039   } // namespace unordered
0040
0041   using boost::unordered::unordered_node_map;
0042 } // namespace boost
0043
0044 #endif