Name	Size	Mode	Actions
algorithm.hpp	2880	0644	editdlrm
algo_type.hpp	1303	0644	editdlrm
any_node_and_algorithms.hpp	9467	0644	editdlrm
array_initializer.hpp	2235	0644	editdlrm
assert.hpp	1520	0644	editdlrm
avltree_node.hpp	6714	0644	editdlrm
bstree_algorithms_base.hpp	5523	0644	editdlrm
common_slist_algorithms.hpp	5974	0644	editdlrm
config_begin.hpp	2456	0644	editdlrm
config_end.hpp	496	0644	editdlrm
default_header_holder.hpp	2243	0644	editdlrm
ebo_functor_holder.hpp	8005	0644	editdlrm
empty_node_checker.hpp	1243	0644	editdlrm
equal_to_value.hpp	1217	0644	editdlrm
exception_disposer.hpp	2132	0644	editdlrm
function_detector.hpp	3456	0644	editdlrm
generic_hook.hpp	6588	0644	editdlrm
get_value_traits.hpp	7098	0644	editdlrm
hashtable_node.hpp	10234	0644	editdlrm
has_member_function_callable_with.hpp	18438	0644	editdlrm
hook_traits.hpp	8438	0644	editdlrm
iiterator.hpp	4446	0644	editdlrm
is_stateful_value_traits.hpp	2524	0644	editdlrm
iterator.hpp	7612	0644	editdlrm
key_nodeptr_comp.hpp	4882	0644	editdlrm
list_iterator.hpp	5230	0644	editdlrm
list_node.hpp	2152	0644	editdlrm
math.hpp	8059	0644	editdlrm
minimal_less_equal_header.hpp	932	0644	editdlrm
minimal_pair_header.hpp	904	0644	editdlrm
mpl.hpp	8592	0644	editdlrm
node_cloner_disposer.hpp	3973	0644	editdlrm
node_holder.hpp	883	0644	editdlrm
node_to_value.hpp	3994	0644	editdlrm
parent_from_member.hpp	4191	0644	editdlrm
rbtree_node.hpp	6952	0644	editdlrm
reverse_iterator.hpp	4644	0644	editdlrm
simple_disposers.hpp	1177	0644	editdlrm
size_holder.hpp	2261	0644	editdlrm
slist_iterator.hpp	4968	0644	editdlrm
slist_node.hpp	1907	0644	editdlrm
std_fwd.hpp	1226	0644	editdlrm
transform_iterator.hpp	5789	0644	editdlrm
tree_iterator.hpp	6605	0644	editdlrm
tree_node.hpp	2307	0644	editdlrm
tree_value_compare.hpp	7711	0644	editdlrm
uncast.hpp	1646	0644	editdlrm
workaround.hpp	2061	0644	editdlrm

///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2014-2014 // // 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_DETAIL_KEY_NODEPTR_COMP_HPP #define BOOST_INTRUSIVE_DETAIL_KEY_NODEPTR_COMP_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include #include namespace boost { namespace intrusive { namespace detail { template < class KeyTypeKeyCompare , class ValueTraits , class KeyOfValue > struct key_nodeptr_comp_types { typedef ValueTraits value_traits; typedef typename value_traits::value_type value_type; typedef typename value_traits::node_ptr node_ptr; typedef typename value_traits::const_node_ptr const_node_ptr; typedef typename detail::if_c < detail::is_same::value , detail::identity , KeyOfValue >::type key_of_value; typedef tree_value_compare base_t; }; //This function object transforms a key comparison type to //a function that can compare nodes or nodes with nodes or keys. template < class KeyTypeKeyCompare , class ValueTraits , class KeyOfValue = void > struct key_nodeptr_comp //Use public inheritance to avoid MSVC bugs with closures : public key_nodeptr_comp_types::base_t { private: struct sfinae_type; public: typedef key_nodeptr_comp_types types_t; typedef typename types_t::value_traits value_traits; typedef typename types_t::value_type value_type; typedef typename types_t::node_ptr node_ptr; typedef typename types_t::const_node_ptr const_node_ptr; typedef typename types_t::base_t base_t; typedef typename types_t::key_of_value key_of_value; template struct is_same_or_nodeptr_convertible { static const bool same_type = is_same::value || is_same::value; static const bool value = same_type || is_convertible::value; }; BOOST_INTRUSIVE_FORCEINLINE base_t base() const { return static_cast(*this); } BOOST_INTRUSIVE_FORCEINLINE key_nodeptr_comp(KeyTypeKeyCompare kcomp, const ValueTraits *traits) : base_t(kcomp), traits_(traits) {} //pred(pnode) template BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T1 &t1, typename enable_if_c< is_same_or_nodeptr_convertible::value, sfinae_type* >::type = 0) const { return base().get()(key_of_value()(*traits_->to_value_ptr(t1))); } //operator() 2 arg //pred(pnode, pnode) template BOOST_INTRUSIVE_FORCEINLINE bool operator() (const T1 &t1, const T2 &t2, typename enable_if_c< is_same_or_nodeptr_convertible::value && is_same_or_nodeptr_convertible::value, sfinae_type* >::type = 0) const { return base()(*traits_->to_value_ptr(t1), *traits_->to_value_ptr(t2)); } //pred(pnode, key) template BOOST_INTRUSIVE_FORCEINLINE bool operator() (const T1 &t1, const T2 &t2, typename enable_if_c< is_same_or_nodeptr_convertible::value && !is_same_or_nodeptr_convertible::value, sfinae_type* >::type = 0) const { return base()(*traits_->to_value_ptr(t1), t2); } //pred(key, pnode) template BOOST_INTRUSIVE_FORCEINLINE bool operator() (const T1 &t1, const T2 &t2, typename enable_if_c< !is_same_or_nodeptr_convertible::value && is_same_or_nodeptr_convertible::value, sfinae_type* >::type = 0) const { return base()(t1, *traits_->to_value_ptr(t2)); } //pred(key, key) template BOOST_INTRUSIVE_FORCEINLINE bool operator() (const T1 &t1, const T2 &t2, typename enable_if_c< !is_same_or_nodeptr_convertible::value && !is_same_or_nodeptr_convertible::value, sfinae_type* >::type = 0) const { return base()(t1, t2); } const ValueTraits *const traits_; }; } //namespace detail{ } //namespace intrusive{ } //namespace boost{ #endif //BOOST_INTRUSIVE_DETAIL_KEY_NODEPTR_COMP_HPP