Skip to content
Permalink
Browse files
Fix typos: ≥ should have been ≥, etc.
  • Loading branch information
leerho committed Feb 9, 2022
1 parent 580c589 commit 719fb6ab93edd45277f47f77eb7b1f50b896f594
Showing 2 changed files with 17 additions and 17 deletions.
@@ -49,8 +49,8 @@ public enum Inequality {
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &GT; arr[high], return arr[high].<br>
* If <i>v</i> &LE; arr[low], return -1.<br>
* <p>If <i>v</i> &gt; arr[high], return arr[high].<br>
* If <i>v</i> &le; arr[low], return -1.<br>
* Else return index of A.</p>
*/
LT,
@@ -61,15 +61,15 @@ public enum Inequality {
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &GE; arr[high], return arr[high].<br>
* If <i>v</i> &LT; arr[low], return -1.<br>
* <p>If <i>v</i> &ge; arr[high], return arr[high].<br>
* If <i>v</i> &lt; arr[low], return -1.<br>
* Else return index of A.</p>
*/
LE,

/**
* <b>Equals:</b> Although not an inequality, it is included for completeness.
* An index &GE; 0 is returned unless not found, then -1 is returned.
* An index &ge; 0 is returned unless not found, then -1 is returned.
*/
EQ,

@@ -79,8 +79,8 @@ public enum Inequality {
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &LE; arr[low], return arr[low].<br>
* If <i>v</i> &GT; arr[high], return -1.<br>
* <p>If <i>v</i> &le; arr[low], return arr[low].<br>
* If <i>v</i> &gt; arr[high], return -1.<br>
* Else return index of B.</p>
*/
GE,
@@ -91,8 +91,8 @@ public enum Inequality {
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &LT; arr[low], return arr[low].<br>
* If <i>v</i> &GE; arr[high], return -1.<br>
* <p>If <i>v</i> &lt; arr[low], return arr[low].<br>
* If <i>v</i> &ge; arr[high], return -1.<br>
* Else return index of B.</p>
*/
GT
@@ -48,8 +48,8 @@ public enum InequalitySearch {
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &GT; arr[high], return arr[high].<br>
* If <i>v</i> &LE; arr[low], return -1.<br>
* <p>If <i>v</i> &gt; arr[high], return arr[high].<br>
* If <i>v</i> &le; arr[low], return -1.<br>
* Else return index of A.</p>
*/
LT { //arr[A] < V <= arr[B], return A
@@ -139,8 +139,8 @@ String desc(final long[] arr, final int low, final int high, final long v, final
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &GE; arr[high], return arr[high].<br>
* If <i>v</i> &LT; arr[low], return -1.<br>
* <p>If <i>v</i> &ge; arr[high], return arr[high].<br>
* If <i>v</i> &lt; arr[low], return -1.<br>
* Else return index of A.</p>
*/
LE { //arr[A] <= V < arr[B], return A
@@ -316,8 +316,8 @@ String desc(final long[] arr, final int low, final int high, final long v, final
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &LE; arr[low], return arr[low].<br>
* If <i>v</i> &GT; arr[high], return -1.<br>
* <p>If <i>v</i> &le; arr[low], return arr[low].<br>
* If <i>v</i> &gt; arr[high], return -1.<br>
* Else return index of B.</p>
*/
GE { //arr[A] < V <= arr[B], return B
@@ -407,8 +407,8 @@ String desc(final long[] arr, final int low, final int high, final long v, final
* Let <i>low</i> = lowest index of the lowest value in the range.<br>
* Let <i>high</i> = highest index of the highest value in the range.
*
* <p>If <i>v</i> &LT; arr[low], return arr[low].<br>
* If <i>v</i> &GE; arr[high], return -1.<br>
* <p>If <i>v</i> &lt; arr[low], return arr[low].<br>
* If <i>v</i> &ge; arr[high], return -1.<br>
* Else return index of B.</p>
*/
GT { //arr[A] <= V < arr[B], return B

0 comments on commit 719fb6a

Please sign in to comment.