Skip to content

Req sketch to string #336

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
AlexanderSaydakov merged 2 commits into from
Oct 22, 2020
Merged

Req sketch to string #336

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
29ce061
added K to summary
AlexanderSaydakov Oct 21, 2020
77e9d46
spelling fixes
AlexanderSaydakov Oct 21, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions src/main/java/org/apache/datasketches/Criteria.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -62,7 +62,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 &lt; V &le; B</i>.
* The returned value from the binary search algorithm will be the index of <i>A</i>
Expand Down Expand Up @@ -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 <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>
Expand Down Expand Up @@ -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 <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>,
Expand Down Expand Up @@ -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 <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>
Expand Down Expand Up @@ -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 <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>
Expand Down
1 change: 1 addition & 0 deletions src/main/java/org/apache/datasketches/req/ReqSketch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand Down