You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@datasketches.apache.org by al...@apache.org on 2020/10/21 23:04:27 UTC
[incubator-datasketches-java] 02/02: spelling fixes
This is an automated email from the ASF dual-hosted git repository.
alsay pushed a commit to branch req_sketch_to_string
in repository https://gitbox.apache.org/repos/asf/incubator-datasketches-java.git
commit 77e9d462d6c3dd6ab1d89a25f2e9dc1d1e1a84eb
Author: AlexanderSaydakov <Al...@users.noreply.github.com>
AuthorDate: Wed Oct 21 16:03:19 2020 -0700
spelling fixes
---
src/main/java/org/apache/datasketches/Criteria.java | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/src/main/java/org/apache/datasketches/Criteria.java b/src/main/java/org/apache/datasketches/Criteria.java
index 1a51e21..f3f9e0f 100644
--- a/src/main/java/org/apache/datasketches/Criteria.java
+++ b/src/main/java/org/apache/datasketches/Criteria.java
@@ -62,7 +62,7 @@ package org.apache.datasketches;
public enum Criteria {
/**
- * Given an sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
+ * Given a sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
* this criterion instructs the binary search algorithm to find the highest adjacent pair of
* values <i>{A,B}</i> such that <i>A < V ≤ B</i>.
* The returned value from the binary search algorithm will be the index of <i>A</i>
@@ -125,7 +125,7 @@ public enum Criteria {
},
/**
- * Given an sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
+ * Given a sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
* this criterion instructs the binary search algorithm to find the highest adjacent pair of
* values <i>{A,B}</i> such that <i>A ≤ V < B</i>.
* The returned value from the binary search algorithm will be the index of <i>A</i>
@@ -188,7 +188,7 @@ public enum Criteria {
},
/**
- * Given an sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
+ * Given a sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
* this criterion instructs the binary search algorithm to find the adjacent pair of
* values <i>{A,B}</i> such that <i>A ≤ V ≤ B</i>.
* The returned value from the binary search algorithm will be the index of <i>A</i> or <i>B</i>,
@@ -250,7 +250,7 @@ public enum Criteria {
},
/**
- * Given an sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
+ * Given a sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
* this criterion instructs the binary search algorithm to find the lowest adjacent pair of
* values <i>{A,B}</i> such that <i>A < V ≤ B</i>.
* The returned value from the binary search algorithm will be the index of <i>B</i>
@@ -313,7 +313,7 @@ public enum Criteria {
},
/**
- * Given an sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
+ * Given a sorted array of increasing values <i>arr[]</i> and a key value <i>V</i>,
* this criterion instructs the binary search algorithm to find the lowest adjacent pair of
* values <i>{A,B}</i> such that <i>A ≤ V < B</i>.
* The returned value from the binary search algorithm will be the index of <i>B</i>
---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org