/////////////////////////////////////////////////////////////////////////////// // // (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/container for documentation. // /////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP #define BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include namespace boost { namespace container { template class equal_to_value { typedef ValueType value_type; const value_type &t_; public: explicit equal_to_value(const value_type &t) : t_(t) {} bool operator()(const value_type &t)const { return t_ == t; } }; template struct value_to_node_compare : Pred { typedef Pred predicate_type; typedef Node node_type; value_to_node_compare() : Pred() {} explicit value_to_node_compare(Pred pred) : Pred(pred) {} Ret operator()(const Node &a, const Node &b) const { return static_cast(*this)(a.get_data(), b.get_data()); } Ret operator()(const Node &a) const { return static_cast(*this)(a.get_data()); } Ret operator()(const Node &a, const Node &b) { return static_cast(*this)(a.get_data(), b.get_data()); } Ret operator()(const Node &a) { return static_cast(*this)(a.get_data()); } predicate_type & predicate() { return static_cast(*this); } const predicate_type & predicate() const { return static_cast(*this); } }; template struct key_node_pred : public boost::intrusive::detail::ebo_functor_holder { BOOST_CONTAINER_FORCEINLINE explicit key_node_pred(const KeyPred &comp) : base_t(comp) {} typedef boost::intrusive::detail::ebo_functor_holder base_t; typedef KeyPred key_predicate; typedef KeyOfValue key_of_value; typedef typename KeyOfValue::type key_type; BOOST_CONTAINER_FORCEINLINE static const key_type &key_from(const Node &n) { return key_of_value()(n.get_data()); } template BOOST_CONTAINER_FORCEINLINE static const T & key_from(const T &t) { return t; } BOOST_CONTAINER_FORCEINLINE const key_predicate &key_pred() const { return static_cast(*this); } BOOST_CONTAINER_FORCEINLINE key_predicate &key_pred() { return static_cast(*this); } BOOST_CONTAINER_FORCEINLINE Ret operator()(const key_type &key) const { return this->key_pred()(key); } template BOOST_CONTAINER_FORCEINLINE Ret operator()(const U &nonkey) const { return this->key_pred()(this->key_from(nonkey)); } BOOST_CONTAINER_FORCEINLINE bool operator()(const key_type &key1, const key_type &key2) const { return this->key_pred()(key1, key2); } template BOOST_CONTAINER_FORCEINLINE bool operator()(const key_type &key1, const U &nonkey2) const { return this->key_pred()(key1, this->key_from(nonkey2)); } template BOOST_CONTAINER_FORCEINLINE bool operator()(const U &nonkey1, const key_type &key2) const { return this->key_pred()(this->key_from(nonkey1), key2); } template BOOST_CONTAINER_FORCEINLINE bool operator()(const U &nonkey1, const V &nonkey2) const { return this->key_pred()(this->key_from(nonkey1), this->key_from(nonkey2)); } }; } //namespace container { } //namespace boost { #endif //BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP