FM / intrusive

/usr/include/boost/intrusive

Name	Size	Mode	Actions
detail/	-	0755	rm
any_hook.hpp	10506	0644	edit dl rm
avltree.hpp	24124	0644	edit dl rm
avltree_algorithms.hpp	28978	0644	edit dl rm
avl_set.hpp	45382	0644	edit dl rm
avl_set_hook.hpp	10965	0644	edit dl rm
bstree.hpp	95208	0644	edit dl rm
bstree_algorithms.hpp	80071	0644	edit dl rm
bs_set.hpp	44898	0644	edit dl rm
bs_set_hook.hpp	10501	0644	edit dl rm
circular_list_algorithms.hpp	15376	0644	edit dl rm
circular_slist_algorithms.hpp	15029	0644	edit dl rm
derivation_value_traits.hpp	2749	0644	edit dl rm
hashtable.hpp	156071	0644	edit dl rm
intrusive_fwd.hpp	16382	0644	edit dl rm
linear_slist_algorithms.hpp	11968	0644	edit dl rm
link_mode.hpp	2091	0644	edit dl rm
list.hpp	58089	0644	edit dl rm
list_hook.hpp	10171	0644	edit dl rm
member_value_traits.hpp	3481	0644	edit dl rm
options.hpp	10996	0644	edit dl rm
pack_options.hpp	10174	0644	edit dl rm
parent_from_member.hpp	2005	0644	edit dl rm
pointer_plus_bits.hpp	3752	0644	edit dl rm
pointer_rebind.hpp	6306	0644	edit dl rm
pointer_traits.hpp	13898	0644	edit dl rm
priority_compare.hpp	1812	0644	edit dl rm
rbtree.hpp	24245	0644	edit dl rm
rbtree_algorithms.hpp	25974	0644	edit dl rm
set.hpp	44751	0644	edit dl rm
set_hook.hpp	10812	0644	edit dl rm
sgtree.hpp	41893	0644	edit dl rm
sgtree_algorithms.hpp	17515	0644	edit dl rm
sg_set.hpp	45729	0644	edit dl rm
slist.hpp	88492	0644	edit dl rm
slist_hook.hpp	10868	0644	edit dl rm
splaytree.hpp	28325	0644	edit dl rm
splaytree_algorithms.hpp	29751	0644	edit dl rm
splay_set.hpp	47535	0644	edit dl rm
treap.hpp	58870	0644	edit dl rm
treap_algorithms.hpp	29327	0644	edit dl rm
treap_set.hpp	47387	0644	edit dl rm
trivial_value_traits.hpp	2381	0644	edit dl rm
unordered_set.hpp	45070	0644	edit dl rm
unordered_set_hook.hpp	16770	0644	edit dl rm

Edit: /usr/include/boost/intrusive/priority_compare.hpp (1812B)

#ifndef BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP
#define BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP

#include <boost/intrusive/detail/config_begin.hpp>
#include <boost/intrusive/detail/workaround.hpp>
#include <boost/intrusive/intrusive_fwd.hpp>

#include <boost/intrusive/detail/minimal_less_equal_header.hpp>

#if defined(BOOST_HAS_PRAGMA_ONCE)
#  pragma once
#endif

namespace boost {
namespace intrusive {

/// @cond

template<class U>
void priority_order();

/// @endcond

template <class T = void>
struct priority_compare
{
   //Compatibility with std::binary_function
   typedef T      first_argument_type;
   typedef T      second_argument_type;
   typedef bool   result_type;

BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T &val, const T &val2) const
   {
      return priority_order(val, val2);
   }
};

template <>
struct priority_compare<void>
{
   template<class T, class U>
   BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T &t, const U &u) const
   {
      return priority_order(t, u);
   }
};

/// @cond

template<class PrioComp, class T>
struct get_prio_comp
{
   typedef PrioComp type;
};

template<class T>
struct get_prio_comp<void, T>
{
   typedef ::boost::intrusive::priority_compare<T> type;
};

/// @endcond

} //namespace intrusive
} //namespace boost

#include <boost/intrusive/detail/config_end.hpp>

#endif //BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP

///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2008 // // 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) // // See http://www.boost.org/libs/intrusive for documentation. // ///////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP #define BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP #include #include #include #include #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif namespace boost { namespace intrusive { /// @cond template void priority_order(); /// @endcond template struct priority_compare { //Compatibility with std::binary_function typedef T first_argument_type; typedef T second_argument_type; typedef bool result_type; BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T &val, const T &val2) const { return priority_order(val, val2); } }; template <> struct priority_compare { template BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T &t, const U &u) const { return priority_order(t, u); } }; /// @cond template struct get_prio_comp { typedef PrioComp type; }; template struct get_prio_comp { typedef ::boost::intrusive::priority_compare type; }; /// @endcond } //namespace intrusive } //namespace boost #include #endif //BOOST_INTRUSIVE_PRIORITY_COMPARE_HPP