/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.lucene.facet;

import org.apache.lucene.util.PriorityQueue;

Keeps highest results, first by largest int value,
 then tie break by smallest ord. /** Keeps highest results, first by largest int value,
 *  then tie break by smallest ord. */
public class TopOrdAndIntQueue extends PriorityQueue<TopOrdAndIntQueue.OrdAndValue> {

  
Holds a single entry. /** Holds a single entry. */
  public static final class OrdAndValue {

    
Ordinal of the entry. /** Ordinal of the entry. */
    public int ord;

    
Value associated with the ordinal. /** Value associated with the ordinal. */
    public int value;

    
Default constructor. /** Default constructor. */
    public OrdAndValue() {
    }
  }

  
Sole constructor. /** Sole constructor. */
  public TopOrdAndIntQueue(int topN) {
    super(topN);
  }

  @Override
  protected boolean lessThan(OrdAndValue a, OrdAndValue b) {
    if (a.value < b.value) {
      return true;
    } else if (a.value > b.value) {
      return false;
    } else {
      return a.ord > b.ord;
    }
  }
}