projects / ceph.git / blame
| Commit | Line | Data |
|---|---|---|
| 7c673cae FG |
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.7: http://docutils.sourceforge.net/" /> | |
| 7 | <title>The MPL Reference Manual: upper_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="./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> | |
| 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="./upper-bound.html" class="navigation-link">upper_bound</a></td> | |
| 13 | </tr></table><div class="header-separator"></div> | |
| 14 | <div class="section" id="upper-bound"> | |
| 15 | <h1><a class="toc-backref" href="./querying-algorithms.html#id1481">upper_bound</a></h1> | |
| 16 | <div class="section" id="id583"> | |
| 17 | <h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3> | |
| 18 | <pre class="literal-block"> | |
| 19 | template< | |
| 20 | typename Sequence | |
| 21 | , typename T | |
| 22 | , 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>> | |
| 23 | > | |
| 24 | struct <a href="./upper-bound.html" class="identifier">upper_bound</a> | |
| 25 | { | |
| 26 | typedef <em>unspecified</em> type; | |
| 27 | }; | |
| 28 | </pre> | |
| 29 | </div> | |
| 30 | <div class="section" id="id584"> | |
| 31 | <h3><a class="subsection-title" href="#description" name="description">Description</a></h3> | |
| 32 | <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 | |
| 33 | violating the ordering.</p> | |
| 34 | </div> | |
| 35 | <div class="section" id="id585"> | |
| 36 | <h3><a class="subsection-title" href="#header" name="header">Header</a></h3> | |
| 37 | <pre class="literal-block"> | |
| 38 | #include <<a href="../../../../boost/mpl/upper_bound.hpp" class="header">boost/mpl/upper_bound.hpp</a>> | |
| 39 | </pre> | |
| 40 | </div> | |
| 41 | <div class="section" id="id586"> | |
| 42 | <h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3> | |
| 43 | <table border="1" class="docutils table"> | |
| 44 | <colgroup> | |
| 45 | <col width="19%" /> | |
| 46 | <col width="38%" /> | |
| 47 | <col width="43%" /> | |
| 48 | </colgroup> | |
| 49 | <thead valign="bottom"> | |
| 50 | <tr><th class="head">Parameter</th> | |
| 51 | <th class="head">Requirement</th> | |
| 52 | <th class="head">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 internal" 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 internal" 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="id587"> | |
| 72 | <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3> | |
| 73 | <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 | |
| 74 | arbitrary type <tt class="literal"><span class="pre">x</span></tt>:</p> | |
| 75 | <pre class="literal-block"> | |
| 76 | typedef <a href="./upper-bound.html" class="identifier">upper_bound</a>< s,x,pred >::type i; | |
| 77 | </pre> | |
| 78 | <table class="docutils 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"><p class="first"><a class="reference internal" href="./forward-iterator.html">Forward Iterator</a></p> | |
| 83 | </td> | |
| 84 | </tr> | |
| 85 | <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 | |
| 86 | <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> | |
| 87 | <pre class="last literal-block"> | |
| 88 | <a href="./apply.html" class="identifier">apply</a>< pred, x, <a href="./deref.html" class="identifier">deref</a><j>::type >::type::value == false | |
| 89 | </pre> | |
| 90 | </td> | |
| 91 | </tr> | |
| 92 | </tbody> | |
| 93 | </table> | |
| 94 | </div> | |
| 95 | <div class="section" id="id588"> | |
| 96 | <h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3> | |
| 97 | <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. | |
| 98 | 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 | |
| 99 | is also logarithmic; otherwise, the number of steps is proportional to | |
| 100 | <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span></tt>.</p> | |
| 101 | </div> | |
| 102 | <div class="section" id="id589"> | |
| 103 | <h3><a class="subsection-title" href="#example" name="example">Example</a></h3> | |
| 104 | <pre class="literal-block"> | |
| 105 | typedef <a href="./vector-c.html" class="identifier">vector_c</a><int,1,2,3,3,3,5,8> numbers; | |
| 106 | typedef <a href="./upper-bound.html" class="identifier">upper_bound</a>< numbers, <a href="./int.html" class="identifier">int_</a><3> >::type iter; | |
| 107 | ||
| 108 | <a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>( | |
| 109 | (<a href="./distance.html" class="identifier">distance</a>< <a href="./begin.html" class="identifier">begin</a><numbers>::type,iter >::value), ==, 5 | |
| 110 | ); | |
| 111 | ||
| 112 | <a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>( <a href="./deref.html" class="identifier">deref</a><iter>::type::value, ==, 5 ); | |
| 113 | </pre> | |
| 114 | </div> | |
| 115 | <div class="section" id="id590"> | |
| 116 | <h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3> | |
| 117 | <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> | |
| 118 | <!-- Algorithms/Querying Algorithms//min_element |80 --> | |
| 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="./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> | |
| 124 | <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div> | |
| 125 | Distributed under the Boost Software License, Version 1.0. (See accompanying | |
| 126 | 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> | |
| 127 | </html> |