| <!DOCTYPE HTML> |
| <!-- NewPage --> |
| <html lang="en"> |
| <head> |
| <!-- Generated by javadoc --> |
| <title>BinarySearch (Apache Calcite API)</title> |
| <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> |
| <link rel="stylesheet" type="text/css" href="../../../../stylesheet.css" title="Style"> |
| <link rel="stylesheet" type="text/css" href="../../../../jquery/jquery-ui.css" title="Style"> |
| <script type="text/javascript" src="../../../../script.js"></script> |
| <script type="text/javascript" src="../../../../jquery/jszip/dist/jszip.min.js"></script> |
| <script type="text/javascript" src="../../../../jquery/jszip-utils/dist/jszip-utils.min.js"></script> |
| <!--[if IE]> |
| <script type="text/javascript" src="../../../../jquery/jszip-utils/dist/jszip-utils-ie.min.js"></script> |
| <![endif]--> |
| <script type="text/javascript" src="../../../../jquery/jquery-3.3.1.js"></script> |
| <script type="text/javascript" src="../../../../jquery/jquery-migrate-3.0.1.js"></script> |
| <script type="text/javascript" src="../../../../jquery/jquery-ui.js"></script> |
| </head> |
| <body> |
| <script type="text/javascript"><!-- |
| try { |
| if (location.href.indexOf('is-external=true') == -1) { |
| parent.document.title="BinarySearch (Apache Calcite API)"; |
| } |
| } |
| catch(err) { |
| } |
| //--> |
| var data = {"i0":9,"i1":9,"i2":9,"i3":9,"i4":9,"i5":9,"i6":9,"i7":9}; |
| var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],8:["t4","Concrete Methods"]}; |
| var altColor = "altColor"; |
| var rowColor = "rowColor"; |
| var tableTab = "tableTab"; |
| var activeTableTab = "activeTableTab"; |
| var pathtoroot = "../../../../"; |
| var useModuleDirectories = true; |
| loadScripts(document, 'script');</script> |
| <noscript> |
| <div>JavaScript is disabled on your browser.</div> |
| </noscript> |
| <header role="banner"> |
| <nav role="navigation"> |
| <div class="fixedNav"> |
| <!-- ========= START OF TOP NAVBAR ======= --> |
| <div class="topNav"><a id="navbar.top"> |
| <!-- --> |
| </a> |
| <div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div> |
| <a id="navbar.top.firstrow"> |
| <!-- --> |
| </a> |
| <ul class="navList" title="Navigation"> |
| <li><a href="../../../../index.html">Overview</a></li> |
| <li><a href="package-summary.html">Package</a></li> |
| <li class="navBarCell1Rev">Class</li> |
| <li><a href="class-use/BinarySearch.html">Use</a></li> |
| <li><a href="package-tree.html">Tree</a></li> |
| <li><a href="../../../../deprecated-list.html">Deprecated</a></li> |
| <li><a href="../../../../index-all.html">Index</a></li> |
| <li><a href="../../../../help-doc.html">Help</a></li> |
| </ul> |
| </div> |
| <div class="subNav"> |
| <ul class="navList" id="allclasses_navbar_top"> |
| <li><a href="../../../../allclasses.html">All Classes</a></li> |
| </ul> |
| <ul class="navListSearch"> |
| <li><label for="search">SEARCH:</label> |
| <input type="text" id="search" value="search" disabled="disabled"> |
| <input type="reset" id="reset" value="reset" disabled="disabled"> |
| </li> |
| </ul> |
| <div> |
| <script type="text/javascript"><!-- |
| allClassesLink = document.getElementById("allclasses_navbar_top"); |
| if(window==top) { |
| allClassesLink.style.display = "block"; |
| } |
| else { |
| allClassesLink.style.display = "none"; |
| } |
| //--> |
| </script> |
| <noscript> |
| <div>JavaScript is disabled on your browser.</div> |
| </noscript> |
| </div> |
| <div> |
| <ul class="subNavList"> |
| <li>Summary: </li> |
| <li>Nested | </li> |
| <li>Field | </li> |
| <li><a href="#constructor.summary">Constr</a> | </li> |
| <li><a href="#method.summary">Method</a></li> |
| </ul> |
| <ul class="subNavList"> |
| <li>Detail: </li> |
| <li>Field | </li> |
| <li><a href="#constructor.detail">Constr</a> | </li> |
| <li><a href="#method.detail">Method</a></li> |
| </ul> |
| </div> |
| <a id="skip.navbar.top"> |
| <!-- --> |
| </a></div> |
| <!-- ========= END OF TOP NAVBAR ========= --> |
| </div> |
| <div class="navPadding"> </div> |
| <script type="text/javascript"><!-- |
| $('.navPadding').css('padding-top', $('.fixedNav').css("height")); |
| //--> |
| </script> |
| </nav> |
| </header> |
| <!-- ======== START OF CLASS DATA ======== --> |
| <main role="main"> |
| <div class="header"> |
| <div class="subTitle"><span class="packageLabelInType">Package</span> <a href="package-summary.html">org.apache.calcite.runtime</a></div> |
| <h2 title="Class BinarySearch" class="title">Class BinarySearch</h2> |
| </div> |
| <div class="contentContainer"> |
| <ul class="inheritance"> |
| <li>java.lang.Object</li> |
| <li> |
| <ul class="inheritance"> |
| <li>org.apache.calcite.runtime.BinarySearch</li> |
| </ul> |
| </li> |
| </ul> |
| <div class="description"> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <hr> |
| <pre>public class <span class="typeNameLabel">BinarySearch</span> |
| extends java.lang.Object</pre> |
| <div class="block">Binary search for the implementation of |
| RANGE BETWEEN XXX PRECEDING/FOLLOWING clause.</div> |
| </li> |
| </ul> |
| </div> |
| <div class="summary"> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <!-- ======== CONSTRUCTOR SUMMARY ======== --> |
| <section role="region"> |
| <ul class="blockList"> |
| <li class="blockList"><a id="constructor.summary"> |
| <!-- --> |
| </a> |
| <h3>Constructor Summary</h3> |
| <table class="memberSummary"> |
| <caption><span>Constructors</span><span class="tabEnd"> </span></caption> |
| <tr> |
| <th class="colFirst" scope="col">Modifier</th> |
| <th class="colSecond" scope="col">Constructor</th> |
| <th class="colLast" scope="col">Description</th> |
| </tr> |
| <tr class="altColor"> |
| <td class="colFirst"><code>protected </code></td> |
| <th class="colConstructorName" scope="row"><code><span class="memberNameLink"><a href="#%3Cinit%3E()">BinarySearch</a></span>()</code></th> |
| <td class="colLast"> </td> |
| </tr> |
| </table> |
| </li> |
| </ul> |
| </section> |
| <!-- ========== METHOD SUMMARY =========== --> |
| <section role="region"> |
| <ul class="blockList"> |
| <li class="blockList"><a id="method.summary"> |
| <!-- --> |
| </a> |
| <h3>Method Summary</h3> |
| <table class="memberSummary"> |
| <caption><span id="t0" class="activeTableTab"><span>All Methods</span><span class="tabEnd"> </span></span><span id="t1" class="tableTab"><span><a href="javascript:show(1);">Static Methods</a></span><span class="tabEnd"> </span></span><span id="t4" class="tableTab"><span><a href="javascript:show(8);">Concrete Methods</a></span><span class="tabEnd"> </span></span></caption> |
| <tr> |
| <th class="colFirst" scope="col">Modifier and Type</th> |
| <th class="colSecond" scope="col">Method</th> |
| <th class="colLast" scope="col">Description</th> |
| </tr> |
| <tr id="i0" class="altColor"> |
| <td class="colFirst"><code>static <T,​K><br>int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#lowerBound(T%5B%5D,K,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)">lowerBound</a></span>​(T[] a, |
| K key, |
| int imin, |
| int imax, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Taken from http://en.wikipedia.org/wiki/Binary_search_algorithm |
| #Deferred_detection_of_equality</div> |
| </td> |
| </tr> |
| <tr id="i1" class="rowColor"> |
| <td class="colFirst"><code>static <T,​K><br>int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#lowerBound(T%5B%5D,K,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)">lowerBound</a></span>​(T[] a, |
| K key, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the lower bound in the given array.</div> |
| </td> |
| </tr> |
| <tr id="i2" class="altColor"> |
| <td class="colFirst"><code>static <T> int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#lowerBound(T%5B%5D,T,int,int,java.util.Comparator)">lowerBound</a></span>​(T[] a, |
| T key, |
| int imin, |
| int imax, |
| java.util.Comparator<T> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the lower bound in the given section of array.</div> |
| </td> |
| </tr> |
| <tr id="i3" class="rowColor"> |
| <td class="colFirst"><code>static <T> int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#lowerBound(T%5B%5D,T,java.util.Comparator)">lowerBound</a></span>​(T[] a, |
| T key, |
| java.util.Comparator<T> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the lower bound in the given array.</div> |
| </td> |
| </tr> |
| <tr id="i4" class="altColor"> |
| <td class="colFirst"><code>static <T,​K><br>int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#upperBound(T%5B%5D,K,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)">upperBound</a></span>​(T[] a, |
| K key, |
| int imin, |
| int imax, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Taken from http://en.wikipedia.org/wiki/Binary_search_algorithm |
| #Deferred_detection_of_equality |
| Adapted to find upper bound.</div> |
| </td> |
| </tr> |
| <tr id="i5" class="rowColor"> |
| <td class="colFirst"><code>static <T,​K><br>int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#upperBound(T%5B%5D,K,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)">upperBound</a></span>​(T[] a, |
| K key, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the upper bound in the given array.</div> |
| </td> |
| </tr> |
| <tr id="i6" class="altColor"> |
| <td class="colFirst"><code>static <T> int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#upperBound(T%5B%5D,T,int,int,java.util.Comparator)">upperBound</a></span>​(T[] a, |
| T key, |
| int imin, |
| int imax, |
| java.util.Comparator<T> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the upper bound in the given array.</div> |
| </td> |
| </tr> |
| <tr id="i7" class="rowColor"> |
| <td class="colFirst"><code>static <T> int</code></td> |
| <th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#upperBound(T%5B%5D,T,java.util.Comparator)">upperBound</a></span>​(T[] a, |
| T key, |
| java.util.Comparator<T> comparator)</code></th> |
| <td class="colLast"> |
| <div class="block">Performs binary search of the upper bound in the given array.</div> |
| </td> |
| </tr> |
| </table> |
| <ul class="blockList"> |
| <li class="blockList"><a id="methods.inherited.from.class.java.lang.Object"> |
| <!-- --> |
| </a> |
| <h3>Methods inherited from class java.lang.Object</h3> |
| <code>clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</code></li> |
| </ul> |
| </li> |
| </ul> |
| </section> |
| </li> |
| </ul> |
| </div> |
| <div class="details"> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <!-- ========= CONSTRUCTOR DETAIL ======== --> |
| <section role="region"> |
| <ul class="blockList"> |
| <li class="blockList"><a id="constructor.detail"> |
| <!-- --> |
| </a> |
| <h3>Constructor Detail</h3> |
| <a id="<init>()"> |
| <!-- --> |
| </a> |
| <ul class="blockListLast"> |
| <li class="blockList"> |
| <h4>BinarySearch</h4> |
| <pre>protected BinarySearch()</pre> |
| </li> |
| </ul> |
| </li> |
| </ul> |
| </section> |
| <!-- ============ METHOD DETAIL ========== --> |
| <section role="region"> |
| <ul class="blockList"> |
| <li class="blockList"><a id="method.detail"> |
| <!-- --> |
| </a> |
| <h3>Method Detail</h3> |
| <a id="lowerBound(java.lang.Object[],java.lang.Object,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="lowerBound(T[],T,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>lowerBound</h4> |
| <pre class="methodSignature">public static <T> int lowerBound​(T[] a, |
| T key, |
| java.util.Comparator<T> comparator)</pre> |
| <div class="block">Performs binary search of the lower bound in the given array. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the minimal index of the element that is |
| greater or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>minimal index of the element that is |
| greater or equal to the given key. Returns -1 when all elements exceed |
| the given key or the array is empty. Returns <code>a.length</code> when all |
| elements are less than the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="upperBound(java.lang.Object[],java.lang.Object,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="upperBound(T[],T,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>upperBound</h4> |
| <pre class="methodSignature">public static <T> int upperBound​(T[] a, |
| T key, |
| java.util.Comparator<T> comparator)</pre> |
| <div class="block">Performs binary search of the upper bound in the given array. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the maximal index of the element that is |
| less or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>maximal index of the element that is |
| less or equal to the given key. Returns -1 when all elements are less |
| than the given key or the array is empty. Returns <code>a.length</code> when |
| all elements exceed the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="lowerBound(java.lang.Object[],java.lang.Object,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="lowerBound(T[],K,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>lowerBound</h4> |
| <pre class="methodSignature">public static <T,​K> int lowerBound​(T[] a, |
| K key, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</pre> |
| <div class="block">Performs binary search of the lower bound in the given array. |
| The elements in the array are transformed before the comparison. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the minimal index of the element that is |
| greater or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dd><code>K</code> - the type of lookup key</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>keySelector</code> - function that transforms array contents to the type |
| of the key</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>minimal index of the element that is |
| greater or equal to the given key. Returns -1 when all elements exceed |
| the given key or the array is empty. Returns <code>a.length</code> when all |
| elements are less than the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="upperBound(java.lang.Object[],java.lang.Object,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="upperBound(T[],K,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>upperBound</h4> |
| <pre class="methodSignature">public static <T,​K> int upperBound​(T[] a, |
| K key, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</pre> |
| <div class="block">Performs binary search of the upper bound in the given array. |
| The elements in the array are transformed before the comparison. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the maximal index of the element that is |
| less or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dd><code>K</code> - the type of lookup key</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>keySelector</code> - function that transforms array contents to the type |
| of the key</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>maximal index of the element that is |
| less or equal to the given key. Returns -1 when all elements are less |
| than the given key or the array is empty. Returns <code>a.length</code> when |
| all elements exceed the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="lowerBound(java.lang.Object[],java.lang.Object,int,int,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="lowerBound(T[],T,int,int,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>lowerBound</h4> |
| <pre class="methodSignature">public static <T> int lowerBound​(T[] a, |
| T key, |
| int imin, |
| int imax, |
| java.util.Comparator<T> comparator)</pre> |
| <div class="block">Performs binary search of the lower bound in the given section of array. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the minimal index of the element that is |
| greater or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>imin</code> - the minimal index (inclusive) to look for</dd> |
| <dd><code>imax</code> - the maximum index (inclusive) to look for</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>minimal index of the element that is |
| greater or equal to the given key. Returns -1 when all elements exceed |
| the given key or the array is empty. Returns <code>a.length</code> when all |
| elements are less than the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="upperBound(java.lang.Object[],java.lang.Object,int,int,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="upperBound(T[],T,int,int,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>upperBound</h4> |
| <pre class="methodSignature">public static <T> int upperBound​(T[] a, |
| T key, |
| int imin, |
| int imax, |
| java.util.Comparator<T> comparator)</pre> |
| <div class="block">Performs binary search of the upper bound in the given array. |
| It is assumed that the array is sorted. |
| The method is guaranteed to return the maximal index of the element that is |
| less or equal to the given key.</div> |
| <dl> |
| <dt><span class="paramLabel">Type Parameters:</span></dt> |
| <dd><code>T</code> - the type of elements in array</dd> |
| <dt><span class="paramLabel">Parameters:</span></dt> |
| <dd><code>a</code> - array that holds the values</dd> |
| <dd><code>key</code> - element to look for</dd> |
| <dd><code>imin</code> - the minimal index (inclusive) to look for</dd> |
| <dd><code>imax</code> - the maximum index (inclusive) to look for</dd> |
| <dd><code>comparator</code> - comparator that compares keys</dd> |
| <dt><span class="returnLabel">Returns:</span></dt> |
| <dd>maximal index of the element that is |
| less or equal to the given key. Returns -1 when all elements are less |
| than the given key or the array is empty. Returns <code>a.length</code> when |
| all elements exceed the given key.</dd> |
| </dl> |
| </li> |
| </ul> |
| <a id="lowerBound(java.lang.Object[],java.lang.Object,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="lowerBound(T[],K,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockList"> |
| <li class="blockList"> |
| <h4>lowerBound</h4> |
| <pre class="methodSignature">public static <T,​K> int lowerBound​(T[] a, |
| K key, |
| int imin, |
| int imax, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</pre> |
| <div class="block">Taken from http://en.wikipedia.org/wiki/Binary_search_algorithm |
| #Deferred_detection_of_equality</div> |
| </li> |
| </ul> |
| <a id="upperBound(java.lang.Object[],java.lang.Object,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a><a id="upperBound(T[],K,int,int,org.apache.calcite.linq4j.function.Function1,java.util.Comparator)"> |
| <!-- --> |
| </a> |
| <ul class="blockListLast"> |
| <li class="blockList"> |
| <h4>upperBound</h4> |
| <pre class="methodSignature">public static <T,​K> int upperBound​(T[] a, |
| K key, |
| int imin, |
| int imax, |
| <a href="../linq4j/function/Function1.html" title="interface in org.apache.calcite.linq4j.function">Function1</a><T,​K> keySelector, |
| java.util.Comparator<K> comparator)</pre> |
| <div class="block">Taken from http://en.wikipedia.org/wiki/Binary_search_algorithm |
| #Deferred_detection_of_equality |
| Adapted to find upper bound.</div> |
| </li> |
| </ul> |
| </li> |
| </ul> |
| </section> |
| </li> |
| </ul> |
| </div> |
| </div> |
| </main> |
| <!-- ========= END OF CLASS DATA ========= --> |
| <footer role="contentinfo"> |
| <nav role="navigation"> |
| <!-- ======= START OF BOTTOM NAVBAR ====== --> |
| <div class="bottomNav"><a id="navbar.bottom"> |
| <!-- --> |
| </a> |
| <div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div> |
| <a id="navbar.bottom.firstrow"> |
| <!-- --> |
| </a> |
| <ul class="navList" title="Navigation"> |
| <li><a href="../../../../index.html">Overview</a></li> |
| <li><a href="package-summary.html">Package</a></li> |
| <li class="navBarCell1Rev">Class</li> |
| <li><a href="class-use/BinarySearch.html">Use</a></li> |
| <li><a href="package-tree.html">Tree</a></li> |
| <li><a href="../../../../deprecated-list.html">Deprecated</a></li> |
| <li><a href="../../../../index-all.html">Index</a></li> |
| <li><a href="../../../../help-doc.html">Help</a></li> |
| </ul> |
| </div> |
| <div class="subNav"> |
| <ul class="navList" id="allclasses_navbar_bottom"> |
| <li><a href="../../../../allclasses.html">All Classes</a></li> |
| </ul> |
| <div> |
| <script type="text/javascript"><!-- |
| allClassesLink = document.getElementById("allclasses_navbar_bottom"); |
| if(window==top) { |
| allClassesLink.style.display = "block"; |
| } |
| else { |
| allClassesLink.style.display = "none"; |
| } |
| //--> |
| </script> |
| <noscript> |
| <div>JavaScript is disabled on your browser.</div> |
| </noscript> |
| </div> |
| <div> |
| <ul class="subNavList"> |
| <li>Summary: </li> |
| <li>Nested | </li> |
| <li>Field | </li> |
| <li><a href="#constructor.summary">Constr</a> | </li> |
| <li><a href="#method.summary">Method</a></li> |
| </ul> |
| <ul class="subNavList"> |
| <li>Detail: </li> |
| <li>Field | </li> |
| <li><a href="#constructor.detail">Constr</a> | </li> |
| <li><a href="#method.detail">Method</a></li> |
| </ul> |
| </div> |
| <a id="skip.navbar.bottom"> |
| <!-- --> |
| </a></div> |
| <!-- ======== END OF BOTTOM NAVBAR ======= --> |
| </nav> |
| <p class="legalCopy"><small>Copyright © 2012–2019 <a href="https://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.</small></p> |
| </footer> |
| </body> |
| </html> |
