Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: downloads/boost_1_34_1/libs/mpl/doc/refmanual/lower-bound.html @ 29

Last change on this file since 29 was 29, checked in by landauf, 17 years ago

updated boost from 1_33_1 to 1_34_1
File size: 9.1 KB
Line 
1<?xml version="1.0" encoding="utf-8" ?>
2<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
3<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
4<!-- Copyright Aleksey Gurtovoy 2006. Distributed under the Boost -->
5<!-- Software License, Version 1.0. (See accompanying -->
6<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
7<head>
8<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
9<meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />
10<title>The MPL Reference Manual: lower_bound</title>
11<link rel="stylesheet" href="../style.css" type="text/css" />
12</head>
13<body class="docframe refmanual">
14<table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./count-if.html" class="navigation-link">Prev</a>&nbsp;<a href="./upper-bound.html" class="navigation-link">Next</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./count-if.html" class="navigation-link">Back</a>&nbsp;<a href="./upper-bound.html" class="navigation-link">Along</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./querying-algorithms.html" class="navigation-link">Up</a>&nbsp;<a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td>
15<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="./lower-bound.html" class="navigation-link">lower_bound</a></td>
16</tr></table><div class="header-separator"></div>
17<div class="section" id="lower-bound">
18<h1><a class="toc-backref" href="./querying-algorithms.html#id408" name="lower-bound">lower_bound</a></h1>
19<div class="section" id="lower-synopsis">
20<h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3>
21<pre class="literal-block">
22template&lt;
23      typename Sequence
24    , typename T
25    , typename Pred = <a href="./less.html" class="identifier">less</a>&lt;_1,_2&gt;
26    &gt;
27struct <a href="./lower-bound.html" class="identifier">lower_bound</a>
28{
29    typedef <em>unspecified</em> type;
30};
31</pre>
32</div>
33<div class="section" id="lower-description">
34<h3><a class="subsection-title" href="#description" name="description">Description</a></h3>
35<p>Returns the first 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
36violating the ordering.</p>
37</div>
38<div class="section" id="lower-header">
39<h3><a class="subsection-title" href="#header" name="header">Header</a></h3>
40<pre class="literal-block">
41#include &lt;<a href="../../../../boost/mpl/lower_bound.hpp" class="header">boost/mpl/lower_bound.hpp</a>&gt;
42</pre>
43</div>
44<div class="section" id="lower-parameters">
45<h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3>
46<table border="1" class="table">
47<colgroup>
48<col width="19%" />
49<col width="38%" />
50<col width="43%" />
51</colgroup>
52<thead valign="bottom">
53<tr><th>Parameter</th>
54<th>Requirement</th>
55<th>Description</th>
56</tr>
57</thead>
58<tbody valign="top">
59<tr><td><tt class="literal"><span class="pre">Sequence</span></tt></td>
60<td><a class="reference" href="./forward-sequence.html">Forward Sequence</a></td>
61<td>A sorted sequence to search in.</td>
62</tr>
63<tr><td><tt class="literal"><span class="pre">T</span></tt></td>
64<td>Any type</td>
65<td>A type to search a position for.</td>
66</tr>
67<tr><td><tt class="literal"><span class="pre">Pred</span></tt></td>
68<td>Binary <a class="reference" href="./lambda-expression.html">Lambda Expression</a></td>
69<td>A search criteria.</td>
70</tr>
71</tbody>
72</table>
73</div>
74<div class="section" id="lower-expression-semantics">
75<h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3>
76<p>For any sorted <a class="reference" href="./forward-sequence.html">Forward Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, binary <a class="reference" href="./lambda-expression.html">Lambda Expression</a> <tt class="literal"><span class="pre">pred</span></tt>, and
77arbitrary type <tt class="literal"><span class="pre">x</span></tt>:</p>
78<pre class="literal-block">
79typedef <a href="./lower-bound.html" class="identifier">lower_bound</a>&lt; s,x,pred &gt;::type i;
80</pre>
81<table class="field-list" frame="void" rules="none">
82<col class="field-name" />
83<col class="field-body" />
84<tbody valign="top">
85<tr class="field"><th class="field-name">Return type:</th><td class="field-body"><a class="reference" href="./forward-iterator.html">Forward Iterator</a>.</td>
86</tr>
87<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>&lt;s&gt;::type</span></tt>, <tt class="literal"><span class="pre"><a href="./end.html" class="identifier">end</a>&lt;s&gt;::type</span></tt>) such that, for every iterator
88<tt class="literal"><span class="pre">j</span></tt> in [<tt class="literal"><span class="pre"><a href="./begin.html" class="identifier">begin</a>&lt;s&gt;::type</span></tt>, <tt class="literal"><span class="pre">i</span></tt>),</p>
89<pre class="last literal-block">
90<a href="./apply.html" class="identifier">apply</a>&lt; pred, <a href="./deref.html" class="identifier">deref</a>&lt;j&gt;::type, x &gt;::type::value == true
91</pre>
92</td>
93</tr>
94</tbody>
95</table>
96</div>
97<div class="section" id="lower-complexity">
98<h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3>
99<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>&lt;s&gt;::value</span></tt> ) + 1.
100If <tt class="literal"><span class="pre">s</span></tt> is a <a class="reference" href="./random-access-sequence.html">Random Access Sequence</a> then the number of steps through the range
101is also logarithmic; otherwise, the number of steps is proportional to
102<tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a>&lt;s&gt;::value</span></tt>.</p>
103</div>
104<div class="section" id="lower-example">
105<h3><a class="subsection-title" href="#example" name="example">Example</a></h3>
106<pre class="literal-block">
107typedef <a href="./vector-c.html" class="identifier">vector_c</a>&lt;int,1,2,3,3,3,5,8&gt; numbers;
108typedef <a href="./lower-bound.html" class="identifier">lower_bound</a>&lt; numbers, <a href="./int.html" class="identifier">int_</a>&lt;3&gt; &gt;::type iter;
109
110<a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>(
111      (<a href="./distance.html" class="identifier">distance</a>&lt; <a href="./begin.html" class="identifier">begin</a>&lt;numbers&gt;::type,iter &gt;::value), ==, 2
112    );
113
114<a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>( <a href="./deref.html" class="identifier">deref</a>&lt;iter&gt;::type::value, ==, 3 );
115</pre>
116</div>
117<div class="section" id="lower-see-also">
118<h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3>
119<p><a class="reference" href="./querying-algorithms.html">Querying Algorithms</a>, <a class="refentry reference" href="./upper-bound.html"><tt class="refentry literal"><span class="pre">upper_bound</span></tt></a>, <a class="refentry reference" href="./find.html"><tt class="refentry literal"><span class="pre">find</span></tt></a>, <a class="refentry reference" href="./find-if.html"><tt class="refentry literal"><span class="pre">find_if</span></tt></a>, <a class="refentry reference" href="./min-element.html"><tt class="refentry literal"><span class="pre">min_element</span></tt></a></p>
120<!-- modtime: November 13, 2004 18:25:37 +0000 -->
121<!-- Algorithms/Querying Algorithms//upper_bound |70 -->
122</div>
123</div>
124
125<div class="footer-separator"></div>
126<table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./count-if.html" class="navigation-link">Prev</a>&nbsp;<a href="./upper-bound.html" class="navigation-link">Next</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./count-if.html" class="navigation-link">Back</a>&nbsp;<a href="./upper-bound.html" class="navigation-link">Along</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./querying-algorithms.html" class="navigation-link">Up</a>&nbsp;<a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td>
127</tr></table></body>
128</html>
Note: See TracBrowser for help on using the repository browser.