Github user anew commented on a diff in the pull request:
https://github.com/apache/incubator-tephra/pull/62#discussion_r140172193
--- Diff:
tephra-hbase-compat-1.1-base/src/main/java/org/apache/tephra/hbase/txprune/InvalidListPruningDebugTool.java
---
@@ -165,10 +165,10 @@ public void destroy() throws IOException {
*/
@Override
@SuppressWarnings("WeakerAccess")
- public SortedSet<RegionPruneInfoPretty> getIdleRegions(Integer
numRegions, String time) throws IOException {
+ public List<RegionPruneInfoPretty> getIdleRegions(Integer numRegions,
String time) throws IOException {
--- End diff --
so now the result won't be sorted?
Another option is to keep the sorted set, but make the region name part of
the comparable. So that if two have the same prune bound, they still have
different sort keys but end up adjacent to each other in the result. That would
be a sorted result.
---
