binary_search.hpp File Reference

#include <adobe/config.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/const_iterator.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <adobe/algorithm/lower_bound.hpp>
#include <adobe/functional/operator.hpp>

Go to the source code of this file.

Namespaces
namespace	adobe
Functions
template<typename I , typename T , typename C , typename P >
I	binary_search (I f, I l, const T &x, C c, P p)
template<typename I , typename T , typename C , typename P >
boost::lazy_disable_if < boost::is_same< I, T > , boost::range_const_iterator < I > >::type	binary_search (const I &r, const T &x, C c, P p)
template<typename I , typename T , typename C , typename P >
boost::lazy_disable_if < boost::is_same< I, T > , boost::range_iterator< I > >::type	binary_search (I &r, const T &x, C c, P p)
template<typename I , typename T , typename C >
boost::range_const_iterator< I > ::type	binary_search (const I &range, const T &x, C c)
template<typename I , typename T , typename C >
boost::range_iterator< I >::type	binary_search (I &range, const T &x, C c)
template<typename I , typename T >
boost::range_const_iterator< I > ::type	binary_search (const I &range, const T &x)
template<typename I , typename T >
boost::range_iterator< I >::type	binary_search (I &range, const T &x)
template<typename I , typename T >
I	binary_search (I f, I l, const T &x)
template<typename I , typename T , typename C >
I	binary_search (I f, I l, const T &x, C c)