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:25 UTC

[incubator-datasketches-java] branch req_sketch_to_string created (now 77e9d46)

This is an automated email from the ASF dual-hosted git repository.

alsay pushed a change to branch req_sketch_to_string
in repository https://gitbox.apache.org/repos/asf/incubator-datasketches-java.git.


      at 77e9d46  spelling fixes

This branch includes the following new commits:

     new 29ce061  added K to summary
     new 77e9d46  spelling fixes

The 2 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails.  The revisions
listed as "add" were already present in the repository and have only
been added to this reference.



---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org


[incubator-datasketches-java] 01/02: added K to summary

Posted by al...@apache.org.
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 29ce061477388ace9d3f0fab2496408be38f14f0
Author: AlexanderSaydakov <Al...@users.noreply.github.com>
AuthorDate: Wed Oct 21 16:02:58 2020 -0700

    added K to summary
---
 src/main/java/org/apache/datasketches/req/ReqSketch.java | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/main/java/org/apache/datasketches/req/ReqSketch.java b/src/main/java/org/apache/datasketches/req/ReqSketch.java
index ba42682..781cf4e 100644
--- a/src/main/java/org/apache/datasketches/req/ReqSketch.java
+++ b/src/main/java/org/apache/datasketches/req/ReqSketch.java
@@ -596,6 +596,7 @@ public class ReqSketch extends BaseReqSketch {
   public String toString() {
     final StringBuilder sb = new StringBuilder();
     sb.append("**********Relative Error Quantiles Sketch Summary**********").append(LS);
+    sb.append("  K               : " + k).append(LS);
     sb.append("  N               : " + totalN).append(LS);
     sb.append("  Retained Items  : " + retItems).append(LS);
     sb.append("  Max Nominal Size: " + maxNomSize).append(LS);


---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org


[incubator-datasketches-java] 02/02: spelling fixes

Posted by al...@apache.org.
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 &lt; V &le; 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 &le; V &lt; 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 &le; V &le; 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 &lt; V &le; 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 &le; V &lt; 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