2004-11-28 03:35:12 +00:00
<?xml version="1.0" encoding="utf-8" ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
< html xmlns = "http://www.w3.org/1999/xhtml" xml:lang = "en" lang = "en" >
< head >
< meta http-equiv = "Content-Type" content = "text/html; charset=utf-8" / >
2010-08-09 20:07:24 +00:00
< meta name = "generator" content = "Docutils 0.7: http://docutils.sourceforge.net/" / >
2004-11-28 03:35:12 +00:00
< title > The MPL Reference Manual: upper_bound< / title >
< link rel = "stylesheet" href = "../style.css" type = "text/css" / >
< / head >
< body class = "docframe refmanual" >
< table class = "header" > < tr class = "header" > < td class = "header-group navigation-bar" > < span class = "navigation-group" > < a href = "./lower-bound.html" class = "navigation-link" > Prev< / a > < a href = "./min-element.html" class = "navigation-link" > Next< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./lower-bound.html" class = "navigation-link" > Back< / a > < a href = "./min-element.html" class = "navigation-link" > Along< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./querying-algorithms.html" class = "navigation-link" > Up< / a > < a href = "../refmanual.html" class = "navigation-link" > Home< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./refmanual_toc.html" class = "navigation-link" > Full TOC< / a > < / span > < / td >
< td class = "header-group page-location" > < a href = "../refmanual.html" class = "navigation-link" > Front Page< / a > / < a href = "./algorithms.html" class = "navigation-link" > Algorithms< / a > / < a href = "./querying-algorithms.html" class = "navigation-link" > Querying Algorithms< / a > / < a href = "./upper-bound.html" class = "navigation-link" > upper_bound< / a > < / td >
< / tr > < / table > < div class = "header-separator" > < / div >
< div class = "section" id = "upper-bound" >
2010-08-09 20:07:24 +00:00
< h1 > < a class = "toc-backref" href = "./querying-algorithms.html#id1481" > upper_bound< / a > < / h1 >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id583" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#synopsis" name = "synopsis" > Synopsis< / a > < / h3 >
< pre class = "literal-block" >
template<
typename Sequence
, typename T
2009-08-17 11:30:52 +00:00
, typename Pred = < a href = "./less.html" class = "identifier" > less< / a > < < a href = "./placeholders.html" class = "identifier" > _1< / a > ,< a href = "./placeholders.html" class = "identifier" > _2< / a > >
2004-11-28 03:35:12 +00:00
>
struct < a href = "./upper-bound.html" class = "identifier" > upper_bound< / a >
{
typedef < em > unspecified< / em > type;
};
< / pre >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id584" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#description" name = "description" > Description< / a > < / h3 >
2009-08-17 11:30:52 +00:00
< p > Returns the last position in the sorted < tt class = "literal" > < span class = "pre" > Sequence< / span > < / tt > where < tt class = "literal" > < span class = "pre" > T< / span > < / tt > could be inserted without
2004-11-28 03:35:12 +00:00
violating the ordering.< / p >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id585" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#header" name = "header" > Header< / a > < / h3 >
< pre class = "literal-block" >
#include < < a href = "../../../../boost/mpl/upper_bound.hpp" class = "header" > boost/mpl/upper_bound.hpp< / a > >
< / pre >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id586" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#parameters" name = "parameters" > Parameters< / a > < / h3 >
2009-08-17 11:30:52 +00:00
< table border = "1" class = "docutils table" >
2004-11-28 03:35:12 +00:00
< colgroup >
< col width = "19%" / >
< col width = "38%" / >
< col width = "43%" / >
< / colgroup >
< thead valign = "bottom" >
2009-08-17 11:30:52 +00:00
< tr > < th class = "head" > Parameter< / th >
< th class = "head" > Requirement< / th >
< th class = "head" > Description< / th >
2004-11-28 03:35:12 +00:00
< / tr >
< / thead >
< tbody valign = "top" >
< tr > < td > < tt class = "literal" > < span class = "pre" > Sequence< / span > < / tt > < / td >
2009-08-17 11:30:52 +00:00
< td > < a class = "reference internal" href = "./forward-sequence.html" > Forward Sequence< / a > < / td >
2004-11-28 03:35:12 +00:00
< td > A sorted sequence to search in.< / td >
< / tr >
< tr > < td > < tt class = "literal" > < span class = "pre" > T< / span > < / tt > < / td >
< td > Any type< / td >
< td > A type to search a position for.< / td >
< / tr >
< tr > < td > < tt class = "literal" > < span class = "pre" > Pred< / span > < / tt > < / td >
2009-08-17 11:30:52 +00:00
< td > Binary < a class = "reference internal" href = "./lambda-expression.html" > Lambda Expression< / a > < / td >
2004-11-28 03:35:12 +00:00
< td > A search criteria.< / td >
< / tr >
< / tbody >
< / table >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id587" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#expression-semantics" name = "expression-semantics" > Expression semantics< / a > < / h3 >
2009-08-17 11:30:52 +00:00
< p > For any sorted < a class = "reference internal" href = "./forward-sequence.html" > Forward Sequence< / a > < tt class = "literal" > < span class = "pre" > s< / span > < / tt > , binary < a class = "reference internal" href = "./lambda-expression.html" > Lambda Expression< / a > < tt class = "literal" > < span class = "pre" > pred< / span > < / tt > , and
2004-11-28 03:35:12 +00:00
arbitrary type < tt class = "literal" > < span class = "pre" > x< / span > < / tt > :< / p >
< pre class = "literal-block" >
2009-08-17 11:30:52 +00:00
typedef < a href = "./upper-bound.html" class = "identifier" > upper_bound< / a > < s,x,pred > ::type i;
2004-11-28 03:35:12 +00:00
< / pre >
2009-08-17 11:30:52 +00:00
< table class = "docutils field-list" frame = "void" rules = "none" >
2004-11-28 03:35:12 +00:00
< col class = "field-name" / >
< col class = "field-body" / >
< tbody valign = "top" >
2009-08-17 11:30:52 +00:00
< tr class = "field" > < th class = "field-name" > Return type:< / th > < td class = "field-body" > < p class = "first" > < a class = "reference internal" href = "./forward-iterator.html" > Forward Iterator< / a > < / p >
< / td >
2004-11-28 03:35:12 +00:00
< / tr >
2009-08-17 11:30:52 +00:00
< tr class = "field" > < th class = "field-name" > Semantics:< / th > < td class = "field-body" > < p class = "first" > < tt class = "literal" > < span class = "pre" > i< / span > < / tt > is the furthermost iterator in [< tt class = "literal" > < span class = "pre" > < a href = "./begin.html" class = "identifier" > begin< / a > < s> ::type< / span > < / tt > , < tt class = "literal" > < span class = "pre" > < a href = "./end.html" class = "identifier" > end< / a > < s> ::type< / span > < / tt > ) such that, for every iterator
2004-11-28 03:35:12 +00:00
< tt class = "literal" > < span class = "pre" > j< / span > < / tt > in < tt class = "literal" > < span class = "pre" > [< a href = "./begin.html" class = "identifier" > begin< / a > < s> ::type,< / span > < span class = "pre" > i)< / span > < / tt > ,< / p >
< pre class = "last literal-block" >
2009-08-17 11:30:52 +00:00
< a href = "./apply.html" class = "identifier" > apply< / a > < pred, x, < a href = "./deref.html" class = "identifier" > deref< / a > < j> ::type > ::type::value == false
2004-11-28 03:35:12 +00:00
< / pre >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id588" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#complexity" name = "complexity" > Complexity< / a > < / h3 >
2009-08-17 11:30:52 +00:00
< p > The number of comparisons is logarithmic: at most log< sub > 2< / sub > ( < tt class = "literal" > < span class = "pre" > < a href = "./size.html" class = "identifier" > size< / a > < s> ::value< / span > < / tt > ) + 1.
If < tt class = "literal" > < span class = "pre" > s< / span > < / tt > is a < a class = "reference internal" href = "./random-access-sequence.html" > Random Access Sequence< / a > then the number of steps through the range
is also logarithmic; otherwise, the number of steps is proportional to
2004-11-28 03:35:12 +00:00
< tt class = "literal" > < span class = "pre" > < a href = "./size.html" class = "identifier" > size< / a > < s> ::value< / span > < / tt > .< / p >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id589" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#example" name = "example" > Example< / a > < / h3 >
< pre class = "literal-block" >
typedef < a href = "./vector-c.html" class = "identifier" > vector_c< / a > < int,1,2,3,3,3,5,8> numbers;
typedef < a href = "./upper-bound.html" class = "identifier" > upper_bound< / a > < numbers, < a href = "./int.html" class = "identifier" > int_< / a > < 3> > ::type iter;
< a href = "./assert-relation.html" class = "identifier" > BOOST_MPL_ASSERT_RELATION< / a > (
(< a href = "./distance.html" class = "identifier" > distance< / a > < < a href = "./begin.html" class = "identifier" > begin< / a > < numbers> ::type,iter > ::value), ==, 5
);
< a href = "./assert-relation.html" class = "identifier" > BOOST_MPL_ASSERT_RELATION< / a > ( < a href = "./deref.html" class = "identifier" > deref< / a > < iter> ::type::value, ==, 5 );
< / pre >
< / div >
2009-08-17 11:30:52 +00:00
< div class = "section" id = "id590" >
2004-11-28 03:35:12 +00:00
< h3 > < a class = "subsection-title" href = "#see-also" name = "see-also" > See also< / a > < / h3 >
2009-08-17 11:30:52 +00:00
< p > < a class = "reference internal" href = "./querying-algorithms.html" > Querying Algorithms< / a > , < a class = "reference internal" href = "./lower-bound.html" > lower_bound< / a > , < a class = "reference internal" href = "./find.html" > find< / a > , < a class = "reference internal" href = "./find-if.html" > find_if< / a > , < a class = "reference internal" href = "./min-element.html" > min_element< / a > < / p >
2004-11-28 03:35:12 +00:00
<!-- Algorithms/Querying Algorithms//min_element |80 -->
< / div >
< / div >
< div class = "footer-separator" > < / div >
< table class = "footer" > < tr class = "footer" > < td class = "header-group navigation-bar" > < span class = "navigation-group" > < a href = "./lower-bound.html" class = "navigation-link" > Prev< / a > < a href = "./min-element.html" class = "navigation-link" > Next< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./lower-bound.html" class = "navigation-link" > Back< / a > < a href = "./min-element.html" class = "navigation-link" > Along< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./querying-algorithms.html" class = "navigation-link" > Up< / a > < a href = "../refmanual.html" class = "navigation-link" > Home< / a > < / span > < span class = "navigation-group-separator" > | < / span > < span class = "navigation-group" > < a href = "./refmanual_toc.html" class = "navigation-link" > Full TOC< / a > < / span > < / td >
2009-08-17 11:30:52 +00:00
< td > < div class = "copyright-footer" > < div class = "copyright" > Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams< / div >
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at < a class = "reference external" href = "http://www.boost.org/LICENSE_1_0.txt" target = "_top" > http://www.boost.org/LICENSE_1_0.txt< / a > )< / div > < / td > < / tr > < / table > < / body >
2004-11-28 03:35:12 +00:00
< / html >
