stlab.adobe.com Adobe Systems Incorporated
lower_bound.hpp File Reference
#include <adobe/config.hpp>
#include <algorithm>
#include <iterator>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/bind.hpp>
#include <boost/next_prior.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/utility/enable_if.hpp>
#include <adobe/functional/operator.hpp>

Go to the source code of this file.

Namespaces

 adobe
 
 adobe::fn
 

Functions

template<typename I , typename T >
lower_bound (I f, I l, const T &x)
 
template<typename I , typename T , typename C >
lower_bound (I f, I l, const T &x, C c)
 
template<typename I , typename T , typename C , typename P >
lower_bound (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_iterator< I > >::type lower_bound (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_const_iterator< I > >::type lower_bound (const I &r, const T &x, C c, P p)
 
template<class ForwardRange , class T >
boost::range_iterator< ForwardRange >::type lower_bound (ForwardRange &range, const T &value)
 
template<class ForwardRange , class T >
boost::range_const_iterator< ForwardRange >::type lower_bound (const ForwardRange &range, const T &value)
 
template<typename I , class T , class Compare >
boost::lazy_disable_if< boost::is_same< I, T >, boost::range_iterator< I > >::type lower_bound (I &range, const T &value, Compare comp)
 
template<class I , class T , class Compare >
boost::lazy_disable_if< boost::is_same< I, T >, boost::range_const_iterator< I > >::type lower_bound (const I &range, const T &value, Compare comp)
 
template<typename I , typename N , typename T >
lower_bound_n (I f, N n, const T &x)
 
template<typename I , typename N , typename T , typename C >
lower_bound_n (I f, N n, const T &x, C c)
 
template<typename I , typename N , typename T , typename C , typename P >
lower_bound_n (I f, N n, const T &x, C c, P p)
 

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google