Use the new value if it is the most competitive.

Author: iverase

server/src/main/java/org/elasticsearch/index/codec/vectors/cluster/NeighborQueue.java

@@ -142,9 +142,16 @@ public long popRaw() {
         return heap.pop();
     }
 
-    /** Removes the top element, returns it and adds the new encoded element */
+    /**
+     * if the new element is the new top then return its node id. Otherwise,
+     * removes the current top element, returns its node id and adds the new element
+     * to the queue.
+     * */
     public int popAndAddRaw(long raw) {
         long top = heap.top();
+        if (raw < top) {
+            return decodeNodeId(raw);
+        }
         heap.updateTop(raw);
         return decodeNodeId(top);
     }