/usr/include/boost/intrusive/detail
NameSizeModeActions
algorithm.hpp28800644editdlrm
algo_type.hpp13030644editdlrm
any_node_and_algorithms.hpp94670644editdlrm
array_initializer.hpp22350644editdlrm
assert.hpp15200644editdlrm
avltree_node.hpp67140644editdlrm
bstree_algorithms_base.hpp55230644editdlrm
common_slist_algorithms.hpp59740644editdlrm
config_begin.hpp24560644editdlrm
config_end.hpp4960644editdlrm
default_header_holder.hpp22430644editdlrm
ebo_functor_holder.hpp80050644editdlrm
empty_node_checker.hpp12430644editdlrm
equal_to_value.hpp12170644editdlrm
exception_disposer.hpp21320644editdlrm
function_detector.hpp34560644editdlrm
generic_hook.hpp65880644editdlrm
get_value_traits.hpp70980644editdlrm
hashtable_node.hpp102340644editdlrm
has_member_function_callable_with.hpp184380644editdlrm
hook_traits.hpp84380644editdlrm
iiterator.hpp44460644editdlrm
is_stateful_value_traits.hpp25240644editdlrm
iterator.hpp76120644editdlrm
key_nodeptr_comp.hpp48820644editdlrm
list_iterator.hpp52300644editdlrm
list_node.hpp21520644editdlrm
math.hpp80590644editdlrm
minimal_less_equal_header.hpp9320644editdlrm
minimal_pair_header.hpp9040644editdlrm
mpl.hpp85920644editdlrm
node_cloner_disposer.hpp39730644editdlrm
node_holder.hpp8830644editdlrm
node_to_value.hpp39940644editdlrm
parent_from_member.hpp41910644editdlrm
rbtree_node.hpp69520644editdlrm
reverse_iterator.hpp46440644editdlrm
simple_disposers.hpp11770644editdlrm
size_holder.hpp22610644editdlrm
slist_iterator.hpp49680644editdlrm
slist_node.hpp19070644editdlrm
std_fwd.hpp12260644editdlrm
transform_iterator.hpp57890644editdlrm
tree_iterator.hpp66050644editdlrm
tree_node.hpp23070644editdlrm
tree_value_compare.hpp77110644editdlrm
uncast.hpp16460644editdlrm
workaround.hpp20610644editdlrm
Edit: /usr/include/boost/intrusive/detail/tree_value_compare.hpp (7711B)
////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2015-2015. 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/container for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP #define BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include #include #include namespace boost{ namespace intrusive{ //Needed to support smart references to value types template struct disable_if_smartref_to : detail::disable_if_c < detail::is_same ::reference>::value || detail::is_same ::type>::type> ::reference>::value > {}; //This function object takes a KeyCompare function object //and compares values that contains keys using KeyOfValue template< class ValuePtr, class KeyCompare, class KeyOfValue, class Ret = bool , bool = boost::intrusive::detail::is_same ::type, typename KeyOfValue::type>::value > struct tree_value_compare : public boost::intrusive::detail::ebo_functor_holder { typedef typename boost::movelib::pointer_element::type value_type; typedef KeyCompare key_compare; typedef KeyOfValue key_of_value; typedef typename KeyOfValue::type key_type; typedef boost::intrusive::detail::ebo_functor_holder base_t; BOOST_INTRUSIVE_FORCEINLINE tree_value_compare() : base_t() {} BOOST_INTRUSIVE_FORCEINLINE explicit tree_value_compare(const key_compare &kcomp) : base_t(kcomp) {} BOOST_INTRUSIVE_FORCEINLINE tree_value_compare (const tree_value_compare &x) : base_t(x.base_t::get()) {} BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const tree_value_compare &x) { this->base_t::get() = x.base_t::get(); return *this; } BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const key_compare &x) { this->base_t::get() = x; return *this; } BOOST_INTRUSIVE_FORCEINLINE const key_compare &key_comp() const { return static_cast(*this); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const { return this->key_comp()(key); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value) const { return this->key_comp()(KeyOfValue()(value)); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(nonkey); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const { return this->key_comp()(key1, key2); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value1, const value_type &value2) const { return this->key_comp()(KeyOfValue()(value1), KeyOfValue()(value2)); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const value_type &value2) const { return this->key_comp()(key1, KeyOfValue()(value2)); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value1, const key_type &key2) const { return this->key_comp()(KeyOfValue()(value1), key2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const key_type &key1, const U &nonkey2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(key1, nonkey2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey1, const key_type &key2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(nonkey1, key2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const value_type &value1, const U &nonvalue2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(KeyOfValue()(value1), nonvalue2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonvalue1, const value_type &value2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(nonvalue1, KeyOfValue()(value2)); } }; template struct tree_value_compare : public boost::intrusive::detail::ebo_functor_holder { typedef typename boost::movelib::pointer_element::type value_type; typedef KeyCompare key_compare; typedef KeyOfValue key_of_value; typedef typename KeyOfValue::type key_type; typedef boost::intrusive::detail::ebo_functor_holder base_t; BOOST_INTRUSIVE_FORCEINLINE tree_value_compare() : base_t() {} BOOST_INTRUSIVE_FORCEINLINE explicit tree_value_compare(const key_compare &kcomp) : base_t(kcomp) {} BOOST_INTRUSIVE_FORCEINLINE tree_value_compare (const tree_value_compare &x) : base_t(x.base_t::get()) {} BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const tree_value_compare &x) { this->base_t::get() = x.base_t::get(); return *this; } BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const key_compare &x) { this->base_t::get() = x; return *this; } BOOST_INTRUSIVE_FORCEINLINE const key_compare &key_comp() const { return static_cast(*this); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const { return this->key_comp()(key); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(nonkey); } BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const { return this->key_comp()(key1, key2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const key_type &key1, const U &nonkey2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(key1, nonkey2); } template BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const U &nonkey1, const key_type &key2 , typename disable_if_smartref_to::type* = 0) const { return this->key_comp()(nonkey1, key2); } }; } //namespace intrusive{ } //namespace boost{ #endif //#ifdef BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP