/usr/include/boost/phoenix/stl/algorithm/detail
Edit: /usr/include/boost/phoenix/stl/algorithm/detail/has_find.hpp (1637B)
///////////////////////////////////////////////////////////////////////////////
// Copyright 2005 Daniel Wallin.
// Copyright 2005 Joel de Guzman.
// Copyright 2015 John Fletcher
//
// Use, modification and distribution is subject to 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)
//
// Modeled after range_ex, Copyright 2004 Eric Niebler
///////////////////////////////////////////////////////////////////////////////
//
// has_find.hpp
//
/////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_PHOENIX_HAS_FIND_EN_14_12_2004
#define BOOST_PHOENIX_HAS_FIND_EN_14_12_2004
#include
#include "./is_std_map.hpp"
#include "./is_std_set.hpp"
#include "./is_std_hash_map.hpp"
#include "./is_std_hash_set.hpp"
#include "./is_unordered_set_or_map.hpp"
namespace boost
{
// Specialize this for user-defined types
template
struct has_find
: boost::mpl::or_<
boost::mpl::or_<
is_std_map
, is_std_multimap
, is_std_set
, is_std_multiset
>
, boost::mpl::or_<
is_std_hash_map
, is_std_hash_multimap
, is_std_hash_set
, is_std_hash_multiset
>
, boost::mpl::or_<
is_std_unordered_map
, is_std_unordered_multimap
, is_std_unordered_set
, is_std_unordered_multiset
>
>
{
};
}
#endif