class LargePriorityQueue<E> extends PriorityQueue<E> {

  private final BitSet queue;
  private long modCount = 0;

  LargePriorityQueue(List<? extends E> universe, Map<E, Integer> ordinalMap) {
    super(universe, ordinalMap);
    queue = new BitSet(N);
  }

  @Override
  boolean add(int ordinal) {
    if (contains(ordinal)) {
      return false;
    }
    queue.set(ordinal);
    min = Math.min(min, ordinal);
    modCount++;
    return true;
  }

  @Override
  void addAll() {
    queue.set(0, N);
    min = 0;
    modCount++;
  }

  @Override
  int nextSetBit(int fromIndex) {<FILL_FUNCTION_BODY>}

  @Override
  boolean remove(int ordinal) {
    if (!contains(ordinal)) {
      return false;
    }
    queue.clear(ordinal);

    if (min == ordinal) {
      min = nextSetBit(min + 1);
    }

    modCount++;
    return true;
  }

  @Override
  boolean contains(int ordinal) {
    return queue.get(ordinal);
  }

  @Override
  public Iterator<E> iterator() {
    return new Itr() {
      @Override
      long getExpected() {
        return modCount;
      }
    };
  }

  @Override
  public int size() {
    return queue.cardinality();
  }
}

    int i = queue.nextSetBit(fromIndex);
    return (i < 0) ? Integer.MAX_VALUE : i;
  
<methods>public final boolean add(E) ,public final boolean contains(java.lang.Object) ,public boolean isEmpty() ,public static PriorityQueue<E> noneOf(E[]) ,public static PriorityQueue<E> noneOf(List<? extends E>) ,public static PriorityQueue<E> noneOf(List<? extends E>, boolean) ,public static PriorityQueue<E> of(E[]) ,public static PriorityQueue<E> of(List<? extends E>) ,public static PriorityQueue<E> of(List<? extends E>, boolean) ,public final boolean offer(E) ,public final E peek() ,public final E poll() ,public final boolean remove(java.lang.Object) <variables>final non-sealed int N,private static final org.slf4j.Logger logger,int min,private final non-sealed Map<E,java.lang.Integer> ordinalMap,private final non-sealed List<? extends E> universe