size = 0;
    distinctElements = 0;
  }

  abstract class Itr<T> implements Iterator<T> {
    int index = 0;
    int toRemove = -1;

    abstract T output(int index);

    @Override
    public boolean hasNext() {
      for (; index < enumConstants.length; index++) {
        if (counts[index] > 0) {
          return true;
        }
      }
      return false;
    }

    @Override

    for (int i = 0; i < reps; i++) {
      for (int index = 0; index < size; index++) {
        sum += array[index].hashCode();
      }
    }
    return sum;
  }

  @Benchmark
  int arrayIndexedLength(int reps) {
    int sum = 0;
    for (int i = 0; i < reps; i++) {
      for (int index = 0; index < array.length; index++) {
        sum += array[index].hashCode();
      }
    }
    return sum;
  }

            if (logger.isDebugEnabled()) {
                logger.debug("Failed to create suggest index: index={}", index, e);
            }
            throw new SuggesterException("Failed to create suggest index: " + index, e);
        }
    }

    /**
     * Creates a new index and replaces the current update alias with the new index.
     */
    public void createNextIndex() {
        try {

                                final String index = indexObj.get("_index");
                                if (index != null) {
                                    if (index.startsWith(".fess")) {
                                        indexObj.put("_index", index.substring(1));
                                    }
                                    if (index.endsWith("scheduled_job")) {

          <item index="5" class="java.lang.String" itemvalue="io.reactivex.annotations.Nullable" />
          <item index="6" class="java.lang.String" itemvalue="io.reactivex.rxjava3.annotations.Nullable" />
          <item index="7" class="java.lang.String" itemvalue="jakarta.annotation.Nullable" />

    // Search for misses.
    assertEquals(-1, binarySearch(0, 6) { index -> 0.compareTo(table[index]) })
    assertEquals(-2, binarySearch(0, 6) { index -> 2.compareTo(table[index]) })
    assertEquals(-3, binarySearch(0, 6) { index -> 4.compareTo(table[index]) })
    assertEquals(-4, binarySearch(0, 6) { index -> 6.compareTo(table[index]) })
    assertEquals(-5, binarySearch(0, 6) { index -> 8.compareTo(table[index]) })

	g := errgroup.WithNErrs(len(sys.peerClients))
	for index, client := range sys.peerClients {
		if client == nil {
			continue
		}
		index := index
		g.Go(func() error {
			var err error
			reply[index], err = sys.peerClients[index].GetCPUs(ctx)
			return err
		}, index)
	}

	for index, err := range g.Wait() {
		if err != nil {
			sys.addNodeErr(&reply[index], sys.peerClients[index], err)
		}
	}

        }
        return value;
    }

    /**
     * Creates a new index with default settings.
     *
     * @param index     the index configuration name
     * @param indexName the actual index name to create
     * @return true if the index was created successfully, false otherwise
     */
    public boolean createIndex(final String index, final String indexName) {

        return getEntryAt(index).getKey();
    }

    /**
     * Returns the {@link java.util.Map.Entry} at the specified index.
     *
     * @param index
     *            the index
     * @return the {@link java.util.Map.Entry} at the specified index
     */
    public Map.Entry<K, V> getEntryAt(final int index) {
        assertIndex(index < size, "Index:" + index + ", Size:" + size);

        return index;
    }

    /**
     * Sets the current index position in the buffer.
     *
     * @param index the new index position
     */
    public void setIndex(final int index) {
        this.index = index;
    }

    /**
     * Returns the capacity of the buffer.
     *
     * @return the buffer capacity
     */
    public int getCapacity() {
        return buf.length - start;