Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: downloads/boost_1_33_1/libs/mpl/doc/refmanual/lower-bound.html @ 12

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

added boost
File size: 8.9 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<head>
5<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
6<meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />
7<title>The MPL Reference Manual: lower_bound</title>
8<link rel="stylesheet" href="../style.css" type="text/css" />
9</head>
10<body class="docframe refmanual">
11<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>
12<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>
13</tr></table><div class="header-separator"></div>
14<div class="section" id="lower-bound">
15<h1><a class="toc-backref" href="./querying-algorithms.html#id408" name="lower-bound">lower_bound</a></h1>
16<div class="section" id="lower-synopsis">
17<h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3>
18<pre class="literal-block">
19template&lt;
20      typename Sequence
21    , typename T
22    , typename Pred = <a href="./less.html" class="identifier">less</a>&lt;_1,_2&gt;
23    &gt;
24struct <a href="./lower-bound.html" class="identifier">lower_bound</a>
25{
26    typedef <em>unspecified</em> type;
27};
28</pre>
29</div>
30<div class="section" id="lower-description">
31<h3><a class="subsection-title" href="#description" name="description">Description</a></h3>
32<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
33violating the ordering.</p>
34</div>
35<div class="section" id="lower-header">
36<h3><a class="subsection-title" href="#header" name="header">Header</a></h3>
37<pre class="literal-block">
38#include &lt;<a href="../../../../boost/mpl/lower_bound.hpp" class="header">boost/mpl/lower_bound.hpp</a>&gt;
39</pre>
40</div>
41<div class="section" id="lower-parameters">
42<h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3>
43<table border="1" class="table">
44<colgroup>
45<col width="19%" />
46<col width="38%" />
47<col width="43%" />
48</colgroup>
49<thead valign="bottom">
50<tr><th>Parameter</th>
51<th>Requirement</th>
52<th>Description</th>
53</tr>
54</thead>
55<tbody valign="top">
56<tr><td><tt class="literal"><span class="pre">Sequence</span></tt></td>
57<td><a class="reference" href="./forward-sequence.html">Forward Sequence</a></td>
58<td>A sorted sequence to search in.</td>
59</tr>
60<tr><td><tt class="literal"><span class="pre">T</span></tt></td>
61<td>Any type</td>
62<td>A type to search a position for.</td>
63</tr>
64<tr><td><tt class="literal"><span class="pre">Pred</span></tt></td>
65<td>Binary <a class="reference" href="./lambda-expression.html">Lambda Expression</a></td>
66<td>A search criteria.</td>
67</tr>
68</tbody>
69</table>
70</div>
71<div class="section" id="lower-expression-semantics">
72<h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3>
73<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
74arbitrary type <tt class="literal"><span class="pre">x</span></tt>:</p>
75<pre class="literal-block">
76typedef <a href="./lower-bound.html" class="identifier">lower_bound</a>&lt; s,x,pred &gt;::type i;
77</pre>
78<table class="field-list" frame="void" rules="none">
79<col class="field-name" />
80<col class="field-body" />
81<tbody valign="top">
82<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>
83</tr>
84<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
85<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>
86<pre class="last literal-block">
87<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
88</pre>
89</td>
90</tr>
91</tbody>
92</table>
93</div>
94<div class="section" id="lower-complexity">
95<h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3>
96<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.
97If <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
98is also logarithmic; otherwise, the number of steps is proportional to
99<tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a>&lt;s&gt;::value</span></tt>.</p>
100</div>
101<div class="section" id="lower-example">
102<h3><a class="subsection-title" href="#example" name="example">Example</a></h3>
103<pre class="literal-block">
104typedef <a href="./vector-c.html" class="identifier">vector_c</a>&lt;int,1,2,3,3,3,5,8&gt; numbers;
105typedef <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;
106
107<a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>(
108      (<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
109    );
110
111<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 );
112</pre>
113</div>
114<div class="section" id="lower-see-also">
115<h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3>
116<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>
117<!-- modtime: November 13, 2004 18:25:37 +0000 -->
118<!-- Algorithms/Querying Algorithms//upper_bound |70 -->
119</div>
120</div>
121
122<div class="footer-separator"></div>
123<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>
124</tr></table></body>
125</html>
Note: See TracBrowser for help on using the repository browser.