From 29ce061477388ace9d3f0fab2496408be38f14f0 Mon Sep 17 00:00:00 2001 From: AlexanderSaydakov Date: Wed, 21 Oct 2020 16:02:58 -0700 Subject: [PATCH 1/2] 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 ba4268220..781cf4eb1 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 byte[] toByteArray() { 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); From 77e9d462d6c3dd6ab1d89a25f2e9dc1d1e1a84eb Mon Sep 17 00:00:00 2001 From: AlexanderSaydakov Date: Wed, 21 Oct 2020 16:03:19 -0700 Subject: [PATCH 2/2] 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 1a51e2119..f3f9e0ff8 100644 --- a/src/main/java/org/apache/datasketches/Criteria.java +++ b/src/main/java/org/apache/datasketches/Criteria.java @@ -62,7 +62,7 @@ public enum Criteria { /** - * Given an sorted array of increasing values arr[] and a key value V, + * Given a sorted array of increasing values arr[] and a key value V, * this criterion instructs the binary search algorithm to find the highest adjacent pair of * values {A,B} such that A < V ≤ B. * The returned value from the binary search algorithm will be the index of A @@ -125,7 +125,7 @@ String desc(final float[] arr, final int low, final int high, final float v, fin }, /** - * Given an sorted array of increasing values arr[] and a key value V, + * Given a sorted array of increasing values arr[] and a key value V, * this criterion instructs the binary search algorithm to find the highest adjacent pair of * values {A,B} such that A ≤ V < B. * The returned value from the binary search algorithm will be the index of A @@ -188,7 +188,7 @@ String desc(final float[] arr, final int low, final int high, final float v, fin }, /** - * Given an sorted array of increasing values arr[] and a key value V, + * Given a sorted array of increasing values arr[] and a key value V, * this criterion instructs the binary search algorithm to find the adjacent pair of * values {A,B} such that A ≤ V ≤ B. * The returned value from the binary search algorithm will be the index of A or B, @@ -250,7 +250,7 @@ String desc(final float[] arr, final int low, final int high, final float v, fin }, /** - * Given an sorted array of increasing values arr[] and a key value V, + * Given a sorted array of increasing values arr[] and a key value V, * this criterion instructs the binary search algorithm to find the lowest adjacent pair of * values {A,B} such that A < V ≤ B. * The returned value from the binary search algorithm will be the index of B @@ -313,7 +313,7 @@ String desc(final float[] arr, final int low, final int high, final float v, fin }, /** - * Given an sorted array of increasing values arr[] and a key value V, + * Given a sorted array of increasing values arr[] and a key value V, * this criterion instructs the binary search algorithm to find the lowest adjacent pair of * values {A,B} such that A ≤ V < B. * The returned value from the binary search algorithm will be the index of B