FM / unordered

/usr/include/boost/unordered

Name	Size	Mode	Actions
detail/	-	0755	rm
unordered_map.hpp	90040	0644	edit dl rm
unordered_map_fwd.hpp	2385	0644	edit dl rm
unordered_set.hpp	69345	0644	edit dl rm
unordered_set_fwd.hpp	2206	0644	edit dl rm

Edit: /usr/include/boost/unordered/unordered_set_fwd.hpp (2206B)

// Copyright (C) 2008-2011 Daniel James.
// 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/functional/hash_fwd.hpp>
#include <boost/unordered/detail/fwd.hpp>
#include <functional>
#include <memory>

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)
      BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2)));

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)
      BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2)));

template <class N, class T, class A> class node_handle_set;
    template <class N, class T, class A> struct insert_return_type_set;
  }

using boost::unordered::unordered_set;
  using boost::unordered::unordered_multiset;
  using boost::unordered::swap;
  using boost::unordered::operator==;
  using boost::unordered::operator!=;
}

#endif

// Copyright (C) 2008-2011 Daniel James. // 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 #if defined(BOOST_HAS_PRAGMA_ONCE) #pragma once #endif #include #include #include #include namespace boost { namespace unordered { template , class P = std::equal_to, class A = std::allocator > class unordered_set; template inline bool operator==( unordered_set const&, unordered_set const&); template inline bool operator!=( unordered_set const&, unordered_set const&); template inline void swap( unordered_set& m1, unordered_set& m2) BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2))); template , class P = std::equal_to, class A = std::allocator > class unordered_multiset; template inline bool operator==(unordered_multiset const&, unordered_multiset const&); template inline bool operator!=(unordered_multiset const&, unordered_multiset const&); template inline void swap( unordered_multiset& m1, unordered_multiset& m2) BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2))); template class node_handle_set; template struct insert_return_type_set; } using boost::unordered::unordered_set; using boost::unordered::unordered_multiset; using boost::unordered::swap; using boost::unordered::operator==; using boost::unordered::operator!=; } #endif