1010import org .elasticsearch .common .util .BigArrays ;
1111import org .elasticsearch .common .util .BinarySearcher ;
1212import org .elasticsearch .common .util .LongArray ;
13- import org .elasticsearch .common .util .LongHash ;
1413import org .elasticsearch .core .Releasable ;
1514import org .elasticsearch .core .Releasables ;
1615import org .elasticsearch .search .sort .SortOrder ;
@@ -28,25 +27,15 @@ public class LongTopNSet implements Releasable {
2827
2928 private final LongArray values ;
3029 private final LongBinarySearcher searcher ;
31- private final LongHash seenValues ;
3230
3331 private int count ;
3432
3533 public LongTopNSet (BigArrays bigArrays , SortOrder order , int limit ) {
3634 this .order = order ;
3735 this .limit = limit ;
3836 this .count = 0 ;
39- boolean success = false ;
40- try {
41- this .values = bigArrays .newLongArray (limit , false );
42- this .searcher = new LongBinarySearcher (values , order );
43- this .seenValues = new LongHash (limit , 0.05f , bigArrays );
44- success = true ;
45- } finally {
46- if (success == false ) {
47- close ();
48- }
49- }
37+ this .values = bigArrays .newLongArray (limit , false );
38+ this .searcher = new LongBinarySearcher (values , order );
5039 }
5140
5241 /**
@@ -69,11 +58,6 @@ public boolean collect(long value) {
6958 return true ;
7059 }
7160
72- if (seenValues .add (value ) < 0 ) {
73- // The value was already added
74- return true ;
75- }
76-
7761 int insertionIndex = this .searcher .search (0 , count - 1 , value );
7862
7963 if (insertionIndex == count - 1 ) {
@@ -184,6 +168,6 @@ private boolean betterThan(long lhs, long rhs) {
184168
185169 @ Override
186170 public final void close () {
187- Releasables .close (values , seenValues );
171+ Releasables .close (values );
188172 }
189173}
0 commit comments